ppxscal/embedding_network huggingface dataset:
SMiLE-Session Mobility in mobiLe Environments
Authors: Günther Hölbling, Wolfgang Pfnür, Harald Kosch
Venue: Proceeding of the 2008 conference on New Trends in Multimedia and Network Information Systems (2008)

Nowadays most people own several devices, like a notebook or a smartphone, for satisfying their mobility and flexibility needs. Without special arrangements a program, its execution state and saved files-the latter two are commonly called “session”-are confined to a physical host. Session Mobility enables the user to break this law of locality, and instead creates a relation between the session and himself. In this paper we present a novel system for supporting session mobility in various scenarios. To support an almost automatic session handover between different devices a mobile agent system has been used. The selection of target devices has also been automated based on the usage context, the device's capabilities and a rough estimation of the actual location. Based on the Session Mobility in mobiLe Environments platform (SMiLE) a use case has been realized where a video session is migrated from a notebook to a smartphone and vice versa.
Building a sustainable international digital government research community
Authors: Sharon Dawes, Natalie Helbig
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

2009 marks the fourth and final full year of this international research initiative. Its goal is to create a framework for a sustainable global community among digital government researchers and research sponsors. Funded by the US National Science Foundation, the project includes an international reconnaissance study describing the current status of digital government research, an annual international research institute for doctoral students, and a framework for several international working groups. This panel will provide an overview of the results of the initiative, focusing especially on the doctoral institute and international working groups, and will offer an opportunity to discuss experiences and ideas for fostering strong, long-lasting international digital government research partnerships.
Solution of exterior problem using ellipsoidal artificial boundary
Authors: Hongying Huang, Dongjie Liu, Dehao Yu
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper, we present a general ellipsoidal artificial boundary method for three-dimensional exterior problem. The exact artificial boundary condition, which is expressed explicitly by the series concerning the ellipsoidal harmonic functions, is derived and then an equivalent problem in a bounded domain is presented. The error estimates show that the convergence rate depends on the mesh parameter, the number of terms used in the exact artificial boundary condition, and the location of the artificial boundary.
Assessment of haptics-based interaction for assembly tasks in virtual reality
Authors: Dao M. Vo, Judy M. Vance, Mervyn G. Marasinghe
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

This paper investigates the benefits of haptics-based interaction for performing assembly-related tasks in a virtual environment. The research examines the context in which haptic feedback affects user performance and identifies assembly operations that are influenced. Forty participants completed three experiments relevant to virtual assembly: weight discrimination, part positioning, and manual assembly. Each experiment featured a series of trials generated from factorial combinations of performance variables. Subjects were assessed based on task completion time and different measures of accuracy. When compared to visual-only methods, quantitative results show that haptics-based interaction is beneficial in improving performance by reducing completion times for weight discrimination, permits higher placement accuracy when positioning virtual objects, and enables steadier hand motions along three-dimensional trajectories. The results also indicate that user accuracy in weight discrimination is dependent on hand dominance when manipulating the virtual object combined with the provided sensory information.
Discovering Areas of Expertise from Publication Data
Authors: Meredith Taylor, Debbie Richards
Venue: Knowledge Acquisition: Approaches, Algorithms and Applications: Pacific Rim Knowledge Acquisition Workshop, PKAW 2008, Hanoi, Vietnam, December 15-16, 2008, Revised Selected Papers (2009)

Expertise recommender systems are a valuable tool for keeping track of who has expertise and in what areas within an organization. The key problem is acquiring validated knowledge of expertise and keeping that information up to date. In research organizations, publications are one source of evidence of expertise which can be used to identify who knows about what. In this paper we focus on evaluating the feasibility of a simple technique for uncovering expertise used as the foundation and starting point of maintaining a profile of validated expertise within an organization.
Lossless clustering of histories in decentralized POMDPs
Authors: Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J. Spaan
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, planning optimally is difficult because solutions map local observation histories to actions, and the number of such histories grows exponentially in the planning horizon. In this work, we identify a criterion that allows for lossless clustering of observation histories: i.e., we prove that when two histories satisfy the criterion, they have the same optimal value and thus can be treated as one. We show how this result can be exploited in optimal policy search and demonstrate empirically that it can provide a speed-up of multiple orders of magnitude, allowing the optimal solution of significantly larger problems. We also perform an empirical analysis of the generality of our clustering method, which suggests that it may also be useful in other (approximate) Dec-POMDP solution methods.
Linking laser scanning to snowpack modeling: Data processing and visualization
Authors: H. Teufelsbauer
Venue: Computers Geosciences (2009)

