parallel algorithm for finding prime numbers
Tài liệu Báo cáo khoa học: "A Pattern Matching Method for Finding Noun and Proper Noun Translations from Noisy Parallel Corpora" doc
Ngày tải lên :
20/02/2014, 22:20
...
vectors of shifted or warped forms (Fung & McK-
eown 1994). However, our previous algorithm only
used the DTW score for finding the most correlated
word pairs. Our new algorithm takes it one ... frequency and posi-
tion information for high and low frequency
words are represented in two different vec-
tor forms for pattern matching. New an-
chor point finding and noise elimination ... (1994).
For a noisy corpus without sentence boundaries,
the primary lexicon accuracy depends on the robust-
ness of the algorithm for finding word translations
given no
a priori
information....
- 8
- 426
- 0
Tài liệu Báo cáo khoa học: "An Algorithm for Simultaneously Bracketing Parallel Texts by Aligning Words" ppt
Ngày tải lên :
20/02/2014, 22:20
... serve as generative
models for parallel bilingual sentences with
weak order constraints. Focusing on Wans-
duction grammars for bracketing, we formu-
late a normal form, and a stochastic version ... of the form A , B.
3
Bracketing Transduction Grammars
For the remainder of this paper, we focus our attention
on pure bracketing. We confine ourselves to bracketing
245
An Algorithm for Simultaneously ...
paper is that the lexical information actually gives suffi-
cient information to extract not merely word alignments,
but also bracketing constraints for both parallel texts.
Aside from purely...
- 8
- 382
- 0
Báo cáo y học: " Derivation and preliminary validation of an administrative claims-based algorithm for the effectiveness of medications for rheumatoid arthritis"
Ngày tải lên :
25/10/2012, 10:45
... effectiveness of
medications for rheumatoid arthritis (RA) due to the lack of a validated algorithm for this
outcome. We created and tested a claims-based algorithm to serve as a proxy for the clinical ... administrative claims
data.
To test the performance of the effectiveness algorithm and to see whether it was similar for
non-biologic RA treatments, we performed a separate analysis of RA patients ... performance characteristics of the effectiveness algorithm between biologic and
DMARD treatment episodes, the data were shown throughout for the biologic users as a unique
group, and also for...
- 29
- 581
- 0
Some studies on a probabilistic framework for finding object-oriented information in unstructured data
Ngày tải lên :
23/11/2012, 15:04
... the format of the number in
standard and Vietnamese format. For example, “123456.78” in standard format is
“123,456.78” which in Vietnamese format is “123.456,78”. We use regular expression
for ... crucial for Internet users to obtain the
desired information in an efficient and direct manner.
Currently, there is a lot of information available in structured format on the web.
For example, ... of finding structured information on the web becomes object
retrieval problem. Unfortunately, the current information retrieval approaches can not
handle object search effectively.
Therefore,...
- 51
- 393
- 0
A new algorithm for enumeration of minimum cutsets of graph by branch addition
Ngày tải lên :
03/01/2014, 19:35
... problem can be solved easily. For this
approach, above algorithm should be changed as follows:
1. Algorithm should start with an output node.
2. The node set made for minimum cutset enumeration, ... reliability block diagram, series -parallel simplification
cannot be used and other algorithms should be searched in such
cases. Some of these algorithms, which are based on finding
minimum paths, need ... programming technique has
been used in [5]. An efficient algorithm is also presented for
undirected graphs in [6]. None of the foregoing algorithms has
a scheme to compute the minimum cutset...
- 6
- 545
- 0
A dynamic programming algorithm for RNA structure
Ngày tải lên :
12/01/2014, 22:07
... a
mRNA;Gluicketal.,1994),andothers.However,
the algorithm is not able to solve all possible
knotted con®gurations, as for instance a parallel
b-sheet protein interaction ABCADBECD (see
Figure12forsomedetails.)Foragivencon®gur-
ation ... Recursion for the whx
matrix.
.
Figure A2. Recursion for the zhx matrix.
Figure A3. Recursion for the yhx matrix.
The recursions for the gap matrices zhx and yhx in the pseudoknot algorithm are ... k and l are also base-
paired. For completeness we have to introduce also
Figure 6. Recursion for vx truncated at y(2).
Figure 7. Recursion for wx in the nested algorithm.
Figure 8. Construction...
- 16
- 688
- 0
Tài liệu Báo cáo " Fully parallel methods for a class of linear partial differential-algebraic equations " pptx
Ngày tải lên :
13/02/2014, 03:20
... times(seconds) 120 180 300
For better convergence, we use other methods, such as the parallel Jacobi method [5], the parallel
SOR Red/Black [6,7,8,9] method.
The parallel Jacobi method and Parallel SOR Red/Black ... received in revised form 12 December 2007
Abstract. This note deals with two fully parallel methods for solving linear partial differential-
algebraic equations (PDAEs) of the form:
Au
t
+ B∆u = ... the performance
of a program, the speedup and the efficiency of this performance. The speedup of the performance is
defined as S = T
s
/T
p
, where T
s
(T
p
) is serial execution time (parallel...
- 9
- 627
- 0
Tài liệu Dollar Cost Banding - A New Algorithm for Computing Inventory Levels for Army Supply Support Activities pdf
Ngày tải lên :
17/02/2014, 17:20
... from the supporting
SSA. For the 82nd Airborne, mean CWT was only 1.8 days for SSA
fills, compared to, for example, 18 days for referrals and 113 days for
backorders. CWT for ASL fills was also ... and managers.
Prepared for the United States Army
Approved for public release, distribution unlimited
Dollar Cost Banding
A New Algorithm for Computing
Inventory Levels for Army Supply
Support ... have
qualified for stockage. The inventory levels (i.e., the RO and
ROP) determine the depth of stockage.
xi
Tables
S.1. Performance and Resource Metrics for Inventory
Management xvi
2.1. Performance...
- 132
- 425
- 0
Tài liệu Báo cáo khoa học: "Collecting Highly Parallel Data for Paraphrase Evaluation" doc
Ngày tải lên :
20/02/2014, 04:20
... 12
descriptions for over 95% of the videos. For most
clusters, then, we have a dozen or more high-quality
parallel descriptions that can be paired with one an-
other to create monolingual parallel training ... are simple word
substitutions, e.g. rabbit for bunny or gun for re-
volver, while others are phrasal, e.g. frying meat for
browning pork or made a basket for scores in a bas-
ketball game. One interesting ... of the paraphrase candidates. PEM
5
The numbers for the English data are slightly underesti-
mated since the workers sometimes incorrectly filled out the
form when reporting what language they...
- 11
- 418
- 0
Tài liệu Báo cáo khoa học: "ParaSense or How to Use Parallel Corpora for Word Sense Disambiguation" pdf
Ngày tải lên :
20/02/2014, 05:20
... strategy
for the selection of our bag-of-words translation fea-
tures (we did not perform any filtering on the trans-
lations except for Part-of-Speech information), we
observe that for three ... Association for Computational Linguistics:shortpapers, pages 317–322,
Portland, Oregon, June 19-24, 2011.
c
2011 Association for Computational Linguistics
ParaSense or How to Use Parallel Corpora for ... still a lot of
room for improvement on the feature base, our re-
sults show that the ParaSense system clearly outper-
forms state-of-the-art systems for all languages, ex-
cept for Spanish where...
- 6
- 537
- 0
Tài liệu Báo cáo khoa học: "An Improved Redundancy Elimination Algorithm for Underspecified Representations" pdf
Ngày tải lên :
20/02/2014, 12:20
... reduc-
tion factor for an individual USR is 666.240.
We also measured the ratio of USRs for which
the algorithm achieves complete reduction (Fig. 6):
The algorithm is complete for 56 % of the USRs
in ... by checking each split
for eliminability before it is added to the chart.
We compare the performance of this algorithm to
the baseline of computing the complete chart. For
comparison, we have ... elimination algorithm:
REDUNDANCY-ELIMINATION(Ch, R)
1 for each split S in Ch
2 do if S is eliminable with respect to R
3 then remove S from Ch
Prop. 3 shows that the algorithm is a correct
algorithm for...
- 8
- 429
- 0
Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx
Ngày tải lên :
20/02/2014, 18:20
... incorrectness have been given
before by Kinyon (1997). There seems to be no
straightforward way to correct the algorithm.
We therefore developed an alternative to
the algorithm from Schabes and ...
Abstract
We present a new LR algorithm for tree-
adjoining grammars. It is an alternative to an
existing algorithm that is shown to be incorrect.
Furthermore, the new algorithm is much sim-
pler, ...
satisfying:
• CS(N) + C_ CS(N),
for each N;
• (N, L) • CS(N),
for each N such that N <~*
l, and each L • Af*;
• N • CS(N),
for each N such that -~(N<~*l);
and
• for each
N, children(N)...
- 7
- 413
- 0
Tài liệu Báo cáo khoa học: "ADP based Search Algorithm for Statistical Machine Translation" docx
Ngày tải lên :
20/02/2014, 18:20
... additional
parameter into the recursion formula for DP. In the
following, we will explain this method in detail.
2.3 Recursion
Formula for
DP
In the DP formalism, the search process is described ...
words we have to force the algorithm to cover all
input string positions. Different strategies to solve
this problem are possible: For example, we can in-
troduce a reward for covering a position, ... little meaningful information or the information
is different from the input.
Examples for each category are given in Table
3. Table 4 shows the statistics of the translation
performance. When...
- 8
- 480
- 0
Tài liệu Báo cáo khoa học: "An Efficient Parallel Substrate for Typed Feature Structures on Shared Memory Parallel Machines" docx
Ngày tải lên :
20/02/2014, 18:20
... efficient parallel system
for processing Typed Feature Structures (TFSs)
on shared-memory parallel machines. We call
the system Parallel Substrate for TFS (PSTFS}.
PSTFS is designed for parallel ...
tence. The sequential CKY algorithm computes
each
Fi,j
according to a certain order.
Our algorithm for a parallel CKY-style parser
for HPSG computes each
Fi,j
in parallel. Note
that
Fi,j ... of parallel
machines with shared-memory architecture.
We propose an efficient programming envi-
ronment for developing parallel NLP systems
on shared-memory parallel machines, called the
Parallel...
- 7
- 427
- 0
Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt
Ngày tải lên :
20/02/2014, 22:20
... it is well-formed or ill-formed.
• maximal
iff it is well-formed and its parent (if it
has one) is ill-formed. In other words, a maxi-
mal TNCB is a largest well-formed component
of a TNCB. ... Shake-and-Bake generation
algorithm of (Whitelock, 1992) is NP-
complete. We present a polynomial time
algorithm for lexicalist MT generation pro-
vided that sufficient information can be
transferred ... them for grammatical
well-formedness. If they are well-formed, the system
halts indicating success. If not, another permutation
is tried and the process repeated. The complexity of
this algorithm...
- 7
- 410
- 0