The estimation of linear stationary discrete systems parameters (LSDS) by the measured input and output values is of major importance in control systems synthesis. Most of the methods for parameters estimation are bas...
详细信息
ISBN:
(数字)9781728193083
ISBN:
(纸本)9781728193090
The estimation of linear stationary discrete systems parameters (LSDS) by the measured input and output values is of major importance in control systems synthesis. Most of the methods for parameters estimation are based on the least squares method which implementation is related to matrices inversion. The present paper aims to propose an algorithm for estimation of parameters of LSDS, described in the state-space, in which, the size of the inverted matrices is always n×n. Proposed is a procedure for matrices inversion with reduced computational complexity, by using the least squares method (LSM).
We analyze the computational complexity of a Mayer neural network (NN)-based nonlinear equalizer for short-reach direct detection (DD) systems. The system bit-error-rate (BER) performance is also investigated using di...
详细信息
ISBN:
(纸本)9781943580705
We analyze the computational complexity of a Mayer neural network (NN)-based nonlinear equalizer for short-reach direct detection (DD) systems. The system bit-error-rate (BER) performance is also investigated using different NNs and receiver bandwidths.
In wide-band digital predistortion linearizers, the number of coefficients of a simplified Volterra polynomial model required to model memory effects can increase dramatically, which causes large computational complex...
详细信息
We study the computational complexity of proper equilibrium in finite games and prove the following results. First, for two-player games in strategic form we show that the task of simply verifying the proper equilibri...
详细信息
ISBN:
(纸本)9781450358293
We study the computational complexity of proper equilibrium in finite games and prove the following results. First, for two-player games in strategic form we show that the task of simply verifying the proper equilibrium conditions of a given pure Nash equilibrium is NP-complete. Next, for n-player games in strategic form we show that the task of computing an approximation of a proper equilibrium is FIXPa-complete. Finally, for n-player polymatrix games we show that the task of computing a symbolic proper equilibrium is PPAD-complete.
We study how markets help spread knowledge about solutions to the standard but computationally hard problem of maximizing value over indivisible goods subject to a budget constraint. In a first experiment, we f ind th...
详细信息
This paper proposes a frequency averaging method to reduce computational complexity for the implementation of a two-channel parameterized multichannel Wiener filter (PMWF) algorithm. Experimental results show that the...
详细信息
ISBN:
(纸本)9781538630259
This paper proposes a frequency averaging method to reduce computational complexity for the implementation of a two-channel parameterized multichannel Wiener filter (PMWF) algorithm. Experimental results show that the proposed algorithm can reduce the amount of computation by 40.24 % compared to the conventional PMWF algorithm while preserving speech quality after the speech enhancement.
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intrac...
详细信息
This thesis presents a general background on discrete Morse theory, as developed by Robin Forman, as well as an introduction to computability and computational complexity. Since general point-set data equipped with a ...
详细信息
This thesis presents a general background on discrete Morse theory, as developed by Robin Forman, as well as an introduction to computability and computational complexity. Since general point-set data equipped with a smooth structure can admit a triangulation [19], discrete Morse theory finds numerous applications in data analysis which can range from traffic control to geographical interpretation. Currently, there are various methods which convert point-set data to simplicial complexes or piecewise-smooth manifolds; however, this is not the focus of the thesis. Instead, this thesis will show that the Morse homology of such data is computable in the classical sense of Turing decidability, bound the complexity of finding the Morse homology of a given simplicial complex, and provide a measure for when this is more efficient than simplicial homology.
In this dissertation, we study the dirty data evaluation and repairing problem in relational database. Dirty data is usually inconsistent, inaccurate, incomplete and stale. Existing methods and theories of consistency...
详细信息
In this dissertation, we study the dirty data evaluation and repairing problem in relational database. Dirty data is usually inconsistent, inaccurate, incomplete and stale. Existing methods and theories of consistency describe using integrity constraints, such as data dependencies. However, integrity constraints are good at detection but not at evaluating the degree of data inconsistency and cannot guide the data repairing. This dissertation first studies the computational complexity of and algorithms for the database inconsistency evaluation. We define and use the minimum tuple deletion to evaluate the database inconsistency. For such minimum tuple deletion problem, we study the relationship between the size of rule set and its computational complexity. We show that the minimum tuple deletion problem is NP-hard to approximate the minimum tuple deletion within 17/16 if given three functional dependencies and four attributes involved. A near optimal approximated algorithm for computing the minimum tuple deletion is proposed with a ratio of 2 − 1/2r , where r is the number of given functional dependencies. To guide the data repairing, this dissertation also investigates the data repairing method by using query feedbacks, formally studies two decision problems, functional dependency restricted deletion and insertion propagation problem, corresponding to the feedbacks of deletion and insertion. A comprehensive analysis on both combined and data complexity of the cases is provided by considering different relational operators and feedback types. We have identified the intractable and tractable cases to picture the complexity hierarchy of these problems, and provided the efficient algorithm on these tractable cases. Two improvements are proposed, one focuses on figuring out the minimum vertex cover in conflict graph to improve the upper bound of tuple deletion problem, and the other one is a better dichotomy for deletion and insertion propagation problems at the absence o
Halpern-Shoham logic (HS) is a highly expressive interval temporal logic but the satisfiability problem of its formulas is undecidable. The main goal in the research area is to introduce fragments of the logic which a...
详细信息
暂无评论