ppxscal/embedding_network huggingface dataset:
Inverted File Partitioning Schemes in Multiple Disk Systems
Authors: Byeong-Soo Jeong, Edward Omiecinski
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

Multiple-disk I/O systems (disk arrays) have been an attractive approach to meet high performance I/O demands in data intensive applications such as information retrieval systems. When we partition and distribute files across multiple disks to exploit the potential for I/O parallelism, a balanced I/O workload distribution becomes important for good performance. Naturally, the performance of a parallel information retrieval system using an inverted file structure is affected by the partitioning scheme of the inverted file. In this paper, we propose two different partitioning schemes for an inverted file system for a shared-everything multiprocessor machine with multiple disks. We study the performance of these schemes by simulation under a number of workloads where the term frequencies in the documents are varied, the term frequencies in the queries are varied, the number of disks are varied and the multiprogramming level is varied.
A solution to a problem with Morel and Renvoise's &ldquo;Global optimization by suppression of partial redundancies&rdquo;
Authors: Karl-Heinz Drechsler, Manfred P. Stadel
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1988)

Morel and Renvoise have previously described a method for global optimization and code motion by suppression of partial redundancies [l]. Morel and Renvoise use data flow analysis to determine expression computations that should be inserted at the end of certain basic blocks and to determine redundant computations that can be eliminated. The execution of these techniques results in the movement of loop invariant expressions out of the loop. In addition to [l] Morel and Renvoise's techniques can also be applied to subexpressions of larger expressions. Then, however, in certain special cases these optimization techniques move expressions to places where some of its subexpressions are neither available nor moved together with the expression. In this paper we present a modification of Morel and Renvoise's algorithm that avoids the above described situations.
On-Line Recognition of Handwritten Symbols
Authors: Gordon Wilfong, Frank Sinden, Laurence Ruedisueli
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1996)

An on-line system for recognizing handwritten symbols from a user specified alphabet is described. When a symbol is subsequently written the system is required to recognize the symbol irrespective of the scale, orientation and position of the written symbol.
A case study in simulating PCS networks using Time Warp
Authors: Christopher D. Carothers, Richard M. Fujimoto, Yi-Bing Lin
Venue: ACM SIGSIM Simulation Digest (1995)

There has been rapid growth in the demand for mobile communications over the past few years. This has led to intensive research and development efforts for complex PCS (personal communication service) networks. Capacity planning and performance modeling is necessary to maintain a high quality of service to the mobile subscriber while minimizing cost to the PCS provider. The need for flexible analysis tools and the high computational requirements of large PCS network simulations make it an excellent candidate for parallel simulation.Here, we describe our experiences in developing two PCS simulation models on a general purpose distributed simulation platform based on the Time Warp mechanism. These models utilize two widely used approaches to simulating PCS networks: (i) the call-initiated and (ii) the portable-initiated models. We discuss design decisions that were made in mapping these models to the Time Warp executive, and characterize the workloads resulting from these models in terms of factors such as communication locality and computation granularity. We then present performance measurements for their execution on a network of workstations. These measurements indicate that the call-initiated model generally outperforms the portable initiated model, but is not able to capture phenomenon such as the &ldquo;busy line&rdquo; effect. Moreover, these studies indicate that the high locality in large-scale PCS network simulations make them well-suited for execution on general purpose parallel and distributed simulation platforms.
Hyper-linked applications and its evolving needs for future simulation capabilities
Authors: Wayne J. Davis, Andrew C. Sieveking, Scott V. Vifquain, Fernando G. Gonzalez, Joseph G. Macro
Venue: Proceedings of the 27th conference on Winter simulation (1995)

