ppxscal/embedding_network huggingface dataset:
Highly personalized information delivery to mobile clients
Authors: Bahattin Ozen, Ozgur Kilic, Mehmet Altinel, Asuman Dogac
Venue: Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access (2001)

The inherent limitations of mobile devices necessitate information to be delivered to mobile clients to be highly personalized according to their profiles. This information may be coming from a variety of resources like Web servers, company intranets, email servers. A critical issue for such systems is scalability, that is, the performance of the system should be in acceptable limits when the number of users increases dramatically. Another important issue is being able to express highly personalized information in the user profiles which requires a querying power as that of SQL on relational databases. Finally, the results should be customized according to user needs and preferences. Since the queries will be executed on the documents fetched over the Internet, it is natural to expect the documents to be XML documents. This paper describes an architecture for mobile network operators to deliver highly personalized information from XML resources to mobile clients. To achieve high scalability in this architecture, we index the user profiles rather than the documents because of the excessively large number of profiles expected in the system. In this way all queries that apply to a document at a given time are executed in parallel through a finite state machine (FSM) approach while parsing the document. Furthermore the queries that have the same FSM representation are grouped and only one finite state machine is created for each group which contributes to the excellent performance of the system as demonstrated in the performance evaluation section. To provide for user friendliness and expressive power, we have developed a graphical user interface that translates the user profiles into XML-QL. XML-QL's querying power and its elaborate CONSTRUCT statement allow the format of the results to be specified. The results to be pushed to the mobile clients are converted to Wireless Markup Language (WML) by the delivery component of the system.
On Characterizations of P- and P0-Properties in Nonsmooth Functions
Authors: Yoon Song, M. Seetharama Gowda, G. Ravindran
Venue: Mathematics of Operations Research (2000)

For a FrÃ©chet differentiable functionf from a closed rectangleQ inR nintoR n , a result of Gale and Nikaido essentially asserts thatf is aP-function onQ if the Jacobian matrixJf( x) is aP-matrix for allx?Q, and a result of MorÃ© and Rheinboldt asserts thatf is aP0-function onQ if and only ifJf( x) is aP0-matrix for allx?Q. In this article, we generalize these results to nonsmooth functions that admitH-differentials. Specialized to a locally Lipschitzian functionf fromR ninto itself, our results say thatf is aP-function if the (Clarke) generalized Jacobian?f( x) consists ofP-matrices at allx, and whenf is semismooth,f is aP0-function if and only if the Bouligand differential? Bf( x) consists ofP0-matrices at allx.
Statistical Models of Object Interaction
Authors: R. J. Morris, D. C. Hogg
Venue: International Journal of Computer Vision (2000)

We present a method for assessing the likelihood of a trajectory of an object through a scene consisting of a number of other objects. The closest points on the trajectory to the other objects are chosen as landmark points and at each landmark we calculate the probability of the interaction based on the speed and distance. Sequences of such probabilities are then sorted in increasing order. Finally a weighted sum of the first few elements in this weighted list is used to classify trajectories in a supervised learning framework.
Pattern Noise in the Frequency &Delta;&Sigma; Modulator
Authors: Mats E. HØvin, Dag T. Wisland, Jan T. Marienborg, Tor S. Lande, Yngvar Berg
Venue: Analog Integrated Circuits and Signal Processing (2001)

In this paper, we show that the first-order frequency delta&ndash;sigma modulator is equivalent to a traditional delta&ndash;sigma modulator with respect to pattern noise. We further propose two techniques for reducing the effect of pattern noise. The first technique is based on time-domain dithering which is implemented by adding white phase noise to the FM signal. The second technique is based on locating the narrow dynamic range that may be in this kind of modulators, in a pattern noise valley. This technique can utilize pattern noise to make the modulator provide significantly higher digital resolution than the white quantization noise model predicts. Finally, the theory is verified by measurements.
Doom as an interface for process management
Authors: Dennis Chao
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

This paper explores a novel interface to a system administration task. Instead of creating an interface de novo for the task, the author modified a popular computer game, Doom, to perform useful work. The game was chosen for its appeal to the target audience of system administrators. The implementation described is not a mature application, but it illustrates important points about user interfaces and our relationship with computers. The applications relies on a computer game vernacular rather than the simulations of physical reality found in typical navigable virtual environments. Using a computer game vocabulary may broaden an application's audience by providing sn intuitive environment for children and non-technical users. In addition, the application highlights the adversarial relationships that exist in a computer and suggests a new resource allocation scheme.
A note on the complement of inherently ambiguous context-free languages
Authors: Herman A. Maurer
Venue: Communications of the ACM (1970)

