Financial derivatives are contracts concerning rights and obligations to engage in future transactions on some underlying financial instrument. A major con-cern in financial markets is to compute an expected value of ...
详细信息
RFID is automatic object identifying technology via radio frequency. And its application areas are un-describable for its convenience and pervasiveness. However, because the communication channel between the verifier ...
详细信息
ISBN:
(纸本)9780387741581
RFID is automatic object identifying technology via radio frequency. And its application areas are un-describable for its convenience and pervasiveness. However, because the communication channel between the verifier and the tag is wireless, serious privacy problems such as the data leakage and the data traceability can be occur. Without resolving these privacy problems, RFID system cannot be adapted fully in any area. Many kinds of security protocols have been proposed to resolve these problems. However, previous proposals did not satisfy security requirements and still leaved vulnerabilities. In this paper, we describe the security vulnerabilities of previous works for RFID systems. Finally, we propose a security protocol which based on one-time pad scheme using random nonce and shared secret values. The proposed protocol satisfies security requirements such as the data secrecy, data anonymity and the data authenticity between the verifier and the tag. We have proved security requirements satisfaction formally by using GNY logic.
We consider a system of agents as a layer between services and the network hosts. We present a self-organizing system of agents able to offer services with an increase of the speed, and decrease of the network traffic...
详细信息
ISBN:
(纸本)0769525288
We consider a system of agents as a layer between services and the network hosts. We present a self-organizing system of agents able to offer services with an increase of the speed, and decrease of the network traffic. A coordination model defines how the agents interact, and how their interactions can be controlled;this includes dynamic creation and destruction of agents, control of communication flows among agents, control of spatial distribution of agents, as well as synchronization of actions over time. Various distances and topological relations are used to explain our self-organizing mechanism. We analyze the stability of the system, and provide a new result regarding a weak form of stability depending only on the moment of the first requests of agents by hosts. Finally we provide a visualization of the services evolution using self-organizing maps, and presenting a service clustering structure.
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CPS (concurrent pushdown systems) [QR05...
详细信息
Complex software systems typically involve-features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formalize languages comprising all these featu...
详细信息
ISBN:
(纸本)9780769526249
Complex software systems typically involve-features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formalize languages comprising all these features. In this paper we integrate probability, time and concurrency in one single model, where the concurrency-feature is modelled using shared-variable based communication. The probability feature is represented by a probabilistic nondeterministic choice, probabilistic guarded choice and a probabilistic version of parallel composition. We formalize an operational semantics for such an integration. Based on this model we define a bisimulation relation, from which an observational equivalence between probabilistic programs is investigated and a collection of algebraic laws are explored. We also implement a prototype of the operational semantics to animate the execution of probabilistic programs.
The incorrect use of pointers is one of the most common source of software errors. Concurrency has a similar characteristic. Proving the correctness of concurrent pointer manipulating programs, let alone algorithmical...
详细信息
Current Wiki engines are mostly monolithic applications which intermingle parser, user interface and data management backend. In this paper we show how these three components can be realised as lightweight, REST-style...
详细信息
ISBN:
(纸本)9781595934130
Current Wiki engines are mostly monolithic applications which intermingle parser, user interface and data management backend. In this paper we show how these three components can be realised as lightweight, REST-style web services. We explain why this separation is useful and how the wiki community benefits from such an approach. Additionally, the presented wiki allows semantic statements and queries over the model.
We consider a system of agents as a layer between services and the network hosts. We present a self-organizing system of agents able to offer services with an increase of the speed, and decrease of the network traffic...
详细信息
We consider a system of agents as a layer between services and the network hosts. We present a self-organizing system of agents able to offer services with an increase of the speed, and decrease of the network traffic. A coordination model defines how the agents interact, and how their interactions can be controlled; this includes dynamic creation and destruction of agents, control of communication flows among agents, control of spatial distribution of agents, as well as synchronization of actions over time. Various distances and topological relations are used to explain our self-organizing mechanism. We analyze the stability of the system, and provide a new result regarding a weak form of stability depending only on the moment of the first requests of agents by hosts. Finally we provide a visualization of the services evolution using self-organizing maps, and presenting a service clustering structure.
Signal transition graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence of a consistent and complete state enco...
详细信息
Signal transition graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence of a consistent and complete state encoding. For an important subclass of STGs, the marked graph STGs, we show that checking consistency is polynomial, but checking the existence of a complete state coding is co-NP-complete. In fact, co-NP-completeness already holds for acyclic and 1-bounded marked graph STGs and for live and 1-bounded marked graph STGs. We add some relevant results for free-choice, bounded, and general STGs
暂无评论