ppxscal/embedding_network huggingface dataset:
DELTA: the Universal Debugger for CP-6
Authors: Carol K. Walter
Venue: ACM SIGSOFT Software Engineering Notes (1983)

DELTA is the Universal Debugger for CP-6. CP-6, a general purpose communications-oriented operating system, is made up of two environments: host and communications. These two environments each have their own operating system and run on different CPUs. DELTA allows the user to symbolically debug programs written in any language or combination of languages in either environment. DELTA also allows symbolic debugging of the host operating system, the communications operating system, and the language and utility processors for each environment. In addition, DELTA allows symbolic patching of both operating systems and the language and utility processors providing a timely field support for CP-6.
Using box structures for definition of requirements specifications
Authors: J. E. Odom
Venue: IBM Systems Journal (1990)

Box structures provide a stepwise refinement and verification methodology for information systems analysis and design. They are especially useful for recording and decomposing requirements specifications. The benefits of using the structures center around making the requirements clear to readers, helping to make the requirements complete, and providing an artifact that will enhance the traceability of the requirements. This paper describes the methodology of applying box structures and presents an example of their use in the definition of requirements specifications.
FER/Mech: a software with interactive graphics for dynamic analysis of multibody system
Authors: Zhi-Qiang Feng, Pierre Joli, Nicolas Seguy
Venue: Advances in Engineering Software (2004)

Development of user-friendly and flexible scientific programs is a key to their usage, extension and maintenance. This article presents an Object-Oriented Programming approach for the development of FER/Mech--a software with interactive graphics for use in the design and analysis of two and three dimensional multibody dynamic systems. The general organization of the developed software system is given which includes the solver and the pre/postprocessors with a friendly Graphical User Interfaces. The concept of absolute natural coordinates is discussed to model rigid bodies in order to satisfy the constraints of modularity. Two case studies with graphical representations illustrate some functionalities of the program.
A review of relevance feedback experiments at the 2003 reliable information access (RIA) workshop.
Authors: Robert H. Warren, Ting Liu
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

We review here the results of one of the experiments performed at the 2003 Reliable Information Access (RIA) Workshop, hosted by Mitre Corporation and the Northeast Regional Research Center (NRRC). The experiment concentrates on query expansion using relevance feedback and explores the behaviour of several information retrieval systems using variable numbers of relevant documents.
Caching-Enhanced Scalable Reliable Multicast
Authors: Carolos Livadas, Idit Keidar
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

We present the Caching-Enhanced Scalable Reliable Multicast(CESRM) protocol. CESRM augments the Scalable ReliableMulticast (SRM) protocol [A Reliable Multicast Framework For Light-Weight Sessions And Application Level Framing] with a caching-basedexpedited recovery scheme. CESRM exploits the packet losslocality occurring in IP multicast transmissions in order toexpeditiously recover from losses in the manner in which recentlosses were recovered. Trace-driven simulations showthat CESRM reduces the average recovery latency of SRMby roughly 50% and, moreover, drastically reduces the overheadin terms of recovery traffic and control messages.
Adaptive Query Processing and the Grid: Opportunities and Challenges
Authors: Anastasios Gounaris, Norman W. Paton, Rizos Sakellariou, Alvaro A. A. Fernandes
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Grid technologies have been developed in response to an increase in demand for computing applications designed to yield the benefits from collaboration, data sharing and sophisticated interaction of autonomous and geographically dispersed resources. Distributed Query Processing (DQP) is an appealing solution for expressing and efficiently evaluating requests across Grid resources. In this paper: (i) we identify parts of the Grid infrastructure that facilitate, and open new directions for, query processing over grid-enabled heterogeneous and autonomous databases, stressing the need for Adaptive Query Processing (AQP); (ii) we discuss some basic challenges arising from the new opportunities and outline the unsuitability for use in a Grid setting and narrow specialisation of existing proposals for AQP; and (iii) we suggest a generic adaptivity framework as a promising way forward.
From the Editors: Whose Data Are These, Anyway?
Authors: Marc Donner
Venue: IEEE Security and Privacy (2004)

Certainly the medical community, struggling with new HIPAA rules governing medical privacy, doesnýt seem to have managed to provoke an engagement from the computer-science and software-engineering research community. This is unfortunate for several reasons: our community has the ability to make a unique and valuable contribution to the discussion, and now is the time to resolve conceptual issues and design decisions so that the next generation of infrastructure can accommodate the emerging requirements.
The structure of optimal partitions of orthogonal polygons into fat rectangles
Authors: Joseph O'Rourke, Geetika Tewari
Venue: Computational Geometry: Theory and Applications (2004)

