ppxscal/embedding_network huggingface dataset:
Region-Based Pose Tracking
Authors: Christian Schmaltz, Bodo Rosenhahn, Thomas Brox, Daniel Cremers, Joachim Weickert, Lennart Wietzke, Gerald Sommer
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

This paper introduces a technique for region-based pose tracking without the need to explicitly compute contours. We assume a surface model of a rigid object and at least one calibrated camera view. The goal is to find the pose parameters that optimally fit the model surface to the contour of the object seen in the image. In contrast to conventional contour-based techniques, which acquire the contour to be extracted explicitly from the image, our approach optimizes an energy directly defined on the pose parameters. We show experimental results for rather challenging scenes observed with a monocular and a stereo camera system.
Cooperative Spectrum Sensing in Cognitive Radio Systems
Authors: Xueqiang Zheng, Li Cui, Juan Chen, Qihui Wu, Jinlong Wang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

We considered the problem of use the reliability of unlicensed users for cooperative spectrum sensing in cognitive radio systems by analyzing the Huffman encoding algorithm. We present a novel cooperative spectrum sensing algorithm in cognitive radio systems. We drive the close-form expressions for the average sending bits for each unlicensed user for cooperation and expression for the probability of the detection and the false-alarm for the novel cooperative spectrum sensing scheme. Finally, we show through numerical results the potential cooperative spectrum sensing performance improvement with using the reliability of unlicensed users.
A First-Order DPA Attack Against AES in Counter Mode with Unknown Initial Counter
Authors: Josh Jaffe
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

Previous first-order differential power analysis (DPA) attacks have depended on knowledge of the target algorithm's input or output. This paper describes a first-order DPA attack against AES in counter mode, in which the initial counter and output values are all unknown.
Structural and Parametric Evolution of Continuous-Time Recurrent Neural Networks
Authors: Cesar Gomes Miguel, Carolina Feher da Silva, Marcio Lobo Netto
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

Neuroevolution comprehends the class of methods responsible for evolving neural network topologies and weights by means of evolutionary algorithms. Despite their good performance in several control tasks, most of these methods use variations of simple sigmoidal neurons. Recent investigations have shown the potential applicability of more realistic neuron models, opening new perspectives for the next generation of neuroevolutionary methods. This work aims to extend a recent method known as NEAT to evolve continuous-time recurrent neural networks (CTRNNs). The proposed model is compared with previous methods on a control benchmark test. Preliminary results reveal some advantages when evolving general CTRNNs over traditional models.
Technical communique: H∞ optimal terminal control for linear systems with delayed states and controls
Authors: Marco Ariola, Alfredo Pironti
Venue: Automatica (Journal of IFAC) (2008)

In this paper we consider a linear time-varying system with state and control delay terms, both lumped and distributed, subject to unknown, square integrable disturbances. Using a differential games approach, we provide a necessary and sufficient condition for the existence of an optimal control law minimizing the H"~ norm of the operator mapping the disturbance to the weighted control and terminal state.
An Arbitrary Tree-Structured Replica Control Protocol
Authors: Jean Paul Bahsoun, Robert Basmadjian, Rachid Guerraoui
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Traditional replication protocols that arrange logically the replicas into a tree structure have reasonable availability, low communication costs but induce high system load. We propose in this paper the arbitrary protocol: a tree-based replica control protocol that can be configured based on the frequencies of read and write operations in order to provide lower system load than existing tree replication protocols, yet with comparable cost and availability. Our protocol enables the shifting from one configuration into another by just modifying the structure of the tree. There is no need to implement a new protocol whenever the frequencies of read and write operations change. At the heart of our protocol lies the new idea of logical and physical levels in a tree. In short, read operations are carried out on any physical node of every physical level of the tree whereas the write operation is performed on all physical nodes of a single physical level of the tree. We discuss optimal configurations, proving in particular a new lower bound, of independent interest, for the case of a binary tree.
How Do We Get the Pieces to Talk? An Architecture to Support Interoperability between Educational Tools
Authors: Andreas Harrer, Niels Pinkwart, Bruce M. Mclaren, Oliver Scheuer
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

For many practical learning scenarios, the integrated use of more than one learning tool is educationally beneficial. In these cases, interoperability between learning tools --- getting the pieces to talk --- is a crucial requirement that is often hard to achieve. This paper describes an architecture that aims at the integration of independent learning tools into one collaborative learning scenario.
The Use of Hilbert-Schmidt Decomposition for Implementing Quantum Gates
Authors: Yacob Ben-Aryeh
Venue: Proceedings of the 1st international workshop on Optical SuperComputing (2008)

