ppxscal/embedding_network huggingface dataset:
A trace transformation technique for communication refinement
Authors: Paul Lieverse, Pieter van der Wolf, Ed Deprettere
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

Models of computation like Kahn and dataflow process networks provide convenient means for modeling signal processing applications. This is partly due to the abstract primitives that these models offer for communication between concurrent processes. However, when mapping an application model onto an architecture, these primitives need to be mapped onto architecture level communication primitives. We present a trace transformation technique that supports a system architect in performing this communication refinement. We discuss the implementation of this technique in a tool for architecture exploration named SPADE and present examples.
A dispersion pass algorithm for the polyphase merge
Authors: Armando G. Mendoza
Venue: Communications of the ACM (1962)

This paper presents a new manner of dispersing strings for a Polyphase merge. If the number of strings dispersed is between two levels acceptable by Polyphase merge, a more economical technique of reaching the next level for Polyphase merge is shown and proved.
Application of Periodogram and AR Spectral Analysis to EEG Signals
Authors: M. Akin, M. Kemal Kiymik
Venue: Journal of Medical Systems (2000)

In this study, in order to analyze the EEG signal, the conventional and modern spectral methods were investigated. Interpretation and performance of these methods were detected for clinical applications. For this purpose EEG data obtained from different persons were processed by PC computer using periodogram and AR model algorithms. Periodogram and AR modeling approaches were compared for their resolution and interpretation performance. It was determined that the AR approach is better for the use in clinical and research areas, because of the clear spectra that are obtained by it.
Solvable States in n-player Stochastic Games
Authors: Nicolas Vieille
Venue: SIAM Journal on Control and Optimization (2000)

We prove that, in every stochastic game with finitely many states and actions, there exists at least one state, starting from which an equilibrium payoff exists. This is achieved by proving that there exists a solvable set. This generalizes to an arbitrary number of players a result due to Thuijsman and Vrieze in the case of two players.
Equivalent Representations of Set Functions
Authors: Michel Grabisch, Jean-Luc Marichal, Marc Roubens
Venue: Mathematics of Operations Research (2000)

This paper introduces four alternative representations of a set function: the MÃ¶bius transformation, the co-MÃ¶bius transformation, and the interactions between elements of any subset of a given set as extensions of Shapley and Banzhaf values. The links between the five equivalent representations of a set function are emphasized in this presentation.
Integrating symbolic and numeric techniques in atomic physics
Authors: Warren F. Perger, Min Xia, Fen Flurchick, Mohammad I. Bhatti
Venue: Computing in Science and Engineering (2001)

This article describes ISNAP, a program for calculating atomic properties that uses an integrated symbolic and numerical approach for arbitrary excitations from closed-shell atoms. This program generates transition matrix elements and energy formulas up to third-order perturbation via the symbolic programming language Mathematica.
Survey of punched card codes
Authors: H. J. Smith, F. A. Williams
Venue: Communications of the ACM (1960)

The &ldquo;Survey of Coded Character Representation&rdquo; by R. W. Bemer (p. 639) covers the representation of symbols in paper tape, magnetic tape and main storage of a number of different machine systems. Another method of mechanical storage is the punched card. The results of a similar survey for punched card codes are shown in the table on page 642.
A note on range transformations for square root and logarithm
Authors: R. W. Bemer
Venue: Communications of the ACM (1963)

There was the germ of an idea in two previous papers [1, 2] which no one seems to have picked up in almost five years. For certain functions it seems desirable to transform the argument to a short range symmetric about 1.0. I will give examples of this usage for the square root and logarithm function for both binary and decimal machines.
New directions in compiler technology for embedded systems (embedded tutorial)
Authors: Nikil Dutt, Alex Nicolau, Hiroyuki Tomiyama, Ashok Halambi
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Traditionally, compiler technology has focused on the generation of code with the goal of improving performance for a variety of applications running on general-purpose processor architectures. In the embedded system space, compiler technology is faced with many new challenges, including: code generation for specialized architectural features, requireing a highly flexible degree of retargetability; memory-aware code generation that exploits the timing and structure of the embedded system's memory organization; optimizing software to meet both real-time and performance constraints; energy- and power-aware software generation, both from the context of energy minimization, as well as power modulation; code size minimization for memory-constrained embedded systems; coarse-grain transformations for tightly-coupled, memory-constrained multi-processor architectures; and interaction with the operating system for active management of embedded system resources. This paper discusses new directions for compiler technology, surveys some of the current research efforts and illustrates proposed solutions to selected issues.
A tale of two shortages: an analysis of the IT professional and MIS faculty shortages
Authors: Timothy Babbitt
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

