ppxscal/embedding_network huggingface dataset:
Optimal Motion and Structure Estimation
Authors: J. Weng, N. Ahuja, T. S. Huang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The causes of existing linear algorithms exhibiting various high sensitivities to noise are analyzed. It is shown that even a small pixel-level perturbation may override the epipolar information that is essential for the linear algorithms to distinguish different motions. This analysis indicates the need for optimal estimation in the presence of noise. Methods are introduced for optimal motion and structure estimation under two situations of noise distribution: known and unknown. Computationally, the optimal estimation amounts to minimizing a nonlinear function. For the correct convergence of this nonlinear minimization, a two-step approach is used. The first step is using a linear algorithm to give a preliminary estimate for the parameters. The second step is minimizing the optimal objective function starting from that preliminary estimate as an initial guess. A remarkable accuracy improvement has been achieved by this two-step approach over using the linear algorithm alone.
A Comparison of Evolution Strategies with Other Direct Search Methods in the Presence of Noise
Authors: Dirk V. Arnold, Hans-Georg Beyer
Venue: Computational Optimization and Applications (2003)

Evolution strategies are general, nature-inspired heuristics for search and optimization. Due to their use of populations of candidate solutions and their advanced adaptation schemes, there is a common belief that evolution strategies are especially useful for optimization in the presence of noise. Empirical evidence as well as a number of theoretical findings with respect to the performance of evolution strategies on a class of spherical objective functions disturbed by Gaussian noise support that belief. However, little is known with respect to the capabilities in the presence of noise of evolution strategies relative to those of other direct optimization strategies.In the present paper, theoretical results with respect to the performance of evolution strategies in the presence of Gaussian noise are summarized and discussed. Then, the performance of evolution strategies is compared empirically with that of several other direct optimization strategies in the noisy, spherical environment that the theoretical results have been obtained in. Due to the simplicity of that environment, the results are easily interpretable and can serve to reveal the respective strengths and weaknesses of the algorithms. It is seen that for low levels of noise, most of the strategies exhibit similar degrees of efficiency. For higher levels of noise, their step length adaptation scheme affords evolution strategies a greater degree of robustness than the other algorithms tested.
Covering a hypergraph of subgraphs
Authors: Noga Alon
Venue: Discrete Mathematics (2002)

Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let v(H) denote the maximum number of members of H no two of which share a common vertex, and let τ(H) denote the minimum cardinality of a set of vertices of G that intersects all members of H. It is shown that τ(H) ≤ 2d2v(H). A similar, more general result is proved replacing the assumption that G is a tree by the assumption that it has a bounded tree-width. These improve and extend results of various researchers.
KDA: A Knowledge-Based Database Assistant with a Query Guiding Facility
Authors: X. Wu, T. Ichikawa
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

A knowledge-based database assistant (KDA) which integrates a natural language query system with a skeleton-based query guiding facility is provided. When a user works with the KDA natural language query system, the query guiding facility can supply several kinds of skeletons to guide users in performing database retrieval tasks. A semantic network model, S-Net, is introduced to represent the knowledge for natural language query processing and skeleton generation. Methods for implementing the system are discussed.
EduNuggets: an intelligent environment for managing and delivering multimedia education content
Authors: Eleni Stroulia, Kavita Jari
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

