ppxscal/embedding_network huggingface dataset:
Coding For Content-Based Retrieval
Authors: M. D. Swanson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We define a data structure called a "web" together with an algorithm to choose scale-space atoms for representing an image. The corresponding wavelet coefficients (of the atoms chosen using this method) have useful properties which lead to (i) the definition of a stochastic process for representing images and (ii) an efficient image compression algorithm. The advantage of our image compression algorithm is that the computational requirement is very low. The stochastic process is useful in a theoretical sense because it gives us a framework in which to understand images and certain image compression algorithms.
Facilitating Mobile Music Sharing and Social Interaction with Push!Music
Authors: Maria Hakansson, Mattias Rost, Mattias Jacobsson, Lars Erik Holmquist
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Push!Music is a novel mobile music listening and sharing system, where users automatically receive songs that have autonomously recommended themselves from nearby players depending on similar listening behaviour and music history. Push!Music also enables users to wirelessly send songs between each other as personal recommendations. We conducted a two-week preliminary user study of Push!Music, where a group of five friends used the application in their everyday life. We learned for example that the shared music in Push!Music became a start for social interaction and that received songs in general were highly appreciated and could be looked upon as "treats'.
Animation of chemically reactive fluids using a hybrid simulation method
Authors: Byungkwon Kang, Yoojin Jang, Insung Ihm
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

Chemical phenomena abound in the real world, and often comprise indispensable elements of visual effects that are routinely created in the film industry. In this paper, we present a hybrid technique for simulating chemically reactive fluids, based on the theory of chemical kinetics. Our method makes synergistic use of both Eulerian grid-based methods and Lagrangian particle methods to simulate real and hypothetical chemical mechanisms effectively and efficiently. We demonstrate that by modeling chemical reactions using a particle system, an established, physically based fluid system can be extended easily to generate a wide range of chemical phenomena, ranging from catalysis and erosion to fire and explosions, with only a small additional cost.
Palimpsest: soft-capacity storage for planetary-scale services
Authors: Timothy Roscoe, Steven Hand
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Distributed writable storage systems typically provide NFS-like semantics and unbounded persistence for files. We claim that for planetary-scale distributed services such facilities are unnecessary and impose an unwanted overhead in complexity and ease of management. Furthermore, wide-area services have requirements not met by existing solutions, in particular capacity management and a realistic model for billing and charging. We argue for ephemeral storage systems which meet these requirements, and present Palimpsest, an early example being deployed on PlanetLab. Palimpsest is small and simple, yet provides soft capacity, congestion-based pricing, automatic reclamation of space, and a security model suitable for a shared storage facility for wide-area services. It does not "fill up" in the way that an ordinary filing system does. In fact, Palimpsest does not arbitrate resources--storage blocks--between clients at all.
Towards availability benchmarks: a case study of software raid systems
Authors: Aaron Brown, David A. Patterson
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

Benchmarks have historically played a key role in guiding the progress of computer science systems research and development, but have traditionally neglected the areas of availability, maintainability, and evolutionary growth, areas that have recently become critically important in high-end system design. As a first step in addressing this deficiency, we introduce a general methodology for benchmarking the availability of computer systems. Our methodology uses fault injection to provoke situations where availability may be compromised, leverages existing performance benchmarks for workload generation and data collection, and can produce results in both detail-rich graphical presentations or in distilled numerical summaries. We apply the methodology to measure the availability of the software RAID systems shipped with Linux, Solaris 7 Server, and Windows 2000 Server, and find that the methodology is powerful enough not only to quantify the impact of various failure conditions on the availability of these systems, but also to unearth their design philosophies with respect to transient errors and recovery policy.
Collective Interfaces for Distributed Components
Authors: Francoise Baude, Denis Caromel, Ludovic Henrio, Matthieu Morel
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

We propose to address collective communications in distributed components through collective interfaces. Collective interfaces handle data distribution, parallelism and synchronization, and they expose collective behaviors in the definition of components. We show, as an illustration, that collective interfaces allow the encoding of SPMD programming in a better structured and less error prone way. We verify the scalability and performance of collective interfaces in an experiment on up to 100 machines.
A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields
Authors: Abusaleh M. Jabir, Dhiraj K. Pradhan
Venue: IEEE Transactions on Computers (2007)

