ppxscal/embedding_network huggingface dataset:
Comparing Images Using the Hausdorff Distance
Authors: D. P. Huttenlocher, G. A. Klanderman, W. A. Rucklidge
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The Hausdorff distance measures the extent to which each point of a model set lies near some point of an image set and vice versa. Thus, this distance can be used to determine the degree of resemblance between two objects that are superimposed on one another. Efficient algorithms for computing the Hausdorff distance between all possible relative positions of a binary image and a model are presented. The focus is primarily on the case in which the model is only allowed to translate with respect to the image. The techniques are extended to rigid motion. The Hausdorff distance computation differs from many other shape comparison methods in that no correspondence between the model and the image is derived. The method is quite tolerant of small position errors such as those that occur with edge detectors and other feature extraction methods. It is shown that the method extends naturally to the problem of comparing a portion of a model against an image.
Software Engineering Metrics for COTS-Based Systems
Authors: Sahra Sedigh-Ali, Arif Ghafoor, Raymond A. Paul
Venue: Computer (2001)

Large projects rely increasingly on commercial off-the- shelf components, a trend that emphasizes the need for adequate metrics to quantify component quality. Handling the growth of these COTS-based systems requires new approaches to quality and risk management. The authors offer software-engineering metrics to aid developers and managers in analyzing their quality-improvement initiatives' return on investment and to facilitate the modeling of cost and quality. They assert that large-scale component reuse or COTS component acquisition can generate savings in development resources, which can be applied to improve quality and enhance reliability, availability, and maintenance. Further, metrics play a critical role in identifying risks that involve performance, reliability, adaptability, scheduling, and product evaluation. COTS products change rapidly, and research on COTS-based- system development is still in the early stages. Given that cost-effectiveness and quality provide the major factors in deciding for or against component acquisition, the authors see an urgent need for empirical and analytical research that will lead to more accurate cost and quality models for these systems.
Design and Analysis of an Integrated Checkpointing and Recovery Scheme for Distributed Applications
Authors: Bina Ramamurthy, Shambhu Upadhyaya, Bharat Bhargava
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

An integrated checkpointing and recovery scheme which exploits the low latency and high coverage characteristics of a concurrent error detection scheme is presented. Message dependency which is the main source of multistep rollback in distributed systems is minimized by using a new message validation technique derived from the notion of concurrent error detection. The concept of a new global state matrix is introduced to track error checking and message dependency in a distributed system and assist in the recovery. The analytical model, algorithms, and data structures to support an easy implementation of the new scheme are presented. The completeness and correctness of the algorithms are proved. A number of scenarios and illustrations that give the details of the analytical model are presented. The benefits of the integrated checkpointing scheme are quantified by means of simulation using an object-oriented test framework.
Low-Effort, High-Payoff User Interface Reengineering
Authors: Catherine Plaisant, Anne Rose, Ben Shneiderman, Ajit J. Vanniamparampil
Venue: IEEE Software (1997)

Using a variety of low-effort, high-payoff strategies on six major software projects, the authors demonstrated that, in some cases, effective user interface reengineering can be accomplished in a matter of weeks instead of the year or more traditionally required.
Learning Separations by Boolean Combinations of Half-Spaces
Authors: N. S. V. Rao, E. M. Oblow, C. W. Glover
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Given two subsets S/sub 1/ and S/sub 2/ (not necessarily finite) of /spl Rfr//sup d/ separable by a Boolean combination of learning half-spaces, the authors consider the problem of (in the sense of Valiant) the separation function from a finite set of examples, i.e., they produce with a high probability a function close to the actual separating function. The authors' solution consists of a system of N perceptrons and a single consolidator which combines the outputs of the individual perceptrons; it is shown that an off-line version of this problem, where the examples are given in a batch, can be solved in time polynomial in the number of examples. The authors also provide an on-line learning algorithm that incrementally solves the problem by suitably training a system of N perceptrons much in the spirit of the classical perceptron learning algorithm.
Position Control in Integro-Differential Pursuit Games
Authors: G. Ts. Chikrii, K. Yu. Volyanskii
Venue: Cybernetics and Systems Analysis (2002)

A game problem of pursuit for a dynamic process described by a system of integro-differential equations is considered. Sufficient conditions are derived for its termination in a class of positional controls. Model examples illustrate the results obtained.
Interaction tactics for socially intelligent pedagogical agents
Authors: W. Lewis Johnson
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

