ppxscal/embedding_network huggingface dataset:
An Intelligent System for Semantic Information Retrieval Information from Textual Web Documents
Authors: Mukundan Karthik, Mariappan Marikkannan, Arputharaj Kannan
Venue: Proceedings of the 2nd international workshop on Computational Forensics (2008)

Text data, which are represented as free text in World Wide Web (WWW), are inherently unstructured and hence it becomes difficult to directly process the text data by computer programs. There has been great interest in text mining techniques recently for helping users to quickly gain knowledge from the Web. Text mining technologies usually involve tasks such as text refining which transforms free text into an intermediate representation form which is machine-processable and knowledge distillation which deduces patterns or knowledge from the intermediate form. These text representation methodologies consider documents as bags of words and ignore the meanings and ideas their authors want to convey. As terms are treated as individual items in such simplistic representations, terms lose their semantic relations and texts lose their original meanings. In this paper, we propose a system that overcomes the limitations of the existing technologies to retrieve the information from the knowledge discovered through data mining based on the detailed meanings of the text. For this, we propose a Knowledge representation technique, which uses Resources Description Framework (RDF) metadata to represent the semantic relations, which are extracted from textual web document using natural language processing techniques. The main objective of the creation of RDF metadata in this system is to have flexibility for easy retrieval of the semantic information effectively. We also propose an effective SEMantic INformation RETrieval algorithm called SEMINRET algorithm. The experimental results obtained from this system show that the computations of Precision and Recall in RDF databases are highly accurate when compared to XML databases. Moreover, it is observed from our experiments that the document retrieval from the RDF database is more efficient than the document retrieval using XML databases.
The Scalability of an Environment for Large-Scale Sensor-Networks
Authors: Timothy Middelkoop, Abhijit Deshmukh
Venue: Massively Multi-Agent Technology: AAMAS Workshops, MMAS 2006, LSMAS 2006, and CCMMS 2007 Hakodate, Japan, May 9, 2006 Honolulu, HI, USA, May 15, 2007 Selected and Revised Papers (2008)

In this paper we discuss the scalability of an environment for distributed sensor-network resource-allocation. We cover the underlying architecture and demonstrate the scalability of the architecture through a number of experiments and show that different code configurations can have an impact on run-time performance. We conclude with a discussion of some of the challenges in scaling the environment further.
Predictive Control for Artificial Intelligence in Computer Games
Authors: Paweł Wawrzyński, Jarosław Arabas, Paweł Cichosz
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

The subject of this paper is artificial intelligence (AI) of non-player characters in computer games, i.e. bots. We develop an idea of game AI based on predictive control. Bot's activity is defined by a currently realized plan. This plan results from an optimization process in which random plans are continuously generated and reselected.We apply our idea to implement a bot for the game Half-Life. Our bot, Randomly Planning Fighter (RPF), defeats the bot earlier designed for Half-Life with the use of behavior-based techniques. The experiments prove that on-line planning can be feasible in rapidly changing environment of modern computer games.
On the period of the Naor--Reingold sequence
Authors: Álvar Ibeas Martín
Venue: Information Processing Letters (2008)

In this paper we study the period of the Naor-Reingold sequence. We prove that if the parameters used to define the sequence are chosen uniformly at random, then it reaches the maximum period on average.
Model-Based Evolution of an E-Learning Environment Based on Desktop Computer to Mobile Computing
Authors: Ana I. Molina, William J. Giraldo, Francisco Jurado, Miguel A. Redondo, Manuel Ortega
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

In the last years a great amount of collaborative applications have been developed. Advances in wireless technology and its integration on mobile devices offer support to user-to-user interaction on the move, becoming any place a potential collaborative scenario. With the aim of obtaining an appropiate support for the development of multi-plataform groupware applications we propose use a model-based approach for the development of interactive groupware applications (CIAM). This approach can be used for supporting the evolution of existing systems based on desktop metaphor towards mobile support. In this paper we show the application of this method to a case study, the teaching of Domotics. We will take as a starting point a collaborative e-learning environment called "Domosim-TPC".
Using rectangular Qp elements in the SDFEM for a convection--diffusion problem with a boundary layer
Authors: Martin Stynes, Lutz Tobiska
Venue: Applied Numerical Mathematics (2008)

The streamline diffusion finite element method (SDFEM; the method is also known as SUPG) is applied to a convection-diffusion problem posed on the unit square whose solution has exponential boundary layers. A rectangular Shishkin mesh is used. The trial functions in the SDFEM are piecewise polynomials that lie in the space Q"p, i.e., are tensor products of polynomials of degree p in one variable, where p>1. The error bound @?I"Nu-u^N@?"S"D=
Counterflow Extension for the F.A.S.T.-Model
Authors: Tobias Kretz, Maike Kaufman, Michael Schreckenberg
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

