ppxscal/embedding_network huggingface dataset:
A new EDA defined interchange format for processing of dependence graphs
Authors: Stavros Dokouzyannis, Argiris Mokios
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

A new file interchange format has been proposed for interacting with standard EDA (Electronic Design Automation) software, oriented towards Systolic Array Processors (SAPs) design. The Dependence Graphs (DGs), which are large graphs consisting of a set of arcs and Processing Elements (PEs), are transcripted by using specific declarations and lists, in order to be compatible with standard SAP based EDA software.
A Spatio-temporal Access Control Model Supporting Delegation for Pervasive Computing Applications
Authors: Indrakshi Ray, Manachai Toahchoodee
Venue: Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business (2008)

The traditional access control models, such as Role-Based Access Control (RBAC) and Bell-LaPadula (BLP), are not suitable for pervasive computing applications which typically lack well-defined security perimeters and where all the entities and interactions are not known in advance. We propose an access control model that handles such dynamic applications and uses environmental contexts to determine whether a user can get access to some resource. Our model is based on RBAC because it simplifies role management and is the de facto access control model for commercial organizations. However, unlike RBAC, it uses information from the environmental contexts to determine access decisions. The model also supports delegation which is important for dynamic applications where a user is unavailable and permissions may have to be transferred temporarily to another user/role in order to complete a specific task. This model can be used for any application where spatial and temporal information of a user and an object must be taken into account before granting access or temporarily transferring access to another user.
Reducing Transaction Abort Rates with Prioritized Atomic Multicast Protocols
Authors: Emili Miedes, Francesc D. Muñoz-Escoí, Hendrik Decker
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Priority atomic multicast is a total-order multicast message delivery service that enables applications to prioritize the sequence by which messages are delivered, while regular total order properties remain invariant. Priority-based message delivery can serve to reduce the abortion rate of transactions. In this study, we compare three classical total order protocols against their corresponding prioritized versions, in the framework of a replication middleware. To this end, we use a test application that broadcasts prioritized messages by these protocols, and measure the effect of the priorization. We show that, under certain conditions, the use of prioritized protocols yields lower abort rates than the corresponding non-prioritized protocols.
Surface Contact Interaction with Dynamically Deformable Object Using Impulse-Based Approach
Authors: Kazuyoshi Tagawa, Koichi Hirota, Michitaka Hirose
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

In our previous study, a method that allows dynamic interaction with an elastic object, which is called impulse response deformation model, has been proposed. An advantage of the method is that the order of complexity is lower than other approaches that solve equations of deformation models in real time; hence the method enables haptic interaction with more complex object. In this paper, an extension of the model that enables efficient computation of elastic deformation in interaction with surfaces, such as floor and wall, is discussed; unlike point-based interaction in our previous studies, pre-recorded response to impulse force that is applied by surface rather than point is used for the computation.
Solution for non-repudiation in GSM WAP applications
Authors: Cristian Toma, Marius Popa, Catalin Boja
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

The paper presents security issues and architectures for mobile applications and GSM infrastructure. The article also introduces the solution for avoiding denial of service from WAP applications using WIM features. The first section contains the structure of GSM network from voice and data point of view. The security in GSM network is presented in second section. The third section presents a solution for realizing mobile subscriber non-repudiation. The solution is based on the HTTP protocol over WAP.
Phase Transitions for Weakly Increasing Sequences
Authors: Michiel Smet, Andreas Weiermann
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

Motivated by the classical Ramsey for pairs problem in reverse mathematics we investigate the recursion-theoretic complexity of certain assertions which are related to the Erdös-Szekeres theorem. We show that resulting density principles give rise to Ackermannian growth. We then parameterize these assertions with respect to a number-theoretic function f and investigate for which functions f Ackermannian growth is still preserved. We show that this is the case for $f(i)=\sqrt[d]i$ but not for f(i) = log(i).
Evaluation and Extension of the AISEC Email Classification System
Authors: Nrupal Prattipati, Emma Hart
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

