ppxscal/embedding_network huggingface dataset:
A PD-based methodology to enhance efficiency in testbenches with random stimulation
Authors: Carlos Ivan Castro Marquez, Marius Strum, Wang Jiang Chau
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

Among the current verification techniques, functional verification has received important attention, since it represents an alternative that keeps HDL validation costs low throughout the circuit's design cycle. Functional verification is based in testbenches, and it works by exploring the whole (or relevant) model's functionality, applying sets of testcases. There are different techniques concerning testbenches operation, being the random stimulation an important approach, by which a huge number of testcases can be automatically created and applied. In testbench development, creation of random stimuli generators containing overlapping or invalid input parameter subspaces may occur, wasting computational time during testbench execution. In this work, we present a methodology to organize and apply random input stimuli by means of IP parameter domain, PD, formalism. The methodology provides the application of stimulus which: 1) belongs to the valid parameter subspace; 2) avoids repeated conditions; 3) covers the parameter subspaces uniformly. Moreover the methodology allows the automation of several tasks, making it efficient and less error-prone. Results on applying such a methodology are compared to cases where test vectors from the complete (unreduced, unorganized) verification space are generated manually, analyzing its relation to the coverage models specified for the design verification.
Importing ArrayExpress datasets into R/Bioconductor
Authors: Audrey Kauffmann, Tim F. Rayner, Helen Parkinson, Misha Kapushesky, Margus Lukk, Alvis Brazma, Wolfgang Huber
Venue: Bioinformatics (2009)

Summary:ArrayExpress is one of the largest public repositories of microarray datasets. R/Bioconductor provides a comprehensive suite of microarray analysis and integrative bioinformatics software. However, easy ways for importing datasets from ArrayExpress into R/Bioconductor have been lacking. Here, we present such a tool that is suitable for both interactive and automated use. Availability: The ArrayExpress package is available from the Bioconductor project at http://www.bioconductor.org. A users guide and examples are provided with the package. Contact: audrey@ebi.ac.uk Supplementary information:Supplementary data are available Bioinformatics online.
How to Compare Image Watermarking Algorithms
Authors: Angela Piper, Reihaneh Safavi-Naini
Venue: Transactions on Data Hiding and Multimedia Security IV (2009)

In recent years, comparing image watermarking algorithms using the results of experiments with a handful of images has become a common practice. The images are randomly selected from a well chosen database and so it can be argued that they cover the important aspects of visual information such as texture or smoothness. However, the number of images used in the experiment remains a crucial factor in providing confidence in the results of experiment. By choosing this number to be `large' one hopes that the comparison results are reliable. In this paper, our aim is to provide a systematic method of determining this number using a statistical approach based on hypothesis testing and power analysis.We consider two algorithms and seek to verify the claim that one has superior performance with respect to some property. We start with finding a measure that represents the `goodness' of the property of interest, follow with determining a suitable hypothesis test and the number of images and, finally, with interpreting the results of the experiment. We show how the use of a statistical framework can allow us not only to draw conclusions based on a sound methodology but also to provide a confidence level for these conclusions. We give a concrete application of the approach to the problem of comparing two spread spectrum watermarking algorithms with respect to their robustness to JPEG2000 compression. We discuss the intricacies of the choices at various stages of this approach, and their effects on the results.
Business Rules for Concurrent E-commerce Transactions
Authors: Hendrik Decker
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Business rules are a cornerstone of the consistency management of e-commerce data. The concurrency of transactions by multiple customers of e-commerce services (e.g., seat reservation systems) is indispensable for most of such services. However, the enforcement of business rules may falter due to extant inconsistencies of legacy data and integrity violations caused by the concurrency of transactions. To avoid this, we propose an inconsistency-tolerant approach to business rules enforcement for e-business applications in which business rules are expressed by database integrity constraints. The extension overcomes problems related to persistent integrity violations of stored data in ecommerce systems with concurrent transactions. 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
Micro-rendering for scalable, parallel final gathering
Authors: T. Ritschel, T. Engelhardt, T. Grosch, H.-P. Seidel, J. Kautz, C. Dachsbacher
Venue: ACM Transactions on Graphics (TOG) (2009)

