ppxscal/embedding_network huggingface dataset:
Tactile object exploration using cursor navigation sensors
Authors: Dirk Kraft, Alexander Bierbaum, Morten Kjaergaard, Jurgis Ratkevicius, Anders Kjaer-Nielsen, Charlotte Ryberg, Henrik Petersen, Tamim Asfour, Rudiger Dillmann, Norbert Kruger
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

In robotic applications tactile sensor systems serve the purpose of localizing a contact point and measuring contact forces. We have investigated the applicability of a sensorial device commonly used in cursor navigation technology for tactile sensing in robotics. We show the potential of this sensor for active haptic exploration. More specifically, we present experiments and results which demonstrate the extraction of relevant object properties such as local shape, weight and elasticity using this technology. Besides its low price due to mass production and its modularity, an interesting aspect of this sensor is that beside a localization of contact points and measurement of the contact normal force also shear forces can be measured. This is relevant for many applications such as surface normal estimation and weight measurements. Scalable tactile sensor arrays have been developed with this sensor which can be arranged as tiles on a surface, e.g. a manipulator.
Teacher's Desktop: A System for Distributing the Location of Useful Information on the Web for School Teachers
Authors: Tatsuya Horita, Mari Wada, Takeharu Ishizuka, Hiroshi Hatakeda, Eita Aoki, Tomoyuki Sugiyama, Hiroyasu Itoh, Shin Sasada
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

This paper describes the development of a system for distributing the location of information found on the Web that is useful to teachers. The system is known as Teacher's Desktop (hereafter TD). Development first involved exploration for Web information that is useful to teachers. This information was identified and compiled in a list. The TD system identifies the locations of items of Web information on the list that have been updated and distributes them to teachers using RSS technology. Operational trials demonstrated the operability of the system, and the usefulness of the Web information was recognized. On the other hand, this also revealed issues concerning the improvement of educational information on the Web in order to make the content easier to distribute, including making Web information that is useful to teachers compatible with RSS.
SimpleNPKL: simple non-parametric kernel learning
Authors: Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity of standard interior-point SDP solvers could be as high as O(n6.5). Such intensive computation cost prohibits NPK learning applicable to real applications, even for data sets of moderate size. In this paper, we propose an efficient approach to NPK learning from side information, referred to as SimpleNPKL, which can efficiently learn non-parametric kernels from large sets of pairwise constraints. In particular, we show that the proposed SimpleNPKL with linear loss has a closed-form solution that can be simply computed by the Lanczos algorithm. Moreover, we show that the SimpleNPKL with square hinge loss can be re-formulated as a saddle-point optimization task, which can be further solved by a fast iterative algorithm. In contrast to the previous approaches, our empirical results show that our new technique achieves the same accuracy, but is significantly more efficient and scalable.
Mobile Multimedia Communications: Concepts, Applications, and Challenges
Authors: Gour Karmakar, Laurence S. Dooley
Venue:  (2007)

With rapid growth of the Internet, the applications of multimedia are burgeoning in every aspect of human life including communication networks and wireless and mobile communications. Mobile Multimedia Communications: Concepts, Applications, and Challenges captures defining research on all aspects and implications of the accelerated progress of mobile multimedia technologies. Covered topics include fundamental network infrastructures, modern communication features such as wireless and mobile multimedia protocols, personal communication systems, mobility and resource management, and security and privacy issues. A complete reference to topics driving current and potential future development of mobile technologies, this essential addition to library collections will meet the needs of researchers in a variety of related fields.
Inheritance and Polymorphism in Datalog: an experience in Model Management
Authors: Paolo Atzeni, Giorgio Gianforme
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

We discuss the use of a Datalog extension that refers to a data model with inheritance in order to manage the generic dictionary of MIDST, our Model Management proposal for the generation of translation of schemas and databases from a model to another. In comparable scenarios, with structural similarities of predicates of the data model and syntactical and semantical similarities of rules, the use of hierarchies and a sort of polymorphism provide a significant simplification in the definition of complete translations (Datalog programs) and a higher level of reuse in the specification of elementary translations (Datalog rules) thus simplifying the development of such rule based systems.
Brain Meets Brawn: Why Grid and Agents Need Each Other
Authors: Ian Foster, Nicholas R. Jennings, Carl Kesselman
Venue: Proceeding of the 2005 conference on Towards the Learning Grid: Advances in Human Learning Services (2005)

