Data-intensive computing becomes a buzz word nowadays, where constant data for current operational processing and historical data for massive analysis are often separated into two systems. How to keep the historical d...
详细信息
In mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these re...
详细信息
In this paper, we study component-based software architectures and report the following results. 1)By defining port operations, we may use port activities to describe process migration. The proposed formalism(port alg...
详细信息
ISBN:
(纸本)9788988678213
In this paper, we study component-based software architectures and report the following results. 1)By defining port operations, we may use port activities to describe process migration. The proposed formalism(port algebra) can be used to describe running time system architecture. 2) In processing checking, the formalism can keep architecture structure unchanged while progresses migrate, which enables us to study runtime system behaviors that are not easy to be checked by model checking tools.
A DIDS(Distributed Intrusion Detection System) named as F-DIDS is built to defend against flooding DoS(Denial of Services) attacks in the paper. F-DIDS is composed of F-IDSes which are settled in nodes who need to be ...
详细信息
A DIDS(Distributed Intrusion Detection System) named as F-DIDS is built to defend against flooding DoS(Denial of Services) attacks in the paper. F-DIDS is composed of F-IDSes which are settled in nodes who need to be protected. F-DIDS is a complete DIDS, in which each node with F-IDS can be the detection centre. Due to no central node, single failure can be avoided in F-DIDS. In F-DIDS, Traffic tables help to build up traffic matrixes. By analyzing traffic matrixes, flooding DoS attacks could be detected and three normal flooding DoS attacks are classified. Local and global communication methods are proposed to reduce the overhead brought from fully distributed architecture. The simulation results and performance analysis show that F-DIDS works effectively.
For a web application, we rebuild the use cases from the log file by applying Natural Language Processing technique;then based on these use cases we construct component model and extract the component behavior;finally...
详细信息
Numerous feature selection methods have been developed to identify informative genes from a large pool of genes that are not involved in the array experiments. However, the integrity of the reported genes is still unc...
详细信息
Legacy System is difficult to be maintained and refactored for lack of necessary documents and source codes. How to generate some valuable information from system runtime behaviors is a big challenge to systems reengi...
详细信息
Pasting lemma is proved in Isabelle/HOL. General topology is formalized to express Pasting lemma. Topology definitions and proofs are written in a computer language so that they can be formally verified by machine. We...
详细信息
Tool support for the Java Modeling Language (JML) is a very pressing problem. A main issue with current tools is their architecture;the cost of keeping up with the evolution of Java is prohibitively high, e.g., Java 5...
详细信息
To eliminate the routing load unbalance among sensor nodes, one approach is to deploy a small number of powerful relay nodes acting as routing nodes in wireless sensor networks, the major optimization objective of whi...
详细信息
To eliminate the routing load unbalance among sensor nodes, one approach is to deploy a small number of powerful relay nodes acting as routing nodes in wireless sensor networks, the major optimization objective of which is to minimize the number of relay nodes required. In this paper, we prove that the relay node placement problem in a bounded plane is a P problem, but its computational complexity in general case is quite great. From the geometric cover feature of the relay node placement problem, an O(n2 log n) time greedy approximation algorithm is proposed, where n is the number of sensor nodes. Particularly, at each stage of this algorithm's iterative process, we first select a critical node from uncovered sensor nodes, and then determine the location of relay node based on the principle of preferring to cover the sensor node closer to the critical node, so as to prevent the emergence of isolated node. Experiment results indicate that our proposed algorithm can generate a near optimum feasible relay node deployment in a very short time, and it outperforms existing algorithms in terms of both the size of relay node deployment and the execution time.
暂无评论