ppxscal/embedding_network huggingface dataset:
Core allocation based on probability
Authors: Bernard N. Riskin
Venue: Communications of the ACM (1961)

We are discussing a method of core allocation proposed for use in a large-scale, real-time, man-machine, data processing and display system.
Using a Multihospital Systems Framework to Evaluate and Establish Drug Use Policy
Authors: Lee C. Vermeulen, Paul A. Windisch, Robert J. Rydman, Ruth H. Bruskiewitz, Diana I. Brixner, Peter H. Vlasses
Venue: Journal of Medical Systems (2000)

Purpose. In order to develop rational drug purchasing and use policy for a class of pharmaceuticals used in a consortium system of 14 university based hospitals, the antiemetic use patterns of inpatients receiving cancer chemotherapy were evaluated to assess the comparative effectiveness of granisetron, ondansetron, and conventional antiemetics. Patients and Methods. A prospective, observational study was conducted in 14 academic health centers linked under research and purchasing consortium arrangements from October to December 1994. The use of antiemetics was evaluated in hospitalized patients receiving cancer chemotherapy agents with a known propensity for causing, alone or in combination, varying degrees of nausea or vomiting. Clinical outcomes measured were the impact of chemotherapy administration on the functional status of patients, and the occurrence of post-treatment vomiting. Results. The most often prescribed cancer chemotherapy regimens consisted of cisplatin, paclitaxel, etoposide and cyclophosphamide, and the most often prescribed antiemetics were the 5-hydroxytryptamine subtype-3 antagonists (5-HT3 antagonists, granisetron and ondansetron), dexamethasone and lorazepam. Of the 439 patients studied, 329 (75%) reported no episodes of emesis. Of the patients receiving highly emetogenic chemotherapy, those receiving 5-HT3 antagonists experienced better overall outcomes (as measured by functional health status and the absence of vomiting) than patients receiving conventional (non-5-HT3 antagonist) antiemetics. In contrast, patients receiving chemotherapy associated with moderate or low emetogenicity experienced similar outcomes, regardless of the antiemetic regimen selected. No statistical difference was seen between granisetron and ondansetron in achieving positive patient outcomes. Conclusion. The study results suggest that 5-HT3 antagonists are associated with better clinical outcomes than other antiemetics in patients receiving highly emetogenic chemotherapy. Less costly conventional antiemetic therapy (or, in some cases, no antiemetic therapy) provide comparable outcomes in patients receiving chemotherapy associated with moderate or low emetogenic potential. Granisetron and ondansetron were found to be clinically comparable.
Tolerance to Multiple Transient Faults for Aperiodic Tasks in Hard Real-Time Systems
Authors: Frank Liberato, Rami Melhem, Daniel Mossé
Venue: IEEE Transactions on Computers (2000)

Real-time systems are being increasingly used in several applications which are time-critical in nature. Fault tolerance is an essential requirement of such systems, due to the catastrophic consequences of not tolerating faults. In this paper, we study a scheme that guarantees the timely recovery from multiple faults within hard real-time constraints in uniprocessor systems. Assuming earliest-deadline-first scheduling (EDF) for aperiodic preemptive tasks, we develop a necessary and sufficient feasibility-check algorithm for fault-tolerant scheduling with complexity $O(n^2 \cdot k)$, where $n$ is the number of tasks to be scheduled and $k$ is the maximum number of faults to be tolerated.
Expand, a system for input card replication
Authors: James A. Warrington, James H. Norris
Venue: Communications of the ACM (1964)

