نتایج جستجو برای: singularperturbation problems

تعداد نتایج: 583420  

Journal: :Applied Mathematics and Computation 2012
Leopold Koczan Pawel Zaprawa

Let F denote the class of all functions univalent in the unit disk and convex in the direction of the real axis. In the paper we discuss the functions of the class F which are n-fold symmetric, where n is positive even integer. For the class of such functions we find the Koebe set as well as the covering set, i.e. T f2F f ðDÞ and S f2F f ðDÞ. Moreover, the Koebe constant and the covering consta...

Journal: :J. Comb. Theory, Ser. A 1998
Yair Caro Raphael Yuster

For every fixed graph H, we determine the H-covering number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, C(H,Kn) = d dn 2h dn− 1 d ee, unless d is even, n = 1 mod d and n(n− 1)/d+ 1 = 0 mod (2h/d), in which case C(H,Kn) = d ( n 2 ) h e+ 1. Our m...

Journal: :Developmental Cognitive Neuroscience 2012
K. Suzanne Scherf Marlene Behrmann Ronald E. Dahl

Adolescence is a time of dramatic physical, cognitive, emotional, and social changes as well as a time for the development of many social-emotional problems. These characteristics raise compelling questions about accompanying neural changes that are unique to this period of development. Here, we propose that studying adolescent-specific changes in face processing and its underlying neural circu...

Journal: :British medical journal 1972

By reading, you can know the knowledge and things more, not only about what you get from people to people. Book will be more trusted. As this emotional problems of childhood and adolescence, it will really give you the good idea to be successful. It is not only for you to be success in certain life you can be successful in everything. The success can be started by knowing the basic knowledge an...

Journal: :Discrete Mathematics 2001
Zsolt Katona

Let H denote the set {f1, f2, ..., fn}, 2 the collection of all subsets of H and F ⊆ 2 be a family. The maximum of |F| is studied if any k subsets have a non-empty intersection and the intersection of any l distinct subsets (1 ≤ k < l) is empty. This problem is reduced to a covering problem. If we have the conditions that any two subsets have a non-empty intersection and the intersection of any...

Journal: :Optimization Letters 2009
Leo Liberti Nelson Maculan Yue Zhang

We use reformulation techniques to model and solve a complex sphere covering problem occurring in the configuration of a gamma ray machine radiotherapy equipment unit.

2009
Lawrence V. Snyder

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید