15222324
Business process improvement using ebXML
EbXML is an end-to-end B2B XML framework that provides concrete specifications for dynamic B2B collaborations. EbXML has established itself as a global standard for electronic business enabling anyone, especially small and medium-size enterprises, anywhere to do business with anyone else over the Internet. It is complementary to other existing B2B initiatives; those from both business sphere (RosettaNet, TradeXchange, etc.) and from software developer community (e.g. UDDI, SOAP). Strength of ebXML lies in the fact that it arose from the direct involvement of various user groups working to solve a specific problem rather than from technology companies trying to solve a general problem and making a best guess at some standards on behalf of users.
18367763
Business process integration with Web services
Web services facilitate the creation of business process solutions in an efficient, standard way. The process solutions development with Web services requires the automation of discovery and composition of Web services. In this paper, we focus on the discovery of Web services based on the capabilities and properties of published services, and the composition of processes based on the requirements of submitted requests. We propose a solution which comprises multiple matching algorithms, first, a micro-level matching algorithm which matches the capabilities of services with activities in a process request, and, second, macro-level matching algorithms which are used to compose a business process by identifying services that satisfy the business requirements and constraints of the request. The solution from the macro-level matching algorithms is optimal in terms of meeting a certain business objective, e.g., minimizing the cost or execution time, or maximizing the total utility value of business properties of interest.
1907049
A spatial mapping algorithm for heterogeneous coarse-grained reconfigurable architectures
In this work, we investigate the problem of automatically mapping applications onto a coarse-grained reconfigurable architecture and propose an efficient algorithm to solve the problem. We formalize the mapping problem and show that it is NP-complete. To solve the problem within a reasonable amount of time, we divide it into three subproblems: covering, partitioning and layout. Our empirical results demonstrate that our technique produces nearly as good performance as hand-optimized outputs for many kernels
8097408
Combating Double-Spending Using Cooperative P2P Systems
An electronic cash system allows users to withdraw coins, represented as bit strings, from a bank or broker, and spend those coins anonymously at participating merchants, so that the broker cannot link spent coins to the user who withdraws them. A variety of schemes with various security properties have been proposed for this purpose, but because strings of bits are inherently copyable, they must all deal with the problem of double-spending. In this paper, we present an electronic cash scheme that introduces a new peer-to-peer system architecture to prevent double-spending without requiring an on-line trusted party or tamper-resistant software or hardware. The scheme is easy to implement, computationally efficient, and provably secure. To demonstrate this, we report on a proof-of-concept implementation for Internet vendors along with a detailed complexity analysis and selected security proofs.
2304269
Lightweight logging and recovery for distributed shared memory over virtual interface architecture
As software Distributed Shared Memory(DSM) systems become attractive on larger clusters, the focus of attention moves toward improving the reliability of systems. In this paper, we propose a lightweight logging scheme, called remote logging, and a recovery protocol for home-based DSM. Remote logging stores coherence-related data to the volatile memory of a remote node. The logging overhead can be moderated with high-speed system area network and user-level DMA operations supported by modern communication protocols. Remote logging tolerates multiple failures if the backup nodes of failed nodes are alive. It makes the reliability of DSM grow much higher. Experimental results show that our fault-tolerant DSM has low overhead compared to conventional stable logging and it can be effectively recovered from some concurrent failures.
61949387
Quantizer design and distributed encoding algorithm for source localization in sensor networks
In this paper, we propose a quantizer design algorithm that is optimized for source localization in sensor networks. For this application, the goal is to minimize the amount of information that the sensor nodes have to exchange in order to achieve a certain source localization accuracy. We show that this goal can be achieved more efficiently when "application-specific" quantizers are used. Our proposed quantizer design algorithm uses a cost function that takes into account the distance between the actual source position and the position estimated based on quantized data. We also propose a distributed encoding algorithm that is applied after quantization and achieves rate savings by merging quantization bins without any degradation of localization performance. The merging technique in the encoding algorithm exploits the fact that certain combinations of quantization bins at each node cannot occur because the corresponding spatial regions have an empty intersection. We apply these algorithms to a system where an acoustic sensor model is employed for localization. For this case, we introduce the equally distance-divided quantizer (EDQ), designed so that quantizer partitions correspond to a uniform partitioning in terms of distance. Our simulations show the improved performance of our quantizer over traditional quantizer designs. In addition, they show rate savings (32.8%, 5 nodes, 4 bits per node) when our novel bin-merging algorithms are used. Our results also show that an optimized bit allocation leads to significant improvements in localization performance with respect to a bit allocation that uses the same number of bits for each node.
27587473
Generalized cycle crossover for graph partitioning
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems obtaining excellent results.