ppxscal/embedding_network huggingface dataset:
Graph construction and b-matching for semi-supervised learning
Authors: Tony Jebara, Jun Wang, Shih-Fu Chang
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conversion of data into a weighted graph. However, most of the SSL literature focuses on developing label inference algorithms without extensively studying the graph building method and its effect on performance. This article provides an empirical study of leading semi-supervised methods under a wide range of graph construction algorithms. These SSL inference algorithms include the Local and Global Consistency (LGC) method, the Gaussian Random Field (GRF) method, the Graph Transduction via Alternating Minimization (GTAM) method as well as other techniques. Several approaches for graph construction, sparsification and weighting are explored including the popular k-nearest neighbors method (kNN) and the b-matching method. As opposed to the greedily constructed kNN graph, the b-matched graph ensures each node in the graph has the same number of edges and produces a balanced or regular graph. Experimental results on both artificial data and real benchmark datasets indicate that b-matching produces more robust graphs and therefore provides significantly better prediction accuracy without any significant change in computation time.
An automatic strategy for adaptive tetrahedral mesh generation
Authors: R. Montenegro, J. M. Cascón, J. M. Escobar, E. Rodríguez, G. Montero
Venue: Applied Numerical Mathematics (2009)

This paper introduces a new automatic strategy for adaptive tetrahedral mesh generation. A local refinement/derefinement algorithm for nested triangulations and a simultaneous untangling and smoothing procedure are the main involved techniques. The mesh generator is applied to 3-D complex domains whose boundaries are projectable on external faces of a meccano approximation composed of cuboids. The domain surfaces must be given by a mapping between meccano surfaces and object boundary. This mapping can be defined by analytical or discrete functions. At present, we have fixed mappings with orthogonal, cylindrical and radial projections, but any other one-to-one projection may be considered. The mesh generator starts from a coarse and valid hexahedral mesh that is obtained by an admissible subdivision of the meccano cuboids. The automatic subdivision of each hexahedron into six tetrahedra produces an initial tetrahedral mesh of the meccano approximation. The main idea is to construct a sequence of nested meshes by refining only those tetrahedra with a face on the meccano boundary. The virtual projection of meccano external faces defines a valid triangulation on the domain boundary. Then a 3-D local refinement/derefinement is carried out so that the approximation of domain surfaces verifies a given precision. Once this objective is reached, those nodes placed on the meccano boundary are really projected on their corresponding true boundary, and inner nodes are relocated using a suitable mapping. As the mesh topology is kept during node movement, poor quality or even inverted elements could appear in the resulting mesh; therefore, we finally apply a mesh optimization procedure. The efficiency of the proposed technique is shown with several applications to complex objects.
Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz - Book Edition of Fundamenta Informaticae
Authors: W. Penczek, W. Penczek, G. Rozenberg
Venue:  (2007)

This book honors Professor Antoni Mazurkiewicz, who during his long scientific career (in 2006 he celebrated 50 years of employment in the academic world) made fundamental contributions to theoretical computer science. These contributions span a whole range of research areas including the theory of programming, models of concurrent and distributed systems, (de)composition methods for Pietri nets, algorithms on graphs, synchronizing networks, and concurrent and asynchronous algorithms. He is best known for inventing the theory of traces, which became one of the cornerstones of the theory of concurrency. His ideas have inspired many scientists all over the world. Many concepts he introduced have shaped whole lines of research in concurrency. He had a tremendous influence on the development of theoretical computer science in Poland. Many of his former Ph.D. students became research leaders and today hold professorships at universities in Poland and abroad, pursuing research inspired by ideas of their mentor.IOS Press is an international science, technical and medical publisher of high-quality books for academics, scientists, and professionals in all fields. Some of the areas we publish in: -Biomedicine -Oncology -Artificial intelligence -Databases and information systems -Maritime engineering -Nanotechnology -Geoengineering -All aspects of physics -E-governance -E-commerce -The knowledge economy -Urban studies -Arms control -Understanding and responding to terrorism -Medical informatics -Computer Sciences
Semi-formal Evaluation of Conversational Characters
Authors: Ron Artstein, Sudeep Gandhe, Jillian Gerten, Anton Leuski, David Traum
Venue: Languages: From Formal to Natural: Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday (2009)

Conversational dialogue systems cannot be evaluated in a fully formal manner, because dialogue is heavily dependent on context and current dialogue theory is not precise enough to specify a target output ahead of time. Instead, we evaluate dialogue systems in a semi-formal manner, using human judges to rate the coherence of a conversational character and correlating these judgments with measures extracted from within the system. We present a series of three evaluations of a single conversational character over the course of a year, demonstrating how this kind of evaluation helps bring about an improvement in overall dialogue coherence.
Web-Based Recommender Systems and User Needs --the Comprehensive View
Authors: Przemysław Kazienko
Venue: Proceeding of the 2008 conference on New Trends in Multimedia and Network Information Systems (2008)

