ppxscal/embedding_network huggingface dataset:
A Controlled Random Search Technique Incorporating the Simulated Annealing Concept for Solving Integer and Mixed Integer Global Optimization Problems
Authors: C. Mohan, H. T. Nguyen
Venue: Computational Optimization and Applications (1999)

In this paper, a computational algorithm, named RST2ANU algorithm, has been developed for solving integer and mixed integer global optimization problems. This algorithm, which primarily is based on the original controlled random search approach of Price [22i], incorporates a simulated annealing type acceptance criterion in its working so that not only downhill moves but also occasional uphill moves can be accepted. In its working it employs a special truncation procedure which not only ensures that the integer restrictions imposed on the decision variables are satisfied, but also creates greater possibilities for the search leading to a global optimal solution. The reliability and efficiency of the proposed RST2ANU algorithm has been demonstrated on thirty integer and mixed integer optimization problems taken from the literature. The performance of the algorithm has been compared with the performance of the corresponding purely controlled random search based algorithm as well as the standard simulated annealing algorithm. The performance of the method on mathematical models of three realistic problems has also been demonstrated.
An Optimization Technique for the Design of Multiple Valued PLA's
Authors: K. V. Asari, C. Eswaran
Venue: IEEE Transactions on Computers (1994)

An optimization technique for the design of two types of multiple-valued PLAs is described. In a type-I PLA, the multiple-valued function is realized directly, whereas in a type-II PLA, output encoding is used to encode the binary output of the PLA. In both types, multiple function literal circuits are used for the purpose of minimization. It is shown that the proposed technique leads to a considerably reduced size of PLA when compared to the earlier techniques.
Enhancement of Planar Shape Through Optimization of Functionals for Curves
Authors: E. j. Pauwels, P. Fiddelaers, L. j. Van Gool
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

We show how optimization of the Nordström and Mumford-Shah functionals can be used to develop a type of curve-evolution that is able to preserve salient features of closed curves while simultaneously suppressing noise and irrelevant details. The idea is to characterize a curve by means of its angle-function and apply the appropriate dynamics to this representation. Upon convergence, the resulting form of the contour is reconstructed from the representation.
High-Radix Division and Square-Root with Speculation
Authors: J. Cortadella, T. Lang
Venue: IEEE Transactions on Computers (1994)

The speed of high-radix digit-recurrence dividers and square-root units is mainly determined by the complexity of the result-digit selection. We present a scheme in which a simpler function speculates the result digit, and, when this speculation is incorrect, a rollback or a partial advance is performed. This results in operations with a shorter cycle time and a variable number of cycles. The scheme can be used in separate division and square-root units, or in a combined one. Several designs were realized and compared in terms of execution time and area. The fastest unit considered is a radix-512 divider with a partial advance of six bits.
An Interactive Support Tool for Writing Multilingual Manuals
Authors: Cécile Paris, Keith Vander Linden
Venue: Computer (1996)

Multilingual instruction manuals are important for companies that have a significant volume of international business. Companies want to automate the production of these manuals to save time and money. The dominant paradigm for automated multilingual manual production has been machine translation, in which a technical writer generates a manual, and a computer translates it into another language. However, the output is constrained by the original text's style and language. The output of newer automatic language-generation systems is not constrained in this way. However, these systems need an existing knowledge base to produce manuals in various languages. They do not help technical writers while they are writing manuals, even though this is the best way to produce user-oriented, rather than product-oriented, multilingual manuals. We have developed Drafter, an interactive document-drafting tool that works with the technical writer to automatically and simultaneously generate draft, final, and updated versions of manuals in several languages. Drafter also automates some tedious tasks, allowing technical writers to focus on the more creative aspects of their job.
Feature Transfer and Matching in Disparate Stereo Views through the Use of Plane Homographies
Authors: Manolis I. A. Lourakis, Stavros V. Tzurbakis, Antonis A. Argyros, Stelios C. Orphanoudakis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Many vision tasks rely upon the identification of sets of corresponding features among different images. This paper presents a method that, given some corresponding features in two stereo images, matches them with features extracted from a second stereo pair captured from a distant viewpoint. The proposed method is based on the assumption that the viewed scene contains two planar surfaces and exploits geometric constraints that are imposed by the existence of these planes to first transfer and then match image features between the two stereo pairs. The resulting scheme handles point and line features in a unified manner and is capable of successfully matching features extracted from stereo pairs that are acquired from considerably different viewpoints. Experimental results are presented, which demonstrate that the performance of the proposed method compares favorably to that of epipolar and tensor-based approaches.
An Efficient VLSI Switch-Box Router
Authors: Jer Min Jou, Jau Yien Lee, Yachyang Sun, Jhing Fa Wang
Venue: IEEE Design Test (1990)