SnowSim is a newly developed physical snowpack model that can use three-dimensional terrestrial laser scanning data to generate model domains. This greatly simplifies the input and numerical simulation of snow covers in complex terrains. The program can model two-dimensional cross sections of general slopes, with complicated snow distributions. The model predicts temperature distributions and snow settlements in this cross section. Thus, the model can be used for a wide range of problems in snow science and engineering, including numerical investigations of avalanche formation. The governing partial differential equations are solved by means of the finite element method, using triangular elements. All essential data for defining the boundary conditions and evaluating the simulation results are gathered by automatic weather and snow measurement sites. This work focuses on the treatment of these measurements and the simulation results, and presents a pre- and post-processing graphical user interface (GUI) programmed in Matlab.
Joint estimation of gene conversion rates and mean conversion tract lengths from population SNP data
Authors: Junming Yin, Michael I. Jordan, Yun S. Song
Venue: Bioinformatics (2009)

Motivation: Two known types of meiotic recombination are crossovers and gene conversions. Although they leave behind different footprints in the genome, it is a challenging task to tease apart their relative contributions to the observed genetic variation. In particular, for a given population SNP dataset, the joint estimation of the crossover rate, the gene conversion rate and the mean conversion tract length is widely viewed as a very difficult problem. Results: In this article, we devise a likelihood-based method using an interleaved hidden Markov model (HMM) that can jointly estimate the aforementioned three parameters fundamental to recombination. Our method significantly improves upon a recently proposed method based on a factorial HMM. We show that modeling overlapping gene conversions is crucial for improving the joint estimation of the gene conversion rate and the mean conversion tract length. We test the performance of our method on simulated data. We then apply our method to analyze real biological data from the telomere of the X chromosome of Drosophila melanogaster, and show that the ratio of the gene conversion rate to the crossover rate for the region may not be nearly as high as previously claimed. Availability: A software implementation of the algorithms discussed in this article is available at http://www.cs.berkeley.edu/~yss/software.html. Contact: yss@eecs.berkeley.edu
A survey of Flash Translation Layer
Authors: Tae-Sun Chung, Dong-Joo Park, Sangwon Park, Dong-Ho Lee, Sang-Won Lee, Ha-Joo Song
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2009)

Recently, flash memory is widely adopted in embedded applications as it has several strong points, including its non-volatility, fast access speed, shock resistance, and low power consumption. However, due to its hardware characteristics, specifically its ''erase-before-write'' feature, it requires a software layer known as FTL (Flash Translation Layer). This paper surveys the state-of-the-art FTL software for flash memory. It defines the problems, addresses algorithms to solve them, and discusses related research issues. In addition, the paper provides performance results based on our implementation of each FTL algorithm.
Optimally DoS Resistant P2P Topologies for Live Multimedia Streaming
Authors: Michael Brinkmeier, Günter Schäfer, Thorsten Strufe
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

Using a peer-to-peer approach for live multimedia streaming applications offers the promise to obtain a highly scalable, decentralized, and robust distribution service. When constructing streaming topologies, however, specific care has to be taken in order to ensure that quality of service requirements in terms of delay, jitter, packet loss, and stability against deliberate denial of service attacks are met. In this paper, we concentrate on the latter requirement of stability against denial-of-service attacks. We present an analytical model to assess the stability of overlay streaming topologies and describe attack strategies. Building on this, we describe topologies, which are optimally stable toward perfect attacks based on global knowledge, and give a mathematical proof of their optimality. The formal construction and analysis of these topologies using global knowledge lead us to strategies for distributed procedures, which are able to construct resilient topologies in scenarios, where global knowledge can not be gathered. Experimental results show that the topologies created in such a real-world scenario are close to optimally stable toward perfect denial of service attacks.
Behaviour modelling notation for information system design
Authors: Audris Kalnins, Edgars Celms, Elina Kalnina, Agris Sostaks
Venue: Proceedings of the 1st Workshop on Behaviour Modelling in Model-Driven Architecture (2009)

