ppxscal/embedding_network huggingface dataset:
MSA-CUDA: Multiple Sequence Alignment on Graphics Processing Units with CUDA
Authors: Yongchao Liu, Bertil Schmidt, Douglas L. Maskell
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

Progressive alignment is a widely used approach for computing multiple sequence alignments (MSAs). However, aligning several hundred or thousand sequences with popular progressive alignment tools such as ClustalW requires hours or even days on state-of-the-art workstations. This paper presents MSA-CUDA, a parallel MSA program, which parallelizes all three stages of the ClustalW processing pipeline using CUDA and achieves significant speedups compared to the sequential ClustalW for a variety of large protein sequence datasets. Our tests on a GeForce GTX 280 GPU demonstrate average speedups of 36.91 (for long protein sequences), 18.74 (for average-length protein sequences), and 11.27 (for short protein sequences) compared to the sequential ClustalW running on a Pentium 4 3.0 GHz processor. Our MSA-CUDA outperforms ClustalW-MPI running on 32 cores of a high performance workstation cluster.
A framework for incorporating alignment information in parsing
Authors: Mark Hopkins, Jonas Kuhn
Venue: Proceedings of the International Workshop on Cross-Language Knowledge Induction (2006)

The standard PCFG approach to parsing is quite successful on certain domains, but is relatively inflexible in the type of feature information we can include in its probabilistic model. In this work, we discuss preliminary work in developing a new probabilistic parsing model that allows us to easily incorporate many different types of features, including crosslingual information. We show how this model can be used to build a successful parser for a small handmade gold-standard corpus of 188 sentences (in 3 languages) from the Europarl corpus.
Joint Affine and Radiometric Registration Using Kernel Operators
Authors: Boaz Vigdor, Joseph M. Francos
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

A new global method for image registration in the presence of affine and radiometric deformations is introduced. The method proposed utilizes kernel operators in order to find corresponding regions without using local features. Application of polynomial type kernel functions results in a low complexity algorithm, allowing estimation of the radiometric deformation regardless of the affine geometric transformation. Preliminary experimentation shows high registration accuracy for the joint task, given real images with varying illuminations.
Improving and Simplifying a Variant of Prêt à Voter
Authors: Ralf Küsters, Tomasz Truderung, Andreas Vogt
Venue: Proceedings of the 2nd International Conference on E-Voting and Identity (2009)

Recently, Xia et al. proposed a variant of Prêt à Voter which enjoys several attractive properties. Their protocol is among the few verifiable and receipt-free paper-based voting protocols resistant against randomization attacks. Trust is distributed among several authorities and the voter interface is relatively simple. Also, approval and ranked elections are supported.In this paper, we improve and simplify the protocol by Xia et al. Among others, we propose a simpler way of producing ballots, which only involves the encryption and re-encryption of candidate names; homomorphic encryption and proxy re-encryption are not needed. Also, no machine involved in the production of ballots needs to store a secret key. Moreover, unlike the protocol by Xia et al., in our protocol all authorities can be held accountable in case they misbehave in an observable way.
Algebraic and Correlation Attacks against Linearly Filtered Non Linear Feedback Shift Registers
Authors: Côme Berbain, Henri Gilbert, Antoine Joux
Venue: Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers (2009)

The filter generator is a well known and extensively studied stream cipher construction. It consists of a Linear Feedback Shift Register (LFSR) filtered by a non linear Boolean function. In this paper we focus on the dual construction, namely a linearly filtered Non linear Feedback Shift Register (NFSR). We show that the existing algebraic and correlation attacks against the filter generator can be transposed to mount algebraic or correlation attacks against this dual construction. We investigate such attacks and extend them to the case where a linearly filtered NFSR is combined linearly with one or more non linearly filtered LFSRs. We apply our algebraic attack to a modified version of Grain-128, resulting in an attack requiring 2105 computations and 239 keystream bits. Even though this attack does not apply to the original Grain-128, it shows that the use of a NFSR is not sufficient to avoid all algebraic attacks.
Inference Engine Design of Expert System Based on Blackboard Model and Fault Tree
Authors: Chen WenBin, Liu XiaoLing, Fang Yu, Zhang Jian
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

According to the characteristics and rules of fault diagnosis expert system, a network-like fault tree is designed; adopting blackboard model and the permanent memory technology, the express inference engine algorithm of fault diagnosis expert system is realized. The inference engine has been applied to an aircraft fault diagnosis expert system. With the practical application test, the engine satisfies the requirements of inference speed and accuracy.
Korea's Robotland: Merging Intelligent Robotics Strategic Policy, Business Development, and Fun
Authors: Eugene Jun
Venue: Proceedings of the FIRA RoboWorld Congress 2009 on Advances in Robotics (2009)

