ppxscal/embedding_network huggingface dataset:
Information Processing and the Recovery of Argument Structure Asymmetries
Authors: Anna Maria Di Sciullo
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

This paper discusses argument structure asymmetries observed in linguistic expressions, and presents the main features of a parser that recovers them incrementally. It is argued that the recovery of argument structure asymmetries, expressed in terms of the asymmetric c-command relation, is crucial in Information Retrieval and Question Answering. A consequence is drawn for efficient software design.
Agent organization in the knowledge plane
Authors: Karen R. Sollins
Venue:  (2008)

In designing and building a network like the Internet, we continue to face the problems of scale and distribution. With the dramatic expansion in scale and heterogeneity of the Internet, network management has become an increasingly difficult task. Furthermore, network applications often need to maintain efficient organization among the participants by collecting information from the underlying networks. Such individual information collection activities lead to duplicate efforts and contention for network resources. The Knowledge Plane (KP) is a new common construct that provides knowledge and expertise to meet the functional, policy and scaling requirements of network management, as well as to create synergy and exploit commonality among many network applications. To achieve these goals, we face many challenging problems, including widely distributed data collection, efficient processing of that data, wide availability of the expertise, etc. In this thesis, to provide better support for network management and large-scale network applications, I propose a knowledge plane architecture that consists of a network knowledge plane (NetKP) at the network layer, and on top of it, multiple specialized KPs (spec-KPs). The NetKP organizes agents to provide valuable knowledge and facilities about the Internet to the spec-KPs. Each spec-KP is specialized in its own area of interest. In both the NetKP and the spec-KPs, agents are organized into regions based on different sets of constraints. I focus on two key design issues in the NetKP: (1) a region-based architecture for agent organization, in which I design an efficient and non-intrusive organization among regions that combines network topology and a distributed hash table; (2) request and knowledge dissemination, in which I design a robust and efficient broadcast and aggregation mechanism using a tree structure among regions. In the spec-KPs, I build two examples: experiment management on the PlanetLab testbed and distributed intrusion detection on the DETER testbed. The experiment results suggest a common approach driven by the design principles of the Internet and more specialized constraints can derive productive organization for network management and applications. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
A Human Resource Model and Evidence Based Evaluation--Ontology for IT Skill Standards --
Authors: Kazuhisa Seta, Mitsuru Ikeda, Kenji Hirata, Yusuke Hayashi, Ken Kuriyama
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

Putting the right person in the right post and planning human resource development (human resource management: HRM) are important decision making tasks for managing company. The basis for HRM is the accurate grasp of the competency of human resources as intellectual capital. Our research goals are (i) to carefully elucidate the principle criteria for HR assessment and systemize them as an ontology, and (ii) to create a human resource and KSAOs model based on the ontology. This paper introduces our ontological approach to realize those goals.
Computing confidence scores for all sub parse trees
Authors: Feng Lin, Fuliang Weng
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

Computing confidence scores for applications, such as dialogue system, information retrieving and extraction, is an active research area. However, its focus has been primarily on computing word-, concept-, or utterance-level confidences. Motivated by the need from sophisticated dialogue systems for more effective dialogs, we generalize the confidence annotation to all the subtrees, the first effort in this line of research. The other contribution of this work is that we incorporated novel long distance features to address challenges in computing multi-level confidence scores. Using Conditional Maximum Entropy (CME) classifier with all the selected features, we reached an annotation error rate of 26.0% in the SWBD corpus, compared with a subtree error rate of 41.91%, a closely related benchmark with the Charniak parser from (Kahn et al., 2005).
Machine Learning Framework for Classification in Medicine and Biology
Authors: Eva K. Lee
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