Definitions and notation used in this note are as in [1]. In particaular, language means context-free language throughout.
Measuring the effectiveness of various design validation approaches for PowerPCTM microprocessor arrays
Authors: L.-C. Wang, M. S. Abadir, J. Zeng
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Although several methods for array design validation have been proposed and had great success in the past, little evidence has been reported for the effectiveness of these methods with respect to the detection of design errors. In this paper, we propose a new way of measuring the effectiveness of different validation approaches based on automatic design error injection and simulation. This technique provides a systematic way for the evaluation of the quality of various validation approaches. Experimental results using different validation approaches on recent PowerPC microprocessor arrays will be reported.
LG: a language for analytic geometry
Authors: J. Raymond
Venue: Communications of the ACM (1976)

A conversational programming language for analytic geometry is described, together with some aspects of its implementation. The language allows the flexible definition of geometric objects and elements, computes their parameters, and displays the results. It also provides the capability of specifying a geometric figure via a collection of parameters and displaying various loci corresponding to these parameters. A third characteristic consists of the possibility of using this language to design other user oriented languages. LG has been specifically designed for use by nonprogrammers; it is easy to learn and very close to the natural language used in geometry.
Modeling user preferences via theory refinement
Authors: Ben Geisler, Vu Ha, Peter Haddawy
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

We present an approach to elicitation of user preference models in which assumptions can be used to guide but not constrain the elicitation process. We show how to encode assumptions concerning preferential independence and monotonicity in a Knowledge-Based Artificial Neural Network. We quantify the degree to which user preferences violate a set of assumptions. We empirically compare the KBANN network with an unbiased ANN in terms of learning rate and accuracy for preferences consistent and inconsistent with the assumptions. We go on to demonstrate how the technique can be used to learn a fine-grained preference structure from simple binary classification data.
SmartWatch: an automated video event finder
Authors: Serhan Dagtas, Tom McGee, Mohamed Adel-Mottaleb
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

In this paper, we present an automated video event detection system that combines textual an aural analysis techniques.
A framework for sparse matrix code synthesis from high-level specifications
Authors: Nawaaz Ahmed, Nikolay Mateev, Keshav Pingali
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

We present compiler technology for synthesizing sparse matrix code from (i) dense matrix code, and (ii) a description of the index structure of a sparse matrix. Our approach is to embed statement instances into a Cartesian product of statement iteration and data spaces, and to produce efficient sparse code by identifying common enumerations for multiple references to sparse matrices. The approach works for imperfectly-nested codes with dependences, and produces sparse code competitive with hand-written library code for the Basic Linear Algebra Subroutines (BLAS).
How mathematical thinking enchances computer science problem solving
Authors: David Gries, Bill Marion, Peter Henderson, Diane Schwartz
Venue: ACM SIGCSE Bulletin (2001)

There are deep connections between algorithmic and mathematical thinking. Both construct "systems" --- computing systems in the algorithmic case, intellectual ones in mathematics --- from simple primitives. As Knuth notes in the preface to The Art of Computer Programming, "The construction of a computer program from a set of basic instructions is very similar to the construction of a mathematical proof from a set of axioms" [1]. Other connections include similar ways of organizing primitives into larger structures (e.g., recursion in algorithms, recursion and induction in math; conditionals in algorithms, definition in cases and proof by cases in math), similar ways of using abstraction to manage complexity, and an underlying reliance on logic. In short, mathematics is not merely a tool for limited areas of computer science, it is a mindset that fundamentally improves one's ability to devise and implement algorithms. Computer science students therefore need to exercise their mathematical as well as their computational abilities, and computer science educators need to help students use both ways of thinking to solve computing problems.This panel illustrates specific ways in which mathematical reasoning enhances algorithmic problem solving, and provides educators with concrete examples and resources to use in their own teaching. Each panelist will present an exercise, classroom example, or similar item, from their own experience, and will demonstrate ways in which mathematical reasoning helps one solve and/or understand it. The audience will be invited to contribute their own examples and to comment further on the role of mathematical thinking in computer science problem solving.The panelists' and audience members' examples will be collected on a Web page for continuing reference. A prototype of this page is at http://www.cs.geneseo.edu/~baldwin/math-thinking/examples.html.
Exact analysis of the cache behavior of nested loops
Authors: Siddhartha Chatterjee, Erin Parker, Philip J. Hanlon, Alvin R. Lebeck
Venue: ACM SIGPLAN Notices (2001)

