ppxscal/embedding_network huggingface dataset:
Exploring the lowest-energy structures of group IV tetra-aurides: XAu$_{4}$ (X=C, Si, Ge, Sn)
Authors: Rhitankar Pal, Satya Bulusu, X. C. Zeng
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

We search for the lowest-energy structure of XAu$_{4}$ (X=C, Si, Ge, Sn) clusters and calculate the photoelectron spectrum for the lowest-energy isomer of each species. The gradual destabilization of the tetrahedral geometry from C &rarr; Si &rarr; Ge &rarr; Sn, as well as the structural transition from the tetrahedral to the square planar geometry from SiAu$_{4}$ to GeAu$_{4}$, indicate that the change of electronic properties in the group IV elements also plays an important role in the structures of Group IV tetra-aurides in addition to the known H/Au analogy in these species.
Computer Assisted Transcription of Speech
Authors: Luis Rodríguez, Francisco Casacuberta, Enrique Vidal
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

Speech recognition systems have proved their usefulness in very different tasks. Nevertheless, the present state-of-the-art of the speech technologies does not make it possible to achieve perfect transcriptions in most of the cases. Owing to this fact, human intervention is necessary to check and correct the results of such systems. We present a novel approach that faces this problem by combining the efficiency of the automatic speech recognition systems with the accuracy of the human transcriptor. The result of this process is a cost-effective perfect transcription of the input signal.
Comparing Two Emotion Models for Deriving Affective States from Physiological Data
Authors: Antje Lichtenstein, Astrid Oehme, Stefan Kupschick, Thomas Jürgensohn
Venue: Affect and Emotion in Human-Computer Interaction: From Theory to Applications (2008)

This paper describes an experiment on emotion measurement and classification based on different physiological parameters, which was conducted in the context of a European project on ambient intelligent mobile devices. Emotion induction material consisted of five four-minute video films that induced two positive and three negative emotions. The experimental design gave consideration to both, the basic and the dimensional model of the structure of emotion. Statistical analyses were conducted for films and for self-assessed emotional state and in addition, supervised machine learning technique was utilized. Recognition rates reached up to 72% for a specific emotion (one out of five) and up to 82% for an underlying dimension (one out of two).
The Heritage of Charles Babbage in Australasia
Authors: Garry J. Tee
Venue: IEEE Annals of the History of Computing (1983)

Charles Babbage's eldest son, Benjamin Herschel Babbage (1815 - 1878) migrated to South Australia in 1851, and numerous descendants now live in Australia and New Zealand. Many relics of Charles Babbage are now in Australasia, some in museums and libraries, but most in private collections held by descendants. The relics include a large fragment of the Difference Engine, loose parts of the Difference and Analytical Engines, hundreds of letters to and from Babbage (including letters from Ada Lovelace), the manuscript of Passages from the Life of a Philosopher, and much other material. 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
Research on the metamorphosis of dynamic abrasive particles field via inconsistent curvature contact based on image processing
Authors: Shiming Ji, Yaqi Shen, Li Zhang, Mingsheng Jin, Yindong Zhang
Venue: Proceedings of the 8th WSEAS International Conference on Robotics, Control and Manufacturing Technology (2008)

The characteristic of abrasive particles field is important to polishing process. In this paper, a critical study into the dynamic form of abrasive particles through polishing are made, which are under "inconsistent curvature contact" status. In this system, abrasive particles are mixed with colored ones, by utilizing transparent workpiece and stroboscopic light as well; motion state of abrasive particles can be photographed by high speed shot technology. This method can get the transient state during polishing and serials of images which are clear enough to this study. By analyzing the results, distribution of abrasive particle field can be easily proved. The images we get through using this technology, in addition to the normal noises resulting in inputting, collecting and processing approaches, commonly, there are noises from the transparent workpiece itself. Then, the most appropriate processing method will be chosen according to the source of noises. Consequently, colored abrasive particles will be abstracted as the characteristic points. In that case, a fit line of the trajectory of colored abrasive particles' motion can be obtained finally.
Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems
Authors: Henning Bordihn, Markus Holzer
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

