ppxscal/embedding_network huggingface dataset:
Advanced Network Fingerprinting
Authors: Humberto J. Abdelnur, Radu State, Olivier Festor
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

Security assessment tasks and intrusion detection systems do rely on automated fingerprinting of devices and services. Most current fingerprinting approaches use a signature matching scheme, where a set of signatures are compared with traffic issued by an unknown entity. The entity is identified by finding the closest match with the stored signatures. These fingerprinting signatures are found mostly manually, requiring a laborious activity and needing advanced domain specific expertise. In this paper we describe a novel approach to automate this process and build flexible and efficient fingerprinting systems able to identify the source entity of messages in the network. We follow a passive approach without need to interact with the tested device. Application level traffic is captured passively and inherent structural features are used for the classification process. We describe and assess a new technique for the automated extraction of protocol fingerprints based on arborescent features extracted from the underlying grammar. We have successfully applied our technique to the Session Initiation Protocol (SIP) used in Voice over IP signalling.
A Framework for Deploying Self-predefined MPI Communicators and Attributes
Authors: Carsten Clauss, Boris Bierbaum, Stefan Lankes, Thomas Bemmerl
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

In this contribution, we present a new library (that can be used in addition to any MPI library) which allows writing optimized applications for heterogeneous environments without the need of relying on intrinsic adaptation features provided by a particular MPI implementation. This is achieved by giving the application programmer the ability to introduce new self-predefined attributes and communicators whose semantics can be adjusted to each respective environment. Furthermore, we have also developed an additional tool set that form a framework around this library in order to simplify such an adjustment for the user.
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios
Authors: Anne Bergeron, Julia Mixtacki, Jens Stoye
Venue: Proceedings of the international workshop on Comparative Genomics (2008)

In the past years, many combinatorial arguments have been made to support the theory that mammalian genome rearrangement scenarios rely heavily on breakpoint reuse. Different models of genome rearrangements have been suggested, from the classical set of operations that include inversions, translocations, fusions and fissions, to more elaborate models that include transpositions. Here we show that the current definition of breakpoint reuse rate is based on assumptions that are seldom true for mammalian genomes, and propose a new approach to compute this parameter. We explore the formal properties of this new measure and apply these results to the human-mouse genome comparison. We show that the reuse rate is intimately linked to a particular rearrangement scenario, and that the reuse rate can vary from 0.89 to 1.51 for scenarios of the same length that transform the mouse genome into the human genome, where a rate of 1 indicates no reuse at all.
On scalable search
Authors: Ophir Frieder
Venue:  (2007)

I present algorithms and techniques for improving the efficiency and accuracy of search. Information Retrieval (IR) is concerned with both accuracy and efficiency when searching structured, unstructured, and semi-structured data. Existing techniques are available to accurately and efficiently search structured data. I examine the efficiency of two common techniques for searching XML semi-structured data: conventional tree-based and relational based approaches. Through a series of experiments over increasingly large XML collections, I show the relational approach provides a scalable approach to XML retrieval by leveraging existing relational database optimizations. Furthermore, I show the relational approach typically outperforms the tree-based approach while scaling consistently over all collections studied. I also examine unstructured data, to show that scalable, accurate clustering is sustained via parallelism. I propose a distributed memory parallel algorithm to enable scaling the document clustering problem to large collections. I show how this parallel hierarchical agglomerative clustering algorithm can be used as the clustering subroutine for a parallel version of the Buckshot algorithm to cluster very large document collections at near theoretical runtime expectations.
Finding Most Probable Worlds of Probabilistic Logic Programs
Authors: Samir Khuller, Vanina Martinez, Dana Nau, Gerardo Simari, Amy Sliva, V. S. Subrahmanian
Venue: Proceedings of the 1st international conference on Scalable Uncertainty Management (2007)

Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are interested in finding a possible world that is most probable. Our first result shows that the problem of computing such "maximally probable worlds" (MPW) is intractable. We subsequently show that we can often greatly reduce the size of the linear program used in past work (by Ng and Subrahmanian) and yet solve the problem exactly. However, the intractability results still make computational efficiency quite impossible. We therefore also develop several heuristics to solve the MPW problem and report extensive experimental results on the accuracy and efficiency of such heuristics.
Proof Theory for First Order Łukasiewicz Logic
Authors: Matthias Baaz, George Metcalfe
Venue: Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (2007)