It is shown how to realize quantum gates by decomposing the gates into summation of unitary matrices where each of these matrices is given by a tensor multiplication of the unit and Pauli 2x2 spin matrices. It is assumed that each of these matrices is operating on a different copy of the quantum states produced by 'quantum encoders' with a certain probability of success. The use of the present probabilistic linear optics' method for realizing quantum gates is demonstrated by the full analysis given for the control phase shift gate, but the use of the present method for other gates, including the control-not gate, is also discussed. 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
Algebraic and Slide Attacks on KeeLoq
Authors: Nicolas T. Courtois, Gregory V. Bard, David Wagner
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

KeeLoq is a block cipher used in wireless devices that unlock the doors and alarms in cars manufactured by Chrysler, Daewoo, Fiat, GM, Honda, Jaguar, Toyota, Volvo, Volkswagen, etc [8,9,33,34]. KeeLoq is inexpensive to implement and economical in gate count, yet according to Microchip [33] it should have "a level of security comparable to DES".In this paper we present several distinct attacks on KeeLoq, each of them is interesting for different reasons. First we show that when about 232 known plaintexts are available, KeeLoq is very weak and for example for 30% of all keys the full key can be recovered with complexity of 228 KeeLoq encryptions. Then we turn our attention to algebraic attacks with the major challenge of breaking KeeLoq given potentially a very small number of known plaintexts.Our best "direct" algebraic attack can break up to 160 rounds of KeeLoq. Much better results are achieved in combination with slide attacks. Given about 216 known plaintexts, we present a slide-algebraic attack that uses a SAT solver with the complexity equivalent to about 253 KeeLoq encryptions. To the best of our knowledge, this is the first time that a full-round real-life block cipher is broken using an algebraic attack.
Analyzing the Evolution of Life Science Ontologies and Mappings
Authors: Michael Hartung, Toralf Kirsten, Erhard Rahm
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

Ontologies are heavily developed and used in life sciences and undergo continuous changes. However, the evolution of life science ontologies and references to them (e.g., annotations) is not well understood and has received little attention so far. We therefore propose a generic framework for analyzing both the evolution of ontologies and the evolution of ontology-related mappings, in particular annotations referring to ontologies and similarity (match) mappings between ontologies. We use our framework for an extensive comparative evaluation of evolution measures for 16 life science ontologies. Moreover, we analyze the evolution of annotation mappings and ontology mappings for the Gene Ontology.
Multi-robot Markov random fields
Authors: Jesse Butterfield, Odest Chadwicke Jenkins, Brian Gerkey
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

We propose Markov random fields (MRFs) as a probabilistic mathematical model for unifying approaches to multi-robot coordination or, more specifically, distributed action selection. The MRF model is well-suited to domains in which the joint probability over latent (action) and observed (perceived) variables can be factored into pairwise interactions between these variables. Specifically, these interactions occur through functions that evaluate "local evidence" between an observed and latent variable and "compatibility" between a pair of latent variables. For multi-robot coordination, we cast local evidence functions as the computation for an individual robot's action selection from its local observations and compatibility as the dependence in action selection between a pair of robots. We describe how existing methods for multi-robot coordination (or at least a non-exhaustive subset) fit within an MRF-based model and how they conceptually unify. Further, we offer belief propagation on a multi-robot MRF as a novel approach to distributed robot action selection.
Grinda: A Tuple Space Service for the Globus Toolkit
Authors: Sirio Capizzi, Antonio Messina
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

In this article we present a service for the Globus Toolkit that implements the tuple space model, allowing applications to use it to coordinate their activities.
Predefined Library
Authors: John Barnes
Venue: Ada 2005 Rationale: The Language, The Standard Libraries (2008)

This chapter describes various improvements to the predefined library in Ada 2005.There are a number of important new core packages in Ada 2005. These include a number of packages for the manipulation of various types of containers, packages for directory operations and packages providing access to environment variables.The entire ISO/IEC 10646:2003 character repertoire is now supported. Program text may now include other alphabets (such as Cyrillic and Greek) and wide-wide characters and strings are supported at run-time. There are also some improvements to the existing character, string and text input-output packages.The Numerics annex now includes vector and matrix operations including those previously found in the secondary standard ISO/IEC 13813. 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
Doing Without Turing Machines: Constructivism and Formal Topology
Authors: Giovanni Sambin
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We add some new insights, and thus hopefully contribute to give new impetus, to an old theme: constructive mathematics, and topology in particular, can be thought of as an abstract way to deal with computation.
On the Use of the Formant Features in the Dynamic Time Warping Based Recognition of Isolated Words
Authors: Antanas Lipeika, Joana Lipeikienė
Venue: Informatica (2008)

