ppxscal/embedding_network huggingface dataset:
Designing electronic reference documentation for software component libraries
Authors: Erik Berglund
Venue: Journal of Systems and Software (2003)

Contemporary software development is based on global sharing of software component libraries. As a result, programmers spend much time reading reference documentation rather than writing code, making library reference documentation a central programming tool. Traditionally, reference documentation is designed for textbooks even though it may be distributed online. However, the computer provides new dimensions of change, evolution, and adaptation that can be utilized to support efficiency and quality in software development. What is difficult to determine is how the electronic text dimensions best can be utilized in library reference documentation.This article presents a study of the design of electronic reference documentation for software component libraries. Results are drawn from a study in an industrial environment based on the use of an experimental electronic reference documentation (called Dynamic Javadoc or DJavadoc) used in a real-work situation for 4 months. The results from interviews with programmers indicate that the electronic library reference documentation does not require adaptation or evolution on an individual level. More importantly, reference documentation should facilitate the transfer of code from documentation to source files and also support the integration of multiple documentation sources.
The NEMO P2P Service Orchestration Framework
Authors: William B. Bradley, David P. Maher
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

NEMO (Networked Environment for Media Orchestration) is a policy managed, peer-to-peer, service orchestration framework that supports the formation of grass roots, self organizing service networks that can enable rich media experiences. We describe some of the interesting features of the NEMO architecture, and some experimental applications. Services are distributed across peer-to-peer communicating nodes. Each node provides message routing and orchestration using a message pump and workflow collator designed specifically for NEMO. Distributed policy management of service interfaces helps to provide trust and security, supporting commercial exchange of value.P2P messaging and workflow collation allow rich services to be dynamically created from a heterogeneous set of primitive services. We examine the possibilities of P2P computing when the shared resources are services of many different types, using different service interface bindings beyond those typically supported in a web service deployment built on UDDI, SOAP, and WSDL. NEMO provides a media services framework enabling nodes to find one other, interact, exchange value, and cooperate across tiers of networks from WANs to PANs. Using NEMO, digital rights management is more concerned with policy management of service interfaces than copy protection, and new services can more easily ensure fair use. This has the potential to change the tension between consumers and content providers in the digital content domain as the NEMO enriched infrastructure provides consumers with better information, more useful services and instant gratification.
Reasoning about keys for XML
Authors: Peter Buneman, Susan Davidson, Wenfei Fan, Carmem Hara, Wang-Chiew Tan
Venue: Information Systems (2003)

We study absolute and relative keys for XML, and investigate their associated decision problems. We argue that these keys are important to many forms of hierarchically structured data including XML documents. In contrast to other proposals of keys for XML, we show that these keys are always (finitely) satisfiable, and their (finite) implication problem is finitely axiomatizable. Furthermore, we provide a polynomial time algorithm for determining (finite) implication in the size of keys. Our results also demonstrate, among other things, that the analysis of XML keys is far more intricate than its relational counterpart.
Optimal purchase decision criteria for information technology
Authors: P. Pete Chong, Ta-Tao Chuang, Ming Chang, Jason C. H. Chen
Venue: Managing IT in government business & communities (2003)

With the amount of resources dedicated to information technology (IT) expenditure today, we need to have a systematic way for assessing the elusive benefit of all IT purchases. This chapter proposes a modified Factor Rating approach that separates the subjective benefit assessment from objective cost-benefit analysis. Using this method, we often discover that for most users, due to the advancement of computer technology, the cheapest computer may be the optimal computer in the market today.
Charge-Sharing-Problem Reduced Split-Path Domino Logic
Authors: Seok-Soo Yoon, Seok-Ryong Yoon, Seon-Wook Kim, Chulwoo Kim
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

In this paper, we describe split-path domino (SP domino)logic which is capable of high speed due to the magnitudeof the charge sharing problem being halved. SP dominologic splits the NMOS stacked transistors used for logicevaluation, in order to reduce charge sharing problem,which has become one of the most critical noise problemsin VDSM technology. Furthermore, SP domino logic needsno signal ordering. Dual Vt assignment methodology forSP domino logic was also proposed, in order to provideimproved performance with low power consumptionoverhead. Our experimental results, with several logicgates using 0.18um CMOS technology, showed that theproposed logic provides an improvement in performance ofup to 17% compared to the textbook domino circuit, underthe same noisy conditions. Hence, SP domino logic is agood candidate for high-speed low-voltage operation in avery noisy environment.
Iterative processing: from applications to parallel implementations
Authors: John M. Cioffi
Venue:  (2003)