Todays teaching and learning practices are evolving to leverage the continuously increasing information available on the web, on all conceivable subject matters. This wealth of information presents a great challenge: how to provide an integrated, authoritative, extendible and shareable information collection of related multimedia education materials. In this paper, we describe EduNuggets (http://www.cs.ualberta.ca/~stroulia/EduNuggets), our intelligent repository for multimedia educational materials.
Applying Product Line Concepts in Small and Medium-Sized Companies
Authors: Peter Knauber, Dirk Muthig, Klaus Schmid, Tanya Widen
Venue: IEEE Software (2000)

Small and medium-sized enterprises work under heavy constraints: They need to be very flexible and fast in their reaction to customer requests, thus limiting their possibility for long-term planning. In a partially publicly funded project, the authors have started to apply their Product Line Software Engineering method developed at Fraunhofer IESE, in six small and medium-sized companies addressing six different domains. The article presents first experience and lessons learned from 24 months of project work; including first results within the companies.
An Automatic Netlist-to-Schematic Generator
Authors: B. Naveen Naveen, K. S. Raghunathan
Venue: IEEE Design Test (1993)

The N2S schematic generator, which uses a variable-ordering technique in the initial placement phase and simple heuristics in the final placement phase, is described. Its channel-routing techniques result in signal routing with minimal crossovers. The authors demonstrate the efficiency of N2S by applying it to a set of benchmark sequential circuits.
Analysis of Noncoherent Systems and an Architecture for the Computation of the System Reliability
Authors: S. J. Upadhyaya, H. Pham
Venue: IEEE Transactions on Computers (1993)

An efficient technique for computing the reliability of k-to-l-out-of-n systems is presented. These kinds of systems find application in communication, multiprocessor, and transportation system environments. The k-to-l-out-of-n systems are very general and readily model coherent systems such as series, parallel, and N-modular-redundancy (NMR) systems. The algorithm presented computes in quadratic time in the worst case and yields superior results compared to existing algorithms for all permissible values of k, l, and n. The scheme is shown to evaluate the reliability in linear order-time. A cellular implementation of the algorithm in hardware is presented. The basic cell consists of a simple multiplier, an adder, and some switches that can be easily implemented in VLSI using computer-aided-design (CAD) tools. Ways of obtaining optimal configurations for the k-to-l-out-of-n system are discussed.
A class of optimized row projection methods for solving large nonsymmetric linear systems
Authors: H. Scolnik, N. Echebest, M. T. Guardarucci, M. C. Vacchino
Venue: Applied Numerical Mathematics (2002)

We present in this paper optimal and accelerated row projection algorithms arising from the use of quadratic programming, that allow us to define the iterate xk+1 as the projection of xk onto a hyperplane which minimizes its distance to the solution x*. These algorithms also use a novel partition strategy into blocks based on sequential estimations of their condition numbers.
Software-Reliability-Engineered Testing
Authors: John D. Musa
Venue: Computer (1996)

The testing of software systems is subject to strong conflicting forces. A system must function sufficiently reliably for its application, but it must also reach the market at the same time as its competitors (preferably before) and at a competitive cost. Some systems may be less market-driven than others, but balancing reliability, time of delivery, and cost is always important. One of the most effective ways to do this is to engineer the test process through quantitative planning and tracking. Unfortunately, most software testing is not engineered, and the resulting product may not be as reliable as it should be, and/or it may be too late or inexpensive. Software-reliability-engineered testing combines the use of quantitative reliability objectives and operational profiles (profiles of system use). The operational profile guides developers in testing more realistically, which makes it possible to track the reliability actually being achieved. This article describes SRET in the context of an actual AT&T project. SRET is an AT&T current best practice. Qualification as an AT&T best practice requires use on eight to 10 projects and large benefit/cost ratios. Practitioners have generally found SRET to be unique in offering a standard proven means to engineer and manage testing in a way that lets them increase their confidence in the reliability of the software-based system they developed.
Formulae and applications of interconnect estimation considering shield insertion and net ordering
Authors: James D. Z. Ma, Lei He
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

It has been shown recently that simultaneous shield insertion and net ordering (called SINO/R as only random shields are used) provides an area-efficient solution to reduce the RLC noise. In this paper, we first develop simple formulae with errors less than 10% to estimate the number of shields in the min-area SINO/R solution. In order to accommodate pre-routed P/G wires that also serve as shields, we then formulate two new SINO problems: SINO/SPR and SINO/UPG, and propose effective and efficient two-phase algorithms to solve them. Compared to the existing dense wiring fabric scheme, the resulting SINO/SPR and SINO/UPG schemes maintain the regularity of the P/G structure, have negligible penalty on noise and delay variation, and reduce the total routing area by up to 42% and 36%, respectively. Further, we develop various pre-layout estimation formulae for shielding areas and optimal P/G structures under different routing styles. These formulae can be readily used to guide global routing and high-level design decisions.
Principal Manifolds and Probabilistic Subspaces for Visual Recognition
Authors: Baback Moghaddam
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We investigate the use of linear and nonlinear principal manifolds for learning low-dimensional representations for visual recognition. Several leading techniques: Principal Component Analysis (PCA), Independent Component Analysis (ICA), and nonlinear Kernel PCA (KPCA) are examined and tested in a visual recognition experiment using 1,800+ facial images from the "FERET"database. We compare the recognition performance of nearest-neighbor matching with each principal manifold representation to that of a maximum a posteriori (MAP) matching rule using a Bayesian similarity measure derived from dual probabilistic subspaces. The experimental results demonstrate the simplicity, computational economy, and performance superiority of the Bayesian subspace method over principal manifold techniques for visual matching.
Constructing Efficient Belief Network Structures With Expert Provided Information
Authors: Sumit Sarkar, Ishwar Murthy
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

We present a technique to construct efficient belief network structures for application areas where large amounts of data are available and information on the ordering of the variables can be obtained from domain experts. We identify classes of networks that are efficient for propagating beliefs. We formulate the problem as one of determining the belief network representation from a given class that best represents the data. We use the I-Divergence measure which is known to have certain desirable properties for evaluating different approximations. We present some theoretical findings that characterize the nature of solutions that are obtained. These theoretical results lead to an efficient solution procedure for finding the best network representation. We also discuss other information that may be reasonably obtained from experts, and show how such information leads to improving the efficiency of the technique to find the best network structure.
Compile-Time Techniques for Improving Scalar Access Performance in Parallel Memories
Authors: R. Gupta, M. L. Soffa
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

Compile-time techniques for storage allocation of scalar values into memory modules that limit run-time memory-access conflicts are presented. The allocation approach is applicable to those operands in instructions that can be predicted at compile-time, where an instruction is composed of the multiple operations and corresponding operands that execute in parallel. Algorithms to schedule data transfers among memory modules to avoid conflicts that cannot be eliminated by the distribution of values alone are developed. The techniques have been implemented as part of a compiler for a reconfigurable long instruction word architecture. Results of experiments are presented demonstrating that a very high percentage of memory access conflicts can be avoided by scheduling a very low number of data transfers.
A new approach for speaker tracking in reverberant environment
Authors: Jianfeng Chen, Louis Shue, Wee Ser
Venue: Signal Processing (2002)

A scheme for detecting and locating speech signals in the presence of reverberations using a linear array is proposed. The equispaced linear array with a plurality of onmi-directional microphones is decomposed into two groups. Pairs of virtual and steerable directional microphones are then generated by using the frequency invariant beamforming technique for time delay estimations. This enables the microphone array to behave like ears in a human-like fashion to enhance the likelihood of valid speaker direction estimation. Additional decision rules are incorporated to enhance the robustness of the scheme.
Electrophysiologically Interactive Computer Systems
Authors: Jennifer Allanson
Venue: Computer (2002)

Modern physiologic data detection relies on the direct application of sensors to the body's surface.Electrophysiologically interactive computer systems combine physiological sensing technologies with interactive computer applications to support diverse monitoring and training disciplines,including systems design and evaluation,medical diagnostics and rehabilitation,hazardous awareness monitoring, psychophysiological conditioning, dynamic interface reconfiguration, and affective computing. They provide usability metrics and form the backbone of brain-computer interfaces, prosthetics, andother hands-free control technologies.The author has identified two basic electrophysiologically interactive systems:Monitoring systems quantify or measure an electrophysiologic signal of interest against some scale, such as the direct measurement of blood pressure or the continuous monitoring of heart rate over a specified period of time. Training systems feed back physiologic information to a subject in real time to enable operant conditioning or instrumental learning of control to occur a process commonly known as biofeedback.
Reengineering Legacy Embedded Systems
Authors: Vijay K. Madisetti, Yong-Kyu Jung, Moinul H. Khan, Jeongwook Kim, Theodore Finnessy
Venue: IEEE Design Test (1999)

Legacy hardware and software systems are defined as those that are currently performing useful tasks, but face possible interruption or termination of operation in the future due to a number of reasons. The "push" reasons include the need for increasing functionality, processing and interface scalability, better form (size, weight, power, volume) requirements, decreased maintenance and lifecycle support costs, and resilience to parts obsolescence. The "pull" reasons can include the availability of superior competing algorithms, architectures, and technologies meeting (or exceeding) the specifications of the legacy system, often at a lower cost. Legacy systems can be found everywhere in the military and commercial electronics area. Indeed, in commercial arena, electronics systems, such as PCs and cellular phones, are often obsolete in a matter of months, and increasing pressures of time-to-market has institutionalized re-engineering of products. In the military arena, the long lifetimes of deployed systems, decades in the case of radar systems, has made it inevitable that one is faced with the problem of legacy systems. It is not an exaggeration to conclude that the question is not "is reengineering necessary ?" but "when and how it should be done".
Computer Reminders and Alerts
Authors: Barry G. Silverman
Venue: Computer (1997)

With busy users relying increasingly on computers to provide reminders and alerts, the enabling technology is rapidly gaining importance. Surprisingly, many issues have not yet been thoroughly explored. If you have to keep reminding yourself of a thing, perhaps it isn't so.-C. Morley, 1929 Being only human, we sometimes forget. Computers can be a great help in this area: Barring disk crashes or other malfunctions, they are far less likely to forget than humans. Reminding and alerting are pervasive, though perhaps ancillary, functions of computing. Nevertheless, it is surprising that they attract so little attention. The state of the art is characterized by after-the-fact application patches, plug-ins, and custom-designed reminder methods. This hodgepodge of approaches is likely to change. Recent trends indicate that hundreds of millions of dollars of personal information management (PIM) programs have been sold, mainly because of their reminding abilities; billions of dollars in savings per year and increased quality of work are projected as more reminder and alerting programs are deployed; and agents that perform reminding and alerting tasks represent one of the fastest growing areas of the World Wide Web and other digital repositories.Clearly, professionals, consumers, and employees in all types of businesses are turning to digital reminders to increase their efficiency. The demands of a fast-paced technological world appear to be outstripping the capabilities of old-fashioned cerebral reminders. This shouldn't be surprising, considering the limitations of our standard-issue biological memory systems.
Logically Instantaneous Message Passing in Asynchronous Distributed Systems
Authors: T. Soneoka, T. Ibaraki
Venue: IEEE Transactions on Computers (1994)

Asynchrony (due to unknown message transmission delay) complicates the design of protocols for distributed systems. To simplify the protocol design task therefore, the authors propose an interprocess (point-to-point) communication mechanism that has the characteristic of instantaneous message passing. They first establish a hierarchy among synchronization properties, which shows that to ensure the logically instantaneous message passing property it is not always necessary to use a rendezvous mechanism. Next, they propose a solution to the logically instantaneous message passing problem that is more efficient than R. Bagrodia's (1989) rendezvous and K.J. Goldman's (1991) logically synchronous multicast in the point-to-point (single-cast) setting. This algorithm has the following properties: it is applicable without deadlock to the partner model in which each process acts as both client and server; it requires three control messages to send an application message, which is shown to be quasioptimum message complexity; and its worst-case response time from a send request to the occurrence of the corresponding send event is 2k/spl Delta/ (sec.), where k is the maximum number of interfering send requests and /spl Delta/ (sec.) is an assumed upper bound on interprocess communication delay. Furthermore, two modified algorithms are proposed: one for reducing the number of control messages required for an application message, and the other for attaining a shorter average response time by using a randomization technique.
A Distributed Learning Algorithm for Bayesian Inference Networks
Authors: W. Lam, Am. Segre
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

We present a new distributed algorithm for computing the minimum description length (MDL) in learning Bayesian inference networks from data. Our learning algorithm exploits both properties of the MDL-based score metric and a distributed, asynchronous, adaptive search technique called nagging. Nagging is intrinsically fault-tolerant, has dynamic load balancing features, and scales well. We demonstrate the viability, effectiveness, and scalability of our approach empirically with several experiments using networked machines. More specifically, we show that our distributed algorithm can provide optimal solutions for larger problems as well as good solutions for Bayesian networks of up to 150 variables.
A note on the Gallai---Roy---Vitaver theorem
Authors: Gerard J. Chang, Li-Da Tong, Jing-Ho Yan, Hong-Gwa Yeh
Venue: Discrete Mathematics (2002)

The well-known theorem by Gallai-Roy-Vitaver says that every digraph G has a directed path with at least χ(G) vertices; hence this holds also for graphs. Li strengthened the digraph result by showing that the directed path can be constrained to start from any vertex that can reach all others. For a graph G given a proper χ(G)-coloring, he proved that the path can be required to start at any vertex and visit vertices of all colors. We give a shorter proof of this. He conjectured that the same holds for digraphs; we provide a strongly connected counterexample. We also give another extension of the Gallai-Roy-Vitaver Theorem on graphs.
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields
Authors: M. A. Hasan, M. Z. Wang, V. K. Bhargava
Venue: IEEE Transactions on Computers (1993)

A Massey-Omura parallel multiplier of finite fields GF(2/sup m/) contains m identical blocks whose inputs are cyclically shifted versions of one another. It is shown that for fields GF(2/sup m/) generated by irreducible all one polynomials, a portion of the block is independent of the input cyclic shift; hence, the multiplier contains redundancy. By removing the redundancy, a modified parallel multiplier is presented which is modular and has a lower circuit complexity.
Guest Editors' Introduction: Design Challenges for High-Performance Network Interfaces
Authors: Andrew A. Chien, Mark D. Hill, Shubhendu S. Mukherjee
Venue: Computer (1998)

A network interface is a device that allows a computer to communicate with a network. Network interface design has a crucial impact on communication efficiency. It determines the cost of communication actions, moving data, and providing application isolation across communicating domains. With the advent of distributed computing and the Internet, and with dramatically faster processor clock rates and complete systems on chips, computing is increasingly concerned with the efficient movement of data-across the interconnects within a machine, the system-area network within a machine room, and the local area or wide area network. In the introduction of this special issue, the authors describe four articles that address network interface design issues.
A New Hardware Architecture for Operations in GF(2m)
Authors: Chang Han Kim, Sangho Oh, Jongin Lim
Venue: IEEE Transactions on Computers (2002)

The efficient computation of the arithmetic operations in finite fields is closely related to the particular ways in which the field elements are presented. The common field representations are a polynomial basis representation and a normal basis representation. In this paper, we introduce a nonconventional basis present a new bit-parallel multiplier which is as efficient as the modified Massey-Omura multiplier the type I optimal normal basis.