ppxscal/embedding_network huggingface dataset:
A New Direct Anonymous Attestation Scheme from Bilinear Maps
Authors: Ernie Brickell, Liqun Chen, Jiangtao Li
Venue: Proceedings of the 1st international conference on Trusted Computing and Trust in Information Technologies: Trusted Computing - Challenges and Applications (2008)

Direct Anonymous Attestation (DAA) is a cryptographic mechanism that enables remote authentication of a user while preserving privacy under the user's control. The DAA scheme developed by Brickell, Camenisch, and Chen has been adopted by the Trust Computing Group (TCG) for remote anonymous attestation of Trusted Platform Module (TPM), a small hardware device with limited storage space and communication capability. In this paper, we propose a new DAA scheme from elliptic curve cryptography and bilinear maps. The lengths of private keys and signatures in our scheme are much shorter than the lengths in the original DAA scheme, with a similar level of security and computational complexity. Our scheme builds upon the Camenisch-Lysyanskaya signature scheme and is efficient and provably secure in the random oracle model under the LRSW (stands for Lysyanskaya, Rivest, Sahai and Wolf) assumption and the decisional Bilinear Diffie-Hellman assumption.
Electric dipole polarizability and hyperpolarizability of NCCN, NCCP, and PCCP
Authors: Tadeusz Pluta, Piotr Zerzucha
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

Components of the static electric dipole polarizabilty (&alpha;), and second hyperpolarizability (&gamma;); tensors have been determined by accurate ab initio calculations for three molecules containing two conjugated carbon - nitrogen and/or carbon - phosphorus triple bonds. For the NCCP molecule the dipole moment (&mu;) and non-vanishing components of the first hyperpolarizability (&beta;) tensor have also been calculated. Electron correlation effects have been taken into account by the second-order Many Body Perturbation Theory (MBPT(2)), and coupled cluster (CCSD and CCSD(T)) calculations. The basis set developed by Sadlej (Pol) and designed to be used in electric properties calculations together with its extension (HyPol) have been applied and compared to the results obtained with the standard aug-cc-PVTZ sets of Dunning.
A Mathematical Operator for Automatic and Real Time Analysis of Sequences of Vascular Images
Authors: Marcello Demi, Elisabetta Bianchini, Francesco Faita, Vincenzo Gemignani
Venue: Proceedings of the 3rd international conference on Advances in Mass Data Analysis of Images and Signals in Medicine, Biotechnology, Chemistry and Food Industry (2008)

Due to the absolute value involved, the first absolute central moment can be divided into two complementary filters: a positive deviation e p and a negative deviation e n . Both e p and e n can be used separately to highlight edges, lines, line endings, corners and junctions in images. Furthermore, the recovered edge information can be usefully combined to obtain additional information that would not be obtained by varying the parameters of the original filter. The mass center of the first absolute central moment can be also defined and an iterative localization procedure can be developed by exploiting its properties. Mathematical operators derived from the first absolute central moment were used on a video processing device based on a DSP board and they proved to be robust and suitable for real-time implementations.
Semi Automatic Generation of Didactic Resources from Existing Documents
Authors: Mikel Larrañaga, Jon A. Elorriaga, Ana Arruarte
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Tools for generating learning material in automatic or semiautomatic way are needed in order to lighten the development of Computer Supported Learning Systems. This paper describes an approach to semi automatic generation of didactic resources from electronic documents using ontologies and Natural Language Processing techniques.
Optimal routing for wireless mesh networks with dynamic traffic demand
Authors: Liang Dai, Yuan Xue, Bin Chang, Yanchuan Cao, Yi Cui
Venue: Mobile Networks and Applications (2008)

Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broad-band Internet access. Traffic routing plays a critical role in determining the performance of a wireless mesh network. To investigate the best routing solution, existing work proposes to formulate the mesh network routing problem as an optimization problem. In this problem formulation, traffic demand is usually implicitly assumed as static and known a priori. Contradictorily, recent studies of wireless network traces show that the traffic demand, even being aggregated at access points, is highly dynamic and hard to estimate. Thus, in order to apply the optimization-based routing solution into practice, one must take into account the dynamic and unpredictable nature of wireless traffic demand. This paper presents an integrated framework for wireless mesh network routing under dynamic traffic demand. This framework consists of two important components: traffic estimation and routing optimization. By studying the traces collected at wireless access points, we first present a traffic estimation method which predicts future traffic demand based on its historical data using time-series analysis. This method provides not only the mean value of the future traffic demand estimation but also its statistical distribution. We further investigate the optimal routing strategies for wireless mesh network which take these two forms of traffic demand estimations as inputs. The goal is to balance the traffic load so that minimum congestion will be incurred. This routing objective could be transformed into the throughput optimization problem where the throughput of aggregated flows is maximized subject to fairness constraints that are weighted by the traffic demands. Based on linear programming, we present two routing algorithms which consider the mean value and the statistical distribution of the predicted traffic demands, respectively. The trace-driven simulation study demonstrates that our integrated traffic estimation and routing optimization framework can effectively incorporate the traffic dynamics in mesh network routing.
Fuzzy time series model based on probabilistic approach and rough set rule induction for empirical research in stock markets
Authors: Hia Jong Teoh, Ching-Hsue Cheng, Hsing-Hui Chu, Jr-Shian Chen
Venue: Data Knowledge Engineering (2008)