Systems modeling and quantitative analysis of large amounts of complex clinical and biological data may help to identify discriminatory patterns that can uncover health risks, detect early disease formation, monitor treatment and prognosis, and predict treatment outcome. In this talk, we describe a machine-learning framework for classification in medicine and biology. It consists of a pattern recognition module, a feature selection module, and a classification modeler and solver. The pattern recognition module involves automatic image analysis, genomic pattern recognition, and spectrum pattern extractions. The feature selection module consists of a combinatorial selection algorithm where discriminatory patterns are extracted from among a large set of pattern attributes. These modules are wrapped around the classification modeler and solver into a machine learning framework. The classification modeler and solver consist of novel optimization-based predictive models that maximize the correct classification while constraining the inter-group misclassifications. The classification/predictive models 1) have the ability to classify any number of distinct groups; 2) allow incorporation of heterogeneous, and continuous/time-dependent types of attributes as input; 3) utilize a high-dimensional data transformation that minimizes noise and errors in biological and clinical data; 4) incorporate a reserved-judgement region that provides a safeguard against over-training; and 5) have successive multi-stage classification capability. Successful applications of our model to developing rules for gene silencing in cancer cells, predicting the immunity of vaccines, identifying the cognitive status of individuals, and predicting metabolite concentrations in humans will be discussed. We acknowledge our clinical/biological collaborators: Dr. Vertino (Winship Cancer Institute, Emory), Drs. Pulendran and Ahmed (Emory Vaccine Center), Dr. Levey (Neurodegenerative Disease and Alzheimer's Disease), and Dr. Jones (Clinical Biomarkers, Emory).
Approximate structure preserving semantic matching
Authors: Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNeill, Pavel Shvaiko, Juan Pane, Paolo Besana
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, e.g., between concepts in two ontologies. However, there are applications, such as web service integration, where we may need to establish whether full graph structures correspond to one another globally, preserving certain structural properties of the graphs being considered. The goal of this paper is to provide a new matching operation, called structure preserving matching. This operation takes two graph-like structures and produces a set of correspondences between those nodes of the graphs that correspond semantically to one another, (i) still preserving a set of structural properties of the graphs being matched, (ii) only in the case if the graphs are globally similar to one another. We present a novel approximate structure preserving matching approach that implements this operation. It is based on a formal theory of abstraction and on a tree edit distance measure. We have evaluated our solution with encouraging results.
Urban Road Network Modeling and Real-Time Prediction Based on Householder Transformation and Adjacent Vector
Authors: Shuo Deng, Jianming Hu, Yin Wang, Yi Zhang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

This paper put forward a multivariate one-order-regression single road link model based on the algorithm of Householder Transformation to reduce the computation complexity in real-time prediction and to facilitate the study on network turn-ratio pattern evolution. Then the paper analyses the limitation of current urban road network model based on adjacent matrix and contributed a novel model based on new memory strategy aiming at reduce the memory space occupied by adjacent matrix, carrying turn movement information in the storage and avoiding redundant calculation. To verify the new modeling method, the study involved in a field work on part of urban network in Beijing, China. In conclusion, the new modeling methods in this paper enhanced the performance of urban road modeling.
Kirchhoff index of composite graphs
Authors: Heping Zhang, Yujun Yang, Chuanwen Li
Venue: Discrete Applied Mathematics (2009)

Let G"1+G"2, G"1@?G"2 and G"1{G"2} be the join, corona and cluster of graphs G"1 and G"2, respectively. In this paper, Kirchhoff index formulae of these composite graphs are given.
Security Monitoring, 1st edition
Authors: Chris Fry, Martin Nystrom
Venue:  (2009)

How well does your enterprise stand up against today's sophisticated security threats? In this book, security experts from Cisco Systems demonstrate how to detect damaging security incidents on your global network--first by teaching you which assets you need to monitor closely, and then by helping you develop targeted strategies and pragmatic techniques to protect them. Security Monitoring is based on the authors' years of experience conducting incident response to keep Cisco's global network secure. It offers six steps to improve network monitoring. These steps will help you: Develop Policies: define rules, regulations, and monitoring criteria Know Your Network: build knowledge of your infrastructure with network telemetry Select Your Targets: define the subset of infrastructure to be monitored Choose Event Sources: identify event types needed to discover policy violations Feed and Tune: collect data, generate alerts, and tune systems using contextual information Maintain Dependable Event Sources: prevent critical gaps in collecting and monitoring events Security Monitoring illustrates these steps with detailed examples that will help you learn to select and deploy the best techniques for monitoring your own enterprise network.
Partially redundant systems reliability and global reliability
Authors: S. P. Jain, Krishna Gopala
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

