ppxscal/embedding_network huggingface dataset:
Understanding and Realizing Presence in the Presenccia Project
Authors: Mel Slater, Antonio Frisoli, Franco Tecchia, Christoph Guger, Beau Lotto, Anthony Steed, Gert Pfurtscheller, Robert Leeb, Miriam Reiner, Maria V. Sanchez-Vives, Paul Verschure, Ulysses Bernardet
Venue: IEEE Computer Graphics and Applications (2007)

The Presenccia project takes an operational approach to the concept of presence. Presenccia's approach lets the project team assess the extent of presence using tools beyond traditional questionnaires, and therefore avoid many of the problems involved with sole reliance on these. Instead, the team considers the extent to which mixed reality and VR participants realistically respond to virtually generated sensory data. Specifically, they measure the similarity of their response with what they might observe or predict if the sensory data—the situation, place, or events—were real, rather than virtual. This article describes the project's research highlights.
On computational environments of topological spaces
Authors: Fangping Huang, Jihua Liang
Venue: Theoretical Computer Science (2008)

As has been disclosed by K. Martin, a large number of important topological spaces do not have any continuous domain as their computational model. So it is of interest to study new kinds of pragmatic computational environments so as to model more topological spaces. In this paper we focus on bounded complete continuous posets with enough maximal points, which are shown to be a good choice for computational environments of Tychonoff spaces with no directed complete model. It is proved that the maximal point space of a Choquet complete weak domain is also Choquet complete. Furthermore, it is proved that X is a Tychonoff space iff X has a bounded complete weak domain environment. And it is also shown that Hausdorff compactifications of Tychonoff spaces can be realized via some of their computational environments.
Extinction and coexistence of competing prey species in ecological systems
Authors: Ranjit Kumar Upadhyay, S. R. K. Iyengar
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

In this paper, a Gause type mathematical model is proposed to study the effect of predation on two competing prey species in which the predator species is influenced by the damage effect caused by crowding from the members of its own population in a diffusive system. In the absence of diffusion, criteria for local stability, instability and global stability of the non-negative equilibria of the system has been obtained. Conditions for the coexistence of the two competing prey species and the extinction of either of the prey are tested numerically. These numerical simulations suggest that there exists a stable limit cycle in some ranges of the parameters and extinction of the prey species in some other ranges of the parameters. Basin boundary calculations indicate the coexistence of different attractors on the same set of parametric values.
Text Categorization Using Neural Networks Initialized with Decision Trees
Authors: Nerijus Remeikis, Ignas Skučas, Vida Melninkaitė
Venue: Informatica (2004)

Text categorization - the assignment of natural language documents to one or more predefined categories based on their semantic content - is an important component in many information organization and management tasks. Performance of neural networks learning is known to be sensitive to the initial weights and architecture. This paper discusses the use multilayer neural network initialization with decision tree classifier for improving text categorization accuracy. Decision tree from root node until a final leave is used for initialization of each single unit. Growing decision trees with increasingly larger amounts of training data will result in larger decision tree sizes. As a result, the neural networks constructed from these decision trees are often larger and more complex than necessary. Appropriate choice of certainty factor is able to produce trees that are essentially constant in size in the face of increasingly larger training sets. Experimental results support the conclusion that error based pruning can be used to produce appropriately sized trees, which are directly mapped to optimal neural network architecture with good accuracy. The experimental evaluation demonstrates this approach provides better classification accuracy with Reuters-21578 corpus, one of the standard benchmarks for text categorization tasks. We present results comparing the accuracy of this approach with multilayer neural network initialized with traditional random method and decision tree classifiers.
A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem
Authors: Funda Samanlioglu, William G. Ferrell,  Jr., Mary E. Kurz
Venue: Computers and Industrial Engineering (2008)

This paper proposes a methodology to find weakly Pareto optimal solutions to a symmetric multi-objective traveling salesman problem using a memetic random-key genetic algorithm that has been augmented by a 2-opt local search. The methodology uses a ''target-vector approach'' in which the evaluation function is a weighted Tchebycheff metric with an ideal point and the local search is randomly guided by either a weighted sum of the objectives or a weighted Tchebycheff metric. The memetic algorithm has several advantages including the fact that the random keys representation ensures that feasible tours are maintained during the application of genetic operators. To illustrate the quality of the methodology, experiments are conducted using Euclidean TSP examples and a comparison is made to one example found in the literature.
The virtual public servant: Ireland's public services broker
Authors: Frank Bannister, Neasa Walsh
Venue: Information Polity (2002)

