ppxscal/embedding_network huggingface dataset:
A differential GPS carrier phase technique for precision outdoor AR tracking
Authors: W. T. Fong, S. K. Ong, A. Y. C. Nee
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

This paper presents a differential GPS carrier phase technique for 3D outdoor position tracking in mobile augmented reality (AR) applications. It has good positioning accuracy, low drift and jitter, and low computation requirement. It eliminates the resolution of integer ambiguities. The position from an initial point is tracked by accumulating the displacement in each time step, which is determined using Differential Single Difference. Preliminary results using low cost GPS receivers show that the position error is 10cm, and the drift is 0.001ms−1, which can be compensated using linear models. Stable and accurate augmentations in outdoor scenes are demonstrated.
Measuring non-native speakers' proficiency of English by using a test with automatically-generated fill-in-the-blank questions
Authors: Eiichiro Sumita, Fumiaki Sugaya, Seiichi Yamamoto
Venue: Proceedings of the second workshop on Building Educational Applications Using NLP (2005)

This paper proposes the automatic generation of Fill-in-the-Blank Questions (FBQs) together with testing based on Item Response Theory (IRT) to measure English proficiency. First, the proposal generates an FBQ from a given sentence in English. The position of a blank in the sentence is determined, and the word at that position is considered as the correct choice. The candidates for incorrect choices for the blank are hypothesized through a thesaurus. Then, each of the candidates is verified by using the Web. Finally, the blanked sentence, the correct choice and the incorrect choices surviving the verification are together laid out to form the FBQ. Second, the proficiency of non-native speakers who took the test consisting of such FBQs is estimated through IRT. Our experimental results suggest that: (1) the generated questions plus IRT estimate the non-native speakers' English proficiency; (2) while on the other hand, the test can be completed almost perfectly by English native speakers; and (3) the number of questions can be reduced by using item information in IRT. The proposed method provides teachers and testers with a tool that reduces time and expenditure for testing English proficiency.
Multimedia Forensics Is Not Computer Forensics
Authors: Rainer Böhme, Felix C. Freiling, Thomas Gloe, Matthias Kirchner
Venue: Proceedings of the 3rd International Workshop on Computational Forensics (2009)

The recent popularity of research on topics of multimedia forensics justifies reflections on the definition of the field. This paper devises an ontology that structures forensic disciplines by their primary domain of evidence. In this sense, both multimedia forensics and computer forensics belong to the class of digital forensics, but they differ notably in the underlying observer model that defines the forensic investigator's view on (parts of) reality, which itself is not fully cognizable. Important consequences on the reliability of probative facts emerge with regard to available counter-forensic techniques: while perfect concealment of traces is possible for computer forensics, this level of certainty cannot be expected for manipulations of sensor data. We cite concrete examples and refer to established techniques to support our arguments.
Adaptive Kalman Filtering Based Location Coordination Algorithm for Wireless Sensor and Actor Networks
Authors: Xu Zhiming, Wang Yu, Zuo Qiyao, Tang Jian
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Aiming at dynamic location coordination that is vital to the topology control and wireless communication for the actor on Wireless sensor and actor networks(WSANs), We put forward a strategy for the optimum coordination process by location prediction and researched the algorithm for the three-dimensional sensor-actor location coordination based on kalman filtering theory, which could obtain desired precision and real-time performance. Owing to the adduction of the CURRENT acceleration model in the Kalman filtering process, the algorithm holds a capability of strongly adaptive kinematic location saltation and track. The case for the application of link mobility metrics makes out that the algorithm can become the basic algorithm for the proactive routing, proactive clustering and cognitive networks. At last, the MATLAB simulation result shows the good performance of the algorithm.
Symbolic Reachability Computation of a Class of Nonlinear Systems
Authors: Ming Xu, Liangyu Chen, Zhi-bin Li
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Reachability is recognized as a key problem in designing physical control systems (most are nonlinear systems) in formal method community. Issues related to stability and controllability of physical systems are well studied in control theory. However there are not many results on reachability of those systems and fewer on nonlinear systems in computer science yet. In this paper, we present the first known family of nonlinear systems with the decidable symbolic computation problem of their reachable state spaces at the best of our knowledge. This is approached by reducing reachability computation to semi-algebraic system solving. Furthermore we illustrate the application of our method by performing the Maple package DISCOVERER.
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
Authors: Jörg Pührer, Hans Tompits
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at studying conditions under which certain syntactic constructs can be eliminated from programs preserving some given equivalence relation. In this paper, we continue this endeavour introducing novel conditions under which disjunction and negation can be eliminated from answer-set programs under relativised strong equivalence with projection. This notion is a generalisation of the usual strong-equivalence relation, as introduced by Lifschitz, Pearce, and Valverde, by allowing parametrisable context and output alphabets, which is an important feature in view of practical programming techniques like the use of local variables and modules. We provide model-theoretic conditions that hold for a disjunctive logic program P precisely when there is a program Q, equivalent to P under our considered notion, such that Q is either positive, normal, or Horn, respectively. Moreover, we outline how such a Q, called a casting of P, can be obtained, and consider complexity issues.
Adaptive Pointing --- Design and Evaluation of a Precision Enhancing Technique for Absolute Pointing Devices
Authors: Werner A. König, Jens Gerken, Stefan Dierdorf, Harald Reiterer
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

