ppxscal/embedding_network huggingface dataset:
Neural projection techniques for the visual inspection of network traffic
Authors: Álvaro Herrero, Emilio Corchado, Paolo Gastaldo, Rodolfo Zunino
Venue: Neurocomputing (2009)

A crucial aspect in network monitoring for security purposes is the visual inspection of the traffic pattern, mainly aimed to provide the network manager with a synthetic and intuitive representation of the current situation. Towards that end, neural projection techniques can map high-dimensional data into a low-dimensional space adaptively, for the user-friendly visualization of monitored network traffic. This work proposes two projection methods, namely, cooperative maximum likelihood Hebbian learning and auto-associative back-propagation networks, for the visual inspection of network traffic. This set of methods may be seen as a complementary tool in network security as it allows the visual inspection and comprehension of the traffic data internal structure. The proposed methods have been evaluated in two complementary and practical network-security scenarios: the on-line processing of network traffic at packet level, and the off-line processing of connection records, e.g. for post-mortem analysis or batch investigation. The empirical verification of the projection methods involved two experimental domains derived from the standard corpora for evaluation of computer network intrusion detection: the MIT Lincoln Laboratory DARPA dataset.
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Authors: Denis Lugiez
Venue: Proceedings of the 3rd International Workshop on Reachability Problems (2009)

Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the set of successors of a regular set of configurations can be non-regular, making forward analysis of these models difficult. We refine the model by adding the associative-commutative properties of parallel composition, and we define Presburger weighted tree automata, an extension of weighted automata and tree automata, that accept the set of successors of a regular set of configurations. This allows forward analysis of PDN since these automata have a decidable emptiness problem and are closed under intersection.
An Effective Approach for Cascading Effects Prevision in Critical Infrastructures
Authors: Luisa Franchina, Marco Carbonelli, Laura Gratta, Claudio Petricca, Daniele Perucchini
Venue: Critical Information Infrastructure Security: Third International Workshop, CRITIS 2008, Rome, Italy, October13-15, 2008. Revised Papers (2009)

The recent dramatic experiences caused by natural or man-made disasters make mandatory to understand and manage the mutual dependency of those infrastructures that, if disrupted or destroyed, would seriously compromise our quality of life. Although many models have been developed to study particular contexts and single infrastructure sectors, a global strategy to represent and manage the complex issue of infrastructure dependency has not been deployed yet. This paper presents an heuristic approach that can be applied, on several different scales, to select Critical Infrastructures and to model dependencies, thus paving the way for cascading effects prevention and governance.
N-gram weighting: reducing training data mismatch in cross-domain language model estimation
Authors: Bo-June (Paul) Hsu, James Glass
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

In domains with insufficient matched training data, language models are often constructed by interpolating component models trained from partially matched corpora. Since the n-grams from such corpora may not be of equal relevance to the target domain, we propose an n-gram weighting technique to adjust the component n-gram probabilities based on features derived from readily available segmentation and metadata information for each corpus. Using a log-linear combination of such features, the resulting model achieves up to a 1.2% absolute word error rate reduction over a linearly interpolated baseline language model on a lecture transcription task.
Multilingual grammar resources in multilingual application development
Authors: Marianne Santaholma
Venue: Proceedings of the Workshop on Grammar Engineering Across Frameworks (2008)

Grammar development makes up a large part of the multilingual rule-based application development cycle. One way to decrease the required grammar development efforts is to base the systems on multilingual grammar resources. This paper presents a detailed description of a parametrization mechanism used for building multilingual grammar rules. We show how these rules, which had originally been designed and developed for typologically different languages (English, Japanese and Finnish) are applied to a new language (Greek). The developed shared grammar system has been implemented for a domain specific speech-to-speech translation application. A majority of these rules (54%) are shared amongst the four languages, 75% of the rules are shared for at least two languages. The main benefit of the described approach is shorter development cycles for new system languages.
Voting: A View through the Algorithmic Lens
Authors: Edith Elkind
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

In recent years, voting and elections have been actively studied by computer scientists, both because of their interesting algorithmic properties and due to their potential applications to the design of multiagent systems and e-commerce. In this talk, I will give an overview of several recent developments in the nascent area of computational social choice and discuss their relevance to the use of voting in practical e-commerce applications.
Model-Based Verification of Automotive Control Software
Authors: Rance Cleaveland
Venue: Formal Methods for Industrial Critical Systems: 13th International Workshop, FMICS 2008, L'Aquila, Italy, September 15-16, 2008, Revised Selected Papers (2009)