Problems related to behaviour modelling within the platform independent model (PIM) during the model driven design are discussed in the paper. The emphasis is on design problems for information systems, especially on building a behaviour draft. At first issues in the traditional approach using sequence diagrams are discussed. Then a new approach based on activity diagrams is proposed. An extension of activity diagram notation specifically oriented towards comprehensive and readable behaviour design description is presented.
Automatic Page Turning for Musicians via Real-Time Machine Listening
Authors: Andreas Arzt, Gerhard Widmer, Simon Dixon
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

We present a system that automatically turns the pages of the music score for musicians during a performance. It is based on a new algorithm for following an incoming audio stream in real time and aligning it to a music score (in the form of a synthesised audio file). Precision and robustness of the algorithm are quantified in systematic experiments, and a demonstration using an actual page turning machine built by an Austrian company is described.
EL description logics with aggregation of user preference concepts
Authors: Peter Vojtáš
Venue: Proceeding of the 2007 conference on Information Modelling and Knowledge Bases XVIII (2007)

We consider querying containing several vague concepts of user's preferences (with preference scale T ), which is quite typical in semantic web. These particular preferences need to be combined to get an overall ordering of results. We propose T-EL@ --a description logic allowing existential restrictions, crisp roles, T -fuzzy concepts and T -fuzzy combining functions @. We discuss problems of consistency, subsumption and the instance problem. We show some results on polynomial complexity of this problem. We conclude with a sketch of an embedding of T-EL@ into a sort of classical EL logic with concrete domain.
Alternating-Offers Bargaining under One-Sided Uncertainty on Deadlines
Authors: Francesco Di Giunta, Nicola Gatti
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)

Alternating-offers is the most prominent negotiation protocol for automatic bilateral bargaining. Nevertheless, in most settings it is still not known how two fully rational agents should behave in the protocol. In this paper we study the finite-horizon alternating-offers protocol under one-sided uncertain deadlines. We make a novel use of backward induction in studying bargaining with uncertainty; we employ a “natural” system of beliefs and find, when it exists, the pertinent pure strategy sequential equilibrium. We further show, as an intrinsic limitation of the protocol, that for some parameter values there is no pure strategy sequential equilibrium, whatever system of beliefs is employed.
A communication protocol for semantic heterogeneity with incomplete ontology alignment
Authors: Laurent Mazuel, Nicolas Sabouret
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Recent work shows that, in an open loosely coupled MAS, it is difficult to deal with semantic heterogeneity between agents in a static way. In this paper, we present an interaction protocol for the request interpretation which permits to manage the semantic heterogeneity when the ontology alignment is incomplete. We first briefly describe the messages translation mechanism, based upon the presence of an ontology alignment service. We then present the answer strategy of our agents, which relies on several specific performatives. We propose an experimental evaluation.
An Analysis on a Learning Support System for Tracing in Beginner's Debugging
Authors: Tsuruko Egi, Akira Takeuchi
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

We are developing a debugging support system called DESUS which guides tracing for beginners of programming. The tracing is one of tactical plans for programming, and it is an important skill for beginners as well as experts, because tracing make learners to understand the behavior of their programs. We collected learner's programs every time they were compiled during debugging by using DESUS in actual classes, and analyzed the data of how learners use and study tracing and other three kinds of tactical plans. As a result, we found that learners cannot use tracing without DESUS's support, while they can use other tactical plans without support. We also discuss effects of the system on learning tracing.
An Analysis of Support Vector Machines for Credit Risk Modeling
Authors: Murat Emre Kaya, Fikret Gurgen, Nesrin Okay
Venue: Proceeding of the 2008 conference on Applications of Data Mining in E-Business and Finance (2008)

