ppxscal/embedding_network huggingface dataset:
Learning Bayesian Classifiers from Dependency Network Classifiers
Authors: José A. Gámez, Juan L. Mateo, José M. Puerta
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

In this paper we propose a new method for learning Bayesian network classifiers in an indirect way instead of directly from data. This new model is a classifier based on dependency networks [1] that is a probabilistic graphical model similar to Bayesian networks but in which directed cycles are allowed. The benefits from doing things in this way are that learning process for dependency networks can be easier and simpler than learning Bayesian networks, with the direct consequence that learning algorithms could have good properties about scalability. We show that it is possible to take advantage of this facility to get Bayesian networks classifiers without losing quality in classification.
A Design Method of Associative Memory Model with Expecting Fault-Tolerant Field
Authors: Guowei Yang, Shoujue Wang, Qingxu Yan
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

A design method of associative memory model with expecting fault-tolerant field is proposed.The benefit of this method is to make the designed associative memory model memory sample fault-tolerant field which implements the hoped situation. For any different P samples in n dimensional binary information space D n = [1, ¿ 1] n and any the p compartmentalization C 1,C 2,...,C p of D n , an associative memory model with expecting fault-tolerant field C 1,C 2,...,C p can be designed by the method. The method better solves the difficult synthesis problems of associative memory models.
Voting from the Home or Office? Don't Hold Your Breath
Authors: Stephen Ruth, David Mercer
Venue: IEEE Internet Computing (2007)

It sounds so easy--why can't people vote online in national and state elections with the same security and convenience that they enjoy while banking or buying books? Considering how far e-commerce has come, it's rather surprising that Internet voting is nowhere near to being a mainstream practice.
Fusing Uncertain Structured Spatial Information
Authors: Florence Dupin De Saint-Cyr, Robert Jeansoulin, Henri Prade
Venue: Proceedings of the 2nd international conference on Scalable Uncertainty Management (2008)

Spatial information associates properties to labeled areas. Space is partitioned into (elementary) parcels, and union of parcels constitute areas. Properties may have various level of generality, giving birth to a taxonomy of properties for a given universe of discourse. Thus, the set of properties pertaining to a conceptual taxonomy, as the set of areas and parcels, are structured by a natural partial order. We refer to such structures as ontologies. In fusion problems, information coming from distinct sources may be expressed in terms of different conceptual and/or spatial ontologies, and may be pervaded with uncertainty. Dealing with several conceptual (or spatial) ontologies in a fusion perspective presupposes that these ontologies be aligned. This paper introduces a basic representation format called attributive formula, which is a pair made of a property and a set of parcels (to which the property applies), possibly associated with a certainty level. Uncertain attributive formulas are processed in a possibilistic logic manner, augmented with a two-sorted characterization: the property may be true everywhere in an area, or at least true somewhere in the area. The fusion process combines the factual information encoded by the attributive formulas provided by the different sources together with the logical encoding of the conceptual and spatial ontologies (obtained after alignment). Then, inconsistency encountered in the fusion process may be handled by taking advantage of the existence of different fusion modes, or by relaxing when necessary a closed world-like assumption stating by default that what is true somewhere in an area may be also true everywhere in it (if nothing else is known). A landscape analysis toy example illustrates the approach.
Controlling an Interactive Game with a Multi-agent Based Normative Organisational Model
Authors: Benjamin Gâteau, Olivier Boissier, Djamel Khadraoui, Eric Dubois
Venue: Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS 2006 and ECAI 2006 International Workshops, COIN 2006 Hakodate, Japan, May 9, 2006 Riva del Garda, Italy, August 28, 2006. Revised Selected Papers (2007)

Interactive multimedia applications are whelming to increase realism in their content and scenes with which users interact. To this aim, autonomous agents are increasingly used to implement the objects composing the scene. Although autonomy brings flexibility and realism in the animation, it has to be controlled in order to conform to the global behaviour targeted by the designer of the application. Multi-agent based organisational models are good candidates to specify "rights" and "duties" of agents with respect to the intended behaviour. In this paper we present $\mathcal{M}\textsc{oise}^{Inst}$, a meta-model aiming at representing normative organisations of agents according to four points of view: structural, functional, contextual and normative. We show how this model is suited to control an application of interactive TV game show where avatars are based on agents.
Biggest Barriers to Effectiveness in CIO Role in Large Portuguese Companies
Authors: João Varajão, António Trigo, José Bulas-Cruz, João Barroso
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

