ppxscal/embedding_network huggingface dataset:
Clustering words for statistical language models based on contextual word similarity
Authors: A. Farhat, J.-F. Isabelle, D. O'Shaughnessy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper describes a new word clustering approach for statistical language modeling. The classification criteria used by our approach is the contextual word similarity used in a simplified clustering algorithm. This clustering technique was tested on the INRS speech recognizer using the spontaneous English corpora, ATIS. Automatic word classification increases the word accuracy rate by 8.6% with a perplexity reduction about of 6.9%.
Morphological colour operators in totally ordered lattices based on distances: Application to image filtering, enhancement and analysis
Authors: Jesús Angulo
Venue: Computer Vision and Image Understanding (2007)

The extension of mathematical morphology operators to multi-valued functions, and in particular to colour images, is neither direct nor general. In this paper, a generalisation of distance-based and lexicographical-based approaches is proposed, allowing the extension of morphological operators to colour images for any colour representation (e.g., RGB, LSH and L^*a^*b^*) and for any metric distance to a reference colour. The performance of the introduced operators is illustrated by means of different applications: colour feature extraction using openings (closings) by reconstruction, colour gradients for segmenting, colour denoising by the centre operator and colour enhancement by the contrast mapping. Examples from natural colour images and biomedical microscopic colour images are given.
Transformer tunnels: a framework for providing route-specific adaptations
Authors: Pradeep Sudame, B. R. Badrinath
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

In a network using links with diverse properties, a packet flow that is fine tuned for some links (by selecting a proper packet size, transmission rate, encryption method, etc.) may be inappropriate for other links. Ability to change the flow properties over segments of the network allows flows with different characteristics to coexist; making it possible to adapt to diverse link properties. Application-specific adaptation mechanisms (such as proxies) do not force adaptations on every packet flowing over the link and are therefore insufficient for this purpose. We propose the concept of transformer tunnels that force adaptations on all the packets flowing through them. Transformer tunnels can coexist with proxies because the adaptations provided by both are independent of each other. Transformer tunnels provide adaptations by means of transformation functions. By attaching various transformation functions to such tunnels, we can efficiently fine tune the flow properties. We also provide an API for developing transformation functions. We have implemented transformer tunnels and have used them in our wireless network. In this paper, we present the effects on mobile hosts that use this mechanism to transform flows over the last-hop link for reducing losses during handoffs, and for improving the link utilization.
The photon pipeline revisited: A hardware architecture to accelerate photon mapping
Authors: Shawn Singh, Petros Faloutsos
Venue: The Visual Computer: International Journal of Computer Graphics (2007)

With the development of real-time ray tracing in recent years, it is now very interesting to ask if real-time performance can be achieved for high-quality rendering algorithms based on ray tracing. In this paper, we propose a pipelined architecture to implement reverse photon mapping. Our architecture can use real-time ray tracing to generate photon points and camera points, so the main challenge is how to implement the gathering phase that computes the final image. Traditionally, the gathering phase of photon mapping has only allowed coarse-grain parallelism, and this situation has been a source of inefficiency, cache thrashing, and limited throughput. To avail fine-grain pipelining and data parallelism, we arrange computations so that photons can be processed independently, similar to the way that triangles are efficiently processed in traditional real-time graphics hardware. We employ several techniques to improve cache behavior and to reduce communication overhead. Simulations show that the bandwidth requirements of this architecture are within the capacity of current and future hardware, and this suggests that photon mapping may be a good choice for real-time performance in the future.
Characterization of Slice-Based H.264/AVC Encoded Video Traffic
Authors: Astrid Undheim, Yuan Lin, Peder J. Emstad
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