Recent approaches to global illumination for dynamic scenes achieve interactive frame rates by using coarse approximations to geometry, lighting, or both, which limits scene complexity and rendering quality. High-quality global illumination renderings of complex scenes are still limited to methods based on ray tracing. While conceptually simple, these techniques are computationally expensive. We present an efficient and scalable method to compute global illumination solutions at interactive rates for complex and dynamic scenes. Our method is based on parallel final gathering running entirely on the GPU. At each final gathering location we perform micro-rendering: we traverse and rasterize a hierarchical point-based scene representation into an importance-warped micro-buffer, which allows for BRDF importance sampling. The final reflected radiance is computed at each gathering location using the micro-buffers and is then stored in image-space. We can trade quality for speed by reducing the sampling rate of the gathering locations in conjunction with bilateral upsampling. We demonstrate the applicability of our method to interactive global illumination, the simulation of multiple indirect bounces, and to final gathering from photon maps.
Cesàro means of Jacobi expansions on the parabolic biangle
Authors: W. zu Castell, F. Filbir, Y. Xu
Venue: Journal of Approximation Theory (2009)

We study Cesaro (C,@d) means for two-variable Jacobi polynomials on the parabolic biangle B={(x"1,x"2)@?R^2:0@?x"1^2@?x"2@?1}. Using the product formula derived by Koornwinder and Schwartz for this polynomial system, the Cesaro operator can be interpreted as a convolution operator. We then show that the Cesaro (C,@d) means of the orthogonal expansion on the biangle are uniformly bounded if @d>@a+@b+1, @a>=@b>=0. Furthermore, for @d>=@a+2@b+32 the means define positive linear operators.
A Gradual Combination of Features for Building Automatic Summarisation Systems
Authors: Elena Lloret, Manuel Palomar
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

This paper presents a Text Summarisation approach, which combines three different features (Word frequency, Textual Entailment, and The Code Quantity Principle) in order to produce extracts from newswire documents in English. Experiments shown that the proposed combination is appropriate for generating summaries, improving the system's performance by 10% over the best DUC 2002 participant. Moreover, a preliminary analysis of the suitability of these features for domain-independent documents has been addressed obtaining encouraging results, as well.
Cooperative Stereo Matching with Color-Based Adaptive Local Support
Authors: Roland Brockers
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Color processing imposes a new constraint on stereo vision algorithms: The assumption of constant color on object surfaces used to align local correlation windows with object boundaries has improved the accuracy of recent window based stereo algorithms significantly. While several algorithms have been presented that work with adaptive correlation windows defined by color similarity, only a few approaches use color based grouping to optimize initially computed traditional matching scores. This paper introduces the concept of color-dependent adaptive support weights to the definition of local support areas in cooperative stereo methods to improve the accuracy of depth estimation at object borders. 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
Prompter "." Based Creating Thinking Support Communication System That Allows Hand-Drawing
Authors: Li Jen Chen, Jun Ohya, Shunichi Yonemura, Sven Forstmann, Yukio Tokunaga
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Research into creative thinking-support tools and communication is commonly focused on how to develop and share ideas between participants or with others. In this paper, we proposes a creative thinking support method that utilizes randomly generated visual prompter (black circle) image patterns (VP-patterns) and free hand-drawing and writing functions. Concepts and ideas of the research have been explained together with the development of the systems (CSP1 and CSP2). Experiments have been conducted in order to evaluate the potentials and effectiveness of the system. From the results, a tendency towards inspiring creative ideas by participants has been observed.
Programming Multi-agent Systems
Authors: Mehdi Dastani
Venue: Computational Logic in Multi-Agent Systems: 9th International Workshop, CLIMA IX, Dresden, Germany, September 29-30, 2008. Revised Selected and Invited Papers (2009)

Multi-agent systems consist of a number of interacting autonomous agents, each of which is capable of sensing its environment (including other agents) and deciding to act in order to achieve its own objectives. In order to guarantee the overall design objectives of multi-agent systems, the behavior of individual agents and their interactions need to be regulated and coordinated [23,29,30]. The development of multi-agent systems therefore requires programming languages that facilitate the implementation of individual agents as well as mechanisms that control and regulate individual agents' behaviors. It also requires computational tools to test and verify programs that implement multi-agent systems [7].
Developing, Deploying and Assessing Usage of a Movie Archive System among Students of Film Studies
Authors: Nazlena Mohamad Ali, Alan F. Smeaton, Hyowon Lee, Pat Brereton
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

