ppxscal/embedding_network huggingface dataset:
An Evaluation of Statistical Approaches to Text Categorization
Authors: Yiming Yang
Venue: Information Retrieval (1999)

This paper focuses on a comparative evaluation of a wide-range of text categorization methods, including previously published results on the Reuters corpus and new results of additional experiments. A controlled study using three classifiers, kNN, LLSF and WORD, was conducted to examine the impact of configuration variations in five versions of Reuters on the observed performance of classifiers. Analysis and empirical evidence suggest that the evaluation results on some versions of Reuters were significantly affected by the inclusion of a large portion of unlabelled documents, mading those results difficult to interpret and leading to considerable confusions in the literature. Using the results evaluated on the other versions of Reuters which exclude the unlabelled documents, the performance of twelve methods are compared directly or indirectly. For indirect compararions, kNN, LLSF and WORD were used as baselines, since they were evaluated on all versions of Reuters that exclude the unlabelled documents. As a global observation, kNN, LLSF and a neural network method had the best performance&semi; except for a Naive Bayes approach, the other learning algorithms also performed relatively well.
Improving bus test via IDDT and boundary scan
Authors: Shih-Yu Yang, Christos A. Papachristou, Massood Tabib-Azar
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

This paper presents a systematic test methodology targeting bus line interconnect defects using IDDT testing and Boundary Scan. Traditional test is unable to detect all possible defects, especially timing-related faults. Open and short defects on interconnects between embedded modules can be detected by IDDT testing. Boundary Scan can provide accessibility to internal buses. A statistical analysis is presented discussing the uncertain factors due to process variations and power fluctuation. The effectiveness of the proposed technique on shorts, opens or the other non stuck-at fault type defects is also illustrated.
Design of a Machine-Independent Optimizing System for Emulator Development
Authors: Perng-Ti Ma, T. G. Lewis
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

Methods are described to translate a certain machine-independent intermediate language (IML) to efficient microprograms for a class of horizontal microprogrammable machines. The IML is compiled directly from a high-level microprogramming language used to implement a virtual instruction set processor as a microprogram. The primary objective of the IML-to-host machine interface design is to facilitate language portability. Transportability is accomplished by use of a field description model and a macro expansion table which describe the host machine to the translator system. Register allocation scheme and control flow analysis are employed to allocate the symbolic variables of the IML to the general-purpose registers of the host machine. A set of 5-tuple microoperations (function, input, output, field, phase) is obtained with the aid of the field description model. Then a compaction algorithm is used to detect the parallelism of microoperations and to generate suboptimal code for a horizontal microprogrammable machine. The study concludes with a description of the effects of the above methods upon the quality of microcode produced for a specific commercial computer.
Power, politics, and MIS implementation
Authors: M. Lynne Markus
Venue: Communications of the ACM (1983)

Theories of resistance to management information systems (MIS) are important because they guide the implementation strategies and tactics chosen by implementors. Three basic theories of the causes of resistance underlie many prescriptions and rules for MIS implementation. Simply stated, people resist MIS because of their own internal factors, because of poor system design, and because of the interaction of specific system design features with aspects of the organizational context of system use. These theories differ in their basic assumptions about systems, organizations, and resistance; they also differ in predictions that can be derived from them and in their implications for the implementation process. These differences are described and the task of evaluating the theories on the bases of the differences is begun. Data from a case study are used to illustrate the theories and to demonstrate the superiority, for implementors, of the interaction theory.
Latency and latch count minimization in wave steered circuits
Authors: Amit Singh, Arindam Mukherjee, Malgorzata Marek-Sadowska
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

Wave Steering is a new design methodology that realizes high throughput circuits by embedding layout friendly synthesized structures in silicon. Wave Steered circuits inherently utilize latches in order to guarantee the correct signal arrival times at the inputs of these synthesized structures and maintain the high throughput of operation. In this paper, we show a method of reor-dering signals to achieve minimum circuit latency for Wave Steered circuits and propose an Integer Linear Programming(ILP) formulation for scheduling and retiming these circuits to minimize the number of latches for minimum latency. Experimental results show that in 0.25mm CMOS technology, as much as 33.2% reduc-tion in latch count, at minimum latency, can be achieved over unoptimized Wave Steered circuits operating at 500 MHz.
Optimizing memory usage in the polyhedral model
Authors: Fabien Quilleré, Sanjay Rajopadhye
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2000)

