ppxscal/embedding_network huggingface dataset:
Solving Norm Form Equations over Number Fields
Authors: Paraskevas Alvanos, Dimitrios Poulakis
Venue: Proceedings of the 3rd International Conference on Algebraic Informatics (2009)

Let K be a number field and L a finite extension of K of degree ¿. Let ¿ 1 = 1,¿ 2,..., ¿ ¿ be K-linearly independent integers of L and k an integer of K. We denote by N L/K the norm from L to K. In this paper we give an algorithm for the computation of algebraic integers, x 1,..., x ¿ ¿ K satisfying the equation N L/K (¿ 1 x 1 + ¿ + x ¿ ¿ ¿) = k.
'Deep' grammatical relations for semantic interpretation
Authors: Mark McConville, Myroslava O. Dzikovska
Venue: Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation (2008)

In this paper, we evaluate five distinct systems of labelled grammatical dependency against the kind of input we require for semantic interpretation, in particular for the deep semantic interpreter underlying a tutorial dialogue system. We focus on the following linguistic phenomena: passive, control and raising, noun modifiers, and meaningful vs. non-meaningful prepositions. We conclude that no one system provides all the features that we require, although each such feature is contained within at least one of the competing systems.
Simple robots with minimal sensing: from local visibility to global geometry
Authors: Subhash Suri, Elias Vicari, Peter Widmayer
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

We consider problems of geometric exploration and self-deployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with such a limited sensing, we show that robots can achieve complex geometric reasoning and perform many non-trivial tasks. Specifically, we show that one robot equipped with a single pebble can decide whether the workspace environment is a simply-connected polygon and, if not, it can also count the number of holes in the environment. Highlighting the subtleties of our sensing model, we show that a robot can decide whether the environment is a convex polygon, yet it cannot resolve whether a particular vertex is convex. Finally, we show that using such local and minimal sensing, a robot can compute a proper triangulation of a polygon, and that the triangulation algorithm can be implemented collaboratively by a group of m such robots, each with Θ(n/m) memory. As a corollary of the triangulation algorithm, we derive a distributed analog of the well-known Art Gallery Theorem: a group of ⌊n/3⌋ (bounded memory) robots in our minimal sensing model can self-deploy to achieve visibility coverage of an n-vertex art gallery (polygon). This resolves an open question raised recently by Ganguli et al.
Automatic Extraction of Ontologies Wrapping Relational Data Sources
Authors: Lina Lubyte, Sergio Tessaris
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

Describing relational data sources (i.e. databases) by means of ontologies constitutes the foundation of most of the semantic based approaches to data access and integration. In spite of the importance of the task this is mostly carried out manually and, to the best of our knowledge, not much research has been devoted to its automatisation. In this paper we introduce an automatic procedure for building ontologies starting from the integrity constraints present in the relational sources.Our work builds upon the wide literature on database schema reverse engineering; however, we adapt these techniques to the specific purpose of reusing the extracted schemata (or ontologies) in the context of semantic data access. In particular, we ensure that the underlying data sources can be queried through the ontologies and the extracted ontologies can be used for semantic integration using recently developed techniques in this area.In order to represent the extracted ontology we adopt a variant of the DLR-Lite description logic because of its ability to express the mostly used modelling constraints, and its nice computational properties. The connection with the relational data sources is captured by means of sound views. Moreover, the adoption of this formal language enables us to prove that the extracted ontologies preserve the semantics of the integrity constraints in the relational sources. Therefore, there is no data loss, and the extracted ontology constitutes a faithful wrapper of the relational sources.
On a New Similarity Analysis in Frequency Domain for Mining Faces within a Complex Background
Authors: D. A. Karras
Venue: Proceedings of the 9th Industrial Conference on Advances in Data Mining. Applications and Theoretical Aspects (2009)

