ppxscal/embedding_network huggingface dataset:
Integrated Circuits of Map Chaos Generators
Authors: Hidetoshi Tanaka, Shigeo Sato, Koji Nakajima
Venue: Analog Integrated Circuits and Signal Processing (2000)

A chaotic noise is one of the most important implements for information processing such as neural networks. It has been suggested that chaotic neural networks have high performance ability for information processing. In this paper, we report two designs of a compact chaotic noise generator for large integration circuits using CMOS technology. The chaotic noise is generated using map chaos. We design both of the logistic map type and the tent map type circuits. These chaotic noise generators are compact as compared with the other circuits. The results show that the successful chaotic operations of the circuits because of the positive Lyapunov number. We calculate the Lyapunov exponents to certify the results of the chaotic operations. However, it is hard to estimate its accurate number for noisy data using the conventional method. And hence, we propose the modified calculation of the Lyapunov exponent for noisy data. These two circuits are expected to be utilized for various applications.
Reading Fortran
Authors: Ronald L. Lancaster, Richard T. Thomas
Venue: ACM SIGCSE Bulletin (1976)

A new type of computer science service course is described which was developed in response to a request from several natural science departments. The goal of the course is to give advanced students the ability to read and understand existing Fortran programs. An evaluation of the course is also given.
A VHDL SGRGAM model for the validation environment of a high performance graphic processor
Authors: M. G. Wahl, H. Völkel
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

To validate the functionality of a new highly complex graphics processor described in VHDL the working environment of the processors has to be modelled. In some cases appropriate models for the external components are commercially available, in other cases these models have to be created. In this paper a general memory model for SGRAMs is presented which had to be implemented to have a flexible simulation environment for a high speed graphics processor at hand. Key features are the generality, the support of SGRAM arrays of various shapes and functions supporting the simulation process. This functionality goes far beyond the capabilities of currently commercially available SGRAM models.
A Decision-Analytic Stopping Rule for Validation of Commercial Software Systems
Authors: Tom Chávez
Venue: IEEE Transactions on Software Engineering (2000)

The decision about when to release a software product commercially is not a question of when the software has attained some objectively justifiable degree of correctness. It is, rather, a question of whether the software achieves a reasonable balance among engineering objectives, market demand, customer requirements, and marketing directives of the software organization. In this paper, we present a rigorous framework for addressing this important decision. Conjugate distributions from statistical decision theory provide an attractive means of modeling the cost and rate of bugs given information acquired during software testing, as well as prior information provided by software engineers about the fidelity of the software before testing begins. In contrast to methods such as [1] and [15], the stopping analysis presented here yields a computationally simple rule for deciding when to release a commercial software product based on information revealed to engineers during software testing¿complicated numerical procedures are not needed. Our method has the added benefits that it is sequential: It measures explicitly the costs of customer dissatisfaction associated with bugs as well as the costs of declining market position while the testing process continues; and it incorporates a practical framework for cost-criticality assessment that makes sense to professional software developers. A probabilistic model of catastrophic bugs provides another useful way of characterizing and measuring the software's expected performance after commercial release. Taken together, these tools provide a software organization with a clearer basis for making decisions about when to release a commercial software product.
Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes
Authors: Kirk Schloegel, George Karypis, Vipin Kumar
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Current multilevel repartitioning schemes tend to perform well on certain types of problems while obtaining worse results for other types of problems. We present two new multilevel algorithms for repartitioning adaptive meshes that improve the performance of multilevel schemes for the types of problems that current schemes perform poorly while maintaining similar or better results for those problems that current schemes perform well. Specifically, we present a new scratch-remap scheme called Locally-matched Multilevel Scratch-remap (or simply LMSR) for repartitioning of adaptive meshes. LMSR tries to compute a high-quality partitioning that has a large amount of overlap with the original partitioning. We show that LMSR generally decreases the data redistribution costs required to balance the load compared to current scratch-remap schemes. We present a new diffusion-based scheme that we refer to as Wavefront Diffusion. In Wavefront Diffusion, the flow of vertices moves in a wavefront from overweight to underweight subdomains. We show that Wavefront Diffusion obtains significantly lower data redistribution costs while maintaining similar or better edge-cut results compared to existing diffusion algorithms. We also compare Wavefront Diffusion with LMSR and show that these provide a trade-off between edge-cut and data redistribution costs for a wide range of problems. Our experimental results on a Cray T3E, an IBM SP2, and a cluster of Pentium Pro workstations show that both schemes are fast and scalable. For example, both are capable of repartitioning a seven million vertex graph in under three seconds on 128 processors of a Cray T3E. Our schemes obtained relative speedups of between nine and 12 when the number of processors was increased by a factor of 16 on a Cray T3E.
Fast approximation of centrality
Authors: David Eppstein, Joseph Wang
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