Over the last ten years, there has been a considerable interest in the area of iterative processing from the application perspective, and more recently from the theoretical perspective as well. Iterative processing indirectly exploits the global structure of a system by decomposing it into simpler local structures, and iteratively exchanging extrinsic soft information between them. This decomposition leads to a linear instead of an exponential increase in complexity. This thesis presents a new low-complexity iterative algorithm for joint channel estimation and decoding in coded orthogonal frequency-division multiplexing (OFDM) systems. The proposed iterative algorithm exploits all the information available to the receiver. It can be used to blindly estimate the channel within a single OFDM symbol or to significantly improve the performance of semi-blind systems that use a minimum amount of training to estimate and track the channel. We also propose the use of an optional outer low-density parity-check (LDPC) code in serial concatenation to offer a trade-off between latency and performance without affecting the complexity of the core iterative algorithm. The decomposition associated with iterative processing also facilitates the parallel and distributed implementation of iterative processing algorithms. This thesis investigates the implementation of iterative LDPC decoding on programmable parallel architectures, which is found to be communication-limited. We present general methodologies for optimizing the parallel decoding of LDPC codes on programmable shared-memory and message-passing architectures.
Axiomatizability in inclusive equational logics
Authors: Grigore Roşu
Venue: Mathematical Structures in Computer Science (2002)

A categorical framework for equational logics is presented, together with axiomatizability results in the style of Birkhoff. The distinctive categorical structures used are inclusion systems, which are an alternative to factorization systems in which factorization is required to be unique rather than unique &lsquo;up to an isomorphism&rsquo;. In this framework, models are any objects, and equations are special epimorphisms in &Cfr;, while satisfaction is injectivity. A first result says that equations-as-epimorphisms define exactly the quasi-varieties, suggesting that epimorphisms actually represent conditional equations. In fact, it is shown that the projectivity&sol;freeness of the domain of epimorphisms is what makes the difference between unconditional and conditional equations, the first defining the varieties, as expected. An abstract version of the axiom of choice seems to be sufficient for free objects to be projective, in which case the definitional power of equations of projective and free domain, respectively, is the same. Connections with other abstract formulations of equational logics are investigated, together with an organization of our logic as an institution.
Amorphous program slicing
Authors: Mark Harman, David Binkley, Sebastian Danicic
Venue: Journal of Systems and Software (2003)

Traditional, syntax-preserving program slicing simplifies a program by deleting components (e.g., statements and predicates) that do not affect a computation of interest. Amorphous slicing removes the limitation to component deletion as the only means of simplification, while retaining the semantic property that a slice preserves the selected behaviour of interest from the original program. This leads to slices which are often considerably smaller than their syntax-preserving counterparts.A formal framework is introduced to define and compare amorphous and traditional program slicing. After this definition, an algorithm for computing amorphous slices, based on the system dependence graph, is presented. An implementation of this algorithm is used to demonstrate the utility of amorphous slicing with respect to code-level analysis of array access safety. The resulting empirical study indicates that programmers' comprehension of array safety is improved by amorphous slicing.
Exploiting Instruction Redundancy for Transient Fault Tolerance
Authors: Toshinori Sato
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper presents an approach for integrating fault-tolerance techniques into microprocessors by utilizing instruction redundancy as well as time redundancy. Smaller and smaller transistors, higher and higher clock frequency, and lower and lower power supply voltage reduce reliability of microprocessors. In addition, microprocessors are used in systems which require high dependability, such as e-commerce businesses. Based on these trends, it is expected that the quality with respect to reliability will become important as well as performance and cost for future microprocessors. To meet the demand, we have proposed and evaluated a fault-tolerance mechanism, which is based on instruction reissue and utilizes time redundancy, and found severe performance loss. In order to mitigate the loss, this paper proposes to exploit instruction redundancy. Using the reuse table, previously executed computing is reused for checking the occurence of transient faults. From detailed simulations, we find that the performance loss caused by introducing fault-tolerance into 4-way and 8-way superscalar processors is 12.5% and 20.8%, respectively.
TIGUKAT object management system: initial design and current directions
Authors: M. Tamer Özsu, Randal Peters, Boman Irani, Anna Lipka, Adriana Munoz, Duane Szafron
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