Motivated by a VLSI masking problem, we explore partitions of an orthogonal polygon of n vertices into isothetic rectangles that maximize the shortest rectangle side over all rectangles. Thus no rectangle is "thin": all rectangles are "fat". We show that such partitions have a rich structure, more complex than what one might at first expect. For example, for partitions all "cuts" of which are anchored on the boundary, sometimes cuts are needed 1/2 or 1/3 of the distance between two polygon edges, but they are never needed at fractions with a larger denominator. Partitions using cuts without any restrictions seem especially complicated, but we establish a limit on the "depth" of cuts (roughly, how distant from the boundary they "float" in the interior) and other structural constraints that lead to both an O(n) bound on the number of rectangles in an optimal partition, as well as a restriction of the cuts to a polynomial-sized grid. These constraints may be used to develop polynomial-time dynamic programming algorithms for finding optimal partitions under a variety of restrictions.
The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1
Authors: Weiting Cao, Michael J. Pelsmajer
Venue: Graphs and Combinatorics (2004)

We show that every toroidal graph with connectivity 3 and girth 6 is bipartite. This implies that its toughness is at most 1. This answers a question in Goddard, Plummer, and Swart [3] in which it was shown that such a graph has toughness at least 1.
Multi-item stochastic and fuzzy-stochastic inventory models under two restrictions
Authors: K. Das, T. K. Roy, M. Maiti
Venue: Computers and Operations Research (2004)

Multi-item stochastic and fuzzy-stochastic inventory models are formulated under total budgetary and space constraints. Here, the inventory costs are directly proportional to the respective quantities, unit purchase/production cost is inversely related to the demand and replenishment/production rate is assumed to vary directly with demand. Shortages are allowed but fully backlogged. Here, for both models, demand and budgetary resource are assumed to be random. In fuzzy-stochastic model, in addition to the above assumptions, available storage space and total expenditure are imprecise in nature. Impreciseness in the parameters have been expressed with the help of linear membership functions. Assuming random variables to be independent and to follow normal distributions, the models have been formulated as stochastic and fuzzy-stochastic non-linear programming problems. The stochastic problem is first reduced to the equivalent single objective or multiple objectives problems following chance-constraint method. The problem with single objective is solved by a gradient-based technique whereas fuzzy technique is applied to the multi-objective one. In the same way, the fuzzy-stochastic programming problem is first reduced to a corresponding equivalent fuzzy non-linear programming problem and then it is solved by fuzzy non-linear programming (FNLP) following Zimmermann technique. The models are illustrated numerically and the results of different models are compared.
Polynomials That Sign Represent Parity and Descartes Rule of Signs
Authors: Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

We study the sparsity of real polynomials that sign representparity on n variables, each of which takes values fromsome finite subset A of integers. While the degree of suchpolynomials has been well studied [15, 1], relatively littleis known about their sparsity. We study this problem usingDescartes Rule of Signs, a classical result in algebra, relatingthe sparsity of a polynomial to its number of real roots.We show that sign representing parity over \{ 0,1 \ldots ,m - 1\} ^n with the degree in each variable at most m - 1 requiressparsity at least m^n We show a bound of (m - 1)^n for weakrepresentations.We show that a tradeoff exists between sparsityand degree, by constructing a sign representation thathas higher degree but lower sparsity. In some cases, the differencein sparsities is exponential. We show a lower boundof n(m - 2) + 1on the sparsity of polynomials of any degreerepresenting parity over \{ 0,1, \cdots ,m - 1\} ^n. We proveexact bounds on the sparsity of such polynomials for any twoelement subset AWe show that for depth-two AND-OR-NOT circuits witha Threshold Gate at the top, the minimum circuit size for afunction f equals the minimum sparsity of a polynomial signrepresenting f over a certain basis.We use this to give a simpleproof that such circuits need size (3/2n) to compute parity,which improves on previous bounds [8]. We also show atight lower bound of 2^n for the inner product function over\{ 0,1\} ^n\times \{ 0,1\} ^n.The main technical tool used is Descartes rule of signs.Our bounds hold for various bases where Descartes sign ruleis valid.
The fulfilled Euclidean plane
Authors: Adrian Vasiu, Angela Vasiu
Venue: Smarandache Notions Journal (2004)

