ppxscal/embedding_network huggingface dataset:
Towards dynamic trust establishment for identity federation
Authors: Florina Almenárez, Patricia Arias, Andrés Marín, Daniel Díaz
Venue: Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship (2009)

Federation has emerged as a key concept for identity management, as it is the basis to reduce complexity in the companies and improve user experience. However, the problem of establishing identity federations in dynamic open environments, where it is desirable to speed up the processes of service provisioning and deprovisioning, has not been fully addressed. This paper reviews the existing frameworks for identity federation, analyzing the underlying trust mechanisms and its suitability to be applied in the mentioned environments. Finally, we propose a generic extension for the Security Assertion Markup Language (SAML) standard in order to facilitate the creation of federation relationships in a secure dynamic way between prior unknown parties.
Pokefind
Authors: Firas Khatib, Carol A. Rohl, Kevin Karplus
Venue: Bioinformatics (2009)

Motivation: Our focus has been on detecting topological properties that are rare in real proteins, but occur more frequently in models generated by protein structure prediction methods such as Rosetta. We previously created the Knotfind algorithm, successfully decreasing the frequency of knotted Rosetta models during CASP6. We observed an additional class of knot-like loops that appeared to be equally un-protein-like and yet do not contain a mathematical knot. These topological features are commonly referred to as slip-knots and are caused by the same mechanisms that result in knotted models. Slip-knots are undetectable by the original Knotfind algorithm. We have generalized our algorithm to detect them, and analyzed CASP6 models built using the Rosetta loop modeling method. Results: After analyzing known protein structures in the PDB, we found that slip-knots do occur in certain proteins, but are rare and fall into a small number of specific classes. Our group used this new Pokefind algorithm to distinguish between these rare real slip-knots and the numerous classes of slip-knots that we discovered in Rosetta models and models submitted by the various CASP7 servers. The goal of this work is to improve future models created by protein structure prediction methods. Both algorithms are able to detect un-protein-like features that current metrics such as GDT are unable to identify, so these topological filters can also be used as additional assessment tools. Contact: firas@u.washington.edu
Accessing Touristic Knowledge Bases through a Natural Language Interface
Authors: Juana María Ruiz-Martínez, Dagoberto Castellanos-Nieves, Rafael Valencia-García, Jesualdo Tomás Fernández-Breis, Francisco García-Sánchez, Pedro José Vivancos-Vicente, Juan Salvador Castejón-Garrido, Juan Bosco Camón, Rodrigo Martínez-Béjar
Venue: Knowledge Acquisition: Approaches, Algorithms and Applications: Pacific Rim Knowledge Acquisition Workshop, PKAW 2008, Hanoi, Vietnam, December 15-16, 2008, Revised Selected Papers (2009)

In order to realise the Semantic Web vision, more and more information is being made available in formal knowledge representation languages such as OWL. Unfortunately, the gap between human users who want to retrieve information and the Semantic Web remains unsolved. This paper presents a method for querying ontological knowledge bases from natural language sentences. This approach is based on the combination of three key elements: Natural Language Processing techniques for analyzing text fragments, ontologies for knowledge representation and Semantic Web technologies for querying ontological knowledge bases. The results of the application of this approach in the e-tourism domain are also reported in this paper.
Robust perception-based data reduction and transmission in telehaptic systems
Authors: Nizar Sakr, Jilin Zhou, Nicolas D. Georganas, Jiying Zhao, Emil M. Petriu
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

In this paper, two robust perception-based haptic data reduction and transmission techniques are presented to reduce data traffic in telehaptic systems. A prediction approach that relies on the least-squares method and median filtering is exploited in order to reduce the number of packets transmitted, and efficiently reconstruct unsuccessfully received data samples. Knowledge from human haptic perception is also used and incorporated into the general data reduction architecture. The techniques are initially evaluated in a basic experimental setting in order to validate their performance. Their application in a haptic-enabled telementoring surgery simulation is also demonstrated. The experimental results prove the proposed approach's effectiveness as haptic data packets can be reduced by as much as 96% in normal network conditions and up to 93% in the presence of significant communication delay and packet loss, while preserving the overall quality of the telehaptic environment.
Isomorphism and argumentation
Authors: Trevor Bench-Capon, Thomas F. Gordon
Venue: Proceedings of the 12th International Conference on Artificial Intelligence and Law (2009)

