ppxscal/embedding_network huggingface dataset:
On Two-Player Repeated Games with Lack of Information on One Side and State-Independent Signalling
Authors: Jérôme Renault
Venue: Mathematics of Operations Research (2000)

We consider two-person undiscounted repeated games with lack of information on one side and state-independent signalling and prove the existence of a "joint plan" uniform equilibrium.
A policy-driven scheduler for a time-sharing system
Authors: A. J. Bernstein, J. C. Sharp
Venue: Communications of the ACM (1971)

The services received by a process from a time-sharing operating system can be characterized by a resource count &sum; wiRij where Rij is the number of units of service received by process j from resource i and wi is the cost per unit of the service. Each class of users can be characterized by a policy function which specifies the amount of service a user who belongs to this class should receive as a function of time. Priority changes dynamically as a function of the difference between the service promised to the user by the policy function and the service he actually receives. A scheduling and swapping algorithm which keeps the resource count of each process above its policy function will provide the specified level of service. Overhead can be reduced by avoiding swaps of processes which have received at least this level of service. The algorithm has been implemented in a general purpose operating system, and it has provided significantly better service to interactive and to batch jobs than the previous scheduler.
Parallel changes in large-scale software development: an observational case study
Authors: Dewayne E. Perry, Harvey P. Siy, Lawrence G. Votta
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2001)

An essential characteristic of large-scale software development is parallel development by teams of developers. How this parallel development is structured and supported has a profound effect on both the quality and timeliness of the product. We conduct an observational case study in which we collect and analyze the change and configuration management history of a legacy system to delineate the boundaries of, and to understand the nature of, the problems encountered in parallel development. The results of our studies are (1) that the degree of parallelism is very highhigher than considered by tool builders; (2) there are multiple levels of parallelism, and the data for some important aspects are uniform and consistent for all levels; (3) the tails of the distributions are long, indicating the tail, rather than the mean, must receive serious attention in providing solutions for these problems; and (4) there is a significant correlation between the degree of parallel work on a given component and the number of quality problems it has. Thus, the results of this study are important both for tool builders and for process and project engineers.
Designing data marts for data warehouses
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2001)

Data warehouses are databases devoted to analytical processing. They are used to support decision-making activities in most modern business settings, when complex data sets have to be studied and analyzed. The technology for analytical processing assumes that data are presented in the form of simple data marts, consisting of a well-identified collection of facts and data analysis dimensions (star schema). Despite the wide diffusion of data warehouse technology and concepts, we still miss methods that help and guide the designer in identifying and extracting such data marts out of an enterprisewide information system, covering the upstream, requirement-driven stages of the design process. Many existing methods and tools support the activities related to the efficient implementation of data marts on top of specialized technology (such as the ROLAP or MOLAP data servers). This paper presents a method to support the identification and design of data marts. The method is based on three basic steps. A first top-down step makes it possible to elicit and consolidate user requirements and expectations. This is accomplished by exploiting a goal-oriented process based on the Goal/Question/Metric paradigm developed at the University of Maryland. Ideal data marts are derived from user requirements. The second bottom-up step extracts candidate data marts
CGTDEMO &mdash; educational software for the central limit theorem
Authors: Gordana Jovanovic-Dolecek, Victor H. Champac
Venue: ACM SIGCSE Bulletin (2000)

This paper describes the demo package for teaching and visualizing the Central limit theorem. The topic treated in this paper is of significant interest in undergraduate coverage of non-deterministic systems. Two types of random variables are considered: symmetric, highly concentrated about its mean value and nonsymmetrical random variables. The demo program is developed in MATLAB 5.2. The program gives the user step by step guidance. The user chooses the type of variable, the length of the sum N, and the corresponding parameters of a random variable. Successive plots of the sums of random variables and the estimations of the corresponding probability density functions are obtained. Finally the comparison with a normal variable is given.
Combined tuning of RF power and medium access control for WLANS
Venue: Mobile Networks and Applications (2001)

