Most research in keystroke biometrics has focused on one-time authentication of users. This paper presents some motivations for dynamic biometric authentication and a method for using keystroke biometrics as a tool to...
详细信息
ISBN:
(纸本)9781604234961
Most research in keystroke biometrics has focused on one-time authentication of users. This paper presents some motivations for dynamic biometric authentication and a method for using keystroke biometrics as a tool to implement continuing re-authentication of users during a session. Rather than having a different typing phrase for each user as do standard one-time authentication systems, this method uses a single feature vector that can be extracted from a variety of different phrases, so that a user can be re-authenticated using one of several phrases. Initial experimentation using a small number of training samples and a simple feature vector resulted in correctly identifying imposters 91% of the time with reasonable false rejection rates, which is promising for further enhancement of this approach.
Message Passing is a popular mechanism used to enable inter-process communication in parallel and distributed computing. Many complex scientific and engineering applications that are executed on clusters have been dev...
详细信息
The advent of service-oriented Grid computing has resulted in the need for Grid resources such as clusters to enforce user-specific service needs and expectations. Service Level Agreements (SLAs) define conditions whi...
详细信息
It is well known that errors introduced early in the development process are commonly the most expensive to correct. The increasingly popular model-driven architecture (MDA) exacerbates this problem by propagating the...
详细信息
Increasingly, software should dynamically adapt its behavior at run-time in response to changing conditions in the supporting computing and communication infrastructure, and in the surrounding physical environment. In...
详细信息
ISBN:
(纸本)1595933751
Increasingly, software should dynamically adapt its behavior at run-time in response to changing conditions in the supporting computing and communication infrastructure, and in the surrounding physical environment. In order for an adaptive program to be trusted, it is important to have mechanisms to ensure that the program functions correctly during and after adaptations. Adaptive programs are generally more difficult to specify, verify, and validate due to their high complexity. Particularly, when involving multi-threaded adaptations, the program behavior is the result of the collaborative behavior of multiple threads and software components. This paper introduces an approach to create formal models for the behavior of adaptive programs. Our approach separates the adaptation behavior and nonadaptive behavior specifications of adaptive programs, making the models easier to specify and more amenable to automated analysis and visual inspection. We introduce a process to construct adaptation models, automatically generate adaptive programs from the models, and verify and validate the models. We illustrate our approach through the development of an adaptive GSM-oriented audio streaming protocol for a mobile computing application. Copyright 2006 ACM.
Achieving acceptable quality of service in highly dynamic computing environments requires not only adaptation and reconfiguration of individual components of the system, but also collaboration among these components. ...
详细信息
With the emergence of aspect-oriented (AO) techniques, crosscutting concerns can be now explicitly modularized and exposed as additional variabilities in program families Hence, the development of highly customizable ...
详细信息
ISBN:
(纸本)9781627486606
With the emergence of aspect-oriented (AO) techniques, crosscutting concerns can be now explicitly modularized and exposed as additional variabilities in program families Hence, the development of highly customizable software family architectures requires the explicit handling of crosscutting variabilities through domain engineering and application engineering steps In this context, this paper presents a generative model that addresses the implementation and instantiation of variabilities encountered in AO software family architectures The use of our model allows for an early specification and preparation of AO variabilities, which in turn can be explicitly customized by means of domain engineering activities All the variabilities of the architecture are modeled using feature models In application engineering, developers can request an instance of the AO architecture in a process of two stages: (i) the definition of a feature model instance which specifies the resolution of variabilities for the AO family architecture;and (ii) the definition of a set of crosscutting relationships between features.
This paper considers the composition of a DIDS (Distributed Intrusion Detection System) by integrating heterogeneous IDSs (Intrusion Detection systems). A Grid middleware is used for this integration. In addition, an ...
详细信息
It has been considered bon ton to blame locks for their fragility, especially since researchers identified obstruction-freedom: a progress condition that precludes locking while being weak enough to raise the hope for...
详细信息
ISBN:
(纸本)1595933840
It has been considered bon ton to blame locks for their fragility, especially since researchers identified obstruction-freedom: a progress condition that precludes locking while being weak enough to raise the hope for good performance. This paper attenuates this hope by establishing lower bounds on the complexity of obstruction-free implementations in contention-free executions: those where obstruction-freedom was precisely claimed to be effective. Through our lower bounds, we argue for an inherent cost of concurrent computing without locks. We first prove that obstruction-free implementations of a large class of objects, using only overwriting or trivial primitives in contention-free executions, have Ω(n) space complexity and Ω(log2 n) (obstruction-free) step complexity. These bounds apply to implementations of many popular objects, including variants of fetch&add, counter, compare&swap, and LL/SC. When arbitrary primitives can be applied in contention-free executions, we show that, in any implementation of binary consensus, or any perturbable object, the number of distinct base objects accessed and memory stalls incurred by some process in a contention free execution is Ω(√n). All these results hold regardless of the behavior of processes after they become aware of contention. We also prove that, in any obstruction-free implementation of a perturbable object in which processes are not allowed to fail their operations, the number of memory stalls incurred by some process that is unaware of contention is Ω(n). Copyright 2006 ACM.
We propose and experiment a Social Networking Service (SNS) for local communities for tsunami disaster control. It is an easy-to-use GIS-based system with powerful GIS analysis capabilities. One of the features of the...
详细信息
ISBN:
(纸本)9780780397408
We propose and experiment a Social Networking Service (SNS) for local communities for tsunami disaster control. It is an easy-to-use GIS-based system with powerful GIS analysis capabilities. One of the features of the system is resident participation. The GIS layer structure proposed in this paper nicely supports this user participation. The system architecture and the use of the system for tsunami disaster control are discussed. We report ongoing developments in Hachinohe-City, Japan.
暂无评论