ppxscal/embedding_network huggingface dataset:
An efficient location management protocol for wireless ATM customer premises networks
Authors: Evangelos Zervas, Alexandros Kaloxylos, Lazaros Merakos
Venue: Mobile Networks and Applications (2001)

In this paper, we present a new location management protocol for wireless ATM networks, called LMCP (Location Management and Control Protocol). This protocol is based on the PNNI (Private Network-to-Network Interface) routing functionality to advertise the movement of mobile terminals within predefined areas. Moreover, LCMP uses specialized entities to store and retrieve the current location area of the mobile terminals. These entities are located in mobility enhanced switches that control the execution of mobility procedures (e.g., handovers). The main benefit from the application of LMCP is the establishment of connections that do not contain any misrouted segments. Furthermore, it requires minor modifications to the PNNI and enables its inter-working with other location management mechanisms. The protocol is compared with other similar mechanisms, and its efficiency is demonstrated by the results of an analytical model.
Multi-dispatch in the Java Virtual Machine (poster session): design and implementation
Authors: Christopher Dutchyn, Paul Lu, Duane Szafron, Steve Bromling, Wade Holst
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Mainstream object-oriented languages, such as C++ and Java, provide only a restricted form of polymorphic methods, namely single-receiver dispatch. In common programming situations, programmers must work-around this limitation. We detail how to extend the Java Virtual Machine to support multiple-dispatch and examine the complications that Java imposes on multiple-dispatch in practice. Our technique avoids changes to the Java programming language itself, maintains source-code and library compatibility, and isolates the performance penalty and semantic changes of multiple-dispatch to the program sections which use it. We have micro-benchmark and application-level performance results for a dynamic Most Specific Applicable (MSA) dispatcher, two table-based dispatchers (Multiple Row Displacement (MRD) and Single Receiver Projections (SRP)), and a tuned SRP dispatcher. Our general-purpose technique provides smaller dispatch latency than equivalent programmer-written double-dispatch code.
Modeling part-whole relationships for spatial data
Authors: Rosanne Price, Nectaria Tryfona, Christian S. Jensen
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

Spatial applications must manage partwhole (PW) relationships between spatial objects, for example, the division of an administrative region into zones based on land use. Support for conceptual modeling of relationships between parts and whole, such as aggregation and membership, has been well researched in the object oriented (OO) community; however, spatial data has generally not been considered. We propose here a practical approach to integrating support for spatial PW relationships into conceptual modeling languages. Three different types of relationships&mdash;spatial part, spatial membership, and spatial inclusion&mdash;that are of general utility in spatial applications are identified and formally defined using a consistent classification framework based on spatial derivation and constraint relationships. An extension of the Unified Modeling Language (UML) for spatiotemporal data, namely Extended Spatiotemporal UML, is used to demonstrate the feasibility of using such an approach to define modeling constructs supporting spatial PW relationships.
Colored local type inference
Authors: Martin Odersky, Christoph Zenger
Venue: ACM SIGPLAN Notices (2001)

We present a type system for a language based on F le;, which allows certain type annotations to be elided in actual programs. Local type inference determines types by a combination of type propagation and local constraint solving, rather than by global constraint solving. We re ne the previously existing local type inference system of Pierce and Turner[PT98] by allowing partial type information to be propagated. This is expressed by coloring types to indicate propagation directions. Propagating partial type information allows us to omit type annotations for the visitor pattern, the analogue of pattern matching in languages without sum types.
A Practical Vector Restoration Technique for Large Sequential Circuits
Authors: Surendra K. Bommu, Kiran B. Doreswamy, Srimat T. Chakradhar
Venue: Journal of Electronic Testing: Theory and Applications (2000)