This study provides some empirical insight on the barriers that chief information officers face in their Job. The findings of the survey we conducted directed to the chief information officers of the 500 large Portuguese companies by gross revenue, suggest three main barriers: the lack of time to think and define strategies, the overwhelming backlog of requests and projects and inadequate budgets. The knowledge and understanding of the identified barriers contributes to the characterization of chief information officer role state of the art and should be useful for practitioners, who may use it as a basis for developing solutions in order to overcome these barriers.
Approximating Gaussian Processes with ${\cal H}^2$-Matrices
Authors: Steffen Börm, Jochen Garcke
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

To compute the exact solution of Gaussian process regression one needs $\mathcal{O}(N^3)$ computations for direct and $\mathcal{O}(N^2)$ for iterative methods since it involves a densely populated kernel matrix of size N ×N, here N denotes the number of data. This makes large scale learning problems intractable by standard techniques.We propose to use an alternative approach: the kernel matrix is replaced by a data-sparse approximation, called an ${\mathcal H}^2$-matrix. This matrix can be represented by only ${\cal O}(N m)$ units of storage, where m is a parameter controlling the accuracy of the approximation, while the computation of the ${\mathcal H}^2$-matrix scales with ${\cal O}(N m \log N)$.Practical experiments demonstrate that our scheme leads to significant reductions in storage requirements and computing times for large data sets in lower dimensional spaces.
Usability & User Experience: Preliminary Results from Evaluating an IPTV Community Platform
Authors: Marianna Obrist, Sara Kepplinger, Elke Beck, Manfred Tscheligi, Paul Muzak
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

The promises of IPTV and related changes of the traditional TV environment are broadly discussed in the EuroiTV community. In this paper we present preliminary, qualitative results from a user evaluation conducted for an IPTV community platform focusing on usability and user experience issues. Our results show that major obstacles in the first phase of developing an IPTV community application are the usability of the system as well as the motivation of people to share personal audiovisual content.
Facial Expression Analysis on Semantic Neighborhood Preserving Embedding
Authors: Shuang Xu, Yunde Jia, Youdong Zhao
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