There are hundreds of articles, numerous governmental research papers and congressional acts that are focused on attending to a shortage or information technology (IT) labor. Many predict a crippling effect from such a shortage, and a minority opinion suggests that there is no shortage. In part, this difference may reflect a lack of conceptual clarity of what constitutes a shortage. This paper, then, examines the nature of what shortages are, how shortages might look in the context of IT professionals and MIS faculty, and how we might be able to ascertain the nature of the IT labor and faculty shortages. The outcome is that by understanding the specific nature of the shortage, we can then hope to provide a remedy.
Some connectivity and security issues of NGI in medical imaging applications
Authors: Yu Fan, Kyung Hwang, Michael Gill, H. K. Huang
Venue: Journal of High Speed Networks (2000)

The next generation internet (NGI) or Internet2 is an initiative for the integration of higher speed backbone communication networks as a means to replace the current inadequate Internet for many applications including medical imaging. This paper first reviews the current status of the Internet2 and reasons why telemedicine and teleradiology require its service. A case study is given using the private ATM OC-3 network at the Laboratory for Radiological Informatics, UCSF as an example for connecting a local site to the Internet2. Network security and data integrity are discussed in both the global and the local network level. Some preliminary results on Internet2 performance in the regional and the national level, as well as comparing with other WAN technologies are given.
Co-synthesis of pipelined structures and instruction reordering constraints for instruction set processors
Authors: Ing-Jer Huang
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2001)

This paper presents a hardware/software co-synthesis approach to pipelined ISP (instruction set processor) design. The approach synthesizes the pipeline structure from a given instruction set architecture (behavioral) specification. In addition, it generates a set of reordering constraints that guides the compiler back-end (reorderer) to properly schedule instructions so that possible pipeline hazards are avoided and throughput is improved.Co-synthesis takes place while resolving pipeline hazards, which can be attributed to interin-struction dependencies (IIDs). An extended taxonomy of IIDs have been proposed for the systematic analysis of pipeline hazards. Hardware/software methods are developed to resolve IIDs. Algorithms based on taxonomy and resolutions are constructed and integrated into the pipeline synthesis process to explore hardware and software design space. Application benchmarks are used to evaluate possible designs and guide the design decision. The power of the co-synthesis tool PIPER is demonstrated through pipeline synthesis of one illustrative example and two ISPs, including an industrial one (TDY-43). In comparison with other related approaches, our approach achieves higher throughput and provides a systematic way to explore the hardware/software trade-off.
Clustered Recursive Branching Network
Authors: Khalid A. Al-Mashouq
Venue: Neural Processing Letters (2000)

Recursive branching network (RBN) was proposed in &lsqb;1&rsqb; to solve linearly non-separable problems using output-coded perceptrons. It relies on splitting the training patterns, at random, between parallel perceptrons. However, the random splitting mechanism can trap the perceptron with conflicting patterns. Optimizing the splitting methods, through clustering, is proposed here to ensure meaningful way of distributing the patterns between the perceptrons. We propose four splitting methods which use different similarity measures between patterns. We examine these methods on five standard data sets. In general, these methods enhance the performance of RBN and in many cases contribute to reducing the network complexity compared with random-splitting RBN.
Logic and semantic networks
Authors: Amaryllis Deliyanni, Robert A. Kowalski
Venue: Communications of the ACM (1979)

An extended form of semantic network is defined, which can be regarded as a syntactic variant of the clausal form of logic. By virtue of its relationship with logic, the extended semantic network is provided with a precise semantics, inference rules, and a procedural interpretation. On the other hand, by regarding semantic networks as an abstract data structure for the representation of clauses, we provide a theorem-prover with a potentially useful indexing scheme and path-following strategy for guiding the search for a proof.
Business students in information systems: wizards or apprentices?
Authors: Sandy Barker, Ann Monday
Venue: Proceedings of the Australasian conference on Computing education (2000)

There has been a significant change in the needs of our undergraduate business students in the last three to four years as more and more business graduates are developing PC applications for their own use or that of their department or organisation. The traditional business computer literacy subject that covers an introduction to hardware and software is no longer sufficient to meet the needs of many business graduates. There is ample evidence to suggest that businesses are only just realising the cost of these non-IS professionals developing applications. This paper discusses a new subject designed to provide students not only with the practical skills necessary to build a small-scale database using a 4GL but also to recognise the wider issues related to end-user development of applications. The paper explores the subject design, how the subject was delivered, whether the students achieved the learning outcomes/graduate qualities, and the current students' perceptions of the subject and its focus.
APAREL&mdash;A parse-request language
Authors: R. M. Balzer, D. J. Farber
Venue: Communications of the ACM (1969)