This study proposes a hybrid fuzzy time series model with two advanced methods, cumulative probability distribution approach (CPDA) and rough set rule induction, to forecast stock markets. To improve forecasting accuracy, three refining processes of fuzzy time series are provided in the proposed model: (1) using CPDA to discretize the observations in training datasets based on the characteristics of data distribution, (2) generating rules (fuzzy logical relationships) by rough set algorithm and (3) producing forecasting results based on rule support values from rough set algorithm. To verify the forecasting performance of the proposed model in detail, two empirical stock markets (TAIEX and NYSE) are used as evaluating databases; two other methodologies, proposed by Chen and Yu, are used as comparison models, and two different evaluation methods (moving windows) are used. The proposed model shows a greatly improved performance in stock market forecasting compared to other fuzzy time series models.
Empirical evaluation of analogy-x for software cost estimation
Authors: Jacky Keung
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

This paper reports on the empirical evaluation of a novel approach called Analogy-X, which is an extension to the classical analogy-based software cost estimation. The Analogy-X approach is a set of procedures that utilize the principles of the Mantel randomization test to provide inferential statistics to Analogy. Our previous studies have clearly demonstrated the novelty and effectiveness of this technique. This paper provides further empirical evaluation of Analogy-X using different kinds of datasets. Our results show that the prediction accuracy of Analogy-X is similar to the one of ANGEL. Analogy-X has the additional advantage of allowing the use of Mantel statistics to select project features and detect abnormal data points, which provides a sound statistical basis for analogy-based systems.
Optimal Cue Combination for Saliency Computation: A Comparison with Human Vision
Authors: Alexandre Bur, Heinz Hügli
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)

The computer model of visual attention derives an interest or saliency map from an input image in a process that encompasses several data combination steps. While several combination strategies are possible, not all perform equally well. This paper compares main cue combination strategies by measuring the performance of the considered models with respect to human eye movements. Six main combination methods are compared in experiments involving the viewing of 40 images by 20 observers. Similarity is evaluated qualitatively by visual tests and quantitatively by use of a similarity score. The study provides insight into the map combination mechanisms and proposes in this respect an overall optimal strategy for a computer saliency model.
Applying Public-Key Watermarking Techniques in Forensic Imaging to Preserve the Authenticity of the Evidence
Authors: Wen-Chao Yang, Che-Yen Wen, Chung-Hao Chen
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

The traditional verifying evidence method in court is to check the integrity of the chain of custody of evidence. However, since the digital image can be easily transferred by Internet, it is not easy for us to keep the integrity of the chain of custody.In this article, we use the PKI (Public-Key Infrastructure), Public-Key Cryptography and watermark techniques to design a novel testing and verifying method of digital images. The main strategy of the article is to embed encryption watermarks in the least significant bit (LSB) of digital images. With the designed method, we can check the integrity of digital images by correcting public-key without side information and protecting the watermarks without tampering or forging, even the embedded method is open. Finally the proposed method can be applied in court to digital evidence testing and verification, and used to check the admissibility of digital image.
Towards Modelling Obligations in Event-B
Authors: Juan Bicarregui, Alvaro Arenas, Benjamin Aziz, Philippe Massonet, Christophe Ponsard
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

We propose a syntactic extension of Event-B incorporating a limited notion of obligation described by triggers. The trigger of an event is the dual of the guard: when a guard is not true, an event must not occur, whereas when a trigger is true, the event must occur. The obligation imposed by a trigger is interpreted as a constraint on when the other events are permitted. For example, the simplest trigger next, which states that the event must be the next one to be executed when the trigger becomes true, is modelled as an extra guard on each of the other events which prohibits their execution at this time. In this paper we describe the modelling of triggers in Event-B, and analyse refinement and abstract scheduling of triggered events.
Modeling Permutations in Coq for Coccinelle
Authors: Evelyne Contejean
Venue: Rewriting, Computation and Proof: Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday (2007)

