ppxscal/embedding_network huggingface dataset:
Fuzzy Database Model Based on Quasi-Order Relations
Authors: R. Groenemans, E. Kerre, G. De Cooman, E. Van Ranst
Venue: Journal of Intelligent Information Systems (1997)

As we live in an information era, the need for gathering, storing and handling enormous amounts of data in a practical and economical way has become more and more important. Classical database systems were introduced in the late fifties and have proved their usefulnes in various domains. However, their inability to deal with vague and imprecise information has led to new database models. On the other hand the use of linguistic terms has also shown its usefulness in several domains. The assignment of linguistic terms to phenomena and the description of the characteristics, properties or conditions of objects seems something very natural. People make such assessments every day. A drawback of using linguistic terms, however, is that these terms are not always sharply defined and moreover their meaning very often differs for different individuals. Thus, when different individuals consult the same database or information system, which uses such linguistic terms, these differences should somehow be taken into account, in order to avoid inconsistencies. These inconsistencies could have consequences on the decisions based on such data. In this paper we introduce a new database model based on quasi-order relations (reflexive and transitive). The proposed model describes the mathematical background of the assessment of values to database attributes, using the theory of evaluation problems and sets. The constructed model offers the possibility to reduce possible inconsistencies and presents an interesting new approach to the theory of database design and linguistic terms.
Software pipelining: a comparison and improvement
Authors: Reese B. Jones, Vicki H. Allan
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

Software pipelining can significantly increase the execution rate of loops. Each of the four major software pipelining algorithms takes a different approach to software pipelining. This paper discusses each method and explores some of the similarities and differences among the methods. On loops consisting of a single basic block, the Perfect Pipelining Algorithm [1] is the only software pipelining algorithm that currently achieves time optimality, in the absence of resource constraints. A technique for unrolling the loop before pipelining is presented as an improvement to software pipelining, as it can allow Lam's algorithm [2] to achieve time optimality for these restricted loops. Unrolling has an advantage over Perfect Pipelining because it can reduce the code space required for the software pipeline.
Probabilistic Visual Learning for Object Representation
Authors: Baback Moghaddam, Alex Pentland
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

We present an unsupervised technique for visual learning, which is based on density estimation in high-dimensional spaces using an eigenspace decomposition. Two types of density estimates are derived for modeling the training data: a multivariate Gaussian (for unimodal distributions) and a Mixture-of-Gaussians model (for multimodal distributions). These probability densities are then used to formulate a maximum-likelihood estimation framework for visual search and target detection for automatic object recognition and coding. Our learning technique is applied to the probabilistic visual modeling, detection, recognition, and coding of human faces and nonrigid objects, such as hands.
Getting more from the data in a multinomial selection problem
Authors: J. O. Miller, Barry L. Nelson, Charles H. Reilly
Venue: Proceedings of the 28th conference on Winter simulation (1996)

We consider the problem of determining which of k simulated systems is most likely to be the best per former based on some objective performance measure. The standard experiment is to generate v in dependent vector observations (replications) across the k- systems. A classical multinomial selection pro cedure, BEM (Bechhofer, Elmaghraby, and Morse), prescribes a minimum number of replications so that the probability of correctly selecting the true best system meets or exceeds a prespecified probability. Assuming that larger is better, BEM selects as best the system having the largest value of the performance measure in more replications than any other. We propose using these same v replications across k systems to form vk pseudoreplications (no longer in dependent) that contain one observation from each system, and again select as best the system having the largest value of the performance measure in more pseudoreplications than any other. We expect that this new procedure, AVC (all vector comparisons), dominates BEM in the sense that AVC will never require more independent replications than DEM to meet a prespecified probability of correct selection. We present analytical and simulation results to show how AVC fares versus BEM for different underly ing distribution families, different numbers of populations and various values of v. We also present results for the closely related problem of estimating the probability that a specific system is the best.
Estimating the Viewing Parameters of Random, Noisy Projections of Asymmetric Objects for Tomographic Reconstruction
Authors: Peter D. Lauren, N. Nandhakumar
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

The ability to determine the viewing parameters of objects from their projections has enabled well established tomographic techniques to be employed in the three-dimensional reconstruction of objects from images obtained via modalities where the orientation of the objects cannot be controlled. A method is described for the determination of the viewing parameters of randomly acquired projections of asymmetric objects. It extends upon the common lines algorithm by determining the relative orientation of projections from the location of lines of intersection among the Fourier transforms of the projections in three-dimensional Fourier space. A new technique for finding the lines of intersection in the presence of translational displacement, and for subsequently finding the translational displacement, is presented. The complete algorithm is described and its efficacy is demonstrated using real data. A new technique for dealing with noise is also discussed.
Reengineering a Single Threaded Embedded Missile Applicationonto a Parallel Processing Platform Using MetaH
Authors: David J. McConnell, Bruce Lewis, Lisa Gray
Venue: Real-Time Systems (1998)