The Grid and agent communities both develop concepts and mechanisms for open distributed systems, albeit from different perspectives. The Grid community has historically focused on “brawn”: infrastructure, tools, and applications for reliable and secure resource sharing within dynamic and geographically distributed virtual organizations. In contrast, the agent's community has focused on “brain”: autonomous problem solvers that can act flexibly in uncertain and dynamic environments. Yet as the scale and ambition of both Grid and agent deployments increase, we see a convergence of interests, with agent systems requiring robust infrastructure and Grid systems requiring autonomous, flexible behaviors. Motivated by this convergence of interests, we review the current state of the art in both areas, review the challenges that concern the two communities, and propose research and technology development activities that can allow for mutually supportive efforts.
BitDew: A data management and distribution service with multi-protocol file transfer and metadata abstraction
Authors: Gilles Fedak, Haiwu He, Franck Cappello
Venue: Journal of Network and Computer Applications (2009)

Desktop Grids use the computing, network and storage resources from idle desktop PCs distributed over multiple-LANs or the Internet to compute a large variety of resource-demanding distributed applications. While these applications need to access, compute, store and circulate large volumes of data, little attention has been paid to data management in such large-scale, dynamic, heterogeneous, volatile and highly distributed Grids. In most cases, data management relies on ad hoc solutions, and providing a general approach is still a challenging issue. A new class of data management service is desirable to deal with such a variety of file transfer protocols than client/server, P2P or the new and emerging Cloud storage service. To address this problem, we propose the BitDew framework, a programmable environment for automatic and transparent data management on computational Desktop Grids. This paper describes the BitDew programming interface, its architecture, and the performance evaluation of its runtime components. BitDew relies on a specific set of metadata to drive key data management operations, namely life cycle, distribution, placement, replication and fault tolerance with a high level of abstraction. The BitDew runtime environment is a flexible distributed service architecture that integrates modular P2P components such as DHTs (Distributed Hash Tables) for a Distributed Data Catalog and collaborative transport protocols for data distribution. We explain how to plug-in new or existing protocols and we give evidence of the versatility of the framework by implementing HTTP, FTP and BitTorrent protocols and access to the Amazon S3 and IBP Wide Area Storage. We describe the mechanisms used to provide asynchronous and reliable multi-protocols transfers. Through several examples, we describe how application programmers and BitDew users can exploit BitDew's features. We report on performance evaluation using micro-benchmarks, various usage scenarios and data-intense bioinformatics application, both in the Grid context and on the Internet. The performance evaluation demonstrates that the high level of abstraction and transparency is obtained with a reasonable overhead, while offering the benefit of scalability, performance and fault tolerance with little programming cost.
BI Publisher for Oracle E-Business Suite
Authors: Roel A. Hogendoorn
Venue:  (2007)

This book explains in the purpose and concepts of the BI Publisher in the Oracle e-Business Suite. It is explained via step-by-step examples, with lots of screenshots. Most things in BI Publisher are not difficult, as long as you have good examples. And this book is packed with clear examples that you can easily copy for your purpose. The content is valid for BI Publisher standalone and BI Publisher integrated in Oracle eBS R11i and R12.
Supporting analysis of future-related information in news archives and the web
Authors: Adam Jatowt, Kensuke Kanazawa, Satoshi Oyama, Katsumi Tanaka
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

A lot of future-related information is available in news articles or Web pages. This information can however differ to large extent and may fluctuate over time. It is therefore difficult for users to manually compare and aggregate it, and to re-construct the most probable course of future events. In this paper we approach a problem of automatically generating summaries of future events related to queries using data obtained from news archive collections or from the Web. We propose two methods, explicit and implicit future-related information detection. The former is based on analyzing the context of future temporal expressions in documents, while the latter relies on detecting periodical patterns in historical document collections. We present a graph-based visualization of future-related information and demonstrate its usefulness through several examples.
Constructing algebraic groups from their Lie algebras
Authors: Willem A. de Graaf
Venue: Journal of Symbolic Computation (2009)

