Dual system encryption is a new powerful methodology first proposed by Waters in CRYPTO 2009 which can be used to prove full security (or adaptive security) for identity-based encryption and its extensions, e.g., hier...
Dual system encryption is a new powerful methodology first proposed by Waters in CRYPTO 2009 which can be used to prove full security (or adaptive security) for identity-based encryption and its extensions, e.g., hierarchical identity-based encryption (HIBE) or attribute-based encryption (ABE) *** this paper, We consider the application of dual system *** on dual system encryption, we propose a generic construction of fully secure schemes.
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.
In a proof of retrievability (POR) system, interactive POR protocols are executed between a storage server and clients, so that clients can be convinced that their data is available at the storage server, ready to be ...
详细信息
In a proof of retrievability (POR) system, interactive POR protocols are executed between a storage server and clients, so that clients can be convinced that their data is available at the storage server, ready to be retrieved when needed. In an interactive POR protocol, clients initiate challenges to the server, and the server feedbacks responses to clients with input of the stored data. Retrievability means that it should be possible for a client to extract the his/her data from the server's valid responses. An essential step-stone leading to retrievability is server's unforgeability of valid responses, i.e, any server coming up valid responses to a client's challenges is actually storing the client's data with overwhelming probability. Unforgeability can be achieved with authentication schemes like MAC, Digital Signature, etc. With homomorphic linear authentication schemes, the authenticators can be aggregated into one tag for the challenges, hence reducing the communication complexity. In this paper, we explore some new homomorphic linear authenticator schemes in POR to provide unforgeability. Compared with the recent work of Shacham and Waters, our scheme enjoys the same shortest responses, but reduces the local storage from O(s) to O(1).
Intensity inhomogeneous images, especially medical images, widely exist in real world. Considering that the existing methods can not solve intensity inhomogeneous images segmentation properly, this paper proposes a re...
详细信息
Intensity inhomogeneous images, especially medical images, widely exist in real world. Considering that the existing methods can not solve intensity inhomogeneous images segmentation properly, this paper proposes a region-based active contour model with neighborhood information. Different from existing models using global region information, the new model incorporates local information of an image into a level set formulation. By defining a new energy functional for every pixel in the image domain and utilizing the information of neighborhoods, the proposed model has the ability to extract local details, thus can segment images with intensity inhomogeneity. We also present a new approximation of the Heaviside function and Dirac function. Experimental results demonstrate that the new model has desirable performance, which is more precise than the Chan-Vese model and much faster than the Piecewise Smooth model.
Computing all diagnoses of an inconsistent ontology is important in ontology-based applications. However, the number of diagnoses can be very large. It is impractical to enumerate all diagnoses before identifying the ...
详细信息
Computing all diagnoses of an inconsistent ontology is important in ontology-based applications. However, the number of diagnoses can be very large. It is impractical to enumerate all diagnoses before identifying the target one to render the ontology consistent. Hence, we propose to represent all diagnoses by multiple sets of partial diagnoses, where the total number of partial diagnoses can be small and the target diagnosis can be directly retrieved from these partial diagnoses. We also propose methods for computing the new representation of all diagnoses in an OWL DL ontology. Experimental results show that computing the new representation of all diagnoses is much easier than directly computing all diagnoses.
software systems represent one of the most complex man-made systems. In this paper, we analyze the evolution of Object-Oriented (OO) software using complex network theory from a multi-granularity perspective. First, t...
详细信息
software systems represent one of the most complex man-made systems. In this paper, we analyze the evolution of Object-Oriented (OO) software using complex network theory from a multi-granularity perspective. First, the software net works are constructed for a multi-version software system at different levels of granularity. Then, some parameters used in complex network theory are introduced to study the topological characteristics of these software networks. By investigating the parameters' values in consecutive software networks, we have a better understanding about software evolution. A case study on an open source OO project, Azureus, is conducted as an example to illustrate our approach. It uncovers some underlying dynamic characteristics of OO systems. These results provide a different dimension to our understanding of software system dynamics and also are very useful for the design and development of OO software systems.
作者:
[Systems Research Institute
Polish Academy of Sciences Warsaw and University of Gdansk Warsaw Poland Systems Research Institute
Polish Academy of Sciences Warsaw and Management Academy Warsaw Poland Software Engineering Department
Faculty of Automatics Computers and Electronics University of Craiova Bvd.Decebal Craiova Romania University of Duisburg-Essen
Institute for Computer Science and Business Information Systems (ICB) Practical Computer Science Data Management Systems and Knowledge Representation Essen Germany
This paper aims to investigate the scalability of synchronizability for the complex clustering networks of dense rings or chains with the network scale increasing. Our results reveal that the synchronizability of the ...
详细信息
Scheduling in semiconductor manufacturing system is an important task for the industries faced with a large amount of resource competitions. Effective scheduling can improve the overall system performance and customer...
详细信息
Scheduling in semiconductor manufacturing system is an important task for the industries faced with a large amount of resource competitions. Effective scheduling can improve the overall system performance and customer satisfaction. In this paper, a scheduling method with the core of bottleneck equipment control is designed referring to Drum-Buffer-Rope (DBR) theory. In order to identify the main-bottleneck, the relative load which takes the feature of reentrance into consideration is applied. For the avoidance of local blocking, the management of sub-bottleneck is presented. As both releasing and dispatching are taken into account, a scheduling method based on the compound priority is formed. Finally, HP-24 semiconductor wafer fabrication is used as an example to demonstrate the effectiveness of the proposed method.
Transceiver-free object tracking is to trace a moving object without carrying any communication device in an environment where the environment is pre-deployed with some monitoring nodes. Among all the tracking technol...
详细信息
Transceiver-free object tracking is to trace a moving object without carrying any communication device in an environment where the environment is pre-deployed with some monitoring nodes. Among all the tracking technologies, RF-based technology is an emerging research field facing many challenges. Although we proposed the original idea, until now there is no method achieving scalability without sacrificing latency and accuracy. In this paper, we put forward a real-time tracking system RASS, which can achieve this goal and is promising in the applications like the safeguard system. Our basic idea is to divide the tracking field into different areas, with adjacent areas using different communication channels. So the interference among different areas can be prevented. For each area, three communicating nodes are deployed on the ceiling as a regular triangle to monitor this area. In each triangle area, we use a Support Vector Regression (SVR) model to locate the object. This model simulates the relationship between the signal dynamics caused by the object and the object position. It not only considers the ideal case of signal dynamics caused by the object, but also utilizes their irregular information. As a result it can reach the tracking accuracy to around 1m by just using three nodes in a triangle area with 4m in each side. The experiments show that the tracking latency of the proposed RASS system is bounded by only about 0.26s. Our system scales well to a large deployment field without sacrificing the latency and accuracy.
暂无评论