This paper describes our work in developing a movie browser application for students of Film Studies at our University. The aim of our work is to address the issues that arise when applying conventional user-centered design techniques from the usability engineering field to build a usable application when the system incorporates novel multimedia tools that could be potentially useful to the end-users but have not yet been practiced or deployed. We developed a web-based system that incorporates features as identified from the students and those features from our novel video analysis tools, including scene detection and classification. We deployed the system, monitored usage and gathered quantitative and qualitative data. Our findings show those expected patterns and highlighted issues that need to be further investigated in a novel application development. A mismatch between the users' wishes at the interviews and their actual usage was noted. In general, students found most of the provided features were beneficial for their studies.
Maximally Local Connectivity on Augmented Cubes
Authors: Y-Chuang Chen, Meng-Hung Chen, Jimmy J. Tan
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

Connectivity is an important measurement for the fault tolerance in interconnection networks. It is known that the augmented cube AQ n is maximally connected, i.e. (2n - 1)-connected, for n ¿ 4. By the classical Menger's Theorem, every pair of vertices in AQ n is connected by 2n - 1 vertex-disjoint paths for n ¿ 4. A routing with parallel paths can speed up transfers of large amounts of data and increase fault tolerance. Motivated by some research works on networks with faults, we have a further result that for any faulty vertex set F ¿ V(AQ n ) and |F| ≤ 2n ¿ 7 for n ¿ 4, each pair of non-faulty vertices, denoted by u and v, in AQ n ¿ F is connected by min{deg f (u), deg f (v)} vertex-disjoint fault-free paths, where deg f (u) and deg f (v) are the degree of u and v in AQ n ¿ F, respectively. Moreover, we have another result that for any faulty vertex set F ¿ V(AQ n ) and |F| ≤ 4n ¿ 9 for n ¿ 4, there exists a large connected component with at least 2 n ¿ |F| ¿ 1 vertices in AQ n ¿ F. In general, a remaining large fault-free connected component also increases fault tolerance.
Provably Secure Password-Based Three-Party Key Exchange With Optimal Message Steps
Authors: Hung-Yu Chien, Tzong-Chen Wu
Venue: The Computer Journal (2009)

A password-based three-party encrypted key exchange (3PEKE) is a protocol that enables any pair of two registered clients to establish session keys with the help of a trusted server such that each client shares only one password with the server. This approach greatly improves the scalability of key agreement protocol in distributed environments and provides great user convenience. This article proposes a new password-based 3PEKE scheme that completes its entire job in only a record low four steps, which we prove that it is optimal for password-based 3PEKE protocols. The security of the proposed scheme, as we will detail later, has been proved in the random oracle model.
Want to Know How to Play the Game? Ask the ORACLE!
Authors: Paola Rizzo, Michael Kriegel, Rui Figueiredo, Meiyii Lim, Ruth Aylett
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

This paper describes the ORACLE, an embodied intelligent virtual agent designed and built for helping players of a serious game named ORIENT [1]. The game challenges players at the socio-cultural level, because it requires them to learn how to interact smoothly with alien characters in order to save their planet. The ORACLE is a virtual agent on a mobile phone, whose goal is to enhance the users' learning in the game. The agent can both react to the players' questions, and proactively intervene for suggesting things to users or for commenting on their performance.
Decompositions of grammar constraints
Authors: Claude-Guy Quimper, Toby Walsh
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

A wide range of constraints can be compactly specified using automata or formal languages. In a sequence of recent papers, we have shown that an effective means to reason with such specifications is to decompose them into primitive constraints (Quimper & Walsh 2006; 2007). We can then, for instance, use state of the art SAT solvers and profit from their advanced features like fast unit propagation, clause learning, and conflict-based search heuristics. This approach holds promise for solving combinatorial problems in scheduling, rostering, and configuration, as well as problems in more diverse areas like bioinformatics, software testing and natural language processing. In addition, decomposition may be an effective method to propagate other global constraints.
Predicting User Psychological Characteristics from Interactions with Empathetic Virtual Agents
Authors: Jennifer Robison, Jonathan Rowe, Scott Mcquiggan, James Lester
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Enabling virtual agents to quickly and accurately infer users' psychological characteristics such as their personality could support a broad range of applications in education, training, and entertainment. With a focus on narrative-centered learning environments, this paper presents an inductive framework for inferring users' psychological characteristics from observations of their interactions with virtual agents. Trained on traces of users' interactions with virtual agents in the environment, psychological user models are induced from the interactions to accurately infer different aspects of a user's personality. Further, analyses of timing data suggest that these induced models are also able to converge on correct predictions after a relatively small number of interactions with virtual agents.
A Model on Sampling Rate of OD Survey
Authors: Qiu-jie Liu, Qiu Yan
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Since resident trip investigation is significant for transport planning and there are so many cities with various degree of development, it is extremely important to put forward a scientific sapling method according to different local financial situations. Utilizing the sampling techniques and the optimization theory, this article developed through error analysis an optimum sampling model of OD survey which aims at the highest survey precision and is restricted to the expenditure. Meanwhile, by analyzing the feasibility of the model, the article establishes the theory basis for selecting sampling rate of the OD survey. It is strongly recommended that sampling method proposed by this article adopted in small and medium sized cities.
Protecting Face Biometric DCT Templates by Means of Pseudo-random Permutations
Authors: Marcos Faundez-Zanuy
Venue: Cross-Modal Analysis of Speech, Gestures, Gaze and Facial Expressions: COST Action 2102 International Conference Prague, Czech Republic, October 15-18, 2008 Revised Selected and Invited Papers (2009)

