ライフサイエンスコーパス: speedup

1 for 10,920 individuals in a few hours (a 5 x speedup).

2 e question "how close can we get?" to linear speedup.

3 explain the observed net regional summer ice speedup.

4 been devoted to detect and quantify quantum speedup.

5 earlier methods but yields at least 10-fold speedup.

6 ies, only a few acceleration attempts report speedup.

7 role that quantum effects play in providing speedup.

8 n of how to fairly assess and detect quantum speedup.

9 void pitfalls that might mask or fake such a speedup.

10 mance computing clusters providing efficient speedup.

11 ific algorithms that still promise a quantum speedup.

12 On the ice sheet, these data reveal summer speedups (50 to 100%) consistent with, but somewhat larg

13 comparison to the sequential NCBI-BLAST, the speedups achieved by GPU-BLAST range mostly between 3 an

14 Speedups achieved by H-BLAST over sequential NCBI-BLASTP

15 , and we theoretically quantify the expected speedup afforded by trellises.

16 on a classical computer and the exponential speedups afforded by quantum computers.

17 With other effects producing outlet-glacier speedups an order of magnitude larger, seasonal melt's i

18 rate that Eagle2 attains a approximately 20x speedup and approximately 10% increase in accuracy compa

19 The speedup and efficiency are evaluated by using test data

20 The effects of temperature on speedup and free-energy landscapes, which may differ sub

21 e, we show how to define and measure quantum speedup and how to avoid pitfalls that might mask or fak

22 ers of workstations, providing a substantial speedup and low execution times on large numbers of node

23 gap expansion process, both in terms of ST99 speedup and network queue occupancy.

24 Speedup and other related performance studies are also r

25 ade-off between the magnitude of the optimal speedup and the width of the parameter range over which

26 hile achieving an order of magnitude or more speedup and using a fraction of the memory footprint.

27 at the proposed QTT method achieves dramatic speedups and several orders of magnitude storage savings

28 corresponding to a spontaneous emission rate speedup approximately 115 x, for antenna gap spacing, d

29 r PME and GB are the same, the corresponding speedups are approximately onefold (small conformational

30 tional changes considered here, the combined speedups are approximately twofold, approximately 1- to

31 number of reads mapped, and with near linear speedup as the number of processors increases.

32 rare long-range jumps can lead to a drastic speedup--as air-traffic-mediated epidemics show--it has

33 s approximately 2,500 x spontaneous emission speedup at d approximately 10 nm, proportional to 1/d(2)

34 tative GWAS, achieving a substantial runtime speedup by avoiding the need to exhaustively test all SN

35 It achieves significant speedup by exploiting hierarchical parallelism on single

36 ing any correct sequences, or gain 111 times speedup by filtering out 99.64% of spectra while missing

37 Huxley neurons but that for other models the speedup can differ.

38 performance benchmarks showing that 200-fold speedup compared to a single core of a CPU can be achiev

39 It produces a significant speedup compared to direct stochastic simulations in a t

40 resulting new program, GRASPx, achieves >30X speedup compared to its predecessor GRASP.

41 cases, a three orders of magnitude execution speedup compared with MILP.

42 dic spaced seeds, which leads to significant speedup compared with the most efficient methods current

43 BLAST architecture and achieved significant speedup comparing with previously published architecture

44 of magnitude for large datasets and that the speedup continues to increase with the number of sequenc

45 Our tests demonstrated very good speedup derived from the parallelization for up to appro

46 ugh unfolded intermediates, thus showing the speedup envisioned in the fly-casting scenario for molec

47 ivalent to that of the sequential HMM with a speedup factor approximately equal to the number of inde

48 threaded muBLASTP achieves up to a 4.41-fold speedup for alignment stages, and up to a 1.75-fold end-

49 Our configuration provides a speedup for equivalent spectral signal-to-noise ratio (S

50 r results do not rule out the possibility of speedup for other classes of problems and illustrate the

51 We also introduce a computational speedup for two random-effects models that makes this ap

52 to approximately 24 cores and a quasi-linear speedup for up to approximately 8 cores.

53 ithreaded muBLASTP achieves up to a 5.7-fold speedups for alignment stages, and up to a 4.56-fold end

54 isting exact simulators, and permits further speedup in approximate mode while retaining support for

55 riers, allowing successful prediction of the speedup in rates in the presence of CypA, which is in no

56 The speedups in conformational sampling for GB relative to P

57 Run time measurements suggest proportional speedups in overall search times.

58 e local averaging provide order-of-magnitude speedups in spatiotemporally demixing calcium video data

59 ects and make estimates of the corresponding speedups in the overall translocation process.

60 systems studied, 1) conformational sampling speedup increases as Langevin collision frequency (effec

61 sions for the conditions under which optimal speedup is achieved: valley or plateau crossing by the s

62 is contradicted by the observation that the speedup is concentrated at nonsynonymous sites.

63 y) decreases; and 2) conformational sampling speedup is mainly due to reduction in solvent viscosity

64 The baseline for these speedups is an implementation that has been hand-tuned S

65 Finally, our computational speedups now enable (i) efficient LR testing when the ba

