ppxscal/embedding_network huggingface dataset:
Using Generalized Learning Automata for State Space Aggregation in MAS
Authors: Yann-Michaël Hauwere, Peter Vrancx, Ann Nowé
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

A key problem in multi-agent reinforcement learning remains dealing with the large state spaces typically associated with realistic distributed agent systems. As the state space grows, agent policies become more and more complex and learning slows. One possible solution for an agent to continue learning in these large-scale systems is to learn a policy which generalizes over states, rather than trying to map each individual state to an action.In this paper we present a multi-agent learning approach capable of aggregating states, using simple reinforcement learners called learning automata (LA). Independent Learning automata have already been shown to perform well in multi-agent environments. Previously we proposed LA based multi-agent algorithms capable of finding a Nash Equilibrium between agent policies. In these algorithms, however, one LA per agent is associated with each system state, as such the approach is limited to discrete state spaces. Furthermore, when the number of states increases, the number of automata also increases and the learning speed of the system slows down. To deal with this problem, we propose to use Generalized Learning Automata (GLA), which are capable of identifying regions within the state space with the same optimal action, and as such aggregating states. We analyze the behaviour of GLA in a multi-agent setting and demonstrate results on a set of sample problems.
Note: None of the coronoid systems can be isometrically embedded into a hypercube
Authors: Heping Zhang, Shoujun Xu
Venue: Discrete Applied Mathematics (2008)

A graph that can be isometrically embedded into a hypercube is called a partial cube (or binary Hamming graph). Klavzar, Gutman and Mohar [S. Klavzar, I. Gutman, B. Mohar, Labeling of benzenoid systems which reflects the vertex-distance relations, J. Chem. Inf. Comput. Sci. 35 (1995) 590-593] showed that all benzenoid systems are partial cubes. In this article we show that none of the coronoid systems (benzenoid systems with ''holes'') is a partial cube.
Motion adaptation based on character shape
Authors: Etienne Lyard
Venue: Computer Animation and Virtual Worlds (2008)

With the increasing performances of the graphics hardware, virtual reality applications are reaching a new level of realism. It is now possible to animate entire crowds of virtual avatars, or to display in real-time highly realistic deformable characters. This new type of applications requires that characters are deformed, either to generate a large number of individuals for creating a crowd, or to match a particular shape. To make the animation fit to the animated character and to prevent self-collisions, adapting the motion is mandatory. Unlike previous approaches which relied on skeletal models, this paper presents a method considering the actual shape of the character's body to perform the adaptation. Our approach uses spacetime optimization to remove the self-penetration, and finally re-establishes the balance of the motion. We also introduce an interpolation scheme based on radial basis functions that can blend pre-calculated adaptations, and thus achieve real-time performances. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Finding the (n, k, 0)-Extendability in Bipartite Graphs and Its Application
Authors: Yueping Li, Dingjun Lou
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

We study the problem of finding the (n,k,0)-extendability in bipartite graphs. Let G be a graph with vertex set V(G). Let n,k,d be non-negative integers such that n + 2k + d ≤ |V(G)| ¿ 2 and |V(G)| ¿ n ¿ d is even. A matching which saturates exactly |V(G)| ¿ d vertices of G is called a defect-d matching of G. If when deleting any n vertices in V(G) the remaining subgraph contains a matching of k edges and every k-matching can be extended to a defect-d matching, then G is said to be (n,k,d)-extendable. We present an algorithm to find the (n,k,0)-extendability for bipartite graphs. This problem finds application in the circuit design of allocating jobs to processors while some jobs require specified machines to process and some machines are not available. In addition, the connectivity of (n,k,0)-extendable graphs is also discussed.
A boundary method for outlier detection based on support vector domain description
Authors: S. M. Guo, L. C. Chen, J. S. H. Tsai
Venue: Pattern Recognition (2009)

The support vector domain description (SVDD) is a popular kernel method for outlier detection, which tries to fit a class of data with a sphere and uses a few target objects to support its decision boundary. The problem is that even with a flexible Gaussian kernel function, the SVDD could sometimes generate such a loose decision boundary that the discrimination ability becomes poor. Therefore, a computationally intensive procedure called kernel whitening is often required to improve the performance. In this paper, we propose a simple post-processing method which tries to modify the SVDD boundary in order to achieve a tight data description with no need of kernel whitening. With the derivation of the distance between an object and its nearest boundary point in input space, the proposed method can efficiently construct a new decision boundary based on the SVDD boundary. The improvement from the proposed method is demonstrated with synthetic and real-world datasets. The results show that the proposed decision boundary can fit the shape of synthetic data distribution closely and achieves better or comparable classification performance on real-world datasets.
Speech Processing for Audio Indexing
Authors: Lori Lamel, Jean-Luc Gauvain
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

