978 resultados para Natural Computing
Resumo:
A Geodesic Constant Method (GCM) is outlined which provides a common approach to ray tracing on quadric cylinders in general, and yields all the surface ray-geometric parameters required in the UTD mutual coupling analysis of conformal antenna arrays in the closed form. The approach permits the incorporation of a shaping parameter which permits the modeling of quadric cylindrical surfaces of desired sharpness/flatness with a common set of equations. The mutual admittance between the slots on a general parabolic cylinder is obtained as an illustration of the applicability of the GCM.
Resumo:
In Taita Hills, south-eastern Kenya, remnants of indigenous mountain rainforests play a crucial role as water towers and socio-cultural sites. They are pressurized due to poverty, shortage of cultivable land and the fading of traditional knowledge. This study examines the traditional ecological knowledge of Taitas and the ways it may be applied within transforming natural resource management regimes. I have analyzed some justifications for and hindrances to ethnodevelopment and participatory forest management in light of recently renewed Kenyan forest policies. Mixed methods were applied by combining an ethnographic approach with participatory GIS. I learned about traditionally protected forests and their ecological and cultural status through a seek out the expert method and with remote sensing data and tools. My informants were: 107 household interviewees, 257 focus group participants, 73 key informants and 87 common informants in participatory mapping. Religious leaders and state officials shared their knowledge for this study. I have gained a better understanding of the traditionally protected forests and sites through examining their ecological characteristics and relation to social dynamics, by evaluating their strengths and hindrances as sites for conservation of cultural and biological diversity. My results show that, these sites are important components of a complex socio-ecological system, which has symbolical status and sacred and mystical elements within it, that contributes to the connectivity of remnant forests in the agroforestry dominated landscape. Altogether, 255 plant species and 220 uses were recognized by the tradition experts, whereas 161 species with 108 beneficial uses were listed by farmers. Out of the traditionally protected forests studied 47 % were on private land and 23% on community land, leaving 9% within state forest reserves. A paradigm shift in conservation is needed; the conservation area approach is not functional for private lands or areas trusted upon communities. The role of traditionally protected forests in community-based forest management is, however, paradoxal, since communal approaches suggests equal participation of people, whereas management of these sites has traditionally been the duty of solely accredited experts in the village. As modernization has gathered pace such experts have become fewer. Sacredness clearly contributes but, it does not equal conservation. Various social, political and economic arrangements further affect the integrity of traditionally protected forests and sites, control of witchcraft being one of them. My results suggest that the Taita have a rich traditional ecological knowledge base, which should be more determinately integrated into the natural resource management planning processes.
Resumo:
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distributed algorithm: all nodes must accept a valid proof, and at least one node must reject an invalid proof. We focus on locally checkable proofs that can be verified with a constant-time distributed algorithm. For example, it is easy to prove that a graph is bipartite: the locally checkable proof gives a 2-colouring of the graph, which only takes 1 bit per node. However, it is more difficult to prove that a graph is not bipartite—it turns out that any locally checkable proof requires Ω(log n) bits per node. In this work we classify graph problems according to their local proof complexity, i.e., how many bits per node are needed in a locally checkable proof. We establish tight or near-tight results for classical graph properties such as the chromatic number. We show that the proof complexities form a natural hierarchy of complexity classes: for many classical graph problems, the proof complexity is either 0, Θ(1), Θ(log n), or poly(n) bits per node. Among the most difficult graph properties are symmetric graphs, which require Ω(n2) bits per node, and non-3-colourable graphs, which require Ω(n2/log n) bits per node—any pure graph property admits a trivial proof of size O(n2).
Resumo:
Let G be a simple, undirected, finite graph with vertex set V(G) and edge set E(C). A k-dimensional box is a Cartesian product of closed intervals a(1), b(1)] x a(2), b(2)] x ... x a(k), b(k)]. The boxicity of G, box(G) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes, i.e. each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset where S is the ground set and P is a reflexive, anti-symmetric and transitive binary relation on S. The dimension of P, dim(P) is the minimum integer l such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with its extended double cover, denoted as G(c). Let P-c be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P-c) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension. In the other direction, using the already known bounds for partial order dimension we get the following: (I) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta) which is an improvement over the best known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0, unless NP=ZPP.
Resumo:
When administered orally, Phyllanthus emblica, an excellent source of vitamin C (ascorbate), has been found to enhance natural killer (NK) cell activity and antibody dependent cellular cytotoxicity (ADCC) in syngeneic BALB/c mice, bearing Dalton's lymphoma ascites (DLA) tumor. P. emblica elicited a 2-fold increase in splenic NK cell activity on day 3 post tumor inoculation. Enhanced activity was highly significant on days 3, 5, 7 and 9 after tumor inoculation with respect to the untreated tumor bearing control. A significant enhancement in ADCC was documented on days 3, 7, 9, 11 and 13 in drug treated mice as compared to the control. An increase in life span (ILS) of 35% was recorded in tumor bearing mice treated with P. emblica. This increased survival was completely abrogated when NK cell and killer (K) cell activities were depleted either by cyclophosphamide or anti-asialo-GM, antibody treatment. These results indicate: (a) an absolute requirement for a functional NK cell or K cell population in order that P. emblica can exert its effect on tumor bearing animals, and (b) the antitumor activity of P. emblica is mediated primarily through the ability of the drug to augment natural cell mediated cytotoxicity.
Resumo:
We address the problem of computing the level-crossings of an analog signal from samples measured on a uniform grid. Such a problem is important, for example, in multilevel analog-to-digital (A/D) converters. The first operation in such sampling modalities is a comparator, which gives rise to a bilevel waveform. Since bilevel signals are not bandlimited, measuring the level-crossing times exactly becomes impractical within the conventional framework of Shannon sampling. In this paper, we propose a novel sub-Nyquist sampling technique for making measurements on a uniform grid and thereby for exactly computing the level-crossing times from those samples. The computational complexity of the technique is low and comprises simple arithmetic operations. We also present a finite-rate-of-innovation sampling perspective of the proposed approach and also show how exponential splines fit in naturally into the proposed sampling framework. We also discuss some concrete practical applications of the sampling technique.
Resumo:
Enantioselective synthesis of possible diastereomers of heptadeca-1-ene-4,6-diyne-3,8,9,10-tetrol, a structure proposed for the natural product isolated from Hydrocotyle leucocephala is accomplished. The reported spectral data of the natural product did not match those of any of the isomers that were synthesized and established that the structure proposed for the natural product is not correct and requires revision.
Resumo:
Natural convection from an isothermal vertical surface to a thermally stratified fluid is studied numerically. A wide range of stratification levels is considered. It is shown that at high levels of ambient thermal stratification, a portion at the top of the plate absorbs heat, while a horizontal plume forms around a location where the plate temperature equals the ambient temperature. The plume is shown to be inherently unsteady, and its transient nature is investigated in detail. The effect of the temperature defect in striating the plume is discussed. Average Nusselt number data are presented for Pr = 6.0 and 0.7.
Resumo:
Floquet analysis is widely used for small-order systems (say, order M < 100) to find trim results of control inputs and periodic responses, and stability results of damping levels and frequencies, Presently, however, it is practical neither for design applications nor for comprehensive analysis models that lead to large systems (M > 100); the run time on a sequential computer is simply prohibitive, Accordingly, a massively parallel Floquet analysis is developed with emphasis on large systems, and it is implemented on two SIMD or single-instruction, multiple-data computers with 4096 and 8192 processors, The focus of this development is a parallel shooting method with damped Newton iteration to generate trim results; the Floquet transition matrix (FTM) comes out as a byproduct, The eigenvalues and eigenvectors of the FTM are computed by a parallel QR method, and thereby stability results are generated, For illustration, flap and flap-lag stability of isolated rotors are treated by the parallel analysis and by a corresponding sequential analysis with the conventional shooting and QR methods; linear quasisteady airfoil aerodynamics and a finite-state three-dimensional wake model are used, Computational reliability is quantified by the condition numbers of the Jacobian matrices in Newton iteration, the condition numbers of the eigenvalues and the residual errors of the eigenpairs, and reliability figures are comparable in both the parallel and sequential analyses, Compared to the sequential analysis, the parallel analysis reduces the run time of large systems dramatically, and the reduction increases with increasing system order; this finding offers considerable promise for design and comprehensive-analysis applications.