ppxscal/embedding_network huggingface dataset:
The PNA project
Authors: John Beidler, Albert Insogna, Nicholas Cappobianco, Yaodong Bi, Marianne Borja
Venue: Journal of Computing Sciences in Colleges (2001)

The Personal Nutrition Assistant (PNA) Project is a join effort involving faculty and students from two universities. The project was initially funded with a seed grant that supported cooperative efforts between these institutions. The goal of the PNA Project was the creation of a working prototype of a web-based system that assisted individuals in performing a nutritional analysis of their daily diet and made the results available via the web to their health care professionals. Further, we wanted the data entry to be easy and quick. We had providing a system that helped clients performing daily diet data entry and analysis in about 15 to 20 minutes. As stated above, the system produced through the initial grant was a working prototype, a system that demonstrated the feasibility of the approach. Further, since the daily diets are stored on the web the results could be viewed by the clients' dietician or health care provider, providing much greater feedback from the clients to the health care professional than is normally achieved. The initial system was so successful that nine local medical centers started using the working prototype with their patients. The system will form the basis of Senior Projects starting in the 2000-2001 academic year, and is expected to support additional projects in the years to come. This paper reports on the first projects, which were designed to upgrade this system from working prototype status to production level.
Generating virtual camera compositions
Authors: William Bares, Byungwoo Kim
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

This paper describes work in progress to automatically generate camera shots featuring the composition techniques of expert photographers. This effort builds upon an automated camera planner that computes a shot satisfying a given set of constraints. In this prior work, users manually specify the set of constraints and the numeric parameters for each. A typical two subject shot can be described by eleven constraints involving sixty numeric parameters. This work aims to develop a high-level interface to automatically generate such constraint sets. Photographic composition techniques such as composition in depth can be realized by automatically constructing appropriate sets of camera constraints then submitting them to a constraint solver.
An open source laboratory for operating systems projects
Authors: Mark Claypool, David Finkel, Craig Wills
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

Typical undergraduate operating systems projects use services provided by an operating system via system calls or develop code in a simulated operating system. With the increasing popularity of operating systems with open source code such as Linux, there are untapped possibilities for operating systems projects to modify real operating system code. We present the hardware and software configuration of an open source laboratory that promises to provide students that use it with a better understanding of operating system internals than is typically gained in a traditional operating systems course. Our preliminary projects and evaluation suggest that thus far the lab has achieved its primary goal in that students that used the lab feel more knowledgeable in operating systems and more confident in their ability to write and modify operating system code.
Implementing an e-commerce curriculum in a CIS program
Authors: Rahul Tikekar, Daniel Wilson
Venue: Journal of Computing Sciences in Colleges (2001)

In this paper we describe the development of an e-commerce curriculum in the CIS program at Southern Oregon University. The e-commerce curriculum is incorporated through a set of two courses. The first is a client-server programming course that introduces the structure of the web along with client and server side scripting techniques. The second is a corporate web development course, which builds on the earlier course by introducing elements of e-commerce technology such as security and encryption, electronic payment systems, agents and XML.
Feedback coupled resource allocation policies in the multiprogramming-multiprocessor computer system
Authors: Richard S. Brice, J. C. Browne
Venue: Communications of the ACM (1978)

Model studies of some integrated, feedback-driven scheduling systems for multiprogrammed-multiprocessor computer systems are presented. The basic control variables used are the data-flow rates for the processes executing on the CPU. The model systems feature simulated continuous-flow and preempt-resume scheduling of input-output activity. Attention is given to the amount of memory resource required for effective processing of the I/O activity (buffer space assignment). The model studies used both distribution-driven and trace-driven techniques. Even relatively simple dynamic schedulers are shown to improve system performance (as measured by user CPU time) over that given by optimal or near-optimal static schedulers imbedded in identical system structures and workload environments. The improvement is greatest under a heavy I/O demand workload.
CONVERT
Authors: Adolfo Guzmán, Harold V. McIntosh
Venue: Communications of the ACM (1966)

A programming language is described which is applicable to problems conveniently described by transformation rules. By this is meant that patterns may be prescribed, each being associated with a skeleton, so that a series of such pairs may be searched until a pattern is found which matches an expression to be transformed. The conditions for a match are governed by a code which also allows subexpressions to be identified and eventually substituted into the corresponding skeleton. The primitive patterns and primitive skeletons are described, as well as the principles which allow their elaboration into more complicated patterns and skeletons. The advantages of the language are that it allows one to apply transformation rules to lists and arrays as easily as strings, that both patterns and skeletons may be defined recursively, and that as a consequence programs may be stated quite concisely.
Casper: a compiler for the analysis of security protocols
Authors: Gavin Lowe
Venue: Journal of Computer Security (1998)