An approximate Herbrand theorem is proved and used to establish Skolemization for first-order ¿ukasiewicz logic. Proof systems are then defined in the framework of hypersequents. In particular, extending a hypersequent calculus for propositional ¿ukasiewicz logic with usual Gentzen quantifier rules gives a calculus that is complete with respect to interpretations in safe MV-algebras, but lacks cut-elimination. Adding an infinitary rule to the cut-free version of this calculus gives a system that is complete for the full logic. Finally, a cut-free calculus with finitary rules is obtained for the one-variable fragment by relaxing the eigenvariable condition for quantifier rules.
Automated Design Approach for Analog Circuit Using Genetic Algorithm
Authors: Xuewen Xia, Yuanxiang Li, Weiqin Ying, Lei Chen
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

The technology of electronic design automation (EDA) has improved the efficiency of design process, however, designer is still required much special knowledge of circuit. During the past decade, using genetic algorithm (GA) to design circuit had attracted many experts and scholars. However, too much more attention was focus on a circuit's function and many other factors had been neglected which caused the circuit had little applicability. This paper proposes an automated design approach for analog circuit based on a multi-objective adaptive GA. The multi-objective fitness evaluation method, which can dynamic adjust parameter, is selected. And a parallel evolution strategy which separates evolution of circuit structure and element value is adopted but also organically combined them by weight vectors. The experimental results indicate that this approach obviously be able to improve the evolution efficiency and could generate numbers of suitable circuits.
A Dynamic Clustering Algorithm for Mobile Objects
Authors: Dominique Fournier, Gaële Simon, Bruno Mermet
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

In this paper, a multiagent algorithm for dynamic clustering is presented. This kind of clustering is intended to manage mobile data and so, to be able to continuously adapt the built clusters. First of all, potential applications of this algorithm are presented. Then the specific constraints for this kind of clustering are studied. A multiagent architecture satisfying these constraints is described. It combines an ants algorithm with a cluster agents layer which are executed simultaneously. Finally, the first experimental results of our work are presented.
The Practical Efficiency of Convolutions in Pattern Matching Algorithms
Authors: Amihood Amir, Avivit Levy, Liron Reuveni
Venue: Fundamenta Informaticae (2008)

Convolutions have proven to be an effective tool in asymptotically efficient pattern matching algorithms. This study attempts to find the type of problems where convolutions are inefficient in practice, and give possible solutions for the complex cases where the convolution method does not seem to aid realistic sized inputs.
Verify Your Runs
Authors: Klaus Havelund, Allen Goldberg
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

A program verifier determines whether a program satisfies a specification. Ideally verification is achieved by static analysis without executing the code. However, program verification is unsolvable in general. The interactive approach, for example with a human guiding a theorem prover, does not in practice scale to large software systems. Some restricted kinds of specifications can, however, be checked automatically, for example type definitions. Also static analysis of properties such as un-initialized variables, null-pointer de-referencing, and arraybound violations scales to production programs on the order of hundreds of thousands of lines of code. Even concurrency-related problems such as data races and deadlocks can to some extent be checked statically, although often resulting in false positives. However, going beyond these simple properties to arbitrarily complex behavior specification and scaling to ever-growing production program size is undoubtedly a challenge, and in our opinion we cannot expect regular economic use of program verification of arbitrary properties to be fully achieved within the 15 year time horizon of the challenge.
Techniques for Image Classification, Object Detection and Object Segmentation
Authors: Ville Viitaniemi, Jorma Laaksonen
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

In this paper we outline the techniques which we used to participate in the PASCAL NoE VOC Challenge 2007 image analysis performance evaluation campaign. We took part in three of the image analysis competitions: image classification, object detection and object segmentation. In the classification task of the evaluation our method produced comparatively good performance, the 4th best of 19 submissions. In contrast, our detection results were quite modest. Our method's segmentation accuracy was the best of all submissions. Our approach for the classification task is based on fused classifications by numerous global image features, including histograms of local features. The object detection combines similar classification of automatically extracted image segments and the previously obtained scene type classifications. The object segmentations are obtained in a straightforward fashion from the detection results.
Controling Contract Net Protocol by Local Observation for Large-Scale Multi-Agent Systems
Authors: Toshiharu Sugawara, Toshio Hirotsu, Satoshi Kurihara, Kensuke Fukuda
Venue: Proceedings of the 12th international workshop on Cooperative Information Agents XII (2008)

