ppxscal/embedding_network huggingface dataset:
Cloud Capturing System Based on Computer Vision for Inner-surface of Pipe Figure Components
Authors: Zhanbin Wang, Hui Zhao, Wei Tao, Haibo Zhang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

In order to capture the inner-surface cloud of pipe figure components with different material rapidly and efficiently, a new cloud capturing system based on computer vision for inner-surface of pipe figure components was designed. Firstly, the IIRDL (Integrated Inner-reflection Ringy Discrete Laser-spot) method was proposed, which combined the merits of the LSS (Laser Single-spot Scanning) method, the IRLS (Integrated Ringy Laser Section) method, the DRLS (Distributed Ringy Laser Section) method and the DRDL (Distributed Ringy Discrete Laser-spot) method, while overcoming the weakness of them. At the same time, the measurement arm employed the new method as the core of the capturing system was designed. Secondly, on the basis of the new measurement arm the whole capturing system was constructed. At last, the real 3D mathematical model for the capturing system was built. The new system based on the new method could complete the cloud capturing for inner-surface of pipe figure components rapidly and efficiently in experiments, which demonstrated good stability, and high precision.
SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
Authors: J. P. Queille, J. Sifakis
Venue: 25 Years of Model Checking: History, Achievements, Perspectives (2008)

The aim of this paper is to illustrate by an example, the alternating bit protocol, the use of CESAR, an interactive system for aiding the design of distributed applications.CESAR allows the progressive validation of the algorithmic description of a system of communicating sequential processes with respect to a given set of specifications. The algorithmic description is done in a high level language inspired from CSP and specifications are a set of formulas of a branching time logic, the temporal operators of which can be computed iteratively as fixed points of monotonic predicate transformers. The verification of a system consists in obtaining by automatic translation of its description program an Interpreted Petri Net representing it and evaluating each formula of the specifications.
Part-selection and machine-loading problems in a flexible manufacturing system environment: a heuristic approach based on reallocation paradigm
Authors: M. K. Tiwari, J. Saha, S. K. Mukhopadhyay
Venue: International Journal of Computer Applications in Technology (2008)

In this research, an exact and efficient heuristic-based solution methodology has been formulated, which covers three segments of the machine-loading problem, i.e., part-type sequence determination, operation allocation decision and reallocation of part-type in a flexible manufacturing environment. An iterative reallocation procedure has been devised to ensure minimum positive system unbalance and maximum throughput. The proposed heuristic aims to achieve these objectives in the presence of constraints posed by availability of machining time and tool slot in a given planning horizon. Computational results on test problems indicate the supremacy of proposed heuristic which shows a significant improvement over existing methods.
Cerium (III) Complexes Modeling with Sparkle/PM3
Authors: Alfredo Mayall Simas, Ricardo Oliveira Freire, Gerd Bruno Rocha
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

The Sparkle/PM3 model is extended to cerium(III) complexes. The validation procedure was carried out using only high quality crystallographic structures (R factor < 0.05Å), for a total of thirty-seven Ce(III) complexes. The Sparkle/PM3 unsigned mean error, for all interatomic distances between the Ce(III) ion and the directly coordinating oxygen or nitrogen atoms, is 0.080Å, a level of accuracy equivalent to the Sparkle/AM1 figure of 0.083Å. Moreover, their accuracy is similar to what can be obtained by present-day ab initio effective core potential full geometry optimization calculations on such lanthanide complexes.
Modelling the configuration/management API middleware using coloured petri nets
Authors: Paul Fleischer, Lars M. Kristensen
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

The Configuration/Management Application Programming Interface (CMAPI) is a vendor-specific API and middlewarelayer for configuration and management of components in embedded systems. CMAPI is used by TietoEnator Denmark in the implementation of a controller for the Generic Access Network (GAN) architecture. This paper presents a hierarchical Coloured Petri Net model of CMAPI that was developed in the process of applying Coloured Petri Nets and CPN Tools for the specification of the GAN controller.
DaStGen--A Data Structure Generator for Parallel C++ HPC Software
Authors: Hans---Joachim Bungartz, Wolfgang Eckhardt, Miriam Mehl, Tobias Weinzierl
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Simulation codes often suffer from high memory requirements. This holds in particular if they are memory-bounded, and, with multicore systems coming up, the problem will become even worse as more and more cores have to share the memory connections. To optimise data structures with respect to memory manually is error-prone and cumbersome.This paper presents the tool DaStGen translating classes declared in C++ syntax and augmented by new keywords into plain C++ code. The tool automates the record optimisation, as it analyses the potential range of each attribute, and as the user can restrict this range further. Herefrom, the generated code stores multiple attributes within one single primitive type. Furthermore, the tool derives user-defined MPI data types for each class. Using the tool reduces any algorithm's memory footprint, it speeds up memory-bounded applications such as CFD codes, and it hides technical details of MPI applications from the programmer.
Health Document Explanation by Virtual Agents
Authors: Timothy W. Bickmore, Laura M. Pfeifer, Michael K. Paasche-Orlow
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