Given a test sequence and a list of faults detected by the sequence, vector restoration techniques extract a minimal subsequence that detects a chosen subset of modeled faults. Vector restoration techniques are useful in static compaction of test sequences and in fault diagnosis. We propose a new vector restoration technique that is a significant improvement over the state of the art in several ways: (1) a sequence of length n can be restored with only O(n log2n) simulations while known approaches require simulation of O(n2) vectors, (2) a two-step restoration process is used that makes vector restoration practical for large designs, and (3) restoration process for several faults is overlapped to provide significant acceleration in vector restoration. Our new ideas can be used to improve run-times of known static compaction and fault diagnosis methods. We integrated the proposed vector restoration technique into a static test sequence compaction system. Our experiments show that the new restoration technique, as compared to known techniques (Proceedings of Int. Conf. on Computer Design, University of Iowa, Aug. 1997, pp. 360&ndash;365.), is (1) about 2 times faster for the ISCAS benchmark circuits, and (2) 3 to 5 times faster on large, industrial designs. Using the new restoration technique, we successfully processed large industrial designs that could not be handled by earlier techniques (Proceedings of Int. Conf. on Computer Design, University of Iowa, Aug. 1997, pp. 360&ndash;365.) in 2 CPU days.
An efficient context-free parsing algorithm
Authors: Jay Earley
Venue: Communications of the ACM (1970)

A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a time bound proportional to n3 (where n is the length of the string being parsed) in general; it has an n2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrick.
Compressed bloom filters
Authors: Michael Mitzenmacher
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, for many applications the space savings outweigh this draw-back when the probability of an error is sufficiently low. We introduce compressed Bloom filters, which improve performance when the Bloom filter is passed as a message, and its transmission size is a limiting factor. For example, Bloom filters have been suggested as a means for sharing Web cache information. In this setting, proxies do not share the exact contents of their caches, but instead periodically broadcast Bloom filters representing their cache. By using compressed Bloom filters, proxies can reduce the number of bits broadcast, the false positive rate, and/or the amount of computation per lookup. The cost is the processing time for compression and decompression, which can use simple arithmetic coding, and more memory use at the proxies, which utilize the larger uncompressed form of the Bloom filter.
Mobile agents for monitoring distributed systems
Authors: Delbert Hart, Mihail Tudoreanu, Eileen Kraemer
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Mobile agents can be employed to help a system adapt to diverse conditions and provide functionality that would otherwise be cumbersome and perhaps in-feasible. The benefits of mobile agents though are not without their own costs in performance and complexity. This paper gives an overview of our work in determining when mobile agents are appropriate for monitoring distributed applications. The high degree of variability resulting from the interaction between the users, applications, and the computing environment makes succinct descriptions of when mobile agents are appropriate very difficult. Our approach has been to identify the basic classes of variables in the evaluation formula and then to perform empirical tests to identify which aspects of the various components has the greatest impact. These results will then be used to identify guidelines as to when mobile agents are advantageous for the monitoring of distributed systems.
Product, process, and profit: the politics of usability in a software venture
Authors: Barbara Mirel
Venue: ACM Journal of Computer Documentation (JCD) (2000)

In research and in practice,usability specialists commonly target the technology user-interfaces and help as the main arena for bringing about usability improvements. However, usability improvements depend on more than innovative and user-centered technical designs and implementations. Equally important for creating useful and usable software are the social and political forces that shape the development context. These forces give rise to leadership conflicts, factional disputes, renegade efforts, alliances and betrayals, all of which profoundly influence whether usability improvements will be supported and sustained within and across projects. This essay presents and analyzes a case history of a software start-up company in which usability achieved a Pyrrhic victory, triumphing only in the short run because of social and political forces.
Multimedia presentation database system
Authors: Binjia Jiao
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

Multimedia presentations are increasingly being used in most spheres of life. Viewing these multimedia presentation as databases help in querying as well as re-using parts of existing presentations to create new ones. This dissertation proposes on object-oriented model for mangaging multimedia presentations as (temporal) databases based on the web. And the dissertation also discusses the representation of the proposed object-oriented model in Extensible Markup Language (XML). This represented opens up the possibility of employing standard XML product to commit multimedia presentation application over Internet, using the object-oriented model. Most major features such as run-time query arousing, unknown-duration objects control and interdatabase links are captured by the XML representation in the dissertation.
Timing-driven placement for hierarchical programmable logic devices
Authors: Michael Hutton, Khosrow Adibsamii, Andrew Leaver
Venue: Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays (2001)

