ppxscal/embedding_network huggingface dataset:
A new approach to the use of satisfiability in false path detection
Authors: Felipe S. Marques, Renato P. Ribas, Sachin Sapatnekar, André I. Reis
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper presents a novel method for false path detection using satisfiability. It is based on circuit node properties that are related to non-testable stuck-at faults as well as to false path detection. When compared to traditional satisfiability methods that generate sat instances associated to paths, the proposed method is more efficient. This efficiency derives from the fact that most digital circuits have a number of nodes that is smaller than the number of paths.
Towards Efficient Supercomputing: A Quest for the Right Metric
Authors: Chung-Hsing Hsu, Wu-chun Feng, Jeremy S. Archuleta
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 11 - Volume 12 (2005)

Over the past decade, we have been building less and less efficient supercomputers, resulting in the construction of substantially larger machine rooms and even new buildings. In addition, because of the thermal power envelope of these supercomputers, a small fortune must be spent to cool them. These infrastructure costs coupled with the additional costs of administering and maintaining such (unreliable) supercomputers dramatically increases their total cost of ownership. As a result, there has been substantial interest in recent years to produce more reliable and more efficient supercomputers that are easy to maintain and use. But how does one quantify efficient supercomputing? That is, what metric should be used to evaluate how efficiently a supercomputer delivers answers? We argue that existing efficiency metrics such as the performance-power ratio are insufficient and motivate the need for a new type of efficiency metric, one that incorporates notions of reliability, availability, productivity, and total cost of ownership (TCO), for instance. In doing so, however, this paper raises more questions than it answers with respect to efficiency. And in the end, we still return to the performance-power ratio as an efficiency metric with respect to power and use it to evaluate a menagerie of processor platforms in order to provide a set of reference data points for the high-performance computing community.
Inertial Sensed Ego-motion for 3D Vision
Authors: Jorge Lobo, Jorge Dias
Venue: Journal of Robotic Systems (2004)

Inertial sensors attached to a camera can provide valuable data about camera pose and movement. In biological vision systems, inertial cues provided by the vestibular system are fused with vision at an early processing stage. In this article we set a framework for the combination of these two sensing modalities. Cameras can be seen as ray direction measuring devices, and in the case of stereo vision, depth along the ray can also be computed. The ego-motion can be sensed by the inertial sensors, but there are limitations determined by the sensor noise level. Keeping track of the vertical direction is required, so that gravity acceleration can be compensated for, and provides a valuable spatial reference. Results are shown of stereo depth map alignment using the vertical reference. The depth map points are mapped to a vertically aligned world frame of reference. In order to detect the ground plane, a histogram is performed for the different heights. Taking the ground plane as a reference plane for the acquired maps, the fusion of multiple maps reduces to a 2D translation and rotation problem. The dynamic inertial cues can be used as a first approximation for this transformation, allowing a fast depth map registration method. They also provide an image independent location of the image focus of expansion and center of rotation useful during visual based navigation tasks. &copy; 2004 Wiley Periodicals, Inc.
A space-time channel simulator for MIMO channels based on the geometrical one-ring scattering model: Research Articles
Authors: Matthias Pätzold, Bjørn Olav Hogstad
Venue: Wireless Communications Mobile Computing (2004)

This paper introduces a general concept for the design of efficient multi-input multi-output (MIMO) narrowband fading channel simulators. The proposed procedure is applied on a reference model for the geometrical one-ring scattering model consisting of an infinite number of local scatterers laying on a ring around the mobile station (MS). The statistical properties of both the reference model and the simulation model are studied. Closed-form solutions are presented, for example for the space-time cross-correlation function (CCF), the time autocorrelation function (ACF) and the two-dimensional (2-D) space CCF. It will be shown, how the parameters of the MIMO channel simulator can be determined for any given space-time CCF describing the reference model. The excellent performance of the proposed space-time channel simulator is demonstrated by comparing its temporal and spatial correlation properties with those of the reference model. Moreover, it is demonstrated how the channel simulator can be used to analyze the statistics of the capacity of MIMO channels from time-domain simulations. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Comparison of replication strategies for content availability in C2P2 networks
Authors: Shahram Ghandeharizadeh, Shyam Kapadia, Bhaskar Krishnamachari
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