An existing system - AISEC - which categorises email as interesting or uninteresting using an immune-inspired algorithm is implemented as a plug-in to Outlook to allow seamless user testing. Experiments are performed with a new, large data set to validate previous published results. We show comparable results can be obtained on different data-sets if the system parameters are correctly tuned; the algorithm is particularly sensitive to certain parameters. Some flaws in the original algorithm are identified; a modification is proposed to the learning process of the algorithm and to the mutation operator. Tests with the modified algorithm in a number of scenarios in which users' interests frequently change show the improved algorithm is capable of continuously adapting to achieve high classification accuracy and can accurately track changes in user interests. The improvements are statistically significant when compared to the original system.
Combining the Best of the Two Worlds: Inheritance Versus Experience
Authors: Darío Maravall, Javier Lope, José Antonio Martín H.
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)

In this paper a hybrid approach to the autonomous navigation of robots in cluttered environment with unknown obstacles is introduced. It is shown the efficiency of the hybrid solution by combining the optimization power of evolutionary algorithms and at the same time the efficiency of the Reinforcement Learning in real-time and on-line situations. Experimental results concerning the navigation of a L-shaped robot in a cluttered environment with unknown obstacles in which appear real-time and on-line constraints well-suited to RL algorithms and extremely high dimension of the state space usually unpractical for RL algorithms but at the same time well-suited to evolutionary algorithms, are also presented. The experimental results confirm the validity of the hybrid approach to solve hard real-time, on-line and high dimensional robot motion control problems.
Formal Modeling and Analysis of a Flash Filesystem in Alloy
Authors: Eunsuk Kang, Daniel Jackson
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

This paper describes the formal modeling and analysis of a design for a flash-based filesystem in Alloy. We model the basic operations of a filesystem as well as features that are crucial to NAND flash hardware, such as wear-leveling and erase-unit reclamation. In addition, we address the issue of fault tolerance by modeling a mechanism for recovery from interrupted filesystem operations due to unexpected power loss. We analyze the correctness of our flash filesystem model by checking trace inclusion against a POSIX-compliant abstract filesystem, in which a file is modeled simply as an array of data elements. The analysis is fully automatic and complete within a finite scope.
Radial Basis Probabilistic Neural Networks Committee for Palmprint Recognition
Authors: Jixiang Du, Chuanmin Zhai, Yuanyuan Wan
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

In this paper, a novel and efficient method for recognizing palmprint based on radial basis probabilistic neural networks committee (RBPNNC) was proposed. The RBPNNC consists of several different independent neural networks trained by different feature domains of the original images. The final classification results represent a combined response of the individual networks. The Hong Kong Polytechnic University (PolyU) palmprint database is exploited to test our approach. The experimental results show that the RBPNNC achieves higher recognition accuracy and better classification efficiency than single feature domain.
Data stream processing and query optimization techniques
Authors: Carlo Zaniolo
Venue:  (2007)

Many modem applications require continuous processing of massive data streams, creating difficult research challenges on multiple fronts. Foremost among these there is the design and implementation of Data Stream Management Systems (DSMSs) that optimize the execution of multiple continuous queries, on massive and bursty data streams to produce fast, near-realtime, responses upon tuple arrival. Existing query constructs and query processing techniques of DataBase Management Systems must be greatly extended and revised to support efficiently continuous queries in DSMSs. In this dissertation, we propose novel query scheduling algorithms and query constructs whose effectiveness was demonstrated in the Stream Mill DSMS prototype. Thus, we introduce on-demand timestamp generation and propagation mechanisms based on a flexible query-execution model, to solve the idle-waiting problem, improve query response, and reduce memory consumption. Moreover, we introduce practical scheduling algorithms, which assume uniform cost for tuples on the same operator, to handle query graphs of arbitrary complexity. Finally, we compare the performance of these practical algorithms against the theoretically optimal ones that assume perfect knowledge on the costs of the individual topics being processed. Our experiments show that the performance of the former closely approximate that of the latter. In order to utilize DBMS languages for data stream processing, stream-oriented constructs, such as sliding windows, have to be defined and integrated into the query language. Thus, we introduce novel constructs and techniques for supporting sliding windows on arbitrary User Defined Aggregates, as to achieve their incremental maintenance on logical and physical windows. Finally, we explore some performance optimization issues in advanced applications, including RFID (Radio Frequency IDentification) applications, and load-shedding in multi-source stream classifiers.
On Robotics Applications in Service-Oriented Architecture
Authors: Yinong Chen, Xiaoying Bai
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Service-Oriented Computing (SOC) research and applications have been largely limited to software development in electronic and Web based applications. Service-oriented robotics software development extends SOC from its current fields to a new domain, which was considered not feasible because of the efficiency issues in terms of computing and communication. This paper presents the concepts, principles, and methods in SOC and SOC-based robotics software development and applies them in the design of distributed robotics applications. Two case studies, Intel security robot design and a maze-traversing robot application in Microsoft Robotics Studio, are used to illustrate the concepts and methods.
Exception Diagnosis Architecture for Open Multi-Agent Systems
Authors: Nazaraf Shah, Kuo-Ming Chao, Nick Godwin
Venue: Software Engineering for Multi-Agent Systems V: Research Issues and Practical Applications (2007)

