ppxscal/embedding_network huggingface dataset:
Logic and Control
Authors: Anil Nerode
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

I will give a brief account of how I came to introduce the term Hybrid System and to encourage it as a subject of study. I will also discuss what one should understand to pursue the subject fully, and also discuss the lines of development of my joint research with Wolf Kohn in this area. This is an area at the interface of mathematics, computer science, and control engineering, which has been pursued by many in all three areas since its inception. It can be thought of as the subject which deals with the interaction of discrete and continuous processes. This paper is intended to be legible to those without advanced analysis or differential geometry in their background. We concentrate on control, not on logics of hybrid systems, and aim at an audience unfamiliar with control. I make no apologies for not being technical. This is not a survey of the field. For a year 2000 survey see [1]. A survey made now would be very large.
Spatiotemporal Connectives for Security Policy in the Presence of Location Hierarchy
Authors: Subhendu Aich, Shamik Sural, Arun K. Majumdar
Venue: Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business (2008)

Security of a computer system frequently considers location and time of requesting an access as important factors for granting or denying the request. The security policy specified for such systems should include formalism for representing spatial and temporal facts. Existing security policy specifications already consider useful temporal facts like Monday, Weekends, College hours, etc. We have taken a new approach for representing real world spatial objects in security policy. The proposed representation uses six policy connectives at , inside , neighbor , is , crosses , overlapping for expressing useful relations existing between practical spatial entities like office, department, roads, etc. The expressiveness of the connectives has been discussed and a formalism for combined spatiotemporal interaction has also been proposed in this paper.
A Method of Constructing Personal Network for Ubiquitous Personal Services
Authors: Kazumasa Takami, Hajime Kusu, Akira Ikeda
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

In a ubiquitous environment, the connections of a variety of devices, including electronic tags such as RFID (Radio Frequency Identification) tags to the network, together with an advance in Web services, are expected to give rise to a wide range of services, stimulating research into smart space services, which incorporate a sensing environment. With a view to building a convenient personal environment in such an environment, in this paper we propose a method of building a personal network (PN), which is a wide-area personal space and consists of a visited personal area network (PAN), in which the user can use devices available in a temporarily visited network for information input/output, and a home network built at home or in the office. In particular, we study a Touch Select method, which allows the user to select an appropriate device in a visited PAN intuitively, and a monitoring protocol, which is designed to ensure connectivity of the PN. Evaluations through prototyping and simulation have verified the effectiveness of these proposals.
Efficient Reed-Solomon Iterative Decoder Using Galois Field Instruction Set
Authors: Daniel Iancu, Mayan Moudgill, John Glossner, Jarmo Takala
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

This paper presents a computationally efficient iterative Reed-Solomon (RS) decoder, which is suitable for software implementations on processors with instruction extensions for Galois field multiplication. Simulation models of proposed instructions were included into a processor simulator and performance of RS decoding was analyzed. The method has been validated for both Digital Video Broadcasting (DVB-T/H) and WiMAX and the method provides a total link budget improvement of up to 1 dB.
A General Forward Reasoning Algorithm for Various Logic Systems with Different Formalizations
Authors: Yuichi Goto, Takahiro Koh, Jingde Cheng
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

A forward reasoning engine with general-purpose should be able to deal with various logic systems with different formalizations and various formal theories based on the logic systems, and to perform deductive, inductive, and abductive reasoning based on the logic systems. This paper presents a general forward reasoning algorithm for various logic systems formalized as Hilbert style axiomatic systems, Gentzen natural deduction systems, or Gentzen sequent calculus systems, and its implementation in FreeEnCal, a forward reasoning engine with general-purpose, that we are developing.
Timed Automata with Integer Resets: Language Inclusion and Expressiveness
Authors: P. Vijay Suman, Paritosh K. Pandya, Shankara Narayanan Krishna, Lakshmi Manasa
Venue: Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems (2008)

In this paper, we consider a syntactic subset of timed automata called integer reset timed automata (IRTA) where resets are restricted to occur at integral time points. We argue with examples that the notion of global sparse time base used in time triggered architecture and distributed web services can naturally be modelled/specified as IRTA. As our main result, we show that the language inclusion problem $L(\mathcal A) \subseteq L(\mathcal{B})$ for a timed automaton $\mathcal A$ and an IRTA $\mathcal{B}$ is decidable with EXPSPACE complexity. The expressive power and the closure properties of IRTA are also summarized. In particular, the IRTA are (highly succinct but) expressively equivalent to 1-clock deterministic IRTA and they are closed under boolean operations.
The efficient calculation of powers of polynomials
Authors: Ellis Horowitz
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

