Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Information Theory (14)
- Probabilistic graphical modeling (14)
- Reconstructability Analysis (14)
- Data mining (13)
- Multivariate analysis discrete multivariate modeling (13)
-
- System theory (4)
- Information theory (3)
- Multivariate analysis (3)
- Neural networks -- Structure (3)
- Fourier transformations (2)
- Neural networks (Computer science) (2)
- Pattern recognition (2)
- Anomaly (1)
- Autocorrelation (Statistics) (1)
- Bisection method (1)
- CSP (1)
- Category theory (1)
- Classification (1)
- Complexity (1)
- Computer Science (1)
- Computer Vision (1)
- Conflict management (1)
- Cost of medical care -- Models (1)
- Data Mining (1)
- Data structures (Statistics) (1)
- Decision analysis (1)
- Decision trees -- Mathematical models (1)
- Decomposition method (1)
- Digital twin (1)
- Dilution (1)
- Publication Year
- Publication
- Publication Type
Articles 31 - 32 of 32
Full-Text Articles in Systems Architecture
On Matching Ann Structure To Problem Domain Structure, George G. Lendaris, Martin Zwick, Karl Mathia
On Matching Ann Structure To Problem Domain Structure, George G. Lendaris, Martin Zwick, Karl Mathia
Complex Systems Faculty Publications and Presentations
To achieve reduced training time and improved generalization with artificial neural networks (ANN, or NN), it is important to use a reduced complexity NN structure. A "problem" is defined by constraints among the variables describing it. If knowledge about these constraints could be obtained a priori, this could be used to reduce the complexity of the ANN before training it. Systems theory literature contains methods for determining and representing structural aspects of constrained data (these methods are herein called GSM, general systems method). The suggestion here is to use the GSM model of the given data as a pattern for …
A Root Finding Algorithm For Parallel Architecture Machines, Stuti Moitra
A Root Finding Algorithm For Parallel Architecture Machines, Stuti Moitra
Computer Science Theses & Dissertations
In this thesis a parallel algorithm for determining the zeros of any given analytic function is described. Parallelism is achieved by modifying the traditional bisection algorithm for architecture machines.
Given any user supplied function f(X), continuous on the interval Ao ≤ x ≤ B0, and the tolerance of accuracy an algorithm of determining up to ten roots, with error of approximation less than or equal to tolerance, on parallel systems like Distributed Array Processor (OAP) and N-cube is considered.
A variation of the bisection method has been adapted for this purpose. At each level of iteration a …