ppxscal/embedding_network huggingface dataset:
Self esteem: moderator between role stress fit and satisfaction and commitment?
Authors: Anthony C. Nelson, Cindy LeRouge
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

Many companies are having a difficult time satisfying and gaining commitment from IT workers. This study determines whether satisfying preferences for role ambiguity and conflict will increase satisfaction and commitment levels. Furthermore, this research seeks to determine if self-esteem moderates the relationship between satisfying employee preferences and levels of satisfaction and commitment. Preliminary findings supported these propositions.
A statistical study of the accuracy of floating point number systems
Authors: H. Kuki, W. J. Cody
Venue: Communications of the ACM (1983)

This paper presents the statistical results of tests of the accuracy of certain arithmetic systems in evaluating sums, products and inner products, and analytic error estimates for some of the computations. The arithmetic systems studied are 6-digit hexadecimal and 22-digit binary floating point number representations combined with the usual chop and round modes of arithmetic with various numbers of guard digits, and with a modified round mode with guard digits. In a certain sense, arithmetic systems differing only in their use of binary or hexadecimal number representations are shown to be approximately statistically equivalent in accuracy. Further, the usual round mode with guard digits is shown to be statistically superior in accuracy to the usual chop mode in all cases save one. The modified round mode is found to be superior to the chop mode in all cases.
A Batch Learning Vector Quantization Algorithm for Nearest Neighbour Classification
Authors: Sergio Bermejo, Joan Cabestany
Venue: Neural Processing Letters (2000)

We introduce a batch learning algorithm to design the set of prototypes of 1 nearest-neighbour classifiers. Like Kohonen's LVQ algorithms, this procedure tends to perform vector quantization over a probability density function that has zero points at Bayes borders. Although it differs significantly from their online counterparts since: (1) its statistical goal is clearer and better defined; and (2) it converges superlinearly due to its use of the very fast Newton's optimization method. Experiments results using artificial data confirm faster training time and better classification performance than Kohonen's LVQ algorithms.
A Knowledge-based Approach to Handling Exceptions inWorkflow Systems
Authors: Mark Klein, Chrysanthos Dellarocas
Venue: Computer Supported Cooperative Work (2000)

This paper describes a novel knowledge-based approach for helping workflow process designers and participants better manage the exceptions (deviations from an ideal collaborative work process caused by errors, failures, resource or requirements changes etc.) that can occur during the enactment of a workflow. This approach is based on exploiting a generic and reusable body of knowledge concerning what kinds of exceptions can occur in collaborative work processes, and how these exceptions can handled (detected, diagnosed and resolved). This work builds upon previous efforts from the MIT Process Handbook project and from research on conflict management in collaborative design.
File archival techniques using data compression
Authors: Michael Pechura
Venue: Communications of the ACM (1982)

The performance of most small computer systems is determined, to a large extent, by the characteristics of their mass storage devices. Data compression can expand the storage capacity of such devices and also slightly increase their speed. Here, a summary of one method of data compression using Huffman variable length coding is presented, along with statistics of effectiveness for various file types and practical techniques for integrating such methods into a small computer system.
Learning with Permutably Homogeneous Multiple-Valued Multiple-Threshold Perceptrons
Authors: Alioune Ngom, Corina Reischer, Dan A. Simovici, Ivan Stojmenović
Venue: Neural Processing Letters (2000)

The (n,k,s)-perceptrons partition the input space V \subset Rn into s+1 regions using s parallel hyperplanes. Their learning abilities are examined in this research paper. The previously studied homogeneous (n,k,k&minus;1)-perceptron learning algorithm is generalized to the permutably homogeneous (n,k,s)-perceptron learning algorithm with guaranteed convergence property. We also introduce a high capacity learning method that learns any permutably homogeneously separable k-valued function given as input.
Significant event simulation
Authors: Alan F. Babich, John Grason, David L. Parnas
Venue: Communications of the ACM (1975)

This paper compares a new method of simulation organization, called the significant event method, with an old one, called the clock pulse method, using as examples two automobile traffic models. The significant event method is found to be more efficient than the clock pulse method at low levels of system interaction and less efficient at high levels. A simple mathematical model for the trade-off in the relative running time of the two methods is developed. The model aids in choosing between the two simulation methods for a particular experiment. It is concluded that the significant event method can be of value in the simulation of some systems when computational efficiency is of sufficient importance.
Some techniques used in the ALCOR ILLINOIS 7090
Authors: D. Gries, M. Paul, H. R. Wiehle
Venue: Communications of the ACM (1965)

