The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The matrix completion problem addresses the recovery of a low-rank matrix from a subset of its entries. In this paper, we analyze rank-r matrix completion algorithm based on the rank-r singular value decomposition (SVD). We introduce the doubly-restricted contraction constant (DRCC), a characteristic of a matrix, which predicts the feasibility of matrix recovery from a subset of its entries. We establish...
Transient faults have become increasingly observable in combinational logic. This is due to the weakening of some inherent protective mechanisms that logic traditionally holds against such flawed spurious events. One of the aforementioned mechanisms relates to the propagation of transient faults along sensitizable paths. Existing literature that relies on logic simulation under estimates the number...
Based on the analysis of the standard Particle Swarm Optimization and the characteristic of typical multi-intersection for urban trunk road, a traffic flow forecasting model using dynamic recursion neural network is presented. The feature of this network is that the output of the hidden layer connects to the input of itself through the delay and storage of the context layer. The method of self-connection...
In this paper we investigate bounds on performance of joint parameter estimation and modulation classification. The Cramer-Rao Lower Bounds (CRLBs) of non-data aided joint estimates of signal amplitude and phase, and noise power are derived for binary phase shift keying (BPSK) and quadrature phase shift keying (QPSK) signals. In addition, an upper bound on performance of Quasi Hybrid Likelihood Ratio...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.