South Korea specializes in the design and manufacture of service and entertainment robots for consumer use. The government of South Korea considers robotics one of the countries main growth industries. To boost robot industry and accelerate the social demand of intelligent robots, a theme park titled 'Robotland' is being constructed in Korea near Incheon International airport, the gateway to Seoul. A total of $700 million will be invested by the Korean government, the city of Incheon and financial investors. The 760,000 square meter site (188 acres) will contains a number of displays featuring famous robots and robot characters from around the world. Ultra-modern rides and amusement facilities, exhibition halls, shopping arcades and hotels, featuring advanced ubiquitous environments, will also be included in the park. In addition, Robotland will contain R D centers and educational institutions. The Grand opening is scheduled in 2012. In this session, attendees will hear of development plans for Robotland, along with the social and business issues that are driving the development of the world's first theme park.
Video Background Segmentation Using Adaptive Background Models
Authors: Xiaoyu Wu, Yangsheng Wang, Jituo Li
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

This paper proposes an adaptive background model which combines the advantages of both Eigenbackground and pixel-based gaussian models. This method exploits the illumination changes by Eigenbackground. Moreover, it can detect the chroma changes and remove shadow pixels using gaussian models. An adaptively strategy is used to integrate two models. A binary graph cut is used to implement the foreground/background segmentation by developing our data term and smooth term. We validate our method on indoor videos and test it on the benchmark video. Experiments demonstrate our method's efficiency.
Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Authors: Lauri Karttunen, Kemal Oflazer
Venue: ACL Workshops (1998)

Recent years has seen a substantial increase in the use of finite state techniques in many aspects of natural language processing as mature tools for building large scale finite-state systems from various research laboratories and universities become available. This trend was by no means foreseen as late as ten years ago given the well-known demonstration by Noam Chomsky in 1957 that finite-state methods are inherently incapable of representing the full richness of constructions in a natural language. Nevertheless, it is evident now that there are many subsets of natural language that are adequately covered by finite-state means and that there are many other areas where finite-state approximations of more powerful formalisms are of great practical benefit. The discovery that systems of phonological rewrite rules and optimality constraints are within the finite-state domain has made an important theoretical leap forward. We expect that similar discoveries are yet to be made in other areas of linguistics. FSMNLP'98, International Workshop on Finite State Methods in Natural Language Processing was conceived, with support and motivation from EACL, as a forum to bring together recent contributions in all aspects of the theory and applications of finite state machinery in language processing. As you may have already observed by reviewing the workshop programme and by looking at the papers to be presented, the mix of the contributions is international and shows wide-spread interest in this technology. They range over a variety of topics of great interest to the NLP community.
A MEMS Flow Sensor and Its Application in Adaptive Liquid Dispensing
Authors: Yaxin Liu, Liguo Chen, Lining Sun
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

A high speed MEMS flow sensor was proposed to enhance the reliability and accuracy of liquid dispensing system. Benefiting from the feedback of sensor information, the system can self-adjust the open time of the solenoid vale to accurately dispensing desired reagent volume without pre-calibration. This paper focuses on the design, fabrication and application of this flow sensor. Firstly, the design, fabrication and characteristics of the MEMS flow sensor based on the measurement of the pressure difference across a flow channel are presented. Secondly, the liquid dispensing system in which the flow sensor is integrated will be introduced. A novel closed-loop control strategy is proposed to calculate valve open-time for each dispensing cycle. Finally, experiments results are presented with different dispensing volumes, coefficient of variance (CV) has been shown to be below 3% at 1μl and approach 4% at 100 nl. It indicates that integration of the MEMS flow sensor and using of a compound intelligent control strategy make the system immune to liquid viscosity, pressure fluctuation and some other disturbances.
Dynamics of a Utility Based Distributed Video Proxy-Cache
Authors: Claudiu Cobarzan, Alin Mihaila, Cristina Mihaila
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

We present a distributed video proxy-cache system that is able to adapt the number of running nodes depending on the client request patterns and available storage and computational resources. Cache related operations are performed with regard to the utility values of the stored objects. We propose the use of a new utility formula which considers a number of object characteristics. This formula is fine tuned by using a genetic algorithm for determining the best approach to weight those characteristics so that the yielded byte hit rate of the system is maximal. Also, a new approach that uses the standard deviation of the utility values for the cached objects, to increase or decrease the number of active nodes within the proposed system, is presented.
Self-recovery Fragile Watermarking Using Block-Neighborhood Tampering Characterization
Authors: Hong-Jie He, Jia-Shu Zhang, Heng-Ming Tai
Venue: Information Hiding: 11th International Workshop, IH 2009, Darmstadt, Germany, June 8-10, 2009, Revised Selected Papers (2009)

