ppxscal/embedding_network huggingface dataset:
Retrieving Shape Information from Multiple Images of a Specular Surface
Authors: H. Schultz
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

In many remote sensing and machine vision applications, the shape of a specular surface such as water, glass, or polished metal must be determined instantaneously and under natural lighting conditions. Most image analysis techniques, however, assume surface reflectance properties or lighting conditions that are incompatible with these situations. To retrieve the shape of smooth specular surfaces, a technique known as specular surface stereo was developed. The method analyzes multiple images of a surface and finds a surface shape that results in a set of synthetic images that match the observed ones. An image synthesis model is used to predict image irradiance values as a function of the shape and reflectance properties of the surface, camera geometry, and radiance distribution of the illumination. The specular surface stereo technique was tested by processing four numerical simulations-a water surface illuminated by a low- and high-contrast extended light source, and a mirrored surface illuminated by a low- and high-contrast extended light source. Under these controlled circumstances, the recovered surface shape showed good agreement with the known input.
Feature Space Trajectory Methods for Active Computer Vision
Authors: Michael A. Sipe, David Casasent
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We advance new active object recognition algorithms that classify rigid objects and estimate their pose from intensity images. Our algorithms automatically detect if the class or pose of an object is ambiguous in a given image, reposition the sensor as needed, and incorporate data from multiple object views in determining the final object class and pose estimate. A probabilistic feature space trajectory (FST) in a global eigenspace is used to represent 3D distorted views of an object and to estimate the class and pose of an input object. Confidence measures for the class and pose estimates, derived using the probabilistic FST object representation, determine when additional observations are required as well as where the sensor should be positioned to provide the most useful information. We demonstrate the ability to use FSTs constructed from images rendered from computer-aided design models to recognize real objects in real images and present test results for a set of metal machined parts.
Rigid Body Segmentation and Shape Description from Dense Optical Flow Under Weak Perspective
Authors: Joseph Weber, Jitendra Malik
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

We present an algorithm for identifying and tracking independently moving rigid objects from optical flow. Some previous attempts at segmentation via optical flow have focused on finding discontinuities in the flow field. While discontinuities do indicate a change in scene depth, they do not in general signal a boundary between two separate objects. The proposed method uses the fact that each independently moving object has a unique epipolar constraint associated with its motion. Thus motion discontinuities based on self-occlusion can be distinguished from those due to separate objects. The use of epipolar geometry allows for the determination of individual motion parameters for each object as well as the recovery of relative depth for each point on the object. The algorithm assumes an affine camera where perspective effects are limited to changes in overall scale. No camera calibration parameters are required. A Kalman filter based approach is used for tracking motion parameters with time.
Stereo Correspondence with Compact Windows via Minimum Ratio Cycle
Authors: Olga Veksler
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

One of the earliest and still widely used methods for dense stereo correspondence is based on matching windows of pixels. The main difficulty of this method is choosing a window of appropriate size and shape. Small windows may lack sufficient intensity variation for reliable matching, while large windows smooth out disparity discontinuities. We propose an algorithm to choose a window size and shape by optimizing over a large class of "compact" windows. The word compact is used informally to reflect the fact that the ratio of perimeter to area of our windows is small. We believe that this is the first area based method which efficiently constructs nonrectangular windows. Fast optimization over compact windows is achieved via the minimum ratio cycle algorithm for graphs. The algorithm has only a few parameters which are easy to fix.
SQL/SDA: A Query Language for Supporting Spatial Data Analysis and Its Web-Based Implementation
Authors: Hui Lin, Bo Huang
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

An important trend of current GIS development is to provide easy and effective access to spatial analysis functionalities for supporting decision making based on geo-referenced data. Within the framework of the ongoing SQL standards for spatial extensions, a spatial query language, called SQL/SDA, has been designed to meet such a requirement. Since the language needs to incorporate the important derivation functions (e.g., map-overlay and feature-fusion) as well as the spatial relationship and metric functions, the functionality of the FROM clause in SQL is developed in addition to the SELECT and WHERE clauses. By restructuring the FROM clause via a subquery, SQL/SDA is well-adapted to the general spatial analysis procedures using current GIS packages. Such an extended SQL, therefore, stretches the capabilities of the previous ones. The implementation of SQL/SDA on the Internet adopts a hybrid model, which takes advantage of the Web GIS design methods in both the client side and server side. The client side of SQL/SDA, programmed in the Java language, provides a query interface by introducing visual constructs such as icons, listboxes, and comboboxes to assist in the composition of queries, thereby enhancing the usability of the language. The server side of SQL/SDA, which is composed of a query processor and Spatial Database Engine (SDE), carries out query processing on spatial databases after receiving user requests. It was demonstrated that using the familiar SELECT-FROM-WHERE statement instead of a single ad hoc command or procedural commands like macro language in some GIS packages, SQL/SDA offers users an efficient option to perform complicated multistep spatial data analyses on the Internet.
Near-optimal design of Global Positioning System (GPS) networks using the Tabu Search technique
Authors: Hussain Aziz Saleh, Peter Dare
Venue: Journal of Global Optimization (2003)

