ppxscal/embedding_network huggingface dataset:
Work in process: artists' collaborations in fashion and textiles
Authors: Sandy Black, Morris Baker
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

This paper accompanies the showing of a pilot digital film, Work in Process, analysing the creative process and working methods of four significant artists: Lucy Orta, Maria Blaisse, Helen Storey and Caroline Broadhead, who have been selected for their engagement within and between the areas of textiles, fashion and the body in a range of contexts, and for the maturity of their work. Revealed behind the artworks, through the artists' own words and practice, is often a complex process of collaboration, dialogue and debate, which normally remains hidden to the audience. The film presents new insights into creative collaborations, draws parallels and highlights contrasts in the range of approaches encompassed by the artists, and allows comparison with some of the established and emerging theories of creative process in scientific and other disciplines. The film is itself a work in progress towards a larger project, which will include additional artists. Accessibility and fluidity are key aspects of the digital film medium, allowing for an evolutionary approach to film-making, variable according to purpose and context, and questioning the notion of a 'finished' film.
Reactive navigation of multiple moving agents by collaborative resolution of conflicts
Authors: K. Madhava Krishna, Henry Hexmoor, Srinivas Chellappa
Venue: Journal of Robotic Systems (2005)

In navigation that involves several moving agents or robots that are not in possession of each other's plans, a scheme for resolution of collision conflicts between them becomes mandatory. A resolution scheme is proposed in this paper specifically for the case where it is not feasible to have a priori the plans and locations of all other robots, robots can broadcast information between one another only within a specified communication distance, and a robot is restricted in its ability to react to collision conflicts that occur outside of a specified time interval called the reaction time interval. Collision conflicts are resolved through velocity control by a search operation in the robot's velocity space. The existence of a cooperative phase in conflict resolution is indicated by a failure of the search operation to find velocities in the individual velocity space of the respective robots involved in the conflict. A scheme for cooperative resolution of conflicts is modeled as a search in the joint velocity space of the robots involved in conflict when the search in the individual space yields a failure. The scheme for cooperative resolution may further involve modifying the states of robots not involved in any conflict. This phenomenon is characterized as the propagation phase where cooperation spreads to robots not directly involved in the conflict. Apart from presenting the methodology for the resolution of conflicts at various levels (individual, cooperative, and propagation), the paper also formally establishes the existence of the cooperative phase during real-time navigation of multiple mobile robots. The effect of varying robot parameters on the cooperative phase is presented and the increase in requirement for cooperation with the scaling up of the number of robots in a system is also illustrated. Simulation results involving several mobile robots are presented to indicate the efficacy of the proposed strategy. &copy; 2005 Wiley Periodicals, Inc.
Forward image computation with backtracing ATPG and incremental state-set construction
Authors: Kameshwar Chandrasekar, Michael S. Hsiao
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Image computation is a fundamental step in formal verification of sequential systems, including sequential equivalence checking and symbolic model checking. Since conventional Reduced Ordered Binary Decision Diagram (ROBDD) based methods can potentially suffer from memory explosion, there has been a growing interest in using Automatic Test Pattern Generation (ATPG) / Boolean Satisfiability (SAT) based techniques in recent years. While ATPG has been successful for computing pre-image, image computation presents a very different set of problems. In this paper, we present a novel backtracing-based ATPG technique for forward image computation. We carefully alter the ATPG engine to compute the image cubes and store them incrementally in a Zero-Suppressed Binary Decision Diagram (ZBDD). In order to improve the efficiency of image computation, we propose three heuristics: (i) gate-observability based decision selection heuristics to accelerate ATPG, (ii) search-state based learning techniques supported with a proof for correctness, and (iii) on-the-fly state-set minimization techniques to reduce the size of computed image set. Experimental results on ISCAS '89 and ITC '99 benchmark circuits show that we can achieve orders of magnitude improvement over OBDD-based and SAT-based techniques.
Image Denoising by Statistical Area Thresholding
Authors: D. Coupier, A. Desolneux, B. Ycart
Venue: Journal of Mathematical Imaging and Vision (2005)