In this paper, a self-recovery fragile watermarking scheme for image authentication is proposed to improve the performance of tamper detection and tamper recovery. The proposed scheme embeds the encrypted feature comprising 6-bit recovery data and 2-bit key-based data of the image block into the least significant bits (LBS) of its mapping block. The validity of a test block is determined by comparing the number of inconsistent blocks in the 3×3 block-neighborhood of the test block with that of its mapping block. Moreover, to improve the quality of the recovered image, the 3×3 block-neighborhood is also used to recover the tampered blocks whose feature hidden in another block is corrupted. Experimental result demonstrates that the proposed method outperforms conventional self-recovery fragile watermarking algorithms in tamper detection and tamper recovery under various attacks. Additionally, the proposed scheme is not vulnerable to the collage attack, constant-average attack and four-scanning attack.
Robotic Motion Compensation for Beating Heart Intracardiac Surgery
Authors: Shelten G. Yuen, Daniel T. Kettler, Paul M. Novotny, Richard D. Plowes, Robert D. Howe
Venue: International Journal of Robotics Research (2009)

3D ultrasound imaging has enabled minimally invasive, beating heart intracardiac procedures. However, rapid heart motion poses a serious challenge to the surgeon that is compounded by significant time delays and noise in 3D ultrasound. This paper investigates the concept of using a one-degree-of-freedom motion compensation system to synchronize with tissue motions that may be approximated by 1D motion models. We characterize the motion of the mitral valve annulus and show that it is well approximated by a 1D model. The subsequent development of a motion compensation instrument (MCI) is described, as well as an extended Kalman filter (EKF) that compensates for system delays. The benefits and robustness of motion compensation are tested in user trials under a series of non-ideal tracking conditions. Results indicate that the MCI provides an approximately 50% increase in dexterity and 50% decrease in force when compared with a solid tool, but is sensitive to time delays. We demonstrate that the use of the EKF for delay compensation restores performance, even in situations of high heart rate variability. The resulting system is tested in an in vitro 3D ultrasound-guided servoing task, yielding accurate tracking (1.15 mm root mean square) in the presence of noisy, time-delayed 3D ultrasound measurements.
Efficient K-Means VLSI Architecture for Vector Quantization
Authors: Hui-Ya Li, Wen-Jyi Hwang, Chih-Chieh Hsu, Chia-Lung Hung
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

A novel hardware architecture for k-means clustering is presented in this paper. Our architecture is fully pipelined for both the partitioning and centroid computation operations so that multiple training vectors can be concurrently processed. The proposed architecture is used as a hardware accelerator for a softcore NIOS CPU implemented on a FPGA device for physical performance measurement. Numerical results reveal that our design is an effective solution with low area cost and high computation performance for k-means design.
A User-Defined Index for Containment Queries in XML
Authors: Gap-Joo Na, Sang-Won Lee
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

Containment queries for XML documents is one of the most important query types, and thus the efficient support for this type of query is crucial for XML databases. Recently, object-relational database management system (ORDBMS) vendors try to store and retrieve XML data in their products. In this paper, we propose an extensible index to support containment queries over the XML data stored as BLOB type in ORDBMSs. That is, we describe how to implement an index using the extensibility feature of an ORDBMS, and describe its usage. The main advantage of this index is user's productivity in handling XML data in SQL language.
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete
Authors: Akitoshi Kawamura
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

In answer to Ko's question raised in 1983, we show that an initial value problem given by a polynomial-time computable, Lipschitz continuous function can have a polynomial-space complete solution. The key insight is simple: the Lipschitz condition means that the feedback in the differential equation is weak. We define a class of polynomial-space computation tableaux with equally restricted feedback, and show that they are still polynomial-space complete. The same technique also settles Ko's two later questions on Volterra integral equations.
Empirical acquisition of differentiating relations from definitions
Authors: Tom O'Hara, Janyce Wiebe
Venue: Proceedings of the Workshop on Enhancing and Using Electronic Dictionaries (2004)