Social studies researchers use graphs to model group activities in social networks. An important property in this context is the centrality of a vertex: the inverse of the average distance to each other vertex. We describe a randomized approximation algorithm for centrality in weighted graphs. For graphs exhibiting the small world phenomenon, our method estimates the centrality of all vertices with high probability within a (1 + &isin;) factor in near-linear time.
Compressed tries
Authors: Kurt Maly
Venue: Communications of the ACM (1976)

This paper presents a new data structure, called a compressed trie or C-trie, to be used in information retrieval systems. It has the same underlying m-ary tree structure as a trie, where m is a parameter of the trie, but whereas the fields of the nodes in a trie have to be large enough to hold a key or at least a pointer, the fields in a C-trie are only one bit long. In the analysis part of the paper it will be shown that for a collection of n keys the retrieval time, measured in terms of bit inspections of one key, is of the order logmn and the storage requirement of the order n&middot;(m + log2n) bits. This improvement in storage requirements and retrieval time is achieved at the cost of decreasing the flexibility of the structure, and therefore updating costs are increased. First the C-trie is analyzed as a data structure, and then several methods of its use for relatively static databases are discussed.
Codes over \Bbb F_{3} + u\Bbb F_{3} and Improvementsto the Bounds on Ternary Linear Codes
Authors: T. Aaron Gulliver, Masaaki Harada
Venue: Designs, Codes and Cryptography (2001)

New ternary linear codes with parameters [208, 8, 127], [150, 10, 85], [160, 10, 91], [170, 10, 97], [180, 10, 103], and [190, 10, 110], are found which improve the known lower bound on the maximum possible minimum Hamming distance. These codes are constructed from codes over \Bbb F_{3} + u\Bbb F_{3} via a Gray map.
A formal approach to the problems of microcode compaction caused by transient data resources of the microarchitectures
Authors: L. Manasiev, A. Petkov, K. Boyanov
Venue: ACM SIGMICRO Newsletter (1986)

A method of sequential microcode compaction for architectures containing transient data resources is discussed.A theoretical apparatus, allowing the identification of microoperation groups requiring synchronization according to their transient data resources as well as their correcposnding transient data resources is suggested.An algorithm, separating the microoperation groups resulting from the transient data resources in the microarchitectures is also discussed.
Formal requirements for virtualizable third generation architectures
Authors: Gerald J. Popek, Robert P. Goldberg
Venue: Communications of the ACM (1974)

Virtual machine systems have been implemented on a limited number of third generation computer systems, e.g. CP-67 on the IBM 360/67. From previous empirical studies, it is known that certain third generation computer systems, e.g. the DEC PDP-10, cannot support a virtual machine system. In this paper, model of a third-generation-like computer system is developed. Formal techniques are used to derive precise sufficient conditions to test whether such an architecture can support virtual machines.
Iterative residual rescaling
Authors: Rie Kubota Ando, Lillian Lee
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

We consider the problem of creating document representations in which inter-document similarity measurements correspond to semantic similarity. We first present a novelsubspace-basedframework for formalizing this task. Using this framework, we derive a new analysis ofLatent Semantic Indexing(LSI), showing a precise relationship between its performance and theuniformityof the underlying distribution of documents over topics. This analysis helps explain the improvements gained by Ando's (2000)Iterative Residual Rescaling(\ours) algorithm: \ours\ can compensate for distributional non-uniformity. A further benefit of our framework is that it provides a well-motivated, effective method for automatically determining the rescaling factor \ours\ depends on, leading to further improvements. A series of experiments over various settings and with several evaluation metrics validates our claims.
The Impact of New Antiretroic Therapeutic Schemes on the Cost for AIDS Treatment in Greece
Authors: John E. Kyriopoulos, Mary A. Geitona, Vassilis A. Paparizos, Kyriakos K. Kyriakis, Chrysoula A. Botsi, Nick G. Stavrianeas
Venue: Journal of Medical Systems (2001)

