ppxscal/embedding_network huggingface dataset:
Versioned transactional shared memory for the F&eacute;nixEDU web application
Authors: Nuno Carvalho, João Cachopo, Luís Rodrigues, António Rito Silva
Venue: Proceedings of the 2nd workshop on Dependable distributed data management (2008)

The F&eacute;nixEDU system uses a novel infrastructure for web applications based on the Versioned Software Transactional Memory (VSTM) abstraction. The F&eacute;nixEDU system has been deployed and is currently in operation in different facilities, including the Instituto Superior T&eacute;cnico where it serves the entire academic community, processing between 1,000,000 and 4,500,000 transactions per day. This paper describes the ongoing work on the infrastructure support, in order to increase its scalability and fault-tolerance. For that purpose we are developing a distributed version of the VSTM, such that multiple application servers can concurrently serve different request and still coordinate in an efficient manner to provide strong consistency guarantees to the applications.
A VLSI Support for GKS
Authors: Max Mehl, Stefan Noll
Venue: IEEE Computer Graphics and Applications (1984)

This microprogrammed VLSI design places the GKS output functions on a single chip, leading the way to substantial enhancements in system performance.
On the Exact Separation of Mixed Integer Knapsack Cuts
Authors: Ricardo Fukasawa, Marcos Goycoolea
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has had as much practical success as the MIR inequality when used in cutting plane algorithms for general mixed integer programming problems. In this work we analyze this empirical observation by developing an algorithm which takes as input a point and a single-row mixed integer polyhedron, and either proves the point is in the convex hull of said polyhedron, or finds a separating hyperplane. The main feature of this algorithm is a specialized subroutine for solving the Mixed Integer Knapsack Problem which exploits cost and lexicographic dominance. Separating over the entire closure of single-row systems allows us to establish natural benchmarks by which to evaluate specific classes of knapsack cuts. Using these benchmarks on Miplib 3.0 instances we analyze the performance of MIR inequalities. Computations are performed in exact arithmetic.
Design of high throughput recursive and non-recursive digital filters in one and two dimensions with canonic signed digit coefficients and sub-expression elimination using genetic algorithm
Authors: Tom Williams
Venue:  (2006)

In this dissertation methods of obtaining high throughput rate digital filters are examined. The use of Canonic Signed Digit (CSD) filter coefficients is established and a new chromosome coding technique is developed to enable efficient design of non-recursive filters using a Genetic Algorithm. The new genetic algorithm approach using the proposed new coding scheme is extended to efficiently handle recursive filters using a new unstable penalty factor to handle the instability constraints imposed by such filters. A technique is presented that allows these new methods to be applied to the design of high throughput 2-D filters. The throughput rate of CSD coefficients digital filters is further increased by the use of common sub-expression elimination. A new graphical transformation is presented that allows for optimization of the elimination of CSD-coefficient common sub-expressions in both the vertical and horizontal dimensions. The effectiveness of the proposed methods is demonstrated with example designs and comparisons to other methods. 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
Modulating Real Object Stiffness for Haptic Augmented Reality
Authors: Seokhee Jeon, Seungmoon Choi
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

In haptic augmented reality, a user can enjoy the sensations of real objects augmented with synthetic haptic stimuli created by a haptic interface. For example, a haptic augmented reality system may allow the user to feel a soft sponge as a stiffer rubber. In this paper, we present a framework in which the stiffness of a real object can be modulated with additional virtual haptic feedback. For this, a commercial haptic interface is extended with a force sensor. Efficient and effective algorithms for contact detection and stiffness modulation are proposed for the closed-loop framework. Performance evaluation with real samples showed that the stiffness modulation is quite capable except for very rigid objects (e.g., a wood plate) where unstable oscillations dominate the response. This work serves as an initial building block towards a general haptic augmented reality system.
Managing Risk Propagation in Extended Enterprise Networks
Authors: C. Derrick Huang, Ravi S. Behara, Qing Hu
Venue: IT Professional (2008)

