Magnitude faster

This paper produces an effective algorithm and experimental results for mining closed sequential patterns from the sequence database using the parent–child relationship on the prefix tree structure. Experimental results show that the performance runtime of the proposed algorithm is much faster than that of other algorithms by more than one order of magnitude and the number of sequential patterns is reduced significantly.

7p vimarillynhewson 02-01-2024 5 3   Download

In this paper, we introduce gPartition, a new computational partitioning method leveraging both the site rate and the best-fit substitution model. We conducted experiments on recently published alignments to compare gPartition with mPartition and RatePartition. gPartition was orders of magnitude faster than other methods.

8p viberkshire 09-08-2023 10 4   Download

The search engine dramatically simplifies complex filtering tasks that previously required programming experience or specialty command-line programs. Critically, Bystro’s annotation and filtering capabilities are orders of magnitude faster than previous solutions, saving weeks of processing time for large experiments.

11p vialfrednobel 29-01-2022 13 0   Download

A group of miRNAs can regulate a biological process by targeting genes involved in the process. The unbiased miRNA functional enrichment analysis is the most precise in silico approach to predict the biological processes that may be regulated by a given miRNA group.

8p viflorida2711 30-10-2020 13 3   Download

The first adjustment to the governor is the full rate gate timing. The stop nuts on the governor main valve are adjusted to limit the amount of travel of the main valve. By changing the maximum movement of the main valve, the amount of oil flowing to the servomotors is changed, and, therefore, the maximum speed at which the wicket gates travel is changed. The rate at which the wicket gates close determines the magnitude of penstock pressure transients or water hammer and the maximum speed of the unit following a load rejection. Faster wicket gate...

38p loixinloi 08-05-2013 37 4   Download

We describe a speedup for training conditional maximum entropy models. The algorithm is a simple variation on Generalized Iterative Scaling, but converges roughly an order of magnitude faster, depending on the number of constraints, and the way speed is measured. Rather than attempting to train all model parameters simultaneously, the algorithm trains them sequentially. The algorithm is easy to implement, typically uses only slightly more memory, and will lead to improvements for most maximum entropy problems. ...

8p bunmoc_1 20-04-2013 40 2   Download

Recent work in Question Answering has focused on web-based systems that extract answers using simple lexicosyntactic patterns. We present an alternative strategy in which patterns are used to extract highly precise relational information offline, creating a data repository that is used to efficiently answer questions. We evaluate our strategy on a challenging subset of questions, i.e. “Who is …” questions, against a state of the art web-based Question Answering system.

7p bunbo_1 17-04-2013 54 2   Download

We describe a new loss function, due to Jeon and Lin (2006), for estimating structured log-linear models on arbitrary features. The loss function can be seen as a (generative) alternative to maximum likelihood estimation with an interesting information-theoretic interpretation, and it is statistically consistent. It is substantially faster than maximum (conditional) likelihood estimation of conditional random fields (Lafferty et al., 2001; an order of magnitude or more). We compare its performance and training time to an HMM, a CRF, an MEMM, and pseudolikelihood on a shallow parsing task.

8p hongvang_1 16-04-2013 62 2   Download

This work investigates supervised word alignment methods that exploit inversion transduction grammar (ITG) constraints. We consider maximum margin and conditional likelihood objectives, including the presentation of a new normal form grammar for canonicalizing derivations. Even for non-ITG sentence pairs, we show that it is possible learn ITG alignment models by simple relaxations of structured discriminative learning objectives. For efficiency, we describe a set of pruning techniques that together allow us to align sentences two orders of magnitude faster than naive bitext CKY parsing. .

9p hongphan_1 14-04-2013 33 4   Download

This second edition presents new chapters on (a) the utilization of mutants as highresolution nanosensors of short-living protein structures and protein nanophysics (Chap. 11) and (b) the recently developed method of evolutionary computer programming (Chap. 12), respectively. In the latter method, computer programs evolve themselves towards a higher performance. In contrast to simple selflearning programs, the code of the evolved program differs significantly from that of the original "wild-type" program.

261p chuyenphimbuon 21-07-2012 55 6   Download

E-commerce Security Issues CHAPTER 13 295 your encrypted messages. As shown in Figure 13.4, both the sender (who encrypts the message) and the recipient (who decrypts the message) have the same key. The most widely used secret key algorithm is the Data Encryption Standard (DES). This scheme was developed by IBM in the 1970s and adopted as the American standard for commercial and unclassified government communications. Computing speeds are orders of magnitudes faster now than in 1970, and DES has been obsolete since at least 1998.

10p yukogaru14 30-11-2010 55 4   Download