Guidebots, or animated pedagogical agents, can enhance interactive learning environments by promoting deeper learning and improve the learner's subjective experience. Guidebots exploit a person's natural tendency to interact socially with computers, as documented by Reeves, Nass, and their colleagues. However they also raise expectations of social abilities, and failure to meet those expectations can have unintended negative effects. The Social Intelligence Project is developing improved social interaction skills for guidebots. This paper describes efforts to model and implement interaction tactics for guidebots, i.e., dialog exchanges that are intended to achieve particular communicative and motivational effects. These are based on analyses of student-tutor interaction during computer-based learning
Defining Interfaces at a High Level of Abstraction
Authors: James Foley, Won Chul Kim, Srdjan Kovacevic, Kevin Murray
Venue: IEEE Software (1989)

One of the newest user-interface management systems, the User-Interface Development Environment, is described by its creators. UIDE is built around a knowledge-based representation of the conceptual design of a user interface. UIDE supports design at a high-level specification of the interface from information provided by the designer. By using the same knowledge base, the interface developer can generate a new interface design with the same functionality as the original design. This lets users try many functionally equivalent interfaces for the same application.
A Unified DFT Approach for BIST and External Test
Authors: M.-L. Flottes, C. Landrault, A. Petitqueux
Venue: Journal of Electronic Testing: Theory and Applications (2003)

This paper presents a partial reset technique for testability improvement of non-scan sequential circuits. Both pseudo-random BIST and deterministic External Test are in the scope of this paper. The partial reset technique is used to improve hard-to-detect fault activation. This DFT approach is completed with classical insertion of observation points in order to improve fault propagation. Numerous experimental results on ISCAS'89 benchmark circuits show that 100% fault efficiency can be achieved at low cost.
MaDViWorld: a software framework for massively distributed virtual worlds
Authors: Patrik Fuhrer, Ghita Kouadri Mostéfaoui, Jacques Pasquier-Rocha
Venue: Software&mdash;Practice Experience (2002)

The MaDViWorld project represents an original attempt to define an appropriate software architecture for supporting massively distributed virtual world systems. A non-massively distributed virtual world system is typically engineered as a client-server application for which a single server or more rarely a small cluster of servers contain all the world pertinent data and assume the world accessibility, consistency and persistence. On the client side, many of them enable interaction with the other users and the various objects of the world. The main originality of our approach resides in the fact that the server part of the proposed system is no more limited to a few centralized servers, but can be distributed on arbitrarily many of them. Indeed, MaDViWorld, the prototypal software framework already implemented using Java and RMI by our group, allows for creating the rooms of a given world on several machines, each running the server application. It is then possible to connect the rooms by way of simple doors and to populate them with active objects. Finally, avatars managed by the client application visit the rooms and interact with the active objects either directly on the remote host or locally by cloning or transporting them first to the client machine. This paper draws from the experience gained with the development of our first prototype in order to discuss, both at the user's and the vi-world developer's level, the main software engineering issues related to the implementation of such massively distributed virtual world systems.
Analysis of the Probability of Transaction Abort and Throughput of Two Timestamp Ordering Algorithms for Database Systems
Authors: M. Singhal
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

The author analyzes and compares the performance of two timestamp ordering concurrency control algorithms, namely, the basic and multiversion, for database systems. The multiversion algorithm improves the performance of the basic timestamp ordering algorithm by keeping multiple versions of data objects. The author discusses the performance enhancement in the multiversion algorithm over the basic algorithm. The author also discusses the storage overhead due to multiple versions of data objects in the multiversion algorithm. The exact performance model of these algorithms is so complex that it is impossible to find a closed-form solution. The author reduces the complexity of the analysis by analyzing a single transaction in isolation and reflects the presence of other transactions on the isolated transaction by the probability of conflict/abort. The analysis provides useful insight into the performance of these algorithms.
The Impact of CyberHealthcare on the Physician&ndash;Patient Relationship
Authors: James G. Anderson, Michelle R. Rainey, Gunther Eysenbach
Venue: Journal of Medical Systems (2003)

It is estimated that 70 million Americans have used the Internet to acquire health-related information. Multiple factors provide the driving force behind this demand for online health information. Information technology is beginning to change the exclusive focus of medicine from curing disease to prevention of disease and enhancing health status. A critical feature of this change is the development of information and services that assist consumers to assume more responsibility for their own health and to actively participate in health care decisions. At the same time, physicians remain skeptical about the advantages of using the Internet for patient education. Some of the issues that this paper addresses include the following: What are the major factors that are leading to the increased use of the Internet by consumers to obtain health-related information? How do physicians view the use of the Internet by patients to obtain health-related information and services? How is the use of the Internet by consumers affecting physician&ndash;patient communications? What are the implications of the Internet for the future of physician&ndash;patient relationships?
Modeling TCP Reno with RED-based routers
Authors: Ahmed E. Kamal
Venue: ACM SIGMETRICS Performance Evaluation Review (2002)