The weakest link in an information supply chain can lead to increased vulnerability for all partners in the network. Examining and controlling risk propagation from the network and supply-chain perspectives has become vital to overall network security.
Learning Grouping and Anti-predator Behaviors for Multi-agent Systems
Authors: Koichiro Morihiro, Haruhiko Nishimura, Teijiro Isokawa, Nobuyuki Matsui
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Several models have been proposed for describing grouping behavior such as bird flocking, terrestrial animal herding, and fish schooling. In these models, a fixed rule has been imposed on each individual a priori for its interactions in a reductive and rigid manner. We have proposed a new framework for self-organized grouping of agents by reinforcement learning. It is important to introduce a learning scheme for developing collective behavior in artificial autonomous distributed systems. This scheme can be expanded to cases in which predators are present. In this study we integrate grouping and anti-predator behaviors into our proposed scheme. The behavior of agents is demonstrated and evaluated in detail through computer simulations, and their grouping and anti-predator behaviors developed as a result of learning are shown to be diverse and robust by changing some parameters of the scheme.
A Multi-agent Environment for Serving Proof Explanations in the Semantic Web
Authors: Grigoris Antoniou, Antonis Bikakis, Polyvios Damianakis, Mixalhs Foukarakis, Giorgos Iacovidis, Marianna Karmazi, Haridimos Kondylakis, Antreas Makridakis, Giorgos Nikiforos, Grigoris Papadourakis, Manolis Papoutsakis, Aggeliki Psyharaki, Giorgos Stratakis, Panagiotis Tourlakis, Petros Tsialiamanis, Giorgos Vasileiadis, Gerd Wagner, Dimitris Velegrakis
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

In this work we present the design and implementation of a multi-agent environment for serving proof explanations in the Semantic Web. The system allows users or agents to issue queries, on a given RDF rules knowledge base and automatically produces proof explanations for answers produced by a popular programming system (JENA), by interpreting the output from the proof's trace and converting it into a meaningful representation. It also supports an XML representation (a R2ML language extension) for agent communication, which is a common scenario in the Semantic Web. The system in essence implements a proof layer for rules on the Semantic Web empowering trust between agents and users.
Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks
Authors: K. Akkaya, S. Janapala
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Wireless sensor and actor networks (WSANs) have recently emerged with the idea of combining wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs). In addition to resource constrained sensors, resource rich and mobile actor nodes are employed in WSANs. These actors can collect data from the sensors and perform appropriate actions as a result of processing such data. To perform the actions at all parts of the region in a timely manner, the actors should be deployed in such a way that they might be able to communicate with each other and cover the whole monitored area. This requires that the actors should be placed carefully prior to network operation in order to maximize the coverage and maintain the inter-actor connectivity. In this paper, we propose a distributed actor deployment algorithm that strives to maximize the coverage of actors without violating the connectivity requirement. The approach applies repelling forces between neighboring actors and from the sensors that sit on the boundaries in order to spread them in the region. The spreading of the nodes is done using a tree of actors which can provide more freedom for the movement of the nodes but at the same time maintain the required connectivity among the nodes. We present two techniques for creation of such an actor tree which are based on local pruning of the actor links and spanning tree of the inter-actor network. The performance of our approach is validated both analytically and experimentally.
Internet governance and development: Another digital divide?
Authors: David Souter
Venue: Information Polity (2007)

This paper gives an insight to WSIS and discusses some reasons why in the WSIS process a very strong focus was given to Internet governance issues. It comments on the underlying paradigm gap between ICT/Internet and development professionals which the WSIS failed to resolve; it reports recent evidence on the relationship between Internet and other information and communication media in low-income communities; and it suggests some consequences for the future course of international discourse on the relationship between ICTs/Internet and development.
Condensed matrix method for implicit type scheme in imaginary distance beam propagation method
Authors: Dharmadas Kumbhakar
Venue: Journal of Computational Methods in Sciences and Engineering (2008)

The modes of a waveguide structure can be accurately determined using finite difference imaginary distance beam propagation method. In implicit type formulation of the problem, a matrix equation has to be solved. The matrix is sparse and large. The sparsity of the matrix can be used to form a condensed matrix of much lower dimension leaving aside the zero element blocks; this condensed matrix takes much smaller storage space and consequently saves a great deal of run-time. The algorithm for the solution of the matrix equation from such a condensed matrix is developed here. This method is comparable with other sparse matrix methods in terms of CPU usage.
Building a case for FIPA compliant multiagent approaches for wireless sensor networks
Authors: Khalid Nawaz, Alejandro P. Buchmann
Venue: Proceedings of the 2008 Ambi-Sys workshop on Software Organisation and MonIToring of Ambient Systems (2008)

There have been some efforts to apply agent based approaches in Wireless Sensor Networks (WSNs) for different application scenarios in recent past. These efforts have met with varying levels of success so far. However, the efforts to assess the suitability of Foundation for Intelligent Physical Agents (FIPA) compliant multiagent solutions for WSNs are almost non-existent. In this paper we present a scenario from an industrial domain and asses the suitability of a FIPA compliant multiagent based solution for it. The scenario is based on a WSN deployment in an underground mine where it could be put to use for several purposes like hazardous gas plume detection and tracking, mine lighting control, Proximate Environment Monitoring (PEM), structural health monitoring of mine structure, to name a few. However, we only consider the PEM usage scenario in this paper.
Feed-Forward Learning: Fast Reinforcement Learning of Controllers
Authors: Marek Musial, Frank Lemke
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