APAREL is described: this language is an extension to an algorithmic language (PL/I) that provides the pattern-matching capabilities normally found only in special purpose languages such as SNOBOL4 and TMG. This capability is provided through parse-requests stated in a BNF-like format. These parse-requests form their own programming language with special sequencing rules. Upon successfully completing a parse-request, an associated piece of PL/I code is executed. This code has available for use, as normal PL/I strings, the various pieces (at all levels) of the parse. It also has available, as normal PL/I variables, the information concerning which of the various alternatives were successful. Convenient facilities for multiple input-output streams, the initiation of sequences of parse-requests as a subroutine, and parse-time semantic checks are also included. APAREL has proven convenient in building a powerful SYNTAX and FUNCTION macro system, an algebraic language preprocessor debugging system, an on-line command parser, a translator for Dataless Programming, and as a general string manipulator.
Principles of distributed computing: an exciting challenge
Authors: Sergio Rajsbaum
Venue: ACM SIGACT News (2000)

The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, internet, and the web.This is the first Distributed Computing Column that I have edited. It consists of four sections: A few thoughts on the role of distributed computing theory, a reprint of the PODC 2000 Influential-Paper Award to statement, a review of the PODC 2000 Conference, and a summary of a paper on robotics presented at the conference. The column concludes with some news and acknowledgments.
Flexible delivery of information systems as a core MBA subject
Authors: Rod Learmonth
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

In terms of prior education, culture and life experience, a diverse student profile is evident in the intake into the Master of Business Administration (MBA) degree. Students may be experiencing tertiary education for the first time (industry experience entry) or adapting to a different education process (international students).In redeveloping the core MBA subject, Information Systems, materials were constructed to support student-driven "just in time" learning. This argues for an information age pedagogical model in which learning can occur with efficiency, at the student's own pace, anytime and at a location of their choosing. The paper outlines the teaching and learning context, delivery infrastructure and activities developed in response to this model.
Algorithms for trigonometric polynomials
Authors: Jamie Mulholland, Michael Monagan
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

In this paper we present algorithms for simplifying ratios of trigonometric polynomials and algorithms for dividing, factoring and computing greatest common divisors of trigonometric polynomials, that is, polynomials in sin(x) and cos(x).
Investigating the effect of voltage-switching on low-energy task scheduling in hard real-time systems
Authors: Vishu Swaminathan, Krishnendu Chakrabarty
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

We investigate the effect of voltage-switching on task execution times and energy consumption for dual-speed hard real-time systems, and present a new approach for scheduling workloads containing periodic tasks. Our method minimizes the total energy consumed by the task set and guarantees that the deadline for every task is met. We present a mixed-integer linear programming model for the NP-complete scheduling problem and solve it for moderate-sized problem instances using a public-domain solver. For larger task sets, we present a novel extended-low-energy earliest-deadline-first (E-LEDF) scheduling algorithm and apply it to two real-life task sets. Our results show that energy can be conserved in embedded real-time systems using energy-aware task scheduling. We also show that switching times have a significant effect on the energy consumed in hard real-time systems.
Listen reader: an electronically augmented paper-based book
Authors: Maribeth Back, Jonathan Cohen, Rich Gold, Steve Harrison, Scott Minneman
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

While predictions abound that electronic books will supplant traditional paper-based books, many people bemoan the coming loss of the book as cultural artifact. In this project we deliberately keep the affordances of paper books while adding electronic augmentation. The Listen Reader combines the look and feel of a real book - a beautiful binding, paper pages and printed images and text - with the rich, evocative quality of a movie soundtrack. The book's multi-layered interactive soundtrack consists of music and sound effects. Electric field sensors located in the book binding sense the proximity of the reader's hands and control audio parameters, while RFID tags embedded in each page allow fast, robust page identification.Three different Listen Readers were built as part of a six-month museum exhibit, with more than 350,000 visitors. This paper discusses design, implementation, and lessons learned through the iterative design process, observation, and visitor interviews.
Formal verification of pulse-mode asynchronous circuits
Authors: Xiahua Kong, Radu Negulescu
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