We describe the design and evaluation of a virtual agent that explains health documents to patients. The prevalence and impact of low health literacy is presented as a motivation for such agents, given that face-to-face interaction with health providers is cited as one of the most effective means of communicating with these patients. We analyze the form and distribution of pointing gestures used by experts in explaining health documents, and use this data to develop a computational model of agent-based document explanation. This model is evaluated in a randomized controlled trial. Preliminary results indicate that patients with low health literacy are more satisfied with health document explanation by a virtual agent compared to a human.
Designing Large Sets of Haptic Icons with Rhythm
Authors: David Ternes, Karon E. Maclean
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Haptic icons (brief tangible stimuli with associated meanings) are a new way to convey information, but are difficult to design in large quantities due to technological and perceptual constraints. Here, we employ rhythm in combination with frequency and amplitude to systematically produce 84 distinguishable tactile stimuli for use as icons. The set's large size is made possible by an analysis of how users perceptually organize tactile rhythm. Through our evaluation, we find that the two primary characteristics by which users distinguish its tactile rhythms are note length and unevenness.
Visual Femininity and Masculinity in Synthetic Characters and Patterns of Affect
Authors: Agneta Gulz, Felix Ahlner, Magnus Haake
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

It has been shown that users of a digital system perceive a more 'masculine-sounding' female voice as more persuasive and intelligent than a corresponding but more 'feminine-sounding' female voice. Our study explores whether a parallel pattern of affectively colored evaluations can be elicited when femininity and masculinity are manipulated via visual cues instead of via voice. 80 participants encountered synthetic characters, visually manipulated in terms of femininity and masculinity but with voice, spoken content, linguistic style and role of characters held constant. Evaluations of the two female characters differed in accordance with stereotype predictions - with the exception of competence-related traits; for the two male characters evaluations differed very little. The pattern for male versus female characters was slightly in opposite to stereotype predictions. Possible explanations for these results are proposed. In conclusion we discuss the value of being aware of how different traits in synthetic characters may interact.
Detection of diabetic symptoms in retinal images using analog algorithms
Authors: Daniela Matei, Radu Matei
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

In this paper a class of analog algorithms based on the concept of Cellular Neural Network (CNN) is applied in some processing operations of some important medical images, namely retina images, for assessment of various symptoms connected with diabetic retinopathy. Some specific processing tasks like morphological operations, linear filtering and thresholding are proposed, the corresponding template values are given and simulations on real retina images are provided.
First Steps on Using OpenMath to Add Proving Capabilities to Standard Dynamic Geometry Systems
Authors: Miguel A. Abánades, Jesús Escribano, Francisco Botana
Venue: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference (2007)

A prototype for a web application designed to symbolically process locus, proof and discovery tasks on geometric diagrams created with the commercial dynamic geometry systems Cabri, The Geometer's Sketchpad and Cinderella is presented. The application, named LAD (acronym for Locus-Assertion-Discovery) and thought of as a remote add-on for the considered DGS, follows the Groebner basis method relying on CoCoA and a Mathematica kernel for the involved symbolic computations. From the DGS internal textual representation of a geometric diagram, an OpenMath (i.e. semantic based) description of the requested task is created using the elements in the plangeo OpenMath content dictionaries. A review of the elements included in these CDs is given and two new elements proposed, namely locus and discovery. Everything is finally thoroughly illustrated with examples. LAD is freely accessible at http://nash.sip.ucm.es/LAD/LAD.html .
A Framework for QoS Contract Negotiation in Component-Based Applications
Authors: Mesfin Mulugeta, Alexander Schill
Venue: Balancing Agility and Formalism in Software Engineering: Second IFIP TC 2 Central and East European Conference on Software Engineering Techniques, CEE-SET 2007, Poznan, Poland, October 10-12, 2007, Revised Selected Papers (2008)