A k-to-l-out-of-n: G system is one in which neither less than k nor more than l units out of n units are to be good for the system to be good. It's a very general system; as when l = n, it is a k-out-of-n: G system; when l = k = n, it is a series system; when l = n and k = 1, it is a parallel system; and when l = k, a system in which exactly k successes are required for the system to be successful. An efficient method of computing the reliability of such systems is presented. The efficiency results because of appropriately combining the terms in the expanded form of the reliability expression. Recursive relations are then developed. This principle is applied to computing the all-terminal (global) reliability also. Here too, it results in least possible computations in finding the reliability.
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Authors: Gabriela Ochoa, Rong Qu, Edmund K. Burke
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

Hyper-heuristics can be thought of as "heuristics to choose heuristics". They are concerned with adaptively finding solution methods, rather than directly producing a solution for the particular problem at hand. Hence, an important feature of hyper-heuristics is that they operate on a search space of heuristics rather than directly on a search space of problem solutions. A motivating aim is to build systems which are fundamentally more generic than is possible today. Understanding the structure of these heuristic search spaces is therefore, a research direction worth exploring. In this paper, we use the notion of fitness landscapes in the context of constructive hyper-heuristics. We conduct a landscape analysis on a heuristic search space conformed by sequences of graph coloring heuristics for timetabling. Our study reveals that these landscapes have a high level of neutrality and positional bias. Furthermore, although rugged, they have the encouraging feature of a globally convex or big valley structure, which indicates that an optimal solution would not be isolated but surrounded by many local minima. We suggest that using search methodologies that explicitly exploit these features may enhance the performance of constructive hyper-heuristics.
Isotopic triangulation of a real algebraic surface
Authors: Lionel Alberti, Bernard Mourrain, Jean-Pierre Técourt
Venue: Journal of Symbolic Computation (2009)

We present a new algorithm for computing the topology of a real algebraic surface S in a ball B, even in singular cases. We use algorithms for 2D and 3D algebraic curves and show how one can compute a topological complex equivalent to S, and even a simplicial complex isotopic to S by exploiting properties of the contour curve of S. The correctness proof of the algorithm is based on results from stratification theory. We construct an explicit Whitney stratification of S, by resultant computation. Using Thom's isotopy lemma, we show how to deduce the topology of S from a finite number of characteristic points on the surface. An analysis of the complexity of the algorithm and effectiveness issues conclude the paper.
Graph-based methods for the analysis of large-scale multiagent systems
Authors: Wilbur Peng, William Krueger, Alexander Grushin, Patrick Carlos, Vikram Manikonda, Michel Santos
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and scalable solutions to a variety of problems, the inherent complexity presents a barrier to their analysis, understanding, debugging and modification. In the work presented here, we seek to overcome this problem by modeling the execution of a multiagent system as a graph, which admits the application of techniques from the well-established field of algorithmic graph theory. In particular, we employ graph search and isomorphism computation to find repeating patterns of communication within a multiagent simulation. We argue, and demonstrate empirically, that the graph, even if it is too large to fit into main memory, carries useful properties, which allow these operations to be performed efficiently. We further show that the resulting patterns (which tend to be manageable in size) present a useful view of a simulation, and facilitate the comparison of different simulations against one another. This is specifically illustrated by applying a tool called IntelliTrace, which implements our approach, to multiagent models of the national airspace. At the same time, the tool, and its underlying methodology, is domain-independent, and can be used for the analysis, development and testing of a variety of multiagent systems.
Price Competition in Markets with Consumer Variety Seeking
Authors: P. B. Seetharaman, Hai Che
Venue: Marketing Science (2009)

