ppxscal/embedding_network huggingface dataset:
Debunking some myths about structured and unstructured overlays
Authors: Miguel Castro, Manuel Costa, Antony Rowstron
Venue: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2 (2005)

We present a comparison of structured and unstructured overlays that decouples overlay topology maintenance from query mechanism. Structured overlays provide efficient support for simple exact-match queries but they constrain overlay topology to achieve this. Unstructured overlays do not constrain overlay topology or query complexity because they use flooding or random walks to discover data. It is commonly believed that structured overlays are more expensive to maintain, that their topology constraints make it harder to exploit heterogeneity, and that they cannot support complex queries efficiently. We performed a detailed comparison study using simulations driven by real-world traces that debunks these widespread myths. We describe techniques that exploit structural constraints to achieve low maintenance overhead and we present a modified neighbour selection algorithm that can exploit heterogeneity effectively. We also describe techniques to perform floods and random walks on structured topologies. These techniques exploit structural constraints to support complex queries with better performance than unstructured overlays.
A General Framework for Synthesis of Data Format Converters
Authors: Jongwoo Bae, Viktor K. Prasanna
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

A framework for design of area-efficient Data Format Converters (DFCs) with high throughput rate is given. DFCs are classified into various categories according to the specification of input design parameters. We show a design methodology for two representative categories of DFCs, asynchronous and synchronous DFCs. Our DFC designs are based on a two-dimensional architecture. Compared with known techniques, our two-dimensional design scheme results in area-efficient designs and the designs have maximum throughput.
Real-time geometric motion blur for a deforming polygonal mesh
Authors: N. Jones, J. Keyser
Venue: Proceedings of the Computer Graphics International 2005 (2005)

Motion blur is an important method for increasing the visual quality of real-time applications. This is especially true in the area of interactive applications, where designers often seek to add graphical flair to their programs. In many cases, these applications use animated characters, where a polygonal mesh is wrapped around an animated skeleton. As the skeleton moves, the mesh deforms. In this paper, we present a method for adding a geometric motion blur to a deforming polygonal mesh. The scheme we present keeps track of a character's motion silhouette, and uses this to create a polygonal mesh. When this mesh is inserted into the scene, it gives the appearance of an artistic motion blur for an object or particular character. This method is generic enough to work on nearly any type of moving polygonal model, and also approximates swept volumes.
Ontology-based Association Rules Retrieval using Protege Tools
Authors: Bin Shen, Min Yao, Zhaohui Wu, Yangu Zhang, Wensheng Yi
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The existed methods of association rules retrieval have not given enough high-level semantic information retrieval support. In order to resolve this problem, we propose a new method of association rules retrieval that is based on ontology and semantic web. Ontologybased association rules retrieval method can well deal with the problems of rule semantics sharing, rule semantics consistency and intelligibility. We discuss our ontology-based association rules retrieval method in detail and implement a prototype system called OARR using Protégé tools. In this paper, the system architecture of O-ARR is firstly brought forward, and then the retrieval methods of O-ARR are listed and discussed. Several key issues of O-ARR, which include establishment of rule retrieval ontology, annotation of ontology instance, query parse and user interface, are analyzed. Our method also gives a technique support for further rule information utilization, such as rule information automatic analysis and intelligent reasoning.
On the Computational Representation of Classical Logical Connectives
Authors: Jayshan Raghunandan, Alexander J. Summers
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective have on such calculi, and the resulting computational content. We identify two connectives 'if-and-only-if' and 'exclusive or' whose computational content is not well known, and whose cut elimination rules are non-trivial to define. In the case of the former, we define a term calculus and show that the computational content of several other connectives can be simulated. We show this is possible even for connectives not logically expressible with 'if-and-only-if'.
Backbone colorings for graphs: Tree and path backbones
Authors: Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
Venue: Journal of Graph Theory (2007)

