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

.

## Filters

##
###
Do precursor polyp burdens help distinguish Lynch versus non-Lynch microsatellite unstable colorectal cancers?

2010
*
Hereditary Cancer in Clinical Practice
*

Craig Messick,

doi:10.1186/1897-4287-8-s1-p12
pmcid:PMC2876284
fatcat:t4qxt4vkhrd6zolcq244ea7u54
*James*M Church, Graham Casey, Matthew*F*Kalady * From 13th Annual Meeting of the Collaborative Group of the Americas on Inherited Colorectal Cancer Honolulu, Hawaii, USA. 16-17 October 2009 ... These findings may help guide investigation into suspected*Lynch*syndrome. Do precursor polyp burdens help distinguish*Lynch*versus non-*Lynch*microsatellite unstable colorectal cancers? ...##
###
Hereditary Colorectal Cancer-Part II

2005
*
Current problems in surgery
*

J Laryngol Otol 2002;116:221-3). 579 B) Gingival papules in a CS patient (reproduced with permission from Sogol PB, Sugawara M, Gordon HE, Shellow WV, Hernandez

doi:10.1067/j.cpsurg.2005.02.003
pmid:15900295
fatcat:cfnd6a2myfhz5nqix22eq7cr74
*F*, Hershman JM. ...*James*French, Warthin's successor as chairman of pathology at the University of Michigan, heard about Lynch's research on Families N and M, and recalled that Warthin, his predecessor, had discovered a ...##
###
Convergence Laws for Random Graphs
[chapter]

1998
*
Logic Colloquium '95
*

0.2, and 01 ¢} a2 is max (d 11 d 2 ) , and the depth of an equivalence class C of =, we will put C

doi:10.1007/978-3-662-22108-2_9
dblp:conf/logicColl/Lynch95
fatcat:xnez2ltz7bfanf7vg7j7q7fcjm
*F*= a if w*F*= a for some w E C. ... .,,; cn -1/2 for some constant c, and n-+oo lim pr(w*F*(J, 71,) = 1 if p(n) » 11,-1/2. lim pr(w*F*(J, n) = 0 if p(n) ~ 11,-1/2, n-+oo lim pre W*F*(J, n-+oo Convergence on arithmetic subsequences is demonstrated ...##
###
Shallow-Water Acoustics

2004
*
Physics today
*

*f*x¡ y¢ . ... s i s i r r r r r r r exp ) , ( 4 ) ( ) ( ) [ ( ) ( )] + − − − − − + − + + − + − + + + + + + = µ µ µ µ µ µ µ µ µ π k k

*F*a a k k

*F*a a k k

*F*a a k k

*F*a a S SOFT SPHEROID (WHALE) AS SCATTERING BODY To ...

##
###
A Criterion for Stability in Random Boolean Cellular Automata
[article]

1993
*
arXiv
*
pre-print

This article is a continuation of the efforts begun in Luczak and Cohen [3] and

arXiv:adap-org/9305001v1
fatcat:xydcxkjcgvfkfpf2sefod5d54y
*Lynch*[4] . ... The two constant functions*f*(x, y) = 0 and*f*(x, y) = 1 are trivially canalyzing, as are the four functions that depend on only one argument:*f*(x, y) = x,*f*(x, y) = ¬x,*f*(x, y) = y, and*f*(x, y) = ...##
###
Almost sure theories

1980
*
Annals of Mathematical Logic
*

For s,mae simple cou,ltablc struetm'cs ~1, we show tilat Nllr) ix almost all of *t~2 or almost none of it.

doi:10.1016/0003-4843(80)90014-5
fatcat:su7rjqe7djepfpodcoifbkckqu
*f*~r certain tope)ogles and nleasures. ... [(d)k i.e.*f*(c)(r)=*f*(d)(r). Similarly*f*~ is 1-1. and since*f*also preserves S,~.*f*, is an isomorphism. It is clear that*f*~ is onto. ... O) where O=~ or 1, we can define a Markov chain (P,0 ..... ) . ) Theorem 1.10 (*Lynch*[11] ), Let X c_{O, 1}*. Then X ~ NP//and only if there is a sentence tr such that X = {e :S~c,, e) ¢ ~}. ...##
###
Classic Pages

1967
*
Circulation Research
*

