ppxscal/embedding_network huggingface dataset:
Emergent process design
Authors: Olga Jaufman
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
Certified E-Mail Delivery with DSA Receipts
Authors: Aleksandra Nenadic, Ning Zhang, Qi Shi, Carole Goble
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

In this paper we present two variant protocols DSA-CEMD1 and DSA-CEMD2 for certified e-mail delivery with DSA receipts.The protocols are based on a cryptographic primitive called Verifiable and Recoverable Encryption of a Signature (VRES) and are capable of achieving non-repudiation and strong fairness security properties.The novel design of the VRES primitive allows efficiency improvements in comparison with the related certified e-mail delivery protocols based on similar primitives.The protocols employ the services of an off-line and invisible Trusted Third Party (TTP) only in case of dispute.In DSA-CEMD1 the content of the e-mail message is not revealed to the TTP during possible recovery and this is achieved at the cost of some additional cryptographic operations.In DSA-CEMD2 the confidentiality of the message is not protected from the TTP, but the protocol is slightly more efficient.
Reasoning about commitments in multiple concurrent negotiations
Authors: Thuc Duong Nguyen, Nicholas R. Jennings
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Automated negotiation by software agents is a key enabling technology for agent mediated e-commerce. To this end, this paper considers an important class of such negotiations - namely those in which an agent engages in multiple concurrent bilateral negotiations for a good or service. In particular, we consider the situation in which a buyer agent is looking for a single service provider from a number of available ones in its environment. By bargaining simultaneously with these providers and interleaving partial agreements that it makes with them, a buyer can reach good deals in an efficient manner. However, a key problem in such encounters is managing commitments since an agent may want to make intermediate deals (so that it has a definite agreement) with other agents before it gets to finalize a deal at the end of the encounter. To do this effectively, however, the agents need to have a flexible model of commitments that they can reason about in order to determine when to commit and to decommit. This paper provides and evaluates such a commitment manager and integrates it into the negotiation model.
Dynamic Generalized Assignment Problems with Stochastic Demands and Multiple Agent-Task Relationships
Authors: Konstantin Kogan, Eugene Khmelnitsky, Toshihide Ibaraki
Venue: Journal of Global Optimization (2005)

The assignment problem is a well-known operations research model. Its various extensions have been applied to the design of distributed computer systems, job assignment in telecommunication networks, and solving diverse location, truck routing and job shop scheduling problems.This paper focuses on a dynamic generalization of the assignment problem where each task consists of a number of units to be performed by an agent or by a limited number of agents at a time. Demands for the task units are stochastic. Costs are incurred when an agent performs a task or a group of tasks and when there is a surplus or shortage of the task units with respect to their demands. We prove that this stochastic, continuous-time generalized assignment problem is strongly NP-hard, and reduce it to a number of classical, deterministic assignment problems stated at discrete time points. On this basis, a pseudo-polynomial time combinatorial algorithm is derived to approximate the solution, which converges to the global optimum as the distance between the consecutive time points decreases. Lower bound and complexity estimates for solving the problem and its special cases are found.
Heroic failures in disseminating novel e-learning technologies to corporate clients: a case study of interactive webcasting
Authors: Peter J Scott, Kevin Quick
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

In principle, it should be easier to disseminate novel learning concepts based in technology enhanced learning to companies. Unfortunately, many corporations seem to be extremely risk averse, and the challenges inherent in the new models seem to be very hard for them to accept. This paper uses the deployment of interactive webcasting systems to present a series of case studies of dissemination successes and failures. We will suggest that the key to successful deployment is in making critical innovation (and its risk) invisible to the client, whilst matching their expectations with an "appropriate" level of technology. This work has led to a new dissemination portal "Prolearn.TV".
1-V 7-mW dual-band fast-locked frequency synthesizer
Authors: Vikas Sharma, Chien-Liang Chen, Chung-Ping Chen
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper presents a fully integrated 1-V, dual band, fast-locked frequency synthesizer for IEEE 802.11 a/b/g WLAN applications. It can synthesize frequencies in the range of 2.4 - 2.7 GHz with a step of 9.375 MHz, and in the range of 5.14 - 5.70 GHz with a step of 20 MHz. Simulation using 0.18-μm rf and mixed-signal CMOS technology demonstrates a total power consumption of 7-mW. An adaptive bandwidth controller is employed to achieve a fast locking time. The frequency divider combines the conventional and the extended true-single-phase-clock logics. To ensure a proper dividing function, a cascode voltage switch (CVS) topology is used in the preamplifier stage. The reference spurs at an offset of 10-MHz are as low as -80 dBc, and the phase noise at an offset of 1 MHz is lower than -118 dBc for the entire tuning range.
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Authors: Jochen Alber, Frederic Dorn, Rolf Niedermeier
Venue: Discrete Applied Mathematics (2005)