We describe a new adaptive manager-side control policy for the contract net protocol that uses the capabilities of all agents in a massively multi-agent system (MMAS). Recent advances in Internet services, pervasive computing, and grid computing require sophisticated MAS technologies to effectively use the large amount of invested computing resources. To improve overall performance, tasks must be allocated to appropriate agents, and from this viewpoint, a number of negotiation protocols were proposed in the MAS context. Most assume a small-scale, unbusy environment, however. We previously reported the possibility that, using contract net protocol (CNP), the overall efficiency improved by an adequate control of degree of fluctuation in the awarding phase, when the MMAS is in specific states. In this paper, we propose the method to estimate these specific states from the bid values, which have hitherto not been used effectively. Then the new manager-side policy flexibly and autonomously introduces some degree of fluctuation responsive to the estimated states. We also demonstrate that our proposed CNP policy provides considerably better performance than naive CNP and CNP with inflexible policies, even though our policy does not use global information.
Distributed Norm Enforcement: Ostracism in Open Multi-Agent Systems
Authors: Adrian Perreau De Pinninck, Carles Sierra, Marco Schorlemmer
Venue: Computable Models of the Law: Languages, Dialogues, Games, Ontologies (2008)

Enforcement in normative agent societies is a complex issue, which becomes more problematic as these societies become more decentralized and open. A new distributed mechanism is presented to enforce norms by ostracizing agents that do not abide by them in their interactions with other agents in the society. Simulations are run to check the mechanism's impact in different types of societies. The simulations have shown that complete ostracism is not always possible, but the mechanism substantially reduces the number of norm violations.
Parallel and Sequential Optical Computing
Authors: Damien Woods, Thomas J. Naughton
Venue: Proceedings of the 1st international workshop on Optical SuperComputing (2008)

We present a number of computational complexity results for an optical model of computation called the continuous space machine. We also describe an implementation for an optical computing algorithm that can be easily defined within the model. Our optical model is designed to model a wide class of optical computers, such as matrix vector multipliers and pattern recognition architectures. It is known that the model solves intractable PSPACE problems in polynomial time, and NC problems in polylogarithmic time. Both of these results use large spatial resolution (number of pixels). Here we look at what happens when we have constant spatial resolution. It turns out that we obtain similar results by exploiting other resources, such as dynamic range and amplitude resolution. However, with certain other restrictions we essentially have a sequential device. Thus we are exploring the border between parallel and sequential computation in optical computing. We describe an optical architecture for the unordered search problem of finding a one in a list of zeros. We argue that our algorithm scales well, and is relatively straightforward to implement. This problem is easily parallelisable and is from the class NC. We go on to argue that the optical computing community should focus their attention on problems within P (and especially NC), rather than developing systems for tackling intractable problems.
Preprocessing for controlled query evaluation with availability policy
Authors: Joachim Biskup, Lena Wiese
Venue: Journal of Computer Security (2008)

Controlled Query Evaluation (CQE) defines a logical framework to protect confidential information in a database. By modeling a user's a priori knowledge appropriately, a CQE system not only controls access to certain database entries but also accounts for information inferred by the user. In this article, we present a static (preprocessing) CQE-approach for propositional databases with an availability policy. The resulting inference-proof and availability-preserving database ensures confidentiality of secret information while guaranteeing availability of certain database entries to a highest degree possible. We illustrate the semantics of the system by a comprehensive example and state the essential requirements for an inference-proof and availability-preserving database. We present an algorithm that accomplishes the preprocessing by combining SAT solving and &ldquo;Branch and Bound&rdquo;.
Private and Cheating-Free Outsourcing of Algebraic Computations
Authors: David Benjamin, Mikhail J. Atallah
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

We give protocols for the secure and private outsourcing of linear algebra computations, that enable a client to securely outsource expensive algebraic computations (like the multiplication of huge matrices) to two remote servers, such that the servers learn nothing about the customer's private input or the result of the computation,and any attempted corruption of the answer by the servers is detected with high probability. The computational work done locally by the client is linear in the size of its input and does not require the client to carry out locally any expensive encryptions of such input.The computational burden on the servers is proportional to the time complexity of the current practically used algorithms for solving the algebraic problem (e.g., proportional to n^3 for multiplying two n x n matrices). If the servers were to collude against the client,then they would only find out the client's private inputs, but they would not be able to corrupt the answer without detection by the client.
Bayesian Hyperspectral Image Segmentation with Discriminative Class Learning
Authors: Janete S. Borges, José M. Bioucas-Dias, André R. Marçal
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