In an effort to reduce the volume of card handling at our installation, our operating system [1] was modified to include an EXPAND feature. The function of EXPAND is to eliminate the necessity of reproducing a card or a group of cards of the input dock to any particular job. Once a group of cards appears in an input deck, they may be caused to reappear subsequently by the inclusion of a single control card which calls for the &ldquo;insertion&rdquo; of cards by sequence numbers or letters. The user is permitted to specify minor modifications to the cards as they are being inserted. Hence, the user may easily run parameter studies, insert similar EQUIVALENCE, COMMON and DIMENSION statements in a multisubroutined FORTRAN program, or specify similar regions on a large mesh such as is needed for a thermal or nuclear study. Note also that when it is necessary to change a deck and rerun, it is only necessary to repunch the original card&mdash;every reappearance caused by EXPAND automatically reflects the new card.
Improving cross language retrieval with triangulated translation
Authors: Tim Gollins, Mark Sanderson
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Most approaches to cross language information retrieval assume that resources providing a direct translation between the query and document languages exist. This paper presents research examining the situation where such an assumption is false. Here, an intermediate (or pivot) language provides a means of transitive translation of the query language to that of the document via the pivot, at the cost, however, of introducing much error. The paper reports the novel approach of translating in parallel across multiple intermediate languages and fusing the results. Such a technique removes the error, raising the effectiveness of the tested retrieval system, up to and possibly above the level expected, had a direct translation route existed. Across a number of retrieval situations and combinations of languages, the approach proves to be highly effective.
A 0.8 &mu;m BiCMOS Gate Driver for IGBT Power Switch
Authors: Mehrdad Ramezani, C. Andre T. Salama
Venue: Analog Integrated Circuits and Signal Processing (2000)

This paper discusses the design and implementation of a monolithic gate driver for an Insulated Gate Bipolar Transistor (IGBT). The objective is to implement a high voltage (25 V) monolithic gate driver with a novel protection circuit in a conventional low-voltage (5 V) high-density (0.8 &mu;m) BiCMOS process. Extended drain MOS-FETs are used to implement the high-voltage capability in this design.
Software engineering throughout a traditional computer science curriculum
Authors: J. Paul Myers,  Jr.
Venue: Journal of Computing Sciences in Colleges (2001)

As software engineering (SE) is becoming increasingly important as a discipline for computing professionals, so is it becoming an increasing emphasis in undergraduate computing education. The curricular revisions described here represent an attempt to incorporate SE principles throughout an undergraduate curriculum in Computer Science (CS). The emphasis here, however, is not one of wholesale overhaul into a SE program, possibly to the detriment of other strengths in the previous curriculum. Rather this is a non-radical augmentation and change of focus in certain aspects of a strong, but somewhat traditional CS curriculum.
Mathematical experimentation in time-lag modulation
Authors: Richard Bellman, June Buell, Robert Kalaba
Venue: Communications of the ACM (1966)

Equations of the form du/dt = g(u(t), u(h(t))) arise in a number of scientific contexts. The authors point out some interesting properties of the solution of u&prime;(t) = -u(t - 1 - k sin &ohgr;t) + sin at. These properties were obtained by means of numerical solution.
A social reinforcement learning agent
Authors: Charles Isbell, Christian R. Shelton, Michael Kearns, Satinder Singh, Peter Stone
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

We report on our reinforcement learning work on Cobot, a software agent that resides in the well-known online chat community LambdaMOO. Our initial work on Cobot~\cite{cobotaaai} provided him with the ability to collect {\em social statistics\/} and report them to users in a reactive manner. Here we describe our application of reinforcement learning to allow Cobot to proactively take actions in this complex social environment, and adapt his behavior from multiple sources of human reward. After 5 months of training, Cobot received 3171 reward and punishment events from 254 different Lambda\-MOO users, and learned nontrivial preferences for a number of users. Cobot modifies his behavior based on his current state in an attempt to maximize reward. Here we describe LambdaMOO and the state and action spaces of Cobot, and report the statistical results of the learning experiment.
A Dynamic Diffusion Optimization Method for Irregular Finite Element Graph Partitioning
Authors: Don-Lin Yang, Yeh-Ching Chung, Chih-Chang Chen, Ching-Jung Liao
Venue: The Journal of Supercomputing (2000)

