ppxscal/embedding_network huggingface dataset:
Query Planning for Searching Inter-dependent Deep-Web Databases
Authors: Fan Wang, Gagan Agrawal, Ruoming Jin
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can provide a high-level and simple interface for users to query such data sources, and can automate data retrieval from the deep web. However, such systems need to address the following challenges. First, in most cases, no single database can provide all desired data, and therefore, multiple different databases need to be queried for a given user query. Second, due to the dependencies present between the deep-web databases, certain databases must be queried before others. Third, some database may not be available at certain times because of network or hardware problems, and therefore, the query planning should be capable of dealing with unavailable databases and generating alternative plans when the optimal one is not feasible.This paper considers query planning in the context of a deep-web integration system. We have developed a dynamic query planner to generate an efficient query order based on the database dependencies. Our query planner is able to select the top K query plans. We also develop cost models suitable for query planning for deep web mining. Our implementation and evaluation has been made in the context of a bioinformatics system, SNPMiner. We have compared our algorithm with a naive algorithm and the optimal algorithm. We show that for the 30 queries we used, our algorithm outperformed the naive algorithm and obtained very similar results as the optimal algorithm. Our experiments also show the scalability of our system with respect to the number of data sources involved and the number of query terms.
Query Technologies and Applications for Program Comprehension (QTAPC 2008)
Authors: Mathieu Verbaere, Michael W. Godfrey, Tudor Girba
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

Industrial software systems are large and complex, both in terms of the software entities and their relationships. Consequently, understanding how a software system works requires the ability to pose queries over the design-level entities of the system. Traditionally, this task has been supported by simple tools (e.g., grep) combined with the programmer's intuition and experience. Recently, however, specialized code query technologies have matured to the point where they can be used in industrial situations, providing more intelligent, timely, and efficient responses to developer queries. This working session aims to explore the state of the art in code query technologies, and discover new ways in which these technologies may be useful in program comprehension. The session brings together researchers and practitioners. We survey existing techniques and applications, trying to understand the strengths and weaknesses of the various approaches, and sketch out new frontiers that hold promise.
External Memory Algorithms for String Problems
Authors: Kangho Roh, Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park
Venue: Fundamenta Informaticae (2008)

In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast internal memory and slow external memory continues to grow. The goal of external memory algorithms is to minimize the number of input/output operations between internal memory and external memory. These years the sizes of strings such as DNA sequences are rapidly increasing. However, external memory algorithms have been developed for only a few string problems. In this paper we consider five string problems and present external memory algorithms for them. They are the problems of finding the maximum suffix, string matching, period finding, Lyndon decomposition, and finding the minimum of a circular string. Every algorithm that we present here runs in a linear number of I/Os in the external memory model with one disk, and they run in an optimal number of disk I/Os in the external memory model with multiple disks.
Balanced cognitive load significantly improves the effectiveness of algorithm animation as a problem-solving tool
Authors: M. Eduard Tudoreanu, Eileen Kraemer
Venue: Journal of Visual Languages and Computing (2008)

The question of whether animations depicting running algorithms are beneficial in helping users has received mixed results. This paper provides evidence that the effectiveness of animations as an aid in performing a task is affected by several factors that have no influence on text-only aids. We make our case by comparing two separate studies designed to measure whether the addition of animations to textual descriptions of a running computation promotes understanding of distributed algorithms. The text-based conditions in both experiments resulted in statistically similar results, while the animation-added conditions resulted in different outcomes. The best visualization condition outperforms all other conditions by a significant margin. The factors that were different between the two experiments fall under the concept of cognitive economy. Therefore, the degree of cognitive economy is important both for empirical studies that involve animation and for practical applications in which people rely on dynamic visualization to solve an algorithmic problem.
Assessing Aptitude for Learning with a Serious Game for Foreign Language and Culture
Authors: W. Lewis Johnson, Shumin Wu
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