We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G&thinsp;=&thinsp;(V,E) and a spanning subgraph H of G (the backbone of G), a backbone coloring for G and H is a proper vertex coloring V&thinsp;&rarr;&thinsp;&lcub;1,2,&hellip;&rcub; of G in which the colors assigned to adjacent vertices in H differ by at least two. We study the cases where the backbone is either a spanning tree or a spanning path. We show that for tree backbones of G the number of colors needed for a backbone coloring of G can roughly differ by a multiplicative factor of at most 2 from the chromatic number &chi;(G); for path backbones this factor is roughly ${{3}\over{2}}$. We show that the computational complexity of the problem &ldquo;Given a graph G, a spanning tree T of G, and an integer &ell;, is there a backbone coloring for G and T with at most &ell; colors?&rdquo; jumps from polynomial to NP-complete between &ell;&thinsp;=&thinsp;4 (easy for all spanning trees) and &ell;&thinsp;=&thinsp;5 (difficult even for spanning paths). We finish the paper by discussing some open problems. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 137&ndash;152, 2007 Part of the work was done while FVF and PAG were visiting the University of Twente.
System Level Approaches for Mitigation of Long Duration Transient Faults in Future Technologies
Authors: C. A. Lisboa, M. I. Erigson, L. Carro
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

The evolution of the technology in search of smaller and faster devices brings along the need for a new paradigm in the design of circuits tolerant to soft errors. The current assumption of transient pulses shorter than the cycle time of the circuit will no longer be true, thereby precluding the use of most of the mitigation techniques proposed so far. With transient faults duration spanning more than one clock cycle of operation, new fault tolerance solutions, working at the system level, with low area and performance overheads, must be devised. In this paper we propose the first steps in the direction of using low cost verification schemes at the algorithmic level, applied to general purpose matrix multiplication applications. Experimental results obtained with two different implementations of checker circuits using the proposed technique are presented and discussed.
Using lexical dependency and ontological knowledge to improve a detailed syntactic and semantic tagger of English
Authors: Andrew Finch, Ezra Black, Young-Sook Hwang, Eiichiro Sumita
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper presents a detailed study of the integration of knowledge from both dependency parses and hierarchical word ontologies into a maximum-entropy-based tagging model that simultaneously labels words with both syntax and semantics. Our findings show that information from both these sources can lead to strong improvements in overall system accuracy: dependency knowledge improved performance over all classes of word, and knowledge of the position of a word in an on-tological hierarchy increased accuracy for words not seen in the training data. The resulting tagger offers the highest reported tagging accuracy on this tagset to date.
Convergence analysis of stereophonic echo canceller with pre-processing-relation between pre-processing and convergence
Authors: A. Hirano
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper presents convergence characteristics of stereophonic echo cancellers with pre-processing. The convergence analysis of the averaged tap-weights show that the convergence characteristics depends on the relation between the impulse response in the far-end room and the changes of the pre-processing filters. Examining the uniqueness of the solution in the frequency domain leads us to the same relation. Computer simulation results show the validity of these analyses.
Redundancy Management for P2P Storage
Authors: Chris Williams, Philippe Huibonhoa, JoAnne Holliday, Andy Hospodor, Thomas Schwarz
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

P2P storage systems must protect data against temporary unavailability and the effects of churn in order to become platforms for safe storage. This paper evaluates and compares redundancy techniques for P2P storage according to availability, accessibility, and maintainability using traces and theoretical results.
Reliability-Aware Energy Management for Periodic Real-Time Tasks
Authors: Dakai Zhu, Hakan Aydin
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

The prominent energy management technique, Dynamic Voltage and Frequency Scaling (DVFS), was recently shown to have direct and adverse effects on system reliability. In this work, we investigate static and dynamic reliability-aware energy management schemes for a set of periodic real-time tasks to minimize energy consumption while preserving system reliability. Focusing on EDF scheduling, we first show that the static problem is NP-hard and propose two task-level utilizationbased heuristics. Then, we develop a job-level dynamic (on-line) scheme by building on the idea of wrappertasks, to monitor and manage dynamic slack efficiently in reliability-aware settings. Our schemes incorporate recovery tasks/jobs into the schedule as needed for reliability preservation, while still using the remaining slack for energy savings. Simulation results show that all the proposed schemes can achieve significant energy savings while preserving the system reliability. Moreover, the energy savings of the static heuristics are close to those of the static optimal solution by a margin of 5%.
Constant-Time Convexity Problems on Dense Reconfigurable Meshes
Authors: V. Bokka, H. Gurla, S. Olariu, J. L. Schwing
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Recently the authors have shown that the versatility of the reconfigurable mesh can be exploited to devise 0(1) time algorithms for a number of important computational tasks relevant to image processing, computer graphics, and computer vision. Specifically, we have shown that if one or two n-vertex (convex) polygons are pretiled, one vertex per processor, onto a reconfigurable mesh of size \sqrt n X \sqrt n, then a number of geometric problems can be solved in 0(1) time. These include testing an arbitrary polygon for convexity, the point location problem, the supporting lines problem, the stabbing problem, constructing the common tangents of two separable convex polygons, deciding whether two convex polygons intersect, and computing the smallest distance between the boundaries of two convex polygons. The novelty of these algorithms is that the problems are solved in the dense case. The purpose of this paper is to add to the list of problems that can be solved in 0(1) time in the dense case. The problems that we address are: determining the minimum area corner triangle for a convex polygon, determining the k-maximal vertices of a restricted class of convex polygons, updating the convex hull of a convex polygon in the presence of a set of query points, and determining a point that belongs to exactly one of two given convex polygons.
Joint data streaming and sampling techniques for detection of super sources and destinations
Authors: Qi Zhao, Abhishek Kumar, Jun Xu
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