An explicit slice-based mode type selection scheme for use in H.264/AVC has recently been developed, which preserves the coding efficiency of H.264/AVC without requiring any modifications to the standard. The novel scheme avoids the burstiness effect of standard frame-based H.264/AVC by breaking up the Group Of Pictures (GOP) structure and each frame contains an intracoded slice at successive positions. A large intracoded frame is then only present at the beginning of each sequence. In addition, the first frame in each scene is large because of the prediction error when trying to predict the current frame based on the last frame in the previous scene. In this work a single slice-based encoded video stream is studied. The characteristics of the video stream divided into scenes using a scene change detection algorithm are investigated, looking at the marginal distributions and the correlations. A simulation study, looking at the multiplexing properties and the buffer overflow probabilities for a slice-based encoded stream compared to a frame-based encoded stream is also performed. The study shows that frame correlation is present only at small lags, and the periodic correlation structure seen in frame-based encoded video is mostly removed for the stream under study. Results from simulations show that the slice-based encoded video stream performs better than the frame-based encoded video stream in terms of lower packet loss rates and lower packet delay as long as the buffer size is small or the link utilization is moderate.
Static Name Control for FreshML
Authors: Francois Pottier
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

FreshML extends ML with constructs for declaring and manipulating abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable side effect. In practice, this means that FreshML allows writing programs that create fresh names and unintentionally fail to bind them. Following in the steps of early work by Pitts and Gabbay, this paper defines Pure FreshML, a subset of FreshML equipped with a static proof system that guarantees purity. Pure FreshML relies on a rich binding specification language, on user-provided assertions, expressed in a logic that allows reasoning about values and about the names that they contain, and on a conservative, automatic decision procedure for this logic. It is argued that Pure FreshML can express non-trivial syntax-manipulating algorithms.
High-quality speech synthesis using context-dependent syllabic units
Authors: T. Saito, Y. Hashimoto, M. Sakamoto
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We propose a new method for constructing a context-dependent Japanese syllabic unit inventory, which effectively incorporates the spectral influence of left- and right-hand neighboring phonemes on CV (consonant and vowel) syllabic units. The syllabic unit inventory is generated by using a set of phonemic clusters, which we define, to approximate the average spectral behavior of phonemes in triphone contexts. Unit inventories of multiple sizes are generated for a waveform-concatenation-based text-to-speech system. The sizes of the inventories range from 322 to 3892 units, according to the fineness of the phonemic cluster set used. The synthetic speech generated by using the largest one is highly natural and intelligible. We also discuss the scalability of the proposed unit inventories.
Design and Semantics of a Decentralized Authorization Language
Authors: Moritz Becker, Cedric Fournet, Andrew Gordon
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

We present a declarative authorization language that strikes a careful balance between syntactic and semantic simplicity, policy expressiveness, and execution efficiency. The syntax is close to natural language, and the semantics consists of just three deduction rules. The language can express many common policy idioms using constraints, controlled delegation, recursive predicates, and negated queries. We describe an execution strategy based on translation to Datalog with Constraints, and table-based resolution. We show that this execution strategy is sound, complete, and always terminates, despite recursion and negation, as long as simple syntactic conditions are met.
The magic Cauldron
Authors: Eric S. Raymond
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

This paper analyzes the economics of open-source software. It includes some explosion of common myths about software production economics, a game-theoretical account of why open-source cooperation is stable, and a taxonomy of open-source business models.
Acoustic sound from the electric guitar using DSP techniques
Authors: M. Karjalainen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

The electric guitar has been developed to withstand electric amplification and utilize (mostly analog) signal processing in order to create a multitude of timbres and sound types. Sometimes it would be desirable to play the same electric guitar, yet with a sound that resembles a good acoustic guitar or some other member of the plucked string instrument family. In this study we have investigated DSP techniques that can be used to shape the magnetic pickup output of the electric guitar to simulate acoustic instruments. This includes linear filtering for body simulation, time-varying modulation to generate beating of the harmonic components, and techniques to simulate the general temporal envelope of the plucked notes.
Distributed Routing Algorithms in all Optical Multi-Rings Topology Networks
Authors: Lynda Gastal, Stephane Rousseau
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