A possibility to use the formant features (FF) in the user-dependent isolated word recognition has been investigated. The word recognition was performed using a dynamic time-warping technique. Several methods of the formant feature extraction were compared and a method based on the singular prediction polynomials has been proposed for the recognition of isolated words. Recognition performance of the proposed method was compared to that of the linear prediction coding (LPC) and LPC-derived cepstral features (LPCC). In total, 111 Lithuanian words were used in the recognition experiment. The recognition performance was evaluated at various noise levels. The experiments have shown that the formant features calculated from the singular prediction polynomials are more reliable than the LPC and LPCC features at all noise levels.
Logistic Regression and EVIs for XML Books and the Heterogeneous Track
Authors: Ray R. Larson
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

For this year's INEX UC Berkeley focused on the Book track and the Heterogeneous track, For these runs we used the TREC2 logistic regression probabilistic model with blind feedback as well as Entry Vocabulary Indexes (EVIs) for the Books Collection MARC data. For the full text records of the book track we encountered a number of interesting problems in setting up the database, and ended up using page-level indexing of the full collection.As (once again) the only group to actually submit runs for the Het track, we are guaranteed both the highest, and lowest, effectiveness scores for each task. However, because it was again deemed pointless to conduct the actual relevance assessments on the submissions of a single system, we do not know the exact values of these results.
How much of dsrc is available for non-safety use?
Authors: Zhe Wang, Mahbub Hassan
Venue: Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking (2008)

The Dedicated Short Range Communication (DSRC) technology is currently being standardized by the IEEE to enable a range of communication-based automotive safety applications. However, for DSRC to be cost-effective, it is important to accommodate commercial non-safety use of the spectrum as well. The co-existence of safety and non-safety is achieved through a periodic channel switching scheme whereby access to DSRC alternates between these two classes of applications. In this paper, we propose a framework that links the non-safety share of DSRC as effected by the channel switching to the performance requirements of safety applications. Using simulation experiments, we analyze the non-safety opportunity in the DSRC under varied road traffic conditions. We find that non-safety use of DSRC may have to be severely restricted during peak hours of traffic to insure that automotive safety is not compromised. Our study also provides interesting insights into how simple strategies, e.g., optimizing the message generation rate of the safety applications, can significantly increase the commercial opportunities of DSRC. Finally, we find that adaptive schemes that can dynamically adjust the switching parameters in response to observed traffic conditions may help in maximizing the commercial use of DSRC.
Efficient Selection of Multipoint Relays in Wireless Ad Hoc Networks with Realistic Physical Layer
Authors: Dhavy Gantsou, Patrick Sondi
Venue: Proceedings of the 3rd Asian conference on Internet Engineering: Sustainable Internet (2007)

Much of the schemes for Multipoint Relay (MPR) selection in wireless ad hoc networks have been studied using the unit graph model, under the assumption that packets are always received without any error. As this model does not reflect the real scenario of transmissions, recent studies propose heuristics which enable selecting MPR under realistic assumptions. For this, they use redundancy to maximize the probability of delivery. But redundancy can increase the size of the MPR set, and therefore generating amounts of retransmissions and collisions, which can lead to degradation of the MPR protocol performance. Using reversible marking, a mechanism we presented in a previous study, we propose two heuristics which efficiently compute MPR. One of them resorts to redundancy and both compute a MPR set which size is at most log m greater than the optimum.
Research on Personalized E-Learning System Using Fuzzy Set Based Clustering Algorithm
Authors: Feng Lu, Xin Li, Qingtang Liu, Zongkai Yang, Guoxin Tan, Tingting He
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Personalized service is becoming increasingly important, especially in E-learning field. Most personalized E-learning systems only take learners preferences, interests and browsing behaviors into consideration. These systems usually neglect considering whether the learners ability and the difficulty level of recommended learning materials are matched to each other or not. This paper proposes a personalized E-learning system using fuzzy set based clustering algorithm which considers both course materials' difficulty and learners' ability to provide appropriate learning stuffs for learners individually, to help learners learn more efficiently and effectively.
A Novel Human Computer Interaction Paradigm for Volume Visualization in Projection-Based Virtual Environments
Authors: Changming He, Andrew Lewis, Jun Jo
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

