ppxscal/embedding_network huggingface dataset:
The Carillon and Its Haptic Signature: Modeling the Changing Force-Feedback Constraints of a Musical Instrument for Haptic Display
Authors: Mark Havryliv, Florian Geiger, Matthias Guertler, Fazel Naghdy, Greg Schiemer
Venue: Proceedings of the 4th International Conference on Haptic and Audio Interaction Design (2009)

The carillon is one of the few instruments that elicits sophisticated haptic interaction from amateur and professional players alike. Like the piano keyboard, the velocity of a player's impact on each carillon key, or baton, affects the quality of the resultant tone; unlike the piano, each carillon baton returns a different force-feedback. Force-feedback varies widely from one baton to the next across the entire range of the instrument and with further idiosyncratic variation from one instrument to another. This makes the carillon an ideal candidate for haptic simulation. The application of synthesized force-feedback based on an analysis of forces operating in a typical carillon mechanism offers a blueprint for the design of an electronic practice clavier and with it the solution to a problem that has vexed carillonists for centuries, namely the inability to rehearse repertoire in private. This paper will focus on design and implementation of a haptic carillon clavier derived from an analysis of the Australian National Carillon in Canberra.
K-Subspace Clustering
Authors: Dingding Wang, Chris Ding, Tao Li
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

The widely used K-means clustering deals with ball-shaped (spherical Gaussian) clusters. In this paper, we extend the K-means clustering to accommodate extended clusters in subspaces, such as line-shaped clusters, plane-shaped clusters, and ball-shaped clusters. The algorithm retains much of the K-means clustering flavors: easy to implement and fast to converge. A model selection procedure is incorporated to determine the cluster shape. As a result, our algorithm can recognize a wide range of subspace clusters studied in various literatures, and also the global ball-shaped clusters (living in all dimensions). We carry extensive experiments on both synthetic and real-world datasets, and the results demonstrate the effectiveness of our algorithm.
Poster abstract: Gesture recognition via continuous maximum entropy training on accelerometer data
Authors: Alan L. Liu, Jun Yang, Peter Pal Boda
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

In this work, we present a gesture recognition system via continuous MaxEnt training on accelerometer data. We are working on embedding feature selection into MaxEnt model training to more intelligently narrow the feature set. We are also working to simplify the modeling process so developers can more easily build sensor-based applications. Finally, we are exploring the use of MaxEnt to model higher-level activities.
Research and Application of Network Control on CNC Machine Tool
Authors: Sun Xingwei, Wang Ke
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Along with the development of information technology, the fundamental revolution of the traditional manufacturing industry generated. The modern manufacturing patterns, such as the network manufacturing, the agile manufacturing, the global manufacturing, and so on, are proposed in the industrial developed countries. The networking of machine tool, which is the priming equipment, is the foundation unit to realize the new manufacturing patterns. It becomes the inevitable tendency to move towards the network of the traditional numerical control machine tool industry. In recent years, the quantity of CNC machine tool is increasing more and more. The networking of them is the foundation in enterprise information. It will become the restriction bottleneck if the networking can't be put in practice preferably. Based on Ethernet, one method of general network control applied on traditional NC system was proposed in this paper against the physical circumstances in our country of various brands, multiform models, great difference and difficult networking in NC system. This offers one effective way for the realization of enterprise information. The information and networking of one enterprise will be promoted with this technology. So this network control technology is practical and has higher application value. It's significant to accelerate the information of traditional machine industry.
Low temperature sintering properties of Y-doped BaTiO3 ceramics by BaB2O4 sintering aid
Authors: Myongil Kong, Shenglin Jiang, Tiantian Xie, Haibo Zhang
Venue: Microelectronic Engineering (2009)

The sintering process of semiconducting Y-doped BaTiO"3 ceramics added with BaB"2O"4 as low temperature sintering aid were investigated. When the low temperature sintering aid BaB"2O"4 added Y-doped BaTiO"3 ceramics prepared by Sol-Gel method, the sintering temperature of BaTiO"3-based ceramics would be greatly decreased, and also widen sintering range. Y-doped BaTiO"3 ceramics with BaB"2O"4 addition can be obtained at 1050^oC. Ceramics samples with room temperature resistivity 60-80@Wcm, ratio of the maximum resistivity to minimum resistance (Rmax/Rmin) 10^4 and temperature coefficient of resistivity (@a) 10%/^oC were obtained.
Optimal Multi-unit Combinatorial Auctions with Single Minded Bidders
Authors: Sujit Gujar, Y. Narahari
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