This paper addresses some of the recent trends in speech processing, with a focus on speech-to-text transcription as a means to facilitate access to multimedia information in a multilingual context. A brief overview of automatic speech recognition is given along with indicative performance measures for a range of tasks. Enriched transcriptions, that is enhancing the automatic word transcripts with meta-data derived from the audio data is discussed, followed by some hightlights of recent progress and remaining challenges in speech recognition.
Guest-Transparent Prevention of Kernel Rootkits with VMM-Based Memory Shadowing
Authors: Ryan Riley, Xuxian Jiang, Dongyan Xu
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

Kernel rootkits pose a significant threat to computer systems as they run at the highest privilege level and have unrestricted access to the resources of their victims. Many current efforts in kernel rootkit defense focus on the detection of kernel rootkits --- after a rootkit attack has taken place, while the smaller number of efforts in kernel rootkit prevention exhibit limitations in their capability or deployability. In this paper we present a kernel rootkit prevention system called NICKLE which addresses a common, fundamental characteristic of most kernel rootkits: the need for executing their own kernel code. NICKLE is a lightweight, virtual machine monitor (VMM) based system that transparently prevents unauthorized kernel code execution for unmodified commodity (guest) OSes. NICKLE is based on a new scheme called memory shadowing, wherein the trusted VMM maintains a shadow physical memory for a running VM and performs real-time kernel code authentication so that only authenticated kernel code will be stored in the shadow memory. Further, NICKLE transparently routes guest kernel instruction fetches to the shadow memory at runtime. By doing so, NICKLE guarantees that only the authenticated kernel code will be executed, foiling the kernel rootkit's attempt to strike in the first place. We have implemented NICKLE in three VMM platforms: QEMU+KQEMU, VirtualBox, and VMware Workstation. Our experiments with 23 real-world kernel rootkits targeting the Linux or Windows OSes demonstrate NICKLE's effectiveness. Furthermore, our performance evaluation shows that NICKLE introduces small overhead to the VMM platform.
A Fuzzy Set-Based Approach to Temporal Databases
Authors: J. Campaña, M. C. Garrido, N. Marín, O. Pons
Venue: Proceedings of the 1st international conference on Scalable Uncertainty Management (2007)

The primary aim of temporal databases is to offer a common framework to those DB applications that need to store or handle different types of temporal data from a variety of sources since they allow the concept of time to be unified from the point of view of meaning, representation and manipulation. Although at first sight the incorporation of time into a DB might appear to be a direct and even simple task, it is, however, quite complex because not only must new structures and specific operators be included but the semantics of classical manipulation sentences (insert, update or delete) must be changed when temporal data are present. In addition, temporal information is not always as precise as desired since it is affected by imprecision due to the use of natural language or to the nature of the source. In this paper, we deal with the problem of the update and query operations when time is expressed by means of a fuzzy interval of dates. Throughout the text, we will see how the delete and insert operations are particular cases of the update process and will therefore be implicitly presented in the paper.
Probabilistic Models for Action-Based Chinese Dependency Parsing
Authors: Xiangyu Duan, Jun Zhao, Bo Xu
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a little lower than the best results reported by more complex parsing models. In this paper, we compare action-based dependency parsers with complex parsing methods such as all-pairs parsers on Penn Chinese Treebank. For Chinese dependency parsing, action-based parsers outperform all-pairs parsers. But action-based parsers do not compute the probability of the whole dependency tree. They only determine parsing actions stepwisely by a trained classifier. To globally model parsing actions of all steps that are taken on the input sentence, we propose two kinds of probabilistic parsing action models that can compute the probability of the whole dependency tree. Results show that our probabilistic parsing action models perform better than the original action-based parsers, and our best result improves much over them.
Combining Intra- and Inter-cellular Dynamics to Investigate Intestinal Homeostasis
Authors: Oksana Tymchyshyn, Marta Kwiatkowska
Venue: Proceedings of the 1st international workshop on Formal Methods in Systems Biology (2008)

