ppxscal/embedding_network huggingface dataset:
Decompression: a living laboratory in cyberspace
Authors: Betty Beaumont
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

Decompression is a proposed cyberworld created by electronically collaging multiple stories and images of the contiguous worlds of technology, science and art. The developing Decompression centers around Ocean Landmark (1980), a collaborative art work that transformed 500 tons of an industrial coal waste product into a thriving underwater environment that is fished and feeds people. Decompression will image &mdash;for the first time&mdash; Ocean Landmark in its life-sustaining form. The technologically mediated images of this underwater oasis will be dynamic images visually related to sonograms, such as images of the fetus (a highly technologically mediated dynamic image) and side-scan sonar. As Ocean Landmark is a flourishing ecosystem, Decompression will develop into Living Laboratory, a thriving information-system in cyberspace. Modeled on virtual environments in which the user's perception and spatial position affects their experience of the space, Living Laboratory will be a dynamically changing art space with an architecture that combines technologically mediated images and virtual diverse perceptual displays. The realized Ocean Landmark, a model for ecological equilibrium in the invisible underwater world, is an interdisciplinary project that for two decades has resided in the domain of the imagination. By visualizing Ocean Landmark's invisible realm, Living Laboratory will elucidate and elaborate virtual perceptual models of different ways of experiencing information within a contemporaneous context. This Living Laboratory will grow, develop and evolve into a mature and provocative discursive community.
Interval-Based Analysis of Software Processes
Authors: D. Ziegenbein, F. Wolf, K. Richter, M. Jersak
Venue: Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (2001)

A typical characteristic of complex embedded systems is their large software share that consists of software processes either being directly written in an implementation language like C, or being created from abstract modeling tools (e. g. Simulink or StateMate) using standard code generators, or being reused from previous designs (e. g. legacy code). A major challenge is the safe integration of these separately designed system parts. This paper focuses on the formal analysis of software processes with respect to their non-functional properties like timing or power consumption. The proposed approach yields safe upper and lower bounds on these properties and has advantages over previous work in terms of accuracy and efficiency. Further, it is shown how the results of this process-level analysis can be utilized to generate a model for the system-wide validation of non-functional properties. The applicability of the approach is demonstrated using an example of a filter process operating on a packet stream.
Cache investment: integrating query optimization and distributed data placement
Authors: Donald Kossmann, Michael J. Franklin, Gerhard Drasch, Wig Ag
Venue: ACM Transactions on Database Systems (TODS) (2000)

Emerging distributed query-processing systems support flexible execution strategies in which each query can be run using a combination of data shipping and query shipping. As in any distributed environment, these systems can obtain tremendous performance and availability benefits by employing dynamic data caching. When flexible execution and dynamic caching are combined, however, a circular dependency arises: Caching occurs as a by-product of query operator placement, but query operator placement decisions are based on (cached) data location. The practical impact of this dependency is that query optimization decisions that appear valid on a per-query basis can actually cause suboptimal performance for all queries in the long run. To address this problem, we developed Cache Investment - a novel approach for integrating query optimization and data placement that looks beyond the performance of a single query. Cache Investment sometimes intentionally generates a &ldquo;suboptimal&rdquo; plan for a particular query in the interest of effecting a better data placement for subsequent queries. Cache Investment can be integrated into a distributed database system without changing the internals of the query optimizer. In this paper, we propose Cache Investment mechanisms and policies and analyze their performance. The analysis uses results from both an implementation on the SHORE storage manager and a detailed simulation model. Our results show that Cache Investment can significantly improve the overall performance of a system and demonstrate the trade-offs among various alternative policies.
Use of tree structures for processing files
Authors: Edward H. Sussenguth,  Jr.
Venue: Communications of the ACM (1963)

In data processing problems, files are frequently used which must both be searched and altered. Binary search techniques are efficient for searching large files, but the associated file organization is not readily adapted to the file alterations. Conversely, a chained file allocation permits e 1 cient alteration but cannot be searched efficiently. A file organized into a tree-like structure is discussed, and it is shown that such a file may both be searched and altered with times proportional to s logs N, where N is the number of file items and s is a parameter of the tree. It is also shown that optimizing the value of s leads to a search time which is only 25 per cent slower than the binary search. The tree organization employs two data chains and may be considered to be a compromise between the organizations for the binary search and the chained file. The relation of the tree organization to multidimensional indexing and to the trie structure is also discussed.
An updated survey of GA-based multiobjective optimization techniques
Authors: Carlos A. Coello
Venue: ACM Computing Surveys (CSUR) (2000)