This talk will report on the use of an approach, called Instrumentation Based Verification, for checking the correctness of models of control software given in Simulink® and Stateflow®. In IBV, engineers formalize requirements as so-called monitor models, whose purpose is to search executions of the main controller model for violations of required behavior. Testing is then performed on the instrumented controller model in order to check for the possibility of deviations between controller and requirements. Tools such as Reactis® provide automated support for conducting these activities, and the technique has attracted interest in automotive, aerospace and medical-device settings. The presentation will first review model-based development and IBV and their industrial motivations. It will then report on a project between the Fraunhofer Center for Experimental Software Engineering and a major automotive supplier on using IBV to verify models of an exterior-lighting control system. 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
Testing Topologies for the Evaluation of IPSEC Implementations
Authors: Fernando Sánchez-Chaparro, José M. Sierra, Oscar Delgado-Mohatar, Amparo Fúster-Sabater
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

The use of virtual private networks (VPNs) for the communications protection is becoming increasingly common. Likewise, the IPSEC architecture has been gaining ground and, at present, is the solution more used for this purpose. That is the reason why a large number of implementations of IPSEC have been created and put into operation. This work proposes three testing topologies to carry out IPSEC implementation assessment, each of these scenarios will supply an important guide for the determination of objectives, digital evidences to collect and test batteries to develop, in any evaluation of a IPSEC device.
TEXTAL™: automated crystallographic protein structure determination
Authors: Kreshna Gopal, Tod Romo, Erik Mckee, Kevin Childs, Lalji Kanbi, Reetal Pai, Jacob Smith, James Sacchettini, Thomas Ioerger
Venue: Proceedings of the 17th conference on Innovative applications of artificial intelligence - Volume 3 (2005)

This paper reports on TEXTAL™, a deployed application that uses a variety of AI techniques to automate the process of determining the 3D structure of proteins by x-ray crystallography. The TEXTAL™ project was initiated in 1998, and the application is currently deployed in three ways: (1) a web-based interface called WebTex, operational since June 2002; (2) as the automated model-building component of an integrated crystallography software called PHENIX, first released in July 2003; (3) binary distributions, available since September 2004. TEXTAL™ and its sub-components are currently being used by crystallographers around the world, both in the industry and in academia. TEXTAL™ saves up to weeks of effort typically required to determine the structure of one protein; the system has proven to be particularly helpful when the quality of the data is poor, which is very often the case. Automated protein modeling systems like TEXTAL™ are critical to the structural genomics initiative, a worldwide effort to determine the 3D structure of all proteins in a high-throughput mode, thereby keeping up with the rapid growth of genomic sequence databases.
Measuring MWE compositionality using semantic annotation
Authors: Scott S. L. Piao, Paul Rayson, Olga Mudraya, Andrew Wilson, Roger Garside
Venue: Proceedings of the Workshop on Multiword Expressions: Identifying and Exploiting Underlying Properties (2006)

This paper reports on an experiment in which we explore a new approach to the automatic measurement of multi-word expression (MWE) compositionality. We propose an algorithm which ranks MWEs by their compositionality relative to a semantic field taxonomy based on the Lancaster English semantic lexicon (Piao et al., 2005a). The semantic information provided by the lexicon is used for measuring the semantic distance between a MWE and its constituent words. The algorithm is evaluated both on 89 manually ranked MWEs and on McCarthy et al's (2003) manually ranked phrasal verbs. We compared the output of our tool with human judgments using Spearman's rank-order correlation coefficient. Our evaluation shows that the automatic ranking of the majority of our test data (86.52%) has strong to moderate correlation with the manual ranking while wide discrepancy is found for a small number of MWEs. Our algorithm also obtained a correlation of 0.3544 with manual ranking on McCarthy et al's test data, which is comparable or better than most of the measures they tested. This experiment demonstrates that a semantic lexicon can assist in MWE compositionality measurement in addition to statistical algorithms.
Fast Reroute upon Multi-homed Domains Link Failures
Authors: Hailong Ma, Yunfei Guo, Jianwei Zhang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

