JASIAC (Java-based Active-network Secure Inter Active Application Communication) provides a mechanism to solve the security problem for active application communication for active networks. JASIAC can work against &qu...
详细信息
JASIAC (Java-based Active-network Secure Inter Active Application Communication) provides a mechanism to solve the security problem for active application communication for active networks. JASIAC can work against "un-authorization access" and "masquerading" quite well and work efficiently with "malicious access " and "direct DoS attack". It stores the variables and methods to be published in a public variable pool and public method pool respectively, so it makes the security manageable and efficient; it also provides multilevel security mechanisms such as timed variable, hiding inner name, parameter by value and read-only parameter to make the security reliable and flexible.
To better prepare our students for working with multidisciplinary teams on large projects, the University of Hartford College of Engineering has introduced a junior course entitled Engineering Practice. This one credi...
详细信息
To better prepare our students for working with multidisciplinary teams on large projects, the University of Hartford College of Engineering has introduced a junior course entitled Engineering Practice. This one credit course is taken jointly by junior students from all engineering disciplines. The main goal of the course is to have the students work on a large project where the decisions made by other groups will affect choices made by their group and to reinforce the reality that most engineering projects require engineers to work in multi-disciplinary teams. A third goal is to show that engineers must present their work to political or regulatory bodies for a project to be approved. This course has now been taught for 3 years. The results of the evaluation of the course by the students and faculty will be discussed
In distributed diagnosis it may be useful to achieve local consistency among local estimates. For that purpose the Computational Procedure for Local Consistency (CPLC) was proposed to achieve the supremal local suppor...
详细信息
In distributed diagnosis it may be useful to achieve local consistency among local estimates. For that purpose the Computational Procedure for Local Consistency (CPLC) was proposed to achieve the supremal local support, which represents one type of local consistency. It has been shown that if CPLC terminates then the result is in fact the supremal local support. However, in this paper it is shown that, even if all initial estimates are regular languages, the termination of CPLC is undecidable. Moreover, these difficulties are not confined to this specific procedure: it is undecidable whether the supremal local support corresponding to an arbitrary collection of regular initial languages is componentwise empty; consequently, the supremal local support is effectively uncomputable.
We propose a simulation-based method in the verification of SoC bus system. By the method, constrained-random vector is used to make simulation first;then a coverage analysis is made in the simulation process until a ...
详细信息
We propose a simulation-based method in the verification of SoC bus system. By the method, constrained-random vector is used to make simulation first;then a coverage analysis is made in the simulation process until a certain coverage statistics is obtained. Finally, the test vector is manually generated. We use this method to verify a SoC system and get a satisfactory result by reducing the time of simulation effectively.
A simple and fast technique for depth estimation, based on phase measurement has been adopted for the implementation of a real-time stereo system with subpixel resolution on a FPGA device. The technique avoids the att...
详细信息
A simple and fast technique for depth estimation, based on phase measurement has been adopted for the implementation of a real-time stereo system with subpixel resolution on a FPGA device. The technique avoids the attendant problem of phase warping. The designed system takes full advantage of the inherent processing parallelism of FPGA devices to achieve a computation speed of 65 Megapixels per second that can be arranged with a customized frame grabber module to process 52 frames per second of 1280 /spl times/ 960 pixel resolution. The achieved processing speed is higher than existing approaches. This allows the system to extract real-time disparity values for very high resolution images or use several cameras to improve the system accuracy.
The main functionality of the domain name system (DNS) is to translate symbolic names into IP addresses. Due to the criticality of DNS for the proper functioning of the Internet, many improvements have been proposed f...
详细信息
The main functionality of the domain name system (DNS) is to translate symbolic names into IP addresses. Due to the criticality of DNS for the proper functioning of the Internet, many improvements have been proposed for DNS in terms of security and dependability. However, the current secure DNS (DNSSEC) standard has still several problems that need further consideration. For example, online updates and denial of service attacks are not sufficiently addressed. These problems are serious obstacles that might prevent DNSSEC from replacing the traditional DNS. In this paper we discuss several of these technical and economic problems. To address these issues, we propose a simple extension to the existing DNS. It is SSL based and individual domains can decide independently of each other if and when to adopt the extensions. We show how to implement these extensions with the help of a simple proxy DNS server.
This paper presents novel algorithm for mining frequent itemsets in sparse database, compared with existing algorithm our algorithm has visible advantage. With this algorithm, the scans is less in transaction database...
详细信息
This paper presents novel algorithm for mining frequent itemsets in sparse database, compared with existing algorithm our algorithm has visible advantage. With this algorithm, the scans is less in transaction database, only one time in little and middle transaction database, and not more than two times in large database. In the algorithm, when the transaction database is scanned, the transaction items are saved in unit triplet, and the count of every transaction item is saved in 1-dimension array so that the frequent itemsets are generated in memory. So I/O spending is reduced greatly. The experimental results show that our algorithm is very promising.
This paper develops a wavelet based distributed ID model approach to analyses network traffic in detail. We adopt wavelet technique to analyze and model ID system to find the attack behavior in network. Our model can ...
详细信息
This paper develops a wavelet based distributed ID model approach to analyses network traffic in detail. We adopt wavelet technique to analyze and model ID system to find the attack behavior in network. Our model can post attack characteristic more clearly and, by way of improve the veracity, we compare corresponding network node signals of wavelet decomposition. We simulate attacks and the model can detect attack more precisely than the previous model does.
This paper describes the application of several data mining approaches to solve a calibration problem in a quantitative chemistry environment. Experimental data obtained from reactions which involve known concentratio...
详细信息
This paper describes the application of several data mining approaches to solve a calibration problem in a quantitative chemistry environment. Experimental data obtained from reactions which involve known concentrations of two or more components are used to calibrate a model that, later, will be used to predict the (unknown) concentrations of those components in a new reaction. This problem can be seen as a selection + prediction one, where the goal is to obtain good values for the variables to predict while minimizing the number of the input variables needed, taking a small subset of really significant ones. Initial approaches to the problem were principal components analysis and filtering. Then we used methods to make smarter reductions of variables, by means of parallel estimation of distribution algorithms (EDAs) to choose collections of variables that yield models with less average prediction errors. A final step was to use multiobjective parallel EDAs, in order to present a set of optimal solutions instead of a single solution.
Pipeline flushes are becoming increasingly expensive in modern microprocessors with large instruction windows and deep pipelines. Selective re-execution is a technique that can reduce the penalty of mis-speculations b...
详细信息
Pipeline flushes are becoming increasingly expensive in modern microprocessors with large instruction windows and deep pipelines. Selective re-execution is a technique that can reduce the penalty of mis-speculations by re-executing only instructions affected by the mis-speculation, instead of all instructions. In this paper we introduce a new selective re-execution mechanism that exploits the properties of a dataflow-like Explicit Data Graph Execution (EDGE) architecture to support efficient mis-speculation recovery, while scaling to window sizes of thousands of instructions with high performance. This distributed selective re-execution (DSRE) protocol permits multiple speculative waves of computation to be traversing a dataflow graph simultaneously, with a commit wave propagating behind them to ensure correct execution. We evaluate one application of this protocol to provide efficient recovery for load-store dependence speculation. Unlike traditional dataflow architectures which resorted to single-assignment memory semantics, the DSRE protocol combines dataflow execution with speculation to enable high performance and conventional sequential memory semantics. Our experiments show that the DSRE protocol results in an average 17% speedup over the best dependence predictor proposed to date, and obtains 82% of the performance possible with a perfect oracle directing the issue of loads. Copyright 2004 ACM.
暂无评论