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.
High Efficiency Video Coding (HEVC) standard represents the newest video coding standard generation for both ITU-T Video Coding Experts Group and the ISO/IEC Moving Picture Experts Group. The new standard reduces bitrates by 50% compared to the existing standards using Advanced Video Coding (AVC) for equal video quality. This paper provides an overview of the technical features and characteristics...
High-Efficiency Video Coding (HEVC) is the latest video coding standard of the Joint Collaborative Team on Video Coding (JCT-VC). HEVC noticeably improves compression performance when comparing with previous standards such as H264, providing a major leap forward in video compression technology. However this improvement is achieved increasing the complexity of the encoding process. In this paper an...
Discovering useful patterns plays an essential role in data management and data mining. Frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied on (standard) precise transaction databases. Uncertain transaction databases consist of sets of existentially uncertain items. The uncertainty of items in transactions makes traditional...
Generation-based network coding is an important realization of network coding in practical networks. Due to the special data processing of generations, it is not only faced with intra-generation pollution attacks, but also is vulnerable to inter-generation pollution attacks. To solve this problem, we propose new homomorphic signature schemes for generationbased network coding. By means of the lattice...
Data-flow analyses are used as part of many software engineering tasks: they are the foundations of program understanding, refactorings and optimized code generation. Similar to general-purpose languages (GPLs), state-of-the-art domain-specific languages (DSLs) also require sophisticated data-flow analyses. However, as a consequence of the different economies of DSL development and their typically...
In this paper, we propose a low complexity algorithm to separate collided RFID signals. By carefully analyzing the collided signals when two tags with the same bit durations respond to a reader simultaneously, we observed that the individual amplitudes of each tag appear in pairs and the two tags' information bits are different, and regular RFID signals with larger amplitudes appear if the two tags'...
Transform domain communication system (TDCS) has been proposed to support multiuser communications through spectrum bin nulling and frequency domain spreading for overlay cognitive radio networks. In TDCS systems, specific pseudorandom spreading sequences are assigned to different users for the purpose of multiple access. However, due to the non-zero cross-correlations between any pair of TDCS signals,...
Coded caching is a technique that receives much attention in the network literature, since it is able to achieve significant gains compared to the conventional uncoded caching schemes. In this paper, we first identify a family of placement and delivery schemes. Then we derive a lower bound on the average rate for the identified schemes. Based on the clue in deriving the lower bound, a new delivery...
We are concerned with the issue of discovering behavioral patterns on the web. When a large amount of web access logs are given, we are interested in how they are categorized and how they are related to activities in real life. In order to conduct that analysis, we develop a novel algorithm for sparse non-negative matrix factorization (SNMF), which can discover patterns of web behaviors. Although...
In this paper, we apply discriminant analysis on a large set of historic news articles published at www.bloomberg.com and investigate what features make the difference between news articles with short and long shelf lives. We define the shelf life of an article as the time to reach 60% of its total hits throughout its overall life time. The "bag-of-words" model is used to represent the content...
Subband coding (SBC) is a one of the popular application to filter banks to achieve multi-channel data compression. There are data independent and data dependent filter banks in the literature. In this paper, we focus on the design of data dependent M-channel maximally decimated Paraunitary (PU) filter bank using polynomial eigen value decomposition (PEVD) technique for SBC. To design this type of...
In the passive UHF RFID system, the traditional label anti-collision method using random multiple access, mainly in the medium access control (MAC) layer, the recognition efficiency is not high. In order to improve the recognition efficiency, the tag anti collision algorithm in some physical layer is proposed. The method directly from the signal recovery tag signal. In order to improve the efficiency...
Routing is an essential stage in physical design, where already placed components are connected by wires. Routing must satisfy various manufacturing requirements, referred to as design rules. We formalize the problem of design-rule-aware routing and introduce a solver, called DRouter, for the resulting problem. Plain routing is often modeled as follows: given an undirected weighted graph and a set...
Map images are widely used in variety applications such as personal navigation, mobile computing, internet and academia. The usage of raster maps in many applications especially in small storage devices has negative impacts because of its relatively large size. The efficient use of compression method is essential to meet such requirements. A fast lossless compression scheme for raster map images is...
Large-width multiplier is one of the most important computing units, such as for encrypt chip basing on RSA algorithm. In this paper, a circuit structure which is the optimized multiplier with innovative Booth algorithm is put forward. We proposed an innovative algorithm that can be generalized to N-bit multiplier design. Meanwhile, comparing to the original Booth multiplier, it speeds up the computation...
PPC-Tree and N-list have been proven to be very efficient and been used in mining frequent itemsets widely. The main problem of the novel structures is that the way of First Constructing Last Encoding method is adopted in the tree-building phase. This causes excessive time consumption to mine frequent itemsets. In this paper, we propose SFO-Set based on SFO-Tree, a more efficient data structure, to...
Analog circuit evolutionary design is a common analog circuit automatic design technology, and its researchers conducted extensive researches on it. At the present stage, Analog circuit evolutionary design has achieved good results in passive filters and other analog circuits, but research on the evolution of the transistor level analog circuit is relatively small. In this paper, we designed a transistor...
Analog circuits automatic evolutionary design is a method of designing analog circuits automatically, how to code the circuit is the primary problem in the analog circuits evolutionary design. In this paper, a new analog circuits coding method is proposed, it is designed by imitating the generation process of the special connected and closed weighted undirected graph, we name it generating coding...
This paper proposes the texture-based coding unit (CU) size decision (TBCUD) algorithm that includes texture-based block partitioning. While the existing algorithm calculates every CU size, the proposed algorithm only considers the determined CU sizes that are decided by the texture of the image. Because the prediction is performed by the prediction unit (PU) derived from CU, the proposed algorithm...
This paper presents a parallel motion estimation algorithm on Graphics Processing Units (GPU) with a GPU-based fast Coding Unit (CU) splitting mechanism for speeding up the execution speed of High Efficiency Video Coding (HEVC). Parallel motion estimation algorithms only offer motion vectors to HEVC encoder, but CU splitting decision in HEVC still needs more information to speed up the encoder. Therefore,...
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.