This study investigates alternative continuous media replication techniques and their impact on content availability in a mobile car-to-car peer-to-peer (C2P2) network of devices. Using aggregate availability latency as a metric, we compare a simple random replication mechanism with a family of techniques that compute the degree of replication for each title based on its popularity, i.e., frequency of access. We use a simulation study along with some supporting analytical analysis for this comparison. Obtained results demonstrate the following key lesson. When total storage capacity of the network is significantly larger than the clip repository size, a random replication technique is sufficient. Otherwise, there is a large parameter space where the frequency-based replication schemes provide superior performance.
Global Minimization via Piecewise-Linear Underestimation
Authors: O. L. Mangasarian, J. B. Rosen, M. E. Thompson
Venue: Journal of Global Optimization (2005)

Given a function on Rn with many multiple local minima we approximate it from below, via concave minimization, with a piecewise-linear convex function by using sample points from the given function. The piecewise-linear function is then minimized using a single linear program to obtain an approximation to the global minimum of the original function. Successive shrinking of the original search region to which this procedure is applied leads to fairly accurate estimates, within 0.57%, of the global minima of synthetic nonconvex piecewise-quadratic functions for which the global minima are known exactly.
Constituting, traversing and perforating boundaries: embodied interaction in immersive virtual spaces
Authors: Petra Gemeinboeck
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

This paper looks at the conditions and the constitution of the boundary between participants and virtual environments. Based on two of the author's immersive, interactive scenarios, this boundary is regarded as a transformative extension of the participants' body. As the CAVE® environment Uzume is bodily explored through moving and gesturing, participants continuously affect the current environment's state and behaviour. The tele-immersive installation Ma?a--Veil of Illusion connects two remote sites, creating a dynamically evolving virtual passage in-between. Here the design of interfacing the human participant and the virtual surrounding is inseparably interwoven with the evolutionary behaviours of the environments themselves. It challenges the Cartesian notion of the body as a passive receptor and addresses its constituting role of the relationship between the participant's embodied self and its computated representation. Considering this boundary as dynamic and permeable, enables a mutual relationship that is able to unfold beyond the author's predefined responses and interpretations.
Complexity of propositional nested circumscription and nested abnormality theories
Authors: Marco Cadoli, Thomas Eiter, Georg Gottlob
Venue: ACM Transactions on Computational Logic (TOCL) (2005)

Circumscription has been recognized as an important principle for knowledge representation and common-sense reasoning. The need for a circumscriptive formalism that allows for simple yet elegant modular problem representation has led Lifschitz (AIJ, 1995) to introduce nested abnormality theories (NATs) as a tool for modular knowledge representation, tailored for applying circumscription to minimize exceptional circumstances. Abstracting from this particular objective, we propose LCIRC, which is an extension of generic propositional circumscription by allowing propositional combinations and nesting of circumscriptive theories. As shown, NATs are naturally embedded into this language, and are in fact of equal expressive capability. We then analyze the complexity of LCIRC and NATs, and in particular the effect of nesting. The latter is found to be a source of complexity, which climbs the Polynomial Hierarchy as the nesting depth increases and reaches PSPACE-completeness in the general case. We also identify meaningful syntactic fragments of NATs which have lower complexity. In particular, we show that the generalization of Horn circumscription in the NAT framework remains coNP-complete, and that Horn NATs without fixed letters can be efficiently transformed into an equivalent Horn CNF, which implies polynomial solvability of principal reasoning tasks. Finally, we also study extensions of NATs and briefly address the complexity in the first-order case. Our results give insight into the &ldquo;cost&rdquo; of using LCIRC (respectively, NATs) as a host language for expressing other formalisms such as action theories, narratives, or spatial theories.
Sensor management using an active sensing approach
Authors: Chris Kreucher, Keith Kastella, Alfred O. Hero,  III
Venue: Signal Processing (2005)

An approach that is common in the machine learning literature, known as active sensing, is applied to provide a method for managing agile sensors in a dynamic environment. We adopt an active sensing approach to scheduling sensors for multiple target tracking applications that combines particle filtering, predictive density estimation, and relative entropy maximization. Specifically, the goal of the system is to learn the number and states of a group of moving targets occupying a surveillance region. At each time step, the system computes a sensing action to take, based on an entropy measure called the Rényi divergence. After the measurement is made, the system updates its probability density on the number and states of the targets. This procedure repeats at each time where a sensor is available for use. The algorithms developed here extend standard active sensing methodology to dynamically evolving objects and continuous state spaces of high dimension. It is shown using simulated measurements on real recorded target trajectories that this method of sensor management yields more than a ten fold gain in sensor efficiency when compared to periodic scanning.
A modular approach to sprouts
Authors: Riccardo Focardi, Flaminia L. Luccio
Venue: Discrete Applied Mathematics (2004)