The Tactical Language and Culture Training System is interactive environment for learning foreign language and culture, designed to help people quickly acquire spoken communication skills. It is a serious game, combining interactive game experiences as well as interactive lessons. As part of our research, we wish to understand what individual learner characteristics predict successful learning with this approach, and investigate whether the approach can be improved so that a wider range of learners can learn effectively with it. This paper reports on an experiment, to assess which learners learn most effectively with TLCTS, and attempt to identify the individual factors that predict successful training with TLCTS. A group of US Marines participated in a session of focused training with Tactical Iraqi TM , an Iraqi Arabic course designed for military use. Performance scores and interaction logs were analyzed to determine which learners were most successful, and why.
Differential Behavioral Analysis
Authors: Bruno Robisson, Pascal Manet
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

This paper describes an attack on cryptographic devices called Differential Behavioral Analysis (or DBA). This is an hybrid attack between two already powerful attacks: differential power analysis (DPA) for the statistical treatment and safe-error attack for the fault type. DBA, simulated on an algorithmic model of AES appears to be very efficient. The attacker is able to recover the entire secret key with byte-wise "stuck-at" faults injected repetitively. A theorical as well as a more realistic approach are presented.
Bgee: Integrating and Comparing Heterogeneous Transcriptome Data Among Species
Authors: Frederic Bastian, Gilles Parmentier, Julien Roux, Sebastien Moretti, Vincent Laudet, Marc Robinson-Rechavi
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

Gene expression patterns are a key feature in understanding gene function, notably in development. Comparing gene expression patterns between animals is a major step in the study of gene function as well as of animal evolution. It also provides a link between genes and phenotypes. Thus we have developed Bgee, a database designed to compare expression patterns between animals, by implementing ontologies describing anatomies and developmental stages of species, and then designing homology relationships between anatomies and comparison criteria between developmental stages. To define homology relationships between anatomical features we have developed the software Homolonto, which uses a modified ontology alignment approach to propose homology relationships between ontologies. Bgee then uses these aligned ontologies, onto which heterogeneous expression data types are mapped. These already include microarrays and ESTs. Bgee is available at http://bgee.unil.ch/
A Hybrid Approach to Word Segmentation of Vietnamese Texts
Authors: Lê Hông Phuong, Nguyên Thi Minh Huyên, Azim Roussanaly, Hô Tuòng Vinh
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

We present in this article a hybrid approach to automatically tokenize Vietnamese text. The approach combines both finite-state automata technique, regular expression parsing and the maximal-matching strategy which is augmented by statistical methods to resolve ambiguities of segmentation. The Vietnamese lexicon in use is compactly represented by a minimal finite-state automaton. A text to be tokenized is first parsed into lexical phrases and other patterns using pre-defined regular expressions. The automaton is then deployed to build linear graphs corresponding to the phrases to be segmented. The application of a maximal- matching strategy on a graph results in all candidate segmentations of a phrase. It is the responsibility of an ambiguity resolver, which uses a smoothed bigram language model, to choose the most probable segmentation of the phrase. The hybrid approach is implemented to create vnTokenizer, a highly accurate tokenizer for Vietnamese texts.
Mathematical models of persuasion
Authors: J. P. Curtis, F. T. Smith
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

The act of persuading other people to adopt an acceptable opinion, and perhaps as a result, to do something we want them to, forms a huge part of our lives. Indeed this skill and the equally important one of being willing to listen to reason and be persuaded could be said to be at the core of what we term society. To what extent can we represent this social process mathematically? The concerned reader will doubtless be greatly relieved to hear that the authors believe that this goal is still very far distant. Nonetheless, some simple models discussed here may show some promising avenues to explore. Following some assumptions about propensity to be persuaded, discrete and continuous models are investigated and solved for two people, and then generalised to an arbitrary number of people. Possible applications are discussed.
Alternative methods of propagating contradictory evidence
Authors: Chris J. Hinde, Robert S. Patching, Steve A. McCoy
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

