ppxscal/embedding_network huggingface dataset:
Dynamic instruction sequences monitor for virus detection
Authors: Jianyong Dai, Ratan Guha, Joohan Lee
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

In this paper, we describe a program monitor which is able to capture runtime instruction sequences of an arbitrary program. To protect user computer from potentially malicious behavior of that program, we provide a protection mechanism. We intercept certain Win32 API and divert it to a safe version of that API. We also provide a plug-in mechanism to build application based on the captured runtime instruction sequences. The first application of the monitor is a virus detection system. The virus detection plug-in utilizes a classification model to make an intelligent guess based on the information extracted from instruction sequences to decide whether the tested program is benign or malicious. Our test result shows that our dynamic instruction monitor can protect user computer from malicious behavior in general case.
A two-stage hardware scheduler combining greedy and optimal scheduling
Authors: Raymond R. Hoare, Zhu Ding, Alex K. Jones
Venue: Journal of Parallel and Distributed Computing (2008)

Greedy scheduling heuristics provide a low complexity and scalable albeit particularly sub-optimal strategy for hardware-based crossbar schedulers. In contrast, the maximum matching algorithm for Bipartite graphs can be used to provide optimal scheduling for crossbar-based interconnection networks with a significant complexity and scalability cost. In this paper, we show how maximum matching can be reformulated in terms of Boolean operations rather than the more traditional formulations. By leveraging the inherent parallelism available in custom hardware design, we reformulate maximum matching in terms of Boolean operations rather than matrix computations and introduce three maximum matching implementations in hardware. Specifically, we examine a Pure Logic Scheduler with three dimensions of parallelism, a Matrix Scheduler with two dimensions of parallelism and a Vector Scheduler with one dimension of parallelism. These designs reduce the algorithmic complexity for an NxN network from O(N^3) to O(1), O(K), and O(KN), respectively, where K is the number of optimization steps. While an optimal scheduling algorithm requires K=2N-1 steps, by starting with our hardware-based greedy strategy to generate an initial schedule, our simulation results show that the maximum matching scheduler can achieve 99% of the optimal schedule when K=9. We examine hardware and time complexity of these architectures for crossbar sizes of up to N=1024. Using FPGA synthesis results, we show that a greedy schedule for crossbars, ranging from 8x8 to 256x256, can be optimized in less than 20 ns per optimization step. For crossbars reaching 1024x1024 the scheduling can be completed in approximately 10 @ms with current technology and could reach under 90 ns with future technologies.
Letters: Stability analysis for the generalized Hopfield neural networks with multi-level activation functions
Authors: Yiguang Liu, Zhisheng You
Venue: Neurocomputing (2008)

Using the continuity property of neuron state variables and Lyapunov functional, this paper religiously gives sufficient conditions ensuring the equilibrium number, local stable state number, global stability and complete stability of the Hopfield neural networks with multi-level activation functions. Compared with the known relevant literatures, the obtained results are more precise. Finally, three examples are employed to illustrate the obtained criteria.
Improved Processing of Textual Use Cases: Deriving Behavior Specifications
Authors: Jaroslav Drazan, Vladimir Mencl
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

The requirements for a system are often specified as textual use cases. Although they are written in natural language, the simple and uniform sentence structure used makes automated processing of use cases feasible. However, the numerous use case approaches vary in the permitted complexity and variations of sentence structure. Frequently, use cases are written in the form of compound sentences describing several actions. While there are methods for analyzing use cases following the very simple SVDPI (subject-verb-direct object ... indirect object) pattern, methods for more complex sentences are still needed. We propose a new method for processing textual requirements based on the scheme earlier described in [13]. The new method allows to process the commonly used complex sentence structures, obtaining more descriptive behavior specifications, which may be used to verify and validate requirements and to derive the initial design of the system.
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
Authors: Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