Area openings and closings are morphological filters which efficiently suppress impulse noise from an image, by removing small connected components of level sets. The problem of an objective choice of threshold for the area remains open. Here, a mathematical model for random images will be considered. Under this model, a Poisson approximation for the probability of appearance of any local pattern can be computed. In particular, the probability of observing a component with size larger than k in pure impulse noise has an explicit form. This permits the definition of a statistical test on the significance of connected components, thus providing an explicit formula for the area threshold of the denoising filter, as a function of the impulse noise probability parameter. Finally, using threshold decomposition, a denoising algorithm for grey level images is proposed.
Estimating Functions for Blind Separation When Sources Have Variance Dependencies
Authors: Motoaki Kawanabe, Klaus-Robert Müller
Venue: The Journal of Machine Learning Research (2005)

A blind separation problem where the sources are not independent, but have variance dependencies is discussed. For this scenario Hyvärinen and Hurri (2004) proposed an algorithm which requires no assumption on distributions of sources and no parametric model of dependencies between components. In this paper, we extend the semiparametric approach of Amari and Cardoso (1997) to variance dependencies and study estimating functions for blind separation of such dependent sources. In particular, we show that many ICA algorithms are applicable to the variance-dependent model as well under mild conditions, although they should in principle not. Our results indicate that separation can be done based only on normalized sources which are adjusted to have stationary variances and is not affected by the dependent activity levels. We also study the asymptotic distribution of the quasi maximum likelihood method and the stability of the natural gradient learning in detail. Simulation results of artificial and realistic examples match well with our theoretical findings.
A Relationally Complete Visual Query Language for Heterogeneous Data Sources and Pervasive Querying
Authors: Stavros Polyviou, George Samaras, Paraskevas Evripidou
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

In this paper we introduce and formally define Query by Browsing (QBB), a scalable, relationally complete visual query language based on the desktop user interface paradigm and tuple relational calculus that allows the formulation of complex queries over relational, entity-relationship, object-oriented and XML data sources on a variety of handheld and desktop platforms. It is to our knowledge the first visual query language to combine the important characteristics of usability, scalability, expressive power and flexibility. We support these claims by demonstrating the similarity of the QBB paradigm to the popular desktop user interface paradigm, by relating it to relational calculus and relational algebra and by describing Chiromancer II, a web-based implementation of the QBB paradigm for handheld devices. We also discuss ways in which non-relational sources can be represented and queried and compare QBB to related work in the area of visual query languages for a variety of data models. We finally offer conclusions and thoughts for future work.
In this issue: In this issue
Authors: Staff
Venue: Comparative and Functional Genomics (2004)

This article contains supplementary material available via the Internet from the Journal. 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
Analytical Models for Leakage Power Estimation of Memory Array Structures
Authors: Mahesh Mamidipaka, Kamal Khouri, Nikil Dutt, Magdy Abadir
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

There is a growing need for accurate power models at the system level. Memory structures such as caches, Branch Target Buffers (BTBs), and register files occupy significant area in contemporary SoC designs and are the main contributors to system leakage power dissipation. Existing models for leakage power estimation in array structures typically use coefficients derived from elaborate SPICE simulations. However, these methodologies are not applicable to array designs in a newer technology, that require power estimates early in the design cycle. In this paper, we propose analytical models for array structures that are based only on high level design parameters. Assuming typical circuit implementation styles, we identify the transistors that contribute to the leakage power in each array sub-circuit and develop models as a function of the operation (read/write/idle) on the array and organizational parameters of the array. The developed models are validated by comparing their estimates against the leakage power measured using SPICE simulations on industrial array designs belonging to the e5001 processor core. The comparison shows that the models are accurate with an error margin of less than 21.5% and thus can be used in high-level power-performance exploration. Interestingly, in array designs with dual threshold voltage technology, we observed that contrary to the general expectation, the array memory core contributes to just 9% and the address decoder contributes to as much as 62% of the total leakage power.
MUC-3 evaluation metrics
Authors: Nancy Chinchor
Venue: Proceedings of the 3rd conference on Message understanding (1991)

The MUC-3 evaluation metrics are measures of performance for the MUC-3 template fill task. Obtaining summary measures of performance necessitates the loss of information about many details of performance. The utility of summary measures for comparison of performance over time and across systems should outweigh this loss of detail. The template fill task is complex because of the varying nature of the fills for each slot and the interdependencies of the slots. The evaluation metrics used in MUC-3 were adapted from traditional measures in information retrieval and signal procesing and were still evolving to fit the more complex data extraction task of MUC-3 when the evaluation was performed. The scoring of the template fill task and the calculation of the metrics used in MUC-3 will be described here. This description is meant to assist in the analysis of the MUC-3 results and in the further evolution of the evaluation metrics.
An Architecture for Lifecycle Management in Very Large File Systems
Authors: Akshat Verma, David Pease, Upendra Sharma, Marc Kaplan, Jim Rubas, Rohit Jain, Murthy Devarakonda, Mandis Beigi
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