We describe the TIGUKAT object management system that is under development at the Laboratory for Database Systems Research of the University of Alberta. TIGUKAT has a novel object model whose identifying characteristics include a purely behavioral semantics and a uniform approach to objects. Everything in the system is a first-class object with well-defined behavior. The computational model supported is one of applying behaviors to objects. A query model has been developed for TIGUKAT that is complete with a formal object calculus, an equivalent object algebra and an object SQL language. The uniformity of the model permits modeling queries as objects, opening up the possibility of developing an extensible query optimizer. A prototype implementation of TIGUKAT, including the language and its optimizer is ongoing.
Faster Suffix Tree Construction with Missing Suffix Links
Authors: Richard Cole, Ramesh Hariharan
Venue: SIAM Journal on Computing (2004)

We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees for two-dimensional arrays. These trees also have the property that the node degrees may be large. We add a new back-propagation component to McCreight's algorithm and also give a high probability hashing scheme for large degrees. We show that these two features enable construction of suffix trees for general situations with missing suffix links in O(n) time, with high probability. This gives the first randomized linear time algorithm for constructing suffix trees for parameterized strings.
On the entropy of regular languages
Authors: Tullio Ceccherini-Silberstein, Antonio Machì, Fabio Scarabotti
Venue: Theoretical Computer Science (2003)

Let L be an irreducible regular language. Let W be a non-empty set of words (or sub-words) of L and denote by LW = {v ∈ L:w ⊏ v, ∀w ∈ W} the language obtained from L by forbidding all the words w in W. Then the entropy decreases strictly: ent(LW) < ent(L). In this note we present a new proof of this fact, based on a method of Gromov, which avoids the Perron-Frobenius theory. This result applies to the regular languages of finitely generated free groups and an additional application is presented.
Performance macromodelling and optimization of regular VLSI structures
Authors: P. Hallam, T. I. Pritchard, G. C. Townsend
Venue: Proceedings of the conference on European design automation (1991)

The objective of this work was to develop an environment for the automated performance optimization of regular VLSI structures. The environment should enable designers with little or no knowledge of optimization theory or IC design technology to specify, create and optimize the performance of regular VLSI structures. The SRAM was initially used as the regular VLSI structure with which to develop such an environment. Macromodelling was used to increase the level of design abstraction at which the performance of a VLSI structure could be specified and new accurate, fast performance models developed. A novel numerical optimization technique which enabled a weighted sum formulation to search non-convex design surfaces was then developed and shown to be applicable to IC performance optimization in general. Several different SRAM designs were then used to demonstrate the effectiveness and efficiency of the macromodels and optimizing environment.
Managing multiple and distributed ontologies on the Semantic Web
Authors: A. Maedche, B. Motik, L. Stojanovic
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2003)

In traditional software systems, significant attention is devoted to keeping modules well separated and coherent with respect to functionality, thus ensuring that changes in the system are localized to a handful of modules. Reuse is seen as the key method in reaching that goal. Ontology-based systems on the Semantic Web are just a special class of software systems, so the same principles apply. In this article, we present an integrated framework for managing multiple and distributed ontologies on the Semant ic Web. It is based on the representation model for ontologies, trading off between expressivity and tractability. In our framework, we provide features for reusing existing ontologies and for evolving them while retaining the consistency. The approach is implemented within KAON, the Karlsruhe Ontology and Semantic Web tool suite.
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
Authors: Moshe Lewenstein, Maxim Sviridenko
Venue: SIAM Journal on Discrete Mathematics (2004)

The maximum asymmetric traveling salesperson problem, also known as the taxicab rip-off problem, is the problem of finding a maximally weighted tour in a complete asymmetric graph with nonnegative weights.We propose a polynomial time approximation algorithm for the problem with a 5/8 approximation guarantee. This (1) improves upon the approximation factors of previous results and (2) presents a simpler solution to the previously fairly involved algorithms. Our solution uses a simple linear programming formulation. Previous solutions were combinatorial. We make use of the linear programming in a novel manner and strengthen the path-coloring method originally proposed in [S. R. Kosaraju, J. K. Park, and C. Stein, Long tours and short superstrings, in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 166--177].
Technology literacy for undergraduate liberal arts students: a course in communications systems and technology
Authors: A. Michael Noll
Venue: ACM SIGCUE Outlook (1986)