This paper describes an optimization technique based on an heuristic procedure which is applied to analyse and improve the efficiency of the design of Global Positioning System (GPS) surveying networks. GPS is a valuable survey tool because of its ability to increase the accuracy, speed and flexibility of a survey. A GPS network can be defined as a number of stations, which are co-ordinated by a series of sessions, formed by placing receivers on stations. The goal is to select the best order in which these sessions can be organised to give the best possible schedule. Generally, solving large networks to optimality requires impractical computational time. This paper proposes a Tabu Search technique which provides optimal or near-optimal solutions for large networks with an acceptable amount of computational effort. Computational results for several case studies with known and unknown optimal schedules have been presented to assess the performance of the proposed technique.
Balancing Buffer Utilization in Meshes Using a 'Restricted Area' Concept
Authors: Po-Jen Chuang, Juei-Tang Chen, Yue-Tsuen Jiang
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Adaptive routing and virtual channels are used to increase routing adaptivity in wormhole-routed two-dimensional meshes. But increasing channel buffer utilization without considering even distribution of the traffic loads tends to cause congestion in the most adaptive routing area. To avoid such traffic congestion, a concept of the restricted area is proposed in this paper. The proposed restricted area, defined to be a part of the network where message transmission concentrates, can be located following the region of adaptivity. By properly guiding message routing inside and outside the area, we are able to achieve more balanced buffer utilization and to reduce traffic congestion accordingly. The performance of several routing algorithms with or without using the restricted area is simulated and evaluated under various traffic loads and distribution patterns. The results indicate that routing algorithms with the restricted areas yield constantly larger throughput and smaller latency than routing algorithms without using the concept.
History of Fortran
Authors: Michael Metcalf
Venue: ACM SIGPLAN Fortran Forum (2002)

Often questions arise that relate to the history of Fortran and to the development of its various standards: "why was feature x included/excluded?", "which statement was in which standard?", "was there a conspiracy to do this, that or the other?", etc. Answers to all these and more can be found in the literature. I have tried to assemble a short list of books and journals that should be relatively easy to find or obtain in a good academic library, in the hope that it can be of service to such enquirers.
An asynchronous parallel evolutionary algorithm (APEA) for solving complex non-linear real world optimization problems
Authors: Pu Liu, Lishan Kang, Hugo de Garis, Yuping Chen
Venue: Neural, Parallel Scientific Computations (2002)

There are many real world examples for which an improvement in optimizing a quantity by a few percent, or extending an optimization algorithm to a more complex case, can result in a cost savings of billions of dollars - for example, when designing increasingly complex jet engines to reduce the fuel costs of the world's commercial airline companies. Unfortunately, many such real world problems involve complex, non-linear, multi-constraint, mixed format (integer, real) characteristics, and have so many parameters that conventional algorithms cannot solve them accurately nor in a reasonable time. Given that so much is at stake, constant pressure is exerted on the creators of optimization algorithms to improve their art.This paper introduces a new and very broadly applicable algorithm (called APEA) based on an asynchronous parallel evolutionary paradigm, which the authors believe is powerful enough to have a significant impact upon the type of complex real world problems mentioned above. An example (called BUMP in this paper), derived from a structural design optimization problem, is used to illustrate the power of this new APEA algorithm. The BUMP problem, introduced by Keane [1] is to maximize a nonlinear function with nonlinear constraints. Due to its scalability and highly nonlinear properties, the BUMP problem has been widely used as a test case (bench-mark) for authors of optimization algorithms. This paper shows that the new algorithm is able to outperform its nearest rival in this very complex problem by a factor of 20,000 in terms of a dimensional complexity measure defined in the paper.
Clustering for Approximate Similarity Search in High-Dimensional Spaces
Authors: Chen Li, Edward Chang, Hector Garcia-Molina, Gio Wiederhold
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