The support of QoS properties in component-based software requires the run-time selection of appropriate concrete QoS contracts at the ports of the interacting components. Such a selection process is called QoS contract negotiation. This paper discusses the architecture of a QoS contract negotiation framework and how it is implemented in our prototype. The framework can be integrated in a component container and act as a run-time support environment when QoS contracts are negotiated under different application scenarios. Our approach is based on: (i) the notion that the required and provided QoS properties as well as resource demands are specified at the component level; and (ii) that QoS contract negotiation is modeled as a constraint solving problem.
A differential quadrature algorithm for simulations of nonlinear Schrödinger equation
Authors: Alper Korkmaz, İdris Dağ
Venue: Computers Mathematics with Applications (2008)

Numerical simulations of Nonlinear Schrodinger Equation are studied using differential quadrature method based on cosine expansion. Propogation of a soliton, interaction of two solitons, birth of standing and mobile solitons and bound state solutions are simulated. The accuracy of the method (DQ) is measured using maximum error norm. The results are compared with some earlier works. The lowest two conserved quantities are computed numerically for all cases.
Kilim: Isolation-Typed Actors for Java
Authors: Sriram Srinivasan, Alan Mycroft
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

This paper describes Kilim, a framework that employs a combination of techniques to help create robust, massively concurrent systems in mainstream languages such as Java: (i) ultra-lightweight, cooperatively-scheduled threads (actors), (ii) a message-passing framework (no shared memory, no locks) and (iii) isolation-aware messaging.Isolation is achieved by controlling the shape and ownership of mutable messages --- they must not have internal aliases and can only be owned by a single actor at a time. We demonstrate a static analysis built around isolation type qualifiers to enforce these constraints.Kilim comfortably scales to handle hundreds of thousands of actors and messages on modest hardware. It is fast as well --- task-switching is 1000x faster than Java threads and 60x faster than other lightweight tasking frameworks, and message-passing is 3x faster than Erlang (currently the gold standard for concurrency-oriented programming).
A Novel Hierarichical Speaker Identification Method
Authors: Ming Li, Xue-Yan Liu, Yu-Juan Xing
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

This paper proposes a novel hierarchical speaker identification method to save the speaker identification and training time, viz. First is to get a coarse decision by a fast scan all registered speakers using PCA classifier to found M possible target speakers; then is to get a final decision by the proposed Multi-Reduced Support Vector Machine (MRSVM). And the MRSVM has two reduction steps to reduce training time and the memory size for SVM. Firstly, speech feature dimensions are reduced by using PCA transform, the noise is removed from speech simultaneity; secondly, the training data are selected at boundary of each cluster as Support Vectors (SVs) by using Kernel-based fuzzy clustering technique. The experiment results show that the training data, time and storage size can be reduced remarkably by using the proposed reduction method, and the identification velocity is improved greatly by the hierarchical identification method and the system has better robustness.
Internet messaging: An examination of the impact of attitudinal, normative, and control belief systems
Authors: G. Premkumar, K. Ramamurthy, Hsin-Nan Liu
Venue: Information and Management (2008)

While instant messaging (IM) has been very popular among teenagers and college students for social and recreation communication, its use in corporate settings has been limited. We examined the factors that influence the intention to use and actual use of IM. A research model was developed based on diffusion of innovation and Socio-psychological theories. The model examined the influence of seven variables in three belief structures (the attitudinal, normative, and control). The model was empirically validated using a field survey of 349 respondents. The results indicated that five of the seven variables explained about 41% of the variance in the intention to use IM. The five significant variables were: utilitarian beliefs, hedonic beliefs, subjective norms, critical mass, and ease of use. Affiliation motivation was not significant and social belief had a negative impact on intention. As expected, intention to use had a significant influence on actual usage.
Statistical Language Models of Lithuanian Based on Word Clustering and Morphological Decomposition
Authors: Airenas Vaičiūnas, Vytautas Kaminskas, Gailius Raškinis
Venue: Informatica (2004)

This paper describes our research on statistical language modeling of Lithuanian. The idea of improving sparse n-gram models of highly inflected Lithuanian language by interpolating them with complex n-gram models based on word clustering and morphological word decomposition was investigated. Words, word base forms and part-of-speech tags were clustered into 50 to 5000 automatically generated classes. Multiple 3-gram and 4-gram class-based language models were built and evaluated on Lithuanian text corpus, which contained 85 million words. Class-based models linearly interpolated with the 3-gram model led up to a 13% reduction in the perplexity compared with the baseline 3-gram model. Morphological models decreased out-of-vocabulary word rate from 1.5% to 1.02%.
Scheduling: from optimality to configurability
Authors: Vishal Misra
Venue:  (2008)