We present a policy-based architecture STEPS for lifecycle management (LCM) in a mass scale distributed file system. The STEPS architecture is designed in the context of IBM's SAN File System (SFS) and leverages the parallelism and scalability offered by SFS, while providing a centralized point of control for policy-based management. The architecture uses novel concepts like Policy Cache and Rate-Controlled Migration for efficient and non-intrusive execution of the LCM functions, while ensuring that the architecture scales with very large number of files. The architecture has been implemented and used for lifecycle management in a distributed deployment of SFS with heterogeneous data. We conduct experiments on the implementation to study the performance of the architecture. We observed that STEPS is highly scalable with increase in the number as well as the size of the file objects hosted by SFS. The performance study also demonstrated that most of the efficiency of policy execution is derived from Policy Cache. Further, a ratecontrol mechanism is necessary to ensure that users are isolated from LCM operations.
Experiments with equivalent differentiated services in a grid context
Authors: Pascale Vicat-Blanc Primet, François Echantillac, Mathieu Goutelle
Venue: Future Generation Computer Systems (2005)

Grids generally rely on a complex interconnection of Internet Protocol (IP) domains that offer heterogeneous services and unpredictable performance characteristics, particularly at the local area network/wide area network boundary. The total lack of end-to-end resource control in IP networks is responsible for performance problems that may affect the whole Grid environment. An end-to-end service differentiation architecture that controls heterogeneous communication performance is thus needed. We propose the Equivalent Differentiated Services (EDS) architecture, based on a layer-4 service differentiation solution exploiting a new layer-3 relative DiffServ model. In this paper, we present the EDS packet forwarding principles, the router mechanisms and two adaptive packet marking algorithms. As a proof of concept, we have implemented the EDS architecture in Linux and performed experiments on a transoceanic testbed.
Detecting and Restoring System of Tampered Image Based on Discrete Wavelet Transformation and Block Truncation Coding
Authors: Ching-Lin Wang, Ren-Hung Hwang, Tung-Shou Chen, Hsiu-Yueh Lee
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Based on discrete wavelet transformation and block truncation coding, in this paper, a system is presented to cope with a tampered digital image. Without contrast with the original image, this system has its great advantage to detect any tampered possibility, and then restore that tampered part. Experiments have indicated that restored version is extremely close to the original one.
User specific request redirection in a content delivery network
Authors: Sampath Rangarajan, Sarit Mukherjee, Pablo Rodriguez
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

This paper discusses user specific request redirection for personalizing responses to user requests in Content Delivery Networks (CDN). User specific request redirection refers to the process of redirecting user requests to a server on the content delivery network based on user specific information carried in the user request. Current redirection schemes in CDNs are either based on the authoritative DNS model or the URL rewrite model. The authoritative DNS model is not flexible to support user specific redirection as user specific information is not available to the DNS server; the URL rewrite model cannot support user specific redirection in practice because of the cost of on-the-fly URL rewrites required on a per user request basis. We discuss a technique that allows for flexible user specific request redirection. The technique is simple enough to be implemented at wire-speed in a switch.
Review of "Computational Grammar by Graeme D. Ritchie"; Sussex: The Harvester Press, 1980
Authors: James E. Tomayko
Venue: Issue 80 (April 1982) (1982)

This book was developed from the author's doctoral dissertation, in which he wrote a program that conducted natural language conversations in order to study the impact that computational linguistics has on developing descriptive grammar. Ritchie does much to show how difficult it is to develop a proper grammar, and thus gives an accurate reflection of the problems of computational linguistics by describing the state of descriptive linguistics and his application of it. 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
ICARE: a component-based approach for multimodal interaction
Authors: Jullien Bouchet, Laurence Nigay, Didier Balzagette
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