As knowledge representation tools become more sophisticated, and computer systems increase in power and ubiquity, the prospects of building practical applications based on the representation of large amounts of legislation draw closer. In this paper we reflect on our experience with developing a knowledge representation language for legal rules and an inference engine for this language in the Estrella project, in order to reconsider the principles which should guide the representation of legislation. One common demand, based largely on software engineering considerations relating to maintenance, verification and validation, is that representations should be isomorphic to their sources. We explore this notion by representing a fragment of German Family Law using our tools. We show that there are several different ways of representing even this small and simple fragment of law in an isomorphic fashion. Moreover these differences matter, in terms of where the burden of proof is allocated, in terms of the explanations produced, and in terms of the operational procedures that are reflected.
Older adults' privacy considerations for vision based recognition methods of eldercare applications
Authors: George Demiris, Debra Parker Oliver, Jarod Giger, Marjorie Skubic, Marilyn Rantz
Venue: Technology and Health Care (2009)

This study aims to explore older adults' privacy considerations for technology based monitoring applications in eldercare that use video systems. It specifically aims to introduce alternative vision based tools and identify whether distorting or "anonymizing" captured images affect older adults' privacy concerns and willingness to allow such an application to be installed in their residence. Ten residents of an independent retirement community were recruited to participate in a series of scenarios. Each scenario involved a daily activity such as sitting in the living room and having a visitor, or preparing a snack. These sessions were video-recorded using different image processing and extraction approaches. Follow-up in-depth interviews with participants were conducted after a demonstration of the captured images. Findings indicate that shape extraction can alleviate privacy concerns associated with the use of cameras. Participants expressed no privacy concerns with silhouette images and emphasized the importance of anonymity in the video sequences. They furthermore expressed the desire to control system operation by being able to turn a vision-based system off and on, and also determine who has access to the collected information.
Measuring syntactic difference in British English
Authors: Nathan C. Sanders
Venue: Proceedings of the 45th Annual Meeting of the ACL: Student Research Workshop (2007)

Recent work by Nerbonne and Wiersma (2006) has provided a foundation for measuring syntactic differences between corpora. It uses part-of-speech trigrams as an approximation to syntactic structure, comparing the trigrams of two corpora for statistically significant differences. This paper extends the method and its application. It extends the method by using leaf-path ancestors of Sampson (2000) instead of trigrams, which capture internal syntactic structure---every leaf in a parse tree records the path back to the root. The corpus used for testing is the International Corpus of English, Great Britain (Nelson et al., 2002), which contains syntactically annotated speech of Great Britain. The speakers are grouped into geographical regions based on place of birth. This is different in both nature and number than previous experiments, which found differences between two groups of Norwegian L2 learners of English. We show that dialectal variation in eleven British regions from the ICE-GB is detectable by our algorithm, using both leaf-ancestor paths and trigrams.
Designing a story-based platform for HIV and AIDS counseling with Tanzanian children
Authors: Marcus Duveskog, Kati Kemppainen, Roman Bednarik, Erkki Sutinen
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

Our research was conducted within a larger HIV and AIDS counseling project in the southern part of Tanzania. We spent six months creating a pilot version of an interactive digital platform that would allow learners to share their experiences with the disease. The platform, called Sura ya UKIMWI (The Face of AIDS), was designed by a team consisting of secondary school children, university counseling students, HIV counseling experts and experts in ICT. We took the case study approach and report on observations and experiences with the participatory design (PD) process and its outcomes, in this specific context. The results of the project indicate that the technology created under the PD paradigm helps students to easily compose their own stories thereby supporting their understanding and reflection on how these stories relate to their own life experiences. Interacting with the stories was entertaining to the students and they could identify the lessons to be learned. The approach can be an alternative to past attempts that mostly imported technology for HIV and AIDS education. Our experience can be used as a guide in establishing similar digital projects in other parts of the HIV and AIDS affected world.
Transaction processing monitor (TPM) real-time benchmark testbed
Authors: Maria Luisa Catalan, R. Dennis A. Ludena, Hidenori Umeno, Masayoshi Aritsugi
Venue: Proceedings of the 2nd conference on European computing conference (2008)

The Transaction Processing Monitor (TPM) is the standard middleware used in different e-commerce systems from large enterprises to medium and small businesses available in the internet. Because of its significantly growing popularity, the necessity for a more efficient TPM performance is now becoming a major concern between developers and researchers. Due to this concern, the need for a high-end benchmark platform for TPM is at present very vital to meet the high performance needs of online transactions. In this paper, we propose an environment using the real-time emulation capabilities of NS2 and the virtualization capabilities of Xen, in order to provide a testbed with the characteristics and behavior of a real network.
Data Integration with the DaltOn Framework --- A Case Study
Authors: Stefan Jablonski, Bernhard Volz, M. Abdul Rehman, Oliver Archner, Olivier Curé
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