We begin by studying optimal scheduling policies in a single-server system and optimal dispatching policies in systems with multiple parallel queues and servers. With different assumptions of system characteristics (e.g. workload patterns) and performance requirements (e.g. mean response time and mean slowdown), the optimal scheduling policies differ vastly. As an example, in a system with a single queue, we show that a scheduling policy can be the best scheduling policy for one kind of service-time distributions and at the same time the worst for another, and that a scheduling policy can be the best policy in terms of mean slowdown but the worst in terms of mean response time. Since there is no such thing as ubiquitous optimality, we put our efforts into two directions. First, inspired by the observation that the variability of service time is a dominant factor on the optimality of scheduling policies, we set constraints on service-time variability and investigate the best and worst scenarios in terms of mean response time for several scheduling policies on a single-server queue. Second, we propose a configurable policy that can be tuned with a parameter. This configurable policy is not only analyzed in both deterministic and stochastic configurations, but also implemented in Linux as a kernel scheduler. We justify by experiments our claim that the ubiquitous optimality can now be achieved by configurability.
Studies on applying the equivalence principle algorithm on multiscale problems
Authors: Weng Cho Chew
Venue:  (2007)

The equivalence principle replaces currents distributed in a volume by equivalent currents residing on the bounding surface. It also disassociates the current solutions in different regions. The work reported here exploits the equivalence principle to generate a domain decomposition algorithm for integral equation solvers. The equivalence principle algorithm encapsulates highly complex bodies by simple surfaces, thereby facilitating parallelization, solution reusability, and even improving matrix conditioning. Conventional basis used to discretize the integral equations breaks down when an equivalence surface intercepts a current-carrying conductor. A tap basis scheme is proposed to accurately model the currents at the intersections to conserve the continuity and avoid charge singularities. Moreover, the multilevel fast multipole algorithm is used to accelerate the equivalence principle algorithm so that large multiscale problems can he solved efficiently.
Learning Left-to-Right and Right-to-Left Iterative Languages
Authors: Jeffrey Heinz
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

The left-to-right and right-to-left iterative languages are previously unnoticed subclasses of the regular languages of infinite size that are identifiable in the limit from positive data. Essentially, these language classes are the ones obtained by merging final states in a prefix tree and initial states in a suffix tree of the observed sample, respectively. Strikingly, these classes are also transparently related to the zero-reversible languages because some algorithms that learn them differ minimally from the ZR algorithm given in Angluin (1982). Second, they are part of the answer to the challenge provided by Muggleton (1990), who proposed mapping the space of language classes obtainable by a general state-merging algorithm IM1. Third, these classes are relevant to a hypothesis of how children can acquire sound patterns of their language--in particular, the hypothesis that all phonotactic patterns found in natural language are neighborhood-distinct (Heinz 2007).
Distributed Event Localization and Tracking with Wireless Sensors
Authors: Markus Wälchli, Piotr Skoczylas, Michael Meer, Torsten Braun
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

In this paper we present the distributed event localization and tracking algorithm DELTA that solely depends on light measurements. Based on this information and the positions of the sensors, DELTA is able to track a moving person equipped with a flashlight by dynamically building groups and electing well located nodes as group leaders. Moreover, DELTA supports object localization. The gathered data is sent to a monitoring entity in a fixed network which can apply pattern recognition techniques to determine the legitimacy of the moving person. DELTA enables object tracking with minimal constraints on both sensor hardware and the moving object. We show the feasibility of the algorithm running on the limited hardware of an existing sensor platform.
Vision-Based SLAM in Real-Time
Authors: Andrew J. Davison
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

When a world-observing camera moves through a scene capturing images continuously, it is possible to analyse the images to estimate its ego-motion, even if nothing is known in advance about the contents of the scene around it. The key to solving this apparently chicken-and-egg problem is to detect and repeatedly measure a number of salient `features' in the environment as the camera moves. Under the usual assumption that most of these are rigidly related in the world, the many geometric constraints on relative camera/feature locations provided by image measurements allow one to solve simultaneously for both the camera motion and the 3D world positions of the features. While global optimisation algorithms are able to achieve the most accurate solutions to this problem, the consistent theme of my research has been to develop `Simultaneous Localisation and Mapping' (SLAM) algorithms using probabilistic filtering which permit sequential, hard real-time operation.
A Propositional Dynamic Logic Approach for Order of Magnitude Reasoning
Authors: A. Burrieza, E. Muñoz-Velasco, M. Ojeda-Aciego
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

We introduce a Propositional Dynamic Logic for order of magnitude reasoning in order to formalize qualitative operations of sum and product. This new logic has enough expressive power to consider, for example, the concept of closeness, and to study some interesting properties for the qualitative operations, together with the logical definability of these properties. Finally, we show the applicability of our approach on the basis of some examples.