ppxscal/embedding_network huggingface dataset:
Omnidirectional three-dimensional stereo computer vision sensor using reflective cone mirror
Authors: Ruzena Bajcsy
Venue:  (2003)

A good portion of computer vision research is aimed at achieving the functionality of human vision with camera-computer integration. However, the traditional cameras that model human eyes inherit the innate shortcomings of human eyes. One of the most important shortcomings is narrow field of view. Recent research has focused on overcoming these spatial &ldquo;blind-spots&rdquo; to achieve even greater functionality than human eyes. This thesis introduces a series of new devices and algorithms to extend the camera capabilities beyond normal human eyes. The new device has enhanced capabilities spatially (field of view), and also recovers 3D depth information all while using the simplest possible form of convex reflective mirror previously considered unusable in such tasks. The misconception that deemed the cone shape unusable is clarified and the correct theory is presented. This opens the way for achieving wide field of view using a much cheaper and simpler mirror than previously thought possible. The cone shape does introduce its unique optical properties and we are able to provide several optical designs to minimize its impact on image quality. Further, we show that we can obtain high-resolution dense 3D depth information from all directions simultaneously. It is also easier and cheaper to adapt the new sensor to acquire omni-view multi-spectral images than other curved reflective mirrors based omni-directional cameras. Simulation and experimental results conform to our theory within defined limitations.
Biometric identification systems
Authors: Rodrigo de Luis-García, Carlos Alberola-López, Otman Aghzout, Juan Ruiz-Alzola
Venue: Signal Processing (2003)

In this paper, we provide an overview of the fundamentals of biometric identification, together with a description of the main biometric technologies currently in use, all of them within a common reference framework. A comparison on different qualitative parameters of these technologies is also given, so that the reader may have a clear perspective of advantages and disadvantages of each. A section on multibiometrics describes the state of the art in making these systems work coordinately. Fusion at different conceptual levels is described. Finally, a section on commercial issues provides the reader a perspective of the main companies currently involved in this field.
Flow reliability of a probabilistic capacitated-flow network in multiple node pairs case
Authors: Yi-Kuei Lin, John Yuan
Venue: Computers and Industrial Engineering (2003)

This article mainly generalizes the flow (or transportation) reliability problem for a directed capacitated-flow network in which the capacity of each arc ai has the values 0 < 1 < 2 < ... < Mi from s (source) to t (sink) case to a multiple node pairs case. Given the demands for all specified node pairs simultaneously in the network, a simple algorithm is proposed first to find out the family of all lower boundary points for such demands in terms of minimal paths. The flow reliability, the probability that the system allows the flow satisfying the demands simultaneously, can be calculated in terms of such lower boundary points. The overall-terminal flow reliability, one source to multiple sinks flow reliability and multiple sources to one sink flow reliability can be calculated as special cases.
A model theory for nonmonotonic multiple value and code inheritance in object-oriented knowledge bases
Authors: Michael Kifer
Venue:  (2002)

We have developed a comprehensive model theory for nonmonotonic multiple value and code inheritance in object-oriented knowledge bases. Our new inheritance semantics, called optimistic object model semantics, supports implicit inference by inheritance as well as explicit deductive inference via rules. Inference by inheritance supports a multitude of features, such as overriding, nonmonotonic multiple value and code inheritance, meta programming, and dynamic class hierarchies&mdash;the important features that are fundamental to advanced object-oriented knowledge management. In the setting of three-valued models, we formally define the inheritance postulates that capture the common intuition behind overriding and conflict resolution in nonmonotonic multiple value and code inheritance. These postulates specify the minimum requirements for object models. We specify an extended alternating fixpoint procedure for computing object models. We define a unique object model, called optimistic object model, for any given program that is written in our rule-based query language. We prove three different characterizations of the optimistic object model semantics: an optimistic object model is the least fixpoint of the extended alternating fixpoint computation, is the least stable object model with respect to information ordering, and is a minimal object model with respect to truth ordering. Our new inheritance semantics yields intuitively satisfactory results in all known benchmark cases, does not impose syntactic restrictions on programs, and has been implemented in the Flora-2 system. To the best of our knowledge, the optimistic object model semantics is currently the only model-theoretic semantics for nonmonotonic multiple value and code inheritance that applies to general, unrestricted object-oriented knowledge bases.
A study of current logic design practices in the automotive manufacturing industry
Authors: M. R. Lucas, D. M. Tilbury
Venue: International Journal of Human-Computer Studies (2003)