##
###
On the Threshold of Chaos in Random Boolean Cellular Automata
[article]

1993
*
arXiv
*
pre-print

for

arXiv:adap-org/9309001v1
fatcat:qsossksnlrdkxj2vo5kebvfqiu
*f*ri . 3.*f*ri ∈ C. ... The extensions that we will use are described in full generality in*Lynch*[7] . Fixing n, put k = k(n) and index the elements of D n by d 1 , . . . , d k . ...##
###
DYNAMICS OF RANDOM BOOLEAN NETWORKS

2007
*
Current Developments in Mathematical Biology
*

We have µ =

doi:10.1142/9789812706799_0002
fatcat:6eatjzjz4bevloewtffzmrqazu
*F*(1) and σ 2 =*F*(1) +*F*(1) − (*F*(1)) 2 . ... The iterates of*F*(z) are defined by*F*0 (z) = z and*F*t+1 (z) =*F*(*F*t (z)) for t ≥ 0. (2) Then Theorem 1. ...##
###
The visually distinct configurations of k sets

1981
*
Discrete Mathematics
*

Now every P E: A (K, x) cali be obtained by choosing a set M c >K such tIeat 1 All < 2kx, and then choosing

doi:10.1016/0012-365x(81)90272-7
fatcat:tkoc3lfk3vb3zhmaxibgx2olyy
*f*such that for every (a, b) E P, if a # b then a E A4 +(k*-k)4og U(k)< 3kL/4+ k+log k. or b ...##
###
A Logical Characterization of Individual-Based Models

2008
*
Logic in Computer Science
*

Lotka-Volterra Model dx dt = ax − bxy dy dt = −cy + bxy

doi:10.1109/lics.2008.27
dblp:conf/lics/Lynch08
fatcat:av4jlinlbvfcthbpnrpcfsesky
*James**F*.*Lynch*A Logical Characterization of Individual-Based Models ...*Lynch*A Logical Characterization of Individual-Based Models Metafinite Models Continued Definition 1 A vocabulary is a triple (W,*F*, G) where W is a set of weight function symbols*F*is a set ...*Lynch*A Logical Characterization of Individual-Based Models What Is an Individual-Based Model? ...##
###
Taxonomic classes of sets

1990
*
Journal of combinatorial theory. Series A
*

Conversely, for any nonempty S, (U', S) is in the range of$ Therefore in these two cases the exponential generating series for S is In case (III) it is

doi:10.1016/0097-3165(90)90054-z
fatcat:p43qvbobvvbj5bwdatjsf4yske
*JAMES**F*.*LYNCH*.;, 5 = eli. , . ... Therefore by induction where the partial derivatives*F*, and*F*,.,. are evaluated at z = r and w = s. ...##
###
Stochastic flux analysis of chemical reaction networks

2013
*
BMC Systems Biology
*

and

doi:10.1186/1752-0509-7-133
pmid:24314153
pmcid:PMC3878955
fatcat:24icc4chtfhkpddbqrrb2vvzxi
*Lynch*; licensee BioMed Central Ltd. ... Left: A 0 = 1,*F*[2, 2.5] (0.1); Mid: A 0 = 10,*F*[1.7, 1.8] (0.1); Right: A 0 = 100,*F*[0.3, 0.4] (0.1). ...##
###
Effects of forest fragmentation on breeding bird communities in Maryland, USA

1984
*
Biological Conservation
*

*F*.,Robbins, C. S.,

*Lynch*, J.

*F*., Whitcomb, B. L., Klimkiewicz, M. K. & Bystrak, D. (1981). Effects of forest fragmentation on avifauna of the eastern deciduous forest. ...

*James*&Wamer, 1982) . ...

##
###
Probabilities of Sentences about Very Sparse Random Graphs

1992
*
Random structures & algorithms (Print)
*

If there exists an isomorphism

doi:10.1002/rsa.3240030105
fatcat:jctrrksmsffrzfpzwpd2ifqik4
*f*from (Zo, Eo, cy, . . . , cp) onto ( Z 1 , E 1 , c : , . . . , c*f*) such that for each 1: E Zo, j tree(GO, z) ! i tree(G',*f*(z)), then we say that Go 11 G1 via*f*. ... ) lim u(n, m) = U ,*f*o r all m E w. ...
« Previous

*Showing results 1 — 15 out of 46,518 results*