ppxscal/embedding_network huggingface dataset:
Improving approximate matching capabilities for Meta Map Transfer applications
Authors: Simon Y. Berkovich, Mohammad Inayatullah
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

Using approximate matching technique for different application areas ranging from bioinformatics to wireless world is a challenging task. With the developments of new approximate matching techniques, the efficiency and speed are the main factors in deciding among different options available for each application area. Each application area has certain special features that can be used by approximate matching technique best suited for that area. In addition to direct application to information retrieval, the approximate matching techniques can also be used for complex computational procedures involving similarity search.In this paper, we present an approach for extension of Java class gov.nih.nlm.mmtx.ApproximateMatching from java.lang.Object using an approximate matching technique [1] which is based on reversing the conventional scheme of error-correction coding. This technique developed for multi-attribute objects can be applied to Meta Map Transfer application that assumes that the input is a term. As an extension of the Approximate Matching class we introduce the Store and Retrieve extensions which can be used to store and retrieve terms based on approximate matching technique. Mapping options for the Meta Map Transfer application are also discussed using this approximate matching technique.
Deciding validity in a spatial logic for trees
Authors: Cristiano Calcagno, Luca Cardelli, Andrew D. Gordon
Venue: Journal of Functional Programming (2005)

We consider a propositional spatial logic for finite trees. The logic includes $\A \Par \B$ (tree composition), $\A \,{\Guarantee}\, \B$ (the implication induced by composition), and $\Zero$ (the unit of composition). We show that the satisfaction and validity problems are equivalent, and decidable. The crux of the argument is devising a finite enumeration of trees to consider when deciding whether a spatial implication is satisfied. We introduce a sequent calculus for the logic, and show it to be sound and complete with respect to an interpretation in terms of satisfaction. Finally, we describe a complete proof procedure for the sequent calculus. We envisage applications in the area of logic-based type systems for semistructured data. We describe a small programming language based on this idea.
Hardware support for self-healing software services
Authors: Stelios Sidiroglou, Michael E. Locasto, Angelos D. Keromytis
Venue: ACM SIGARCH Computer Architecture News (2005)

We propose a new approach for reacting to a wide variety of software failures, ranging from remotely exploitable vulnerabilities to more mundane bugs that cause abnormal program termination (e.g., illegal memory dereference). Our emphasis is in creating "self-healing" software that can protect itself against a recurring fault until a more comprehensive fix is applied. Our system consists of a set of sensors that monitor applications for various types of failure and an instruction-level emulator that is invoked for selected parts of a program's code. This emulator allows us to predict recurrences of faults and recover execution to a safe control flow. Using the emulator for small pieces of code, as directed by the sensors, allows us to minimize the performance impact on the immunized application. We describe the overall system architecture, highlighting a prototype implementation for the x86 platform. We discuss a virtual emulator, which uses existing and new processor features to improve performance.
Recognizing Facial Expression: Machine Learning and Application to Spontaneous Behavior
Authors: Marian Stewart Bartlett, Gwen Littlewort, Mark Frank, Claudia Lainscsek, Ian Fasel, Javier Movellan
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present a systematic comparison of machine learning methods applied to the problem of fully automatic recognition of facial expressions. We report results on a series of experiments comparing recognition engines, including AdaBoost, support vector machines, linear discriminant analysis. We also explored feature selection techniques, including the use of AdaBoost for feature selection prior to classification by SVM or LDA. Best results were obtained by selecting a subset of Gabor filters using AdaBoost followed by classification with Support Vector Machines. The system operates in real-time, and obtained 93% correct generalization to novel subjects for a 7-way forced choice on the Cohn-Kanade expression dataset. The outputs of the classifiers change smoothly as a function of time and thus can be used to measure facial expression dynamics. We applied the system to to fully automated recognition of facial actions (FACS). The present system classifies 17 action units, whether they occur singly or in combination with other actions, with a mean accuracy of 94.8%. We present preliminary results for applying this system to spontaneous facial expressions.
Wavelet-based image interpolation using multilayer perceptrons
Authors: Yu-Len Huang
Venue: Neural Computing and Applications (2005)

