ppxscal/embedding_network huggingface dataset:
Compositing photographs with virtual clothes for design
Authors: Bernhard Spanlang, Tzvetomir Vassilev, Bernard F. Buxton
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper presents a computer system for garment designers to realistically augment photographs of a person with virtual garment designs. We show that the accumulation of existing garment modelling and computer graphics techniques can be used to produce realistic images of clothes in the context of a real scene. Effects of natural light interactions and fabric properties are taken into consideration. The system consists of a 3D scanner a garment CAD extension, a garment simulation interface and a natural global illumination system. We describe how the components of the system are integrated and discuss a collaboration with a fashion designer who worked with the system.
A Novel Rate Control Scheme for Video Streaming over Wireless Networks
Authors: Xiaolin Tong, Wen Gao, Qingming Huang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

TFRC is an equation-based rate control scheme originally developed for media streaming over wired networks. When applied to the wireless networks, it suffers from performance degradation. In this paper, we propose a Loss Event Rate Discounting (LERD) scheme to improve the TFRC performance over wireless networks. In our TFRC-LERD scheme, a TFRC connection includes several loss discounting levels. We increase the discounting level of the TFRC connection when the wireless bandwidth is under-utilized, and decrease it when the wireless bandwidth is overestimated. The adjusting of discounting level conforms to the Inverse Increase Additive Decrease algorithm. In contrast with most existing solutions, our scheme only employs the general statistical information and does not need to determine the cause of each packet loss, which reduces the computational complexity. In addition, TFRC-LERD is an end-to-end solution and does not assume any additional support from intermediate networks or lower layers. Simulation results demonstrate that our scheme outperforms the original TFRC under a wide range of error rates and the video quality perceived by the receiver is improved considerably.
Moment-driven coupling-aware routing methodology
Authors: Amitava Bhaduri, Ranga Vemuri
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

An underdamped signal response with a number of overshoots and undershoots may lead to false switching and increased settling time delay. This 'ringing' effect adversely affects the signal quality at the output and becomes a source of major concern at multi-GHz frequencies, as the self and mutual inductance of interconnects start playing a crucial role in the performance of a circuit. Reduction in wire length or minimization of coupling capacitance, the stronghold in many earlier routing techniques, may produce a routing solution suitable only at sub-GHz frequencies. In this paper, we propose a routing methodology that accounts for inductive and capacitive parasitics (self and mutual) of the interconnects in its cost function through a combination of second and third order central moments. A trade-off between signal delay and amount of ringing, quantified by second and third order central moments respectively, has been made, which generates a routing solution with the best compromise between ringing and delay for each net under a monotone signal response.
Book review: The Elements of Artificial Intelligence An Introduction Using LISP by Steven L. Tanimoto (Computer Science Press)
Venue: Issue 103 (Jan., 1988) (1988)

The Elements of Artificial Intelligence: an Introduction using LISP is intended (as stated in the preface) for use as the text for an introductory course in artificial intelligence. The author's approach to the subject is stated on the dust jacket (and in the preface, although not as concisely). 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
The NYU system for MUC-6 or where's the syntax?
Authors: Ralph Grishman
Venue: Proceedings of the 6th conference on Message understanding (1995)

Over the past five MUCs, New York University has clung faithfully to the idea that information extraction should begin with a phase of full syntactic analysis, followed by a semantic analysis of the syntactic structure. Because we have a good, broad-coverage English grammar and a moderately effective method for recovering from parse failures, this approach held us in fairly good stead.
Traceability-Driven Model Refinement for Test Case Generation
Authors: Matthias Riebisch, Michael Hubner
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Testing complex Computer-Based Systems is not only a demanding but a very critical task. Therefore the use of models for generating test data is an important goal. Tool support during the generation of test cases can considerably reduce the effort and the risk of errors of this task. While model the understanding of model transformation got better in the past, the analysis of the input ¿ requirement specifications mostly consisting of natural language texts ¿ still represents a bottleneck. In this paper a method for closing the gaps between manual techniques for structuring texts and automatic techniques based on linguistics is explained. By providing suggestions for missing or ambiguous terms the method supports the formalization within large projects. The suggestions are derived from a glossary and from an analysis of their integration in use case descriptions. Additionally the traceability links via feature models and other model elements are analyzed. Thus, the advantages of both techniques are joined to increase the level of tool support, resulting in a higher efficiency of the test case generation.
Performance technology for parallel and distributed component software: Research Articles
Authors: A. Malony, S. Shende, N. Trebon, J. Ray, R. Armstrong, C. Rasmussen, M. Sottile
Venue: Concurrency and Computation: Practice Experience (2005)

