123 resultados para Minimum viable population


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The problem of optimum design of a Lanchester damper for minimum force transmission from a viscously damped single degree of freedom system subjected to harmonic excitation is investigated. Explicit expressions are developed for determining the optimum absorber parameters. It is shown that for the particular case of the undamped single degree of freedom system the results reduce to the classical ones obtained by using the concept of a fixed point on the transmissibility curves.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We propose that the poloidal field at the end of the last sunspot cycle before the Maunder minimum fell to a very low value due to fluctuations in the Babcock-Leighton process. With this assumption, a flux transport dynamo model is able to explain various aspects of the historical records of the Maunder minimum remarkably well by suitably choosing the parameters of the model to give the correct growth time.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Hematopoietic malignancies like leukemia and lymphoma are characteristically associated with various chromosomal translocations. Follicular lymphoma (FL) and mantle cell lymphoma (MCL) are two subtypes of non-Hodgkin's lymphoma which possess t(14;18) and t(11;14) translocations, respectively. The incidence of FL and MCL is higher in the western countries as compared to India. Interestingly, the associated translocations are also found in healthy individuals in western population, which is 50-80% for t(14;18), whereas t(11;14) occurs at a very low frequency. However, there are no studies to explore thes translocations in healthy Indian population, which could explain the lower incidence of FL and MCL. We employed Southern hybridization following nested PCR to detect above translocations in healthy individuals from India. Our results suggest that this assay can detect one t(14;18) translocation event in up to 10(7) normal cells where as one t(11;14) in 10(8) normal cells. According to our results, 87 out of 253 individuals carry t(14;18) indicating 34% prevalence in the population. The presence of this translocation was also detectable at the transcript level. Although, no gender-based difference was observed, an age-dependent increase in the prevalence of translocation was found in adults. However, even after studying 210 people, we could not detect any t(11;14) translocation, indicating that it is uncommon in Indian population. These results suggest that lower incidence of FL and MCL in India could be attributed to lower prevalence of these translocations in healthy individuals.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

It is shown that a magnetic-pressure-dominated, supersonic jet which expands (or contracts) in response to variations in the confining external pressure can dissipate magnetic energy through field-line reconnection as it relaxes to a minimum-energy configuration. In order for a continuous dissipation to take place, the effective reconnection time must be a fraction ɛ ⪉ 1 of the expansion time. The amount of energy dissipation is calculated, and it is concluded that magnetic energy dissipation could, in principle, power the observed synchrotron emission in extragalactic radio jets such as NGC 6251. However, this mechanism is only viable if the reconnection time is substantially shorter than the nominal resistive tearing time in the jet.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A new framework is proposed in this work to solve multidimensional population balance equations (PBEs) using the method of discretization. A continuous PBE is considered as a statement of evolution of one evolving property of particles and conservation of their n internal attributes. Discretization must therefore preserve n + I properties of particles. Continuously distributed population is represented on discrete fixed pivots as in the fixed pivot technique of Kumar and Ramkrishna [1996a. On the solution of population balance equation by discretization-I A fixed pivot technique. Chemical Engineering Science 51(8), 1311-1332] for 1-d PBEs, but instead of the earlier extensions of this technique proposed in the literature which preserve 2(n) properties of non-pivot particles, the new framework requires n + I properties to be preserved. This opens up the use of triangular and tetrahedral elements to solve 2-d and 3-d PBEs, instead of the rectangles and cuboids that are suggested in the literature. Capabilities of computational fluid dynamics and other packages available for generating complex meshes can also be harnessed. The numerical results obtained indeed show the effectiveness of the new framework. It also brings out the hitherto unknown role of directionality of the grid in controlling the accuracy of the numerical solution of multidimensional PBEs. The numerical results obtained show that the quality of the numerical solution can be improved significantly just by altering the directionality of the grid, which does not require any increase in the number of points, or any refinement of the grid, or even redistribution of pivots in space. Directionality of a grid can be altered simply by regrouping of pivots.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Two decision versions of a combinatorial power minimization problem for scheduling in a time-slotted Gaussian multiple-access channel (GMAC) are studied in this paper. If the number of slots per second is a variable, the problem is shown to be NP-complete. If the number of time-slots per second is fixed, an algorithm that terminates in O (Length (I)N+1) steps is provided.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We discuss a technique for solving the Landau-Zener (LZ) problem of finding the probability of excitation in a two-level system. The idea of time reversal for the Schrodinger equation is employed to obtain the state reached at the final time and hence the excitation probability. Using this method, which can reproduce the well-known expression for the LZ transition probability, we solve a variant of the LZ problem, which involves waiting at the minimum gap for a time t(w); we find an exact expression for the excitation probability as a function of t(w). We provide numerical results to support our analytical expressions. We then discuss the problem of waiting at the quantum critical point of a many-body system and calculate the residual energy generated by the time-dependent Hamiltonian. Finally, we discuss possible experimental realizations of this work.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Peroxisome proliferator activated receptor-gamma 2 (PPARG2) is a nuclear hormone receptor of ligand-dependent ranscription factor involved in adipogenesis and a molecular target of the insulin sensitizers thiazolidinediones. We addressed the question of whether the 3 variants (-1279G/A, Pro12Ala, and His478His) in the PPARG2 gene are associated with type 2 diabetes mellitus and its related traits in a South Indian population. The study subjects (1000 type 2 diabetes mellitus and 1000 normal glucose-tolerant subjects) were chosen randomly from the Chennai Urban Rural Epidemiology Study, an ongoing population-based study in southern India. The variants were screened by single-stranded conformational variant, direct sequencing, and restriction fragment length polymorphism. Linkage disequilibrium was estimated from the estimates of haplotypic frequencies. The -1279G/A, Pro12Ala, and His478His variants of the PPARG2 gene were not associated with type 2 diabetes mellitus. However, the 2-loci analyses showed that, in the presence of Pro/Pro genotype of the Pro12Ala variant, the -1279G/A promoter variant showed increased susceptibility to type 2 diabetes mellitus (odds ratio, 2.092; 95% confidence interval, 1.22-3.59; P = .008), whereas in the presence of 12Ala allele, the -1279G/A showed a protective effect against type 2 diabetes mellitus (odds ratio, 0.270; 95% confidence interval, 0.15-0.49; P < .0001). The 3-loci haplotype analysis showed that the A-Ala-T (-1279G/A-Pro12Ala-His478His) haplotype was associated with a reduced risk of type 2 diabetes mellitus (P < .0001). Although our data indicate that the PPARG2 gene variants, independently, have no association with type 2 diabetes mellitus, the 2-loci genotype analysis involving -1279G/A and Pro12Ala variants and the 3-loci haplotype analysis have shown a significant association with type 2 diabetes mellitus in this South Indian population. (C) 2010 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Making use of the empirical potential functions for peptide NH .. O bonds, developed in this laboratory, the relative stabilities of the rightand left-handed α-helical structures of poly-L-alanine have been investigated, by calculating their conformational energies (V). The value of Vmin of the right-handed helix (αP) is about - 10.4 kcal/mole, and that of the left-handed helix (αM) is about - 9.6 kcal/mole, showing that the former is lower in energy by 0.8 kcal/mole. The helical parameters of the stable conformation of αP are n ∼ 3.6 and h ∼ 1.5 Å. The hydrogen bond of length 2.85 Å and nonlinearity of about 10° adds about 4.0 kcal/ mole to the stabilising energy of the helix in the minimum enregy region. The energy minimum is not sharply defined, but occurs over a long valley, suggesting that a distribution of conformations (φ{symbol}, ψ) of nearly the same energy may occur for the individual residues in a helix. The experimental data of a-helical fibres of poly-L-alanine are in good agreement with the theoretical results for αP. In the case of proteins, the mean values of (φ{symbol}, ψ) for different helices are distributed, but they invariably occur within the contour for V = Vmin + 2 kcal/mole for αP.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

