ppxscal/embedding_network huggingface dataset:
Congestion-free Optimal Routings of Hypercube Automorphisms
Authors: Mark Ramras
Venue: SIAM Journal on Discrete Mathematics (1997)

We present an off-line method for routing a hypercube automorphism $\pi$ in the minimum number of steps. The routing has the added virtue of being congestion-free. Our method is purely algebraic, and the routing is obtained easily from the standard representation of $\pi$ as the product of a complementation and a bit permutation.
Animated graphic simulation of an automated guided vehicle system (AGVS)
Authors: Shay-Ping T. Wang
Venue: Proceedings of the 17th conference on Winter simulation (1985)

The graphic simulation package PCMODEL [1] is successfully applied to the planning of an automatic guided vehicle system (AGVS) in one of Intel's facility. The AGVS is controlled by one central computer and consists of a number of docks from which materials are either dropped or picked up by the AGV; the dispatch of AGV is prioritized to efficiently perform material handling. The utilization of AGV can be obtained through simulation, and is used to predict the number of AGV in the system. The AGV can carry two loads, therefore, it is poorly utilized if it only transports one load at a trip. To better utilize AGV, the control delay concept is introduced, which forces the AGV to carry as many as two loads as possible at each trip. The simulation also provides guideline on the selection of control delay.
YALE: yet another lambda evaluator based on interaction nets
Authors: Ian Mackie
Venue: Proceedings of the third ACM SIGPLAN international conference on Functional programming (1998)