A novel similarity analysis is presented in this paper for dealing with the problem of mining faces in a complex image background. The proposed approach integrates a robust feature extraction technique based on a specific method of eigenanalysis in the frequency domain of the unique classes identified in the problem at hand, with neural network based classifiers. Such an eigenalysis aims at identifying principal characteristics in the frequency domain of the above mentioned uniquely identified classes. Each unknown image, in the testing phase, is then, analyzed through a sliding window raster scanning procedure to sliding windows identified, through a first stage neural classifier, as belonging to one of the unique classes previously mentioned. After such a sliding window labeling procedure it is reasonable for a second stage neural classifier to be applied to the testing image viewed as a sequence of such labeled sliding windows for obtaining a final decision about whether a face exists within the given test image or not. Although the proposed approach is a hierarchical procedure, its most critical stage is the similarity analysis performed through eigenanalysis in the frequency domain, since, if good identification/ labeling accuracy could be then obtained, it would facilitate final face mining.
Belief Revision with Bounded Treewidth
Authors: Reinhard Pichler, Stefan Rümmele, Stefan Woltran
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, with the ones by Dalal or Satoh being two of the most fundamental ones. As is well known, most computational tasks in this area are intractable. Therefore, in practical applications, one requires sufficient conditions under which revision problems become efficiently solvable. In this paper, we identify such tractable fragments for the reasoning and the enumeration problem exploiting the notion of treewidth. More specifically, we present new algorithms based on dynamic programming for these problems in Dalal's setting and a tractability proof using Courcelle's Theorem for Satoh's approach.
Patient Safety: Contributions from a Task Analysis Study on Medicine Usage by Brazilians
Authors: Carla Spinillo, Stephania Padovani, Cristine Lanzoni
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

Medicine misuse in Brazil is one of the most relevant health issues affecting millions of people. This paper discusses the results of a study on usage of five different medicines by 60 adult Brazilians. Problems in task performance occurred with all medicines, especially those requiring measuring doses and object manipulation. Deficiencies in the design of the medicine inserts were also found. The outcomes enable to conclude that improvements in the design of instructions for patients and of medicine inserts, as well as of medicine bottles/containers are necessary to facilitate their use by Brazilians.
Teachers Discovering Computers
Authors: Gary B. Shelly, Thomas J. Cashman
Venue:  (2009)

This is the latest book from Cengage Learning on "Teachers Discovering Computers, International Edition".
Touch based interaction using a three display interface design
Authors: Sandra Dittenberger, Arjan Geven, Manfred Tscheligi, Markus Mayer
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

In this poster we present findings of a study focusing on touch based interaction using a three display interface design on a mobile phone. We aimed to reveal users' individual preferences and methods for mobile device personalization; to find out to which extent users have already adopted the method of touch based interaction; and finally to investigate users' acceptance of location-based idle screens. Using our new interaction concept for a mobile device, we found out that participants perceive the possibility to personalize their mobile phones as important due to emotional bonding reasons with their mobile device and still the method of touch based interaction has not been fully adopted.
Modeling Soft Errors at the Device and Logic Levels for Combinational Circuits
Authors: Rajaraman Ramanarayanan, Vijay Sai Degalahal, Ramakrishnan Krishnan, Jungsub Kim, Vijaykrishnan Narayanan, Yuan Xie, Mary Jane Irwin, Kenan Unlu
Venue: IEEE Transactions on Dependable and Secure Computing (2009)

Radiation-induced soft errors in combinational logic is expected to become as important as directly induced errors on state elements. Consequently, it has become important to develop techniques to quickly and accurately predict soft-error rates (SERs) in combinational circuits. In this work, we present methodologies to model soft errors in both the device and logic levels. At the device level, a hierarchical methodology to model neutron-induced soft errors is proposed. This model is used to create a transient current library, which will be useful for circuit-level soft-error estimation. The library contains the transient current response to various different factors such as ion energies, operating voltage, substrate bias, angle, and location of impact. At the logic level, we propose a new approach to estimating the SER of logic circuits that attempts to capture electrical, logic, and latch window masking concurrently. The average error of the SER estimates using our approach, compared to the estimates obtained using circuit-level simulations, is 6.5 percent while providing an average speedup of 15,000. We have demonstrated the scalability of our approach using designs from the ISCAS-85 benchmarks.
Virtual Reality in the Digital Olympic Museum
Authors: Zhigeng Pan, Wenzhi Chen, Mingmin Zhang, Jianfeng Liu, Gangshan Wu
Venue: IEEE Computer Graphics and Applications (2009)

The Digital Olympic Museum demonstrates the Olympics' history, culture, and highlights in a virtual environment. The authors describe the framework of their prototype, which also features three virtual games. Implementation of such a system validates the feasibility of the digital Olympic museum.
Risk Strategies and Risk Strategy Equilibrium in Agent Interactions Modeled as Normal Repeated 2 × 2 Risk Games
Authors: Ka-Man Lam, Ho-Fung Leung
Venue: Multi-Agent Systems for Society: 8th Pacific Rim International Workshop on Multi-Agents, PRIMA 2005, Kuala Lumpur, Malaysia, September 26-28, 2005, Revised Selected Papers (2009)