The fulfilled euclidean plane is the real projective plane II- completed with the infinite point of its infinite line denoted II-c. This new incidence structure is a structure with neighbouring elements, in which the unicity of the line through two distinct points is not assured. This new Geometry is a Smarandacheian structure introduced in [10] and [11], which generalizes and unites in the same time: Euclid, Bolyai Lobacewski Gauss and Riemann Geometries.
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Authors: Parosh Aziz Abdulla, Aurore Collomb-Annichini, Ahmed Bouajjani, Bengt Jonsson
Venue: Formal Methods in System Design (2004)

We consider symbolic on-the-fly verification methods for systems of finite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels. We show that the class of languages representable by SREs is exactly the class of downward closed languages that arise in the analysis of such protocols. We give methods for computing (i) inclusion between SREs, (ii) an SRE representing the set of states reachable by executing a single transition in a system, and (iii) an SRE representing the set of states reachable by an arbitrary number of executions of a control loop. All these operations are rather simple and can be carried out in polynomial time.With these techniques, one can straightforwardly construct an algorithm which explores the set of reachable states of a protocol, in order to check various safety properties. We also show how one can perform model-checking of LTL properties, using a standard automata-theoretic construction. It should be noted that all these methods are by necessity incomplete, even for the class of protocols with lossy channels.To illustrate the applicability of our methods, we have developed a tool prototype and used the tool for automatic verification of (a parameterized version of) the Bounded Retransmission Protocol.
An Efficient Method to Find Area Clusters with Constraints Using Grid Index Structure
Authors: Kwang-Su Yang, Ruixin Yang, Jiang Tang, Menas Kafatos
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

This paper presents an efficient method to find areaclusters satisfying certain constraints. The method uses agrid index structure to find them by examining five cell, 8-connected neighborhood. The hierarchical clustering technique is applied for preprocessing the grid with similarvalue distribution into the same clusters. This preprocessinghelps reduce the computational time and eliminate thepossible outlier grid cells. The constraints are averagevalue range, minimum area size and minimum missing dataratio. The method is implemented for a remote sensing data,MOD08_M3, which is MODIS(MODerate resolution ImagingSpectroradiometer) level 3 monthly atmospheric product.
Can more help be worse?: the over-assisting interface
Authors: Christof van Nimwegen, Herre van Oostendorp, Hermina (Tabachneck-) Schijf
Venue: Proceedings of the conference on Dutch directions in HCI (2004)

The premise of this research is that assistance can make interactions easier, but does not necessarily aid understanding. A way to assist users is displaying relevant information in interfaces. Recall of such knowledge is unnecessary and working memory is relieved. Examples are visual aids such as the "greying-out" of items, which can become unclickable indicating that an action is not possible. If this is not done this information has to be inferred by the user himself. An experiment was conducted in which subjects had to solve a series of puzzles. We hypothesized that providing greyed-out items (externalization) yields better performance during initial learning. An interface without greying-out (internalization) is expected to yield better performance in later phases, and better knowledge of the task. Subjects solved an isomorph of "missionaries and cannibals" in two conditions: with greyed-out items and without. It showed that externalization had little influence on performance. All subjects learned quite well how to solve the puzzle. On a knowledge test however, it turned out to be different. The procedural knowledge tested afterwards was equal, but declarative knowledge, concerning the rule central to what this problem was about, was worse for persons who had greyed-out items. Also, months later the same internalization-subjects had faster problem recognition of the task, and better performance on a similar task.
Fault Diversity among Off-The-Shelf SQL Database Servers
Authors: Ilir Gashi, Peter Popov, Lorenzo Strigini
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Fault tolerance is often the only viable way of obtainingthe required system dependability from systems built outof "off-the-shelf" (OTS) products. We have studied asample of bug reports from four off-the-shelf SQL serversso as to estimate the possible advantages of software faulttolerance - in the form of modular redundancy withdiversity - in complex off-the-shelf software. We checkedwhether these bugs would cause coincident failures inmore than one of the servers. We found that very few bugsaffected two of the four servers, and none caused failuresin more than two. We also found that only four of thesebugs would cause identical, undetectable failures in twoservers. Therefore, a fault-tolerant server, built withdiverse off-the-shelf servers, seems to have a good chanceof delivering improvements in availability and failurerates compared with the individual off-the-shelf servers ortheir replicated, non-diverse configurations.
Multiple-Valued Multiple-Rail Encoding Scheme for Low-Power Asynchronous Communication
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