We propose a novel Human Computer Interaction (HCI) paradigm for volume visualization in projection-based immersive virtual environments (VEs). This paradigm is intuitive, highly efficient and allows accurate control over the virtual objects. A fine control mode for direct manipulation is proposed to address the low accuracy problem of virtual object manipulation in VEs. An agent object interaction method is proposed to provide more flexibility in manipulating the volume objects. A two-handed scaling method is proposed to conveniently scale the volume object along one, two, or three axes. Finally, a ghost object paradigm is proposed to address the motion constraint problem for virtual objects. An implementation using a 3-state tracked glove setup as the input interface is discussed. How basic functionality for volume visualization can be transferred from the 2D WIMP (Window, Icon, Menu, and Pointer) interface to a 3D VR interface is also systematically discussed.
Geometry-Driven Nonlinear Equation with an Accelerating Coupled Scheme for Image Enhancement
Authors: Shujun Fu, Qiuqi Ruan, Chengpo Mu, Wenqia Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

In this paper, a geometry-driven nonlinear shock-diffusion equation is presented for image denoising and edge sharpening. An image is divided into three-type different regions according to image features: edges, textures and details, and flat areas. For edges, a shock-type backward diffusion is performed in the gradient direction to the isophote line (edge), incorporating a forward diffusion in the isophote line direction; while for textures and details, a soft backward diffusion is done to enhance image features preserving a natural transition. Moreover, an isotropic diffusion is used to smooth flat areas simultaneously. Finally, a shock capturing scheme with a special limiter function is developed to speed the process with numerical stability. Experiments on real images show that this method produces better visual results of the enhanced images than some related equations.
Don't Clog the Queue! Circuit Clogging and Mitigation in P2P Anonymity Schemes
Authors: Jon Mclachlan, Nicholas Hopper
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

At Oakland 2005, Murdoch and Danezis described an attack on the Tor anonymity service that recovers the nodes in a Tor circuit, but not the client. We observe that in a peer-to-peer anonymity scheme, the client is part of the circuit and thus the technique can be of greater significance in this setting. We experimentally validate this conclusion by showing that "circuit clogging" can identify client nodes using the MorphMix peer-to-peer anonymity protocol. We also propose and empirically validate the use of the Stochastic Fair Queueing discipline on outgoing connections as an efficient and low-cost mitigation technique.
The Study on the Maturity Measurement Method of Security Management for ITSM
Authors: Jung-Oh Park, Sang-Geun Kim, Byeong-Hun Choi, Moon-Seog Jun
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Recently, management environment of enterprise is rapidly changed and continually pressed from market for the improvement of customer value. So the companies are preparing the countermeasure for the various strategic and tactical the rationalization of management. These companies are increasing that consider to introduce the effective process construction, integration of divided process and organization, analysis of decision making and process cost of business and improvement of business in relatively lower business part of strategic importance ITSM system Construction is divided into Service Support and Service Delivery. In this thesis, it proposes the effectively measuring method about maturity of security management supporting both parts. Maturity measurement of security management is planned to measure the business maturity, analyze the result and be To-Be model after 3 phases of interview Measurement of business maturity consists of 9 domains and 63 detailed items and it gives weights and standard score by each detailed item and then measures the personal weight of security business and maturity of security bossiness in organization.
Choosing Business Collaborators Using Computing Intelligence Methods
Authors: Yu Zhang, Sheng-Bo Guo, Jun Hu, Ann Hodgkinson
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Inter-firm collaboration has become a common feature of the developing international economy. Firms as well as the nations have more relationships with each other. Even relatively closed economies or industries are becoming more open, Australia and China are examples of this case. The benefits generated from collaboration and the motivations to form collaboration are investigated by some researchers. However, the widely studied relationships between collaboration and profits are based on tangible assets and turnovers whereas most intangible assets and benefits are neglected during the economic analysis. In the present paper, two methods, naive Bayes and neural network, from computing intelligence are used to study the benefits acquired from collaboration. These two methods are used to learn the relationship and make prediction for a specified collaboration. The proposed method has been applied to a practical case of WEMOSOFT, an independent development department under MOBOT. The predication accuracies are 87.18% and 92.31%, for neural network and naive Bayes, respectively. Experimental result demonstrates that the proposed method is an effective and efficient way to prediction the benefit of collaboration and choose the appropriate collaborator.