In recent years, the Irish Government has launched a number of e-Government initiatives. The most ambitious of these is Reach, a project to develop a Public Services Broker (PSB) which will at once be a public sector portal, a public data vault, an inter-agency broker and an authentication system. If successful, this development could result in certain public services becoming virtual, i.e. being provided entirely from or by machines. The origins of the PSB and both the assumptions and the philosophy behind it are explored. A number of issues raised by the PSB are examined and its likely impact on certain aspects of Ireland's public services is assessed.
Improving XML Querying with Maximal Frequent Query Patterns
Authors: Yijun Bei, Gang Chen, Jinxiang Dong
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Querying on XML data is a computational-expensive process due to the complex nature of both the XML data and the query. In this paper, we propose an approach to expedite XML query processing by caching the results of a specific class of queries, namely the maximal frequent queries. We mine the maximal frequent query patterns from user-issued queries and cache the results of such queries. We propose a recursive algorithm for query processing using the cached query results. Query rewriting is employed to deal with four kinds of similar queries namely exact matching, exact containment, semantic matching and semantic containment. We perform experiments on the XMARK datasets and show that the proposed methods are both effective and efficient in improving the performance of XML queries.
Mediated Access to Symbolic Computation Systems
Authors: Jónathan Heras, Vico Pascual, Julio Rubio
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

Kenzo is a symbolic computation system devoted to Algebraic Topology. It has been developed by F. Sergeraert mainly as a research tool. The challenge is now to increase the number of users and to improve its usability. Instead of designing simply a friendly front-end, we have undertaken the task of devising a mediated access to the system, constraining its functionality, but providing guidance to the user in his navigation on the system. This objective is reached by constructing an intermediary layer, allowing us an intelligent access to some features of the system. This intermediary layer is supported by XML technology and interplays between a graphical user interface and the pure Common Lisp Kenzo system.
Component-Oriented Verification of Software Architectures through Built-in Tests
Authors: Colin Atkinson
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

Although the technologies used to implement and assemble components have improved significantly in recent years, techniques for verifying systems created from them have changed very little. In fact, the correctness and reliability of component-based systems are still usually checked using the traditional testing techniques employed before components and services became widespread. These techniques are not only expensive because they treat a system as a monolithic black box, they are not very helpful because they fail to use architectural knowledge to pin-point the source of failures. As a result, many of the potential benefits of component-based development are outweighed by the costs involved in verifying the resulting systems. In this talk, Colin Atkinson will present an approach that addresses this problem by making the system verification process component-oriented as well. Based on the notion of built-in tests - tests that are packaged with components and are executed at run-time - the approach reduces the level of manual effort needed to verify a system by partially automating the testing process. It involves a method to define how services/components should be written to support and exploit built-in tests, and a resource-aware infrastructure that arranges for tests to be executed when they have a minimal impact on the delivery of system services.
Geometric Structure Filtering Using Coupled Diffusion Process and CNN-Based Approach
Authors: Bartosz Jablonski
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Image processing algorithms are being intensively researched in the last decades. One of the most influential filtering tendencies is based on partial differential equations (PDE). Different kinds of modifications of classical linear process were already proposed. Most of them are based on non-linear or anisotropic process taking into consideration local descriptor of image structure. Main goal is to remove noise and simultaneously to decrease level of blurring important features (like edges). In this paper a new approach is presented, which introduces, into non-linear diffusion process, extra knowledge about geometric structures existing on an image. Algorithm scheme is proposed and results of numerical experiments are presented. Moreover, possibilities of algorithm application within cellular neural networks paradigm will be analysed.
Authoring Verified Documents by Interactive Proof Construction and Verification in Text-Editors
Authors: Dominik Dietrich, Ewaryst Schulz, Marc Wagner
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

