A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Iterates of fractional order

1950
*
Canadian Journal of Mathematics - Journal Canadien de Mathematiques
*

If the range and domain of g are

doi:10.4153/cjm-1950-038-8
fatcat:tbv2trgd6zbw3gbrottvp7hvgq
*distinct*we can thus take E to be their union. ... This problem typifies the general one of*iteration*. Let g k (x) be the &th order*iterate*of g [i.e. g°(x) = x, g k+1 (x) = g(g k (x))]. ... Let n = 2k + 1. 2) The*branches*of L are disjointedly the union of a set of*branches*S and a set of*branch*clusters S. ...##
###
Page 611 of The American Mathematical Monthly Vol. 58, Issue 9
[page]

1951
*
The American Mathematical Monthly
*

If the system (1) has two

*distinct*real roots and two complex, there will be one real root in each of the two regions between the*branches*of F\(—x/2, —y/2) =0. ... The two*branches*of the curve F,\(—x/2, —y/2)=0 and the two*branches*of the hyperbola 4xy=1 divide the x, y-plane into six regions. (The lower left*branches*are tangent at (—1/2, —1/2).) ...##
###
SlimCodeML: An Optimized Version of CodeML for the Branch-Site Model

2012
*
2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum
*

We present SlimCodeML, an optimized version of CodeML for the

doi:10.1109/ipdpsw.2012.88
dblp:conf/ipps/SchabauerVPSSRYS12
fatcat:ixuaaqfdmnghfkthsgdyg3jtla
*branch*-site model. ... CodeML (part of the PAML package) implements a maximum likelihood-based approach to detect positive selection on a specific*branch*of a given phylogenetic tree. ... A higher number of species usually results in a higher number of*branches*and consequently in a higher number of*iterations*and amount of time spent per*iteration*. ...##
###
On the detection of unstructuredness in flowgraphs

1987
*
Information Processing Letters
*

According to the authors, unstructuredness is caused by four elements −−

doi:10.1016/0020-0190(87)90131-1
fatcat:zupc7au5b5cm7mw6y2jxucxbyy
*branching*into a selection,*branching*out of a selection,*branching*into a loop and*branching*out of a loop. ... Conclusion We hav e defined the concepts of skeleton, module,*branch*, entry and*iteration*exit in a flowgraph. ... Proposition 3 Givenad ecision node n,an ode p is in the*branch*B α (n)i fa nd only if there is a finite sequence of*distinct*skeletons <q β 0 (m 0 )... q β r (m r )> such that p ∈ q β 0 (m 0 ); m i−1 ∈ ...##
###
Apomorphy Distribution Is an Important Aspect of Cladogram Symmetry

1999
*
Systematic Biology
*

but the others are

doi:10.1080/106351599260373
pmid:12066716
fatcat:renitdktkncddnyaout4x667xu
*distinct*. ... An*iterative*-type process would be expected to produce a comb-shaped cladogram in which the apomorphies are concentrated on the external (terminal)*branches*. ...##
###
Phylogenetic and Structural Analysis of the Intergenic Region of Tobacco Leaf Curl Geminivirus

1998
*
Japanese Journal of Phytopathology
*

The significant but low sequence homology in the IR and AC1 ORF between TLCV and other WTGs suggests it is a

doi:10.3186/jjphytopath.64.187
fatcat:3n53zmnr5rflddgtqqxqjc2foy
*distinct*geminivirus pertaining to the Old World*branch*. ... The numbers above the*branches*refer to the percent identity in which the given*branch*is supported. ...##
###
More 3-manifolds with multiple knot-surgery and branched-cover descriptions

1982
*
Mathematical proceedings of the Cambridge Philosophical Society (Print)
*

We will also give examples of 3-manifolds which are i^-fold cyclic

doi:10.1017/s0305004100059533
fatcat:35s72muchnbynmf4o36b4wfhhm
*branched*covers of S 3 over 2*distinct*knots. ... Giller (5) has given examples of 3-manifolds which arise as cyclic*branched*covers over*distinct*knots in S 3 . ... Here is our example of*distinct*knots with the same r-fold cyclic*branched*covers. Pick# and q relatively prime to r, and*distinct*. Start with a Hopf link. (A (2,2)-torus link.) ...##
###
SIMT Microscheduling: Reducing Thread Stalling in Divergent Iterative Algorithms

2012
*
2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing
*

We propose techniques for

