The elderly represent a valid group of users who can potentially benefit greatly from engaging with technology, such as healthcare systems or playing digital games. Yet, less attention has been given to the significan...
详细信息
The AAAI-10 workshop program was held on July 11-12, 2010, at the Westin Peachtree Plaza in Atlanta, Georgia. The workshop program included 13 workshops covering a wide range of topics in artificial intelligence. Ther...
详细信息
The AAAI-10 workshop program was held on July 11-12, 2010, at the Westin Peachtree Plaza in Atlanta, Georgia. The workshop program included 13 workshops covering a wide range of topics in artificial intelligence. There were several presentations on particular formalisms for combining the levels of planning from the perspectives of classical planning, motion planning, POMDPs, search-based planning, and temporal logic-based constraints. Henry Lieberman from Massachusetts Institute of Technology Media laboratory presented work developing a platform for knowledge acquisition and usage from expert users, built upon experience with eliciting information from nonexperts in a collaborative manner. The objective of the AAAI Workshop on Goal-Directed Autonomy (GDA) was to encourage discussion and novel contributions on intelligent agents that can self-select their goals. Jeremy Baxter from QinetiQ focused on user interaction, while Nick Hawes described a goal-directed reasoning framework for controlling a mobile robot.
Randić et al. proposed a significant graphical representation for DNA sequences, which is very compact and avoids loss of information. In this paper, we build a fast algorithm for this graphical representation with ti...
详细信息
Randić et al. proposed a significant graphical representation for DNA sequences, which is very compact and avoids loss of information. In this paper, we build a fast algorithm for this graphical representation with time complexity O(n 2 ), and find another important advantage in the representation: no degeneracy. Moreover, we propose a new method to do similarity analysis of DNA sequences based on the representation. The approach adopts four elements of covariance matrix as a descriptor, and is illustrated on the first exon of beta-globin genes from 11 different species.
A recent primitive known as asymmetric group key agreement allows a group of users to negotiate a common encryption key which is accessible to any entities while each user holds her respective secret decryption key. T...
详细信息
A recent primitive known as asymmetric group key agreement allows a group of users to negotiate a common encryption key which is accessible to any entities while each user holds her respective secret decryption key. This concept not only enables confidential communications among group users but also permits any outsider to send encrypted messages to the group. The existing instantiation is only secure against passive adversaries. In this paper, we first propose an authenticated asymmetric group key agreement protocol which captures the practical security properties against active attacks. Based on our protocol, we then propose a broadcast encryption system without relying on a trusted dealer to distribute the secret keys to the users. Our system has also short ciphertexts. Furthermore, the proposal is equipped with the perfect forward security property.
Partial order reduction techniques have been used to combat the state explosion problem in model checking procedures for concurrent systems with probabilistic behaviors. There are some results that give criteria on ap...
详细信息
ISBN:
(纸本)9781424465972;9780769540115
Partial order reduction techniques have been used to combat the state explosion problem in model checking procedures for concurrent systems with probabilistic behaviors. There are some results that give criteria on applying partial order reduction for verifying quantitative time properties and reward-based properties on actions. However, there are many situations that reward-based properties are expressed on states rather than on actions because actions are triggered in no time and the quantities can not be obtained easily. This paper presents reduction criteria for a probabilistic temporal logic that allows specification of restrictions on quantitative measures given by spatial resources function for the states of the considered system and provides the proof of the correctness.
This paper proposes a generalized model by extending Markov chain with spatial resources labels, which can describe the functional and performance properties and some basic characteristics such as nondeterminacy and r...
详细信息
This paper proposes a generalized model by extending Markov chain with spatial resources labels, which can describe the functional and performance properties and some basic characteristics such as nondeterminacy and randomicity. The syntax and semantics of the new model are shown based on the existing temporal logics such as CSRL and pathCSRL. The model checking procedure is discussed and thus the practicability of the new model is intuitive. Based on the existing models, the proposed model includes spatial resources labels only by adding the spatial information to the existing labels of states, so the treatment of the state explosion problem is similar to that in the existing models.
Facial expression is one of the most expressive ways for human beings to deliver their emotion, intention, and other nonverbal messages in face to face communications. In this chapter, a layered parametric framework i...
详细信息
Utilizing virtualization technology to combine real-time operating system(RTOS)and off-the-shelf time-sharing general purpose operating system (GPOS)is attracting much more interest *** combination has the potential t...
详细信息
Utilizing virtualization technology to combine real-time operating system(RTOS)and off-the-shelf time-sharing general purpose operating system (GPOS)is attracting much more interest *** combination has the potential to provide a large application base,and to guarantee timely deterministic response to real-time applications,yet there is no convincible experimental result about its real-time *** this paper,we analyze the interrupt latency of RTOS running on Linux KVM based on some preliminary tunings,and find out System Management Interrupt (SMI) is the main factor which makes the maximum latency unideal, so we propose a method to limit the worst-case interrupt latency in an acceptable ***,we also find out that boosting priority may result in wastes of CPU resources when RTOS is not executing real-time tasks,so we design a co-scheduling mechanism to improve the CPU throughput of the GPOS system.
GPUs are many-core processors with tremendous computational power. However, as automatic parallelization has not been realized yet, developing high-performance parallel code for GPUs is still very challenging. The pap...
详细信息
GPUs are many-core processors with tremendous computational power. However, as automatic parallelization has not been realized yet, developing high-performance parallel code for GPUs is still very challenging. The paper presents a novel translation framework designed for virtual execution environment based on CPU/GPU architecture. It addresses two major challenges of taking advantage of general purpose computation on graphics processing units (GPGPU) to improve performance: no rewriting the existing source code and resolving binary compatibility issues between different GPUs. The translation framework uses semi-automatic parallelization technology to port existing code to explicitly parallel programming models. It not only offers a mapping strategy from X86 platform to CUDA programming model, but also synchronizes the execution between the CPU and the GPUs. The input to our translation framework is parallelizable part of the program within binary code. With an additional information related to the parallelizable part, the translation framework transforms the sequential code into PTX code and execute it on GPUs. Experimental results on several programs from CUDA SDK Code Samples and Parboil Benchmark Suite show that our translation framework could achieve very high performance, even up to several tens of times speedup over the X86 native version.
Measurement based quantum computation, which requires only single particle measurements on a universal resource state to achieve the full power of quantum computing, has been recognized as one of the most promising mo...
详细信息
Measurement based quantum computation, which requires only single particle measurements on a universal resource state to achieve the full power of quantum computing, has been recognized as one of the most promising models for the physical realization of quantum computers. Despite considerable progress in the past decade, it remains a great challenge to search for new universal resource states with naturally occurring Hamiltonians and to better understand the entanglement structure of these kinds of states. Here we show that most of the resource states currently known can be reduced to the cluster state, the first known universal resource state, via adaptive local measurements at a constant cost. This new quantum state reduction scheme provides simpler proofs of universality of resource states and opens up plenty of space to the search of new resource states.
暂无评论