ppxscal/embedding_network huggingface dataset:
ISO's Work on Guidance for Haptic and Tactile Interactions
Authors: Jan B. Erp, Thorsten A. Kern
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Tactile and haptic interaction is becoming increasingly important and is no longer restricted to assistive technologies and special purpose computing environments. The technology has gone through numerous breakthroughs and replications and is now entering a period of developing empiricism, the phase in which the first benefits of this new development are becoming available. While considerable research exists, the current lack of ergonomic standards results in systems without sufficient concerns for either ergonomics or interoperability, leading to difficulties for users of multiple, incompatible or conflicting applications. ISO (through working group TC159/SC4/WG9) is working toward international standards, which are being dual-tracked as both ISO and CEN standards. This paper gives an update on the status of the Draft International Standard on tactile/haptic interactions and the recently initiated work on a framework for tactile/haptic interactions.
Role Based Access to Support Collaboration in Healthcare
Authors: Alysia Skilton, W. Alex Gray, Omnia Allam, Dave Morry, Hazel Bailey
Venue: Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge (2008)

Traditional healthcare information systems have been developed and organized as silos. However, recent changes in healthcare delivery models have resulted in the widespread creation of MultiDisciplinary care Teams (MDTs). These teams consist of practitioners with a variety of specialties often sited at different locations [1, 2]. This collaborative approach has led to a significant shift in information needs. However, existing information systems are not designed to support this new level of collaboration and technical support for practitioners has not kept pace with changing needs [3]. As every case is different, one of the many information challenges of this new paradigm is that of providing appropriate views to practitioners based on the unique needs of the patient as well as the practitioner's role with that patient. This paper will describe an individualized role based approach to data views for healthcare providers using an independent system to access data stored in existing healthcare information systems.
Automating the Generation of Semantic Annotation Tools Using a Clustering Technique
Authors: Vitór Souza, Nicola Zeni, Nadzeya Kiyavitskaya, Periklis Andritsos, Luisa Mich, John Mylopoulos
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

In order to generate semantic annotations for a collection of documents, one needs an annotation schema consisting of a semantic model (a.k.a. ontology) along with lists of linguistic indicators (keywords and patterns) for each concept in the ontology. The focus of this paper is the automatic generation of the linguistic indicators for a given semantic model and a corpus of documents. Our approach needs a small number of user-defined seeds and bootstraps itself by exploiting a novel clustering technique. The baseline for this work is the Cerno project [8] and the clustering algorithm LIMBO [2]. We also present results that compare the output of the clustering algorithm with linguistic indicators created manually for two case studies.
Edge Enhancement Post-processing Using Hopfield Neural Net
Authors: Zhaoyu Pian, Liqun Gao, Kun Wang, Li Guo, Jianhua Wu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

A novel edge enhancement based on Hopfield neural net is presented in this paper, which is a post-processing complement for a pre-existing edge detector. This term is added to the output of the edge detector. Firstly, the energy function which is used to find the final stable edges is provided in the Hopfield neural net, and then, based on the window iteration, it improves the performance of the edge detector by recovering missing edges and eliminating false edges. In experiments conducted on various images, we demonstrate the performance of the algorithm on them.
From Verification to Synthesis
Authors: Moshe Y. Vardi
Venue: Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments (2008)

One of the most significant developments in the area of design verification over the last decade is the development of of algorithmic methods for verifying temporal specification of finite-state designs [2]. A frequent criticism against this approach, however, is that verification is done after significant resources have already been invested in the development of the design. Since designs invariably contains errors, verification simply becomes part of the debugging process. The critics argue that the desired goal ought to be the use of the specification in the design development process in order to guarantee the development of correct designs. This is called design synthesis [1,4]. In this talk I will review 50 years of research on the synthesis problem and show how the automata-theoretic approach can be used to solve it [3,4,5].
An Efficient Implementation of the Thomas-Algorithm for Block Penta-diagonal Systems on Vector Computers
Authors: Katharina Benkert, Rudolf Fischer
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