The F.A.S.T. (Floor field and Agent based Simulation Tool) model is a microscopic model of pedestrian dynamics [1], which is discrete in space and time [2,3]. It was developed in a number ofmore or less consecutive steps from a simple CA model [4,5,6,7,8,9,10]. This contribution is a summary of a study [11] on an extension of the F.A.S.T-model for counterflow situations. The extensions will be explained and it will be shown that the extended F.A.S.T.-model is capable of handling various counterflow situations and to reproduce the well known lane formation effect.
Short Term Plasticity Provides Temporal Filtering at Chemical Synapses
Authors: Bruce P. Graham, Christian Stricker
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

Chemical synapses exhibit a wide range of mechanisms that modulate the postsynaptic response due to presynaptic action potentials (APs) as a function of the arrival pattern of the presynaptic APs. Here we demonstrate that combinations of depression, facilitation and frequency-dependent recovery will give synapses that are either sensitive to the steady-state input signal, or to the onsets and offsets of signal transients. In addition, a synapse may be tuned to preferentially respond to low frequency modulation of an input signal.
New Perfect Nonlinear Multinomials over F$_{p^{2k}}$ for Any Odd Prime p
Authors: Lilya Budaghyan, Tor Helleseth
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

We introduce two infinite families of perfect nonlinear Dembowski-Ostrom multinomials over $\textbf{F}_{p^{2k}}$ where p is any odd prime. We prove that in general these functions are CCZ-inequivalent to previously known PN mappings. One of these families has been constructed by extension of a known family of APN functions over $\textbf{F}_{2^{2k}}$. This shows that known classes of APN functions over fields of even characteristic can serve as a source for further constructions of PN mappings over fields of odd characteristics.Besides, we supply results indicating that these PN functions define new commutative semifields. After the works of Dickson (1906) and Albert (1952), these are the firstly found infinite families of commutative semifields which are defined for all odd primes p.
Low-Cost and Accurate Intra-flow Contention-Based Admission Control for IEEE 802.11 Ad Hoc Networks
Authors: Abdelouahid Derhab
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

In this paper, we propose a new admission control method for IEEE 802.11 ad hoc networks, called Low-cost and Accurate Admission control (LAAC). The proposed method has two variants: LAAC-Power and LAAC-CS. LAAC-Power estimates channel bandwidth availability through high power transmissions and LAAC-CS through passive monitoring of the channel. Due to the shared nature of the wireless medium, contention occurs among the nodes along a multi-hop path, which leads to intra-flow contention. LAAC accurately estimates the intra-flow contention. In addition, an analytical study demonstrates that LAAC achieves optimal results in terms of overhead and delay compared to the existing intra-flow contention-based admission control methods. LAAC also utilizes two criteria for accepting flows: one during the route request phase and the other during the route reply phase, which helps to reduce message overhead and avoid flooding route requests in hot spots. Simulation results show that LAAC-CS outperforms LAAC-Power in terms of packet delivery ratio, throughput, message overhead, and energy consumption.
A Neuro-fuzzy Approach to User Attention Recognition
Authors: Stylianos Asteriadis, Kostas Karpouzis, Stefanos Kollias
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

User attention recognition in front of a monitor or a specific task is a crucial issue in many applications, ranging from e-learning to driving. Visual input is very important when extracting information regarding a user's attention when recorded with a camera. However, intrusive equipment (special helmets, glasses equipped with cameras recording the eye movements, etc.) impose constraints on users spontaneity, especially when the target group consists of under aged users. In this paper, we propose a system for inferring user attention (state) in front of a computer monitor, only with the usage of a simple camera. The system can be used for real time applications and does not need calibration in terms of camera parameters. It can function under normal lighting conditions and needs no adaptation for each user.
Noise Reduction for Image Signal Processor in Digital Cameras
Authors: Yeul-Min Baek, Dong-Chan Cho, Jin-Aeon Lee, Whoi-Yul Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Most of noise reduction methods assume an additive white Gaussian noise (AWGN) model. However, the real noise is not AWGN. Therefore, such noise reduction methods are not effective in real images captured by digital cameras. In this paper, we propose the noise reduction method for image signal processor (ISP) in consumer digital cameras. To efficiently reduce the noise in ISP, we estimate the Skellam noise model in Bayer domain, and then we adaptively reduce the noise according to intensity values. Our noise model doesn't need to be rebuilt according to input images if it is made once. Thus, the proposed method can be a suitable algorithm for ISP. Moreover, the experimental results show that the proposed method reduces the real noise efficiently while the image detail is preserved.
On the minimal energy ordering of trees with perfect matchings
Authors: Ji-Ming Guo
Venue: Discrete Applied Mathematics (2008)

