ppxscal/embedding_network huggingface dataset:
Theoretic study of distributed graph planning
Authors: Jian Feng Zhang, Quoc Bao Vo, Ryszard Kowalczyk
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In situations where it needs the actions of different agents to accomplish a task, the planning for the task involves selecting and organizing the actions belonging to multiple agents. Most existing multi-agent planning approaches to solving such a planning problem rely on the global knowledge of the capabilities of the agents, and are confronted with difficulties when the availability of the global knowledge is impossible or undesirable. Previously, we have proposed a distributed multi-agent planning algorithm Dis-graph planning to address the difficulties, which enables multiple agents to cooperate in generating a plan without relying on the global knowledge. In the work of this paper, we performed a theoretical study of Dis-graph planning approach, discussing its critical features such as completeness, soundness and terminability.
Beyond log-linear models: boosted minimum error rate training for N-best Re-ranking
Authors: Kevin Duh, Katrin Kirchhoff
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

Current re-ranking algorithms for machine translation rely on log-linear models, which have the potential problem of underfitting the training data. We present BoostedMERT, a novel boosting algorithm that uses Minimum Error Rate Training (MERT) as a weak learner and builds a re-ranker far more expressive than log-linear models. BoostedMERT is easy to implement, inherits the efficient optimization properties of MERT, and can quickly boost the BLEU score on N-best re-ranking tasks. In this paper, we describe the general algorithm and present preliminary results on the IWSLT 2007 Arabic-English task.
Governing Lethal Behavior: Embedding Ethics in a Hybrid Deliberative/Reactive Robot ArchitecturePart 2: Formalization for Ethical Control
Authors: Ronald C. Arkin
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

This paper, the second in a series, provides the theory and formalisms for the implementation of an ethical control and reasoning system potentially suitable for constraining lethal actions in an autonomous robotic system. so that they fall within the bounds prescribed by the Laws of War and Rules of Engagement. It is based upon extensions to existing deliberative/reactive autonomous robotic architectures.
Brief paper: On-line voltage security assessment of power systems using core vector machines
Authors: M. Mohammadi, G. B. Gharehpetian
Venue: Engineering Applications of Artificial Intelligence (2009)

This paper presents a core vector machine (CVM)-based algorithm for on-line voltage security assessment of power systems. To classify the system security status, a CVM has been trained for each contingency. The proposed CVM-based security assessment has very small training time and space in comparison with support vector machines (SVM) and artificial neural networks (ANNs)-based algorithms. The proposed algorithm produces less support vectors (SV) and therefore is faster than existing algorithms. In this paper, a new decision tree (DT)-based feature selection technique has been presented, too. The proposed CVM algorithm has been applied to New England 39-bus power system. The simulation results show the effectiveness and the stability of the proposed method for on-line voltage security assessment procedure of large-scale power system.
Exploring data reliability tradeoffs in replicated storage systems
Authors: Abdullah Gharaibeh, Matei Ripeanu
Venue: Proceedings of the 18th ACM international symposium on High performance distributed computing (2009)

This paper explores the feasibility of a cost-efficient storage architecture that offers the reliability and access performance characteristics of a high-end system. This architecture exploits two opportunities: First, scavenging idle storage from LAN-connected desktops not only offers a low-cost storage space, but also high I/O throughput by aggregating the I/O channels of the participating nodes. Second, the two components of data reliability - durability and availability - can be decoupled to control overall system cost. To capitalize on these opportunities, we integrate two types of components: volatile, scavenged storage and dedicated, yet low-bandwidth durable storage. On the one hand, the durable storage forms a low-cost back-end that enables the system to restore the data the volatile nodes may lose. On the other hand, the volatile nodes provide a high-throughput front-end. While integrating these components has the potential to offer a unique combination of high throughput, low cost, and durability, a number of concerns need to be addressed to architect and correctly provision the system. To this end, we develop analytical- and simulation based tools to evaluate the impact of system characteristics (e.g., bandwidth limitations on the durable and the volatile nodes) and design choices (e.g., replica placement scheme) on data availability and the associated system costs (e.g., maintenance traffic). Further, we implement and evaluate a prototype of the proposed architecture: namely a GridFTP server that aggregates volatile resources. Our evaluation demonstrates an impressive, up to 800MBps transfer throughput for the new GridFTP service.
Permanence and stability in non-autonomous predator-prey Lotka-Volterra systems with feedback controls
Authors: Linfei Nie, Zhidong Teng, Lin Hu, Jigen Peng
Venue: Computers Mathematics with Applications (2009)

