نتایج جستجو برای: hunting magic

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

2011
SEONG-HOON CHO ROLAND K. ROBERTS SEUNG GYU KIM DAYTON M. LAMBERT NEELAM C. POUDYAL Seong-Hoon Cho S. CHO Derek Murray

The effect of forestland availability under different ownership types on license sales for hunting in nine Southeastern states is empirically evaluated. An equation that represents license sales for hunting is estimated assuming the sale of hunting licenses in a particular county is related to the characteristics of that county as well as the characteristics and license sales for hunting in its...

2009
Jeremy Koster

Once absent in much of Amazonia, dogs are now commonly used for hunting throughout the lowland Neotropics. Although some ethnographers have questioned their usefulness, dogs are particularly effective in pursuits of several mammalian prey species. The return rates of hunting with dogs appear to compare favorably with those of hunting with firearms, and dogs may be especially beneficial in anthr...

2004
MAYA MOHSIN AHMED

ABSTRACT Magic labelings of graphs are studied in great detail by Stanley in [18] and [19], and Stewart in [20] and [21]. In this article, we construct and enumerate magic labelings of graphs using Hilbert bases of polyhedral cones and Ehrhart quasi-polynomials of polytopes. We define polytopes of magic labelings of graphs and digraphs. We give a description of the faces of the Birkhoff polytop...

2010
Peter Lamont John M. Henderson Tim J. Smith

Recent articles calling for a scientific study of magic have been the subject of widespread interest. This article considers the topic from a broader perspective and argues that to engage in a science of magic, in any meaningful sense, is misguided. It argues that those who have called for a scientific theory of magic have failed to explain either how or why such a theory might be constructed, ...

Journal: :Ars Comb. 2015
Rikio Ichishima Francesc A. Muntaner-Batle Miquel Rius-Font

Let G = (V,E) be a graph of order p and size q. It is known that if G is super edge-magic graph then q ≤ 2p− 3. Furthermore, if G is super edge-magic and q = 2p− 3, then the girth of G is 3. It is also known that if the girth of G is at least 4 and G is super edge-magic then q ≤ 2p − 5. In this paper we show that there are infinitely many graphs which are super edge-magic, have girth 5, and q =...

Journal: :Journal of human evolution 2000
T W Plummer C B Stanford

Chimpanzee hunting provides information on prey characteristics and constraints acting on a large-bodied primate lacking a hunting technology, and has important implications for modeling hunting by fossil hominids. Analysis of the remains of five red colobus monkeys captured and consumed by Gombe chimpanzees in a single hunting bout provides one of the first opportunities to investigate the cha...

1998
Carlo M. Abbruzzese Gary Ritchison

—We studied the nocturnal hunting behavior of eight radiotagged Eastern Screech-owls (Otus asio; five females and three males) during the period from November 1994 through March 1995. Screech-owls selected low perches when hunting (x = 1.66 m), presumably to obtain a clear view of the ground and an unobstructed flight path to prey. Low perches may also improve the ability of screech-owls to hea...

2014
Muhammad Imran Mehar Ali Malik M. Yasir Hayat Malik

ON SUPER EDGE-MAGIC TOTAL LABELING OF REFLEXIVE W-TREES Muhammad Imran, Mehar Ali Malik, M. Yasir Hayat Malik Department of Mathematics, School of Natural Sciences (SNS), National University of Sciences and Technology (NUST), Islamabad, Pakistan. E-mail: {imrandhab, alies.camp, yasirmalikawan}@gmail.com Mathematics Subject Classification: 05C78 ABSTRACT. Kotzig and Rosa [17] defined a magic lab...

2004
Chiara Cumbo Wolfgang Faber Gianluigi Greco Nicola Leone

We present a new technique for the optimization of (partially) bound queries over disjunctive datalog programs. The technique exploits the propagation of query bindings, and extends the Magic-Set optimization technique (originally defined for non-disjunctive programs) to the disjunctive case, substantially improving on previously defined approaches. Magic-Set-transformed disjunctive programs fr...

Journal: :Int. J. Found. Comput. Sci. 2012
Markus Holzer Sebastian Jakobi Martin Kutrib

We investigate the magic number problem, that is, the question whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic finite automaton (DFA) has α states, for all n and α satisfying n ≤ α ≤ 2n. A number α not satisfying this condition is called a magic number (for n). It was shown in [11] that no magic numbers exist for general regu...

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

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