This paper investigates the problem of minimizing the worst packet latency and maximizing the ratio of utilization in all-optical multi-rings topologies. The topology is composed of several rings connected through one switch. In this framework, a distributed management protocol as well as a switching protocol are proposed and analyzed along different types of traffic. One of the aims of this framework is to propose a distributed management protocol that controls the access resources and thus the number of packets in nodes. Indeed, simulations results show the variation, in terms of number of packets in buffers, between the proposed protocol and the well known token ring protocol. We first focus on the algorithmic complexity of the related problem in a one ring network. Then, we analyze simulation results provided by the OMnet++ simulator, in terms of packet delay, latency, utilization ratio of the network, and also number of packets in nodes buffer. We compare proposed protocols with the well known token ring protocol giving theoretical analysis and also simulation results.
Bit allocation via recursive optimal pruning with applications to wavelet/VQ image compression
Authors: J. R. Goldschneider
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We address the problem of bit allocation to wavelet subbands by extending the recursive optimal pruning algorithm of Kiang, Baker, Sullivan and Chiu (see IEEE Transactions on Image Processing, vol.1, no.4, p.162-9, 1992) to bit allocation. We apply the algorithm to tree-structured vector quantizers used to code image subbands that result from the wavelet decomposition. We compare this method to the GBFOS algorithm, that is, the generalized Breiman, Friedman, Olshen, and Stone (1984) bit allocation, and show that it produces many additional bit allocations that lie close to the rate-distortion curve.
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
Authors: Borzoo Bonakdarpour, Sandeep S. Kulkarni
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complexity known as the state explosion problem. Symbolic techniques, in which elements of a problem are represented by Boolean formulae, are desirable in the sense that they often remedy the state explosion problem and time complexity of decision procedures. Although symbolic techniques have successfully been used in program verification, their benefits have not yet been exploited in the context of program synthesis and transformation extensively. In this paper, we present a symbolic method for automatic synthesis of fault-tolerant distributed programs. Our experimental results on synthesis of classical fault-tolerant distributed problems such as Byzantine agreement and token ring show a significant performance improvement by several orders of magnitude in both time and space complexity. To the best of our knowledge, this is the first illustration where programs with large state space (beyond 2100) is handled during synthesis.
Using word support model to improve Chinese input system
Authors: Jia-Lin Tsai
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper presents a word support model (WSM). The WSM can effectively perform homophone selection and syllable-word segmentation to improve Chinese input systems. The experimental results show that: (1) the WSM is able to achieve tonal (syllables input with four tones) and toneless (syllables input without four tones) syllable-to-word (STW) accuracies of 99% and 92%, respectively, among the converted words; and (2) while applying the WSM as an adaptation processing, together with the Microsoft Input Method Editor 2003 (MSIME) and an optimized bigram model, the average tonal and toneless STW improvements are 37% and 35%, respectively.
Holistic synthesis of human face images
Authors: J. Maciel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper presents a method to automatically synthesize human face images from holistic descriptions. We compactly represent the face set by a small set of prototypes, which can be used in simple ways to generate controlled morphings. This becomes possible because separation of 2D-shape and texture provides a faithful, closed and convex representation of images, and smoothes the mappings between images and their properties. With this approach, the user watches an image being continuously morphed according to his indications, and the synthesized images always obey the natural physiognomic constraints.
Improving the near-perfect hybrid filter bank performance in the presence of realization errors
Authors: M. A. A. Pinheiro
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Hybrid filter banks have received increasing attention in the literature, for applications such as high-speed, high-resolution A/D and D/A converter design. In the manufacturing process, however, the, filter coefficients of a hybrid filter bank are plagued with some errors due to technological limitations, particularly those of the analog filters, leading to degradation of the system performance. This work presents a novel method for improving the mean signal-to-noise-ratio of near-perfect reconstruction filter banks, taking into account such realization errors. The method consists in minimizing the total noise energy derived in an accurate way by a theoretical expression.
In Search of Simplicity: A Self-Organizing Group Communication Overlay
Authors: Matei Ripeanu, Adriana Iamnitchi, Ian Foster, Anne Rogers
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Group communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support these primitives while accounting for volatile end-nodes and variable network characteristics. Most solutions proposed to date rely on complex algorithms or global information, thus limiting the scale of deployments and acceptance outside the academic realm. This article introduces a low-complexity, self-organizing solution for maintaining multicast trees, that we refer to as UMM (Unstructured Multisource Multicast). UMM uses traditional distributed systems techniques: layering, soft-state, and passive data collection to adapt to the dynamics of the physical network and maintain data dissemination trees. The result is a simple, adaptive system with lower overheads than more complex alternatives. We have implemented UMM and evaluated it on up to 1024-node emulated ModelNet networks and on the PlanetLab testbed.. Extensive experimental evaluations and quantitative comparisons with alternative solutions demonstrate UMM's low overhead, efficient network usage, and ability to quickly adapt to network changes and to recover from failures.
Towards an agent-based grid platform 1st episode: the meta-grid
Authors: Badr Jabari, Vincent Englebert, Jean-Pol Vigneron, El Mostafa Oualim
Venue: Proceedings of the second workshop on Use of P2P, GRID and agents for the development of content networks (2007)