This paper presents the results of an observational study of industrial logic designers at Lamb Technion. The purpose of this study was to determine the current methods of logic design used in industry. These observations can be used to evaluate recent academic proposals of methods for generating controllers for machines, as well as suggesting new methods.By observing the logic designers it was determined that designing logic for machining systems is substantially different than writing computer code, both in the specification and in the people who will design and use the system. In addition, recent academic developments in Discrete Event Systems are difficult to apply to the problems of industrial logic control. Even methods which researchers design specifically for industrial logic design are difficult to apply, both due to the lack of support for the methods, and the unsuitability of the methods to solve problems in this domain.The primary observations of this study are the following. • The observed Logic designers need to at least: determine acceptable machine behavior, foresee potential error conditions, predict user behavior, and design the logic needed for a machine. This is a greater range of responsibilities than expected. • Logic for one machine is generally copied directly from a previous project. However, copying logic generally involves manually retyping everything due to incompatibilities in the development environments. • Customers continue to ask for more features, and it is unlikely that this trend will stop. Some of these features are extremely difficult to implement using existing methods. Such features include: detailed part tracking, more sophisticated user interfaces, and greater diagnostic ability.
Proceedings of the 2003 ACM symposium on Document engineering
Venue: Document Engineering (2003)

The 2003 ACM Symposium on Document Engineering (DocEng 2003), is the third in a series of international conferences dedicated to research addressing the theory, design, development, and evaluation of computer systems that support the creation, analysis, distribution, and interaction with documents in any medium.Although the series began three years ago, it takes its roots from the tradition of several conferences, including the long series of biennial Electronic Publishing (EP) conferences and Principles of Document Processing workshops, the 2000 Digital Documents and Electronic Publishing conference, the 1988 ACM Conference on Documents Processing Systems, and the 1981 ACM Symposium on Text Manipulation.All those conferences contributed to the very notion of document, to be taken in the wide sense of printable and interactively "tangible" composite multimedia information. The DocEng symposium entered the third millennium encompassing a new vision of documents; they are currently at the heart of globally interconnected systems that store information drawn from many media and deliver that information as active documents that adapt to the needs of their users.Research in the area is going on both in academic institutions and industrial laboratories. As an ultimate consequence, document technologies like XML are having a profound impact on data modeling in general because of the way they bridge and integrate a variety of paradigms (database, knowledge representation, and structured document). Previous editions of the symposium, DocEng 2001 - held in Atlanta - and DocEng 2002 - held in Mc Lean - joined the ACM Conference on Information and Knowledge Management (CIKM).In 2003, the symposium takes place, for the first time, in Europe - Grenoble, France - and, clearly indicates a growing interest from researchers drawn from various communities and from many continents. We received 81 full paper and 43 short paper submissions. As the short paper round took place after the long paper one, authors of rejected papers have had time to prepare a short version of their papers...but in fact most of the 43 short papers were completely new submissions. With the help of 32 reviewers we decided to accept 22 long papers and 12 short papers. These papers have been selected through a rigorous peer review proces.The topics of this year's program demonstrate the wide range of important research topics in document engineering. Indeed, while basic XML technology is well understood and widely adopted, new challenges are arising in areas ranging from document analysis, access and transformation to tools for editing, presenting and managing multimedia documents.This rich technical program will be completed with a keynote speech and an industrial activities session. It is our great pleasure that Michael Kay agreed to be our keynote speaker and will present his thoughts on "XML: a review of the achievements so far and the challenges ahead."
Review of "Linguistic exploitation of syntactic databases: the use of the nijmegen linguistic database program" by Hans van Halteren, Theo van den Heuvel. Editions Rodopi 1990.
Venue: Computational Linguistics (1991)