A tool for switch-box routing that can route regions with cyclic constraints and with terminals on three or four sides is presented. A divide-and-conquer algorithm is used to explore the greedy channel routing idea, using techniques such as routing area partitioning, dynamic routing strategies, and sweeping concurrent bidirectional columns. The routing area is decomposed into three parts by two special lines cut parallel, making routing easier. The algorithm completely routes Burstein's switch-box problem and with an extension also routes the Deutsch channel example in 19 tracks.
A Retinomorphic Vision System
Authors: Kwabena A. Boahen
Venue: IEEE Micro (1996)

Retinomorphic vision systems use neurobiological principles to accomplish all four major operations performed by biological retinae: (1) continuous sensing for detection, (2) local automatic gain control for amplification, (3) spatiotemporal bandpass filtering for preprocessing, and (4) adaptive sampling for quantization, and they perform all four operations at the pixel level. The retinomorphic system I describe here uses a random-access communication channel to read out asynchronous pulse trains from a 64 64 pixel array in the retinomorphic chip, and transmits them to corresponding locations on a second chip that has a 64 64 array of integrators. Both chips are fully functional. I compare and contrast retinal design principles with the standard practice in imager design. I argue that neurobiological principles are best suited to perceptive systems that go beyond reproducing the dynamic scene, like a conventional video camera does, to extracting salient information in real time.
Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences
Authors: Claudio Bettini, X. Sean Wang, Sushil Jajodia, Jia-Ling Lin
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

An important usage of time sequences is to discover temporal patterns. The discovery process usually starts with a user-specified skeleton, called an event structure, which consists of a number of variables representing events and temporal constraints among these variables; the goal of the discovery is to find temporal patterns, i.e., instantiations of the variables in the structure that appear frequently in the time sequence. This paper introduces event structures that have temporal constraints with multiple granularities, defines the pattern-discovery problem with these structures, and studies effective algorithms to solve it. The basic components of the algorithms include timed automata with granularities (TAGs) and a number of heuristics. The TAGs are for testing whether a specific temporal pattern, called a candidate complex event type, appears frequently in a time sequence. Since there are often a huge number of candidate event types for a usual event structure, heuristics are presented aiming at reducing the number of candidate event types and reducing the time spent by the TAGs testing whether a candidate type does appear frequently in the sequence. These heuristics exploit the information provided by explicit and implicit temporal constraints with granularity in the given event structure. The paper also gives the results of an experiment to show the effectiveness of the heuristics on a real data set.
Processor Membership in Asynchronous Distributed Systems
Authors: L. E. Moser, P. M. Melliar-Smith, V. Agrawala
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Presents protocols for determining processor membership in asynchronous distributedsystems that are subject to processor and communication faults. These protocols dependon the placement of a total order on broadcast messages. The types of systems forwhich each of these protocols is applicable are characterized by the properties of thecommunication mechanisms and by the availability of stable storage. In the absence ofstable storage or of a mechanism for distinguishing promptly delivered messages, theauthors show that no membership protocol can exist. They also discuss their experiencein implementing these membership protocols.
Queuing analysis of simple FEC Schemes for voice over IP
Authors: Eitan Altman, Chadi Barakat, Víctor M. Ramos
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2002)