Mobile communications, such as handhelds and laptops, still suffer from short operation time due to limited battery capacity. We exploit the approach of protocol harmonization to extend the time between battery charges in mobile devices using an IEEE 802.11 network interface. Many known energy saving mechanisms only concentrate on a single protocol layer while others only optimize the receiving phase by on/off switching. We show, that energy saving is also possible during the sending process. This is achieved by a combined tuning of the data link control and physical layer. In particular, harmonized operation of power control and medium access control will lead to reduction of energy consumption. We show a RF power and medium access control trade-off. Furthermore we discuss applications of the results in IEEE 802.11 networks.
Using sample size to limit exposure to data mining
Authors: Chris Clifton
Venue: Journal of Computer Security (2000)

Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the "probabilistic" inferences possible with data mining. This paper shows how lower bounds from pattern recognition theory can be used to determine sample sizes where data mining tools cannot obtain reliable results.
On stopping criteria in verified nonlinear systems or optimization algorithms
Authors: R. B. Kearfott, G. W. Walster
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

Traditionally, iterative methods for nonlinear systems use heuristic domain and range stopping criteria to determine when accuracy tolerances have been met. However, such heuristics can cause stopping at points far from actual solutions, and can be unreliable due to the effects of round-off error or inaccuracies in data. In verified computations, rigorous determination of when a set of bounds has met a tolerance can be done analogously to the traditional approximate setting. Nonetheless, the range tolerance possibly cannot be met. If the criteria are used to determine when to stop subdivision of n-dimensional bounds into subregions, then failure of a range tolerance results in excessive, unnecessary subdivision, and could make the algorithm impractical. On the other hand, interval techniques can detect when inaccuracies or round-off will not permit residual bounds to be narrowed. These techniques can be incorporated into range thickness stopping criteria that complement the range stopping criteria. In this note, the issue is first introduced and illustrated with a simple example. The thickness stopping criterion is then formally introduced and analyzed. Third, inclusion of the criterion within a general verified global optimization algorithm is studied. An industrial example is presented. Finally, consequences and implications are discussed.
Instruction scheduling for power reduction in processor-based system design
Authors: H. Tomiyama, T. Ishihara, A. Inoue, H. Yasuura
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper propose an instruction scheduling technique to reduce power consumed for off-chip driving. The technique minimizes the switching activity of a data bus between an on-chip cache and a main memory when instruction cache misses occur. The scheduling problem is formulated and a scheduling algorithm is also presented. Experimental results demonstrate the effectiveness and the efficiency of the proposed algorithm.
An anomaly in space-time characteristics of certain programs running in a paging machine
Authors: L. A. Belady, R. A. Nelson, G. S. Shedler
Venue: Communications of the ACM (1969)

The running time of programs in a paging machine generally increases as the store in which programs are constrained to run decreases. Experiment, however, have revealed cases in which the reverse is true: a decrease in the size of the store is accompanied by a decrease in running time. An informal discussion of the anomalous behavior is given, and for the case of the FIFO replacement algorithm a formal treatment is presented.
Automatic integration of a function with a parameter
Authors: Philip Rabinowitz
Venue: Communications of the ACM (1966)

Two efficient methods for automatic numerical integration are Romberg integration and adaptive Simpson integration. For integrands of the form &fnof;(x)g(x, &agr;) where &agr; is a parameter, it is shown that Romberg's method is more efficient. A FORTRAN program shows how to achieve this greater efficiency.
Third Generation Computer Systems
Authors: Peter J. Denning
Venue: ACM Computing Surveys (CSUR) (1971)

The common features of third generation operating systems are surveyed from a general view, with emphasis on the common abstractions that constitute at least the basis for a &ldquo;theory&rdquo; of operating systems. Properties of specific systems are not discussed except where examples are useful. The technical aspects of issues and concepts are stressed, the nontechnical aspects mentioned only briefly. A perfunctory knowledge of third generation systems is presumed.
2 1/2 D Visual Servoing with Respect to Unknown Objects Through a New Estimation Scheme of Camera Displacement
Authors: Ezio Malis, François Chaumette
Venue: International Journal of Computer Vision (2000)

Classical visual servoing techniques need a strong a priori knowledge of the shape and the dimensions of the observed objects. In this paper, we present how the 2 1/2 D visual servoing scheme we have recently developed, can be used with unknown objects characterized by a set of points. Our scheme is based on the estimation of the camera displacement from two views, given by the current and desired images. Since vision-based robotics tasks generally necessitate to be performed at video rate, we focus only on linear algorithms. Classical linear methods are based on the computation of the essential matrix. In this paper, we propose a different method, based on the estimation of the homography matrix related to a virtual plane attached to the object. We show that our method provides a more stable estimation when the epipolar geometry degenerates. This is particularly important in visual servoing to obtain a stable control law, especially near the convergence of the system. Finally, experimental results confirm the improvement in the stability, robustness, and behaviour of our scheme with respect to classical methods.
Translator writing systems
Authors: Jerome Feldman, David Gries
Venue: Communications of the ACM (1968)

