ppxscal/embedding_network huggingface dataset:
Active/Dynamic Stereo Vision
Authors: Enrico Grosso, Massimo Tistarelli
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Visual navigation is a challenging issue in automated robot control. In many robot applications, like object manipulation in hazardous environments or autonomous locomotion, it is necessary to automatically detect and avoid obstacles while planning a safe trajectory. In this context the detection of corridors of free space along the robot trajectory is a very important capability which requires nontrivial visual processing. In most cases it is possible to take advantage of the active control of the cameras.In this paper we propose a cooperative schema in which motion and stereo vision are used to infer scene structure and determine free space areas. Binocular disparity, computed on several stereo images over time, is combined with optical flow from the same sequence to obtain a relative-depth map of the scene. Both the time-to-impact and depth scaled by the distance of the camera from the fixation point in space are considered as good, relative measurements which are based on the viewer, but centered on the environment.The need for calibrated parameters is considerably reduced by using an active control strategy. The cameras track a point in space independently of the robot motion and the full rotation of the head, which includes the unknown robot motion, is derived from binocular image data.The feasibility of the approach in real robotic applications is demonstrated by several experiments performed on real image data acquired from an autonomous vehicle and a prototype camera head.
Optical Neural Chips
Authors: Eberhard Lange, Yoshikazu Nitta, Kazuo Kyuma
Venue: IEEE Micro (1994)

An array of photodetectors, each having a variable sensitivity, forms the most important component of our two gallium arsenide chips. We designed the optical neurochip so that variable sensitivity photodiodes are monolithically integrated on top of an LED array, serving both as fast analog multipliers and as on-chip weight storage elements with learning capability. Our artificial retina device combines a VSPD array with a neural network for postprocessing, allowing us to perform fast, yet flexible, processing operations on projected images.
Asymmetric/Unidirectional Error Correcting and Detecting Codes
Authors: S. Al-Bassam, B. Bose
Venue: IEEE Transactions on Computers (1994)