As more and more mission critical services emerge on the Internet, there is a growing demand for the Internet to provide stringent service availability and reliability. More and more domains adopt multi-homed connection to expect increasing reliability. But the de facto inter-domain protocol — BGP spends a long period to converge to another stable state when one of the links of multi-homed domain fails. The delayed convergence of BGP deteriorates the performance of time stringent services. In this paper, we propose a fast reroute approach, called Fremd, to react quickly to multi-homed domain link failures so as to perform non-stop routing. Through simulation we demonstrate that Fremd is more resilient to multi-homed domain link failures and the scale of exchanged messages and route table size due to the deployment of Fremd is acceptable.
Increasing Capacity Exploitation in Food Supply Chains Using Grid Concepts
Authors: Eugen Volk, Marcus Müller, Ansger Jacob, Peter Racz, Martin Waldburger
Venue: Proceedings of the 6th International Workshop on Grid Economics and Business Models (2009)

Food supply chains today are characterized by fixed trade relations with long term contracts established between heterogeneous supply chain companies. Production and logistics capacities of these companies are often utilized in an economically inefficient manner only. In addition, increased consumer awareness in food safety issues renders supply chain management even more challenging, since integrated tracking and tracing along the whole food supply chain is needed. Facing these issues of supply chain management complexity and completely documented product quality, this paper proposes a full lifecycle solution for dynamic capacity markets based on concepts used in the field of Grid [1], like management of Virtual Organization (VO) combined with Service Level Agreement (SLA). The solution enables the cost-efficient utilization of real world capacities (e.g., production capacities or logistics facilities) by using a simple, browser-based portal. Users are able to enter into product-specific negotiations with buyers and suppliers of a food supply chain, and to obtain real-time access to product information including SLA evaluation reports. Thus, business opportunities in wider market access, process innovation, and trustworthy food products are offered for participating supply chain companies.
Substructural Operational Semantics as Ordered Logic Programming
Authors: Frank Pfenning, Robert J. Simmons
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. Exploiting higher-order terms in this metalanguage, we specify the operational semantics of a number of object language features, such as call-by-value, call-by-name, call-by-need, mutable store, parallelism, communication, exceptions and continuations. The specifications exhibit a high degree of uniformity and modularity that allows us to analyze the structural properties required for each feature in isolation. Our substructural framework thereby provides a new methodology for language specification that synthesizes structural operational semantics, abstract machines, and logical approaches.
Pulling their weight: exploiting syntactic forms for the automatic identification of idiomatic expressions in context
Authors: Paul Cook, Afsaneh Fazly, Suzanne Stevenson
Venue: Proceedings of the Workshop on a Broader Perspective on Multiword Expressions (2007)

Much work on idioms has focused on type identification, i.e., determining whether a sequence of words can form an idiomatic expression. Since an idiom type often has a literal interpretation as well, token classification of potential idioms in context is critical for NLP. We explore the use of informative prior knowledge about the overall syntactic behaviour of a potentially-idiomatic expression (type-based knowledge) to determine whether an instance of the expression is used idiomatically or literally (token-based knowledge). We develop unsupervised methods for the task, and show that their performance is comparable to that of state-of-the-art supervised techniques.
Modeling and Forecast of Operating Capability of Chinese Logistics Industry
Authors: Wang Li-ping
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

The sustainable and rapid development of Chinese economy objectively brings forward new requirements for operating capability and development potential of Chinese logistics industry. Under the background, the paper used advance neural network method to establish a decision-making model of operating capability of Chinese logistics industry, and made efficient examining through real logistics data. The result proved that the model could better forecast the operating demand of logistics industry, and provide scientific decision-making reference for high efficient logistics resource allocation.
From reaction-diffusion to Physarum computing
Authors: Andrew Adamatzky
Venue: Natural Computing: an international journal (2009)

We experimentally demonstrate that computation of spanning trees and implementation of general purpose storage-modification machines can be executed by a vegetative state of the slime mold Physarum polycephalum. We advance theory and practice of reaction-diffusion computing by studying a biological model of reaction-diffusion encapsulated in a membrane.
Edge Detection Free Postprocessing for Pseudospectral Approximations
Authors: Scott A. Sarra
Venue: Journal of Scientific Computing (2009)

Pseudospectral Methods based on global polynomial approximation yield exponential accuracy when the underlying function is analytic. The presence of discontinuities destroys the extreme accuracy of the methods and the well-known Gibbs phenomenon appears. Several types of postprocessing methods have been developed to lessen the effects of the Gibbs phenomenon or even to restore spectral accuracy. The most powerful of the methods require that the locations of the discontinuities be precisely known. In this work we discuss postprocessing algorithms that are applicable when it is impractical, or difficult, or undesirable to pinpoint all discontinuity locations.
One Graph Is Worth a Thousand Logs: Uncovering Hidden Structures in Massive System Event Logs
Authors: Michal Aharon, Gilad Barash, Ira Cohen, Eli Mordechai
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