In this paper, we study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous network, a part of which is under the influence of an all powerful mobile Byzantine adversary. We design a three phase bit optimal PSMT protocol tolerating mobile adversary, whose communication complexity matches the existing lower bound on the communication complexity of any multi phase PSMT protocol, tolerating mobile adversary. This significantly reduces the phase complexity of the existing O(t) phase bit optimal PSMT protocol tolerating mobile adversary, where t denotes the number of nodes corrupted by the mobile adversary. Furthermore, we design a three phase bit optimal PRMT protocol which achieves reliability with constant factor overhead against a mobile adversary. These are the first ever constant phase bit optimal PRMT and PSMT protocols against mobile Byzantine adversary. We also characterize PSMT protocols in directed networks tolerating mobile adversary. Finally, we derive tight bound on the number of rounds required to achieve reliable communication from S to R tolerating a mobile adversary with arbitrary roaming speed.Finally, we show how our constant phase PRMT and PSMT protocols can be adapted to design round optimal and bit optimal PRMT and PSMT protocols, provided the network is given as collection of vertex disjoint paths.
Adapting a message-driven parallel application to GPU-accelerated clusters
Authors: James C. Phillips, John E. Stone, Klaus Schulten
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Graphics processing units (GPUs) have become an attractive option for accelerating scientific computations as a result of advances in the performance and flexibility of GPU hardware, and due to the availability of GPU software development tools targeting general purpose and scientific computation. However, effective use of GPUs in clusters presents a number of application development and system integration challenges. We describe strategies for the decomposition and scheduling of computation among CPU cores and GPUs, and techniques for overlapping communication and CPU computation with GPU kernel execution. We report the adaptation of these techniques to NAMD, a widely-used parallel molecular dynamics simulation package, and present performance results for a 64-core 64-GPU cluster.
Combining Multiple Features for Automatic Text Summarization through Machine Learning
Authors: Daniel Saraiva Leite, Lucia Helena Rino
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

In this paper we explore multiple features for extractive automatic summarization using machine learning. They account for SuPor-2 features, a supervised summarizer for Brazilian Portuguese, and graph-based features mirroring complex networks measures. Four different classifiers and automatic feature selection are explored. ROUGE is used for assessment of single-document summarization of news texts.
Comparison of a Novel Combined ECOC Strategy with Different Multiclass Algorithms Together with Parameter Optimization Methods
Authors: Marco Hülsmann, Christoph M. Friedrich
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

In this paper we consider multiclass learning tasks based on Support Vector Machines (SVMs). In this regard, currently used methods are One-Against-All or One-Against-One, but there is much need for improvements in the field of multiclass learning. We developed a novel combination algorithm called Comb-ECOC, which is based on posterior class probabilities. It assigns, according to the Bayesian rule, the respective instance to the class with the highest posterior probability. A problem with the usage of a multiclass method is the proper choice of parameters. Many users only take the default parameters of the respective learning algorithms (e.g. the regularization parameter C and the kernel parameter ¿). We tested different parameter optimization methods on different learning algorithms and confirmed the better performance of One-Against-One versus One-Against-All, which can be explained by the maximum margin approach of SVMs.
Artifacts in the A&A meta-model for multi-agent systems
Authors: Andrea Omicini, Alessandro Ricci, Mirko Viroli
Venue: Autonomous Agents and Multi-Agent Systems (2008)

In this article we focus on the notion of artifact for agents in multi-agent systems (MAS) as a basis for a new meta-model promoting the modelling and engineering of agent societies and MAS environment as first-class entities. Its conceptual foundations lay upon theories and results coming from computational sciences as well as from organisational and cognitive sciences, psychology, computer supported cooperative work (CSCW), anthropology and ethology. In the resulting agents artifacts (A A) meta-model, agents are the (pro-)active entities in charge of the goals/tasks that altogether build up the whole MAS behaviour, whereas artifacts are the reactive entities providing the services and functions that make individual agents work together in a MAS, and that shape agent environment according to the MAS needs. After presenting the scientific background, we define the notions of artifact in the A A meta-model, discuss how it affects the notion of intelligence in MAS, and show its application to a number of agent-related research fields.
Robots, Models, and Automation
Authors: R. Paul
Venue: Computer (1979)

Low-cost, mass-produced industrial robots could free human workers from the tedium of the assembly line. Such robots may be possible within the next decade. 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
Language Strength Reduction
Authors: Nicholas Kidd, Akash Lal, Thomas Reps
Venue: Proceedings of the 15th international symposium on Static Analysis (2008)

This paper concerns methods to check for atomic-set serializability violations in concurrent Java programs. The straightforward way to encode a reentrant lock is to model it with a context-free language to track the number of successive lock acquisitions. We present a construction that replaces the context-free language that describes a reentrant lock by a regular language that describes a non-reentrant lock. We call this replacement language strength reduction. Language strength reduction produces an average speedup (geometric mean) of 3.4. Moreover, for 2 programs that previously exhausted available space, the tool is now able to run to completion.
Study of Artificial Neural Network Appraisal to Mine Coordination Development Ability
Authors: Jun Xu
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

