84,949 research outputs found
Determining the polarity of postings for discussion search
When performing discussion search it might be desirable to consider non-topical measures like the number of positive and negative replies to a posting, for instance as one possible indicator for the trustworthiness of a comment. Systems like POLAR are able to integrate such values into the retrieval function. To automatically detect the polarity of postings, they need to be classified into positive and negative ones w.r.t.\ the comment or document they are annotating. We present a machine learning approach for polarity detection which is based on Support Vector Machines. We discuss and identify appropriate term and context features. Experiments with ZDNet News show that an accuracy of around 79\%-80\% can be achieved for automatically classifying comments according to their polarity
On Longest Repeat Queries Using GPU
Repeat finding in strings has important applications in subfields such as
computational biology. The challenge of finding the longest repeats covering
particular string positions was recently proposed and solved by \.{I}leri et
al., using a total of the optimal time and space, where is the
string size. However, their solution can only find the \emph{leftmost} longest
repeat for each of the string position. It is also not known how to
parallelize their solution. In this paper, we propose a new solution for
longest repeat finding, which although is theoretically suboptimal in time but
is conceptually simpler and works faster and uses less memory space in practice
than the optimal solution. Further, our solution can find \emph{all} longest
repeats of every string position, while still maintaining a faster processing
speed and less memory space usage. Moreover, our solution is
\emph{parallelizable} in the shared memory architecture (SMA), enabling it to
take advantage of the modern multi-processor computing platforms such as the
general-purpose graphics processing units (GPU). We have implemented both the
sequential and parallel versions of our solution. Experiments with both
biological and non-biological data show that our sequential and parallel
solutions are faster than the optimal solution by a factor of 2--3.5 and 6--14,
respectively, and use less memory space.Comment: 14 page
Five Quantum Algorithms Using Quipper
Quipper is a recently released quantum programming language. In this report,
we explore Quipper's programming framework by implementing the Deutsch's,
Deutsch-Jozsa's, Simon's, Grover's, and Shor's factoring algorithms. It will
help new quantum programmers in an instructive manner. We choose Quipper
especially for its usability and scalability though it's an ongoing development
project. We have also provided introductory concepts of Quipper and
prerequisite backgrounds of the algorithms for readers' convenience. We also
have written codes for oracles (black boxes or functions) for individual
algorithms and tested some of them using the Quipper simulator to prove
correctness and introduce the readers with the functionality. As Quipper 0.5
does not include more than \ensuremath{4 \times 4} matrix constructors for
Unitary operators, we have also implemented \ensuremath{8 \times 8} and
\ensuremath{16 \times 16} matrix constructors.Comment: 27 page
A quantum genetic algorithm with quantum crossover and mutation operations
In the context of evolutionary quantum computing in the literal meaning, a
quantum crossover operation has not been introduced so far. Here, we introduce
a novel quantum genetic algorithm which has a quantum crossover procedure
performing crossovers among all chromosomes in parallel for each generation. A
complexity analysis shows that a quadratic speedup is achieved over its
classical counterpart in the dominant factor of the run time to handle each
generation.Comment: 21 pages, 1 table, v2: typos corrected, minor modifications in
sections 3.5 and 4, v3: minor revision, title changed (original title:
Semiclassical genetic algorithm with quantum crossover and mutation
operations), v4: minor revision, v5: minor grammatical corrections, to appear
in QI
Searching for patterns in political event sequences: Experiments with the KEDs database
This paper presents an empirical study on the possibility of discovering interesting event sequences and sequential rules in a large database of international political events. A data mining algorithm first presented by Mannila and Toivonen (1996), has been implemented and extended, which is able to search for generalized episodes in such event databases. Experiments conducted with this algorithm on the Kansas Event Data System (KEDS) database, an event data set covering interactions between countries in the Persian Gulf region, are described. Some qualitative and quantitative results are reported, and experiences with strategies for reducing the problem complexity and focusing on the search on interesting subsets of events are described
Recommended from our members
GPERF : a perfect hash function generator
gperf is a widely available perfect hash function generator written in C++. It automates a common system software operation: keyword recognition. gperf translates an n element user-specified keyword list keyfile into source code containing a k element lookup table and a pair of functions, phash and in_word_set. phash uniquely maps keywords in keyfile onto the range 0 .. k - 1, where k >/= n. If k = n, then phash is considered a minimal perfect hash function. in_word_set uses phash to determine whether a particular string of characters str occurs in the keyfile, using at most one string comparison.This paper describes the user-interface, options, features, algorithm design and implementation strategies incorporated in gperf. It also presents the results from an empirical comparison between gperf-generated recognizers and other popular techniques for reserved word lookup
Using software visualization technology to help genetic algorithm designers
This work is part of a three year PhD project to examine how Software Visualization(SV) can be applied to support the design and construction of Genetic Algorithms (GAs). A user survey carried out at the start of this project identified a set of key system features required by GA users. A visualization system embodying these features was then designed and a prototype built. This paper describes what genetic algorithms are and how they can be applied. It then reviews some of the survey results and their impact on the design of the visualization system. The paper concludes with an exploration of how the resulting prototype may be evaluated
- âŠ