An ALGOL compiler has been written by the ALCOR group for the IBM 7090. Some little known but significant techniques in compiler writing, together with organizational details of this compiler, are described. Timing estimates and an indication of compiler requirements are also given.
Apache User Authentication
Authors: Ibrahim F. Haddad
Venue: Linux Journal (2000)

A guide to setting up user authentication for the Apache web server running on Linux, using the plaintext file method.
Static enforcement of security with types
Authors: Christian Skalka, Scott Smith
Venue: ACM SIGPLAN Notices (2000)

A number of security systems for programming languages have recently appeared, including systems for enforcing some form of access control. The Java JDK 1.2 security architecture is one such system that is widely studied and used. While the architecture has many appealing features, access control checks are all implemented via dynamic method calls. This is a highly non-declarative form of specification which is hard to read, and which leads to additional run-time overhead. In this paper, we present a novel security type system that enforces the same security guarantees as Java Stack Inspection, but via a static type system with no additional run-time checks. The system allows security properties of programs to be clearly expressed within the types themselves. We also define and prove correct an inference algorithm for security types, meaning that the system has the potential to be layered on top of the existing Java architecture, without requiring new syntax.
Self-Organization by Temporal Inhibition (SOTI)
Authors: P. Martín-Smith, F. J. Pelayo, E. Ros, A. Prieto
Venue: Neural Processing Letters (2000)

A model is presented for a neural network with competitive learning that demonstrates the self-organizing capabilities arising from the inclusion of a simple temporal inhibition mechanism within the neural units. This mechanism consists of the inhibition, for a certain time, of the neuron that generates an action potential; such a process is termed Post_Fire inhibition. The neural inhibition period, or degree of inhibition, and the way it is varied during the learning process, represents a decisive factor in the behaviour of the network, in addition to constituting the main basis for the exploitation of the model. Specifically, we show how Post_Fire inhibition is a simple mechanism that promotes the participation of and cooperation between the units comprising the network; it produces self-organized neural responses that reveal spatio&ndash;temporal characteristics of input data. Analysis of the inherent properties of the Post_Fire inhibition and the examples presented show its potential for applications such as vector quantization, clustering, pattern recognition, feature extraction and object segmentation. Finally, it should be noted that the Post_Fire inhibition mechanism is treated here as an efficient abstraction of biologically plausible mechanisms, which simplifies its implementation.
A class of iterative techniques for the factorization of polynomials
Authors: H. A. Luther
Venue: Communications of the ACM (1964)

A method of iteration is developed in terms of a function of somewhat arbitrary character. Sufficient conditions are given for convergence of the process, yielding factors of arbitrary degree for polynomials in one variable. Both Lin's method and Newton's method occur as special cases.
A Neural Chaos Model of Multistable Perception
Authors: Natsuki Nagao, Haruhiko Nishimura, Nobuyuki Matsui
Venue: Neural Processing Letters (2000)

We present a perception model of ambiguous patterns based on the chaotic neural network and investigate the characteristics through computer simulations. The results induced by the chaotic activity are similar to those of psychophysical experiments and it is difficult for the stochastic activity to reproduce them in the same simple framework. Our demonstration suggests functional usefulness of the chaotic activity in perceptual systems even at higher cognitive levels. The perceptual alternation may be an inherent feature built in the chaotic neuron assembly.
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs
Authors: John Backus
Venue: Communications of the ACM (1978)

Conventional programming languages are growing ever more enormous, but not stronger. Inherent defects at the most basic level cause them to be both fat and weak: their primitive word-at-a-time style of programming inherited from their common ancestor&mdash;the von Neumann computer, their close coupling of semantics to state transitions, their division of programming into a world of expressions and a world of statements, their inability to effectively use powerful combining forms for building new programs from existing ones, and their lack of useful mathematical properties for reasoning about programs. An alternative functional style of programming is founded on the use of combining forms for creating programs. Functional programs deal with structured data, are often nonrepetitive and nonrecursive, are hierarchically constructed, do not name their arguments, and do not require the complex machinery of procedure declarations to become generally applicable. Combining forms can use high level programs to build still higher level ones in a style not possible in conventional languages. Associated with the functional style of programming is an algebra of programs whose variables range over programs and whose operations are combining forms. This algebra can be used to transform programs and to solve equations whose &ldquo;unknowns&rdquo; are programs in much the same way one transforms equations in high school algebra. These transformations are given by algebraic laws and are carried out in the same language in which programs are written. Combining forms are chosen not only for their programming power but also for the power of their associated algebraic laws. General theorems of the algebra give the detailed behavior and termination conditions for large classes of programs. A new class of computing systems uses the functional programming style both in its programming language and in its state transition rules. Unlike von Neumann languages, these systems have semantics loosely coupled to states&mdash;only one state transition occurs per major computation.
Efficient algorithms for lateral gene transfer problems
Authors: M. T. Hallett, J. Lagergren
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