In interactive voice applications, FEC allows to recover from losses. FEC schemes need to be simple in order to allow interactivity. We study a simple scheme implemented in FreePhone audio tool [High Speed Networking Group, INRIA, Sophia Antipolis, http://www-sop.inria.fr/rodeo/fphone] and RAT: Robust Audio Tool [Multimedia Integrated Conferencing for European Researchers, University College, London], where for every packet n, redundant information is added in packet n + φ. The quality of a reconstructed copy depends on the amount of redundancy. Using queuing analysis we obtain simple expressions for the audio quality as a function of the amount of redundancy. We show that the expected amount of useful information deteriorates for any amount of FEC and any φ. We find conditions under which FEC leads to quality improvement.
Towards an architecture for intelligent control of narrative in interactive virtual worlds
Authors: R. Michael Young, Mark Riedl
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

The creation of novel, engaging and dynamic interactive stories presents a unique challenge to the designers of systems for interactive entertainment, education and training. Unlike conventional narrative media, an interactive narrative-based system may be required to generate its own story structure, determine the appropriate interface elements to use to convey the storys action and manage the effective interaction of a user within the story as it plays out. Here we describe the architecture of the Mimesis system, which integrates a 3D graphical gaming environment with intelligent techniques for generating and controlling interaction with and within a narrative in order to create an engaging and coherent user experience
The Impact of Data Quality Information on Decision Making: An Exploratory Analysis
Authors: InduShobha N. Chengalur-Smith, Donald P. Ballou, Harold L. Pazer
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

This paper describes an experiment that explores the consequences of providing information regarding the quality of data used in decision making. The subjects in the study were given three types of information about the data's quality: none, two-point ordinal, and interval scale. This information was made available to the subjects, along with the actual data. Two decision strategies were explored: conjunctive and weighted linear additive. Two decision environments were used: a simple environment and a relatively complex environment. Various combinations of these factors were employed to explore several issues. These include complacency, consensus, and consistency. The paper provides preliminary insights into which type of data-quality information is most effective and the circumstances in which data-quality information is most effective. Such knowledge would be of value to those responsible for designing databases that support decision-makers. Overall, we find that in a situation where subjects are confronted with clearly differentiated alternatives, the inclusion of data-quality information impacted the selection of the preferred alternative while maintaining group consensus.
Geophysical data analysis using Python
Authors: Jon Sáenz, Juan Zubillaga, Jesús Fernández
Venue: Computers Geosciences (2002)

A set of routines designed for geophysical data analysis that make extensive use of the numerical extensions to the computer language Python are presented. The routines perform some typical tasks during multivariate analysis of geophysical fields, such as principal component analysis and related tasks (truncation rules by means of analytical and Monte Carlo techniques). Other functions perform singular value decomposition of covariance matrices and canonical correlation analysis for coupled variability of geophysical fields. Other parts of the package allow access to a library of statistical distribution functions, multivariate digital filters, time-handling routines, kernel-based probability density function estimation and differential operators over the sphere for gridded data sets. As they rely on the numerical extensions to the Python language, they are fast for numerical analysis. The programs make the analysis of geophysical data sets both easier and faster.
Performance guaranteed rendering using the HDoV tree
Authors: Lidan Shou, Zhiyong Huang, Kian Lee Tan
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

We propose the Hierarchical Degree-of-Visibility (HDoV) tree for performance guaranteed rendering. Each tree node represents a spatial region in the scene, and contains a DoV value that reflects the degree of visibility of the object(s) in the region with respect to a region where the viewpoint is (can be the same region). The DoV values are pre-computed and stored. In run-time, they can be used to update rapidly the DoV field of each node when the viewing region changes. Each node is also associated with level of details (LODs) of the object(s). We propose a technique called Polygon Budget (PB) Rendering to traverse the HDoV tree for performance guaranteed rendering. The PB mode allows optimization of the visual effect with limited GPU power.
Managing Government Databases
Authors: Athman Bouguettaya, Mourad Ouzzani, Brahim Medjahed, Jerry Cameron
Venue: Computer (2001)

The information revolution has led organizations to rely on databases to conduct their daily business. The authors explore Indiana's digital government project and explain how using Web-based techniques to retrieve data can help disadvantaged citizens become self-reliant. The authors recommend that empowering novice and experienced users to submit queries over database networks provides a sophisticated infrastructure that supports flexible tools for managing and accessing Internet databases. They propose using distributed ontologies of information repositories to meet this challenge. They suggest an organization and segmentation of databases based on simple ontologies that describe coherent slices of the information space. These distributed ontologies filter interactions, accelerate information searches, and permit data sharing in a tractable manner. The authors describe how strengthening database management technology renders improved service.
Interactively Exploring Hierarchical Clustering Results
Authors: Jinwook Seo, Ben Shneiderman
Venue: Computer (2002)

To date, work in microarrays, sequenced genomes, and bioinformatics has focused largely on algorithmic methods for processing and manipulating vast biological data sets. Future improvements will likely provide users with guidance in selecting the most appropriate algorithms and metrics for identifying meaningful clusters--interesting patterns in large data sets, such asgroups of genes with similar profiles. Hierarchical clustering has been shown to be effective in microarray data analysis for identifying genes with similar profiles and thus possibly with similarfunctions. Users also need an efficient visualization tool, however, to facilitate pattern extraction from microarray data sets.The Hierarchical Clustering Explorer integrates four interactive features to provide information visualization techniques that allow users to control the processes and interact with the results. Thus, hybrid approaches that combine powerful algorithms with interactive visualization tools will join the strengths of fast processors with the detailed understanding of domain experts.
Making a Compiler Easily Portable
Authors: Enrico Ballarin, Helmar Burkhart, Rudolf Eigenmann, Heinz Kindlimann, Michael Moser
Venue: IEEE Software (1988)

The authors describe a technique for porting a modern language that makes it possible to port the language quickly and still get fast execution. They relate the practical experience they gained when porting the compiler to different environments. They concentrate on transportation problems of compilers that generate machine code rather than those that generate interpreter code. The authors' approach is based on the definition of a universal operating-system interface that must be implemented on the target machine to install the compiler. They ported the Modula-2/68K compiler, which was developed at their institute and has successfully been installed at external sites. Of the two porting procedures they offered-source-code cross development and object-code transportation-the external sites preferred the latter because it requires less effort.
Selecting and Implementing an Embedded Database System
Authors: Michael A. Olson
Venue: Computer (2000)

With the increasing deployment of computersas embedded systems that provide new and interesting services, the computing landscape is much richer and more diverse than it was even a decade ago. Developers can choose from a wide variety of hardware, operating systems, and tools for the embedded systems they build. This range of platform and tool choices provides both a blessing and a curse. On the one hand, developers can choose precisely the tools and services their application requires. On the other hand, finding the right products to use can be difficult. The author explains that despite their differences, embedded systems share important characteristics with the desktop and server systems they supplant. Because embedded systems interact with users or their environment, they need an I/O system. Many embedded systems perform multiple tasks and also need an operating system for scheduling and task man-agement. Because of the unique advantages, limitations, and requirements of the applications embedded systems run, the author proposes a careful selection process and tailored implementation, detailed in this article.
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
Authors: G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad
Venue: IEEE Transactions on Computers (1993)

The class of stochastic well-formed colored nets (SWN's) was defined as a syntactic restriction of stochastic high-level nets. The interest of the introduction of restrictions in the model definition is the possibility of exploiting the symbolic reachability graph (SRG) to reduce the complexity of Markovian performance evaluation with respect to classical Petri net techniques. It turns out that SWN's allow the representation of any color function in a structured form, so that any unconstrained high-level net can be transformed into a well-formed net. Moreover, most constructs useful for the modeling of distributed computer systems and architectures directly match the "well-formed" restriction, without any need of transformation. A nontrivial example of the usefulness of the technique in the performance modeling and evaluation of multiprocessor architectures is included.
Data dependence for Mann iteration
Authors: Stefan M. Soltuz
Venue: Octogon Mathematical Magazine (2001)

Using the Mann iteration we prove a convergence result and a data dependence for two clases of contractive type maps.
The Internet, Intranets, and the AI Renaissance
Authors: Daniel E. O'Leary
Venue: Computer (1997)

Virtually cost-free publication on the Web has led to information overload. AI, with its roots in knowledge representation, is experiencing a renaissance as new tools emerge to make the Web more tractable. The Internet, fueled by the phenomenal popularity of the World Wide Web, has exhibited exponential growth over the past three years. But virtually instantaneous and cost-free publication, inherent in the WWW, leads to problems with information overload. In the case of the WWW, the ease of self-publication has helped generate an estimated 50-120 million pages on the Web, a figure that is growing every day. Search engines help users navigate the millions of pages. However, even the best search engines cannot efficiently circumnavigate the entire Web. A naive search using AltaVista, for example, can result in 100,000-plus matches. New search engines can structure queries in a user-friendly fashion, but they require the user to learn and manage numerous interfaces. We may now have digital libraries on our desktops, but it still takes an immense amount of manual effort to use them. AI will play a crucial role in making the WWW usable. AI has been around for 40 years, yet in some people's view it has not lived up to its (perhaps overblown) promise. Many domains create intractable problems for AI, and many expert systems are either too narrow or too brittle. But the Web is a perfect environment for AI, with its roots in problem solving and knowledge representation. An increasing number of Web-based AI applications-intelligent search engines and browsers, learning agents, and knowledge-sharing agents-have begun to emerge. And although these AI applications have grown increasingly attractive because of the Internet, they may hold even more promise for intranets.
Using Simple Tools to Evaluate Complex Architectural Trade-offs
Authors: Michael J. Flynn, Patrick Hung, Armita Peymandoust
Venue: IEEE Micro (2000)

First-year graduate design students learn to quickly evaluate complicated cost-performance processor trade-offs using simple design tools.