We present Adaptive Pointing, a novel approach to addressing the common problem of accuracy when using absolute pointing devices for distant interaction. First, we discuss extensively some related work concerning the problem-domain of pointing accuracy when using absolute or relative pointing devices. As a result, we introduce a novel classification scheme to more clearly discriminate between different approaches. Second, the Adaptive Pointing technique is presented and described in detail. The intention behind this approach is to improve pointing performance for absolute input devices by implicitly adapting the Control-Display gain to the current user's needs without violating users' mental model of absolute-device operation. Third, we present an experiment comparing Adaptive Pointing with pure absolute pointing using a laser-pointer as an example of an absolute device. The results show that Adaptive Pointing results in a significant improvement compared with absolute pointing in terms of movement time (19%), error rate (63%), and user satisfaction.
Polarity sensitivity and evaluation order in type-logical grammar
Authors: Chung-chieh Shan
Venue: Proceedings of HLT-NAACL 2004: Short Papers on XX (2004)

We present a novel, type-logical analysis of polarity sensitivity: how negative polarity items (like any and ever) or positive ones (like some) are licensed or prohibited. It takes not just scopal relations but also linear order into account, using the programming-language notions of delimited continuations and evaluation order, respectively. It thus achieves greater empirical coverage than previous proposals.
Test Pattern Generation using Boolean Proof Engines, 1st edition
Authors: Rolf Drechsler, Stephan Eggersgl, Grschwin Fey, Daniel Tille
Venue:  (2009)

In Test Pattern Generation using Boolean Proof Engines, we give an introduction to ATPG. The basic concept and classical ATPG algorithms are reviewed. Then, the formulation as a SAT problem is considered. As the underlying engine, modern SAT solvers and their use on circuit related problems are comprehensively discussed. Advanced techniques for SAT-based ATPG are introduced and evaluated in the context of an industrial environment. The chapters of the book cover efficient instance generation, encoding of multiple-valued logic, usage of various fault models, and detailed experiments on multi-million gate designs. The book describes the state of the art in the field, highlights research aspects, and shows directions for future work.
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
Authors: Roberto Barbuti, Francesca Levi, Paolo Milazzo, Guido Scatena
Venue: Proceedings of the 3rd International Workshop on Reachability Problems (2009)

We present an abstraction of the probabilistic semantics of Multiset Rewriting to formally express systems of reactions with uncertain kinetic rates. This allows biological systems modelling when the exact rates are not known, but are supposed to lie in some intervals. On these (abstract) models we perform probabilistic model checking obtaining lower and upper bounds for the probabilities of reaching states satisfying given properties. These bounds are under- and over-approximations, respectively, of the probabilities one would obtain by verifying the models with exact kinetic rates belonging to the intervals.
Providing Source-Location Privacy in Wireless Sensor Networks
Authors: Yun Li, Jian Ren
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