This paper develops a model for lateral gene transfer events (a.k.a. horizontal gene transfer events) between a set of gene trees T1, T2, &hellip;, Tk and a species tree S. To the best of our knowledge, this model possesses a higher degree of biological and mathematical soundness than any other model proposed in the literature. Among other biological considerations, the model respects the partial order of evolution implied by S. Within our model, we identify an activity parameter that measures the number of genes that are allowed to be simultaneously active in the genome of a taxa and show that finding the most parsimonious scenario that reconciles the disagreeing gene trees with the species tree is doable in polynomial time when the activity level and number of transfers are small, but intractable in general. To the best of our knowledge, all other models proposed in the literature assume implicitly that the activity is one. Finally, using a dataset of bacterial gene sequences from [4], our implementations found 5 optimal scenarios; one of which is the scenario proposed by the authors in [4].
A preliminary system for the design of DBTG data structures
Authors: Rob Gerritsen
Venue: Communications of the ACM (1975)

The functional approach to database design is introduced. In this approach the goal of design is to derive a data structure which is capable of supporting a set of anticipated queries rather than a structure which &ldquo;models the business&rdquo; in some other way. An operational computer program is described which utilizes the functional approach to design data structures conforming to the Data Base Task Group specifications. The automatic programming technology utilized by this program, although typically used to generate procedure, is here used to generate declaratives.
On Near Hexagons and Spreads of Generalized Quadrangles
Authors: Bart De Bruyn
Venue: Journal of Algebraic Combinatorics: An International Journal (2000)

The glueing-construction described in this paper makes use of two generalized quadrangles with a spread in each of them and yields a partial linear space with special properties. We study the conditions under which glueing will give a near hexagon. These near hexagons satisfy the nice property that every two points at distance 2 are contained in a quad. We characterize the class of the &ldquo;glued near hexagons&rdquo; and give examples, some of which are new near hexagons.
A view of computer architecture
Authors: Caxton C. Foster
Venue: Communications of the ACM (1972)

An attempt is made to predict the developments of the next 25 years in the field of computer architecture. Standardized, inexpensive microcomputers on a single chip are predicted. These will be used extensively to provide logical functions for noncomputational devices and incidentally for the design of superscale computers.
A controller for a braille terminal
Authors: Richard Rubinstein
Venue: Communications of the ACM (1972)

Anderson and Rogers [1] have described a set of modifications which convert a standard model 33 tele-type into a device which produces embossed braille characters. Thus, blind computer users can communicate with a computer without the help of a sighted person to read the output. The disadvantage of this terminal alone is that either the applications program or the operating system of the host computer must have special software to map each output character into a sequence of three characters necessary to emboss its braille equivalent. Such software modification can be expensive and has to be done for each applications program or operating system the blind person wants to use.
Accurate approximate solution of partial differential equations at off-mesh points
Authors: W. H. Enright
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

Numerical methods for partial differential equations often determine approximations that are more accurate at the set of discrete meshpoints than they are at the &ldquo;off-mesh&rdquo; points in the domain of interest. These methods are generally most effective if they are allowed to adjust the location of the mesh points to match the local behavior of the solution. Different methods will typically generate their respective approximations on incompatible, unstructured meshes, and it can be difficult to evaluate the quality of a particular solution, or to visualize important properties of a solution. In this paper we will introduce a generic approach which can be used to generate approximate solution values at arbitrary points in the domain of interest for any method that determines approximations to the solution and low-order derivatives at meshpoints. This approach is based on associating a set of &ldquo;collocation&rdquo; points with each mesh element and requiring that the local approximation interpolate the meshpoint data and almost satisfy the partial differential equation at the collocation points. The accuracy associated with this interpolation/collocation approach is consistent with the &ldquo;meshpoint accuracy&rdquo; of the underlying method. The approach that we develop applies to a large class of methods and problems. It uses local information only and is therefore particularly suitable for implementation in a parallel or network computing environment. Numerical examples are given for some second-order problems in two and three dimensions.
Clausal temporal resolution
Authors: Michael Fisher, Clare Dixon, Martin Peim
Venue: ACM Transactions on Computational Logic (TOCL) (2001)

In this article, we examine how clausal resolution can be applied to a specific, but widely used, nonclassical logic, namely discrete linear temporal logic. Thus, we first define a normal form for temporal formulae and show how arbitrary temporal formulae can be translated into the normal form, while preserving satisfiability. We then introduce novel resolution rules that can be applied to formulae in this normal form, provide a range of examples, and examine the correctness and complexity of this approach. Finally, we describe related work and future developments concerning this work.
An ALGOL-based associative language
Authors: Jerome A. Feldman, Paul D. Rovner
Venue: Communications of the ACM (1969)

