Motion estimation is widely used in video coding schemes in order to reduce the inherent temporal redundancy among the frames of a video stream. In particular, low and very low bit rate video coding schemes need sophi...
详细信息
In this work we study the problem of counting the number of mobile hosts in mobile networks. Mobile networks aim to provide continuous network connectivity to users regardless of their location. Host mobility introduc...
详细信息
We consider the problem of computing minimum congestion, fault-tolerant, redundant assignments of messages to faulty parallel delivery channels. In particular, we are given a set M of faulty channels, each having an i...
详细信息
Testing of N/spl times/N Non-Restoring Cellular Array Dividers (NRCAD) with respect to path delay faults, is studied in this paper. Design modifications are proposed and a path selection method is suggested. We prove ...
详细信息
Testing of N/spl times/N Non-Restoring Cellular Array Dividers (NRCAD) with respect to path delay faults, is studied in this paper. Design modifications are proposed and a path selection method is suggested. We prove that the selected paths are Single Path Propagating Hazard Free Robustly Testable (SPP-HFRT) and that by measuring their delays the delay along any other path of the divider can be easily calculated. The number of selected paths is impressively small compared to all paths of the divider. The delay overhead of the modified design for all values of N is negligible, while the hardware overhead is small too. This is the first easily testable, with respect to path delay faults, NRCAD design in the open literature.
In the age of information overload intelligent agents have proven themselves as a very useful tool for discovering information of interest on the Web. The information seeking process may be either static, by utilizing...
详细信息
In the age of information overload intelligent agents have proven themselves as a very useful tool for discovering information of interest on the Web. The information seeking process may be either static, by utilizing existing search engines or using collaborative techniques, or dynamic, by actively browsing the Web. In the second case, agents need to evaluate encountered hyperlinks and choose the promising ones for continuing their autonomous navigation. In this paper we describe a new learning method for identifying interesting links in autonomous information discovery and we present the preliminary results from applying the new method into difficult query domains.
With the exponential growth of the Internet and the volume of information published on it, searching for information of interest has become a very difficult and time-consuming task. In this paper, we present 'Retr...
详细信息
With the exponential growth of the Internet and the volume of information published on it, searching for information of interest has become a very difficult and time-consuming task. In this paper, we present 'Retriever', an autonomous agent that executes user queries and returns high-quality results to the user. Retriever utilizes existing search engines to obtain the starting points for its subsequent autonomous exploration of the Web. Then it conducts a self-training process in order to learn the query domain and to increase its efficiency. When the query domain is learned, the agent expands the original query, reforms its search strategy and goes out looking for the documents to be presented to the user. It also incorporates relevance feedback in order to perform subsequent searches on the same query.
In this paper we present two methods for path delay fault testing of circuit-switched Benes Multistage Interconnection Networks (MINs) with centralized control. Although the number of paths is O(n/sup 3/), the first m...
详细信息
In this paper we present two methods for path delay fault testing of circuit-switched Benes Multistage Interconnection Networks (MINs) with centralized control. Although the number of paths is O(n/sup 3/), the first method exploiting the inherent parallelism of the Benes MIN requires O(n/sup 2/) pairs of test vectors. In the second method we propose the selection of a minimal subset of paths, that are robustly testable by only O(log/sub 2/n) test vector pairs. The delay along all other paths can be calculated based on the selected path delays.
Aiming at low power dissipation during testing, in this paper we present a methodology for deriving a novel BIST scheme for modified Booth multipliers. Reduction of the power dissipation is achieved by: (a) introducin...
详细信息
ISBN:
(纸本)076950325X
Aiming at low power dissipation during testing, in this paper we present a methodology for deriving a novel BIST scheme for modified Booth multipliers. Reduction of the power dissipation is achieved by: (a) introducing a suitable test pattern generator (TPG) built of a 4-bit binary and a 4-bit Gray counter, (b) properly assigning the TPG outputs to the multiplier inputs and (c) significantly reducing the test set length. The achieved reduction of the total power dissipation is from 44.1% to 54.9%, the average reduction per test vector is from 21.4% to 36.5% while the reduction of the peaks is from 15.8% to 34.3%, depending on the implementation of the basic cells and the size of the MBM. The test application time is also reduced by 28.9% while the introduced BIST scheme implementation overhead is very small.
暂无评论