In this paper, we present a clustering and indexing paradigm (called Clindex) for high-dimensional search spaces. The scheme is designed for approximate similarity searches, where one would like to find many of the data points near a target point, but where one can tolerate missing a few near points. For such searches, our scheme can find near points with high recall in very few IOs and perform significantly better than other approaches. Our scheme is based on finding clusters and, then, building a simple but efficient index for them. We analyze the trade-offs involved in clustering and building such an index structure, and present extensive experimental results.
Cycle-Time Properties of the Timed Token Medium Access Control Protocol
Authors: Sijing Zhang, Alan Burns, Tee-Hiang Cheng
Venue: IEEE Transactions on Computers (2002)

We investigate the timing properties of the timed token protocol that are necessary to guarantee synchronous message deadlines. A tighter upper bound on the elapse time between the token's lth arrival at any node i and its (l+v)th arrival at any node k is found. A formal proof to this generalized bound is presented.
The total completion time open shop scheduling problem with a given sequence of jobs on one machine
Authors: Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen
Venue: Computers and Operations Research (2002)

This paper addresses the open shop scheduling problem to minimize the total completion time, provided that one of the machines has to process the jobs in a given sequence. The problem is NP-hard in the strong sense even for the two-machine case. A lower bound is derived based on the optimal solution of a relaxed problem in which the operations on every machine may overlap except for the machine with a given sequence of jobs. This relaxed problem is NP-hard in the ordinary sense, however it can be quickly solved via a decomposition into subset-sum problems. Both heuristic and branch-and-bound algorithm are proposed. Experimental results show that the heuristic is efficient for solving large-scaled problems, and the branch-and-bound algorithm performs well on small-scaled problems.
Developing Educational Software Components
Authors: Jeremy Roschelle, Chris DiGiano, Manolis Koutlis, Alexander Repenning, Jonathan Phillips, Nicholas Jackiw, Dan Suthers
Venue: Computer (1999)

The demand for educational software is growing exponentially with the surge of interest in educational reform, the Internet, and distance learning. Educational applications must be flexible because curricula and teaching styles vary greatly among institutions, locations, and even among instructors at the same institution. To meet these needs, a wide array of small-scale, casual developers at universities, research labs, and small businesses develop educational software, but no dominant solution or supplier has seemed to emerge. In this market, smaller suppliers often cannot produce full solutions without depending on the capabilities of other vendors. Until now, components have remained largely the province of full-time programmers. However, component technologies are likely to expand toward an audience that is considerably less technical and more domain-oriented-users whose job descriptions typically don't include software development. Thus, the lessons learned could become increasingly important to developing good software for any application domain. Having component developers collaborate with domain experts to build applications may be the future of software development. This group of component developers discusses what they've learned in collaborating with educators on educational software components.
On connectivity of consecutive-d digraphs
Authors: Ding-zhu Du, D. F. Hsu, Hung Q. Ngo, G. W. Peck
Venue: Discrete Mathematics (2002)

The concept of a consecutive-d digraph was proposed by Du, Hsu and Hwang as a generalization of de Bruijn digraphs, Kautz digraphs, and their generalizations given by Imase and Itoh and Reddy, Pradhan and Kuhl. In this paper, we determine the connectivity of consecutive-d digraphs and study how to modify consecutive-d digraphs to reach maximum connectivity. Our results will generalize and improve several existing results on the connectivity of de Bruijn digraphs, Kautz digraphs and Imase-Itoh digraphs.
BOOM: a heuristic boolean minimizer
Authors: Jan Hlavička, Petr Fišer
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are generated bottom-up, the proposed method uses a top-down approach. Thus instead of increasing the dimensionality of implicants by omitting literals from their terms, the dimension of a term is gradually decreased by adding new literals. Unlike most other minimization tools like ESPRESSO, BOOM doesn't use the definition of the function to be minimized as a basis for the solution, thus the original coverage influences the solution only indirectly through the number of literals used.Most minimization methods use two basic phases introduced by Quine-McCluskey, known as prime implicant (PI) generation and the covering problem solution. Some more modern methods, like ESPRESSO, combine these two phases, reducing the number of PIs to be processed. This approach is also used in BOOM, the search for new literals to be included into a term aims at maximum coverage of the output function.The function to be minimized is defined by its on-set and off-set, listed in a truth table. Thus the don't care set, often representing the dominant part of the truth table, need not be specified explicitly. The proposed minimization method is efficient above all for functions with a large number of input variables while only few care terms are defined.The minimization procedure is very fast, hence if the first solution does not meet the requirements, it can be improved in an iterative manner. The method has been tested on several different kinds of problems, like the MCNC standard benchmarks or larger problems generated randomly.
The Challenges of Automatic Summarization
Authors: Udo Hahn, Inderjeet Mani
Venue: Computer (2000)

