We examine five outreach programmes that introduce school students to Computer Science. All downplay programming as a pre-requisite skill for engaging with Computer Science, yet they use a wide variety of formats for ...
详细信息
Exchange protocols are an important theoretic basis to make secure electronic commerce and electronic business transactions possible, in which the fairness is a crucial property. To ensure and verify the property, a s...
详细信息
Exchange protocols are an important theoretic basis to make secure electronic commerce and electronic business transactions possible, in which the fairness is a crucial property. To ensure and verify the property, a specific model is proposed, based on the extensive game with imperfect information. Fairness is built in the protocol game and the corresponding game tree. To verify the property, a tree analysis method is offered, and a linear time algorithm is given. As a case study, some flaws of ASW protocol are found.
An aggregate signature scheme allows a public algorithm to aggregate n signatures of n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that ...
详细信息
An aggregate signature scheme allows a public algorithm to aggregate n signatures of n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that the messages have been endorsed by all the signers. Certificateless aggregate signatures allow the signers to authenticate messages without suffering from the complex certificate management in the traditional public key cryptography or the key escrow problem in identity-based cryptography. In this paper, we present a new efficient certificate less aggregate signature scheme. Compared with up-to-date certificate less aggregate signatures, our scheme is equipped with a number of attracting features: (1) it is shown to be secure under the standard computational Diffie-Hellman assumption in the random oracle model, (2) the security is proven in the strongest security model so far, (3) the signers do not need to be synchronized, and (4) its performance is comparable to the most efficient up-to-date schemes. These features are desirable in a mobile networking and computing environment where the storage/computation capacity of the end devices are limited, and due to the wireless connection and distributed feature, the computing devices are easy to be attacked and hard to be synchronized.
Research has shown that most learning in the workplace takes place outside of formal training and, given the swiftly changing nature of the field, computer science graduates more than most workers, need to be able to ...
详细信息
In this paper we propose a modification of quadratic NURSSes called EDSes (Extended Doo-Sabin Surfaces). EDSes inherit the refinement rules for quadratic NURSSes for four-sided faces but use the refinement rules for D...
详细信息
Web workloads are known to vary dynamically with time which poses a challenge to resource allocation among the applications. In this paper, we argue that the existing dynamic resource allocation based on resource util...
详细信息
Web workloads are known to vary dynamically with time which poses a challenge to resource allocation among the applications. In this paper, we argue that the existing dynamic resource allocation based on resource utilization has some drawbacks in virtualized servers. Dynamic resource allocation directly based on real-time user experience is more reasonable and also has practical significance. To address the problem, we propose a system architecture that combines real time measurements and analysis of user experience for resource allocation. We evaluate our proposal using Webbench. The experiment results show that these techniques can judiciously allocate system resources.
This paper presents an approach to the problem of documenting the design of a network of components and verifying that its structure is complete and consistent, (i.e., that the components, functioning together, will s...
详细信息
This paper presents an approach to the problem of documenting the design of a network of components and verifying that its structure is complete and consistent, (i.e., that the components, functioning together, will satisfy the requirements of the complete product), before the components are implemented. Our approach differs from others in that both hardware and software components are viewed as hardware-like devices in which an output value can change instantaneously when input values change and all components operate synchronously rather than in sequence. We define what we mean by completeness and consistency and illustrate how the documents can be used to verify a design before it is implemented.
Wireless sensor networks generate volumes of scientific observations. However, gathered data is typically not published for use by other scientists. This paper analyses the reasons that so little sensor network data i...
详细信息
Wireless sensor networks generate volumes of scientific observations. However, gathered data is typically not published for use by other scientists. This paper analyses the reasons that so little sensor network data is published online in a usable form, and identifies gaps in currently available publication systems. To address these gaps we present WebSense, a lightweight and configurable web-based tool for sensor network researchers to publish their collected data. The design goals and implementation of WebSense are described and the system is evaluated against the goals. WebSense is available from http://***/.
Service-oriented architecture and cloud computing have become the prevalent computing paradigm. In this paradigm, computing resources can be accessed like other utility services available in today's society. In th...
详细信息
ISBN:
(纸本)9780769543499
Service-oriented architecture and cloud computing have become the prevalent computing paradigm. In this paradigm, computing resources can be accessed like other utility services available in today's society. In the meantime, robotics applications are joining the trend. More and more robot applications are shifting from manufacture to non-manufacture and service industries. However, for the on-demand supply of the large-scale heterogeneous robots, It is still a problem have not yet been studied, including the fundamental management and efficiency issues in using of these resources. In this paper, we design a framework of "Robot Cloud Center" (RCC) following the general cloud computing paradigm to address the current limitations in capacity and versatility of robotic applications. In this framework, a robot can be provided as a service just like a public utility service so that everyone can access the powerful robotic services easily, efficiently, and cheaply. Based on a given scenario, a robot scheduling algorithm in RCC is proposed to take advantage of the heterogeneous robot resources to meet the end user's requirement with the minimum cost.
Navigational Programming (NavP) is a new approach to distributed programming based on migrating threads. Under this model of computation, an application is structured as a collection of processes, which can migrate au...
详细信息
Navigational Programming (NavP) is a new approach to distributed programming based on migrating threads. Under this model of computation, an application is structured as a collection of processes, which can migrate autonomously through an application-specific network of nodes. Navigational Programming has been demonstrated to have significant advantages over other programming paradigms including message passing (MP) and distributed shared memory (DSM), for general-purpose computing. JaMes is a superset of Java, in that it provides a collection of methods that implement the navigational programming model. In addition to the basic capabilities of migration and non-preemptive scheduling, JaMes extends the basic model by permitting processes to specify a priority during migration, and by allowing processes to collaborate both locally, through standard synchronization primitives, and remotely, by two different forms of send and receive operations. We illustrate the capabilities of JaMes using two representative programming examples, each chosen to illustrate a specific feature of JaMes. We also describe the performance of the chosen examples when executed under JaMes on a network of PCs.
暂无评论