ppxscal/embedding_network huggingface dataset:
Improving education quality, a full scale study
Authors: Anders Berglund, Mats Daniels
Venue: ACM SIGCSE Bulletin (1997)

We now and then make changes to our courses and how we teach or examine them. This is often done in isolation from other courses that the students take. In this paper we report on experiences made in a coordinated study concerning examination methods. The target group was 60 students from the Systems branch of the Engineering Physics study program. We changed all three courses they took during the first ten weeks of the spring semester 1996. The changes were in short: replace the final exam by weekly assignments, introduce seminars as a method of examination, and in the cases where a written exam was kept, the main focus of the questions were changed to showing understanding, ability to analyze and synthesize.Our experiences in this study clearly show that changing examination is a tool for changing the way our students work, and thus for improving the quality of the education.
Fast hardware/software co-simulation for virtual prototyping and trade-off analysis
Authors: Claudio Passerone, Luciano Lavagno, Massimiliano Chiodo, Alberto Sangiovanni-Vincentelli
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Hardware/software co-simulation is generally performed withseparate simulation models.This makes trade-off evaluationdifficult, because the models must be re-compiled wheneversome architectural choice is changed.We propose a techniqueto simulate hardware and software that is almost cycle-accurate,and uses the same model for both types of components.Only the timing information used for synchronizationneeds to be changed to modify the processor choice, the implementationchoice, or the scheduling policy.We show howthis technique can be used to decide the implementation of areal-life example, a car dashboard controller.
WebAda
Authors: D. Douglas Smith
Venue: ACM SIGAda Ada Letters (1997)

The Ada community has used the power of the Internet to distribute computer resources and information; and most recently the World Wide Web (WWW) makes it easier to find those resources. Now, a tool called WebAda uses the Internet and the WWW to provide an interactive capability! [For the rest of this paper, I will use the term Internet to include the World Wide Web.]WebAda is an Ada development environment accessed via the World Wide Web. You don't download the compiler or any other software! You enter programs, set switches, compile, and see results through your favorite browser. In other words, your browser is the Graphical User Interface (GUI) to WebAda.The Lovelace Tutorial took an initial step to become interactive, providing a multiple choice quiz at the end of most tutorial pages. WebAda has taken the next step with an on-line development environment which integrates Ada tools and information.One could say WebAda is to the Internet as C is to Unix, or as Basic is to DOS. When you have Internet access, you have all of the capabilities of WebAda available.
A dynamically-directed switch model for MOS logic simulation
Authors: Dan Adler
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

A new model for MOS transistors suitable for logic simulation of VLSI circuits is presented based on the concept of a Dynamically Directed Switch (DDS). In this model, transistors are represented by directed edges in a graph, capable of changing their direction dynamically. A new distributed algorithm for switch-level simulation is presented based on an incremental graph algorithm where edge and vertex labels are updated as a consequence of circuit events. The result is a switch-level algorithm that runs at speeds approaching gate-level logic simulators, while dealing with all the features associated with switch-level simulation : bidirectional signal flow, ratioed logic, RC-tree timing, and correct handling of transistor signal propagation in the presence of unknown signals. The implementation of this algorithm in the Lsim Mixed-Mode Analog and Digital Simulator is described, and some results and examples are presented.
Classification of Extremal Double Circulant Self-Dual Codesof Lengths 64 to 72
Authors: T. Aaron Gulliver, Masaaki Harada
Venue: Designs, Codes and Cryptography (1998)

Recently extremal double circulant self-dual codes have been classified for lengths n &le; 62. In this paper, a complete classification of extremal double circulant self-dual codes of lengths 64 to 72 is presented. Almost all of the extremal double circulant singly-even codes given have weight enumerators for which extremal codes were not previously known to exist.
Pharmacokinetic modeling: an approach to risk assessment
Authors: Philip E. Robinson, Cheryl S. Scott, David W. Yesair, Paul I. Feder, Steven J. Naber
Venue: Proceedings of the 17th conference on Winter simulation (1985)

The United States Environmental Protection Agency (EPA) is sponsoring research on the development of Pharmacokinetic Models to support the Agency's Exposure and Risk Assessment processes. A prototype model, formulated for the chemical hexachlorobenzene (HCB), has been developed to describe this chemical's absorption, distribution, and elimination in humans and animal species. These processes are described by systems of simultaneous coupled first order differential equations. The model provided a useful tool to estimate the total cumulative dose and concentrations of HCB in offspring via the lactational transfer of HCB from the mother.
Fractal structure of random programs
Authors: Peter Kokol, Janez Brest
Venue: ACM SIGPLAN Notices (1998)