With the increasing focus on grid development there is a need for proper abstraction for modelling grids. In this paper a platform for agent-based grid framework is presented. This platform takes the form of a meta-grid that consists of an abstract grid representing "ideal" kinds of grids. This layer is developed to deal with problems raised by the differences between grids, and by other technical details specific to each one by hiding them and specifying an uniform model. The creation of such platform will dispense the programmer of applications of caring about problems specific to the environment and let him concentrate only on the development of the applications themselves. Therefore, this structure will help us to conceptualize and abstract the environments of grids. The multiagent system that we want to create will interact with this meta-grid to solve the real world problems without caring about specificities proper to each physical grid.
Understanding Tradeoffs in Software Transactional Memory
Authors: Dave Dice, Nir Shavit
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

There has been a flurry of recent work on the design of high performance software and hybrid hardware/software transactional memories (STMs and HyTMs). This paper reexamines the design decisions behind several of these stateof- the-art algorithms, adopting some ideas, rejecting others, all in an attempt to make STMs faster. We created the transactional locking (TL) framework of STM algorithms and used it to conduct a range of comparisons of the performance of non-blocking, lock-based, and Hybrid STM algorithms versus fine-grained hand-crafted ones. We were able to make several illuminating observations regarding lock acquisition order, the interaction of STMs with memory management schemes, and the role of overheads and abort rates in STM performance.
Large Scale Deployment of Molecular Docking Application on Computational Grid infrastructures for Combating Malaria
Authors: Vinod Kasam, Jean Salzemann, Nicolas Jacq, Astrid Mass, Vincent Breton
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Computational grids are solutions for several biological applications like virtual screening or molecular dynamics where large amounts of computing power and storage are required. The WISDOM project successfully deployed virtual screening at large scale on EGEE grid infrastructures in the summer 2005 and achieved 46 million dockings in 45 days, which is equivalent to 80 CPU years. WISDOM is one good example of a successful deployment of an embarrassingly parallel application. In this paper, we describe the improvements in our deployment. We screened ZINC database against four targets implicated in malaria. During more than 2 months and a half, we have achieved 140 million dockings, representing an average throughput of almost 80,000 dockings per hour. This was made possible by the availability of thousands of CPUs through different infrastructures worldwide. Through the acquired experience, the WISDOM production environment is evolving to enable an easy and faulttolerant deployment of biological tools.
Compile-Time Charactirization Recurrent Patterns in Irregular Computations
Authors: Kalluri Eswar, P. Sadayappan, Chua-Huang Huang
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Many engineering applications use irregular array access functions. Compile-time characterization of the computation structure of such applications is infeasible, making the automatic generation of efficient communication dificuit. This paper considers the Inspector-Executor (IEJ compilalion model to handle such applications. In this model, a run-time inspection of the computation is followed by the aciual execution. This paper discusses the assue of automatic compile-time identification of sections of a program that have recurrent computational patterns so that the cost of run-time inspection is amortizable over many executions. An algorithm is presented and an illusiraitve example is given.
Probabilistic Configuration Theories
Authors: Alessandro Tiberi
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We introduce a new framework for describing computations which are both concurrent and probabilistic. This framework is a natural extension of the Configuration Theories of [Pietro Cenciarelli. Configuration theories. In CSL '02: Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic, pages 200-215, London, UK, 2002. Springer-Verlag], and allows to express properties about both the causal and the probabilistic aspect of concurrent computations. Computations are described in an axiomatic way, by using a probabilistic extensions of poset sequents. A scheme of structural rules on these sequents is introduced and shown to be sound, while completeness can be obtained by adding a rule which is not treated in the present work. We also introduce a new probabilistic extension of Configuration Structures, which we use as models for probabilistic sequents.