Many NP-complete problems on planar graphs are "fixed-parameter tractable:" Recent theoretical work provided tree decomposition-based fixed-parameter algorithms exactly solving various parameterized problems on planar graphs, among others VERTEX COVER, in time O(c√kn). Here, c is some constant depending on the graph problem to be solved, n is the number of graph vertices, and k is the problem parameter (for VERTEX COVER this is the size of the vertex cover).In this paper, we present an experimental study for such tree decomposition-based algorithms focusing on VERTEX COVER. We demonstrate that the tree decomposition-based approach provides a valuable way of exactly solving VERTEX COVER on planar graphs. Doing so, we also demonstrate the impressive power of the so-called Nemhauser/Trotter theorem which provides a VERTEX COVER-specific, extremely useful data reduction through polynomial time preprocessing. Altogether, this underpins the practical importance of the underlying theory.
The SEI curriculum modules and their influence: Norm Gibbs' legacy to software engineering education
Authors: David Budgen, James E. Tomayko
Venue: Journal of Systems and Software (2005)

The Software Engineering Institute (SEI) at Carnegie Mellon University started its first contract with a carte blanche opportunity and generous funding to improve the state of software engineering education. Norm Gibbs, the first Director of Education at the SEI guided efforts in this area. One of his innovations, discussed here, were the "curriculum modules" encapsulating software engineering knowledge. We describe the scope and form of the curriculum modules, together with our personal experiences of developing the prototype modules. We conclude with an informal assessment of how well the original set of SEI curriculum modules match current ideas, both about software engineering education and also about the activities and practices that make up software engineering as a discipline.
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
Authors: Hipólito Hernández-Pérez, Juan-José Salazar-González
Venue: Discrete Applied Mathematics (2004)

We study a generalization of the well-known traveling salesman problem (TSP) where each customer provides or requires a given non-zero amount of product, and the vehicle in a depot has a given capacity. Each customer and the depot must be visited exactly once by the vehicle supplying the demand while minimizing the total travel distance. We assume that the product collected from pickup customers can be delivered to delivery customers. We introduce a 0-1 integer linear model for this problem and describe a branch-and-cut procedure for finding an optimal solution. The model and the algorithm are adapted to solve instances of TSP with pickup and delivery. Some computational results are presented to analyze the performance of our proposal.
The effect touching a projection augmented model has on perception and object-presence
Authors: Emily Bennett
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper outlines the PhD thesis entitled 'The effect touching a Projection Augmented model has on perception and object-presence'.
Dias.net: a virtual platform of IT services for small organizations
Authors: José-Juan Hernandez-Cabrera, Mario Caballero-Ramirez, Mario Hernandez-Tejera
Venue: Proceedings of the IEEE EEE05 international workshop on Business services networks (2005)