A critical review of recent efforts to automate the writing of translators of programming languages is presented. The formal study of syntax and its application to translator writing are discussed in Section II. Various approaches to automating the postsyntactic (semantic) aspects of translator writing are discussed in Section III, and several related topics in Section IV.
Machine-adaptable dynamic binary translation
Authors: David Ung, Cristina Cifuentes
Venue: ACM SIGPLAN Notices (2000)

Dynamic binary translation is the process of translating and optimizing executable code for one machine to another at runtime, while the program is &ldquo;executing&rdquo; on the target machine. Dynamic translation techniques have normally been limited to two particular machines; a competitor's machine and the hardware manufacturer's machine. This research provides for a more general framework for dynamic translations, by providing a framework based on specifications of machines that can be reused or adapted to new hardware architectures. In this way, developers of such techniques can isolate design issues from machine descriptions and reuse many components and analyses. We describe our dynamic translation framework and provide some initial results obtained by using this system.
Wireless ATM network architectures
Authors: Anna Hác
Venue: International Journal of Network Management (2001)

Emulated LAN technology supports mobile hosts in wireless ATM networks. This paper introduces virtual LAN &lpar;VLAN&rpar; services using ATM LAN emulation technology which operates on a client&sol;server model. One of the attractive features of the VLAN is the capability to group users into a broadcast domain. The focus of this paper is the issue of supporting quality of service to mobiles in a wireless ATM network. Copyright &copy; 2001 John Wiley Sons, Ltd.
A survey of the literature in computer science education since curriculum '68
Authors: Richard H. Austing, Bruce H. Barnes, Gerald L. Engel
Venue: Communications of the ACM (1977)

A bibliography of approximately two hundred references in computer science education appearing in the literature since the publication of &ldquo;Curriculum '68&rdquo; is presented. The bibliography itself is preceded by brief descriptive materials organizing the references into the categories of survey reports, activities of professional organizations, philosophy of programs, description of programs, description of courses and other materials.
Advanced optimistic approaches in logic simulation
Authors: S. Schmerler, Y. Tanurhan, K. D. Müller-Glaser
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents the optimistic synchronization mechanism Predictive Time Warp (PTW) based on the implementation Time Warp of the Virtual Time paradigma for use in the simulation of electronic systems and high level system simulation. In comparison to most existing approaches extending and improving classical Time Warp, the aim of this development was to reduce the roll- back frequency of optimistic logical processes without imposing waiting periods. Part of PTW is the introduction of forecast events predicting a certain period in the future and thus reduce the rollback probability. On the example of a distributed logic simulation the benefit of the PTW synchronization approach is shown.
OoLALA: an object oriented analysis and design of numerical linear algebra
Authors: Mikel Luján, T. L. Freeman, John R. Gurd
Venue: Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2000)

In this paper we review the design of a sequential object oriented linear algebra library, OOLALA. Several designs are proposed and used to classify existing sequential object oriented libraries. The classification is based on the way that matrices and matrix operations are represented. OOLALA's representation of matrices is capable of dealing with certain matrix operations that, although mathematically valid, are not handled correctly by existing libraries. OOLALA also enables implementations of matrix calculations at various abstraction levels ranging from the relatively low-level abstraction of a Fortran BLAS-like implementation to higher-level abstractions that hide many implementation details. OOLALA addresses a wide range of numerical linear algebra functionality while the reviewed object oriented libraries concen trate on parts of such functionality. We include some preliminary performance results for a Java implementation of OOLALA.
Second Order Sufficient Optimality Conditions for Some State-constrained Control Problems of Semilinear Elliptic Equations
Authors: Eduardo Casas, Fredi Tröltzsch, Andreas Unger
Venue: SIAM Journal on Control and Optimization (2000)

This paper deals with a class of optimal control problems governed by elliptic equations with nonlinear boundary condition. The case of boundary control is studied. Pointwise constraints on the control and certain equality and set-constraints on the state are considered. Second order sufficient conditions for local optimality of controls are established.
Text input methods for eye trackers using off-screen targets
Authors: Poika Isokoski
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