Reinforcement Learning (RL) approaches are, very often, rendered useless by the statistics of the required sampling process. This paper shows how very fast RL is essentially made possible by abandoning the state feedback during training episodes. The resulting new method, feed-forward learning (FF learning), employs a return estimator for pairs of a state and a feed-forward policy's parameter vector. FF learning is particularly suitable for the learning of controllers, e.g. for robotics applications, and yields learning rates unprecedented in the RL context.This paper introduces the method formally and proves a lower bound on its performance. Practical results are provided from applying FF learning to several scenarios based on the collision avoidance behavior of a mobile robot.
A Hilbert Space Embedding for Distributions
Authors: Alex Smola, Arthur Gretton, Le Song, Bernhard Schölkopf
Venue: Proceedings of the 18th international conference on Algorithmic Learning Theory (2007)

We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reproducing kernel Hilbert space. Applications of this technique can be found in two-sample tests, which are used for determining whether two sets of observations arise from the same distribution, covariate shift correction, local learning, measures of independence, and density estimation.
On Multimodality of the SSTRESS Criterion for Metric Multidimensional Scaling
Authors: Antanas Žilinskas, Aurelija Podlipskytė
Venue: Informatica (2003)

Recent publications on multidimensional scaling express contradicting opinion on multimodality of STRESS criterion. An example has been published with rigorously provable multimodality of STRESS. We present an example of data and the rigorous proof of multimodality of SSTRESS for this data. Some comments are included on widely accepted opinion that minimization of SSTRESS is easier than minimization of STRESS.
Global Stability of Neural Networks with Time-Varying Delays
Authors: Yijing Wang, Zhiqiang Zuo
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

This paper deals with the problem of global stability for a class of neural networks with time-varying delays. A new sufficient condition for global stability is proposed by using some slack matrix variables to express the relationship between the system matrices. The restriction on the derivative of the delay function to be less than unit is removed. A numerical example shows that the result obtained in this paper improves the upper bound of the delay over some existing ones.
Conserved Self Pattern Recognition Algorithm
Authors: Senhua Yu, Dipankar Dasgupta
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

Self-nonself model makes a lot of sense in the mechanisms of self versus nonself recognition in the immune system but it failed to explain a great number of findings. Some new immune theory is proposed to accommodate incompatible new findings, including Pattern Recognition Receptors (PRRs) Model and Danger Theory. Inspired from the PRRs model, a novel approach called Conserved Self Pattern Recognition Algorithm (CSPRA) is proposed in this paper. The algorithm is tested using the famous benchmark Fisher's Iris data. Preliminary results demonstrate that the new approach lowers the false positive and thus enhances the efficiency and reliability for anomaly detection without increase in complexity comparing to the classical Negative Selection Algorithm (NSA).
M-Learning Accessibility Design: A Case Study
Authors: Marco Arrigo, Gaspare Novara, Giovanni Ciprì
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

In the last few years the number of colleges and universities which provide courses and degree programs via distance education has been growing dramatically. People with special needs will benefit from these online opportunities as long as the information and activities posted to internet sites are appropriately accessible with adaptive technology. This paper presents some research regarding the accessibility design for a mobile learning experience carried out at the Italian National Research Council --- Institute for Educational Technologies. In particular, we introduce some considerations about the methodology and the design steps used to build some educational tools on mobile devices which are fully accessible for students with special needs using a compact screen reader (on a Smartphone). Briefly, we outline the common problems of accessing an online learning management system through a Smartphone (services and information), then we introduce the test phase of the designed tools for visually impaired users.
Executing in Common Lisp, Proving in ACL2
Authors: Mirian Andrés, Laureano Lambán, Julio Rubio
Venue: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference (2007)

In this paper, an approach to integrate an already-written Common Lisp program for algebraic manipulation with ACL2 proofs of properties of that program is presented. We report on a particular property called "cancellation theorem", which has been proved in ACL2, and could be applied to several problems in the field of Computational Algebraic Topology.
Efficiently Solving Problems Where the Solutions Form a Group
Authors: Karen E. Petrie, Christopher Jefferson
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

