Conference

# Computer Aided Systems Theory

About: Computer Aided Systems Theory is an academic conference. The conference publishes majorly in the area(s): Evolutionary algorithm & Optimization problem. Over the lifetime, 1421 publication(s) have been published by the conference receiving 5516 citation(s).

Topics: Evolutionary algorithm, Optimization problem, Metaheuristic, Artificial neural network, Systems theory

##### Papers published on a yearly basis

##### Papers

More filters

••

15 Apr 1991TL;DR: The main duality theorem of this paper establishes a categorical duality between these multidimensional systems and finitely generated modules over the polynomial algebra in r indeterminates by making use of deep results in the areas of partial differential equations, several complex variables and algebra.

Abstract: A continuous resp. discrete r-dimensional (r≥1) system is the solution space of a system of linear partial differential resp. difference equations with constant coefficients for a vector of functions or distributions in r variables resp. of r-fold indexed sequences. Although such linear systems, both multidimensional and multivariable, have been used and studied in analysis and algebra for a long time, for instance by Ehrenpreis et al. thirty years ago, these systems have only recently been recognized as objects of special significance for system theory and for technical applications. Their introduction in this context in the discrete one-dimensional (r=1) case is due to J. C. Willems. The main duality theorem of this paper establishes a categorical duality between these multidimensional systems and finitely generated modules over the polynomial algebra in r indeterminates by making use of deep results in the areas of partial differential equations, several complex variables and algebra. This duality theorem makes many notions and theorems from algebra available for system theoretic considerations. This strategy is pursued here in several directions and is similar to the use of polynomial algebra in the standard one-dimensional theory, but mathematically more difficult. The following subjects are treated: input-output structures of systems and their transfer matrix, signal flow spaces and graphs of systems and block diagrams, transfer equivalence and (minimal) realizations, controllability and observability, rank singularities and their connection with the integral respresentation theorem, invertible systems, the constructive solution of the Cauchy problem and convolutional transfer operators for discrete systems. Several constructions on the basis of the Grobner basis algorithms are executed. The connections with other approaches to multidimensional systems are established as far as possible (to the author).

122 citations

••

24 Feb 2003TL;DR: It is demonstrated that when the low-dimensional space is the RGB color space, this can be used to visualize fiber traces in a way which enhances the perception of fiber bundles and connectivity in the human brain.

Abstract: We propose a novel post processing method for visualization of fiber traces from DT-MRI data. Using a recently proposed non-linear dimensionality reduction technique, Laplacian eigenmaps [3], we create a mapping from a set of fiber traces to a low dimensional Euclidean space. Laplacian eigenmaps constructs this mapping so that similar traces are mapped to similar points, given a custom made pairwise similarity measure for fiber traces. We demonstrate that when the low-dimensional space is the RGB color space, this can be used to visualize fiber traces in a way which enhances the perception of fiber bundles and connectivity in the human brain.

115 citations

••

07 Feb 2005TL;DR: A web usage mining project which has been initiated in University of Cantabria is outlined to develop tools which let it improve its Web-based learning environment in two main aspects: the first that the teacher obtains information which allows him to evaluate the learning process and the second that the student feels supported in this task.

Abstract: Despite the great success of data mining being applied for personalization in web environments, it has not yet been massively applied in the e-learning domains. In this paper, we outline a web usage mining project which has been initiated in University of Cantabria. The aim of this project is to develop tools which let us improve its Web-based learning environment in two main aspects: the first that the teacher obtains information which allows him to evaluate the learning process and the second that the student feels supported in this task.

75 citations

••

19 Feb 2001

TL;DR: The concept of Grobner bases is developed by studying uniquenss of polynomial division ("reduction") and the crucial notion of S-polynomials is introduced, leading to the complete algorithmic solution of the construction problem.

Abstract: In this paper, we give a brief overview on Grobner bases theory, addressed to novices without prior knowledge in the field. After explaining the general strategy for solving problems via the Grobner approach, we develop the concept of Grobner bases by studying uniquenss of polynomial division ("reduction"). For explicitly constructing Grobner bases, the crucial notion of S-polynomials is introduced, leading to the complete algorithmic solution of the construction problem. The algorithm is applied to examples from polynomial equation solving and algebraic relations. After a short discussion of complexity issues, we conclude the paper with some historical remarks and references.

69 citations

••

07 Feb 2005TL;DR: A system for real-time traffic sign detection that uses restricted Hough transform for circumferences in order to detect circular signs, and for straight lines for triangular ones, is described in this paper.

Abstract: A system for real-time traffic sign detection is described in this paper. The system uses restricted Hough transform for circumferences in order to detect circular signs, and for straight lines for triangular ones. Some results obtained from a set of real road images captured under both normal and adverse weather conditions are presented as well in order to illustrate the robustness of the detection system. The average processing time is 30 ms per frame, what makes the system a good approach to work in real time conditions.

52 citations