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.
In the Multiple Input Multiple Output (MIMO) systems, the receiver performance is greatly affected by Antenna Gain Imbalance (AGI). This paper proposes an novel AGI detection algorithm based on the Least Square (LS) channel estimation. The AGI parameter is accurately obtained after eliminating the influence of noise from the channel through the long-term statistics. Moreover, a compensation algorithm...
In this paper, modified low-complex, hybrid architectures for digital, oversampled sigma-delta digital-to-analog converters (ΣΔDACs) are explored in terms of signal-to-noise ratio (SNR) and subDAC complexity. The studied techniques illustrate the trade-off in terms of noise-shaper and DAC implementation complexity and loss in SNR. It is found that a fair amount of improvement in SNR is achieved by...
Improving the quality of summaries created for the documents explored during informational search is the essential point in the interpretation of search engine results. In many cases summaries generated by the search engines are not indicative enough, therefore the user cannot quickly judge about the document relevancy. Having the WordNet ontology based weighting procedure proposed in earlier works...
Images are often corrupted by impulse noise in the procedures of image acquisition and transmission. In this paper, we propose a novel denoising method, which is based on the decision-tree and edge-preserving techniques, for the removal of random-valued impulse noise. Extensive experimental results show that the proposed technique not only preserves the edge features, but also obtains excellent performances...
The re-encoding and coordinate transformation techniques are usually employed to reduce the computational complexity of interpolation, which is the most computation-intensive step in the algebraic soft-decision decoding of Reed-Solomon (RS) codes. In this paper, we present a high-throughput re-encoder design for soft-decision decoding a (255, 239) RS code. With the developed scheduling scheme and...
In this paper, we investigate the algorithmic complexity of deciding colorability, as a function of the number of available colors. Intuitively, one may assume that the problem's complexity is highest around the chromatic number of the graph. We give substantial empirical evidence that this intuition is largely true, both for exact and heuristic graph coloring algorithms. We give a rigorous proof...
Radio frequency identification (RFID) tag has been extensively used in diverse applications, recently. For instance, we may use it to track freights on a warehouse, to catch a thief for lost luggage and to rapidly locate lost children or passengers who fail to arrive on time at the departure gates of major airport. It can also be employed for transmitting multimedia content (especially for video)...
In this paper, we carry out a detailed investigation on two Train Inauguration Protocols proposed by WG43 for IEC 61375-2-5: ETB Train Inauguration (ETBTI) and Train Topology Discovery Protocol(T2DP). ETBTI uses Layer 2 LLDP to discovery neighbor peers and uses Layer 3 ETBIP to broadcast the information of single node to all the others. On the other hand, T2DP focuses on Layer 2 and modifies LLDP...
The large-scale construction enterprise project portfolio management is a effective integration bridge of strategic goal and project management, under the guidance of the corporate strategy, project selection is a key scientific factor. In this paper, Vague sets' TOPSIS algorithm, Comparison the distance between the project set A of the project solution and Vague positive-ideal solution (VPIS) and...
Massive parallel computing performed on many-core Network-on-Chips (NoCs) is the future of the computing. One feasible approach to implement parallel computing is to deploy multiple applications on the NoC simultaneously. In this paper, we propose a multi-application mapping method starting with the application mapping which finds a region on the NoC for each application and then task mapping which...
Regular expressions can be represented by expression tree and by flow diagram (syntax graph). Based on equivalences a possible normal form can be obtained. It has interesting properties in both graphical representations. The union-complexity of languages is defined. The union-complexity is 1 for the union-free languages. These languages can be given by regular expressions without the operation union...
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...
In the twenty-first century, a company has to organize around the customers in order to be a successful and viable firm. Customers expect to get what they would like, with a side order of customization. This approach raises several questions that have to be answered, one of which is that despite nowadays customers are knowledgeable in general, they are still far from being experts that can really...
Spanning subgraph is necessary for the communication in networks. For example, the malfunctioning of one or more nodes in a network in general affects both the global and the local properties of the remaining nodes, because it makes some edges unusable and destroys the connectivity of the system. In this study, we focus on the characters of a network to be fractional-r-factors, fractional (r, k)-extendable...
The paper introduces the existing multi-pattern matching algorithms implemented by software, and analyses the Wu-Manber Algorithm in emphases. According to the analysis, the paper points out that we will gain different performance when we adopt different hash function or domain. This conclusion is proved by experiments, which show that we shall adopt appropriate hash functions or domain to improve...
The equivalence relation in the theory is defined by the complete equal relation, which will result in complexity of computation of the knowledge reduction in the real world in rough sets theory (RST). In order to overcome this shortage of general rough set theory, the elementary concept of tolerance rough sets theory is proposed in this paper, and the theory is employed to build objects' tolerance...
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 study the problem of identity testing for depth-3 circuits of top fanin k and degree d. We give a new structure theorem for such identities. A direct application of our theorem improves the known deterministic d -time black-box identity test over rationals (Kayal & Saraf, FOCS 2009) to one that takes d(O(k2))-time. Our structure theorem essentially says that the number of independent variables...
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.