Recommender systems became an important element of many web-based systems. The general process about how recommender systems fulfil various user needs based on the analysis of recent literature in presented in the survey paper. Recommender systems are compared with other method like Information Retrieval and browsing. The paper also includes the comprehensive view over the typical components and structure of recommender systems. The state-of-the-art of recommendation methods is described as well.
Robustness in Recurrent Auctions for Resource Allocation
Authors: Victor Muòoz, Dídac Busquets
Venue: Proceeding of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence (2008)

Resource allocation problems where resources have to be assigned to tasks in such a way that no resource gets overused can be solved using recurrent auctions. In dynamic environments where unexpected changes may occur, searching the optimal solution may not be the best choice as it would be more likely to fail. In these cases a robust solution is preferable. In this paper we present a robustness mechanism for auctions, producing feasible and near optimal solutions even if non-planned events occur.
Goal Generation and Adoption from Partially Trusted Beliefs
Authors: Célia da Costa Pereira, Andrea G. B. Tettamanzi
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

A rational agent adopts (or changes) its goals when new information (beliefs) becomes available or its desires (e.g., tasks it is supposed to carry out) change. In this paper we propose a non-conventional approach for adopting goals which takes the degree of trust in the sources of information into account. Beliefs, desires, and goals, as a consequence, are gradual. Incoming information may be any propositional formula. Two algorithms for updating the mental state of an agent in this new setting are proposed. The first algorithm is relevant to the updating when a new piece of information arrives and the second one is relevant to the updating when a new desire arises.
Building information assurance education partnerships with minority institutions
Authors: J. A. "Drew" Hamilton,  Jr., Robert S. Owor, Khalil F. Dajani
Venue: The Fifth Richard Tapia Celebration of Diversity in Computing Conference: Intellect, Initiatives, Insight, and Innovations (2009)

This paper describes our successful leveraging of the National Security Agency/Department of Homeland Security Center of Academic Excellence in Information Assurance program and Auburn University's highly successful partnership with three (Historically Black College and Universities (HBCU)) universities through the National Science Foundation's Scholarship for Service Program. This paper will describe this ongoing and highly successful program that has been publicly praised by the National Science Foundation as "a model for innovative collaboration and community building. It demonstrates how majority institutions and minority serving institutions can effectively build mutually beneficial partnerships which will increase diversity in the information assurance community."
Recommendation as link prediction: a graph kernel-based machine learning approach
Authors: Xin Li, Hsinchun Chen
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

Recommender systems have demonstrated commercial success in multiple industries. In digital libraries they have the potential to be used as a support tool for traditional information retrieval functions. Among the major recommendation algorithms, the successful collaborative filtering (CF) methods explore the use of user-item interactions to infer user interests. Based on the finding that transitive user-item associations can alleviate the data sparsity problem in CF, multiple heuristic algorithms were designed to take advantage of the user-item interaction networks with both direct and indirect interactions. However, the use of such graph representation was still limited in learning-based algorithms. In this paper, we propose a graph kernel-based recommendation framework. For each user-item pair, we inspect its associative interaction graph (AIG) that contains the users, items, and interactions n steps away from the pair. We design a novel graph kernel to capture the AIG structures and use them to predict possible user-item interactions. The framework demonstrates improved performance on an online bookstore dataset, especially when a large number of suggestions are needed.
User-input driven QoS management in ad hoc networks
Authors: Wenjing Wang, Mainak Chatterjee, Kevin Kwiat
Venue: Computer Communications (2009)

Though the network quality-of-service (QoS) metrics are defined in terms of technical parameters (e.g., delay, jitter, bandwidth), they are rather subjective when it comes to the end user. Oftentimes, the end user finds it difficult to express his desired QoS in such technical parameters, though he has a fair idea of what QoS he desires. In this paper, we show how translation functions can be devised and used to translate the user inputs to networking parameters that are used by various layers of the protocol stack. In particular, we consider an ad hoc network and show an interface design that uses translation functions to map user supplied inputs to parameters at the medium access control (MAC) and routing layers. These parameters, in turn, choose the right strategies that particular layer functionality can adopt, such that the QoS desired by the user is achieved. We also compute the associated costs due to the different strategies adopted. We implement the interface on ns-2 and conduct simulation experiments with randomly scattered IEEE 802.11 enabled nodes. Results show the functionality of the interface and demonstrate how delay, throughput, and network lifetime are affected when the end user seeks different levels of QoS.
Rob Milne: The British Airways Years
Authors: Rick Magaldi
Venue: Proceeding of the 2006 conference on Rob Milne: A Tribute to a Pioneering AI Scientist, Entrepreneur and Mountaineer (2006)