In simulations of supernovae, linear systems of equations with a block penta-diagonal matrix possessing small, dense matrix blocks occur. For an efficient solution, a compact multiplication scheme based on a restructured version of the Thomas algorithm and specifically adapted routines for LU factorization as well as forward and backward substitution are presented. On a NEC SX-8 vector system, runtime could be decreased between 35% and 54% for block sizes varying from 20 to 85 compared to the original code with BLAS and LAPACK routines.
Navigation in Knowledge-Based System for Helpdesk Based on FCA
Authors: Vladimír Sklenář, Martin Radvanský, Michal Dobeš
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

An important part of knowledge-based systems for helpdesk is a database of incidents that were solved in the past. A major part of the reported incidents is related to relatively small sets of repeated problems. It is important that these repeated problems are correctly recognized and their solutions are stored. In order to solve the new incident we can use the experience of solving a similar previously reported problem. Such a process is known as Case Based Reasoning (CBR). In practice however, it is not always immediately clear what the problem is about. It is due to the fact that different customer may describe the same problem in a different way. In this paper we describe an application of the helpdesk system which is based on Formal Concept Analysis (FCA), and enables to find analogous incidents by using navigation within the concept lattice.
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions
Authors: Alexandre Goldsztejn, Laurent Granvilliers
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

When numerical CSPs are used to solve systems of n equations with n variables, the interval Newton operator plays a key role: It acts like a global constraint, hence achieving a powerful contraction, and proves rigorously the existence of solutions. However, both advantages cannot be used for under-constrained systems of equations, which have manifolds of solutions. A new framework is proposed in this paper to extend the advantages of the interval Newton to under-constrained systems of equations. This is done simply by permitting domains of CSPs to be parallelepipeds instead of the usual boxes.
An Anticipatory Trust Model for Open Distributed Systems
Authors: Mario Gómez, Javier Carbó, Clara Benac-Earle
Venue: Anticipatory Behavior in Adaptive Learning Systems: From Brains to Individual and Social Behavior (2007)

Competitive distributed systems pose a challenge to trust modeling due to the dynamic nature of these systems (e.g. electronic auctions) and the unreliability of self-interested agents. We propose a trust model which does not assume a concrete cognitive model for other agents that an agent may interact with, but uses the discrepancy between the information provided by other agents and its own experience in order to anticipate their actions. By anticipating the behavior of other agents, an agent is able to adapt more effectively to changes in the environment for its own benefit.
G3 Transition Curve Between Two Straight Lines
Authors: Azhar Ahmad, Jamaluddin Md. Ali.
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

This paper describes a G3 transition curve based on quartic Bezier spiral to be used in the design of horizontal geometry of routes. The curve that joins two straight lines will be the composition of spiral-circular arc-spiral forms. It is an alternative curve to traditionally used transition spiral; Clothoid. A family of quartic Bezier spiral is defined from analyzing the monotone curvature conditions, and has G3 points of contact properties, which is better than clothoid in terms of smooth transitions regarding to the vehicle-road dynamics. The function of the lateral change of acceleration (LCA) of the curves are applied and illustrated, by means to make the comparison between the transition curve based on quartic Bezier spiral and the traditional transition spiral.
Verification Technology Transfer
Authors: R. P. Kurshan
Venue: 25 Years of Model Checking: History, Achievements, Perspectives (2008)

In the last quarter century computer-aided verification --- especially in the form of model checking --- has evolved from a research concept to a commercial product. While the pace of this technology transfer was anything but rapid, the new technology had almost insuperable hurdles to jump on its way to the market place. Hurdle number one was a required significant change in methodology. On account of its limited capacity, model checking must be applied only to design components (RTL blocks in the case of hardware) instead of the whole design as with simulation test. Thus, the functional behavior of these design components must be specified. Since component level functionality is often revealed at best obscurely in the design's functional specification, either designers must convey component functionality to those doing the testing or else testers must somehow fathom it on their own. The former was considered an unacceptable diversion of vaunted designer resources while the latter was often undoable. A second hurdle was uncertainty surrounding the quality of the new tools. Initially the tools were incomparable and required the user to create considerable tool-specific infrastructure to specify properties before a tool could be evaluated. Recreating the required infrastructure for several tools was infeasible. This meant choosing a tool without a head-to-head evaluation against other tools. With the high cost and uncertain outcome afforded by these hurdles, no circuit manufacturer was willing even to consider seriously this new technology. Not, that is, until the cost of testing-as-usual became higher than the cost of jumping these formidable hurdles. This essay is the saga of the transfer of computer-aided verification technology from research to the market place.
Beanbag Robotics: Robotic Swarms with 1-DoF Units
Authors: David M. Kriesel, Eugene Cheung, Metin Sitti, Hod Lipson
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