This paper presents the generalized theory and an efficient graph-based technique for the calculation and representation of coefficients of multivariate canonic polynomials over arbitrary finite fields in any polarity. The technique presented for computing coefficients is unlike polynomial interpolation or matrix-based techniques and takes into consideration efficient graph-based forms which can be available as an existing resource during synthesis, verification, or simulation of digital systems. Techniques for optimization of the graph-based forms for representing the coefficients are also presented. The efficiency of the algorithm increases for larger fields. As a test case, the proposed technique has been applied to benchmark circuits over GF2. The experimental results show that the proposed technique can significantly speed up execution time.
The Current State and Future of Search Based Software Engineering
Authors: Mark Harman
Venue: 2007 Future of Software Engineering (2007)

This paper describes work on the application of optimization techniques in software engineering. These optimization techniques come from the operations research and metaheuristic computation research communities. The paper briefly reviews widely used optimization techniques and the key ingredients required for their successful application to software engineering, providing an overview of existing results in eight software engineering application domains. The paper also describes the benefits that are likely to accrue from the growing body of work in this area and provides a set of open problems, challenges and areas for future work.
Deformation Correction in Brain MRI Using Mutual Information and Genetic Algorithm
Authors: Pradipta Maji, B. Chanda, M. K. Kundu, Suman Dasgupta
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

During MR imaging, the image of the object may get deformed due to the slope between the MR probe and the object. It is in general undesirable, particularly for 3D imaging. In this paper we propose a novel method to reconstruct the undeformed image of the object by measuring the deformation at the time of the MR scan. The image registration technique coupled with genetic algorithm is used to predict the deformation of the object. The inverse of this deformation is then applied to the image, generating the image that would have been seen had there been no slope with the probe. The proposed algorithm has been tested on a set of brainMR images and shown to remove the deformation and so give improved 3D reconstructions.
Computing crossing number in linear time
Authors: Ken-ichi Kawarabayashi, Buce Reed
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has crossing number at most k, and if this is the case, computes a drawing of the graph in the plane with at most k crossings. This answers the question posed by Grohe (STOC'01 and JCSS 2004). Our algorithm can be viewed as a generalization of the seminal result by Hopcroft and Tarjan lin1, which determines if a given graph is planar in linear time. Our algorithm can also be compared to the algorithms by Mohar (STOC'96 and Siam J. Discrete Math 2001), for testing the embeddability of an input graph in a fixed surface. For each surface s, Mohar describes an algorithm which yields either an embedding of G in s or a minor of G which is not embeddable in s and is minimal with this property. The same approach allows us to obtain linear time algorithms for the same question for a variety of other crossing numbers. We can also determine in linear time if an input graph can be made planar by the deletion of k edges (for fixed k).
Synthesizing speech animation by learning compact speech co-articulation models
Authors: Z. Deng, J. P. Lewis, U. Neumann
Venue: Proceedings of the Computer Graphics International 2005 (2005)

While speech animation fundamentally consists of a sequence of phonemes over time, sophisticated animation requires smooth interpolation and co-articulation effects, where the preceding and following phonemes influence the shape of a phoneme. Co-articulation has been approached in speech animation research in several ways, most often by simply smoothing the mouth geometry motion over time. Data-driven approaches tend to generate realistic speech animation, but they need to store a large facial motion database, which is not feasible for real time gaming and interactive applications on platforms such as PDAs and cell phones. In this paper we show that accurate speech co-articulation model with compact size can be learned from facial motion capture data. An initial phoneme sequence is generated automatically from text-to-speech (TTS) systems. Then, our learned co-articulation model is applied to the resulting phoneme sequence, producing natural and detailed motion. The contribution of this work is that speech co-articulation models "learned" from real human motion data can be used to generate natural-looking speech motion while simultaneously preserving the expressiveness of the animation via keyframing control. Simultaneously, this approach can be effectively applied to interactive applications due to its compact size.
On the performance of a local active noise control system
Authors: M. de Diego
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper presents a multichannel active system for the local control of sound around the headrest on the back of a seat placed inside an enclosure. The size of the zones of quiet produced makes the system practical only at relatively low frequencies. Finally, some results of cancellation for narrowband and broadband noise are presented. Two different system configurations algorithms have been tested on the adaptive controller. Both of them show similar results, but the new algorithm based on the minimization of the maximum error signal power, has shown computational saving and higher speed convergence than the multiple channel least squares algorithm.
Evolutionary computation in identification of a tumor
Authors: T. Burczynski, W. Kus, E. Majchrzak, P. Orantek, M. Dziewonski
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The paper deals with an application of evolutionary computation in identification of shape and position of a tumor region in the biological tissue domain. The problem is formulated as an inverse problem that is solved by the minimization of a functional formulated as some distance between measured and computed skin surface temperatures. The functional is considered as the fitness function and the minimization is performed by an evolutionary algorithm with the floating point representation of chromosomes. Geometrical parameters or shape and position of the tumor play the role of genes. The evaluation of the fitness function is preceded by the solution of the direct problem for the bioheat transfer (the Pennes equation) by means or the finite element method. Numerical examples of evolutionary computation for 2-D problems are presented.
Advanced synchronization in Mac OS X: extending unix to SMP and real-time
Authors: Louis G. Gerbarg
Venue: Proceedings of the BSD Conference 2002 on BSD Conference (2002)