We constructed a generator of random programs and with the comparison of random and ordinary programs we showed that the long range correlation characteristic coefficient can be used as a measure of the semantic structure of software.
Combat simulations in U.S. Army training and testing
Authors: Lawrence J. Dacunto, David J. Prybyla
Venue: Proceedings of the 28th conference on Winter simulation (1996)

The U.S. Army has invested billions of dollars in new command and control (C/sup 2/) automation systems and communications for transfer of associated information. Testing of these new systems is a very costly process that can be significantly enhanced by using simulations. Training tactical units in command post exercises can also be significantly improved if they are integrated with "go to war" systems. This paper explains how U.S. Army constructive simulations have been applied to testing of and training with C/sup 2/ systems, through automated interfaces conceived and developed by Logicon, Inc., contractor to the U.S. Army Electronic Proving Ground.
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Authors: Sanjeev Arora
Venue: Journal of the ACM (JACM) (1998)

We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c > 1 and given any n nodes in R 2, a randomized version of the scheme finds a (1 + 1/c)-approximation to the optimum traveling salesman tour in O(n(log n)O(c)) time. When the nodes are in R d, the running time increases to O(n(log n)(O(d c))d-1). For every fixed c, d the running time is n &bull; poly(logn), that is nearly linear in n. The algorithmm can be derandomized, but this increases the running time by a factor O(nd). The previous best approximation algorithm for the problem (due to Christofides) achieves a 3/2-aproximation in polynomial time.We also give similar approximation schemes for some other NP-hard Euclidean problems: Minimum Steiner Tree, k-TSP, and k-MST. (The running times of the algorithm for k-TSP and k-MST involve an additional multiplicative factor k.) The previous best approximation algorithms for all these problems achieved a constant-factor approximation. We also give efficient approximation schemes for Euclidean Min-Cost Matching, a problem that can be solved exactly in polynomial time.All our algorithms also work, with almost no modification, when distance is measured using any geometric norm (such as &ell; p for p &ge; 1 or other Minkowski norms). They also have simple parallel (i.e., NC) implementations.
Stability Analysis of an Odd--Even-Line Hopscotch Method for Three-Dimensional Advection--Diffusion Problems
Authors: J. G. Verwer, B. P. Sommeijer
Venue: SIAM Journal on Numerical Analysis (1997)

A linear stability analysis is given for an odd--even-line hopscotch (OELH) method, which has been developed for integrating three-space dimensional, shallow water transport problems. Sufficient and necessary conditions are derived for strict von Neumann stability for the case of the general, constant coefficient, linear advection--diffusion model problem. The analysis is based on an equivalence with an associated scheme which is composed of the leapfrog, the Du Fort--Frankel, and the Crank--Nicolson schemes. The results appear to be rather intricate. For example, the resulting expressions for critical stepsizes reveal that the presence of horizontal diffusion generally leads to a smaller value, in spite of the fact that we have unconditional stability for pure diffusion problems. It is pointed out that this is due to the Du Fort--Frankel deficiency. On the other hand, it is also shown, by a numerical experiment, that in practice it is sufficient to obey the weaker Courant--Friedrichs--Lewy (CFL) condition associated with the case of pure horizontal advection, unless a huge number of integration steps are to be taken.
The system architect's workbench
Authors: D. E. Thomas, E. M. Dirkes, R. A. Walker, J. V. Rajan, J. A. Nestor, R. L. Blackburn
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper presents an overview of The System Architect's Workbench, a behavioral synthesis system under development at Carnegie Mellon University. This system converts an abstract behavioral description of a piece of hardware into a set of register-transfer components and a control sequence table. Two-synthesis methodologies are supported: one is tuned specifically to design microprocessors, and the other supports a more general design style. Results are presented here for both approaches.
S-tree: a dynamic balanced signature index for office retrieval
Authors: Uwe Deppisch
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

The signature approach is an access method for partial-match retrieval which meets many requirements of an office environment. Signatures are hash coded binary words derived from objects stored in the data base. They serve as a filter for retrieval in order to discard a large number of nonqualifying objects. In an indexed signature method the signatures of objects stored on a single page are used to form a signature for that page. In this paper we describe a new technique of indexed signatures which combines the dynamic balancing of B-trees with the signature approach. The main problem of appropriate splitting is solved in a heuristic way. Operations are described and a simple performance analysis is given. The analysis and some experimental results indicate a considerable performance gain. Moreover, the new S-tree approach supports a clustering on a signature basis. Further remarks on adaptability complete this work.
Parallel placement on reduced array architecture
Authors: C. P. Ravi Kumar, Sarma Sastry
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper presents a hardware accelerator for a module placement algorithm based on the Divide and Conquer paradigm. We consider a partitioning algorithm for the approximate solution of a large placement problem. This algorithm divides the set of logic modules into small clusters and generates an optimal placement for each cluster. Finally, in a pasting step, the algorithm combines the optimal solutions for the smaller problems into a near-optimal solution for the original placement problem. Our algorithm lends itself very naturally to a parallel realization, and maps nicely onto an SIMD organization. Considerations such as cost effectiveness and suitability to VLSI implementation led us to the selection of the Reduced Array Architecture as the target architecture for the placement accelerator.
Patchwork: layout from schematic annotations
Authors: Richard Barth, Louis Monier, Bertrand Serlet
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

