Search results for "algorithm"
showing 10 items of 4887 documents
D-stability for discrete-time t-s fuzzy descriptor systems with multiple delays
2014
In this work, the D-stability problem is considered for a class of discrete-time Takagi-Sugeno (T-S) fuzzy descriptor systems with multiple state delays. In terms of linear matrix inequality, sufficient conditions are proposed to ensure that all poles of the descriptor T-S fuzzy system are located within a disk contained in the unit circle. Moreover, a sufficient condition is presented such that the singular system is regular, causal and D-stable in spite of multiple state delays. Finally, an example is given to show the effectiveness and advantages of the proposed techniques Refereed/Peer-reviewed
Design of an image processing integrated circuit for real time edge detection
2003
Presents the design of a real time image processing micro-system to detect defects on manufacturing products. The analysis method is based on an edge detection algorithm (differential operators) to select the information related to the structure of the objects present in the image. The edge calculation function has been integrated in a standard cell circuit using a CMOS 1.5 mu m process. The ASIC has been implemented and tested in an image processing microsystem with a CCD camera. Results show an improvement of performances (speed, noise, size reduction system characterization, etc. . .) in comparison with the first prototypes (software implementation and printed board with standard compone…
The Shuffle Product: New Research Directions
2015
In this paper we survey some recent researches concerning the shuffle operation that arise both in Formal Languages and in Combinatorics on Words.
Mathematical Modeling and Parameters Estimation of Car Crash Using Eigensystem Realization Algorithm and Curve-Fitting Approaches
2013
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/262196 Open Access An eigensystem realization algorithm (ERA) approach for estimating the structural system matrices is proposed in this paper using the measurements of acceleration data available from the real crash test. A mathematical model that represents the real vehicle frontal crash scenario is presented. The model's structure is a double-spring-mass-damper system, whereby the front mass represents the vehicle-chassis and the rear mass represents the passenger compartment. The physical parameters of the model are estimated using cu…
A comparison of simplex and simulated annealing for optimization of a new rear underrun protective device
2012
In this paper, two optimization approaches to improve the product design process have been analysed. Through the analysis of a case study, concerning the designing of a new High Energy Absorption Rear Underrun Protective Device (HEARUPD), two different optimization approaches (simplex and simulated annealing) have been compared. In the implemented optimization processes, the crash between an economy car and the rear part of a truck has been simulated by dynamic numerical (FEM) analyses. Moreover, authors have proposed the use of a suitable linear function of four variables with the purpose of reducing the multi-objective optimization processes to mono-objective ones. That has been made to s…
Joint Graph Learning and Signal Recovery via Kalman Filter for Multivariate Auto-Regressive Processes
2018
In this paper, an adaptive Kalman filter algorithm is proposed for simultaneous graph topology learning and graph signal recovery from noisy time series. Each time series corresponds to one node of the graph and underlying graph edges express the causality among nodes. We assume that graph signals are generated via a multivariate auto-regressive processes (MAR), generated by an innovation noise and graph weight matrices. Then we relate the state transition matrix of Kalman filter to the graph weight matrices since both of them can play the role of signal propagation and transition. Our proposed Kalman filter for MAR processes, called KF-MAR, runs three main steps; prediction, update, and le…
The Multivariate Individual Selection of Diagnostic Tests and the Reserved Diagnostic Statement: An Optimum Combination of Two New Methods for the Co…
1984
A combination of two new methods for the diagnostic procedure in computer-aided differential diagnosis is presented. It is constructed on the basis of new results of our own in the field of mathematical decision theory and is demonstrated by the differential diagnosis of congenital heart diseases by means of ECG features.
Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
2013
This article studies the vehicle routing problem with trailers and transshipments VRPTT, a practically relevant, but challenging, generalization of the classical vehicle routing problem. The article makes three contributions: i Building on a nontrivial network representation, two mixed-integer programming formulations for the VRPTT are proposed. ii Based on these formulations, five different branch-and-cut algorithms are developed and implemented. iii The computational behavior of the algorithms is analyzed in an extensive computational study, using a large number of test instances designed to resemble real-world VRPTTs.Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 631, 119-133 20…
Probabilistic analysis of truss structures with uncertain parameters (virtual distortion method approach)
2004
A new approach for probabilistic characterization of linear elastic redundant trusses with uncertainty on the various members subjected to deterministic loads acting on the nodes of the structure is presented. The method is based on the simple observation that variations of structural parameters are equivalent to superimposed strains on a reference structure depending on the axial forces on the elastic modulus of the original structure as well as on the uncertainty (virtual distortion method approach). Superposition principle may be applied to separate contribution to mechanical response due to external loads and parameter variations. Statically determinate trusses dealt with the proposed m…
Pruning Incremental Linear Model Trees with Approximate Lookahead
2014
Incremental linear model trees with approximate lookahead are fast, but produce overly large trees. This is due to non-optimal splitting decisions boosted by a possibly unlimited number of examples obtained from a data source. To keep the processing speed high and the tree complexity low, appropriate incremental pruning techniques are needed. In this paper, we introduce a pruning technique for the class of incremental linear model trees with approximate lookahead on stationary data sources. Experimental results show that the advantage of approximate lookahead in terms of processing speed can be further improved by producing much smaller and consequently more explanatory, less memory consumi…