ppxscal/embedding_network huggingface dataset:
A framework for a feedback process to analyze and personalize a document vector space in a feature extraction model
Authors: Kosuke Takano, Xing Chen, Keisuke Masuda
Venue: Information Technology and Management (2009)

In this paper, we present a framework for a feedback process to implement a highly accurate document retrieval system. In the system, a document vector space is created dynamically to implement retrieval processing. The retrieval accuracy of the system depends on the vector space. When the vector space is created based on a specific purpose and interest of a user, highly accurate retrieval results can be obtained. In this paper, we present a method for analyzing and personalizing the vector space according to the purposes and interests of users. In order to optimize the document vector space, we defined and implemented functions for the operations of adding, deleting and weighting the terms that were used to create the vector space. By exploiting effectively and dynamically the classified-document information related to the queries, our methods allow users to retrieve relevant documents for their interests and purposes. Even if the search results of the initial retrieval space are not appropriate, by applying the proposed feedback operations, our proposed method effectively improves the search results. We also implemented an experimental search system for semantic document retrieval. Several experimental results including comparisons of our method with the traditional relevance feedback method is presented to clarify how retrieval accuracy was improved by the feedback process and how accurately documents that satisfied the purpose and interests of users were extracted.
Mapping Parallel FFT Algorithm onto SmartCell Coarse-Grained Reconfigurable Architecture
Authors: Cao Liang, Xinming Huang
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

This paper presents the implementation of a novel parallel FFT algorithm on SmartCell, a coarse-grained reconfigurable architecture, which is targeted on data streaming applications. The proposed FFT algorithm achieves balanced workload and memory requirement among the computational units, while maintaining optimized data flow at low configuration and communication cost. The proposed parallel FFT algorithm is then mapped onto the SmartCell prototype device with 64 processing elements. Results show that the parallel FFT implementation on SmartCell is about 14.9 and 2.7 times faster than network-on-chip (NoC) and Morphosys, respectively. The implementation also shows about 3.6 times better energy efficiency when comparing with the pipelined FFT implementations on FPGA.
Universal Estimation of Information Measures for Analog Sources
Authors: Qing Wang, Sanjeev R. Kulkarni, Sergio Verdú
Venue: Foundations and Trends in Communications and Information Theory (2009)

This monograph presents an overview of universal estimation of information measures for continuous-alphabet sources. Special attention is given to the estimation of mutual information and divergence based on independent and identically distributed (i.i.d.) data. Plug-in methods, partitioning-based algorithms, nearest-neighbor algorithms as well as other approaches are reviewed, with particular focus on consistency, speed of convergence and experimental performance.
Interactive reflection editing
Authors: Tobias Ritschel, Makoto Okabe, Thorsten Thormählen, Hans-Peter Seidel
Venue: ACM Transactions on Graphics (TOG) (2009)

Effective digital content creation tools must be both efficient in the interactions they provide but also allow full user control. There may be occasions, when art direction requires changes that contradict physical laws. In particular, it is known that physical correctness of reflections for the human observer is hard to assess. For many centuries, traditional artists have exploited this fact to depict reflections that lie outside the realm of physical possibility. However, a system that gives explicit control of this effect to digital artists has not yet been described. This paper introduces a system that transforms physically correct reflections into art-directed reflections, as specified by reflection constraints. The system introduces a taxonomy of reflection editing operations, using an intuitive user interface, that works directly on the reflecting surfaces with real-time visual feedback using a GPU. A user study shows how such a system can allow users to quickly manipulate reflections according to an art direction task.
Proposal of Delegation Using Electronic Certificates on Single Sign-On System with SAML-Protocol
Authors: Takaaki Komura, Yasuhiro Nagai, Shoichi Hashimoto, Makiko Aoyagi, Kenji Takahashi
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

We propose a delegation function on web-based applications federated with a single sign-on system, in which users are authenticated by their electronic certificate, based on SAML protocol. The function enables a delegatee to access web-based business applications instead of delegator. In order to realize the function, we first design the contents and issuing process of the electronic ''delegation certificate'' using extended certificate authority system, from a view point of easy and secure operation. Next, delegation operation between delegator and delegatee is realized in the extended single sign-on system with identity provider and several service providers by using SAML protocol, without customizing web-application. Finally we evaluate proposed system through several kinds of operation. The experimental usage by some delegators and delegatees indicates that the delegation function and its system is sufficiently acceptable because of easy operation.
Adaptive timeout policies for fast fine-grained power management
Authors: Branislav Kveton, Prashant Gandhi, Georgios Theocharous, Shie Mannor, Barbara Rosario, Nilesh Shah
Venue: Proceedings of the 19th national conference on Innovative applications of artificial intelligence - Volume 2 (2007)