Group theory is the mathematical study of symmetry. This paper presents a CP method of efficiently solving group-theoretic problems, where each of the solutions is an element of a group. This method allows us to answer questions in group theory which are computationally unfeasible with traditional CP techniques.
Automated analysis of two- and three-color fluorescent Elispot (Fluorospot) assays for cytokine secretion
Authors: Jonathan A. Rebhahn, Courtney Bishop, Anagha A. Divekar, Katty Jiminez-Garcia, James J. Kobie, F. Eun-Hyung Lee, Genny M. Maupin, Jennifer E. Snyder-Cappione, Dietmar M. Zaiss, Tim R. Mosmann
Venue: Computer Methods and Programs in Biomedicine (2008)

The Elispot effectively measures the frequencies of cells secreting particular molecules, especially low-frequency cells such as antigen-specific T cells. The Fluorospot assay adapted this analysis to two products per cell, and this has now been extended to three-color measurement of both mouse and human cytokine-secreting cells. Due to the increased data complexity, and particularly the need to define single-, double- and triple-producing cells, it is critical to objectively quantify spot number, size, intensity, and coincidence with other spots. An automated counting program, Exploraspot, was therefore developed to detect and quantify Fluorospots in automated fluorescence microscope images. Morphological parameters, including size, intensity, location, circularity and others are calculated for each spot, exported in FCS format, and further analyzed by gating and graphical display in popular flow cytometry analysis programs. The utility of Exploraspot is demonstrated by identification of single-, double- and triple-secreting T cells; tolerance of variable background fluorescence; and estimation of the numbers of genuine versus random multiple events.
A Uniform Parallel Optimization Method for Knowledge Discovery Grid
Authors: Kun Gao
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Grid is a new solution to computationally and data intensive computing problems. Since the distributed knowledge discovery process is both data and computational intensive, the Grid is a natural platform for deploying a high performance data mining service. In order to improve the performance of data mining applications, an effective method is task parallelization. Existing mechanisms of data mining parallelization are based on NOW or SMP, it is necessary to develop new parallel mechanism for grid feature. In this paper, we present a framework for high performance DDM applications in Computational Grid environments called Data Mining Grid, with the function for decomposing data mining application into subtasks and then combine those subtasks to form directed acyclic graph. This kind of parallel mechanism decomposes application according to the actual computation power of each node in dynamic Grid environment.
Representation of Rough Sets Based on Intuitionistic Fuzzy Special Sets
Authors: Zheng Pei, Li Zhang, Honghua Chen
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

Intuitionistic fuzzy special sets is a special case of intuitionistic fuzzy sets. In this paper, under the framework of information systems, the relationship between intuitionistic fuzzy special sets and rough sets is analyzed. Based on basic intuitionistic fuzzy special sets of information systems, intuitionistic fuzzy special ¿-algebra are generated, and rough sets are embedded in the intuitionistic fuzzy special ¿-algebra. Naturally, distances (e.g., Hamming distance or Euclidean distance) of intuitionistic fuzzy special sets in intuitionistic fuzzy special ¿-algebra can be used to evaluate predication rules of information systems which is an important subject of rough set theory.
Formal verification of WAHS: an autonomous and wireless P2P auction handling system
Authors: Ines Doghri
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

The cross between mobile ad hoc networks (MANETs) and peer to peer (P2P) systems raises interesting capabilities to explore the deployment of various applications. This paper presents a new possibility to bring a mobile commerce application into P2P way. We propose a communication architecture called WAHS (Wireless Auction Handling System) and a communication protocol named BSAP-Protocol (Buyer/Seller Auction Peer) that governs interactions between BSAPs during a P2P auction process. Although tests and simulations give us an excellent overview of the protocol behaviour, the formal verification is needed to prove the correctness of a system. We formally specify and verify the properties of our proposal by the use of PROMELA/SPIN model checker. We implemented P2P auctions over MANETs functionalities' and give the first simulation results that show improvements in comparison to a previously published work.
A Safe and Fast Connecting Strategy of the Bluetooth Identification Sensors in Ambient Intelligence Environment
Authors: Ling-xin Lu, Zhang-qin Huang, Yi-bin Hou, Jing Li, Shu-feng Wang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Ambient Intelligence is an emerging research field. The concept of AmI and its application scenarios are discussed firstly. Wireless Sensor Network is the premise and core technology of AmI. Bluetooth technology is used to implement Wireless Sensor Network in Ambient Intelligence. In this paper, topology architecture of Bluetooth identification sensor network is proposed. The software and hardware architecture of Bluetooth sensor and the software communicating protocols are designed and implemented. To make it safer and faster for Bluetooth sensors’ users entering into the Ambient Intelligence network, the connecting process is discussed, and a safe and fast connecting strategy is put forward.