After using evolutionary techniques for single-objective optimization during more than two decades, the incorporation of more than one objective in the fitness function has finally become a popular area of research. As a consequence, many new evolutionary-based approaches and variations of existing techniques have recently been published in the technical literature. The purpose of this paper is to summarize and organize the information on these current approaches, emphasizing the importance of analyzing the operations research techniques in which most of them are based, in an attempt to motivate researchers to look into these mathematical programming approaches for new ways of exploiting the search capabilities of evolutionary algorithms. Furthermore, a summary of the main algorithms behind these approaches is provided, together with a brief criticism that includes their advantages and disadvantages, degree of applicability, and some known applications. Finally, further trends in this area and some possible paths for further research are also addressed.
Using variable length ngrams for retrieving technical abstracts in Japanese (poster session)
Authors: Lin Feng, Kyoji Umemura, Mikio Yamamoto, Kenneth W. Church
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

Previous studies have reported that bigrams work well for many Asian language including Chinese, Korean and Japanese. Most of these studies have focused on newspaper texts. We report an experiment with a very different genre (technical abstracts) and find performance can be improved by combining both short and long ngrams. It is a sound approach to work with all ngrams of all lengths since we will have more information than that of bigrams.
Dynamic Scheduling and Fault-Tolerance: Specification andVerification
Authors: Tomasz Janowski, Mathai Joseph
Venue: Real-Time Systems (2001)

Consider a distributed real-time program which is executed on a system with a limited set of hardware resources. Assume the program is required to satisfy some timing constraints, despite the occurrence of anticipated hardware failures. For efficient use of resources, scheduling decisions must be taken at run-time, considering deadlines, the load and hardware failures. The paper demonstrates how to reason about such dynamically scheduled programs in the framework of a timed process algebra and modal logic. The algebra provides a uniform process encoding of programs, hardware and schedulers, with an operational semantics of a process depending on the assumptions about faults. The logic specifies the timing properties of a process and verifies them via this fault-affected semantics, establishing fault-tolerance. The approach lends itself to application of existing tools and results supporting reasoning in process algebras and modal logics.
GEORGE 3&mdash;A general purpose time sharing and operating system
Authors: M. D. Oestreicher, M. J. Bailey, J. I. Strauss
Venue: Communications of the ACM (1967)

An Operating System is described which will run on a wide variety of configurations of the I.C.T. 1900, and can handle a large number of online console users while at the same time running several offline (background) jobs. The system is not oriented towards either mode and can be either a batch processing system (such as the ATLAS Supervisor, IBSYS, or GECOS), or a multiaccess system (resembling, to the user, CTSS or MULTICS), or both simultaneously, depending on the installation, which can adjust the Schedulers. Both online users and offline jobs use a common Command Language. The system includes a Multilevel device-independent File Store.
Optimal shift strategy for a block-transfer CCD memory
Authors: Richard L. Sites
Venue: Communications of the ACM (1978)

For the purposes of this paper, a block-transfer CCD memory is composed of serial shift registers whose shift rate can vary, but which have a definite minimum shift rate (the refresh rate) and a definite maximum shift rate. The bits in the shift registers are numbered 0 to N - 1, and blocks of N bits are always transferred, always starting at bit 0. What is the best shift strategy so that a block transfer request occurring at a random time will have to wait the minimal amount of time before bit 0 can be reached? The minimum shift rate requirement does not allow one to simply &ldquo;park&rdquo; at bit 0 and wait for a transfer request. The optimal strategy involves shifting as slowly as possible until bit 0 is passed, then shifting as quickly as possible until a critical boundary is reached, shortly before bit 0 comes around again. This is called the &ldquo;hurry up and wait&rdquo; strategy and is well known outside the computer field. The block-transfer CCD memory can also be viewed as a paging drum with a variable (bounded) rotation speed.
Protection and the control of information sharing in multics
Authors: Jerome H. Saltzer
Venue: Communications of the ACM (1974)

The design of mechanisms to control the sharing of information in the Multics system is described. Five design principles help provide insight into the tradeoffs among different possible designs. The key mechanisms described include access control lists, hierarchical control of access specifications, identification and authentication of users, and primary memory protection. The paper ends with a discussion of several known weaknesses in the current protection mechanism design.
Cognitive Factors in Programming with Diagrams
Authors: Alan F. Blackwell, Kirsten N. Whitley, Judith Good, Marian Petre
Venue: Artificial Intelligence Review (2001)