This work targets the emerging use of software component technology for high-performance scientific parallel and distributed computing. While component software engineering will benefit the construction of complex science applications, its use presents several challenges to performance measurement, analysis, and optimization. The performance of a component application depends on the interaction (possibly nonlinear) of the composed component set. Furthermore, a component is a &lsquo;binary unit of composition&rsquo; and the only information users have is the interface the component provides to the outside world. A performance engineering methodology and development approach is presented to address evaluation and optimization issues in high-performance component environments. We describe a prototype implementation of a performance measurement infrastructure for the Common Component Architecture (CCA) system. A case study demonstrating the use of this technology for integrated measurement, monitoring, and optimization in CCA component-based applications is given. Copyright &copy; 2005 John Wiley & Sons, Ltd.
The LinGO Redwoods treebank motivation and preliminary applications
Authors: Stephan Oepen, Kristina Toutanova, Stuart Shieber, Christopher Manning, Dan Flickinger, Thorsten Brants
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

The LinGO Redwoods initiative is a seed activity in the design and development of a new type of treebank. While several medium- to large-scale treebanks exist for English (and for other major languages), pre-existing publicly available resources exhibit the following limitations: (i) annotation is mono-stratal, either encoding topological (phrase structure) or tectogrammatical (dependency) information, (ii) the depth of linguistic information recorded is comparatively shallow, (iii) the design and format of linguistic representation in the treebank hard-wires a small, predefined range of ways in which information can be extracted from the treebank, and (iv) representations in existing treebanks are static and over the (often year- or decade-long) evolution of a large-scale treebank tend to fall behind the development of the field. LinGO Redwoods aims at the development of a novel treebanking methodology, rich in nature and dynamic both in the ways linguistic data can be retrieved from the treebank in varying granularity and in the constant evolution and regular updating of the treebank itself. Since October 2001, the project is working to build the foundations for this new type of treebank, to develop a basic set of tools for treebank construction and maintenance, and to construct an initial set of 10,000 annotated trees to be distributed together with the tools under an open-source license.
Supporting conditional delegation in secure workflow management systems
Authors: Vijayalakshmi Atluri, Janice Warner
Venue: Proceedings of the tenth ACM symposium on Access control models and technologies (2005)

Workflows model and control the execution of business processes in an organization. A workflow typically comprises of a set of coordinated activities, known as tasks. Typically, organizations establish a set of security policies, that regulate how the business process and resources should be managed. While a simple policy may specify which user (or role) can be assigned to execute a task, a complex policy may specify authorization constraints, such as separation of duties. Users may delegate the tasks assigned to them. Often such delegations are short-lived and come into play when certain conditions are satisfied. For example, a user may want to delegate his task of check approval only when going on vacation, when a check amount is less than a certain amount, or when his workload exceeds a certain limit.In this paper, we extend the notion of delegation to allow for such conditional delegation, where the delegation conditions can be based on time, workload and task attributes. When workflow systems entertain conditional delegation, different types of constraints come into play, which include authorization constraints, role activation constraints and workflow dependency requirements. We address the problem of assigning users to tasks in a consistent manner such that none of the constraints are violated.
Enhancing error resilience for reliable compression of VLSI test data
Authors: Hamidreza Hashempour, Luca Schiano, Fabrizio Lombardi
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper presents a novel methodology to improve error resilience for reliable compression of test data of VLSI circuits. The presence of so-called "bit-flips" (due to the high speed manufacturing test or noise in the Automatic Test Equipment (ATE) head) can lead to a significant loss in coverage when compression is employed. As reported in the technical literature, coverage can experience a reduction of as much as 30% due to bit-flips in the compressed sequence of the test data. Differently from reported works, the proposed technique adds a very small amount of redundant information to test data prior to its compression; the objective of the redundant data is to limit the so-called "propagation" effect due to bit-flips once the sequence is decompressed. Extensive simulation results are presented to substantiate the increase in error resilience and to evaluate the impact of the redundancy introduced by the proposed approach on the compression ratio. It is shown that for the ISCAS89 benchmark circuits the reduction in coverage is only 0.20%-3.52% which is significantly better than previously reported works.
Multimodal user interfaces for a travel assistant
Authors: Alain Goyé, Eric Lecolinet, Shiuan-Sung Lin, Gérard Chollet, Catherine Pelachaud, Xiaoqing Ding, Yang Ni
Venue: Proceedings of the 15th French-speaking conference on human-computer interaction on 15eme Conference Francophone sur l'Interaction Homme-Machine (2003)

