45978330
Two sufficient conditions for a graph to be type 1
39858986
On the Connectivity of (4;g)-Cages
17919993
A Note on the Edge-Connectivity of Cages
A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the smallest possible number of vertices. In this paper we prove that (k; g)cages are k-edge-connected if k ≥ 3 and g is odd.
6202424
On cages with given degree sets
Abstract We consider the problem of constructing minimal graphs of given girth having a particular degree set.
41563247
Analytical design of digital nonrecursive maximally flat fractional Hilbert transformer
Recently, a generalization of the Hilbert transformer, the fractional Hilbert transformer, was defined and developed. In this paper, we propose a design of the FIR filter to realize the fractional Hilbert transformer based on the maximally flat approach. The impulse response is obtained explicitly. An efficient realization structure is constructed according to some properties of the impulse response.
5778703
Belief Revision in Probability Theory
In a probability-based reasoning system, Bayes' theorem and its variations are often used to revise the system's beliefs. However, if the explicit conditions and the implicit conditions of probability assignments are properly distinguished, it follows that Bayes' theorem is not a generally applicable revision rule. Upon properly distinguishing belief revision from belief updating, we see that Jeffrey's rule and its variations are not revision rules, either. Without these distinctions, the limitation of the Bayesian approach is often ignored or underestimated. Revision, in its general form, cannot be done in the Bayesian approach, because a probability distribution function alone does not contain the information needed by the operation.
1532988
Symbolic Computation and Parallel Software
Two aspects of parallelism as related to symbolic computing are presented: (1) the implementation of parallel programs for the factorization of polynomials, and (2) the automatic derivation and generation of parallel codes for finite element analysis. The former illustrates the use of parallel programming to speed up symbolic manipulation. The latter shows how symbolic systems can help create parallel software for scientific computation. Through these two case studies, the promise of parallelism in symbolic computation is demonstrated.
10322452
SUI: a system independent user interface for an integrated scientific computing environment
The design and implementation of a Scientific User Interface is presented. Written in the C language, SUI is a window-menu-mouse oriented graphical user interface that is designed to provide a modern and integrated computing environment for scientific work. SUI can serve multiple client systems in parallel including symbolic, numeric, graphics and document formatting systems. SUI achieves hardware and operating system independence as well as network transparency by employing the X11 protocols and achieves client system independence by defining a client-SUI protocol that is simple and effective. Features of SUI includes input editing, history, 2-D mathematical expression display, interactive selection of subexpressions, interactive display and manipulation of 2-D and 3-D plots of mathematical functions, cut and paste with syntax translation, command templates, incremental 2-D display of mathematical input, and interactive configuration. A prototype system demonstration is planned for ISSAC'90
10740837
A logic of categorization
The reasoning system known as NARS constitutes a model of categorization. NARS is designed to be an adaptive system that works under the constraint of insufficient knowledge and resources. It consists of a categorical language, an experience-grounded semantics, a set of syllogistic inference rules, a dynamic memory structure, and a control mechanism that manages asynchronized parallel inference. In the system, reasoning and categorization are two aspects of the same underlying process. As a model of categorization, NARS unifies several existing theories.