This paper describes a new automatic approach for extracting conceptual distinctions from dictionary definitions. A broad-coverage dependency parser is first used to extract the lexical relations from the definitions. Then the relations are disambiguated using associations learned from tagged corpora. This contrasts with earlier approaches using manually developed rules for disambiguation.
On converting sets of tetrahedra to combinatorial and PL manifolds
Authors: Marco Attene, Daniela Giorgi, Massimo Ferri, Bianca Falcidieno
Venue: Computer Aided Geometric Design (2009)

We investigate the problem of removing singularities from a non-manifold tetrahedral mesh so as to convert it to a more exploitable manifold representation. Given the twofold combinatorial and geometrical nature of a 3D simplicial complex, we propose two conversion algorithms that, depending on the targeted application, modify either its connectivity only or both its connectivity and its geometry. In the first case, the tetrahedral mesh is converted to a combinatorial 3-manifold, whereas in the second case it becomes a piecewise linear (PL) 3-manifold. For both the approaches, the conversion takes place while using only local modifications around the singularities. We outline sufficient conditions on the mesh to guarantee the feasibility of the approaches and we show how singularities can be both identified and removed according to the configuration of their neighborhoods. Furthermore, besides adapting and extending surface-based approaches to a specific class of full-dimensional simplicial complexes in 3D, we show that our algorithms can be implemented using a flexible data structure for manifold tetrahedral meshes which is suitable for general applications. In order to exclude pathological configurations while providing sound guarantees, the input mesh is required to be a sub-complex of a combinatorial ball; this makes it possible to assume that all the singularities are part of the mesh boundary.
The impact of morphological stemming on Arabic mention detection and coreference resolution
Authors: Imed Zitouni, Jeff Sorensen, Xiaoqiang Luo, Radu Florian
Venue: Proceedings of the ACL Workshop on Computational Approaches to Semitic Languages (2005)

Arabic presents an interesting challenge to natural language processing, being a highly inflected and agglutinative language. In particular, this paper presents an in-depth investigation of the entity detection and recognition (EDR) task for Arabic. We start by highlighting why segmentation is a necessary prerequisite for EDR, continue by presenting a finite-state statistical segmenter, and then examine how the resulting segments can be better included into a mention detection system and an entity recognition system; both systems are statistical, build around the maximum entropy principle. Experiments on a clearly stated partition of the ACE 2004 data show that stem-based features can significantly improve the performance of the EDT system by 2 absolute F-measure points. The system presented here had a competitive performance in the ACE 2004 evaluation.
The Optimal Stabilization of Cart-Pole System: A Modified Forwarding Control Method
Authors: Xu Guowei
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

In this paper, an improved design method is proposed to extend the field of the application of the common integrator forwarding technique. This method is used to design a stabilizer for the cart-pole system. Moreover, it is show that the control Lyapunov function which is obtained from this method can also be used to design a globally asymptotically stabilizing controller with optimality. Computer simulations are given for illustration and verification.
Video activity recognition in the real world
Authors: Anthony Hoogs, A. G. Amitha Perera
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

With recent advances in motion detection and tracking in video, more efforts are being directed at higher-level video analysis such as recognizing actions, events and activities. One of the more challenging problems is recognizing activities that involve multiple people and/or vehicles, whose relationships change over time, when motion detection and tracking are unreliable, as commonly occurs in busy scenes. We describe an approach to this problem based on Dynamic Bayesian Networks, and show how DBNs can be extended to compensate for track failures. We also show that defining DBNs with semantic concepts improves robustness vs. direct observable, and discuss implications and ideas for incorporating semantic, symbolic knowledge into the perceptual domain of activity recognition.
A Fast Scheme to Investigate Thermal-Aware Scheduling Policy for Multicore Processors
Authors: Liqiang He, Cha Narisu
Venue: Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies (2009)

With more cores integrated into one single chip, the overall power consumption from the multiple concurrent running programs increases dramatically in a CMP processor which causes the thermal problem becomes more and more severer than the traditional superscalar processor. To leverage the thermal problem of a multicore processor, two kinds of orthogonal technique can be exploited. One is the commonly used Dynamic Thermal Management technique. The other is the thermal aware thread scheduling policy. For the latter one, some general ideas have been proposed by academic and industry researchers. The difficult to investigate the effectiveness of a thread scheduling policy is the huge search space coming from the different possible mapping combinations for a given multi-program workload. In this paper, we extend a simple thermal model originally used in a single core processor to a multicore environment and propose a fast scheme to search or compare the thermal effectiveness of different scheduling policies using the new model. The experiment results show that the proposed scheme can predict the thermal characteristics of the different scheduling policies with a reasonable accuracy and help researchers to fast investigate the performances of the policies without detailed time consuming simulations.