ppxscal/embedding_network huggingface dataset:
Evaluation of Usage-Based Reading&mdash;Conclusions after Three Experiments
Authors: Thomas Thelin, Per Runeson, Claes Wohlin, Thomas Olsson, Carina Andersson
Venue: Empirical Software Engineering (2004)

Software inspections have been introduced in software engineering in order to detect faults before testing is performed. Reading techniques provide reviewers in software inspections with guidelines on how they should check the documents under inspection. Several reading techniques with different purposes have been introduced and empirically evaluated. In this paper, we describe a reading technique with the special aim to detect faults that are severe from a user&rsquo;s point of view. The reading technique is named usage-based reading (UBR) and it can be used to inspect all software artefacts. In the series of experiments, a high-level design document is used. The main focus of the paper is on the third experiment, which investigates the information needed for UBR in the individual preparation and the meeting of software inspections. Hence, the paper discusses (1) the series of three experiments of UBR, (2) the individual preparation of the third experiment, and (3) the meeting part of the third experiment. For each of these three parts, results are produced. The main results are (1) UBR is an efficient and effective reading technique that can be used for user-focused software inspections, (2) UBR is more efficient and effective if the information used for UBR is developed prior to, instead of during the individual preparation, and (3) the meeting affects the UBR inspection in terms of increased effectiveness and decreased efficiency. In summary, the empirical evidence shows that UBR is an efficient and effective reading technique to be used by software organizations that produce software for which the user perceived quality is important.
Delay-based circuit authentication and applications
Authors: Blaise Gassend, Dwaine Clarke, Marten van Dijk, Srinivas Devadas
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We describe a technique to reliably identify individual integrated circuits (ICs), based on a prior delay characterization of the IC.We describe a circuit architecture for a key card for which authentication is delay based, rather than based on a digital secret key. We argue that key cards built in this fashion are resistant to many known kinds of attacks.Since the delay of ICs can vary with environmental conditions such as temperature, we develop compensation schemes and show experimentally that reliable authentication can be performed in the presence of significant environmental variations.The delay information that is extracted from the IC can also be used to generate keys for use in classical cryptographic primitives. Applications that rely on these keys for security would be less vulnerable to physical attack.
Session Based Differentiated Quality of Service Admission Control for Web Servers
Authors: Yaya Wei, Chuang Lin, Fengyuan Ren, Eryk Dutkiewicz, Raad Raad
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Recent advance--session based admission control (SBAC) has resulted in protecting the server from entering a regime in which latencies are excessive or session throughput collapses due to dropped requests and aborted sessions. The goal of this work is to introduce differentiated QoS to SBAC. We propose a two-threshold SBAC scheme (QSBAC). It can provide high throughput for preferred clients especially in overload situation. Furthermore, to adapt to varying traffic loads, a dynamic QSBAC (DQSBAC) scheme is also proposed. Theexperimental results show that comparing with SBAC scheme, both QSBAC scheme and DQSBAC scheme can sustain higher session throughput for preferred clients, as well as decrease aborted session percentage greatly. Comparing with QSBAC scheme, DQSBC scheme is more feasible because of its adaptation to varying traffic loads.
A Selection of Problems and Results in Combinatorics
Authors: Paul Erdös
Venue: Combinatorics, Probability and Computing (1999)

In this note, I will present some new problems, and also some old ones which, in my opinion, have been undeservedly forgotten or neglected.
Extracting Biochemical Interactions from MEDLINE Using a Link Grammar Parser
Authors: Jing Ding, Daniel Berleant, Jun Xu, Andy W. Fulmer
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Many natural language processing approaches at various complexity levels have been reported for extracting biochemical interactions from MEDLINE. While some algorithms using simple template matching are unable to deal with the complex syntactic structures, others exploiting sophisticated parsing techniques are hindered by greater computational cost. This study investigates link grammar parsing for extracting biochemical interactions. Link grammar parsing can handle many syntactic structures and is computationally relatively efficient. We experimented on a sample MEDLINE corpus. Although the parser was originally developed for conversational English and made many mistakes in parsing sentences from the biochemical domain, it nevertheless achieved better overall performance than a co-occurrence-only method. Customizing the parser for the biomedical domain is expected to improve its performance further.
Efficient Subsequence Matching in Time Series Databases Under Time and Amplitude Transformations
Authors: Tassos Argyros, Charis Ermopoulos
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Subsequence matching in large time series databases hasattracted a lot of interest and many methods have been proposedthat cope with this problem in an adequate extend.However, locating subsequence matches of arbitrary length,under time and amplitude transformations, has received farless attention and is still an open problem. In this paperwe present an efficient algorithm for variable-length subsequencematching under transformations that guaranteesno false dismissals. Further, this algorithm uses a novelsimilarity criterion for determining similarity under amplitudetransformations in a most efficient way. Finally, ouralgorithm has been tested in various experiments on realdata, resulting in a running time improvement of one orderof magnitude compared to the naive approach.
ART: A Hybrid Classification Model
Authors: Fernando Berzal, Juan-Carlos Cubero, Daniel Sánchez, José María Serrano
Venue: Machine Learning (2004)