The current art in optimal combinatorial auctions islimited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (single minded bidders). This paper extends the current art by proposing an optimal auction for procuring multiple units of multiple items when the bidders are single minded. We develop a procurement auction that minimizes the cost ofprocurement while satisfying Bayesian incentive compatibility and interim individual rationality. Under appropriate regularity conditions, this optimal auction also satisfies dominant strategy incentive compatibility. The results presented here hold true for equivalent forward auction settings as well.
A Conceptual Framework for Ontology Based Automating and Merging of Clinical Pathways of Comorbidities
Authors: Samina Raza Abidi
Venue: Knowledge Management for Health Care Procedures: ECAI 2008 Workshop, K4HelP 2008, Patras, Greece, July 21, 2008, Revised Selected Papers (2009)

In this paper we present a conceptual framework for ontology based knowledge representation and merging of Clinical Pathways (CP) of comorbidities. Paper based CP are static documents which do not have adaptability to accommodate dynamic changes in a patient's conditions, particularly in case of co-morbidity, since most CP are focused on a single disease management. Our approach to computerize and merge CP of comorbidities for decision support purpose include; 1. Representation of comorbidity CP as OWL ontologies, 2. Merging ontologies along common tasks, 3. Execution of merged ontology using OWL reasoner to provide CP mediated decision support, 4. Evaluation of recommendations by instantiating the ontology with comorbidity scenarios. Most challenging and unique aspect of this research is that it involves the dynamic integration of computerized CP of two concurrent comorbid diseases, whilst maintaining clinical pragmatics and medical correctness. We believe that Semantic Web has enormous potential to achieve this goal.
Evaluation of User's Physical Experience in Full Body Interactive Games
Authors: Mitja Koštomaj, Bojana Boh
Venue: Proceedings of the 4th International Conference on Haptic and Audio Interaction Design (2009)

This paper is an evaluation of full body interactive games using Krofli¿'s and Laban's framework of Body, Space, Time and Relationship. An experiment with 8 participants playing 10 games for 20 minutes was conducted and recorded to digital video. Body, Space and Time elements have been measured using observation, motion tracking and Quantity of Motion (QoM). The results from the experiment informed the designer about the participants' physical experience through the analysis of postures used in each game, the quality of the movement, the body parts used in the interaction, the playing area, the direction of movement, direction of gaze, tempo, dynamics and QoM. The experiment informed the designer about important issues of the user's physical experience and proved that the method can provide useful information in the development and evaluation of full body interactive games. The theoretical work of Laban and Krofli¿ also proved useful for interaction and games design in the transition from desktop to full body interactive games.
MPI at Exascale: Challenges for Data Structures and Algorithms
Authors: William Gropp
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

Petascale computing is here and MPI continues to succeed as a effective, scalable programming model, despite previous predictions that MPI could not work at the Petascale. As the high-performance computing community considers Exascale systems, will MPI continue to be suitable? Already, a number of studies have looked at the behavior of MPI as the number of tasks approaches one million, and have identified scaling problems in the current state-of-the-art. In addition, the MPI Forum has begun to consider the scalability of the definition of some of the routines in MPI, based on the sizes of their input arguments. Concerns have also been raised about other routines, based on the scalability of current implementations.
WISE Science: Web-Based Inquiry in the Classroom
Authors: James D. Slotta, Marcia C. Linn
Venue: Technology, Education--Connections The Tec Series (2009)

This book shares the lessons learned by a large community of educational researchers and science teachers as they designed, developed, and investigated a new technology-enhanced learning environment known as WISE: The Web-based Inquiry Science Environment. WISE offers a collection of free, customizable curriculum projects on topics central to the science standards as well as guidance for teachers on how these Internet-based projects can be used to improve learning and instruction in their science classrooms (grades 6-12). Hundreds of teachers and over 100,000 students have learned from WISE projects taught in English, Norwegian, Dutch, German, Hebrew, Chinese, and Korean. Highlights of WISE include:* A wealth of findings about the WISE curriculum and assessments from 10 years of research funded by the U.S. National Science Foundation.* A collection of classroom-tested, inquiry-based curriculum projects that are available to every classroom via the Internet, free of charge.* An accumulation of successful practices, patterns, and principles to guide classroom teachers and curriculum designers.* Effective models of professional development and school partnerships that support teachers in integrating inquiry-based methods in their own curriculum.* Key strategies and recommendations for policymakers.
The Research on the Spider of the Domain-Specific Search Engines Based on the Reinforcement Learning
Authors: Liu Quan, Cui Zhi-ming, Fu Yu-chen
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