Data integration has gained a great attention in current scientific applications due to the increasingly high volume of heterogeneous data and proliferation of diverse data generating devices such as sensors. Recently evolved workflow systems contributed a lot towards scientific data integration by exploiting ontologies. Even though they offer good means for modeling computational workflows, they were proved not to be sufficiently strong in addressing data related issues in a transparent and structured manner. The DaltOn system improves the productivity of scientists by providing a framework which copes with these issues in a transparent and well structured manner. In this paper we will elaborate its application in a real world scenario taken from meteorological research where data are retrieved from a sensor network and are integrated into a central scientific database.
Social Web Evolution: Integrating Semantic Applications and Web 2.0 Technologies, 1st edition
Authors: Miltiadis D. Lytras, Patricia Ordonez de Pablos
Venue: Advances In Semantic Web And Information Systems (2009)

As semantic technologies prove their value with targeted applications, there are increasing opportunities to consider their usefulness in social contexts for knowledge, learning, and human development. Social Web Evolution: Integrating Semantic Applications and Web 2.0 Technologies explores the potential of Web 2.0 and its synergies with the Semantic Web and provides state-of-the-art theoretical foundations and technological applications. A reference edition for academicians, practitioners, policy makers, and government officers eager for knowledge on Web 2.0 and social Web, this book emphasizes practical aspects of the integration of semantic applications into social Web technologies.
Authenticated join processing in outsourced databases
Authors: Yin Yang, Dimitris Papadias, Stavros Papadopoulos, Panos Kalnis
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Database outsourcing requires that a query server constructs a proof of result correctness, which can be verified by the client using the data owner's signature. Previous authentication techniques deal with range queries on a single relation using an authenticated data structure (ADS). On the other hand, authenticated join processing is inherently more complex than ranges since only the base relations (but not their combination) are signed by the owner. In this paper, we present three novel join algorithms depending on the ADS availability: (i) Authenticated Indexed Sort Merge Join (AISM), which utilizes a single ADS on the join attribute, (ii) Authenticated Index Merge Join (AIM) that requires an ADS (on the join attribute) for both relations, and (iii) Authenticated Sort Merge Join (ASM), which does not rely on any ADS. We experimentally demonstrate that the proposed methods outperform two benchmark algorithms, often by several orders of magnitude, on all performance metrics, and effectively shift the workload to the outsourcing service. Finally, we extend our techniques to complex queries that combine multi-way joins with selections and projections.
Searching 2.0, 1st edition
Authors: Michael P. Sauers
Venue:  (2009)

Here mastertrainer Michael Sauers applies the super-search strategies he is known for to the latest generation of Web tools. Blogs, RSS, wikis, Flickr, podcasting, mashups, the read/write Web, kartoo, BitTorrent, Google Book Search, the WayBack Machine, visual search engines, folksonomies, Firefox Search Plugins, Del.icio.us.... if you aren t intimately familiar with these tools and how to fully exploit them in your daily reference work, then this book is for you. Irreverent and fun to read, with a wealth of screen shots, this is a comprehensive guide to searches that make the most of the Web 2.0 environment: from improving basic search skills and evaluating search results to making the best use of search engines, both common and cutting-edge. Sauers reviews each Web 2.0 tool for reliability and appropriateness in different search tasks and shows you how best to organize them for quick access at the reference desk. You (and your patrons, once you show them how) will use Sauers s advanced and special search methods again and again, and Sauers s enthusiasm will have you running from the book to your computer every ten minutes. Exercises in each chapter will help you cement your new knowledge into practical skills.
WhereAmI: A realworld testbed for location services
Authors: John Etherton, Russell J. Clark, Matt Sanders
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Location-based services are playing an increasingly important role in the rapidly evolving world of mobile applications. Despite this importance, there are numerous challenges to providing a widely implemented and usable service that spans multiple places, devices, and location technologies. This paper describes WhereAmI, a unique location services testbed that addresses these challenges and is enabling significant research and development of location-based applications and services.
GreenWave distributed traffic intersection control
Authors: Dominic Greenwood, Branislav Burdiliak, Ivan Trencansky, Hartmut Armbruster, Christian Dannegger
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