The coordination development of mine was a complex nonlinear system, which included lots of factors. Based on analyzing the current methods for appraisal of coordination development of mine, an appraisal-index system was established. A neural network model with multi-hierarchic structure was built based on error back-propagation (BP) algorithm. This model could overcome many man-made factors with some advantages: lower rorrate; being of coordinatio development; convenient and reliable. The validity and accuracy of this method was proved by case study
Network channel coding: importance of in-network processing and side-information
Authors: Hayder Radha
Venue:  (2007)

Network Channel Coding (NCC) generically refers to a framework, under which we embed channel coding functionalities within a network, to improve the throughput in a multi-receiver communication scenario. In this work, we consider two types of NCC problems. The first part is focused on NCC problems related to rateless codes. Rateless codes can be used for asynchronous broadcast applications. We focus our work on Luby-Transform (LT) codes, which are an example of low-complexity rateless codes. Prior designs of LT codes cater to the uniform demand case. In this work we design LT codes for non-uniform demands where the sinks are interested in recovering distinct fractions of the data symbols. Subsequently, we consider the design of Distributed LT (DLT) codes. DLT codes can be used in scenarios where multiple sources communicated to a sink via a common relay. In such a scenario, LT encoded data from various sources can be selectively mixed at the relay to improve the communication efficiency. Prior designs of DLT codes have focused on specific degree distributions, we generalize this work. We also comment upon the analysis of Generalized LT codes using generalized ripples. The second part is focused on problems that study the impact of side-information on NCC. In particular we focus on design of NCC related cross-layer protocols. Typical wireless networks employ a link-abstraction under which packets with corruptions are discarded. While such an abstraction certainly leads to a simpler architecture, the capacity loss on account of the packet drops can be significant. Hence, in this work we argue in favor of developing protocols which relay corrupted packet to higher layers, and across multiple hops. On the basis of theoretical deductions, model and trace based simulations; we analyze the utility of proposed protocols, particularly for multimedia applications. We investigate in detail the impact of receiver-side Channel State Information (CSI) on the performance of these protocols. We identify mechanisms that can provide CSI in commercially available wireless devices. Finally, we extend these protocols to exciting new area of network coding. Network coding saves bandwidth by mixing packets within the network. However, mixture of corrupt packets can lead to error amplification. Capacity loss due to error amplification can nullify the gains of network coding. To circumvent this phenomenon, we design an Adaptive Network Coding protocol that selectively mixes corrupt packets. The decision to mix is determined by the level of bit-corruption in each packet. All of the above proposed protocols exhibit a progressive improvement over comparable conventional protocols.
Slicing for Security of Code
Authors: Benjamin Monate, Julien Signoles
Venue: Proceedings of the 1st international conference on Trusted Computing and Trust in Information Technologies: Trusted Computing - Challenges and Applications (2008)

Bugs in programs implementing security features can be catastrophic: for example they may be exploited by malign users to gain access to sensitive data. These exploits break the confidentiality of information. All security analyses assume that softwares implementing security features correctly implement the security policy, i.e. are security bug-free. This assumption is almost always wrong and IT security administrators consider that any software that has no security patches on a regular basis should be replaced as soon as possible. As programs implementing security features are usually large, manual auditing is very error prone and testing techniques are very expensive. This article proposes to reduce the code that has to be audited by applying a program reduction technique called slicing. Slicing transforms a source code into an equivalent one according to a set of criteria. We show that existing slicing criteria do not preserve the confidentiality of information. We introduce a new automatic and correct source-to-source method properly preserving the confidentiality of information i.e. confidentiality is guaranteed to be exactly the same in the original program and in the sliced program.
A Comparison of Language Models for Dialog Act Segmentation of Meeting Transcripts
Authors: Jáchym Kolář
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