This paper presents a new Bayesian approach to hyperspectral image segmentation that boosts the performance of the discriminative classifiers. This is achieved by combining class densities based on discriminative classifiers with a Multi-Level Logistic Markov-Gibs prior. This density favors neighbouring labels of the same class. The adopted discriminative classifier is the Fast Sparse Multinomial Regression. The discrete optimization problem one is led to is solved efficiently via graph cut tools. The effectiveness of the proposed method is evaluated, with simulated and real AVIRIS images, in two directions: 1) to improve the classification performance and 2) to decrease the size of the training sets.
Trading potatoes in distributed multi-tier routing systems
Authors: Yuval Shavitt, Yaron Singer
Venue: Proceedings of the 3rd international workshop on Economics of networked systems (2008)

The The Internet is an example of a distributed system where the task of routing is performed in a multi-tier fashion: interdomain paths between autonomously-managed networks are sub ject to a global agreement (BGP), and the choice of intradomain paths is left to the discretion of each such network. When forwarding packets, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy known as hot potato routing. As a result, paths in the Internet are suboptimal from a global perspective. In this paper we explore complementary deviations from hot-potato routing in a manner which benefits both ASes. We show that even for a pair of ASes obtaining such path trading solutions is NP-complete, and give pseudo-polynomial algorithms to find them. We use PoP-level maps of ASes obtained from measurements of real AS topologies in the Internet to show that, in comparison to hot-potato routing, path trading can substantially reduce the cost of intradomain routing.
Flows with Unit Path Capacities and Related Packing and Covering Problems
Authors: Maren Martens, Martin Skutella
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

Since the seminal work of Ford and Fulkerson in the 1950s, network flow theory is one of the most important and most active areas of research in combinatorial optimization. Coming from the classical maximum flow problem, we introduce and study an apparently basic but new flow problem that features a couple of interesting peculiarities. We derive several results on the complexity and approximability of the new problem. On the way we also discover two closely related basic covering and packing problems that are of independent interest.Starting from an LP formulation of the maximum s-t-flow problem in path variables, we introduce unit upper bounds on the amount of flow being sent along each path. The resulting (fractional) flow problem is NP-hard; its integral version is strongly NP-hard already on very simple classes of graphs. For the fractional problem we present an FPTAS that is based on solving the k shortest paths problem iteratively. We show that the integral problem is hard to approximate and give an interesting O(logm)-approximation algorithm, where m is the number of arcs in the considered graph. For the multicommodity version of the problem there is an $O(\sqrt{m})$-approximation algorithm. We argue that this performance guarantee is best possible, unless P=NP.
Dynamic Interactions in HLA Component Model for Multiscale Simulations
Authors: Katarzyna Rycerz, Marian Bubak, Peter M. Sloot
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

In this paper we present a High Level Architecture (HLA) component model, particularly suitable for distributed multiscale simulations. We also present a preliminary implementation of HLA components and the CompoHLA environment that supports setting up and managing multiscale simulations built in the described model. We propose to integrate solutions from High Level Architecture (such as advanced time and data management) with possibilities given by component technologies (such as reusability and composability) and the Grid (such as joining geographically distributed communities of scientists). This approach will allow users working on multiscale applications to more easily exchange and join the simulations already created. The particular focus of this paper is on the design of a HLA component. We show how to insert simulation logic into a component and make it possible to steer from outside its connections with other components. Its functionality is shown through example of multiscale simulation of dense stellar system.
Research on Dynamic Updating of Grid Service
Authors: Jiankun Wu, Linpeng Huang, Dejun Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In complicated distributed system based on grid environment, the grid service is inadequate in the ability of runtime updating. While in the maintenance of systems in grid environment, it is an urgent issue to solve to support the transparent runtime updating of the services, especially in the case of services communicating with each other frequently. On the basis of researches on the implementation of grid services and interaction between them following WSRF [3], this paper introduces proxy service as the bridge of the interaction between services and achieved the ability to support the runtime dynamic updating of grid services. Gird service updating must happen gradually, and there may be long periods of time when different nodes run different service versions and need to communicate using incompatible protocols. We present a methodology and infrastructure that make it possible to upgrade grid-based systems automatically while limiting service disruption.