This paper examines two alternative methods of propagating contradictory evidence in intuitionistic fuzzy sets using mass assignment techniques as the underlying semantics, and proposes a third. Earlier papers assigned contradictory evidence arising from a combinator by considering that contradictory evidence from either operand should result in a contradictory result. The monotonic increase means that a small amount of contradiction results in a very large contradiction component even after a relatively short reasoning path. Adopting an alternative approach that assigns contradictory evidence only where both operands contain contradictory evidence results in monotonically decreasing contradictory components. THis approach would eliminate contradiction in the conclusion giving a specious validity to the result. It is proposed that, ideally a satisfactory propagation method should result in a contradictory measure that is independent of the length of the chain of reasoning. A final algorithm constructed from the earlier two is presented, which is independent of the length of the chain of reasoning. The level of contradiction in the final answer depends only on the contradictory evidence introduced during the reasoning, any contradictions arising directly from the combinations, and not on the length of the chain of reasoning.
Measuring Anonymity: The Disclosure Attack
Authors: Dakshi Agrawal, Dogan Kesdogan
Venue: IEEE Security and Privacy (2003)

Anonymity services hide user identity at the network or address level but are vulnerable to attacks involving repeated observations of the user. Quantifying the number of observations required for an attack is a useful measure of anonymity.
Scrutinizing Natural Scenes: Controlling the Gaze of an Embodied Conversational Agent
Authors: Antoine Picot, Gérard Bailly, Frédéric Elisei, Stephan Raidt
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

We present here a system for controlling the eye gaze of a virtual embodied conversational agent able to perceive the physical environment in which it interacts. This system is inspired by known components of human visual attention system and reproduces its limitations in terms of visual acuity, sensitivity to movement, limitations of short-memory and object pursuit. The aim of this coupling between animation and visual scene analysis is to provide sense of presence and mutual attention to human interlocutors. After a brief introduction to this research project and a focused state of the art, we detail the components of our system and confront simulation results to eye gaze data collected from viewers observing the same natural scenes.
ABF Based Face Texturing
Authors: Xia Zhou, Yangsheng Wang, Jituo Li, Daiguo Zhou
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

A new approach of generating textures from multi-view images is presented in this paper. The generated textures can be mapped onto a 3D face model seamlessly. Angle Based Flattening(ABF) surface parameterization is used to build the correspondence between a 3D face model and its 2D texture domain. Feature points on face model are defined according to face anatomy, and their counterparts on images are automatically extracted with AAM method, plus by some little user interaction. The correspondence between feature points on 3D model and 2D images sets up the correspondence between images and the texture domain. With above methods, we can efficiently synthesis texture seamlessly from multi-view images, and map it onto the 3D face model.
Tabu-based evolutionary algorithm with negative selection for Pareto-optimization in distributed systems
Authors: Jerzy Balicki
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Reliability and the load balancing are crucial factors for a quality evaluation of distributed systems. Load balancing of the Web servers can be implemented by reduction of the workload of the bottleneck computer what improves both a performance of the system and the safety of the bottleneck computers. An evolutionary algorithm based on a tabu search procedure is discussed for multi-criteria optimization of distributed systems A tabu mutation is applied for minimization the workload of the bottleneck computer. It can be obtained by task assignment as well as selection of suitable computer sorts. Moreover, a negative selection procedure is developed for improving nonadmissible solutions. Some numerical results are submitted.
Use of Parallel Simulated Annealing for Computational Modeling of Human Head Conductivity
Authors: Adnan Salman, Allen Malony, Sergei Turovets, Don Tucker
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

We present a parallel computational environment used to determine conductivity properties of human head tissues when the effects of skull inhomogeneities are modeled. The environment employs a parallel simulated annealing algorithm to overcome poor convergence rates of the simplex method for larger numbers of head tissues required for accurate modeling of electromagnetic dynamics of brain function. To properly account for skull inhomogeneities, parcellation of skull parts is necessary. The multi-level parallel simulated annealing algorithm is described and performance results presented. Significant improvements in both convergence rate and speedup are achieved. The simulated annealing algorithm was successful in extracting conductivity values for up to thirteen head tissues without showing computational deficiency.
Semantic Roles in Valency Lexicon of Czech Verbs: Verbs of Communication and Exchange
Authors: Václava Kettnerová, Markéta Lopatková, Klára Hrstková
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