Sprouts is a two players game that was first introduced by M.S. Patterson and J.H. Conway in 1967. There are two players A and B that, starting from a set of x0 vertices, build a graph by alternatively connecting any two vertices with degree less than three with an edge, and by drawing a new vertex on this new edge. A move is allowed only if the new connection maintains the planarity of the graph. The player that executes the last possible move is the winner. We study some new topological properties of this game and we show their effectiveness by giving a complete analysis of the case x0 = 7 for which, to the best of our knowledge, no formal proof has been previously given.
Remote method invocation as a first-class citizen
Authors: Walter Cazzola
Venue: Distributed Computing (2003)

The classical remote method invocation (RMI) mechanism adopted by several object-based middleware is 'black-box' in nature, and the RMI functionality, i.e., the RMI interaction policy and its configuration, is hard-coded into the application. This RMI nature hinders software development and reuse, forcing the programmer to focus on communication details often marginal to the application being developed. Extending the RMI behavior with extra functionality is also a very difficult job, because added code must be scattered among the entities involved in communications.This situation could be improved by developing the system in several separate layers, confining communications and related matters to specific layers. As demonstrated by recent work on reflective middleware, reflection represents a powerful tool for realizing such a separation and therefore overcoming the problems referred to above. Such an approach improves the separation of concerns between the communication-related algorithms and the functional aspects of an application. However, communications and all related concerns are not managed as a single unit that is separate from the rest of the application, which makes their reuse, extension, and management difficult. As a consequence, communications concerns continue to be scattered across the meta-program, communication mechanisms continue to be black-box in nature, and there is only limited opportunity to adjust communication policies through configuration interfaces.In this paper we examine the issues raised above, and propose a reflective approach specially designed to open up the Java RMI mechanism. Our proposal consists of a new reflective model, called multi-channel reification, that reflects on and reifies communication channels, i.e., it renders communication channels first-class citizens. This model is designed both for developing new communication mechanisms and for extending the behavior of communication mechanisms provided by the underlying system. Our approach is embodied in a framework called mChaRM, which is described in detail in this paper.
Tissue Map Based Craniofacial Reconstruction and Facial Deformation Using RBF Network
Authors: Yuru Pei, Hongbin Zha, Zhongbiao Yuan
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper we present a novel craniofacial reconstruction method employing statistical tissue thickness information. The tissue thickness data gotten from CT images are represented as 2D tissue maps. The input (target) skull model is parameterized onto a 2D planar map and the landmarks are utilized to train a RBFN (Radial Basis Function Network), which realizes warping of planar maps between the target tissue and the generic tissue. The generic tissue is aligned onto the target skull by applying the trained network onto it, and thus the target facial map can be obtained by a simple addition of the warped generic maps. Finally, we interactively deform the model based on a RBFN to make the facial meshes more personalized, and map the texture from orthogonal photos onto the reconstructed model to improve rendering effects. Experiment results show that the proposed approach is helpful in improving the recognition ability in forensic applications.
A unified decimal floating-point architecture for the support of high-level languages
Authors: Frederic N. Ris
Venue: ACM SIGNUM Newsletter (1976)

This paper summarizes a proposal for a decimal floating-point arithmetic interface for the support of high-level languages, consisting both of the arithmetic operations observed by application programs and facilities to produce sub-routine libraries accessible from these programs. What is not included here are the detailed motivations, examinations of alternatives, and implementation considerations which will appear in the full work.
An effective and efficient ATPG-based combinational equivalence checker
Authors: Ronald P. Lajaunie, Michael S. Hsiao
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

An effective and efficient ATPG-based combinational equivalence checker.
A Signal-to-Interference Ratio Based Downlink Scheduling Scheme for WCDMA Mobile Communication System
Authors: Jen-Shun Yang, Chien-Chao Tseng, Ray-Guang Cheng
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In this paper, we propose a QoS-aware power-strength classified packet scheduling (PCPS) scheme that can classify the transmission power-strength of a VBR connection into several classes and determine the admitted service rate of each class at connection setup time. During the transmission time of each connection, PCPS scheme can dynamically adjust the downlink service rate of each connection in accordance with the admitted service rate of the current transmission power-strength class while retaining all connectionýs Frame Error Rate requirements. With this power-strength classified scheduling, PCPS scheme can decrease the average packet delay and increase the bandwidth utilization. Furthermore, a two-stage scheduling architecture is also employed to reduce the scheduling complexity resulted from simultaneous adjustment of both service rate and transmission power-strength in WCDMA. Performance results show that the delay bound and the packet loss ratio of a VBR connection can be guaranteed.
Discovery of regulatory connections in microarray data
Authors: Michael Egmont-Petersen, Wim de Jonge, Arno Siebes
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