Aiming at a document-centric approach to formalizing and verifying mathematics and software we integrated the proof assistance system ¿mega with the standard scientific text-editor MACS. The author writes her mathematical document entirely inside the text-editor in a controlled language with formulas in style. The notation specified in such a document is used for both parsing and rendering formulas in the document. To make this approach effectively usable as a real-time application we present an efficient hybrid parsing technique that is able to deal with the scalability problem resulting from modifying or extending notation dynamically. Furthermore, we present incremental methods to quickly verify constructed or modified proof steps by ¿mega. If the system detects incomplete or underspecified proof steps, it tries to automatically repair them. For collaborative authoring we propose to manage partially or fully verified documents together with its justifications and notational information centrally in a mathematics repository using an extension of OMDoc.
A New Parallel Algorithm of Adaptive QPSO to Solve Constrained Optimization Problems
Authors: Yang Liu, Yan Ma
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Parallel and adaptability are introduced in the algorithm of Quantum-behaved PSO in this paper, which is named PAQPSO and used to solve the CO problem. The PAQPSO outperforms QPSO and AQPSO in global search ability and local search ability, because the parallel and adaptive method is more approximate to the learning process of social organism with high-level swarm intelligence and can make the population evolve persistently. We adopt a non-stationary multi-stage assignment penalty in solving constrained problem to improve the convergence and gain more accurate results. This approach is tested on several accredited benchmark functions and the experiment results show much advantage of PAQPSO to AQPSO, QPSO and the traditional PSO (Particle Swarm Optimization). And the running time is also decreased in proximity linear.
Type i and type ii neuron models are selectively driven by differential stimulus features
Authors: Germán Mato, Inés Samengo
Venue: Neural Computation (2008)

Neurons in the nervous system exhibit an outstanding variety of morphological and physiological properties. However, close to threshold, this remarkable richness may be grouped succinctly into two basic types of excitability, often referred to as type I and type II. The dynamical traits of these two neuron types have been extensively characterized. It would be interesting, however, to understand the information-processing consequences of their dynamical properties. To that end, here we determine the differences between the stimulus features inducing firing in type I and type II neurons. We work with both realistic conductance-based models and minimal normal forms. We conclude that type I neurons fire in response to scale-free depolarizing stimuli. Type II neurons, instead, are most efficiently driven by input stimuli containing both depolarizing and hyperpolarizing phases, with significant power in the frequency band corresponding to the intrinsic frequencies of the cell.
Ensuring Collective Availability in Volatile Resource Pools Via Forecasting
Authors: Artur Andrzejak, Derrick Kondo, David P. Anderson
Venue: Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment (2008)

Increasingly services are being deployed over large-scale computational and storage infrastructures. To meet ever-increasing computational demands and to reduce both hardware and system administration costs, these infrastructures have begun to include Internet resources distributed over enterprise and residential broadband networks. As these infrastructures increase in scale to hundreds of thousands to millions of resources, issues of resource availability and service reliability inevitably emerge. Our goal in this study is to determine and evaluate predictive methods that ensure the availability of a collection of resources. We gather real-world availability data from over 48,000 Internet hosts participating in the SETI@home project. With this trace data, we show how to reliably and efficiently predict that a collection of N hosts will be available for T time. The results indicate that by using replication it is feasible to deploy enterprise services or applications even on such volatile resource pools.
The Chain Relation in Sofic Subshifts
Authors: Alexandr Kazda
Venue: Fundamenta Informaticae (2008)

