2663170
A Framework for Building Privacy-Conscious Composite Web Services
The rapid growth of Web applications has prompted increasing interest in the area of composite Web services that involve several service providers. The potential for such composite Web services can be realized only if consumer privacy concerns are satisfactorily addressed. In this paper, we propose a framework that addresses consumer privacy concerns in the context of highly customizable composite Web services. Our approach involves service producers exchanging their terms-of-use with consumers in the form of "models". Our framework provides automated techniques for checking these models at the consumer site for compliance of consumer privacy policies. In the event of a policy violation, our framework supports automatic generation of "obligations" that the consumer generates for the composite service. These obligations are automatically enforced through a dynamic program analysis approach on the Web service composition code. We illustrate our approach with the implementation of two example services
1723065
An approach for realizing privacy-preserving web-based services
The past decade has witnessed a phenomenal growth in the number of users who routinely use the web to obtain information, conduct research, or carry out financial transactions. While the ability of the web to provide customized information and financial services has boosted personal and business productivity, it has raised significant concerns regarding an individual’s privacy. The privacy concerns are exacerbated further with the advent of more complex services that involve multiple service providers, as it raises the potential of personal information being shared across these providers in ways that weren’t intended by the owner of the information. To illustrate the increased privacy concerns raised by composite web-based services, consider a web-based service that allows an individual to research and order over-the-counter medication (or health supplements) at a low cost, while ensuring that there are no adverse interactions based on the individuals current prescription. Such a service will require access to the individual’s personal medical history, and will also require interaction with other entities such as web-based medical references, discount pharmacies and creditcard companies. Users may not want their personal health histories to be shared with discount pharmacies or credit card companies. Similarly, they may not want their credit card information to be shared with providers of free on-line information. Web-based service providers have long recognized the importance of addressing user privacy concerns, and taken steps to state their policies regarding the storage and use of personal user information. Unfortunately, since these policies are stated in English, they are imprecise and ambiguous, posing problems in accountability and enforceability, as well as in checking compatibility between consumer and provider policies. Indeed, the verbose nature of these policies discourage most users from even reading them! To address the above problem, we present a new approach where the consumers as well as providers can express their privacy concerns in a formal way. Specifically, consumers express their requirements in the form of policies, while providers specify their use of consumer data using models. Our approach automates compatibility checking between policies and models. If there is an incompatibility, the consumer is informed how she can refine her policies in order to use the service. If she does not want to change her policies in any way, the approach passes on additional privacy requirements to the provider. Service access can continue in case
156293
An efficient and backwards-compatible transformation to ensure memory safety of C programs
Memory-related errors, such as buffer overflows and dangling pointers, remain one of the principal reasons for failures of C programs. As a result, a number of recent research efforts have focused on the problem of dynamic detection of memory errors in C programs. However, existing approaches suffer from one or more of the following problems: inability to detect all memory errors (e.g., Purify), requiring non-trivial modifications to existing C programs (e.g., Cyclone), changing the memory management model of C to use garbage collection (e.g., CCured), and excessive performance overheads. In this paper, we present a new approach that addresses these problems. Our approach operates via source code transformation and combines efficient data-structures with simple, localized optimizations to obtain good performance.
5950596
Parallelism in Structured Newton Computations
PCT No. PCT/DE84/00257 Sec. 371 Date Aug. 13, 1985 Sec. 102(e) Date Aug. 13, 1985 PCT Filed Nov. 30, 1984 PCT Pub. No. WO85/02563 PCT Pub. Date Jun. 20, 1985.A spray pump having a connecting portion connectable to a container and whose housing is provided with co-axially step bores defining a venting chamber for venting the container and a pump chamber. The pump piston has oppositely conically divergent lips engaging the walls of the respective chambers and is hollow to receive the restoring spring which can also bear upon a checkvalve ball.
14994096
Application of Synthetic Neural Network for Fault Diagnosis of Steam Turbine Flow Passage
It is difficult to determine the normal value for fault diagnosis of steam turbine flow passage, because the flow passage fault or regenerative system fault may result in the decrease of the relative internal efficiency of steam turbine. Based on analyzing the feature of flow passage and regenerative system, the flow passage condition of steam turbine can be evaluated by relative internal efficiency of stage groups. According to various effect factors, the methods to determine the normal value of relative internal efficiency of stage groups is proposed in this paper, which include application of synthetic neural network. Compared the measured values with these normal values, the operating condition of steam turbine flow passage can be evaluated and the detailed reasons of fault can be diagnosed.
18109532
Building Document Graphs for Multiple News Articles Summarization: An Event-Based Approach
Since most of news articles report several events and these events are referred in many related documents, we propose an event-based approach to visualize documents as graph on different conceptual granularities. With graph-based ranking algorithm, we illustrate the application of document graph to multi-document summarization. Experiments on DUC data indicate that our approach is competitive with state-of-the-art summarization techniques. This graphical representation which does not require training corpora can be potentially adapted to other languages.
17935039
Data manipulation techniques to reduce phase change memory write energy
Due to its great scalability potential, phase change memory has become a topic of great current interest. However, high write energy consumption appears to be one of the biggest challenges to be tackled before phase change memory can be adopted as a mainstream memory technology. This paper presents architecture level technique to reduce phase change memory write energy consumption through data manipulations. Motivated by the fact that phase change memory read incurs much less energy than write and write of different value to a phase change memory cell incurs largely different energy, we present two memory write data manipulation techniques that can effectively reduce the overall memory write energy consumption. Their effectiveness has been demonstrated based on mathematical analysis and computer system simulation using phase change memory as the main memory in the computer memory hierarchy. Significant energy savings with up to more than 60% have been shown over a wide range of computer system benchmarks.
15658838
An Improved and Efficient Tool for Analyzing Industrial Security Protocols
Formal methods and automatic tools are always necessary for analyzing security protocols, and model checking has become a hot spot of research for its ability of verifying finite-state concurrent system automatically. In this paper, we propose a model of security protocols based on MSR (multi-set rewriting), coupled with PLTL describing security properties. Based on the model, a series of key automatic analysis algorithms close to the implementation are designed for our own tool. By using the tool, we illustrate the method’s effectiveness with some typical protocols and give the experimental results.