To efficiently execute a finite element application program on a distributed memory multicomputer, we need to distribute nodes of a finite element graph to processors of a distributed memory multicomputer as evenly as possible and minimize the communication cost of processors. This partitioning problem is known to be NP-complete. Therefore, many heuristics have been proposed to find satisfactory sub-optimal solutions. Based on these heuristics, many graph partitioners have been developed. Among them, Jostle, Metis, and Party are considered as the best graph partitioners available up-to-date. For these three graph partitioners, in order to minimize the total cut-edges, in general, they allow 3% to 5% load imbalance among processors. This is a tradeoff between the communication cost and the computation cost of the partitioning problem. In this paper, we propose an optimization method, the dynamic diffusion method (DDM), to balance the 3% to 5% load imbalance allowed by these three graph partitioners while minimizing the total cut-edges among partitioned modules. To evaluate the proposed method, we compare the performance of the dynamic diffusion method with the directed diffusion method and the multilevel diffusion method on an IBM SP2 parallel machine. Three 2D and two 3D irregular finite element graphs are used as test samples. For each test sample, 3% and 5% load imbalance situations are tested. From the experimental results, we have the following conclusions. (1) The dynamic diffusion method can improve the partition results of these three partitioners in terms of the total cut-edges and the execution time of a Laplace solver in most test cases while the directed diffusion method and the multilevel diffusion method may fail in many cases. (2) The optimization results of the dynamic diffusion method are better than those of the directed diffusion method and the multilevel diffusion method in terms of the total cut-edges and the execution time of a Laplace solver for most test cases. (3) The dynamic diffusion method can balance the load of processors for all test cases.
Convergence of Eigenvalues in State-Discretization of Linear Stochastic Systems
Authors: José A. De Doná, Graham C. Goodwin, Richard H. Middleton, Iain Raeburn
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

The transition operator that describes the time evolution of the state probability distribution for continuous-state linear systems is given by an integral operator. A state-discretization approach is proposed, which consists of a finite rank approximation of this integral operator. As a result of the state-discretization procedure, a Markov chain is obtained, in which case the transition operator is represented by a transition matrix. Spectral properties of the integral operator for the continuous-state case are presented. The relationships between the integral operator and the finite rank approximation are explored. In particular, the limiting properties of the eigenvalues of the transition matrices of the resulting Markov chains are studied in connection to the eigenvalues of the original continuous-state integral operator.
Building tractable disjunctive constraints
Authors: David Cohen, Peter Jeavons, Peter Jonsson, Manolis Koubarakis
Venue: Journal of the ACM (JACM) (2000)

Many combinatorial search problems can be expressed as 'constraint satisfaction problems'. This class of problems is known to be NP-hard in general, but a number of restricted constraint classes have been identified which ensure tractability. This paper presents the first general results on combining tractable constraint classes to obtain larger, more general, tractable classes. We give examples to show that many known examples of tractable constraint classes, from a wide variety of different contexts, can be constructed from simpler tractable classes using a general method. We also construct several new tractable classes that have not previously been identified.
A university's educational program in computer science
Authors: George E. Forsythe
Venue: Communications of the ACM (1967)

After a review of the power of contemporary computers, computer science is defined in several ways. The objectives of computer science education are stated, and it is asserted that in a North American university these will be achieved only through a computer science department. The program at Stanford University is reviewed as an example. The appendices include syllabi of Ph.D. qualifying examinations for Stanford's Computer Science Department.
A computer program to aid assignment of student project groups
Authors: Michael A. Redmond
Venue: ACM SIGCSE Bulletin (2001)