Robotic swarm behavior is usually demonstrated using groups of robots, in which each robot in the swarm must possess full mobile capabilities, including the ability to control both forward and reverse motion as well as directional steering. Such requirements place severe constraints on the cost and size of the individual robots (swarmers), limiting the number of units and constraining the overall minimal size of a swarm. Here we show that similarly-complex swarm behavior can be achieved using much simpler individual swarmers. These possess significantly fewer controllable degrees of freedom, namely the ability to move forward at different velocities. We demonstrate how the interaction between different units then causes the entire swarm to obtain maneuverability unavailable at the individual level. These results may open the door to fabrication of simpler and smaller units for swarms allowing significantly larger numbers of units and smaller overall swarm footprints.
Dynamic Behavioral Models for Wideband Wireless Transmitters Stimulated by Complex Signals Using Neural Networks
Authors: Taijun Liu, Yan Ye, Slim Boumaiza, Fadhel M. Ghannouchi
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

In this paper, a time-delay structure is included in the neural network architecture to emulate the memory effects of wideband wireless transmitters. A simplified analysis approach is proposed to illustrate that the Real-Valued Time-Delay Neural Network (RVTDNN) is one of the most promising neural networks for modeling a complex dynamic nonlinear system. Then the RVTDNN is utilized to build the complex signal dynamic behavioral model of a wideband transmitter. Finally, a behavioral model with three-layer RVTDNN is employed in an experimental system to demonstrate the effectiveness of RVTDNNs in mimicking the dynamic behaviors of a wideband wireless transmitter.
Constants and Functions in Peirce's Existential Graphs
Authors: Frithjof Dau
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

The system of Peirce's existential graphs is a diagrammatic version of first order logic. To be more precise: As Peirce wanted to develop a logic of relatives (i.e., relations), existential graphs correspond to first order logic with relations and identity, but without constants or functions. In contemporary elaborations of first order logic, constants and functions are usually employed. In this paper, it is described how the syntax, semantics and calculus for Peirce's existential graphs has to be extended in order to encompass constants and functions as well.
The Four Colour Theorem: Engineering of a Formal Proof
Authors: Georges Gonthier
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

The 150 year old Four Colour Theorem is the first famous result with a proof that requires large computer calculations. Such proofs are still controversial: It is thought that computer programs cannot be reviewed with mathematical rigor.To overturn this belief, we have created a fully computer-checked proof of the Four Colour Theorem. Using the Coq proof assistant, we wrote an extended program that specifies both the calculations and their mathematical justification. Only the interface of the program --- the statement of the theorem --- needs to be reviewed. The rest (99.8%) is self-checking: Coq verifies that it strictly follows the rules of logic. Thus, our proof is more rigorous than a traditional one.Our effort turned out to be more than just an exercise in verification; having to definine rigorously all key concepts provided new mathematical insight into the concept of planarity. Planarity has topological and combinatorial characterizations, which are often confused in arguments that are both pictorially appealing and logically incomplete. The rigor of our computer proof imposed a strict separation between the two.We developed a purely combinatorial theory of planarity based on a symmetrical presentation of hypermaps, which greatly simplified the proof. The theory supplies an elegant analogue of the Jordan Curve property, which allowed us to prove the Theorem under minimal topological assumptions, without appealing to Jordan Curve theorem.
Pro Java EE Spring Patterns: Best Practices and Design Strategies Implementing Java EE Patterns with the Spring Framework
Authors: Dhrubojyoti Kayal
Venue: Pro (2008)