It is well known that certain language families generated by cooperating distributed (CD) grammar systems can be characterized in terms of context-free random context grammars. In particular, the language families generated by CD grammar systems working in the t- and -modes of derivation obey a characterization in terms of ET0L systems, or equivalently by context-free disjoint forbidding random context grammars, and of context-free random context grammars with appearance checking, respectively. Now the question arises whether or not other random context like language families can be characterized in terms of CD grammar systems. We positively answer this question, proving that there are derivation modes for CD grammar systems, namely the negated versions of the aforementioned modes, which precisely characterize the family of context-free disjoint forbidding random context languages and that of languages generated by context-free random context grammars without appearance checking. In passing we show that every language generated by a context-free random context grammar without appearance checking can also be generated by a context-free recurrent programmed grammar without appearance checking, and vice versa.
Contrast Enhancement Scheme Integrating Global and Local Contrast Equalization Approaches
Authors: Kwanghyun Kim, Youngjoon Han, Hernsoo Hahn
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

This paper proposes a new contrast enhancement scheme which integrates a global and a local contrast enhancement schemes to reduce the blocking and the washed-out effects at the same time. The proposed method executes a block-based histogram equalization on the temporary images which are obtained by dividing an input image into sub-blocks so that the sub-block of each temporary image may have a block size different from each other. In the next step, it calculates the contrast factors of all equalized temporary images and the temporary image having the largest contrast factor is selected to apply a global contrast enhancement algorithm. The global equalization function is extracted from the selected equalized temporary image and it is applied to the original image. The experiments have shown that the proposed algorithm produces a visually comfortable result image where the blocking and the washed-out effects cannot be detected.
A Uniform Transactional Execution Environment for Java
Authors: Lukasz Ziarek, Adam Welc, Ali-Reza Adl-Tabatabai, Vijay Menon, Tatiana Shpeisman, Suresh Jagannathan
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

Transactional memory (TM) has recently emerged as an effective tool for extracting fine-grain parallelism from declarative critical sections. In order to make STM systems practical, significant effort has been made to integrate transactions into existing programming languages. Unfortunately, existing approaches fail to provide a simple implementation that permits lock-based and transaction-based abstractions to coexist seamlessly. Because of the fundamental semantic differences between locks and transactions, legacy applications or libraries written using locks can not be transparently used within atomic regions. To address these shortcomings, we implement a uniform transactional execution environment for Java programs in which transactions can be integrated with more traditional concurrency control constructs. Programmers can run arbitrary programs that utilize traditional mutual-exclusion-based programming techniques, execute new programs written with explicit transactional constructs, and freely combine abstractions that use both coding styles.
SAM: Simple API for Object-Oriented Code Metrics
Authors: Adam Edelman, William Frakes, Charles Lillie
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

This paper introduces the Simple API for Object-Oriented Code Metrics or SAM. SAM has two distinct advantages over current application generators for metrics. First, SAM can collect a much larger set of metrics since it maintains context during metrics analysis. Second, SAM is completely language independent since it specifies the types of events a parser must generate, but not how to generate those events. Through examples, we will demonstrate how our API allows us to collect metrics not possible with application generators. We will also demonstrate how SAM can reduce the lines of code per metric by up to 90 percent when measured against some of today's most popular standalone tools.
A quantitative method for representing balance strategies of goal-directed human motions
Authors: Woojin Park, Devender P. Singh, Ronald L. Huston, Seongho Song
Venue: Computers in Biology and Medicine (2008)

A movement index termed balance strategy vector (BSV) was developed as a research tool for studying human balance strategies during goal-directed motions. For a given motion (motion capture data), the BSV index quantitatively represents its balance strategy by computing how available body joint DoFs' angular motions affect the formation of the wholebody center-of-mass trajectory. The index facilitates easy and intuitive understanding of balance strategies of various human motions and can assist scientific investigations on human balance strategies. As an example demonstrating the utility of the index, the index was used to explore balance strategies of free-style, sagittal-plane load lifting motions.
On Conformance Testing for Timed Systems
Authors: Julien Schmaltz, Jan Tretmans
Venue: Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems (2008)

