ppxscal/embedding_network huggingface dataset:
Using personality inventories to help form teams for software engineering class projects
Authors: Rebecca H. Rutherfoord
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

As faculty create their teams for software engineering class projects various techniques may be used to create these teams. Random selection as well as structured assignments all have varied strengths and weaknesses. One method for selecting students involves using personality inventories to assess the various personality types of the students. This paper will discuss how the author used the Keirsey Temperament Sorter to select teams for a software engineering class and some of the results of this experiment.
An agent-based system for email highlighting
Authors: Suhayya Abu-Hakima, Connie McFarland, John F. Meech
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

This paper describes the design and implementation of an agentbased system that provides automatic interpretation and content highlighting of electronic text. The architecture has been deployed in a commercial product that provides email content interpretation that allows a user to acquire a fast overview of their email message content.
Programming Languages: Generation of positive test matrices with known positive spectra
Authors: C. A. Hall, T. A. Porsching
Venue: Communications of the ACM (1968)

Sufficient conditions are given for a real matrix to be similar to a positive matrix. This result is used to construct a similarity transformation which, when applied to a particular upper triangular matrix, yields a positive matrix with a preassigned positive spectrum.
Efficient use of local edge histogram descriptor
Authors: Dong Kwon Park, Yoon Seok Jeon, Chee Sun Won
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

The purpose of this paper is to show how the edge histogram descriptor for MPEG-7 can be efficiently utilized for image matching. Since the edge histogram descriptor recommended for the MPEG-7 standard represents only local edge distribution in an image, the matching performance for image retrieval may not be satisfactory. In this paper, to increase the matching performance, we propose to use the global and semi-local edge histograms generated directly from the local histogram bins. Then, the global, semi-global, and local histograms of two images are compared to evaluate the similarity measure. Since we exploit the absolute locations of edge in the image as well as its global composition, the proposed matching method is considered to be a more image content-based retrieval. Experimental results support this claim. Experiments on test images for MPEG-7 core experiment show that the proposed method yields better retrieval performance especially for semantic similarity.
A comparison of batch processing and instant turnaround
Authors: Lyle B. Smith
Venue: Communications of the ACM (1967)

A study of the programming efforts of students in an introductory programming course is presented and the effects of having instant turnaround (a few minutes) as opposed to conventional batch processing with turnaround times of a few hours are examined. Among the items compared are the number of computer runs per trip to the computation center, program preparation time, keypunching time, debugging time, number of runs, and elapsed time from the first run to the last run on each problem. Even though the results are influenced by the fact that &ldquo;bonus points&rdquo; were given for completion of a programming problem in less than a specified number of runs, there is evidence to support &ldquo;Instant&rdquo; over &ldquo;Batch&rdquo;.
Programming Languages: A general purpose graphic language
Authors: H. E. Kulsrud
Venue: Communications of the ACM (1968)

Interactive use of computers with graphic terminals will permit many new problems to be solved using machines. In order to handle a variety of applications, it is expedient to develop a general purpose graphic language that is useful on a number of graphic devices. A system has been designed to produce such a language quickly and cheaply. A model graphic language which has been developed with the system is presented.
Pei matrix eigenvectors
Authors: A. C. R. Newbery
Venue: Communications of the ACM (1963)

M. L. Pei [Comm. ACM 5, 10 (Oct. 1962)] gave an explicit inverse for a matrix of the form M + &dgr;I, where M is an n-square matrix of ones and &dgr; is a nonzero parameter. The eigenvalues of the Pei matrix were given by W. S. LaSor [Comm. ACM 6, 3 (Mar. 1963)]. The eigenvectors may be obtained by considering the system (M+&dgrI)x = &lgr;x, the jth equation of which is S + &dgr;xj = &lgr;xj , (1) where S denotes &sum;ni=1 xi. On summing the equations for j = 1, 2, &middot;&middot;&middot; , n, we obtain nS + &dgr;S = &lgr;S. From this we conclude that (a) S = 0 or (b) &lgr; = n + &dgr;.
Estimating simple functions on the union of data streams
Authors: Phillip B. Gibbons, Srikanta Tirthapura
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