66 00 % accuracy, which translates to a maximum speedup of 37.5, 23.1 and 11.6-fold for MSV, SSV and P7V

67 simulation scenarios we are able to offer a speedup of 6x-46x.

68 Combining GPU and HCP, resulted in a speedup of at most 1,860-fold for our largest molecular

69 hydraulics will limit the potential for the speedup of flow.

70 compression level which provides an expected speedup of more than an order of magnitude.

71 organic compound, demonstrating the parallel speedup of our method as well as its flexibility in appl

72 The relative speedup of outlet glaciers, however, is far smaller (<15

73 his induced-switch mechanism provides robust speedup of protein-DNA binding rates, and appears to be

74 t shortcuts to adiabaticity provide a robust speedup of quantum protocols of wide applicability in qu

75 ical redundant signal effect (RSE; i.e., the speedup of response times in multisensory compared with

76 e benefit in multisensory behavior (here the speedup of response times) is largest when behavioral pe

77 ive growth of biological sequences calls for speedup of sequence alignment tools such as BLAST.

78 lence with waves, jets, and vortices, with a speedup of several orders of magnitude compared with dir

79 nstrated that these improvements result in a speedup of several orders of magnitude for large dataset

80 , our enhancements can achieve a significant speedup of the A*-based protein design algorithm by four

81 del to illustrate the accuracy and potential speedup of the algorithm when compared with exact stocha

82 ipled way, we demonstrate more than 100-fold speedup of the search for complex motifs compared to pre

83 A motif search that allows for a significant speedup of the search of complex motifs that include pse

84 graphics processing unit results in dramatic speedup of two orders of magnitude, greatly increasing t

85 show that our novel enhancements result in a speedup of up to a factor of more than 1000 when applied

86 way, (2) particularly, makes them achieve a speedup of up to about 100x on the protein data, and (3)

87 A speedup of up to two orders of magnitude is demonstrated

88 We determine the optimal speedup of valley or plateau crossing that can be gained

89 tase, and antisweetener antibody NC6.8, show speedups of 17, 35, and 39, respectively.

90 n two model proteins with orientations shows speedups of 2578 for one set of configurations and 3341

91 tate-of-the-art predictors, but also achieve speedups of several orders of magnitude.

92 lossless process (> 99.9%) led to alignment speedups of up to 270% across a variety of data sets, wh

93 The latter yielded a factor of 2000 speedup on a cohort of size 13 500.

94 , RepeatScout, phRAIDER shows an average 10x speedup on any single human chromosome and has the abili

95 tion of a quantum computer with a well-known speedup over classical searches of an unsorted database.

96 le approach, yielding as much as a 2000-fold speedup over conventional simulation methods.

97 ent stages, and up to a 4.56-fold end-to-end speedup over multithreaded NCBI BLAST.

98 ent stages, and up to a 1.75-fold end-to-end speedup over single-threaded NCBI BLAST.

99 the string length) while achieving a 3-fold speedup over the best previous algorithm (Gene Myers's b

100 , our quantum algorithm achieves exponential speedup over the fastest known classical algorithm.

101 a commodity computer, which represents >100 speedup over the state-of-the-art alignment-based method

102 providing, on average, 90-fold and 130-fold speedup over the state-of-the-art software pre-alignment

103 parts of the analysis, offering substantial speedup over the traditional central processing unit ver

104 computer experiments to give a factor-of-two speedup over the use of a purely heuristic approximation

105 tility, our algorithm achieves a significant speedup over these baselines.

106 n 4.5 hours using 13 GB of RAM, with further speedups possible using multiple processors.

107 illustrate the subtle nature of the quantum speedup question.

108 ch, an algorithm that achieved a ~20-90-fold speedup relative to BLAST while still achieving similar

109 d quantum systems, but also offers a quantum speedup relative to the classical counterpart.

110 ons PySB/cupSODA achieves order-of-magnitude speedups relative to a CPU-based ordinary differential e

111 While the debate over speedup remains inconclusive as of now, instead of attem

112 ever, the demonstration of quantum annealing speedups remains to this day an elusive albeit coveted g

113 ovement of 53.10, 16.87, 3.60 and 1.64 times speedup, respectively.

114 results indicate that ERA can significantly speedup RNA structure-structure alignments compared to o

115 hes the minimum, thus demonstrating that the speedup seen with increasing volume exclusivity at low t

116 To speedup sequence alignment, ProbeMatch uses gapped q-gra

117 oll innermost loop to yield upto 2 to 3-fold speedup than static compilation but also enables dynamic

118 nd operation errors, and hence significantly speedup the communication rate.

119 can identify promising sequence segments and speedup the detection process.

120 PU implementation on a dual Xeon 5520 and 3X speedup versus BEAGLE's GPU implementation on a Tesla T1

121 lity analysis that is accelerated (up to 60x speedup) via solver warm-starts.

122 This represents a ~40X speedup when compared with BEAGLE's CPU implementation o

123 re-filtering methods that elicit substantial speedup when coupled with existing tools.

124 a benchmark, we found no evidence of quantum speedup when the entire data set is considered and obtai

125 antum information processing offers dramatic speedups, yet is susceptible to decoherence, whereby qua