Mobile and ubiquitous systems support multiple interaction techniques such as the synergistic use of active modalities (speech, gesture, etc.) and passive modalities (gaze, localization of a user, etc.). The flexibility they offer results in an increased complexity that current software development tools do not address appropriately. In this paper we describe a component-based approach, called ICARE, for specifying and developing interfaces combining active and passive modalities. Our approach relies on two types of components: (1) elementary components that describe pure modalities (active and passive) and (2) composition components (Compl&eacute;mentarit&eacute;, Redundancy and Equivalence) that enable the designer to specify combined usage of modalities. The designer graphically assembles the ICARE components and the code of the multimodal user interface is automatically generated. Although the ICARE platform is not fully developed, we illustrate the applicability of the approach with the implementation of three mobiles systems: two GeoNote systems and one prototype of cockpit commands of Rafale (French military plane).
Number of Parties, Endogenous Partisan Preferences, and Electoral Turnout Rates
Authors: Christian W. Martin, Thomas Plümper
Venue: Social Science Computer Review (2005)

This article analyzes the impact of the number of parties on turnout rates within an endogenous partisan preference framework. Our results show that the turnout increases in the number of parties under various levels of individual propensity to abstain. We find strong interactions effects between both motives for abstention--alienation and indifference--and the abstention propensity. The results are based on an agent-based computer simulation of multiparty electoral competition in a two-dimensional policy space.
The First Hundred Years of Numerical Weather Prediction
Authors: Gilbert Brunet
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Whether on an urban or planetary scale, covering a few hours or a few months, numerical weather modelling and forecasting are considered to be among the leading environmental challenges of our time. Over the past four decades the Canadian Numerical Weather Prediction (NWP) community has made significantly progress on this challenge, both nationally and internationally. As this new century begins, an active NWP and High Performance Computing (HPC) program of multidisciplinary research and development (meteorologists, physicists, mathematicians, chemists and computer experts, etc.) in Canada is making a cutting-edge contribution to weather and environmental prediction.
Exploiting the Cache Capacity of a Single-Chip Multi-Core Processor with Execution Migration
Authors: Pierre Michaud
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

We propose to modify a conventional single-chip multicore so that a sequential program can migrate from one core to another automatically during execution. The goal of execution migration is to take advantage of the overall onchip cache capacity. We introduce the affinity algorithm, a method for distributing cache lines automatically on several caches. We show that on working-sets exhibiting a property called "splittability", it is possible to trade cache misses for migrations. Our experimental results indicate that the proposed method has a potential for improving the performance of certain sequential programs, without degrading significantly the performance of others.
ASKALON: a tool set for cluster and Grid computing: Research Articles
Authors: Thomas Fahringer, Alexandru Jugravu, Sabri Pllana, Radu Prodan, Clovis Seragiotto,  Jr., Hong-Linh Truong
Venue: Concurrency and Computation: Practice Experience (2005)

Performance engineering of parallel and distributed applications is a complex task that iterates through various phases, ranging from modeling and prediction, to performance measurement, experiment management, data collection, and bottleneck analysis. There is no evidence so far that all of these phases should&sol;can be integrated into a single monolithic tool. Moreover, the emergence of computational Grids as a common single wide-area platform for high-performance computing raises the idea to provide tools as interacting Grid services that share resources, support interoperability among different users and tools, and, most importantly, provide omnipresent services over the Grid. We have developed the ASKALON tool set to support performance-oriented development of parallel and distributed (Grid) applications. ASKALON comprises four tools, coherently integrated into a service-oriented architecture. SCALEA is a performance instrumentation, measurement, and analysis tool of parallel and distributed applications. ZENTURIO is a general purpose experiment management tool with advanced support for multi-experiment performance analysis and parameter studies. AKSUM provides semi-automatic high-level performance bottleneck detection through a special-purpose performance property specification language. The PerformanceProphet enables the user to model and predict the performance of parallel applications at the early stages of development. In this paper we describe the overall architecture of the ASKALON tool set and outline the basic functionality of the four constituent tools. The structure of each tool is based on the composition and sharing of remote Grid services, thus enabling tool interoperability. In addition, a data repository allows the tools to share the common application performance and output data that have been derived by the individual tools. A service repository is used to store common portable Grid service implementations. A general-purpose Factory service is employed to create service instances on arbitrary remote Grid sites. Discovering and dynamically binding to existing remote services is achieved through registry services. The ASKALON visualization diagrams support both online and post-mortem visualization of performance and output data. We demonstrate the usefulness and effectiveness of ASKALON by applying the tools to real-world applications. Copyright &copy; 2005 John Wiley & Sons, Ltd.