Visual programming languages aim to broaden the use of diagrams within the software industry, to the extent that they are integrated into the programming language itself. As a result, they provide an ideal opportunity to study the benefits of diagrams as an external representation during problem solving: not only is programming a challenging problem-solving activity, but the effect of diagram usage can be directly assessed by comparing performance while using a visual programming language to performance with a standard textual language. There have been several misconceptions amongst visual language researchers regarding the role of diagrams in software design, but these are being addressed by empirical studies and by new theories of notation design derived from studies of visual programming. Based on this research, the authors are able to recommend several new directions for research into thinking with diagrams.
Dimensioning server access bandwidth and multicast routing in overlay networks
Authors: Sherlia Y. Shi, Jonathan S. Turner, Marcel Waldvogel
Venue: Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video (2001)

Application-level multicast is a new mechanism for enabling multicast in the Internet. Driven by the fast growth of network audio/video streams, application-level multicast has become increasingly important for its efficiency of data delivery and its ability of providing value-added services to satisfy application specific requirements. From a network design perspective, application-level multicast differs drastically from traditional IP multicast in its network cost model and routing strategies. We present these differences and formulate them as a network design problem consisting of two parts: one is bandwidth assignment in the overlay network, the other is load-balancing multicast routing with delay constraints. We use analytical methods and simulations to show that our design solution is a valid and cost-effective approach. Simulation results show that we are able to achieve network utilization within 10% of the best possible utilization while keeping the session rejection rate low.
A virtual operating system
Authors: Dennis E. Hall, Deborah K. Scherrer, Joseph S. Sventek
Venue: Communications of the ACM (1980)

Moving to a new system is costly and error-prone. The problem can be reduced through use of a virtual operating system that disentangles computing environments from their underlying operating systems. The authors report on their successful experience in doing this and achieving inter-system uniformity at all three levels of user interface: virtual machine, utilities, and command language.
Towards context-based search engine selection
Authors: David B. Leake, Ryan Scherle
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

A well-known problem for web search is targeting search on information that satisfies users' information needs. User queries tend to be short, and hence often ambiguous, which can lead to inappropriate results from general-purpose search engines. This has led to a number of methods for narrowing queries by adding information. This paper presents an alternative approach that aims to improve query results by using knowledge of a user's current activities to select search engines relevant to their information needs, exploiting the proliferation of high-quality special-purpose search services. The paper introduces the PRISM source selection system and describes its approach. It then describes two initial experiments testing the system's methods.
Competitive concurrent distributed queuing
Authors: Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

Distributed queuing is a fundamental problem in distributed computing, arising in a variety of applications. The challenge in designing a distributed queuing algorithm is to minimize message traffic and delay. This paper gives a novel competitive analysis of the Arrow distributed queuing protocol under concurrent access. We analyze the combined latency of r simultaneous requests, and derive a competitive ratio of s &middot; log r, where s is the stretch of a preselected spanning tree in the network. Our analysis employs a novel greedy characterization of the way the Arrow protocol orders concurrent requests, and yields a new lower bound on the quality of the nearest-neighbor heuristic for the Traveling Salesperson Problem.
The Volumetric Barrier for Semidefinite Programming
Authors: Kurt M. Anstreicher
Venue: Mathematics of Operations Research (2000)

We consider the volumetric barrier for semidefinite programming, or "generalized" volumetric barrier, as introduced by Nesterov and Nemirovskii. We extend several fundamental properties of the volumetric barrier for a polyhedral set to the semidefinite case. Our analysis facilitates a simplified proof of self-concordance for the semidefinite volumetric barrier, as well as for the combined volumetric-logarithmic barrier for semidefinite programming. For both of these barriers we obtain self-concordance parameters equal to those previously shown to hold in the polyhedral case.
Anomalous behavior of the fifty-percent rule in dynamic memory allocation
Authors: John E. Shore
Venue: Communications of the ACM (1977)

This paper reports simulation data showing that, in dynamic memory allocation, the average free-to-allocated-block ratio can differ considerably and in both directions from the predictions of the 50 percent rule. A new derivation is given, and it is shown that previous derivations make an assumption that may be violated frequently. On the basis of the simulation data and the derivation, it is hypothesized that the anomalous behavior results from the combined effects of systematic placement and the statistics of the release process. Additional simulations support this hypothesis. Systematic placement, which refers to the natural convention of always allocating storage requests against the same end of the free block selected by the allocation strategy, tends to order blocks within contiguous groups according to their allocation time. The degree of anomalous behavior depends on the extent to which allocated blocks are released in the order of their allocation. For non-Markovian release processes, the extent of the correlation between allocation order and release order varies approximately inversely with the coefficient of variation of the memory residence time distribution. The simulations show that allocation efficiency depends strongly on the residence time distribution; efficiency decreases as the distribution's coefficient of variation increases. Some practical implications are briefly discussed.
Using formal specifications in the design of a human-computer interface
Authors: Robert J. K. Jacob
Venue: Communications of the ACM (1983)

