Search results for " Complexity"
showing 10 items of 623 documents
Computation of the Multivariate Oja Median
2003
The multivariate Oja median (Oja, 1983) is an affine equivariant multivariate location estimate with high efficiency. This estimate has a bounded influence function but zero breakdown. The computation of the estimate appears to be highly intensive. We consider different, exact and stochastic, algorithms for the calculation of the value of the estimate. In the stochastic algorithms, the gradient of the objective function, the rank function, is estimated by sampling observation. hyperplanes. The estimated rank function with its estimated accuracy then yields a confidence region for the true sample Oja median, and the confidence region shrinks to the sample median with the increasing number of…
Multivariate Frequency Domain Analysis of Causal Interactions in Physiological Time Series
2011
A common way of obtaining information about a physiological system is to measure one or more signals from the system, consider their temporal evolution in the form of numerical time series, and obtain quantitative indexes through the application of time series analysis techniques. While historical approaches to time series analysis were addressed to the study of single signals, recent advances have made it possible to study collectively the behavior of several signals measured simultaneously from the considered system. In fact, multivariate (MV) time series analysis is nowadays extensively used to characterize interdependencies among multiple signals collected from dynamical physiological s…
Complexity of operations on cofinite languages
2010
International audience; We study the worst case complexity of regular operation on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the resulting minimal automata.
Robust adaptive algorithm with low computational cost
2006
An adaptive algorithm, which is robust to impulsive noise, is proposed. The cost function underlying this algorithm contains a parameter that controls the immunity to impulsive noise and can be easily adapted. Moreover, weight updating involves a nonlinear function, which recently has been shown to have an efficient hardware implementation. The proposed adaptive algorithm has been successfully tested in terms of accuracy and convergence on a system-identification simulation.
LCRT: A ToA Based Mobile Terminal Localization Algorithm in NLOS Environment
2009
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Article also available from publisher: http://dx.doi.org/10.1109/VETECS.2009.5073644 Non line-of-sight (NLOS) propagation in range measurement is a key problem for mobile terminal localization. This paper proposes a low computational residual test (LCRT) algorithm that can identify the number of line-of-sight (LOS) transmissions and reduce the computational com…
Identification of Spatial-Temporal Muscle Synergies from EMG Epochs of Various Durations: A Time-Warped Tensor Decomposition
2018
Extraction of muscle synergies from electromyography (EMG) recordings relies on the analysis of multi-trial muscle activation data. To identify the underlying modular structure, dimensionality reduction algorithms are usually applied to the EMG signals. This process requires a rigid alignment of muscle activity across trials that is typically achieved by the normalization of the length of each trial. However, this time-normalization ignores important temporal variability that is present on single trials as result of neuromechanical processes or task demands. To overcome this limitation, we propose a novel method that simultaneously aligns muscle activity data and extracts spatial and tempor…
Comparison between Entropy and Resilience as Indirect Measures of Reliability in the Framework of Water Distribution Network Design
2014
Abstract The aim of this paper is to investigate which between the entropy and resilience indices represents a better indirect measure of reliability in the framework of water distribution network design. The methodology adopted consisted of (a) multi-objective optimizations performed in order to minimize costs and maximize reliability, expressed by means of one of the indirect indices at time; (b) retrospective performance assessment of the solutions of Pareto fronts obtained. Two case studies of different topological complexity were considered. Results showed that indices based on energetic concepts (resilience and modified resilience) represent a better compact estimate of reliability th…
Greedy and K-Greedy algoritmhs for multidimensional data association
2011
[EN] The multidimensional assignment (MDA) problem is a combinatorial optimization problem arising in many applications, for instance multitarget tracking (MTT). The objective of an MDA problem of dimension $d\in\Bbb{N}$ is to match groups of $d$ objects in such a way that each measurement is associated with at most one track and each track is associated with at most one measurement from each list, optimizing a certain objective function. It is well known that the MDA problem is NP-hard for $d\geq3$. In this paper five new polynomial time heuristics to solve the MDA problem arising in MTT are presented. They are all based on the semi-greedy approach introduced in earlier research. Experimen…
Generalized person-by-person optimization in team problems with binary decisions
2008
In this paper, we extend the notion of person by person optimization to binary decision spaces. The novelty of our approach is the adaptation to a dynamic team context of notions borrowed from the pseudo-boolean optimization field as completely local-global or unimodal functions and sub- modularity. We also generalize the concept of pbp optimization to the case where the decision makers (DMs) make decisions sequentially in groups of m, we call it mbm optimization. The main contribution are certain sufficient conditions, verifiable in polynomial time, under which a pbp or an mbm optimization algorithm leads to the team-optimum. We also show that there exists a subclass of sub-modular team pr…
Probabilistic Fuzzy Approach to Evaluation of Logistics Service Effectiveness
2014
Received: 9 September 2014 Abstract Accepted: 11 October 2014 Logistics service providers offer a whole or partial logistics business service over a certain time period. Between such companies, the effectiveness of specific logistics services can vary. Logistics service providers seek the effective performance of logistics service. The purpose of this paper is to present a new approach for the evaluation of logistics service effectiveness, along with a specific computer system implementing the proposed approach – a sophisticated inference system, an extension of the Mamdani probabilistic fuzzy system. The paper presents specific knowledge concerning the relationships between effectiveness i…