Throughout the years, as Unix has grown and evolved so has computer hardware. The 4.4BSD-Lite2 distribution had no support for two features that are becoming more and more important: SMP and real-time processing. With the release Mac OS X Apple has made extensive alterations to our kernel in order to support both SMP and real-time processing. These alterations affected both the BSD and Mach portions of our kernel, as well as shaping our driver system, IOKit. These changes range from scheduling policies, enabling support for kernel preemption, altering locking hierarchies, and defining new serialization primitives, as well as designing a driver architecture that allows developers to easily make their drivers SMP and preemption safe.
How to architect an IPTV system
Authors: Yuzo Iano, Marcus Pereira Magri
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

Today's Internet Protocol Television (IPTV) is being offered and taking off, driving radical changes in the way telecom networks are designed. Future consumers will look for unique, personalized services through multiple devices, including the television. On demand content, Interactive TV, Video and voice communications, photo, music, and home video sharing, and online gaming, all delivered seamlessly, are a few examples of the services that consumers could receive. This requires innovative changes in the entire end-toend service delivery architect, quality of service and customer management, reliability and security.
First class objects and indexes for chant manuscripts
Authors: Louis W. G. Barton, Peter G. Jeavons, John A. Caldwell, Koon Shan Barry Ng
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

We discuss a crucial part of infrastructure for the Web-delivery of medieval chant resources. Although widely accepted by software professionals, the distributed-content model is sharply opposed by some chant scholars. We advocate for a paradigm of the Web as a massive database where each "first class object" acts like a record; metadata about, and links to such objects are compiled in virtual libraries. Scholarly-edited indexes determine which objects are in libraries, and unreliable content is excluded. Special metadata ontologies can be defined without modifying the primary content.
Formal Properties of Cognitive Distance in Geographical Space
Authors: Cuihong Qi, Hong Shu, Aiping Xu
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In geographic space, spatial behaviors of humans are driven directly by their spatial cognition, and indirectly by the physical or geometrical reality. The recognition of cognitive distance is fundamental in human intelligent computation, particularly in commonsense knowledge engineering. The cognitive distance is dialectically used for measuring the similarities between cognized geographic objects. Traditionally, physical or Euclidean distances are used very often. However, many inconsistencies between cognitive distance and physical distance are practically found. As a matter of a fact, the physical distance is mostly overestimated or underestimated in the process of human spatial cognition and spatial behaviors. This paper is intended to illustrate the cognitive distance and its distortions in a conceptual and computational way. Some innovative arguments are made. That is, the cognitive distance could be two-dimensional, exist in heterogeneous space, and hold the property of quasi-metric. Alternatively, the cognitive distance could be multi-dimensional, exist in homogeneous space, and hold the property of metric. Distance distortions arise from the transformations of homogeneous into heterogeneous spaces and two-dimensional into multi-dimensional distances.
Extracting Variable Knowledge from Multiversioned XML Documents
Authors: Laura Irina Rusu, Wenny Rahayu, David Taniar
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The growing research interests in the XML data warehousing and XML mining areas during the last few years were determined by the wider use of the XML to represent semi-structured data and to exchange information between different types of applications. A large number of techniques have being developed, to mine interesting knowledge from XML documents, e.g. frequent patterns, association rules, clusters etc. Though, there was little or no attention accorded to the changes affecting the discovered knowledge, in cases when the initial source of data, i.e. the XML documents, was changing in time. In this paper we propose a novel technique of determining how the knowledge discovered from initial XML documents changes in time when the documents' content and/or structure fluctuates.
The resourcefulness of everyday design
Authors: Ron Wakkary, Leah Maestri
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