Wireless sensor networks (WSN) have been widely used in many areas for unattended event monitoring. Mainly due to lack of a protected physical boundary, wireless communications are vulnerable to unauthorized detection, interception and and even node capture. Privacy is becoming one of the major issues that jeopardize the successful deployment and survivability of wireless sensor networks. While confidentiality of the message can be ensured through content encryption, it is much more difficult to adequately address the source-location privacy. For WSN, source-location privacy service is further complicated by the fact that the sensor nodes consist of low-cost and low-power radio devices, computationally intensive cryptographic algorithms (such as public-key cryptosystems) and large scale broadcasting-based protocols are not suitable for WSN. In this paper, we propose a two-step routing strategy for the messages to be routed from the actual source node to the SINK node through either a single, or multiple, randomly selected intermediate node(s) away from the source node so that it is to make it infeasible for the adversaries to trace back to the source node through hop-by-hop routing analysis. In the first protocol, the messages will be routed to a single intermediate node. This scheme can provide very good local source-location privacy. We also propose routing through multiple randomly selected intermediate nodes based on angle and quadrant to further improve the performance and security. While providing source-location privacy for WSN, our simulation results demonstrate that the proposed schemes are very efficient in energy consumption, and transmission latency. The proposed schemes can also assurance high message delivery ratio. Therefore, they can be used for many practical applications.
Evolutionary Parameters in Sequence Families
Authors: Said Hassan Ahmed, Tor Flå
Venue: Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics (2009)

In an attempt to incorporate environmental effects like cold-adaptation into models of sequence evolution on a phylogenetic tree, we present a viable way of representing descriptive statistics of sequence observables under reversible Markov models of sequence evolution. Local variation in amino acid distribution along and across the sequence family can be connected to enzymatic adaptation to different temperatures. Here, we estimate a few amino acid properties and how the variations of these properties both with respect excess mean values (EMVs) and covariance classify the protein family into clusters. Application of a multiscale and multivariate method to an aligned family of distinct trypsin and elastase sequences shows drift of centroid mean sequences of cold adapted enzymes compared to their warm-active counterparts.
The Analysis of Breach Path Problem in Wireless Sensor Networks with Blind Area
Authors: Wenming Cao, Tiancheng He
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

-Wireless ad-hoc sensor networks have been used widely in the physical world. One of the fundamental problems in sensor networks is the coverage in some complicated situation. In this paper, we studied the breach path problem for target in sensor networks with blind area, and defined the blind area of polygon in sensor networks. The existence of breach path and definition of maximal break path were also discussed in this paper. Considering the geometric model of sensor networks, we proposed the distributed algorithm to calculate the maximal breach path based on Clifford geometric algebra in sensor networks with blind area. The experimental results and their analyses prove the efficiency of our theory.
Minimizing Average Flow-Time
Authors: Naveen Garg
Venue: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday (2009)

This article looks at the problem of scheduling jobs on multiple machines both in the online and offline settings. It attempts to identify the key ideas in recent work on this problem for different machine models.
Mechanical Fault Diagnosis Based on Local Mean Decomposition Method
Authors: Baojia Chen, Xuefeng Chen, Zhengjia He, Jiyong Tan
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

With the effect of periodical impulses, most machinery fault vibration signals are muticomponent modulation signals. The effective decomposition approach is the key to demodulate signals and extract fault characteristics. Local mean decomposition (LMD) is a new kind of time-frequency analysis approach, which can decompose the signals adaptively into a set of product function (PF) components. The envelope of PF is the instantaneous amplitude and instantaneous frequency can be calculated by the derivative of the unwrapped phase of modulation signal with uniform amplitude. The method bypasses the Hilbert transform totally. Therefore, it involves no question about negative frequency of no physical meaning. Through the successful mechanical fault diagnosis examples, it shows that LMD has high theoretical value and engineering practicability.
Tree linearization in English: improving language model based approaches
Authors: Katja Filippova, Michael Strube
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

We compare two approaches to dependency tree linearization, a task which arises in many NLP applications. The first one is the widely used 'overgenerate and rank' approach which relies exclusively on a trigram language model (LM); the second one combines language modeling with a maximum entropy classifier trained on a range of linguistic features. The results provide strong support for the combined method and show that trigram LMs are appropriate for phrase linearization while on the clause level a richer representation is necessary to achieve comparable performance.
Comparision of Two ICA Based Methods for Speckle Reduction of Polarimetric SAR Images
Authors: Haijiang Wang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

In this paper, Two speckle reduction methods based on ICA are inroduced. After speckle reduction experiments, the effect of two methods are compared in detail. The comparison shows that each method has its own advantage. It is not easy to say which method is better.
The Birth of Elinor: A Collaborative Development of a Game Based System for Stroke Rehabilitation
Authors: Anna-Sofia Alklind Taylor, Per Backlund, Henrik Engstrom, Mikael Johannesson, Mikael Lebram
Venue: Proceedings of the 2009 Second International Conference in Visualisation (2009)