In this paper we present the part of the Coccinelle library which deals with list permutations. Indeed permutations naturally arise when formally modeling rewriting in Coq, for instance RPO with multiset status and equality modulo AC. Moreover the needed permutations are up to an equivalence relation, and may be used to inductively define the same relation (equivalence modulo RPO). This is why we introduce the notion of permutation w. r. t. an arbitrary relation. The advantages of our approach are a very simple inductive definition (with only 2 constructors), the adequacy with the mathematical definition, the ability to define a relation using recursively permutations up to this very relation, and a fine grained modularity (if R enjoys a property, so does permut R).
Definability in the Homomorphic Quasiorder of Finite Labeled Forests
Authors: Oleg V. Kudinov, Victor L. Selivanov
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We prove that for any k &ge; 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowed as parameters. As corollaries, we show that the structure is atomic and characterize the automorphism group of the structure. Similar results hold true for two other relevant structures: the homomorphic quasiorder of finite k-labeled trees, and of finite k-labeled trees with a fixed label of the root element.
Norm Conflicts and Inconsistencies in Virtual Organisations
Authors: Martin J. Kollingbaum, Timothy J. Norman, Alun Preece, Derek Sleeman
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)

Organisation-oriented approaches to the formation of multi-agent systems use roles and norms to describe an agent's social position within an artificial society or Virtual Organisation. Norms are descriptive information for a role --- they determine the obligations and social constraints for an agent's actions. A legal instrument for establishing such norms are contracts signed by agents when they adopt one or more roles. A common problem in open Virtual Organisations is the occurrence of conflicts between norms --- agents may sign different contracts with conflicting norms or organisational changes may revoke permissions or enact dormant obligations. Agents that populate such Virtual Organisations can remain operational only if they are able to resolve such conflicts. In this paper, we discuss, how agents can identify these conflicts and resolve them.
A Parallel Implementation of Particle Tracking with Space Charge Effects on an Intel iPSC/860
Authors: L. Chang, G. Bourianoff, B. Cole, S. Machida
Venue: Scientific Programming (1993)

Particle-tracking simulation is one of the scientific applications that is well suited to parallel computations. At the Superconducting Super Collider, it has been theoretically and empirically demonstrated that particle tracking on a designed lattice can achieve very high parallel efficiency on a MIMD Intel iPSC/860 machine. The key to such success is the realization that the particles can be tracked independently without considering their interaction. The perfectly parallel nature of particle tracking is broken if the interaction effects between particles are included. The space charge introduces an electromagnetic force that will affect the motion of tracked particles in three-dimensional (3-D) space. For accurate modeling of the beam dynamics with space charge effects, one needs to solve 3-D Maxwell field equations, usually by a particle-in-cell (PIC) algorithm. This will require each particle to communicate with its neighbor grids to compute the momentum changes at each time step. It is expected that the 3-D PIC method will degrade parallel efficiency of particle-tracking implementation on any parallel computer. In this paper, we describe an efficient scheme for implementing particle tracking with space charge effects on an INTEL iPSC/860 machine. Experimental results show that a parallel efficiency of 75% can be obtained.
A Framework for Adaptive and Integrated Classification
Authors: Ireneusz Czarnowski, Piotr Jedrzejowicz
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

This paper focuses on classification tasks. The goal of the paper is to propose a framework for adaptive and integrated machine classification and to investigate the effect of different adaptation and integration schemes. After having introduced several integration and adaptation schemes a framework for adaptive and integrated classification in the form of the software shell is proposed. The shell allows for integrating data pre-processing with data mining stages using population-based and A-Team techniques. The approach was validated experimentally. Experiment results have shown that integrated and adaptive classification outperforms traditional approaches.
Newton-type methods for REML estimation in genetic analysis of quantitative traits
Authors: Kateryna Mishchenko, Sverker Holmgren, Lars Rönnegård
Venue: Journal of Computational Methods in Sciences and Engineering (2008)

Robust and efficient optimization methods for variance component estimation using Restricted Maximum Likelihood (REML) models for genetic mapping of quantitative traits are considered. We show that the standard Newton-AI scheme may fail when the optimum is located at one of the constraint boundaries, and we introduce different approaches to remedy this by taking the constraints into account. We approximate the Hessian of the objective function using the average information matrix and also by using an inverse BFGS formula. The robustness and efficiency is evaluated for problems derived from two experimental data from the same animal populations.
From the Editors: Computational Science and Pathological Science
Authors: Francis Sullivan
Venue: Computing in Science and Engineering (2004)