The purpose of this paper is to introduce an accurate performance model for the TCP Reno version in the presence of a bottlenecked router which uses the Random Early Detection (RED) active queue The paper makes two contributions:&bull; It introduces an accurate model of a target source operating according to the TCP Reno mechanism in the presence of background traffic. The background traffic is represented by a general discrete batch Markov arrival process (D-BMAP), which is modified in order to make the phase transitions dependent on packet losses. It can therefore be used to model a collection of UDP and/or TCP sources. Under this model, packets are dropped only when the router is congested, or when the RED protocol is invoked, i.e., the buffer occupancy is taken into account.&bull; The paper also introduces an accurate model of the RED mechanism, which tracks the evolution of the difference between the instantaneous and average queue sizes. This representation is chosen since the average queue size tends to follow the instantaneous queue size, and therefore the difference between them is usually limited.This model is different from the models presented in the literature for TCP in a number of ways. Unlike [1, 2] where packet losses are random, and independent of the actual buffer occupancy, our model captures the buffer occupancy, and the actual packet losses due to buffer overflow. This paper also models the cross traffic using a general process. Reference [3] considered the effect of cross traffic only by modeling the service times using a random process.
Learning Shape Classes
Authors: K. Cho, S. M. Dunn
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This paper is a summary of a new approach to learning shape concepts. In this system, a shape is represented by conjunctions of local shape properties. Conjunctions of local properties are consistent and unique for distinct shapes and are robust enough to represent shape in the presence of occlusion. A new learning method, called property based learning, is developed and used to learn conjunctions of local properties. Unlike other classification methods based on distances or similarities, classification performance does not degrade linearly as the number of classes increases and classification can be done correctly with only partial information of instances. Property based learning is an incremental learning method that selects properties crucial for classification. Two experiments are reported. In the first experiment with tool shapes, this shape learning system is used to classify shapes in the presence of view point changes, local movements such as moving handles of pliers, and occlusion. In the second experiment with hand gestures, the system can classify different gestures regardless of the movement in joints, fingers, and palms.
A high performance parallel algorithm for 1-D FFT
Authors: R. C. Agarwal, F. G. Gustavson, M. Zubair
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

In this paper we propose a parallel high performance FFT algorithm based on a multi-dimensional formulation. We use this to solve a commonly encountered FFT based kernel on a distributed memory parallel machine, the IBM scalable parallel system, SP1. The kernel requires a forward FFT computation of an input sequence, multiplication of the transformed data by a coefficient array, and finally an inverse FFT computation of the resultant data. We show that the multidimensional formulation helps in reducing the communication costs and also improves the single node performance by effectively utilizing the memory system of the node. We implemented this kernel on the IBM SP1 and observed a performance of 1.25 GFLOPS on a 64-node machine.
Advanced ICA-based receivers for block fading DS-CDMA channels
Authors: Tapani Ristaniemi, Jyrki Joutsensalo
Venue: Signal Processing (2002)

In this paper we propose two types of receivers, which perform blind interference suppression. The receivers are suitable for the third generation mobile communications systems, which are based on direct-sequence code division multiple access (DS-CDMA). We especially consider the statistical technique called independent component analysis (ICA) as a tuning element attached to an existing single-user or blind multiuser detector. By doing this, the statistical independence of the users' signals can be exploited. In addition, it makes it possible to alleviate the performance drop due to the erroneous parameters estimation in the receiver. From the ICA point of view, the receiver observes a mixture of users' original signals, determined by the user-specific spreading codes, the data symbols, and the state of the propagation channel. Since all of them might be complex valued by nature, complex ICA is needed. In the paper, a proof of global convergence is given for the kurtosis-based FastICA algorithm in the case of complex valued source signals with circular distribution, and considered as the ICA component of the advanced receivers. Two types of receivers, RAKE-ICA and MMSE-ICA, are proposed and studied in a Rayleigh block fading channel. Extensive numerical simulations indicate that the performance of RAKE and subspace MMSE detector, respectively, can be greatly improved. Quite significantly, their performance is close to the theoretical bound of an equal length MMSE detector.
Algorithms for Testing Satisfiability Formulas
Authors: Marin Vlada
Venue: Artificial Intelligence Review (2001)