This paper presents a multiple-valued multiple-rail encodingscheme for low-power asynchronous data transferbetween modules inside a VLSI chip. The use of multiplerailencoding makes it possible to reduce the dynamic rangein a single wire. If signal levels per wire are reduced, theasynchronous data transfer between modules can be performedmore efficiently with maintained data-transfer capability.Some appropriate combinations of signal levels perwire and wire counts for low-power asynchronous communicationare presented. It is demonstrated that the power-delayproducts per value for asynchronous data transfer betweenmodules are evaluated in some cases using the proposedencoding scheme.
Pipeline-Level Control of Self-Resetting Pipelines
Authors: Abdel Ejnioui, Abdelhalim Alsharqawi
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

In this paper, we present a novel synchronization approach to support data flow in clockless designs using single-rail encoding. This approach is based on self-resetting stage logic in which a pipeline stage resets itself before starting the next execution cycle. As such, a stage goes through a reset phase when its output is null, and an evaluate phase when its output is the result of the evaluation of its inputs. To insure correct operation, data flow from one stage to another when the preceding stage is in the evaluate phase while the following stage is in the reset phase. To support this data flow, a latch-based synchronization mechanism is proposed. This mechanism yields an efficient and simple uni-directional handshaking scheme emanating from the last stage in the pipeline back towards the remaining stages of the pipeline. This handshaking scheme is extended to handle the join and forks of data flows encountered in non-linear pipelines. A concept design of a four-bit 16-stage pipeline is presented to illustrate the inner workings of self-resetting stage logic and its data-flow synchronization mechanism. The signal timing analysis of this pipeline reveals that the duration of the evaluate and reset phase remains constant in the stages located to the left of the last stage in the pipeline. As a result, the last stage operates as a pulse generator with which the remaining stages of the pipeline synchronize in such a way that neighboring stages operates in opposing phases at each cycle of execution.
Tele-sports and tele-dance: full-body network interaction
Authors: Benjamin Schaeffer, Mark Flider, Hank Kaczmarski, Luc Vanier, Lance Chong, Yu Hasegawa-Johnson
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

Researchers have had great success using motion capture tools for controlling avatars in virtual worlds. Another current of virtual reality research has focused on building collaborative environments connected by networks. The present paper combines these tendencies to describe an open source software system that uses motion capture tools as input devices for realtime collaborative virtual environments. Important applications of our system lie in the realm of simulating interactive, multiparticipant physical activities like sport and dance. Several challenges and their respective solutions are outlined. First, we describe the infrastructure necessary to handle full-body articulated avatars as driven by motion capture equipment, including calibration and avatar creation. Next, we outline the PC cluster solution chosen to render our worlds, exploring methods of data sharing and synchronization, both within the PC cluster nodes and between different sites in the distributed system. Finally, virtual sports require physics, and we describe the simulation algorithms used.
A Time Interval Based Consistency Control Algorithm for Interactive Groupware Applications
Authors: Rui Li, Du Li, Chengzheng Sun
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Traditional concurrency control methods such aslocking and serialization are not suitable for distributed interactiveapplications that demand fast local response. Operationaltransformation (OT) is the standard solution to concurrency controland consistency maintenance in group editors, an importantclass of interactive groupware applications. It generally tradesconsistency for local responsiveness, because human users canoften tolerate temporary inconsistencies but do not like theirinteractions be lost or nondeterministically blocked. This paperpresents a time interval based operational transformation algorithm(TIBOT) that overcomes the various limitations of previousrelated work. Our approach guarantees content convergence andis significantly more simple and efficient than existing approaches.This is achieved in a pure replicated architecture by using a linearclock and by posing some constraints on communication that arereasonable for the application domain.
Presence and task performance: an approach in the light of cognitive style
Authors: Corina Sas, P. O&#x2019;Hare, Ronan Reilly
Venue: Cognition, Technology and Work (2004)

The paper highlights the relationship between each of four bi-polar dimensions of personality cognitive style, such as extraversion&#x2013;introversion, sensing&#x2013;intuition, thinking&#x2013;feeling and judging&#x2013;perceiving, and the level of sense of presence experienced. Findings indicate that individuals who are more sensitive, more feeling or more introverted experience a higher level of presence. While not reaching statistical significance, differing cognitive styles appear to impact on task performance. The apparent negative relationship discovered between sense of presence and task performance should be considered in the light of task characteristics. We discuss the implications of these findings and how they contribute to an understanding of the complex relationship that exists between presence and task performance and how this subsequently ought to influence the design of virtual environments.