The paper gives a characterisation of the chain relation of a sofic subshift. Every sofic subshift &Sigma; can be described by a labelled graph G. Factorising G in a suitable way we obtain the graph G/&asymp; that offers insight into some properties of the original subshift. Using G/&asymp; we describe first the chain relation in &Sigma;, then characterise chain-transitive sofic subshifts, chain-mixing sofic subshifts and finally the attractors of the subshift dynamic system. At the end we present (straightforward) algorithms deciding chain-transitivity and chain-mixing properties of a sofic subshift and listing all the attractors of the subshift system.
Fast computation of smallest enclosing circle with center on a query line segment
Authors: Arindam Karmakar, Sasanka Roy, Sandip Das
Venue: Information Processing Letters (2008)

Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given set of n points P={p"1,p"2,...,p"n} such that for any query line or line segment L, it efficiently locates a point c on L that minimizes the maximum distance among the points in P from c. Roy et al. [S. Roy, A. Karmakar, S. Das, S.C. Nandy, Constrained minimum enclosing circle with center on a query line segment, in: Proc. of the 31st Mathematical Foundation of Computer Science, 2006, pp. 765-776] have proposed an algorithm that solves the query problem in O(log^2n) time using O(nlogn) preprocessing time and O(n) space. Our algorithm improves the query time to O(logn); but the preprocessing time and space complexities are both O(n^2).
Ab-origin: An Improved Tool of Heavy Chain Rearrangement Analysis for Human Immunoglobulin
Authors: Xiaojing Wang, Wu Wei, Siyuan Zheng, Z. W. Cao, Yixue Li
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

An improved tool to explore the origin of human immunoglobulin heavy chains, named Ab-origin, has been developed. It can analyze in detail the V-D-J joints from the rearranged sequence by searching against germline databases. In addition to the known information about antibody recombination, appropriate score system and restriction of searching location are also incorporated to improve computing performance. When compared with a newly developed software SoDA, Ab-origin performed much better in both accuracy and stability, with 2, 7 and 1 percent higher for V, D and J respectively. Though only taking the human heavy chain for an example here, the algorithm also suits for the analysis of all immunoglobulin and TCR sequences.
Adaptive Mining the Approximate Skyline over Data Stream
Authors: Liang Su, Peng Zou, Yan Jia
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Skyline queries, which return the objects that are better than or equal in all dimensions and better in at least one dimension, are useful in many decision making and monitor applications. With the number of dimensions increasing and continuous large volume data arriving, mining the approximate skylines over data stream under control of losing quality is a more meaningful problem. In this paper, firstly, we propose a novel concept, called approximate skyline. Then, an algorithm is developed which prunes the skyline objects within the acceptable difference and adopts correlation coefficient to adjust adaptively approximate query quality. Furthermore, our experiments show that the proposed methods are both efficient and effective.
An Energy-Efficient Query Processing Algorithm for Wireless Sensor Networks
Authors: Jun-Zhao Sun
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

Sensor networks have recently attracted significant attention for many military and civil applications, such as environment monitoring, target tracking, and surveillance. A high-level abstraction of sensor networks forms the distributed database view, in which query is adopted to retrieve data from the network. Sensor nodes have limited energy resources and their functionality continues until their energy drains. Therefore, query for sensor networks should be wisely designed to extend the lifetime of sensors. This paper presents a query optimization method based on user-specified accuracy item for wireless sensor networks. When issuing a query, user may specify a value/time accuracy constraint according to which an optimized query plan can be created to minimize the energy consumption. At each single sensor node, instead of direct delivery of each reading, algorithms are proposed to reduce both data sensing and data transmission. The performance of the proposed algorithms shows that the proposed methods can achieve better performance than without performing the optimization.
Generating Programs Plus Proofs by Refinement
Authors: Douglas R. Smith
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

We advocate an automated refinement approach to developing programs and their proofs. The approach is partially embodied in the Specware system [6] which has found industrial and government applications. Our view is that the future of software engineering lies in the tight integration of synthesis and analysis processes.
An algorithm for ordinal sorting based on ELECTRE with categories defined by examples
Authors: Clara Rocha, Luis C. Dias
Venue: Journal of Global Optimization (2008)

This work proposes a Progressive Assisted Sorting Algorithm (PASA) based on a multicriteria evaluation ELECTRE-type method. The purpose of the PASA is to aid a decision maker to progressively sort a set of alternatives into a set of categories, which we considered are ordered (ordinal sorting), following a consistency principle. We consider the principle that if an alternative outranks (is as good as) a second one, then it must belong to the same category or to a better category. The set of alternatives already sorted by the decision maker will implicitly define the categories, and will constrain the range of categories where other alternatives may be sorted. We show how the same idea may be used in an aggregation/disaggregation approach, considering some parameters of ELECTRE are not fixed a priori, but are constrained only by the examples provided. In this context, we establish a "convex-shape property" stating that the range of possible categories for an alternative is always an interval of categories. A discussion contrasting this approach with ELECTRE TRI is included in the conclusions.
Reconstruction of Temporal Movement from Single-trial Non-invasive Brain Activity: A Hierarchical Bayesian Method
Authors: Akihiro Toda, Hiroshi Imamizu, Masa-Aki Sato, Yasuhiro Wada, Mitsuo Kawato
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

We tried to reconstruct temporal movement information (position, velocity and acceleration) from single-trial brain activity measured using non-invasive methods. While human subjects performed wrist movement in eight directions, brain activity was measured by functional magnetic resonance imaging (fMRI) and magnetoencephalogram (MEG). To reconstruct the movement information, we used cortical currents estimated by hierarchical Bayesian method for each subject. Correlation coefficients between reconstructed position and actual position ranged from 0.45 to 0.6. Although accuracy of our method is inferior to those in a previous study, our method is based on cortical current that is tightly coupled with anatomical regions, and thus would be a useful tool in neuroscience if the accuracy could be improved.