Changing the resolution of digital images and video is needed image processing systems. In this paper, we present nonlinear interpolation schemes for still image resolution enhancement. The proposed neural network interpolation method is based on wavelet reconstruction. With the wavelet decomposition, the image signals can be divided into several time&#x2013;frequency portions. In this work, the wavelet decomposition signal is used to train the neural networks. The pixels in the low-resolution image are used as the input signal of the neural network to estimate all the wavelet sub-images of the corresponding high-resolution image. The image of increased resolution is finally produced by the synthesis procedure of wavelet transform. In the simulation, the proposed method obtains much better performance than other traditional methods. Moreover, the easy implementation and high flexibility of the proposed algorithm also make it applicable to various other related problems.
Comments are More Important than Code
Authors: Jef Raskin
Venue: Queue (2005)

The thorough use of internal documentation is one of the most-overlooked ways of improving software quality and speeding implementation. In this essay I take what might seem a paradoxical position. I endorse the techniques that some programmers claim make code self-documenting and encourage the development of programs that do "automatic documentation." Yet I also contend that these methods cannot provide the documentation necessary for reliable and maintainable code. They are only a rough aid, and even then help with only one or two aspects of documentationnot including the most important ones.
Using software simulations as an aide in teaching combinatorics to high school students
Authors: Linda B. Sherrell, Jeffrey J. Robertson, Thomas W. Sellers
Venue: Journal of Computing Sciences in Colleges (2005)

Knowledge of discrete structures is fundamental for success in computer science. However, many students have difficulty with abstract thinking and resist engagement in mathematical concepts. This paper discusses a Combinatorics module developed for students in beginning programming courses at the high school level. To motivate student interest, the authors designed worksheets and interactive software simulations in AgentSheets, which allowed students to work with permutations and combinations to discover patterns and formulas on their own. This paper describes the methods and results of a study in which six high school classes used the materials.
A review of research: an investigation of the impact of data quality on decision performance
Authors: Wonjin Jung
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

While the effects of information quality and the importance of information have been studied in Information Systems (IS) literature, little evidence and understanding of the impact of data quality on decision performance has been documented in the IS literature. Therefore, the research aim of this paper is to examine the underlying theoretical and empirical support for the relationship between data quality (DQ), as defined by the framework of data quality [29], and decision performance. Explicit literature review of the impact of data quality on decision performance may lead to the specification of influences on decision performance. That is, this study proposes to provide a basis for predicting whether data quality, especially contextual, representational, and accessibility data quality, influences decision performance.
Six themes of the communicative appropriation of photographic images
Authors: Amy Voida, Elizabeth D. Mynatt
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

In this paper, we explore the use of digital photographs in computer-mediated communication. We present Lascaux, an instant messaging client that serves as a research platform for studying visual communication with digital photographs. Through a combined analysis of the uses of images in Lascaux as well as the uses of images in other communicative contexts, we arrived at six themes of appropriation: the image as amplification, the image as narrative, the image as awareness, the image as local expression, the image as invitation, and the image as object/instrument. For each theme, we explore the ways in which a medium may be designed to support that class of appropriation. Finally, we reflect on the relationship between literacy, mastery, and appropriation.
Improving TCP Performance during Soft Vertical Handoff
Authors: Haijie Huang, Jianfei Cai
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Withthe help of Mobile IP/IPv6, on-going TCP sessions can remain active when the mobile node hands over from one network to another. In particular, in a soft vertical handoff, packet loss due to the switching of networks can be avoided. However, TGP still faces several performance degradation issues due to the change of network bandwidth and propagation delay. During vertical handoff, some undesirable phenomenon may erroneously trigger TCP congestion control operations and thus degrade the TCP performance In this paper, we study the TCP behaviors during soft vertical handoff from fast link to slow link. In particular; we focus on TCP timeout problem caused by increased network round-trip time, and propose three schemes (fast response, slow response and ACK delaying) to solve this problem. These schemes require only minor modifications on network layer of the end hosts, without any change on TCP and intermediate network routers. Simulation results show that these schemes can effectively improve the TCP performance during soft vertical handoff.
Selecting salient features for classification based on neural network committees
Authors: M. Bacauskiene, A. Verikas
Venue: Pattern Recognition Letters (2004)

