ppxscal/embedding_network huggingface dataset:
Managing Provenance in iRODS
Authors: Andrea Weise, Adil Hasan, Mark Hedges, Jens Jensen
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Nowadays provenance is an important issue. Provenance data does not only give a history of events, it also provides enough information to allow the opportunity to verify the authenticity of the data, as well as, determine the quality of the data. The data grid management system, iRODS, comes with metadata which can be used as provenance data. Currently, iRODS's metadata is not sufficient for tracking and reconstructing procedures applied to data. In this paper, we describe the provenance needs of iRODS and we survey briefly current provenance and provenance enabled workflow systems. We describe an architecture that can be used to manage provenance in iRODS (and other systems) in a fault-tolerant way.
A priority model for named entities
Authors: Lorraine Tanabe, W. John Wilbur
Venue: Proceedings of the Workshop on Linking Natural Language Processing and Biology: Towards Deeper Biological Literature Analysis (2006)

We introduce a new approach to named entity classification which we term a Priority Model. We also describe the construction of a semantic database called SemCat consisting of a large number of semantically categorized names relevant to biomedicine. We used SemCat as training data to investigate name classification techniques. We generated a statistical language model and probabilistic context-free grammars for gene and protein name classification, and compared the results with the new model. For all three methods, we used a variable order Markov model to predict the nature of strings not represented in the training data. The Priority Model achieves an F-measure of 0.958--0.960, consistently higher than the statistical language model and probabilistic context-free grammar.
Automatically Harvesting and Ontologizing Semantic Relations
Authors: Patrick Pantel, Marco Pennacchiotti
Venue: Proceeding of the 2008 conference on Ontology Learning and Population: Bridging the Gap between Text and Knowledge (2008)

With the advent of the Web and the explosion of available textual data, it is key for modern natural language processing systems to access, represent and reason over large amounts of knowledge in semantic repositories. Separately, the knowledge representation and natural language processing communities have been developing representations/engines for reasoning over knowledge and algorithms for automatically harvesting knowledge from textual data, respectively. There is a pressing need for collaboration between the two communities to provide large-scale robust reasoning capabilities for knowledge rich applications like question answering. In this chapter, we propose one small step by presenting algorithms for harvesting semantic relations from text and then automatically linking the knowledge into existing semantic repositories. Experimental results show better than state of the art performance on both relation harvesting and ontologizing tasks.
Change Your Career: Computer Network Security as Your New Profession
Authors: Troy McMillan
Venue:  (2007)

Topics include: *Overview of the computer network security profession*The truth behind the myths of the IT field*General IT occupations and how security fits in*Information on credentials, programs, and degrees*Breakdown of CISSP exam with sample questions*How to fit going back to school into your lifestyle*Methods for balancing time constraints and stress*How to search for IT network security jobs*Making your resume work for you*Interviewing tips and strategies*Useful services, websites, and print resources 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
Joint power, subcarrier and subframe allocation in Multihop relay networks
Authors: Tolga Girici
Venue: International Journal of Communication Systems (2009)

In this paper we study the problem of subframe, subchannel and power allocation in OFDMA-based multihop relay networks. The system consists of a base station (BS), a number of relay stations (RS) and mobile stations (MS). We consider frame by frame scheduling, where the frame is divided into two subframes such as BS-RS and RS-MS subframes. We study two different problems, satisfying link rate requirements with minimum-weighted total power and maximizing proportional fairness. For the first problem, we find the optimal solution and also propose a less complex subframe and bandwidth allocation scheme with good performance. For the second problem, we propose an algorithm that outperforms an existing scheme with less feedback. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Wireless Sensor Networks for precision horticulture in Southern Spain
Authors: J. A. López Riquelme, F. Soto, J. Suardíaz, P. Sánchez, A. Iborra, J. A. Vera
Venue: Computers and Electronics in Agriculture (2009)