The main purpose of this article is considering whether or not the feedback controls have an influence on a non-autonomous predator-prey Lotka-Volterra type system. General criteria on permanence are established, which is described by an integral form and independent of some feedback controls. By constructing suitable Lyapunov functionals, a set of easily verifiable sufficient conditions are derived for the global stability of any positive solution to the model.
Premier List of Warehousing Software and Warehouse Management Systems, 1st edition
Authors: Philip Obal
Venue:  (2007)

Saving time is what this list is about. Here is a complete list of current Warehouse Management System WMS and Enterprise Resource Planning ERP solutions with a warehouse module. Included are targeted "SHORT LISTS" on WMS, based on common requests. Vendor information includes basic contact information with website and email contact. Besides an exhaustive listing of all vendors in the WMS space, short lists include: High Functionality WMS Low Cost WMS Web Based WMS WMS with Extensive Suite of Modules WMS with Long MHE Experience In addition, related warehousing software solutions are listed as well: Shipment Manifesting Systems (SMS) Load Building Software Warehouse Simulation Software Slotting Optimization Labor Management System (LMS) Yard Management System (YMS) This world wide list can be used by companies seeking new software - as well as integrators, ISV/VARS, acquistion companies, employment firms, computer hardware, and software companies in data mapping, data visualization, fax, EDI... This is the largest and most thorough list of warehousing software vendors.... Premier List 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
Java Web Services: Up and Running, 1st edition
Authors: Martin Kalin
Venue:  (2009)

This example-driven book offers a thorough introduction to Java's APIs for XML Web Services (JAX-WS) and RESTful Web Services (JAX-RS). Java Web Services: Up and Running takes a clear, pragmatic approach to these technologies by providing a mix of architectural overview, complete working code examples, and short yet precise instructions for compiling, deploying, and executing an application. You'll learn how to write web services from scratch and integrate existing services into your Java applications. With Java Web Services: Up and Running, you will: Understand the distinction between SOAP-based and REST-style services Write, deploy, and consume SOAP-based services in core Java Understand the Web Service Definition Language (WSDL) service contract Recognize the structure of a SOAP message Learn how to deliver Java-based RESTful web services and consume commercial RESTful services Know security requirements for SOAP- and REST-based web services Learn how to implement JAX-WS in various application servers Ideal for students as well as experienced programmers, Java Web Services: Up and Running is the concise guide you need to start working with these technologies right away.
Incremental Figure-Ground Segmentation Using Localized Adaptive Metrics in LVQ
Authors: Alexander Denecke, Heiko Wersing, Jochen J. Steil, Edgar Körner
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

Vector quantization methods are confronted with a model selection problem, namely the number of prototypical feature representatives to model each class. In this paper we present an incremental learning scheme in the context of figure-ground segmentation. In presence of local adaptive metrics and supervised noisy information we use a parallel evaluation scheme combined with a local utility function to organize a learning vector quantization (LVQ) network with an adaptive number of prototypes and verify the capabilities on a real world figure-ground segmentation task.
Computational hemodynamic study of endovascular stenting in patient-specific cerebral aneurysms
Authors: Juan R. Cebral
Venue:  (2008)

Stroke is the leading cause of death after heart disease and cancer and the number one cause of long-term disability in America. About 80% of hemorrhagic stroke are produced by the rupture of cerebral aneurysms. Surgical clipping and coil embolization are the most common methods of treating these aneurysms. However, both these treatments have some limitations for wide neck aneurysms. Recently, there has been an increased interest in the use of stents as flow diverters. With an effective design, the blood flowing into the aneurysm can be disrupted thereby promoting intra-aneurysmal thrombus formation and thus preventing rupture. Modeling blood flow around these endovascular devices in intracranial aneurysms is important for designing better devices and to personalize and optimize endovascular stenting procedures in the treatment of these aneurysms. Numerous studies have been conducted in the past using animal models, patient-specific in-vitro models and idealized computational models. Nevertheless, all of them have significant limitations. The main disadvantage of using animal models is that they fail to replicate the variable anatomy of diseased human arteries. And the problem with in-vitro models is that they are not suitable for large population studies. Patient-specific image-based numerical models have demonstrated to be a fast, reliable and inexpensive way of simulating blood flow inside these aneurysms. Moreover, studies using these models have the potential to replicate the exact anatomy of specific patients in order to connect specific hemodynamic factors to clinical events. Furthermore, large patient population study is also possible. A methodology was previously developed in the CFD Lab, GMU, to conduct patient-specific studies but without any endovascular devices. It includes image processing and segmentation algorithms, unstructured 3D grid generation, finite element solver for Navier-Stokes equations, rheological models and visualization techniques. However, the main difficulty in using these models for endovascular stent simulations lies in the generation of acceptable computational grids inside the blood vessels and around these devices. An adaptive embedded gridding technique originally developed for fluid-structure interaction problems at the CFD lab, GMU, tremendously simplifies this impediment. In this doctoral thesis the computational modeling pipeline has been extended to model patient-specific hemodynamics of stented cerebral aneurysms. The methodology was evaluated and demonstrated with a number of image-based models and different stent aneurysms and applied to the study of the effects of stents on the flow in aneurysms and side arterial branches.
Sketch-based path design
Authors: James McCrae, Karan Singh
Venue: Proceedings of Graphics Interface 2009 (2009)