This book describes an important tool for the storage and exploration of syntactic structures that may be used under VAX/VMS, UNIX, and MS/PC-DOS in both interactive and batch modes. Linguistic DataBase, developed by the authors within the TOSCA Group at the University of Nijmegen, retrieves, displays, and counts constituent structures from syntactic trees. The book cover shows why LDB is original: a magnifying glass, hovering over a book opened to two pages of text, shows an inverted seven-level tree, root at the top, leaves corresponding to the words in a sentence at the bottom. Hans van Halteren and Theo van den Heuvel of the TOSCA group have created a primary tool for corpus linguistics: a generic displayer of syntactic trees from diverse databases with different encoding schemes.LDB and its manual give students of language use --- including teachers of English as a second language, computational linguists, researchers of style in literature, and language historians --- a common retrieval system for syntactic phenomena. Interactive concordance programs retrieve words and their tags from sizable texts and corpora. Such tags sometimes encode morphological, part-of-speech, and even functional information. Yet these tools cannot conveniently retrieve any word or word group that satisfies a pattern of syntactic tags, let alone display the results of an inquiry as a tree.The authors also describe the LDB as "a model of a database appropriate to a corpus-linguistic setting" (p. 3). Their manual outlines the current range of possibilities in syntactic corpus research, and LDB exemplifies the kind of editorial capabilities, displays, and file management facilities that a working database management system for syntactic trees should have. The book also tests both the function-category description model developed by F. Aarts and J. Aarts in 1982 and the contemporary English grammar published by Randolph Quirk and others ten years earlier. Both are important contributions to corpus linguistics.
Approximate replication
Authors: Jennifer Widom
Venue:  (2003)

In distributed environments that collect or monitor data, useful data may be spread across multiple distributed nodes, but users or applications may wish to access that data from a central location. A common way to facilitate centralized access to distributed data is to maintain replicas of data objects of interest at a central location. When data collections are large or volatile, keeping replicas consistent with remote master copies poses a significant challenge due to the large communication cost incurred. Consequently, in many real-world environments exact replica consistency is not maintained, and some form of inexact, or approximate, replication is typically used instead. Approximate replication is often performed by refreshing replicas periodically. Periodic refreshing allows communication cost to be controlled, but it does not always make good use of communication resources: In between refreshes some remote master copies may change significantly, leaving replicas excessively out of date and inaccurate, and meanwhile resources may be wasted refreshing replicas of other master copies that remain nearly unchanged. This dissertation studies the problem of making better use of communication resources in data replication environments than approaches based on periodic refreshing. In this dissertation, analysis of approximate replication environments is framed in terms of a two-dimensional space with axes denoting system performance (a measure of communication resource utilization) and replica precision (a measure of the degree of synchronization with remote master copies). There is a fundamental and unavoidable tradeoff between precision and performance: When data changes rapidly, good performance can only be achieved by sacrificing replica precision and, conversely, obtaining high precision tends to degrade performance. Two natural and complementary methods for working with the precision-performance tradeoff are proposed to achieve efficient communication resource utilization for replica synchronization: (1) Maximize replica precision in the presence of constraints on communication cost. (2) Minimize communication cost in the presence of constraints on replica precision. Problem definition, analysis, algorithms, and implementation techniques are developed for each method in turn, with the overall goal of creating a comprehensive framework for resource-efficient approximate replication. The effectiveness of each technique is verified using simulations over both synthetic and real-world data. In addition, a test-bed network traffic monitoring system is described, which uses some of the approximate replication techniques developed in this dissertation to track usage patterns and flag potential security hazards.
JVM versus CLR: a comparative study
Authors: Jeremy Singer
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

We present empirical evidence to demonstrate that there is little or no difference between the Java Virtual Machine and the .NET Common Language Runtime, as regards the compilation and execution of object-oriented programs. Then we give details of a case study that proves the superiority of the Common Language Runtime as a target for imperative programming language compilers (in particular GCC).
A multi-agent system for e-barter including transaction and shipping costs
Authors: Natalia López, Manuel Núñez, Ismael Rodríguez, Fernando Rubio
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

An e-barter multi-agent system consists of a set of agents exchanging goods. In contrast to e-commerce systems, transactions do not necessarily involve the exchange of money. Agents are equipped with a utility function to simulate the preferences of the customers that they are representing. They are grouped into local markets, according to the localities of the corresponding customers. Once these markets are saturated (i.e. no more exchanges can be performed) new agents, representing those local markets, are generated and combined into new markets. By reiteratively applying this process we finally get a global market.Even though a formalism to define e-barter architectures has been already introduced, that framework had a strong drawback: Neither transaction nor shipping costs were considered. In this paper we extend that framework to deal with systems where fees have to be paid to the owner of the system. These fees depend on the goods involved in the corresponding exchanges. In addition, shipping costs have also to be paid. These modifications complicate the setting because the utility that customers receive after exchanging goods is not directly given by the original utility function. That is, the returned utility after an exchange is performed has to be computed as a combination of the former utility and the derived costs. In particular, some exchanges may be disallowed because those costs exceed the increase of utility returned by the new basket of goods.
Compiling with code-size constraints
Authors: Mayur Naik, Jens Palsberg
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2004)