Massive data sets often arise as physically distributed, parallel data streams. We present algorithms for estimating simple functions on the union of such data streams, while using only logarithmic space per stream. Each processor observes only its own stream, and communicates with the other processors only after observing its entire stream. This models the set-up in current network monitoring products. Our algorithms employ a novel coordinated sampling technique to extract a sample of the union; this sample can be used to estimate aggregate functions on the union. The technique can also be used to estimate aggregate functions over the distinct &ldquo;labels&rdquo; in one or more data streams, e.g., to determine the zeroth frequency moment (i.e., the number of distinct labels) in one or more data streams. Our space and time bounds are the best known for these problems, and our logarithmic space bounds for coordinated sampling contrast with polynomial lower bounds for independent sampling. We relate our distributed streams model to previously studied non-distributed (i.e., merged) streams models, presenting tight bounds on the gap between the distributed and merged models for deterministic algorithms.
COM revisited: tool-assisted modelling of an architectural framework
Authors: Daniel Jackson, Kevin Sullivan
Venue: ACM SIGSOFT Software Engineering Notes (2000)

Designing architectural frameworks without the aid of formal modeling is error prone. But, unless supported by analysis, formal modeling is prone to its own class of errors, in which formal statements fail to match the designer's intent. A fully automatic analysis tool can rapidly expose such errors, and can make the process of constructing and refining a formal model more effective. This paper describes a case study in which we recast a model of Microsoft COM's query interface and aggregation mechanism into Alloy, a lightweight notation for describing structures. We used Alloy's analyzer to simulate the specification, to check properties and to evaluate changes. This allowed us to manipulate our model more quickly and with far greater confidence than would otherwise have been possible, resulting in a much simpler model and a better understanding of its key properties.
Focus: Security
Authors: Don Marti
Venue: Linux Journal (2000)

The time for security excuses is over.
Speech-to-Lip Movement Synthesis by Maximizing Audio-Visual Joint Probability Based on the EM Algorithm
Authors: Satoshi Nakamura, Eli Yamamoto
Venue: Journal of VLSI Signal Processing Systems (2001)

In this paper, we investigate a Hidden Markov Model (HMM)-based method to drive a lip movement sequence with input speech. In a previous study, we have already investigated a mapping method based on the Viterbi decoding algorithm which converts an input speech signal to a lip movement sequence through the most likely HMM state sequence using audio HMMs. However, the method can result in errors due to incorrectly decoded HMM states. This paper proposes a method to re-estimate visual parameters using HMMs of audio-visual joint probability using the Expectation-Maximization (EM) algorithm. In the experiments, the proposed mapping method results in a 26% error reduction when compared to the Viterbi-based algorithm at incorrectly decoded bilabial consonants.
The response of eye-movement and pupil size to audio instruction while viewing a moving target
Authors: Koji Takahashi, Minoru Nakayama, Yasutaka Shimizu
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

Eye movement reflects a viewer's visual information process. This study examines whether eye-movement responds to the viewer's cognitive load. It is already known that pupil size and blink can use as an indicator of mental workload. Saccades are rapid eye movements to turn a fovea to a focusing target. For this process, saccade was extracted to observe viewing process. The ocular-following task was conducted with audio-response task. The moving target was controlled at visual angle 3deg 5deg and 10deg. Audio response task required oral response. Experimental results showed that pupil size and blink rate increased with visual angle and audio response task. Both increased largest when the subject gave incorrect response in audio response task. Eye movement was also controlled by certain factors. Saccadic movement time increased with visual angle and it had negative correlation to blink time. This relationship was observed in larger visual angle, but despite of this negative correlation, saccadic movement time increased in incorrect response. Furthermore saccade length increased with the visual angle and decreased in incorrect response. The saccade is divided into miniature saccade appearing in gaze area, and larger saccade appearing between gazes. In incorrect response, saccade in following targets decreased and saccade inside gazing targets increased. It suggests that saccade occurrence changes not only in following targets but also inside gazing targets. The results of these experiments provide evidence that eye-movement can be an index of mental work-load.
Application of Partial-Order Methods to Reactive Programswith Event Memorization
Authors: Frédéric Herbreteau, Franck Cassez, Olivier Roux
Venue: Real-Time Systems (2001)

We are concerned in this paper with the verification of reactive systems with event memorization. The reactive systems are specified with an asynchronous reactive language Electre the main feature of which is the capability of memorizing occurrences of events in order to process them later. This memory capability is quite interesting for specifying reactive systems but leads to a verification model with a dramatically large number of states (due to the stored occurrences of events). In this paper, we show that partial-order methods can be applied successfuly for verification purposes on our model of reactive programs with event memorization. The main points of our work are two-fold: (1) we show that the independence relation which is a key point for applying partial-order methods can be extracted automatically from an Electre program; (2) the partial-order technique turns out to be very efficient and may lead to a drastic reduction in the number of states of the model as demonstrated by a real-life industrial case study.
Eye gaze patterns in conversations: there is more to conversational agents than meets the eyes
Authors: Roel Vertegaal, Robert Slagter, Gerrit van der Veer, Anton Nijholt
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