A particular period of Rob Milne's professional contact with Industry that many of his academic colleagues and friends may not be familiar with is that during which he provided consultancy to British Airways. Rob became involved in a number of projects carried out by the British Airways Artificial Intelligence Unit from the late 1980's through to the late 1990's. The following is an account of some of the more important project areas that Rob and his colleagues from Intelligent Applications participated in, as well as highlighting the important contribution that he made to many of the business decisions required of the Artificial Intelligence Unit in developing knowledge-based solutions for the airline, and to the industry in general.
Educational Research: Networks and Technologies, 1st edition
Authors: Paul Smeyers, Marc Depaepe
Venue:  (2007)

There have always been networks in the context of educational research as well as particular technologies. Yet recent developments in ICT have put their mark on contemporary education and on educational research and more in general on knowledge and understanding. Does the network society and its supporting technologies constitute a thoroughly radical innovation in social practice? Does information technology poison the minds of the younger generation? Do educational institutions have to be transformed in order to effectively serve the needs of the twenty-first century? And what are the implications of these changes for educational research and for researchers themselves? In this book distinguished philosophers and historians of education focus on the way networks and technologies characterize education and educational research nowadays. Attention is paid for instance to online networks as spaces and places that are changing research practices and relations, to the involvement of the researcher in the moral debate, but also to particular educational technologies such as the use of experts advice concerning Internet use, the American True Love Waits movement and the practice of punishment in schools. "This groundbreaking book records the intellectual struggles of a diverse and distinguished group of scholars as they come to grips with the changes in knowledge production, and modes of research communication, engendered by contemporary information and communications technology. The book performs a major service in placing the phenomenon of networks - their potentialities and also their dangers - squarely on our intellectual agenda." D.C. Phillips, Professor Emeritus of Education and Philosophy, Stanford University "In this book, a rich array of international scholars in the philosophy and history of education address a pressing concern in contemporary educational research and educational practice: the impact of information technology and networks. The authors are strikingly successful, both in explicating the effects of these changes on both domains and in subverting these effects by pointing out the ironies and continuities lodged beneath technology's veneer of utility and novelty." David F. Labaree, Professor of Education, Stanford University This publication is realized by the Research Community (FWO-Vlaanderen / Research Foundation Flanders, Belgium) Philosophy and History of the Discipline of Education:Evaluation and Evolution of the Criteria for Educational Research. Also realized by the Research Community is Educational Research: Why "What Works" Doesnt Work, which appeared in 2006.
Poliqarp: an open source corpus indexer and search engine with syntactic extensions
Authors: Daniel Janus, Adam Przepiórkowski
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

This paper presents recent extensions to Poliqarp, an open source tool for indexing and searching morphosyntactically annotated corpora, which turn it into a tool for indexing and searching certain kinds of treebanks, complementary to existing treebank search engines. In particular, the paper discusses the motivation for such a new tool, the extended query syntax of Poliqarp and implementation and efficiency issues.
Exploring the relation between intuitionistic bi and boolean bi: An unexpected embedding
Authors: Dominique Larchey-wendling, Didier Galmiche
Venue: Mathematical Structures in Computer Science (2009)

The logic of Bunched Implications, through both its intuitionistic version (<monospace>BI</monospace>) and one of its classical versions, called Boolean <monospace>BI</monospace> (<monospace>BBI</monospace>), serves as a logical basis to spatial or separation logic frameworks. In <monospace>BI</monospace>, the logical implication is interpreted intuitionistically whereas it is generally interpreted classically in spatial or separation logics, as in <monospace>BBI</monospace>. In this paper, we aim to give some new insights into the semantic relations between <monospace>BI</monospace> and <monospace>BBI</monospace>. Then we propose a sound and complete syntactic constraints based framework for the Kripke semantics of both <monospace>BI</monospace> and <monospace>BBI</monospace>, a sound labelled tableau proof system for <monospace>BBI</monospace>, and a representation theorem relating the syntactic models of <monospace>BI</monospace> to those of <monospace>BBI</monospace>. Finally, we deduce as our main, and unexpected, result, a sound and faithful embedding of <monospace>BI</monospace> into <monospace>BBI</monospace>.
Assimilation of satellite data into agrohydrological models to improve crop yield forecasts
Authors: M. Vazifedoust, J. C. van Dam, W. G. M. Bastiaanssen, R. A. Feddes
Venue: International Journal of Remote Sensing (2009)