Biometric template security and privacy is a great concern of biometric systems, because unlike passwords and tokens, compromised biometric templates cannot be revoked and reissued. In this paper we present a protection scheme based on a user dependent pseudo-random ordering of the DCT template coefficients. In addition to privacy enhancement, this scheme also lets to increase the biometric recognition performance, because a hacker can hardly match a fake biometric sample without knowing the pseudo-random ordering.
RH: a retro hybrid parser
Authors: Paula S. Newman
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

Contemporary parser research is, to a large extent, focused on statistical parsers and deep-unification-based parsers. This paper describes an alternative, hybrid architecture in which an ATN-like parser, augmented by many preference tests, builds on the results of a fast chunker. The combination is as efficient as most stochastic parsers, and accuracy is close and continues to improve. These results raise questions about the practicality of deep unification for symbolic parsing.
Score distribution based term specific thresholding for spoken term detection
Authors: Doǧan Can, Murat Saraçlar
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

The spoken term detection (STD) task aims to return relevant segments from a spoken archive that contain the query terms. This paper focuses on the decision stage of an STD system. We propose a term specific thresholding (TST) method that uses per query posterior score distributions. The STD system described in this paper indexes word-level lattices produced by an LVCSR system using Weighted Finite State Transducers (WFSTs). The target application is a sign dictionary where precision is more important than recall. Experiments compare the performance of different thresholding techniques. The proposed approach increases the maximum precision attainable by the system.
Research on Scheduling and Simulation of Production for the Mixed Model General Automotive Assembly Process
Authors: Zhenxin Cao, Shiping Ma
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The process flow of general automotive assembly and the production characteristic were analyzed in order to improve assembly efficiency. The minimal production set was introduced to the mixed model motor scheduling problem. The objective function of minimizing of total over and idle time based on the moving time windows of closed station and the keeping a constant rate of part in JIT environment were built. The optimization algorithms of sequencing were analyzed. The AGV scheduling problem of the mixed model assembly line was analyzed by queuing analysis and optimization techniques. The virtual simulation object, simulation model and control logic of the transmission group for general automotive assembly process were build on the base of the eM-Power software plat of digital factory according to the assembly process. The production evaluation was developed and the results were feasible.
Document similarity measures to distinguish native vs. non-native essay writers
Authors: Olga Gurevich, Paul Deane
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

The ability to distinguish statistically different populations of speakers or writers can be an important asset in many NLP applications. In this paper, we describe a method of using document similarity measures to describe differences in behavior between native and non-native speakers of English in a writing task.
Efficient alignment of RNAs with pseudoknots using sequence alignment constraints
Authors: Byung-Jun Yoon
Venue: EURASIP Journal on Bioinformatics and Systems Biology (2009)

When aligning RNAs, it is important to consider both the secondary structure similarity and primary sequence similarity to find an accurate alignment. However, algorithms that can handle RNA secondary structures typically have high computational complexity that limits their utility. For this reason, there have been a number of attempts to find useful alignment constraints that can reduce the computations without sacrificing the alignment accuracy. In this paper, we propose a new method for finding effective alignment constraints for fast and accurate structural alignment of RNAs, including pseudoknots. In the proposed method, we use a profile-HMM to identify the "seed" regions that can be aligned with high confidence. We also estimate the position range of the aligned bases that are located outside the seed regions. The location of the seed regions and the estimated range of the alignment positions are then used to establish the sequence alignment constraints. We incorporated the proposed constraints into the profile context-sensitive HMM (profile-csHMM) based RNA structural alignment algorithm. Experiments indicate that the proposed method can make the alignment speed up to 11 times faster without degrading the accuracy of the RNA alignment.