In multi-agent, multi-user environments, users as well as agents should have a means of establishing who is talking to whom. In this paper, we present an experiment aimed at evaluating whether gaze directional cues of users could be used for this purpose. Using an eye tracker, we measured subject gaze at the faces of conversational partners during four-person conversations. Results indicate that when someone is listening or speaking to individuals, there is indeed a high probability that the person looked at is the person listened (p=88%) or spoken to (p=77%). We conclude that gaze is an excellent predictor of conversational attention in multiparty conversations. As such, it may form a reliable source of input for conversational systems that need to establish whom the user is speaking or listening to. We implemented our findings in FRED, a multi-agent conversational system that uses eye input to gauge which agent the user is listening or speaking to.
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Authors: Lisa K. Fleischer
Venue: SIAM Journal on Discrete Mathematics (2000)

We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximum multicommodity flow that is independent of the number of commodities k, and our algorithm improves upon the run time of previous algorithms by this factor of k, running in ${{\cal O}^*(\epsilon^{-2}m^2)}$ time. For maximum concurrent flow and minimum cost concurrent flow, we present algorithms that are faster than the current known algorithms when the graph is sparse or the number of commodities k is large, i.e., k > m/n. Our algorithms build on the framework proposed by Garg and Könemann [Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, IEEE, New York, 1998, pp. 300--309]. They are simple, deterministic, and for the versions without costs, they are strongly polynomial. The approximation guarantees are obtained by comparison with dual feasible solutions found by our algorithm.Our maximum multicommodity flow algorithm extends to an approximation scheme for the maximum weighted multicommodity flow, which is faster than those implied by previous algorithms by a factor of k/log W, where W is the maximum weight of a commodity.
Using qualitative research software for CS education research
Authors: M. Dee Medley
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

Research in Computer Science education has become more and more important in recent years. Both quantitative and qualitative research methods yield interesting results, but most researchers in our field rely on software for only the quantitative methods. This paper describes one of several packages on the market that support qualitative research methods. These packages make qualitative research less unwieldy and provide the researcher with excellent tools for doing far more detailed analysis of the data than is possible by hand. The data for such analysis may come from a variety of sources including on-line or written tests, programming assignments, and exit interviews for assessment purposes. The results of qualitative research can produce a better understanding of the larger picture in the environment under study.
The choice of reference points in best-match file searching
Authors: Marvin Shapiro
Venue: Communications of the ACM (1977)

Improvements to the exhaustive search method of best-match file searching have previously been achieved by doing a preprocessing step involving the calculation of distances from a reference point. This paper discusses the proper choice of reference points and extends the previous algorithm to use more than one reference point. It is shown that reference points should be located outside of data clusters. The results of computer simulations are presented which show that large improvements can be achieved by the proper choice and location of multiple reference points.
On the Nonlinear Inexact Uzawa Algorithm for Saddle-Point Problems
Authors: Xiao-liang Cheng
Venue: SIAM Journal on Numerical Analysis (2000)

This paper discusses convergence behavior of the nonlinear inexact Uzawa algorithm for solving saddle-point problems presented in a recent paper of Bramble, Pasciak, and Vassilev ( SIAM J. Numer. Anal., 34 (1997), pp. 1072--1092). It is shown that this algorithm converges under a condition weaker than that stated in their paper.
Ninth OOPSLA workshop on behavioral semantics (poster session)
Authors: Haim Kilov, Kenneth Baclawski
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

The purpose of this workshop is improve the understanding and use of precise semantics in OO specifications and designs. The goal is to be a focal point that brings together theoreticians and practitioners to report their experience with making semantics precise, clear, concise and explicit in OO business specifications, business designs, and system specifications. Participants range from from academic researchers to industrial practitioners relating their &ldquo;war stories.&rdquo; The workshop continues the tradition of eight previous OOPSLA workshops.
Alternatives to splay trees with O(log n) worst-case access times
Authors: John Iacono
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

Splay trees are a self adjusting form of search tree that supports access operations in &Ogr;(log n) amortized time. Splay trees also have several amazing distribution sensitive properties, the strongest two of which are the working set theorem and the dynamic finger theorem. However, these two theorems are shown to poorly bound the performance of splay trees on some simple access sequences. The unified conjecture is presented, which subsumes the working set theorem and dynamic finger theorem, and accurately bounds the performance of splay trees over some classes of sequences where the existing theorems' bounds are not tight. While the unified conjecture for splay trees is unproven, a new data structure, the unified structure, is presented where the unified conjecture does hold. This structure also has a worst case of &Ogr;(log n) per operation, in contrast to the &Ogr;(n) worst case runtime of splay trees. A second data structure, the working set structure, is introduced. The working set structure has the same performance attributed to splay trees through the working set theorem, except the runtime is worst case per operation rather than amortized.
An algorithm for reduction of operator strength
Authors: John Cocke, Ken Kennedy
Venue: Communications of the ACM (1977)