The present paper presents algorithms for testing satisfiabily of clausal formulas in the propositional logic and the firs-order logic. The algorithm based on the enumeration of solutions for testing the satisfiability of propositional formula, has already been given by K. Iwama, O. Dubois. The originality in this paper is to combine this algorithm to other procedures, especially with the pure-literal literal and the one-literal rule, and also the one which consists in changing any formulas in formulas bounded. The algorithm based on the enumeration of the solution combined to these procedures is more efficient. The algorithm based on the concept of resolutive derivation from Skolem normal form of formula &alpha; in first-order logic, has already been given. The idea in present's paper is to combined to this algorithm to process of elimination of tautological clauses and process of elimination of subsumed clauses.
An Improved Quadrature Rule for the Flux-Computation in Staggered Central Difference Schemes in Multidimensions
Authors: Knut-Andreas Lie, Sebastian Noelle
Venue: Journal of Scientific Computing (2003)

We present a new second-order, nonoscillatory, central difference scheme on two-dimensional, staggered, Cartesian grids for systems of conservation laws. The scheme uses a new, carefully designed integration rule for the flux computations and thereby takes more propagation directions into account. This effectively reduces grid orientation effects produced for two-dimensional radially symmetric gas flows and improves the accuracy for smooth solutions.
Asimov's Laws of Robotics: Implications for Information Technology-Part I
Authors: Roger Clarke
Venue: Computer (1993)

For part II see ibid., vol. 27, no. 1, p. 57-66 (Jan. 1994). The origins of the robot notion are reviewed. The laws for controlling robotic behavior, as espoused by the science fiction writer Isaac Asimov in 1940 and presented and refined in his writings over the following 45 years are explained. Problems inherent in the application of the laws are identified.
Application of artificial neural networks to optimum bit selection
Authors: Serkan Yilmaz, Cem Demircioglu, Serhat Akin
Venue: Computers Geosciences (2002)

Optimum bit selection is one of the important issues in drilling engineering. Usually, optimum bit selection is determined by the lowest cost per foot and is a function of bit cost and performance as well as penetration rate. Conventional optimum rock bit selection program involves development of computer programs created from mathematical models along with information from previously drilled wells in the same area. Based on the data gathered on a daily basis for each well drilled, the optimum drilling program may be modified and revised as unexpected problems arose. The approach in this study uses the power of Artificial Neural Networks (ANN) and fractal geostatistics to solve the optimum bit selection problem. In order to achieve this goal a back-propagation ANN model was developed by training the model using real rock bit data for several wells in a carbonate field. The training and fine-tuning of the basic model involved use of both gamma ray and sonic log data. After that the model was tested using various drilling scenarios in different lithologic units. It was observed that the model provided satisfactory results.
A Genetic Search for Optimal Multigrid Components Within a Fourier Analysis Setting
Authors: C. W. Oosterlee, R. Wienands
Venue: SIAM Journal on Scientific Computing (2002)

In this paper, Fourier analysis is used for finding efficient multigrid components. The individual multigrid components for several discrete partial differential operators are chosen automatically by a genetic optimization method. From a set of multigrid components, such as different smoothers, coarse grid correction components, cycle types, number of smoothing iterations, and relaxation parameters, an optimal three-grid Fourier convergence factor corrected for computational complexity is obtained by the genetic search. The resulting methods can be tuned for optimal efficiency or toward robustness. The analysis results are verified by numerical experiments.
An Analytical Model for Information Retrieval in Wireless Sensor Networks Using Enhanced APTEEN Protocol
Authors: Arati Manjeshwar, Qing-An Zeng, Dharma P. Agrawal
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Wireless Sensor Networks are a new class of Ad Hoc networks that will find increasing deployment in coming years, as they enable reliable monitoring and analysis of unfamiliar and untested environments. The advances in technology have made it possible to have extremely small, low powered sensor devices equipped with programmable computing, multiple parameter sensing, and wireless communication capability. But, because of their inherent limitations, the protocols designed for such sensor networks must efficiently use both limited bandwidth and battery energy. In this paper, we develop an M/G/1 model to analytically determine the delay incurred in handling various types of queries using our enhanced APTEEN (Adaptive Periodic Threshold-sensitive Energy Efficient sensor Network protocol) protocol. Our protocol uses an enhanced TDMA schedule to efficiently incorporate query handling, with a queuing mechanism for heavy loads. It also provides the additional flexibility of querying the network through any node in the network. To verify our analytical results, we have simulated a temperature sensing application with a Poisson arrival rate for queries on the network simulator ns-2. As the simulation and analytical results match perfectly well, this can be said to be the first step towards analytically determining the delay characteristics of a wireless sensor network.
On The Correlation Of Binary M-sequences
Authors: John Friedlander, Michael Larsen, Daniel Lieman, Igor Shparlinski
Venue: Designs, Codes and Cryptography (1999)

We obtain the upper bound O(2^{14n/15} n^{-1/5}) on the number of distinct values of all possible correlation functions between M-sequences of ordern .