This paper reports on the multi-scale modelling of an intestinal crypt cellular structure coupled with Wnt signalling. Using formal modelling techniques based on the stochastic ¿-calculus, which supports ambients needed for compartments, we develop a collection of cell and molecular level models. The focus of our study is the role of Wnt in the control of cell division and differentiation. Using the BioSPI simulation platform, we analysed the model and reveal a plausible explanation for a mechanism that ensures robustness of cell fate determination.
Functorial Properties of Formal Concept Analysis
Authors: Hideo Mori
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

The concept of Chu correspondences between formal contexts is introduced. The construction of formal concepts induces a functor $\mathfrak{B}$ from the category of Chu correspondences ChuCors to the category $\mathcal{S}lat$ of sup-preserving maps between complete lattices. It turns out that the category ChuCors has a *-autonomous category structure and the functor $\mathfrak{B}$ is shown to preserve the *-autonomous category structure. Details are given in [4].
An Opinion Model for Evaluating Malicious Activities in Pervasive Computing Systems
Authors: Indrajit Ray, Nayot Poolsappasit, Rinku Dewri
Venue: Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security (2008)

Pervasive computing applications typically involve cooperation among a number of entities spanning multiple organizations. Any security breach in any single entity can have very far-reaching consequences. In addition, a number of factors make the task of defending against malicious attacks in pervasive systems even more complex than conventional systems. Foremost among them is that a significant number of the devices deployed in such environments are frequently severely resource constrained. Thus strong security controls cannot be easily deployed on these devices. A second factor is that since a large number of such devices are also involved, attacks can propagate very fast in pervasive environments. These prompt us to propose a model for predicting malicious activities in pervasive systems. Our model is based on a logic of opinion that has been proposed elsewhere. Ours is not an intrusion detection system for pervasive systems but works in tandem with one. The system we propose can be used as a standard interface to analyze pervasive system activities in general and generate an opinion about the possibility of an attack.
Self direction & constructivism in programming education
Authors: Naomi R. Boyer, Sara Langevin, Alessio Gaspar
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

This paper explores the relationship between new constructivist apprenticeship techniques meant to improve programming pedagogy [6][7] and student self-direction. To this end, we used the lens of the Personal Responsibility Orientation [2] to measure the impact on student self-efficacy and self direction of our interventions. These learning activities were introduced based on peer learning and authentic student feedback principles. They consisted of peer learning weekly forums and student-led ""live coding"" hands-on exercises. These were applied to both an introductory (cop2510 [14]) and intermediate (cop3515 [5]) programming courses. Results derived from an online anonymous survey are presented and interpreted.
Quantum-Inspired Genetic Algorithm Based Time-Frequency Atom Decomposition
Authors: Gexiang Zhang, Haina Rong
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

The main problem of time-frequency atom decomposition (TFAD) lies in an extremely high computational load. This paper pres- ents a fast implementation method based on quantum-inspired genetic algorithm (QGA). Instead of finding the optimal atom in greedy implementation algorithm, this method is to search a satisfactory atom in every iteration of TFAD. Making full use of QGA's advantages such as good global search capability, rapid convergence and short computing time, the method reduces greatly the computational load of TFAD. Experiments conducted on radar emitter signals verify the effectiveness and practicality of the introduced method.
The Complexity of the Counting Constraint Satisfaction Problem
Authors: Andrei A. Bulatov
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

