The problem of Input Output Decoupling is studied for the case of general neutral multi-delay systems, via proportional realizable output feedback. Using a pure algebraic approach, the necessary and sufficient conditi...
详细信息
An intrusion detection system (IDS) is a collection of sensors (often in the form of mobile agents) that collect data (security related events), classify them and trigger an alarm when unwanted manipulations to regula...
详细信息
An intrusion detection system (IDS) is a collection of sensors (often in the form of mobile agents) that collect data (security related events), classify them and trigger an alarm when unwanted manipulations to regular network behaviour is detected. Activities of attackers and network are time dependent. In the paper, fault trees with time dependencies (FTTD) are used to describe intrusions with emphasis put on timing properties. In FTTD, events and gates are characterized by time parameters. FTTD are used in verification whether the IDS reacts sufficiently quick on the intrusions. As an example, "the victim trusts the intruder" attack is analysed.
There are many applications of ad hoc sensor networks that have to ensure immunity to adversaries. One challenge is how to bootstrap secure communication among nodes. In this paper we propose a novel key pre-distribut...
详细信息
There are many applications of ad hoc sensor networks that have to ensure immunity to adversaries. One challenge is how to bootstrap secure communication among nodes. In this paper we propose a novel key pre-distribution scheme based on polynomials. The properties of our scheme are the same as a scheme presented by Blom, but we propose to use a different technique that can be easily extended if we get rid of a node's computation constrains. By using polynomial-based key pre-distribution, we can reduce the storage requried at receivers down to O(t) where t is a system and security parameter. Moreover using only this information, pairwise keys can be established efficiently for each pair of nodes which enable secure construction of the communication tree.
In this paper we examine the communication trees widely used in ad hoc networks. These trees can be used in a number of ways e.g. to route or broadcast messages and to aggregate information. In this paper we propose a...
详细信息
In this paper we examine the communication trees widely used in ad hoc networks. These trees can be used in a number of ways e.g. to route or broadcast messages and to aggregate information. In this paper we propose a new key distribution protocol for large and dynamic ad hoc networks over unreliable channel. Protocol proposed here involves broadcast exclusion based on polynomial interpolation and secret key cryptography. Proposed scheme ensures security of broadcast and one-to-one communication, message authentication and gives a possibility to verify routing information. It also ensures t-resilience which means that up to t nodes can be compromised without influencing the security
The necessary and sufficient conditions for the solvability of the exact model matching problem for general neutral single input - single output multi-delay systems, via a realizable dynamic output feedback and a real...
详细信息
The paper deals with a problem of a description and analysis of fault trees with time dependencies, constructed for real-time systems to show possible ways leading to a hazard. Both the description and analysis are ma...
详细信息
The paper deals with a problem of a description and analysis of fault trees with time dependencies, constructed for real-time systems to show possible ways leading to a hazard. Both the description and analysis are made with the duration temporal logic formalism - Duration Calculus (DC). It is the first time, when fault trees, containing the temporal gates, proposed by Magott and Skrobanek, got formally described with the DC logic (preserving all their properties for each gate type and for the whole structure) and became possible to be formally deductively analyzed (the latter part still need same work though).
Comparing intelligent robots interacting with humans is a difficult task. First of all, robotic helps in everyday life can be involved in different tasks. Additionally, the grade of autonomy of the robot and the type ...
详细信息
In the paper the method of automated cells tracking in the sequence of images is presented. The method starts with a sequence of images processing by the use of an adaptive threshold operator. Then the cells are detec...
详细信息
The subject matter of the study are the automated guided vehicle (AGV) operation synchronisation mechanisms in flexible manufacturing systems, enabling determination of the travel schedules via some preset travelling ...
详细信息
The subject matter of the study are the automated guided vehicle (AGV) operation synchronisation mechanisms in flexible manufacturing systems, enabling determination of the travel schedules via some preset travelling route intervals. In many practical cases transport operations are repetitive. For this type of systems the transport processes can be modelled as a system of cyclic concurrent processes sharing common resources with mutual exclusion. The processes examination has to guarantee the collision-free and deadlock free AGVs flow. In this paper the problem of determination of the rules coordinating access of the vehicles to the shared travel route intervals, ensuring the collision-free and deadlock-free execution of the repetitive processes was reduced to determination of the sufficient conditions. In particular the problem of searching for a pair is defined in the form of the constraint satisfaction problem (CSP) and is solved with use of the logic programming techniques.
The Job-Shop Scheduling Problem (JSSP) is an extremely difficult problem because it requires very large combinational search space and the precedence constraint between machines. A software tool called Hybrid and Flex...
详细信息
ISBN:
(纸本)1424413656;9781424413652
The Job-Shop Scheduling Problem (JSSP) is an extremely difficult problem because it requires very large combinational search space and the precedence constraint between machines. A software tool called Hybrid and Flexible Genetic Algorithm (HybFlexGA) was developed for solving the JSSP. Computational results demonstrate that the proposed HybFlexGA is very efficient and potentially useful in solving the JSSP. The results obtained with standard JSSP benchmark demonstrate its efficiency.
暂无评论