As a part of a project to develop a personal assistant for travellers, we have studied three types of multimodal interfaces for a PDA: 1) a combination of Control menus and vocal inputs to control zoomable user interfaces to graphical or textual databases, 2) refinement of pictures captured by the integrated camera, based on correlating a series of pictures, in order to enhance character recognition, and 3) embodied conversational agents able to communicate via synchronized speech and culturedependent nonverbal behaviors (face, gaze and gesture). We describe in this paper these three modalities and their integration in the main application.
Semantic Web Technologies for Context-Aware Museum Tour Guide Applications
Authors: Shih-Chun Chou, Wen-Tai Hsieh, Fabien L. Gandon, Norman M. Sadeh
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Traditionally, visitors to museums have been left having to choose between finding their way around exhibits on their own or taking a standardized group tour with a guide. In this paper, we describe a context-aware museum tour guide that adjusts its recommendations to the interests and contexts of individual visitors and enables them to selectively share their experience with others. The tour guide is built around an innovative Semantic Web framework that minimizes the development and maintenance costs associated with the introduction of new exhibits, new visitor-oriented services and new sources of contextual information. In particular, it features a semantic web rule reasoning engine that enables visitor-oriented services to identify relevant sources of contextual information and to enforce user-specified privacy preferences about what information they are willing to share with others (e.g. "Only members of my group can see my current location", or "Only my friends can see how I rate exhibits"). While still in prototype stage, the tour guideýs target environment is the National Museum of Natural Science, one of Taiwanýs largest museums with over 3 million visitors per year..
The Lucid Dream Ensemble: a laboratory of discovery in the age of convergence
Authors: Virgil Moorefield, Jeffrey Weeter
Venue: Organised Sound (2004)

This paper describes the formation, creations and performances of a digital arts performing ensemble. It considers issues of collaboration across media, especially in the context of composed audio-visual improvisation (comprovisation). By contextualising our creative work within the wider discourse of both the practice and aesthetics of contemporary intermedia, we seek to enhance the potential relevancy of the article's main focus to readers.The story of the Lucid Dream Ensemble is one of contemporary creative activity in the realm of digital arts. It exists in a university setting, and its purpose is educational as well as artistic. Founded at Northwestern University in Evanston, Illinois in 2002, the ensemble seeks to foster collaboration across auditory and visual boundaries. The group is made up of audio-visual performers who control laptop computers in real-time by various interactive means. Its canvas is a surround-sound set-up, as well as three projectors. The ensemble seeks a true integration of video and audio, as expressed in the creation of audio-visual artefacts aimed at providing an immersive experience. The group has progressed from presenting unrelated audio and video, to integrating the process of creation of sound and image, to collecting audio and video as a group and processing them collaboratively.
Fast collision detection between massive models using dynamic simplification
Authors: Sung-Eui Yoon, Brian Salomon, Ming Lin, Dinesh Manocha
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

We present a novel approach for collision detection between large models composed of tens of millions of polygons. Each model is represented as a clustered hierarchy of progressive meshes (CHPM). The CHPM is a dual hierarchy of the original model: it serves both as a multiresolution representation of the original model, as well as a bounding volume hierarchy. We use the cluster hierarchy of a CHPM to perform coarse-grained selective refinement and the progressive meshes for fine-grained local refinement. We present a novel conservative error metric to perform collision queries based on the multiresolution representation. We use this error metric to perform dynamic simplification for collision detection. Our approach is conservative in that it may overestimate the set of colliding regions, but never misses any collisions. Furthermore, we are able to generate these hierarchies and perform collision queries using out-of-core techniques on all triangulated models. We have applied our algorithm to perform conservative collision detection between massive CAD and scanned models, consisting of millions of triangles at interactive rates on a commodity PC.
Packet arrivals in ethernet-based data networks
Authors: Th. Vergin, Th. Kessler, A. Ahrens, Ch. Lange, H.-D. Melzer
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Important characteristics of radio channels, such as interrelationships between bit errors, are included in digital models, which are used for several optimization tasks. In packet-oriented data networks comparable dependencies in the packet interarrival times are found. Therefore it is investigated, whether well-known digital radio channel models are suitable for modeling data traffic, too. As a result of the analysis it is presented that the introduced approaches provide sufficient exact results for modeling internet data traffic.
On the distribution of poles of Padé approximants to the Z-transform of complex Gaussian white noise
Authors: P. Barone
Venue: Journal of Approximation Theory (2005)