doi:10.1109/pdp.2012.62
dblp:conf/pdp/FreyRE12
fatcat:6m7wznrzpzhlrgg2ky62ynil3i
*branch*and loop divergence (which may also be combined) switching to suitable tasks during a GPU kernel run every time divergence occurs. ... Our newly introduced techniques can easily be applied to arbitrary*iterative*algorithms and we evaluate the performance and effectiveness of our approach exemplarily via synthetic and real world applications ... At least one thread enters the*branch*reliably in each*iteration*from a*branch*probability of ≈ 0.1. ...##
###
WHU at TREC Total Recall Track 2015

2015
*
Text Retrieval Conference
*

We propose an

dblp:conf/trec/WuLW15
fatcat:y3v6u25guvft7dyn5ea7ddgizq
*iterative*query expansion method, which construct queries using*iteratively*selected terms. We choose to participate the "Play-at-home" evaluation. Results are presented and discussed. ... Our approach consists of two*iterative*steps, i.e. document retrieval, and*distinctive*term selection. ... All relevant documents are grouped into the Relevant Result Set (RRS), which is denoted as RRSij. 5) If RRSi is empty, then this*branch*ends, otherwise extract all*distinctive*terms from RRSij and denote ...##
###
Computational modeling of retinotopic map development to define contributions of EphA-ephrinA gradients, axon-axon interactions, and patterned activity

2004
*
Journal of Neurobiology
*

*branch*elimination to generate a precise retinotopic map. ... Generating a refined map with a condensed TZ as in vivo requires an additional parameter that enhances

*branch*formation along an RGC axon near sites that it has a higher

*branch*density, and resembles an ... By late stage [ Fig. 8(A) ,

*iteration*200], the two populations have formed separate,

*distinct*TZs. ...

##
###
Practical Multidimensional Branch Prediction

2016
*
IEEE Micro
*

For some

doi:10.1109/mm.2016.33
fatcat:2c4dz5k5vrddrk2qbywsysso34
*branches*encapsulated in a multidimensional loop, their outcomes are correlated with those of the same*branch*in neighbor*iterations*, but in the previous outer loop*iteration*. ... In this paper, we introduce a practical, cost-effective mechanism for capturing multidimensional*branch*correlations: the Inner Most Loop*Iteration*(IMLI) counter. ... On a processor with a large instruction window,*distinct*static*branches*can have speculative occurrences in-flight at the same time. ...##
###
Code generation schema for modulo scheduled loops

1992
*
ACM SIGMICRO Newsletter
*

Software pipelining is an important instruction scheduling technique for efficiently overlapping successive

doi:10.1145/144965.145795
fatcat:45zdocdtkfh3nnm7gbbu5lte3y
*iterations*of loops and executing them in parallel. ... Operations in the kernel code which are from*distinct*stages are from*distinct**iterations*of the original loop. ... usage conflict arises between operations of either the same or*distinct**iterations*. ...##
###
Page 483 of American Society of Civil Engineers. Collected Journals Vol. 115, Issue 4
[page]

1898
*
American Society of Civil Engineers. Collected Journals
*

The

*branch*-and-bound enumeration procedure has, we believe,*distinct*advantages for plan formulation. The evaluation procedure is consistent with current plan formulation procedures. ... This bound, 585.74 thousand, is less than the trial optimum of*iteration*3. ...##
###
Models of Quantum Turing Machines
[chapter]

2004
*
Quantum Computing
*

The requirement that T be

doi:10.1002/3527603093.ch7
fatcat:4bdt45ikkzez7otiqxvxvopxee
*distinct*path generating is reviewed. ... Other examples are discussed in which the graph structures correspond to interferometers and*iterations*of interferometers. 03.65.Bz,89.70.+c Typeset using REVT E X ... In addition a nonterminating binary tree is attached to each terminal*branch*of the last (hth) tree in the*iteration*. It remains to discuss the proof that T and T † are*distinct*path generating. ...##
###
Aspects Of Implementing CLU

1978
*
Proceedings of the 1978 annual conference on - ACM 78
*

Linguistic mechanisms used in CLU to support 1) structured exception handling, 2)

doi:10.1145/800127.804079
dblp:conf/acm/AtkinsonLS78
fatcat:mwvjskjhmbcz7nu2bxngi7xgkm
*iteration*over abstract objects, and 3) parameterized abstractions are briefly reviewed, and methods of realizing these ...*branch*table entry for the exception being signalled. ... The first method, called the*branch*table method, is to follow each invocation with a*branch*table containing one entry for each exception that can be raised by the invocation. ...
« Previous

*Showing results 1 — 15 out of 201,474 results*