We develop from first principles an exact model of the behavior of loop nests executing in a memory hicrarchy, by using a nontraditional classification of misses that has the key property of composability. We use Presburger formulas to express various kinds of misses as well as the state of the cache at the end of the loop nest. We use existing tools to simplify these formulas and to count cache misses. The model is powerful enough to handle imperfect loop nests and various flavors of non-linear array layouts based on bit interleaving of array indices. We also indicate how to handle modest levels of associativity, and how to perform limited symbolic analysis of cache behavior. The complexity of the formulas relates to the static structure of the loop nest rather than to its dynamic trip count, allowing our model to gain efficiency in counting cache misses by exploiting repetitive patterns of cache behavior. Validation against cache simulation confirms the exactness of our formulation. Our method can serve as the basis for a static performance predictor to guide program and data transformations to improve performance.
&ldquo;Structural connections&rdquo; in formal languages
Authors: E. T. Irons
Venue: Communications of the ACM (1964)

This paper defines the concept of &ldquo;structural connection&rdquo; in a mechanical language in an attempt to classify various formal languages according to the complexity of parsing structures on strings in the languages. Languages discussed vary in complexity from those with essentially no structure at all to languages which are self-defining. The relationship between some existing recognition techniques for several language classes is examined, as well as implications of language structure on the complexity of automatic recognizers.
Teaching &ldquo;about programming&rdquo;
Authors: Robert F. Rosin
Venue: Communications of the ACM (1973)

This paper presents the goals and organization of a course about programming designed to provide entering students in a graduate program with a cultural enrichment in their professional lives. The students are expected to have taken at least two programming courses prior to this one and, therefore, to be familiar with at least two programming languages, both as students and users. Teaching someone how to program is similar to teaching him to play a musical instrument: neither skill can be taught&mdash;they must be learned. However, the teacher still serves several vital purposes: to present a set of rules for producing well-formed utterances; to offer numerous demonstrations of his own skill; and to function as an involved critic. Finally, the teacher is the source of information about the process in which the student is involved.
Technical Note: Naive Bayes for Regression
Authors: Eibe Frank, Leonard Trigg, Geoffrey Holmes, Ian H. Witten
Venue: Machine Learning (2000)

Despite its simplicity, the naive Bayes learning scheme performs well on most classification tasks, and is often significantly more accurate than more sophisticated methods. Although the probability estimates that it produces can be inaccurate, it often assigns maximum probability to the correct class. This suggests that its good performance might be restricted to situations where the output is categorical. It is therefore interesting to see how it performs in domains where the predicted value is numeric, because in this case, predictions are more sensitive to inaccurate probability estimates.This paper shows how to apply the naive Bayes methodology to numeric prediction (i.e., regression) tasks by modeling the probability distribution of the target value with kernel density estimators, and compares it to linear regression, locally weighted linear regression, and a method that produces &ldquo;model trees&rdquo;&mdash;decision trees with linear regression functions at the leaves. Although we exhibit an artificial dataset for which naive Bayes is the method of choice, on real-world datasets it is almost uniformly worse than locally weighted linear regression and model trees. The comparison with linear regression depends on the error measure: for one measure naive Bayes performs similarly, while for another it is worse. We also show that standard naive Bayes applied to regression problems by discretizing the target value performs similarly badly. We then present empirical evidence that isolates naive Bayes' independence assumption as the culprit for its poor performance in the regression setting. These results indicate that the simplistic statistical assumption that naive Bayes makes is indeed more restrictive for regression than for classification.
A New Neuro-Fuzzy Classifier with Application to On-Line Face Detection and Recognition
Authors: J. S. Taur, C. W. Tao
Venue: Journal of VLSI Signal Processing Systems (2000)

In this paper, we propose a neuro-fuzzy classifier (NEFCAR) that utilizes positive and negative rules with different rule importances to create the decision boundaries between different classes. The locally unsupervised and globally supervised training technique is adopted. The decision-based and approximation-based strategies are combined to provide a suitable amount of training for each training pattern. The reinforced and anti-reinforced learning rules are given with different weighting so that the training can be efficient and can reach convergence quickly. Moreover, NEFCAR can easily provide the confidence measure of each classification decision. Therefore, the rejection algorithm can be implemented in a straightforward manner. Noise tolerant training is conducted to improve the generalization performance and the confidence measure is adopted to avoid overtraining. The proposed classifier is applied to two applications. The first one is the Fisher iris data classification, and the second one is an on-line face detection and recognition application. Good classification results are obtained in both applications. In the on-line face detection and recognition system, two NEFCAR's are utilized: a two-class and a multi-class NEFCAR's are adopted to detect the face and recognize the face, respectively. The color of skin and the motion information are taken into consideration heuristically to improve the effectiveness of the face location algorithm.
Rethinking Project Selection at the Monterey Bay Aquarium
Authors: James C. Felli, Randall E. Kochevar, Bruce R. Gritton
Venue: Interfaces (2000)