In recent years many applications have been proposed for Wireless Sensor Networks (WSN). One of these is precision agriculture, where WSN can play an important part in the handling and management of water resources for irrigation, in understanding the changes in the crops to assess the optimum point for harvesting, in estimating fertilizer requirements and to predict crop performance more accurately. This paper describes our experience during the introduction and deployment of an experimental sensor network at an ecological horticultural enterprise in the semiarid region of Murcia. It presents the topology of the deployed network using four types of nodes (Soil Mote, Environmental Mote, Water Mote and Gateway Mote), some of them connected to different sensors distributed in the field. These sensors can measure various soil characteristics such us temperature, volumetric moisture content and salinity. For each node, the overall architecture, hardware and software components are described. The system also includes a real-time monitoring application operating from a computer placed in the central offices of the farm. The testing of the system was done in two phases: the first in the laboratory, to validate the functional requirements of the developed devices, the networking solution and the mote's power management; the second on the farm, to asses the functional performance of the devices, such as range, robustness and flexibility. The system was successfully implemented on a crop of ecological cabbage (Brassica oleracea). The result was a low cost, highly reliable and simple infrastructure for the collection of agronomical data over a distributed area in horticultural environments.
Grid enabled MRP process improvement under distributed database environment
Authors: Hyoung-Gon Lee, Namkyu Park, Han-Il Jeong, Jinwoo Park
Venue: Journal of Systems and Software (2009)

The material requirement planning (MRP) process is crucial when software packages, like enterprise resource planning (ERP) software, are used in the production planning for manufacturing enterprises to ensure that appropriate quantities of raw materials and subassemblies are provided at the right time. Whereas little attention has been paid to the architectural aspects of MRP process in academic studies, in practice, reports are often made of its time consuming characteristics due to intensive interactions with databases and difficulty in real time processing. This paper proposes a grid enabled MRP process in a distributed database environment and demonstrates the performance improvement of the proposed process by a simulation study.
Games of No Chance 3, 1st edition
Authors: Michael H. Albert, Richard J. Nowakowski
Venue: Mathematical Sciences Research Institute Publications (2009)

This fascinating look at combinatorial games, that is, games not involving chance or hidden information, offers updates on standard games such as Go and Hex, on impartial games such as Chomp and Wythoff's Nim, and on aspects of games with infinitesimal values, plus analyses of the complexity of some games and puzzles and surveys on algorithmic game theory, on playing to lose, and on coping with cycles. The volume is rounded out with an up-to-date bibliography by Fraenkel and, for readers eager to get their hands dirty, a list of unsolved problems by Guy and Nowakowski. Highlights include some of Siegel's groundbreaking work on loopy games, the unveiling by Friedman and Landsberg of the use of renormalization to give very intriguing results about Chomp, and Nakamura's "Counting Liberties in Capturing Races of Go." Like its predecessors, this book should be on the shelf of all serious games enthusiasts.
Polyol mediated synthesis & characterization of Cu nanoparticles: effect of 1-hexadecylamine as stabilizing agent
Authors: Beteley T. Meshesha, Noelia Barrabés, Francesc Medina, Jesus E. Sueiras
Venue: Proceedings of the 1st WSEAS international conference on Nanotechnology (2009)

A facile method of preparing well-dispersed copper nanoparticles by polyol method, using 1- hexadecylamine as a protecting agent in ambient atmosphere, has been developed. Polyol mediated preparation of nanoparticles is one of the widely used methods that enables controlling the size and shape of nanoparticles. It is demonstrated that 1-hexadecylamine used as stabilizing agent during polyol mediated synthesis presents uniform, spherical and small sized copper nanoparticles than the commonly use PVP stabilizer. Higher alkylamine/Cu molar ratio leads to production of spherical and smaller copper nanoparticles. Palladium and gold prepared using alkylamine show uniform and small nanoparticles suggesting the efficiency of long chain alkylamine as capping agents. The nanoparticles showed a self-assembling on the alkylamine template.
Open Source --Ideology or Methodology?
Authors: Krzysztof Dorosz, Sebastian Gurgul
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

Come into being of complex FOSS projects, achieving success on the market is forcing to wonder on the method of their rising. For sure good software isn't able to arise without the usage of no production --methodology rules. It is appearing, that the present form of the Open Source movement has matured already enough, not to be call only the ideology, but to be called the balanced methodology of software development.
Software Solutions for Engineers and Scientists, 1st edition
Authors: Julio Sanchez, Maria P. Canton
Venue:  (2007)