The Java landscape is littered with libraries, tools, and specifications. Whats been lacking is the expertise to fuse them into solutions to realworld problems. These patterns are the intellectual mortar for J2EE software construction. John Vlissides, coauthor of Design Patterns: Elements of Reusable ObjectOriented Software Pro Java EE Spring Patterns focuses on enterprise patterns, best practices, design strategies, and proven solutions using key Java EE technologies including JSP, servlets, EJB, and JMS APIs. This Java EE patterns resource, catalog, and guide, with its patterns and numerous strategies, documents and promotes best practices for these technologies, implemented in a very pragmatic way using the Spring Framework and its counters. This title Introduces Java EE application design and Spring framework fundamentals Describes a catalog of patterns used across the three tiers of a typical JEE application Provides implementation details and analyses each pattern with benefits and concerns Describes the application of these patterns in a practical application scenario What youll learn Get an introduction to enterprise Java/Java EE application design patterns. Simplify enterprise Java design using the popular Spring Framework. Examine presentation, business, web, and integration tier design patterns and best practices, including crosscutting design patterns, AOP, etc. See how the enhanced and uptodate pattern catalog compares to core J2EE design blueprints. Learn how to use comprehensive source code and configuration information. Develop order management system requirements for the first indepth enterprise application case study. Design your order management system application using the final case study. Who is this book for? This book is for Java EE application architects, designers, and developers using or planning to use the Spring Framework. About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career.
An Experimental Evaluation of Documentation Methods and Reusability
Authors: Martin Blom, Eivind J. Nordby, Anna Brunstrom
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

This paper presents an experimental evaluation carried out in an academic environment. The goal of the experiment was to compare how different methods of documenting semantic information affect software reuse. More specifically, the goal was to measure if there were any differences between the methods with regard to the time needed to implement changes to existing software. Four methods of documentation were used; executable contracts, non-executable contracts, Javadoc-style documentation and sequence diagrams. The results indicate that executable contracts demanded more time than the other three methods and that sequence diagrams and Javadoc demanded the least time.
Towards the Knowledge Capitalisation and Organisation in the Model of Conformity-Checking Process in Construction
Authors: Anastasiya Yurchyshyna, Catherine Faron-Zucker, Nhan Thanh, Alain Zarli
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

This paper presents an ontological method aimed at the capitalization of expert knowledge in the context of semi-automatic checking model of the conformity of construction projects against a set of construction norms. The efficiency of our ontology-based reasoning model relies on two keystones. First, it is based on the matching of construction projects represented by RDF graphs to technical conformity queries formalized as SPARQL queries. Second, our reasoning model integrates the meta-knowledge on conformity checking process. Our approach of capitalizing such knowledge is based on the development of semantic annotations of conformity queries and organizing them into a query base. This helps to formalize the expert knowledge in form of expert rules scheduling the matching operations of the checking process. Semantic annotations of conformity queries also help to generate a structured conformity report, which interprets the results of reasoning in terms of conformity checking in construction.
Active Learning Using a Constructive Neural Network Algorithm
Authors: José Luis Subirats, Leonardo Franco, Ignacio Molina Conde, José M. Jerez
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

Constructive neural network algorithms suffer severely from overfitting noisy datasets as, in general, they learn the set of examples until zero error is achieved. We introduce in this work a method for detect and filter noisy examples using a recently proposed constructive neural network algorithm. The method works by exploiting the fact that noisy examples are harder to be learnt, needing a larger number of synaptic weight modifications than normal examples. Different tests are carried out, both with controlled experiments and real benchmark datasets, showing the effectiveness of the approach.
GIR Experiments with Forostar
Authors: Simon Overell, João Magalhães, Stefan Rüger
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

In this paper we present Forostar, our GIR system. Forostar augments a traditional IR VSM approach with geographic information.We detail our placename disambiguation and geographic relevance ranking methods, as well as how textual and geographic relevance assessments are combined. The paper concludes with an analysis of our results including significance testing where we show our baseline method, in fact, to be best. Finally we identify weaknesses in our approach and ways in which the system could be optimised and improved.
Motion Tracking Using Particle Filter
Authors: Zalili Binti Musa, Junzo Watada
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

Video tracking system raises a wide possibility in today's society. This system is used in various applications such as security, monitoring, robotic, and nowadays in day-to-day applications. However the video tracking systems still have many open problems and various research activities in a video tracking system are explored. In this study, we have developed a prototype to track a bounce ball movement. Generally, the movement of a bounce ball is fast and the sizes of objects are different regarding on camera view. Therefore, the aim of this study is to construct a motion tracking for an object movement using a particle filter formula. Where, at the end of this paper, the detail outcome and result are discussed using experiments of this method.