Elinor is a game based tool for rehabilitation of stroke patients to be used in their home environment. The application is the result of a creative and exploratory development project in which researchers in the serious games area and experts in stroke rehabilitation collaborated in order to develop a motivating, easy to use and relatively inexpensive tool for relearning functions lost due to a stroke. Elinor can be viewed as an integrated system for stroke rehabilitation in that it is both a system, controlled by movements, for training of its primary user group and a system for monitoring the training by medical expertise. In this paper, we will describe the Elinor application itself, the development process and the initial evaluation of it in order to identify implications for serious games.
Spatial Tasks on a Large, High-Resolution Tiled Display: Females Mentally Rotate Large Objects Faster Than Men
Authors: Bernt Ivar Olsen, Bruno Laeng, Kari-Ann Kristiansen, Gunnar Hartvigsen
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

In order to assess the qualitative properties of large displays, compared to smaller displays we conducted an experiment using a mental rotation task and a large, 230 inches, tiled display and compared it to performance on a 14.1 inches laptop computer. We also investigated the effect of expectation about the novel technology among the participants. We found that females rotated objects faster than men on the large display with wider field of view. Furthermore, we found that females were influenced by the expectation that the large display should give better performance, since such a positive expectation yielded a faster performance only among females, with no apparent sacrifice of accuracy.
Optimal testing resource allocation during module testing considering cost, testing effort and reliability
Authors: P. C. Jha, Deepali Gupta, Bo Yang, P. K. Kapur
Venue: Computers and Industrial Engineering (2009)

Software reliability is one of the most important quality attributes of commercial software. During software testing, software reliability growth models (SRGMs) are commonly used to describe the phenomenon of failure occurrence and/or fault removal which consequently enhancements software reliability. Large software systems are developed by integrating a number of relatively small and independent modules, which are tested independently during module testing phase. The amount of testing resource available is limited which is desired to be consumed judiciously so as to optimize the testing process. In this paper we formulate a resource allocation problem of minimizing the cost of software testing under available amount of testing resource, given a reliability constraint. We use a flexible SRGM considering testing effort which, depending upon the values of parameters, can describe either exponential or S-shaped failure pattern of software modules. A systematic and sequential Algorithm is proposed to solve the optimization problem formulated. Numerical examples are given to illustrate the formulation and solution procedures. Sensitivity analysis is performed to examine the behavior of some parameters of SRGM with most significant influence.
From National to Supranational Government Inter-Organizational Systems: An Extended Typology
Authors: Boriana Rukanova, Rolf T. Wigand, Yao-Hua Tan
Venue: Proceedings of the 8th International Conference on Electronic Government (2009)

While inter-organizational systems (IOS) driven by supranational government (here referred to as supranational IOS or SN IOS) are increasingly being developed in practice, this phenomenon remains largely unexplored in the existing literature. What makes SN IOS specifically interesting is that their development and implementation is driven by supranational bodies (rather than businesses or national governments), implying that Member States have given up some of their decision-making power to higher level bodies and are bound to implement the decisions of these bodies. A key question then becomes: Are the processes for standards and system development and adoption of SN IOS distinct from IOS processes driven by businesses or national governments and, if so, what makes them different? Building on a novel typology and a case study of one SN IOS, our findings suggest that both industry and SN IOS exhibit similarities in terms of the role that intermediary organizations play as well as the processes through which standards are negotiated. These similarities can be used for transferability of knowledge between the two domains. We also demonstrate that there are inherent differences in terms of drivers, focus, approach, adoption incentives and the role of national governments. These differences require further attention and different considerations.
JHelioviewer: Visualizing Large Sets of Solar Images Using JPEG 2000
Authors: Daniel Muller, Bernhard Fleck, George Dimitoglou, Benjamin W. Caplins, Desmond E. Amadigwe, Juan Pablo García Ortiz, Benjamin Wamsler, Alen Alexanderian, V. Keith Hughitt, Jack Ireland
Venue: IEEE Design Test (2009)

All disciplines that work with image data&#x2014;from astrophysics to medical research and historic preservation&#x2014;increasingly require efficient ways to browse and inspect large sets of high-resolution images. Based on the JPEG 2000 image-compression standard, the JHelioviewer solar image visualization tool lets users browse petabyte-scale image archives as well as locate and manipulate specific data sets.