We present PatchWork, a silicon assembler which describes layout generators graphically with annotated schematics. The system is highly extensible and provides a unified framework in which both basic and powerful layout generators coexist. Several major chips have been built using this system.
Approach to computer-based medication planning and coordination support in intensive care units
Authors: B. Thull, U. Janssens, G. Rau, P. Hanrath
Venue: Technology and Health Care (1997)

Due to more and more complex diagnosis and therapy measures, the critical care of patients requires an extensive work organisation which comprises patient, doctors, nurses and external services (e.g., central laboratory). In this organisation, the documentation plays a major role for the planning and coordination of work procedures and information flow within the medical staff. Various studies in intensive care units (ICU) reveal that the complex work organisation and the related information flow are faulty. Breakdowns are often caused by a lack of coordination between doctors and nurses and by poor transparency of work procedures. A typical example is the incorrect application of a doctors medication orders by a nurse because she might have overseen a plan modification. This intransparency increases the strain on the medical staff and might result in critical effects on the patient. One approach to design a computer support for medication planning as well as the coordination when executing medication plans is given by work flow models. This paper shows that work flow models could be used to improve deficiencies in medication planning and coordination. Furthermore, it is demonstrated how such a support can be mediated to the user through an appropriately designed user interface.
Moment and Hypergeometric Filters for High Precision Computation ofFocus, Stereo and Optical Flow
Authors: Yalin Xiong, Steven A. Shafer
Venue: International Journal of Computer Vision (1997)

Many low level visual computation problems such as focus, stereo, optical flow, etc., can be formulated as problems of extracting one or more parameters of a non-stationary transformation between two images. Finite-width windows are widely used in various algorithms to extract spatially local information from images. While the choice of window width has a very profound impact on the quality of algorithmic results, there has been no quantitative way to measure or eliminate the negative effects of finite-width windows. To address this problem and the foreshortening problem caused by non-stationarity, we introduce two novel sets of filters: &ldquo;moment&rdquo; filters and &ldquo;hypergeometric&rdquo; filters. The recursive properties of these filters allow the effects of finite-width windows and foreshortening to be explicitly analyzed and eliminated.We apply the moment filter approach to the focus and stereo problems, in which one parameter is extracted at every pixel location. We apply the hypergeometric approach to the optical flow problem, in which two parameters are extracted. We demonstrate that algorithms based on moment filters and hypergeometric filters achieve much higher precision than other state-of-art techniques.
Technical standards for medical devices. Assisted circulation devices
Authors: Fabrizio Clemente, Gian Franco Ferrari, Claudio De Lazzari, Giancarlo Tosti
Venue: Technology and Health Care (1997)

The steep rise in the clinical use of high technology biomedical devices and materials, involving multidisciplinary competencies, points out the problem of mutual standards defining, first of all, functional characteristic and tests able to characterise and qualify devices, materials and minimal safety requirements both for patients and operators. Standards defined by consent of the parties or by law are used to this aim. Fast technical development in specific sectors produces besides lack of rules, which must be quickly filled up. The aim of this paper is both the presentation of the approach to problems related to technical standards for biomedical devices and the presentation of the set up of a technical standard for mechanical heart assist devices.
A cellular wireless local area network with QoS guarantees for heterogeneous traffic
Authors: Sunghyun Choi, Kang G. Shin
Venue: Mobile Networks and Applications (1998)