We present Drive, a system for the conceptual layout of 3D path networks. Our sketch-based interface allows users to efficiently author path layouts with minimal instruction. Our system incorporates some new and noteworthy components. We present the break-out lens, a novel widget for interactive graphics, inspired by break-out views used in engineering visualization. We also make three contributions specific to path curve design: First, we extend our previous work to fit aesthetic paths to sketch strokes with constraints, using piecewise clothoid curves. Second, we determine the height of paths above the terrain using a constraint optimization formulation of the occlusion relationships between sketched strokes. Finally, we illustrate examples of terrain sensitive path construction in the context of road design: automatically removing foliage, building bridges and tunnels across topographic features and constructing road signs appropriate to the sketched paths.
A Process-Oriented Approach for the Optimal Satisficing of Non-Functional Requirements
Authors: Christopher Burgess, Aneesh Krishna
Venue: Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes (2009)

In an ever more competitive world, the need for software systems to meet specific quality characteristics becomes increasingly apparent. These quality characteristics, or non-functional requirements, are often contradictory and ambiguous, making them difficult to manage during software development processes. This paper presents a modification of the NFR framework that facilitates the automated discovery of optimal system designs for the satisfaction of non-functional requirements. Just as with the NFR framework, this method can be used at any stage during the software development process in order to aid design decisions. The proposed method introduces the capacity to incorporate both qualitative and quantitative non-functional requirements, as well as the potential to include various cost factors into the optimisation process.
Anisotropy properties of turbulence
Authors: Sankha Banerjee, Oezguer Ertunc, Franz Durst
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

In the literature, anisotropy-invariant maps are being proposed to represent a domain within which all realizable Reynolds stress invariants must lie. It is shown that the representation proposed by Lumley and Newman has disadvantages owing to the fact that the anisotropy invariants (II, III) are nonlinear functions of stresses. In the current work, it is proposed to use an equivalent linear representation of the anisotropy invariants in terms of eigenvalues. A novel barycentric map, based on the convex combination of scalar metrics dependent on eigenvalues, is proposed to provide a non-distorted visual representation of anisotropy in turbulent quantities. This barycentric map provides the possibility of viewing the Reynolds stress and any anisotropic stress tensor. Additionally the barycentric map provides the possibility of quantifying the weighting for any point inside it in terms of the limiting states (one component, two component, three component). The mathematical basis for the barycentric map is derived using the spectral decomposition theorem for second-order tensors. In this way, an analytical proof is provided that All turbulence lies along the boundaries or inside the barycentric map. It is proved that the barycentric map and the anisotropy-invariant maps are one to one uniquely interdependent and as a result satisfy the requirement of realizability.
A Maximum Class Distance Support Vector Machine-Based Algorithm for Recursive Dimension Reduction
Authors: Zheng Sun, Xiaoguang Zhang, Dianxu Ruan, Guiyun Xu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

A maximum class distance support vector machine based on the recursive dimension reduction is proposed. This algorithm referring to the concept of fisher linear discriminate analysis is introduced to make the distance between the classes as long as possible along the direction of the discriminate vector, and at the same time a classification hyper-plane with the largest distance between the two classes is achieved. Thus the classification hyper-plane can effectively consist with the distribution of samples, resulting to higher classification accuracy. This paper presents the recursive dimension reduction algorithm and its details. Finally, a simulation illustrates the effectiveness of the presented algorithm.
Augmenting spatial information processing for 3-D visualization
Authors: Peter Khooshabeh
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

Computer-aided design (CAD) is a challenging domain of end-user programming because it involves complex spatial transformations of 3-dimensional (3-D) objects. Here we provide evidence that shows that the ability to perform spatial transformations of novel abstract 3-D objects can be augmented when additional information is presented in an external display.
An online document clustering technique for short web contents
Authors: Moreno Carullo, Elisabetta Binaghi, Ignazio Gallo
Venue: Pattern Recognition Letters (2009)