Detecting the sources or destinations that have communicated with a large number of distinct destinations or sources during a small time interval is an important problem in network measurement and security. Previous detection approaches are not able to deliver the desired accuracy at high link speeds (10 to 40 Gbps). In this work, we propose two novel algorithms that provide accurate and efficient solutions to this problem. Their designs are based on the insight that sampling and data streaming are often suitable for capturing different and complementary regions of the information spectrum, and a close collaboration between them is an excellent way to recover the complete information. Our first solution builds on the standard hash-based flow sampling algorithm. Its main innovation is that the sampled traffic is further filtered by a data streaming module which allows for much higher sampling rate and hence much higher accuracy. Our second solution is more sophisticated but offers higher accuracy. It combines the power of data streaming in efficiently estimating quantities associated with a given identity, and the power of sampling in collecting a list of candidate identities. The performance of both solutions are evaluated using both mathematical analysis and trace-driven experiments on real-world Internet traffic.
Audio public key watermarking technique
Authors: T. Furon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper presents the application of the promising public key watermarking method to the audio domain. Its detection process does not need the original content nor the secret key used in the embedding process. It is the translation, in the watermarking domain, of a public key pair cryptosystem. We start to build the detector with some basic assumptions. This leads to a hypothesis test based on probability likelihood. But real audio signals do not satisfy the assumption of a Gaussian probability density function. Moreover, the use of an advanced human perception model to hide the watermark makes the detection issue a tough problem. Our works result in a new detection process offering a good test's power for a low probability of false alarm.
Short communication: Intercomparison of two K-schemes: Local versus non-local in calculating concentrations of pollutants in chemical and air-quality models
Authors: D. T. Mihailovic, K. Alapaty
Venue: Environmental Modelling Software (2007)

