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 escape routing problem for PCB designs has been extensively studied in literature. Although industrial tools and few studies have worked on the escape routing of differentials pairs, the routing solutions are not good enough by previous methods. In this paper, we propose an escape routing approach of differential pairs considering length matching. The approach includes two stages. The first stage...
Packet classification is an important topic for high speed routers nowadays. There are many packet classification algorithms based on decision tree like Hicuts, Hyper cuts and Hyper split. Because Hicuts and Hyper cuts divides the rule sets by cutting the address space into equal-sized subspaces, their cutting efficiency is not good. Although Hyper split proposed a good end-point-based cutting scheme,...
The 3D IC is an emerging technology. The primary emphasis on 3D-IC routing is the interface issues across dies. To handle the interface issue of connections, the inter-die routing, which uses micro bumps and two single-layer RDLs (Re-Distribution Layers) to achieve the connection between adjacent dies, is adopted. In this paper, we present an inter-die routing algorithm for 3D ICs with a pre-defined...
There are lots of ranking algorithms used in Web information retrieval. However, current algorithms have some problems: these algorithms are based on different calculation formulas to calculate the documents and query similarity or train a lot of training data to get corresponding calculation formula which calculate documents and query similarity. We know that this process is a very complex, and sometimes...
In this paper, a new image interpolation algorithm is proposed due to the inspiration of knowledge-based learning and dynamical control strategy which are based on computational verb theory. This algorithm takes gray level profiles and contour shapes as two processing factors. Experiments show that, with respect to the performance near edges of digital images, our algorithm is better than nearest...
3GPP does not supply any active security service interface or available security algorithm model for the terminals, which restricts the initiative ability and configuration ability of security communication on the application layer in a great deal. Focusing on this problem, we firstly brought forward three-layer architecture which guarantees application layer's communication security of 3G terminals,...
Due to the limitation of computing complexity, it is difficult to apply the H.264 deblocking filter to low-end terminals. Although some technologies to optimize it have been proposed, the complexity is still high for real time implementation. Considering that deblocking filter is applied to all of the vertical and horizontal edges of 4times4 blocks but only some of them actually need to be filtered...
This paper presents an efficient method for implementing visibility analysis on complex landscapes based on an improved LOS (line of sight) algorithm. The method not only determines the viewshed through capturing the geometric relationship between the target points and viewpoint. It also judges the visibility of the target points by the elevations. The visibility of a part of the target points are...
This paper emphasizes particularly on introduction of the application of non-Redundant Rules Algorithm on Data Analyses of Forest Inventory. By establishing the data mining model, MVNR Algorithm is applied to analyzing the relation of species, origin, age, chest, circumference, height and canopy density of trees. The results provide the best valuable information for forestation programming management...
In this paper, we propose a constraint graph-based macro placement algorithm that removes macro overlaps and optimizes macro positions for modern mixed-size circuit designs. Improving over the constraint graph by working only on its essential edges without loss of the solution quality, our algorithm can search for high-quality macro placement solutions effectively and efficiently. Instead of packing...
Existing algorithms for mining maximal frequent itemsets have to do superset checking, and some of them using FP-tree have to construct conditional frequent pattern trees recursively. We present a novel algorithm for mining maximal frequent itemsets from a transactional database. In the algorithm, the FP-Tree data structure is used and adapted, and a new strategy called ldquoNBNrdquo (Node By Node)...
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.