Multi-Agent Systems (MAS) are collection of loosely coupled intelligent agents. These systems operate in a distributed, highly dynamic, unpredictable and unreliable environment in order to meet their overall goals. Agents in such an environment are vulnerable to different types of run time exceptions. It is necessary to have an effective exception diagnosis and resolution mechanism in place in order to ensure reliable interactions between agents. In this paper, we propose novel exception diagnosis architecture for open MAS. The proposed architecture classifies the runtime exceptions and diagnoses the underlying causes of exceptions using a heuristic classification technique. The proposed architecture is realised in terms of specialised exception diagnosing agents known as sentinel agents. The sentinel agents act as delegates of problem solving agents and mediate interactions between them.
Web Structure in 2005
Authors: Yu Hirate, Shin Kato, Hayato Yamana
Venue: Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers (2007)

The estimated number of static web pages in Oct 2005 was over 20.3 billion, which was determined by multiplying the average number of pages per web server based on the results of three previous studies, 200 pages, by the estimated number of web servers on the Internet, 101.4 million. However, based on the analysis of 8.5 billion web pages that we crawled by Oct. 2005, we estimate the total number of web pages to be 53.7 billion. This is because the number of dynamic web pages has increased rapidly in recent years. We also analyzed the web structure using 3 billion of the 8.5 billion web pages that we have crawled. Our results indicate that the size of the "CORE," the central component of the bow tie structure, has increased in recent years, especially in the Chinese and Japanese web.
Virtual Humans Elicit Skin-Tone Bias Consistent with Real-World Skin-Tone Biases
Authors: Brent Rossen, Kyle Johnsen, Adeline Deladisma, Scott Lind, Benjamin Lok
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

In this paper, we present results from a study that shows that a dark skin-tone VH agent elicits user behavior consistent with real world skin-tone biases. Results from a study with medical students (n=21), show participant empathy towards a dark skin-tone VH patient was predicted by their measured bias towards African-Americans. Real world bias was measured using a validated psychological instrument called the implicit association test (IAT). Scores on the IAT were significantly correlated to coders' ratings of participant empathy. This result indicates that VHs elicit realistic responses and could become an important component in cultural diversity training.
Design and Development of Software Configuration Management Tool to Support Process Performance Monitoring and Analysis
Authors: Alan Cline, Eun-Pyo Lee, Byong-Gul Lee
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Most SCM tools underestimate the potential ability of monitoring and reporting the performance of various software process activities, and delegate implementation of such capabilities to other CASE tools. This paper discusses how SCM tool can be extended and implemented to provide valuable SCM information (e.g., metric data) in monitoring the performance of various process areas. With the extended SCM tool capability, stakeholders can measure, analyze, and report the performance of process activities even without using the expensive CASE tools.
Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees
Authors: Akio Fujiyoshi
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

In this paper we will study the use of context-free grammars (CFGs) for the verification of tree structures. Because of the long history of the study of CFGs, parsing techniques for CFGs are well-established. The aim of this paper is to make use of those parsing techniques for the verification of tree structures.
Tracking and Visualizing the Changes of Mandarin Emotional Expression
Authors: Jun-Heng Yeh, Tsang-Long Pao, Chen-Yu Pai, Yun-Maw Cheng
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

In order to track continuous changes of someone's emotional expressions in Mandarin dialogue, we elaborated an emotion recognition system in continuous Mandarin speech. A new segmentation method was used to estimate the emotional turning points in a dialogue by dividing the utterance into several independent segments, each of which contains a single emotional category. Five basic emotional categories, including anger, happiness, sadness, boredom and neutral, can be recognized in our proposed method. Here, the speech features, MFCC and LPCC, are used in the proposed method. The experimental results show that the new recognition method can provide satisfactory results.
An Annotation-Based Access Control Model and Tools for Collaborative Information Spaces
Authors: Peyman Nasirifard, Vassilios Peristeras, Stefan Decker
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