In this paper we describe our work on pattern discovery in system event logs. For discovering the patterns we developed two novel algorithms. The first is a sequential and efficient text clustering algorithm which automatically discovers the templates generating the messages. The second, the PARIS algorithm (Principle Atom Recognition In Sets), is a novel algorithm which discovers patterns of messages that represent processes occurring in the system. We demonstrate the usefulness of our analysis, on real world logs from various systems, for debugging of complex systems, efficient search and visualization of logs and characterization of system behavior.
A reputation system for selling human computation
Authors: Trevor Burnham, Rahul Sami
Venue: Proceedings of the ACM SIGKDD Workshop on Human Computation (2009)

We describe a reputation-driven market that motivates human computation sellers (workers) to produce optimal levels of quality when quality is not immediately measurable and contracts specifying the level of quality cannot be enforced. We consider the implications of making quality instantaneously verifiable up to a known threshold ("partial verification"), as might be the case when the market maker possesses a sufficiently advanced artificial intelligence apparatus. We find that such a verification system allows the market to attain a Pareto optimal equilibrium with less patient workers, and, in addition, makes the market more resistant to pseudonym attacks.
Multivariate High-Dimensional Cortical Folding Analysis, Combining Complexity and Shape, in Neonates with Congenital Heart Disease
Authors: Suyash P. Awate, Paul Yushkevich, Zhuang Song, Daniel Licht, James C. Gee
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

The paper presents a novel statistical framework for cortical folding pattern analysis that relies on a rich multivariate descriptor of folding patterns in a region of interest (ROI). The ROI-based approach avoids problems faced by spatial-normalization-based approaches stemming from the severe deficiency of homologous features between typical human cerebral cortices. Unlike typical ROI-based methods that summarize folding complexity or shape by a single number, the proposed descriptor unifies complexity and shape of the surface in a high-dimensional space. In this way, the proposed framework couples the reliability of ROI-based analysis with the richness of the novel cortical folding pattern descriptor. Furthermore, the descriptor can easily incorporate additional variables, e.g. cortical thickness. The paper proposes a novel application of a nonparametric permutation-based approach for statistical hypothesis testing for any multivariate high-dimensional descriptor. While the proposed framework has a rigorous theoretical underpinning, it is straightforward to implement. The framework is validated via simulated and clinical data. The paper is the first to quantitatively evaluate cortical folding in neonates with complex congenital heart disease.
Investigation on the Respiratory Airflow in Human Airway by PIV
Authors: S. K. Kim, S. K. Chung
Venue: Journal of Visualization (2009)

The creation of the accurate transparent flow passage is essential to analyze the flow inward a geometrically complex flow passage like human airway by PIV. We established the procedure to create a transparent box containing a model of the human airway for PIV measurements. A flow passage includes the whole human upper airway, nasal cavities, larynx, trachea, and 2 generations of bronchi. The phase averaged mean and RMS velocity distributions in sagittal and coronal planes are obtained for 7 phases in a respiratory period by tomographic PIV. Some physiologic conjectures are obtained. The main stream went through the backside of larynx and trachea in inspiration and the frontal side in expiration.
Fragile Watermarking Scheme with Extensive Content Restoration Capability
Authors: Xinpeng Zhang, Shuozhong Wang, Guorui Feng
Venue: Proceedings of the 8th International Workshop on Digital Watermarking (2009)

This paper proposes a novel fragile watermarking scheme capable of recovering the original principal content in extensive areas. The watermark data are made up of two parts: reference-bits derived from the principal content of the host image and containing some necessary redundancy, and hash-bits matching the content of local blocks. While the reference-bits are embedded into the entire host image, the hash-bits are embedded into the local blocks. On the authentication side, after identifying the tampered areas, the watermark data extracted from the reserved regions can provide sufficient information to restore the principal content of host image even when the rate of tampered blocks is large.
Research of Bidirectional Bending Spline Based on Multi-intelligence Agents
Authors: Zhang Jun-cai, Chen Qing-guo
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

The cold-bending formation in metal is a process which is the ge ometry non-linear and material nonlinear. Aiming at the above idea, this thesis establishes strip characteristic nodal line method and simplifies boundary condition based on the spline finite strip method in designing pass structrure. Theory system of Agent is established, which combines theory research with practice engineering. At the same time, according to specialist experience, a new special system was established which can modify Agent knowledge container by environment changing. The work of this thesis will be theoretically and practically beneficial to designing roller pass.