Every now and then, a peculiar kind of news story appears about some scientific topic. On first reading, it looks like "startling new results or "the answer to everything about some perpetually hot topic, such as the age of the universe, the origin of mankind, or the best diet for a healthy life. One characteristic all these examples share is that they fade quickly, only to be replaced by a new ultimate answer. Sometimes rather than fading, the thrilling discovery has a second life in checkout line tabloids. A few of these items are hoaxes, some are merely consequences of over-enthusiasm about preliminary results, but many are honest mistakes carried to the point of pathology.
A Combined Ant Colony and Differential Evolution Feature Selection Algorithm
Authors: Rami N. Khushaba, Ahmed Al-Ani, Akram Alsukker, Adel Al-Jumaily
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

Feature selection is an important step in many pattern recognition systems that aims to overcome the so-called curse of dimensionality problem. Although Ant Colony Optimization (ACO) proved to be a powerful technique in different optimization problems, but it still needs some improvements when applied to the feature selection problem. This is due to the fact that it builds its solutions sequentially, where in feature selection this behavior will most likely not lead to the optimal solution. In this paper, a novel feature selection algorithm based on a combination of ACO and a simple, yet powerful, Differential Evolution (DE) operator is presented. The proposed combination enhances both the exploration and exploitation capabilities of the search procedure. The new algorithm is tested on two biosignal-driven applications. The performance of the proposed algorithm is compared with other dimensionality reduction techniques to prove its superiority.
Open Implication
Authors: Karin Greimel, Roderick Bloem, Barbara Jobstmann, Moshe Vardi
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We argue that the usual trace-based notions of implication and equivalence for linear temporal logics are too strong and should be complemented by the weaker notions of open implication and open equivalence. Although open implication is harder to compute, it can be used to advantage both in model checking and in synthesis. We study the difference between trace-based equivalence and open equivalence and describe an algorithm to compute open implication of Linear Temporal Logic formulas with an asymptotically optimal complexity. We also show how to compute open implication while avoiding Safra's construction. We have implemented an open-implication solver for Generalized Reactivity(1) specifications. In a case study, we show that open equivalence can be used to justify the use of an alternative specification that allows us to synthesize much smaller systems in far less time.
Optional and Iterated Types for Pregroup Grammars
Authors: Denis Béchet, Alexander Dikovsky, Annie Foret, Emmanuelle Garel
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

Pregroup grammars are a context-free grammar formalism which may be used to describe the syntax of natural languages. However, this formalism is not able to naturally define types corresponding to optional and iterated arguments such as optional complements of verbs or verbs' adverbial modifiers. This paper introduces two constructions that make up for this deficiency.
Large-Scale Network Monitoring for Visual Analysis of Attacks
Authors: Fabian Fischer, Florian Mansmann, Daniel A. Keim, Stephan Pietzko, Marcel Waldvogel
Venue: Proceedings of the 5th international workshop on Visualization for Computer Security (2008)

The importance of the Internet and our dependency on computer networks are steadily growing, which results in high costs and substantial consequences in case of successful intrusions, stolen data, and interrupted services. At the same time, a trend towards massive attacks against the network infrastructure is noticeable. Therefore, monitoring large networks has become an important field in practice and research. Through monitoring systems, attacks can be detected and analyzed to gain knowledge of how to better protect the network in the future. In the scope of this paper, we present a system to analyze NetFlow data using a relational database system. NetFlow records are linked with alerts from an intrusion detection system to enable efficient exploration of suspicious activity within the monitored network. Within the system, the monitored network is mapped to a TreeMap visualization, the attackers are arranged at the borders and linked using splines parameterized with prefix information. In a series of case studies, we demonstrate how the tool can be used to judge the relevance of alerts, to reveal massive distributed attacks, and to analyze service usage within a network.
A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm
Authors: Peter Beelen, Tom Høholdt
Venue: Proceedings of the 2nd international Castle meeting on Coding Theory and Applications (2008)

Let $\mathbb{F}_q$ be a finite field with q elements and $C \subset \mathbb{F}_q^n$ a code of length n. If c ¿ C and h = (h 1 h 2 ¿ h n ) is a row of a parity check matrix of C, then it is clear that h ·c = 0. Such parity checks can therefore be used to test if a given word $w \in \mathbb{F}_q^n$ is an element of C, but it turns out that the expressions h ·w (usually called syndromes of w) can be useful in decoding algorithms as well. The link between decoding and syndromes is an old one. Indeed the first known algorithm for the decoding of Reed-Solomon codes (Peterson's algorithm) uses syndromes. Now let ${\mathcal P}=\{x_1,\dots,x_n\}$ be a subset of $\mathbb{F}_q$ consisting of n distinct elements. We can see an RS-code of dimension k ≤ n as the set of all n-tuples that arise by evaluating all polynomial f(x) of degree less than or equal to k ¿ 1 in the points x 1,...,x n .