The paper attempts to evaluate the clinical and economic benefits between the administration of the dual and triple antiretroic schemes for the treatment of the HIV disease. Clinical and economic data are derived from patients hospitalized in 1996 and 1997 at the University Department of Dermatology and Venereology of Andreas Sygros Hospital. Methodology is based on the comparison of patients' nosological profile and direct annual cost before and after the administration of the triple treatment. The results of the study present that the triple combination therapy yields superior health outcomes, (decrease in the days of hospitalization and in the opportunistic disease events as well as fewer deaths and loss of production). Cost comparison presents a small decrease in the annual patient's cost, where all cost components are diminished, except the medication cost. A substitution of hospital care by drug therapy is revealed and a great change is taken place in the composition of the drugs' cost. Patient cost for antiretroic drugs has more than doubled from 1996 to 1997.
Low power implementation of a turbo-decoder on programmable architectures
Authors: Frank Gilbert, Alexander Worm, Norbert Wehn
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Low Power is an extremely important issue for future mobile radio systems. Channel decoders are essential building blocks of base-band signal processing units in mobile terminal architectures. Thus low power implementations of advanced channel decoding techniques are mandatory. In this paper we present a low power implementation of the most sophisticated channel decoding algorithm (Turbo-decoding) on programmable architectures. Low power optimization is performed on two abstraction levels: on system level by the use of an intelligent cancellation technique, on implementation level by the use of dynamic voltage scaling. With these techniques we can reduce the worst case is also applicable for hardware implementations. To the best of our knowledge, this is the first in-depth study of low power implementations of Turbo-decoders based on voltage scheduling for third generation wireless systems.
The Korn Shell (3rd. ed): Unix Linux programming manual
Venue:  (2001)

If you are a Unix or Linux Shell programmer, this book will provide you with the practical advice and technical tips you will need in order to become proficient in all aspects of the Korn Shell and enhance your programming skills. From basic introductory concepts through to advanced programming techniques, you will learn how to: Customize your Unix and Linux environments Write and debug Korn Shell scripts Fine-tune Korn Shell scripts for faster executionIllustrated throughout with expansive sample programs and easy-to-apply examples, plus complete ready-to-run scripts, this book will prove an indispensable guide and technical reference for the Korn Shell.NEW! Chapter on pdksh, the public domain Korn Shell for Linux NEW! Appendices of Pdksh quick reference and Man Page NEW! CD containing pdksh source code and evaluation version of U/WIN commands.
CMPack: a complete software system for autonomous legged soccer robots
Authors: Scott Lenser, James Bruce, Manuela Veloso
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

This paper describes a completely implemented, fully autonomous software system for soccer playing quadruped ro\-bots. The system includes real-time color vision, probabilistic localization, quadruped locomotion/motion, and a hierarchical behavior system. Each component was based on well tested algorithms and approaches from other domains. Our design exposed strengths and weaknesses in each component, and led to improvements and extensions that made them more capable in general, as well as better suited for our testing domain. Integrating the components revealed design assumptions that were violated. We describe the problems that arose and how we addressed them. The integrated system was then used at the annual Robo\-Cup robotic soccer competition where we placed third, losing only a single game. We reflect on how our system addressed its goals and what was learned through implementation and testing on real robots.
Put ethics and fun into your computer course
Authors: Jill Gerhardt
Venue: Journal of Computing Sciences in Colleges (2001)

This article describes a fun yet informative approach to covering ethical issues in a Systems Analysis and Design course. By assigning a series of readings, collectively known as &ldquo;The Case of the Killer Robot,&rdquo; students were exposed to a number of realistic ethical situations as well as a great deal of knowledge that is part of the computer science and information systems curriculums. Based on the results from two questionnaires, by the end of the course the students had an increased knowledge of ethical issues, a stronger concern for ethical issues, and a greater awareness of the importance of ethics in the workplace.
An approximate method for generating symmetric random variables
Authors: John S. Ramberg, Bruce W. Schmeiser
Venue: Communications of the ACM (1972)

A method for generating values of continuous symmetric random variables that is relatively fast, requires essentially no computer memory, and is easy to use is developed. The method, which uses a uniform zero-one random number source, is based on the inverse function of the lambda distribution of Tukey. Since it approximates many of the continuous theoretical distributions and empirical distributions frequently used in simulations, the method should be useful to simulation practitioners.
Distributed processes: a concurrent programming concept
Authors: Per Brinch Hansen
Venue: Communications of the ACM (1978)

A language concept for concurrent processes without common variables is introduced. These processes communicate and synchronize by means of procedure calls and guarded regions. This concept is proposed for real-time applications controlled by microcomputer networks with distributed storage. The paper gives several examples of distributed processes and shows that they include procedures, coroutines, classes, monitors, processes, semaphores, buffers, path expressions, and input/output as special cases.
Comparing two microcomputer operating systems: CP/M amd HDOS
Authors: Michael A. Pechura
Venue: Communications of the ACM (1983)

Two moderate operating systems are compared, with the intent to demonstrate how each may satisfy the needs of a different set of users. The clear superiority of either systems does not emerge, but rather a difference in &ldquo;design philosophy.&rdquo; A method for comparing other similar systems is demonstrated.
MixJuice (poster session): an object-oriented language with simple and powerful module mechanism
Authors: Yuuji Ichisugi
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