A high level programming language for large, complex associative structures has been designed and implemented. The underlying data structure has been implemented using a hash-coding technique. The discussion includes a comparison with other work and examples of applications of the language.
Taking advantage of national science foundation funding opportunities: part 2: mock panels (panel session)
Authors: Andrew Bernat, Harriet Taylor
Venue: Journal of Computing Sciences in Colleges (2001)

Attendees will participate in a mock review panel using actual funded proposals in order to get a deeper understanding of the process. The goal is help prospective proposers to develop their ideas and put them into a form that maximizes the competitiveness of their proposals.
Offering CS1 on-line reducing campus resource demand while improving the learning environment
Authors: Jon A. Preston, Laura Wilson
Venue: ACM SIGCSE Bulletin (2001)

Multimedia-rich Web interfaces offer an increasingly attractive option for teaching distance and large-scale courses. We explore our experience of publishing CS1 to over 200 students and the resulting student performance. Our approach included streaming QuickTime audio and video synchronized with animated PowerPoint slides; in addition, a "Frequently Asked Questions" (FAQ) list was compiled from previous students' questions and made available. We demonstrate that the on-line lecture material enhanced students' learning of those enrolled in the traditional, lecture-based sections and those enrolled in the on-line section. The process is cost-effective, scalable, and affords use in other disciplines beyond CS1. Our future research is also discussed.
The triangle processor and normal vector shader: a VLSI system for high performance graphics
Authors: Michael Deering, Stephanie Winner, Bic Schediwy, Chris Duffy, Neil Hunt
Venue: Proceedings of the 15th annual conference on Computer graphics and interactive techniques (1988)

Current affordable architectures for high-speed display of shaded 3D objects operate orders of magnitude too slowly. Recent advances in floating point chip technology have outpaced polygon fill time, making the memory access bottleneck between the drawing processor and the frame buffer the most significant factor to be accelerated. Massively parallel VLSI system have the potential to bypass this bottleneck, but to date only at very high cost. We describe a new more affordable VLSI solution. A pipeline of triangle processors rasterizes the geometry, then a further pipeline of shading processors applies Phong shading with multiple light sources. The triangle processor pipeline performs 100 billion additions per second, and the shading pipeline performs two billion multiplies per second. This allows 3D graphics systems to be built capable of displaying more than one million triangles per second. We show the results of an anti-aliasing technique, and discuss extensions to texture mapping, shadows, and environment maps.
A Unified Formulation of Honeycomb and Diamond Networks
Authors: Behrooz Parhami, Ding-Ming Kwai
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Honeycomb and diamond networks have been proposed as alternatives to mesh and torus architectures for parallel processing. When wraparound links are included in honeycomb and diamond networks, the resulting structures can be viewed as having been derived via a systematic pruning scheme applied to the links of 2D and 3D tori, respectively. The removal of links, which is performed along a diagonal pruning direction, preserves the network's node-symmetry and diameter, while reducing its implementation complexity and VLSI layout area. In this paper, we prove that honeycomb and diamond networks are special subgraphs of complete 2D and 3D tori, respectively, and show this viewpoint to hold important implications for their physical layouts and routing schemes. Because pruning reduces the node degree without increasing the network diameter, the pruned networks have an advantage when the degree-diameter product is used as a figure of merit. Additionally, if the reduced node degree is used as an opportunity to increase the link bandwidths to equalize the costs of pruned and unpruned networks, a gain in communication performance may result.
Preliminary report on a system for general space planning
Authors: Charles M. Eastman
Venue: Communications of the ACM (1972)

A computer language and a set of programs within that language are described which allow the formulating and solving of a class of space planning problems. The language is an extension of Algol and includes means to represent spaces and objects, to manipulate them, and to test the resulting arrangements according to a variety of constraints. The algorithms used to solve problems expressed in this language rely on heuristic programming. Both the language and the search algorithms are detailed.
BusyBox: A Swiss Army Knife for Linux
Authors: Nicholas Wells
Venue: Linux Journal (2000)

Learn how to save disk space with this open source tool for embedded systems. 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
Some Properties of Symmetric Quasi-Definite Matrices
Authors: Alan George, KH. Ikramov, A. B. Kucherov
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

Symmetric quasi-definite matrices arise in numerous applications, notably in interior point methods in mathematical programming. Several authors have derived various properties of these matrices. This article provides a list of some previously known properties and adds a number of others that are believed to be new.