A connected algebraic group in characteristic 0 is uniquely determined by its Lie algebra. In this paper algorithms are given for constructing an algebraic group in characteristic 0, given its Lie algebra. In particular, this leads to an algorithm for finding a maximal reductive subgroup and the unipotent radical of an algebraic group.
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
Authors: Kangbok Lee, Byung-Cheon Choi, Joseph Y. -T. Leung, Michael L. Pinedo
Venue: Information Processing Letters (2009)

We consider a multi-agent scheduling problem on a single machine in which each agent is responsible for his own set of jobs and wishes to minimize the total weighted completion time of his own set of jobs. It is known that the unweighted problem with two agents is NP-hard in the ordinary sense. For this case, we can reduce our problem to a Multi-Objective Shortest-Path (MOSP) problem and this reduction leads to several results including Fully Polynomial Time Approximation Schemes (FPTAS). We also provide an efficient approximation algorithm with a reasonably good worst-case ratio.
Design and Use of Technology Enhanced Learning Environments
Authors: Barbara Wasson
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

The rapid advancement pervasiveness of ICT---especially in Norway where use of converging information and communication technologies is one of the highest in the world---is radically changing the possibilities for technology enhanced learning (TEL). Technological advancements, a perspective on knowledge as a cultural artefact, and our understandings of teaching and learning have influenced changes in learning environments during the past four decades. This has created new conditions for society and for its institutions that are challenging our basic assumptions about the nature of learning, teaching and educational activities in modern knowledge societies. A fundamental challenge for TEL is how to design technology enhanced learning environments sensitive to the complex interconnections between pedagogical, technological and organisational issues and how to understand their use. First, this concerns an understanding of how humans interact and communicate while learning through technologies ranging from web-based applications or mobile devices to advanced multimedia systems and context aware and augmented reality. Second, it concerns further advancements in software applications and multimedia design and a deeper understanding of their affordances for human learning. Third, it concerns pedagogical designs and how central principles of learning and human development must be integrated into innovative learning environments in order to enable productive learning. Fourth, it concerns an understanding of infrastructural issues and how social organisations inhibit or afford the adoption of ICT mediated learning. In this presentation I will focus on the design and use technology enhanced learning environments. I will show how my Scandinavian experience has influenced my perspective on ICT and on learning, thus helping shape my understanding of Technology Enhanced Learning. I will use examples from some of the projects in which I have been involved, with a focus on collaborative learning in distributed environments.
Silverlight Essential Training
Authors: Mike Harsh
Venue:  (2007)

Mike Harsh is the program manager on the Silverlight team at Microsoft. In Silverlight Essential Training, he gives viewers an insider's look into this powerful application. Mike teaches each step in the process of building interactive web applications using Silverlight, including how to add video, animations, and interactive features such as drag-and-drop functionality. Exercise files accompany the tutorials. 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
Text summarizer in use: lessons learned from real world deployment and evaluation
Authors: Mary Ellen Okurowski, Harold Wilson, Joaquin Urbina, Tony Taylor, Ruth Colvin Clark, Frank Krapcho
Venue: NAACL-ANLP 2000 Workshop on Automatic Summarization (2000)

Much of the historical and current summarization literature has been technologycentered with the questions posed and answered having implications for technology development. Though commercial summarization products have appeared in the market place and developers continue to explore new summarization areas, few papers have been user-centered, examining summarization technology in-use. In this paper, we show how applied work and the knowledge gleaned about technology in-use can temper theoretical considerations and motivate as well as direct development likely to result in higher return on investment.
Making Learning Design Standards Work with an Ontology of Educational Theories
Authors: Valéry Psyché, Jacqueline Bourdeau, Roger Nkambou, Riichiro Mizoguchi
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

In this paper, we present an ontology of educational theories their relation to learning design. This ontology takes into account learning design (LD) specifications such as OUNL-EML and IMS-LD at the conceptual level (1), semantic web standards such as OWL at the formal level (2), as well as JAVA standards at the implementation level (3). This ontology is intended to provide a knowledge base for any IMS-LD compliant authoring systems/LKMS, in order to provide services to authors of LD scenarios. The ontological engineering (OE) has been done using the Hozo ontology editor at levels 1 and 2 respectively.
Mesh-of-trees interconnection network for an explicitly multi-threaded parallel computer architecture
Authors: Uzi Vishkin
Venue:  (2008)

