The non-negative matrix factorization algorithm (NMF) decomposes a data matrix into a set of non-negative basis vectors, each scaled by a coefficient. In its original formulation, the NMF assumes the data samples and ...
详细信息
ISBN:
(纸本)9781424492695
The non-negative matrix factorization algorithm (NMF) decomposes a data matrix into a set of non-negative basis vectors, each scaled by a coefficient. In its original formulation, the NMF assumes the data samples and dimensions to be independently distributed, making it a less-than-ideal algorithm for the analysis of time series data with temporal correlations. Here, we seek to derive an NMF that accounts for temporal dependencies in the data by explicitly incorporating a very simple temporal constraint for the coefficients into the NMF update rules. We applied the modified algorithm to 2 multi-dimensional electromyographic data sets collected from the human upper-limb to identify muscle synergies. We found that because it reduced the number of free parameters in the model, our modified NMF made it possible to use the Akaike Information Criterion to objectively identify a model order (i.e., the number of muscle synergies composing the data) that is more functionally interpretable, and closer to the numbers previously determined using ad hoc measures.
In this paper, a robust adaptive algorithm for active noise and vibration control applications is proposed and the robust stability of the algorithm is analyzed using a combination of the small gain theorem and Popov&...
详细信息
ISBN:
(纸本)9781612848006
In this paper, a robust adaptive algorithm for active noise and vibration control applications is proposed and the robust stability of the algorithm is analyzed using a combination of the small gain theorem and Popov's hyper-stability theorem. The algorithm is developed based on the so-called Filtered-x RLS algorithm in the modified form. In design and analysis of the algorithm, it is assumed that the estimated model of the secondary path is associated with a set of uncertainties of additive structure;and sufficient conditions for stability of the algorithm are derived. In fact, by introducing a stabilizing filter, the aim is to design this filter in a way that the achieved sufficient conditions for robust stability are satisfied. The employed method is to transform the proposed control structure to an equivalent output error identification problem, and then formulate the governing adaptive algorithm in a way that is representable as a feedback control problem. In view of this approach, sufficient conditions for robust stability of the adaptive algorithm will be equivalent to find the conditions for the stability of the established feedback control system. The technique applied here to this end is established on the energy conservation relation that is valid for the general data models in adaptive filters.
This paper describes an application of computer vision techniques to road *** could detect and track vehicles in real traffic scenes to generate meaningful traffic parameters as well as new metrics suitable for improv...
详细信息
ISBN:
(纸本)9781457702686
This paper describes an application of computer vision techniques to road *** could detect and track vehicles in real traffic scenes to generate meaningful traffic parameters as well as new metrics suitable for improved automated *** paper adopts spatial-temporal connection method to detect the *** use background subtraction based on Gaussian mixture modelling to extract the foreground,next update the foreground by spatial *** results and analysis of the algorithm are presented in this paper.
For multicast security routing in optical network, through the adoption of maximum light path attack radius MaxLAR criterion, Combined with the advantages of the immune algorithm and artificial fish algorithm, this pa...
详细信息
ISBN:
(纸本)9781510802704
For multicast security routing in optical network, through the adoption of maximum light path attack radius MaxLAR criterion, Combined with the advantages of the immune algorithm and artificial fish algorithm, this paper proposes a new attack-aware routing algorithm based on immune artificial fish swarm optimization in optical networks. The algorithm can find out the smallest light path attack radius in light paths under the given condition, can enhance the capacity of optical network attack prevention, can reduce the light damage by the potential physical-layer attacks. Through algorithmanalysis, we can show that the algorithm is feasible, and have achieved good performance.
In this paper, we consider a cellular/infostation integrated network which supports on-demand data service delivery over a wireless link to users in a high-speed train. For the requests with different lifetimes and pr...
详细信息
ISBN:
(纸本)9781479913510
In this paper, we consider a cellular/infostation integrated network which supports on-demand data service delivery over a wireless link to users in a high-speed train. For the requests with different lifetimes and prices that they are willing to pay, we develop the optimal packet schedule that aims at earning the maximum revenue. To this end, we formulate the problem as an integer linear program (ILP) which is in general NP-hard. However, by exploring the special structure of the formulated ILP, we show that this problem can be turned into a P problem that admits efficient solvers. Specifically, we propose a novel Checker algorithm and prove that this algorithm is guaranteed to find the offline optimal schedule for the intended problem in polynomial time, when the number of total requests is proportional to the length of the total transmission time span. Based on the relevant insights, a class of efficient online Checker algorithms are then developed to approach the optimal schedule when a-priori knowledge of service demands and/or wireless channel capacities is not available in practical systems. It is shown that these online algorithms have a competitive ratio of 1/2, i.e., total revenue earned by them is at least half as much as the revenue earned by offline optimal schedule. Simulation results are provided to demonstrate the merit of the proposed algorithms.
Parallel implementation of the Kalman filter (KF), with emphasis on multicore architecture implementation is investigated. It is shown that KF provides enough parallelizm to achieve linear speedup in the number of cor...
详细信息
ISBN:
(纸本)9781467320658
Parallel implementation of the Kalman filter (KF), with emphasis on multicore architecture implementation is investigated. It is shown that KF provides enough parallelizm to achieve linear speedup in the number of cores used. A computationally efficient implementation that exhibit good scalability properties is presented. The implementation is based on the assumption of a banded system matrix. Both time-varying and invariant systems can be generally transformed to a realization with a banded system matrix. An analysis of the algorithm that provides guidelines to the choice of implementation hardware to meet a desired performance is also given.
Temporal logic model checking is a technique for the automatic verification of systems against specifications. Besides the correctness of safety and liveness properties it is often important to determine critical answ...
详细信息
ISBN:
(纸本)0769505376
Temporal logic model checking is a technique for the automatic verification of systems against specifications. Besides the correctness of safety and liveness properties it is often important to determine critical answer and delay times of systems, especially if they are embedded in a real-time environment. In this paper we present an approach which allows the verification as well as the timing analysis of real-time systems. The systems are described as networks of communicating time-extended finite state machines (I/O-interval structures). We use a compact symbolic representation to obtain efficient analysisalgorithms.
In this paper we consider an Interference Alignment (IA) approach for intercell interference coordination for the downlink of a MIMO multi-user cellular network. We determine the maximum degrees of freedom (DoF) of th...
详细信息
ISBN:
(纸本)9781457713460
In this paper we consider an Interference Alignment (IA) approach for intercell interference coordination for the downlink of a MIMO multi-user cellular network. We determine the maximum degrees of freedom (DoF) of the network and give the feasibility proof of perfect IA. Furthermore, we consider the problem of approximate IA and the Mean-Squared Error (MSE) based optimization of the transmit and receive beamforming matrices with the orthogonality constraints and the per-antenna transmit power constraint. Iterative algorithms are presented to solve the corresponding MSE problems. Simulation results and convergence analysis of the algorithms are also discussed. The results indicate that it is feasible to significantly increase the network capacity using the proposed IA approach.
暂无评论