Summarization--the art of abstracting key con-tent from one or more information sources--has become an integral part of everyday life. People keep abreast of world affairs by listening to news bites. They base investment decisions on stock market updates. They go to movies largely on the basis of reviews. With summaries, they can make effective decisions in less time.Although summarizing tools are available, with the increasing volume of online information, it is becoming harder to generate meaningful and timely summaries. Researchers are investigating tools and methods that automatically extract or abstract content from information sources.The authors describe how these data summarization methods fall into two categories. Knowledge-poor approaches rely on not having to add new rules for each new application domain or language. Knowledge-rich approaches assume that if you grasp the meaning of the text, you can reduce it more effectively, thus yielding a better summary. They rely on a size-able knowledge base of rules, which must be acquired, maintained, and then adapted to new applications and languages.The authors predict that summarization tools will be key in conquering the vast information universes ahead.
A Modular Software Process Mini-Assessment Method
Authors: Karl E. Wiegers, Doris C. Sturzenberger
Venue: IEEE Software (2000)

This article describes one approach for dealing with a common problem in software process assessment: some organizations want feedback on their processes, but they cannot devote three arduous weeks to an "official" CMM assessment. In this mini-assessment method, individual assessment components are selected to focus the investigation on specific concerns and to scope the effort to a level appropriate to the organization.
Testing Multimedia Transmission Systems
Authors: David K. Fibush
Venue: IEEE Design Test (1995)

This article describes test and measurement applications as seen by the television engineer from basic analog television to the transmission of multimedia over telecommunications paths. Emphasis is placed on compressed data, which is becoming a predominant factor for audio and video. Although there are many useful compression algorithms, MPEG-2 appears to be the most universal, along with its very complete and widely accepted system definition for the transmission of all the data encountered in multimedia applications. The MPEG-2 transport stream, with its small packets, was developed for transmission systems and can be used to carry all types of data. The discussion outlines a layered model for systems and testing analogous to the OSI model for communications systems. Following a description of MPEG-2 transport streams, specific test methods for analysis and generation are discussed.
Security at the Internet Layer
Authors: Rolf Oppliger
Venue: Computer (1998)

Internet Protocol, version 6, was conceived with two main goals: increase address space and improve security, relative to IPv4. The community achieved the first goal by increasing the IP address length from 32 bits to 128 bits. To meet the second goal, the Internet Engineering Task Force chartered the IP Security Working Group to design a security architecture and corresponding protocols that would provide cryptographically based security for IPv6. As work progressed, however, the IP community realized that the security architecture proposed for IPv6 could also be used for IPv4. Consequently, it extended this charter to retrofitting the security protocols, or IPsec protocols, into IPv4 implementations.Many IPv4 software vendors have announced they will support the IPsec protocols in future releases. This retrofitting is an important part of the working group's charter because IPv6 deployment is turning out to be slow. This article overviews the proposed security architecture and the two main protocolsýthe IP Security Protocol and the Internet Key Management Protocolýdescribes the risks they address, and touches on some implementation requirements.
On the Invariance of Stationary State Probabilities of a Non-Product-Form Single-Line Queueing System
Authors: V. A. Ivnitskii
Venue: Problems of Information Transmission (2002)

We consider a single-line queueing system (QS) with Poisson input flow of varying intensity, which depends on the number of demands in the system. The job size (length) distribution for a demand depends on the number of demands in the system at the arrival moment. The service rate also depends on the number of calls in the QS. If the job size for a new arrival is larger than the remaining job size for the currently processed demand, then the arrival is put at the beginning of the queue with a certain probability, which depends on the total number of demands in the system. Otherwise, it occupies the server and displaces the currently processed demand, which is put at the beginning of the queue. The probability distribution of stationary states of the QS is found and necessary and sufficient conditions for this distribution to be invariant with respect to the job size distribution with a fixed mean are obtained.
Estimates of average complexity of neurocontrol algorithms
Authors: Tomas Hrycej
Venue: Neural Networks (2001)

Neurocontrol algorithms can be operated in a batch mode or an incremental mode. Furthermore, some of them have variants with and without an explicit plant model. These variants exhibit fundamentally different behavior with regard to the volume of data necessary for convergence. To assess this difference, simplified algorithms in a discrete state space using the dynamic programming framework are analyzed: a batch algorithm, and two incremental algorithms with and without a plant model. Analysis shows that the batch algorithm is the fastest, while the two incremental algorithms (in particular the model-free variant) are considerably slower, measured in expected number of samples to convergence.