Suppose we are given a polynomial in (X1,..., Xr) in r ≥ 1 variables, let m bound the degree of p in all variables Xi, 1≤i≤r, and we wish to raise P to the nth power, n>1. In a recent paper which compared the iterative versus the binary method it was shown that their respective computing times were O(m2rnr+1) versus O((mn) 2r) when using single precision arithmetic. In this paper a new algorithm is given whose computing time is shown to be O((mn) r+1). Also if we allow for polynomials with multiprecision integer coefficients, the new algorithm presented here will be faster by a factor of mr-1nr over the binary method and faster by a factor of mr-1 over the iterative method. Extensive empirical studies of all three methods show that this new algorithm will be superior for polynomials of even relatively small degree, thus guaranteeing a practical as well as a useful result.
A Hybrid Knowledge-Based Neural-Fuzzy Network Model with Application to Alloy Property Prediction
Authors: Min-You Chen, Quandi Wang, Yongming Yang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper presents a hybrid modeling method which incorporates knowledge-based components elicited from human expertise into underlying data-driven neural-fuzzy network models. Two different methods in which both measured data and a priori knowledge are incorporated into the model building process are discussed. Based on the combination of fuzzy logic and neural networks, a simple and effective knowledge-based neural-fuzzy network model has been developed and applied to the impact toughness prediction of alloy steels. Simulation results show that the model performance can be improved by incorporating expert knowledge into existing neural-fuzzy models.
On Granular Rough Computing with Missing Values
Authors: Lech Polkowski, Piotr Artiemjew
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Granular Computing as a paradigm in Approximate Reasoning is concerned with granulation of available knowledge into granules that consists of entities similar in information content with respect to a chosen measure and with computing on such granules. Thus, operators acting on entities in a considered universe should factor through granular structures giving values similar to values of same operators in non---granular environment. Within rough set theory, proposed 25 years ago by Zdzisław Pawlak and developed thence by many authors, granulation is also a vital area of research. The first author developed a calculus with granules as well as a granulation technique based on similarity measures called rough inclusions along with a hypothesis that granules induced in data set universe of objects should lead to new objects representing them, and such granular counterparts should preserve information content in data. In this work, this hypothesis is tested with missing values in data and results confirm the hypothesis in this context.
Improvement of on Demand Multicast Routing Protocol in Ad Hoc Networks to Achieve Good Scalability and Reliability
Authors: Mohammadreza Effatparvar, Mehdi Effatparvar, Mahmoud Fathy
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

An ad hoc network is a dynamically reconfigurable wireless network with no fixed wired infrastructure. The primary concerns in ad hoc networks are bandwidth limitation and unpredictable dynamic topology. Reliable Multicast plays a significant role in many applications of Mobile Ad Hoc Networks (MANETs). The On-Demand Multicast Routing Protocol (ODMRP) was designed for multicast routing in ad hoc networks. In this paper, we propose a cluster-based on demand multicast routing protocol to the lack of extension of flat multicast routing protocols in ad hoc networks of large scale. Simulation results show that using clustering base ODMRP improves network performance in terms of end-to-end delay and control packets. Also we propose a local recovery approach to design a reliable multicast algorithm. By this approach nodes can join to multicast groups in short time and data delivery will be increase, so ODMRP transmits the data with good reliability.
Tools for Supporting Hybrid Learning Strategies in Open Source Software Environments
Authors: Francesco Cerbo, Paola Forcheri, Gabriella Dodero, Giancarlo Succi
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

In this paper, we illustrate how a cooperative learning paradigm may benefit from cutting edge e-learning techniques. We use Web 2.0 resources (especially AJAX) to fulfill requirements for an interactive-constructivistic "learning space", extending an existing Free/Open Source Software Learning Management System, to create a cooperative and community-based learning space adherent to our proposal. The paper shows also how to use our toolset on two case studies.
Social network, social trust and shared goals in organizational knowledge sharing
Authors: Wing S. Chow, Lai Sheung Chan
Venue: Information and Management (2008)

The aim of our study was to further develop an understanding of social capital in organizational-knowledge-sharing. We first developed a measurement tool and then a theoretical framework in which three social capital factors (social network, social trust, and shared goals) were combined with the theory of reasoned action; their relationships were then examined using confirmatory factoring analysis. We then surveyed of 190 managers from Hong Kong firms, we confirm that a social network and shared goals significantly contributed to a person's volition to share knowledge, and directly contributed to the perceived social pressure of the organization. The social trust has however showed no direct effect on the attitude and subjective norm of sharing knowledge.
Alternate motion-compensated prediction for error resilient video coding
Authors: Mengyao Ma, Oscar C. Au, Liwei Guo, S.-H. Gary Chan, Xiaopeng Fan, Ling Hou
Venue: Journal of Visual Communication and Image Representation (2008)