A simple algorithm which uses an indexed temporary table to perform reduction of operator strength in strongly connected regions is presented. Several extensions, including linear function test replacement, are discussed. These algorithms should fit well into an integrated package of local optimization algorithms.
Information Subsystem of the Difference Between Anions Sum and Hardness of Water and Its Influence on Human Health
Authors: Nives Štambuk-Giljanović, Berezina Matoković, Drago Štambuk, Neven Elezović, Nilia Jelić
Venue: Journal of Medical Systems (2000)

Underground and surface waters in Dalmatia (Southern Croatia) have relatively preserved their natural characteristics since the greatest agglomeration of population and industry is located along the coast. The danger of pollution with fecal microorganism and products of biological decomposition is the most immediate problem but can be efficiently eliminated by water chlorination. The ecological need to sum up the work on water quality examination and estimation of future water quality trends resulted in water quality monitoring, i.e. in human health monitoring. It is necessary for large number of analytical and ecological health data to organize them from the informatical aspect into databases, the relational database for chemical analysis studying (the difference between anions sum and hardness) as methodological base for studying the ecological factors that influence human health defined in this paper. Results used for the prototype implementation subsystem of the chemical water analysis control are based on the investigations of Water Examination Department of the Public Health Institute of the Split-Dalmatian County (Croatia). Over 3400 data are comprised what is the sufficient examination sample. The software used included Win '95, Mo '97, and Paradox 4,5, while the hardware used included Pentium II 300 MHz, floppy, 128 MB RAM HDD 4,3 GB, CD &times; 24, HP DeskJet 710C.
The soft heap: an approximate priority queue with optimal error rate
Authors: Bernard Chazelle
Venue: Journal of the ACM (JACM) (2000)

A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat the logarithmic bound on the complexity of a heap in a comparison-based model. To break this information-theoretic barrier, the entropy of the data structure is reduced by artifically raising the values of certain keys. Given any mixed sequence of n operations, a soft heap with error rate &egr; (for any 0 < &egr; &le; 1/2) ensures that, at any time, at most &egr;n of its items have their keys raised. The amortized complexity of each operation is constant, except for insert, which takes 0(log 1/&egr;)time. The soft heap is optimal for any value of &egr; in a comparison-based model. The data structure is purely pointer-based. No arrays are move items across the data structure not individually, as is customary, but in groups, in a data-structuring equivalent of &ldquo;car pooling.&rdquo; Keys must be raised as a result, in order to preserve the heap ordering of the data structure. The soft heap can be used to compute exact or approximate medians and percentiles optimally. It is also useful for approximate sorting and for computing minimum spanning trees of general graphs.
TCP checksum function design
Authors: William W. Plummer
Venue: ACM SIGCOMM Computer Communication Review (1989)

Checksums are included in packets in order that errors encountered during transmission may be detected. For Internet protocols such as TCP [1,9] this is especially important because packets may have to cross wireless networks such as the Packet Radio Network [2] and Atlantic Satellite Network [3] where packets may be corrupted. Internet protocols (e.g., those for real time speech transmission) can tolerate a certain level of transmission errors and forward error correction techniques or possibly no checksum at all might be better. The focus in this paper is on checksum functions for protocols such as TCP where the required reliable delivery is achieved by retransmission.
An experimental study of priority queues in external memory
Authors: Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer
Venue: Journal of Experimental Algorithmics (JEA) (2000)

In this paper we compare the performance of eight different priority queue implementations: four of them are explicitly designed to work in an external-memory setting, the others are standard internal-memory queues available in the LEDA library [Mehlhorn and Näher 1999]. Two of the external-memory priority queues are obtained by engineering known internal-memory priority queues with the aim of achieving effective performance on external storage devices (i.e., Radix heaps [Ahuja et al. 1990] and array heaps [Thorup 1996]). Our experimental framework includes some simple tests, like random sequences of insert or delete-minimum operations, as well as more advanced tests consisting of intermixed sequences of update operations and "application driven" update sequences originated by simulations of Dijkstra's algorithm on large graph instances. Our variegate spectrum of experimental results gives a good picture of the features of these priority queues, thus being helpful to anyone interested in the use of such data structures on very large data sets.