Engineers and scientists often need to develop software to suit their particular needs, but they do not always have the advanced programming skills that are required to do so. Serving as a comprehensive problem-solving resource, Software Solutions for Engineers and Scientists provides development tools and practical shortcuts for professionals who already have basic programming skills but may lack the knowledge needed to perform sophisticated tasks and difficult mathematic calculations. This book includes mathematical-computation intensive code along with programming techniques that are compatible with both Visual C++ console applications as well as Windows program applications.
New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees
Authors: Cedric Chauve, Nadia El-Mabrouk
Venue: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (2009)

Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a species tree. When a species tree is not known, a natural algorithmic problem is to infer a species tree such that the corresponding reconciliation minimizes the number of duplications and/or losses. In this paper, we clarify several theoretical questions and study various algorithmic issues related to these two problems. (1) For a given gene tree T and species tree S, we show that there is a single history explaining T and consistent with S that minimizes gene losses, and that this history also minimizes the number of duplications. We describe a simple linear-time and space algorithm to compute this parsimonious history, that is not based on the Lowest Common Ancestor (LCA) mapping approach; (2) We show that the problem of computing a species tree that minimizes the number of gene duplications, given a set of gene trees, is in fact a slight variant of a supertree problem; (3) We show that deciding if a set of gene trees can be explained using only apparent duplications can be done efficiently, as well as computing a parsimonious species tree for such gene trees. We also characterize gene trees that can be explained using only apparent duplications in terms of compatible triplets of leaves.
Nonlinear system identification using optimized dynamic neural network
Authors: W. F. Xie, Y. Q. Zhu, Z. Y. Zhao, Y. K. Wong
Venue: Neurocomputing (2009)

In this paper, both off-line architecture optimization and on-line adaptation have been developed for a dynamic neural network (DNN) in nonlinear system identification. In the off-line architecture optimization, a new effective encoding scheme-Direct Matrix Mapping Encoding (DMME) method is proposed to represent the structure of neural network by establishing connection matrices. A series of GA operations are applied to the connection matrices to find the optimal number of neurons on each hidden layer and interconnection between two neighboring layers of DNN. The hybrid training is adopted to evolve the architecture, and to tune the weights and input delays of DNN by combining GA with the modified adaptation laws. The modified adaptation laws are subsequently used to tune the input time delays, weights and linear parameters in the optimized DNN-based model in on-line nonlinear system identification. The effectiveness of the architecture optimization and adaptation is extensively tested by means of two nonlinear system identification examples.
Boolean games revisited
Authors: Elise Bonzon, Marie-Christine Lagasquie-Schiex, Jérôme Lang, Bruno Zanuttini
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players' utility functions are binary and described by a single propositional formula, and the strategies available to a player consist of truth assignments to each of a given set of propositional variables (the variables controlled by the player.) We generalize the framework to n-players games which are not necessarily zero-sum. We give simple characterizations of Nash equilibria and dominated strategies, and investigate the computational complexity of the related problems.
Extension of IMS-QTI to Express Constraints on Template Variables in Mathematics Exercises
Authors: Odette Auzende, Hélène Giroire, Françoise Le Calvez
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

We propose an extension of the IMS-QTI v2 specification to define templates of mathematics exercises with template variables linked by constraints. We describe the various types of constraints we add, then we present functionalities for defining template mathematics exercises and creating associated dynamic web pages
An Analytic Model based on ASP for Maintaining ZPDs in CSCL Environments
Authors: Gerardo Ayala
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)

This paper presents an analytical model of an agent about the capabilities of a learner for CSCL environments in DLV based on the ASP (Answer Sets Programming) formalism. The complete model is formally presented in the declarative language of DLV, a logic programming language for implementing ASP models. The model proposed provides a representation of the structural knowledge frontier and the social knowledge frontier of the learner, which are the components for the definition of the learner's zone of proximal development (zpd). Based on the zpd of its learner the agent can propose her a learning task and maintain the zpd for the learner in the group. The analytical model, as presented in the paper, runs using the DLV system that can be easily downloaded from the internet.
The Exploration Machine --- A Novel Method for Data Visualization
Authors: Axel Wismüller
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

We present a novel method for structure-preserving dimensionality reduction. The Exploration Machine (Exploratory Observation Machine, XOM) computes graphical representations of high-dimensional observations by a strategy of self-organized model adaptation. Although simple and computationally efficient, XOM enjoys a surprising flexibility to simultaneously contribute to several different domains of advanced machine learning, scientific data analysis, and visualization, such as structure-preserving dimensionality reduction and data clustering. 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
Microsoft Word for Medical and Technical Writers, 1st edition
Authors: Peter G. Aitken, Maxine M. Okazaki
Venue:  (2007)