Aggregating outputs of multiple classifiers into a committee decision is one of the most important techniques for improving classification accuracy. The issue of selecting an optimal subset of relevant features plays also an important role in successful design of a pattern recognition system. In this paper, we present a neural network based approach for identifying salient features for classification in neural network committees. Feature selection is based on two criteria, namely the reaction of the cross-validation data set classification error due to the removal of the individual features and the diversity of neural networks comprising the committee. The algorithm developed removed a large number of features from the original data sets without reducing the classification accuracy of the committees. The accuracy of the committees utilizing the reduced feature sets was higher than those exploiting all the original features.
Simultaneous Frobenius-Padé approximants
Authors: Ana C. Matos, Jeannette Van Iseghem
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper, we extend to simultaneous approximation the notion of Frobenius-Padé approximants; we then construct rational approximants for vector functions given by their expansion in an orthogonal series. After giving the definitions and notations for simultaneous Frobenius-Padé approximants and table, we develop recursive relations for computing different sequences in the table of approximants. We then propose algorithms to compute, in the two dimensional case, antidiagonal (Kronecker type algorithm) and diagonal sequences.
A Versatile, Proactive Dependability Approach to Handling Unanticipated Events in Distributed Systems
Authors: Priya Narasimhan, Raj Rajkumar, Gautam Thaker, Patrick Lardieri
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

The MEAD system that we are developing employs a synergistic combination of a reactiveand a proactive fault-tolerance approach in order to address unanticipated events andhazards in real-time, fault-tolerant distributed systems. The reactive fault-tolerance approach involves active monitoring of the system to adapt the provided QoS and to allocate resources based on current conditions in the system. The proactive approach involves monitoring both the distributed applications and the network to seek pre-cursors to imminent failures, and then to trigger fault-recovery mechanisms in advance of the occurrence of the failure. The underlying ideas of the MEAD system have demonstrated initial promise through our enhanced capabilities to handle failures and unanticipated events, and to reduce jitter under faulty conditions.
Simple constant amortized time generation of fixed length numeric partitions
Authors: John M. Boyer
Venue: Journal of Algorithms (2005)

A numeric partition of n of fixed length k is an unordered sequence of k positive integers that sum to n. A recent implementation of Savage's constant amortized time (CAT) algorithm for generating numeric partitions in a minimal change order required over twenty-five pages of C code. According to Ruskey, there is no simple lexicographic algorithm that generates fixed length numeric partitions in the natural representation in constant amortized time (CAT) per partition. This paper describes such an algorithm and proves it is a CAT algorithm. As a byproduct, CAT generators are given for several other classes of numerical partitions, some of which have no prior CAT algorithm.
Suffixal derivative time-change analysis of sixteenth-century French: SAS Institute, Inc.
Authors: Heath Tuttle
Venue: Issue 79 (January 1982) (1982)

In an effort to understand how language changes across time. I have taken advantage of the information inherent in the lexicon of the sixteenth-century writer, Francois Rabelais, whose five major works occurred, for the most part, at five different points in time in the middle third of that century. The unit of analysis, or point of focus, has been some seventy suffixes active in the century. Initially, using historicaletymological dictionaries, I examined Rabelais' sixteenth-century derivatives, seeking to discover if and what the relations were between the numbers of such words both synchronically and diachronically in the five books. A major finding was that derivatives of suffixes of disparate syntactic categories (e.g. forming nouns and verbs) are included by Rabelais in parallel quantities across time. A large number of -ement words in his first work are accompanied by relatively large numbers of -er words in that work, while the second work contains smaller numbers of the derivatives of the two suffixes, for example. But these rises and falls apply to one group of syntactically disparate, derivative-forming suffixes, while another pattern of rises and falls.(i.e. rising and falling derivative tallies) applies to another, potentially disparate, group of derivative-forming suffixes. Why this occurs I can only attribute to whatever constraint rules govern sentence generation and, concomitantly, entire narratives: A sentence or a story cannot consist of all verbs, for example. But our knowledge of these constraints is so sparse that the asking of such fundamental questions of composition, both diachronic and synchronic, even if such asking only begets more questions, is promising. 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
An approach for ontology-based elicitation of user models to enable personalization on the semantic web
Authors: Ronald Denaux, Lora Aroyo, Vania Dimitrova
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

