ppxscal/embedding_network huggingface dataset:
A phrase-based alignment model for natural language inference
Authors: Bill MacCartney, Michel Galley, Christopher D. Manning
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

The alignment problem---establishing links between corresponding phrases in two related sentences---is as important in natural language inference (NLI) as it is in machine translation (MT). But the tools and techniques of MT alignment do not readily transfer to NLI, where one cannot assume semantic equivalence, and for which large volumes of bitext are lacking. We present a new NLI aligner, the MANLI system, designed to address these challenges. It uses a phrase-based alignment representation, exploits external lexical resources, and capitalizes on a new set of supervised training data. We compare the performance of MANLI to existing NLI and MT aligners on an NLI alignment task over the well-known Recognizing Textual Entailment data. We show that MANLI significantly outperforms existing aligners, achieving gains of 6.2% in F1 over a representative NLI aligner and 10.5% over GIZA++.
Parallel implementations of word alignment tool
Authors: Qin Gao, Stephan Vogel
Venue: Software Engineering, Testing, and Quality Assurance for Natural Language Processing (2008)

Training word alignment models on large corpora is a very time-consuming processes. This paper describes two parallel implementations of GIZA++ that accelerate this word alignment process. One of the implementations runs on computer clusters, the other runs on multi-processor system using multi-threading technology. Results show a near-linear speed-up according to the number of CPUs used, and alignment quality is preserved.
A Semantic Web Service Description Language
Authors: Luokai Hu, Shi Ying, Kai Zhao, Rui Chen
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Semantic Web Service technology provides a strong support for automation software development based on Web service. By analyzing the existing description models and methods of semantic Web service, a Semantic Web Service Description Model (WSDM4S) and its formal description based on SHOIN+(D) are proposed, which attempt to offer an effective model for description, publication, discovery, composition, and execution of Web services based on semantic description. And a Semantic Web Service Description Language (WSDL4S) based on XML is designed to support the WSDM4S. Based on WSDL4S, Web Services could be packaged into basic semantic unit of semantic software development.
Periodic Schur functions and slit discs
Authors: S. Khrushchev
Venue: Journal of Approximation Theory (2009)

A simply connected domain G is called a slit disc if G=D minus a finite number of closed radial slits not reaching the origin. A slit disc is called rational (rationally placed) if the lengths of all its circular arcs between neighboring slits (the arguments of the slits) are rational multiples of 2@p. The conformal mapping @f of D onto G, @f(0)=0, @f^'(0)>0, extends to a continuous function on T mapping it onto @?G. A finite union E of closed non-intersecting arcs e"k on T is called rational if @n"E(e"k)@?Q for every k, @n"E(e"k) being the harmonic measures of e"k at ~ for the domain C@?E. A compact E is rational if and only if there is a rational slit disc G such that E=@f^-^1(T). A compact E essentially supports a measure with periodic Verblunsky parameters if and only if E=@f^-^1(T) for a rationally placed G. For any tuple (@a"1,...,@a"g"+"1) of positive numbers with @?"k@a"k=1 there is a finite family {e"k}"k"="1^g^+^1 of closed non-intersecting arcs e"k on T such that @n"E(e"k)=@a"k. For any set E=@?"k"="1^g^+^1e"k@?T and any @e>0 there is a rationally placed compact E^*=@?"k"="1^g^+^1e"k^* such that the Lebesgue measure |E@?E^*| of the symmetric difference E@?E^* is smaller than @e.
Application of PCFA in Assessing Security Technique in E-Commerce Affairs
Authors: Qu Zhiming, Li Jinxian
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Using the methods of primary components and factor analysis (PCFA), the security technique in E-Commerce affairs and its evaluation are analyzed. Based on PCFA model and the scores by experts, the analysis results are computed reflecting main function indexes of evaluation in security technique in E-Commerce affairs. Through case study, it can be seen that some indexes play very important role in analyzing and assessing main function indexes and all the evaluation s should be considered because evaluation in security technique in E-Commerce affairs depends on the interaction. Through analysis and deduction, it is concluded that, under the premise of minimizing the data loss, the application of PCFA in assessing evaluation in security technique in E-Commerce affairs approved to be practicable.
Impact of mobility on spectrum sensing in cognitive radio networks
Authors: Alexander W. Min, Kang G. Shin
Venue: Proceedings of the 2009 ACM workshop on Cognitive radio networks (2009)