In this paper we discuss new techniques for timing-driven placement and adaptive delay computation for hierarchical PLD architectures.Our algorithm follows the natural recursive k-way partitioning-based approach to placement on such devices. Our contributions include a specification of the overall TDC (timing-driven compilation) algorithm, an analysis of heuristics such as a variant of multi-start partitioning, a new method for adaptive delay computation, and a discussion of the structure of critical paths and sub-graphs on modern PLD designs.This algorithm has been implemented in a production quality commercial tool, and we report on the results with and without the implementation of the new techniques. The basic result is a substantial 38.5% average (36.3% median) improvement in register-to-register performance across a range of real designs in modern density ranges, at a cost of approximately 3.65X average (2.88X median) place-and-route CPU time. (These improvements and costs are relative to the same tool prior to the efforts described in this paper.) A partial implementation of the new algorithm shows approximately half the performance gain, with approximately half the compile time cost.
A performance-driven MCM router with special consideration of crosstalk reduction
Authors: D. Wang, E. S. Kuh
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents a new performance-driven MCM router, named MRC, with special consideration of crosstalk reduction. Router MRC completes an initial routing with an adequate performance trade-off including wire length, vias, number of layers, timing and crosstalk. Then a crosstalk reduction algorithm is used to make the routing solution crosstalk-free without big influence on other routing performances. Thus, efficiently handling timing and crosstalk problems becomes the unique feature of MRC. Router MRC has been implemented and tested on MCM benchmarks and the experimental results are very promising.
A conversation about ensuring computer literacy of first-year students
Authors: Elizabeth Edmiston, Marilyn McClelland
Venue: Proceedings of the second annual CCSC on Computing in Small Colleges Northwestern conference (2000)

This paper explores the purpose and usefulness of a course in computer literacy. It introduces a method that allows students to make choices on the order and timing of covering material within the course and uses a skills assessment software package to ensure learning and equivalency across and within sections. It provides some methods for dealing with the problems inherent in a self-paced course. Finally, the future of a course in computer literacy is discussed. I'm all for a paradigm shift in the way we teach computer literacy to our first-year students. For instance, we could follow in the footsteps of our colleagues over in the English department and establish a &ldquo;computers across the curriculum&rdquo; program. Or we could provide on-line computer tutorials to all of our entering students and let them teach themselves. Or we could simply assume/require that computer literacy is provided in the K-12 years. That's got to happen at some point, doesn't it? Our course is offered within the School of Business and our employers tell us that computer application skills (or the lack thereof) are the primary contributor to the first impression of competency of a new intern or entry level employee. Our goal is to insure that students going to do internships and at graduation are computer literate. Thus, we have the computer literacy course, sometimes known as a course in computer applications or teaching Microsoft Office/WordPerfect Suite.
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Authors: Bernard Chazelle
Venue: Journal of the ACM (JACM) (2000)

A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is 0(m &agr;(m, n)), where &agr; is the classical functional inverse of Ackermann's function and n (respectively, m) is the number of vertices (respectively, edges). The algorithm is comparison-based : it uses pointers, not arrays, and it makes no numeric assumptions on the edge costs.
Reduction of Polynomial Planar Hamiltonians with Quadratic Unperturbed Part
Authors: Jesús Palacián, Patricia Yanguas
Venue: SIAM Review (2000)

We classify the possible normal forms of quadratic Hamiltonians in 2 dimensions. Then we give a method to reduce by one the number of degrees of freedom of an arbitrary polynomial Hamiltonian whose principal part is quadratic in positions and moments. The reduction procedure is based on the extension of an integral of the unperturbed part to the whole system, up to a certain order. The corresponding reduced phase spaces have dimension 2 and are described by means of the set of invariants associated to the reduction.
Collaborative virtual conferences: using exemplars to shape future research questions
Authors: Michael L. W. Jones
Venue: Proceedings of the third international conference on Collaborative virtual environments (2000)

The conference is a long-standing tradition in professional circles, playing a central role in informal and formal knowledge building and social network maintenance. Networked communication technologies have influenced both conference logistics and organization and the intellectual and social experience of conference participants. Conducting a virtual conference raises many issues that are directly relevant to the study of information technologies in organizational settings. Virtual conferences may allow for broader access to social networks, but also impose significant constraints on the communication environment. This paper investigates two conferences conducted in the 3-D virtual environment ActiveWorlds, and one conference conducted primarily in a text-based chat environment. Text and video records are balanced by the personal observations of the author, who participated in an online panels and presentations in each environment. This paper aims to highlight the potential benefits and challenges of collaborative virtual environments in mediating professional conferences.
Ongoing Issues in Pneumonia Care: When To Admit, How To Treat and the Role of Oral Therapy
Authors: Alicia C. Shillington
Venue: Journal of Medical Systems (2000)