This paper describes an object-oriented language called MixJuice, which uses the differences of class hierarchies as a unit of information hiding and reuse. In this language, classes &mdash; templates of objects &mdash; and modules &mdash; units of information hiding and reuse &mdash; are completely orthogonal, thus supporting separation of concerns. MixJuice is basically based on Java. However, its module mechanism is simpler and more powerful than that of Java. The MixJuice programmers can make use of all Java libraries and execution platforms1.
The design and implementation of panar maps in CGAL
Authors: Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Eti Ezra
Venue: Journal of Experimental Algorithmics (JEA) (2000)

Planar maps are fundamental structures in computational geometry. They are used to represent the subdivision of the plane into regions and have numerous applications. We describe the planar map package of CGAL--a Computational Geometry Algorithms Library. We discuss its modular design and implementation. In particular we introduce the two main classes of the design--planar maps and topological maps that enable the convenient separation between geometry and topology. The modular design is implemented using a generic programming approach. By switching a template parameter--the geometric traits class, one can use the same code for planar maps of different objects such as line segments or circular arcs. More flexibility is achieved by choosing a point location algorithm out of three implemented algorithms or plugging in an algorithm implemented by the user. The user of the planar maps package can benefit both from its flexibility and robustness. We present several examples of geometric traits classes and point location algorithms which demonstrate the possibility to adapt the general package to specific needs.
A view from the entry level: student perceptions of critical information systems job attributes
Authors: Tim Goles
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

Globalization and the expanding digital nature of today's business environment have resulted in skyrocketing demand for qualified IT personnel. Organizations are increasingly turning to recently graduated IS students as a critical source of supply. In light of this, the objective of this paper is to identify the relative importance of job attributes considered by IS students when evaluating a job. Drawing on content motivation as a general theoretical foundation, this paper surveyed 243 IS students at two large southwestern universities to determine what job attributes they find most appealing when assessing potential positions and organizations. Prior research was aggregated to compile a comprehensive list of job attributes. Two methods were used by respondents to evaluate these attributes; rank ordering, and points allocation (weighted measure). The results provide insight into the relative importance that IS students attach to specific job attributes. This information may be used by organizations to provide relevant information to potential employees, resulting in improved alignment between employee preferences and organizational reality, with a subsequent effect on job attitude and turnover.
Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials
Authors: Chiou-Ying Lee, Erl-Huei Lu, Jau-Yien Lee
Venue: IEEE Transactions on Computers (2001)

Two operations, the cyclic shifting and the inner product, are defined by the properties of irreducible all one polynomials. An effective algorithm is proposed for computing multiplications over a class of fields $GF(2^m)$ using the two operations. Then, two low-complexity bit-parallel systolic multipliers are presented based on the algorithm. The first multiplier is composed of $(m+1)^2$ identical cells, each consisting of one 2-input AND gate, one 2-input XOR gate, and three 1-bit latches. The other multiplier comprises of $(m+1)^2$ identical cells and mXOR gates. Each cell consists of one 2-input AND gate, one 2-input XOR gate, and four 1-bit latches. Each multiplier exhibits very low latency and propagation delay and is thus very fast. Moreover, the architectures of the two multipliers can be applied in computing multiplications over the class of fields $GF(2^m)$ in which the elements are represented with the root of an irreducible equally spaced polynomial of degree m.
Image Registration Using Wavelet-Based Motion Model
Authors: Yu-Te Wu, Takeo Kanade, Ching-Chung Li, Jeffrey Cohn
Venue: International Journal of Computer Vision (2000)

An image registration algorithm is developed to estimate dense motion vectors between two images using the coarse-to-fine wavelet-based motion model. This motion model is described by a linear combination of hierarchical basis functions proposed by Cai and Wang (SIAM Numer. Anal., 33(3):937&ndash;970, 1996). The coarser-scale basis function has larger support while the finer-scale basis function has smaller support. With these variable supports in full resolution, the basis functions serve as large-to-small windows so that the global and local information can be incorporated concurrently for image matching, especially for recovering motion vectors containing large displacements. To evaluate the accuracy of the wavelet-based method, two sets of test images were experimented using both the wavelet-based method and a leading pyramid spline-based method by Szeliski et al. (International Journal of Computer Vision, 22(3):199&ndash;218, 1996). One set of test images, taken from Barron et al. (International Journal of Computer Vision, 12:43&ndash;77, 1994), contains small displacements. The other set exhibits low texture or spatial aliasing after image blurring and contains large displacements. The experimental results showed that our wavelet-based method produced better motion estimates with error distributions having a smaller mean and smaller standard deviation.