A new object-oriented framework, termed "hyper-linked manufacturing", is introduced for computer-integrated manufacturing. This framework permits complex organizational structures among intelligent agents to address the distributed coordination of the enterprise. Each intelligent agent has an integrated planning and control capability and has the capacity to model the interaction of itself with its subordinates. To this end, a distributed simulation becomes a major functional requirement in assessing the performance of subsystems within the enterprise while operating under a planned course of action. This paper defines the basic concepts associated with hyper-linked manufacturing and then discusses the future requirements for simulation technologies that evolve from its implementation.
Doing ANOVA calculations on the computer
Authors: Alan M. Sykes
Venue: ACM SIGAPL APL Quote Quad (1995)

This paper presents an approach to providing educational software for students in Management Science and Statistics which aids the calculations and understanding required for the analysis of experimental design data.
GraphicsNet '95: integrated voice, video, graphics and data network using asynchronous transfer made (ATM)
Authors: Marke Clinger
Venue: ACM SIGGRAPH Computer Graphics (1996)

Every year demonstrations at the SIGGRAPH conference push the envelope in state-of-the-art graphics. In 1995, SIGGRAPH also pushed the envelope in networking by deploying a conference-wide, production ATM network. GraphicsNet, the conference network, consisted of 400 Ethernet-over-ATM connections and 100 directly attached ATM devices. GraphicsNet was one of the largest ATM backbone networks deployed to date. Using the latest hardware and software available, GraphicsNet provided a switched internet-work to met the requirements of the demonstrations and exhibits at SIGGRAPH 95.SIGGRAPH 95, held at the Los Angeles Convention Center, required a network that would integrate voice, video, graphics and data all on one networking infrastructure. The GraphicsNet Team was formed to provide an advanced multi-gigabit-per-second network for the conference. In order to meet the requirements of the participants at SIGGRAPH 95, the combined efforts of FORE Systems, Inc., Hewlett Packard Labs and Pacific Bell were necessary to design and build a state-of-the-art network based on the evolving networking paradigm of switched internet-works. GraphicsNet's Asynchronous Transfer Mode (ATM) based network provided the facility for remote collaboration at SIGGRAPH 95 for exhibitors, Interactive Communities, Interactive Entertainment, Digital Demo and many other locations within the Los Angeles Convention Center and throughout the world.The GraphicsNet'95 sub-committee wanted to push the envelope by pioneering two major applications utilizing the bandwidth available on the ATM network, the GraphicsNet access "kiosks" and the Digital Demo. The GraphicsNet access kiosks brought a VRML representation of SIGGRAPH 95 and full motion video to the attendees through kiosks located in the lobbies. Digital Demo provided participants a hands-on environment to learn about the digital studio process by building a digital studio at the LA Convention Center.GraphicsNet illustrates the evolution of social interaction by supplying high-bandwidth WAN connectivity to SIGGRAPH 95's diverse group of collaborators in the LA area, across North America, and around the world. Due to the nature of high-speed WAN's users were unaware of when they were accessing data on the Local Area Network (LAN) or on the Wide Area Network (WAN).
Additional workshop papers presented at CSCW'94
Authors: Hugo Fuks, Leonardo Mendonça de Moura
Venue: ACM SIGOIS Bulletin (1995)

This article outlines a framework for supporting team collaboration. It proposes a cooperation model, which states the way team members access the documents of a project. It is the underlying model for a cooperative system, where developers concentrate on the application's domain, ignoring the aspects related to the cooperative process.
Grey pattern on clinical consultation
Authors: Xuerui Tan, Yuchun Xu
Venue: ACM SIGICE Bulletin (1995)

With the elementary theory of grey systems, on the basis of whitening function, grey clustering, we try to make a grey pattern of clinical consultation via size of decision weights. This way can better show and concentrate the consultant's view with the lowest bias, directly and objectively. The processes are simple. The results from grey pattern accord with the patient's profits and benefits ironing out the clinical differences between experts.
A reengineering framework for small scale software
Authors: Thomas Philip, Ramani Ramsundar
Venue: ACM SIGSOFT Software Engineering Notes (1995)