In this study, an expression manifold is constructed by Neighborhood Preserving Embedding (NPE) based on the expression semantic metric for a global representation of all possible facial expression images. On this learned manifold, images with semantic `similar' expression are mapped onto nearby points whatever their lighting, pose and individual appearance are quite different. The proposed manifold extracts the universal expression feature and reveals the intrinsic semantic global structure and the essential relations of the expression data. Experimental results demonstrate the effectiveness of our approach.
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
Authors: Mika Hirvensalo
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

We give constructions of small probabilistic and MO-type quantum automata that have undecidable emptiness problem for the cut-point languages.
Routine high-return human-competitive automated problem-solving by means of genetic programming
Authors: John R. Koza, Matthew J. Streeter, Martin A. Keane
Venue: Information Sciences: an International Journal (2008)

Genetic programming is a systematic method for getting computers to automatically solve problems. Genetic programming starts from a high-level statement of what needs to be done and automatically creates a computer program to solve the problem by means of a simulated evolutionary process. The paper demonstrates that genetic programming (1) now routinely delivers high-return human-competitive machine intelligence; (2) is an automated invention machine; (3) can automatically create a general solution to a problem in the form of a parameterized topology and (4) has delivered a progression of qualitatively more substantial results in synchrony with five approximately order-of-magnitude increases in the expenditure of computer time. These points are illustrated by a group of recent results involving the automatic synthesis of the topology and sizing of analog electrical circuits, the automatic synthesis of placement and routing of circuits, and the automatic synthesis of controllers as well as references to work involving the automatic synthesis of antennas, networks of chemical reactions (metabolic pathways), genetic networks, mathematical algorithms, and protein classifiers.
Efficient Reliable Data Transmission Using Network Coding in MANET Multipath Routing Environment
Authors: Tomonori Kagi, Osamu Takahashi
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

We propose an efficient reliability improvement method in a MANET environment by applying network coding encoded by a relay node. Reliability is improved without requiring the source node to send redundant encoding packets. As shown by simulations, the packet delivery ratio of our proposed method is as high as the existing encoding method, packet-level forward error control (FEC), but our method has a longer delay than FEC and split multipath routing (SMR) in an environment with packet errors. In addition, packet overhead in our proposed method is improved by decreasing the number of packets transmitted by the source node. Thus, our proposed method realizes more efficient and reliable data transmission, especially in comparison with FEC.
Exploiting Hybrid Parallelism in Web Search Engines
Authors: Carolina Bonacic, Carlos Garcia, Mauricio Marin, Manuel Prieto, Francisco Tirado
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

With the emergence of multi-core CPU (or Chip-level MultiProcessor -CMP-), it is essential to develop techniques that capitalize on CMP's advantages to speed up very demanding applications of parallel computing such as Web search engines. In particular, for this application and given the huge amount of computational resources deployed at data centers, it is of paramount importance to come out with strategies able to get the best performance from hardware. This is specially critical when we consider how we organize hardware to cope with sustained periods of very high traffic of user queries. In this paper, we propose an hybrid technique based on MPI and OpenMP which has been devised to take advantage of the multithreading facilities provided by CMP nodes for search engines under high query traffic.
Supporting Fraud Analysis in Mobile Telecommunications Using Case-Based Reasoning
Authors: Pedro Almeida, Marco Jorge, Luís Cortesão, Filipe Martins, Marco Vieira, Paulo Gomes
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

Fraud in mobile telecommunications is a complex and dynamic problem for Telecom operators. These companies have developed and are exploring new ways of making the fraud detection process more efficient. Most of these attempts are based in fraud management systems, capable of detecting fraudulent communications. In this paper, we present a case-based reasoning system that aids fraud analysts in the classification of potential fraud cases. The system developed, presents to the analyst the most similar past cases, representing suspicious communication episodes that were previously investigated. We also describe an example of how the system is used.
Efficient Compression of Web Graphs
Authors: Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

Several methods have been proposed for compressing the linkage data of a Web graph. Among them, the method proposed by Boldi and Vigna is known as the most efficient one. In the paper, we propose a new method to compress a Web graph. Our method is more efficient than theirs with respect to the size of the compressed data. For example, our method needs only 1.99 bits per link to compress a Web graph containing 3,216,152 links connecting 325,557 pages, while the method of Boldi and Vigna needs 2.84 bits per link to compress the same Web graph.
Selection of a subset of EEG channels of epileptic patient during seizure using PCA
Authors: Tahir Ahmad, Raja Ahmad Fairuz, Fauziah Zakaria, Herman Isa
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

One of the major roles of electroencephalography (EEG) is as an aid to diagnose epilepsy. Abnormal patterns such as spikes, sharp waves and, spikes and wave complexes can be seen. Our main interest is to extract information about the dynamics from a few observations of this recorded signal. In this paper, The Principal Component Analysis (PCA) is used in choosing a subset of EEG channels during epileptic seizure. Results from the selection is then compared to the results of clustering on the EEG data obtained from the respective patients. Finally we obtained signature of general epilepsy by superimposing results of the two methods.
Hermite integrations with TSBTS algorithm for N-body problems
Authors: Murat Kaplan, Hasan Saygin
Venue: Proceedings of the 1st WSEAS International Conference on Multivariate Analysis and its Application in Science and Engineering (2008)

Time symmetric block time step algorithm (TSBTS) is a newly developed efficient method for N-body integration algorithms. It is aimed to collect time symmetric behavior of the integrations with block time step mentality. This algorithm is firstly developed with second order structurally time symmetric leapfrog integration scheme. In this work, we aimed to show that, this algorithm gives very well results with time symmetric fourth-order Hermite integration scheme. We also show that, the algorithm protect high energy conservation skill when we use it with sixth and eighth order Hermite schemes without time symmetric interpolations.
On a Special Class of Primitive Words
Authors: Elena Czeizler, Lila Kari, Shinnosuke Seki
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

When representing DNA molecules as words, it is necessary to take into account the fact that a word u encodes basically the same information as its Watson-Crick complement ¿(u), where ¿ denotes the Watson-Crick complementarity function. Thus, an expression which involves only a word u and its complement can be still considered as a repeating sequence. In this context, we define and investigate the properties of a special class of primitive words, called ¿-primitive, which cannot be expressed as such repeating sequences. For instance, we prove the existence of a unique ¿-primitive root of a given word, and we give some constraints forcing two distinct words to share their ¿-primitive root. Also, we present an extension of the well-known Fine and Wilf Theorem, for which we give an optimal bound.
A basis path testing framework for WS-BPEL composite services
Authors: Theerapong Lertphumpanya, Twittie Senivongse
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

Web services technology has been widely accepted as a technology that can answer to the requirements of the Service-Oriented Architecture in building software applications out of loosely-coupled software components called services. This opens an opportunity to aggregate functionalities of various services in a software composition. Web services technology offers the WS-BPEL language for service composers to create composite services out of other services by having them collaborate in a workflow. These composite services can be used further as building blocks for constructing other composite services. This paper proposes a basis path testing framework for service testers to examine and test basis paths of WS-BPEL services that are being constructed. The framework is equipped with a tool that can automatically generate test cases and stubs for constituent services within the WS-BPEL flow. The framework defines steps for service testers to take in order to generate the test suite and use it for basis path testing. With the framework, service composers can be assured of the compositions before deploying the composite services.
Full-Space LDA With Evolutionary Selection for Face Recognition
Authors: Xin Li, Bin Li, Hong Chen, Xianji Wang, Zhengquan Zhuang
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Linear Discriminant Analysis (LDA) is a popular feature extraction technique for face recognition. However, it often suffers from the small sample size problem when dealing with the high dimensional face data. Some approaches have been proposed to overcome this problem, but they usually utilize all eigenvectors of null or range subspaces of within-class scatter matrix(S w ). However, experimental results testified that not all the eigenvectors in the full space of are positive to the classification performance, some of which might be negative. As far as we know, there have been no effective ways to determine which eigenvectors in full space should be adopted. This paper proposes a new method EDA+Full-space LDA, which takes full advantage of the discriminative information of the null and range subspaces of by selecting an optimal subset of eignvectors. An Estimation of Distribution Algorithm (EDA) is used to pursuit a subset of eigenvectors with significant discriminative information in full space of . EDA+Full-space LDA is tested on ORL face image database. Experimental results show that our method outperforms other LDA methods.
Social Organization of Evolving Multiple Classifier System Functioning in Changing Environments
Authors: Sarunas Raudys
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

We model populations of classifiers which are aimed to function in permanently varying environments, adapt to unexpected changes, to comply fitness function and survive. A failure to fulfill survivability condition is resulting in unsuccessful agents being removed from the agent society and be replaced by newborns which inherit some upbringing learning information from parent agents. We split the agent population into groups and suggest storing agent's gains accumulated during most recent periods, distort randomly training signals and a level of survival threshold. A presence of optimal number of groups and a necessity of small groups with mutually collaborating agents is demonstrated.
Understanding the Tolerance of Dynamic Networks: A Routing-Oriented Approach
Authors: Yifeng Shao, Jie Wu
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Research on delay tolerant networks (DTNs) has brought about a plethora of routing algorithms targeted at networks with different mobility patterns. However, few research works have been done towards developing methods to understand certain characteristics of DTNs, especially those with predictable characteristics (e.g., predictable mobility). As a step towards closing this gap, we devise an efficient scheme to study the tolerance of a DTN-like dynamic network in terms of delay. Our work is from the viewpoint of routing, and is based on theories in evolving graphs [1]. In this paper, we define the solvability of a DTN in terms of delay and show that it is non-trivial to examine it in the scope of a DTN through examples and analysis. We then propose both centralized and distributed solutions to this problem. Through extensive simulations based on real traces from UMass DieselNet [2] we study the solvability of both kinds of networks using approaches proposed in this paper. Finally, we briefly discuss the scenarios to which our work could be applied.
Agent-Based Architecture of Intelligent Distance Learning System
Authors: Mikhail Pashkin
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

During several recent decades a lot of research projects have been done in the area of intelligent distance learning systems. Such systems became wide spread in different educational and industrial organizations due to rapid evolution of network engineering and Internet. The physical presence of teacher and students in one class is not required due to usage of such systems. Usually, such systems have distributed architecture. This was a major motivation to make a research to analyze possibility of multiagent technologies usage in intelligent distance learning systems. The paper presents the developed architecture of agent community for such systems and a research prototype allowing to model agents' interaction for user interface control based on several pedagogical strategies.