This paper compares language modeling techniques for dialog act segmentation of multiparty meetings. The evaluation is twofold; we search for a convenient representation of textual information and an efficient modeling approach. The textual features capture word identities, parts-of-speech, and automatically induced classes. The models under examination include hidden event language models, maximum entropy, and BoosTexter. All presented methods are tested using both human-generated reference transcripts and automatic transcripts obtained from a state-of-the-art speech recognizer.
Structural Aspects of the Evaluation of Agent Organizations
Authors: Davide Grossi, Frank Dignum, Virginia Dignum, Mehdi Dastani, Làmber Royakkers
Venue: Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS 2006 and ECAI 2006 International Workshops, COIN 2006 Hakodate, Japan, May 9, 2006 Riva del Garda, Italy, August 28, 2006. Revised Selected Papers (2007)

A multi-agent system can be analyzed and specified as an organization consisting of roles and their relations. The performance of an organization depends on many factors among which the type of its organizational structure, i.e., the set of relations holding between its roles. This work focuses on the structure of organizations and addresses the issue of the analysis, evaluation, and comparison of organizational structures which can contribute to develop general methods for the assessment of multi-agent systems' performance. Specifically, quantitative concepts from graph theory are used to provide numerical analyses of organizational structures. It is argued that these analyzes can be used for evaluating to what extent an organizational structure exhibits some characteristic properties such as robustness, flexibility and efficiency.
Inductively Sequential Term-Graph Rewrite Systems
Authors: Rachid Echahed
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

Definitional trees have been introduced by Sergio Antoy in order to design an efficient term rewrite strategy which computes needed outermost redexes. In this paper, we consider the use of definitional trees in the context of term-graph rewriting. We show that, unlike the case of term rewrite systems, the strategies induced by definitional trees do not always compute needed redexes, in presence of term-graph rewrite systems. We then define a new class called inductively sequential term-graph rewrite systems (istGRS) for which needed redexes are still provided by definitional trees. Systems in this class are not confluent in general. We give additional syntactic criteria over istGRS's which ensure the confluence property with respect to the set of admissible term-graphs.
Detecting data records in semi-structured web sites based on text token clustering
Authors: Xiaoying Gao, Le Phong Bao Vuong, Mengjie Zhang
Venue: Integrated Computer-Aided Engineering (2008)

This paper describes a new approach to the use of clustering for automatic data detection in semi-structured web pages. Unlike most exiting web information extraction approaches that usually apply wrapper induction techniques to manually labelled web pages, this approach avoids the pattern induction process by using clustering techniques on unlabelled pages. In this approach, a variant Hierarchical Agglomerative Clustering (HAC) algorithm called K-neighbours-HAC is developed which uses the similarities of the data format (HTML tags) and the data content (text string values) to group similar text tokens into clusters. We also develop a new method to label text tokens to capture the hierarchical structure of HTML pages and an algorithm for mapping labelled text tokens to XML. The new approach is tested and compared with several common existing wrapper induction systems on three different sets of web pages. The results suggest that the new approach is effective for data record detection and that it outperforms these common existing approaches examined on these web sites. Compared with the existing approaches, the new approach does not require training and successfully avoids the explicit pattern induction process, and accordingly the entire data detection process is simpler.
Verifying Agent Conformance with Protocols Specified in a Temporal Action Logic
Authors: Laura Giordano, Alberto Martelli
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

The paper addresses the problem of agents compatibility and their conformance to protocols. We assume that the specification of protocols is given in an action theory by means of temporal constraints and, in particular, communicative actions are defined in terms of their effects and preconditions on the social state of the protocol. We show that the problem of verifying the conformance of an agent with a protocol can be solved by making use of an automata based approach, and that the conformance of a set of agents with a protocol guarantees that their interaction cannot produce deadlock situations and it only gives rise to runs of the protocol.
Learning an Outlier-Robust Kalman Filter
Authors: Jo-Anne Ting, Evangelos Theodorou, Stefan Schaal
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

We introduce a modified Kalman filter that performs robust, real-time outlier detection, without the need for manual parameter tuning by the user. Systems that rely on high quality sensory data (for instance, robotic systems) can be sensitive to data containing outliers. The standard Kalman filter is not robust to outliers, and other variations of the Kalman filter have been proposed to overcome this issue. However, these methods may require manual parameter tuning, use of heuristics or complicated parameter estimation procedures. Our Kalman filter uses a weighted least squares-like approach by introducing weights for each data sample. A data sample with a smaller weight has a weaker contribution when estimating the current time step's state. Using an incremental variational Expectation-Maximization framework, we learn the weights and system dynamics. We evaluate our Kalman filter algorithm on data from a robotic dog.