In this paper we present a Krylov subspace method to efficiently compute the lowfrequency response of multiconductor transmission lines. Through a Lanczos-type algorithm we generate so-called spectral Lanczos decompos...
详细信息
Mathematical models currently exist that explore the physiology of normal and traumatized intracranial function. Mechanical models are used to assess harsh environments that may potentially cause head injuries. Howeve...
详细信息
This paper explores the forming-up, robustness of the ensuing formation and coordinated movement of autonomous, non-communicating submerged vehicles (AUV) planning their trajectories using a virtual potential fields m...
详细信息
This paper explores the forming-up, robustness of the ensuing formation and coordinated movement of autonomous, non-communicating submerged vehicles (AUV) planning their trajectories using a virtual potential fields method. The behavior and characteristic merits and problems of the proposed scheme, which plans the trajectory on the basis of AUV kinematics is tested in 2D simulations. A brief commentary on further avenues of research and improvement in order to make the method applicable to hardware-in-the-loop usage is given.
Within packet processing systems, lengthy memory accesses greatly reduce performance. To overcome this limitation, network processors utilize many different techniques, e.g., utilizing multi-level memory hierarchies, ...
详细信息
ISBN:
(纸本)9781424412297;1424412293
Within packet processing systems, lengthy memory accesses greatly reduce performance. To overcome this limitation, network processors utilize many different techniques, e.g., utilizing multi-level memory hierarchies, special hardware architectures, and hardware threading. In this paper, we introduce a multi-level memory hierarchy and a special hardware cache architecture for counting Bloom filters that is utilized by network processors and packet processing applications such as packet classification and distributed web caching systems. Based on the value of the counters in the counting Bloom filter, a multi-level cache architecture called the cache counting Bloom filter (CCBF) is presented and analyzed. The results show that the proposed cache architecture decreases the number of memory accesses by at least 51.3% when compared to a standard Bloom filter.
Fault tolerance (FT) is becoming increasingly important in computing systems. FT features are based on some form of redundancy, which adds a significant cost to a system, either increasing the required amount of hardw...
详细信息
Fault tolerance (FT) is becoming increasingly important in computing systems. FT features are based on some form of redundancy, which adds a significant cost to a system, either increasing the required amount of hardware resources or degrading performance. To enable a user to choose between stronger FT or performance, some schemes have been proposed, which can be configured for each application to use the available redundancy to increase either reliability or performance. We propose to have an instruction-level, rather than application-level, configurability of this kind, since some applications (for example, multimedia) can have different reliability requirements for their different parts. We propose to apply weaker (or no) FT techniques to the less critical parts. This yields a certain time or resource gain, which can be used to apply stronger FT techniques to the more critical parts, thereby, increasing the overall FT. We show how some existing FT techniques can be adapted to support instruction-level FT configurability, and how a programmer can specify the desired FT of particular instructions or blocks of instructions in assembly or in a high-level programming language. In some cases compiler can assign the FT level to instructions automatically. Experimental results demonstrate that reducing the FT of non-critical instructions can lead to significant performance gains compared to a redundant execution of all the instructions. The fault coverage of this scheme is also evaluated, demonstrating that it is very application-specific. For some applications the fault coverage is very admissible, but unacceptable for others.
In this paper, a complete analysis of address decoder delay faults due to capacitive coupling between address lines is presented. Detection conditions are used to explore the space of possible tests in order to detect...
详细信息
ISBN:
(纸本)9781424418244
In this paper, a complete analysis of address decoder delay faults due to capacitive coupling between address lines is presented. Detection conditions are used to explore the space of possible tests in order to detect these faults, resulting in new tests. The best test is proposed to be combined with other tests (while using the freedom of march tests) to target other faults.
Previously we have shown that apart from discrete spectrum (eigenvalues), the three-dimensional volume integral operator of electromagnetic scattering has a continuous essential spectrum as well. Here we derive the co...
详细信息
This paper presents performance assessment of differential evolution for multiobjective optimization with self adaptation algorithm, which uses the self adaptation mechanism from evolution strategies to adapt F and ...
详细信息
This paper presents performance assessment of differential evolution for multiobjective optimization with self adaptation algorithm, which uses the self adaptation mechanism from evolution strategies to adapt F and CR parameters of the candidate creation in DE. Results for several runs on CEC2007 special session test functions are presented and assessed with different performance metrics. Based on these metrics, algorithm strengths and weaknesses are discussed.
We have reported the successful use of the Loop Mediated Isothermal Amplification (LAMP) reaction for Hepatitis B Virus (HBV) DNA in a 25 μl micro-reactor for the development of a rapid diagnostic device recently. Th...
详细信息
Knowledge elicitation is difficult for expert systems that are based on probability theory. The elicitation of probabilities for a probabilistic model requires a lot of time and interaction between the knowledge engin...
详细信息
暂无评论