Formal specification techniques are valuable in software development because they permit a designer to describe the external behavior of a system precisely without specifying its internal implementation. Although formal specifications have been applied to many areas of software systems, they have not been widely used for specifying user interfaces. In the Military Message System project at the Naval Research Laboratory, the user interfaces as well as the other components of a family of message systems are specified formally, and prototypes are then implemented from the specifications. This paper illustrates the specification of the user interface module for the family of message systems. It then surveys specification techniques that can be applied to human-computer interfaces and divides the techniques into two categories: those based on state transition diagrams and those based on BNF. Examples of both types of specifications are given. Specification notations based on state transition diagrams are preferable to those based on BNF because the former capture the surface structure of the user interface more perspicuously. In either notation, a high-level abstraction for describing the semantics of the user interface is needed, and an application-specific one is used here.
An approach to realistic fault prediction and layout design for testability in analog circuits
Authors: J. A. Prieto, A. Rueda, I. Grout, E. Peralías, J. L. Huertas, A. M. D. Richardson
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents an approach towards realistic fault prediction in analog circuits. It exploits the Inductive Fault Analysis (IFA) methodology to generate explicit models able to give the probability of occurrence of faults associated with devices in an analog cell. This information intends to facilitate the integration of design and test phases in the development of an IC since it provides a realistic fault list for simulation before going to the final layout, and also makes possible layout optimization towards what we can call layout level design for testability.
SageTalk: designing a tool for designing successful web-based social agents
Authors: Katherine Isbister, David Young
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

In this paper, we briefly describe a programming environment and platform for creating successful (engaging and useful) web- based social agents, and offer some general recommendations for others interested in generating programming and presentation environments that support the development of successful social agents.
Simultaneous Identification of Face and Orientation
Authors: Pei Ling Lai, Colin Fyfe
Venue: Neural Processing Letters (2000)

We have recently developed an extension of a Principal Component Analysis Artificial Neural Network which we have linked to the statistical technique of Factor Analysis. The learning rule can be shown to be optimal for data sets corrupted by Gaussian noise. We now derive from a new cost function a novel learning rule which is optimal for a standard data set. We compare both rules on a data set composed of 10 faces in a mixture of poses. The first learning rule performs best on the face data. Our conclusion is that the first rule which is optimal for Gaussian noise is more generally useful but that specific rules may be optimal for finding the independent factors underlying specific data sets dependent on the noise in the data set.
Performance modeling of elastic traffic in overload
Authors: Thomas Bonald, James Roberts
Venue: Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2001)

While providers generally aim to avoid congestion by adequate provisioning, overload can clearly occur on certain network links. In this paper we propose some simple preliminary models for an overloaded link accounting for user impatience and reattempt behavior.
Assembling code for machines with span-dependent instructions
Authors: Thomas G. Szymanski
Venue: Communications of the ACM (1978)

Many modern computers contain instructions whose lengths depend on the distance from a given instance of such an instruction to the operand of that instruction. This paper considers the problem of minimizing the lengths of programs for such machines. An efficient solution is presented for the case in which the operand of every such &ldquo;span-dependent&rdquo; instruction is either a label or an assembly-time expression of a certain restricted form. If this restriction is relaxed by allowing these operands to be more general assembly-time expressions, then the problem is shown to be NP-complete.
Toward a comprehensive, knowledge-based software design course
Authors: David Thomas, Carl Steidley
Venue: Proceedings of the seventh annual consortium for computing in small colleges central plains conference on The journal of computing in small colleges (2001)

Many colleges and universities teach courses in the design and implementation of so-called expert systems. Such a course might include discussions of topics from traditional (symbolic) artificial intelligence, and culminate in the construction of a prototypical rule-based system. In general, the emphasis is on the use of knowledge compiled and encoded by the designer. Here, an alternative approach is suggested in which such a course is broadened to include fundamental topics from the study of artificial neural nets. In this way the student is exposed to the notion that not only can program knowledge be contributed directly by the designers, but might also be extracted by the software from the data itself.