In cognitive radio networks (CRNs), spectrum sensing is key to opportunistic spectrum access while preventing any unacceptable interference to primary users' communications. Although cognitive radios function as spectrum sensors and move around, most, if not all, of existing approaches assume stationary spectrum sensors, thus providing inaccurate sensing results. As part of our effort to solve/alleviate this problem, we consider the impact of sensor mobility on spectrum sensing performance in a joint optimization framework for sensor cooperation and sensing scheduling. We show that sensor mobility increases spatio-temporal diversity in received primary signal strengths, and thus, improves the sensing performance. This is intuitively plausible, but have not been tested previously. Based on this observation, we propose a sensing strategy that minimizes the sensing overhead by finding an optimal combination of the number of sensors to cooperate and the number of times spectrum sensing must be scheduled. This result provides a useful insight to understand the spectrum sensing and its coupling with sensor mobility.
A Multidimensional Flow Cytometry Data Classification
Authors: Ming-Chih Shih, Shou-Hsuan Stephen Huang, Chung-Che Jeff Chang
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Flowhas been widely used for the diagnosis of variousdiseases. We proposed an automated gating approach to analyze and cluster flowdata and provide researchers and physicians a 3-D way of viewing flowdata. This automated approach was designed to give reproducible results, which avoid the subjective and time-consuming human manipulation.Doublets problem will be eliminated by our tool, and the result were compared with the manual gating. In addition, a 3D visualization will not only give a user-friendly representation but also avert misclassification would occur in lower dimension. We demonstrated how the 3D approach can be used to augment the K-means method in classifying thedata. To validate the feasibility of our proposed automatic approach, our result is compared with the result done at the Methodist Hospital in Houston.
Exploring Emergent Semantic Communities from DBLP Bibliography Database
Authors: Zhixing Huang, Yan Yan, Yuhui Qiu, Shuqiong Qiao
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

In this paper, we construct aword association network from DBLP bibliography records and detect its evolution progress based on community discovery algorithm CPM and CPMw. We found that the network is of complex network characteristics, and the detected semantic communities can be classified into two categories: giant community and small community. They differ in size and content, and behave differently in the network evolution. Discovering the evolution of network and the emergent semantic communities can help researchers grasp the state of arts of the related field, identify emergent issues and thus inspire new idea to solve scientific questions.
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
Authors: Martin Knauer, Joachim Spoerhase
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We examine the problem of determining a spanning tree of a given graph such that the number of internal nodes is maximum. The best approximation algorithm known so far for this problem is due to Prieto and Sloper and has a ratio of 2. For graphs without pendant nodes, Salamon has lowered this factor to $\frac74$ by means of local search. However, the approximative behaviour of his algorithm on general graphs has remained open. In this paper we show that a simplified and faster version of Salamon's algorithm yields a $\frac53$-approximation even on general graphs. In addition to this, we investigate a node weighted variant of the problem for which Salamon achieved a ratio of 2·Δ(G) ¿ 3. Modifying Salamon's approach we obtain a factor of 3 + ¿ for any ¿> 0. We complement our results with worst case instances showing that our bounds are tight.
Mixed-Model Assembly Line Balancing Using the Hybrid Genetic Algorithm
Authors: Ying Bai, Hongshun Zhao, Liao Zhu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

In view of the existing problem of mixed-model assembly line balancing, a mathematical model is proposed based on two factors, which are integrated including the workstation number and the assembly line efficiency. Then a new hybrid genetic algorithm is developed for finding optimal solution of the problems. To prevent the premature convergence problem and enhance the globe-optimization capability, GA (genetic algorithms) is combined with SA (simulated annealing algorithms). The results of the simulation indicated that the hybrid algorithm has better efficiency an optimization performance.
Non-rigid Image Registration with Uniform Spherical Structure Patterns
Authors: Shu Liao, Albert C. Chung
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

Non-rigid image registration is a challenging task in medical image analysis. In recent years, there are two essential issues. First, intensity similarity is not necessarily equivalent to anatomical similarity when the anatomical correspondences between subject and template images are established. Second, the registration algorithm should be robust against monotonic gray-level transformation when aligning anatomical structures in the presence of bias fields. In this paper, a new feature based non-rigid registration method is proposed to deal with these two problems. The proposed method is based on a new type of image feature, called Uniform Spherical Structure Pattern (USSP). USSP encodes voxel-wise interaction information and geometric properties of anatomical structures. It is computationally efficient, rotation invariant and theoretically monotonic gray-level transformation invariant. The USSP feature is integrated with the Markov random field (MRF) discrete labeling framework to define energy function for registration in this paper. If the segmentation results are available, explicit anatomical correspondence can be established as an additional energy term. The energy function is optimized via the alpha-expansion algorithms. The proposed method is compared with three widely used non-rigid registration methods on both simulated and real databases obtained from BrainWeb and IBSR. Experimental results demonstrate that the proposed method achieves the highest registration accuracy among all the compared methods.
Using Base Pairing Probabilities for MiRNA Recognition
Authors: Daniel Pasaila, Irina Mohorianu, Liviu Ciortuz
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