We present an Annotation-Based Access Control model supported by a Collaboration Vocabulary (CoVoc) as a more flexible and user-centric access control approach in social platforms and shared workspaces. We present also briefly two SOA-based tools for enabling our approach: Uncle-Share is a gadget that provides annotation-based access control for bookmarks and uses CoVoc for annotating collaborative relationships. Who-With-Whom uses also CoVoc and visualizes extended social networks in order to help users to select the appropriate contacts to grant access to resources.
Deflating the big bang: fast and scalable deep packet inspection with extended finite automata
Authors: Randy Smith, Cristian Estan, Somesh Jha, Shijin Kong
Venue: Proceedings of the ACM SIGCOMM 2008 conference on Data communication (2008)

Deep packet inspection is playing an increasingly important role in the design of novel network services. Regular expressions are the language of choice for writing signatures, but standard DFA or NFA representations are unsuitable for high-speed environments, requiring too much memory, too much time, or too much per-flow state. DFAs are fast and can be readily combined, but doing so often leads to state-space explosion. NFAs, while small, require large per-flow state and are slow. We propose a solution that simultaneously addresses all these problems. We start with a first-principles characterization of state-space explosion and give conditions that eliminate it when satisfied. We show how auxiliary variables can be used to transform automata so that they satisfy these conditions, which we codify in a formal model that augments DFAs with auxiliary variables and simple instructions for manipulating them. Building on this model, we present techniques, inspired by principles used in compiler optimization, that systematically reduce runtime and per-flow state. In our experiments, signature sets from Snort and Cisco Systems achieve state-space reductions of over four orders of magnitude, per-flow state reductions of up to a factor of six, and runtimes that approach DFAs.
Anonymous Proxy Signatures
Authors: Georg Fuchsbauer, David Pointcheval
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

We define a general model for consecutive delegations of signing rights with the following properties: The delegatee actually signing and all intermediate delegators remain anonymous. As for group signatures, in case of misuse, a special authority can open signatures to reveal the chain of delegations and the signer's identity. The scheme satisfies a strong notion of non-frameability generalizing the one for dynamic group signatures. We give formal definitions of security and show them to be satisfiable by constructing an instantiation proven secure under general assumptions in the standard model. Our primitive is a proper generalization of both group signatures and proxy signatures and can be regarded as non-frameable dynamic hierarchical group signatures.
The Multiagent System for Channel Selection and Topology Control on 802.11 Based Mesh Networks
Authors: Ante Prodan, Vinod Mirchandani, John Debenham
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

To address the problem of topology control on multi-radio wireless mesh networks a distributed, lightweight, co-operative multiagent system that guarantees scalability has been developed and validated by simulation. Our goal is twofold, to select channels so to reduce interference, and improve connectivity by shortening paths between portal and client nodes. As this system is to be deployed over large networks the scalability and stability of the solution are of the main concern. The proposed algorithms have been implemented and evaluated with the Java based framework as well as NetLogo a multiagent simulation tool. The positive attributes of the algorithms are demonstrated through the comprehensive simulation result analysis.
Determining Placement of Intrusion Detectors for a Distributed Application through Bayesian Network Modeling
Authors: Gaspar Modelo-Howard, Saurabh Bagchi, Guy Lebanon
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

To secure today's computer systems, it is critical to have different intrusion detection sensors embedded in them. The complexity of distributed computer systems makes it difficult to determine the appropriate configuration of these detectors, i.e., their choice and placement. In this paper, we describe a method to evaluate the effect of the detector configuration on the accuracy and precision of determining security goals in the system. For this, we develop a Bayesian network model for the distributed system, from an attack graph representation of multi-stage attacks in the system. We use Bayesian inference to solve the problem of determining the likelihood that an attack goal has been achieved, given a certain set of detector alerts. We quantify the overall detection performance in the system for different detector settings, namely, choice and placement of the detectors, their quality, and levels of uncertainty of adversarial behavior. These observations lead us to a greedy algorithm for determining the optimal detector settings in a large-scale distributed system. We present the results of experiments on Bayesian networks representing two real distributed systems and real attacks on them.