The polyhedral model provides a single unified foundation for systolic array synthesis and automatic parallelization of loop programs. We investigate the problem of memory reuse when compiling Alpha (a functional language based on this model). Direct compilation would require unacceptably large memory (for example O(n3) for matrix multiplication). Researchers have previously addressed the problem of memory reuse, and the analysis that this entails for projective memory allocations. This paper addresses, for a given schedule, the choice of the projections so as to minimize the volume of the residual memory. We prove tight bounds on the number of linearly independent projection vectors. Our method is constructive, yielding an optimal memory allocation. We extend the method to modular functions, and deal with the subsequent problems of code generation. Our ideas are illustrated on a number of examples generated by the current version of the Alpha compiler.
DESCRIPTRAN&mdash;automated descriptive geometry
Authors: Raymond A. Kliphardt
Venue: Communications of the ACM (1963)

Descriptive geometry consists of procedures originally designed to solve 3-space geometry problems by graphical constructions and measurement instead of by computation. However, in addition to this it unifies and simplifies the approach to many such problems. When one can call subroutines that compute new coordinates that correspond to those obtainable from the graphical constructions, there is the three-way advantage of the approach of descriptive geometry, the accuracy of computation and the speed of the digital computer. DESCRIPTRAN makes it possible to program many problems in 3-space with a few statements; it consists of 15 subroutines analogous to the procedures of descriptive geometry. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The management of end user computing
Authors: John F. Rockart, Lauren S. Flannery
Venue: Communications of the ACM (1983)

End users can be classified into six distinct types. Each of them needs differentiated education, support, and control from the Information Systems function. To support a large number of their applications a new computing environment, &ldquo;the third environment&rdquo; must be developed by Information Systems (I/S) management. Close attention must also be paid by I/S management to the need to involve &ldquo;functional support personnel&rdquo; (end users in each functional area who spend most of their time programming and aiding other end users) in the I/S end user management process.
Scheduling tasks with small communication delays for clusters of processors
Authors: E. Bampis, R. Giroudeau, A. Kononov
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

Until recently, the standard communication model for scheduling the task of a parallel program has been the homogeneous communication model (also known as the delay model) introduced by Rayward-Smith for unit-execution-times, unit-communication times (UET-UTC) precedence graphs. In this model, we have a set of identical processors that are able to communicate in a uniform way. We want to use these processors in order to process a set of tasks that are subject to precedence contraints. Each task has a processing time, and if two adjacent task of the precedence graph are processed by two different processors (resp. the same processors) then a communication delay has to be taken into account explicitly (resp. the communication time is neglected). The problem is to find a trade-off between the two extreme solutions, namely, execute all the tasks sequentially without communications, or try to use all the potential parallelism but in the cost of an increased communication overhead. This model has been extensively studied these last years both from the compexity and the (non)-approximability point of views.
Joint inventorship of computers
Authors: Gunter A. Hauptman
Venue: Communications of the ACM (1964)

The term joint inventorship asks but does not necessarily answer the question, &ldquo;Who is the true inventor of a computer?&rdquo; I will try to show how &ldquo;wrong&rdquo; inventors are joined, how such improper joinder can be avoided, and its dangers. While the law permits the addition or subtraction of improperly joined inventors, it does not permit the substitution of one set of inventors for another set of inventors. Thus, despite corrective weapons, there are some pitfalls which must be avoided.
The Manchester Mark I and atlas: a historical perspective
Authors: S. H. Lavington
Venue: Communications of the ACM (1978)

In 30 years of computer design at Manchester University two systems stand out: the Mark I (developed over the period 1946-49) and the Atlas (1956-62). This paper places each computer in its historical context and then describes the architecture and system software in present-day terminology. Several design concepts such as address-generation and store management have evolved in the progression from Mark I to Atlas. The wider impact of Manchester innovations in these and other areas is discussed, and the contemporary performance of the Mark I and Atlas is evaluated.
Note on the use of procedures
Authors: M. J. R. Healy
Venue: Communications of the ACM (1964)

The very generality of a language like ALGOL renders it inefficient when a number of programs have to be written all dealing with a fairly narrow range of problems. This can be largely overcome by the construction of a package of suitable procedures, each of which embodies a fairly substantial piece of computation that will be required in several different contexts (see, for example [1]). A program for a specific purpose will consist of a set of these procedures linked by a more or less skeletal main program.
Designing Process Replication and Activation: A Quantitative Approach
Authors: Marin Litoiu, Jerome Rolia, Giuseppe Serazzi
Venue: IEEE Transactions on Software Engineering (2000)