We designed a new SVM for microRNA identification, whose novelty consist in the fact that many of its features incorporate the base-pairing probabilities provided by McCaskill's algorithm. Comparisons with other SVMs for microRNA identification prove that our SVM obtains competitive results. One of the advantages of our approach is that it makes no use of so-called normalised features which are based on sequence shuffling, which is a sensitive issue from the biological point of view. This also makes our approach much less time consuming.
A 6.4 mW, 4.9 nV/√Hz, 24 dBm IIP3 VGA for a multi-standard (WLAN, UMTS, and Bluetooth) receiver
Authors: S. D'Amico, M. Matteis, A. Baschirotto
Venue: Analog Integrated Circuits and Signal Processing (2009)

A low-power high-linearity variable-gain-amplifier (VGA) to be embedded in a multi-standard receiver (WLAN, UMTS and Bluetooth) is reported. The multi-standard receiver architecture presents considerable different VGA requirements (in terms of bandwidth, DC-gain, noise level, and common mode input voltage) for the three telecom standards. The VGA is positioned just after the mixer, and, then, it operates on low- amplitude input signals. This results in stronger noise requirements than linearity ones. Thus a digitally controlled open-loop structure has been used. The prototype VGA is realized in a 0.13 &mu;m CMOS technology and it features gain levels from -10 to 36 dB. For 0 dB DC-gain it exhibits a 25 dBm IIP3 and an input-referred noise voltage lower than 5 nV/&radic;Hz. This gives a 85 dB-DR for the WLAN case. The VGA draws 6.4 mA from a single 2.5 V supply.
Perception thresholds for augmented reality navigation schemes in large distances
Authors: Marcus Tonnis, Leslie Klein, Gudrun Klinker
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

Because the resolution of see-through displays is lower than the resolution of the human eye, perception of AR schemes is complicated in large distances. To discover, how design issues of perception correlate with presentation in large distances, we developed three different variants of arrow-based route guidance systems. With a large-scale Head-Up Display having a large focal depth, we tested the variants under different conditions on perception and interpretability.
CoCoNutTrix: Collaborative Retrofitting for Information Visualization
Authors: Petra Isenberg, Anastasia Bezerianos, Nathalie Henry, Sheelagh Carpendale, Jean-Daniel Fekete
Venue: IEEE Computer Graphics and Applications (2009)

Collaboration is one way to deal with the increasing amount and complexity of information available to analysts. However, most information visualization systems incorporate little or no specific support for collaboration. Reimplementing existing applications to fully incorporate our current understanding of computer-supported cooperative work could be exhausting, time consuming, and expensive. To aid this process, the authors explored how to cost-effectively create a colocated collaborative information visualization and analysis environment. They extended NodeTrix, a social-network-analysis tool, to enable multiuser interaction in collaborative environments, and performed a user study assessing the retrofitted system's usability. Their results verify the low-cost retrofitting's effectiveness and highlight implications for practitioners. This article is part of a special issue on collaborative visualization.
Allocating goods on a graph to eliminate envy
Authors: Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

We introduce a distributed negotiation framework for multi-agent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A group of agents may only contract a deal if that group is fully connected according to the negotiation topology. An important criterion for assessing the quality of an allocation of resources, in terms of fairness, is envy-freeness: an agent is said to envy another agent if it would prefer to swap places with that other agent. We analyse under what circumstances a sequence of deals respecting the negotiation topology may be expected to converge to a state where no agent envies any of the agents it is directly connected to. We also analyse the computational complexity of a related decision problem, namely the problem of checking whether a given negotiation state admits any deal that would both be beneficial to every agent involved and reduce envy in the agent society.
Dependency-directed reconsideration belief base optimization for truth maintenance systems
Authors: Frances L. Johnson, Stuart C. Shapiro
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

We define reconsideration, a non-prioritized belief change operation on a finite set of base beliefs. Reconsideration is a hindsight belief change repair that eliminates negative effects caused by the order of previously executed belief change operations. Beliefs that had previously been removed are returned to the base if there no longer are valid reasons for their removal. This might result in less preferred beliefs being removed, and additional beliefs being returned. The end product is an optimization of the belief base, converting the results of a series of revisions to the very base that would have resulted from a batch revision performed after all base beliefs were entered/added. Reconsideration can be done by examining the entire set of all base beliefs (both currently believed and retracted) -- or, if the believed base is consistent, by examining all retracted beliefs for possible return. This, however, is computationally expensive. We present a more efficient, TMS-friendly algorithm, dependency-directed reconsideration (DDR), which can produce the same results by examining only a dynamically determined subset of base beliefs that are actually affected by changes made since the last base optimization process. DDR is an efficient, anytime, belief base optimizing algorithm that eliminates operation order effects.
Generalized Probabilistic Rough Sets Characterized by Fuzzy Sets
Authors: Xu-Qin Qiu, Li-Li Wei
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