In recent years, a method for analyzing security protocols using the process algebra CSP (Hoare, 1985) and its model checker FDR (Roscoe, 1994) has been developed. This technique has proved remarkably successful, and has been used to discover a number of attacks upon protocols. However, the technique has required producing a CSP description of the protocol by hand semi; this has proved tedious and error-prone. In this paper we describe Casper, a program that automatically produces the CSP description from a more abstract description, thus greatly simplifying the modelling and analysis process.
Data cache sizing for embedded processor applications
Authors: P. R. Panda, N. D. Dutt, A. Nicolau
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

We present a technique for determining the best data cache size required for a given memory-intensive application. A careful memory and cache line assignment strategy based on the analysis of the array access patterns effects a significant reduction in the required data cache size, with no negative impact on the performance, thereby freeing vital on-chip silicon area for other hardware resources. Experiments on several benchmark kernels performed on LSI Logic's CW4001 embedded processor simulator confirm the soundness of our cache sizing and memory assignment strategy and the accuracy of our analytical predictions.
Why students reject engineering teaching careers
Authors: John W. Geils
Venue: Communications of the ACM (1984)

Many of the country's brightest engineering students have been passing up graduate school for the challenge and high salaries of industry. This is drying up the supply of new Ph.D.s interested in teaching at a time when U.S. engineering schools are struggling to cope with swelling enrollments and a severe faculty shortage.
Operators
Authors: Kenneth E. Iverson
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1979)

Although operators, which apply to functions to produce functions, prove very useful in mathematics, they are absent from most programming languages. This paper illustrates their simplicity and power in terms of the operators of APL, and examines related constructs in other programming languages.
RSA cryptosystem design based on the Chinese remainder theorem
Authors: Chung-Hsien Wu
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, we present the design and implementation of a systolic RSA cryptosystem based on a modified Montgomery's algorithm and the Chinese Remainder Theorem (CRT) technique. The CRT technique improves the throughput rate up to 4 times in the best case. The processing unit of the systolic array has 100% utilization because of the proposed block interleaving technique for multiplication and square operations in the modular exponentiation algorithm. For 512-bit inputs, the number of clock cycles needed for a modular exponentiation is about 0.13M to 0.24M. The critical path delay is 6.13ns using a 0.6um CMOS technology. With a 150 MHz clock, we can achieve an encryption/decryption rate of about 328 to 578 Kb/s.
A start on automatic storage assignment
Authors: Robert L. Patrick
Venue: Communications of the ACM (1960)

This technique outlines a method whereby equation sets can be ordered in computational order and checked for compatibility. The technique also allows one to note what equations can be computed in parallel (provided one has parallel arithmetic capabilities) or can be considered a logical entity, i.e., segment. Furthermore, the technique will assist one to intelligently allocate high-speed memory (HSM) so that memory is reassigned to other duties as soon as its present duties are fulfilled. Last, the technique appears to be simple and fast to implement.
Software Development for Medical Instrumentation
Authors: Nihal Fatma Güler
Venue: Journal of Medical Systems (2001)

Computer-assisted medical instrumentation has recently become more common. For accuracy and precision, the computer and interfacing circuit with the associated digital signal processing algorithm can be used for the evaluation of biological signal. The measurement system based on this structure has a very high degree of efficieny and flexibility because different algorithms can be used. In addition, the system can employ some newly developed software packages. This paper will submit a procedure for computer-assisted medical instrumentation, and also will show a specific application on blood flow.
Perpetual consistency improves image retrieval performance
Authors: Huizhong Long, Wee Kheng Leow
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

An ideal retrieval system should retrieve images that satisfy the user's need, and should, therefore, measure image similarity in a manner consistent with human's perception. However, existing computational similarity measures are not perceptually consistent. This paper proposes an approach of improving retrieval performance by improving the perceptual consistency of computational similarity measures for textures based on relevance feedback judgments.
A Probabilistic Exclusion Principle for Tracking Multiple Objects
Authors: John MacCormick, Andrew Blake
Venue: International Journal of Computer Vision (2000)