Distributed application systems are composed of classes of objects with instances that interact to accomplish common goals. Such systems can have many classes of users with many types of requests. Furthermore, the relative load of these classes can shift throughout the day causing changes to system behavior and bottlenecks. When designing and deploying such systems it is necessary to determine a process replication and threading policy for the server processes that contain the objects, as well as process activation policies. To avoid bottlenecks the policy must support all possible workload conditions. Licensing, implementation, or resource constraints can limit the number of permitted replicas or threads of a server process. Process activation policies determine whether a server is persistent or should be created and terminated with each call. The purpose of this paper is to describe quantitative techniques for choosing process replication or threading levels and process activation policies. Inappropriate policies can lead to unnecessary queuing delays for callers or unnecessarily high consumption of memory resources. The algorithms presented consider all workload conditions, are iterative in nature, and are hybrid mathematical programming and analytic performance evaluation methods. An example is given to demonstrate the technique and describe how the results can be applied during software design and deployment.
A Robust Analog VLSI Reichardt Motion Sensor
Authors: Reid R. Harrison, Christof Koch
Venue: Analog Integrated Circuits and Signal Processing (2000)

Silicon imagers with integrated motion-detection circuitry have been developed and tested for the past 15 years. Many previous circuits estimate motion by identifying and tracking spatial or temporal features. These approaches are prone to failure at low SNR conditions, where feature detection becomes unreliable. An alternate approach to motion detection is an intensity-based spatiotemporal correlation algorithm, such as the one proposed by Hassenstein and Reichardt in 1956 to explain aspects of insect vision. We implemented a Reichardt motion sensor with integrated photodetectors in a standard CMOS process. Our circuit operates at sub-microwatt power levels, the lowest reported for any motion sensor. We measure the effects of device mismatch on these parallel, analog circuits to show they are suitable for constructing 2-D VLSI arrays. Traditional correlation-based sensors suffer from strong contrast dependence. We introduce a circuit architecture that lessens this dependence. We also demonstrate robust performance of our sensor to complex stimuli in the presence of spatial and temporal noise.
Linux Means Business: Linux in Embedded Industrial Applications: A Case Study
Authors: Luca Fini
Venue: Linux Journal (2000)

In order to allow the acquisition of diagnostic data from an existing industrial plant which was not designed for the purpose, a protocol converter gateway has been builtusing an industrial PC running Linux.
LoGPC: Modeling Network Contention in Message-Passing Programs
Authors: Csaba Andras Moritz, Matthew I. Frank
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

In many real applications, for example, those with frequent and irregular communication patterns or those using large messages, network contention and contention for message processing resources can be a significant part of the total execution time. This paper presents a new cost model, called LoGPC, that extends the LogP [9] and LogGP [4] models to account for the impact of network contention and network interface DMA behavior on the performance of message passing programs. We validate LoGPC by analyzing three applications implemented with Active Messages [11], [19] on the MIT Alewife multiprocessor. Our analysis shows that network contention accounts for up to 50 percent of the total execution time. In addition, we show that the impact of communication locality on the communication costs is at most a factor of two on Alewife. Finally, we use the model to identify trade-offs between synchronous and asynchronous message passing styles.
Thermal-ADI: a linear-time chip-level dynamic thermal simulation algorithm based on alternating-direction-implicit (ADI) method
Authors: Ting-Yuan Wang, Charlie Chung-Ping Chen
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

Due to the dramatic increase of clock frequency and integration density, power density and on-chip temperature in high-end VLSI circuits rise significantly. To ensure the timing correctness and the reliability of high-end VLSI design, efficient and accurate chip-level transient thermal simulations are of crucial importance.In this paper, we develop and present an efficient transient thermal simulation algorithm based on the alternating-direction-implicit method. Our algorithm, Thermal-ADI, not only hasa linear runtime and memory requirement, but also isunconditionally stablewhich ensures that time-step is not limited by any stability requirement. Extensive experimental results show that our algorithm is not only orders of magnitude faster than the traditional thermal simulation algorithms but also highly accurate, and efficient in memory usage.
A Statistical, Nonparametric Methodology for Document Degradation Model Validation
Authors: Tapas Kanungo, Robert M. Haralick, Werner Stuezle, Henry S. Baird, David Madigan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Printing, photocopying, and scanning processes degrade the image quality of a document. Statistical models of these degradation processes are crucial for document image understanding research. Models allow us to predict system performance, conduct controlled experiments to study the breakdown points of the systems, create large multilingual data sets with groundtruth for training classifiers, design optimal noise removal algorithms, choose values for the free parameters of the algorithms, and so on. Although research in document understanding started many decades ago, only two document degradation models have been proposed thus far. Furthermore, no attempts have been made to statistically validate these models. In this paper, we present a statistical methodology that can be used to validate local degradation models. This method is based on a nonparametric, two-sample permutation test. Another standard statistical device¿the power function¿is then used to choose between algorithm variables such as distance functions. Since the validation and the power function procedures are independent of the model, they can be used to validate any other degradation model. A method for comparing any two models is also described. It uses p-values associated with the estimated models to select the model that is closer to the real world.
Enforceable security policies
Authors: Fred B. Schneider
Venue: ACM Transactions on Information and System Security (TISSEC) (2000)