The energy of a graph is defined as the sum of the absolute values of all eigenvalues of the adjacency matrix of the graph. Zhang and Li [F. Zhang, H. Li, On acyclic conjugated molecules with minimal energies, Discrete Appl. Math. 92 (1999) 71-84] determined the first two smallest-energy trees of a fixed size with a perfect matching and showed that the third minimal energy is between two trees. This paper characterizes trees of a fixed size with a perfect matching with third minimal, fourth minimal and fifth minimal energies for n>=86 and third minimal, fourth minimal energies for 14@?n@?84.
Attention Based, Naive Strategies, for Guiding Intelligent Virtual Agents
Authors: Damien Clauzel, Claudia Roda, Laurent Ach, Benoît Morel
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

The AtGentive project [1,2] focuses on the support of attention in learning environments. To achieve this objective the system analyses the learners' computer activities and physical states and, on the basis of this analysis, it generates interventions. Such interventions either supply learners with information useful to support their current attentional focus, or are aimed at attracting the user's attention to new foci.
Believing Finite-State Cascades in Knowledge-Based Information Extraction
Authors: Benjamin Adrian, Andreas Dengel
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

Common information extraction systems are built upon regular extraction patterns and finite-state transducers for identifying relevant bits of information in text. In traditional systems a successful pattern match results in populating spreadsheet-like templates formalizing users' information demand. Many IE systems do not grade extraction results along a real scale according to correctness or relevance. This leads to difficult management of failures and missing or ambiguous information.The contribution of this work is applying belief of Dempster-Shafer's A Mathematical Theory of Evidence for grading IE results that are generated by probabilistic FSTs. This enhances performance of matching uncertain information from text with certain knowledge in knowledge bases. The use of belief increases precision especially in modern ontology-based information extraction systems.
Classification of Networks Using Network Functions
Authors: Makoto Uchida, Susumu Shirayama
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

We propose a new classification of complex networks in association with a function of networks. Networks are considered to be input-output system where the initial condition is input and the evolving dynamics is output. We study a functional relationship between the input and the output which depend on network structures. A function of network are modeled as a spin interaction system driven by Glauber dynamics with arbitrary initial conditions. Through numerical studies, we show a novel classification of networks. The results are applied to examples of real-world networks, which proved the classification to be useful for analysis of the inherent characteristics and model assumption for the real-world networks.
A metamodel optimization methodology based on multi-level fuzzy clustering space reduction strategy and its applications
Authors: Wang Hu, Li Enying, G. Y. Li, Z. H. Zhong
Venue: Computers and Industrial Engineering (2008)

This paper proposes metamodel optimization methodology based on multi-level fuzzy-clustering space reduction strategy with Kriging interpolation. The proposed methodology is composed of three levels. In the 1st level, the initial samples need partitioning into several clusters due to design variables by fuzzy-clustering method. Sequentially, only some of the clusters are involved in building metamodels locally in the 2nd level. Finally, the best optimized result is collected from all metamodels in the 3rd level. The nonlinear problems with multi-humps as test functions are implemented for proving accuracy and efficiency of proposed method. The practical nonlinear engineering problems are optimized by suggested methodology and satisfied results are also obtained.
Anticipation and Emotions for Goal Directed Agents
Authors: Emiliano Lorini, Michele Piunti, Cristiano Castelfranchi, Rino Falcone, Maria Miceli
Venue: The Challenge of Anticipation: A Unifying Framework for the Analysis and Design of Artificial Cognitive Systems (2008)

Breakthrough challenges in the cognitive modeling are in providing artificial agents with abilities to operate in open systems where dynamism, partial knowledge and non-determinism exact agents not only to to quickly react to events but also to anticipate decisions, facing with uncertainty and unpredictability of future events. One of the key issues is then to enhance cognitive reasoning with emotions and affective abilities. The rationale behind the introduction of emotions into artificial agents is manifold. Since the grew up of cognitive sciences and applied psychology during 60s, the negative bias against emotions, and more generally against `irrational' or `not reason-based' responses, has been practically reversed. The functional value of emotions has now been widely acknowledged and their evolutionary contributes have been especially emphasized (Simon, 1967; Fridjda, 1986; Parrott and Schulkin, 1993; Lazarus, 1991). From the perspective of biological evolution, emotions can be considered psychological mechanisms that evolved to solve adaptive problems (Toby and Cosmides, 1990) (i.e. escaping threats or predators, finding food, shelter and protection, finding mates) and thus surviving and delivering one's genes to one's own offspring. According to this view, emotions mediate behaviors for organisms in order to enhance long term adaptation and to answer their recurrent ecological demands. Otherwise, emotions provide evolutionary solutions to many of the critical problems implied by agents' situated interactions with their environments, for instance by enhancing proactiveness, by favoring the adaptive allocation of bounded computational resources, by providing anticipatory mechanisms for adaptation to mutable contexts, etc.
A VLSI Implementation of Minutiae Extraction for Secure Fingerprint Authentication
Authors: Sung Bum Pan, Daesung Moon, Kichul Kim, Yongwha Chung
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