Group projects are a valuable part of the computer science curriculum. Group work can be enhanced if formation of groups is not via self-selection by the students themselves. Students who are assigned to groups are more likely to be exposed to other students with different backgrounds and abilities from which they can learn new things. However in a university with students having a wide mix of schedules, a crucial aspect of successful group formation is compatible time-schedules within a group. This paper describes a computer program designed to aid assignment to groups while helping to ensure that groups have suitable outside-of-class meeting times.
Orthogonal Sampling Formulas: A Unified Approach
Authors: Antonio G. Garcia
Venue: SIAM Review (2000)

This paper intends to serve as an educational introduction to sampling theory. Basically, sampling theory deals with the reconstruction of functions (signals) through their values (samples) on an appropriate sequence of points by means of sampling expansions involving these values. In order to obtain such sampling expansions in a unified way, we propose an inductive procedure leading to various orthogonal formulas. This procedure, which we illustrate with a number of examples, closely parallels the theory of orthonormal bases in a Hilbert space. All intermediate steps will be described in detail, so that the presentation is self-contained. The required mathematical background is a basic knowledge of Hilbert space theory.Finally, despite the introductory level, some hints are given on more advanced problems in sampling theory, which we motivate through the examples.
The use of robots in the undergraduate curriculum: experience reports
Authors: Michael Goldweber, Clare Congdon, Barry Fagin, Deborah Hwang, Frank Klassner
Venue: Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education (2001)

Using the robot as a metaphor for assisting students in understanding problem solving in general, the algorithmic process, and the relationship between algorithms and computing agents is not new. While simulated robot environments have existed for many years (e.g. Karel the Robot[3]) it is only recently that the technology for inexpensively supplying undergraduates with real robots has become available. Lego Mindstorms, MIT Handyboards, the Rug Warrior, and others are examples of such systems. Programmable in familiar languages, including C, Ada, and Java, these systems allow for the creative exploration of important computer science concepts. Representing a variety of institution types the panelists will discuss their experiences in using hands-on robot-based projects for illustrating various important computer science concepts.
Magic by metaphors
Authors: Kim Halskov Madsen
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

Most research on metaphors and computers focus on the augmentative power of the similarity between the computer application and something already familiar to the user. But metaphor may play two fundamentally different roles depending on whether the primary role of the metaphor is to express something by building on the similarity between the two referents or whether the primary role is to express something new by emphasizing the dissimilarities. On the one hand, when designing computer system we strive for system with a resemblance with the previous environment but, on the other hand, we would also like to benefit from the power of the technology and provide opportunities not available in the current environment.
A method for evaluating the area of the normal function
Authors: Frank B. Baker
Venue: Communications of the ACM (1961)

Many statistical procedures require the cumulative area and ordinate of the normal function corresponding to a given deviate. The development of a computer program for the application of probit analysis [1] to bio-assay led to the method described here.
Communication scheduling
Authors: Peter Mattson, William J. Dally, Scott Rixner, Ujval J. Kapasi, John D. Owens
Venue: ACM SIGPLAN Notices (2000)

The high arithmetic rates of media processing applications require architectures with tens to hundreds of functional units, multiple register files, and explicit interconnect between functional units and register files. Communication scheduling enables scheduling to these emerging architectures, including those that use shared buses and register file ports. Scheduling to these shared interconnect architectures is difficult because it requires simultaneously allocating functional units to operations and buses and register file ports to the communications between operations. Prior VLIW scheduling algorithms are limited to clustered register file architectures with no shared buses or register file ports. Communication scheduling extends the range of target architectures by making each communication explicit and decomposing it into three components: a write stub, zero or more copy operations, and a read stub. Communication scheduling allows media processing kernels to achieve 98% of the performance of a central register file architecture on a distributed register file architecture with only 9% of the area, 6% of the power consumption, and 37% of the access delay, and 120% of the performance of a clustered register file architecture on a distributed register file architecture with 56% of the area and 50% of the power consumption.
Operating Systems: A statistical model for console behavior in multiuser computers
Authors: Peter J. Denning
Venue: Communications of the ACM (1968)