Text input with eye trackers can be implemented in many ways such as on-screen keyboards or context sensitive menu-selection techniques. We propose the use of off-screen targets and various schemes for decoding target hit sequences into text. Off-screen targets help to avoid the Midas' touch problem and conserve display area. However, the number and location of the off-screen targets is a major usability issue. We discuss the use of Morse code, our Minimal Device Independent Text Input Method (MDITIM), QuikWriting, and Cirrin-like target arrangements. Furthermore, we describe our experience with an experimental system that implements eye tracker controlled MDITIM for the Windows environment.
Intentional resolution of privacy protection in database systems
Authors: Naftaly Minsky
Venue: Communications of the ACM (1976)

Traditionally, privacy protection in database systems is understood to be the control over what information a given user can get from a database. This paper is concerned with another, independent, dimension of privacy protection, the control over what a user is allowed to do with a piece of information supplied to him by the database. The ability to condition the supply of information on its intended use is called here &ldquo;intentional resolution&rdquo; of privacy protection. The practical importance of intentional resolution is demonstrated by several examples, and its realization is discussed. It is shown that intentional resolution can be achieved, but that it involves a radical change from the traditional approach to the process of user-database interaction. In particular, it appears to be necessary for the database to impose a certain amount of control over the internal behavior of users' programs which interact with it. A model for user-database interaction which admits such a control is developed.
An alternative to event queues for synchronization in monitors
Authors: J. L. W. Kessels
Venue: Communications of the ACM (1977)

In the monitor concept, as proposed by Brinch Hansen and Hoare, event queues are used for synchronization. This paper describes another synchronizing primitive which is nearly as expressive as the conditional wait, but can be implemented more efficiently. An implementation of this primitive in terms of P and V operations is given together with a correctness proof. Two examples are presented: the readers and writers problem and the problem of information streams sharing a finite buffer pool.
An algorithm for Filon quadrature
Authors: Stephen M. Chase, Lloyd D. Fosdick
Venue: Communications of the ACM (1969)

An algorithm for Filon quadrature is described. Considerable attention has been devoted to an analysis of the round-off and truncation errors. The algorithm includes an automatic error control feature.
Automatic coding
Authors: Harvey Bratman
Venue: Communications of the ACM (1961)

SDC is currently engaged in producing a &ldquo;JOVIAL&rdquo; compiler for each of its computers. The compilers are being produced by a bootstrapping method similar to that described in a report on UNCOL [1]. In discussing the steps involved, we resorted to diagrams to clear up the confusion that arose when trying to describe, for example, how a JOVIAL generator for the IBM 709 could produce a JOVIAL translator to the Philco S-2000 that would run on the 709 and then use the resulting 709 - S-2000 translator to produce a JOVIAL translator to the S-2000 that would run on the S-2000.
Eliminating isochronic-fork constraints in quasi-delay-insensitive circuits
Authors: Nattha Sretasereekul, Takashi Nanya
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

The Quasi-Delay-Insensitive (QDI) model assumes that all the forks are isochronic. The isochronic-fork assumption requires uniform wire delays and uniform switching thresholds of the gates associated with the forking branches. This paper presents a method for determining such forks that do not have to satisfy the isochronic fork requirements, and presents experimental results that show many isochronic forks assumed for existing QDI circuits do not actually have to be "isochronic" or can be even ignored.
The use of English as a programming language
Authors: Jean E. Sammet
Venue: Communications of the ACM (1966)

The purpose of this talk is to make a personal plea, backed up by some practical comments, for the use of English or anyone else's natural language as a programming language. This seems to be a suitable subject for the conference, since whatever definition of pragmatics is decided upon, it certainly seems to be tied in with the users of any programming language and what the language means to them.
Integration and applications of the TAU performance system in parallel Java environments
Authors: Sameer Shende, Allen D. Malony
Venue: Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande (2001)

Parallel Java environments present challenging problems for performance tools because of Java's rich language system and its multi-level execution platform combined with the integration of native-code application libraries and parallel runtime software. In addition to the desire to provide robust performance measurement and analysis capabilities for the Java language itself, the coupling of different software execution contexts under a uniform performance model needs careful consideration of how events of interest are observed and how cross-context parallel execution information is linked. This paper relates our experience in extending the TAU performance system to a parallel Java environment based on mpiJava. We describe the complexities of the instrumentation model used, how performance measurements are made, and the overhead incurred. A parallel Java application simulating the game of Life is used to show the performance system's capabilities.