![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
21,125 Result(s)
-
Chapter and Conference Paper
Proving the Chinese remainder theorem by the cover set induction
An experiment of the cover sel induction principle in RRL is presented with a proof of the Chinese Remainder theorem. To the best of our knowledge, this is the first machine proof of the theorem. The proof itself...
-
Chapter and Conference Paper
Bifurcating Neurones
The rich behavior of neurons — resting states, regular repetitive discharges, patterned discharges and bursts, and irregular discharges are identified with qualitatively different solutions of differential sys...
-
Chapter and Conference Paper
A Modified Learning Algorithm for Backpropagation Network
A modified backpropagation (MBP) algorithm is proposed in this paper. The MBP algorithm is based on the idea that both the error Ep and its change ΔEP can be applied as information to update weights. It can be se...
-
Chapter and Conference Paper
Stability Conditions for Nonlinear Continuous Random Neural Networks
In this paper nonlinear conctinuous random nearal networks with asymmetric connection weights are considered. Some sufficient conditions for a given network to have a globally asymptotically stability equilibr...
-
Chapter and Conference Paper
Proving group isomorphism theorems
We report the first computer proof of the three isomorphism theorems in group theory. The first theorem, the easiest of the three, was considered by Larry Wos as one of challenging problems for theorem provers...
-
Chapter and Conference Paper
Implementing contextual rewriting
Contextual rewriting as a generalization of conditional rewriting has been studied in different forms. We show that contextual rewriting is a powerful simplification rule for the first-order theorem proving wi...
-
Chapter and Conference Paper
On efficient reasoning with implication constraints
In this paper, we address the complexity issue of reasoning with implication constraints. We consider the problem of deciding whether a conjunctive yes/no-query always produces the empty relation (“no” answer)...
-
Chapter and Conference Paper
A case study of completion modulo distributivity and Abelian groups
We propose an approach for building equational theories with the objective of improving the performance of the completion procedure, even though there exist canonical rewrite systems for these theories. As a t...
-
Chapter and Conference Paper
Robust recovery of the epipolar geometry for an uncalibrated stereo rig
This paper addresses the problem of accurately and automatically recovering the epipolar geometry from an uncalibrated stereo rig and its application to the image matching problem. A robust correlation based a...
-
Chapter and Conference Paper
Specification and verification of constraint-based dynamic systems
Constraint satisfaction can be seen as a dynamic process that approaches the solution set of the given constraints asymptotically
-
Chapter and Conference Paper
A data-driven approach to feature construction
This paper presents a general scheme for feature construction and its application to decision trees. In this scheme, a higher level attribute is constructed from two lower level ones under the guidance of the ...
-
Chapter and Conference Paper
Image Representation Using Affine Covariant Coordinates
To achieve affine-invariant image representation and shape recognition, one must rely on a set of affine covariant image coordinates. It is proposed that such coordinates be derived from the second derivatives...
-
Chapter and Conference Paper
A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming
In this paper we put forward a neural network model for quadratic programming problems with simple upper and lower bounds and analyze the properties of solutions obtained by the model. It is shown that linear ...
-
Chapter and Conference Paper
Unnesting Fuzzy SQL Queries in Fuzzy Databases
The efficiency of processing fuzzy queries in fuzzy databases is a major concern. We provide techniques to unnest fuzzy queries (of two blocks) of type N, type J, type JA, and nested queries with quantifiers. ...
-
Chapter and Conference Paper
Selecting a Critical Subset of Given Examples during Learning
The quality of training examples is one of the most important factors for effective and efficient training of neural networks, provided the network architecture and the weight modification rule are fixed. Earl...
-
Chapter and Conference Paper
Application of Neural Network and Fuzzy Logic in Modelling and Control of Fermentation Processes
The purpose of this paper is to investigate the use of neural networks and fuzzy logic in the modelling and control of an industrial fed-batch fermentation process. The reason why we choose neural networks and...
-
Chapter and Conference Paper
Problems on the generation of finite models
Recently, the subject of model generation has received much attention. By model generation we mean the automated generation of finite models of a given set of logical formulas. In this note, we present some probl...
-
Chapter and Conference Paper
Minimizing decision table sizes in influence diagrams: dimension shrinking
One goal in evaluating an influence diagram is to compute an optimal decision table for each decision node. More often than not, one is able to shrink the sizes of some of the optimal decision tables without a...
-
Chapter and Conference Paper
Mechanizing a programming logic for the concurrent programming language microSR in HOL
This paper presents our current effort to formally derive, using HOL, a sound Hoare logic for the concurrent programming language microSR, a derivative of SR. Our methodology is built on Gordon's work on mecha...
-
Chapter and Conference Paper
On the choice of penalty term in generalized FPE criterion
In variable selection, many existing selection criteria are closely related to the generalized final prediction error (FPE) criterion. In the linear regression context, the FPE criterion amounts to minimizing C(k