Power management techniques for mobile appliances put the components of the systems into low power states to maximize battery life while minimizing the impact on the perceived performance of the devices. Static timeout policies are the state-of-the-art approach for solving power management problems. In this work, we propose adaptive timeout policies as a simple and efficient solution for fine-grained power management. As discussed in the paper, the policies reduce the latency of static timeout policies by nearly one half at the same power savings. This result can be also viewed as increasing the power savings of static timeout policies at the same latency target. The main objective of our work is to propose practical adaptive policies. Therefore, our adaptive solution is fast enough to be executed within less than one millisecond, and sufficiently simple to be deployed directly on a microcontroller. We validate our ideas on two recorded CPU activity traces, which involve more than 10 million entries each.
Ready for a Web OS?
Authors: Alex Wright
Venue: Communications of the ACM (2009)

A new generation of browsers may finally herald the long-awaited convergence of the Web and operating system.
Time course of evoked-potential changes in different forms of anomia in aphasia
Authors: Marina Laganaro, Stéphanie Morand, Armin Schnider
Venue: Journal of Cognitive Neuroscience (2009)

Impaired word production after brain damage can be due to impairment at lexical-semantic or at lexical-phonological levels of word encoding. These processes are thought to involve different brain regions and to have different time courses. The present study investigated the time course of electrophysiological correlates of anomia in 16 aphasic speakers, divided in two subgroups according to their anomic pattern (8 with lexical-semantic impairment and 8 with lexical-phonological impairment), in comparison to 16 healthy control subjects performing the same picture naming task. Differences in amplitudes and in topographic maps between groups were differently distributed when the whole heterogeneous group of aphasic patients was compared to the control group and when the two more homogeneous subgroups of anomic patients were analyzed. The entire aphasic group expressed different waveforms and topographic patterns than the control group starting about 100 msec after picture presentation. When two subgroups of aphasic patients are considered according to the underlying cognitive impairment, early event-related potential (ERP) abnormalities (100-250 msec) appeared only in the lexical-semantic subgroup, whereas later ERP abnormalities (300-450 msec) occurred only in the lexical-phonological subgroup. These results indicate that the time windows of ERP abnormalities vary depending on the underlying anomic impairment. Moreover, the findings give support to current hypotheses on the time course of processes involved in word production during picture naming.
On CSP Refinement Tests That Run Multiple Copies of a Process
Authors: Gavin Lowe
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In this paper we consider CSP stable failures refinement checks, where the right hand side of the refinement contains n copies of a process P. We show that such refinement checks capture precisely those predicates of the form @?f"1,...,f"n@?failures(P)@?R(f"1,...,f"n) for some n-ary relation R. The construction of the refinement test is, in general, infinitary; however, we show how, given R, one can often calculate a finite state refinement check.
Optimization of Online Patient Scheduling with Urgencies and Preferences
Authors: I. B. Vermeulen, S. M. Bohte, P. A. Bosman, S. G. Elkhuizen, P. J. Bakker, J. A. Poutré
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

We consider the online problem of scheduling patients with urgencies and preferences on hospital resources with limited capacity. To solve this complex scheduling problem effectively we have to address the following sub problems: determining the allocation of capacity to patient groups, setting dynamic rules for exceptions to the allocation, ordering timeslots based on scheduling efficiency, and incorporating patient preferences over appointment times in the scheduling process. We present a scheduling approach with optimized parameter values that solves these issues simultaneously. In our experiments, we show how our approach outperforms standard scheduling benchmarks for a wide range of scenarios, and how we can efficiently trade-off scheduling performance and fulfilling patient preferences.
Structures of Some Strong Reducibilities
Authors: David R. Bélanger
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