A precise characterization is given for the class of security policies enforceable with mechanisms that work by monitoring system execution, and automata are introduced for specifying exactly that class of security policies. Techniques to enforce security policies specified by such automata are also discussed.
A history and evaluation of System R
Authors: Donald D. Chamberlin, Morton M. Astrahan, Michael W. Blasgen, James N. Gray, W. Frank King, Bruce G. Lindsay, Raymond Lorie, James W. Mehl, Thomas G. Price, Franco Putzolu, Patricia Griffiths Selinger, Mario Schkolnick, Donald R. Slutz, Irving L. Traiger, Bradford W. Wade, Robert A. Yost
Venue: Communications of the ACM (1981)

System R, an experimental database system, was constructed to demonstrate that the usability advantages of the relational data model can be realized in a system with the complete function and high performance required for everyday production use. This paper describes the three principal phases of the System R project and discusses some of the lessons learned from System R about the design of relational systems and database systems in general.
On partitioning vs. placement rent properties
Authors: P. Verplaetse, J. Dambre, D. Stroobandt, J. Van Campenhout
Venue: Proceedings of the 2001 international workshop on System-level interconnect prediction (2001)

Rent's rule can be derived by direct partitioning of the circuit netlist, by indirect partitioning of the placed layout, or by averaging the number of terminals for various equally large regions of the placed circuit. It is shown that all three methods may produce different results. After investigation of the fundamental reasons for these differences, three distinct effects can be identified. The boundary and the embedding effect is present with all placement approaches, though the embedding effect may be (partly) nullified by the grid effect that may occur with some partitioning-based placement algorithms.One of the main applications of Rent's rule is the estimation of wire length distribution. Both flat and hierarchical placement models can be applied, though experiments show that for the current state-of-the-art estimation techniques the latter produces better results, even for layouts that were generated using a flat placement approach. Which Rent parameters and occupation probability function should be used depends on the placement algorithm. We discuss various possibilities and present a new occupation probability function that allows better wire length estimations of partitioning-based placements.
Faster kinetic heaps and their use in broadcast scheduling
Authors: Haim Kaplan, Robert E. Tarjan, Kostas Tsioutsiouliklis
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We describe several implementations of the kinetic heap, a heap (priority queue) in which the key of each item, instead of being fixed, is a linear function of time. The kinetic heap is a simple example of a kinetic data structure of the kind considered by Basch, Guibas, and Hershberger. Kinetic heaps have many applications in computational geometry, and previous implementations were designed to address these applications. We describe an additional application, to broadcast scheduling. Each of our kinetic heap implementations improves on previous implementations by being simpler or asymptotically faster for some or all applications.
Randomizing Outputs to Increase Prediction Accuracy
Authors: Leo Breiman
Venue: Machine Learning (2000)

Bagging and boosting reduce error by changing both the inputs and outputs to form perturbed training sets, growing predictors on these perturbed training sets and combining them. An interesting question is whether it is possible to get comparable performance by perturbing the outputs alone. Two methods of randomizing outputs are experimented with. One is called output smearing and the other output flipping. Both are shown to consistently do better than bagging.
Observability Inequalities for Shallow Shells
Authors: Peng-Fei Yao
Venue: SIAM Journal on Control and Optimization (2000)

We consider some observability inequalities from boundary for a general shallow shell with a middle surface of any shape. At first, an estimate is established by the geometric multiplier method in the case that no boundary conditions are imposed under some checkable geometric conditions. Then our results yield continuous observability estimates for two kinds of boundary conditions which have a physical meaning with an explicit observability time and hence, by duality, exact controllability results.
Kernel Korner: The Bullet Points: Linux 2.4 - Part Deux
Authors: Joe Pranevich
Venue: Linux Journal (2000)

This article should be considered an addendum to my previous "Bullet Points" article and my follow up piece on ISA PnP support in Linux 2.4 (February, 2000.)