This paper describes a software/hardware architectural transformation of a single threaded, cyclic executive based missile application to a multitasking, distributed application using MetaH (Binns and Vestal 1993a, 1993b, 1995). The benefits of this process are: it provides a traceable path to the original language implementation, it achieves data encapsulation and data flow understanding, it separates out concurrent processes, it results in an object based design, and MetaH provides a robust mechanism for multiprocessor distribution.
Improved channel routing by via minimization and shifting
Authors: Chung-Kuan Cheng, David N. Deutsch
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

Channel routing area improvement by means of via minimization and via shifting in two dimensions (compaction) is readily achievable. Routing feature area can be minimized by wire straightening. The implementation of algorithms for each of these procedures has produced a solution for Deutsch's Difficult Example, the standard channel routing benchmark, that is more than 5% smaller than the best result published heretofore. Suggestions for possible future work are also given.
Exploiting Background Information in Knowledge Discovery from Text
Authors: Ronen Feldman, Haym Hirsh
Venue: Journal of Intelligent Information Systems (1997)

This paper describes the FACT system for knowledge discovery from text. It discovers associations&mdash;patterns of co-occurrence&mdash;amongst keywords labeling the items in a collection of textual documents. In addition, when background knowledge is available about the keywords labeling the documents FACT is able to use this information in its discovery process. FACT takes a query-centered view of knowledge discovery, in which a discovery request is viewed as a query over the implicit set of possible results supported by a collection of documents, and where background knowledge is used to specify constraints on the desired results of this query process. Execution of a knowledge-discovery query is structured so that these background-knowledge constraints can be exploited in the search for possible results. Finally, rather than requiring a user to specify an explicit query expression in the knowledge-discovery query language, FACT presents the user with a simple-to-use graphical interface to the query language, with the language providing a well-defined semantics for the discovery actions performed by a user through the interface.
Multidatabase Query Optimization
Authors: Cem Evrendilek, Asuman Dogac, Sena Nural, Fatma Ozcan
Venue: Distributed and Parallel Databases (1997)

A multidatabase system (MDBS) allows the users to simultaneously access heterogeneous, and autonomous databases using an integrated schema and a single global query language. The query optimization problem in MDBSs is quite different from the query optimization problem in distributed homogeneous databases due to schema heterogeneity and autonomy of local database systems. In this work, we consider the optimization of query distribution in case of data replication and the optimization of intersite joins, that is, the join of the results returned by the local sites in response to the global subqueries. The algorithms presented for the optimization of intersite joins try to maximize the parallelism in execution and take the federated nature of the problem into account. It has also been shown through a comparative performance study that the proposed intersite join optimization algorithms are efficient. The approach presented can easily be generalized to any operation required for intersite query processing.The query optimization scheme presented in this paper is being implemented within the scope of a multidatabase system which is based on OMG&lsquo;s object management architecture.
A Vlsi Architecture for Separable 2-D Discrete Wavelet Transform
Authors: Jimmy C. Limqueco, Magdy A. Bayoumi
Venue: Journal of VLSI Signal Processing Systems (1998)

In this paper, an efficient semi-systolic array architecture for separable 2-D Discrete Wavelet Transform (DWT) is introduced. The semi-systolic array is applicable to any convolution that requires an arbitrary subsampling function. The semi-systolic array presents a better implementation of the convolution function of DWT. This kind of implementation offers a higher efficiency compared to regular systolic implementation when applied for 2-D DWT. The architecture has an efficiency of at least 91% which increases proportional to the number of octaves with no change in the architecture design except for minor modifications to the control logic and memory size. The propose architecture is scalable for different size of filter and different number of octave. The communication routing is minimum since data transfers are limited to immediate neighboring processors. The components of the architecture are fairly regular and consist of minimum number of computational units which makes it a good candidate for VLSI implementation.
Chip-planning, placement, and global routing of macro/custom cell integrated circuits using simulated annealing
Authors: Carl Sechen
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