Reengineering software is approached in different ways, even though the basic process remains the same: reverse engineering followed by forward engineering. Tools are available to aid during reverse engineering and reengineering. This paper presents a framework we used to reengineer a small scale software system from a partial structured implementation to an object-oriented implementation. The framework uses function matrix to organize the extracted abstractions, algorithm tables, and data dictionary during its initial phase. Components for the target system object model are retrieved from the matrices and the dictionary. An empirical reuse metric was applied to the matrix to identify reusable parts. Application of this framework is also discussed.
aItPm: a strategy for integrating IP with ATM
Authors: Guru Parulkar, Douglas C. Schmidt, Jonathan S. Turner
Venue: ACM SIGCOMM Computer Communication Review (1995)

This paper describes research on new methods and architectures that enable the synergistic combination of IP and ATM technologies. We have designed a highly scalable gigabit IP router based on an ATM core and a set of tightly coupled general-purpose processors. This aItPm (pronounced "IP on ATM" or, if you prefer, "ip-attem") architecture provides flexibility in congestion control, routing, resource management, and packet scheduling.The aItPm architecture is designed to allow experimentation with, and fine tuning of, the protocols and algorithms that are expected to form the core of the next generation IP in the context of a gigabit environment. The underlying multi-CPU embedded system will ensure that there are enough CPU and memory cycles to perform all IP packet processing at gigabit rates. We believe that the aItPm architecture will not only lead to a scalable high-performance gigabit IP router technology, but will also demonstrate that IP and ATM technologies can be mutually supportive.
The parallel-event approach to discrete-event simulation
Authors: Hussam M. Soliman, Adel S. Elmaghraby
Venue: ACM SIGSIM Simulation Digest (1995)

One approach to speed up a discrete-event simulation program is to parallelize the execution of events in a pregenerated traditional simulation event list on a shared-memory multiprocessor. The input to the parallel-event simulator consists of a series of event lists, corresponding to different simulation runs, which are organized in the form of state-dependency graphs with random structures. Each graph is divided into a number of dependency levels which are executed in sequence by the multiprocessor.In this paper, we develop an analytical model for the performance of the parallel-event simulator. In particular, a closed form expression is given for a lower bound on the average response time of a simulation run. Performance is also estimated by simulating the parallel-event simulator. Performance results indicate that, for simulation problems whose event lists contain enough parallelism, the parallel-event simulator is capable of achieving good performance.
SQL query optimization: reordering for a general class of queries
Authors: Piyush Goel, Bala Iyer
Venue: ACM SIGMOD Record (1996)

The strength of commercial query optimizers like DB2 comes from their ability to select an optimal order by generating all equivalent reorderings of binary operators. However, there are no known methods to generate all equivalent reorderings for a SQL query containing joins, outer joins, and groupby aggregations. Consequently, some of the reorderings with significantly lower cost may be missed. Using hypergraph model and a set of novel identities, we propose a method to reorder a SQL query containing joins, outer joins, and groupby aggregations. While these operators are sufficient to capture the SQL semantics, it is during their reordering that we identify a powerful primitive needed for a dbms. We report our findings of a simple, yet fundamental operator, generalized selection, and demonstrate its power to solve the problem of reordering of SQL queries containing joins, outer joins, and groupby aggregations.
A natural semantics for Eiffel dynamic binding
Authors: Isabelle Attali, Denis Caromel, Sidi Ould Ehmety
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1996)

This article formally defines Eiffel dynamic binding in presence of renaming and redefinition. Message passing, inheritance, and polymorphism are expressed in an operational style using natural semantics. From the formal specification, we derive an algorithm to determine the appropriate version of a feature to apply to a given object. This algorithm, based only on the class hierarchy and not using any intermediate structure, gives a practical approach to the understanding of inheritance, renaming, and redefinition in Eiffel.
Weakly Hard Problems
Authors: Jack H. Lutz
Venue: SIAM Journal on Computing (1995)

