ppxscal/embedding_network huggingface dataset:
Uniform Grids from Raster Data
Authors: Albert J. Christensen
Venue: IEEE Computer Graphics and Applications (1983)

This approach to preparing a uniform grid of magnetic anomalies uses special software to evaluate the grid intersections directly from coded raster images of the source map. 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
Postprocessing of Optical Flows Via Surface Measures and Motion Inpainting
Authors: Claudia Kondermann, Daniel Kondermann, Christoph Garbe
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

Dense optical flow fields are required for many applications. They can be obtained by means of various global methods which employ regularization techniques for propagating estimates to regions with insufficient information. However, incorrect flow estimates are propagated as well. We, therefore, propose surface measures for the detection of locations where the full flow can be estimated reliably, that is in the absence of occlusions, intensity changes, severe noise, transparent structures, aperture problems and homogeneous regions. In this way we obtain sparse, but reliable motion fields with lower angular errors. By subsequent application of a basic motion inpainting technique to such sparsified flow fields we obtain dense fields with smaller angular errors than obtained by the original combined local global (CLG) method and the structure tensor method in all test sequences. Experiments show that this postprocessing method makes error improvements of up to 38% feasible.
Speech technology in real world environment: early results from a long term study
Authors: Jinjuan Feng, Shaojian Zhu, Ruimin Hu, Andrew Sears
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Existing knowledge on how people use speech-based technologies in realistic settings is limited. We are conducting a longitudinal field study, spanning six months, to investigate how users with no physical impairments and users with upper body physical impairments use speech technologies when interacting with computers in their home environment. Digital data logs, time diaries, and interviews are being used to record the types of applications used, frequency of use of each application, and difficulties experienced as well as subjective data regarding the usage experience. While confirming many expectations, initial results have provided several unexpected insights including a preference to use speech for navigation instead of dictation tasks, and the use of speech technology for programming and games.
Learning with Temporary Memory
Authors: Steffen Lange, Samuel E. Moelius,  Iii, Sandra Zilles
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model constrains the learner's memory not only in how much data may be retained, but also in how long that data may be retained. More specifically, the model requires that, if a learner commits an example x to memory in some stage of the learning process, then there is some subsequent stage for which x no longer appears in the learner's memory. This model is called temporary example memory (Tem) learning. In some sense, it captures the idea that memories fade.Many interesting results concerning the Tem-learning model are presented. For example, there exists a class of languages that can be identified by memorizing k + 1 examples in the Tem sense, but that cannot be identified by memorizing k examples in the Bem sense. On the other hand, there exists a class of languages that can be identified by memorizing just 1 example in the Bem sense, but that cannot be identified by memorizing any number of examples in the Tem sense. (The proof of this latter result involves an infinitary self-reference argument.) Results are also presented concerning the special cases of: learning indexable classes of languages, and learning (arbitrary) classes of infinite languages.
Semi-regular relative difference sets with large forbidden subgroups
Authors: Tao Feng, Qing Xiang
Venue: Journal of Combinatorial Theory Series A (2008)

Motivated by a connection between semi-regular relative difference sets and mutually unbiased bases, we study relative difference sets with parameters (m,n,m,m/n) in groups of non-prime-power orders. Let p be an odd prime. We prove that there does not exist a (2p,p,2p,2) relative difference set in any group of order 2p^2, and an abelian (4p,p,4p,4) relative difference set can only exist in the group Z"2^2xZ"3^2. On the other hand, we construct a family of non-abelian relative difference sets with parameters (4q,q,4q,4), where q is an odd prime power greater than 9 and q=1(mod4). When q=p is a prime, p>9, and p=1(mod4), the (4p,p,4p,4) non-abelian relative difference sets constructed here are genuinely non-abelian in the sense that there does not exist an abelian relative difference set with the same parameters.
Combining Scenario- and Model-Based Testing to Ensure POSIX Compliance
Authors: Frédéric Dadeau, Adrien Kermadec, Régis Tissot
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