In 1995, the Monterey Bay Aquarium started an experimental business unit called Electronic Outreach. Electronic Outreach's mission was to employ emerging technologies to deliver the aquarium's messages of ocean stewardship to diverse and scattered audiences. Faced with many projects from which to choose, the Electronic Outreach team wanted to determine which projects were most likely to succeed before they actually had to dedicate resources to development. We constructed two models to help them accomplish this: a multiattribute-value model to quantify a project's alignment with the aquarium's mission and a discounted-cash-flow model to quantify a project's viability as a business venture. We then combined the outputs of these two models into a two-dimensional framework to allow the Electronic Outreach team members to focus on monetary-nonmonetary trade-offs when evaluating potential projects.
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
Authors: David Liben-Nowell
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of genes within chromosomes. The problem of computing this distance is NP-complete. In this paper, we give an &Ogr;(2&Ogr;(n log n)) algorithm to exactly compute the syntenic distance between two genomes that contain at most n chromosomes. Our algorithm requires &Ogr;(2&Ogr;(d log d)) time when this distance is d, improving the &Ogr;(2&Ogr;(d2)) running time of the beat previous exact algorithm. Our result is based upon a tight connection between syntenic distance and a novel generalization of the classical gossip problem. We define the incomplete gossip problem, in which there are n gossipers who each have a unique piece of initial information. They communicate by phone calls in which the participants exchange all their information, and the goal is to minimize the total number of phone calls necessary to inform each gossiper of his set of relevant gossip which he desires to learn.
Recognizing and supporting roles in CSCW
Authors: Mark Guzdial, Jochen Rick, Bolot Kerimbaev
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

In this paper, we describe our experience with the long-term, widespread use of CoWeb, an asynchronous collaborative tool that is mostly used to complement existing face-to-face groups (such as classes). The CoWeb is an openended tool that does not enforce or explicitly support specific roles or usage, yet several well-defined uses and roles have emerged over time. In our design methodology, we recognize these roles and refine our collaboration environment to better support them.
New Systolic Arrays for C + AB2, Inversion, and Division in GF(2m)
Authors: Chin-Liang Wang, Jyh-Huei Guo
Venue: IEEE Transactions on Computers (2000)

In this paper, we present a new parallel-in parallel-out systolic array with unidirectional data flow for performing the power-sum operation C + AB2 in finite fields GF(2m). The architecture employs the standard basis representation and can provide the maximum throughput in the sense of producing new results at a rate of one per clock cycle. It is highly regular, modular, and, thus, well-suited to VLSI implementation. As compared to a previous systolic power-sum circuit with bidirectional data flow and the same throughput performance, the proposed one has smaller latency, consumes less chip area, and can more easily incorporate fault-tolerant design. Based on the new power-sum circuit, we also propose a parallel-in parallel-out systolic array with the maximum throughput for computing inverses/divisions in GF(2m). The proposed systolic divider gains advantages over an existing system with the same throughput performance in terms of chip area, latency, and fault tolerance.
Test data as an aid in proving program correctness
Authors: Matthew Geller
Venue: Communications of the ACM (1978)

Proofs of program correctness tend to be long and tedious, whereas testing, though useful in detecting errors, usually does not guarantee correctness. This paper introduces a technique whereby test data can be used in proving program correctness. In addition to simplifying the process of providing correctness, this method simplifies the process of providing accurate specification for a program. The applicability of this technique to procedures and recursive programs is demonstrated.
Composing features and resolving interactions
Authors: Jonathan D. Hay, Joanne M. Atlee
Venue: ACM SIGSOFT Software Engineering Notes (2000)

One of the accepted techniques for developing and maintaining feature-rich applications is to treat each feature as a separate concern. However, most features are not separate concerns because they override and extend the same basic service. That is, &ldquo;independent&rdquo; features are coupled to one another through the system's basic service. As a result, seemingly unrelated features subtly interfere with each other when trying to override the system behaviour in different directions. The problem is how to coordinate features' access to the service's shared variables. This paper proposes coordinating features via feature composition. We model each feature as a separate labelled-transition system and define a 1conflict-free (CF) composition operator that prevents enabled transitions from synchronizing if they interact: if several features' transitions are simultaneously enabled but have conflicting actions, a non-conflicting subset of the enabled transitions are synchronized in the composition. We also define a conflict- and violation-free (CVF) composition operator that prevents enabled transitions from executing if they violate features' invariants. Both composition operators use priorities among features to decide whether to synchronize transitions.