This work describes Dias.net, a virtual platform offering IT services to small organisations, both public and private (SME's, small local councils...) and in disperse geographical locations. It was proposed as a solution for those organisations with neither the financial resources nor the technological knowledge necessary for them to be able to exploit information technologies using the technological environments that are standard in large organisations. The work discusses the motivation and describes the conceptual model and the architecture of the platform. At present, the platform is in the trial and evaluation stage in a group of organisations. Dias.grid is the deliverable of the project, which is carried out under the 5th Framework Programme of European Research.
Quantity flexibility contracts under Bayesian updating
Authors: Jianghua Wu
Venue: Computers and Operations Research (2005)

In this paper, we consider a decentralized supply chain consisting of two independent players--a manufacturer and a retailer. Under a quantity flexibility contract, the retailer first proposes an initial forecast as the production reference to the manufacturer. Then she uses Bayesian procedure to update demand information, and makes ultimate purchase commitment, which is constrained by the negotiated flexibility and the manufacturer's production. We model the incentives of both parties and investigate the effect of flexibility ω, transfer price c and number of Bayesian updates n on the performance of two parties. Our theoretical analysis and numerical results show that given other parameters fixed, more flexibility always benefits the retailer, while the manufacturer can only benefit from very small quantity flexibility. In addition, this contract allows them to share the benefits from information updating.
Integrating security across the computer science curriculum
Authors: Linda Null
Venue: Journal of Computing Sciences in Colleges (2004)

Although the ACM CC-2001 has not listed computer security as one of the bodies of knowledge, with today's current security situation, it is important that security be part of an undergraduate education. Some institutions offer a specific course on security; however, many of us are not afforded that luxury. Yet another approach is to integrate security into both lower level introductory courses as well as upper division capstone courses. This can be rather complicated, as most instructors lack the necessary knowledge in the rapidly-changing field of security to feel comfortable discussing security topics in their classes. We therefore propose a comprehensive means for integrating security across the curriculum that does not require security proficiency. This approach is derived from a workshop given at SIGCSE in 2002 and has been successful at our university.
A Programmable Iontophoretic Instrument and Its Application for Local Anesthesia Before Surgery in Urology
Authors: Mahmut Tokmakçi, Oğuz Ekmekçioğlu, Mustafa Alçi
Venue: Journal of Medical Systems (2005)

In this paper, for an alternative anesthesia before transurethral resection of bladder tumors (TUR-BT) an original equipment which is used iontophoresis method was implemented. The implemented instrument is used on five patients for TUR-BT operations. This equipment can be programmable between 0 and 15 mA current by 1 mA steps and with in time 0--59 min. Also, frequency value of applying currents can be changed in 1--3 KHz frequency range. The use of iontophoresis in urology is relatively new. This method recently has been used in urology because of its simple usage in applying local anesthesia, and an alternative for general anesthesia.
C++ templates considered harmful
Authors: H. Paul Haiduk
Venue: Journal of Computing Sciences in Colleges (2004)

C++ is considered by many professional software developers and educators to be the lingua franca of programming languages. Once mastered, its power of expression is nearly limitless for the class of problems for which an imperative and object-oriented programming language is suited. Template classes are one feature of the language that are widely embraced and taught. In fact it seems that the majority of C++ CS II texts rely heavily on the use of templates with discussion of inheritance and polymorphism given token treatment. This emphasis is harmful to and constrains the student's understanding of data abstraction, inheritance and polymorphism by focusing on the encapsulation facet of object-oriented programming and ignoring inheritance and polymorphism. This paper presents an alternative approach that permits a C++-based CS II experience to also prepare students to deal with collection classes as realized in Java and C#, for example.
Fast watermark detection scheme for camera-equipped cellular phone
Authors: Takao Nakamura, Atsushi Katayama, Masashi Yamamuro, Noboru Sonehara
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

Digital watermarking technology would be very useful as part of a related service introduction system (RSIS); this system provides related information to content, and the function of watermark in RSIS is analogous to that of barcode, i.e., watermark binds content ID to analog content such as an image on printed material.In this paper, we focus on a camera-equipped cellular phone used as a terminal for RSIS, and propose a fast watermark detection scheme from a captured image. The proposed scheme consists of two processes, one is to correct geometric distortion of the captured image, and the other is to detect watermark information from the rectified image. We also propose a new watermarking algorithm which is robust against small geometric distortion and suitable for the proposed scheme. Moreover, we introduce a quantitative evaluation method for indicating detection reliability, which is indispensable for RSIS service.Finally, we show that the proposed scheme enables users to detect embedded information in approximately one second, even when implemented as a Java application on a cell phone with limited resources, and report experiments that confirm the proposed scheme's efficiency.
Fast Address Translation Techniques for Distributed Shared Memory Compilers
Authors: Francois Cantonnet, Tarek A. El-Ghazawi, Pascal Lorenz, Jaafer Gaber
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

The Distributed Shared Memory (DSM) model is designed to leverage the ease ofprogramming of the shared memory paradigm, while enabling the highperformance by expressing locality as in the messagepassing model. Experience, however, has shown that DSM programming languages, such as UPC, may be unable to deliver the expected high level of performance. Initial investigations have shown that among the major reasons is the overhead of translating from the UPC memory model to the target architecture virtualaddresses space, which can be very costly. Experimental measurements have shown this overhead increasing execution time by up to three orders of magnitude. Previous work has also shown that some of this overhead can be avoided by hand-tuning, which on the other hand can significantly decrease the UPC ease of use. In addition, such tuning can only improve the performance of local shared accesses but not remote shared accesses. Therefore, a new technique that resembles the Translation Look Aside Buffers (TLBs) is proposed here. This technique, which is called the Memory Model Translation Buffer (MMTB) has been implemented in the GCC-UPC compiler using two alternative strategies, full-table (FT) and reduced-table (RT). It will be shown that the MMTB strategies can lead to a performance boost of up to 700%, enabling ease-of-programming while performing at a similar performance to hand-tuned UPC and MPI codes.
(Semi-)automatic detection of errors in PoS-tagged corpora
Authors: Pavel Květoň, Karel Oliva
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

This paper presents a simple yet in practice very efficient technique serving for automatic detection of those positions in a part-of-speech tagged corpus where an error is to be suspected. The approach is based on the idea of learning and later application of "negative bigrams", i.e. on the search for pairs of adjacent tags which constitute an incorrect configuration in a text of a particular language (in English, e.g., the bigram ARTICLE - FINITE VERB). Further, the paper describes the generalization of the "negative bigrams" into "negative n-grams", for any natural n, which indeed provides a powerful tool for error detection in a corpus. The implementation is also discussed, as well as evaluation of results of the approach when used for error detection in the NEGRA&reg; corpus of German, and the general implications for the quality of results of statistical taggers. Illustrative examples in the text are taken from German, and hence at least a basic command of this language would be helpful for their understanding - due to the complexity of the necessary accompanying explanation, the examples are neither glossed nor translated. However, the central ideas of the paper should be understandable also without any knowledge of German.
Book review: 1-2-3 Macro Library (3rd Edition) by David Paul Ewing (QUE Corporation 1990)
Venue: ACM SIGSMALL/PC Notes (1991)

This hefty 734-page book isolates a major feature of Lotus 1-2-3 which is the creation, development and use of MACROS as a tool to facilitate one's work with spreadsheets. Macros are especially useful when one realizes the number of repetitive keystrokes that can be reduced in a given work session if one only knew how and if the software package were capable of storing your keystrokes. Anymore now, most productivity packages whether they be wordprocessors, spreadsheets or databases come equipped with these keystroke-saving features called MACROS. Thus, learning how to make use of MACROS can certainly save the user a lot of keystrokes. However, one should already be proficient in the basics of spreadsheet operations before tackling this book. It assumes the reader already is well-versed in the various features of 1-2-3 and therefore does not even introduce how to create a macro in its first chapter.
The Quantum Ultimatum Game
Authors: R. Vilela Mendes
Venue: Quantum Information Processing (2005)

A quantum version of the ultimatum game is studied. Both a restricted version with classical moves and the unitary version are considered. With entangled initial states, Nash equilibria in quantum games are in general different from those of classical games. Quantum versions might therefore be useful as a framework for modeling deviations from classical Nash equilibrium in experimental games.
A CORBA adapter to promote reusability of Java components
Authors: Chia-Chu Chiang, Zhendong Chen
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

As information technologies evolve, computing environments become more heterogeneous and distributed. More and more applications in different programming languages running on different platforms with different operating systems are required to communicate with each other over different computer networks. Conflicts resulting from having heterogeneous and distributed computing environments require strategies for interoperability. The emerging middleware technologies offer an industrial de facto standard communication infrastructure to support the interoperability of heterogeneous applications in components. However, the implementation of a component suffers from high interaction complexities in the component that seriously degrades the application independence. Software components should be built to be independent of the context in which they are used, allowing them to be reused in many different computing environments. In this paper, we are presenting an adapter to support the development of reusable CORBA components in Java. The adapter isolates, encapsulates, and manages a CORBA component's interactions outside the component. The use of adapters increases the reusability of CORBA components in Java and also simplifies the integration of the components to an application.
Some numerical experiments with DIFSUB
Authors: L. F. Shampine, M. K. Gordon
Venue: ACM SIGNUM Newsletter (1972)

One of the best general purpose differential equation solvers is Gear's variable order, variable step Adams code DIFSUB [1]. (It is combined with methods for the solution of stiff problems but we are only concerned with the Adams methods here.) We have done extensive numerical testing of the code, which complement the excellent comparative tests of Hull and his co-workers [2], in order to understand its design and performance. We shall report some of our observations in the hope that others will find them useful.
A parallel algorithm for static slicing of concurrent programs: Research Articles
Authors: D. Goswami, R. Mall
Venue: Concurrency and Computation: Practice Experience (2004)

Slicing of concurrent programs is a compute-intensive task. To speed up the slicing process, we have developed a parallel algorithm. For this purpose we used the concurrent control flow graph (CCFG) as the intermediate representation. We used a network of communicating processes to develop our parallel algorithm. We have implemented our parallel algorithm and the experimental results appear promising. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Achieving Information Flow Security through Precise Control of Effects
Authors: William L. Harrison, James Hook
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

This paper advocates a novel approach to the construction of secure software: controlling information flow and maintaining integrity via monadic encapsulation of effects. This approach is constructive, relying on properties of monads and monad transformers to build, verify, and extend secure software systems. We illustrate this approach by construction of abstract operating systems called separation kernels. Starting from a mathematicalmodel of shared-state concurrency based on monads of resumptions and state, we outline the development by stepwise refinements of separation kernels supporting Unix-like system calls, interdomain communication, and a formally verified security policy (domain separation). Because monads may be easily and safely represented within any pure, higher-order, typed functional language, the resulting system models may be directly realized within a language such as Haskell.