The Annenberg School of Communications at the University of Southern California is teaching undergraduate, liberal arts students about modern technology through a course in communications systems. The objective of the course is to demystify communication technology and give the student a fundamental knowledge of the workings of modern media. The use of such familiar examples as television, the telephone, and stereo excites student interest and curiosity and thus helps make the learning experience more meaningful.
Dynamo: a public interactive surface supporting the cooperative sharing and exchange of media
Authors: Shahram Izadi, Harry Brignull, Tom Rodden, Yvonne Rogers, Mia Underwood
Venue: Proceedings of the 16th annual ACM symposium on User interface software and technology (2003)

In this paper we propose a novel way of supporting occasional meetings that take place in unfamiliar public places, which promotes lightweight, visible and fluid collaboration. Our central idea is that the sharing and exchange of information occurs across public surfaces that users can easily access and interact with. To this end, we designed and implemented Dynamo, a communal multi-user interactive surface. The surface supports the cooperative sharing and exchange of a wide range of media that can be brought to the surface by users that are remote from their familiar organizational settings.
Achieving Relevance in IS Research via the DAGS Framework
Authors: Lascelles A. Adams, James F. Courtney
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

IS research should be both theoretically based and relevant to practice. We challenge theinformation systems community to develop and utilize new research methods and paradigms that will help us improve not only IS theories, but also the contribution of IS research to business practice. To accomplish this dual goal of contributing to both theory and practice, which can at least in part be realized by more emphasis on the use of engineering and architecture as reference disciplines, we propose a new framework, the DAGS framework, which advocates the use of design science (D), action research (A), grounded theory (G), and systems development (S) in combination -- a multi-methodological approach -- as research methodologies.
Usability in the real world: assessing medical information technologies in patient's homes
Authors: David R. Kaufman, Vimla L. Patel, Charlyn Hilliman, Philip C. Morin, Jenia Pevzner, Ruth S. Weinstock, Robin Goland, Steven Shea, Justin Starren
Venue: Journal of Biomedical Informatics (2003)

Objective: This paper presents an approach to usability evaluation of computer-based health care systems designed for patient use in their homes. Although such devices are becoming more prevalent, there is very little known about their usability.Design: The theoretical foundations for the methods are discussed. The approach incorporates a cognitive walkthrough usability evaluation and new methods for usability testing that can be conducted in patient's homes. The method was applied to the IDEATel intervention, a multi-institution randomized controlled trial of the feasibility, acceptability, and clinical utility of a home-based telemedicine system for diabetic Medicare population. The usability study was designed to assess barriers to optimal use of the system. The focus was both on dimensions of the interface and on dimensions of patient skills and competency. The usability field research involved testing 25 patients in their homes using the system. The analysis included a range of video-analytic methods of varying levels of granularity.Results: The usability evaluation revealed aspects of the interface that were sub-optimal and impeded the performance of certain tasks. It also found a range of patient-related factors such as numeracy and psychomotor skills that constituted barriers to productive use.Conclusions: A multifaceted usability approach provided important insight regarding use of technology by an elderly chronic-care patient population and more generally, for understanding how home health initiatives can more effectively use such technology.
Toward a theory of organized multimodal integration patterns during human-computer interaction
Authors: Sharon Oviatt, Rachel Coulston, Stefanie Tomko, Benfang Xiao, Rebecca Lunsford, Matt Wesson, Lesley Carmichael
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

As a new generation of multimodal systems begins to emerge, one dominant theme will be the integration and synchronization requirements for combining modalities into robust whole systems. In the present research, quantitative modeling is presented on the organization of users' speech and pen multimodal integration patterns. In particular, the potential malleability of users' multimodal integration patterns is explored, as well as variation in these patterns during system error handling and tasks varying in difficulty. Using a new dual-wizard simulation method, data was collected from twelve adults as they interacted with a map-based task using multimodal speech and pen input. Analyses based on over 1600 multimodal constructions revealed that users' dominant multimodal integration pattern was resistant to change, even when strong selective reinforcement was delivered to encourage switching from a sequential to simultaneous integration pattern, or vice versa. Instead, both sequential and simultaneous integrators showed evidence of entrenching further in their dominant integration patterns (i.e., increasing either their inter-modal lag or signal overlap) over the course of an interactive session, during system error handling, and when completing increasingly difficult tasks. In fact, during error handling these changes in the co-timing of multimodal signals became the main feature of hyper-clear multimodal language, with elongation of individual signals either attenuated or absent. Whereas Behavioral/Structuralist theory cannot account for these data, it is argued that Gestalt theory provides a valuable framework and insights into multimodal interaction. Implications of these findings are discussed for the development of a coherent theory of multimodal integration during human-computer interaction, and for the design of a new class of adaptive multimodal interfaces.