We investigate price competition between firms in markets characterized by consumer variety seeking. While previous research has addressed the effect of consumer inertia on prices, there exists no research on the effects of variety seeking on price competition. Our study fills this gap in the literature. Using a two-period duopoly framework as in Klemperer's analysis of inertial markets, we show that the noncooperative pricing equilibrium in a market with consumer variety seeking may be the same as the collusive outcome in an otherwise identical market without variety seeking. Specifically, our variety-seeking model implies tacit collusion between firms in both periods, unlike the inertia model of Klemperer that implies tacit collusion between firms only in the second period but implies fierce price competition in the first period. When consumers are assumed to have rational expectations about future prices, the implied first-period prices increase further, which is consistent with what Klemperer finds in an inertial market. To summarize, while our variety-seeking analyses support two key results (pertaining to second-period prices and rational expectations) previously derived for inertial markets by Klemperer, they depart from one key result (pertaining to first-period prices).
Sizing user stories using paired comparisons
Authors: Eduardo Miranda, Pierre Bourque, Alain Abran
Venue: Information and Software Technology (2009)

Agile estimation approaches usually start by sizing the user stories to be developed by comparing them to one another. Various techniques, with varying degrees of formality, are used to perform the comparisons - plain contrasts, triangulation, planning poker, and voting. This article proposes the use of a modified paired comparison method in which a reduced number of comparisons is selected according to an incomplete cyclic design. Using two sets of data, the authors show that the proposed method produces good estimates, even when the number of comparisons is reduced by half those required by the original formulation of the method.
Interface states model for III-V oxide interfaces
Authors: J. Robertson
Venue: Microelectronic Engineering (2009)

A general model of the density of interface states at III-V oxide interfaces is presented. The interface states arise from the native defects, such as Ga or As dangling bonds and Ga-Ga or As-As like-atom bonds created by oxidation. As-As bonds are a likely cause of states at the conduction band edge of GaAs. The model explains the difficulty of n-type operation for GaAs FETs compared to GaAs pFETs or to InGaAs nFETs.
The CEH Prep Guide: The Comprehensive Guide to Certified Ethical Hacking
Authors: Ronald L. Krutz, Russell Dean Vines
Venue:  (2007)

The Certified Ethical Hacker program began in 2003 and ensures that IT professionals apply security principles in the context of their daily job scope Presents critical information on footprinting, scanning, enumeration, system hacking, trojans and backdoors, sniffers, denial of service, social engineering, session hijacking, hacking Web servers, and more Discusses key areas such as Web application vulnerabilities, Web-based password cracking techniques, SQL injection, wireless hacking, viruses and worms, physical security, and Linux hacking Contains a CD-ROM that enables readers to prepare for the CEH exam by taking practice tests
Fundamental calculus on generalized stochastically bounded bursty traffic for communication networks
Authors: Yuming Jiang, Qinghe Yin, Yong Liu, Shengming Jiang
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Since many applications and networks do not require or provide deterministic service guarantees, stochastic service guarantee analysis is becoming increasingly important and has attracted a lot of research attention in recent years. For this, several stochastic versions of deterministic traffic models have been proposed in the literature. Unlike previous stochastic models that are based on the traffic amount property of an input process, we present another stochastic model, generalized Stochastically Bounded Burstiness (gSBB), which is based on the virtual backlog property of the input process. We show the advantages of this approach. We study the superposition of gSBB traffic, and set up the input-output relation. Under various service disciplines, we characterize the output process for each source and investigate probabilistic upper bound on delay. Finally, we introduce a stochastic ordering monotonicity property of gSBB. With this property, we show that many well-known traffic models can be readily represented using the proposed gSBB model. These results set up the basis for a network calculus for gSBB traffic.
A Computational Framework for Nonlinear Dimensionality Reduction and Clustering
Authors: Axel Wismüller
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

We introduce the Exploration Machine (Exploratory Observation Machine, XOM) as a novel versatile instrument for scientific data analysis and knowledge discovery. XOM systematically inverts structural and functional components of topology-preserving mappings. In contrast to conventional approaches known from the literature, this novel computational framework for self-organization does not require to incorporate additional graphical display or coloring techniques, or to modify topology-preserving mapping algorithms by additional regularization in order to recover the underlying cluster structure of inhomogeneously distributed input data. Thus, XOM can be seen as an approach to bridge the gap between nonlinear embedding and classical topology-preserving feature mapping. At the same time, XOM results in tremendous computational savings when compared to conventional topology-preserving mapping, thus allowing for direct structure-preserving visualization of large data collections without prior data reduction. 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