On the basis of the comparison between general search engines and vertical search engines, the development of vertical search engines will be discussed. After the introduction of the theory and algorithms of reinforcement learning, the reinforcement learning methods will be applied to the spider, a vertical search engine, as a new technology. This will develop the application of reinforcement learning and provide a new idea for Spider. From the experimental results, the conclusion is that the performance will be improved a lot with this technology in spider search by the experimental analysis.
Computer Simulation and Vibration Testing of Runaway Escapement
Authors: Li Sui, Gengchen Shi, Ping Song, Hongwei An
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Runaway escapement as the core of clock safety and arming device is a kind of common time-delay mechanism in fuze of projectile. In recent decades, computer design of runaway escapement has been studied in depth, and various forms of research results have been vended. These results focused on the mechanism’s kinematics, precision and optimal design, and its vibration analysis seldom mentioned. Recently, some shots misfire or premature explode during shooting process because runaway escapements’ miswork. This paper utilizes gear system’s research results applying in other fields, discusses runaway escapement’s vibration problem, uses ANSYS to analyze its dynamic characteristics, and from vibration testing to prove the simulation results. The aim of this paper is to get runaway escapement’s dynamic properties and evaluate its reliability by modal analysis and testing. All the work in this paper will be an important element for farther research.
Robot-assisted Long Bone Fracture Reduction
Authors: Ralf Westphal, Simon Winkelbach, Friedrich Wahl, Thomas Gösling, Markus Oszwald, Tobias Hüfner, Christian Krettek
Venue: International Journal of Robotics Research (2009)

The preferred treatment of femoral (thigh bone) shaft fractures nowadays is the minimally invasive technique of intramedullary nailing. However, in addition to its advantages, this technique also has a number of disadvantages, such as the frequent occurrence of malaligned fracture reductions and high X-ray exposure, especially to the operating team. The aim of our research is to overcome these shortcomings by utilizing modern techniques such as three-dimensional (3D) imaging, navigation, and robotics. In this paper we present the current state of our interdisciplinary research project. We first introduce a telemanipulated fracture reduction procedure, which is based on 3D imaging data. This set-up is improved one step further towards an automated fracture reduction procedure. Finally, two drilling tasks, namely the opening of the medullar cavity and the distal locking of the intramedullary nail, are presented, which are supported by automated X-ray-based image analysis and robot-assisted drill guidance. We show that high reduction accuracies can be achieved with our robotic system. Furthermore, the robot-assisted drill guidance achieves superior results with respect to increased precision and decreased X-ray exposure compared with the conventional procedure. We conclude that this surgical procedure benefits conspicuously from the support of robotic assistance systems and that further research and development in this field is worthwhile.
Design and Noise Control of the Portable Wear Debris Concentration Detector
Authors: Hongbo Fan, Yingtang Zhang, Zhining Li, Hongfei Luo
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Wear debris concentration in the lubricant oil contains the information about wear condition of machine. Based on the inductive balance principle and the detection requirement of wear debris, the portable wear debris concentration detector is designed, with accuracy of 10-6 for metal wear debris concentration in oil. After analyzing the magnetic field of sensor coil, the magnetic uniformity can be improved by reducing the windings height and radius-length ratio. And increasing the Q factor of the coil can improve the amplified ability of the detection circuit for sensor output signal. Aiming to the characteristic that the peak value variation of sensor output signal is very weak, noise model of preamplifier is built and some noise control measures are put forward. The experiments prove that the detector has satisfying accuracy and consistency.
An Analysis of the Impact of Ambiguity on Automatic Humour Recognition
Authors: Antonio Reyes, Davide Buscaldi, Paolo Rosso
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

One of the most amazing characteristics that defines the human being is humour. Its analysis implies a set of subjective and fuzzy factors, such as the linguistic, psychological or sociological variables that produce it. This is one of the reasons why its automatic processing seems to be not straightforward. However, recent researches in the Natural Language Processing area have shown that humour can automatically be generated and recognised with success. On the basis of those achievements, in this study we present the experiments we have carried out on a collection of Italian texts in order to investigate how to characterize humour through the study of the ambiguity, especially with respect to morphosyntactic and syntactic ambiguity. The results we have obtained show that it is possible to differentiate humorous from non humorous data through features like perplexity or sentence complexity.
Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering
Authors: Francisco Escolano, Daniela Giorgi, Edwin R. Hancock, Miguel A. Lozano, Bianca Falcidieno
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