Recent developments in computability theory have given rise to new tools, among them the ibT and cl reducibilities, which, applications aside, are somewhat mysterious and deserve to be studied per se. This paper aims to throw some light on the little-explored degree structures induced by these new reducibilities. 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
Using Acoustic Landscapes for the Evaluation of Multimodal Mobile Applications
Authors: Wolfgang Beinhauer, Cornelia Hipp
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Multimodal mobile applications are gaining momentum in the field of location based services for special purposes. One of them is navigation systems and tourist guides for pedestrians. In some cases, when the visibility is limited or blind people are longing for guidance, acoustic landmarks are used for macro-navigation rather than visual landmarks. Likewise, micro-navigation supported by pedestrian navigation systems must comply to the user's expectations. In this paper, we present an acoustic landscape that allows the emulation of arbitrary out-door situations dedicated for the evaluation of navigation systems. We present the evaluation capabilities and limitations of the laboratory as well as an example of an evaluation of a pedestrian navigation system that uses acoustic and haptic feedback.
Fast Hashing to G2 on Pairing-Friendly Curves
Authors: Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa
Venue: Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography (2009)

Pairings on elliptic curves usually take as input a point in a subgroup G 1 of an elliptic curve group $E({\mathbb{F}}_p)$ and a point in a subgroup G 2 of $E'({\mathbb{F}}_{p^d})$ for some twist E¿ of E. In this paper we consider the problem of hashing to G 2 when the group G 2 has prime order. The naive approach requires multiplication in the group $E'({\mathbb{F}}_{p^d})$ by a large cofactor. Our main result is to describe a fast method to compute this cofactor multiplication; our method exploits an efficiently computable homomorphism.
The Construction of Transactions for Web Usage Mining
Authors: Yan Li, Bo-qin Feng
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

A data preprocessing system for constructing the transactions in web usage mining is presented. To implement transaction identification, the user sessions and the user access paths are extracted from the web access log and missing information is appended. These tasks are accomplished with the application of the referer-based method, which is an effective solution to the problems introduced by using proxy servers, local caching and firewall. Meanwhile, the reference length of accessed pages is calculated with the consideration of the time spent on data transfer over internet. Then two kinds of transactions are defined, i.e. travel-path transactions and content-only transactions. These two kinds of transactions are constructed by the maximal forward references (MFR) algorithm and the reference length (RL) algorithm, respectively. As verified by practical web access log, it is shown that the transactions can be efficiently identified while the reliability of the original web access data is obviously improved for the further researches.
A Tangible Game as Distributable Platform for Psychophysical Examination
Authors: Matthias Rath, Sascha Bienert
Venue: Proceedings of the 4th International Conference on Haptic and Audio Interaction Design (2009)

Through the use of built-in accelerometers a game-software for recent generation MacBooks allows control of a scenario of virtual moving objects by tilting the computer. Together with integrated visual and continuous auditory feedback from models based on physical principles the software forms a possible platform for online collection of psychophysical data.
Score Distributions in Information Retrieval
Authors: Avi Arampatzis, Stephen Robertson, Jaap Kamps
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

We review the history of modeling score distributions, focusing on the mixture of normal-exponential by investigating the theoretical as well as the empirical evidence supporting its use. We discuss previously suggested conditions which valid binary mixture models should satisfy, such as the Recall-Fallout Convexity Hypothesis, and formulate two new hypotheses considering the component distributions under some limiting conditions of parameter values. From all the mixtures suggested in the past, the current theoretical argument points to the two gamma as the most-likely universal model, with the normal-exponential being a usable approximation. Beyond the theoretical contribution, we provide new experimental evidence showing vector space or geometric models, and BM25, as being "friendly" to the normal-exponential, and that the non-convexity problem that the mixture possesses is practically not severe.
Application of Run Sequences Comparison in Software Fault Diagnosis
Authors: Yigang Wang, Xiaodong Zhu, Fei Ye, Yanbin Liu
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

After analyzing the software failure mechanism, the method of software run sequences comparison is presented, which increases the effectiveness of software fault diagnosis. The method applies the thought of nearest neighbor to searching the nearest neighbor normal run of the fault run by using the edit distance. By comparing the fault run sequences with its nearest neighbor, the difference between them can be found, which generates the program suspect range report. And the evaluation function is presented. Finally the experiment verifies the approach.
BML and Related Tools
Authors: Jacek Chrząszcz, Marieke Huisman, Aleksy Schubert
Venue: Formal Methods for Components and Objects: 7th International Symposium, FMCO 2008, Sophia Antipolis, France, October 21-23, 2008, Revised Lectures (2009)