In the application of Padé methods to signal processing a basic problem is to take into account the effect of measurement noise on the computed approximants. Qualitative deterministic noise models have been proposed which are consistent with experimental results. In this paper the Padé approximants to the Z-transform of a complex Gaussian discrete white noise process are considered. Properties of the condensed density of the Padé poles such as circular symmetry, asymptotic concentration on the unit circle and independence on the noise variance are proved. An analytic model of the condensed density of the Padé poles for all orders of the approximants is also computed. Some Monte Carlo simulations are provided.
Periodic Constraint Satisfaction Problems: Tractable Subclasses
Authors: Hubie Chen
Venue: Constraints (2005)

We study a generalization of the constraint satisfaction problem (CSP), the periodic constraint satisfaction problem. An input instance of the periodic CSP is a finite set of "generating" constraints over a structured variable set that implicitly specifies a larger, possibly infinite set of constraints; the problem is to decide whether or not the larger set of constraints has a satisfying assignment. This model is natural for studying constraint networks consisting of constraints obeying a high degree of regularity or symmetry. Our main contribution is the identification of two broad polynomial-time tractable subclasses of the periodic CSP.
Accuracy enhancement of function-oriented web image classification
Authors: Koji Nakahira, Toshihiko Yamasaki, Kiyoharu Aizawa
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We propose a function-oriented classification of web images and show new applications using this categorization. We defined nine categories of images taking into account of their functions used in web pages, and classified web images by using Support Vector Machine (SVM) in tree structured way. In order to achieve high accuracy of classification, we employed two kinds of features, image-based features and text-based features, and the two kinds can be used together or separately for the stages of the classification. We also utilized DCT coefficients to classify photo images and illustrations. As a result, accurate classification has been achieved. Finally, we show the page summarization as a new application that is made feasible for the first time by our new categories of WWW images.
Partially Computed Fitness Function Based Genetic Algorithm for Hydrophobic-Hydrophilic Model
Authors: Tamjidul Hoque, Madhu Chetty, Laurence S. Dooley
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Fitness computation after each crossover or mutation operation in Genetic Algorithm (GA) requires computational time that increases with the increasing length of the chromosome. In this paper, an efficient GA is proposed for protein folding prediction based on the Hydrophobic-Hydrophilic (HP) model. The partial fitness of the parent computed from one end of sequence till crossover or mutation point is utilized for the computation of the fitness of the child. The calculated value of the partial fitness is stored with the corresponding chromosome. Although the approach requires additional memory for each hydrophobic residue of each chromosome, the computation time is reduced significantly which is more important than the memory overhead.
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Authors: Sebastian Gerlach, Roger D. Hersch
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17 (2005)

Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore drive the MTBF of such clusters to unacceptable levels. The software frameworks used for running parallel applications need to be fault-tolerant in order to ensure continued execution despite node failures. We propose an extension to the flow graph based Dynamic Parallel Schedules (DPS) development framework that allows non-trivial parallel applications to pursue their execution despite node failures. The proposed fault-tolerance mechanism relies on a set of backup threads located in the volatile storage of alternate nodes. These backup threads are kept up to date by duplication of the transmitted data objects and periodical checkpointing of thread states. In case of a failure, the current state of the threads that were on the failed node is reconstructed on the backup threads by re-executing operations. The corresponding valid re-execution order is automatically deduced from the data flow graph of the DPS application. Multiple simultaneous failures can be tolerated, provided that for each thread either the active thread or its corresponding backup thread survives. For threads that do not store a local state, an optimized mechanism eliminates the need for duplicate data object transmissions. The overhead induced by the fault tolerance mechanism consists mainly of duplicate data object transmissions that can, for compute bound applications, be carried out in parallel with ongoing computations. The increase in execution time due to fault tolerance therefore remains relatively low. It depends on the communication to computation ratio and on the parallel program's efficiency.