In this paper, we studied the performance of a local and non-local scheme for vertical diffusion in the atmospheric boundary layer and their impact on the concentration of pollutants calculated with chemical and air-quality models. In the local diffusion scheme, the vertical eddy-diffusivity is determined independently at each point based on local vertical gradients of wind and potential temperature. The non-local scheme determines an eddy-diffusivity profile based on a diagnosed boundary layer height and a turbulent vertical scale. Depending on the boundary layer stability regime, a modification was introduced into the non-local scheme to facilitate different values of the parameter in the equation for eddy-diffusivity. To examine the performance of the schemes, simulated and measured concentrations of a pollutant (NO"2), believed to be one of the most affected ones by the processes in the atmospheric boundary layer, were compared for the years 1999, 2001 and 2002. The comparison was made for the whole domain used in simulations performed by the chemical EMEP Unified model (version UNI-ACID, rv2.0) where schemes were incorporated.
Adaptive estimation of MPSK sequences with unknown carrier phase characteristics
Authors: Luzhou Xu
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Kam and Sinha (1995) have proposed a Viterbi-type algorithm for efficient estimation of both coded and uncoded MPSK sequences received over the AWGN channel with unknown carrier phase. The aim is to achieve the BEP performance of coherent detection. The metric for choosing the survivors employed by Kam et al. is non-adaptive in that the observation window length for forming the metric is fixed, and is chosen a priori based on knowledge of the fluctuation rate of the carrier phase. The work here seeks to render the algorithm adaptive by developing a decision metric that can be adjusted to achieve coherent node error event probability without prior knowledge of the carrier phase characteristics. The metric is based on the use of a first-order adaptive filter for carrier reference tracking. The input gain of the filter is adapted on-line based on the received signal samples. The resulting receiver structure can be interpreted as a per survivor processing receiver. Both analytical and simulation results are presented to show that the receiver performs well in the presence of both static and time-varying carrier phase processes. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Incorporating Geometric Algorithms in Impedance- and Admittance-Type Haptic Rendering
Authors: Ryo Kikuuwe, Hideo Fujimoto
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Geometric (proxy-based) haptic rendering algorithms are widely used in impedance-type haptic rendering. Such methods are useful for developing complex virtual environment because they reduce mechanistic problems of determining reaction forces into geometric problems of updating proxy positions. This paper aims to apply geometric algorithms to wider variations of haptic rendering systems. First, we present a method to include viscous damping in impedance-type haptic rendering. Second, we propose a method to utilize geometric algorithms in admittance-type haptic rendering. The results of implementation experiments are presented.
Automated Measure of Structural Coverage for LUSTRE Programs: a Case Study
Authors: Abdesselam Lakehal, Ioannis Parissis
Venue: Proceedings of the Second International Workshop on Automation of Software Test (2007)

Lustre is a synchronous data-flow declarative language widely used for safety-critical applications (avionics, energy, transport). Scade is a commercial tool-suite based on this language. We have proposed recently test coverage criteria for Lustre/Scade programs. The coverage assessment is fully automated and has been integrated in a prototype tool, Lustructu. This tool analyzes Lustre programs and extracts the conditions that a test input sequence must verify in order to meet a criterion. The associated measures are fully automated and non-intrusive. In this paper we present a case study that applies the coverage criteria to an alarm management software specification developed in Scade. The case study is used to illustrate the defined criteria as well as to evaluate their applicability and usefulness.
Innovative equation management techniques for implementation in kinematics and dynamics courses
Authors: C. J. Egelhoff
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The scope of this paper is the description of techniques and algorithms which engineers use in mathematically modeling physical systems. This work builds on recently developed algorithms that can be used to guide students in solving and understanding the mathematical modeling of physical systems. The techniques have been developed for general use in a number of applications, especially in a kinematics and dynamics course. The techniques allow easy manipulation of equations and systems of governing equations in complex situations. The algorithms and techniques generally guarantee, and actually restrict, the student to specify a design variables set in a manner that solutions are possible. This paper documents that the selection of design variables is difficult anti-intuitive and, in some cases, it is humanly impossible to generate all of the possible combinations of constraints. While currently the algorithms are implemented in a computer program, the techniques can also be applied to hand calculations. By way of demonstration, a kinematics and dynamics design software program was developed which exemplifies the usefulness and, more importantly, the key benefits of the developed algorithms. The intention is to show that the algorithms are applicable to any set of equations and can be used to enhance students problem solving abilities.
A model of successful student recruitment for satellite engineering technology programs
Authors: A. T. Cobb
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

In recent years, many engineering technology programs have experienced decreases in enrolment. Many theories exist as to the cause of this recent decrease in enrolment. Of these engineering technology programs, the Purdue Statewide Technology site in New Albany on the Indiana University Southeast campus has been an exception. Enduring many of the same obstacles as the main campus programs and additional obstacles as a Purdue Statewide Technology site remote from the main West LaFayette campus, the program in New Albany has grown at a steady rate. In this paper the authors, faculty members at the New Albany site, offer their own theories as to the recruiting issues faced not only by satellite engineering technology programs but those faced by engineering technology programs as a whole. Citing past examples and experiences, and their results, the authors assimilate characteristics for a model for successfully recruiting in an engineering technology program. The issues discussed by the authors include: 1) recruiting problems encountered by the satellite facility as an engineering technology program, including their origin and how these problems perpetuate, 2) solutions that have provided positive results at the New Albany site, 3) the most effective solutions in the form of a proposed model for an engineering technology recruiting program including experimental methods derived from extrapolation.
Derivation of Systolic Programs
Authors: Ladan Kazerouni, Basant Rajan, R. K. Shyamasundar
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

We describe a methodology for mapping linear recurrence equations to a spectrum of systolic architectures. First, we design a systolic program in a very general architecture referred to as Basic Systolic Architecture and establish the correctness of the implementation. Next, we show how efficient transformations/implementations of programs for different systolic architectures can be obtained through transformations such as projections and translations.