This paper presents a new family of decision list induction algorithms based on ideas from the association rule mining context. ART, which stands for &lsquo;Association Rule Tree&rsquo;, builds decision lists that can be viewed as degenerate, polythetic decision trees. Our method is a generalized &ldquo;Separate and Conquer&rdquo; algorithm suitable for Data Mining applications because it makes use of efficient and scalable association rule mining techniques.
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories
Authors: Hélène Kirchner, Pierre-Etienne Moreau
Venue: Journal of Functional Programming (2001)

First-order languages based on rewrite rules share many features with functional languages, but one difference is that matching and rewriting can be made much more expressive and powerful by incorporating some built-in equational theories. To provide reasonable programming environments, compilation techniques for such languages based on rewriting have to be designed. This is the topic addressed in this paper. The proposed techniques are independent from the rewriting language, and may be useful to build a compiler for any system using rewriting modulo Associative and Commutative (AC) theories. An algorithm for many-to-one AC matching is presented, that works efficiently for a restricted class of patterns. Other patterns are transformed to fit into this class. A refined data structure, namely compact bipartite graph, allows encoding of all matching problems relative to a set of rewrite rules. A few optimisations concerning the construction of the substitution and of the reduced term are described. We also address the problem of non-determinism related to AC rewriting, and show how to handle it through the concept of strategies. We explain how an analysis of the determinism can be performed at compile time, and we illustrate the benefits of this analysis for the performance of the compiled evaluation process. Then we briefly introduce the ELAN system and its compiler, in order to give some experimental results and comparisons with other languages or rewrite engines.
Future trends in computer graphics: how much is enough?
Authors: A. R. Forrest
Venue: Journal of Computer Science and Technology (2003)

Over the forty-year history of interactive computer graphics, there have been continuous advances, but at some stage this progression must terminate with images being sufficiently realistic for all practical purposes. How much detail do we really need? Polygon counts over a few million imply that on average each polygon paints less than a single pixel, making use of polygon shading hardware wasteful. We consider the problem of determining how much realism is required for a variety of applications. We discuss how current trends in computer graphics hardware, and in particular of graphics cards targeted at the computer games industry, will help or hinder achievement of these requirements. With images now being so convincingly realistic in many cases, critical faculties are often suspended and the images are accepted as correct and truthful although they may well be incorrect and sometimes misleading or untruthful. Display resolution has remained largely constant in spatial terms for the last twenty years and in terms of the number of pixels has increased by less than an order of magnitude. If the long-promised breakthroughs in display technology are finally realised, how should we use the increased resolution?
Stylus input and editing without prior selection of mode
Authors: Eric Saund, Edward Lank
Venue: Proceedings of the 16th annual ACM symposium on User interface software and technology (2003)

This paper offers a solution to the mode problem in computer sketch/notetaking programs. Conventionally, the user must specify the intended "draw" or "command" mode prior to performing a stroke. This necessity has proven to be a barrier to the usability of pen/stylus systems. We offer a novel Inferred-Mode interaction protocol that avoids the mode hassles of conventional sketch systems. The system infers the user's intent, if possible, from the properties of the pen trajectory and the context of the trajectory. If the intent is ambiguous, the user is offered a choice mediator in the form of a pop-up button. To maximize the fluidity of drawing, the user is entitled to ignore the mediator and continue drawing. We present decision logic for the inferred mode protocol, and discuss subtleties learned in the course of its development. We also present results of initial user trials validating the usability of this interaction design.
A Method for Parameter Extraction of Analog Sine-Wave Signals for Mixed-Signal Built-In-Self-Test Applications
Authors: Diego Vázquez, Gildas Leger, Gloria Huertas, Adoración Rueda, José L. Huertas
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents a method for extracting, in the digital domain, the main characteristic parameters of an analog sine-wave signal. The required circuitry for on-chip implementation is very simple and robust, which makes the present approach very suitable for BIST applications. Solutions in this sense are addressed together with simulation results that validate the feasibility of the proposed approach.
Multicast Zone Routing Protocol in Mobile Ad Hoc Wireless Networks
Authors: Xiaofeng Zhang, Lillykutty Jacob
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In recent years, a variety of unicast and multicast routingprotocols for Mobile Ad hoc wireless NETworks (MANETs)have been developed. Zone Routing Protocol (ZRP) is oneof these unicast routing protocols, which is a hybrid protocolthat proactively maintains routing information for alocal neighborhood (routing zone), while reactively acquiringroutes to destinations beyond the routing zone. In thispaper, we adapt ZRP for multicast routing purpose, andcall it Multicast Zone Routing Protocol (MZRP). MZRPis a shared tree multicast routing protocol, which proactivelymaintains the multicast tree membership for node'slocal routing zone at each node while establishes multicasttree on-demand. It is scalable to large number of multicastsenders and groups. The use of IP tunnel mechanism duringdata packets transmission improves the overall performance.The evaluation and comparison with ODMRP areperformed on the ns-2 simulator.
An efficient time-based checkpointing protocol for mobile computing systems over mobile IP
Authors: Chi-Yi Lin, Szu-Chi Wang, Sy-Yen Kuo
Venue: Mobile Networks and Applications (2003)