Since the quality of compressed video is vulnerable to errors, video transmission over unreliable Internet is very challenging today. Two-Hypothesis Motion-Compensated Prediction (THMCP) has been shown to have Error Resilience (ER) capability for video transmission, where each macroblock is predicted from its previous two frames. In this paper, we propose a novel ER approach named Alternate Motion-Compensated Prediction (AMCP). In addition to two-hypothesis prediction, one-hypothesis prediction is alternately used. We use some schemes to determine which kind of prediction should be used, so that in some cases of loss, the propagated error can be first decreased to some extent before it spreads to the subsequent frames. As a result, the expected converged error is less than that obtained from THMCP with fixed weights (THMCPF). Both analysis and simulation results are given to show that AMCP performs better than THMCPF, in terms of both compression efficiency and ER capability.
Interpolative Boolean Logic
Authors: Dragan Radojević, Aleksandar Perović, Zoran Ognjanović, Miodrag Rašković
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

A polyvalent propositional logic $\mathcal L$ is in Boolean frame if the set of all $\mathcal L$-valid formulas coincides with the set of all tautologies. It is well known that the polyvalent logics based on the truth functionality principle are not in the Boolean frame. Interpolative Boolean logic (IBL) is a real-valued propositional logic that is in Boolean frame. The term "interpolative" cames from the fact that semantics of IBL is based on the notion of a generalized Boolean polynomial, where multiplication can be substituted by any continuous t-norm $*:[0,1]^2\longrightarrow [0,1]$ such that $xy\leqslant x* y$. Possible applications are illustrated with several examples.
Origins of Recursive Function Theory
Authors: Stephen C. Kleene
Venue: IEEE Annals of the History of Computing (1981)

For over two millenia mathematicians have used particular examples of algorithms for determining the values of functions. The notion of "?-definability" was the first of what are now accepted as equivalent exact mathematical descriptions of the class of the functions for which algorithms exist. This article explains the notion and traces the investigation in 1931-1933 by which the notion was quite unexpectedly so accepted. The Herbrand-Gödel notion of "general recursiveness" in 1934 and the Turing notion of "computability" in 1936 were the second and third equivalent notions. Techniques developed in the study of ?-definability were applied in the analysis of general recursiveness and Turing compatibility.
Shear buckling and dynamic bending in cloth simulation
Authors: Chuan Zhou Xiaogang Jin
Venue: Computer Animation and Virtual Worlds (2008)

This paper addresses the problem of simulating the mechanical behavior of cloth in computer animation, which is very important and challenging. The micro-structure of woven fabrics leads to significantly different shear reaction from other sheet materials, which has been neglected in previous approaches of cloth simulation. Therefore, it is beneficial for cloth simulation to model the shear buckling and structural bending separately. We analyze the shear buckling yielded by the micro-structure of woven and the dynamic bending based on the thin-shell theory, and develop a compact implementation of the new model on mass-spring systems. Experimental results show that the animations generated using this technique are with wrinkles and folds appearing and vanishing in a more natural way than other approaches. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Expertise, Motivation and Teaching in Learning Companion Systems
Authors: Jorge Adolfo Ramirez Uresti, Benedict du Boulay
Venue: International Journal of Artificial Intelligence in Education (2004)

This paper describes work carried out to explore the role of a learning companion as a teachable student of the human student. A LCS for Binary Boolean Algebra has been developed to explore the hypothesis that a learning companion with less expertise than the human student would be beneficial if the student taught it. The system implemented two companions with different expertise and two types of motivational conditions. An empirical evaluation was conducted. Although significant differential learning gains between the experimental conditions were not observed, differences in learner behaviour between these conditions were. In particular students in the motivated condition with a weak companion taught it many more times than in the other experimental conditions and in general worked harder. Finally, the experiment also suggested that learning companions might be confusing for students if they try to resemble human behaviour, i.e. if they do not perform exactly as they are told.
Increasing the visibility of sensor networks with passive distributed assertions
Authors: Kay Römer, Matthias Ringwald
Venue: Proceedings of the workshop on Real-world wireless sensor networks (2008)

