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.
Large-scale data-intensive streaming applications in various science fields feature complex DAG-structured workflows comprised of distributed computing modules with intricate inter-module dependencies. Supporting such workflows in high-performance network environments and optimizing their throughput are crucial to collaborative scientific exploration and discovery. We formulate workflow mapping as...
Qualitative reasoning uses incomplete knowledge to compute a description of the possible behaviors for dynamic systems. For standard QSIM algorithm frequently results in a large number of incomprehensible behavioral descriptions and the simulation for complex systems frequently is intractable, model decomposition methods are used to decompose the complex system model into simple sub-models. Qualitative...
Bundle adjustment is an effective mean to improve the precision of 3D reconstruction. A fast adjustment algorithm is provided based on the theory of one by one parameter estimation. The time complexity and space complexity of algorithm we provided and classical bundle adjustment algorithm are comparatively analysised. Both simulated and real experiments show that the algorithm we provided can achieve...
We present a near-linear time algorithm that approximates the edit distance between two strings within a polylogarithmic factor. For strings of length n and every fixed ε >; 0, the algorithm computes a (log n)O(1/ε) approximation in n1+ε time. This is an exponential improvement over the previously known approximation factor, 2Õ(√log n), with a comparable running time [Ostrovsky and Rabani, J....
Ensemble pruning is concerned with the reduction of the size of an ensemble prior to its combination. Its purpose is to reduce the space and time complexity of the ensemble and/or to increase the ensemble's accuracy. This paper focuses on instance-based approaches to ensemble pruning, where a different subset of the ensemble may be used for each different unclassified instance. We propose modeling...
This paper tackles the problem of fast varying channel estimation in LTE systems. Particular attention is given to downlink transmission where OFDMA is used as the multiple access technique for the air interface. In OFDMA, fast variation of the channel results in significant inter-carrier interference (ICI) which cannot be mitigated with conventional estimation and equalization techniques. In this...
Jiaguwen or Oracle bone script, which is inscribed on ox bones or tortoise shells of the Shang dynasty in ancient China, is one of the oldest mysterious characters in the world. Along with the rapid development of computer science and information technology, people are eager to deal with Jiaguwen characters just like the way they deal with modern characters. Unfortunately, Jiaguwen characters have...
In this paper a modified Offset Min-Sum decoding algorithm for Low-Density Parity Check Codes is presented. In this modified algorithm, the offset factor in the original Offset Min-Sum algorithm is adjusted iteratively with the assistance of the check-node computation outputs of the Normalized Min-Sum algorithm. As a result, the offset factor in our modified algorithm can be calculated adaptively...
The throughout of wireless communication systems can be improved by adding multiple antennas at the transmitter and receiver to create multiple-input multiple-output channels. To avoid the prohibitive complexity involved in the ML detectors, some special detectors were proposed to improve the performance-complexity trade-off, such as zero-forcing (ZF), minimum mean-square (MMSE), vertical Bell labs...
Nowadays practical solutions of engineering problems involve model-integrated computing. Model based approaches offer a very challenging way to integrate a priori knowledge into the procedure. Due to their flexibility, robustness, and easy interpretability, the application of soft computing based models, may have an exceptional role. Nevertheless, ever so advantageous their usage can be, it can still...
Many trust evaluation models have been proposed for P2P networks recently. While in these models, nodes usually need to record all nodes' trust, or the time complexity is high. In our paper, we propose a trust evaluation model based on resistive network. In which, nodes only need to record their neighbors' trust and the time complexity is lower. The experiments and analysis show that, on the premise...
The aim of this study is to describe the effects of harmonic noise on the complexity measure of nonlinear dynamic systems by numerical simulation. Four types of nonlinear time sequences are superimposed by harmonic noise. The complexity measures of all sequences are calculated and analyzed. By the experimental and statistical results, the value of the complexity measure of the sequence is decreasing...
Many-task computing (MTC) is a practical paradigm for developing loosely coupled and complex scientific applications. In this paradigm, computation on a large dataset is decomposed into tasks that are expected to be executed in parallel with dynamically allocated computing resources. These tasks pass data via files, and each one is to execute an existing program on one dataset element. Task scheduling...
Bayesian filtering appears in many signal processing problems, reason which has attracted the attention of many researchers to develop efficient algorithms, yet computationally affordable. Ranging from Kalman Filter (KF) to particle filters, there is a plethora of alternatives depending on model assumptions. We focus our interest into a recently developed algorithm known as the square-root Quadrature...
In this work, we consider the selection of complexity and rate controlling source coding parameters jointly with transmitter power. Power invested during source encoding can potentially improve coding efficiency while transmission power determines the capacity of the delivery channel. A complexity scalable source encoder is a useful tool during overall system optimization as it allows flexible allocation...
This paper describes a methodology for checking formal properties with local variables expressed in SystemVerilog assertions. Given a behavioral design in SystemVerilog and a property with local variables, the technique uses automated directed searching to reveal all possible control-paths of the given design and tests the satisfaction of the property symbolically in the corresponding data-path operations...
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.