Conformance testing for labeled transition systems starts with defining when an implementation conforms to its specification. One of the formal theories for model-based testing uses the implementation relation ioco for this purpose. A peculiar aspect of ioco is to consider the absence of outputs as an observable action, named quiescence. Recently a number of real-time extensions of ioco have been proposed in the literature. Quiescence and the observation of arbitrary delays are issues when defining such extensions. We present two new timed implementation relations and show their relation with existing ones. Based on these new definitions and using several examples, we show the subtle differences, and the consequences that small modifications in the definitions can have on the resulting relations. Moreover, we present conditions under which some of these implementation relations coincide. The notion of M-quiescence, i.e., if outputs occur in a system they occur before a delay M, turns out to be important in these conditions.
Which Came First, the Grammar or the Lexicon?
Authors: Tom Armstrong, Tim Oates
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

Computational approaches to learning aspects of language typically reduce the problem to learning syntax alone, or learning a lexicon alone. These simplifications have led to disconnected solutions and some unreasonable assumptions about inputs to their algorithms. In this paper, we present an approach that exploits a grammar learning algorithm to learn its own alphabet, or lexicon. We present empirical results and categorize the successes and types of errors lexical acquisition approaches encounter.
Simulation of Agilla middleware on TOSSIM
Authors: S. Özarslan, Y. M. Erten
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

In this study, we performed a simulation of mobile agents running on Agilla middleware designed for sensor networks. The simulations are performed using TOSSIM assuming that Agilla middleware is installed on the sensor nodes which are running TinyOS operating system. We simulated different agents corresponding to various functions and measured the time it takes for these agent software to run in the simulated environment and compared these results with those obtained using actual sensor nodes. The results presented in the study show that simulations produce results comparable to real life experiments.
Research on personal dataspace management
Authors: Yukun Li, Xiaofeng Meng
Venue: Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research (2008)

Explosion of the amount of digital information has made Personal Information Management(PIM) become a hot topic. Personal data is always distributed, rough-and-tumble, personalized, heterogenous and evolutionary, which brings much challenge to to effective and efficient Personal Dataspace Management (PDSM). In the paper, by highlighting the importance of users in Personal Dataspace Management System(PDSMS), we proposed a user-centered framework. We first show research issues, related work, main research problems and challenges in this area. We then introduce the current research work and the preliminary results. Finally, the research plan of my PhD project is presented for discussion.
Application of Fuzzy Cognitive Maps for Stock Market Modeling and Forecasting
Authors: Wojciech Froelich, Alicja Wakulicz-Deja
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In this paper, we investigated the possibility of discovering complex concepts for modeling and forecasting the stock market. We started from a short overview of existing domain knowledge and discussed the usefulness of well-known stock market indicators for predicting share prices. As opposed to other statistical or artificial intelligence approaches, we decided to concentrate on the modeling of cause and effect relationships among concepts within stock market behavior. After preliminary analysis, we made the case for the application of the resulting model for the forecasting stock market performance, using complex concepts that involve a mixture of diverse simple indicators and causal relationships. For the construction and evaluation of such complex concepts, we applied FCMs (fuzzy cognitive maps), a relatively easy approach that allows human interpretation of the results from the scheme. On the basis of the proposed formalism and the adapted evolutionary learning method, we have developed an FCM with the ability to support decisions relative to the stock exchange. We have verified the usefulness of the proposed approach using historical transactions of the Warsaw Stock Exchange.
High Confidence Subsystem Modelling for Reuse
Authors: Birgit Penzenstadler, Dagmar Koss
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

Reuse of high confidence subsystems depends on their appropriate modelling and documentation. This paper discusses the different aspects that have to be considered when modelling a system and its subsystems. We propose a concrete artefact model for integrated reuse from requirements to technical architecture, which satisfies documentation demands with respect to functionality and the context assumed by the subsystem. Based on the artefact model, we describe the steps for conformity and compatibility checking at the development stage of subsystem integration and/or reuse.
Discovering and Explaining Abnormal Nodes in Semantic Graphs
Authors: Shou-de Lin, Hans Chalupsky
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