We introduce a project to enhance a valency lexicon of Czech verbs with semantic roles. For this purpose, we make use of FrameNet. At the present stage, frame elements from FrameNet have been mapped to valency complementations of verbs of communication and verbs of exchange. The feasibility of this task has been proven by the achieved inter-annotator agreement --- 95.6% for the verbs of communication and 91.2% for the verbs of exchange. As a result, we have obtained 37 semantic roles for the verbs of communication and 34 for the verbs of exchange, based on frame elements of upper level semantic frames from FrameNet.
Dynamic Modeling and Simplified UKF for Reentry Vehicle
Authors: Ye Liu, Ju-bo Zhu, Zhao-ti Hu, De-qiang Guo
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Tracking reentry vehicle with strong maneuvers on-line is a challenging task. The key is to develop suitable dynamic models and estimation methods. Two kinds of modeling methods are discussed for reentry tracking, and the unscented filter (UKF) is introduced to the nonlinear tracking system. To reduce the computational load, three simplifications of UKF are developed. Furthermore, the feasibility and efficiency of dynamic models and simplified UKF algorithms are discussed by both theoretical analysis and simulation.
Graphic Symbol Recognition of Engineering Drawings Based on Multi-Scale Autoconvolution Transform
Authors: Chuan-Min Zhai, Ji-Xiang Du
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

In this paper, a novel graphic symbol recognition of scanned engineering drawing method based on multi-scale autoconvolution transform and radial basis probabilistic neural network (RBPNN) is proposed. Firstly, the recently proposed affine invariant image transform called Multi-Scale Autoconvolution (MSA) is adopted to extract invariant features. Then, the orthogonal least square algorithm (OLSA) is used to train the RBPNN and the recursive OLSA is adopted to optimize the structure of the RBPNN. The experimental result shows that, compared with another affine invariant technique, this new method provides a good basis for the scanned engineering drawing recognition task where the disturbances of graphic symbol can be approximated with spatial affine transformation.
Balance Properties and Distribution of Squares in Circular Words
Authors: Roberto Mantaci, Sabrina Mantaci, Antonio Restivo
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

We study balance properties of circular words over alphabets of size greater than two. We give some new characterizations of balanced words connected to the Kawasaki-Ising model and to the notion of derivative of a word. Moreover we consider two different generalizations of the notion of balance, and we find some relations between them. Some of our results can be generalised to non periodic infinite words as well.
Multiplicity of positive radial solutions for an elliptic inclusion system on an annulus
Authors: Shihuang Hong, Ji Chen
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper, we present the sufficient conditions for existence and multiplicity of positive radial solutions for elliptic inclusion systems. Our results are obtained by utilizing the generalization of Leggett and Williams's fixed point theorem, established in this paper, for the norm-type cone expansion and compression of multivalued operators.
ViewpointScaling the academic publication process to internet scale
Authors: Jon Crowcroft, S. Keshav, Nick McKeown
Venue: Communications of the ACM (2009)

A proposal to remedy problems in the reviewing process.
Algorithms for Counting 2-Sat Solutions and Colorings with Applications
Authors: Martin Fürer, Shiva Prasad Kasiviswanathan
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

An algorithm is presented for exactly counting the number of maximum weight satisfying assignments of a 2-Cnf formula. The worst case running time of O( 1.246 n ) for formulas with n variables improves on the previous bound of O( 1.256 n ) by Dahllöf, Jonsson, and Wahlström. The algorithm uses only polynomial space. As a direct consequence we get an O(1.246 n ) time algorithm for counting maximum weighted independent sets in a graph.
Thouless-Anderson-Palmer Equation for Associative Memory Neural Network Models with Fluctuating Couplings
Authors: Akihisa Ichiki, Masatoshi Shiino
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

We derive Thouless-Anderson-Palmer (TAP) equations and order parameter equations for stochastic analog neural network models with fluctuating synaptic couplings. Such systems with finite number of neurons originally have no energy concept. Thus they defy the use of the replica method or the cavity method, which require the energy concept. However for some realizations of synaptic noise, the systems have the effective Hamiltonian and the cavity method becomes applicable to derive the TAP equations.
Algorithms for Capacities and Flow Assignment Problem in Computer Networks
Authors: Abdulhakim F. Zantuti
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

The paper presents the algorithms for capacities and flow assignment problem in computer networks, the problem consists in traffic flow routers and channel capacities to minimize the average delay in computer networks, the capacities are given and the flow of traffic must be adjusted in an optimal way, we there fore expect that it may be necessary to provide more than one path for the traffic from source to the destination.