We present in this paper a way to produce test suites for the POSIX mini-challenge, based on a formal model of a file system manager, written using a B machine. By this case study, we illustrate the limitations of a fully-automated testing process, which justifies the use of scenarios that complements the classical functional testing approach. Scenarios are expressed through schemas, focusing only on operation chaining. They are played on the model using a symbolic animation engine in order to automatically compute pertinent operation parameter values, based on model coverage criteria such as behavioral or data coverage. We concretize our experimentation by testing the POSIX conformance of two different file systems: a recent Linux distribution, and a customized Java implementation of POSIX used to evaluate the relevance of our approach.
On Creating Industry-Wide Reference Architectures
Authors: Liming Zhu, Mark Staples, Vladimir Tosic
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

Many industries have been developing e-business standards to improve business-to-business interoperability on a mass scale. Most such standards are composed of business data models with some message exchange patterns. Such data-only standards leave a very large interpretation space for the implementation stage at each individual organization. Thus, true industry-wide interoperability is still hard to achieve. In this industry report, we describe our experiences in creating and evaluating reference architectures for the Australian lending industry. To achieve the right level of prescriptiveness, our reference architectures are deliberately non-structural. Instead, they are based on a set of quality-centric architectural rules. We devised new methods for analyzing interoperability and evaluating such industry-level reference architectures. The first reference architecture has now been adopted and achieved positive effects. We also summarize several other lessons we learned, such as the need to align reference architectures with industry structures.
Specifying Intrusion Detection and Reaction Policies: An Application of Deontic Logic
Authors: Nora Cuppens-Boulahia, Frédéric Cuppens
Venue: Proceedings of the 9th international conference on Deontic Logic in Computer Science (2008)

The security policy of an information system may include a wide range of different requirements. The literature has primarily focused on access and information flow control requirements and more recently on authentication and usage control requirements. Specifying administration and delegation policies is also an important issue, especially in the context of pervasive distributed systems. In this paper, we are investigating the new issue of modelling intrusion detection and reaction policies and study the appropriateness of using deontic logic for this purpose. We analyze how intrusion detection requirements may be specified to face known intrusions but also new intrusions. In the case of new intrusions, we suggest using the bring it about modality and specifying requirements as prohibitions to bring it about that some security objectives are violated. When some intrusions occur, the security policy to be complete should specify what happens in this case. This is what we call a reaction policy. The paper shows that this part of the policy corresponds to contrary to duty requirements and suggests an approach based on assigning priority to activation contexts of security requirements.
Solar Radiation Data Modeling with a Novel Surface Fitting Approach
Authors: Fatih Onur Hocaoglu, Ömer Nezih Gerek, Mehmet Kurban
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

In this work one year hourly solar radiation data are analyzed and modeled. Using a 2-D surface fitting approach, a novel model is developed for the general behavior of the solar radiation. The mathematical formulation of the 2-D surface model is obtained. The accuracy of the analytical surface model is tested and compared with another surface model obtained from a feed-forward Neural Network(NN). Analytical surface model and NN surface model are compared in the sense of Root Mean Square Error (RMSE). It is obtained that the NN surface model gives more accurate results with smaller RMSE results. However, unlike the specificity of the NN surface model, the analytical surface model provides an intuitive and more generalized form that can be suitable for several other locations on earth.
A Cross-Platform Robotic Architecture for Autonomous Interactive Robots
Authors: Yasser F. Mohammad, Toyoaki Nishida
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

This paper reports the lowest level of specification of a new cross-platform robotic architecture for HRI applications called EICA. The main contribution of this paper is a thorough analysis of some of the challenges HRI applications impose on the underlying architecture, and the details of the reactive layer of the EICA architecture that was designed to meet those challenges emphasizing how low level attention focusing and action integration is implemented. The paper also describes the implementation of a listener robot that uses human-like nonverbal behavior during explanation scenarios using the proposed architecture and reports some encouraging results from experimenting with a simplified simulation of this robot.
Disturbance Attenuating Controller Design for a Class of Nonlinear Systems with Unknown Time-Delay
Authors: Geng Ji
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