This demonstration proposal is for a distributed traffic intersection traffic-light control called GreenWave. The solution couples camera sensors with a novel collaborative multi-agent goal-oriented control algorithm to outperform both conventional and theoretical approaches. The system is designed for real use, although simulated traffic data will be used for the demonstration.
Sequential calibration of computer models
Authors: William Notz
Venue:  (2008)

Computer experiments are becoming popular for their ability to simulate complex physical systems at relatively cheap cost. Since these computer experiments may run very time consuming codes, it is difficult to get many observations and hence statistical models are used to estimate the responses from such codes at untried input points. In the calibration problem in computer experiments, observations from both the computer experiment and the physical experiment are used to find the best setting of the calibration parameters (unknown physical constants in the physical process or inputs to the computer experiment which do not have a counterpart in physical process being studied) so that outputs from the computer experiment are in agreement with the output from the physical experiment. This thesis discusses a new method to solve the calibration problem. This method coupled with new sequential design strategies for calibration proposed in this thesis is shown to be effective in reducing the number of observations required for the estimates of the calibration parameters to converge to the true value. Sequential designs are proposed for the case when additional observations from only the computer experiment can be observed and the case when additional observations from both physical and computer experiments can be observed. This thesis also discusses a simple method to tune a computer model so that output from the computer experiment are in agreement with the output from the physical system output when the physical system changes slowly with time. Guidelines are provided for when these methods might be useful.
Domain decomposition solution of nonlinear two-dimensional parabolic problems by random trees
Authors: Juan A. Acebrón, Ángel Rodríguez-Rozas, Renato Spigler
Venue: Journal of Computational Physics (2009)

A domain decomposition method is developed for the numerical solution of nonlinear parabolic partial differential equations in any space dimension, based on the probabilistic representation of solutions as an average of suitable multiplicative functionals. Such a direct probabilistic representation requires generating a number of random trees, whose role is that of the realizations of stochastic processes used in the linear problems. First, only few values of the sought solution inside the space-time domain are computed (by a Monte Carlo method on the trees). An interpolation is then carried out, in order to approximate interfacial values of the solution inside the domain. Thus, a fully decoupled set of sub-problems is obtained. The algorithm is suited to massively parallel implementation, enjoying arbitrary scalability and fault tolerance properties. Pruning the trees is shown to increase appreciably the efficiency of the algorithm. Numerical examples conducted in 2D, including some for the KPP equation, are given.
Using Schema Analysis for Feedback in Authoring Tools for Learning Environments
Authors: Harrie Passier, Johan Jeuring
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

Course material for electronic learning environments is often structured using schema languages. During the specification and development of course material, many mistakes can be made. We introduce schema-analysis as a technique to analyse structured documents, and to point out mistakes introduced by an author. With this technique we are able to produce valuable feedback.
Definitions in Court Decisions --Automatic Extraction and Ontology Acquisition
Authors: Stephan Walter, Manfred Pinkal
Venue: Proceeding of the 2009 conference on Law, Ontologies and the Semantic Web: Channelling the Legal Information Flood (2009)

This paper deals with the use of computational linguistic analysis techniques for information access and ontology learning within the legal domain. We present a rule-based approach for extracting and analysing definitions from parsed text and evaluate it on a corpus of about 6000 German court decisions. The results are applied to improve the quality of a text based ontology learning method on this corpus. This paper describes research within the project CORTE funded by the German Science Foundation, DFG PI 154/10-1 (http://www.coli.uni-saarland.de/projects/corte/)
PowerPoint for Teachers: Dynamic Presentations and Interactive Classroom Projects
Authors: Ellen Finkelstein, Pavel Samsonov
Venue:  (2007)

PowerPoint for Teachers is written for especially for teachers like you, who want to use PowerPoint in the classroom to enhance your presentations, teach your students how to use the application, and create interactive educational projects. No matter what your level of expertise--just getting started or seasoned pro--PowerPoint for Teachers gives you the step-by-step information you need to introduce PowerPoint into your classroom and offers a great selection of creative projects for your students. PowerPoint for Teachers includes the dos and don'ts for best results and * shows you how to use PowerPoint most effectively for classroom presentations * demonstrates how to use PowerPoint to create interactive applications--including clickable maps, interactive quizzes, and games--all through simple steps, with no programming knowledge needed * offers tips on how best to teach PowerPoint to your students * contains suggestions for creating the most effective presentations and projects for different age groups. In addition, this handy resource includes sample customizable presentations and interactive games and activities that are available for free from the companion website.