The Counting Constraint Satisfaction Problem (${\rm \#CSP}(\mathcal{H})$) over a finite relational structure $\mathcal{H}$ can be expressed as follows: given a relational structure $\mathcal{G}$ over the same vocabulary, determine the number of homomorphisms from $\mathcal{G}$ to $\mathcal{H}$. In this paper we characterize relational structures $\mathcal{H}$ for which ${\rm \#CSP}(\mathcal{H})$ can be solved in polynomial time and prove that for all other structures the problem is #P-complete.
Full Controllable Face Detection System Architecture for Robotic Vision
Authors: Marco Anisetti, Valerio Bellandi, Ernesto Damiani, Gwanggil Jeon, Jechang Jeong
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Face detection nowadays is one of the most promising applications of image analysis and processing. One emerging application field is Human-Robot Interaction. For many applications in this field (including face identification and expression recognition) the precision of facial feature detection and the computational burden are both critical issues. This paper presents a completely tunable hybrid method for accurate face localization based on a quick-and-dirty preliminary detection followed by a 3D refinement. Our technique guarantees complete control over the cost/quality ratio and permits to achieve the precision required for interactive applications. We use our approach to design a Robotic Vision Architecture capable of selecting from a set of strategies to obtain the best results.
Mutiscale Analysis of the Fisher Equation
Authors: Carlo Cattani, Aleksey Kudreyko
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The wavelet-Galerkin approach towards the solution of one-dimensional Fisher's equation using complex harmonic wavelets is presented in this paper. The linear and nonlinear connection coefficients were explicitly derived. The wavelet-solution is compared with analogous analytical result.
Pioneer Day, 1982
Authors: J. A. N. Lee
Venue: IEEE Annals of the History of Computing (1984)

Pioneer Day at the National Computer Conference (NCC) has been organized by the History of Computing Committee (HOCC) of the American Federation of Information Processing Societies (AFIPS) since 1974, and has been a formal part of the NCC operations since 1979. It differs from a "normal" program in that although the topic is well defined in the same manner as other NCC programs, solicitation of presentations does not necessarily imply the production of formal papers-nor an open invitation for any author to submit proposed topics for inclusion in the sessions. An essential part of the work of the person who chairs Pioneer Day is the research that forms a backdrop against which the NCC sessions are placed. In some sense, Pioneer Day is the result of an extensive research program sponsored by HOCC and NCC instead of being a vehicle for the presentation of independently supported activities. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Basic Study on Real-Time Simulation Using Mass Spring System for Robotic Surgery
Authors: Kazuya Kawamura, Yo Kobayashi, Masakatsu G. Fujie
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

Medical technology has advanced with the introduction of robot technology, making previous medical treatments that were very difficult far more possible. However, operation of a surgical robot demands substantial training and continual practice on the part of the surgeon because it requires difficult techniques that are different from those of traditional surgical procedures. So we focused on a simulation technology based on the physical characteristics of organs as an intra-operative assistance for a surgeon. In this research, we proposed the development of surgical simulation, using a physical model, for intra-operative navigation. In this paper, we describe the design of our proposed system, in particular our organ deformation calculator. We performed two experiments with pig liver and silicone model to evaluate the accuracy of the calculator. We obtained adequate experimental results of a target node at a nearby point of interaction, because this point ensures better accuracy for our simulation model.
Making Conference CDs Accessible: A Practical Example
Authors: Marion Hersh, Barbara Leporini
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The PDF document format is increasingly being used, including for conference CDs. This paper discusses the process of producing an accessible CD based on PDF documents for a small assistive technology conference, CVHI 07. It also analyses the accessibility features of the resulting PDF documents and the results of a survey of the conference authors on their experiences of (trying to) produce accessible PDF documents. The paper is introduced by brief discussions of PDF accessibility and of the results of surveys of the experiences of blind and visually impaired people of using PDF documents and the accessibility of PDF documents produced by UK universities. It concludes with a number of recommendations for conference organisers producing accessible CDs, as well as suggestions for future work.
Digital Preservation of Scientific Data
Authors: José Barateiro, Gonçalo Antunes, Manuel Cabral, José Borbinha, Rodrigo Rodrigues
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

Digital preservation aims at maintaining digital objects and data accessible over long periods of time. We propose the use of dedicated or surplus storage resources of data grids to build frameworks of digital preservation. In this paper we focus on the problem of digital preservation in two scenarios: a national digital library and a repository of scientific information for dam safety. We detail the scenario of dam safety data and provide an analysis of an existing data grid solution that can be used for this purpose.
Improving query performance on XML documents: a workload-driven design approach
Authors: Rebeca Schroeder, Ronaldo dos Santos Mello
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

As XML has emerged as a data representation format and as great quantities of data have been stored in the XML format, XML document design has become an important and evident issue in several application contexts. Methodologies based on conceptual modeling are being tightly applied for designing XML documents. However, the conversion of a conceptual schema to an XML schema is a complex process. In many cases, conceptual relationships cannot be represented in a hierarchy so that they have to be represented by reference relationships in the XML schema. The problem is that reference relationships generate a disconnected XML structure and, consequently, produce an overhead cost for query processing on XML documents. This paper presents a design approach for generating XML schemas from conceptual schemas considering the expected workload of the XML applications. Query workload is used to produce XML schemas which minimize the impact of the reference relationships on query performance. We evaluate our approach through a case study where a set of XML documents are redesigned by our methodology. The results demonstrate that query performance is improved in terms of the number of accesses generated by the queries on the XML documents designed by our approach.