The long and complex documents that are often required in medical and technical fields present numerous challenges to writers and their word processing software. Microsoft Word is frequently not up to the task, and writers are often faced with important documents that have become corrupted or developed unexplained formatting problems, leading to lost time and unhappy clients. Microsoft Word for Medical and Technical Writers is not just a Word tutorial. It summarizes the authors' extensive experience with using Word to create regulatory documents, books on information processing, scientific manuscripts, and other long and complex documents. The book presents best practices, bug work-arounds, and proven techniques for using the program to create medical and technical documents while avoiding problems. Rather than trying to cover all of Word, the book focuses on those topics, such as tables, automatic numbering, and styles, that are most likely to cause problems. For Word 2003 and earlier versions.
A framework to enhance and research the interactional capabilities and instructional potential of virtual characters and pedagogical agents
Authors: Aaron Doering
Venue:  (2008)

How can humans communicate effectively with computers? Human-like virtual characters are becoming increasingly popular in a world where online education is widespread. Yet, when human learners interact with digital characters employed in educational settings, termed pedagogical agents, learners often become impatient, disenchanted, and frustrated. Albeit researchers have already made disjointed attempts to enhance the interactional capabilities of virtual characters such that they appear polite, friendly, and knowledgeable, this dissertation is a compilation of three concentrated and convergent studies aimed at enhancing the interaction between learners and virtual characters. The EnALI framework of guidelines that designers and researchers can use to minimize conflicts between learners and virtual characters is proposed in chapter two. The framework is grounded on previous work that indicates that learners interact with agents in an inherently social manner and that guidelines on enhancing interaction and collaboration between humans can be adapted to provide insight into how communication between learners and agents can be improved. Chapter three investigates one of the guidelines proposed in the EnALI framework. Specifically, when pedagogical agents interact with learners they appear to focus exclusively on the content that is to be taught. While content is crucial to learning, I propose that the interjection of extraneous information during agent-learner interaction may enhance learning with virtual characters. Results from a mixed methods study indicate that the inclusion of extraneous information may enhance learning and agent-learner interactions while the continuous addition of off-topic items harms learning and interaction. Focus group discussions intended to contextualize the experimental results indicated the complex nature of agent-learner relationships. The EnALI framework also proposes that agent expressiveness may improve the interaction between pedagogical agents and learners, ultimately enhancing learning outcomes. This hypothesis is examined in chapter four. Evidence from a mixed methods study, indicates that learners who interacted with a verbally expressive agent (a) scored higher on a post-task exam, and (b) rated the agent's ability to interact higher, than learners who interacted with a non-expressive agent. Qualitative results provided insight into this finding, while revealing the multifaceted nature of pedagogical agent integration in educational settings.
Study and performance of a group-based Content Delivery Network
Authors: Jaime Lloret, Miguel Garcia, Diana Bri, Juan R. Diaz
Venue: Journal of Network and Computer Applications (2009)

It is known that a group-based system provides better performance and more scalability to the whole system while it decreases the communication traffic. Group-based architectures in Content Delivery Networks (CDNs) could be a good solution to the need of scalability or when the bandwidth is a limitation. There is no pure group-based CDN in existence, although we proposed a group-based system to interconnect CDNs of different providers in a previous work. This article shows a new Content Delivery Network based on grouping surrogates. We will show the benefits of our proposal and its application environment. We will describe the protocol developed to connect surrogates from the same group and from different groups. The neighbor selection algorithm is based on their distance and Round Trip Delay in order to provide lower content distribution times. The system improves the Quality of Service (QoS) by connecting surrogates with higher available capacity. Real measurements of the network control traffic and of the performance of the surrogates in a controlled environment are shown. We will also demonstrate its scalability by comparing the control traffic for different numbers of surrogates in the CDN. Finally we will show the differences with the system proposed in our previous work.
A model-driven adaptive approach for collaborative ubiquitous systems
Authors: Ismael Bouassida Rodriguez, German Sancho, Thierry Villemur, Said Tazi, Khalil Drira
Venue: Proceedings of the 3rd workshop on Agent-oriented software engineering challenges for ubiquitous and pervasive computing (2009)

Ubiquitous communicating systems have particular characteristics, such as their dynamic nature and the great number of users and heterogeneous devices involved. In our work, we focus on collaborative activities. For such activities, users are organized into groups and communicate in order to achieve a common goal. Therefore, the problem of designing and implementing collaborative applications on top of ubiquitous communicating systems is a complex task that requires adequate modeling. In our view, addressing this problem needs a model-driven approach in order to ensure the coherence and correctness of the built systems. In this paper, we propose a multi-level modeling approach for collaborative ubiquitous systems. Moreover, relevant abstraction levels are identified and means are provided for inter-level model transformation (refinement) and for adaptation to context changes (selection). This adaptation is guided by both high level requirements and low level constraints.