In this paper, we introduce a new approach for mining regulatory interactions between genes in microarray time series studies. A number of preprocessing steps transform the original continuous measurements into a discrete representation that captures salient regulatory events in the time series. The discrete representation is used to discover interactions between the genes. In particular, we introduce a new across-model sampling scheme for performing Markov Chain Monte Carlo sampling of probabilistic network classifiers. The results obtained from the microarray data are promising. Our approach can detect interactions caused both by co-regulation and by control-regulation.
On performance analysis of heterogeneous parallel algorithms
Authors: Alexey Lastovetsky, Ravi Reddy
Venue: Parallel Computing (2004)

The paper presents an approach to performance analysis of heterogeneous parallel algorithms. As a typical heterogeneous parallel algorithm is just a modification of some homogeneous one, the idea is to compare the heterogeneous algorithm with its homogeneous prototype, and to assess the heterogeneous modification rather than analyse the algorithm as an isolated entity. A criterion of optimality of heterogeneous parallel algorithms is suggested. A parallel algorithm of matrix multiplication on heterogeneous clusters is used to illustrate the proposed approach.
Quasiinvariants of S3
Authors: Jason Bandlow, Gregg Musiker
Venue: Journal of Combinatorial Theory Series A (2005)

Let Sij represent a transposition in Sn. A polynomial P in Q[Xn] is said to be m-quasiinvariant with respect to Sn if (xi - xj)2m+1 divides (1 - sij)P for all 1 ≤ i, j ≤ n. We call the ring of m- quasiinvariants, QIm [Xn]. We describe a method for constructing a basis for the quotient QIm[X3]/ (e1, e2, e3). This leads to the evaluation of certain binomial determinants that are interesting in their own right.
Queueing properties of feedback flow control systems
Authors: Dongyu Qiu, Ness B. Shroff
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

In this paper, we consider a network with both controllable and uncontrollable flows. Uncontrollable flows are typically generated from applications with stringent QoS requirements and are given high priority. On the other hand, controllable flows are typically generated by elastic applications and can adapt to the available link capacities in the network. We provide a general model of such a system and analyze its queueing behavior. Specially, we obtain a lower bound and an asymptotic upper bound for the tail of the workload distribution at each link in the network. These queueing results provide us with guidelines on how to design a feedback flow control system. Simulation results show that the lower bound and asymptotic upper bound are quite accurate and that our feedback control method can effectively control the queue length in the presence of both controllable and uncontrollable traffic. Finally, we describe a distributed strategy that uses the notion of Active Queue Management (AQM) for implementing our flow control solution.
Disambiguation of finite-state transducers
Authors: N. Smaili, P. Cardinal, G. Boulianne, P. Dumouchel
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

The objective of this work is to disambiguate transducers which have the following form: T = R o D and to be able to apply the determinization algorithm described in (Mohri, 1997). Our approach to disambiguating T = R o D consists first of computing the composition T and thereafter to disambiguate the transducer T. We will give an important consequence of this result that allows us to compose any number of transducers R with the transducer D, in contrast to the previous approach which consisted in first disambiguating transducers D and R to produce respectively D' and R', then computing T' = R' o D' where T' is unambiguous. We will present results in the case of a transducer D representing a dictionary and R representing phonological rules.
A semantic-link-based infrastructure for web service discovery in P2P networks
Authors: Jie Liu, Hai Zhuge
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

An important issue arising from P2P applications is how to accurately and efficiently retrieve the required Web services from large-scale repositories. This paper resolves this issue by organizing services in the overlay combining the Semantic Service Link Network and the Chord P2P network. A service request will first be routed in the Chord according to the given service operation names and keywords. Then, the same request will be routed in the Semantic Link Network according to the service link type and semantic matching. Compared with previous P2P service discovery approaches, the proposed approach has two advantages: (1) produce more accurate and meaning results when searching for particular services in a P2P network; and (2) enable users and peers to discover services in a more flexible way.