It has been shown that the conventional practice of designing a compensated hot wire amplifier with a fixed ceiling to floor ratio results in considerable and unnecessary increase in noise level at compensation settings other than optimum (which is at the maximum compensation at the highest frequency of interest). The optimum ceiling to floor ratio has been estimated to be between 1.5-2.0 ωmaxM. Application of the above considerations to an amplifier in which the ceiling to floor ratio is optimized at each compensation setting (for a given amplifier band-width), shows the usefulness of the method in improving the signal to noise ratio.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

It is well known that Alamouti code and, in general, Space-Time Block Codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbolby-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). In this paper, we obtain SSD codes with unitary weight matrices (but not CON) from matrix representations of Clifford algebras. Moreover, we derive an upper bound on the rate of SSD codes with unitary weight matrices and show that our codes meet this bound. Also, we present conditions on the signal sets which ensure full-diversity and give expressions for the coding gain.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Space-Time Block Codes (STBCs) from Complex Orthogonal Designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD); however, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). The class of CIODs have non-unitary weight matrices when written as a Linear Dispersion Code (LDC) proposed by Hassibi and Hochwald, whereas the other class of SSD codes including CODs have unitary weight matrices. In this paper, we construct a large class of SSD codes with nonunitary weight matrices. Also, we show that the class of CIODs is a special class of our construction.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present two new support vector approaches for ordinal regression. These approaches find the concentric spheres with minimum volume that contain most of the training samples. Both approaches guarantee that the radii of the spheres are properly ordered at the optimal solution. The size of the optimization problem is linear in the number of training samples. The popular SMO algorithm is adapted to solve the resulting optimization problem. Numerical experiments on some real-world data sets verify the usefulness of our approaches for data mining.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

using two types of organic ligands having similar chemical structure but different physical properties and varying their dynamic population at the surface of zinc blende seed nanocrystals, self-assembled zinc blende semicircular-shaped bent nanowires of CdS are synthesized via a colloidal synthetic approach. It is found that the hydrophobic tail interaction of long-chain ligands puts strain on these thin nanowires (< 2 nm diameter) and bend them to some extent, forming strained nanowires.