This paper addresses the question of whether data assimilation of remotely sensed leaf area index and/or relative evapotranspiration estimates can be used to forecast total wheat production as an indicator of agricultural drought. A series of low to moderate resolution MODIS satellite data of the Borkhar district, Isfahan (Iran) was converted into both leaf area index and relative evapotranspiration using a land surface energy algorithm for the year 2005. An agrohydrological model was then implemented in a distributed manner using spatial information of soil types, land use, groundwater and irrigation on a raster basis with a grid size of 250 m, i.e. moderate resolution. A constant gain Kalman filter data assimilation algorithm was used for each data series to correct the internal variables of the distributed model whenever remotely sensed data were available. Predictions for 1 month in advance using simulations with assimilation at a regional scale were very promising with respect to the statistical data (bias = ±10%). However, longer-term predictions, i.e. 2 months in advance, resulted in a higher bias between the simulated and statistical data. The introduced methodology can be used as a reliable tool for assessing the impacts of droughts in semi-arid regions.
Nuclear polarization and entanglement in spin systems
Authors: G. B. Furman, V. M. Meerovich, V. L. Sokolovsky
Venue: Quantum Information Processing (2009)

We investigated relationships between entanglement measures and the order parameter (nuclear polarization) in nuclear spin systems controlled by the nuclear magnetic resonance (NMR) technique. Since spin polarization can be easily manipulated by the NMR technique, experimentalists are presented with an opportunity to study the dynamic properties of entanglement, i.e., the creation and evolution of entangled states. Our approach may constitute the basis for researching the relations between the entanglement measures and measurable parameters of order in other quantum systems.
Modeling Cost-Aware Web Services Composition Using PTCCS
Authors: Fangxiong Xiao, Zhiqiu Huang, Zining Cao, Jun Hu, LinYuan Liu
Venue: Proceedings of the 2009 IEEE International Conference on Web Services (2009)

Process algebra are a set of formal languages that are suitable to describe concurrent and communication systems including web services. Nowadays, although process algebra have been effectively exploited for modeling and verifying functional aspects of web services composition, non-functional aspects have been ignored due to process algebra lack of capability of modeling them. Since execution of web services need to consume resource (and energy, time, fee, etc), we propose an abstract concept, that is, cost, to model this non-functional aspect. We introduce this abstract concept into TCCS(Temporal Calculus of Communicating Systems) that is a classical process algebra and propose a new process algebra called PTCCS(Priced Temporal Calculus of Communicating Systems). We present syntax and semantics of PTCCS, and prove that PTCCS extends TCCS with cost modeling capability. And an algorithm is proposed to construct cost state space that is used to select web services composition with optimal cost. Experiment results show that PTCCS can model both functional aspects and non-functional aspects of web services composition.
Attribute Aggregation in Federated Identity Management
Authors: David W. Chadwick, George Inman
Venue: Computer (2009)

Most federated identity management systems are limited by users' ability to choose only one identity provider per service session. A proposed linking service lets users securely link their various identity provider (IdP) accounts, enabling the system to aggregate attributes from multiple authoritative sources automatically without requiring users to authenticate separately to each IdP.
Extracting MUCs from Constraint Networks
Authors: Fred Hemery, Christophe Lecoutre, Lakhdar Sais, Frédéric Boussemart
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)

We address the problem of extracting Minimal Unsatisfiable Cores (MUCs) from constraint networks. This computationally hard problem has a practical interest in many application domains such as configuration, planning, diagnosis, etc. Indeed, identifying one or several disjoint MUCs can help circumscribe different sources of inconsistency in order to repair a system. In this paper, we propose an original approach that involves performing successive runs of a complete backtracking search, using constraint weighting, in order to surround an inconsistent part of a network, before identifying all transition constraints belonging to a MUC using a dichotomic process. We show the effectiveness of this approach, both theoretically and experimentally.
On the Issue of Contraposition of Defeasible Rules
Authors: Martin Caminada
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

The past ten years have shown a great variety of approaches for formal argumentation. An interesting question is to which extent these various formalisms correspond to the different application domains. That is, does the appropriate argumentation formalism depend on the particular domain of application, or does “one size fits all”. In this paper, we study this question from the perspective of one relatively simple design consideration: should or should there not be contrapostion of (or modus tollens) on defeasible rules. We aim to show that the answer depends on whether one is considering epistemical or constitutive reasoning, and that hence different domains require fundamentally different forms of defeasible reasoning.