To heighten the biometrics security level, the biometrics feature extraction and verification need to be performed within smart cards, not in external card readers. However, the smart card chip has very limited processing capability, and typical fingerprint feature extraction and verification algorithms may not be executed on a state-of-the-art smart card. Therefore, this paper presents an System-on-Chip(SoC) implementation of the fingerprint feature extraction algorithm which can be integrated into smart cards. To implement the ridge-following algorithm onto resource-constrained SoCs, the algorithm has been modified to increase the efficiency of the hardware. Each functional block of the algorithm has been implemented in hardware or in software by considering its computational complexity, cost and utilization of the hardware, and efficiency of the entire system. The proposed system operated in 50MHz, and 20~50 minutiae could be extracted from typical 248(292 fingerprint images in real time with small area(97K gates). Our current implementation, developed as an IP for SoCs with ARM CPU and AMBA bus, can also be used in many other smart card configurations. Also, hardware for minutiae matching can be easily integrated into the proposed minutiae extraction hardware to execute the overall fingerprint authentication within the smart card chip, removing the possibility of leaking any biometric information.
Non-visual Gameplay: Making Board Games Easy and Fun
Authors: Tatiana V. Evreinova, Grigori Evreinov, Roope Raisamo
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

In this paper we report the results of a study on an evaluation of a game and techniques which allow playing board games in the total absence of visual feedback. We have demonstrated that a camera mouse can be used for blind navigation within a game field. Snapping a position of the virtual pointer to the regions of interest as well as audio-haptic complementary mapping significantly reduce the cognitive load and facilitate mental matching and integration of overview sound sequences.
Programming the Pilot ACE: Early Programming Activity at the National Physics Laboratory
Authors: Martin Campbell-Kelly
Venue: IEEE Annals of the History of Computing (1981)

The design of the ACE was the subject of a report written by A M Turing in 1945. A pilot model of the ACE was completed at the National Physical Laboratory, England, in late 1951. By early 1952 a basic programming system had been established and the machine began regular operation This paper describes the development of this programming system and a matrix interpretive scheme that was subsequently developed. The paper concludes with an assessment of the programming activity and of the Pilot ACE itself.
Adaptive Translation: Finding Interlingual Mappings Using Self-Organizing Maps
Authors: Timo Honkela, Sami Virpioja, Jaakko Väyrynen
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

This paper presents a method for creating interlingual word-to-word or phrase-to-phrase mappings between any two languages using the self-organizing map algorithm. The method can be used as a component in a statistical machine translation system. The conceptual space created by the self-organizing map serves as a kind of interlingual representation. The specific problems of machine translation are discussed in some detail. The proposed method serves in alleviating two problems. The main problem addressed here is the fact that different languages divide the conceptual space differently. The approach can also help in dealing with lexical ambiguity.
Stochastic Local Search for Omnidirectional Catadioptric Stereovision Design
Authors: G. Dequen, L. Devendeville, E. Mouaddib
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

This paper deals with a compact catadioptric omnidirectional stereovision system based on a single camera and multi-mirrors (at least two mirrors). Many configurations were empirically designed in previous works with the aim to obtain a good 3D reconstruction accuracy. In this paper, we propose to use optimization techniques for omnidirectional catadioptric stereovision design, by using a stochastic local search method in order to find a good sensor (number, relative positions and sizes of mirrors). We explain principles of our approach and provide automatically designed sensors with a number of mirrors from two to nine. We finally simulate the 3D-reconstruction of a real environment modeled under a ray-tracing software with some of these sensors.
Implementation of SPARQL Query Language Based on Graph Homomorphism
Authors: Olivier Corby, Catherine Faron-Zucker
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

The sparql query language is a W3C candidate recommendation for asking and answering queries against RDF data. It offers capabilities for querying by graph patterns and retrieval of solutions is based on graph pattern matching. This paper is dedicated to the implementation of the sparql query language and its pattern matching mechanism which is reformulated into a graph homomorphism checking constrained by filter evaluation.