Introduces the theory and design of codes that correct t asymmetric errors and simultaneously detect d(d
Segmentation of Pulmonary Nodule Images Using 1-Norm Minimization
Authors: Thomas F. Coleman, Yuying Li, Adrian Mariano
Venue: Computational Optimization and Applications (2001)

Total variation minimization (in the 1-norm) has edge preserving and enhancing properties which make it suitable for image segmentation. We present Image Simplification, a new formulation and algorithm for image segmentation. We illustrate the edge enhancing properties of 1-norm total variation minimization in a discrete setting by giving exact solutions to the problem for piecewise constant functions in the presence of noise. In this case, edges can be exactly recovered if the noise is sufficiently small. After optimization, segmentation is completed using edge detection. We find that our image segmentation approach yields good results when applied to the segmentation of pulmonary nodules.
Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays
Authors: V. Bharadwaj, D. Ghose, V. Mani
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

The problem of obtaining optimal processing time in a distributed computing systemconsisting of (N+1) processors and N communication links, arranged in a single-level tree architecture, is considered. It is shown that optimality can be achieved through ahierarchy of steps involving optimal load distribution, load sequencing, and processor-link arrangement. Closed-form expressions for optimal processing time is derived for a general case of networks with different processor speeds and different communication link speeds. Using these closed-form expressions, the paper analytically proves a number of significant results that in earlier studies were only conjectured from computationalresults. In addition, it also extends these results to a more general framework. The aboveanalysis is carried out for the cases in which the root processor may or may not beequipped with a front-end processor. Illustrative examples are given for all casesconsidered.
Classification of Faults in Synchronous Sequential Circuits
Authors: I. Pomeranz, S. M. Reddy
Venue: IEEE Transactions on Computers (1993)

Undetectable and redundant faults in synchronous sequential circuits are analyzed. A distinction is drawn between undetectable faults and faults that are never manifested as output errors. The latter are classified as redundant. It is shown that there are faults for which a test sequence does not exist; however, under certain initial conditions (or initial states) of the circuit, faulty behavior may be observed. Such faults are called partially detectable faults. A partially detectable fault is undetectable, but is not redundant, as it affects circuit operation under some conditions. The author observes that the notion of redundancy cannot be separated from the mode of operation of the circuit. Two modes of operation are considered, representative of common modes, called the synchronization mode and the free mode. Accordingly, the identification of redundant faults calls for different test generation strategies. Two test strategies to generate tests for detectable faults and partial tests for partially detectable faults are defined, called the restricted test strategy and the unrestricted test strategy.
Generation of Injective and Reversible Modular Mappings
Authors: Hyuk Jae Lee, José A. B. Fortes
Venue: IEEE Transactions on Parallel and Distributed Systems (2003)

A modular mapping consists of a linear transformation followed by modulo operations. It is characterized by a transformation matrix and a vector of moduli, called the modulus vector. Modular mappings are useful to derive parallel versions of algorithms with commutative operations and algorithms intended for execution on processor arrays with toroidal networks. In order to preserve algorithm correctness, modular mappings must be injective. Results of previous work characterize injective modular mappings of rectangular index sets. This paper provides a technique to generate modular appings that satisfy these injective conditions and extends the results to general index sets. For an n-dimensional rectangular index set, the technique has O (n^2n!) complexity. To facilitate generation of efficient code, modular mappings must also be reversible (i.e., have easily described inverses). An O(n^2) method is provided to generate reversible modular mappings. This method reduces the search space by fixing entries of the modulus vector while attempting to minimize the number of entries to exclude few solutions. For general index sets defined by linear inequalities, injectivity can be checked by formulating and solving a set of linear inequalities. A modified Fourier-Motzkin elimination is proposed to solve these inequalities. To generate an injective modular mapping of an index set defined by linear inequalities, this paper proposes a technique that attempts to minimize the values of the entries of the modulus vector. Several examples are provided to illustrate the application of the above mentioned methods, including the case of BLAS routines.
An Evaluation of Parallel Thinning Algorithms for Character Recognition
Authors: Louisa Lam, Ching Y. Suen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Skeletonization algorithms have played an important role in the preprocessing phase of OCR systems. In this paper we report on the performance of 10 recent parallel thinning algorithms from this perspective by gathering statistics from their performance on large sets of data and examining the effects of the different thinning algorithms on an OCR system.
Editorial
Authors: W. -m. W. Hwu, T. M. Conte
Venue: IEEE Transactions on Computers (1994)

Modern memory systems are composed of several levels of caching. The design of these levels is largely an empirical practice. One highly-effective empirical method is the single-pass method wherein all caches in a broad design space are evaluated in one pass over the trace. Multiprogramming degrades memory system performance since context switching reduces the effectiveness of cache memories. Few single-pass methods exist which account for multiprogramming effects. This paper uses a general model of single-pass algorithms, the recurrence/conflict model, and extends the model for recording the effects due to both voluntary context switches and involuntary context switches. Involuntary context switches are modeled using the distribution of lengths between a reference to an address and the re-reference to the same address. The paper makes the assumptions that involuntary context switches are equally likely to occur between each reference, and that one can independently estimate f/sub CS/, the fraction of a cache's contents flushed between context switches. The case where f/sub CS/=1 is used to measure the effect of worst-case context switch penalty (the susceptibility) of several members of the SPEC89 benchmark set to context switching. Some empirical results of F/sub CS/ are presented to illustrate the case where f/sub CS/>1. The model is validated against its assumptions by comparing its results with more restrictive methods.
Local Discontinuous Galerkin Methods for Partial Differential Equations with Higher Order Derivatives
Authors: Jue Yan, Chi-Wang Shu
Venue: Journal of Scientific Computing (2002)

In this paper we review the existing and develop new local discontinuous Galerkin methods for solving time dependent partial differential equations with higher order derivatives in one and multiple space dimensions. We review local discontinuous Galerkin methods for convection diffusion equations involving second derivatives and for KdV type equations involving third derivatives. We then develop new local discontinuous Galerkin methods for the time dependent bi-harmonic type equations involving fourth derivatives, and partial differential equations involving fifth derivatives. For these new methods we present correct interface numerical fluxes and prove L2 stability for general nonlinear problems. Preliminary numerical examples are shown to illustrate these methods. Finally, we present new results on a post-processing technique, originally designed for methods with good negative-order error estimates, on the local discontinuous Galerkin methods applied to equations with higher derivatives. Numerical experiments show that this technique works as well for the new higher derivative cases, in effectively doubling the rate of convergence with negligible additional computational cost, for linear as well as some nonlinear problems, with a local uniform mesh.
Implementing Degradable Processing Arrays
Authors: Stephanie R. Goldberg, Shambhu J. Upadhyaya
Venue: IEEE Micro (1998)

Single-package processing systems are demanded by today's performance-driven network technology and multimedia-enabled applications. The single-packaging of large systems can be realized with wafer scale integration (WSI) technology, however, reliability issues related to large systems continue to plague WSI. Fault tolerance by way of reconfiguration has not found widespread use in WSI due to the extra real estate required for reconfiguration hardware. Multichip modules (MCMs) with their various implementation options provide an ideal technology for fault-tolerant processor arrays. A commercially-feasible MCM-based fault tolerance scheme that incurs no increase to primary circuit area is presented. The scheme facilitates the continued operation of a defective array that would otherwise be discarded. With minimal additional hardware and scheduling overhead, a healthy subarray is extracted from the original array such that original array topology is preserved. Details of the reconfiguration algorithm, switch control, and switch implementation are presented.
Modified Fractal Signature (MFS): A New Approach to Document Analysis for Automatic Knowledge Acquisition
Authors: Yuan Y. Tang, Hong Ma, Dihua Xi, Xiaogang Mao, Ching Y. Suen
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

One of the key technologies related to knowledge and data engineering is the acquisition of knowledge and data in the development and utilization of information system and the strategies to capture new knowledge and data. Actually, millions of documents, including technical reports, government files, newspapers, books, magazines, letters, bank checks, etc., have to be processed every day, and knowledge has to be acquired from them. This paper presents a new approach to document analysis for automatic knowledge acquisition. The traditional approaches have two major disadvantages: (1) They are not effective for processing documents with high geometrical complexity. Specially, the top-down approach can process only the simple documents which have specific format or contain some a priori information. (2) The top-down approach needs to split large components into small ones iteratively, while the bottom-up approach needs to merge small components into large ones iteratively. They are time consuming. This new approach is based on modified fractal signature. It can overcome the above weaknesses.
On Isomonodromic Deformations of Fuchsian Systems
Authors: A. A. Bolibruch
Venue: Journal of Dynamical and Control Systems (1997)

Isomonodromic deformations of Fuchsian systems are considered. A description of all possible forms of such isomonodromic deformations is presented.
Automatic Initial Estimation of the Left Ventricular Myocardial Midwall in Emission Tomograms Using Kohonen Maps
Authors: C. Manhaeghe, I. Lemahieu, D Vogelaers, F. Colardyn
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

A new method to make an automatic initial estimation of the position of the middle of the left ventricular (LV) myocardial wall (LV myocardial midwall) in emission tomograms is presented. This method eliminates the manual interaction still required by other, more accurate LV delineation algorithms, and which consists of indicating the LV long axis and/or the LV extremities. A well-known algorithm from the world of neural networks, Kohonen's self-organizing maps, was adapted to use general shapes and to behave well for data with large background noise.
Reports on three EDUNET projects: the common user actions table, SPSS benchmark jobs and interactive benchmark jobs
Authors: Elizabeth R. Little
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

Use of a national computing network fosters a number of concerns from a variety of levels within an institution. Two of the most often voiced concerns are: 1) Can users miles away from the host computer really learn enough about the host computer to use it? 2) What are the costs? The EDUNET Central office has developed materials, with the cooperation of the EDUNET suppliers, designed to answer these questions. This report focuses on three specific projects that address using a "foreign" computer center and the costs. 1) The Common User Actions table (formerly called the "difference" table) is designed as a reference guide to determine the specific command/action that is required at a particular host computer to carry out common operations, such as deleting a character or logging off. 2) A series of SPSS benchmark jobs were run by EDUNET Member institutions to determine a cost comparison for each institution. 3) A series of interactive benchmark jobs are being run this summer again to give users a way to compare costs of different institutions.
A model-driven ERP Environment with search facilities
Authors: Jon Atle Gulla, Terje Brasethvik
Venue: Data Knowledge Engineering (2002)