When deployed in a real-world setting, many sensor networks fail to meet application requirements even though they have been tested in the lab prior to deployment. Hence, concepts and tools for inspection are needed to identify failure causes in situ on the deployment site. Tools for inspection should minimize the interference with the sensor network to, firstly, ensure that failures of the sensor network do not break the inspection mechanism, and, secondly, to ensure that the inspection mechanism does not change the behavior of the sensor network. In this position paper, we propose passive distributed assertions (PDA) as a novel tool for identifying failure causes. PDA allow a programmer to assert certain predicates over distributed node states. Packet sniffing is used to detect failed assertions, thus minimizing the interference with the sensor networks.
Automatic Verification of Simulatability in Security Protocols
Authors: Tadashi Araragi, Olivier Pereira
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

This paper investigates the problem of the automatic verification of the computational indistinguishability of systems in the simulation-based security setting, which allows proving the composable security of cryptographic protocols whose security relies on computational hardness assumptions. We use task-structured Probabilistic I/O Automata (task-PIOA) as our modeling framework. In this context, proofs of indistinguishability between real and ideal systems are typically divided into steps involving either proofs of perfect indistinguishability or proofs of computational indistinguishability. Our method automates the proof of perfect indistinguishability for a class of simple protocols, which is, by far, the most error-prone and time-consuming part of those security proofs. We proceed by transforming the targeted real and ideal probabilistic systems into nondeterministic ones, and check the bisimulation between the obtained systems by a partition refinement algorithm. We prove the correctness of our transformation. Our method has also been implemented in a symbolic way and we showed its usefulness by applying it to a practical protocol for oblivious transfer.
A Multiobjective Evolutionary Algorithm for the Linear Shelf Space Allocation Problem
Authors: Anna I. Esparcia-Alcázar, Ana I. Martínez-García, Jose M. Albarracín-Guillem, Marta E. Palmer-Gato, Juan J. Merelo, Ken C. Sharman, Eva Alfaro-Cid
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

This paper presents a multiobjetive approach to solve the Linear Shelf Space Allocation Problem (LiSSAP), which consists on allocating lengths of shelves in a given shop to specific products or groups of products. Previously we gave the first steps towards the development of a commercially viable tool that used evolutionary computation to address the problem; in this paper we introduce MELiSSA, standing for Multiobjective Evolutionary Linear Shelf-Space Allocation, and test it on two real problem configurations, yielding very good results.
Automatic Memory Access Analysis with Periscope
Authors: Michael Gerndt, Edmond Kereku
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Periscope is a distributed automatic online performance analysis system for large scale parallel systems. It consists of a set of analysis agents distributed on the parallel machine. This article presents the support in Periscope for analyzing inefficiencies in the memory access behavior of the applications. It applies data structure specific analysis and is able to identify performance bottlenecks due to remote memory access on the Altix 4700 ccNUMA supercomputer.
A New Model Based Multi-objective PSO Algorithm
Authors: Jingxuan Wei, Yuping Wang
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

In this paper, the multi-objective optimization problem is converted into the constrained optimization problem. For the converted problem, a novel PSO algorithm with dynamical changed inertia weight is proposed. Meanwhile, in order to overcome the drawback that most algorithms take pareto dominance as selection strategy but do not use any preference information. A new selection strategy based on the constraint dominance principle is proposed. The computer simulations for four difficulty benchmark functions show that the new algorithm is able to find uniformly distributed pareto optimal solutions and is able to converge to the pareto-optimal front.
SyTroN: Virtual Desk for Collaborative, Tele-operated and Tele-learning System with Real Devices
Authors: Ryad Chellali, Nicolas Mollet, Cedric Dumas, Geoffery Subileau
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

Tele-training is a main issue nowadays and it is strongly motivated by the increased mobility of people. This mobility shouldn't be a limit for a good training: pertinence and efficiency have to be the core of distant training environments. In this paper, we introduce SyTroN, a tele-learning system using virtual reality and tele-operation techniques. The first aim is to propose intuitive virtual classrooms/desks supervised by a real teacher for collaborative or individual distant learning, using Internet. The second goal is to go from virtual to real: SyTroN supports the connection to real devices, potentially rare and expensive, allowing distant experimentation's abstracted by virtual tools. After 5 years of development, our work has been validated with psychologic tests, which highlight the efficiency of our global system on one year of use within an engineering school.
Replacing SEP-Triplets in SNOMED CT Using Tractable Description Logic Operators
Authors: Boontawee Suntisrivaraporn, Franz Baader, Stefan Schulz, Kent Spackman
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Reification of parthood relations according to the SEP-triplet encoding pattern has been employed in the clinical terminology SNOMED CT to simulate transitivity of the part-Of relation via transitivity of the is-a relation and to inherit properties along part-Of links. In this paper we argue that using a more expressive representation language, which allows for a direct representation of the relevant properties of the part-Of relation, makes modelling less error prone while having no adverse effect on the efficiency of reasoning.