A weak completeness phenomenon is investigated in the complexity class ${\rm E}= {\rm DTIME}(2^{\rm linear})$. According to standard terminology, a language $H$ is $\leq^{\rm P}_{m}$-hard for E if the set ${\rm P}_{m}(H)$, consisting of all languages $A \leq^{\rm P}_{m}H$, contains the entire class E. A language $C$ is $\leq^{\rm P}_{m}$-complete for E if it is $\leq^{\rm P}_{m}$-hard for E and is also an element of E. Generalizing this, a language $H$ is weakly $\leq^{\rm P}_{m}$-hard for E if the set ${\rm P}_{m}(H)$ does not have measure 0 in E. A language $C$ is weakly $\leq^{\rm P}_{m}$-complete for E if it is weakly $\leq^{\rm P}_{m}$-hard for E and is also an element of E. The main result of this paper is the construction of a language that is weakly $\leq^{\rm P}_{m}$-complete, but not $\leq^{\rm P}_{m}$-complete, for E. The existence of such languages implies that previously known strong lower bounds on the complexity of weakly $\leq^{\rm P}_{m}$-hard problems for E (given by work of Lutz, Mayordomo, and Juedes) are indeed more general than the corresponding bounds for $\leq^{\rm P}_{m}$-hard problems for E. The proof of this result introduces a new diagonalization method, called martingale diagonalization. Using this method, one simultaneously develops an infinite family of polynomial time computable martingales (betting strategies) and a corresponding family of languages that defeat these martingales (prevent them from winning too much money) while also pursuing another agenda. Martingale diagonalization may be useful for a variety of applications.
Adaptive Pattern Matching
Authors: R. C. Sekar, R. Ramesh, I. V. Ramakrishnan
Venue: SIAM Journal on Computing (1995)

Pattern matching is an important operation used in many applications such as functional programming, rewriting, and rule-based expert systems. By preprocessing the patterns into a DFA-like automaton, we can rapidly select the matching pattern(s) in a single scan of the relevant portions of the input term. This automaton is typically based on left-to-right traversal of the patterns. By adapting the traversal order to suit the set of input patterns, it is possible to considerably reduce the space and matching time requirements of the automaton. The design of such adaptive automata is the focus of this paper. We first formalize the notion of an adaptive traversal. We then present several strategies for synthesizing adaptive traversal orders aimed at reducing space and matching time complexity. In the worst case, however, the space requirements can be exponential in the size of the patterns. We show this by establishing an exponential lower bounds on space that is independent of the traversal order used. We then discuss an orthogonal approach to space minimization based on direct construction of optimal dag automata. Finally, our work brings forth the impact of typing in pattern matching. In particular, we show that several important problems (e.g., lazy pattern matching in ML) are computationally hard in the presence of type disciplines, whereas they can be solved efficiently in the untyped setting.
A brief survey of current work on network attached peripherals (extended abstract)
Authors: Rodney Van Meter
Venue: ACM SIGOPS Operating Systems Review (1996)

Work on network-attached peripherals (NAPs) can be divided into essentially three areas --- device interfaces and protocols, multimedia use and mass storage use. This paper is an extended abstract reviewing some of the current work and provides references and WWW pointers to many of the projects. The impact of this technological advance on operating systems is discussed. The primary purpose of this paper is to broaden understanding of the advantages and pitfalls of NAPs and encourage further research in the design and use of network-attached peripherals and NAP-capable systems. An expanded form of this document is available on the web or from the author.
A comparative study of ethical attitudes among MIS students and professionals
Authors: Harry C. Benham, Jennifer L. Wagner
Venue: ACM SIGCPR Computer Personnel (1995)