Tracking multiple targets is a challenging problem, especially when the targets are &ldquo;identical&rdquo;, in the sense that the same model is used to describe each target. In this case, simply instantiating several independent 1-body trackers is not an adequate solution, because the independent trackers tend to coalesce onto the best-fitting target. This paper presents an observation density for tracking which solves this problem by exhibiting a probabilistic exclusion principle. Exclusion arises naturally from a systematic derivation of the observation density, without relying on heuristics. Another important contribution of the paper is the presentation of partitioned sampling, a new sampling method for multiple object tracking. Partitioned sampling avoids the high computational load associated with fully coupled trackers, while retaining the desirable properties of coupling.
Giving meanings to WWW images
Authors: Heng Tao Shen, Beng Chin Ooi, Kian-Lee Tan
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

Images are increasingly being embedded in HTML documents on the WWW. Such documents over the WWW essentially provides a rich source of image collection from which user can query. Interestingly, the semantics of these images are typically described by their surrounding text. Unfortunately, most WWW image search engines fail to exploit these image semantics and give rise to poor recall and precision performance. In this paper, we propose a novel image representation model called Weight ChainNet. Weight ChainNet is based on lexical chain that represents the semantics of an image from its nearby text. A new formula, called list space model, for computing semantic similarities is also introduced. To further improve the retrieval effectiveness, we also propose two relevance feedback mechanisms. We conducted an extensive performance study on a collection of 5000 images obtained from documents identified by more than 2000 URLs. Our results show that our models and methods outperform existing technique. Moreover, the relevant feedback mechanisms can lead to significantly better retrieval effectiveness.
Temporal Granularity: Completing the Puzzle
Authors: Iqbal A. Goralwalla, Yuri Leontiev, M. Tamer Özsu, Duane Szafron, Carlo Combi
Venue: Journal of Intelligent Information Systems (2001)

Granularity is an integral feature of both anchored (e.g., 25 October 1995, July 1996) and unanchored (e.g., 3 minutes, 6 hours 20 minutes, 5 days) temporal data. In supporting temporal data that is specified in different granularities, numerous approaches have been proposed to deal with the issues of converting temporal data from one granularity to another. The emphasis, however, has only been on granularity conversions with respect to anchored temporal data. In this paper we provide a novel approach to the treatment of granularity in temporal data. A granularity is modeled as a special kind of unanchored temporal primitive that can be used as a unit of time. That is, a granularity is modeled as a unit unanchored temporal primitive. We show how unanchored temporal data is represented, give procedures for converting the data to a given granularity, provide canonical forms for the data, and describe how operations between the data are performed. We also show how anchored temporal data is represented at different granularities and give the semantics of operations on anchored temporal data.
Identification of host audit data to detect attacks on low-level IP vulnerabilities
Authors: Thomas E. Daniels, Eugene H. Spafford
Venue: Journal of Computer Security (1999)

Conventional host-based and network-based intrusion and misuse detection systems have concentrated on detecting network-based and internal attacks, but little work has addressed host-based detection of low-level network attacks. A major reason for this is the misuse detection systems dependence on audit data and the absence of low-level network data in audit trails. This work defines low-level IP vulnerabilities and distinguishes between low-level IP and IP-based vulnerabilities. Furthermore, we analyze a number of different low-level IP attacks and the vulnerabilities that they exploit. We develop attack signatures for each attack, and based upon our analysis, we determine a baseline collection of information needed to detect the attacks. We suggest locations within protocol stacks where the needed data can be collected. Finally, we generalize from the baseline audit data to try to predict audit content suitable not only for detecting these attacks, but possible future ones.
Reduction: a method of proving properties of parallel programs
Authors: Richard J. Lipton
Venue: Communications of the ACM (1975)

When proving that a parallel program has a given property it is often convenient to assume that a statement is indivisible, i.e. that the statement cannot be interleaved with the rest of the program. Here sufficient conditions are obtained to show that the assumption that a statement is indivisible can be relaxed and still preserve properties such as halting. Thus correctness proofs of a parallel system can often be greatly simplified.
Robust Plane Sweep for Intersecting Segments
Authors: Jean-Daniel Boissonnat, Franco P. Preparata
Venue: SIAM Journal on Computing (2000)