Time-based coordinated checkpointing protocols are well suited for mobile computing systems because no explicit coordination message is needed while the advantages of coordinated checkpointing are kept. However, without coordination, every process has to take a checkpoint during a checkpointing process. In this paper, an efficient time-based coordinated checkpointing protocol for mobile computing systems over Mobile IP is proposed. The protocol reduces the number of checkpoints per checkpointing process to nearly minimum, so that fewer checkpoints need to be transmitted through the costly wireless link. Our protocol also performs very well in the aspects of minimizing the number and size of messages transmitted in the wireless network. In addition, the protocol is nonblocking because inconsistencies can be avoided by the piggybacked information in every message. Therefore, the protocol brings very little overhead to a mobile host with limited resource. Additionally, by taking advantage of reliable timers in mobile support stations, the time-based checkpointing protocol can adapt to wide area networks.
The Intersection Exponent for Simple Random Walk
Authors: Gregory F. Lawler, Emily E. Puckette
Venue: Combinatorics, Probability and Computing (2000)

The intersection exponent &xi; for simple random walk in two and three dimensions gives a measure of the rate of decay of the probability that paths do not intersect. In this paper we show that the intersection exponent for random walks is the same as that for Brownian motion and show in fact that the probability of nonintersection up to distance n is comparable (equal up to multiplicative constants) to n&minus;&xi;.
Modeling virtual exploratory and shopping dynamics: an environmental psychology approach
Authors: Ming-Hui Huang
Venue: Information and Management (2003)

A huge amount of research in academia and industry has focused on the hardware and technological side of information systems, while the role of emotions in the way these systems are utilized has been largely neglected. However, recent developments in other disciplines have suggested that emotions play a significant role in decision-making. To address this state of affairs, this study draws upon hypotheses from environmental psychology; specifically, that users' tendencies to approach or avoid environments are modeled on the basis of user reaction to the information load of a virtual environment and the emotions that such an environment elicits. A field experiment was conducted in which users visited popular shopping websites. The work demonstrated how information load and emotions influence virtual exploratory and shopping decisions.
Lines of advance in global information technology management: American/West European approach
Authors: Ana R. del Águila, Sebastián Bruque, Antonio Padilla
Venue: Advanced topics in global information management (2003)

During the last decades, numerous theoretical frameworks have been developed in the field of general management. Each theoretical framework has proved useful to explain specific questions about the structure, processes, or performance of the modern firm. In this study we try to propose some connections between general management literature and IT literature. Some of the most important management theories, such as the Transaction Costs Economics, the Agency Theory, the Resource-Based View, and the Knowledge-Based View can be useful to explain specific IT issues. The final goal of this chapter is to propose several lines of advance in global IT using different theories or frameworks as the basis for future research.
HITEC: a test generation package for sequential circuits
Authors: Thomas Niermann, Janak H. Patel
Venue: Proceedings of the conference on European design automation (1991)

This paper presents HITEC, a sequential circuit test generation package to generate test patterns for sequential circuits, without assuming the use of scan techniques or a reset state. Several new techniques are introduced to improve the performance of test generation. A targeted D element technique is presented, which greatly increases the number of possible mandatory assignments and reduces the over-specification of state variables which can sometimes result when using a standard PODEM algorithm. A technique to use the state knowledge of previously generated vectors for state justification, without the memory overhead of a state transition diagram is presented. For faults that were aborted during the standard test generation phase, knowledge that was gained about fault propagation, by the fault simulator, is used. These techniques, when used together, produce the best published results for the ISCAS89 sequential benchmark circuits.
Automatic parallelism in differentiation of Fourier transforms
Authors: H. Martin Bücker, Bruno Lang, Arno Rasch, Christian H. Bischof
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

