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 design of opportunistic spectrum access (OSA) policy is a key technique of cognitive radio. In this paper, we consider a scenario that the secondary user can't sense full spectrum due to hardware constraints. In order to get higher transmission rate, we allow the secondary user sense multiple channels in a slot and group them together by channel bonding technique after detecting consecutive idle...
A similarity algorithm based on weighted hierarchical structure of XML document is brought forward. The algorithm can calculate the similarity among XML documents efficiently according to hierarchical structure. It can be powerful enough to distinguish the similar structural documents. Experimental results prove that the algorithm reduces the complexity and has fairly high performance. The approach...
We present a case for automating the selection of MPI-IO performance optimizations, with an ultimate goal to relieve the application programmer from these details, thereby improving their productivity. Programmers productivity has always been overlooked as compared to the performance optimizations in high performance computing community. In this paper we present RFSA, a reduced function set abstraction...
In this paper, we propose a novel method with low complexity for constructing quasi-cyclic LDPC codes. The algorithm chooses every circulant permutation matrix sequentially, and makes sure that the current circulant permutation matrix forms no cycles of length 4 and 6 with the existent matrices, finally a family of (3,L) QC-LDPC codes with girth at least 8 is obtained. The main complexity of the algorithm...
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.