In this paper, we reexamine in the framework of robust computation the Bentley--Ottmann algorithm for reporting intersecting pairs of segments in the plane. This algorithm has been reported as being very sensitive to numerical errors. Indeed, a simple analysis reveals that it involves predicates of degree 5, presumably never evaluated exactly in most implementations. Within the exact-computation paradigm we introduce two models of computation aimed at replacing the conventional model of real-number arithmetic. The first model (predicate arithmetic) assumes the exact evaluation of the signs of algebraic expressions of some degree, and the second model (exact arithmetic) assumes the exact computation of the value of such (bounded-degree) expressions. We identify the characteristic geometric property enabling the correct report of all intersections by plane sweeps. Verification of this property involves only predicates of (optimal) degree 2, but its straightforward implementation appears highly inefficient. We then present algorithmic variants that have low degree under these models and achieve the same performance as the original Bentley--Ottmann algorithm. The technique is applicable to a more general case of curved segments.
A Computational Method for Segmenting Topological Point-Sets and Application to Image Analysis
Authors: Stiliyan N. Kalitzin, Joes Staal, Bart M. ter Haar Romeny, Max A. Viergever
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

We propose a new computational method for segmenting topological subdimensional point-sets in scalar images of arbitrary spatial dimensions. The technique is based on calculating the homotopy class defined by the gradient vector in a subdimensional neighborhood around every image point. This neighborhood is defined as the linear envelope spawned over a given subdimensional vector frame. In the simplest case where the rank of this frame is maximal, we obtain a technique for localizing the critical points, i.e., extrema and saddle points. We consider, in particular, the important case of frames formed by an arbitrary number of the first largest by absolute value principal directions of the Hessian. The method then segments positive and and negative ridges as well as other types of critical surfaces of different dimensionalities. The signs of the eigenvalues associated to the principal directions provide a natural labeling of the critical subsets. The result, in general, is a constructive definition of a hierarchy of point-sets of different dimensionalities linked by inclusion relations. Because of its explicit computational nature, the method gives a fast way to segment height ridges or edges in different applications. The defined topological point-sets are connected manifolds and, therefore, our method provides a tool for geometrical grouping using only local measurements. We have demonstrated the grouping properties of our construction by presenting two different cases where an extra image coordinate is introduced. In one of the examples, we considered the image analysis in the framework of the linear scale-space concept, where the topological properties are gradually simplified through the scale parameter. This scale parameter can be taken as an additional coordinate. In the second example, a local orientation parameter was used for grouping and segmenting elongated structures.
Improving query translation for cross-language information retrieval using statistical models
Authors: Jianfeng Gao, Jian-Yun Nie, Endong Xun, Jian Zhang, Ming Zhou, Changning Huang
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Dictionaries have often been used for query translation in cross-language information retrieval (CLIR). However, we are faced with the problem of translation ambiguity, i.e. multiple translations are stored in a dictionary for a word. In addition, a word-by-word query translation is not precise enough. In this paper, we explore several methods to improve the previous dictionary-based query translation. First, as many as possible, noun phrases are recognized and translated as a whole by using statistical models and phrase translation patterns. Second, the best word translations are selected based on the cohesion of the translation words. Our experimental results on TREC English-Chinese CLIR collection show that these techniques result in significant improvements over the simple dictionary approaches, and achieve even better performance than a high-quality machine translation system.
Dynamic structures in modeling and simulation: a reflective approach
Authors: A. M. Uhrmacher
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2001)

As the number of flexible, adaptable systems grows so does the need for specification and analysis tools that support adaptable system structures. The increasing number of simulation tools that equip models with the capability of changing their behavior patterns, composition, and interactions raises the desire for a theoretical and methodological approach. A formalism is introduced based on DEVS which emphasizes the reflective nature of variable structure models. The proposed formalism and DEVS are shown to be bisimilar, which emphasizes the role of variable structure models as an agency of modularization. The formalism is used to reveal general problems and solutions in implementing variable structure models.
Settling Analysis of MOS Regulated Current Mirrors Applied to Micropower D/A Converters
Authors: J. A. De Lima
Venue: Analog Integrated Circuits and Signal Processing (2000)

This paper provides an insight to the trade-off between settling time and power consumption in regulated current mirrors as building parts in micropower current-switching D/A converters. The regulation-loop frequency characteristic is obtained and difficulties to impose a dominant-pole condition to the resulting 2nd-order system are evaluated. Raising pole frequencies in micropower circuits, while meeting consumption requirements, is basically limited by parasitic capacitances. For such cases, an alternative is to impose a twin-pole condition in which design constraints are somewhat relieved and settling slightly improved. Relationships between pole frequencies, transistor geometry and bias are established and design guidelines for regulated current mirrors founded. By placing loop-transistors in either weak or strong inversion, small (W/L) ratios are allowed and stray capacitances reduced. Simulated waveforms suggest a good agreement with theory. The proposed approach applied to the design of a micropower current-mode D/A converter improves both simulated and experimental settling performance.