As the multiple-decade long increase in clock rates starts to slow down, main-stream general-purpose processors evolve towards single-chip parallel processing. On-chip interconnection networks are essential components of such machines, supporting the communication between processors and the memory system. This task is especially challenging for some easy-to-program parallel computers, which are designed with performance-demanding memory systems. This study proposes an interconnection network, with a novel implementation of the Mesh-of-Trees (MoT) topology. The MoT network is evaluated relative to metrics such as wire area complexity, total register count, bandwidth, network diameter, single switch delay, maximum throughput per area, trade-offs between throughput and latency, and post-layout performance. It is also compared with some other traditional network topologies, such as mesh, ring, hypercube, butterfly, fat trees, butterfly fat trees, and replicated butterfly networks. Concrete results show that MoT provides higher throughput and lower latency especially when the input traffic (or the on-chip parallelism) is high, at comparable area cost. The layout of MoT network is evaluated using standard cell design methodology. A prototype chip with 8-terminal MoT network was taped out at 90nm technology and tested. In the context of an easy-to-program single-chip parallel processor, MoT network is embedded in the eXplicit Multi-Threading (XMT) architecture, and evaluated by running parallel applications. In addition to the basic MoT architecture, a novel hybrid extension of MoT is proposed, which allows significant area savings with a small reduction in throughput.
Discovery of Patterns in Learner Actions
Authors: Andreas Harrer, Michael Vetter, Stefan Thür, Jens Brauckmann
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

This paper describes an approach for analysis of computer-supported learning processes utilizing logfiles of learners' actions. We provide help to researchers and teachers in finding insightful patterns of the learning process in two ways: patterns can be specified explicitly to be searched in logfiles or automatic extraction of patterns complying to configurable parameters can be initiated to find the most typical sequences within the logfile. Both support features have been implemented in a stand-alone tool that accepts generic logfiles usable with a potentially wide variety of different learning systems.
Partial neighborhoods of elementary landscapes
Authors: L. Darrell Whitley, Andrew M. Sutton
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs for the Traveling Salesman Problem, Graph Coloring and Min-Cut Graph Partitioning. The same model is then used to efficiently compute the average values over particular partial neighborhoods for these same problems. For Graph Coloring and Min-Cut Graph Partitioning, this computation can be used to focus search on those moves that are most likely to yield an improving move, ignoring moves that cannot yield an improving move. Let x be a candidate solution with objective function value f(x). The mean value of the objective function over the entire landscape is denoted f. Normally in an elementary landscape one can only be sure that a neighborhood includes an improving move (assuming minimization) if f(x) > f. However, by computing the expected value of an appropriate partial neighborhood it is sometimes possible to know that an improving move exists in the partial neighborhood even when f(x) f.
FastSum: fast and accurate query-based multi-document summarization
Authors: Frank Schilder, Ravikumar Kondadadi
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

We present a fast query-based multi-document summarizer called FastSum based solely on word-frequency features of clusters, documents and topics. Summary sentences are ranked by a regression SVM. The summarizer does not use any expensive NLP techniques such as parsing, tagging of names or even part of speech information. Still, the achieved accuracy is comparable to the best systems presented in recent academic competitions (i.e., Document Understanding Conference (DUC)). Because of a detailed feature analysis using Least Angle Regression (LARS), FastSum can rely on a minimal set of features leading to fast processing times: 1250 news documents in 60 seconds.
Accelerating design convergence using the degree of permissible concurrency
Authors: Esra E. Aleisa, Li Lin
Venue: Proceedings of the 2009 conference on Information Science, Technology and Applications (2009)

Time-consuming iterative design cycles cause critical delays within the design development process. One widely applied method to identify such iterations is the design structure matrix (DSM). Due to its distinctive ability in consistently rearranging factors of a complex problem using subjective measures, the Analytic Hierarchy Process (AHP) was requisitely applied to quantify DSM binary relations. Despite its advantages, AHP becomes intractable for large design problems, where substantial pairwise comparisons take place. The core contribution of this paper is overcome this drawback, thus facilitate faster sequencing of design tasks within a quantified DSM while utilizing the benefits of AHP.