The algorithms and the implementation of a new macro/custom cell chip-planning, placement, and global routing package are presented. The simulated-annealing-based placement algorithm proceeds in two stages. In the first stage, the interconnect area around the individual cells is determined using a new dynamic interconnect area estimator. The second stage consists of: (1) a channel definition step, using a new channel definition algorithm, (2) a global routing step, using a new global router algorithm, and (3) a placement refinement step. This strategy has produced placements which require very little placement modification during detailed routing. Total interconnect length savings of 8 to 49 percent were achieved in experiments on 9 industrial circuits. Furthermore, circuit-area reductions ranged from 4 to 56 percent versus a variety of other placement methods.
Simulation optimization in strategic location of semi-finished products in a pull-type production system
Authors: Farhad Azadivar, Junhong Shu, Moyeen Ahmad
Venue: Proceedings of the 28th conference on Winter simulation (1996)

In many manufacturing environments there are intermediate states of semi-finished products that are shared by several members of the product family. This is true, for instance, in machine tools manufacturing or manufacturing of several printed circuits from the same basic board. For these system, processing parts ahead of time and locating them at strategic stages of the operation may improve the lead time with relatively low levels of work-m-process inventory. This is especially true when production stages do not have a dedicated resource and share a limited number of production equipment. In this paper a simulation model has been developed and interfaced with a simulation-optimization method to determine these levels. Furthermore, a method has been suggested to group optimization parameters such that fewer variables need to be optimized.
Model-Based Image Enhancement of Far Infrared Images
Authors: Ralph Highnam, Michael Brady
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

We devise enhancement algorithms for far infrared images based upon a model of an idealized far infrared image being piecewise-constant. We then apply two known enhancement algorithms: median filtering and spatial homomorphic filtering, and then extend the model to develop spatiotemporal homomorphic filtering. The algorithms have been applied to several image sequences and work well, showing significant image enhancement.
A new approach to security system development
Authors: Silvana Castano, Giancarlo Martella, Pierangela Samarati
Venue: Proceedings of the 1994 workshop on New security paradigms (1994)

The development of a security system is generally performed through a multiphase methodology, starting from the initial preliminary analisys of the application environment, up to the physical implementation of the security mechanisms. In this framework, we propose a new approach for the development of security systems based on the reuse of existing security specifications. In the paper we illustrate how reusable specifications can be built by analyzing existing security systems, and how they can be used to develop new security systems not from scratch.
Video Grading of Oranges in Real-Time
Authors: Michael Recce, Alessio Plebe, Giuseppe Tropiano, John Taylor
Venue: Artificial Intelligence Review (1998)

We describe a novel system for grading oranges into three quality bands, according to their surface characteristics. The system is designed to process fruit with a wide range of size (55&ndash;100 mm), shape (spherical to highly eccentric), surface coloration and defect markings. This application requires both high throughput (5&ndash;10 oranges per second) and complex pattern recognition. The grading is achieved by simultaneously imaging each item of fruit from six orthogonal directions as it is propelled through an inspection chamber. In order to achieve the required throughput, the system contains state-of-the-art processing hardware, a novel mechanical design, and three separate algorithmic components. One of the key improvements in this system is a method for recognising the point of stem attachment (the calyx) so that it can be distinguished from defects. A neural network classifier on rotation invariant transformations (Zernike moments) is used to recognise the radial colour variation that is shown to be a reliable signature of the stem region. The succession of oranges processed by the machine constitute a pipeline, so time saved in the processing of defect free oranges is used to provide additional time for other oranges. Initial results are presented from a performance analysis of this system.
Finding equilibrium bidding strategies for a simulated timber auction
Authors: Michael Rothkopf, David Wood
Venue: Proceedings of the 17th conference on Winter simulation (1985)

This paper reports on a Monte Carlo simulation model of estimating and bidding in an unusual form of auction used by the U.S. Forest Service to sell logging rights. The model results must be precise enough to find Nash equilibrium bidding strategies and to distinguish how various measures of auction performance differ under variation in current auction rules. This paper briefly describes the auction, several different computational approaches, and their relative effectiveness. We state several conclusions we were able to reach using the simulator. These include identifying a situation in which changed auction rules could significantly increase government revenue.
Terrestrial Time Signal Dissemination
Authors: Reiner Lichtenecker
Venue: Real-Time Systems (1997)

This article presents an overview of terrestrial time signal stations and broadcasted information that is available for the synchronisation of radio clocks. It excludes time synchronization using the Global Positioning System GPS, which is discussed in an article by P. Dana in this issue. A number of effects that influence achievable synchronization accuracies, relating to the operating conditions of broadcasting radio stations as well as the transmission of radio signals, are discussed. Techniques employed in receivers to improve safety and accuracy of provided timing information are also reviewed.
A quantitative comparison of parallel computation models
Authors: Ben H. H. Juurlink, Harry A. G. Wijshoff
Venue: ACM Transactions on Computer Systems (TOCS) (1998)