We discuss our study that looks at family members as everyday designers. We explain the design actions of family members to be creative, as evidenced by the resourceful appropriation of artifacts and surroundings, the ongoing adaptation of systems and routines through design-in-use that allows emergent properties to arise and addresses individual needs, and how implicit understanding and explicit tests occur for judging quality. We present a preliminary analysis of design implications in the area of interaction design in the home. Our findings are based on a five-month ethnographic study of three families.
Symbolic MAPLE-Based Design of Allpole Filters
Authors: Alfonso Fernandez-Vazquez, Gordana Jovanovic-Dolecek, Roberto Rosas-Romero
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

To compute the filter coefficients of a digital filter, it is often necessary the solution of a set of linear equations using numerical methods. Unfortunately, if the number of unknowns is high, then the solution is likely to be error prone. To avoid this problem, this paper presents the use of the symbolic toolMAPLE to compute the filter coefficients. Consequently, the proposed solution is given in symbolic form. The corresponding numerical values are obtained from the proposed closed form relations. Particularly, we consider the design flat group delay allpole filters with real and complex coefficients due to promising applications like allpass filter design, IIR filters design, Hilbert transformer design, and filter bank design.
Tracking Objects to Detect Feature Dependencies
Authors: Adrian Lienhard, Orla Greevy, Oscar Nierstrasz
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

The domain-specific ontology of a software system includes a set of features and their relationships. While the problem of locating features in object-oriented programs has been widely studied, runtime dependencies between features are less well understood. Features cannot be understood in isolation, since their behavior often depends on objects created and referenced in previously exercised features. It is difficult to spot runtime dependencies between features just by browsing source code. Hence, code modifications intended for one feature, often inadvertently affect other features. In this paper, we propose an approach to precisely identify dependencies between features based on a fine-grained dynamic analysis which captures details about how objects are referenced at runtime. The results of two case studies indicate that our approach helps software maintainers in understanding critical feature dependencies.
Estimation and localization of multiple dipole sources for noninvasive mapping of muscle activity
Authors: J. T. Stonick
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In this paper, we develop a method for estimating and localizing multiple current-dipole sources within a finite-element arm model from surface EMG measurements. This extends previous work (Jesinger and Stonick, 1994 and LoPresti et al., 1995) in which we developed a realistic finite-element arm model from magnetic resonance images and then solved the single source localization problem via exhaustive search. Exhaustive search, however, is unacceptable for the multi-source localization problem due to the combinatorial nature of the number of solutions. (Our finite-element arm model has on the order of 10/sup 13/ possible solutions.) Thus, we present an iterative technique which alternately pares down the size of the solution space and then locates sources one at a time. Examples demonstrating the power of our algorithm are included.
Packet-based whitted and distribution ray tracing
Authors: Solomon Boulos, Dave Edwards, J. Dylan Lacewell, Joe Kniss, Jan Kautz, Peter Shirley, Ingo Wald
Venue: Proceedings of Graphics Interface 2007 (2007)

Much progress has been made toward interactive ray tracing, but most research has focused specifically on ray casting. A common approach is to use "packets" of rays to amortize cost across sets of rays. Whether "packets" can be used to speed up the cost of reflection and refraction rays is unclear. The issue is complicated since such rays do not share common origins and often have less directional coherence than viewing and shadow rays. Since the primary advantage of ray tracing over rasterization is the computation of global effects, such as accurate reflection and refraction, this lack of knowledge should be corrected. We are also interested in exploring whether distribution ray tracing, due to its stochastic properties, further erodes the effectiveness of techniques used to accelerate ray casting. This paper addresses the question of whether packet-based ray tracing algorithms can be effectively used for more than visibility computation. We show that by choosing an appropriate data structure and a suitable packet assembly algorithm we can extend the idea of "packets" from ray casting to Whitted-style and distribution ray tracing, while maintaining efficiency.