This paper discusses attitudes toward ethical issues in information systems. Approximately 120 subjects were drawn from two populations: full-time undergraduate business students and full-time MIS employees who were also part-time students studying for a masters in MIS. Both groups were enrolled in an MIS course at the time of the study.The subjects read twenty information systems-based scenarios and classified the 31 behaviors described in them as Unacceptable, Questionable, or Acceptable. The results were compared to each other, as well as to the results of prior studies using the same instrument. The replication of earlier work with somewhat different subject groups provides the foundation for the present study. The prior studies showed South African students to be more "ethically lenient" than corresponding American students.The hypothesis that the MIS professionals would demonstrate a greater sensitivity to MIS ethical issues than either the undergraduate business or information systems majors is supported. Although earlier researchers have used undergraduates as substitutes for information systems personnel in many ethics studies, these two population groups do, in fact, differ.
Using a configuration management tool to coordinate software development
Authors: Rebecca E. Grinter
Venue: Proceedings of conference on Organizational computing systems (1995)

I describe a naturalistic study of one organization's use of a configuration management tool to coordinate the development of a software product. In this organization, the developers use the tool routinely to reduce the complexities of coordinating their development efforts. I examine how the tool provides mechanisms of interaction that let the developers work with each other. I identify four aspects of these mechanisms: difficulties of representing work, the multiple levels that they operate at, the possibilities for coordination they provide, and their role in supporting a model of work.
25 years of quantum cryptography
Authors: Gilles Brassard, Claude Crépeau
Venue: ACM SIGACT News (1996)

The fates of SIGACT News and Quantum Cryptography are inseparably entangled. The exact date of Stephen Wiesner's invention of "conjugate coding" is unknown but it cannot be far from April 1969, when the premier issue of SIGACT News---or rather SICACT News as it was known at the time---came out. Much later, it was in SIGACT News that Wiesner's paper finally appeared [74] in the wake of the first author's early collaboration with Charles H. Bennett [7]. It was also in SIGACT News that the original experimental demonstration for quantum key distribution was announced for the first time [6] and that a thorough bibliography was published [19]. Finally, it was in SIGACT News that Doug Wiedemann chose to publish his discovery when he reinvented quantum key distribution in 1987, unaware of all previous work but Wiesner's [73, 5].Most of the first decade of the history of quantum cryptography consisted of this lone unpublished paper by Wiesner. Fortunately, Bennett was among the few initiates who knew of Wiesner's ideas directly from the horse's mouth. His meeting with the first author of this column in 1979 was the beginning of a most fruitful lifelong collaboration. It took us five more years to invent quantum key distribution [4], which is still today the best-known application of quantum mechanics to cryptography. The second author joined in slightly later, followed by a few others. But until the early 1990's, no more than a handful of people were involved in quantum cryptographic research. Since then, the field has taken off with a vengeance, starting with Artur K. Ekert's proposal to use quantum nonlocality for cryptographic purposes [33].The golden age started in earnest when Ekert organized the first international workshop on quantum cryptography in Broadway, England, in 1993. Since then, many conferences have been devoted at least partly to quantum cryptography, which has become a major international topic. The purpose of the aforementioned 1993 bibliography in SIGACT News was to cite as much as possible all papers ever written on the subject, including unpublished manuscripts: there were 57 entries in total. Today, such an undertaking would be nearly impossible owing to the explosion of new research in the field.The purpose of this column is to give an overview of the current research in quantum cryptography. It is not our intention to be exhaustive and we apologize in advance to any researcher whose work we may have omitted. Note that we do not necessarily agree with the claims in every paper mentioned here: this column should not be construed as a seal of approval!
Performance of checksums and CRCs over real data
Authors: Craig Partridge, Jim Hughes, Jonathan Stone
Venue: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication (1995)

Checksum and CRC algorithms have historically been studied under the assumption that the data fed to the algorithms was entirely random. This paper examines the behavior of checksums and CRCs over real data from various UNIX reg; file systems. We show that, when given real data in small to modest pieces (e.g., 48 bytes), all the checksum algorithms have skewed distributions. In one dramatic case, 0.01% of the check values appeared nearly 19% of the time. These results have implications for CRCs and checksums when applied to real data. They also cause a spectacular failure rate for the both TCP and Fletcher's checksums when trying to detect certain types of packet splices.