In recent years, a large number of parallel computation models have been proposed to replace the PRAM as the parallel computation model presented to the algorithm designer. Although mostly the theoretical justifications for these models are sound, and many algorithmic results where obtained through these models, little experimentation has been conducted to validate the effectiveness of these models for developing cost-effective algorithms and applications on existing hardware platforms. In this article a first attempt is made to perform a detailed experimental account on the preciseness of these models. The achieve this, three models (BSP, E-BSP, and BPRAM) were selected and validated on five parallel platforms (Cray T3E, Thinking Machines CM-5, Intel Paragon, MasPar MP-1, and Parsytec GCel). The work described in this article consists of three parts. First, the predictive capabilities of the models are investigated. Unlike previous experimental work, which mostly demonstrated a close match between the measuredd and predicted execution times, this article shows that there are several situations in which the models do not precisely predict the actual runtime behavior of an algorithm implementation. Second, a comparison between the models is provided in order to determine the model that induces that most efficient algorithms. Lastly, the performance achieved by the model-derived algorithms is compared with the performace attained by machine-specific algorithms in order to examine the effectiveness of deriving fast algorithms through the formalisms of the models.
A Spectral Element Technique with a Local Spectral Basis
Authors: Kelly Black
Venue: SIAM Journal on Scientific Computing (1997)

A novel spectral element technique is examined which is implemented using a multidomain Legendre--Tau method where the approximation is found in the spectral space. Here the test functions are different from the approximating elements. Examples are given for a simple 1D Helmholtz equation and for a Burgers equation with a small viscosity, and a 2D example is given.
On Deducing Timing Constraints in the Verification of Interfaces
Authors: F. Mavaddat, T. Gahlinger
Venue: Formal Methods in System Design (1998)

We formulate several device timing characteristics, and introduce the concept of separation bounds to model devices&lsquo; waveform timing specifications. Separation bounds are used to verify that the produced timings of one device&lsquo;s signals satisfy the required timings of another device to which it is to be connected. We show that even if we know the bounds on two pairs of signal events, say (u, v) and (v, w), we cannot always deduce the correct bounds on (u, w). However, we show that the shortest path method proposed in [4]&mdash;to deduce tight constraints from a partial specification&mdash;is safe, in the sense that an affirmative answer to satisfiability is trustworthy while a negative answer may be pessimistic.
The Min-cut shuffle: toward a solution for the global effect problem of Min-cut placement
Authors: Inderpal Bhandari, Mark Hirsch, Daniel Siewiorek
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

The Global Effect Problem is introduced in the context of adapting Min-cut partitioning for Min-cut placement. A simplified version of the problem is solved in linear time by using a new algorithm, the Min-cut Shuffle. A detailed analysis and implementation for the algorithm is presented.
Resource Placement in Torus-Based Networks
Authors: Myung M. Bae, Bella Bose
Venue: IEEE Transactions on Computers (1997)

This paper investigates methods to locate system resources, such as expensive hardware or software modules, to provide the most effective cost/performance trade-offs in a torus parallel machine. This paper contains some solutions to perfect distance-t and perfect/quasi-perfect j-adjacency placement in a k-ary n-cube and a torus using Lee distance error-correcting codes. It also presents generalized resource placement (j-adjacency with distance-t placement) methods based on the concept of covering radius of Lee distance codes.
Feature Selection: Evaluation, Application, and Small Sample Performance
Authors: Anil Jain, Douglas Zongker
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

A large number of algorithms have been proposed for feature subset selection. Our experimental results show that the sequential forward floating selection (SFFS) algorithm, proposed by Pudil et al., dominates the other algorithms tested. We study the problem of choosing an optimal feature set for land use classification based on SAR satellite images using four different texture models. Pooling features derived from different texture models, followed by a feature selection results in a substantial improvement in the classification accuracy. We also illustrate the dangers of using feature selection in small sample size situations.
On the Achievement of the Griesmer Bound
Authors: Tatsuya Maruta
Venue: Designs, Codes and Cryptography (1997)

The main theorem in this paper is that there does not exist an [n,k,d]_q code with d = (k-2)q^{k-1} - (k-1)q^{k-2} attaining the Griesmer bound for q \ge k, ~k=3,4,5k=3,4,5...~ and for q \ge 2k-3, k \ge 6.