A novel framework for eliciting a user's conceptualization based on an ontology-driven dialog is presented here. It has been integrated in an RDF/OWL-based architecture of an adaptive learning content management system. The implemented framework is illustrated with an application scenario to deal with the cold start problem and to enable tailoring the system's behavior to the needs of each individual user.
Manipulating deformable linear objects: Sensor-based skills of adjustment motions for vibration reduction
Authors: Shigang Yue, Dominik Henrich
Venue: Journal of Robotic Systems (2005)

The vibration of a deformable object is often problematic during automatic handling by robot manipulators. However, humans can often handle and damp the vibration of deformable objects with ease. This paper presents force&sol;torque sensor-based skills for handling deformable linear objects in a manner suitable to reduce acute vibration with simple human skill inspired strategies that consist of one or two adjustment motions. The adjustment motion is a simple open-loop motion that can be attached to the end of any arbitrary end-effector's trajectory. As an ordinary industrial robot's simple action, it has three periods, i.e., acceleration, constant speed, and deceleration period; it starts from a predicted time tightly close to a force&sol;moment maximum. The predicted time for the adjustment action is generated automatically on-line based on the vibration rhythm and the data sensed by a force&sol;torque sensor mounted on the robot's wrist. To find the matching point between the vibrational signal of the deformable object and a template, template matching techniques including cross-correlation and minimum squared error methods are used and compared. Experiments are conducted with an industrial robot to test the new skills under various conditions. The results demonstrate that an industrial robot could perform effective vibration reduction skills with simple strategies. &copy; 2005 Wiley Periodicals, Inc.
Properties of Some Character Tables Related to the Symmetric Groups
Authors: Christine Bessenrodt, Jørn B. Olsson, Richard P. Stanley
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

We determine invariants like the Smith normal form and the determinant for certain integral matrices which arise from the character tables of the symmetric groups Sn and their double covers. In particular, we give a simple computation, based on the theory of Hall-Littlewood symmetric functions, of the determinant of the regular character table ¿RC of Sn with respect to an integer r¿ 2. This result had earlier been proved by Olsson in a longer and more indirect manner. As a consequence, we obtain a new proof of the Mathas' Conjecture on the determinant of the Cartan matrix of the Iwahori-Hecke algebra. When r is prime we determine the Smith normal form of ¿RC. Taking r large yields the Smith normal form of the full character table of Sn. Analogous results are then given for spin characters.
Balancing clustering-induced stalls to improve performance in clustered processors
Authors: Amirali Baniasadi
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Clustered processors lose performance as a result of clustering-induced stalls. Such stalls are the result of distributed resources and cluster communication delays. Our performance analysis of clustered architectures shows how previously proposed methods reduce one group of stalls at the expense of the other. Moreover, we extend previous work and present a new class of cluster assignment heuristics for high-performance clustered processors. We affirm that it is possible to improve performance in clustered processors by taking a more balanced approach towards clustering-induced stalls. Our techniques rely on estimating and predicting resource utilization for clustered processors. We show that, on average, our best technique reduces the performance gap between a dual-clustered and a centralized processor down to 6.9% and 9.2% for 8-way and 6-way processors and for a representative subset of SPEC2K benchmarks
Design Models for Robust Multi-Layer Next Generation Internet Core Networks Carrying Elastic Traffic
Authors: Eligijus Kubilinskas Pål Nilsson
Venue: Journal of Network and Systems Management (2005)

This paper presents three mathematical formulations for designing robust two-layer networks carrying elastic traffic. The formulations differ in the way flow reconfiguration is performed in the case of link failures. An iterative algorithm to solve the problems is given and a numerical study is provided comparing the effectiveness of the three reconfiguration mechanisms. The formulations can be applied for designing Next Generation Internet (NGI) core networks with the two-layer, IP-over-WDM, structure.
Adapting motion capture data using weighted real-time inverse kinematics
Authors: Michael Meredith, Steve Maddock
Venue: Computers in Entertainment (CIE) (2005)

In this article we present a technique that enhances an inverse kinematics (IK) solver such that when the results are applied to a computer character, we can generate a level of individualization tailored to both the character and the environment, e.g., a walking motion can become "stiffer" or can be turned into a limping motion. Since the technique is based on an IK solver, we also have the desirable effect of solving retargetting issues when mapping motion data between characters. As the individualization aspect of our technique is very tightly coupled with the inverse kinematics solver, we can achieve both the individualization and retargetting of characters in real time.