Theories of fuzzy sets and rough sets are useful for dealing with uncertain and vague knowledge in information systems. They are generalizations of classical set theory for modelling vagueness and uncertainty. Some integrations of them are expected to develop a model of uncertainty stronger than either. In this paper, we would like to study fuzziness in generalized probabilistic rough set model, which can be consider asan extension of [6], to portray probabilistic rough sets by fuzzy sets. we also show how the concept of variable precision lower and upper approximation of a generalized probabilistic rough set can be generalized from the vantage point of the cuts and strong cuts of a fuzzy set which is determined by the rough membership function. As a result, the characters of the (strong) cut of fuzzy set can be used conveniently to describe the feature of variable precision rough set.
A Robust, Digital-Audio Watermarking Method
Authors: Xiang-Yang Wang, Pan-Pan Niu, Hong-Ying Yang
Venue: IEEE MultiMedia (2009)

A robust, digital-audio watermarking algorithm resists desynchronization attacks by relying on the support-vector-machine theory.
A New Issue Logic of Computer: Speculative Issue Logic
Authors: You-Jan Tsai
Venue:  (2009)

In order to enhance the performance of a computer, most modern processors use superscalar architecture and raise the clock frequency. Superscalar architecture can execute more than one instruction per each cycle. The amount of instruction level parallelism will become more and more important when superscalar issue is increased. In some schemes [6, 14], instructions can be speculatively waked up. The more instructions are waked up, the more ILP is exploited, hence IPC is increased. We can adopt the speculative aspect to wakeup more instructions. But the ILP is still limited by the true data dependency. In this paper proposed the speculative wakeup logic with value prediction mechanism to overcome the data dependency that will exploit instruction level parallelism. And in order to reduce the recovery frequency, we also propose the priority base select logic with two bit counter. In our experiment, our model will enhance 18.02% performance. 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
Parallel Algorithms of Numeric Integration Using Lattice Cubature Formulas
Authors: Marat D. Ramazanov, Dzhangir Y. Rakhmatullin
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

The results of theory and applications of optimal lattice cubature formulas are described. The approximate integration program based on lattice formulas is considered. It has sufficiently high precision for complicated domains with smooth boundaries and dimensions up to 10 and high efficiency of paralleling.
Research on Evaluation of B to C E-commerce Website Based on AHP and Grey Evaluation
Authors: Xiuli Cao, Bing Shen, Yanhua Liu, Min Wang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

In recent years, the substantial increase in the volume of e-commerce transactions, consumers have been gradually changing consumption habits and consumption patterns to online shopping, but due to the problems of the website credibility, network security and etc., many internet users are outside of e-commerce. Under this condition, this article, from the perspective of consumer satisfaction, study B to C e-commerce website evaluation. Using evaluation method of AHP and grey evaluation, we evaluate e-commerce websites and try to make the evaluation practically, so that consumers can easily find a good website from a large number of shopping sites, and access to high quality products and good services.
A proposed architecture for dynamically built NLIDB systems
Authors: Amany Sarhan
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2009)

Natural Language Interface to Database (NLIDB) systems have provided an easy access to database system without the need for the user to use formal query languages, such as SQL. Database query languages can be difficult to the non-expert users and learning these formal queries takes a lot of time. In NLIDB, users can type a question or a sentence in their natural language (such as English or Arabic) then it will be converted through a special natural language interface interrupter into formal database query. A major problem that faces the NLIDB designers is the identification of the tables that contain the required information and the desired attributes in the query. Most of the existing systems use static templates for the queries, in which tables' names are embedded in the template. However, this requires large code that considers all possible query templates. The main objective of this paper is to introduce a dynamic approach to determine the tables name that the attributes involved in the query belong to by representing the database schema as a graph which is used to determine the tables' names. This will minimize the templates used to build the queries thus minimizing the code size and effort to track and build all possible queries. We also propose a dynamic component that helps in building any NLIDB called database management. This component is linked to all the NLIDB system's components and will automatically build the dictionaries and database schema graph. The proposed approach was applied to a case study called Mall Shopper's Guide (MSG) to investigate its effectiveness.