Traditional business models are primarily used in the initial phases of BPR or enterprise resource planning projects. They are static representations of systems requirements and business procedures, but have proven less useful in supporting the actual use of the systems. With the model-driven business management (MDBM) approach, dynamic and adaptable business models constructed as part of the implementation project are afterwards used to access the system and monitor the real business flows. In this paper, we present the linguistic aspects of the MDBM approach and discuss how the linguistic part and the modeling part of MDBM mutually support each other.
On the Data Model and Access Method of Summary Data Management
Authors: M. C. Chen, L. P. McNamee
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

A data model and an access method for summary data management are presented. Summary data, represented as a trinary tuple (statistical function, category, summary), are metaknowledge summarized by a statistical function of a category of individual information typically stored in a conventional database. For instance, (average-income, female engineer with 10 years' experience and master's degree, $45000) is a summary datum. The computational complexity of the derivability problem has been found intractable in general, and the proposed summary data model, enforcing the disjointness constraint, alleviates the intractable problem without loss of information. In order to store, manage, and access summary data, a multidimensional access method called summary data (SD) tree is proposed. By preserving the category hierarchy, the SD tree provides for efficient operations, including summary data search, derivation, insertion, and deletion.
The modularity condition for uninorms and t-operators
Authors: M. Mas, G. Mayor, J. Torrens
Venue: Fuzzy Sets and Systems (2002)