The ability of a computer system to communicate with the outside world efficiently is as important as its ability to perform computations efficiently. It is quite difficult to characterize a particular user, but rather easy to characterize the entire user community. Based on the properties of this community we have postulated a hypothetical &ldquo;virtual console.&rdquo; No claim is made that a virtual console behaves like any actual console, but the entire collection of virtual consoles models the collection of actual consoles. Using the model we answer questions like: How many processes are suspended waiting for console input? What is the maximum rate at which a process can execute? What bounds can be set on overall buffer requirements? Answers to these and similar questions are needed in certain aspects of operating system design.
Boosters for driving long on-chip interconnects: design issues, interconnect synthesis and comparison with repeaters
Authors: Ankireddy Nalamalpu, Wayne Burleson
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

Trends in CMOS technology and VLSI architectures are causing interconnect to play an increasing role in overall performance, power consumption and design effort. Traditionally, repeaters are used for driving long on-chip interconnects, however recent studies indicate that repeaters are using increasing area, power, and design resources as well as having an inherent limit in how much they can improve performance [4,10,14]. This paper presents a new circuit called a {\bf booster} which compares favorably with repeaters in terms of area, performance, power and placement sensitivity. Boosters also have the advantage of being bidirectional and providing a low impedance termination to improve signal integrity. Driver edge rates are slower and peak power is drastically reduced compared to repeaters, thus improving signal integrity and mitigating inductive effects. Boosters are shown to be more than 20\% faster for driving a variety of interconnect loads over conventional repeaters in 0.16 $\mu$m CMOS technology. Boosters are typically inserted three times less frequently than repeaters for optimal performance, resulting in fewer boosters for driving the same interconnect lengths thereby saving on area, power and placement effort.Unlike differential, dynamic or low-swing techniques which require significantly more sophisticated circuit design and hence are cumbersome for automatic interconnect synthesis tools, boosters can be inserted on lines in a straightforward manner. Based on analytical delay models, we derive rules for insertion and sizing of boosters that can easily be incorporated into a CAD tool. We formulate two design rules that determine 1) the number of boosters needed, 2) their placements and 3) sizes, for driving a given interconnect load, first minimizing delay, and then area and power. Power analysis is slightly more complex than for repeaters so we present a systematic design approach. A placement sensitivity analysis comparing
Non-Abelian Groups in Optimization of Decision Diagrams Representations of Discrete Functions
Authors: Radomir S. Stanković
Venue: Formal Methods in System Design (2001)

This paper is devoted to the reduction of decision diagram (DD) representations of discrete functions by using the non-Abelian groups and Fourier DDs on these groups. The number of levels in a DD can be reduced through decomposition of the domain group of the represented function into large subgroups. That approach however increases the number of nodes per levels which may decrease the global reduction possibilities in the DD. At the same time, the nodes with a considerable number of outgoing edges are required. In applications, the complexity, thus the price, of a node is proportional to the number of outgoing edges. From an inspection of optimization methods for DDs representations, it follows that a solution of this problem can hardly be found with DDs on Abelian groups. Therefore, we are proposing the use of Fourier DDs on finite non-Abelian groups.In that way, the matrix-valued decision diagrams are introduced, since in Fourier DDs on non-Abelian groups some of constant nodes are matrices. These DDs permit two-steps optimization. First we determine the optimal structure of the corresponding decision tree by the reduction of which a DD is derived. The optimization is done with respect to the combination of the number of nodes and levels we may require depending on the application intended. Then, we do the optimization of the representations of matrix-valued constant nodes by ordinary DDs of smaller size. In that way, the complex-valued and integer-valued Fourier DDs are derived depending on the chosen group representations for these applications where the matrix-valued Fourier DDs may not be allowed.With thus derived Fourier DDs, the reduction of both number of levels and non-terminal nodes may be achieved.Efficiency of representations with the Fourier DDs on non-Abelian groups is illustrated by the example of DDs representations of n-bit multipliers.