Interaction nets provide a graphical paradigm of computation based on net rewriting. They have proved most successful in understanding the dynamics of reduction in the lambda;-calculus, where the prime example is the implementation of optimal reduction for the lambda;-calculus (Lamping's algorithm), given by Gonthier, Abadi and L eacute;vy. However, efficient implementations of optimal reduction have had to break away from the interaction net paradigm. In this paper we give a new efficient interaction net encoding of the lambda;-calculus which is not optimal, but overcomes the inefficiencies caused by the bookkeeping operations in the implementations of optimal reduction. We believe that this implementation of the lambda;-calculus could provide the basis for highly efficient implementations of functional languages.
Two heads are better than two tapes
Authors: Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
Venue: Journal of the ACM (JACM) (1997)

We show that a Turing machine with two single-head one-dimensional tapes cannot recognize the set.
System-level synthesis of low-power hard real-time systems
Authors: Darko Kirovski, Miodrag Potkonjak
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

We present a system-level approach for power optimization undera set of user specified costs and timing constraints of hard real-timedesigns. The approach optimizes all three degrees of freedom forpower minimization, namely switching activity, effective capacityand voltage supply.We first define two key associated optimization problems, processorallocation and task assignment, and establish their computationalcomplexity. Efficient algorithms are developed for bothsystem design problems. The statistical analysis of comprehensiveexperimental results and their comparison with the developed conservativeand optimistic sharp lower bounds, clearly indicates thequality of the proposed optimization techniques.
Error Estimates with Sharp Constants for a Fading Memory Volterra Problem in Linear Solid Viscoelasticity
Authors: S. Shaw, M. K. Warby, J. R. Whiteman
Venue: SIAM Journal on Numerical Analysis (1997)

The problem characterizing nonageing linear isothermal quasi-static isotropic compressible solid viscoelasticity in the time interval [0,T] is described. This is essentially a Volterra equation of the second kind arrived at by adding smooth fading memory to the elliptic linear elasticity equations. We analyze the errors resulting from replacing the relaxation functions with practical approximations, in a semidiscrete finite element approximation, and in a fully discrete scheme derived by replacing the hereditary integral with the trapezoidal rule for numerical integration. The error estimates are sharp in the sense that if certain bounds on the data are independent of T, then so also are the constants involved in them. This is a consequence of bypassing the usual Gronwall lemmas with arguments that are more sensitive to the fading memory of the physical problem.
Computation of Invariant Tori by the Fourier Methods
Authors: Huang Mingyou, Tassilo Küpper, Norbert Masbaum
Venue: SIAM Journal on Scientific Computing (1997)

In this paper, we study systems of functional equations (FEs) and first-order partial differential equations (PDEs) suggested in [SIAM J. Sci. Statist. Comput., 12 (1991), pp. 607--647 and SIAM J. Numer. Anal., 29 (1992), pp. 1741--1768] as approximations for the computation of invariant tori. The main new ideas of this paper are, first, to investigate these systems in the setting of Hilbert spaces rather than in the setting of Banach spaces and, then, to employ Fourier methods instead of difference methods for a numerical solution. Based on the setting of Sobolev spaces Hs(Tp), proper conditions for the PDE and FE systems to be dissipative are described, and some regularity results for the FE system are proved. We studied two kinds of Fourier methods, the spectral method and the pseudospectral method, in detail under dissipativity conditions. Convergence and optimal error estimates are shown theoretically for these Fourier methods in the case of general linear systems. Numerical results for three examples provided in the last section indicate that the Fourier method behaves very well not only for smooth solutions but also for nonsmooth solutions.
A transformation system for CLP with dynamic scheduling and CCP
Authors: Sandro Etalle, Maurizio Gabbrielli, Elena Marchiori
Venue: Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation (1997)

In this paper we study unfold/fold transformations for constraint logic programs (CLP) with dynamic scheduling and for concurrent constraint programming (CCP). We define suitable applicability conditions for these transformations which guarantee that the original and the transformed program have the same results of successful derivations and the same deadlock free queries.The possible applications of these results are twofold. On one hand we can use the unfold/fold system to optimize CLP and CCP programs while preserving their intended meaning and in particular without the risk of introducing deadlocks. On the other hand, unfold/fold transformations can be used for proving deadlock freeness of a class of queries in a given program: to this aim it is sufficient to apply our transformations and to specialize the resulting program with respect to the given queries in such a way that the obtained program is trivially deadlock free. As shown by several interesting examples, this yields a methodology for proving deadlock freeness which is simple and powerful at the same time.
High-level power modeling, estimation, and optimization
Authors: Enrico Macii, Massoud Pedram, Fabio Somenzi
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

In the past, the major concern of the VLSI designers werearea, performance, cost, and reliability.In recent years,however, this has changed and, increasingly, power is beinggiven comparable weight to area and speed.This is mainlydue to the remarkable success of personal computing devicesand wireless communication systems, which demandhigh-speed computation and complex functionality with lowpower consumption.In addition, there exists a strong pressurefor manufacturers of high-end products to keep powerunder control.The main driving factors for lower powerdissipation in these products are the costs associated withpackaging and cooling, and circuit reliability.Tools for the automatic design of low-power VLSI systemshave thus become mandatory.More specifically, followinga natural trend, interests of researchers have latelyshifted to the investigation of high-level power modeling,estimation, synthesis, and optimization techniques that accountfor power dissipation as the primary cost factor.This paper provides a non-exhaustive survey of the mostsuccessful and innovative ideas in this area that have appearedin the literature in the last few years.
VHDL: a call for standards
Authors: David R. Coelho
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

With the introduction of the IEEE 1076 version of VHDL, an excellent industry standard hardware description language is now available. VHDL is an extremely flexible and versatile language. As a consequence, the language reference documentation is not sufficient to insure that models written by one hardware designer will be compatible with another's models. What is required is a set of VHDL modelling conventions and standard packages which structure the usage of VHDL modelling approaches. This paper will discuss the issues inherent in VHDL in regards to model computability, and will propose a number of solutions to this problem.
Equilibrium Play in Large Group Market Entry Games
Authors: Amnon Rapoport, Darryl A. Seale, Ido Erev, James A. Sundali
Venue: Management Science (1998)

Coordination behavior is studied experimentally in a class of noncooperative market entry games featuring symmetric players, complete information, zero entry costs, and several randomly presented values of the market capacity. Once the market capacity becomes publicly known, each player must decide privately whether to enter the market and receive a payoff, which increases linearly in the difference between the market capacity and the number of entrants, or stay out. Payoffs for staying out are either positive, giving rise to the domain of gains, or negative, giving rise to the domain of losses. The major findings are substantial individual differences that do not diminish with practice, aggregate behavior that is organized extremely well in both the domains of gains and losses by the Nash equilibrium solution, and variations in the population action strategies with repeated play of the stage game that are accounted for by a variant of an adaptive learning model due to Roth and Erev (1995).
Best Error Estimates for Odd and Even Degree Deficient Splines
Authors: François Dubeau
Venue: SIAM Journal on Numerical Analysis (1997)

A constructive proof of the optimal error bound for three types of spline interpolants with deficiency is presented. The main result is of the form $\|f-s\|_{\infty} \leq C_nh^{n+1}\|f^{(n+1)}\|_{\infty}$, where $C_n$ is optimal and $s$ is a spline of odd or even degree $n$.
Designing encryption algorithms for real people
Authors: Bruce Schneier
Venue: Proceedings of the 1994 workshop on New security paradigms (1994)

There is a wide disparity between cryptographic algorithms as specified by researchers and cryptographic algorithms as implemented in software applications. Programmers are prone to implement poor key management, make mistakes coding the algorithm, and use the algorithm in ways and for periods of time not originally intended. I propose design heuristics for designing algorithms in the &ldquo;hostile&rdquo; implementation environment of real-world software development. In the real world, it is easy to choose a secure encryption algorithm. There are several, all designed by respected cryptographers, all described in the open literature, and all implemented in public-domain software. It is much harder to implement the algorithm properly in a software application. As a result, implementations of the algorithm are often far less secure in practice than its creators envisioned them. While it is not strictly the job of an algorithm designer to concern himself with implementation details, it is important to realize how algorithms are used in the real world. Armed with this knowledge, a cryptographer can make his algorithms resilient to the kinds of abuses that they will most likely face in the hands of naive programmers. This paper concerns itself with software implementations of cryptographic algorithms. Traditionally strong encryption was almost exclusively found in special-purpose and embedded hardware. Since these hardware devices were self-contained, it was easier to design them securely and force secure implementations. Today, the increased demand for cheap encryption combined with the increased power of personal computers has made software encryption more ubiquitous. Mistakes are far more common in software cryptographic systems, because programmers have far more control over the details of a software system. They have more opportunities to make mistakes in programming, implement bad key management processes, ignore memory management issues, and cut corners to improve performance.
Power sensitivity&mdash;a new method to estimate power dissipation considering uncertain specifications of primary inputs
Authors: Zhanping Chen, Kaushik Roy, Tan-Li Chou
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

Power dissipation in CMOS circuits heavily depends on the signal properties of the primary inputs. Due to uncertainties in specification of such properties, the average power should be specified between a maximum and a minimum possible value. Due to the complex nature of the problem, it is practically impossible to use traditional power estimation techniques to determine such bounds. We present a novel approach to accurately estimate the maximum and minimum bounds for average power using a technique which calculates the sensitivities of average power dissipation to primary input signal properties. The sensitivities are calculated using a novel statistical technique and can be obtained as a by-product of average power estimation using a Monte Carlo based approach. The signal properties are specified in terms of signal probability (probability of a signal being logic ONE) and signal activity (probability of signal switching). Results show that the maximum and minimum average power dissipation can vary widely if the primary input probabilities and activities are not specified accurately.
Workload Distribution in Fault Simulation
Authors: Minesh B. Amin, Bapiraju Vinnakota
Venue: Journal of Electronic Testing: Theory and Applications (1997)

Simulation at the gate level is computationally very expensive. Parallel processing is one technique to reduce simulation time. Possessing knowledge of the distribution of computational activity in simulation can aid in parallelizing it efficiently. We present a new characterization of the distribution of the computational workload in fault simulation. An empirical analysis shows that the workload distribution is circuit specific, and is largely independent of the vector set being simulated. An inexpensive method to predict the workload distribution is also discussed.
Undergraduate women in computer science: experience, motivation and culture
Authors: Allan Fisher, Jane Margolis, Faye Miller
Venue: ACM SIGCSE Bulletin (1997)

For the past year, we have been studying the experiences of undergraduate women studying computer science at Carnegie Mellon University, with a specific eye toward understanding the influences and processes whereby they attach themselves to or detach themselves from the field. This report, midway through the two-year project, recaps the goals and methods of the study, reports on our progress and preliminary conclusions, and sketches our plans for the final year and the future beyond this particular project.
Detection of Clustered Microcalcifications on Mammograms Using Surrounding Region Dependence Method and Artificial NeuralNetwork
Authors: Jong Kook Kim, Jeong Mi Park, Koun Sik Song, Hyun Wook Park
Venue: Journal of VLSI Signal Processing Systems (1998)

Clustered microcalcifications on X-ray mammograms are an important sign in the detection of breast cancer. A statistical texture analysis method, called the surrounding region dependence method (SRDM), is proposed for the detection of clustered microcalcifications on digitized mammograms. The SRDM is based on the second-order histogram in two surrounding regions. This method defines four textural features to classify region of interests (ROIs) into positive ROIs containing clustered microcalcifications and negative ROIs of normal tissues. The database is composed of 64 positive and 76 negative ROI images, which are selected from digitized mammograms with a pixel size of 100 &times; 100 &mu;m^2 and 12 bits per pixel. An ROI is selected as an area of 128 &times; 128 pixels on the digitized mammograms. In order to classify ROIs into the two types, a three-layer backpropagation neural network is employed as a classifier. A segmentation of individual microcalcifications is also proposed to show their morphologies. The classification performance of the proposed method is evaluated by using the round-robin method and a free-response receiver operating-characteristics (FROC) analysis. A receiver operating-characteristics (ROC) analysis is employed to present the results of the round-robin testing for the case of several hidden neurons. The area under the ROC curve, A_z, is 0.997, which is achieved in the case of 4 hidden neurons. The FROC analysis is performed on 20 cropped images. A cropped image is selected as an area of 512 &times; 512 pixels on the digitized mammograms. In terms of the FROC, a sensitivity of more than 90% is obtained with a low false-positive (FP) detection rate of 0.67 per cropped image.
Formal Methods Technology Transfer: A View from NASA
Authors: James L. Caldwell
Venue: Formal Methods in System Design (1998)

Since 1988 NASA Langley Research Center has supported a formal methods research program. From its inception, a primary goal of the program has been to transfer formal methods technology into aerospace industries focusing on applications in commercial air transport. The overall program has been described elsewhere. This paper gives an account of the technology transfer strategy and its evolution.
A Dynamic Network Model of the Color Visual Pathways for Attentive Recognition
Authors: Francisco Díaz-Pernas
Venue: Neural Processing Letters (1998)

A neural network architecture for the segmentation and recognition of colored and textured visual stimuli is presented. The architecture is based on the Boundary Contour System and Feature Contour System (BCS/FCS) of S. Grossberg and E. Mingolla. The architecture proposes a biologically-inspired mechanism for color processing based on antagonist interactions. It suggests how information from different modalities (i.e. color or texture) can be fused together to form a coherent segmentation of the visual scene. It identifies two stages of visual pattern recognition, namely, a global preattentive recognition of the visual scene followed by a local attentive recognition within a particular visual context. The global and local classification and recognition of visual stimuli use ART-type models of G. Carpenter and S. Grossberg for pattern learning and recognition based on color and texture. One example is presented corresponding to an figure-figure separation task. The architecture provides a mechanism for segmentation, categorization and recognition of images from different classes based on self-organizing principles of perception and pattern recognition.
Multi-media integrated into CS 2: an interactive children's story as a unifying class project
Authors: Ursula Wolz, Daniel Domen, Michael McAuliffe
Venue: ACM SIGCSE Bulletin (1997)

An interactive children's story is presented as a unifying class project for CS 2. Curricular topics include: data and algorithm abstraction, project dynamics (team work, software engineering and ethics), multi-media techniques, and hypermedia story telling. We encompass alternative learning styles by fostering collaborative team work, and promoting the big picture over esoteric detail. Students receive a detailed design document, extensive code libraries, and graphic, sound and video files. A story board gives them ample room for individual creativity and whimsy. The project is implemented in C++. This paper describes curricular goals, articulates management concerns and summarizes our past experiences.
Examining student learning of computer science
Authors: Tony Greening
Venue: ACM SIGCSE Bulletin (1997)

Student examination performance in a third-year module, "Communications, Networks and Distributed Systems" (CNDS), is analyzed in terms of different responses to questions which required qualitative versus quantitative answers. This is matched to the results of a student survey conducted in the first lecture, in which students were asked about what they would hope to gain from the module. The observations indicate that there are significant differences in the manner in which students learn computer science, and that this may correlate with expectations about desired learning outcomes. This impacts upon aspects of course design and delivery, as well as approaches to assessment (and examination design in particular). It also suggests that examinations may be regarded as offering new avenues of feedback on student learning in addition to fulfilling traditional assessment related roles.
A layered protocol architecture for multimedia wireless-PCS networks
Authors: Antonio Iera, Salvatore Marano, Antonella Molinaro
Venue: Mobile Networks and Applications (1998)

Coupled with the growing interest in the Universal Mobile Telecommunication System (UMTS) as a standard for future mobile communications, the need for a set of functions to effectively support multimedia teleservices in such an environment is also increasing. Starting from the idea that multimedia means the integrated manipulation of different information and hence the independent handling of separate information is not satisfactory, an enhanced protocol architecture for the support of multimedia teleservices in Wireless Personal Communication Systems based on UMTS is proposed. It involves Physical, MAC, Data Link, and Network layers. A Synchronisation Sub-Layer is introduced on the MAC level with the main aim of assuring a rough multimedia inter-stream synchronisation over the air interface, which is a first step prior to a fine end-to-end synchronisation performed by higher layers. Proposed functions, their basic algorithms, their location in the protocol stack, as well as the signalling exchange among modules implementing them, on network and user sides, are described in detail in the paper. The resulting architecture well fits the demanding nature of multimedia services and can be easily interfaced with the wired backbone of the system.