In this study, we analyze the ability of support vector machines (SVM) for credit risk modeling from two different aspects: credit classification and estimation of probability of default values. Firstly, we compare the credit classification performance of SVM with the widely used technique of logistic regression. Then we propose a cascaded model based on SVM in order to obtain a better credit classification accuracy. Finally, we propose a methodology for SVM to estimate the probability of default values for borrowers. We furthermore discuss the advantages and disadvantages of SVM for credit risk modeling.
Bayesian clustering for email campaign detection
Authors: Peter Haider, Tobias Scheffer
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We discuss the problem of clustering elements according to the sources that have generated them. For elements that are characterized by independent binary attributes, a closed-form Bayesian solution exists. We derive a solution for the case of dependent attributes that is based on a transformation of the instances into a space of independent feature functions. We derive an optimization problem that produces a mapping into a space of independent binary feature vectors; the features can reflect arbitrary dependencies in the input space. This problem setting is motivated by the application of spam filtering for email service providers. Spam traps deliver a real-time stream of messages known to be spam. If elements of the same campaign can be recognized reliably, entire spam and phishing campaigns can be contained. We present a case study that evaluates Bayesian clustering for this application.
Prototype vector machine for large scale semi-supervised learning
Authors: Kai Zhang, James T. Kwok, Bahram Parvin
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised learning (SSL). We note that the computational intensiveness of graph-based SSL arises largely from the manifold or graph regularization, which in turn lead to large models that are difficult to handle. To alleviate this, we proposed the prototype vector machine (PVM), a highly scalable, graph-based algorithm for large-scale SSL. Our key innovation is the use of "prototypes vectors" for efficient approximation on both the graph-based regularizer and model representation. The choice of prototypes are grounded upon two important criteria: they not only perform effective low-rank approximation of the kernel matrix, but also span a model suffering the minimum information loss compared with the complete model. We demonstrate encouraging performance and appealing scaling properties of the PVM on a number of machine learning benchmark data sets.
Advected river textures
Authors: Tim Burrell, Dirk Arnold, Stephen Brooks
Venue: Computer Animation and Virtual Worlds (2009)

We present a new method for the realistic real-time simulation of rivers. Our solution includes a 2D fluid solver that simulates the flow of a river's surface, an efficient method for adaptively computing 3D flow information and an animated 3D procedural wave texture that is advected through the fluid via advection particles in order to mimic the highly detailed fluid surfaces that are characteristic of rivers. Our technique that couples animated texture advection with a pseudo-3D fluid simulation produces stable results that are representative of large-scale real-world rivers and suitable for use in real-time applications. Our system surpasses prior work on real-time river rendering both with regards to efficiency and visual quality, which we establish through the rendering of rivers tens of kilometers long. Copyright &copy; 2009 John Wiley & Sons, Ltd. We present a new method for the realistic real-time simulation of rivers. Our solution includes a 2D fluid solver that simulates the flow of a river's surface, an efficient method for adaptively computing 3D flow information and an animated 3D procedural wave texture that is advected through the fluid via advection particles in order to mimic the highly detailed fluid surfaces that are characteristic of rivers.
Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures
Authors: Georg Fuchsbauer, David Pointcheval
Venue: Formal to Practical Security: Papers Issued from the 2005-2008 French-Japanese Collaboration (2009)

We define a general model for consecutive delegations of signing rights with the following properties: The delegatee actually signing and all intermediate delegators remain anonymous. As for group signatures, in case of misuse, a special authority can open signatures to reveal all delegators' and the signer's identity. The scheme satisfies a strong notion of non-frameability generalizing the one for dynamic group signatures. We give formal definitions of security and show them to be satisfiable by constructing an instantiation proven secure under general assumptions in the standard model. Our primitive is a proper generalization of both group signatures and proxy signatures and can be regarded as non-frameable dynamic hierarchical group signatures.
Performance optimizing on multi-function MMIC design
Authors: M. C. Tu, Y. C. Wang, H. Y. Ueng
Venue: Microelectronic Engineering (2009)

Integration of GaAs BiFET (bipolar-FET) devices to obtain the optimum performance for multiple functions of MMIC design has been achieved. In this study, heterojunction bipolar transistors (HBTs), enhancement mode pseudomorphic HEMTs (E-pHEMTs), and depletion mode pHEMTs are developed for potential applications, including the integration of HBT power amplifier circuitry with pHEMT-based bias control, logic, RF switch, and low-noise amplifier circuitries. Critical processes including gate photolithography and gate recess control are presented and discussed in detail. The enhancement-depletion modes of pHEMT, HBT electrical performance, and uniformity are investigated comprehensively. In addition, power amplifiers and high power switches based on BiFET technology are investigated.
A "communication skills for computer scientists" course
Authors: Lil Blume, Ron Baecker, Christopher Collins, Aran Donohue
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

This paper describes "Communication Skills for Computer Scientists," a novel undergraduate course at the University of Toronto. We describe in detail the three major instructional streams of the course: writing, speaking, and interpersonal communications. We present a novel approach to teaching writing, interactive multimedia web technology to teach public speaking, and specific interpersonal skills training as the integral parts of the course. We contribute a detailed description of the curriculum and report measures of success, both quantitative data and reactions from students in their own words.