In recent decades the understanding of the diagnosis and treatment of community acquired pneumonia (CAP) has increased within the medical scientific community. The challenge remains how best to disseminate new information to the practicing clinician to facilitate improved outcomes and cost-effective care. To accomplish this end, professional organizations such as the Infectious Disease Society of America (IDSA) and the American Thoracic Society (ATS) have developed and published consensus guidelines reflecting the proposed standard of medical care. Three ongoing areas of ambiguity and divergence between published guidelines and clinical practice include treatment selection, the admission decision, and the utility and role of oral therapy.
Denotational semantics for agent communication language
Authors: Frank Guerin, Jeremy Pitt
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

The dilemma encountered in the design of an agent communication language (ACL) for an open society is that it should be based on externally observable phenomena yet it should capture something of the intuitions behind the high level abstractions typically found in internal mental states. Our solution treats an ACL message as a declarative statement that is given a procedural interpretation by a denotational semantics. This defines a speech act as a function between states. These states are social states which store public information including expressed mental attitudes and control variables. Expressed mental attitudes are externally observable and capture the conventional public meaning of communication. The variables control the flow of conversation in a protocol. We conclude firstly that since the denotational semantics is based on externally observable phenomena, it is possible to verify compliance and prove properties of protocols. Secondly, since the semantics is more expressive than behavioural specifications, it lays the foundation for high-level communication between intelligent agents.
Arousal norms for children age 5-16 years based on home polysomnography
Authors: Gregory Stores, Christina Crawford
Venue: Technology and Health Care (2000)

Fragmentation of sleep by brief arousals has become an acknowledged aspect of poor quality sleep but there is a shortage of normative data on such arousals, especially for children. Norms for arousals (defined according to American Sleep Disorders Association criteria) were compiled for 61 children age 5--16 years using the Oxford Medilog system for a single night of home polysomnography. No significant differences were seen between the five age subgroups considered in average number of arousals per hour of sleep although individual differences were apparent at each age level and arousal duration was somewhat longer at younger ages. The low arousal rates in the children studied are in keeping with other evidence that arousal rates increase throughout life. Boys were no different from girls in either arousal frequency or duration. Arousal frequency was correlated with PSG awakenings but only to a modest extent. These new normative values should be useful in clinical practice and research for the assessment of the quality of children's sleep.
MobiCast: a multicast scheme for wireless networks
Authors: Cheng Lin Tan, Stephen Pink
Venue: Mobile Networks and Applications (2000)

In this paper, we propose a multicast scheme known as MobiCast that is suitable for mobile hosts in an internetwork environment with small wireless cells. Our scheme adopts a hierarchical mobility management approach to isolate the mobility of the mobile hosts from the main multicast delivery tree. Each foreign domain has a domain foreign agent. We have simulated our scheme using the Network Simulator and the measurements show that our multicast scheme is effective in minimizing disruptions to a multicast session due to the handoffs of the mobile group member, as well as reducing packet loss when a mobile host crosses cell boundaries during a multicast session.
An extended transformation approach to inductive logic programming
Authors: Nada Lavrač, Peter A. Flach
Venue: ACM Transactions on Computational Logic (TOCL) (2001)

Inductive logic programming (ILP) is concerned with learning relational descriptions that typically have the form of logic programs. In a transformation approach, an ILP task is transformed into an equivalent learning task in a different representation formalism. Propositionalization is a particular transformation method, in which the ILP task is compiled to an attribute-value learning task. The main restriction of propositionalization methods such as LINUS is that they are unable to deal with nondeterminate local variables in the body of hypothesis clauses. In this paper we show how this limitation can be overcome., by systematic first-order feature construction using a particular individual-centered feature bias. The approach can be applied in any domain where there is a clear notion of individual. We also show how to improve upon exhaustive first-order feature construction by using a relevancy filter. The proposed approach is illustrated on the &ldquo;trains&rdquo; and &ldquo;mutagenesis&rdquo; ILP domains.
Variable width stacks
Authors: Naomi Rotenberg, Ascher Opler
Venue: Communications of the ACM (1963)

Character addressable, variable field computers permit ready establishment and manipulation of variable width stacks. Single machine commands may push variable field items down into such stacks or pop them up. The availability of a variety of field delimiters allows the machine to push down or pop up more than one variable width item with one command. Since these stacking operations can be made the basis of compiler decoding algorithms, the proper use of machines of this class for compilation has advantages over machines with fixed-length words.