In this paper, we introduce a novel descriptor of graph complexity which can be computed in real time and has the same qualitative behavior of polytopal (Birkhoff) complexity, which has been successfully tested in the context of Bioinformatics. We also show how the phase-change point may be characterized in terms of the Laplacian spectrum, by analyzing the derivatives of the complexity function. In addition, the new complexity notion (flow complexity) is applied to cluster a database of Reeb graphs coming from analyzing 3D objects.
New scale invariant template matching technique using hyper space image representation
Authors: A. Manzar, T. A. Cheema, I. M. Qureshi
Venue: Pattern Analysis Applications (2009)

A new approach for the template image matching is being presented. The method first converts the image into edges, then, the vital information of these edges has been presented as a set of vectors in a four dimensional hyper-space. A modified Radon Transform has been proposed to facilitate this vectorization process. All the above processing is being done offline for the main image of the area. The template image has also been vectorized in a same fashion in real time which is to be matched with the main image. A vector matching algorithm has been proposed to deliver match location with a very low computational cost. It works for a wide range of template scaling and noise conditions which were not there in the previous algorithms found in the literature.
Tracking the Intracellular Dynamics of Transferrin-labeled QDs in Living Panc-1 Cells
Authors: Gaixia Xu, Junle Qu, Stefan Jaeger, Qingfeng Song, Su-Shing Chen
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

We have used Quantum dots (QD) bioconjugated with Transferrin (Tf) as targeted luminescent probes to label pancreatic cancer cells, and have employed a confocal microscope to localize the distribution and track the dynamics of QD-Tf nanocomplexes. In this paper, we present our recent results on QD-Tf tracking and vesicle imaging, including quasi-real-time visualization of QD-Tf transport inside cells using a tracking algorithm. This work demonstrates that we have a potentially useful method for discovering the molecular delivery mechanism inside living cells by utilizing the QDs bioconjugates in combination with our tracking algorithm.
Characterization of DSRC performance as a function of transmit power
Authors: Kezhu Hong, Daniel Xing, Vinuth Rai, John Kenney
Venue: Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking (2009)

IEEE 802.11p is an emerging standard designed to provide wireless access in a vehicular environment. A major application of 802.11p-based Dedicated Short Range Communications (DSRC) is Vehicle to Vehicle (V2V) safety messaging. The US FCC has designated 75 MHz of bandwidth in the 5.9GHz band to support DSRC with a maximum permissible transmit power level of 33 dBm. In this paper we study the relationship between transmission power and packet reception in realistic propagation environments in an effort to understand the impact transmission power has on the performance of safety applications. The study is based on field tests with vehicles communicating using prototype DSRC radios.
Reconfigurable SWP Operator for Multimedia Processing
Authors: Shafqat Khan, Emmanuel Casseau, Daniel Menard
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

For performance enhancement, reconfigurable processors have to overcome the overheads of reconfigurations such as the complexity of the interconnection network and reconfiguration time. In processors dealing with multimedia applications these overheads can be reduced by providing the reconfigurability inside the processing units rather than at interconnection level. Due to the low precision data nature of multimedia applications, reconfiguration at operator level also provides additional speedup through parallel execution of low precision data. In this paper a pipelined architecture of a reconfigurable coarse grain subword parallel (SWP) operator is presented for multimedia applications. This operator not only eliminates the need of reconfiguration time but also provides the reconfigurability at both data size level (different pixel data sizes) and at operation level (different multimedia oriented operations). This ensures a better utilization of the processor resources and reduces the reconfiguration overheads significantly.
Kernel Polytope Faces Pursuit
Authors: Tom Diethe, Zakria Hussain
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by ¿1 regularised least-squares (Lasso) [4,10] in a similar vein to (Orthogonal) Matching Pursuit (OMP) [16]. The algorithm is based on the geometry of the polar polytope where at each step a basis function is chosen by finding the maximal vertex using a path-following method. The algorithmic complexity is of a similar order to OMP whilst being able to solve problems known to be hard for (O)MP. Matching Pursuit was extended to build kernel-based solutions to machine learning problems, resulting in the sparse regression algorithm, Kernel Matching Pursuit (KMP) [17]. We develop a new algorithm to build sparse kernel-based solutions using PFP, which we call Kernel Polytope Faces Pursuit (KPFP). We show the usefulness of this algorithm by providing a generalisation error bound [7] that takes into account a natural regression loss and experimental results on several benchmark datasets.