In this work we study the functional equation given by the modularity condition F(x,G(y,z))=G(F(x,y),z) for all z ≤ x, where the unknown functions F, G are uninorms and/or t-operators. We characterize all the solutions in the four possible cases: (i) when F, G are t-operators, (ii) when F is a t-operator and G a uninorm, (iii) when F is a uninorm and G a t-operator and, finally, (iv) when F, G are uninorms.
Cryptographic Smart Cards
Authors: David Naccache, David M'Raïhi
Venue: IEEE Micro (1996)

Smart-cards have the tremendous advantage, over their magnetic stripe ancestors, of being able to execute cryptographic algorithms locally in their internal circuitry. This means that the user's secrets (be these PIN codes or keys) never have to leave the boundaries of the tamper-resistant silicon chip, thus bringing maximum security to the overall system in which the cards participate.Smart-cards contain special-purpose microcontrollers with built-in self-programmable memory and tamper-resistant features intended to make the cost of a malevolent attack far superior to the benefits. As cryptography progresses, so does silicon technology : new silicon geometries and cryptographic processing refinements are introduced at a fast pace by the semiconductor manufacturers serving this industry. This article is both a survey of the existing crypto-dedicated microprocessors and an attempt to describe some of their possible evolutions. 600 million IC cards will be manufactured in 1996 throughout the world.
Toward Automatic Simulation of Aging Effects on Face Images
Authors: A. Lanitis, C. J. Taylor, T. F. Cootes
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

The process of aging causes significant alterations in the facial appearance of individuals. When compared with other sources of variation in face images, appearance variation due to aging displays some unique characteristics. For example, aging variation is specific to a given individual; it occurs slowly and is affected significantly by other factors, such as health, gender, and lifestyle. Changes in facial appearance due to aging can even affect discriminatory facial features, resulting in deterioration of the ability of humans and machines to identify aged individuals. In this paper, we describe how the effects of aging on facial appearance can be explained using learned age transformations and present experimental results to show that reasonably accurate estimates of age can be made for unseen images. We also show that we can improve our results by taking into account the fact that different individuals age in different ways and by considering the effect of lifestyle. Our proposed framework can be used for simulating aging effects on new face images in order to predict how an individual might look like in the future or how he/she used to look in the past. The methodology presented has also been used for designing a face recognition system, robust to aging variation. In this context, the perceived age of the subjects in the training and test images is normalized before the training and classification procedure so that aging variation is eliminated. Experimental results demonstrate that, when age normalization is used, the performance of our face recognition system can be improved.
Finding Interesting Patterns Using User Expectations
Authors: Bing Liu, Wynne Hsu, Lai-Fun Mun, Hing-Yan Lee
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

One of the major problems in the field of knowledge discovery (or data mining) is the interestingness problem. Past research and applications have found that, in practice, it is all too easy to discover a huge number of patterns in a database. Most of these patterns are actually useless or uninteresting to the user. But due to the huge number of patterns, it is difficult for the user to comprehend them and to identify those interesting to him/her. To prevent the user from being overwhelmed by the large number of patterns, techniques are needed to rank them according to their interestingness. In this paper, we propose such a technique, called the user-expectation method. In this technique, the user is first asked to provide his/her expected patterns according to his/her past knowledge or intuitive feelings. Given these expectations, the system uses a fuzzy matching technique to match the discovered patterns against the user's expectations, and then rank the discovered patterns according to the matching results. A variety of rankings can be performed for different purposes, such as to confirm the user's knowledge and to identify unexpected patterns, which are by definition interesting. The proposed technique is general and interactive.
Geolocation and Assisted GPS
Authors: Goran M. Djuknic, Robert E. Richton
Venue: Computer (2001)

Assisted-GPS technology offers superior accuracy, availability, and coverage at a reasonable cost.
Level 6: Why We Can't Get There from Here
Authors: Tom Gilb
Venue: IEEE Software (1996)

How to get people and technology to work togetherEach week, American comedian and social commentator Dennis Miller opens his TV show with a topic that he tears to pieces with biting satire. His self-proclaimed "rants" are often extreme, but his comments ¿ when considered in their entirety ¿ are almost always on the mark.Tom Gilb is the Dennis Miller of software engineering. His opinions about software and its engineering have an edge. They are debatable, sometimes maddening, but, like Miller's rants, can serve as a catalyst for serious discussion. He is currently struggling to figure out how to think clearly about systems engineering, and is finding little meaningful guidance. The author or coauthor of several books, he is currently editing his manuscript on systems engineering, which has the working title The Results Method.As Tom advises at the end of this article, when you consider his opinions, have fun.¿Roger Pressman