Document clustering techniques have been applied in several areas, with the web as one of the most recent and influential. Both general-purpose and text-oriented techniques exist and can be used to cluster a collection of documents in many ways. This work proposes a novel heuristic online document clustering model that can be specialized with a variety of text-oriented similarity measures. An experimental evaluation of the proposed model was conducted in the e-commerce domain. Performances were measured using a clustering-oriented metric based on F-Measure and compared with those obtained by other well-known approaches. The obtained results confirm the validity of the proposed method both for batch scenarios and online scenarios where document collections can grow over time.
Usability of UML Modeling Tools
Authors: Anna Bobkowska, Krzysztof Reszke
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

Usability aspects of UML modeling tools have impact on efficiency of work and satisfaction of software developers. This paper discusses applicability of usability techniques to UML modeling tools evaluation. It describes an empirical study of performance testing of six UML modeling tools and inquiries regarding usability problems with these tools. Then, Goals, Methods, Operators, Selection Rules (GOMS) method is applied for investigation of the effort necessary to create diagrams with these tools.
Proof Search for the First-Order Connection Calculus in Maude
Authors: Bjarne Holen, Einar Broch Johnsen, Arild Waaler
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

This paper develops a rewriting logic specification of the connection method for first-order logic, implemented in Maude. The connection method is a goal-directed proof procedure that requires a careful control over clause copies. The specification separates the inference rule layer from the rule application layer, and implements the latter at Maude's meta-level. This allows us to develop and compare different strategies for proof search.
Functional classification of genome-scale metabolic networks
Authors: Oliver Ebenhöh, Thomas Handorf
Venue: EURASIP Journal on Bioinformatics and Systems Biology (2009)

We propose two strategies to characterize organisms with respect to their metabolic capabilities. The first, investigative, strategy describes metabolic networks in terms of their capability to utilize different carbon sources, resulting in the concept of carbon utilization spectra. In the second, predictive, approach minimal nutrient combinations are predicted from the structure of the metabolic networks, resulting in a characteristic nutrient profile. Both strategies allow for a quantification of functional properties of metabolic networks, allowing to identify groups of organisms with similar functions. We investigate whether the functional description reflects the typical environments of the corresponding organisms by dividing all species into disjoint groups based on whether they are aerotolerant and/or photosynthetic. Despite differences in the underlying concepts, both measures display some common features. Closely related organisms often display a similar functional behavior and in both cases the functional measures appear to correlate with the considered classes of environments. Carbon utilization spectra and nutrient profiles are complementary approaches toward a functional classification of organism-wide metabolic networks. Both approaches contain different information and thus yield different clusterings, which are both different from the classical taxonomy of organisms. Our results indicate that a sophisticated combination of our approaches will allow for a quantitative description reflecting the lifestyles of organisms.
Incorporating site-level knowledge for incremental crawling of web forums: a list-wise strategy
Authors: Jiang-Ming Yang, Rui Cai, Chunsong Wang, Hua Huang, Lei Zhang, Wei-Ying Ma
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

We study in this paper the problem of incremental crawling of web forums, which is a very fundamental yet challenging step in many web applications. Traditional approaches mainly focus on scheduling the revisiting strategy of each individual page. However, simply assigning different weights for different individual pages is usually inefficient in crawling forum sites because of the different characteristics between forum sites and general websites. Instead of treating each individual page independently, we propose a list-wise strategy by taking into account the site-level knowledge. Such site-level knowledge is mined through reconstructing the linking structure, called sitemap, for a given forum site. With the sitemap, posts from the same thread but distributed on various pages can be concatenated according to their timestamps. After that, for each thread, we employ a regression model to predict the time when the next post arrives. Based on this model, we develop an efficient crawler which is 260% faster than some state-of-the-art methods in terms of fetching new generated content; and meanwhile our crawler also ensure a high coverage ratio. Experimental results show promising performance of Coverage, Bandwidth utilization, and Timeliness of our crawler on 18 various forums.
Security+, Update for Guide to Network Security Fundamentals, 1st edition
Authors: Mark Ciampa
Venue:  (2007)

The Security+ Guide to Network Security Fundamentals Second Edition Update is designed to provide updated information regarding the changes in security that has occurred since the most recent CompTIA Security+ objectives were created. This brief book is best used alongside Security+ Guide to Network Security Fundamentals Second Edition, in which Mark Ciampa provides an introduction to the field of network security, including coverage of all the domain objectives for the latest Security+ exam.