Most compilers ignore the problems of limited code space in embedded systems. Designers of embedded software often have no better alternative than to manually reduce the size of the source code or even the compiled code. Besides being tedious and error prone, such optimization results in obfuscated code that is difficult to maintain and reuse. In this paper, we present a step towards code-size-aware compilation. We phrase register allocation and code generation as an integer linear programming problem where the upper bound on the code size can simply be expressed as an additional constraint. The resulting compiler, when applied to six commercial microcontroller programs, generates code nearly as compact as carefully crafted code.
Self-organising modelling as a part of simulation process
Authors: Johann-Adolf Müller
Venue: Systems Analysis Modelling Simulation (2003)

At present GMDH algorithms give us an explicit model description (equations, rules, patterns) of complex ill-defined systems in the case of very short and noisy data samples. Therefore this is a necessary supplement to simulation methodology. Self-organising modelling and in special the GMDH approach is suitable and valuable as a part of the whole simulation process, which is demonstrated in macroeconomic simulation. More than this the paper will give an overview about the sources of traditional GMDH and about further development of self-organising modelling which is implemented in "KnowledgeMiner".
Evaluating the effectiveness of a new instructional approach
Authors: Barbara Moskal, Deborah Lurie, Stephen Cooper
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

This paper describes the evaluation of an NSF-sponsored educational research project. The primary focus of this project was to develop and evaluate a course curriculum designed to improve retention and performance for "at risk" introductory computer science majors. The results of this research suggest that the newly developed course and curriculum materials did improve students' performance and retention in computer science and their attitudes towards computer science.
Program redundancy analysis and optimization to improve memory performance
Authors: Li Xu
Venue:  (2003)

Program redundancy analysis and optimization have been an important component in optimizing compilers to identify and remove redundant computations and improve application performance. This thesis targets an important class of program run-time redundancy&mdash;redundant memory operations. First, an efficient and powerful static analysis algorithm is developed to detect redundant memory operations. Previous techniques separate the task of scalar and memory redundancy detection, thus they fail to discover the redundancies due to the interaction between scalar and memory values. The new algorithm unifies the scalar and memory redundancy detection using an integrated value numbering process, and is more powerful than the separate approach. Once the redundant memory operations are identified, program transformations are employed to remove those redundant memory operations. This thesis demonstrates that traditional scalar redundancy removal frameworks can be easily adapted to remove both fully static and partially static memory redundancies. Experimental results show that the analysis and optimization can remove significant amount of redundant loads (up to 40% of dynamic loads) in benchmark applications from SPEC2000 and MediaBench. This thesis also presents a limit study on run-time memory redundancies to evaluate effectiveness of various known memory redundancy removal methods. The effects on register allocation are quantitatively measured. The results show that register spills due to memory redundancy removal are rare in the benchmark applications, and there is little negative impact on application performance caused by spilling overhead. Finally, this thesis presents detailed microarchitecture simulations to measure the performance and energy efficiency benefits of memory redundancy removal. The results show that memory redundancy analysis and optimization can reduce the overall application execution cycles by up to 10%, even with wide-issue architectures. It also significantly reduces both instruction and data cache accesses. Architectural level energy consumption simulation shows that the reduction in dynamic memory instructions and cache accesses results in up to 14.8% energy savings. The performance boost and energy savings by memory redundancy analysis and optimization are especially valuable to meet the increasingly demanding low power and energy consumption requirement for both high-end microprocessors and battery-powered portable devices.
The DSS, a Middleware Library for Ef.cient and Transparent Distribution of Language Entities
Authors: Erik Klintskog, Zacharias El Banna, Per Brand, Seif Haridi
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

This paper describes a novel language independent model for distribution of language entities, which allows for fine-grained instrumentation of entity consistency protocols on a per-entity basis. The model is implemented as a middleware component, designed to enhance arbitrary high-level programming languages with distribution support on the language entity level. Themiddleware library is extendable using internal interfaces to add new protocols over three different aspects of distribution.