For functions given in the form of a computer program, automatic differentiation is an efficient technique to accurately evaluate the derivatives of that function. Starting from a given computer program, automatic differentiation generates another program for the evaluation of the original function and its derivatives in a fully mechanical way. While the efficiency of this black box approach is already high as compared to numerical differentiation based on divided differences, automatic differentiation can be applied even more efficiently by taking into account high-level knowledge about the given computer program. We show that, in the case where the function involves a Fourier transform, the degree of parallelism in the program generated by automatic differentiation can be increased leading to a rich set of automatic parallelization strategies that are not available when employing a black box automatic parallelization approach. Experiments of the new automatic parallelization approach are reported on a SunFire 6800 server using up to 20 processors.
Managing Risk beyond the Control of IS Managers: The Role of Business Management
Authors: Susan A. Sherer
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

While most research has focused on managing technical and project risks in information systems, there are many other components of information systems risk that are currently notevaluated and managed effectively. We identify different sources of risk in both intra- and inter-organizational information systems. Many risks are not well managed because they are beyond the control of the software project manager. We suggest that senior business managers should be responsible for managing organizational risk particularly in the early and later stages of an information systems implementation project. These managers must communicate the importance of new systems and change incentive structures to promote effective system use. We suggest the need to evaluate collaborative risk in inter-organizational information systems and provide guidelines for managing this risk using ajoint business management team or a trusted intermediary.
Sound and sign
Authors: Gabriele Proy
Venue: Organised Sound (2002)

In discussing different sound environments - sound in the field of art as well as sound in the context of our daily sonic environment - this article makes reference to semiotic theories.Sound without source. Electroacoustic media shape our perceptive realities. There are multiple tools available to record and reproduce sound, but is it possible to handle the fleeting nature of sound, the escape of sound? Certainly there are tools to manipulate sound, to create new soundscapes in this way. We can generate virtual sound-projecting soundscapes via speakers, via headphones in a new context - but what are we listening to?Every sound evokes images. The concept of &lsquo;musique acousmatique&rsquo;, according to Fran&ccedil;ois Bayle, amplifies Pierre Schaeffer's notion of the &lsquo;objet sonore&rsquo;. &lsquo;Musique acousmatique&rsquo; refers to sound projection, and thus to our imagination while concentrating on listening. In listening to acousmatic music, we can find three tonal levels, and this tripartite concept of listening refers to the tripartite semiotic concept introduced by Charles Sanders Peirce.Finally, sound affects us emotionally. In contradiction to the term &lsquo;objet sonore&rsquo;, the term &lsquo;sound event&rsquo; coined by R. Murray Schafer stresses the necessity to analyse sound in its context. It is the sonic environment which determines the meaning of the &lsquo;sound event&rsquo;. Thus, from my point of view, the concept of soundscape can be compared with Ferdinand de Saussure's semiotic theory about the arbitrary meaning of signs. Signs are determined by their systems.Semiotic concepts offer an interesting approach to sound perception. Let's listen to soundscapes before sound escapes.
Using Simulation for the Validation of High Level Specifications of Control Systems
Authors: Watcharee Jumpamule, Jean-Luc Paillet, Norbert Giambiasi
Venue: Journal of Intelligent and Robotic Systems (2003)

In this paper, we present a methodology for modeling real&ndash;time systems using high level specification DECM (discrete event calculus model) and DEVS formalisms. In this methodology, the control system is specified by the way of a DECM user language description. This formal specification is automatically transformed into an atomic DEVS (discrete event system specification) model, and DEVS simulation of the coupled models (control system and plant) is used to validate the initial DECM specifications. The paper discusses the building of DECM specifications, the transformation of DECM specifications into a DEVS model and the simulation of the coupled DEVS model.
Building a Requirement Fault Taxonomy: Experiences from a NASA Verification and Validation Research Project
Authors: Jane Huffman Hayes
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Fault-based analysis is an early lifecycle approach toimproving software quality by preventing and/ordetecting pre-specified classes of faults prior toimplementation. It assists in the selection of verificationand validation techniques that can be applied in order toreduce risk. This paper presents our methodology forrequirements-based fault analysis and its application toNational Aeronautics and Space Administration (NASA)projects. The ideas presented are general enough to beapplied immediately to the development of any softwaresystem. We built a NASA-specific requirement faulttaxonomy and processes for tailoring the taxonomy to aclass of software projects or to a specific project. Weexamined requirement faults for six systems, includingthe International Space Station (ISS), and enhanced thetaxonomy and processes. The developed processes,preliminary tailored taxonomies forCritical/Catastrophic High-Risk (CCHR) systems,preliminary fault occurrence data for the ISS project,and lessons learned are presented and discussed.