The Bytecode Modeling Language (BML) is a specification language for Java bytecode, that provides a high level of abstraction, while not restricting the format of the bytecode. Notably, BML specifications can be stored in class files, so that they can be shipped together with the bytecode. This makes BML particularly suited as property specification language in a proof-carrying code framework. Moreover, BML is designed to be close to the source code level specification language JML, so that specifications (and proofs) developed at -- the more intuitive -- source code level can be compiled into bytecode level.This paper describes the BML language and its binary representation. It also discusses the tool set that is available to support BML, containing BMLLib, a library to inspect and edit BML specifications; Umbra, a BML viewer and editor, integrated in Eclipse; JML2BML, a compiler from JML to BML specifications; BML2BPL, a translator from BML to BoogiePL, so that the BoogiePL verification condition generator can be used; and CCT, a tool to store proofs in class files.
Single-machine scheduling problems with deteriorating jobs and learning effects
Authors: Li Sun
Venue: Computers and Industrial Engineering (2009)

In this paper, we introduce a new scheduling model in which deteriorating jobs and learning effect are both considered simultaneously. By deterioration and the learning effect, we mean that the actual processing time of a job depends not only on the processing time of the jobs already processed but also on its scheduled position. For the single-machine case, we show that the problems of makespan, total completion time and the sum of the quadratic job completion times remain polynomially solvable, respectively. In addition,we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain conditions.
Some Structural and Security Properties of the Modular Secret Sharing
Authors: Tatsiana Galibus, Gennadii Matveev, Nikolay Shenets
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

We mainly study the modular secret sharing over the ring of univariate polynomials over the Galois field. The proposed modular schemes over these rings achieve improvements both in security and applicability compared to classical schemes over the ring of integers. Our threshold schemes are perfect i.e. secure in the sense of information theory and ideal i.e. efficient in the terms of memory storage (the size of the secret is equal to the size of theshares). Then we consider the modular secret sharing schemeswith pairwise co-prime moduli over the ring of polynomials and the ring of integers. We give a complete description of the access structures that can be realized by such modular schemes.
Hybrid Semantic Analysis
Authors: Miloslav Konopík, Ivan Habernal
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

This article is focused on the problem of meaning recognition in written utterances. The goal is to find a computer algorithm capable to construct the meaning description of a given utterance. An original system for meaning recognition is described in this paper. The key idea of the system is the hybrid combination of expert and machine-learning approaches to meaning recognition. The system utilizes a novel algorithm for semantic parsing. The algorithm is based upon extended context-free grammars. The grammars are automatically inferred from the data.
Data Integration and Semantic Enrichment of Systems Biology Models and Simulations
Authors: Vijayalakshmi Chelliah, Lukas Endler, Nick Juty, Camille Laibe, Chen Li, Nicolas Rodriguez, Nicolas Novère
Venue: Proceedings of the 6th International Workshop on Data Integration in the Life Sciences (2009)

The rise of Systems Biology approaches, in conjunction with the availability of numerous powerful and user-friendly modeling environments, brought computational models out of the dusty closets of theoreticians to the forefront of research in biology. Those models are becoming larger, more complex and more realistic. As any other type of data in life sciences, models have to be stored, exchanged and re-used. This was made possible by the development of a series of standards, that, when used in conjunction, can cover the whole life-cycle of a model, including the specification of its structure and syntax, the simulations to be run, and the description of its behaviour and resulting numerical output. We will review those standards, well-accepted or still under development, including the Minimal requirements (MIRIAM, MIASE), the description formats (SBML, SED-ML, SBRML) and the associated ontologies (SBO, KiSAO, TEDDY). We will show how their use by the community, through a rich toolkit of complementary software, can permit to leverage on everyone's efforts, to integrate models and simulations with other types of biological knowledge, and eventually lead to the fulfillment of one of Systems Biology's tenets of collaboration between biology, mathematics and computing science.
Strict Divergence for Probabilistic Timed Automata
Authors: Jeremy Sproston
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

Probabilistic timed automata are an extension of timed automata with discrete probability distributions. In previous work, a probabilistic notion of time divergence for probabilistic timed automata has been considered, which requires the divergence of time with probability 1. We show that this notion can lead to cases in which the probabilistic timed automaton satisfies a correctness requirement by making an infinite number of probabilistic transitions in a finite amount of time. To avoid such cases, we consider strict time divergence which concerns the divergence of time over all paths, rather than time divergence of paths with probability 1. We present new model-checking algorithms for probabilistic timed automata both for probabilistic and strict divergence. The algorithms have the same complexity as the previous model-checking algorithms for probabilistic timed automata.