An important problem in the area of homeland security is to identify suspicious entities in large datasets. Although there are methods from knowledge discovery and data mining (KDD) focusing on finding anomalies in numerical datasets, there has been little work aimed at discovering suspicious instances in large and complex semantic graphs whose nodes are richly connected with many different types of links. In this paper, we describe a novel, domain independent and unsupervised framework to identify such instances. Besides discovering suspicious instances, we believe that to complete the process, a system has to convince the users by providing understandable explanations for its findings. Therefore, in the second part of the paper we describe several explanation mechanisms to automatically generate human understandable explanations for the discovered results. To evaluate our discovery and explanation systems, we perform experiments on several different semantic graphs. The results show that our discovery system outperforms the state-of-the-art unsupervised network algorithms used to analyze the 9/11 terrorist network by a large margin. Additionally, the human study we conducted demonstrates that our explanation system, which provides natural language explanations for its findings, allowed human subjects to perform complex data analysis in a much more efficient and accurate manner.
Investigating Visuo-tactile Recognition of Unfamiliar Moving Objects
Authors: Jason S. Chan, T. Aisling Whitaker, Fiona N. Newell
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Previous research on haptic object recognition has focused mainly on static objects and very little is understood about the role of dynamic information in haptic object recognition. In this study we examined if motion, particularly dynamic object parts, is combined with shape information in the representation of an object in haptic memory. In our behavioural studies we found that target objects previously learned as moving objects were more easily recognized when presented dynamically than when presented as static objects, even though, shape information alone was sufficient to recognize each object. Moreover, cross-modal, visuo-tactile object recognition was better for dynamic than static objects.
A Parallel Sensor Scheduling Technique for Fault Detection in Distributed Parameter Systems
Authors: Maciej Patan
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

The problem under consideration is to determine a scheduling policy for discrete scanning sensors in such a way as to maximize the power of a simple parametric hypothesis test, which verifies the nominal state of the considered distributed system specified over a given multi-dimensional spatial domain. The optimal activation schedule for sensor network is determined based on the D s -optimality criterion defined on the respective Fisher Information Matrix. A computational scheme based on the branch-and-bound method is provided for the solution of a resulting combinatorial problem. Then, the parallel version of solver is developed in order to overcome the excessively growing computational costs for large-scale problems. The proposed approach is illustrated by simulations on a sensor network scheduling problem for a two-dimensional convective diffusion process.
A compact routing architecture for mobility
Authors: Cedric Westphal, James Kempf
Venue: Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture (2008)

We propose a compact routing architecture to support mobility in a scalable manner. Our routing architecture requires a route table of size of O(√nlog(n)) in order to provide a path stretch with a provable upper bound of 3. This is the optimal path stretch. Our architecture is built upon the theory of compact routing, which has so far been utilized in static networks only. This is the first attempt to the best of our knowledge to transpose such architecture into a network with mobility support. Our contribution is to adapt the static theory of compact routing to a class of networks with mobile leaf nodes and a static core infrastructure.
Information Services to Promote Family Engagement in Healthy Living
Authors: Dipak Bhandari, Nathalie Colineau, Stephen Giugni, Peter Marendy, Cécile Paris, Ross Wilkinson
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

We are looking at new effective ways to engage families in weight management. Going beyond targeting individuals out of their family context with a single intervention, we investigate ways of delivering tailored health information as an information service, using the family as a major contextual factor. In particular, we explore interaction modes and processes of engagement with families that would be most effective to provide an information service that users will perceive as a real benefit to them.
Transients Detection in the Time-Scale Domain
Authors: V. Bruni, D. Vitulano
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

In this paper a novel model for transients detection in piecewise stationary signals is presented. A hybrid representation is assumed for the signal and the different behavior of each component (stationary, transient and stochastic) in the time-scale plane is exploited. Experimental results on both shape contours, described by a differential chain code, and audio signals show the generality of the proposed model.
Determining the Dependency Among Clauses Based on Machine Learning Techniques
Authors: Mi-Young Kim
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

The longer the input sentences, the worse the syntactic parsing results. Therefore, a long sentence is first divided into several clauses, and syntactic analysis for each clause is performed. Finally, all the analysis results are merged into one. In the merging process, it is difficult to determine the dependency among clauses. To handle such syntactic ambiguity among clauses, this paper proposes two-step clause-dependency determination method based on machine learning techniques. We extract various clause-specific features, and analyze the effect of each feature on the performance. For the Korean texts, we experiment using four kinds of machine-learning methods. Logitboosting method performed best and it also outperformed the previous rule-based methods. 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