This paper addresses the problem of verifying pulse-mode asynchronous circuits, which combine advantages of different asynchronous design styles. A novel technique is proposed for constructing in a modular manner specifications and functional models of pulse-mode circuits. Case studies show the feasibility of formal verification on the basis of the proposed construction, integrated into an existing technique for verifying synchronous circuits under relative timing constraints at several levels of abstraction.
An empirical study of human Web assistants: implications for user support in Web information systems
Authors: Johan Aberg, Nahid Shahmehri
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

User support is an important element in reaching the goal of universal usability for Web information systems. Recent developments indicate that human involvement in user support is a step towards this goal. However, most such efforts are currently being pursued on a purely intuitive basis. This, empirical findings about the role of human assistants are important. In this paper we present the findings from a field study of a general user support model for Web information systems. We show that integrating human assistance into Web systems is a way to provide efficient user support. Further, this integration makes a Web site more fun to use and increases the user's trust in the site. The support also improves the site atmosphere. Our findings are summarised as recommendations and design guidelines for decision-makers and developers Web systems.
Abstraction mechanisms in CLU
Authors: Barbara Liskov, Alan Snyder, Russell Atkinson, Craig Schaffert
Venue: Communications of the ACM (1977)

CLU is a new programming language designed to support the use of abstractions in program construction. Work in programming methodology has led to the realization that three kinds of abstractions&mdash;procedural, control, and especially data abstractions&mdash;are useful in the programming process. Of these, only the procedural abstraction is supported well by conventional languages, through the procedure or subroutine. CLU provides, in addition to procedures, novel linguistic mechanisms that support the use of data and control abstractions. This paper provides an introduction to the abstraction mechanisms in CLU. By means of programming examples, the utility of the three kinds of abstractions in program construction is illustrated, and it is shown how CLU programs may be written to use and implement abstractions. The CLU library, which permits incremental program development with complete type checking performed at compile time, is also discussed.
Laser pointer interaction
Authors: Dan R. Olsen,  Jr., Travis Nielsen
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Group meetings and other non-desk situations require that people be able to interact at a distance from a display surface. This paper describes a technique using a laser pointer and a camera to accomplish just such interactions. Calibration techniques are given to synchronize the display and camera coordinates. A series of interactive techniques are described for navigation and entry of numbers, times, dates, text, enumerations and lists of items. The issues of hand jitter, detection error, slow sampling and latency are discussed in each of the interactive techniques.
On the road and on the Web?: comprehension of synthetic and human speech while driving
Authors: Jennifer Lai, Karen Cheng, Paul Green, Omer Tsimhoni
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

In this study 24 participants drove a simulator while listening to three types of messages in both synthesized speech and recorded human speech. The messages consisted of short navigation messages, medium length (approximately 100 words) email messages, and longer news stories (approximately 200 words). After each message the participant was presented with a series of multiple choice questions to measure comprehension of the message. Driving performance was recorded. Findings show that for the low driving workload conditions in the study, (cruise control, predictable two-lane road with no intersections, invariant lead car) driving performance was not affected by listening to messages. This was true for both the synthesized speech and natural speech. Comprehension of messages in synthetic speech was significantly lower than for recorded human speech for all message types.
Hierarchical federations: an architecture for information hiding
Authors: Wentong Cai, Stephen J. Turner, Boon Ping Gan
Venue: Proceedings of the fifteenth workshop on Parallel and distributed simulation (2001)

In a distributed simulation, simulation components of various types are executed at geographically different locations, forming a simulation federation to create a common virtual environment. Under the High Level Architecture (HLA), information that will be produced and consumed by a simulation component is defined in its object model, and how that information is produced and consumed is well encapsulated inside the simulation component's implementation. However, in the current implementation of the HLA's Runtime Infrastructure (RTI), information hiding between groups of simulation components in a simulation federation is not addressed. In this paper, we discuss how hierarchical federations architectures can be used to tackle this problem. The hierarchical federations architecture adopted in this paper differs from the existing architectures in that it is based on a hybrid approach for inter-operability between simulation federations. To demonstrate the information hiding using the architecture, a distributed semiconductor supply-chain simulation is also described in the paper.
On the design of display processors
Authors: T. H. Myer, I. E. Sutherland
Venue: Communications of the ACM (1968)

The flexibility and power needed in the channel for a computer display are considered. To work efficiently, such a channel must have a sufficient number of instruction that it is best understood as a small processor rather than a powerful channel. As it was found that successive improvements to the display processor design lie on a circular path, by making improvements one can return to the original simple design plus one new general purpose computer for each trip around. The degree of physical separation between display and parent computer is a key factor in display processor design.