An adaptive neural network control design approach is proposed for a class of nonlinear systems with unknown time delay. By constructing a proper Lyapunov-Krasoviskii functional, the uncertainty of unknown time-delay is compensated. In addition, the semiglobally input-to-state practically stable (ISpS) disturbance attenuation problem is solved by neural network technique. The feasibility of neural network approximation of unknown system functions is guaranteed over practical compact set. Finally, a numerical simulation is given to show the effectiveness of the approach.
Delineating Homology Generators in Graph Pyramids
Authors: Mabel Iglesias, Adrian Ion, Walter G. Kropatsch, Edel B. García
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Computation of homology generators using a graph pyramid can significantly increase performance, compared to the classical methods. First results in 2D exist and show the advantages of the method. Generators are computed on the upper level of a graph pyramid. Top-level graphs may contain self loops and multiple edges, as a side product of the contraction process. Using straight lines to draw these edges would not show the full information: self loops disappear, parallel edges collapse. This paper presents a novel algorithm for correctly visualizing graph pyramids, including multiple edges and self loops which preserves the geometry and the topology of the original image. New insights about the top-down delineation of homology generators in graph pyramids are given.
Learning Longitudinal Deformations for Adaptive Segmentation of Lung Fields from Serial Chest Radiographs
Authors: Yonghong Shi, Dinggang Shen
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

We previously developed a deformable model for segmenting lung fields in serial chest radiographs by using both population-based and patient-specific shape statistics, and obtained higher accuracy compared to other methods. However, this method uses an ad hoc way to evenly partition the boundary of lung fields into some short segments, in order to capture the patient-specific shape statistics from a small number of samples by principal component analysis (PCA). This ad hoc partition can lead to a segment including points with different amounts of longitudinal deformations, thus rendering it difficult to capture principal variations from a small number of samples using PCA. In this paper, we propose a learning technique to adaptively partition the boundary of lung fields into short segments according to the longitudinal deformations learned for each boundary point. Therefore, all points in the same short segment own similar longitudinal deformations and thus small variations within all longitudinal samples of a patient, which enables effective capture of patient-specific shape statistics by PCA. Experimental results show the improved performance of the proposed method in segmenting the lung fields from serial chest radiographs.
A New DPA Countermeasure Based on Permutation Tables
Authors: Jean-Sébastien Coron
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

We propose and analyse a new countermeasure against Differential Power Analysis (DPA) for the AES encryption algorithm, based on permutation tables. As opposed to existing AES countermeasures, it does not use random masking. We prove that our new countermeasure is resistant against first-order DPA; we also show that it is quite efficient in practice.
MasterFinger: Multi-finger Haptic Interface for Collaborative Environments
Authors: Mary Monroy, María Oyarzabal, Manuel Ferre, Alexandre Campos, Jorge Barrio
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

This paper introduces the MasterFinger developemt and application, a multi-finger haptic interface for virtual object manipulation. This haptic device, with a modular interface, is specially designed to perform collaborative tasks. Each module is in charge of managing the haptic interaction with a finger. The mechanical structure of the module is based on a serial-parallel structure linked to the finger thimble by a gimble with its own controller. Cooperative applications based on MasterFinger-2 (MF2) are also described in this study. Results from these applications show that multifinger interface is a significant leap in haptic devices since precise object grasping and collaborative manipulation by using two hands are successfully performed.
Nature-Inspired Congestion Control: Using a Realistic Predator-Prey Model
Authors: Morteza Analoui, Shahram Jamali
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

Nature has been a continuous source of inspiration for many successful techniques, algorithms and computational metaphors. We outline such a inspiration here, in the context of bio-inspired congestion control (BICC) algorithms. In this paper a realistic predator-prey model is mapped to the Internet congestion control mechanism. This mapping leads to a bio-inspired congestion control scheme. Dynamic and equilibrium properties of developed algorithm are good enough according to the simulation results.
Eulogy: Alfred Tarski, 1901-1983
Authors: J. W. Addison
Venue: IEEE Annals of the History of Computing (1984)

Of his numerous investigations, outlined in seven books and more than 300 other publications, Tarski was most proud of two: his work on truth and his design of an algorithm in 1930 to decide the truth or falsity of any sentence of the elementary theory of high school Euclidean geometry. Today this is viewed as a pioneering, landmark result in the burgeoning branch of theoretical computer science which considers what problems can or cannot be settled, either practically or in principle, by computers.
Self-assessment in Vocabulary Tutoring
Authors: Michael Heilman, Maxine Eskenazi
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