A wireless local area network (WLAN) or a cell with quality-of-service (QoS) guarantees for various types of traffic is considered. A centralized (i.e., star) network is adopted as the topology of a cell which consists of a base station and a number of mobile clients. Dynamic Time Division Duplexed (TDD) transmission is used, and hence, the same frequency channel is time-shared for downlink and uplink transmissions under the dynamic control of the base station. We divide traffic into two classes: class I (real-time) and II (non-real-time). Whenever there is no eligible class-I traffic for transmission, class-II traffic which requires no delay-bound guarantees is transmitted, while uplink transmissions are controlled with a reservation scheme. Class-I traffic which requires a bounded delay and guaranteed throughput is handled with the framing strategy (Golestani, IEEE J. Selected Areas Commun. 9(7), 1991) which consists of a smoothness traffic model and the stop-and-go queueing scheme. We also establish the admission test for adding new class-I connections. We present a modified framing strategy for class-I voice uplink transmissions which utilizes the wireless link efficiently at the cost of some packet losses. Finally, we present the performance (average delay and throughput) evaluation of the reservation scheme for class-II traffic using both analytical calculations and simulations.
A Variant of the Buchberger Algorithm for Integer Programming
Authors: Regina Urbaniak, Robert Weismantel, Günter M. Ziegler
Venue: SIAM Journal on Discrete Mathematics (1997)

In this paper we modify Buchberger's S-pair reduction algorithm for computing a Gröbner basis of a toric ideal so as to apply it to an integer program (IP) in inequality form with fixed right-hand sides and fixed upper bounds on the variables. We formulate the algorithm in the original space and interpret the reduction steps geometrically. In fact, three variants of this algorithm are presented, and we give elementary proofs for their correctness. A relationship among these (exact) algorithms, iterative improvement heuristics, and the Kernighan--Lin procedure is established. Computational results are also presented.
An Analog Integrated Circuit for Continuous-Time Gain andOffset Calibration of Sensor Arrays
Authors: Yu-Ming Chiang, John G. Harris
Venue: Analog Integrated Circuits and Signal Processing (1997)

Parameter variations cause unavoidable nonuniformities in Infra-Red Focal Plane Arrays and other integrated sensors. Since these nonuniformities change slowly with time, calibrating sensors one-time only is not suitable&ndash;much more frequent calibration is required. We have developed an algorithm that continually calibrates an array of sensors that contain gain and offset variations. This algorithm has been mapped to analog hardware and designed and fabricated with a 2um CMOS technology. Measured results from the chip show that the system achieves invariance to gain and offset variations of the input signal.
Putting more meaning in expressions
Authors: Boyko B. Bantchev
Venue: ACM SIGPLAN Notices (1998)

The paper discusses the usefulness of expression orientedness for procedural languages. Several constructs are proposed that enrich the semantics of expressions in expression-oriented languages. The aim is to extend the possibilities for explicit specification of properties and interrelations between program objects, thus conveying more meaning to the reader of a program. Finally, some concluding considerations are made, in the form of general rules for explicit and straightforward program coding.
Simulation and design in an object-oriented world: a methodology for large software systems
Authors: Ron Van Huss
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

If one were to make even a casual review of the literature relating to software engineering principles, design methodologies, and the like, then one would be overwhelmed by the efforts of the community to get their arms around the various approaches and theoretical frameworks and provide a coherent, cost-effective, and workable life cycle methodology for software development ( see, for example The Proceedings of the Sixth National Conference on Ada Technology). The underlying theme for these efforts is to provide some development cosmology; contemporary development efforts lack the budget and time to develop tailored approaches to performance analysis, even assuming that the necessary ( and qualified ) personnel were available. This paper is yet another attempt to provide a unified framework wherein project management can develop a design methodology and toolset for large programs. I propose a perspective that has been hinted at by others, and certainly is not new: that analysis and performance measurement play key roles, providing two essential ingredients of sound design: predictability and reusable components [ Braun -16, Sobkiw-17, Vldale-18]. A major theme toward this goal is the symbiotic relationship between objects and simulation. If one were to consider the setting for this paper, then it would be cast primarily in terms of the requirements and design phases of the software life cycle.
A C++ Data Model Supporting Reachability Analysis and Dead Code Detection
Authors: Yih-Farn Chen, Emden R. Gansner, Eleftherios Koutsofios
Venue: IEEE Transactions on Software Engineering (1998)

A software repository provides a central information source for understanding and reengineering code in a software project. Complex reverse engineering tools can be built by analyzing information stored in the repository without reparsing the original source code. The most critical design aspect of a repository is its data model, which directly affects how effectively the repository supports various analysis tasks. This paper focuses on the design rationales behind a data model for a C++ software repository that supports reachability analysis and dead code detection at the declaration level. These two tasks are frequently needed in large software projects to help remove excess software baggage, select regression tests, and support software reuse studies. The language complexity introduced by class inheritance, friendship, and template instantiation in C++ requires a carefully designed model to catch all necessary dependencies for correct reachability analysis. We examine the major design decisions and their consequences in our model and illustrate how future software repositories can be evaluated for completeness at a selected abstraction level. Examples are given to illustrate how our model also supports variants of reachability analysis: impact analysis, class visibility analysis, and dead code detection. Finally, we discuss the implementation and experience of our analysis tools on a few C++ software projects.