Many multi-agent interactions, like auctions and negotiations, can be modeled as games. Game theory is a tool to analyze these multi-agent applications as games and to analyze how agents should interact in these applications, which helps design intelligent agents. In many of the existing solutions to these multi-agent applications, the concept of risk is used, but it is not formally defined in game theory. On the other hand, in many games, pure strategy Nash equilibrium does not exist, while mixed or behavioral strategy equilibria are not appropriate, as mixed or behavioral strategies are probabilistic in nature, and it is possible that a low utility results in particular (sub)games. Worse, mixed or behavioral strategies cannot properly model the autonomous nature of agents. Furthermore, trigger strategies for repeated games are based on punishment, which is sometimes not as good as making decisions based on experience. However, making decisions based on past experience is not represented in existing game theory concepts. To solve the problems, we introduce the concept of risk strategies in repeated 2 ×2 risk games. We find that players can get better payoffs by using risk strategy than using mixed or behavioral strategies in repeated 2 ×2 risk games. In addition, we find that a game without pure strategy Nash equilibrium can converge to a new type of equilibrium, which we define as risk strategy equilibrium.
Democratizing design: new challenges and opportunities for computer-supported collaborative learning
Authors: Gerhard Fischer
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

The fundamental challenge for the next generation of Computer-Supported Collaborative Learning (CSCL) systems is to contribute to the invention, fostering and support of cultures of participation in which humans can express themselves and engage in personally meaningful activities. New models for knowledge creation, accumulation, and sharing are needed that allow, encourage, and support all participants to be active contributors in personally meaningful activities. In our research, we have explored and contrasted two different models: MODEL-AUTHORITATIVE (based on strong input filters, relatively small information repositories, and weak output filters) and MODEL-DEMOCRATIC (based on weak input filters, large and diverse information repositories, and strong output filters to find relevant and reliable information). We postulate that MODEL-DEMOCRATIC democratizes design, requires support for meta-design, and fosters social creativity thereby creating new challenges and opportunities for computer-supported collaborative learning. Examples from different lifelong learning settings based on MODEL-DEMOCRATIC are described and analyzed and some general findings are derived and discussed.
A fast and accurate method for detecting English-Japanese parallel texts
Authors: Ken'ichi Fukushima, Kenjiro Taura, Takashi Chikayama
Venue: Proceedings of the Workshop on Multilingual Language Resources and Interoperability (2006)

Parallel corpus is a valuable resource used in various fields of multilingual natural language processing. One of the most significant problems in using parallel corpora is the lack of their availability. Researchers have investigated approaches to collecting parallel texts from the Web. A basic component of these approaches is an algorithm that judges whether a pair of texts is parallel or not. In this paper, we propose an algorithm that accelerates this task without losing accuracy by preprocessing a bilingual dictionary as well as the collection of texts. This method achieved 250,000 pairs/sec throughput on a single CPU, with the best F1 score of 0.960 for the task of detecting 200 Japanese-English translation pairs out of 40,000. The method is applicable to texts of any format, and not specific to HTML documents labeled with URLs. We report details of these preprocessing methods and the fast comparison algorithm. To the best of our knowledge, this is the first reported experiment of extracting Japanese-English parallel texts from a large corpora based solely on linguistic content.
Ranking List Dispersion as a Query Performance Predictor
Authors: Joaquín Pérez-Iglesias, Lourdes Araujo
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

In this paper we introduce a novel approach for query performance prediction based on ranking list scores dispersion. Starting from the hypothesis that different score distributions appear for good and poor performance queries, we introduce a set of measures that capture these differences between both types of distributions. The use of measures based on standard deviation of ranking list scores, as a prediction value, shows a significant correlation degree in terms of average precision.
On the complexity of signed and minus total domination in graphs
Authors: Chuan-Min Lee
Venue: Information Processing Letters (2009)

In this paper we present unified methods to solve the minus and signed total domination problems for chordal bipartite graphs and trees in O(n^2) and O(n+m) time, respectively. We also prove that the decision problem for the signed total domination problem on doubly chordal graphs is NP-complete. Note that bipartite permutation graphs, biconvex bipartite graphs, and convex bipartite graphs are subclasses of chordal bipartite graphs.
An algebraic method for compressing symbolic data tables
Authors: Yannis Tzitzikas
Venue: Intelligent Data Analysis (2006)