To individualize instruction, a tutor must infer which knowledge components the student knows and does not know. Self-assessments, by which the student directly reports to the tutor whether a certain item is known, are a fast measure of student knowledge. We investigate their use to initialize a learner model used to individualize instruction ESL vocabulary. Experimental results indicate that self-assessments can be useful measures of knowledge for use in a tutoring system for vocabulary. Self-assessments appear to be particularly reliable when learners claim that words are not known.
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
Authors: Marc Tedder, Derek Corneil, Michel Habib, Christophe Paul
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

Modular decomposition is fundamental for many important problems in algorithmic graph theory including transitive orientation, the recognition of several classes of graphs, and certain combinatorial optimization problems. Accordingly, there has been a drive towards a practical, linear-time algorithm for the problem. This paper posits such an algorithm; we present a linear-time modular decomposition algorithm that proceeds in four straightforward steps. This is achieved by introducing the notion of factorizing permutations to an earlier recursive approach. The only data structure used is an ordered list of trees, and each of the four steps amounts to simple traversals of these trees. Previous algorithms were either exceedingly complicated or resorted to impractical data-structures.
Secret External Encodings Do Not Prevent Transient Fault Analysis
Authors: Christophe Clavier
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

Contrarily to Kerckhoffs' principle, many applications of today's cryptography still adopt the security by obscurity paradigm. Furthermore, in order to rely on its proven or empirical security, some realizations are based on a given well known and widely used cryptographic algorithm. In particular, a possible design would obfuscate a standard block cipher E by surrounding it with two secret external encodings P 1 and P 2 (one-to-one mappings), leading to the proprietary algorithm E¿ = P 2 ¿ E ¿ P 1.A claimed advantage of this approach is that, since inputs and outputs of the underlying function E are not known by a potential attacker, such a construction is usually believed to inherently prevent any kind of transient fault analysis that may apply on the core function E. In this paper, we show that this latter argument is not true, by exhibiting a key recovery attack which applies to the whole class of externally encoded DES or Triple-DES. Moreover, our attack remains applicable even in the presence of the classical counter-measure against fault attacks which consists in executing the algorithm twice and returning an output only if both results are identical.
Multi-priority Multi-path Selection for Video Streaming in Wireless Multimedia Sensor Networks
Authors: Lin Zhang, Manfred Hauswirth, Lei Shu, Zhangbing Zhou, Vinny Reynolds, Guangjie Han
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

Video sensors are used in wireless multimedia sensor networks (WMSNs) to enhance the capability for event description. Due to the limited transmission capacity of sensor nodes, a single path often cannot meet the requirement of video transmission. Consequently, multi-path transmission is needed. However, not every path found by multi-path routing algorithms may be suitable for transmitting video, because a long routing path with a long end to end transmission delay may not satisfy the time constraint of the video. Furthermore, each video stream includes two kinds of information: image and audio streams. In different applications, image and audio streams play different roles, and the importance levels are different. Higher priority should be given to the more important stream (either the image stream or the audio stream) to guarantee the using of limited bandwidth and energy in WMSNs. In this paper, we propose a Multi-priority Multi-path Selection (MPMPS) scheme in transport layer to choose the maximum number of paths from all found node-disjoint routing paths for maximizing the throughput of streaming data transmission. Simulation results show that MPMPS can effectively choose the maximum number of paths for video transmission.
A prototype documenter system for medical grand rounds
Authors: Renato de Freitas Bulcão-Neto, José Antonio Camacho-Guerrero, Alessandra Alaniz Macedo
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

This paper demonstrates our ongoing experience on a documenter system for medical grand rounds. The system captures and synchronizes the set of material presented and corresponding physicians' interactions, automatically relates clinical cases of patients, and then generates web-accessible documents with all information captured. The resulting documentation can be used for several purposes such as teaching, research and presurgical decision taking.
The Evaluation of Success Degree in Electric Power Engineering Projects Based on Improved Variable Weight Grey Cluster
Authors: Baoqian Duan, Lijun Zhao, Qingchao Liu, Li Tian
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The paper uses grey system theory and fuzzy mathematics to improve the construction model of membership function in traditional variable weight grey cluster. The new model extends the function of taking value interval, and ensures the result more accuracy and complete. Then we give a success degree evaluation index system and standard value for each index. Last we use improved variable weight grey cluster to evaluate the success degree of electric power engineering projects, and can get a result conforming to reality. The example proved the method is practical.