Although symbolic data tables summarize huge sets of data they can still become very large in size. This paper proposes a novel technique for compressing a symbolic data table using the recently emerged Compound Term Composition Algebra. One advantage of CTCA is that the closed world hypotheses of its operations can lead to a remarkably high "compression ratio". The compacted form apart from having much lower storage space requirements, it allows designing more efficient algorithms for symbolic data analysis.
Design and Evaluation of Innovative Chord Input for Mobile Phones
Authors: Fong-Gong Wu, Chia-Wei Chang, Chien-Hsu Chen
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

Text message is one of the most popular functions of mobile phones, apart from talking through the phone. This study focuses on how chord input is being used on mobile phones, as well as operating phones with chord input. We propose two new mobile phones: Tri-joint key and Four-corner key, which combines with the chord input and the natural finger localization. There were 14 male participants and 6 female participants that participated in this research; after 9 days of practice with the content of numerals, English characters and English phrases. The result shows the performances of the participants have increased, including the speed of completing tasks and accuracy. There is no significant difference between these two new styles of phones and the ordinary type concerning the user satisfaction chart. This also means users could accept new kinds of input devices.
Unification of speaker and meaning in language comprehension: An fmri study
Authors: Cathelijne M. J. Y. Tesink, Karl Magnus Petersson, Jos J. A. van Berkum, Daniëlle van den Brink, Jan K. Buitelaar, Peter Hagoort
Venue: Journal of Cognitive Neuroscience (2009)

When interpreting a message, a listener takes into account several sources of linguistic and extralinguistic information. Here we focused on one particular form of extralinguistic information, certain speaker characteristics as conveyed by the voice. Using functional magnetic resonance imaging, we examined the neural structures involved in the unification of sentence meaning and voice-based inferences about the speaker's age, sex, or social background. We found enhanced activation in the inferior frontal gyrus bilaterally (BA 45/47) during listening to sentences whose meaning was incongruent with inferred speaker characteristics. Furthermore, our results showed an overlap in brain regions involved in unification of speaker-related information and those used for the unification of semantic and world knowledge information [inferior frontal gyrus bilaterally (BA 45/47) and left middle temporal gyrus (BA 21)]. These findings provide evidence for a shared neural unification system for linguistic and extralinguistic sources of information and extend the existing knowledge about the role of inferior frontal cortex as a crucial component for unification during language comprehension.
Modeling Word Selection in Predictive Text Entry
Authors: Hamed H. Sad, Franck Poirier
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Although word, or short phrase, selection from a list is an extensively used task on different types of interfaces, there is no accepted model for its execution time in the literature. We present a Keystroke Level Model (KLM) adapted for this task on both desktop and handheld interfaces. The model is built from the results of an empirical study for exploring the effect of the list sorting and the number of words displayed to the user on the selection time of a word at a specified position in the list. The resulting model is integrated into an existing model for predicting the text entry speed of word-disambiguation entry methods. The predicted text entry speed is then compared to the published empirical results and to the theoretical results of the model that doesn't take into account word selection search time. The error between prediction and empirical-results is effectively reduced using the modified model.
Geological Spatial Data Mining Basing on Web Geological Database
Authors: X. He, J. J. Liu
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Web database of geological information is constructed to manage the geological information efficiently. The infrastructure of the web database is implemented with B/S model, where the geological information is classified into four types of entities and stored in the database with Microsoft SQL Server 2005.The web server is implemented with Microsoft IIS and the exchange of the data between the web server and the database server is implemented by mid-wares which are implemented with COM technology. Basing on the web database, the structure of geological spatial data mining system, the process of geological spatial data mining and the geological knowledge discovering are discussed. The web database of Daqing Oil Filed Co Ltd in China is presented as an engineering case to explain the implementation of the web database and the data mining with the database constructed.
Navigational Consistency in Websites: What Does it Mean to Users?
Authors: Helen Petrie, George Papadofragkakis, Christopher Power, David Swallow
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

A study was conducted to investigate the effects of navigational inconsistencies in websites on users' perceptions and performance. Of four inconsistencies manipulated (position of navigational bar, order of elements in navigational bar, font type and size of elements), only the position of the bar had a substantial effect. However this affected both users' perception of their performance and their actual performance, in terms of the time spent on webpages. The mean time spent on the page with the inconsistently positioned navigational bar more than doubled and this effect persisted over subsequent pages. The methodology developed provides a useful way of investigating the effects of navigational inconsistency, an under-studied phenomenon.