Fast Inverse Distance Weighting-Based Spatiotemporal Interpolation: A Web-Based Application of Interpolating Daily Fine Particulate Matter PM2.5 in the Contiguous U.S. Using Parallel Programming and k-d Tree

Science.gov (United States)

Li, Lixin; Losser, Travis; Yorke, Charles; Piltner, Reinhard

2014-01-01

Epidemiological studies have identified associations between mortality and changes in concentration of particulate matter. These studies have highlighted the public concerns about health effects of particulate air pollution. Modeling fine particulate matter PM2.5 exposure risk and monitoring day-to-day changes in PM2.5 concentration is a critical step for understanding the pollution problem and embarking on the necessary remedy. This research designs, implements and compares two inverse distance weighting (IDW)-based spatiotemporal interpolation methods, in order to assess the trend of daily PM2.5 concentration for the contiguous United States over the year of 2009, at both the census block group level and county level. Traditionally, when handling spatiotemporal interpolation, researchers tend to treat space and time separately and reduce the spatiotemporal interpolation problems to a sequence of snapshots of spatial interpolations. In this paper, PM2.5 data interpolation is conducted in the continuous space-time domain by integrating space and time simultaneously, using the so-called extension approach. Time values are calculated with the help of a factor under the assumption that spatial and temporal dimensions are equally important when interpolating a continuous changing phenomenon in the space-time domain. Various IDW-based spatiotemporal interpolation methods with different parameter configurations are evaluated by cross-validation. In addition, this study explores computational issues (computer processing speed) faced during implementation of spatiotemporal interpolation for huge data sets. Parallel programming techniques and an advanced data structure, named k-d tree, are adapted in this paper to address the computational challenges. Significant computational improvement has been achieved. Finally, a web-based spatiotemporal IDW-based interpolation application is designed and implemented where users can visualize and animate spatiotemporal interpolation

Fast inverse distance weighting-based spatiotemporal interpolation: a web-based application of interpolating daily fine particulate matter PM2:5 in the contiguous U.S. using parallel programming and k-d tree.

Science.gov (United States)

Li, Lixin; Losser, Travis; Yorke, Charles; Piltner, Reinhard

2014-09-03

Epidemiological studies have identified associations between mortality and changes in concentration of particulate matter. These studies have highlighted the public concerns about health effects of particulate air pollution. Modeling fine particulate matter PM2.5 exposure risk and monitoring day-to-day changes in PM2.5 concentration is a critical step for understanding the pollution problem and embarking on the necessary remedy. This research designs, implements and compares two inverse distance weighting (IDW)-based spatiotemporal interpolation methods, in order to assess the trend of daily PM2.5 concentration for the contiguous United States over the year of 2009, at both the census block group level and county level. Traditionally, when handling spatiotemporal interpolation, researchers tend to treat space and time separately and reduce the spatiotemporal interpolation problems to a sequence of snapshots of spatial interpolations. In this paper, PM2.5 data interpolation is conducted in the continuous space-time domain by integrating space and time simultaneously, using the so-called extension approach. Time values are calculated with the help of a factor under the assumption that spatial and temporal dimensions are equally important when interpolating a continuous changing phenomenon in the space-time domain. Various IDW-based spatiotemporal interpolation methods with different parameter configurations are evaluated by cross-validation. In addition, this study explores computational issues (computer processing speed) faced during implementation of spatiotemporal interpolation for huge data sets. Parallel programming techniques and an advanced data structure, named k-d tree, are adapted in this paper to address the computational challenges. Significant computational improvement has been achieved. Finally, a web-based spatiotemporal IDW-based interpolation application is designed and implemented where users can visualize and animate spatiotemporal interpolation

ERA: Efficient serial and parallel suffix tree construction for very long strings

KAUST Repository

Mansour, Essam

2011-09-01

The suffix tree is a data structure for indexing strings. It is used in a variety of applications such as bioinformatics, time series analysis, clustering, text editing and data compression. However, when the string and the resulting suffix tree are too large to fit into the main memory, most existing construction algorithms become very inefficient. This paper presents a disk-based suffix tree construction method, called Elastic Range (ERa), which works efficiently with very long strings that are much larger than the available memory. ERa partitions the tree construction process horizontally and vertically and minimizes I/Os by dynamically adjusting the horizontal partitions independently for each vertical partition, based on the evolving shape of the tree and the available memory. Where appropriate, ERa also groups vertical partitions together to amortize the I/O cost. We developed a serial version; a parallel version for shared-memory and shared-disk multi-core systems; and a parallel version for shared-nothing architectures. ERa indexes the entire human genome in 19 minutes on an ordinary desktop computer. For comparison, the fastest existing method needs 15 minutes using 1024 CPUs on an IBM BlueGene supercomputer.

Mountain cedar allergens found in nonpollen tree parts.

Science.gov (United States)

Goetz, D W; Goetz, M A; Whisman, B A

1995-09-01

Mountain cedar (Juniperus ashei) pollen is the principal aeroallergen in south central Texas from late December through February. The major mountain cedar allergen is a 40-kD glycoprotein, gp40. To identify allergens in mountain cedar wood, leaves, and berries and to detect mountain cedar allergen in smoke from burning male or female trees. SDS-PAGE plus mountain cedar human sIgE and monoclonal antibody immunoblots identified mountain cedar allergens within pollen and nonpollen tree part extracts. IgE immunoblots identified a single wood allergen at 36 kD and three berry allergens at 36, 26-27, and 21 kD, in addition to known pollen allergens. Mountain cedar monoclonal antibody bound an allergen epitope present not only on 40, 33, and 28-kD pollen allergens, but also on 36 and 32-kD wood allergens, and the 26-27-kD berry allergen. Immunoblot studies detected no mountain cedar allergen in leaves and no allergen in smoke from burning male and female trees. Allergens constituted a much smaller percentage of extractable protein in wood and berries than in pollen. Mountain cedar berry allergen content is too small to give credence to the ingestion of berries as a folk medicine treatment of mountain cedar pollinosis. In addition, while smoke from burning mountain cedar trees may be irritating, it contains no allergens that could cause allergic rhinoconjunctivitis.

Parallel family trees for transfer matrices in the Potts model

Science.gov (United States)

Navarro, Cristobal A.; Canfora, Fabrizio; Hitschfeld, Nancy; Navarro, Gonzalo

2015-02-01

The computational cost of transfer matrix methods for the Potts model is related to the question in how many ways can two layers of a lattice be connected? Answering the question leads to the generation of a combinatorial set of lattice configurations. This set defines the configuration space of the problem, and the smaller it is, the faster the transfer matrix can be computed. The configuration space of generic (q , v) transfer matrix methods for strips is in the order of the Catalan numbers, which grows asymptotically as O(4m) where m is the width of the strip. Other transfer matrix methods with a smaller configuration space indeed exist but they make assumptions on the temperature, number of spin states, or restrict the structure of the lattice. In this paper we propose a parallel algorithm that uses a sub-Catalan configuration space of O(3m) to build the generic (q , v) transfer matrix in a compressed form. The improvement is achieved by grouping the original set of Catalan configurations into a forest of family trees, in such a way that the solution to the problem is now computed by solving the root node of each family. As a result, the algorithm becomes exponentially faster than the Catalan approach while still highly parallel. The resulting matrix is stored in a compressed form using O(3m ×4m) of space, making numerical evaluation and decompression to be faster than evaluating the matrix in its O(4m ×4m) uncompressed form. Experimental results for different sizes of strip lattices show that the parallel family trees (PFT) strategy indeed runs exponentially faster than the Catalan Parallel Method (CPM), especially when dealing with dense transfer matrices. In terms of parallel performance, we report strong-scaling speedups of up to 5.7 × when running on an 8-core shared memory machine and 28 × for a 32-core cluster. The best balance of speedup and efficiency for the multi-core machine was achieved when using p = 4 processors, while for the cluster

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

International Nuclear Information System (INIS)

Azad, Ariful; Buluc, Aydn; Pothen, Alex

2016-01-01

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting path is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.

Ursodeoxycholic Acid Ameliorates Intrahepatic Cholestasis Independent of Biliary Bicarbonate Secretion in Vil2kd/kd Mice.

Science.gov (United States)

Hatano, Ryo; Kawaguchi, Kotoku; Togashi, Fumitaka; Sugata, Masato; Masuda, Shizuka; Asano, Shinji

2017-01-01

Ursodeoxycholic acid (UDCA) is a hydrophilic bile acid that possesses many pharmacological effects, including increasing bile flow, changing the hydrophobicity of the bile acid pool, and modulation of the immune response. UDCA has been approved for treating cholestatic liver disease, such as primary biliary cholangitis. However, several unanticipated severe side effects of UDCA are observed in cholestatic patients, and its pharmacological benefits remain controversial. We reported that ezrin-knockdown (Vil2 kd/kd ) mice exhibited severe hepatic injury because of a functional disorder in bile duct fluidity and alkalinity regulation, resembling human intrahepatic cholestatic disease. Here we used Vil2 kd/kd mice as a cholestatic model to investigate the pharmacological effects of UDCA. We investigated the effects of oral and parenteral administration of UDCA on Vil2 kd/kd mice. In Vil2 kd/kd mice, fed a 0.5% (w/w) UDCA diet for 3 weeks, hepatic injury was exacerbated, although oral administration of a lower dose of UDCA slightly improved hepatic function in Vil2 kd/kd mice. On the other hand, intraperitoneal administration of UDCA (50 mg/kg/d) ameliorated hepatic function and markedly reduced periductal fibrosis and cholangiocyte proliferation in Vil2 kd/kd mice although biliary pH and HCO 3 - concentration were not improved. The expression levels of inflammatory and profibrotic genes were also significantly decreased in these mice. Furthermore, UDCA prevented cholangiocytes from hydrophobic bile acid-induced cytotoxicity independent of extracellular pH in in vitro experiments. These results suggest that an appropriate dosage of UDCA can ameliorate the intrahepatic cholestasis in Vil2 kd/kd mice without changing the biliary bicarbonate secretion.

Surface tree languages and parallel derivation trees

NARCIS (Netherlands)

Engelfriet, Joost

1976-01-01

The surface tree languages obtained by top-down finite state transformation of monadic trees are exactly the frontier-preserving homomorphic images of sets of derivation trees of ETOL systems. The corresponding class of tree transformation languages is therefore equal to the class of ETOL languages.

Interpretable decision-tree induction in a big data parallel framework

Directory of Open Access Journals (Sweden)

Weinberg Abraham Itzhak

2017-12-01

Full Text Available When running data-mining algorithms on big data platforms, a parallel, distributed framework, such asMAPREDUCE, may be used. However, in a parallel framework, each individual model fits the data allocated to its own computing node without necessarily fitting the entire dataset. In order to induce a single consistent model, ensemble algorithms such as majority voting, aggregate the local models, rather than analyzing the entire dataset directly. Our goal is to develop an efficient algorithm for choosing one representative model from multiple, locally induced decision-tree models. The proposed SySM (syntactic similarity method algorithm computes the similarity between the models produced by parallel nodes and chooses the model which is most similar to others as the best representative of the entire dataset. In 18.75% of 48 experiments on four big datasets, SySM accuracy is significantly higher than that of the ensemble; in about 43.75% of the experiments, SySM accuracy is significantly lower; in one case, the results are identical; and in the remaining 35.41% of cases the difference is not statistically significant. Compared with ensemble methods, the representative tree models selected by the proposed methodology are more compact and interpretable, their induction consumes less memory, and, as confirmed by the empirical results, they allow faster classification of new records.

Enhancing parallelism of tile bidiagonal transformation on multicore architectures using tree reduction

KAUST Repository

Ltaief, Hatem; Luszczek, Piotr R.; Dongarra, Jack

2012-01-01

The objective of this paper is to enhance the parallelism of the tile bidiagonal transformation using tree reduction on multicore architectures. First introduced by Ltaief et. al [LAPACK Working Note #247, 2011], the bidiagonal transformation using

Enhancing parallelism of tile bidiagonal transformation on multicore architectures using tree reduction

KAUST Repository

Ltaief, Hatem

2012-01-01

The objective of this paper is to enhance the parallelism of the tile bidiagonal transformation using tree reduction on multicore architectures. First introduced by Ltaief et. al [LAPACK Working Note #247, 2011], the bidiagonal transformation using tile algorithms with a two-stage approach has shown very promising results on square matrices. However, for tall and skinny matrices, the inherent problem of processing the panel in a domino-like fashion generates unnecessary sequential tasks. By using tree reduction, the panel is horizontally split, which creates another dimension of parallelism and engenders many concurrent tasks to be dynamically scheduled on the available cores. The results reported in this paper are very encouraging. The new tile bidiagonal transformation, targeting tall and skinny matrices, outperforms the state-of-the-art numerical linear algebra libraries LAPACK V3.2 and Intel MKL ver. 10.3 by up to 29-fold speedup and the standard two-stage PLASMA BRD by up to 20-fold speedup, on an eight socket hexa-core AMD Opteron multicore shared-memory system. © 2012 Springer-Verlag.

PSHED: a simplified approach to developing parallel programs

International Nuclear Information System (INIS)

Mahajan, S.M.; Ramesh, K.; Rajesh, K.; Somani, A.; Goel, M.

1992-01-01

This paper presents a simplified approach in the forms of a tree structured computational model for parallel application programs. An attempt is made to provide a standard user interface to execute programs on BARC Parallel Processing System (BPPS), a scalable distributed memory multiprocessor. The interface package called PSHED provides a basic framework for representing and executing parallel programs on different parallel architectures. The PSHED package incorporates concepts from a broad range of previous research in programming environments and parallel computations. (author). 6 refs

On "new travelling wave solutions" of the KdV and the KdV-Burgers equations

NARCIS (Netherlands)

Kudryashov, Nikolai A.

The Korteweg-de Vries and the Korteweg-de Vries-Burgers equations are considered. Using the travelling wave the general solutions of these equations are presented. "New travelling wave solutions" of the KdV and the KdV-Burgers equations by Wazzan [Wazzan L Commun Nonlinear Sci Numer Simulat

On a generalized fifth order KdV equations

International Nuclear Information System (INIS)

Kaya, Dogan; El-Sayed, Salah M.

2003-01-01

In this Letter, we dealt with finding the solutions of a generalized fifth order KdV equation (for short, gfKdV) by using the Adomian decomposition method (for short, ADM). We prove the convergence of ADM applied to the gfKdV equation. Then we obtain the exact solitary-wave solutions and numerical solutions of the gfKdV equation for the initial conditions. The numerical solutions are compared with the known analytical solutions. Their remarkable accuracy are finally demonstrated for the gfKdV equation

Use of synthetic peptide libraries for the H-2Kd binding motif identification.

Science.gov (United States)

Quesnel, A; Casrouge, A; Kourilsky, P; Abastado, J P; Trudelle, Y

1995-01-01

To identify Kd-binding peptides, an approach based on small peptide libraries has been developed. These peptide libraries correspond to all possible single-amino acid variants of a particular Kd-binding peptide, SYIPSAEYI, an analog of the Plasmodium berghei 252-260 antigenic peptide SYIPSAEKI. In the parent sequence, each position is replaced by all the genetically encoded amino acids (except cysteine). The multiple analog syntheses are performed either by the Divide Couple and Recombine method or by the Single Resin method and generate mixtures containing 19 peptides. The present report deals with the synthesis, the purification, the chemical characterization by amino acid analysis and electrospray mass spectrometry (ES-MS), and the application of such mixtures in binding tests with a soluble, functionally empty, single-chain H-2Kd molecule denoted SC-Kd. For each mixture, bound peptides were eluted and analyzed by sequencing. Since the binding tests were realized in noncompetitive conditions, our results show that a much broader set of peptides bind to Kd than expected from previous studies. This may be of practical importance when looking for low affinity peptides such as tumor peptides capable of eliciting protective immune response.

A tree based method for the rapid screening of chemical fingerprints

DEFF Research Database (Denmark)

Kristensen, Thomas Greve; Nielsen, Jesper; Pedersen, Christian Nørgaard Storm

2009-01-01

The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fingerprints can be used in an initial phase for identifying novel drug candidates by screening large databases for molecules......: the kD grid and the Multibit tree. The kD grid is based on splitting the fingerprints into k shorter bitstrings and utilising these to compute bounds on the similarity of the complete bitstrings. The Multibit tree uses hierarchical clustering and similarity within each cluster to compute similar bounds...

Circumsporozoite Protein-Specific Kd-Restricted CD8+ T Cells Mediate Protective Antimalaria Immunity in Sporozoite-Immunized MHC-I-Kd Transgenic Mice

Directory of Open Access Journals (Sweden)

Jing Huang

2014-01-01

Full Text Available Although the roles of CD8+ T cells and a major preerythrocytic antigen, the circumsporozoite (CS protein, in contributing protective antimalaria immunity induced by radiation-attenuated sporozoites, have been shown by a number of studies, the extent to which these players contribute to antimalaria immunity is still unknown. To address this question, we have generated C57BL/6 (B6 transgenic (Tg mice, expressing Kd molecules under the MHC-I promoter, called MHC-I-Kd-Tg mice. In this study, we first determined that a single immunizing dose of IrPySpz induced a significant level of antimalaria protective immunity in MHC-I-Kd-Tg mice but not in B6 mice. Then, by depleting various T-cell subsets in vivo, we determined that CD8+ T cells are the main mediator of the protective immunity induced by IrPySpz. Furthermore, when we immunized (MHC-I-Kd-Tg × CS-Tg F1 mice with IrPySpz after crossing MHC-I-Kd-Tg mice with PyCS-transgenic mice (CS-Tg, which are unable to mount PyCS-specific immunity, we found that IrPySpz immunization failed to induce protective antimalaria immunity in (MHC-I-Kd-Tg × CS-Tg F1 mice, thus indicating the absence of PyCS antigen-dependent immunity in these mice. These results indicate that protective antimalaria immunity induced by IrPySpz in MHC-I-Kd-Tg mice is mediated by CS protein-specific, Kd-restricted CD8+ T cells.

Lax pair and exact solutions of a discrete coupled system related to coupled KdV and coupled mKdV equations

International Nuclear Information System (INIS)

Liu Ping; Jia Man; Lou Senyue

2007-01-01

A modified Korteweg-de Vries (mKdV) lattice is also found to be a discrete Korteweg-de Vries (KdV) equation in this paper. The Lax pair for the discrete equation is found with the help of the Lax pair for a similar discrete equation. A Lax-integrable coupled extension of the lattice is posed, which is a common discrete version of both the coupled KdV and coupled mKdV systems. Some rational expansions of the Jacobian elliptic, trigonometric and hyperbolic functions are used to construct cnoidal waves, negaton and positon solutions of the discrete coupled system

On the conservation laws and solutions of a (2+1) dimensional KdV-mKdV equation of mathematical physics

Science.gov (United States)

Motsepa, Tanki; Masood Khalique, Chaudry

2018-05-01

In this paper, we study a (2+1) dimensional KdV-mKdV equation, which models many physical phenomena of mathematical physics. This equation has two integral terms in it. By an appropriate substitution, we convert this equation into two partial differential equations, which do not have integral terms and are equivalent to the original equation. We then work with the system of two equations and obtain its exact travelling wave solutions in form of Jacobi elliptic functions. Furthermore, we employ the multiplier method to construct conservation laws for the system. Finally, we revert the results obtained into the original variables of the (2+1) dimensional KdV-mKdV equation.

Bilinear approach to Kuperschmidt super-KdV type equations

Science.gov (United States)

Babalic, Corina N.; Carstea, A. S.

2018-06-01

Hirota bilinear form and soliton solutions for the super-KdV (Korteweg–de Vries) equation of Kuperschmidt (Kuper–KdV) are given. It is shown that even though the collision of supersolitons is more complicated than in the case of the supersymmetric KdV equation of Manin–Radul, the asymptotic effect of the interaction is simpler. As a physical application it is shown that the well-known FPU problem, having a phonon-mediated interaction of some internal degrees of freedom expressed through Grassmann fields, transforms to the Kuper–KdV equation in a multiple-scale approach.

A Note on the Semi-Inverse Method and a Variational Principle for the Generalized KdV-mKdV Equation

Directory of Open Access Journals (Sweden)

Li Yao

2013-01-01

Full Text Available Ji-Huan He systematically studied the inverse problem of calculus of variations. This note reveals that the semi-inverse method also works for a generalized KdV-mKdV equation with nonlinear terms of any orders.

Division algebras and extended super KdVs

International Nuclear Information System (INIS)

Toppan, F.

2001-05-01

The division algebras R, C, H, O are used to construct and analyze the N = 1, 2, 4, 8 supersymmetric extensions of the KdV hamiltonian equation. In particular a global N = 8 super-KdV system is introduced and shown to admit a Poisson bracket structure given by the 'Non-Associate N = 8 Superconformal Algebra'. (author)

Variational iteration method for solving coupled-KdV equations

International Nuclear Information System (INIS)

Assas, Laila M.B.

2008-01-01

In this paper, the He's variational iteration method is applied to solve the non-linear coupled-KdV equations. This method is based on the use of Lagrange multipliers for identification of optimal value of a parameter in a functional. This technique provides a sequence of functions which converge to the exact solution of the coupled-KdV equations. This procedure is a powerful tool for solving coupled-KdV equations

ELB-trees an efficient and lock-free B-tree derivative

DEFF Research Database (Denmark)

Bonnichsen, Lars Frydendal; Karlsson, Sven; Probst, Christian W.

2013-01-01

overhead. All lock-free data structures are based on simple atomic operations that, though supported by modern processors, are expensive in execution time. We present a lock-free data structure, ELB-trees, which under certain assumptions can be used as multimaps as well as priority queues. Specifically...... it cannot store duplicate key-value pairs, and it is not linearizable. Compared to existing data structures, ELB-trees require fewer atomic operations leading to improved performance. We measure the parallel performance of ELB-trees using a set of benchmarks and observe that ELB-trees are up to almost 30......As computer systems scale in the number of processors, scalable data structures with good parallel performance become increasingly important. Lock-free data structures promise such improved parallel performance at the expense of higher algorithmic complexity and higher sequential execution time...

Conditional Stability of Solitary-Wave Solutions for Generalized Compound KdV Equation and Generalized Compound KdV-Burgers Equation

International Nuclear Information System (INIS)

Zhang Weiguo; Dong Chunyan; Fan Engui

2006-01-01

In this paper, we discuss conditional stability of solitary-wave solutions in the sense of Liapunov for the generalized compound KdV equation and the generalized compound KdV-Burgers equations. Linear stability of the exact solitary-wave solutions is proved for the above two types of equations when the small disturbance of travelling wave form satisfies some special conditions.

Solving (1,q) KdV gravity

International Nuclear Information System (INIS)

Montano, D.; Rivlis, G.

1991-01-01

In this paper we explicitly compute the correlation functions of the (1, q) series of the KdV hierarchy, i.e. models with q-1 primary fields. We also find from algebraic considerations a ghost number conservation law for the (1, q) models. All the results in this paper follow from the algebraic properties of the KdV hierarchy without using any extraneous information from a field theory interpretation. We find the interesting result that some correlation functions vanish even when they conserve ghost number. This is an indication for further selection rules. (orig.)

Distribution coefficient Kd in surface soils collected in Aomori prefecture

International Nuclear Information System (INIS)

Tsukada, Hirofumi; Hasegawa, Hidenao; Hisamatsu, Shun'ichi; Inaba, Jiro

2000-01-01

Soil-solution distribution coefficients (Kds), which are the ratio of an element concentration in a soil solid phase to that in a solution phase, for 32 elements in Andosols, Wet Andosols and Gleyed Andosols collected throughout Aomori Prefecture were determined. A dried soil sample was mixed with a 10-fold amount of pure water in a PPCO centrifuge tube, and then gently shaken for 24 h. The Kd values were obtained by measurement of element concentrations in solid and solution phases (batch method). The Kd values in this work were up to three orders of magnitude higher than the IAEA reported values, and their 95% confidence intervals were within two orders of magnitude. Most Kd values of elements were decreasing with increasing electrical conductivity of the solution phase. The Kd of Ca had a good correlation with that of Sr. However, the correlation between the Kds of K and Cs was not good. The Kd values were also determined by another method. The soil solutions were separated from the fresh soil samples by means of high speed centrifuging. The Kd values were calculated from the element concentration in solid phase and soil solution (centrifugation method). The Kd values obtained by the centrifugation method agreed within one order of magnitude with those by the batch method, and both variation patterns in elements correlated well. (author)

Nonholonomic deformation of generalized KdV-type equations

International Nuclear Information System (INIS)

Guha, Partha

2009-01-01

Karasu-Kalkani et al (2008 J. Math. Phys. 49 073516) recently derived a new sixth-order wave equation KdV6, which was shown by Kupershmidt (2008 Phys. Lett. 372A 2634) to have an infinite commuting hierarchy with a common infinite set of conserved densities. Incidentally, this equation was written for the first time by Calogero and is included in the book by Calogero and Degasperis (1982 Lecture Notes in Computer Science vol 144 (Amsterdam: North-Holland) p 516). In this paper, we give a geometric insight into the KdV6 equation. Using Kirillov's theory of coadjoint representation of the Virasoro algebra, we show how to obtain a large class of KdV6-type equations equivalent to the original equation. Using a semidirect product extension of the Virasoro algebra, we propose the nonholonomic deformation of the Ito equation. We also show that the Adler-Kostant-Symes scheme provides a geometrical method for constructing nonholonomic deformed integrable systems. Applying the Adler-Kostant-Symes scheme to loop algebra, we construct a new nonholonomic deformation of the coupled KdV equation.

Parallel object-oriented decision tree system

Science.gov (United States)

Kamath,; Chandrika, Cantu-Paz [Dublin, CA; Erick, [Oakland, CA

2006-02-28

A data mining decision tree system that uncovers patterns, associations, anomalies, and other statistically significant structures in data by reading and displaying data files, extracting relevant features for each of the objects, and using a method of recognizing patterns among the objects based upon object features through a decision tree that reads the data, sorts the data if necessary, determines the best manner to split the data into subsets according to some criterion, and splits the data.

Shade Trees Spatial Distribution and Its Effect on Grains and Beverage Quality of Shaded Coffee Trees

Directory of Open Access Journals (Sweden)

Francisco José da Silva Neto

2018-01-01

Full Text Available Shading coffee trees has gained importance, especially among smallholders, as an option to improve the products’ quality, therefore acquiring place at the specialty coffee market, where consumers are willing to give bonus for quality. This work aims to evaluate the influence of shade trees’ spatial distribution among coffee trees’ agronomic characteristics, yield, and beans and cup quality of shaded coffee trees. The experimental design consisted of completely randomized blocks with six repetitions and four treatments: coffee trees on shade trees planting rows, distant one meter from the trunk; coffee trees on shade trees planting row, distant six meters from the trunk; and coffee plants between the rows of shade trees, parallel to the previous treatments. The parameters analyzed were plant height, canopy diameter, plagiotropic branches’ length, yield, coffee fruits’ phenological stage, ripe cherries’ Brix degree, percentage of black, unripe, and insect damaged beans, bean size, and beverage quality. Shade trees quickened coffee fruits’ phenological stage of coffee trees nearest to them. This point also showed the best beverage quality, except for overripe fruits. The remaining parameters evaluated were not affected by shade trees’ spatial distribution.

Motion of curves and solutions of two multi-component mKdV equations

International Nuclear Information System (INIS)

Yao Ruoxia; Qu Changzheng; Li Zhibin

2005-01-01

Two classes of multi-component mKdV equations have been shown to be integrable. One class called the multi-component geometric mKdV equation is exactly the system for curvatures of curves when the motion of the curves is governed by the mKdV flow. In this paper, exact solutions including solitary wave solutions of the two- and three-component mKdV equations are obtained, the symmetry reductions of the two-component geometric mKdV equation to ODE systems corresponding to it's Lie point symmetry groups are also given. Curves and their behavior corresponding to solitary wave solutions of the two-component geometric mKdV equation are presented

Over-expression of KdSOC1 gene affected plantlet morphogenesis in Kalanchoe daigremontiana.

Science.gov (United States)

Zhu, Chen; Wang, Li; Chen, Jinhua; Liu, Chenglan; Zeng, Huiming; Wang, Huafang

2017-07-17

Kalanchoe daigremontiana reproduces asexually by producing plantlets along the leaf margin. The aim of this study was to identify the function of the SUPPRESSOR OF OVEREXPRESSION OF CONSTANS 1 gene in Kalanchoe daigremontiana (KdSOC1) during plantlet morphogenesis. In this study, KdSOC1 gene expression was detected at stem cell niche during in vitro somatic embryogenesis and plantlet morphogenesis. Disrupting endogenous auxin transportation suppressed the KdSOC1 gene response. Knockdown of the KdSOC1 gene caused a defect in cotyledon formation during the early heart stage of somatic embryogenesis. Over-expression (OE) of the KdSOC1 gene resulted in asymmetric plantlet distribution, a reduced number of plantlets, thicker leaves, and thicker vascular fibers. Higher KdPIN1 gene expression and auxin content were found in OE plant compared to those of wild-type plant leaves, which indicated possible KdSOC1 gene role in affecting auxin distribution and accumulation. KdSOC1 gene OE in DR5-GUS Arabidopsis reporting lines resulted in an abnormal auxin response pattern during different stages of somatic embryogenesis. In summary, the KdSOC1 gene OE might alter auxin distribution and accumulation along leaf margin to initiate plantlet formation and distribution, which is crucial for plasticity during plantlet formation under various environmental conditions.

The integrability of an extended fifth-order KdV equation with Riccati ...

Indian Academy of Sciences (India)

method was extended to investigate variable coefficient NLEEs, which included gener- alized KdV equation, generalized modified KdV equation and generalized Boussinesq equation [11,12]. It is well known that KdV equation models a variety of nonlinear phenomena, including ion-acoustic waves in plasmas and shallow ...

A novel noncommutative KdV-type equation, its recursion operator, and solitons

Science.gov (United States)

Carillo, Sandra; Lo Schiavo, Mauro; Porten, Egmont; Schiebold, Cornelia

2018-04-01

A noncommutative KdV-type equation is introduced extending the Bäcklund chart in Carillo et al. [Symmetry Integrability Geom.: Methods Appl. 12, 087 (2016)]. This equation, called meta-mKdV here, is linked by Cole-Hopf transformations to the two noncommutative versions of the mKdV equations listed in Olver and Sokolov [Commun. Math. Phys. 193, 245 (1998), Theorem 3.6]. For this meta-mKdV, and its mirror counterpart, recursion operators, hierarchies, and an explicit solution class are derived.

Extended N=2 supersymmetric matrix (1, s)-KdV hierarchies

International Nuclear Information System (INIS)

Krivonos, S.O.; Sorin, A.S.

1997-01-01

We propose the Lax operators for N=2 supersymmetric matrix generalization of the bosonic (1, s)-KdV hierarchies. The simplest examples - the N=2 supersymmetric a=4 KdV and a=5/2 Boussinesq hierarchies - are discussed in detail

A Super mKdV Equation: Bosonization, Painlevé Property and Exact Solutions

Science.gov (United States)

Ren, Bo; Lou, Sen-Yue

2018-04-01

The symmetry of the fermionic field is obtained by means of the Lax pair of the mKdV equation. A new super mKdV equation is constructed by virtue of the symmetry of the fermionic form. The super mKdV system is changed to a system of coupled bosonic equations with the bosonization approach. The bosonized SmKdV (BSmKdV) equation admits Painlevé property by the standard singularity analysis. The traveling wave solutions of the BSmKdV system are presented by the mapping and deformation method. We also provide other ideas to construct new super integrable systems. Supported by the National Natural Science Foundation of China under Grant Nos. 11775146, 11435005, and 11472177, Shanghai Knowledge Service Platform for Trustworthy Internet of Things under Grant No. ZF1213 and K. C. Wong Magna Fund in Ningbo University

Evaluation of images in a DR system (KD-1000) with new photostimulable phosphors

International Nuclear Information System (INIS)

Yoshita, Hisashi; Kuranishi, Makoto; Nakamura, Mamoru; Kato, Syosuke; Matsui, Mitate.

1994-01-01

The Konica Direct Digitizer KD-1000 is a compact chest acquisition unit in digital radiography. The KD-1000 system uses a photostimulable phosphor detector (RbBr: Tl) and directly converts X-ray quantum into digitized information. We have studied the physical characteristics of the KD-1000, which consists of input-output relationship, spatial resolution and noise. Additionally, we have made a comparison of visual detectability between images from the KD-1000 system and those from a film/screen system (KO-380/HRL), which is used for chest radiography. We have quantified these basic characteristics and established the advantage of the KD-1000 system. (author)

Evaluation of images in a DR system (KD-1000) with new photostimulable phosphors

Energy Technology Data Exchange (ETDEWEB)

Yoshita, Hisashi; Kuranishi, Makoto; Nakamura, Mamoru; Kato, Syosuke (Toyama Medical and Pharmaceutical Univ. (Japan). Hospital); Matsui, Mitate

1994-01-01

The Konica Direct Digitizer KD-1000 is a compact chest acquisition unit in digital radiography. The KD-1000 system uses a photostimulable phosphor detector (RbBr: Tl) and directly converts X-ray quantum into digitized information. We have studied the physical characteristics of the KD-1000, which consists of input-output relationship, spatial resolution and noise. Additionally, we have made a comparison of visual detectability between images from the KD-1000 system and those from a film/screen system (KO-380/HRL), which is used for chest radiography. We have quantified these basic characteristics and established the advantage of the KD-1000 system. (author).

Autumn Algorithm-Computation of Hybridization Networks for Realistic Phylogenetic Trees.

Science.gov (United States)

Huson, Daniel H; Linz, Simone

2018-01-01

A minimum hybridization network is a rooted phylogenetic network that displays two given rooted phylogenetic trees using a minimum number of reticulations. Previous mathematical work on their calculation has usually assumed the input trees to be bifurcating, correctly rooted, or that they both contain the same taxa. These assumptions do not hold in biological studies and "realistic" trees have multifurcations, are difficult to root, and rarely contain the same taxa. We present a new algorithm for computing minimum hybridization networks for a given pair of "realistic" rooted phylogenetic trees. We also describe how the algorithm might be used to improve the rooting of the input trees. We introduce the concept of "autumn trees", a nice framework for the formulation of algorithms based on the mathematics of "maximum acyclic agreement forests". While the main computational problem is hard, the run-time depends mainly on how different the given input trees are. In biological studies, where the trees are reasonably similar, our parallel implementation performs well in practice. The algorithm is available in our open source program Dendroscope 3, providing a platform for biologists to explore rooted phylogenetic networks. We demonstrate the utility of the algorithm using several previously studied data sets.

Bihamiltonian Cohomology of KdV Brackets

NARCIS (Netherlands)

Carlet, G.; Posthuma, H.; Shadrin, S.

2016-01-01

Using spectral sequences techniques we compute the bihamiltonian cohomology groups of the pencil of Poisson brackets of dispersionless KdV hierarchy. In particular, this proves a conjecture of Liu and Zhang about the vanishing of such cohomology groups.

Interactions of Soliton Waves for a Generalized Discrete KdV Equation

International Nuclear Information System (INIS)

Zhou Tong; Zhu Zuo-Nong

2017-01-01

It is well known that soliton interactions in discrete integrable systems often possess new properties which are different from the continuous integrable systems, e.g., we found that there are such discrete solitons in a semidiscrete integrable system (the time variable is continuous and the space one is discrete) that the shorter solitary waves travel faster than the taller ones. Very recently, this kind of soliton was also observed in a full discrete generalized KdV system (the both of time and space variables are discrete) introduced by Kanki et al. In this paper, for the generalized discrete KdV (gdKdV) equation, we describe its richer structures of one-soliton solutions. The interactions of two-soliton waves to the gdKdV equation are studied. Some new features of the soliton interactions are proposed by rigorous theoretical analysis. (paper)

GSHR-Tree: a spatial index tree based on dynamic spatial slot and hash table in grid environments

Science.gov (United States)

Chen, Zhanlong; Wu, Xin-cai; Wu, Liang

2008-12-01

Computation Grids enable the coordinated sharing of large-scale distributed heterogeneous computing resources that can be used to solve computationally intensive problems in science, engineering, and commerce. Grid spatial applications are made possible by high-speed networks and a new generation of Grid middleware that resides between networks and traditional GIS applications. The integration of the multi-sources and heterogeneous spatial information and the management of the distributed spatial resources and the sharing and cooperative of the spatial data and Grid services are the key problems to resolve in the development of the Grid GIS. The performance of the spatial index mechanism is the key technology of the Grid GIS and spatial database affects the holistic performance of the GIS in Grid Environments. In order to improve the efficiency of parallel processing of a spatial mass data under the distributed parallel computing grid environment, this paper presents a new grid slot hash parallel spatial index GSHR-Tree structure established in the parallel spatial indexing mechanism. Based on the hash table and dynamic spatial slot, this paper has improved the structure of the classical parallel R tree index. The GSHR-Tree index makes full use of the good qualities of R-Tree and hash data structure. This paper has constructed a new parallel spatial index that can meet the needs of parallel grid computing about the magnanimous spatial data in the distributed network. This arithmetic splits space in to multi-slots by multiplying and reverting and maps these slots to sites in distributed and parallel system. Each sites constructs the spatial objects in its spatial slot into an R tree. On the basis of this tree structure, the index data was distributed among multiple nodes in the grid networks by using large node R-tree method. The unbalance during process can be quickly adjusted by means of a dynamical adjusting algorithm. This tree structure has considered the

KdV hierarchy via Abelian coverings and operator identities

OpenAIRE

Eichinger, Benjamin; VandenBoom, Tom; Yuditskii, Peter

2018-01-01

We establish precise spectral criteria for potential functions $V$ of reflectionless Schr\\"odinger operators $L_V = -\\partial_x^2 + V$ to admit solutions to the Korteweg de-Vries (KdV) hierarchy with $V$ as an initial value. More generally, our methods extend the classical study of algebro-geometric solutions for the KdV hierarchy to noncompact Riemann surfaces by defining generalized Abelian integrals and analogues of the Baker-Akhiezer function on infinitely connected domains with a uniform...

Completion of proteomic data sets by Kd measurement using cell-free synthesis of site-specifically labeled proteins.

Directory of Open Access Journals (Sweden)

Paul Majkut

Full Text Available The characterization of phosphotyrosine mediated protein-protein interactions is vital for the interpretation of downstream pathways of transmembrane signaling processes. Currently however, there is a gap between the initial identification and characterization of cellular binding events by proteomic methods and the in vitro generation of quantitative binding information in the form of equilibrium rate constants (Kd values. In this work we present a systematic, accelerated and simplified approach to fill this gap: using cell-free protein synthesis with site-specific labeling for pull-down and microscale thermophoresis (MST we were able to validate interactions and to establish a binding hierarchy based on Kd values as a completion of existing proteomic data sets. As a model system we analyzed SH2-mediated interactions of the human T-cell phosphoprotein ADAP. Putative SH2 domain-containing binding partners were synthesized from a cDNA library using Expression-PCR with site-specific biotinylation in order to analyze their interaction with fluorescently labeled and in vitro phosphorylated ADAP by pull-down. On the basis of the pull-down results, selected SH2's were subjected to MST to determine Kd values. In particular, we could identify an unexpectedly strong binding of ADAP to the previously found binding partner Rasa1 of about 100 nM, while no evidence of interaction was found for the also predicted SH2D1A. Moreover, Kd values between ADAP and its known binding partners SLP-76 and Fyn were determined. Next to expanding data on ADAP suggesting promising candidates for further analysis in vivo, this work marks the first Kd values for phosphotyrosine/SH2 interactions on a phosphoprotein level.

Parallel External Memory Graph Algorithms

DEFF Research Database (Denmark)

Arge, Lars Allan; Goodrich, Michael T.; Sitchinava, Nodari

2010-01-01

In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one o f the private-cache chip multiprocessor (CMP) models. We study the fundamental problem of list ranking which leads to efficient solutions to problems on trees, such as computing lowest...... an optimal speedup of ¿(P) in parallel I/O complexity and parallel computation time, compared to the single-processor external memory counterparts....

Rogue periodic waves of the modified KdV equation

Science.gov (United States)

Chen, Jinbing; Pelinovsky, Dmitry E.

2018-05-01

Rogue periodic waves stand for rogue waves on a periodic background. Two families of travelling periodic waves of the modified Korteweg–de Vries (mKdV) equation in the focusing case are expressed by the Jacobian elliptic functions dn and cn. By using one-fold and two-fold Darboux transformations of the travelling periodic waves, we construct new explicit solutions for the mKdV equation. Since the dn-periodic wave is modulationally stable with respect to long-wave perturbations, the new solution constructed from the dn-periodic wave is a nonlinear superposition of an algebraically decaying soliton and the dn-periodic wave. On the other hand, since the cn-periodic wave is modulationally unstable with respect to long-wave perturbations, the new solution constructed from the cn-periodic wave is a rogue wave on the cn-periodic background, which generalizes the classical rogue wave (the so-called Peregrine’s breather) of the nonlinear Schrödinger equation. We compute the magnification factor for the rogue cn-periodic wave of the mKdV equation and show that it remains constant for all amplitudes. As a by-product of our work, we find explicit expressions for the periodic eigenfunctions of the spectral problem associated with the dn and cn periodic waves of the mKdV equation.

HAlign-II: efficient ultra-large multiple sequence alignment and phylogenetic tree reconstruction with distributed and parallel computing.

Science.gov (United States)

Wan, Shixiang; Zou, Quan

2017-01-01

Multiple sequence alignment (MSA) plays a key role in biological sequence analyses, especially in phylogenetic tree construction. Extreme increase in next-generation sequencing results in shortage of efficient ultra-large biological sequence alignment approaches for coping with different sequence types. Distributed and parallel computing represents a crucial technique for accelerating ultra-large (e.g. files more than 1 GB) sequence analyses. Based on HAlign and Spark distributed computing system, we implement a highly cost-efficient and time-efficient HAlign-II tool to address ultra-large multiple biological sequence alignment and phylogenetic tree construction. The experiments in the DNA and protein large scale data sets, which are more than 1GB files, showed that HAlign II could save time and space. It outperformed the current software tools. HAlign-II can efficiently carry out MSA and construct phylogenetic trees with ultra-large numbers of biological sequences. HAlign-II shows extremely high memory efficiency and scales well with increases in computing resource. THAlign-II provides a user-friendly web server based on our distributed computing infrastructure. HAlign-II with open-source codes and datasets was established at http://lab.malab.cn/soft/halign.

Solid/liquid partition coefficients (Kd) for selected soils and sediments at Forsmark and Laxemar-Simpevarp

Energy Technology Data Exchange (ETDEWEB)

Sheppard, Steve; Long, Jeff; Sanipelli, Barb [ECOMatters Inc., Pinawa (Canada); Sohlenius, Gustav [Geological Survey of Sweden (SGU), Uppsala (Sweden)

2009-03-15

Soil and sediment solid/liquid partition coefficients (Kd) are used to indicate the relative mobility of radionuclides and elements of concern from nuclear fuel waste, as well as from other sources. The Kd data are inherently extremely variable, but also vary systematically with key environmental attributes. For soil Kd, the key variables are pH, clay content and organic carbon content. For sediment Kd, water type (freshwater versus marine) and sediment type (benthic versus suspended) are important. This report summarized Kd data for soils and sediments computed from indigenous stable element concentrations measured at the Forsmark and Laxemar-Simpevarp sites. These were then compared to several literature sources of Kd data for Ce, Cl, Co, Cr, Cs, Fe, Ho, I, La, Mn, Mo, Nb, Nd, Ni, Np, Pa, Pb, Pu, Ra, Sb, Se, Sm, Sn, Sr, Tc, Th, Tm, U and Yb. The Kd data computed from indigenous stable element concentrations may be especially relevant for assessment of long-lived radionuclides from deep disposal of waste, because the long time frame for the potential releases is more consistent with the steady state measured using indigenous stable elements. For almost every one of these elements in soils, a statistically meaningful regression equation was developed to allow estimation of Kd for any soil given a modest amount of information about the soil. Nonetheless, the median residual geometric standard deviation (GSD) was 4.3-fold, implying confidence bounds of about 18-fold above and below the best estimate Kd. For sediment, the values are categorised simply by water type and sediment type. The median GSD for sediment Kd as measured at the Forsmark and Laxemar-Simpevarp sites was 2.5-fold, but the median GSD among literature values was as high as 8.6-fold. Clearly, there remains considerable uncertainty in Kd values, and it is important to account for this in assessment applications

Solid/liquid partition coefficients (Kd) for selected soils and sediments at Forsmark and Laxemar-Simpevarp

International Nuclear Information System (INIS)

Sheppard, Steve; Long, Jeff; Sanipelli, Barb; Sohlenius, Gustav

2009-03-01

Soil and sediment solid/liquid partition coefficients (Kd) are used to indicate the relative mobility of radionuclides and elements of concern from nuclear fuel waste, as well as from other sources. The Kd data are inherently extremely variable, but also vary systematically with key environmental attributes. For soil Kd, the key variables are pH, clay content and organic carbon content. For sediment Kd, water type (freshwater versus marine) and sediment type (benthic versus suspended) are important. This report summarized Kd data for soils and sediments computed from indigenous stable element concentrations measured at the Forsmark and Laxemar-Simpevarp sites. These were then compared to several literature sources of Kd data for Ce, Cl, Co, Cr, Cs, Fe, Ho, I, La, Mn, Mo, Nb, Nd, Ni, Np, Pa, Pb, Pu, Ra, Sb, Se, Sm, Sn, Sr, Tc, Th, Tm, U and Yb. The Kd data computed from indigenous stable element concentrations may be especially relevant for assessment of long-lived radionuclides from deep disposal of waste, because the long time frame for the potential releases is more consistent with the steady state measured using indigenous stable elements. For almost every one of these elements in soils, a statistically meaningful regression equation was developed to allow estimation of Kd for any soil given a modest amount of information about the soil. Nonetheless, the median residual geometric standard deviation (GSD) was 4.3-fold, implying confidence bounds of about 18-fold above and below the best estimate Kd. For sediment, the values are categorised simply by water type and sediment type. The median GSD for sediment Kd as measured at the Forsmark and Laxemar-Simpevarp sites was 2.5-fold, but the median GSD among literature values was as high as 8.6-fold. Clearly, there remains considerable uncertainty in Kd values, and it is important to account for this in assessment applications

Division algebras and extended N = 2, 4, 8 super KdVs

International Nuclear Information System (INIS)

Carrion, H.L.; Rojas, M.; Toppan, F.

2001-09-01

The first example of an N = 8 supersymmetric extension of the KdV equation is here explicitly constructed. It involves 8 bosonic and 8 fermionic fields. It corresponds to the unique N = 8 solution based a generalized hamiltonian dynamics with (generalized) Poisson brackets given by the Non-associate N = 8 Superconformal Algebra. The complete list of inequivalent classes of parametric-dependent N = 3 and N = 4 superKdVs obtained from the 'Non-associative N= 8 SCA' is also furnished. Furthermore, a fundamental domain characterizing the class of inequivalent N = 4 superKdVs based on the 'minimal N = 4 SCA' is given. (author)

The King-Devick (K-D) test and concussion diagnosis in semi-professional rugby union players.

Science.gov (United States)

Molloy, John H; Murphy, Ian; Gissane, Conor

2017-08-01

To determine the utility of the King-Devick (K-D) test in identifying sports-related concussion in semi-professional rugby players. Descriptive cohort study. 176 male players were recruited from a semi-professional rugby union competition in New Zealand (NZ). Baseline K-D scores were obtained in the pre-season. Post-match K-D and Pitch Side Concussion Assessment Version 2 (PSCA2) scores were obtained in those with suspected concussion. Post-match K-D scores were also administered to selected control players. 19 concussions in 18 players were analysed. In addition, 33 controls were used for analysis. A positive K-D test was identified in 53% of players with concussion post-match. Conversely, a positive test was identified in 33% of controls. The sensitivity and specificity of the K-D test was calculated as 53% and 69% respectively. The positive predictive value and negative predictive value was 48% and 73% respectively. The PSCA2 correctly identified 74% of concussions. The K-D test identified 3 cases not identified by the PSCA2. When the PSCA2 and K-D were combined, 89% of concussions were correctly identified. The K-D test does not appear to be effective if used as a stand-alone test for the diagnosis of concussion. However, if used alongside current side-line cognitive and balance tests, it may assist in more accurately diagnosing sports-related concussion. Further research should look to utilise the K-D test in in-match protocols to establish if this improves the diagnostic accuracy of in-match protocols for sports-related concussion. Copyright © 2017 Sports Medicine Australia. Published by Elsevier Ltd. All rights reserved.

New binary travelling-wave periodic solutions for the modified KdV equation

International Nuclear Information System (INIS)

Yan Zhenya

2008-01-01

In this Letter, the modified Korteweg-de Vries (mKdV) equations with the focusing (+) and defocusing (-) branches are investigated, respectively. Many new types of binary travelling-wave periodic solutions are obtained for the mKdV equation in terms of Jacobi elliptic functions such as sn(ξ,m)cn(ξ,m)dn(ξ,m) and their extensions. Moreover, we analyze asymptotic properties of some solutions. In addition, with the aid of the Miura transformation, we also give the corresponding binary travelling-wave periodic solutions of KdV equation

Generalized Miura transformations, two-bosons KP hierarchies and their reduction to KdV hierarchies

International Nuclear Information System (INIS)

Aratyn, H.; Ferreira, L.A.; Gomes, J.F.; Medeiros, R.T.; Zimerman, A.H.

1993-02-01

Bracket preserving gauge equivalence is established between several two-boson generated KP type of hierarchies. These KP hierarchies reduce under symplectic reduction (via Dirac constraints) to KdV and Schwarzian KdV hierarchies. Under this reduction the gauge equivalence is taking form of the conventional Miura maps between the above KdV type of hierarchies. (author). 16 refs

Generalized Miura transformations, two-bosons KP hierarchies and their reduction to KdV hierarchies

Energy Technology Data Exchange (ETDEWEB)

Aratyn, H. [Illinois Univ., Chicago, IL (United States). Dept. of Physics; Ferreira, L.A.; Gomes, J.F.; Medeiros, R.T.; Zimerman, A.H.

1993-02-01

Bracket preserving gauge equivalence is established between several two-boson generated KP type of hierarchies. These KP hierarchies reduce under symplectic reduction (via Dirac constraints) to KdV and Schwarzian KdV hierarchies. Under this reduction the gauge equivalence is taking form of the conventional Miura maps between the above KdV type of hierarchies. (author). 16 refs.

The Primordial Soup Algorithm : a systematic approach to the specification of parallel parsers

NARCIS (Netherlands)

Janssen, Wil; Janssen, W.P.M.; Poel, Mannes; Sikkel, Nicolaas; Zwiers, Jakob

1992-01-01

A general framework for parallel parsing is presented, which allows for a unitied, systematic approach to parallel parsing. The Primordial Soup Algorithm creates trees by allowing partial parse trees to combine arbitrarily. By adding constraints to the general algorithm, a large, class of parallel

Key KdSOC1 gene expression profiles during plantlet morphogenesis under hormone, photoperiod, and drought treatments.

Science.gov (United States)

Liu, C; Zhu, C; Zeng, H M

2016-02-11

Kalanchoe daigremontiana utilizes plantlet formation between its zigzag leaf margins as its method of asexual reproduction. In this study, K. daigremontiana SUPPRESSOR OF OVEREXPRESSION OF CONSTANS 1 (KdSOC1), a key intermediate in the transition from vegetative to asexual growth, was cloned. Furthermore, its expression profiles during plantlet formation under different environmental and hormone induction conditions were analyzed. The full-KdSOC1 cDNA sequence length was 1410 bp with 70% shared homology with Carya cathayensis SOC1. The conserved domain search of KdSOC1 showed the absence of I and C domains, which might indicate novel biological functions in K. daigremontiana. The full-KdSOC1 promoter sequence was 1401 bp long and contained multiple-hormone-responsive cis-acting elements. Hormone induction assays showed that gibberellins and salicylic acid mainly regulated KdSOC1 expression. The swift change from low to high KdSOC1 expression levels during long-day induction was accompanied by the rapid emergence of plantlets. Drought stress stimulated KdSOC1 expression in leaves both with and without plantlet formation. Together, the results suggested that KdSOC1 was closely involved in environmental stimulation signal perception and the transduction of K. daigremontiana plantlet formation. Therefore, future identification of KdSOC1 functions might reveal key information that will help elucidate the transition network between embryogenesis and organogenesis during plantlet formation.

Significance Of 30 KD Protein As A Diagnostic Marker In CSF Of tuberculour Meningits

Directory of Open Access Journals (Sweden)

Kashyap R.S

2001-01-01

Full Text Available Tuberculous meningitis (TBM is a sub acute or chronic inflammation of the cerebral meninges caused by tubercule bacilli, the diagnosis for which is still very intricate. To establish a rapid diagnosis, we used Sodium dodecyl suplhate polyacrylamide gel electrophoresis (SDS-PAGE for the detection of marker protein in CSF specific to TBM patients. CSF was collected by standard lumbar puncture technique. Polyclonal antibody was raised against sonicated M.tuberculosis of H37RV in rabbit. 145 CSF samples were collected for this study over a period of two and half years which included 44 suspected and one proven case of TBM. In this communication we have investigated for a possible presence of a marker protein(s in cerebrospinal fluid (CSF of TBM patients. Two bands, a 30kd and a 14kd were detected. The 30kd band was observed in 92% cases of TBM patients. The 14kd band was not much of diagnostic importance since it was found in only about 45%. None of the control group patients had these protein bands. The 30 kd protein band either disappeared or became faint on anti-TB medication. To evaluate whether the eluted 30 kd protein was a mycobacterium tuberculosis product, gel retardation assay was also performed. The 30kd protein did not react with the polyclonal antisera. The CSF biochemical picture correlated well with the presence of this protein band. This study suggests that 30kd protein band observed in CSF is not a Mycobacterium product and is not only an important diagnostic marker for early diagnosis of TBM but may also be useful for monitoring the post treatment phase.

Distribution coefficients (Kd's) for use in risk assessment models of the Kara Sea.

Science.gov (United States)

Carroll, J; Boisson, F; Teyssie, J L; King, S E; Krosshavn, M; Carroll, M L; Fowler, S W; Povinec, P P; Baxter, M S

1999-07-01

As a prerequisite for most evaluations of radionuclide transport pathways in marine systems, it is necessary to obtain basic information on the sorption potential of contaminants onto particulate matter. Kd values for use in modeling radionuclide dispersion in the Kara Sea have been determined as part of several international programs addressing the problem of radioactive debris residing in Arctic Seas. Field and laboratory Kd experiments were conducted for the following radionuclides associated with nuclear waste: americium, europium, plutonium, cobalt, cesium and strontium. Emphasis has been placed on two regions in the Kara Sea: (i) the Novaya Zemlya Trough (NZT) and (ii) the mixing zones of the Ob and Yenisey Rivers (RMZ). Short-term batch Kd experiments were performed at-sea on ambient water column samples and on samples prepared both at-sea and in the laboratory by mixing filtered bottom water with small amounts of surficial bottom sediments (particle concentrations in samples = 1-30 mg/l). Within both regions, Kd values for individual radionuclides vary over two to three orders of magnitude. The relative particle affinities for radionuclides in the two regions are americium approximately equal to europium > plutonium > cobalt > cesium > strontium. The values determined in this study agree with minimum values given in the IAEA Technical Report [IAEA, 1985. Sediment Kd's and Concentration Factors for Radionuclides in the Marine Environment. Technical Report No. 247. International Atomic Energy Agency, Vienna.]. Given the importance of Kd's in assessments of critical transport pathways for radionuclide contaminants, we recommend that Kd ranges of values for specific elements rather than single mean values be incorporated into model simulations of radionuclide dispersion.

Solving the discrete KdV equation with homotopy analysis method

International Nuclear Information System (INIS)

Zou, L.; Zong, Z.; Wang, Z.; He, L.

2007-01-01

In this Letter, we apply the homotopy analysis method to differential-difference equations. We take the discrete KdV equation as an example, and successfully obtain double periodic wave solutions and solitary wave solutions. It illustrates the validity and the great potential of the homotopy analysis method in solving discrete KdV equation. Comparisons are made between the results of the proposed method and exact solutions. The results reveal that the proposed method is very effective and convenient

Hamiltonian structures and integrability for a discrete coupled KdV-type equation hierarchy

International Nuclear Information System (INIS)

Zhao Haiqiong; Zhu Zuonong; Zhang Jingli

2011-01-01

Coupled Korteweg-de Vries (KdV) systems have many important physical applications. By considering a 4 × 4 spectral problem, we derive a discrete coupled KdV-type equation hierarchy. Our hierarchy includes the coupled Volterra system proposed by Lou et al. (e-print arXiv: 0711.0420) as the first member which is a discrete version of the coupled KdV equation. We also investigate the integrability in the Liouville sense and the multi-Hamiltonian structures for the obtained hierarchy. (authors)

Dynamics of parallel robots from rigid bodies to flexible elements

CERN Document Server

Briot, Sébastien

2015-01-01

This book starts with a short recapitulation on basic concepts, common to any types of robots (serial, tree structure, parallel, etc.), that are also necessary for computation of the dynamic models of parallel robots. Then, as dynamics requires the use of geometry and kinematics, the general equations of geometric and kinematic models of parallel robots are given. After, it is explained that parallel robot dynamic models can be obtained by decomposing the real robot into two virtual systems: a tree-structure robot (equivalent to the robot legs for which all joints would be actuated) plus a free body corresponding to the platform. Thus, the dynamics of rigid tree-structure robots is analyzed and algorithms to obtain their dynamic models in the most compact form are given. The dynamic model of the real rigid parallel robot is obtained by closing the loops through the use of the Lagrange multipliers. The problem of the dynamic model degeneracy near singularities is treated and optimal trajectory planning for cro...

New analytical exact solutions of time fractional KdV-KZK equation by Kudryashov methods

Science.gov (United States)

S Saha, Ray

2016-04-01

In this paper, new exact solutions of the time fractional KdV-Khokhlov-Zabolotskaya-Kuznetsov (KdV-KZK) equation are obtained by the classical Kudryashov method and modified Kudryashov method respectively. For this purpose, the modified Riemann-Liouville derivative is used to convert the nonlinear time fractional KdV-KZK equation into the nonlinear ordinary differential equation. In the present analysis, the classical Kudryashov method and modified Kudryashov method are both used successively to compute the analytical solutions of the time fractional KdV-KZK equation. As a result, new exact solutions involving the symmetrical Fibonacci function, hyperbolic function and exponential function are obtained for the first time. The methods under consideration are reliable and efficient, and can be used as an alternative to establish new exact solutions of different types of fractional differential equations arising from mathematical physics. The obtained results are exhibited graphically in order to demonstrate the efficiencies and applicabilities of these proposed methods of solving the nonlinear time fractional KdV-KZK equation.

Fractional rate of degradation (kd) of starch in the rumen and its ...

African Journals Online (AJOL)

Fractional rate of degradation (kd) of fermentable nutrients in the rumen is an important parameter in modern feed evaluation systems based on mechanistic models. Estimates of kd for starch was obtained on 19 starch sources originating from barley, wheat, oat, maize and peas and treated in different ways both chemically ...

A motion of spacelike curves in the Minkowski 3-space and the KdV equation

International Nuclear Information System (INIS)

Ding Qing; Wang Wei; Wang Youde

2010-01-01

This Letter shows that soliton solutions to KdV equation describe a motion of spacelike curves in R 2,1 with initial data being suitably restricted. This gives a different geometric interpretation of KdV from that given recently by Musso and Nicolodi, and gives a unified geometric explanation for KdV and MKdV.

A method for estimating the diffuse attenuation coefficient (KdPAR)from paired temperature sensors

Science.gov (United States)

Read, Jordan S.; Rose, Kevin C.; Winslow, Luke A.; Read, Emily K.

2015-01-01

A new method for estimating the diffuse attenuation coefficient for photosynthetically active radiation (KdPAR) from paired temperature sensors was derived. We show that during cases where the attenuation of penetrating shortwave solar radiation is the dominant source of temperature changes, time series measurements of water temperatures at multiple depths (z1 and z2) are related to one another by a linear scaling factor (a). KdPAR can then be estimated by the simple equation KdPAR ln(a)/(z2/z1). A suggested workflow is presented that outlines procedures for calculating KdPAR according to this paired temperature sensor (PTS) method. This method is best suited for conditions when radiative temperature gains are large relative to physical noise. These conditions occur frequently on water bodies with low wind and/or high KdPARs but can be used for other types of lakes during time periods of low wind and/or where spatially redundant measurements of temperatures are available. The optimal vertical placement of temperature sensors according to a priori knowledge of KdPAR is also described. This information can be used to inform the design of future sensor deployments using the PTS method or for campaigns where characterizing sub-daily changes in temperatures is important. The PTS method provides a novel method to characterize light attenuation in aquatic ecosystems without expensive radiometric equipment or the user subjectivity inherent in Secchi depth measurements. This method also can enable the estimation of KdPAR at higher frequencies than many manual monitoring programs allow.

Vibrational modes of deuterium in KD2PO4

International Nuclear Information System (INIS)

Mizoguchi, Kohji; Agui, Akane; Tominaga, Yasunori; Nakai, Yusuke; Ikeda, Susumu.

1993-01-01

In order to study the deuteration effect in hydrogen-bonded compounds such as KH 2 PO 4 , hydrogen and deuterium modes in KH 2 PO 4 and K(D x H 1-x ) 2 PO 4 (x = 95 %) were investigated by means of inelastic neutron-scattering measurements over a wide energy range. By comparing Raman spectra of KH 2 PO 4 and KD 2 PO 4 with neutron-scattering spectra, the vibrational modes of deuterium and those of PO 4 tetrahedrons in the energy range of 30 < ε < 150 meV have been investigated. At least two deuterium modes have been found at 87 meV and 106 meV. (author)

Vertical diffuse attenuation coefficient (Kd) based optical ...

Indian Academy of Sciences (India)

R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22

primary productivity, water clarity and determination of euphotic depth. Image data of the .... 3.1 Pre-processing of the IRS-P3 MOS-B data. IRS-P3 MOS-B .... any wavelength or spectral band is defined as. Kd = 1/E(z)∗ ... to the shallow bottom.

Hodograph solutions of the dispersionless coupled KdV hierarchies, critical points and the Euler-Poisson-Darboux equation

International Nuclear Information System (INIS)

Konopelchenko, B; Alonso, L MartInez; Medina, E

2010-01-01

It is shown that the hodograph solutions of the dispersionless coupled KdV (dcKdV) hierarchies describe critical and degenerate critical points of a scalar function which obeys the Euler-Poisson-Darboux equation. Singular sectors of each dcKdV hierarchy are found to be described by solutions of higher genus dcKdV hierarchies. Concrete solutions exhibiting shock-type singularities are presented.

New analytical exact solutions of time fractional KdV–KZK equation by Kudryashov methods

International Nuclear Information System (INIS)

Saha Ray, S

2016-01-01

In this paper, new exact solutions of the time fractional KdV–Khokhlov–Zabolotskaya–Kuznetsov (KdV–KZK) equation are obtained by the classical Kudryashov method and modified Kudryashov method respectively. For this purpose, the modified Riemann–Liouville derivative is used to convert the nonlinear time fractional KdV–KZK equation into the nonlinear ordinary differential equation. In the present analysis, the classical Kudryashov method and modified Kudryashov method are both used successively to compute the analytical solutions of the time fractional KdV–KZK equation. As a result, new exact solutions involving the symmetrical Fibonacci function, hyperbolic function and exponential function are obtained for the first time. The methods under consideration are reliable and efficient, and can be used as an alternative to establish new exact solutions of different types of fractional differential equations arising from mathematical physics. The obtained results are exhibited graphically in order to demonstrate the efficiencies and applicabilities of these proposed methods of solving the nonlinear time fractional KdV–KZK equation. (paper)

Distributed Merge Trees

Energy Technology Data Exchange (ETDEWEB)

Morozov, Dmitriy; Weber, Gunther

2013-01-08

Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions. As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization. We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges.

Infinitely many conservation laws for the discrete KdV equation

International Nuclear Information System (INIS)

Rasin, Alexander G; Schiff, Jeremy

2009-01-01

Rasin and Hydon (2007 J. Phys. A: Math. Theor. 40 12763-73) suggested a way to construct an infinite number of conservation laws for the discrete KdV equation (dKdV), by repeated application of a certain symmetry to a known conservation law. It was not decided, however, whether the resulting conservation laws were distinct and nontrivial. In this paper we obtain the following results: (1) we give an alternative method to construct an infinite number of conservation laws using a discrete version of the Gardner transformation. (2) We give a direct proof that the conservation laws obtained by the method of Rasin and Hydon are indeed distinct and nontrivial. (3) We consider a continuum limit in which the dKdV equation becomes a first-order eikonal equation. In this limit the two sets of conservation laws become the same, and are evidently distinct and nontrivial. This proves the nontriviality of the conservation laws constructed by the Gardner method, and gives an alternative proof of the nontriviality of the conservation laws constructed by the method of Rasin and Hydon

The copying power of one-state tree transducers

DEFF Research Database (Denmark)

Engelfriet, Joost; Skyum, Sven

1982-01-01

One-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle “prime copying,” i.e., their class of output (string) languages is not closed under the operation L → {$(w$)f(n) short parallel w ε L, f(n) greater-or-equal, slanted 1}, where f is any integer function whose...... range contains numbers with arbitrarily large prime factors (such as a polynomial). The exact amount of nonclosure under these copying operations is established for several classes of input (tree) languages. These results are relevant to the extended definable (or, restricted parallel level) languages......, to the syntax-directed translation of context-free languages, and to the tree transducer hierarchy....

Exact travelling wave solutions of the (3+1)-dimensional mKdV-ZK ...

Indian Academy of Sciences (India)

In this paper, the new generalized (′/)-expansion method is executed to find the travelling wave solutions of the (3+1)-dimensional mKdV-ZK equation and the (1+1)-dimensional compound KdVB equation. The efficiency of this method for finding exact and travelling wave solutions has been demonstrated. It is shown ...

GRADSPMHD: A parallel MHD code based on the SPH formalism

Science.gov (United States)

Vanaverbeke, S.; Keppens, R.; Poedts, S.

2014-03-01

We present GRADSPMHD, a completely Lagrangian parallel magnetohydrodynamics code based on the SPH formalism. The implementation of the equations of SPMHD in the “GRAD-h” formalism assembles known results, including the derivation of the discretized MHD equations from a variational principle, the inclusion of time-dependent artificial viscosity, resistivity and conductivity terms, as well as the inclusion of a mixed hyperbolic/parabolic correction scheme for satisfying the ∇ṡB→ constraint on the magnetic field. The code uses a tree-based formalism for neighbor finding and can optionally use the tree code for computing the self-gravity of the plasma. The structure of the code closely follows the framework of our parallel GRADSPH FORTRAN 90 code which we added previously to the CPC program library. We demonstrate the capabilities of GRADSPMHD by running 1, 2, and 3 dimensional standard benchmark tests and we find good agreement with previous work done by other researchers. The code is also applied to the problem of simulating the magnetorotational instability in 2.5D shearing box tests as well as in global simulations of magnetized accretion disks. We find good agreement with available results on this subject in the literature. Finally, we discuss the performance of the code on a parallel supercomputer with distributed memory architecture. Catalogue identifier: AERP_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AERP_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 620503 No. of bytes in distributed program, including test data, etc.: 19837671 Distribution format: tar.gz Programming language: FORTRAN 90/MPI. Computer: HPC cluster. Operating system: Unix. Has the code been vectorized or parallelized?: Yes, parallelized using MPI. RAM: ˜30 MB for a

Locating hardware faults in a data communications network of a parallel computer

Science.gov (United States)

Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.

2010-01-12

Hardware faults location in a data communications network of a parallel computer. Such a parallel computer includes a plurality of compute nodes and a data communications network that couples the compute nodes for data communications and organizes the compute node as a tree. Locating hardware faults includes identifying a next compute node as a parent node and a root of a parent test tree, identifying for each child compute node of the parent node a child test tree having the child compute node as root, running a same test suite on the parent test tree and each child test tree, and identifying the parent compute node as having a defective link connected from the parent compute node to a child compute node if the test suite fails on the parent test tree and succeeds on all the child test trees.

Distribution Coefficient Kd of Cesium in Soils from Areas in Perak

International Nuclear Information System (INIS)

Azian Hashim; Mohd Suhaimi Hamzah; Shamsiah Abdul Rahman; Nazaratul Ashifa Abdullah Salim; Md Suhaimi Elias; Shakirah Shukor; Muhd Azfar Azman; Siti Aminah Omar

2015-01-01

This is the paper reports on the study of distribution coefficient or Kd value in soil collected from the Western of Perak, which is Manjung, Setiawan, and Lahat with two different depths using lab batch method. Particle sizes were analyzed using the conventional technique known as pipette method. pH of the sample were 2-3. Determinations for cesium were performed using Inductively Coupled Plasma-Mass (ICP-MS). From the results, distribution factor for cesium, Kd value, was found to be influenced by the particle size of soil. (author)

Adiabatic invariants of the extended KdV equation

Energy Technology Data Exchange (ETDEWEB)

Karczewska, Anna [Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Góra, Szafrana 4a, 65-246 Zielona Góra (Poland); Rozmej, Piotr, E-mail: p.rozmej@if.uz.zgora.pl [Institute of Physics, Faculty of Physics and Astronomy, University of Zielona Góra, Szafrana 4a, 65-246 Zielona Góra (Poland); Infeld, Eryk [National Centre for Nuclear Research, Hoża 69, 00-681 Warszawa (Poland); Rowlands, George [Department of Physics, University of Warwick, Coventry, CV4 7A (United Kingdom)

2017-01-30

When the Euler equations for shallow water are taken to the next order, beyond KdV, momentum and energy are no longer exact invariants. (The only one is mass.) However, adiabatic invariants (AI) can be found. When the KdV expansion parameters are zero, exact invariants are recovered. Existence of adiabatic invariants results from general theory of near-identity transformations (NIT) which allow us to transform higher order nonintegrable equations to asymptotically equivalent (when small parameters tend to zero) integrable form. Here we present a direct method of calculations of adiabatic invariants. It does not need a transformation to a moving reference frame nor performing a near-identity transformation. Numerical tests show that deviations of AI from constant values are indeed small. - Highlights: • We suggest a new and simple method for calculating adiabatic invariants of second order wave equations. • It is easy to use and we hope that it will be useful if published. • Interesting numerics included.

Explicit solutions to the semi-discrete modified KdV equation and motion of discrete plane curves

International Nuclear Information System (INIS)

Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

2012-01-01

We construct explicit solutions to continuous motion of discrete plane curves described by a semi-discrete potential modified KdV equation. Explicit formulas in terms of the τ function are presented. Bäcklund transformations of the discrete curves are also discussed. We finally consider the continuous limit of discrete motion of discrete plane curves described by the discrete potential modified KdV equation to motion of smooth plane curves characterized by the potential modified KdV equation. (paper)

Hyperbolic white noise functional solutions of Wick-type stochastic compound KdV-Burgers equations

International Nuclear Information System (INIS)

Han Xiu; Xie Yingchao

2009-01-01

Variable coefficient and Wick-type stochastic compound KdV-Burgers equations are investigated. By using white noise analysis, Hermite transform and the hyperbolic function method, we obtain a number of Wick versions of hyperbolic white noise functional solutions and hyperbolic function solutions for Wick-type stochastic and variable coefficient compound KdV-Burgers equations, respectively.

Formation of double layers: shocklike solutions of an mKdV-equation

International Nuclear Information System (INIS)

Raadu, M.A.; Chanteur, G.

1985-10-01

Small amplitude double layers (DLs) in a plasma with a suitable electron distribution may be identified with shocklike solutions of a modified Korteweg-deVries (mKdV) equation. A thought experiment for the formation of such DLs is specified to clarify the physical constraints and to demonstrate the emergence of a DL from an initial disturbance. A scattering formulation of the mKdV initial value problem may be diagonalised to give a pair of Schroedinger equations with a scattering potential satisfying the ordinary KdV equation. The initial value problem can then be treated using Khruslov's generalisation of the inverse scattering method which allows a difference in the asymptotic values of the potential. A necessary and sufficient condition for the emergence of a shocklike soliton (wave) train and of a finite number of isolated solitons may also be determined from the scattering properties of the initial potential. With 26 refs and 5 figures. (Author)

Flowering Trees

Indian Academy of Sciences (India)

Celtis tetrandra Roxb. of Ulmaceae is a moderately large handsome deciduous tree with green branchlets and grayish-brown bark. Leaves are simple with three to four secondary veins running parallel to the mid vein. Flowers are solitary, male, female and bisexual and inconspicuous. Fruit is berry-like, small and globose ...

Locating hardware faults in a parallel computer

Science.gov (United States)

Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.

2010-04-13

Locating hardware faults in a parallel computer, including defining within a tree network of the parallel computer two or more sets of non-overlapping test levels of compute nodes of the network that together include all the data communications links of the network, each non-overlapping test level comprising two or more adjacent tiers of the tree; defining test cells within each non-overlapping test level, each test cell comprising a subtree of the tree including a subtree root compute node and all descendant compute nodes of the subtree root compute node within a non-overlapping test level; performing, separately on each set of non-overlapping test levels, an uplink test on all test cells in a set of non-overlapping test levels; and performing, separately from the uplink tests and separately on each set of non-overlapping test levels, a downlink test on all test cells in a set of non-overlapping test levels.

Dissipative behavior of some fully non-linear KdV-type equations

Science.gov (United States)

Brenier, Yann; Levy, Doron

2000-03-01

The KdV equation can be considered as a special case of the general equation u t+f(u) x-δg(u xx) x=0, δ>0, where f is non-linear and g is linear, namely f( u)= u2/2 and g( v)= v. As the parameter δ tends to 0, the dispersive behavior of the KdV equation has been throughly investigated (see, e.g., [P.G. Drazin, Solitons, London Math. Soc. Lect. Note Ser. 85, Cambridge University Press, Cambridge, 1983; P.D. Lax, C.D. Levermore, The small dispersion limit of the Korteweg-de Vries equation, III, Commun. Pure Appl. Math. 36 (1983) 809-829; G.B. Whitham, Linear and Nonlinear Waves, Wiley/Interscience, New York, 1974] and the references therein). We show through numerical evidence that a completely different, dissipative behavior occurs when g is non-linear, namely when g is an even concave function such as g( v)=-∣ v∣ or g( v)=- v2. In particular, our numerical results hint that as δ→0 the solutions strongly converge to the unique entropy solution of the formal limit equation, in total contrast with the solutions of the KdV equation.

Anti-adipogenic effects of KD025 (SLx-2119), a ROCK2-specific inhibitor, in 3T3-L1 cells.

Science.gov (United States)

Diep, Duy Trong Vien; Hong, Kyungki; Khun, Triyeng; Zheng, Mei; Ul-Haq, Asad; Jun, Hee-Sook; Kim, Young-Bum; Chun, Kwang-Hoon

2018-02-06

Adipose tissue is a specialized organ that synthesizes and stores fat. During adipogenesis, Rho and Rho-associated kinase (ROCK) 2 are inactivated, which enhances the expression of pro-adipogenic genes and induces the loss of actin stress fibers. Furthermore, pan ROCK inhibitors enhance adipogenesis in 3T3-L1 cells. Here, we show that KD025 (formerly known as SLx-2119), a ROCK2-specific inhibitor, suppresses adipogenesis in 3T3-L1 cells partially through a ROCK2-independent mechanism. KD025 downregulated the expression of key adipogenic transcription factors PPARγ and C/EBPα during adipogenesis in addition to lipogenic factors FABP4 and Glut4. Interestingly, adipogenesis was blocked by KD025 during days 1~3 of differentiation; after differentiation terminated, lipid accumulation was unaffected. Clonal expansion occurred normally in KD025-treated cells. These results suggest that KD025 could function during the intermediate stage after clonal expansion. Data from depletion of ROCKs showed that KD025 suppressed cell differentiation partially independent of ROCK's activity. Furthermore, no further loss of actin stress fibers emerged in KD025-treated cells during and after differentiation compared to control cells. These results indicate that in contrast to the pro-adipogenic effect of pan-inhibitors, KD025 suppresses adipogenesis in 3T3-L1 cells by regulating key pro-adipogenic factors. This outcome further implies that KD025 could be a potential anti-adipogenic/obesity agent.

Dataflow Query Execution in a Parallel Main-Memory Environment

NARCIS (Netherlands)

Wilschut, A.N.; Apers, Peter M.G.

1991-01-01

The performance and characteristics of the execution of various join-trees on a parallel DBMS are studied. The results are a step in the direction of the design of a query optimization strategy that is fit for parallel execution of complex queries. Among others, synchronization issues are identified

New exact solutions to the generalized KdV equation with ...

Indian Academy of Sciences (India)

is reduced to an ordinary differential equation with constant coefficients ... Application to generalized KdV equation with generalized evolution ..... [12] P F Byrd and M D Friedman, Handbook of elliptic integrals for engineers and physicists.

N = 4 super KdV hierarchy in N = 4 and N = 2 superspaces

International Nuclear Information System (INIS)

Delduc, F.

1995-10-01

The results of further analysis of the integrability properties of the N = 4 supersymmetric KdV equation deduced earlier as a Hamiltonian flow on N 4 SU(2) superconformal algebra in the harmonic N = 4 superspace are presented. To make this equation and the relevant Hamiltonian structures more tractable, it is reformulated in the ordinary N = 4 and further in N = 2 superspaces. These results provide a strong evidence that the unique N = 4 SU(2) super KdV hierarchy exists. (author)

A Hybrid Shared-Memory Parallel Max-Tree Algorithm for Extreme Dynamic-Range Images

NARCIS (Netherlands)

Moschini, Ugo; Meijster, Arnold; Wilkinson, Michael

Max-trees, or component trees, are graph structures that represent the connected components of an image in a hierarchical way. Nowadays, many application fields rely on images with high-dynamic range or floating point values. Efficient sequential algorithms exist to build trees and compute

On the nonlinear stability of mKdV breathers

DEFF Research Database (Denmark)

Alejo Plana, Miguel Angel; Muñoz, Claudio

2012-01-01

Breather modes of the mKdV equation on the real line are known to be elastic under collisions with other breathers and solitons. This fact indicates very strong stability properties of breathers. In this communication we describe a rigorous, mathematical proof of the stability of breathers under ...

Dataflow Query Execution in a Parallel, Main-memory Environment

NARCIS (Netherlands)

Wilschut, A.N.; Apers, Peter M.G.

In this paper, the performance and characteristics of the execution of various join-trees on a parallel DBMS are studied. The results of this study are a step into the direction of the design of a query optimization strategy that is fit for parallel execution of complex queries. Among others,

The Lax operator approach for the Virasoro and the W-constraints in the generalized KdV hierarchy

International Nuclear Information System (INIS)

Panda, S.; Roy, S.

1992-08-01

We show directly in the Lax operator approach how the Virasoro and W-constraints on the τ-function arise in the p-reduced KP hierarchy or Generalized KdV hierarchy. In particular, we consider the KdV and the Boussinesq hierarchy to show that the Virasoro and the W-constraints follow from the string equation by expanding the ''additional symmetry'' operator in terms of the Lax operator. We also mention how this method could be generalized for higher KdV hierarchies. (author). 34 refs

The University Münster Model Surgery System for Orthognathic Surgery. Part II -- KD-MMS.

Science.gov (United States)

Ehmer, Ulrike; Joos, Ulrich; Ziebura, Thomas; Flieger, Stefanie; Wiechmann, Dirk

2013-01-04

Model surgery is an integral part of the planning procedure in orthognathic surgery. Most concepts comprise cutting the dental cast off its socket. The standardized spacer plates of the KD-MMS provide for a non-destructive, reversible and reproducible means of maxillary and/or mandibular plaster cast separation. In the course of development of the system various articulator types were evaluated with regard to their capability to provide a means of realizing the concepts comprised of the KD-MMS. Special attention was dedicated to the ability to perform three-dimensional displacements without cutting of plaster casts. Various utilities were developed to facilitate maxillary displacement in accordance to the planning. Objectives of this development comprised the ability to implement the values established in the course of two-dimensional ceph planning. The system - KD-MMS comprises a set of hardware components as well as a defined procedure. Essential hardware components are red spacer and blue mounting plates. The blue mounting plates replace the standard yellow SAM mounting elements. The red spacers provide for a defined leeway of 8 mm for three-dimensional movements. The non-destructive approach of the KD-MMS makes it possible to conduct different model surgeries with the same plaster casts as well as to restore the initial, pre-surgical situation at any time. Thereby, surgical protocol generation and gnathologic splint construction are facilitated. The KD-MMS hardware components in conjunction with the defined procedures are capable of increasing efficiency and accuracy of model surgery and splint construction. In cases where different surgical approaches need to be evaluated in the course of model surgery, a significant reduction of chair time may be achieved.

ERA: Efficient serial and parallel suffix tree construction for very long strings

KAUST Repository

Mansour, Essam; Allam, Amin; Skiadopoulos, Spiros G.; Kalnis, Panos

2011-01-01

The suffix tree is a data structure for indexing strings. It is used in a variety of applications such as bioinformatics, time series analysis, clustering, text editing and data compression. However, when the string and the resulting suffix tree

Constructing soliton solutions and super-bilinear form of lattice supersymmetric KdV equation

International Nuclear Information System (INIS)

Carstea, A S

2015-01-01

The Hirota bilinear form and multisoliton solution for semidiscrete and fully discrete (difference–difference) versions of the supersymmetric Korteweg–de Vries (KdV) equation found by Xue et al (2013 J. Phys. A: Math. Theor 46 502001) are presented. The solitonic interaction term displays a fermionic dressing factor as in the continuous supersymmetric case. Using bilinear equations it is also shown that a new integrable semidiscrete (and fully discrete) version of supersymmetric KdV can be constructed with a simpler bilinear form but a more complicated interaction dressing. Its continuum limit is also computed. (paper)

The King-Devick (K-D) test of rapid eye movements: a bedside correlate of disability and quality of life in MS.

Science.gov (United States)

Moster, Stephen; Wilson, James A; Galetta, Steven L; Balcer, Laura J

2014-08-15

We investigated the King-Devick (K-D) test of rapid number naming as a visual performance measure in a cohort of patients with multiple sclerosis (MS). In this cross-sectional study, 81 patients with MS and 20 disease-free controls from an ongoing study of visual outcomes underwent K-D testing. A test of rapid number naming, K-D requires saccadic eye movements as well as intact vision, attention and concentration. To perform the K-D test, participants are asked to read numbers aloud as quickly as possible from three test cards; the sum of the three test card times in seconds constitutes the summary score. High-contrast visual acuity (VA), low-contrast letter acuity (1.25% and 2.5% levels), retinal nerve fiber layer (RNFL) thickness by optical coherence tomography (OCT), MS Functional Composite (MSFC) and vision-specific quality of life (QOL) measures (25-Item NEI Visual Functioning Questionnaire [NEI-VFQ-25] and 10-Item Neuro-Ophthalmic Supplement) were also assessed. K-D time scores in the MS cohort (total time to read the three test cards) were significantly higher (worse) compared to those for disease-free controls (P=0.003, linear regression, accounting for age). Within the MS cohort, higher K-D scores were associated with worse scores for the NEI-VFQ-25 composite (Paccounting for age and within-patient, inter-eye correlations). Patients with a history of optic neuritis (ON) had increased (worse) K-D scores. Patients who classified their work disability status as disabled (receiving disability pension) did worse on K-D testing compared to those working full-time (P=0.001, accounting for age). The K-D test, a work disability as well as structural changes as measured by OCT imaging. History of ON and abnormal binocular acuities were associated with worse K-D scores, suggesting that abnormalities detected by K-D may go along with afferent dysfunction in MS patients. A brief test that requires saccadic eye movements, K-D should be considered for future MS trials as

Monoclonal antibody OKB7, which identifies the 14OKd complement receptor type 2 (CR2), also identifies a 72Kd secreted fragment of CR2 that contains the C3d-binding site

International Nuclear Information System (INIS)

Myones, B.L.; Ross, G.D.

1986-01-01

CR 2 is a 140-145Kd glycoprotein expressed on B lymphocytes which binds both C3d and Epstein-Barr virus (EBV). OKB7, an IgG/sub 2a/ monoclonal antibody to CR 2 , blocks C3d and EBV binding, while HB-5, another monoclonal IgG/sub 2a/ anti-CR 2 , does not. A 72Kd C3d-binding glycoprotein (gp72), isolated from Raji cell media, was previously thought to be CR 2 because a polyclonal rabbit anti-gp72 inhibited EC3d rosettes. ELISA assay demonstrated that OKB7, but not HB-5, bound to purified gp72 fixed to microtiter wells. Insoluble and soluble gp72 blocked Raji cell uptake of 125 I-labeled OKB7, but not labeled anti-B2 or HB-5. Rabbit anti-gp72 immunoprecipitated bands at 140Kd and 72Kd from 125 I-labelled and solubilized B cell membranes. Culture media from Raji cells grown in the presence 3 H-labeled amino acids was sequentially immunoprecipitated by irrelevant antibody, OKB7, and HB-5. A single 72Kd radiolabeled band was demonstrated only with OKB7, and this was identical to that produced by the immunoprecipitation of 125 I-labeled gp72 with rabbit anti-gp72. Thus, OKB7, which identifies the 140Kd CR 2 molecule, also identifies a 72Kd shed fragment of CR 2 isolated from Raji cell media, which contains the C3d-binding site

Parallel Mitogenome Sequencing Alleviates Random Rooting Effect in Phylogeography.

Science.gov (United States)

Hirase, Shotaro; Takeshima, Hirohiko; Nishida, Mutsumi; Iwasaki, Wataru

2016-04-28

Reliably rooted phylogenetic trees play irreplaceable roles in clarifying diversification in the patterns of species and populations. However, such trees are often unavailable in phylogeographic studies, particularly when the focus is on rapidly expanded populations that exhibit star-like trees. A fundamental bottleneck is known as the random rooting effect, where a distant outgroup tends to root an unrooted tree "randomly." We investigated whether parallel mitochondrial genome (mitogenome) sequencing alleviates this effect in phylogeography using a case study on the Sea of Japan lineage of the intertidal goby Chaenogobius annularis Eighty-three C. annularis individuals were collected and their mitogenomes were determined by high-throughput and low-cost parallel sequencing. Phylogenetic analysis of these mitogenome sequences was conducted to root the Sea of Japan lineage, which has a star-like phylogeny and had not been reliably rooted. The topologies of the bootstrap trees were investigated to determine whether the use of mitogenomes alleviated the random rooting effect. The mitogenome data successfully rooted the Sea of Japan lineage by alleviating the effect, which hindered phylogenetic analysis that used specific gene sequences. The reliable rooting of the lineage led to the discovery of a novel, northern lineage that expanded during an interglacial period with high bootstrap support. Furthermore, the finding of this lineage suggested the existence of additional glacial refugia and provided a new recent calibration point that revised the divergence time estimation between the Sea of Japan and Pacific Ocean lineages. This study illustrates the effectiveness of parallel mitogenome sequencing for solving the random rooting problem in phylogeographic studies. © The Author 2016. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.

Characterization of a monoclonal antibody (P40) against the 68 kD major allergen of Penicillium notatum.

Science.gov (United States)

Shen, H D; Choo, K B; Chen, J H; Lin, W L; Chang, Z N; Han, S H

1992-04-01

A monoclonal antibody (MoAb P40) against the 68 kD major allergen of Penicillium notatum (P. notatum) was obtained by immunizing the mouse with a crude extract of P. notatum. Analysed by two-dimensional gel electrophoresis and immunoblotting, P40 reacted with two different isoforms of the 68 kD component of P. notatum with pIs of 5.4 and 5.5. In addition to P. notatum, P40 showed positive ELISA activity to Aspergillus fumigatus (A. fumigatus) but not to components of six other fungi including Alternaria porri, Cladosporium cladosporoides, Aureobasidium pullulans, Fusarium solani, Rhizopus arrhizus and Candida albicans. Analysed by ELISA, MoAb P40 also showed positive activity to two (P. frequentans and P. roseopurpureum) of the 10 other Penicillium species and two (A. terreus and A. flavus) of the four other Aspergillus species tested. SDS-PAGE and immunoblotting studies demonstrated P40 positive reactivity to components with MW of about 67 kD in all these Penicillium and Aspergillus species with positive ELISA activity to P40. Furthermore, immunoblotting activity of MoAb P40 to the 67 kD component of A. niger was also observed. The epitope of the 68 kD allergen of P. notatum recognized by MoAb P40 was resistant to treatment of periodate oxidation with concentration of NaIO4 up to 20 mM. This MoAb may thus be useful in the characterization and purification of the 68 kD allergen from crude extracts, and in the molecular cloning of allergen genes.

Constraints and Soliton Solutions for KdV Hierarchy and AKNS Hierarchy

International Nuclear Information System (INIS)

Li Nianhua; Li Yuqi

2011-01-01

It is well-known that the finite-gap solutions of the KdV equation can be generated by its recursion operator. We generalize the result to a special form of Lax pair, from which a method to constrain the integrable system to a lower-dimensional or fewer variable integrable system is proposed. A direct result is that the n-soliton solutions of the KdV hierarchy can be completely depicted by a series of ordinary differential equations (ODEs), which may be gotten by a simple but unfamiliar Lax pair. Furthermore the AKNS hierarchy is constrained to a series of univariate integrable hierarchies. The key is a special form of Lax pair for the AKNS hierarchy. It is proved that under the constraints all equations of the AKNS hierarchy are linearizable. (general)

Estuarine morphometry governs optically active substances, Kd(PAR) and beam attenuation

DEFF Research Database (Denmark)

Lund-Hansen, L. C.; Nielsen, J. M.; Blüthgen, J.

2013-01-01

estuaries using OACs as input parameters. It is concluded that there are no large differences in OAC concentrations between the two estuaries. The spatial distributions of OACs and optical properties were significantly different and governed by the estuary morphometry, i.e. a power distribution......°N) at high discharges. The major difference was the spatial distribution of the optical properties against distance, best described by significant power functions in the ria, compared to significant linear functions in the coastal plain. It was hypothesized that estuarine morphometry could explain...... this spatial distribution. Partition and multiple regression analyses showed that Chl-a governed Kd(PAR) and beam attenuation coefficient in both estuaries. Significant, high correlations were obtained by multiple regression analyses in the estimation of Kd(PAR) and beam attenuation coefficients in the two...

New exact travelling wave solutions for two potential coupled KdV equations with symbolic computation

International Nuclear Information System (INIS)

Yang Zonghang

2007-01-01

We find new exact travelling wave solutions for two potential KdV equations which are presented by Foursov [Foursov MV. J Math Phys 2000;41:6173-85]. Compared with the extended tanh-function method, the algorithm used in our paper can obtain some new kinds of exact travelling wave solutions. With the aid of symbolic computation, some novel exact travelling wave solutions of the potential KdV equations are constructed

Abundant general solitary wave solutions to the family of KdV type equations

Directory of Open Access Journals (Sweden)

Md. Azmol Huda

2017-03-01

Full Text Available This work explores the construction of more general exact traveling wave solutions of some nonlinear evolution equations (NLEEs through the application of the (G′/G, 1/G-expansion method. This method is allied to the widely used (G′/G-method initiated by Wang et al. and can be considered as an extension of the (G′/G-expansion method. For effectiveness, the method is applied to the family of KdV type equations. Abundant general form solitary wave solutions as well as periodic solutions are successfully obtained through this method. Moreover, in the obtained wider set of solutions, if we set special values of the parameters, some previously known solutions are revived. The approach of this method is simple and elegantly standard. Having been computerized it is also powerful, reliable and effective.

Travelling wave solutions for a singularly perturbed Burgers–KdV ...

Indian Academy of Sciences (India)

This paper concerns with the existence problem of travelling wave solutions to a singularly perturbed Burgers–KdV equation. For this, we use the dynamical systems approach, specifically, the geometric singular perturbation theory and centre manifold theory. We also numerically show approximations, in particular, for ...

White noise solutions to the stochastic mKdV equation

International Nuclear Information System (INIS)

Zhang Zhongjun; Wei Caimin

2009-01-01

In this paper, we present the white noise solutions of the stochastic mKdV equation via the Hermite transformation and variable-coefficient generalized projected Ricatti equation expansion method. These solutions include white noise solitary wave solutions, white noise soliton-like solutions and white noise trigonometric function solutions.

Monoclonal antibody OKB7, which identifies the 14OKd complement receptor type 2 (CR/sub 2/), also identifies a 72Kd secreted fragment of CR/sub 2/ that contains the C3d-binding site

Energy Technology Data Exchange (ETDEWEB)

Myones, B.L.; Ross, G.D.

1986-03-05

CR/sub 2/ is a 140-145Kd glycoprotein expressed on B lymphocytes which binds both C3d and Epstein-Barr virus (EBV). OKB7, an IgG/sub 2a/ monoclonal antibody to CR/sub 2/, blocks C3d and EBV binding, while HB-5, another monoclonal IgG/sub 2a/ anti-CR/sub 2/, does not. A 72Kd C3d-binding glycoprotein (gp72), isolated from Raji cell media, was previously thought to be CR/sub 2/ because a polyclonal rabbit anti-gp72 inhibited EC3d rosettes. ELISA assay demonstrated that OKB7, but not HB-5, bound to purified gp72 fixed to microtiter wells. Insoluble and soluble gp72 blocked Raji cell uptake of /sup 125/I-labeled OKB7, but not labeled anti-B2 or HB-5. Rabbit anti-gp72 immunoprecipitated bands at 140Kd and 72Kd from /sup 125/I-labelled and solubilized B cell membranes. Culture media from Raji cells grown in the presence /sup 3/H-labeled amino acids was sequentially immunoprecipitated by irrelevant antibody, OKB7, and HB-5. A single 72Kd radiolabeled band was demonstrated only with OKB7, and this was identical to that produced by the immunoprecipitation of /sup 125/I-labeled gp72 with rabbit anti-gp72. Thus, OKB7, which identifies the 140Kd CR/sub 2/ molecule, also identifies a 72Kd shed fragment of CR/sub 2/ isolated from Raji cell media, which contains the C3d-binding site.

Parallel implementation of the PHOENIX generalized stellar atmosphere program. II. Wavelength parallelization

International Nuclear Information System (INIS)

Baron, E.; Hauschildt, Peter H.

1998-01-01

We describe an important addition to the parallel implementation of our generalized nonlocal thermodynamic equilibrium (NLTE) stellar atmosphere and radiative transfer computer program PHOENIX. In a previous paper in this series we described data and task parallel algorithms we have developed for radiative transfer, spectral line opacity, and NLTE opacity and rate calculations. These algorithms divided the work spatially or by spectral lines, that is, distributing the radial zones, individual spectral lines, or characteristic rays among different processors and employ, in addition, task parallelism for logically independent functions (such as atomic and molecular line opacities). For finite, monotonic velocity fields, the radiative transfer equation is an initial value problem in wavelength, and hence each wavelength point depends upon the previous one. However, for sophisticated NLTE models of both static and moving atmospheres needed to accurately describe, e.g., novae and supernovae, the number of wavelength points is very large (200,000 - 300,000) and hence parallelization over wavelength can lead both to considerable speedup in calculation time and the ability to make use of the aggregate memory available on massively parallel supercomputers. Here, we describe an implementation of a pipelined design for the wavelength parallelization of PHOENIX, where the necessary data from the processor working on a previous wavelength point is sent to the processor working on the succeeding wavelength point as soon as it is known. Our implementation uses a MIMD design based on a relatively small number of standard message passing interface (MPI) library calls and is fully portable between serial and parallel computers. copyright 1998 The American Astronomical Society

On the exact solutions of high order wave equations of KdV type (I)

Science.gov (United States)

Bulut, Hasan; Pandir, Yusuf; Baskonus, Haci Mehmet

2014-12-01

In this paper, by means of a proper transformation and symbolic computation, we study high order wave equations of KdV type (I). We obtained classification of exact solutions that contain soliton, rational, trigonometric and elliptic function solutions by using the extended trial equation method. As a result, the motivation of this paper is to utilize the extended trial equation method to explore new solutions of high order wave equation of KdV type (I). This method is confirmed by applying it to this kind of selected nonlinear equations.

Multi-hump bright solitons in a Schrödinger-mKdV system

Science.gov (United States)

Cisneros-Ake, Luis A.; Parra Prado, Hugo; López Villatoro, Diego Joselito; Carretero-González, R.

2018-03-01

We consider the problem of energy transport in a Davydov model along an anharmonic crystal medium obeying quartic longitudinal interactions corresponding to rigid interacting particles. The Zabusky and Kruskal unidirectional continuum limit of the original discrete equations reduces, in the long wave approximation, to a coupled system between the linear Schrödinger (LS) equation and the modified Korteweg-de Vries (mKdV) equation. Single- and two-hump bright soliton solutions for this LS-mKdV system are predicted to exist by variational means and numerically confirmed. The one-hump bright solitons are found to be the anharmonic supersonic analogue of the Davydov's solitons while the two-hump (in both components) bright solitons are found to be a novel type of soliton consisting of a two-soliton solution of mKdV trapped by the wave function associated to the LS equation. This two-hump soliton solution, as a two component solution, represents a new class of polaron solution to be contrasted with the two-soliton interaction phenomena from soliton theory, as revealed by a variational approach and direct numerical results for the two-soliton solution.

Tree architecture and life-history strategies across 200 co-occurring tropical tree species

NARCIS (Netherlands)

Iida, Y.; Kohyama, T.S.; Kubo, T.; Kassim, A.R.; Poorter, L.; Sterck, F.J.; Potts, M.D.

2011-01-01

1. Tree architecture is thought to allow species to partition horizontal and vertical light gradients in the forest canopy. Tree architecture is closely related to light capture, carbon gain and the efficiency with which trees reach the canopy. Previous studies that investigated how light gradients

Algorithmically specialized parallel computers

CERN Document Server

Snyder, Lawrence; Gannon, Dennis B

1985-01-01

Algorithmically Specialized Parallel Computers focuses on the concept and characteristics of an algorithmically specialized computer.This book discusses the algorithmically specialized computers, algorithmic specialization using VLSI, and innovative architectures. The architectures and algorithms for digital signal, speech, and image processing and specialized architectures for numerical computations are also elaborated. Other topics include the model for analyzing generalized inter-processor, pipelined architecture for search tree maintenance, and specialized computer organization for raster

An Algebraic Construction of the First Integrals of the Stationary KdV Hierarchy

Science.gov (United States)

Matsushima, Masatomo; Ohmiya, Mayumi

2009-09-01

The stationary KdV hierarchy is constructed using a kind of recursion operator called Λ-operator. The notion of the maximal solution of the n-th stationary KdV equation is introduced. Using this maximal solution, a specific differential polynomial with the auxiliary spectral parameter called the spectral M-function is constructed as the quadratic form of the fundamental system of the eigenvalue problem for the 2-nd order linear ordinary differential equation which is related to the linearizing operator of the hierarchy. By calculating a perfect square condition of the quadratic form by an elementary algebraic method, the complete set of first integrals of this hierarchy is constructed.

Multi-weighted tree based query optimization method for parallel relational database systems%基于多重加权树的并行关系数据库系统的查询优化方法

Institute of Scientific and Technical Information of China (English)

无

2001-01-01

The author investigates the query optimization problem for parallel relational databases. A multi-weighted tree based query optimization method is proposed. The method consists of a multi-weighted tree based parallel query plan model, a cost model for parallel qury plans and a query optimizer. The parallel query plan model is the first one to model all basic relational operations, all three types of parallelism of query execution, processor and memory allocation to operations, memory allocation to the buffers between operations in pipelines and data redistribution among processors.The cost model takes the waiting time of the operations in pipelining execution into consideration and is computable in a bottom-up fashion. The query optimizer addresses the query optimization problem in the context of Select-Project-Join queries that are widely used in commercial DBMSs. Several heuristics determining the processor allocation to operations are derived and used in the query optimizer. The query optimizer is aware of memory resources in order to generate good-quality plans. It includes the heuristics for determining the memory allocation to operations and buffers between operations in pipelines so that the memory resourse is fully exploit. In addition, multiple algorithms for implementing join operations are consided in the query optimizer. The query optimizer can make an optimal choice of join algorithm for each join operation in a query. The proposed query optimization method has been used in a prototype parallel database management system designed and implemented by the author.

Waste isolation safety assessment program. Controlled sample program publication number 2: interlaboratory comparison of batch Kd values

International Nuclear Information System (INIS)

Relyea, J.F.; Serne, R.J.

1979-06-01

Objectives were to: (1) ascertain whether different experimenters obtain the same results for the adsorption of Cs, Sr and Pu using common rocks, standard solutions and a prescribed method; and (2) compare the results obtained by individual laboratories using different experimental methodologies and resolve any differences found or determine what conversions can be made to compare results from one method with another. Results from Objective 1 indicate that several parameters that were uncontrolled may have affected results. The uncontrolled parameters were: (1) method of tracer addition to solution, (2) solution to rock ratio, (3) initial tracer concentration in influent solution, (4) particle size distribution, (5) solid--solution separation method, (6) sample containers, and (7) temperature. Observed Kds for Cs and Sr in brine showed agreement among laboratories for both limestone and basalt rock samples. Comparable results were also found for Sr and Cs in the basalt groundwater. Results for Kd(Cs) in the limestone groundwater varied over three orders of magnitude, and Kd(Sr) varied by one order of magnitude in the limestone system. Observed Kd values for Pu typically varied by two to three orders of magnitude in all systems studied. Adsorption of Pu by container walls and by colloidal particles caused much of the variation in Kd(Pu). Direct measurement of Pu adsorbed by the rock (rather than measured by the difference between influent and effluent activities) also failed to reduce the Kd(Pu) variability

Vitelline coat of Unio elongatulus: III. Glycan chain analysis of the 220- and 180-kD components by means of lectins.

Science.gov (United States)

Focarelli, R; Leotta, F; Lampariello, R; Rosati, F

1995-02-01

Lectins of different binding specificity were used to analyze the oligosaccharide chains of the 220- and 180-kD proteins of the Unio elongatulus egg vitelline coat (vc). The lectins ConA and RCA1 reacted with both glycoproteins, and four other lectins reacted with one or other vc components. The lectin from Galanthus nivalis, which recognizes terminal mannose residues of N-linked high mannose type oligosaccharide chains, bound specifically to the 180-kD protein. Binding sites for this lectin were found throughout the vc of the differentiating oocyte and the mature egg. Lectins specific for the O-linked oligosaccharide chains, such as AIA and PNA, reacted only with the 220-kD protein species. Binding sites for these lectins were found only in the crater region. The presence of fucosyl residues on the glycan chains was investigated with lectins from Lotus tetragonolobus and Aleuria aurantia. The latter was positive on both glycoproteins, whereas LTA was only positive to the 220-kD species. The binding sites of both these lectins were in the same areas as those of PNA and AIA. These results suggest that while the 180-kD protein is part of the entire vc structure, the 220-kD protein is prevalently accumulated in the crater region. Since this is where sperm recognition and interaction take place, it has been suggested the 220-kD protein acts as a ligand molecule in the sperm-egg interaction.

Development of a Robust and Efficient Parallel Solver for Unsteady Turbomachinery Flows

Science.gov (United States)

West, Jeff; Wright, Jeffrey; Thakur, Siddharth; Luke, Ed; Grinstead, Nathan

2012-01-01

second-order time-stepping scheme, (c) a novel cloud-of-points interpolation method (based on a fast parallel kd-tree search algorithm) for interfaces between turbomachinery components in relative motion which is demonstrated to be highly scalable, and (d) demonstrated accuracy and parallel scalability on large grids (approx 250 million cells) in full turbomachinery geometries.

New analytic solutions of stochastic coupled KdV equations

International Nuclear Information System (INIS)

Dai Chaoqing; Chen Junlang

2009-01-01

In this paper, firstly, we use the exp-function method to seek new exact solutions of the Riccati equation. Then, with the help of Hermit transformation, we employ the Riccati equation and its new exact solutions to find new analytic solutions of the stochastic coupled KdV equation in the white noise environment. As some special examples, some analytic solutions can degenerate into these solutions reported in open literatures.

New exact solutions of the KdV-Burgers-Kuramoto equation

International Nuclear Information System (INIS)

Zhang Sheng

2006-01-01

A generalized F-expansion method is proposed and applied to the KdV-Burgers-Kuramoto equation. As a result, many new and more general exact travelling wave solutions are obtained including combined non-degenerate Jacobi elliptic function solutions, solitary wave solutions and trigonometric function solutions. The method can be applied to other nonlinear partial differential equations in mathematical physics

60 kD Ro and nRNP A frequently initiate human lupus autoimmunity.

Directory of Open Access Journals (Sweden)

Latisha D Heinlen

2010-03-01

Full Text Available Systemic lupus erythematosus (SLE is a clinically heterogeneous, humoral autoimmune disorder. The unifying feature among SLE patients is the production of large quantities of autoantibodies. Serum samples from 129 patients collected before the onset of SLE and while in the United States military were evaluated for early pre-clinical serologic events. The first available positive serum sample frequently already contained multiple autoantibody specificities (65%. However, in 34 SLE patients the earliest pre-clinical serum sample positive for any detectable common autoantibody bound only a single autoantigen, most commonly 60 kD Ro (29%, nRNP A (24%, anti-phospholipids (18% or rheumatoid factor (15%. We identified several recurrent patterns of autoantibody onset using these pre-diagnostic samples. In the serum samples available, anti-nRNP A appeared before or simultaneously with anti-nRNP 70 K in 96% of the patients who had both autoantibodies at diagnosis. Anti-60 kD Ro antibodies appeared before or simultaneously with anti-La (98% or anti-52 kD Ro (95%. The autoantibody response in SLE patients begins simply, often binding a single specific autoantigen years before disease onset, followed by epitope spreading to additional autoantigenic specificities that are accrued in recurring patterns.

Distribution of a 69-kD laminin-binding protein in aortic and microvascular endothelial cells: modulation during cell attachment, spreading, and migration

DEFF Research Database (Denmark)

Yannariello-Brown, J; Wewer, U; Liotta, L

1988-01-01

cells identified this protein in BAEC lysates. In frozen sections, these polyclonal antibodies and monoclonal antibodies raised against human tumor 69-kD stained the endothelium of bovine aorta and the medial smooth muscle cells, but not surrounding connective tissue or elastin fibers. When...... nonpermeabilized BAEC were stained in an in vitro migration assay, there appeared to be apical patches of 69 kD staining in stationary cells. However, when released from contact inhibition, 69 kD was localized to ruffling membranes on cells at the migrating front. Permeabilized BAEC stained for 69 kD diffusely...... in permeabilized cultured microvascular endothelial cells in a continuous staining pattern at 6 h postplating which redistributed to punctate patches along the length of the filaments at confluence (96 h). In addition, 69 kD co-distribution with laminin could also be demonstrated in cultured subconfluent cells...

A task parallel implementation of fast multipole methods

KAUST Repository

Taura, Kenjiro

2012-11-01

This paper describes a task parallel implementation of ExaFMM, an open source implementation of fast multipole methods (FMM), using a lightweight task parallel library MassiveThreads. Although there have been many attempts on parallelizing FMM, experiences have almost exclusively been limited to formulation based on flat homogeneous parallel loops. FMM in fact contains operations that cannot be readily expressed in such conventional but restrictive models. We show that task parallelism, or parallel recursions in particular, allows us to parallelize all operations of FMM naturally and scalably. Moreover it allows us to parallelize a \\'\\'mutual interaction\\'\\' for force/potential evaluation, which is roughly twice as efficient as a more conventional, unidirectional force/potential evaluation. The net result is an open source FMM that is clearly among the fastest single node implementations, including those on GPUs; with a million particles on a 32 cores Sandy Bridge 2.20GHz node, it completes a single time step including tree construction and force/potential evaluation in 65 milliseconds. The study clearly showcases both programmability and performance benefits of flexible parallel constructs over more monolithic parallel loops. © 2012 IEEE.

Darboux and binary Darboux transformations for discrete integrable systems I. Discrete potential KdV equation

International Nuclear Information System (INIS)

Shi, Ying; Zhang, Da-jun; Nimmo, Jonathan J C

2014-01-01

The Hirota–Miwa equation can be written in ‘nonlinear’ form in two ways: the discrete KP equation and, by using a compatible continuous variable, the discrete potential KP equation. For both systems, we consider the Darboux and binary Darboux transformations, expressed in terms of the continuous variable, and obtain exact solutions in Wronskian and Grammian form. We discuss reductions of both systems to the discrete KdV and discrete potential KdV equation, respectively, and exploit this connection to find the Darboux and binary Darboux transformations and exact solutions of these equations. (paper)

Technetium, Iodine, and Chromium Adsorption/Desorption Kd Values for Vadose Zone Pore Water, ILAW Glass, and Cast Stone Leachates Contacting an IDF Sand Sequence

Energy Technology Data Exchange (ETDEWEB)

Last, George V. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Snyder, Michelle M.V. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Um, Wooyong [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Stephenson, John R. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Leavy, Ian I. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Strickland, Christopher E. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Bacon, Diana H. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Qafoku, Nikolla [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Serne, R. Jeffrey [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)

2015-11-01

Performance and risk assessments of immobilized low-activity waste (ILAW) at the Integrated Disposal Facility (IDF) have shown that risks to groundwater are quite sensitive to adsorption-desorption interactions occurring in the near- and far-field environment. These interactions between the underlying sediments and the contaminants present in the leachates that descend from the buried glass, secondary waste grouts, and potentially Cast Stone low-activity waste packages have been represented in these assessments using the contaminant distribution coefficient (Kd) construct. Some contaminants (99Tc, 129I, and Cr) present in significant quantities in these wastes have low Kd values and tend to drive risk to public health and the environment. Relatively small changes in the Kd value can cause relatively large changes in the retardation factor. Thus, even relatively small uncertainty in the Kd value can result in a relatively large uncertainty in the risk determined through performance assessment modeling. The purpose of this study is to further reduce the uncertainty in Kd values for 99Tc, iodine (iodide and iodate), and Cr (chromate; CrO42-) by conducting systematic adsorption-desorption experiments using actual sand-dominated Hanford formation sediments from beneath the IDF and solutions that closely mimic Hanford vadose zone pore water and leachates from Cast Stone and ILAW glass waste forms. Twenty-four batch and 21 flow-through column experiments were conducted, yielding 261 Kd measurements for these key contaminants, and contributing to our understanding for predicting transport from wastes disposed to the IDF. While the batch Kd methodology is not well-suited for measuring Kd values for non-sorbing species (as noted by the U.S. Environmental Protection Agency), the batch Kd results presented here are not wholly inconsistent with the column Kd results, and could be used for sensitivity purposes. Results from the column experiments are consistent with the best

The university münster model surgery system for orthognathic surgery. Part II – KD-MMS

Directory of Open Access Journals (Sweden)

Ehmer Ulrike

2013-01-01

Full Text Available Abstract Background Model surgery is an integral part of the planning procedure in orthognathic surgery. Most concepts comprise cutting the dental cast off its socket. The standardized spacer plates of the KD-MMS provide for a non-destructive, reversible and reproducible means of maxillary and/or mandibular plaster cast separation. Methods In the course of development of the system various articulator types were evaluated with regard to their capability to provide a means of realizing the concepts comprised of the KD-MMS. Special attention was dedicated to the ability to perform three-dimensional displacements without cutting of plaster casts. Various utilities were developed to facilitate maxillary displacement in accordance to the planning. Objectives of this development comprised the ability to implement the values established in the course of two-dimensional ceph planning. Results The system - KD-MMS comprises a set of hardware components as well as a defined procedure. Essential hardware components are red spacer and blue mounting plates. The blue mounting plates replace the standard yellow SAM mounting elements. The red spacers provide for a defined leeway of 8 mm for three-dimensional movements. The non-destructive approach of the KD-MMS makes it possible to conduct different model surgeries with the same plaster casts as well as to restore the initial, pre-surgical situation at any time. Thereby, surgical protocol generation and gnathologic splint construction are facilitated. Conclusions The KD-MMS hardware components in conjunction with the defined procedures are capable of increasing efficiency and accuracy of model surgery and splint construction. In cases where different surgical approaches need to be evaluated in the course of model surgery, a significant reduction of chair time may be achieved.

Poisson's theorem and integrals of KdV equation

International Nuclear Information System (INIS)

Tasso, H.

1978-01-01

Using Poisson's theorem it is proved that if F = integral sub(-infinity)sup(+infinity) T(u,usub(x),...usub(n,t))dx is an invariant functional of KdV equation, then integral sub(-infinity)sup(+infinity) delta F/delta u dx integral sub(-infinity)sup(+infinity) delta T/delta u dx is also an invariant functional. In the case of a polynomial T, one finds in a simple way the known recursion ΔTr/Δu = Tsub(r-1). This note gives an example of the usefulness of Poisson's theorem. (author)

Optimization of incremental structure from motion combining a random k-d forest and pHash for unordered images in a complex scene

Science.gov (United States)

Zhan, Zongqian; Wang, Chendong; Wang, Xin; Liu, Yi

2018-01-01

On the basis of today's popular virtual reality and scientific visualization, three-dimensional (3-D) reconstruction is widely used in disaster relief, virtual shopping, reconstruction of cultural relics, etc. In the traditional incremental structure from motion (incremental SFM) method, the time cost of the matching is one of the main factors restricting the popularization of this method. To make the whole matching process more efficient, we propose a preprocessing method before the matching process: (1) we first construct a random k-d forest with the large-scale scale-invariant feature transform features in the images and combine this with the pHash method to obtain a value of relatedness, (2) we then construct a connected weighted graph based on the relatedness value, and (3) we finally obtain a planned sequence of adding images according to the principle of the minimum spanning tree. On this basis, we attempt to thin the minimum spanning tree to reduce the number of matchings and ensure that the images are well distributed. The experimental results show a great reduction in the number of matchings with enough object points, with only a small influence on the inner stability, which proves that this method can quickly and reliably improve the efficiency of the SFM method with unordered multiview images in complex scenes.

In-situ Kd values and geochemical behavior for inorganic and organic constituents of concern at the TNX Outfall Delta

International Nuclear Information System (INIS)

Kaplan, D.I.

2000-01-01

A series of tests were conducted to provide site-specific Kd values for constituents of concern at the TNX Outfall Delta Operable Unit. These Kd values can be used to calculate contaminant migration within the operable unit and are, at this time considered to be the most defensible values

FPGA Hardware Acceleration of a Phylogenetic Tree Reconstruction with Maximum Parsimony Algorithm

OpenAIRE

BLOCK, Henry; MARUYAMA, Tsutomu

2017-01-01

In this paper, we present an FPGA hardware implementation for a phylogenetic tree reconstruction with a maximum parsimony algorithm. We base our approach on a particular stochastic local search algorithm that uses the Progressive Neighborhood and the Indirect Calculation of Tree Lengths method. This method is widely used for the acceleration of the phylogenetic tree reconstruction algorithm in software. In our implementation, we define a tree structure and accelerate the search by parallel an...

Cache-Oblivious Search Trees via Binary Trees of Small Height

DEFF Research Database (Denmark)

Brodal, G.S.; Fagerberg, R.; Jacob, R.

2002-01-01

We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach-Colton and has the same complexity bounds. In particular, our data structure avoids the use of weight balanced B-trees, and can be implemented as just a single array......, and range queries in worst case O(logB n + k/B) memory transfers, where k is the size of the output.The basic idea of our data structure is to maintain a dynamic binary tree of height log n+O(1) using existing methods, embed this tree in a static binary tree, which in turn is embedded in an array in a cache...... oblivious fashion, using the van Emde Boas layout of Prokop.We also investigate the practicality of cache obliviousness in the area of search trees, by providing an empirical comparison of different methods for laying out a search tree in memory....

Combining evolutionary algorithms with oblique decision trees to detect bent-double galaxies

Science.gov (United States)

Cantu-Paz, Erick; Kamath, Chandrika

2000-10-01

Decision tress have long been popular in classification as they use simple and easy-to-understand tests at each node. Most variants of decision trees test a single attribute at a node, leading to axis- parallel trees, where the test results in a hyperplane which is parallel to one of the dimensions in the attribute space. These trees can be rather large and inaccurate in cases where the concept to be learned is best approximated by oblique hyperplanes. In such cases, it may be more appropriate to use an oblique decision tree, where the decision at each node is a linear combination of the attributes. Oblique decision trees have not gained wide popularity in part due to the complexity of constructing good oblique splits and the tendency of existing splitting algorithms to get stuck in local minima. Several alternatives have been proposed to handle these problems including randomization in conjunction wiht deterministic hill-climbing and the use of simulated annealing. In this paper, we use evolutionary algorithms (EAs) to determine the split. EAs are well suited for this problem because of their global search properties, their tolerance to noisy fitness evaluations, and their scalability to large dimensional search spaces. We demonstrate our technique on a synthetic data set, and then we apply it to a practical problem from astronomy, namely, the classification of galaxies with a bent-double morphology. In addition, we describe our experiences with several split evaluation criteria. Our results suggest that, in some cases, the evolutionary approach is faster and more accurate than existing oblique decision tree algorithms. However, for our astronomical data, the accuracy is not significantly different than the axis-parallel trees.

New Hamiltonian structure of the fractional C-KdV soliton equation hierarchy

International Nuclear Information System (INIS)

Yu Fajun; Zhang Hongqing

2008-01-01

A generalized Hamiltonian structure of the fractional soliton equation hierarchy is presented by using of differential forms and exterior derivatives of fractional orders. Example of the fractional Hamiltonian system of the C-KdV soliton equation hierarchy is constructed, which is a new Hamiltonian structure

Exact travelling wave solutions of the (3+1)-dimensional mKdV-ZK ...

Indian Academy of Sciences (India)

1Department of Mathematics, Pabna University of Science and Technology, Pabna, Bangladesh ... equation and the (1+1)-dimensional compound KdVB equation; nonlinear partial differential ... (3) can be integrated term by term one or more.

Structure of the Λ (1405 ) and the K-d →π Σ n reaction

Science.gov (United States)

Ohnishi, Shota; Ikeda, Yoichi; Hyodo, Tetsuo; Weise, Wolfram

2016-02-01

The Λ (1405 ) resonance production reaction is investigated within the framework of the coupled-channels Alt-Grassberger-Sandhas (AGS) equations. We perform full three-body calculations for the K ¯N N -π Y N amplitudes on the physical real energy axis and investigate how the signature of the Λ (1405 ) appears in the cross sections of the K-d →π Σ n reactions, also in view of the planned E31 experiment at J-PARC. Two types of meson-baryon interaction models are considered: an energy-dependent interaction based on chiral S U (3 ) effective field theory, and an energy-independent version that has been used repeatedly in phenomenological approaches. These two models have different off-shell properties that imply correspondingly different behavior in the three-body system. We investigate how these features show up in differential cross sections of K-d →π Σ n reactions. Characteristic patterns distinguishing between the two models are found in the invariant mass spectrum of the final π Σ state. The K-d →π Σ n reaction, with different (π±Σ∓ and π0Σ0 ) charge combinations in the final state, is thus demonstrated to be a useful tool for investigating the subthreshold behavior of the K ¯N interaction.

Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors

Science.gov (United States)

Banerjee, Prithviraj; Jones, Mark Howard; Sargent, Jeff S.

1990-01-01

Two parallel algorithms for standard cell placement using simulated annealing are developed to run on distributed-memory message-passing hypercube multiprocessors. The cells can be mapped in a two-dimensional area of a chip onto processors in an n-dimensional hypercube in two ways, such that both small and large cell exchange and displacement moves can be applied. The computation of the cost function in parallel among all the processors in the hypercube is described, along with a distributed data structure that needs to be stored in the hypercube to support the parallel cost evaluation. A novel tree broadcasting strategy is used extensively for updating cell locations in the parallel environment. A dynamic parallel annealing schedule estimates the errors due to interacting parallel moves and adapts the rate of synchronization automatically. Two novel approaches in controlling error in parallel algorithms are described: heuristic cell coloring and adaptive sequence control.

Modulating functions method for parameters estimation in the fifth order KdV equation

KAUST Repository

Asiri, Sharefa M.; Liu, Da-Yan; Laleg-Kirati, Taous-Meriem

2017-01-01

In this work, the modulating functions method is proposed for estimating coefficients in higher-order nonlinear partial differential equation which is the fifth order Kortewegde Vries (KdV) equation. The proposed method transforms the problem into a

Gaussian solitary waves for the logarithmic-KdV and the logarithmic-KP equations

International Nuclear Information System (INIS)

Wazwaz, Abdul-Majid

2014-01-01

We investigate the logarithmic-KdV equation for more Gaussian solitary waves. We extend this work to derive the logarithmic-KP (Kadomtsev–Petviashvili) equation. We show that both logarithmic models are characterized by their Gaussian solitons. (paper)

Investigation of the physical and mechanical properties of Shea Tree ...

African Journals Online (AJOL)

Investigation of the physical and mechanical properties of Shea Tree timber ( Vitellaria paradoxa ) used for structural applications in Kwara State, Nigeria. ... strength parallel to grain of 24.7 (N/mm2), compressive strength perpendicular to grain of 8.99 (N/mm2), shear strength of 2.01 (N/mm2), and tensile strength parallel to ...

Discrete mKdV and discrete sine-Gordon flows on discrete space curves

International Nuclear Information System (INIS)

Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

2014-01-01

In this paper, we consider the discrete deformation of the discrete space curves with constant torsion described by the discrete mKdV or the discrete sine-Gordon equations, and show that it is formulated as the torsion-preserving equidistant deformation on the osculating plane which satisfies the isoperimetric condition. The curve is reconstructed from the deformation data by using the Sym–Tafel formula. The isoperimetric equidistant deformation of the space curves does not preserve the torsion in general. However, it is possible to construct the torsion-preserving deformation by tuning the deformation parameters. Further, it is also possible to make an arbitrary choice of the deformation described by the discrete mKdV equation or by the discrete sine-Gordon equation at each step. We finally show that the discrete deformation of discrete space curves yields the discrete K-surfaces. (paper)

Well-posedness and ill-posedness of the fifth-order modified KdV equation

Directory of Open Access Journals (Sweden)

Soonsik Kwon

2008-01-01

Full Text Available We consider the initial value problem of the fifth-order modified KdV equation on the Sobolev spaces. $$displaylines{ partial_t u - partial_x^5u + c_1partial_x^3(u^3 + c_2upartial_x upartial_x^2 u + c_3uupartial_x^3 u =0cr u(x,0= u_0(x }$$ where $u:mathbb{R}imesmathbb{R} o mathbb{R} $ and $c_j$'s are real. We show the local well-posedness in $H^s(mathbb{R}$ for $sgeq 3/4$ via the contraction principle on $X^{s,b}$ space. Also, we show that the solution map from data to the solutions fails to be uniformly continuous below $H^{3/4}(mathbb{R}$. The counter example is obtained by approximating the fifth order mKdV equation by the cubic NLS equation.

Mean-field lattice trees

NARCIS (Netherlands)

Borgs, C.; Chayes, J.T.; Hofstad, van der R.W.; Slade, G.

1999-01-01

We introduce a mean-field model of lattice trees based on embeddings into d of abstract trees having a critical Poisson offspring distribution. This model provides a combinatorial interpretation for the self-consistent mean-field model introduced previously by Derbez and Slade [9], and provides an

Reactive transport model and apparent Kd of Ni in the near field of a HLW repository in granite

Science.gov (United States)

Lu, Chuanhe; Samper, Javier; Luis Cormenzana, José; Ma, Hongyun; Montenegro, Luis; Ángel Cuñado, Miguel

2012-12-01

Current performance assessment models for radionuclide migration through the near field of high-level radioactive waste repositories often rely on the assumption of a constant Kd for sorption. The validity of such assumption is evaluated here with a reactive transport model for Ni2+ in the near field of a repository in granite. Model results show that Ni2+ sorbs mainly by surface complexation on weak sorption sites. The apparent Kd of Ni2+, Kda, depends on the concentration of dissolved Ni and pH and is constant only when the concentration of dissolved Ni is smaller than 10-6 mol/L. The results of the sensitivity runs show that Kda is sensitive to the water flux at the bentonite-granite interface, the effective diffusion of the bentonite and the concentration of weak sorption sites of the bentonite. The competition of other nuclides such as Cs+ on Ni2+ sorption is not important. Corrosion products, however, affect significantly the sorption of Ni2+ on the bentonite. The model with a constant Kd does not reproduce the release rates of Ni2+ from the bentonite into the granite. A model with a variable Kd which depends on the concentration of dissolved Ni2+ and pH may provide an acceptable surrogate of the multicomponent reactive transport model for the conditions of the repository considered in our model. Simulations using the Kd-approach were performed with GoldSim based on the interpolation in the pH and concentration table, while the reactive transport model simulations were performed with CORE2D which incorporates multisite surface complexation.

A third-order KdV solution for internal solitary waves and its application in the numerical wave tank

Directory of Open Access Journals (Sweden)

Qicheng Meng

2016-04-01

Full Text Available A third-order KdV solution to the internal solitary wave is derived by a new method based on the weakly nonlinear assumptions in a rigid-lid two-layer system. The solution corrects an error by Mirie and Su (1984. A two-dimensional numerical wave tank has been established with the help of the open source CFD library OpenFOAM and the third-party software waves2Foam. Various analytical solutions, including the first-order to third-order KdV solutions, the eKdV solution and the MCC solution, have been used to initialise the flow fields in the CFD simulations of internal solitary waves. Two groups including 11 numerical cases have been carried out. In the same group, the initial wave amplitudes are the same but the implemented analytical solutions are different. The simulated wave profiles at different moments have been presented. The relative errors in terms of the wave amplitude between the last time step and the initial input have been analysed quantitatively. It is found that the third-order KdV solution results in the most stable internal solitary wave in the numerical wave tank for both small-amplitude and finite-amplitude cases. The finding is significant for the further simulations involving internal solitary waves.

Interactive wood combustion for botanical tree models

KAUST Repository

Pirk, Sören

2017-11-22

We present a novel method for the combustion of botanical tree models. Tree models are represented as connected particles for the branching structure and a polygonal surface mesh for the combustion. Each particle stores biological and physical attributes that drive the kinetic behavior of a plant and the exothermic reaction of the combustion. Coupled with realistic physics for rods, the particles enable dynamic branch motions. We model material properties, such as moisture and charring behavior, and associate them with individual particles. The combustion is efficiently processed in the surface domain of the tree model on a polygonal mesh. A user can dynamically interact with the model by initiating fires and by inducing stress on branches. The flames realistically propagate through the tree model by consuming the available resources. Our method runs at interactive rates and supports multiple tree instances in parallel. We demonstrate the effectiveness of our approach through numerous examples and evaluate its plausibility against the combustion of real wood samples.

Global tree network for computing structures enabling global processing operations

Science.gov (United States)

Blumrich; Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

2010-01-19

A system and method for enabling high-speed, low-latency global tree network communications among processing nodes interconnected according to a tree network structure. The global tree network enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the tree via links to facilitate performance of low-latency global processing operations at nodes of the virtual tree and sub-tree structures. The global operations performed include one or more of: broadcast operations downstream from a root node to leaf nodes of a virtual tree, reduction operations upstream from leaf nodes to the root node in the virtual tree, and point-to-point message passing from any node to the root node. The global tree network is configurable to provide global barrier and interrupt functionality in asynchronous or synchronized manner, and, is physically and logically partitionable.

Modeling Transport of Cesium in Grimsel Granodiorite With Micrometer Scale Heterogeneities and Dynamic Update of Kd

Science.gov (United States)

Voutilainen, Mikko; Kekäläinen, Pekka; Siitari-Kauppi, Marja; Sardini, Paul; Muuri, Eveliina; Timonen, Jussi; Martin, Andrew

2017-11-01

Transport and retardation of cesium in Grimsel granodiorite taking into account heterogeneity of mineral and pore structure was studied using rock samples overcored from an in situ diffusion test at the Grimsel Test Site. The field test was part of the Long-Term Diffusion (LTD) project designed to characterize retardation properties (diffusion and distribution coefficients) under in situ conditions. Results of the LTD experiment for cesium showed that in-diffusion profiles and spatial concentration distributions were strongly influenced by the heterogeneous pore structure and mineral distribution. In order to study the effect of heterogeneity on the in-diffusion profile and spatial concentration distribution, a Time Domain Random Walk (TDRW) method was applied along with a feature for modeling chemical sorption in geological materials. A heterogeneous mineral structure of Grimsel granodiorite was constructed using X-ray microcomputed tomography (X-μCT) and the map was linked to previous results for mineral specific porosities and distribution coefficients (Kd) that were determined using C-14-PMMA autoradiography and batch sorption experiments, respectively. After this the heterogeneous structure contains information on local porosity and Kd in 3-D. It was found that the heterogeneity of the mineral structure on the micrometer scale affects significantly the diffusion and sorption of cesium in Grimsel granodiorite at the centimeter scale. Furthermore, the modeled in-diffusion profiles and spatial concentration distributions show similar shape and pattern to those from the LTD experiment. It was concluded that the use of detailed structure characterization and quantitative data on heterogeneity can significantly improve the interpretation and evaluation of transport experiments.

Template based parallel checkpointing in a massively parallel computer system

Science.gov (United States)

Archer, Charles Jens [Rochester, MN; Inglett, Todd Alan [Rochester, MN

2009-01-13

A method and apparatus for a template based parallel checkpoint save for a massively parallel super computer system using a parallel variation of the rsync protocol, and network broadcast. In preferred embodiments, the checkpoint data for each node is compared to a template checkpoint file that resides in the storage and that was previously produced. Embodiments herein greatly decrease the amount of data that must be transmitted and stored for faster checkpointing and increased efficiency of the computer system. Embodiments are directed to a parallel computer system with nodes arranged in a cluster with a high speed interconnect that can perform broadcast communication. The checkpoint contains a set of actual small data blocks with their corresponding checksums from all nodes in the system. The data blocks may be compressed using conventional non-lossy data compression algorithms to further reduce the overall checkpoint size.

A 39-kD plasma membrane protein (IP39) is an anchor for the unusual membrane skeleton of Euglena gracilis

International Nuclear Information System (INIS)

Rosiere, T.K.; Marrs, J.A.; Bouck, G.B.

1990-01-01

The major integral plasma membrane protein (IP39) of Euglena gracilis was radiolabeled, peptide mapped, and dissected with proteases to identify cytoplasmic domains that bind and anchor proteins of the cell surface. When plasma membranes were radioiodinated and extracted with octyl glucoside, 98% of the extracted label was found in IP39 or the 68- and 110-kD oligomers of IP39. The octyl glucoside extracts were incubated with unlabeled cell surface proteins immobilized on nitrocellulose (overlays). Radiolabel from the membrane extract bound one (80 kD) of the two (80 and 86 kD) major membrane skeletal protein bands. Resolubilization of the bound label yielded a radiolabeled polypeptide identical in Mr to IP39. Intact plasma membranes were also digested with papain before or after radioiodination, thereby producing a cytoplasmically truncated IP39. The octyl glucoside extract of truncated IP39 no longer bound to the 80-kD membrane skeletal protein in the nitrocellulose overlays. EM of intact or trypsin digested plasma membranes incubated with membrane skeletal proteins under stringent conditions similar to those used in the nitrocellulose overlays revealed a partially reformed membrane skeletal layer. Little evidence of a membrane skeletal layer was found, however, when plasma membranes were predigested with papain before reassociation. A candidate 80-kD binding domain of IP39 has been tentatively identified as a peptide fragment that was present after trypsin digestion of plasma membranes, but was absent after papain digestion in two-dimensional peptide maps of IP39. Together, these data suggest that the unique peripheral membrane skeleton of Euglena binds to the plasma membrane through noncovalent interactions between the major 80-kD membrane skeletal protein and a small, papain sensitive cytoplasmic domain of IP39

a Novel Approach of Indexing and Retrieving Spatial Polygons for Efficient Spatial Region Queries

Science.gov (United States)

Zhao, J. H.; Wang, X. Z.; Wang, F. Y.; Shen, Z. H.; Zhou, Y. C.; Wang, Y. L.

2017-10-01

Spatial region queries are more and more widely used in web-based applications. Mechanisms to provide efficient query processing over geospatial data are essential. However, due to the massive geospatial data volume, heavy geometric computation, and high access concurrency, it is difficult to get response in real time. Spatial indexes are usually used in this situation. In this paper, based on k-d tree, we introduce a distributed KD-Tree (DKD-Tree) suitbable for polygon data, and a two-step query algorithm. The spatial index construction is recursive and iterative, and the query is an in memory process. Both the index and query methods can be processed in parallel, and are implemented based on HDFS, Spark and Redis. Experiments on a large volume of Remote Sensing images metadata have been carried out, and the advantages of our method are investigated by comparing with spatial region queries executed on PostgreSQL and PostGIS. Results show that our approach not only greatly improves the efficiency of spatial region query, but also has good scalability, Moreover, the two-step spatial range query algorithm can also save cluster resources to support a large number of concurrent queries. Therefore, this method is very useful when building large geographic information systems.

A NOVEL APPROACH OF INDEXING AND RETRIEVING SPATIAL POLYGONS FOR EFFICIENT SPATIAL REGION QUERIES

Directory of Open Access Journals (Sweden)

J. H. Zhao

2017-10-01

Full Text Available Spatial region queries are more and more widely used in web-based applications. Mechanisms to provide efficient query processing over geospatial data are essential. However, due to the massive geospatial data volume, heavy geometric computation, and high access concurrency, it is difficult to get response in real time. Spatial indexes are usually used in this situation. In this paper, based on k-d tree, we introduce a distributed KD-Tree (DKD-Tree suitbable for polygon data, and a two-step query algorithm. The spatial index construction is recursive and iterative, and the query is an in memory process. Both the index and query methods can be processed in parallel, and are implemented based on HDFS, Spark and Redis. Experiments on a large volume of Remote Sensing images metadata have been carried out, and the advantages of our method are investigated by comparing with spatial region queries executed on PostgreSQL and PostGIS. Results show that our approach not only greatly improves the efficiency of spatial region query, but also has good scalability, Moreover, the two-step spatial range query algorithm can also save cluster resources to support a large number of concurrent queries. Therefore, this method is very useful when building large geographic information systems.

Exact PsTd invariant and PsTd symmetric breaking solutions, symmetry reductions and Bäcklund transformations for an AB-KdV system

Science.gov (United States)

Jia, Man; Lou, Sen Yue

2018-05-01

In natural and social science, many events happened at different space-times may be closely correlated. Two events, A (Alice) and B (Bob) are defined as correlated if one event is determined by another, say, B = f ˆ A for suitable f ˆ operators. A nonlocal AB-KdV system with shifted-parity (Ps, parity with a shift), delayed time reversal (Td, time reversal with a delay) symmetry where B =Ps ˆ Td ˆ A is constructed directly from the normal KdV equation to describe two-area physical event. The exact solutions of the AB-KdV system, including PsTd invariant and PsTd symmetric breaking solutions are shown by different methods. The PsTd invariant solution show that the event happened at A will happen also at B. These solutions, such as single soliton solutions, infinitely many singular soliton solutions, soliton-cnoidal wave interaction solutions, and symmetry reduction solutions etc., show the AB-KdV system possesses rich structures. Also, a special Bäcklund transformation related to residual symmetry is presented via the localization of the residual symmetry to find interaction solutions between the solitons and other types of the AB-KdV system.

An outline of cellular automaton universe via cosmological KdV equation

Science.gov (United States)

Christianto, V.; Smarandache, F.; Umniyati, Y.

2018-03-01

It has been known for long time that the cosmic sound wave was there since the early epoch of the Universe. Signatures of its existence are abound. However, such a sound wave model of cosmology is rarely developed fully into a complete framework. This paper can be considered as our second attempt towards such a complete description of the Universe based on soliton wave solution of cosmological KdV equation. Then we advance further this KdV equation by virtue of Cellular Automaton method to solve the PDEs. We submit wholeheartedly Robert Kuruczs hypothesis that Big Bang should be replaced with a finite cellular automaton universe with no expansion [4][5]. Nonetheless, we are fully aware that our model is far from being complete, but it appears the proposed cellular automaton model of the Universe is very close in spirit to what Konrad Zuse envisaged long time ago. It is our hope that the new proposed method can be verified with observation data. But we admit that our model is still in its infancy, more researches are needed to fill all the missing details.

Propagation of sech2-type solitary waves in higher-order KdV-type systems

International Nuclear Information System (INIS)

Ilison, O.; Salupere, A.

2005-01-01

Wave propagation in microstructured media is essentially influenced by nonlinear and dispersive effects. The simplest model governing these effects results in the Korteweg-de Vries (KdV) equation. In the present paper a KdV-type evolution equation, including the third- and fifth-order dispersive and the fourth-order nonlinear terms, is used for modelling the wave propagation in microstructured solids like martensitic-austenitic alloys. The model equation is solved numerically under localised initial conditions. Possible solution types are defined and discussed. The existence of a threshold is established. Below the threshold, the relatively small solitary waves decay in time. However, if the amplitude exceeds a certain threshold, i.e., the critical value, then such a solitary wave can propagate with nearly a constant speed and amplitude and consequently conserve the energy

Low Levels of the 150-kD Insulin -Like Growth Factor Binding Protein 3 Ternary complex in Patients with Anorexia nervosa

DEFF Research Database (Denmark)

Støving, René K; Hangaard, Jørgen; Hagen, Claus

2003-01-01

women with AN at the time of diagnosis and after partial weight recovery and in 6 healthy age-matched women serving as controls. RESULTS: Patients with AN had low levels of ALS and IGFBP-3 contained in the 150-kD ternary complex and in the non-150-kD fraction. Following partial weight recovery, the 150......-kD IGFBP-3 ternary complex was fully normalized, despite only partial normalization of serum GH and IGF-I levels. Patients with AN did not present with IGFBP-3 proteolysis different from controls. CONCLUSION: The present data indicate a pivotal role of the nutritional status in the regulation...

Analytical and numerical solutions of the Schrödinger–KdV equation

Indian Academy of Sciences (India)

The Schrödinger–KdV equation with power-law nonlinearity is studied in this paper. The solitary wave ansatz method is used to carry out the integration of the equation and obtain one-soliton solution. The ′/ method is also used to integrate this equation. Subsequently, the variational iteration method and homotopy ...

Autoantibodies to a 140-kd protein in juvenile dermatomyositis are associated with calcinosis.

LENUS (Irish Health Repository)

Gunawardena, H

2009-06-01

OBJECTIVE: The identification of novel autoantibodies in juvenile dermatomyositis (DM) may have etiologic and clinical implications. The aim of this study was to describe autoantibodies to a 140-kd protein in children recruited to the Juvenile DM National Registry and Repository for UK and Ireland. METHODS: Clinical data and sera were collected from children with juvenile myositis. Sera that recognized a 140-kd protein by immunoprecipitation were identified. The identity of the p140 autoantigen was investigated by immunoprecipitation\\/immunodepletion, using commercial monoclonal antibodies to NXP-2, reference anti-p140, and anti-p155\\/140, the other autoantibody recently described in juvenile DM. DNA samples from 100 Caucasian children with myositis were genotyped for HLA class II haplotype associations and compared with those from 864 randomly selected UK Caucasian control subjects. RESULTS: Sera from 37 (23%) of 162 patients with juvenile myositis were positive for anti-p140 autoantibodies, which were detected exclusively in patients with juvenile DM and not in patients with juvenile DM-overlap syndrome or control subjects. No anti-p140 antibody-positive patients were positive for other recognized autoantibodies. Immunodepletion suggested that the identity of p140 was consistent with NXP-2 (the previously identified MJ autoantigen). In children with anti-p140 antibodies, the association with calcinosis was significant compared with the rest of the cohort (corrected P < 0.005, odds ratio 7.0, 95% confidence interval 3.0-16.1). The clinical features of patients with anti-p140 autoantibodies were different from those of children with anti-p155\\/140 autoantibodies. The presence of HLA-DRB1*08 was a possible risk factor for anti-p140 autoantibody positivity. CONCLUSION: This study has established that anti-p140 autoantibodies represent a major autoantibody subset in juvenile DM. This specificity may identify a further immunogenetic and clinical phenotype within the

Skewed Binary Search Trees

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Moruz, Gabriel

2006-01-01

It is well-known that to minimize the number of comparisons a binary search tree should be perfectly balanced. Previous work has shown that a dominating factor over the running time for a search is the number of cache faults performed, and that an appropriate memory layout of a binary search tree...... can reduce the number of cache faults by several hundred percent. Motivated by the fact that during a search branching to the left or right at a node does not necessarily have the same cost, e.g. because of branch prediction schemes, we in this paper study the class of skewed binary search trees....... For all nodes in a skewed binary search tree the ratio between the size of the left subtree and the size of the tree is a fixed constant (a ratio of 1/2 gives perfect balanced trees). In this paper we present an experimental study of various memory layouts of static skewed binary search trees, where each...

Making CSB + -Trees Processor Conscious

DEFF Research Database (Denmark)

Samuel, Michael; Pedersen, Anders Uhl; Bonnet, Philippe

2005-01-01

of the CSB+-tree. We argue that it is necessary to consider a larger group of parameters in order to adapt CSB+-tree to processor architectures as different as Pentium and Itanium. We identify this group of parameters and study how it impacts the performance of CSB+-tree on Itanium 2. Finally, we propose......Cache-conscious indexes, such as CSB+-tree, are sensitive to the underlying processor architecture. In this paper, we focus on how to adapt the CSB+-tree so that it performs well on a range of different processor architectures. Previous work has focused on the impact of node size on the performance...... a systematic method for adapting CSB+-tree to new platforms. This work is a first step towards integrating CSB+-tree in MySQL’s heap storage manager....

A numerical dressing method for the nonlinear superposition of solutions of the KdV equation

International Nuclear Information System (INIS)

Trogdon, Thomas; Deconinck, Bernard

2014-01-01

In this paper we present the unification of two existing numerical methods for the construction of solutions of the Korteweg–de Vries (KdV) equation. The first method is used to solve the Cauchy initial-value problem on the line for rapidly decaying initial data. The second method is used to compute finite-genus solutions of the KdV equation. The combination of these numerical methods allows for the computation of exact solutions that are asymptotically (quasi-)periodic finite-gap solutions and are a nonlinear superposition of dispersive, soliton and (quasi-)periodic solutions in the finite (x, t)-plane. Such solutions are referred to as superposition solutions. We compute these solutions accurately for all values of x and t. (paper)

A multidimensionally consistent version of Hirota’s discrete KdV equation

International Nuclear Information System (INIS)

Atkinson, James

2012-01-01

A multidimensionally consistent generalization of Hirota’s discrete KdV equation is proposed, it is a quad equation defined by a polynomial that is quadratic in each variable. Soliton solutions and interpretation of the model as superposition principle are given. It is discussed how an important property of the defining polynomial, a factorization of discriminants, appears also in the few other known discrete integrable multi-quadratic models. (fast track communication)

The fractional coupled KdV equations: Exact solutions and white noise functional approach

International Nuclear Information System (INIS)

Ghany, Hossam A.; El Bab, A. S. Okb; Zabel, A. M.; Hyder, Abd-Allah

2013-01-01

Variable coefficients and Wick-type stochastic fractional coupled KdV equations are investigated. By using the modified fractional sub-equation method, Hermite transform, and white noise theory the exact travelling wave solutions and white noise functional solutions are obtained, including the generalized exponential, hyperbolic, and trigonometric types. (general)

Above- and belowground responses to tree thinning depend on the treatment of tree debris

Science.gov (United States)

Suzanne M. Owen; Carolyn Hull Sieg; Catherine A. Gehring; Matthew A. Bowker

2009-01-01

Mechanical mastication is increasingly prescribed for wildfire mitigation, yet little is known about the ecological impacts of this fuels treatment. Mastication shreds trees into woodchips as an alternative to tree thinning and burning the resulting slash, which can create soil disturbances that favor exotic plants. Previous research on mastication has not...

Tree-based solvers for adaptive mesh refinement code FLASH - I: gravity and optical depths

Science.gov (United States)

Wünsch, R.; Walch, S.; Dinnbier, F.; Whitworth, A.

2018-04-01

We describe an OctTree algorithm for the MPI parallel, adaptive mesh refinement code FLASH, which can be used to calculate the gas self-gravity, and also the angle-averaged local optical depth, for treating ambient diffuse radiation. The algorithm communicates to the different processors only those parts of the tree that are needed to perform the tree-walk locally. The advantage of this approach is a relatively low memory requirement, important in particular for the optical depth calculation, which needs to process information from many different directions. This feature also enables a general tree-based radiation transport algorithm that will be described in a subsequent paper, and delivers excellent scaling up to at least 1500 cores. Boundary conditions for gravity can be either isolated or periodic, and they can be specified in each direction independently, using a newly developed generalization of the Ewald method. The gravity calculation can be accelerated with the adaptive block update technique by partially re-using the solution from the previous time-step. Comparison with the FLASH internal multigrid gravity solver shows that tree-based methods provide a competitive alternative, particularly for problems with isolated or mixed boundary conditions. We evaluate several multipole acceptance criteria (MACs) and identify a relatively simple approximate partial error MAC which provides high accuracy at low computational cost. The optical depth estimates are found to agree very well with those of the RADMC-3D radiation transport code, with the tree-solver being much faster. Our algorithm is available in the standard release of the FLASH code in version 4.0 and later.

Parental anxiety associated with Kawasaki disease in previously healthy children.

Science.gov (United States)

Chahal, Nita; Clarizia, Nadia A; McCrindle, Brian W; Boydell, Katherine M; Obadia, Maya; Manlhiot, Cedric; Dillenburg, Rejane; Yeung, Rae S M

2010-01-01

The objective of this study was to explore the lived experience of parents of children diagnosed with Kawasaki disease (KD) and to identify factors associated with increased levels of parental anxiety. Three focus groups were conducted including 25 parents of 17 patients with KD, seven (41%) of whom had coronary artery complications. A conceptual model was developed to depict parental experiences and illustrate the key issues related to heightened anxiety. Themes identified included anxiety related to the child's sudden illness and delay in obtaining a correct diagnosis because of the lack of health care providers' awareness and knowledge regarding KD. Parents were frustrated by the lack of information available in lay language and the limited scientific knowledge regarding the long-term consequences of the disease. Parents also reported positive transformations and different perspective toward challenges in life. However, the parents of children with coronary artery complications expressed persistent anxiety even years after the acute phase of the illness due to the uncertainty of the long-term prognosis. There remains a critical need for richly textured research data on the perspective and experience of families of children with KD. Copyright 2010 National Association of Pediatric Nurse Practitioners. Published by Mosby, Inc. All rights reserved.

Exploiting Symmetry on Parallel Architectures.

Science.gov (United States)

Stiller, Lewis Benjamin

1995-01-01

This thesis describes techniques for the design of parallel programs that solve well-structured problems with inherent symmetry. Part I demonstrates the reduction of such problems to generalized matrix multiplication by a group-equivariant matrix. Fast techniques for this multiplication are described, including factorization, orbit decomposition, and Fourier transforms over finite groups. Our algorithms entail interaction between two symmetry groups: one arising at the software level from the problem's symmetry and the other arising at the hardware level from the processors' communication network. Part II illustrates the applicability of our symmetry -exploitation techniques by presenting a series of case studies of the design and implementation of parallel programs. First, a parallel program that solves chess endgames by factorization of an associated dihedral group-equivariant matrix is described. This code runs faster than previous serial programs, and discovered it a number of results. Second, parallel algorithms for Fourier transforms for finite groups are developed, and preliminary parallel implementations for group transforms of dihedral and of symmetric groups are described. Applications in learning, vision, pattern recognition, and statistics are proposed. Third, parallel implementations solving several computational science problems are described, including the direct n-body problem, convolutions arising from molecular biology, and some communication primitives such as broadcast and reduce. Some of our implementations ran orders of magnitude faster than previous techniques, and were used in the investigation of various physical phenomena.

Study on the scope of fault tree method applicability

International Nuclear Information System (INIS)

Ito, Taiju

1980-03-01

In fault tree analysis of the reliability of nuclear safety system, including reliability analysis of nuclear protection system, there seem to be some documents in which application of the fault tree method is unreasonable. In fault tree method, the addition rule and the multiplication rule are usually used. The addition rule and the multiplication rule must hold exactly or at least practically. The addition rule has no problem but the multiplication rule has occasionally some problem. For unreliability, mean unavailability and instantaneous unavailability of the elements, holding or not of the multiplication rule has been studied comprehensively. Between the unreliability of each element without maintenance, the multiplication rule holds. Between the instantaneous unavailability of each element, with maintenance or not, the multiplication rule also holds. Between the unreliability of each subsystem with maintenance, however, the multiplication rule does not hold, because the product value is larger than the value of unreliability for a parallel system consisting of the two subsystems with maintenance. Between the mean unavailability of each element without maintenance, the multiplication rule also does not hold, because the product value is smaller than the value of mean unavailability for a parallel system consisting of the two elements without maintenance. In these cases, therefore, the fault tree method may not be applied by rote for reliability analysis of the system. (author)

Creating ensembles of oblique decision trees with evolutionary algorithms and sampling

Science.gov (United States)

Cantu-Paz, Erick [Oakland, CA; Kamath, Chandrika [Tracy, CA

2006-06-13

A decision tree system that is part of a parallel object-oriented pattern recognition system, which in turn is part of an object oriented data mining system. A decision tree process includes the step of reading the data. If necessary, the data is sorted. A potential split of the data is evaluated according to some criterion. An initial split of the data is determined. The final split of the data is determined using evolutionary algorithms and statistical sampling techniques. The data is split. Multiple decision trees are combined in ensembles.

Tree-root control of shallow landslides

Science.gov (United States)

Cohen, Denis; Schwarz, Massimiliano

2017-08-01

Tree roots have long been recognized to increase slope stability by reinforcing the strength of soils. Slope stability models usually include the effects of roots by adding an apparent cohesion to the soil to simulate root strength. No model includes the combined effects of root distribution heterogeneity, stress-strain behavior of root reinforcement, or root strength in compression. Recent field observations, however, indicate that shallow landslide triggering mechanisms are characterized by differential deformation that indicates localized activation of zones in tension, compression, and shear in the soil. Here we describe a new model for slope stability that specifically considers these effects. The model is a strain-step discrete element model that reproduces the self-organized redistribution of forces on a slope during rainfall-triggered shallow landslides. We use a conceptual sigmoidal-shaped hillslope with a clearing in its center to explore the effects of tree size, spacing, weak zones, maximum root-size diameter, and different root strength configurations. Simulation results indicate that tree roots can stabilize slopes that would otherwise fail without them and, in general, higher root density with higher root reinforcement results in a more stable slope. The variation in root stiffness with diameter can, in some cases, invert this relationship. Root tension provides more resistance to failure than root compression but roots with both tension and compression offer the best resistance to failure. Lateral (slope-parallel) tension can be important in cases when the magnitude of this force is comparable to the slope-perpendicular tensile force. In this case, lateral forces can bring to failure tree-covered areas with high root reinforcement. Slope failure occurs when downslope soil compression reaches the soil maximum strength. When this occurs depends on the amount of root tension upslope in both the slope-perpendicular and slope-parallel directions. Roots

A scalable method for parallelizing sampling-based motion planning algorithms

KAUST Repository

Jacobs, Sam Ade; Manavi, Kasra; Burgos, Juan; Denny, Jory; Thomas, Shawna; Amato, Nancy M.

2012-01-01

This paper describes a scalable method for parallelizing sampling-based motion planning algorithms. It subdivides configuration space (C-space) into (possibly overlapping) regions and independently, in parallel, uses standard (sequential) sampling-based planners to construct roadmaps in each region. Next, in parallel, regional roadmaps in adjacent regions are connected to form a global roadmap. By subdividing the space and restricting the locality of connection attempts, we reduce the work and inter-processor communication associated with nearest neighbor calculation, a critical bottleneck for scalability in existing parallel motion planning methods. We show that our method is general enough to handle a variety of planning schemes, including the widely used Probabilistic Roadmap (PRM) and Rapidly-exploring Random Trees (RRT) algorithms. We compare our approach to two other existing parallel algorithms and demonstrate that our approach achieves better and more scalable performance. Our approach achieves almost linear scalability on a 2400 core LINUX cluster and on a 153,216 core Cray XE6 petascale machine. © 2012 IEEE.

A scalable method for parallelizing sampling-based motion planning algorithms

KAUST Repository

Jacobs, Sam Ade

2012-05-01

This paper describes a scalable method for parallelizing sampling-based motion planning algorithms. It subdivides configuration space (C-space) into (possibly overlapping) regions and independently, in parallel, uses standard (sequential) sampling-based planners to construct roadmaps in each region. Next, in parallel, regional roadmaps in adjacent regions are connected to form a global roadmap. By subdividing the space and restricting the locality of connection attempts, we reduce the work and inter-processor communication associated with nearest neighbor calculation, a critical bottleneck for scalability in existing parallel motion planning methods. We show that our method is general enough to handle a variety of planning schemes, including the widely used Probabilistic Roadmap (PRM) and Rapidly-exploring Random Trees (RRT) algorithms. We compare our approach to two other existing parallel algorithms and demonstrate that our approach achieves better and more scalable performance. Our approach achieves almost linear scalability on a 2400 core LINUX cluster and on a 153,216 core Cray XE6 petascale machine. © 2012 IEEE.

Parallel processing from applications to systems

CERN Document Server

Moldovan, Dan I

1993-01-01

This text provides one of the broadest presentations of parallelprocessing available, including the structure of parallelprocessors and parallel algorithms. The emphasis is on mappingalgorithms to highly parallel computers, with extensive coverage ofarray and multiprocessor architectures. Early chapters provideinsightful coverage on the analysis of parallel algorithms andprogram transformations, effectively integrating a variety ofmaterial previously scattered throughout the literature. Theory andpractice are well balanced across diverse topics in this concisepresentation. For exceptional cla

Determination of solid-liquid partition coefficients (Kd) for the herbicides isoproturon and trifluralin in five UK agricultural soils.

Science.gov (United States)

Cooke, Cindy M; Shaw, George; Collins, Chris D

2004-12-01

Isoproturon and trifluralin are herbicides of contrasting chemical characters and modes of action. Standard batch sorption procedures were carried out to investigate the individual sorption behaviour of 14C-isoproturon and 14C-trifluralin in five agricultural soils (1.8-4.2% OC), and the soil solid-liquid partition coefficients (Kd values) were determined. Trifluralin exhibited strong partitioning to the soil solid phase (Kd range 106-294) and low desorption potential, thus should not pose a threat to sensitive waters via leaching, although particle erosion and preferential flow pathways may facilitate transport. For isoproturon, soil adsorption was low (Kd range 1.96-5.75) and desorption was high, suggesting a high leaching potential, consistent with isoproturon being the most frequently found pesticide in UK surface waters. Soil partitioning was directly related to soil organic carbon (OC) content. Accumulation isotherms were modelled using a dual-phase adsorption model to estimate adsorption and desorption rate coefficients. Associations between herbicides and soil humic substances were also shown using gel filtration chromatography.

Tree felling: a necessary evil

CERN Multimedia

CERN Bulletin

2013-01-01

CERN started a campaign of tree felling in 2010 for safety reasons, and it will continue this year in various parts of the Meyrin site. As in previous years, the trees cut down in 2013 will be recycled and some will be replaced.   Diseased tree that had to be cut down on the Meyrin site. In association with the Geneva nature and countryside directorate (Direction générale de la nature et du paysage, DGNP), CERN commissioned the Geneva school of landscaping, engineering and architecture (Haute école du paysage, d’ingénierie et d’architecture, HEPIA) to compile an inventory of the trees on the Meyrin site. In total, 1285 trees (excluding poplars) were recorded. 75.5% of these trees were declared to be in a good state of health (i.e. 971 trees), 21.5% in a moderate state of health (276 trees) and 3% in a poor state of health (38 trees). As for the poplars, the 236 specimens recorded on the Meyrin site were judged to be too old, to...

The dynamics of strangling among forest trees.

Science.gov (United States)

Okamoto, Kenichi W

2015-11-07

Strangler trees germinate and grow on other trees, eventually enveloping and potentially even girdling their hosts. This allows them to mitigate fitness costs otherwise incurred by germinating and competing with other trees on the forest floor, as well as minimize risks associated with host tree-fall. If stranglers can themselves host other strangler trees, they may not even seem to need non-stranglers to persist. Yet despite their high fitness potential, strangler trees neither dominate the communities in which they occur nor is the strategy particularly common outside of figs (genus Ficus). Here we analyze how dynamic interactions between strangling and non-strangling trees can shape the adaptive landscape for strangling mutants and mutant trees that have lost the ability to strangle. We find a threshold which strangler germination rates must exceed for selection to favor the evolution of strangling, regardless of how effectively hemiepiphytic stranglers may subsequently replace their hosts. This condition describes the magnitude of the phenotypic displacement in the ability to germinate on other trees necessary for invasion by a mutant tree that could potentially strangle its host following establishment as an epiphyte. We show how the relative abilities of strangling and non-strangling trees to occupy empty sites can govern whether strangling is an evolutionarily stable strategy, and obtain the conditions for strangler coexistence with non-stranglers. We then elucidate when the evolution of strangling can disrupt stable coexistence between commensal epiphytic ancestors and their non-strangling host trees. This allows us to highlight parallels between the invasion fitness of strangler trees arising from commensalist ancestors, and cases where strangling can arise in concert with the evolution of hemiepiphytism among free-standing ancestors. Finally, we discuss how our results can inform the evolutionary ecology of antagonistic interactions more generally

Parallel Boltzmann machines : a mathematical model

NARCIS (Netherlands)

Zwietering, P.J.; Aarts, E.H.L.

1991-01-01

A mathematical model is presented for the description of parallel Boltzmann machines. The framework is based on the theory of Markov chains and combines a number of previously known results into one generic model. It is argued that parallel Boltzmann machines maximize a function consisting of a

Evaluating realized genetic gains from tree improvement.

Science.gov (United States)

J.B. St. Clair

1993-01-01

Tree improvement has become an essential part of the management of forest lands for wood production, and predicting yields and realized gains from forests planted with genetically-improved trees will become increasingly important. This paper discusses concepts of tree improvement and genetic gain important to growth and yield modeling, and reviews previous studies of...

Optimization approaches to mpi and area merging-based parallel buffer algorithm

Directory of Open Access Journals (Sweden)

Junfu Fan

Full Text Available On buffer zone construction, the rasterization-based dilation method inevitably introduces errors, and the double-sided parallel line method involves a series of complex operations. In this paper, we proposed a parallel buffer algorithm based on area merging and MPI (Message Passing Interface to improve the performances of buffer analyses on processing large datasets. Experimental results reveal that there are three major performance bottlenecks which significantly impact the serial and parallel buffer construction efficiencies, including the area merging strategy, the task load balance method and the MPI inter-process results merging strategy. Corresponding optimization approaches involving tree-like area merging strategy, the vertex number oriented parallel task partition method and the inter-process results merging strategy were suggested to overcome these bottlenecks. Experiments were carried out to examine the performance efficiency of the optimized parallel algorithm. The estimation results suggested that the optimization approaches could provide high performance and processing ability for buffer construction in a cluster parallel environment. Our method could provide insights into the parallelization of spatial analysis algorithm.

Construction of type-II Bäcklund transformation for the mKdV hierarchy

International Nuclear Information System (INIS)

Gomes, J F; Retore, A L; Zimerman, A H

2015-01-01

From an algebraic construction of the mKdV hierarchy we observe that the space component of the Lax operator plays the role of a universal algebraic object. This fact induces the universality of a gauge transformation that relates two field configurations of a given member of the hierarchy. Such gauge transformation generates the Bäcklund transformation (BT). In this paper we propose a systematic construction of BT for the entire mKdV hierarchy from the known type-II BT of the sinh-Gordon theory. We explicitly construct the BT of the first few integrable models associated to positive and negative grade-time evolutions. Solutions of these transformations for several cases describing the transition from vacuum–vacuum and the vacuum to one-soliton solutions which determines the value for the auxiliary field and the Bäcklund parameter respectively, independently of the model. The same follows for the scattering of two one-soliton solutions. The resultant delay is determined by a condition independent of the model considered. (paper)

Hypergraph partitioning implementation for parallelizing matrix-vector multiplication using CUDA GPU-based parallel computing

Science.gov (United States)

Murni, Bustamam, A.; Ernastuti, Handhika, T.; Kerami, D.

2017-07-01

Calculation of the matrix-vector multiplication in the real-world problems often involves large matrix with arbitrary size. Therefore, parallelization is needed to speed up the calculation process that usually takes a long time. Graph partitioning techniques that have been discussed in the previous studies cannot be used to complete the parallelized calculation of matrix-vector multiplication with arbitrary size. This is due to the assumption of graph partitioning techniques that can only solve the square and symmetric matrix. Hypergraph partitioning techniques will overcome the shortcomings of the graph partitioning technique. This paper addresses the efficient parallelization of matrix-vector multiplication through hypergraph partitioning techniques using CUDA GPU-based parallel computing. CUDA (compute unified device architecture) is a parallel computing platform and programming model that was created by NVIDIA and implemented by the GPU (graphics processing unit).

An efficient and extensible approach for compressing phylogenetic trees

KAUST Repository

Matthews, Suzanne J; Williams, Tiffani L

2011-01-01

Background: Biologists require new algorithms to efficiently compress and store their large collections of phylogenetic trees. Our previous work showed that TreeZip is a promising approach for compressing phylogenetic trees. In this paper, we extend

Parallel interactive data analysis with PROOF

International Nuclear Information System (INIS)

Ballintijn, Maarten; Biskup, Marek; Brun, Rene; Canal, Philippe; Feichtinger, Derek; Ganis, Gerardo; Kickinger, Guenter; Peters, Andreas; Rademakers, Fons

2006-01-01

The Parallel ROOT Facility, PROOF, enables the analysis of much larger data sets on a shorter time scale. It exploits the inherent parallelism in data of uncorrelated events via a multi-tier architecture that optimizes I/O and CPU utilization in heterogeneous clusters with distributed storage. The system provides transparent and interactive access to gigabytes today. Being part of the ROOT framework PROOF inherits the benefits of a performant object storage system and a wealth of statistical and visualization tools. This paper describes the data analysis model of ROOT and the latest developments on closer integration of PROOF into that model and the ROOT user environment, e.g. support for PROOF-based browsing of trees stored remotely, and the popular TTree::Draw() interface. We also outline the ongoing developments aimed to improve the flexibility and user-friendliness of the system

The Tree Drought Emission MONitor (Tree DEMON, an innovative system for assessing biogenic volatile organic compounds emission from plants

Directory of Open Access Journals (Sweden)

Marvin Lüpke

2017-03-01

Full Text Available Abstract Background Biogenic volatile organic compounds (BVOC emitted by plants play an important role for ecological and physiological processes, for example as response to stressors. These emitted compounds are involved in chemical processes within the atmosphere and contribute to the formation of aerosols and ozone. Direct measurement of BVOC emissions requires a specialized sample system in order to obtain repeatable and comparable results. These systems need to be constructed carefully since BVOC measurements may be disturbed by several side effects, e.g., due to wrong material selection and lacking system stability. Results In order to assess BVOC emission rates, a four plant chamber system was constructed, implemented and throughout evaluated by synthetic tests and in two case studies on 3-year-old sweet chestnut seedlings. Synthetic system test showed a stable sampling with good repeatability and low memory effects. The first case study demonstrated the capability of the system to screen multiple trees within a few days and revealed three different emission patterns of sweet chestnut trees. The second case study comprised an application of drought stress on two seedlings compared to two in parallel assessed seedlings of a control. Here, a clear reduction of BVOC emissions during drought stress was observed. Conclusion The developed system allows assessing BVOC as well as CO2 and water vapor gas exchange of four tree specimens automatically and in parallel with repeatable results. A canopy volume of 30 l can be investigated, which constitutes in case of tree seedlings the whole canopy. Longer lasting experiments of e.g., 1–3 weeks can be performed easily without any significant plant interference.

The Applicability of the Distribution Coefficient, KD, Based on Non-Aggregated Particulate Samples from Lakes with Low Suspended Solids Concentrations.

Directory of Open Access Journals (Sweden)

Aine Marie Gormley-Gallagher

Full Text Available Separate phases of metal partitioning behaviour in freshwater lakes that receive varying degrees of atmospheric contamination and have low concentrations of suspended solids were investigated to determine the applicability of the distribution coefficient, KD. Concentrations of Pb, Ni, Co, Cu, Cd, Cr, Hg and Mn were determined using a combination of filtration methods, bulk sample collection and digestion and Inductively Coupled Plasma-Mass Spectrometry (ICP-MS. Phytoplankton biomass, suspended solids concentrations and the organic content of the sediment were also analysed. By distinguishing between the phytoplankton and (inorganic lake sediment, transient variations in KD were observed. Suspended solids concentrations over the 6-month sampling campaign showed no correlation with the KD (n = 15 for each metal, p > 0.05 for Mn (r2 = 0.0063, Cu (r2 = 0.0002, Cr (r2 = 0.021, Ni (r2 = 0.0023, Cd (r2 = 0.00001, Co (r2 = 0.096, Hg (r2 = 0.116 or Pb (r2 = 0.164. The results implied that colloidal matter had less opportunity to increase the dissolved (filter passing fraction, which inhibited the spurious lowering of KD. The findings conform to the increasingly documented theory that the use of KD in modelling may mask true information on metal partitioning behaviour. The root mean square error of prediction between the directly measured total metal concentrations and those modelled based on the separate phase fractions were ± 3.40, 0.06, 0.02, 0.03, 0.44, 484.31, 80.97 and 0.1 μg/L for Pb, Cd, Mn, Cu, Hg, Ni, Cr and Co respectively. The magnitude of error suggests that the separate phase models for Mn and Cu can be used in distribution or partitioning models for these metals in lake water.

Deuteron momentum distribution in KD2PO4

International Nuclear Information System (INIS)

Reiter, G; Shukla, A; Platzman, P M; Mayers, J

2008-01-01

The momentum distribution in KD 2 PO 4 (DKDP) has been measured using neutron Compton scattering above and below the weakly first-order paraelectric-ferroelectric phase transition (T=229 K). There is very little difference between the two distributions, and no sign of the coherence over two locations for the proton observed in the paraelectric phase, as in KH 2 PO 4 (KDP). We conclude that the tunnel splitting must be much less than 20 meV. The width of the distribution indicates that the effective potential for DKDP is significantly softer than that for KDP. As electronic structure calculations indicate that the stiffness of the potential increases with the size of the coherent region locally undergoing soft mode fluctuations, we conclude that there is a mass-dependent quantum coherence length in both systems

The spectral dimension of random trees

International Nuclear Information System (INIS)

Destri, Claudio; Donetti, Luca

2002-01-01

We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a by-product, we obtain evidence in favour of a new scaling hypothesis for the Gaussian model on generic bounded graphs and in favour of a previously conjectured exact relation between spectral and connectivity dimensions on more general tree-like structures

Current and Potential Tree Locations in Tree Line Ecotone of Changbai Mountains, Northeast China: The Controlling Effects of Topography

OpenAIRE

Zong, Shengwei; Wu, Zhengfang; Xu, Jiawei; Li, Ming; Gao, Xiaofeng; He, Hongshi; Du, Haibo; Wang, Lei

2014-01-01

Tree line ecotone in the Changbai Mountains has undergone large changes in the past decades. Tree locations show variations on the four sides of the mountains, especially on the northern and western sides, which has not been fully explained. Previous studies attributed such variations to the variations in temperature. However, in this study, we hypothesized that topographic controls were responsible for causing the variations in the tree locations in tree line ecotone of the Changbai Mountain...

Tree-root control of shallow landslides

Directory of Open Access Journals (Sweden)

D. Cohen

2017-08-01

Full Text Available Tree roots have long been recognized to increase slope stability by reinforcing the strength of soils. Slope stability models usually include the effects of roots by adding an apparent cohesion to the soil to simulate root strength. No model includes the combined effects of root distribution heterogeneity, stress-strain behavior of root reinforcement, or root strength in compression. Recent field observations, however, indicate that shallow landslide triggering mechanisms are characterized by differential deformation that indicates localized activation of zones in tension, compression, and shear in the soil. Here we describe a new model for slope stability that specifically considers these effects. The model is a strain-step discrete element model that reproduces the self-organized redistribution of forces on a slope during rainfall-triggered shallow landslides. We use a conceptual sigmoidal-shaped hillslope with a clearing in its center to explore the effects of tree size, spacing, weak zones, maximum root-size diameter, and different root strength configurations. Simulation results indicate that tree roots can stabilize slopes that would otherwise fail without them and, in general, higher root density with higher root reinforcement results in a more stable slope. The variation in root stiffness with diameter can, in some cases, invert this relationship. Root tension provides more resistance to failure than root compression but roots with both tension and compression offer the best resistance to failure. Lateral (slope-parallel tension can be important in cases when the magnitude of this force is comparable to the slope-perpendicular tensile force. In this case, lateral forces can bring to failure tree-covered areas with high root reinforcement. Slope failure occurs when downslope soil compression reaches the soil maximum strength. When this occurs depends on the amount of root tension upslope in both the slope-perpendicular and slope-parallel

A modified KdV equation with self-consistent sources in non-uniform media and soliton dynamics

International Nuclear Information System (INIS)

Zhang Dajun; Bi Jinbo; Hao Honghai

2006-01-01

Two non-isospectral modified KdV equations with self-consistent sources are derived, which correspond to the time-dependent spectral parameter λ satisfying λ t = λ and λ t = λ 3 , respectively. Gauge transformation between the first non-isospectral equation (corresponding to λ t = λ) and its isospectral counterpart is given, from which exact solutions and conservation laws for the non-isospectral one are easily listed. Besides, solutions to the two non-isospectral modified KdV equations with self-consistent sources are derived by means of the Hirota method and the Wronskian technique, respectively. Non-isospectral dynamics and source effects, including one-soliton characteristics in non-uniform media, two-solitons scattering and special behaviours related to sources (for example, the 'ghost' solitons in the degenerate two-soliton case), are investigated analytically

Etude de la transition ferroelectrique-ferroelastique du KD2PO4 forme du front de phase en fonction du gradient thermique

OpenAIRE

Kvítek, Zdeněk

2010-01-01

Etude de la transition ferroelectrique-ferroelastique du KD2PO4 forme du front de phase en fonction du gradient thermique The thesis explores complex process of first order transition of KD2PO4 crystal from tetragonal phase to ferroelectric - ferroelastic orthorhombic phase and back at temperature 209 K. The experimental set up of nitrogeneous cryostat allowes temperature and temperature gradient variations during simultaneous three axes optical sample observations, dielectric measurements. T...

Computing the Quartet Distance Between Evolutionary Trees in Time O(n log n)

DEFF Research Database (Denmark)

Brodal, Gerth Sølfting; Fagerberg, Rolf; Pedersen, Christian Nørgaard Storm

2003-01-01

Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is therefore an important task. The quartet distance is a distance measure between trees previously proposed by Estabrook, McMorris, and ...... unrooted evolutionary trees of n species, where all internal nodes have degree three, in time O(n log n. The previous best algorithm for the problem uses time O(n 2).......Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is therefore an important task. The quartet distance is a distance measure between trees previously proposed by Estabrook, Mc......Morris, and Meacham. The quartet distance between two unrooted evolutionary trees is the number of quartet topology differences between the two trees, where a quartet topology is the topological subtree induced by four species. In this paper we present an algorithm for computing the quartet distance between two...

N = 4 Toda chain (KdV) hierarchy in N = 4 superspace

International Nuclear Information System (INIS)

Sorin, A.S.

2002-01-01

The Lax pair and Hamiltonian formulations are presented for the N = 4 supersymmetric Toda chain (KdV) hierarchy in N = 4 superspace. The general formulas for an infinite tower of its bosonic flows in terms of the Lax operator in N = 4 superspace are derived, and five real forms of the hierarchy are presented. New N = 4 superfield bases in which the flows are local are discussed. A relation between the two descriptions of the hierarchy in N = 4 superspace used in the literature is established

An automatic way of finding robust elimination trees for a multi-frontal sparse solver for radical 2D hierarchical meshes

KAUST Repository

AbouEisha, Hassan M.

2014-01-01

In this paper we present a dynamic programming algorithm for finding optimal elimination trees for the multi-frontal direct solver algorithm executed over two dimensional meshes with point singularities. The elimination tree found by the optimization algorithm results in a linear computational cost of sequential direct solver. Based on the optimal elimination tree found by the optimization algorithm we construct heuristic sequential multi-frontal direct solver algorithm resulting in a linear computational cost as well as heuristic parallel multi-frontal direct solver algorithm resulting in a logarithmic computational cost. The resulting parallel algorithm is implemented on NVIDIA CUDA GPU architecture based on our graph-grammar approach. © 2014 Springer-Verlag.

A network of hydrophobic residues impeding helix alphaC rotation maintains latency of kinase Gcn2, which phosphorylates the alpha subunit of translation initiation factor 2.

Science.gov (United States)

Gárriz, Andrés; Qiu, Hongfang; Dey, Madhusudan; Seo, Eun-Joo; Dever, Thomas E; Hinnebusch, Alan G

2009-03-01

Kinase Gcn2 is activated by amino acid starvation and downregulates translation initiation by phosphorylating the alpha subunit of translation initiation factor 2 (eIF2alpha). The Gcn2 kinase domain (KD) is inert and must be activated by tRNA binding to the adjacent regulatory domain. Previous work indicated that Saccharomyces cerevisiae Gcn2 latency results from inflexibility of the hinge connecting the N and C lobes and a partially obstructed ATP-binding site in the KD. Here, we provide strong evidence that a network of hydrophobic interactions centered on Leu-856 also promotes latency by constraining helix alphaC rotation in the KD in a manner relieved during amino acid starvation by tRNA binding and autophosphorylation of Thr-882 in the activation loop. Thus, we show that mutationally disrupting the hydrophobic network in various ways constitutively activates eIF2alpha phosphorylation in vivo and bypasses the requirement for a key tRNA binding motif (m2) and Thr-882 in Gcn2. In particular, replacing Leu-856 with any nonhydrophobic residue activates Gcn2, while substitutions with various hydrophobic residues maintain kinase latency. We further provide strong evidence that parallel, back-to-back dimerization of the KD is a step on the Gcn2 activation pathway promoted by tRNA binding and autophosphorylation. Remarkably, mutations that disrupt the L856 hydrophobic network or enhance hinge flexibility eliminate the need for the conserved salt bridge at the parallel dimer interface, implying that KD dimerization facilitates the reorientation of alphaC and remodeling of the active site for enhanced ATP binding and catalysis. We propose that hinge remodeling, parallel dimerization, and reorientation of alphaC are mutually reinforcing conformational transitions stimulated by tRNA binding and secured by the ensuing autophosphorylation of T882 for stable kinase activation.

GRADSPH: A parallel smoothed particle hydrodynamics code for self-gravitating astrophysical fluid dynamics

NARCIS (Netherlands)

Vanaverbeke, S.; Keppens, R.; Poedts, S.; Boffin, H.

2009-01-01

We describe the algorithms implemented in the first version of GRADSPH, a parallel, tree-based, smoothed particle hydrodynamics code for simulating self-gravitating astrophysical systems written in FORTRAN 90. The paper presents details on the implementation of the Smoothed Particle Hydro (SPH)

A tool for simulating parallel branch-and-bound methods

Science.gov (United States)

Golubeva, Yana; Orlov, Yury; Posypkin, Mikhail

2016-01-01

The Branch-and-Bound method is known as one of the most powerful but very resource consuming global optimization methods. Parallel and distributed computing can efficiently cope with this issue. The major difficulty in parallel B&B method is the need for dynamic load redistribution. Therefore design and study of load balancing algorithms is a separate and very important research topic. This paper presents a tool for simulating parallel Branchand-Bound method. The simulator allows one to run load balancing algorithms with various numbers of processors, sizes of the search tree, the characteristics of the supercomputer's interconnect thereby fostering deep study of load distribution strategies. The process of resolution of the optimization problem by B&B method is replaced by a stochastic branching process. Data exchanges are modeled using the concept of logical time. The user friendly graphical interface to the simulator provides efficient visualization and convenient performance analysis.

Validation of the Andon KD595 for clinical use and self-measurement according to the European Society of Hypertension International Protocol.

Science.gov (United States)

Wu, Ning; Zhang, Xuezhong; Wang, Wen; Zhang, Hongye

2016-04-01

This study aimed to evaluate the accuracy of the automated oscillometric upper arm blood pressure monitor Andon KD595 for home blood pressure monitoring according to the European Society of Hypertension International Protocol revision 2010. Systolic blood pressure (SBP) and diastolic blood pressure (DBP) were sequentially measured in 33 participants using the standard mercury sphygmomanometer and the Andon KD595 device. Ninety-nine pairs of comparisons were obtained from 33 participants for analysis. The KD595 device achieved the targets in part 1 of the validation study. The number of absolute differences between the device and the observers within a range of 5, 10, and 15 mmHg was 72/99, 93/99, and 96/99, respectively, for SBP and 72/99, 96/99, and 99/99, respectively, for DBP. The device also achieved the targets in part 2 of the validation study. A total of 28 and 25 participants had at least two of the three device-observer differences within 5 mmHg (required≥24) for SBP and DBP, respectively. The number of participants without device-observer difference within 5 mmHg was two for SBP and two for DBP (required≤3). The Andon upper arm blood pressure monitor KD595 has passed the International Protocol requirements and it can be recommended for clinical use and self-measurement in adults.

Validation of the Andon KD5031 for clinical use and self-measurement according to the European Society of Hypertension International Protocol.

Science.gov (United States)

Wu, Ning; Zhang, Xuezhong; Wang, Wen; Zhang, Hongye

2016-10-01

This study aimed to evaluate the accuracy of the automated oscillometric upper arm blood pressure (BP) monitor Andon KD5031 for home BP monitoring according to the European Society of Hypertension International Protocol revision 2010. Systolic blood pressure (SBP) and diastolic blood pressure (DBP) were sequentially measured in 33 participants using the standard mercury sphygmomanometer and the Andon KD5031 device. Ninety-nine pairs of comparisons were obtained from 33 participants for analysis. The KD5031 device achieved the targets in part 1 of the validation study. The number of absolute differences between the device and the observers within a range of 5, 10, and 15 mmHg was 66/99, 93/99, and 98/99, respectively, for SBP and 72/99, 94/99, and 99/99, respectively, for DBP. The device also achieved the targets in part 2 of the validation study. Twenty-six participants for both SBP and DBP had at least two of the three device-observer differences within 5 mmHg (required ≥24). The number of participants without a device-observer difference within 5 mmHg was one for SBP and three for DBP (required ≤3). The Andon upper arm BP monitor KD5031 has passed the International Protocol requirements, and it can be recommended for clinical use and self-measurement in adults.

Heating induced structural and chemical behavior of KD2PO4 in the 25 °C–215 °C temperature range

International Nuclear Information System (INIS)

Botez, Cristian E.; Morris, Joshua L.; Encerrado Manriquez, Andres J.; Anchondo, Adan

2013-01-01

We have used powder x-ray diffraction (XRD) to investigate the structural and chemical modifications undergone by KD 2 PO 4 (DKDP) upon heating from room temperature to 215 °C. Full-profile (Le Bail) analysis of our temperature-resolved data shows no evidence of polymorphic structural transitions or deuterium–hydrogen isotope exchange occurring below T s = 185 °C. The lattice parameters of DKDP vary smoothly upon heating to T s and are 0.2% to 0.6% greater than those of its isostructural hydrogenated counterpart KH 2 PO 4 (KDP). In addition, XRD isotherms collected at T s demonstrate the structural and chemical stability of the title compound at this temperature over a 10.5 h time period. Upon further heating, however, the tetragonal DKDP phase becomes unstable, as evidenced by its transition to a monoclinic DKDP modification and eventual chemical decomposition via dehydration. - Highlights: • Structural and chemical behavior of KD 2 PO 4 is investigated upon heating to 215 °C • No polymorphic transitions or deuterium-hydrogen isotope exchange below T s = 185 °C • KD 2 PO 4 is structurally and chemically stable at T s over a 10.5 h time period • KD 2 PO 4 chemically decomposes via dehydration upon heating above T d = 195 °C

On the nonlinear stability of mKdV breathers

Science.gov (United States)

Alejo, Miguel A.; Muñoz, Claudio

2012-11-01

Breather modes of the mKdV equation on the real line are known to be elastic under collisions with other breathers and solitons. This fact indicates very strong stability properties of breathers. In this communication we describe a rigorous, mathematical proof of the stability of breathers under a class of small perturbations. Our proof involves the existence of a nonlinear equation satisfied by all breather profiles, and a new Lyapunov functional which controls the dynamics of small perturbations and instability modes. In order to construct such a functional, we work in a subspace of the energy one. However, our proof introduces new ideas in order to attack the corresponding stability problem in the energy space. Some remarks about the sine-Gordon case are also considered.

Parallel algorithms for continuum dynamics

International Nuclear Information System (INIS)

Hicks, D.L.; Liebrock, L.M.

1987-01-01

Simply porting existing parallel programs to a new parallel processor may not achieve the full speedup possible; to achieve the maximum efficiency may require redesigning the parallel algorithms for the specific architecture. The authors discuss here parallel algorithms that were developed first for the HEP processor and then ported to the CRAY X-MP/4, the ELXSI/10, and the Intel iPSC/32. Focus is mainly on the most recent parallel processing results produced, i.e., those on the Intel Hypercube. The applications are simulations of continuum dynamics in which the momentum and stress gradients are important. Examples of these are inertial confinement fusion experiments, severe breaks in the coolant system of a reactor, weapons physics, shock-wave physics. Speedup efficiencies on the Intel iPSC Hypercube are very sensitive to the ratio of communication to computation. Great care must be taken in designing algorithms for this machine to avoid global communication. This is much more critical on the iPSC than it was on the three previous parallel processors

Neural Parallel Engine: A toolbox for massively parallel neural signal processing.

Science.gov (United States)

Tam, Wing-Kin; Yang, Zhi

2018-05-01

Large-scale neural recordings provide detailed information on neuronal activities and can help elicit the underlying neural mechanisms of the brain. However, the computational burden is also formidable when we try to process the huge data stream generated by such recordings. In this study, we report the development of Neural Parallel Engine (NPE), a toolbox for massively parallel neural signal processing on graphical processing units (GPUs). It offers a selection of the most commonly used routines in neural signal processing such as spike detection and spike sorting, including advanced algorithms such as exponential-component-power-component (EC-PC) spike detection and binary pursuit spike sorting. We also propose a new method for detecting peaks in parallel through a parallel compact operation. Our toolbox is able to offer a 5× to 110× speedup compared with its CPU counterparts depending on the algorithms. A user-friendly MATLAB interface is provided to allow easy integration of the toolbox into existing workflows. Previous efforts on GPU neural signal processing only focus on a few rudimentary algorithms, are not well-optimized and often do not provide a user-friendly programming interface to fit into existing workflows. There is a strong need for a comprehensive toolbox for massively parallel neural signal processing. A new toolbox for massively parallel neural signal processing has been created. It can offer significant speedup in processing signals from large-scale recordings up to thousands of channels. Copyright © 2018 Elsevier B.V. All rights reserved.

The Complexity of Constructing Evolutionary Trees Using Experiments

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf; Pedersen, Christian Nørgaard Storm

2001-01-01

We present tight upper and lower bounds for the problem of constructing evolutionary trees in the experiment model. We describe an algorithm which constructs an evolutionary tree of n species in time O(nd logd n) using at most n⌈d/2⌉(log2⌈d/2⌉-1 n+O(1)) experiments for d > 2, and at most n(log n......+O(1)) experiments for d = 2, where d is the degree of the tree. This improves the previous best upper bound by a factor θ(log d). For d = 2 the previously best algorithm with running time O(n log n) had a bound of 4n log n on the number of experiments. By an explicit adversary argument, we show an Ω......(nd logd n) lower bound, matching our upper bounds and improving the previous best lower bound by a factor θ(logd n). Central to our algorithm is the construction and maintenance of separator trees of small height, which may be of independent interest....

Concurrent computation of attribute filters on shared memory parallel machines

NARCIS (Netherlands)

Wilkinson, Michael H.F.; Gao, Hui; Hesselink, Wim H.; Jonker, Jan-Eppo; Meijster, Arnold

2008-01-01

Morphological attribute filters have not previously been parallelized mainly because they are both global and nonseparable. We propose a parallel algorithm that achieves efficient parallelism for a large class of attribute filters, including attribute openings, closings, thinnings, and thickenings,

Experimental determination of the distribution coefficient (Kd) of lead and barium in soils of semiarid region of Bahia, Brazil; Determinacao experimental do coeficiente de distribuicao (Kd) de chumbo e bario em solos da regiao semiarida do estado da Bahia

Energy Technology Data Exchange (ETDEWEB)

Santos, Mariana M.; Fernandes, Heloisa H.F; Pontedeiro, Elizabeth M.; Su, Jian, E-mail: mariana@lasme.coppe.ufrj.br, E-mail: heloisa@lasme.coppe.ufrj.br, E-mail: bettinadulley@hotmail.com, E-mail: sujian@lasme.coppe.ufrj.br [Coordenacao dos Programas de Pos-Graduacao em Engenharia (COOPE/UFRJ), Rio de Janeiro, RJ (Brazil). Lab. de Simulacao e Metodos em Engenharia

2013-07-01

To determine the concentration of heavy metals and other contaminants in soils, aimed at evaluating the environmental impact, the use of the distribution coefficient is required (Kd), defined as the relationship between the concentrations adsorbed and in solution. The objective of this study was to determine the rates for the Lead and Barium metals in soil collected in Caetite, the state of Bahia, in two different depths. The importance of determining the distribution coefficient lies in the fact that being performed using a tropical soil. For the isotherms of Kd was used batch test method by adsorption to obtain the final concentrations. The first step was to determine the best ratio soil: solution obtained after equilibration time and finally the equilibrium concentration of the contaminant. Were also calculated percentages of the metal adsorbed by the soil and the amount of solute by the adsorbent. With the values obtained in experiments and using Mathematica 8.0 software, were made graphics equilibrium concentration versus quantity adsorbed (C vs. S). It can also plot isotherms for different models of Kd: linear, Langmuir and Freundlich in order to determine which adsorption model would fit best to the measured data and thus determine the distribution coefficient of the metal in the soil analyzed. The Freundlich isotherm was better adapted to the points of the two metals in both soils.

CUDT: A CUDA Based Decision Tree Algorithm

Directory of Open Access Journals (Sweden)

Win-Tsung Lo

2014-01-01

Full Text Available Decision tree is one of the famous classification methods in data mining. Many researches have been proposed, which were focusing on improving the performance of decision tree. However, those algorithms are developed and run on traditional distributed systems. Obviously the latency could not be improved while processing huge data generated by ubiquitous sensing node in the era without new technology help. In order to improve data processing latency in huge data mining, in this paper, we design and implement a new parallelized decision tree algorithm on a CUDA (compute unified device architecture, which is a GPGPU solution provided by NVIDIA. In the proposed system, CPU is responsible for flow control while the GPU is responsible for computation. We have conducted many experiments to evaluate system performance of CUDT and made a comparison with traditional CPU version. The results show that CUDT is 5∼55 times faster than Weka-j48 and is 18 times speedup than SPRINT for large data set.

Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem

Directory of Open Access Journals (Sweden)

Maan Haj Rachid

2014-01-01

Full Text Available The all-pairs suffix-prefix matching problem is a basic problem in string processing. It has an application in the de novo genome assembly task, which is one of the major bioinformatics problems. Due to the large size of the input data, it is crucial to use fast and space efficient solutions. In this paper, we present a space-economical solution to this problem using the generalized Sadakane compressed suffix tree. Furthermore, we present a parallel algorithm to provide more speed for shared memory computers. Our sequential and parallel algorithms are optimized by exploiting features of the Sadakane compressed index data structure. Experimental results show that our solution based on the Sadakane’s compressed index consumes significantly less space than the ones based on noncompressed data structures like the suffix tree and the enhanced suffix array. Our experimental results show that our parallel algorithm is efficient and scales well with increasing number of processors.

Oblique decision trees using embedded support vector machines in classifier ensembles

NARCIS (Netherlands)

Menkovski, V.; Christou, I.; Efremidis, S.

2008-01-01

Classifier ensembles have emerged in recent years as a promising research area for boosting pattern recognition systems' performance. We present a new base classifier that utilizes oblique decision tree technology based on support vector machines for the construction of oblique (non-axis parallel)

The Barley Magnesium Chelatase 150-kD Subunit Is Not an Abscisic Acid Receptor1[OA

Science.gov (United States)

Müller, André H.; Hansson, Mats

2009-01-01

Magnesium chelatase is the first unique enzyme of the chlorophyll biosynthetic pathway. It is composed of three gene products of which the largest is 150 kD. This protein was recently identified as an abscisic acid receptor in Arabidopsis (Arabidopsis thaliana). We have evaluated whether the barley (Hordeum vulgare) magnesium chelatase large subunit, XanF, could be a receptor for the phytohormone. The study involved analysis of recombinant magnesium chelatase protein as well as several induced chlorophyll-deficient magnesium chelatase mutants with defects identified at the gene and protein levels. Abscisic acid had no effect on magnesium chelatase activity and binding to the barley 150-kD protein could not be shown. Magnesium chelatase mutants showed a wild-type response in respect to postgermination growth and stomatal aperture. Our results question the function of the large magnesium chelatase subunit as an abscisic acid receptor. PMID:19176716

Soliton solutions of the two-dimensional KdV-Burgers equation by homotopy perturbation method

International Nuclear Information System (INIS)

Molabahrami, A.; Khani, F.; Hamedi-Nezhad, S.

2007-01-01

In this Letter, the He's homotopy perturbation method (HPM) to finding the soliton solutions of the two-dimensional Korteweg-de Vries Burgers' equation (tdKdVB) for the initial conditions was applied. Numerical solutions of the equation were obtained. The obtained solutions, in comparison with the exact solutions admit a remarkable accuracy. The results reveal that the HPM is very effective and simple

Towards a streaming model for nested data parallelism

DEFF Research Database (Denmark)

Madsen, Frederik Meisner; Filinski, Andrzej

2013-01-01

The language-integrated cost semantics for nested data parallelism pioneered by NESL provides an intuitive, high-level model for predicting performance and scalability of parallel algorithms with reasonable accuracy. However, this predictability, obtained through a uniform, parallelism-flattening......The language-integrated cost semantics for nested data parallelism pioneered by NESL provides an intuitive, high-level model for predicting performance and scalability of parallel algorithms with reasonable accuracy. However, this predictability, obtained through a uniform, parallelism......-processable in a streaming fashion. This semantics is directly compatible with previously proposed piecewise execution models for nested data parallelism, but allows the expected space usage to be reasoned about directly at the source-language level. The language definition and implementation are still very much work...

A tool for simulating parallel branch-and-bound methods

Directory of Open Access Journals (Sweden)

Golubeva Yana

2016-01-01

Full Text Available The Branch-and-Bound method is known as one of the most powerful but very resource consuming global optimization methods. Parallel and distributed computing can efficiently cope with this issue. The major difficulty in parallel B&B method is the need for dynamic load redistribution. Therefore design and study of load balancing algorithms is a separate and very important research topic. This paper presents a tool for simulating parallel Branchand-Bound method. The simulator allows one to run load balancing algorithms with various numbers of processors, sizes of the search tree, the characteristics of the supercomputer’s interconnect thereby fostering deep study of load distribution strategies. The process of resolution of the optimization problem by B&B method is replaced by a stochastic branching process. Data exchanges are modeled using the concept of logical time. The user friendly graphical interface to the simulator provides efficient visualization and convenient performance analysis.

Classification and Compression of Multi-Resolution Vectors: A Tree Structured Vector Quantizer Approach

Science.gov (United States)

2002-01-01

their expression profile and for classification of cells into tumerous and non- tumerous classes. Then we will present a parallel tree method for... cancerous cells. We will use the same dataset and use tree structured classifiers with multi-resolution analysis for classifying cancerous from non- cancerous ...cells. We have the expressions of 4096 genes from 98 different cell types. Of these 98, 72 are cancerous while 26 are non- cancerous . We are interested

Taï chimpanzees anticipate revisiting high-valued fruit trees from further distances.

Science.gov (United States)

Ban, Simone D; Boesch, Christophe; Janmaat, Karline R L

2014-11-01

The use of spatio-temporal memory has been argued to increase food-finding efficiency in rainforest primates. However, the exact content of this memory is poorly known to date. This study investigated what specific information from previous feeding visits chimpanzees (Pan troglodytes verus), in Taï National Park, Côte d'Ivoire, take into account when they revisit the same feeding trees. By following five adult females for many consecutive days, we tested from what distance the females directed their travels towards previously visited feeding trees and how previous feeding experiences and fruit tree properties influenced this distance. To exclude the influence of sensory cues, the females' approach distance was measured from their last significant change in travel direction until the moment they entered the tree's maximum detection field. We found that chimpanzees travelled longer distances to trees at which they had previously made food grunts and had rejected fewer fruits compared to other trees. In addition, the results suggest that the chimpanzees were able to anticipate the amount of fruit that they would find in the trees. Overall, our findings are consistent with the hypothesis that chimpanzees act upon a retrieved memory of their last feeding experiences long before they revisit feeding trees, which would indicate a daily use of long-term prospective memory. Further, the results are consistent with the possibility that positive emotional experiences help to trigger prospective memory retrieval in forest areas that are further away and have fewer cues associated with revisited feeding trees.

An approach to multicore parallelism using functional programming: A case study based on Presburger Arithmetic

DEFF Research Database (Denmark)

Dung, Phan Anh; Hansen, Michael Reichhardt

2015-01-01

In this paper we investigate multicore parallelism in the context of functional programming by means of two quantifier-elimination procedures for Presburger Arithmetic: one is based on Cooper’s algorithm and the other is based on the Omega Test. We first develop correct-by-construction prototype...... platform executing on an 8-core machine. A speedup of approximately 4 was obtained for Cooper’s algorithm and a speedup of approximately 6 was obtained for the exact-shadow part of the Omega Test. The considered procedures are complex, memory-intense algorithms on huge formula trees and the case study...... reveals more general applicable techniques and guideline for deriving parallel algorithms from sequential ones in the context of data-intensive tree algorithms. The obtained insights should apply for any strict and impure functional programming language. Furthermore, the results obtained for the exact...

.NET 4.5 parallel extensions

CERN Document Server

Freeman, Bryan

2013-01-01

This book contains practical recipes on everything you will need to create task-based parallel programs using C#, .NET 4.5, and Visual Studio. The book is packed with illustrated code examples to create scalable programs.This book is intended to help experienced C# developers write applications that leverage the power of modern multicore processors. It provides the necessary knowledge for an experienced C# developer to work with .NET parallelism APIs. Previous experience of writing multithreaded applications is not necessary.

A Scalable Parallel PWTD-Accelerated SIE Solver for Analyzing Transient Scattering from Electrically Large Objects

KAUST Repository

Liu, Yang; Yucel, Abdulkadir; Bagci, Hakan; Michielssen, Eric

2015-01-01

of processors by leveraging two mechanisms: (i) a hierarchical parallelization strategy to evenly distribute the computation and memory loads at all levels of the PWTD tree among processors, and (ii) a novel asynchronous communication scheme to reduce the cost

Higher order supersymmetries and fermionic conservation laws of the supersymmetric extension of the KdV equation

NARCIS (Netherlands)

Kersten, P.H.M.

1988-01-01

By the introduction of nonlocal basonic and fermionic variables we construct a recursion symmetry of the super KdV equation, leading to a hierarchy of bosonic symmetries and one of fermionic symmetries. The hierarchies of bosonic and fermionic conservation laws arise in a natural way in the

Parallelization of MCNP Monte Carlo neutron and photon transport code in parallel virtual machine and message passing interface

International Nuclear Information System (INIS)

Deng Li; Xie Zhongsheng

1999-01-01

The coupled neutron and photon transport Monte Carlo code MCNP (version 3B) has been parallelized in parallel virtual machine (PVM) and message passing interface (MPI) by modifying a previous serial code. The new code has been verified by solving sample problems. The speedup increases linearly with the number of processors and the average efficiency is up to 99% for 12-processor. (author)

A Parallel Priority Queue with Constant Time Operations

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Träff, Jesper Larsson; Zaroliagis, Christos D.

1998-01-01

We present a parallel priority queue that supports the following operations in constant time:parallel insertionof a sequence of elements ordered according to key,parallel decrease keyfor a sequence of elements ordered according to key,deletion of the minimum key element, anddeletion of an arbitrary...... application is a parallel implementation of Dijkstra's algorithm for the single-source shortest path problem, which runs inO(n) time andO(mlogn) work on a CREW PRAM on graphs withnvertices andmedges. This is a logarithmic factor improvement in the running time compared with previous approaches....

Gene tree rooting methods give distributions that mimic the coalescent process.

Science.gov (United States)

Tian, Yuan; Kubatko, Laura S

2014-01-01

Multi-locus phylogenetic inference is commonly carried out via models that incorporate the coalescent process to model the possibility that incomplete lineage sorting leads to incongruence between gene trees and the species tree. An interesting question that arises in this context is whether data "fit" the coalescent model. Previous work (Rosenfeld et al., 2012) has suggested that rooting of gene trees may account for variation in empirical data that has been previously attributed to the coalescent process. We examine this possibility using simulated data. We show that, in the case of four taxa, the distribution of gene trees observed from rooting estimated gene trees with either the molecular clock or with outgroup rooting can be closely matched by the distribution predicted by the coalescent model with specific choices of species tree branch lengths. We apply commonly-used coalescent-based methods of species tree inference to assess their performance in these situations. Copyright © 2013 Elsevier Inc. All rights reserved.

How fresh is maple syrup? Sugar maple trees mobilize carbon stored several years previously during early springtime sap-ascent.

Science.gov (United States)

Muhr, Jan; Messier, Christian; Delagrange, Sylvain; Trumbore, Susan; Xu, Xiaomei; Hartmann, Henrik

2016-03-01

While trees store substantial amounts of nonstructural carbon (NSC) for later use, storage regulation and mobilization of stored NSC in long-lived organisms like trees are still not well understood. At two different sites with sugar maple (Acer saccharum), we investigated ascending sap (sugar concentration, δ(13) C, Δ(14) C) as the mobilized component of stored stem NSC during early springtime. Using the bomb-spike radiocarbon approach we were able to estimate the average time elapsed since the mobilized carbon (C) was originally fixed from the atmosphere and to infer the turnover time of stem storage. Sites differed in concentration dynamics and overall δ(13) C, indicating different growing conditions. The absence of temporal trends for δ(13) C and Δ(14) C indicated sugar mobilization from a well-mixed pool with average Δ(14) C consistent with a mean turnover time (TT) of three to five years for this pool, with only minor differences between the sites. Sugar maple trees hence appear well buffered against single or even several years of negative plant C balance from environmental stress such as drought or repeated defoliation by insects. Manipulative investigations (e.g. starvation via girdling) combined with Δ(14) C measurements of this mobilized storage pool will provide further new insights into tree storage regulation and functioning. © 2015 The Authors. New Phytologist © 2015 New Phytologist Trust.

Soliton and periodic solutions for higher order wave equations of KdV type (I)

International Nuclear Information System (INIS)

Khuri, S.A.

2005-01-01

The aim of the paper is twofold. First, a new ansaetze is introduced for the construction of exact solutions for higher order wave equations of KdV type (I). We show the existence of a class of discontinuous soliton solutions with infinite spikes. Second, the projective Riccati technique is implemented as an alternate approach for obtaining new exact solutions, solitary solutions, and periodic wave solutions

Quasi-Optimal Elimination Trees for 2D Grids with Singularities

Directory of Open Access Journals (Sweden)

A. Paszyńska

2015-01-01

Full Text Available We construct quasi-optimal elimination trees for 2D finite element meshes with singularities. These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in parallel shared-memory executions. Since the meshes considered are a subspace of all possible mesh partitions, we call these minimizers quasi-optimal. We minimize the cost functionals using dynamic programming. Finding these minimizers is more computationally expensive than solving the original algebraic system. Nevertheless, from the insights provided by the analysis of the dynamic programming minima, we propose a heuristic construction of the elimination trees that has cost ONelog⁡Ne, where Ne is the number of elements in the mesh. We show that this heuristic ordering has similar computational cost to the quasi-optimal elimination trees found with dynamic programming and outperforms state-of-the-art alternatives in our numerical experiments.

Quasi-Optimal Elimination Trees for 2D Grids with Singularities

KAUST Repository

Paszyńska, A.

2015-04-22

We construct quasi-optimal elimination trees for 2D finite element meshes with singularities.These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in parallel shared-memory executions. Since the meshes considered are a subspace of all possible mesh partitions, we call these minimizers quasi-optimal.We minimize the cost functionals using dynamic programming. Finding these minimizers is more computationally expensive than solving the original algebraic system. Nevertheless, from the insights provided by the analysis of the dynamic programming minima, we propose a heuristic construction of the elimination trees that has cost O(log(Ne log(Ne)), where N e is the number of elements in the mesh.We show that this heuristic ordering has similar computational cost to the quasi-optimal elimination trees found with dynamic programming and outperforms state-of-the-art alternatives in our numerical experiments.

Quasi-Optimal Elimination Trees for 2D Grids with Singularities

KAUST Repository

Paszyńska, A.; Paszyński, M.; Jopek, K.; Woźniak, M.; Goik, D.; Gurgul, P.; AbouEisha, H.; Moshkov, Mikhail; Calo, Victor M.; Lenharth, A.; Nguyen, D.; Pingali, K.

2015-01-01

We construct quasi-optimal elimination trees for 2D finite element meshes with singularities.These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in parallel shared-memory executions. Since the meshes considered are a subspace of all possible mesh partitions, we call these minimizers quasi-optimal.We minimize the cost functionals using dynamic programming. Finding these minimizers is more computationally expensive than solving the original algebraic system. Nevertheless, from the insights provided by the analysis of the dynamic programming minima, we propose a heuristic construction of the elimination trees that has cost O(log(Ne log(Ne)), where N e is the number of elements in the mesh.We show that this heuristic ordering has similar computational cost to the quasi-optimal elimination trees found with dynamic programming and outperforms state-of-the-art alternatives in our numerical experiments.

Modifying Taper-Derived Merchantable Height Estimates to Account for Tree Characteristics

Science.gov (United States)

James A. Westfall

2006-01-01

The U.S. Department of Agriculture Forest Service Northeastern Forest Inventory and Analysis program (NE-FIA) is developing regionwide tree-taper equations. Unlike most previous work on modeling tree form, this effort necessarily includes a wide array of tree species. For some species, branching patterns can produce undesirable tree form that reduces the merchantable...

Adler endash Kostant endash Symes construction, bi-Hamiltonian manifolds, and KdV equations

International Nuclear Information System (INIS)

Guha, P.

1997-01-01

This paper focuses a relation between Adler endash Kostant endash Symes (AKS) theory applied to Fordy endash Kulish scheme and bi-Hamiltonian manifolds. The spirit of this paper is closely related to Casati endash Magri endash Pedroni work on Hamiltonian formulation of the KP equation. Here the KdV equation is deduced via the superposition of the Fordy endash Kulish scheme and AKS construction on the underlying current algebra C ∞ (S 1 ,g circle-times C[[λ

Use of thermodynamic sorption models to derive radionuclide Kd values for performance assessment: Selected results and recommendations of the NEA sorption project

Science.gov (United States)

Ochs, M.; Davis, J.A.; Olin, M.; Payne, T.E.; Tweed, C.J.; Askarieh, M.M.; Altmann, S.

2006-01-01

For the safe final disposal and/or long-term storage of radioactive wastes, deep or near-surface underground repositories are being considered world-wide. A central safety feature is the prevention, or sufficient retardation, of radionuclide (RN) migration to the biosphere. To this end, radionuclide sorption is one of the most important processes. Decreasing the uncertainty in radionuclide sorption may contribute significantly to reducing the overall uncertainty of a performance assessment (PA). For PA, sorption is typically characterised by distribution coefficients (Kd values). The conditional nature of Kd requires different estimates of this parameter for each set of geochemical conditions of potential relevance in a RN's migration pathway. As it is not feasible to measure sorption for every set of conditions, the derivation of Kd for PA must rely on data derived from representative model systems. As a result, uncertainty in Kd is largely caused by the need to derive values for conditions not explicitly addressed in experiments. The recently concluded NEA Sorption Project [1] showed that thermodynamic sorption models (TSMs) are uniquely suited to derive K d as a function of conditions, because they allow a direct coupling of sorption with variable solution chemistry and mineralogy in a thermodynamic framework. The results of the project enable assessment of the suitability of various TSM approaches for PA-relevant applications as well as of the potential and limitations of TSMs to model RN sorption in complex systems. ?? by Oldenbourg Wissenschaftsverlag.

Sports Nutrition and Doping Factors in Synchronized Swimming: Parallel Analysis among Athletes and Coaches

Directory of Open Access Journals (Sweden)

Gordana Furjan Mandic

2013-12-01

Full Text Available Although nutrition and doping are important factors in sports, neither is often investigated in synchronized swimming (Synchro.This study aimed to define and compare Synchro athletes and their coaches on their knowledge of sports nutrition (KSNand knowledge of doping (KD; and to study factors related to KSN and KD in each of these groups. Additionally, the KSNand KD questionnaires were evaluated for their reliability and validity. Altogether, 82 athletes (17.2 ± 1.92 years of age and 28 coaches (30.8 ± 5.26 years of age from Croatia and Serbia were included in the study, with a 99% response rate. The testand retest correlations were 0.94 and 0.90 for the KD and KSN,respectively. Subjects responded equally to 91% queries of the KD and 89% queries of the KSN. Although most of the coache sare highly educated, they declared self-education as the primary source of information about doping and sport-nutrition. Coaches scored higher than their athletes on both questionnaires which defined appropriate discriminative validity of the questionnaires. Variables such as age, sports experience and formal education are positively correlated to KSN and KD scores among athletes. The athletes who scored better on the KD are less prone to doping behavior in the future. These data reinforce the need for systematic educational programs on doping and sports nutrition in synchronized swimming. Special attention should be placed on younger athletes.

Binary Bell polynomial application in generalized (2+1)-dimensional KdV equation with variable coefficients

International Nuclear Information System (INIS)

Zhang Yi; Wei Wei-Wei; Cheng Teng-Fei; Song Yang

2011-01-01

In this paper, we apply the binary Bell polynomial approach to high-dimensional variable-coefficient nonlinear evolution equations. Taking the generalized (2+1)-dimensional KdV equation with variable coefficients as an illustrative example, the bilinear formulism, the bilinear Bäcklund transformation and the Lax pair are obtained in a quick and natural manner. Moreover, the infinite conservation laws are also derived. (general)

Remnant trees affect species composition but not structure of tropical second-growth forest.

Science.gov (United States)

Sandor, Manette E; Chazdon, Robin L

2014-01-01

Remnant trees, spared from cutting when tropical forests are cleared for agriculture or grazing, act as nuclei of forest regeneration following field abandonment. Previous studies on remnant trees were primarily conducted in active pasture or old fields abandoned in the previous 2-3 years, and focused on structure and species richness of regenerating forest, but not species composition. Our study is among the first to investigate the effects of remnant trees on neighborhood forest structure, biodiversity, and species composition 20 years post-abandonment. We compared the woody vegetation around individual remnant trees to nearby plots without remnant trees in the same second-growth forests ("control plots"). Forest structure beneath remnant trees did not differ significantly from control plots. Species richness and species diversity were significantly higher around remnant trees. The species composition around remnant trees differed significantly from control plots and more closely resembled the species composition of nearby old-growth forest. The proportion of old-growth specialists and generalists around remnant trees was significantly greater than in control plots. Although previous studies show that remnant trees may initially accelerate secondary forest growth, we found no evidence that they locally affect stem density, basal area, and seedling density at later stages of regrowth. Remnant trees do, however, have a clear effect on the species diversity, composition, and ecological groups of the surrounding woody vegetation, even after 20 years of forest regeneration. To accelerate the return of diversity and old-growth forest species into regrowing forest on abandoned land, landowners should be encouraged to retain remnant trees in agricultural or pastoral fields.

Parallel transport of long mean-free-path plasma along open magnetic field lines: Parallel heat flux

International Nuclear Information System (INIS)

Guo Zehua; Tang Xianzhu

2012-01-01

In a long mean-free-path plasma where temperature anisotropy can be sustained, the parallel heat flux has two components with one associated with the parallel thermal energy and the other the perpendicular thermal energy. Due to the large deviation of the distribution function from local Maxwellian in an open field line plasma with low collisionality, the conventional perturbative calculation of the parallel heat flux closure in its local or non-local form is no longer applicable. Here, a non-perturbative calculation is presented for a collisionless plasma in a two-dimensional flux expander bounded by absorbing walls. Specifically, closures of previously unfamiliar form are obtained for ions and electrons, which relate two distinct components of the species parallel heat flux to the lower order fluid moments such as density, parallel flow, parallel and perpendicular temperatures, and the field quantities such as the magnetic field strength and the electrostatic potential. The plasma source and boundary condition at the absorbing wall enter explicitly in the closure calculation. Although the closure calculation does not take into account wave-particle interactions, the results based on passing orbits from steady-state collisionless drift-kinetic equation show remarkable agreement with fully kinetic-Maxwell simulations. As an example of the physical implications of the theory, the parallel heat flux closures are found to predict a surprising observation in the kinetic-Maxwell simulation of the 2D magnetic flux expander problem, where the parallel heat flux of the parallel thermal energy flows from low to high parallel temperature region.

Current and potential tree locations in tree line ecotone of Changbai Mountains, Northeast China: the controlling effects of topography.

Science.gov (United States)

Zong, Shengwei; Wu, Zhengfang; Xu, Jiawei; Li, Ming; Gao, Xiaofeng; He, Hongshi; Du, Haibo; Wang, Lei

2014-01-01

Tree line ecotone in the Changbai Mountains has undergone large changes in the past decades. Tree locations show variations on the four sides of the mountains, especially on the northern and western sides, which has not been fully explained. Previous studies attributed such variations to the variations in temperature. However, in this study, we hypothesized that topographic controls were responsible for causing the variations in the tree locations in tree line ecotone of the Changbai Mountains. To test the hypothesis, we used IKONOS images and WorldView-1 image to identify the tree locations and developed a logistic regression model using topographical variables to identify the dominant controls of the tree locations. The results showed that aspect, wetness, and slope were dominant controls for tree locations on western side of the mountains, whereas altitude, SPI, and aspect were the dominant factors on northern side. The upmost altitude a tree can currently reach was 2140 m asl on the northern side and 2060 m asl on western side. The model predicted results showed that habitats above the current tree line on the both sides were available for trees. Tree recruitments under the current tree line may take advantage of the available habitats at higher elevations based on the current tree location. Our research confirmed the controlling effects of topography on the tree locations in the tree line ecotone of Changbai Mountains and suggested that it was essential to assess the tree response to topography in the research of tree line ecotone.

On Solutions of the Integrable Boundary Value Problem for KdV Equation on the Semi-Axis

International Nuclear Information System (INIS)

Ignatyev, M. Yu.

2013-01-01

This paper is concerned with the Korteweg–de Vries (KdV) equation on the semi-axis. The boundary value problem with inhomogeneous integrable boundary conditions is studied. We establish some characteristic properties of solutions of the problem. Also we construct a wide class of solutions of the problem using the inverse spectral method.

Visualizing phylogenetic tree landscapes.

Science.gov (United States)

Wilgenbusch, James C; Huang, Wen; Gallivan, Kyle A

2017-02-02

Genomic-scale sequence alignments are increasingly used to infer phylogenies in order to better understand the processes and patterns of evolution. Different partitions within these new alignments (e.g., genes, codon positions, and structural features) often favor hundreds if not thousands of competing phylogenies. Summarizing and comparing phylogenies obtained from multi-source data sets using current consensus tree methods discards valuable information and can disguise potential methodological problems. Discovery of efficient and accurate dimensionality reduction methods used to display at once in 2- or 3- dimensions the relationship among these competing phylogenies will help practitioners diagnose the limits of current evolutionary models and potential problems with phylogenetic reconstruction methods when analyzing large multi-source data sets. We introduce several dimensionality reduction methods to visualize in 2- and 3-dimensions the relationship among competing phylogenies obtained from gene partitions found in three mid- to large-size mitochondrial genome alignments. We test the performance of these dimensionality reduction methods by applying several goodness-of-fit measures. The intrinsic dimensionality of each data set is also estimated to determine whether projections in 2- and 3-dimensions can be expected to reveal meaningful relationships among trees from different data partitions. Several new approaches to aid in the comparison of different phylogenetic landscapes are presented. Curvilinear Components Analysis (CCA) and a stochastic gradient decent (SGD) optimization method give the best representation of the original tree-to-tree distance matrix for each of the three- mitochondrial genome alignments and greatly outperformed the method currently used to visualize tree landscapes. The CCA + SGD method converged at least as fast as previously applied methods for visualizing tree landscapes. We demonstrate for all three mtDNA alignments that 3D

Experimental determination of the distribution coefficient (Kd) of lead and barium in soils of semiarid region of Bahia, Brazil

International Nuclear Information System (INIS)

Santos, Mariana M.; Fernandes, Heloisa H.F; Pontedeiro, Elizabeth M.; Su, Jian

2013-01-01

To determine the concentration of heavy metals and other contaminants in soils, aimed at evaluating the environmental impact, the use of the distribution coefficient is required (Kd), defined as the relationship between the concentrations adsorbed and in solution. The objective of this study was to determine the rates for the Lead and Barium metals in soil collected in Caetite, the state of Bahia, in two different depths. The importance of determining the distribution coefficient lies in the fact that being performed using a tropical soil. For the isotherms of Kd was used batch test method by adsorption to obtain the final concentrations. The first step was to determine the best ratio soil: solution obtained after equilibration time and finally the equilibrium concentration of the contaminant. Were also calculated percentages of the metal adsorbed by the soil and the amount of solute by the adsorbent. With the values obtained in experiments and using Mathematica 8.0 software, were made graphics equilibrium concentration versus quantity adsorbed (C vs. S). It can also plot isotherms for different models of Kd: linear, Langmuir and Freundlich in order to determine which adsorption model would fit best to the measured data and thus determine the distribution coefficient of the metal in the soil analyzed. The Freundlich isotherm was better adapted to the points of the two metals in both soils

Podoplanin, novel 43-kd membrane protein of glomerular epithelial cells, is down-regulated in puromycin nephrosis.

Science.gov (United States)

Breiteneder-Geleff, S.; Matsui, K.; Soleiman, A.; Meraner, P.; Poczewski, H.; Kalt, R.; Schaffner, G.; Kerjaschki, D.

1997-01-01

Puromycin aminonucleoside nephrosis (PAN), a rat model of human minimal change nephropathy, is characterized by extensive flattening of glomerular epithelial cell (podocyte) foot processes and by severe proteinuria. For comparison of expression of glomerular membrane proteins of normal and PAN rats, a membrane protein fraction of isolated rat glomeruli was prepared and monoclonal antibodies were raised against it. An IgG-secreting clone designated LF3 was selected that specifically immunolabeled podocytes of normal but not of PAN rats. The antigen of LF3 IgG was identified as a 43-kd glycoprotein. Molecular cloning of its cDNA was performed in a delta gt11 expression library prepared from mRNA of isolated rat glomeruli. The predicted amino acid sequence indicated a 166-amino-acid integral membrane protein with a single membrane-spanning domain, two potential phosphorylation sites in its short cytoplasmic tail, and six potential O-glycosylation sites in the large ectodomain. High amino acid sequence identities were found to membrane glycoproteins of rat lung and bone and mouse thymus epithelial cells as well as to a phorbol-ester-induced protein in a mouse osteoblast cell line and to a canine influenza C virus receptor. In PAN, expression of this 43-kd protein was selectively reduced to < 30%, as determined by quantitative immunogold electron microscopy, immunoblotting, and Northern blotting. These data provide evidence that transcription of the 43-kd transmembrane podocyte glycoprotein is specifically down-regulated in PAN. To indicate that this protein could be associated with transformation of arborized foot processes to flat feet (Latin, pes planus) we have called it podoplanin. Images Figure 1 Figure 2 Figure 3 Figure 4 Figure 5 Figure 6 Figure 7 Figure 8 Figure 10 Figure 12 Figure 13 Figure 14 Figure 15 PMID:9327748

Exact parallel maximum clique algorithm for general and protein graphs.

Science.gov (United States)

Depolli, Matjaž; Konc, Janez; Rozman, Kati; Trobec, Roman; Janežič, Dušanka

2013-09-23

A new exact parallel maximum clique algorithm MaxCliquePara, which finds the maximum clique (the fully connected subgraph) in undirected general and protein graphs, is presented. First, a new branch and bound algorithm for finding a maximum clique on a single computer core, which builds on ideas presented in two published state of the art sequential algorithms is implemented. The new sequential MaxCliqueSeq algorithm is faster than the reference algorithms on both DIMACS benchmark graphs as well as on protein-derived product graphs used for protein structural comparisons. Next, the MaxCliqueSeq algorithm is parallelized by splitting the branch-and-bound search tree to multiple cores, resulting in MaxCliquePara algorithm. The ability to exploit all cores efficiently makes the new parallel MaxCliquePara algorithm markedly superior to other tested algorithms. On a 12-core computer, the parallelization provides up to 2 orders of magnitude faster execution on the large DIMACS benchmark graphs and up to an order of magnitude faster execution on protein product graphs. The algorithms are freely accessible on http://commsys.ijs.si/~matjaz/maxclique.

On W∞ algebras, gauge equivalence of K P hierarchies, two-bosons realizations and their KdV reductions

International Nuclear Information System (INIS)

Aratyn, H.; Ferreira, L.A.; Gomes, J.F.; Zimerman, A.H.

1994-01-01

The gauge equivalence between basic KP hierarchies is discussed. The first two Hamiltonian structures for KP hierarchies leading to the linear and non-linear W ∞ algebras are derived. The realization of the corresponding generators in terms of two boson currents is presented and it is shown to be related to many integrable models which are bi-Hamiltonian. We can also realize those generators by adding extra currents, coupled in a particular way allowing for instance a description of multi-layered Benney equations or multi- component non-linear Schroedinger equation. In this case we can have a second Hamiltonian bracket structure which violates Jacobi identity. We consider the reduction to one-boson systems leading to KdV and mKdV hierarchies. A Miura transformation relating these two hierarchies is obtained by restricting gauge transformation between corresponding two-boson hierarchies. Connection to Drinfeld-Sokolov approach is also discussed in the SL (2, IR) gauge theory. (author)

Parallel file system performances in fusion data storage

International Nuclear Information System (INIS)

Iannone, F.; Podda, S.; Bracco, G.; Manduchi, G.; Maslennikov, A.; Migliori, S.; Wolkersdorfer, K.

2012-01-01

High I/O flow rates, up to 10 GB/s, are required in large fusion Tokamak experiments like ITER where hundreds of nodes store simultaneously large amounts of data acquired during the plasma discharges. Typical network topologies such as linear arrays (systolic), rings, meshes (2-D arrays), tori (3-D arrays), trees, butterfly, hypercube in combination with high speed data transports like Infiniband or 10G-Ethernet, are the main areas in which the effort to overcome the so-called parallel I/O bottlenecks is most focused. The high I/O flow rates were modelled in an emulated testbed based on the parallel file systems such as Lustre and GPFS, commonly used in High Performance Computing. The test runs on High Performance Computing–For Fusion (8640 cores) and ENEA CRESCO (3392 cores) supercomputers. Message Passing Interface based applications were developed to emulate parallel I/O on Lustre and GPFS using data archival and access solutions like MDSPLUS and Universal Access Layer. These methods of data storage organization are widely diffused in nuclear fusion experiments and are being developed within the EFDA Integrated Tokamak Modelling – Task Force; the authors tried to evaluate their behaviour in a realistic emulation setup.

Parallel file system performances in fusion data storage

Energy Technology Data Exchange (ETDEWEB)

Iannone, F., E-mail: francesco.iannone@enea.it [Associazione EURATOM-ENEA sulla Fusione, C.R.ENEA Frascati, via E.Fermi, 45 - 00044 Frascati, Rome (Italy); Podda, S.; Bracco, G. [ENEA Information Communication Tecnologies, Lungotevere Thaon di Revel, 76 - 00196 Rome (Italy); Manduchi, G. [Associazione EURATOM-ENEA sulla Fusione, Consorzio RFX, Corso Stati Uniti, 4 - 35127 Padua (Italy); Maslennikov, A. [CASPUR Inter-University Consortium for the Application of Super-Computing for Research, via dei Tizii, 6b - 00185 Rome (Italy); Migliori, S. [ENEA Information Communication Tecnologies, Lungotevere Thaon di Revel, 76 - 00196 Rome (Italy); Wolkersdorfer, K. [Juelich Supercomputing Centre-FZJ, D-52425 Juelich (Germany)

2012-12-15

High I/O flow rates, up to 10 GB/s, are required in large fusion Tokamak experiments like ITER where hundreds of nodes store simultaneously large amounts of data acquired during the plasma discharges. Typical network topologies such as linear arrays (systolic), rings, meshes (2-D arrays), tori (3-D arrays), trees, butterfly, hypercube in combination with high speed data transports like Infiniband or 10G-Ethernet, are the main areas in which the effort to overcome the so-called parallel I/O bottlenecks is most focused. The high I/O flow rates were modelled in an emulated testbed based on the parallel file systems such as Lustre and GPFS, commonly used in High Performance Computing. The test runs on High Performance Computing-For Fusion (8640 cores) and ENEA CRESCO (3392 cores) supercomputers. Message Passing Interface based applications were developed to emulate parallel I/O on Lustre and GPFS using data archival and access solutions like MDSPLUS and Universal Access Layer. These methods of data storage organization are widely diffused in nuclear fusion experiments and are being developed within the EFDA Integrated Tokamak Modelling - Task Force; the authors tried to evaluate their behaviour in a realistic emulation setup.

Gene-Tree Reconciliation with MUL-Trees to Resolve Polyploidy Events.

Science.gov (United States)

Gregg, W C Thomas; Ather, S Hussain; Hahn, Matthew W

2017-11-01

Polyploidy can have a huge impact on the evolution of species, and it is a common occurrence, especially in plants. The two types of polyploids-autopolyploids and allopolyploids-differ in the level of divergence between the genes that are brought together in the new polyploid lineage. Because allopolyploids are formed via hybridization, the homoeologous copies of genes within them are at least as divergent as orthologs in the parental species that came together to form them. This means that common methods for estimating the parental lineages of allopolyploidy events are not accurate, and can lead to incorrect inferences about the number of gene duplications and losses. Here, we have adapted an algorithm for topology-based gene-tree reconciliation to work with multi-labeled trees (MUL-trees). By definition, MUL-trees have some tips with identical labels, which makes them a natural representation of the genomes of polyploids. Using this new reconciliation algorithm we can: accurately place allopolyploidy events on a phylogeny, identify the parental lineages that hybridized to form allopolyploids, distinguish between allo-, auto-, and (in most cases) no polyploidy, and correctly count the number of duplications and losses in a set of gene trees. We validate our method using gene trees simulated with and without polyploidy, and revisit the history of polyploidy in data from the clades including both baker's yeast and bread wheat. Our re-analysis of the yeast data confirms the allopolyploid origin and parental lineages previously identified for this group. The method presented here should find wide use in the growing number of genomes from species with a history of polyploidy. [Polyploidy; reconciliation; whole-genome duplication.]. © The Author(s) 2017. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees.

Science.gov (United States)

Mirzaei, Sajad; Wu, Yufeng

2016-01-01

Hybridization networks represent plausible evolutionary histories of species that are affected by reticulate evolutionary processes. An established computational problem on hybridization networks is constructing the most parsimonious hybridization network such that each of the given phylogenetic trees (called gene trees) is "displayed" in the network. There have been several previous approaches, including an exact method and several heuristics, for this NP-hard problem. However, the exact method is only applicable to a limited range of data, and heuristic methods can be less accurate and also slow sometimes. In this paper, we develop a new algorithm for constructing near parsimonious networks for multiple binary gene trees. This method is more efficient for large numbers of gene trees than previous heuristics. This new method also produces more parsimonious results on many simulated datasets as well as a real biological dataset than a previous method. We also show that our method produces topologically more accurate networks for many datasets.

Marketing plan for Pharmacare product line in the Moscow region Case Oriola-KD

OpenAIRE

Mashkilleyson, Peter

2012-01-01

The thesis was commissioned by Oriola-KD. It deals with a marketing plan for a product line called Pharmacare. The product line will be launched in 2012 in the Moscow region in the Russian Federation. The purpose of this thesis was to acquire useful information about the Moscow market for the target company and produce a marketing plan that they can implement. The research question was how to create an effective marketing plan and what it entails. The literary review consisted of the theo...

A parallel simulated annealing algorithm for standard cell placement on a hypercube computer

Science.gov (United States)

Jones, Mark Howard

1987-01-01

A parallel version of a simulated annealing algorithm is presented which is targeted to run on a hypercube computer. A strategy for mapping the cells in a two dimensional area of a chip onto processors in an n-dimensional hypercube is proposed such that both small and large distance moves can be applied. Two types of moves are allowed: cell exchanges and cell displacements. The computation of the cost function in parallel among all the processors in the hypercube is described along with a distributed data structure that needs to be stored in the hypercube to support parallel cost evaluation. A novel tree broadcasting strategy is used extensively in the algorithm for updating cell locations in the parallel environment. Studies on the performance of the algorithm on example industrial circuits show that it is faster and gives better final placement results than the uniprocessor simulated annealing algorithms. An improved uniprocessor algorithm is proposed which is based on the improved results obtained from parallelization of the simulated annealing algorithm.

Particular solutions to multidimensional PDEs with KdV-type nonlinearity

International Nuclear Information System (INIS)

Zenchuk, A.I.

2014-01-01

We consider a class of particular solutions to the (2+1)-dimensional nonlinear partial differential equation (PDE) u t +∂ x 2 n u x 1 −u x 1 u=0 (here n is any integer) reducing it to the ordinary differential equation (ODE). In a simplest case, n=1, the ODE is solvable in terms of elementary functions. Next choice, n=2, yields the cnoidal waves for the special case of Zakharov–Kuznetsov equation. The proposed method is based on the deformation of the characteristic of the equation u t −uu x 1 =0 and might also be useful in study of the higher-dimensional PDEs with arbitrary linear part and KdV-type nonlinearity (i.e. the nonlinear term is u x 1 u).

A Hybrid Parallel Execution Model for Logic Based Requirement Specifications (Invited Paper

Directory of Open Access Journals (Sweden)

Jeffrey J. P. Tsai

1999-05-01

Full Text Available It is well known that undiscovered errors in a requirements specification is extremely expensive to be fixed when discovered in the software maintenance phase. Errors in the requirement phase can be reduced through the validation and verification of the requirements specification. Many logic-based requirements specification languages have been developed to achieve these goals. However, the execution and reasoning of a logic-based requirements specification can be very slow. An effective way to improve their performance is to execute and reason the logic-based requirements specification in parallel. In this paper, we present a hybrid model to facilitate the parallel execution of a logic-based requirements specification language. A logic-based specification is first applied by a data dependency analysis technique which can find all the mode combinations that exist within a specification clause. This mode information is used to support a novel hybrid parallel execution model, which combines both top-down and bottom-up evaluation strategies. This new execution model can find the failure in the deepest node of the search tree at the early stage of the evaluation, thus this new execution model can reduce the total number of nodes searched in the tree, the total processes needed to be generated, and the total communication channels needed in the search process. A simulator has been implemented to analyze the execution behavior of the new model. Experiments show significant improvement based on several criteria.

Transient radiation effects in D.O.I. optical materials: KD*P

International Nuclear Information System (INIS)

Simmons-Potter, K.

1998-07-01

Department of Energy and Defense Programs systems are becoming increasingly reliant on the use of optical technologies that must perform under a range of ionizing radiation environments. In particular, the radiation response of materials under consideration for applications in direct optical initiation (D.O.I.) schemes must be well characterized. In this report, transient radiation effects observed in a KD*P crystal are characterized. Under gamma exposure with 2 MeV photons in a 20--30 nsec pulse, the authors observe induced absorption at 1.06 microm that causes a peak decrease in overall sample transmittance of only 10%. This induced loss is seen to recover fully within the first 30 microsec

Growing quality of life: urban trees, birth weight, and crime

Science.gov (United States)

John Kirkland; Geoffrey Donovan

2011-01-01

City dwellers can find many reasons to value neighborhood trees. The urban greenery provides relief from the built environment that many find appealing. In fact, a previous study found that a tree in front of a home increased that home's sales price by more than $7,000. Two new studies explore the measurable effects that urban trees and green spaces have a human...

Decision-Tree Formulation With Order-1 Lateral Execution

Science.gov (United States)

James, Mark

2007-01-01

A compact symbolic formulation enables mapping of an arbitrarily complex decision tree of a certain type into a highly computationally efficient multidimensional software object. The type of decision trees to which this formulation applies is that known in the art as the Boolean class of balanced decision trees. Parallel lateral slices of an object created by means of this formulation can be executed in constant time considerably less time than would otherwise be required. Decision trees of various forms are incorporated into almost all large software systems. A decision tree is a way of hierarchically solving a problem, proceeding through a set of true/false responses to a conclusion. By definition, a decision tree has a tree-like structure, wherein each internal node denotes a test on an attribute, each branch from an internal node represents an outcome of a test, and leaf nodes represent classes or class distributions that, in turn represent possible conclusions. The drawback of decision trees is that execution of them can be computationally expensive (and, hence, time-consuming) because each non-leaf node must be examined to determine whether to progress deeper into a tree structure or to examine an alternative. The present formulation was conceived as an efficient means of representing a decision tree and executing it in as little time as possible. The formulation involves the use of a set of symbolic algorithms to transform a decision tree into a multi-dimensional object, the rank of which equals the number of lateral non-leaf nodes. The tree can then be executed in constant time by means of an order-one table lookup. The sequence of operations performed by the algorithms is summarized as follows: 1. Determination of whether the tree under consideration can be encoded by means of this formulation. 2. Extraction of decision variables. 3. Symbolic optimization of the decision tree to minimize its form. 4. Expansion and transformation of all nested conjunctive

High-speed detection of emergent market clustering via an unsupervised parallel genetic algorithm

Directory of Open Access Journals (Sweden)

Dieter Hendricks

2016-02-01

Full Text Available We implement a master-slave parallel genetic algorithm with a bespoke log-likelihood fitness function to identify emergent clusters within price evolutions. We use graphics processing units (GPUs to implement a parallel genetic algorithm and visualise the results using disjoint minimal spanning trees. We demonstrate that our GPU parallel genetic algorithm, implemented on a commercially available general purpose GPU, is able to recover stock clusters in sub-second speed, based on a subset of stocks in the South African market. This approach represents a pragmatic choice for low-cost, scalable parallel computing and is significantly faster than a prototype serial implementation in an optimised C-based fourth-generation programming language, although the results are not directly comparable because of compiler differences. Combined with fast online intraday correlation matrix estimation from high frequency data for cluster identification, the proposed implementation offers cost-effective, near-real-time risk assessment for financial practitioners.

Habitat filtering across tree life stages in tropical forest communities

Science.gov (United States)

Baldeck, C. A.; Harms, K. E.; Yavitt, J. B.; John, R.; Turner, B. L.; Valencia, R.; Navarrete, H.; Bunyavejchewin, S.; Kiratiprayoon, S.; Yaacob, A.; Supardi, M. N. N.; Davies, S. J.; Hubbell, S. P.; Chuyong, G. B.; Kenfack, D.; Thomas, D. W.; Dalling, J. W.

2013-01-01

Tropical tree communities are shaped by local-scale habitat heterogeneity in the form of topographic and edaphic variation, but the life-history stage at which habitat associations develop remains poorly understood. This is due, in part, to the fact that previous studies have not accounted for the widely disparate sample sizes (number of stems) that result when trees are divided into size classes. We demonstrate that the observed habitat structuring of a community is directly related to the number of individuals in the community. We then compare the relative importance of habitat heterogeneity to tree community structure for saplings, juveniles and adult trees within seven large (24–50 ha) tropical forest dynamics plots while controlling for sample size. Changes in habitat structuring through tree life stages were small and inconsistent among life stages and study sites. Where found, these differences were an order of magnitude smaller than the findings of previous studies that did not control for sample size. Moreover, community structure and composition were very similar among tree sub-communities of different life stages. We conclude that the structure of these tropical tree communities is established by the time trees are large enough to be included in the census (1 cm diameter at breast height), which indicates that habitat filtering occurs during earlier life stages. PMID:23843384

Categorizing ideas about trees: a tree of trees.

Science.gov (United States)

Fisler, Marie; Lecointre, Guillaume

2013-01-01

The aim of this study is to explore whether matrices and MP trees used to produce systematic categories of organisms could be useful to produce categories of ideas in history of science. We study the history of the use of trees in systematics to represent the diversity of life from 1766 to 1991. We apply to those ideas a method inspired from coding homologous parts of organisms. We discretize conceptual parts of ideas, writings and drawings about trees contained in 41 main writings; we detect shared parts among authors and code them into a 91-characters matrix and use a tree representation to show who shares what with whom. In other words, we propose a hierarchical representation of the shared ideas about trees among authors: this produces a "tree of trees." Then, we categorize schools of tree-representations. Classical schools like "cladists" and "pheneticists" are recovered but others are not: "gradists" are separated into two blocks, one of them being called here "grade theoreticians." We propose new interesting categories like the "buffonian school," the "metaphoricians," and those using "strictly genealogical classifications." We consider that networks are not useful to represent shared ideas at the present step of the study. A cladogram is made for showing who is sharing what with whom, but also heterobathmy and homoplasy of characters. The present cladogram is not modelling processes of transmission of ideas about trees, and here it is mostly used to test for proximity of ideas of the same age and for categorization.

Pollution and Climate Effects on Tree-Ring Nitrogen Isotopes

Science.gov (United States)

Savard, M. M.; Bégin, C.; Marion, J.; Smirnoff, A.

2009-04-01

BACKGROUND Monitoring of nitrous oxide concentration only started during the last 30 years in North America, but anthropogenic atmospheric nitrogen has been significantly emitted over the last 150 years. Can geochemical characteristics of tree rings be used to infer past changes in the nitrogen cycle of temperate regions? To address this question we use nitrogen stable isotopes in 125 years-long ring series from beech specimens (Fagus grandifolia) of the Georgian Bay Islands National Park (eastern Ontario), and pine (Pinus strobus) and beech trees of the Arboretum Morgan near Montreal (western Quebec). To evaluate the reliability of the N stable isotopes in wood treated for removal of soluble materials, we tested both tree species from the Montreal area. The reproducibility from tree to tree was excellent for both pine and beech trees, the isotopic trends were strongly concordant, and they were not influenced by the heartwood-sapwood transition zone. The coherence of changes of the isotopic series observed for the two species suggests that their tree-ring N isotopic values can serve as environmental indicator. RESULTS AND INTERPRETATION In Montreal and Georgian Bay, the N isotopes show strong and similar parallel agreement (Gleichlaufigkeit test) with the climatic parameters. So in fact, the short-term isotopic fluctuations correlate directly with summer precipitation and inversely with summer and spring temperature. A long-term decreasing isotope trend in Montreal indicates progressive changes in soil chemistry after 1951. A pedochemical change is also inferred for the Georgian Bay site on the basis of a positive N isotopic trend initiated after 1971. At both sites, the long-term ^15N series correlate with a proxy for NOx emissions (Pearson correlation), and carbon-isotope ring series suggest that the same trees have been impacted by phytotoxic pollutants (Savard et al., 2009a). We propose that the contrasted long-term nitrogen-isotope changes of Montreal and

Moyal noncommutative integrability and the Burgers-KdV mapping

International Nuclear Information System (INIS)

Sedra, M.B.

2005-12-01

The Moyal momentum algebra, is once again used to discuss some important aspects of NC integrable models and 2d conformal field theories. Among the results presented, we set up algebraic structures and makes useful convention notations leading to extract non trivial properties of the Moyal momentum algebra. We study also the Lax pair building mechanism for particular examples namely, the noncommutative KdV and Burgers systems. We show in a crucial step that these two systems are mapped to each other through the following crucial mapping ∂ t 2 → ∂ t 3 ≡ ∂ t 2 ∂ x + α∂ x 3 . This makes a strong constraint on the NC Burgers system which corresponds to linearizing its associated differential equation. From the CFT's point of view, this constraint equation is nothing but the analogue of the conservation law of the conformal current. We believe that the considered mapping might help to bring new insights towards understanding the integrability of noncommutative 2d-systems. (author)

Variable Rate, Adaptive Transform Tree Coding Of Images

Science.gov (United States)

Pearlman, William A.

1988-10-01

A tree code, asymptotically optimal for stationary Gaussian sources and squared error distortion [2], is used to encode transforms of image sub-blocks. The variance spectrum of each sub-block is estimated and specified uniquely by a set of one-dimensional auto-regressive parameters. The expected distortion is set to a constant for each block and the rate is allowed to vary to meet the given level of distortion. Since the spectrum and rate are different for every block, the code tree differs for every block. Coding simulations for target block distortion of 15 and average block rate of 0.99 bits per pel (bpp) show that very good results can be obtained at high search intensities at the expense of high computational complexity. The results at the higher search intensities outperform a parallel simulation with quantization replacing tree coding. Comparative coding simulations also show that the reproduced image with variable block rate and average rate of 0.99 bpp has 2.5 dB less distortion than a similarly reproduced image with a constant block rate equal to 1.0 bpp.

Interpolant tree automata and their application in Horn clause verification

DEFF Research Database (Denmark)

Kafle, Bishoksan; Gallagher, John Patrick

2016-01-01

This paper investigates the combination of abstract interpretation over the domain of convex polyhedra with interpolant tree automata, in an abstraction-refinement scheme for Horn clause verification. These techniques have been previously applied separately, but are combined in a new way in this ......This paper investigates the combination of abstract interpretation over the domain of convex polyhedra with interpolant tree automata, in an abstraction-refinement scheme for Horn clause verification. These techniques have been previously applied separately, but are combined in a new way...... clause verification problems indicates that the combination of interpolant tree automaton with abstract interpretation gives some increase in the power of the verification tool, while sometimes incurring a performance overhead....

Batch Kd measurements of nuclides to estimate migration potential at the proposed Waste Isolation Pilot Plant in New Mexico

International Nuclear Information System (INIS)

Serne, R.J.; Rai, D.; Mason, M.J.; Molecke, M.A.

1977-01-01

Laboratory measurements to determine the sorption distribution coefficients, Kd, of radionuclides present in, and potentially leached from, radioactive wastes, in contact with representative geologic media, have been conducted. The nuclides studied include Cs, Sr, Tc, Ru, Sb, Ce, Eu, Pu, Np, Cm, Am, U, and Pa. The crushed rock materials used were from the vicinity of the Waste Isolation Pilot Plant, a project to isolate radioactive wastes in a bedded salt facility, near Carlsbad, New Mexico. Solutions used consist of salt brine and groundwater, specific to the WIPP site, plus distilled water, for laboratory intercomparisons. The batch Kd data reported, plus data from sorption and migration measurements being conducted or planned elsewhere, will be used to evaluate the potential for radionuclide migration from the bedded salt WIPP facility. The data can be used for transport modeling and for safety assessment determinations

Parallel computing techniques for rotorcraft aerodynamics

Science.gov (United States)

Ekici, Kivanc

The modification of unsteady three-dimensional Navier-Stokes codes for application on massively parallel and distributed computing environments is investigated. The Euler/Navier-Stokes code TURNS (Transonic Unsteady Rotor Navier-Stokes) was chosen as a test bed because of its wide use by universities and industry. For the efficient implementation of TURNS on parallel computing systems, two algorithmic changes are developed. First, main modifications to the implicit operator, Lower-Upper Symmetric Gauss Seidel (LU-SGS) originally used in TURNS, is performed. Second, application of an inexact Newton method, coupled with a Krylov subspace iterative method (Newton-Krylov method) is carried out. Both techniques have been tried previously for the Euler equations mode of the code. In this work, we have extended the methods to the Navier-Stokes mode. Several new implicit operators were tried because of convergence problems of traditional operators with the high cell aspect ratio (CAR) grids needed for viscous calculations on structured grids. Promising results for both Euler and Navier-Stokes cases are presented for these operators. For the efficient implementation of Newton-Krylov methods to the Navier-Stokes mode of TURNS, efficient preconditioners must be used. The parallel implicit operators used in the previous step are employed as preconditioners and the results are compared. The Message Passing Interface (MPI) protocol has been used because of its portability to various parallel architectures. It should be noted that the proposed methodology is general and can be applied to several other CFD codes (e.g. OVERFLOW).

Automated tracking of the vascular tree on DSA images

International Nuclear Information System (INIS)

Alperin, N.; Hoffmann, K.R.; Doi, K.

1990-01-01

Determination of the vascular tree structure is important for reconstruction of three-dimensional vascular tree from biplane images, for assessment of the significance of a lesion, and for planning treatment for arteriovenous malformation. To automate these analyses, the authors of this paper are developing a method to determine the vascular tree structure from digital subtraction angiography (DSA) images. The authors have previously described a vessel tracking method, based on the double-square-box technique. To improve the tracking accuracy, they have developed and integrated with the previous method a connectivity test and guided-sector-search technique. The connectivity test, based on region growing techniques, eliminates tracking across nonvessel regions. The guided sector-search method incorporates information from a larger are of the image to guide the search for the next tracking point

A deterministic model for the growth of non-conducting electrical tree structures

International Nuclear Information System (INIS)

Dodd, S J

2003-01-01

Electrical treeing is of interest to the electrical generation, transmission and distribution industries as it is one of the causes of insulation failure in electrical machines, switchgear and transformer bushings. In this paper a deterministic electrical tree growth model is described. The model is based on electrostatics and local electron avalanches to model partial discharge activity within the growing tree structure. Damage to the resin surrounding the tree structure is dependent on the local electrostatic energy dissipation by partial discharges within the tree structure and weighted by the magnitudes of the local electric fields in the resin surrounding the tree structure. The model is successful in simulating the formation of branched structures without the need of a random variable, a requirement of previous stochastic models. Instability in the spatial development of partial discharges within the tree structure takes the role of the stochastic element as used in previous models to produce branched tree structures. The simulated electrical trees conform to the experimentally observed behaviour; tree length versus time and electrical tree growth rate as a function of applied voltage for non-conducting electrical trees. The phase synchronous partial discharge activity and the spatial distribution of emitted light from the tree structure are also in agreement with experimental data for non-conducting trees as grown in a flexible epoxy resin and in polyethylene. The fact that similar tree growth behaviour is found using pure amorphous (epoxy resin) and semicrystalline (polyethylene) materials demonstrate that neither annealed or quenched noise, representing material inhomogeneity, is required for the formation of irregular branched structures (electrical trees). Instead, as shown in this paper, branched growth can occur due to the instability of individual discharges within the tree structure

Design of data structures for mergeable trees

DEFF Research Database (Denmark)

Georgiadis, Loukas; Tarjan, Robert Endre; Werneck, Renato Fonseca F.

2006-01-01

merge operation can change many arcs. In spite of this, we develop a data structure that supports merges and all other standard tree operations in O(log2 n) amortized time on an n-node forest. For the special case that occurs in the motivating application, in which arbitrary arc deletions...... are not allowed, we give a data structure with an O(log n) amortized time bound per operation, which is asymptotically optimal. The analysis of both algorithms is not straightforward and requires ideas not previously used in the study of dynamic trees. We explore the design space of algorithms for the problem......Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation that merges two tree paths. In contrast to the standard problem, in which only one tree arc at a time changes, a single...

Parallel grid population

Science.gov (United States)

Wald, Ingo; Ize, Santiago

2015-07-28

Parallel population of a grid with a plurality of objects using a plurality of processors. One example embodiment is a method for parallel population of a grid with a plurality of objects using a plurality of processors. The method includes a first act of dividing a grid into n distinct grid portions, where n is the number of processors available for populating the grid. The method also includes acts of dividing a plurality of objects into n distinct sets of objects, assigning a distinct set of objects to each processor such that each processor determines by which distinct grid portion(s) each object in its distinct set of objects is at least partially bounded, and assigning a distinct grid portion to each processor such that each processor populates its distinct grid portion with any objects that were previously determined to be at least partially bounded by its distinct grid portion.

Relating tree growth to rainfall in Bolivian rain forests: a test for six species using tree ring analysis.

Science.gov (United States)

Brienen, Roel J W; Zuidema, Pieter A

2005-11-01

Many tropical regions show one distinct dry season. Often, this seasonality induces cambial dormancy of trees, particularly if these belong to deciduous species. This will often lead to the formation of annual rings. The aim of this study was to determine whether tree species in the Bolivian Amazon region form annual rings and to study the influence of the total amount and seasonal distribution of rainfall on diameter growth. Ring widths were measured on stem discs of a total of 154 trees belonging to six rain forest species. By correlating ring width and monthly rainfall data we proved the annual character of the tree rings for four of our study species. For two other species the annual character was proved by counting rings on trees of known age and by radiocarbon dating. The results of the climate-growth analysis show a positive relationship between tree growth and rainfall in certain periods of the year, indicating that rainfall plays a major role in tree growth. Three species showed a strong relationship with rainfall at the beginning of the rainy season, while one species is most sensitive to the rainfall at the end of the previous growing season. These results clearly demonstrate that tree ring analysis can be successfully applied in the tropics and that it is a promising method for various research disciplines.

Parallelization of Subchannel Analysis Code MATRA

International Nuclear Information System (INIS)

Kim, Seongjin; Hwang, Daehyun; Kwon, Hyouk

2014-01-01

A stand-alone calculation of MATRA code used up pertinent computing time for the thermal margin calculations while a relatively considerable time is needed to solve the whole core pin-by-pin problems. In addition, it is strongly required to improve the computation speed of the MATRA code to satisfy the overall performance of the multi-physics coupling calculations. Therefore, a parallel approach to improve and optimize the computability of the MATRA code is proposed and verified in this study. The parallel algorithm is embodied in the MATRA code using the MPI communication method and the modification of the previous code structure was minimized. An improvement is confirmed by comparing the results between the single and multiple processor algorithms. The speedup and efficiency are also evaluated when increasing the number of processors. The parallel algorithm was implemented to the subchannel code MATRA using the MPI. The performance of the parallel algorithm was verified by comparing the results with those from the MATRA with the single processor. It is also noticed that the performance of the MATRA code was greatly improved by implementing the parallel algorithm for the 1/8 core and whole core problems

The (G′/G-Expansion Method and Its Application for Higher-Order Equations of KdV (III

Directory of Open Access Journals (Sweden)

Huizhang Yang

2014-01-01

Full Text Available New exact traveling wave solutions of a higher-order KdV equation type are studied by the (G′/G-expansion method, where G=G(ξ satisfies a second-order linear differential equation. The traveling wave solutions are expressed by the hyperbolic functions, the trigonometric functions, and the rational functions. The property of this method is that it is quite simple and understandable.

PALM: a paralleled and integrated framework for phylogenetic inference with automatic likelihood model selectors.

Directory of Open Access Journals (Sweden)

Shu-Hwa Chen

Full Text Available BACKGROUND: Selecting an appropriate substitution model and deriving a tree topology for a given sequence set are essential in phylogenetic analysis. However, such time consuming, computationally intensive tasks rely on knowledge of substitution model theories and related expertise to run through all possible combinations of several separate programs. To ensure a thorough and efficient analysis and avert tedious manipulations of various programs, this work presents an intuitive framework, the phylogenetic reconstruction with automatic likelihood model selectors (PALM, with convincing, updated algorithms and a best-fit model selection mechanism for seamless phylogenetic analysis. METHODOLOGY: As an integrated framework of ClustalW, PhyML, MODELTEST, ProtTest, and several in-house programs, PALM evaluates the fitness of 56 substitution models for nucleotide sequences and 112 substitution models for protein sequences with scores in various criteria. The input for PALM can be either sequences in FASTA format or a sequence alignment file in PHYLIP format. To accelerate the computing of maximum likelihood and bootstrapping, this work integrates MPICH2/PhyML, PalmMonitor and Palm job controller across several machines with multiple processors and adopts the task parallelism approach. Moreover, an intuitive and interactive web component, PalmTree, is developed for displaying and operating the output tree with options of tree rooting, branches swapping, viewing the branch length values, and viewing bootstrapping score, as well as removing nodes to restart analysis iteratively. SIGNIFICANCE: The workflow of PALM is straightforward and coherent. Via a succinct, user-friendly interface, researchers unfamiliar with phylogenetic analysis can easily use this server to submit sequences, retrieve the output, and re-submit a job based on a previous result if some sequences are to be deleted or added for phylogenetic reconstruction. PALM results in an inference of

Modulating functions method for parameters estimation in the fifth order KdV equation

KAUST Repository

Asiri, Sharefa M.

2017-07-25

In this work, the modulating functions method is proposed for estimating coefficients in higher-order nonlinear partial differential equation which is the fifth order Kortewegde Vries (KdV) equation. The proposed method transforms the problem into a system of linear algebraic equations of the unknowns. The statistical properties of the modulating functions solution are described in this paper. In addition, guidelines for choosing the number of modulating functions, which is an important design parameter, are provided. The effectiveness and robustness of the proposed method are shown through numerical simulations in both noise-free and noisy cases.

(Non)local Hamiltonian and symplectic structures, recursions and hierarchies: a new approach and applications to the N = 1 supersymmetric KdV equation

International Nuclear Information System (INIS)

Kersten, P; Krasil'shchik, I; Verbovetsky, A

2004-01-01

Using methods of Kersten et al (2004 J. Geom. Phys. 50 273-302) and Krasil'shchik and Kersten (2000 Symmetries and Recursion Operators for Classical and Supersymmetric Differential Equations (Dordrecht: Kluwer)), we accomplish an extensive study of the N = 1 supersymmetric Korteweg-de Vries (KdV) equation. The results include a description of local and nonlocal Hamiltonian and symplectic structures, five hierarchies of symmetries, the corresponding hierarchies of conservation laws, recursion operators for symmetries and generating functions of conservation laws. We stress that the main point of the paper is not just the results on super-KdV equation itself, but merely exposition of the efficiency of the geometrical approach and of the computational algorithms based on it

Using Coarrays to Parallelize Legacy Fortran Applications: Strategy and Case Study

Directory of Open Access Journals (Sweden)

Hari Radhakrishnan

2015-01-01

Full Text Available This paper summarizes a strategy for parallelizing a legacy Fortran 77 program using the object-oriented (OO and coarray features that entered Fortran in the 2003 and 2008 standards, respectively. OO programming (OOP facilitates the construction of an extensible suite of model-verification and performance tests that drive the development. Coarray parallel programming facilitates a rapid evolution from a serial application to a parallel application capable of running on multicore processors and many-core accelerators in shared and distributed memory. We delineate 17 code modernization steps used to refactor and parallelize the program and study the resulting performance. Our initial studies were done using the Intel Fortran compiler on a 32-core shared memory server. Scaling behavior was very poor, and profile analysis using TAU showed that the bottleneck in the performance was due to our implementation of a collective, sequential summation procedure. We were able to improve the scalability and achieve nearly linear speedup by replacing the sequential summation with a parallel, binary tree algorithm. We also tested the Cray compiler, which provides its own collective summation procedure. Intel provides no collective reductions. With Cray, the program shows linear speedup even in distributed-memory execution. We anticipate similar results with other compilers once they support the new collective procedures proposed for Fortran 2015.

An estimate of the number of tropical tree species

Science.gov (United States)

Slik, J. W. Ferry; Arroyo-Rodríguez, Víctor; Aiba, Shin-Ichiro; Alvarez-Loayza, Patricia; Alves, Luciana F.; Ashton, Peter; Balvanera, Patricia; Bastian, Meredith L.; Bellingham, Peter J.; van den Berg, Eduardo; Bernacci, Luis; da Conceição Bispo, Polyanna; Blanc, Lilian; Böhning-Gaese, Katrin; Boeckx, Pascal; Bongers, Frans; Boyle, Brad; Bradford, Matt; Brearley, Francis Q.; Breuer-Ndoundou Hockemba, Mireille; Bunyavejchewin, Sarayudh; Calderado Leal Matos, Darley; Castillo-Santiago, Miguel; Catharino, Eduardo L. M.; Chai, Shauna-Lee; Chen, Yukai; Colwell, Robert K.; Chazdon, Robin L.; Clark, Connie; Clark, David B.; Clark, Deborah A.; Culmsee, Heike; Damas, Kipiro; Dattaraja, Handanakere S.; Dauby, Gilles; Davidar, Priya; DeWalt, Saara J.; Doucet, Jean-Louis; Duque, Alvaro; Durigan, Giselda; Eichhorn, Karl A. O.; Eisenlohr, Pedro V.; Eler, Eduardo; Ewango, Corneille; Farwig, Nina; Feeley, Kenneth J.; Ferreira, Leandro; Field, Richard; de Oliveira Filho, Ary T.; Fletcher, Christine; Forshed, Olle; Franco, Geraldo; Fredriksson, Gabriella; Gillespie, Thomas; Gillet, Jean-François; Amarnath, Giriraj; Griffith, Daniel M.; Grogan, James; Gunatilleke, Nimal; Harris, David; Harrison, Rhett; Hector, Andy; Homeier, Jürgen; Imai, Nobuo; Itoh, Akira; Jansen, Patrick A.; Joly, Carlos A.; de Jong, Bernardus H. J.; Kartawinata, Kuswata; Kearsley, Elizabeth; Kelly, Daniel L.; Kenfack, David; Kessler, Michael; Kitayama, Kanehiro; Kooyman, Robert; Larney, Eileen; Laumonier, Yves; Laurance, Susan; Laurance, William F.; Lawes, Michael J.; do Amaral, Ieda Leao; Letcher, Susan G.; Lindsell, Jeremy; Lu, Xinghui; Mansor, Asyraf; Marjokorpi, Antti; Martin, Emanuel H.; Meilby, Henrik; Melo, Felipe P. L.; Metcalfe, Daniel J.; Medjibe, Vincent P.; Metzger, Jean Paul; Millet, Jerome; Mohandass, D.; Montero, Juan C.; de Morisson Valeriano, Márcio; Mugerwa, Badru; Nagamasu, Hidetoshi; Nilus, Reuben; Ochoa-Gaona, Susana; Onrizal; Page, Navendu; Parolin, Pia; Parren, Marc; Parthasarathy, Narayanaswamy; Paudel, Ekananda; Permana, Andrea; Piedade, Maria T. F.; Pitman, Nigel C. A.; Poorter, Lourens; Poulsen, Axel D.; Poulsen, John; Powers, Jennifer; Prasad, Rama C.; Puyravaud, Jean-Philippe; Razafimahaimodison, Jean-Claude; Reitsma, Jan; dos Santos, João Roberto; Roberto Spironello, Wilson; Romero-Saltos, Hugo; Rovero, Francesco; Rozak, Andes Hamuraby; Ruokolainen, Kalle; Rutishauser, Ervan; Saiter, Felipe; Saner, Philippe; Santos, Braulio A.; Santos, Fernanda; Sarker, Swapan K.; Satdichanh, Manichanh; Schmitt, Christine B.; Schöngart, Jochen; Schulze, Mark; Suganuma, Marcio S.; Sheil, Douglas; da Silva Pinheiro, Eduardo; Sist, Plinio; Stevart, Tariq; Sukumar, Raman; Sun, I.-Fang; Sunderland, Terry; Suresh, H. S.; Suzuki, Eizi; Tabarelli, Marcelo; Tang, Jangwei; Targhetta, Natália; Theilade, Ida; Thomas, Duncan W.; Tchouto, Peguy; Hurtado, Johanna; Valencia, Renato; van Valkenburg, Johan L. C. H.; Van Do, Tran; Vasquez, Rodolfo; Verbeeck, Hans; Adekunle, Victor; Vieira, Simone A.; Webb, Campbell O.; Whitfeld, Timothy; Wich, Serge A.; Williams, John; Wittmann, Florian; Wöll, Hannsjoerg; Yang, Xiaobo; Adou Yao, C. Yves; Yap, Sandra L.; Yoneda, Tsuyoshi; Zahawi, Rakan A.; Zakaria, Rahmad; Zang, Runguo; de Assis, Rafael L.; Garcia Luize, Bruno; Venticinque, Eduardo M.

2015-01-01

The high species richness of tropical forests has long been recognized, yet there remains substantial uncertainty regarding the actual number of tropical tree species. Using a pantropical tree inventory database from closed canopy forests, consisting of 657,630 trees belonging to 11,371 species, we use a fitted value of Fisher’s alpha and an approximate pantropical stem total to estimate the minimum number of tropical forest tree species to fall between ∼40,000 and ∼53,000, i.e., at the high end of previous estimates. Contrary to common assumption, the Indo-Pacific region was found to be as species-rich as the Neotropics, with both regions having a minimum of ∼19,000–25,000 tree species. Continental Africa is relatively depauperate with a minimum of ∼4,500–6,000 tree species. Very few species are shared among the African, American, and the Indo-Pacific regions. We provide a methodological framework for estimating species richness in trees that may help refine species richness estimates of tree-dependent taxa. PMID:26034279

An efficient and extensible approach for compressing phylogenetic trees.

Science.gov (United States)

Matthews, Suzanne J; Williams, Tiffani L

2011-10-18

Biologists require new algorithms to efficiently compress and store their large collections of phylogenetic trees. Our previous work showed that TreeZip is a promising approach for compressing phylogenetic trees. In this paper, we extend our TreeZip algorithm by handling trees with weighted branches. Furthermore, by using the compressed TreeZip file as input, we have designed an extensible decompressor that can extract subcollections of trees, compute majority and strict consensus trees, and merge tree collections using set operations such as union, intersection, and set difference. On unweighted phylogenetic trees, TreeZip is able to compress Newick files in excess of 98%. On weighted phylogenetic trees, TreeZip is able to compress a Newick file by at least 73%. TreeZip can be combined with 7zip with little overhead, allowing space savings in excess of 99% (unweighted) and 92%(weighted). Unlike TreeZip, 7zip is not immune to branch rotations, and performs worse as the level of variability in the Newick string representation increases. Finally, since the TreeZip compressed text (TRZ) file contains all the semantic information in a collection of trees, we can easily filter and decompress a subset of trees of interest (such as the set of unique trees), or build the resulting consensus tree in a matter of seconds. We also show the ease of which set operations can be performed on TRZ files, at speeds quicker than those performed on Newick or 7zip compressed Newick files, and without loss of space savings. TreeZip is an efficient approach for compressing large collections of phylogenetic trees. The semantic and compact nature of the TRZ file allow it to be operated upon directly and quickly, without a need to decompress the original Newick file. We believe that TreeZip will be vital for compressing and archiving trees in the biological community.

Solving Non-Isospectral mKdV Equation and Sine-Gordon Equation Hierarchies with Self-Consistent Sources via Inverse Scattering Transform

International Nuclear Information System (INIS)

Li Qi; Zhang Dajun; Chen Dengyuan

2010-01-01

N-soliton solutions of the hierarchy of non-isospectral mKdV equation with self-consistent sources and the hierarchy of non-isospectral sine-Gordon equation with self-consistent sources are obtained via the inverse scattering transform. (general)

Improvement of Parallel Algorithm for MATRA Code

International Nuclear Information System (INIS)

Kim, Seong-Jin; Seo, Kyong-Won; Kwon, Hyouk; Hwang, Dae-Hyun

2014-01-01

The feasibility study to parallelize the MATRA code was conducted in KAERI early this year. As a result, a parallel algorithm for the MATRA code has been developed to decrease a considerably required computing time to solve a bigsize problem such as a whole core pin-by-pin problem of a general PWR reactor and to improve an overall performance of the multi-physics coupling calculations. It was shown that the performance of the MATRA code was greatly improved by implementing the parallel algorithm using MPI communication. For problems of a 1/8 core and whole core for SMART reactor, a speedup was evaluated as about 10 when the numbers of used processor were 25. However, it was also shown that the performance deteriorated as the axial node number increased. In this paper, the procedure of a communication between processors is optimized to improve the previous parallel algorithm.. To improve the performance deterioration of the parallelized MATRA code, the communication algorithm between processors was newly presented. It was shown that the speedup was improved and stable regardless of the axial node number

Human eosinophils express, relative to other circulating leukocytes, large amounts of secretory 14-kD phospholipase A2

NARCIS (Netherlands)

Blom, M.; Tool, A. T.; Wever, P. C.; Wolbink, G. J.; Brouwer, M. C. [=Maria Clara; Calafat, J.; Egesten, A.; Knol, E. F.; Hack, C. E.; Roos, D.; Verhoeven, A. J.

1998-01-01

Human eosinophils perform several functions dependent on phospholipase A2 (PLA2) activity, most notably the synthesis of platelet-activating factor (PAF) and leukotriene C4 (LTC4). Several forms of PLA2 have been identified in mammalian cells. In the present study, the 14-kD, secretory form of PLA2

Boosted classification trees result in minor to modest improvement in the accuracy in classifying cardiovascular outcomes compared to conventional classification trees

Science.gov (United States)

Austin, Peter C; Lee, Douglas S

2011-01-01

Purpose: Classification trees are increasingly being used to classifying patients according to the presence or absence of a disease or health outcome. A limitation of classification trees is their limited predictive accuracy. In the data-mining and machine learning literature, boosting has been developed to improve classification. Boosting with classification trees iteratively grows classification trees in a sequence of reweighted datasets. In a given iteration, subjects that were misclassified in the previous iteration are weighted more highly than subjects that were correctly classified. Classifications from each of the classification trees in the sequence are combined through a weighted majority vote to produce a final classification. The authors' objective was to examine whether boosting improved the accuracy of classification trees for predicting outcomes in cardiovascular patients. Methods: We examined the utility of boosting classification trees for classifying 30-day mortality outcomes in patients hospitalized with either acute myocardial infarction or congestive heart failure. Results: Improvements in the misclassification rate using boosted classification trees were at best minor compared to when conventional classification trees were used. Minor to modest improvements to sensitivity were observed, with only a negligible reduction in specificity. For predicting cardiovascular mortality, boosted classification trees had high specificity, but low sensitivity. Conclusions: Gains in predictive accuracy for predicting cardiovascular outcomes were less impressive than gains in performance observed in the data mining literature. PMID:22254181

Occupational Allergy to Peach (Prunus persica) Tree Pollen and Potential Cross-Reactivity between Rosaceae Family Pollens.

Science.gov (United States)

Jiang, Nannan; Yin, Jia; Mak, Philip; Wen, Liping

2015-10-01

Orchard workers in north China are highly exposed to orchard pollens, especially peach and other Rosaceae family pollens during pollination season. The aim of this study was to investigate whether occupational allergy to peach tree pollen as a member of Rosaceae family is IgE-mediated and to evaluate the cross-reactivity among Rosaceae family pollens. Allergen skin test and conjunctival challenge test were performed; enzyme linked immune-sorbent assay (ELISA), inhibiting ELISA, western immunoblotting and inhibiting western immunoblotting were done with Rosaceae family orchard pollens, including peach, apricot, cherry, apple and pear tree pollens. Mass spectrometry was also performed to probe the main allergen component and cross-reactive protein. Sensitizations to peach pollen were found in both skin test and conjunctival challenge in the patients. Serum specific IgE to three pollens (peach, apricot and cherry) were detected through ELISA. When peach pollen used as solid phase, ELISA inhibition revealed other four kinds of pollens capable of inducing partial to strong inhibitions (45% to 87%), with the strongest inhibition belonging to apricot pollen (87%). Western blotting showed predominant IgE binding to a 20 KD protein among these pollens, which appeared to be a cross-reactive allergen component through western blotting inhibition. It was recognized as a protein homologous to glutathione s-transferase 16 from Arabidopsis thaliana. Peach and other Rosaceae family tree pollen may serve as a potential cause of IgE mediated occupational respiratory disease in orchard workers in north China.

Modular techniques for dynamic fault-tree analysis

Science.gov (United States)

Patterson-Hine, F. A.; Dugan, Joanne B.

1992-01-01

It is noted that current approaches used to assess the dependability of complex systems such as Space Station Freedom and the Air Traffic Control System are incapable of handling the size and complexity of these highly integrated designs. A novel technique for modeling such systems which is built upon current techniques in Markov theory and combinatorial analysis is described. It enables the development of a hierarchical representation of system behavior which is more flexible than either technique alone. A solution strategy which is based on an object-oriented approach to model representation and evaluation is discussed. The technique is virtually transparent to the user since the fault tree models can be built graphically and the objects defined automatically. The tree modularization procedure allows the two model types, Markov and combinatoric, to coexist and does not require that the entire fault tree be translated to a Markov chain for evaluation. This effectively reduces the size of the Markov chain required and enables solutions with less truncation, making analysis of longer mission times possible. Using the fault-tolerant parallel processor as an example, a model is built and solved for a specific mission scenario and the solution approach is illustrated in detail.

Sports Nutrition and Doping Factors in Synchronized Swimming: Parallel Analysis among Athletes and Coaches

Science.gov (United States)

Furjan Mandic, Gordana; Peric, Mia; Krzelj, Lucijana; Stankovic, Sladana; Zenic, Natasa

2013-01-01

Although nutrition and doping are important factors in sports, neither is often investigated in synchronized swimming (Synchro).This study aimed to define and compare Synchro athletes and their coaches on their knowledge of sports nutrition (KSN)and knowledge of doping (KD); and to study factors related to KSN and KD in each of these groups. Additionally, the KSNand KD questionnaires were evaluated for their reliability and validity. Altogether, 82 athletes (17.2 ± 1.92 years of age) and 28 coaches (30.8 ± 5.26 years of age) from Croatia and Serbia were included in the study, with a 99% response rate. The testand retest correlations were 0.94 and 0.90 for the KD and KSN,respectively. Subjects responded equally to 91% queries of the KD and 89% queries of the KSN. Although most of the coache sare highly educated, they declared self-education as the primary source of information about doping and sport-nutrition. Coaches scored higher than their athletes on both questionnaires which defined appropriate discriminative validity of the questionnaires. Variables such as age, sports experience and formal education are positively correlated to KSN and KD scores among athletes. The athletes who scored better on the KD are less prone to doping behavior in the future. These data reinforce the need for systematic educational programs on doping and sports nutrition in synchronized swimming. Special attention should be placed on younger athletes. Key Points Although most of the synchro coaches are highly educated, self-education is declared as the primary source of information about doping and sportnutrition. The knowledge of doping and doping-health hazards are negatively related to potential doping behavior in the future among synchronized swimmers The data reinforce the need for systematic educational programs on doping and sports nutrition in synchronized swimming. We advocate improving the knowledge of sports nutrition among older coaches and the knowledge of doping among

Sports Nutrition and Doping Factors in Synchronized Swimming: Parallel Analysis among Athletes and Coaches.

Science.gov (United States)

Furjan Mandic, Gordana; Peric, Mia; Krzelj, Lucijana; Stankovic, Sladana; Zenic, Natasa

2013-01-01

Although nutrition and doping are important factors in sports, neither is often investigated in synchronized swimming (Synchro).This study aimed to define and compare Synchro athletes and their coaches on their knowledge of sports nutrition (KSN)and knowledge of doping (KD); and to study factors related to KSN and KD in each of these groups. Additionally, the KSNand KD questionnaires were evaluated for their reliability and validity. Altogether, 82 athletes (17.2 ± 1.92 years of age) and 28 coaches (30.8 ± 5.26 years of age) from Croatia and Serbia were included in the study, with a 99% response rate. The testand retest correlations were 0.94 and 0.90 for the KD and KSN,respectively. Subjects responded equally to 91% queries of the KD and 89% queries of the KSN. Although most of the coache sare highly educated, they declared self-education as the primary source of information about doping and sport-nutrition. Coaches scored higher than their athletes on both questionnaires which defined appropriate discriminative validity of the questionnaires. Variables such as age, sports experience and formal education are positively correlated to KSN and KD scores among athletes. The athletes who scored better on the KD are less prone to doping behavior in the future. These data reinforce the need for systematic educational programs on doping and sports nutrition in synchronized swimming. Special attention should be placed on younger athletes. Key PointsAlthough most of the synchro coaches are highly educated, self-education is declared as the primary source of information about doping and sportnutrition.The knowledge of doping and doping-health hazards are negatively related to potential doping behavior in the future among synchronized swimmersThe data reinforce the need for systematic educational programs on doping and sports nutrition in synchronized swimming.We advocate improving the knowledge of sports nutrition among older coaches and the knowledge of doping among

Using Load Balancing to Scalably Parallelize Sampling-Based Motion Planning Algorithms

KAUST Repository

Fidel, Adam; Jacobs, Sam Ade; Sharma, Shishir; Amato, Nancy M.; Rauchwerger, Lawrence

2014-01-01

Motion planning, which is the problem of computing feasible paths in an environment for a movable object, has applications in many domains ranging from robotics, to intelligent CAD, to protein folding. The best methods for solving this PSPACE-hard problem are so-called sampling-based planners. Recent work introduced uniform spatial subdivision techniques for parallelizing sampling-based motion planning algorithms that scaled well. However, such methods are prone to load imbalance, as planning time depends on region characteristics and, for most problems, the heterogeneity of the sub problems increases as the number of processors increases. In this work, we introduce two techniques to address load imbalance in the parallelization of sampling-based motion planning algorithms: an adaptive work stealing approach and bulk-synchronous redistribution. We show that applying these techniques to representatives of the two major classes of parallel sampling-based motion planning algorithms, probabilistic roadmaps and rapidly-exploring random trees, results in a more scalable and load-balanced computation on more than 3,000 cores. © 2014 IEEE.

Using Load Balancing to Scalably Parallelize Sampling-Based Motion Planning Algorithms

KAUST Repository

Fidel, Adam

2014-05-01

Motion planning, which is the problem of computing feasible paths in an environment for a movable object, has applications in many domains ranging from robotics, to intelligent CAD, to protein folding. The best methods for solving this PSPACE-hard problem are so-called sampling-based planners. Recent work introduced uniform spatial subdivision techniques for parallelizing sampling-based motion planning algorithms that scaled well. However, such methods are prone to load imbalance, as planning time depends on region characteristics and, for most problems, the heterogeneity of the sub problems increases as the number of processors increases. In this work, we introduce two techniques to address load imbalance in the parallelization of sampling-based motion planning algorithms: an adaptive work stealing approach and bulk-synchronous redistribution. We show that applying these techniques to representatives of the two major classes of parallel sampling-based motion planning algorithms, probabilistic roadmaps and rapidly-exploring random trees, results in a more scalable and load-balanced computation on more than 3,000 cores. © 2014 IEEE.

Tree compression with top trees

DEFF Research Database (Denmark)

Bille, Philip; Gørtz, Inge Li; Landau, Gad M.

2013-01-01

We introduce a new compression scheme for labeled trees based on top trees [3]. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast...

Tree compression with top trees

DEFF Research Database (Denmark)

Bille, Philip; Gørtz, Inge Li; Landau, Gad M.

2015-01-01

We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast...

Succinct partial sums and fenwick trees

DEFF Research Database (Denmark)

Bille, Philip; Christiansen, Anders Roy; Prezza, Nicola

2017-01-01

We consider the well-studied partial sums problem in succint space where one is to maintain an array of n k-bit integers subject to updates such that partial sums queries can be efficiently answered. We present two succint versions of the Fenwick Tree – which is known for its simplicity...... and practicality. Our results hold in the encoding model where one is allowed to reuse the space from the input data. Our main result is the first that only requires nk + o(n) bits of space while still supporting sum/update in O(logbn)/O(blogbn) time where 2 ≤ b ≤ log O(1)n. The second result shows how optimal...... time for sum/update can be achieved while only slightly increasing the space usage to nk + o(nk) bits. Beyond Fenwick Trees, the results are primarily based on bit-packing and sampling – making them very practical – and they also allow for simple optimal parallelization....

Implementasi KD-Tree K-Means Clustering Untuk Klasterisasi Dokumen

OpenAIRE

Gosno, Eric Budiman; Arieshanti, Isye; Soelaiman, Rully

2013-01-01

Klasterisasi dokumen adalah suatu proses pengelompokan dokumen secara otomatis dan unsupervised. Klasterisasi dokumen merupakan permasalahan yang sering ditemui dalam berbagai bidang seperti text mining dan sistem temu kembali informasi. Metode klasterisasi dokumen yang memiliki akurasi dan efisiensi waktu yang tinggi sangat diperlukan untuk meningkatkan hasil pada mesin pencari web, dan untuk proses filtering. Salah satu metode klasterisasi yang telah dikenal dan diaplikasikan dalam klaster...

Deuteron magnetic resonance in KD3(SeO3)2

International Nuclear Information System (INIS)

Kasahara, Masaru

1978-01-01

Quadrupole coupling constant and the direction of the principal axes of EFG tensor of deuterons in KD 3 (SeO 3 ) 2 are obtained from 40 to -106 0 C. It is confirmed that there exist two symmetrically inequivalent deuterons D(1) and D(2), and D(1) is ordered in the disordered phase. Deuterons D(2) are found to be dynamically disordered in the disordered phase. In the ordered phase, D(1) sites are divided into two inequivalent groups while the number of D(2) sites remains unchanged. The splitting of the resonance line of D(1) in the ordered phase depends on temperature as (T sub(tr)-T)sup(β), where T sub(tr) is 24.9 0 C and β is about 0.52 +- 0.08 in the temperature from 24.4 to 22 0 C and 0.46+-0.01 from 22 to 3 0 C. The relation between the splitting and the order parameter is discussed. (auth.)

Generalising tree traversals and tree transformations to DAGs

DEFF Research Database (Denmark)

Bahr, Patrick; Axelsson, Emil

2017-01-01

We present a recursion scheme based on attribute grammars that can be transparently applied to trees and acyclic graphs. Our recursion scheme allows the programmer to implement a tree traversal or a tree transformation and then apply it to compact graph representations of trees instead. The resul......We present a recursion scheme based on attribute grammars that can be transparently applied to trees and acyclic graphs. Our recursion scheme allows the programmer to implement a tree traversal or a tree transformation and then apply it to compact graph representations of trees instead...... as the complementing theory with a number of examples....

Models for estimation of tree volume in the miombo woodlands of ...

African Journals Online (AJOL)

Volume of trees is an important parameter in forest management, but only volume models with limited geographical and tree size coverage have previously been developed for Tanzanian miombo woodlands. This study developed models for estimating total, merchantable stem and branches volume applicable for the entire ...

Increased Kawasaki Disease Incidence Associated With Higher Precipitation and Lower Temperatures, Japan, 1991-2004.

Science.gov (United States)

Abrams, Joseph Y; Blase, Jennifer L; Belay, Ermias D; Uehara, Ritei; Maddox, Ryan A; Schonberger, Lawrence B; Nakamura, Yosikazu

2018-06-01

Kawasaki disease (KD) is an acute febrile vasculitis, which primarily affects children. The etiology of KD is unknown; while certain characteristics of the disease suggest an infectious origin, genetic or environmental factors may also be important. Seasonal patterns of KD incidence are well documented, but it is unclear whether these patterns are caused by changes in climate or by other unknown seasonal effects. The relationship between KD incidence and deviations from expected temperature and precipitation were analyzed using KD incidence data from Japanese nationwide epidemiologic surveys (1991-2004) and climate data from 136 weather stations of the Japan Meteorological Agency. Seven separate Poisson-distributed generalized linear regression models were run to examine the effects of temperature and precipitation on KD incidence in the same month as KD onset and the previous 1, 2, 3, 4, 5 and 6 months, controlling for geography as well as seasonal and long-term trends in KD incidence. KD incidence was negatively associated with temperature in the previous 2, 3, 4 and 5 months and positively associated with precipitation in the previous 1 and 2 months. The model that best predicted variations in KD incidence used climate data from the previous 2 months. An increase in total monthly precipitation by 100 mm was associated with increased KD incidence (rate ratio [RR] 1.012, 95% confidence interval [CI]: 1.005-1.019), and an increase of monthly mean temperature by 1°C was associated with decreased KD incidence (RR 0.984, 95% CI: 0.978-0.990). KD incidence was significantly affected by temperature and precipitation in previous months independent of other unknown seasonal factors. Climate data from the previous 2 months best predicted the variations in KD incidence. Although fairly minor, the effect of temperature and precipitation independent of season may provide additional clues to the etiology of KD.

Objective Provision Tree for K-DEMO

International Nuclear Information System (INIS)

Oh, Kyemin; Kang, Myung-suk; Heo, Gyunyoung; Kim, Hyoung-chan

2014-01-01

In current nuclear field based on technology-neutral approach, safety principles and design have been considered for Generation IV (Gen-IV) nuclear power plants in parallel. This strategy can save resource, time, and manpower while keeping achievable safety. For this reason, the studies related with safety affecting significant design parameters for planned construction or fusion plants was needed and required even though K-DEMO is staying in pre-conceptual design phase. Objective Provision Tree (OPT) is one of the tools of Integrated Safety Assessment Methodology (ISAM) developed by Risk and Safety Working Group (RSWG) for design and assessment of Gen-IV. This is suitable tool to recognize and investigate safety issues from previous engineering experience. The purpose of this paper is to suggest multiple barriers/critical safety function and to describe the current status of the OPT for the conceptual design of K-DEMO. In this paper, critical safety functions were defined and OPT for K-DEMO was described and performed. We have carried out researches related to safety for fusion power plant in collaboration with the academies funded by NFRI during the past 4 years. As part of this research, Integrated Safety Assessment Methodology (ISAM), which was used to develop GEN-IV nuclear systems, was used to determine the technical safety issues and regulatory requirements for K-DEMO. OPT is one of ISAM tools

bufferkdtree

DEFF Research Database (Denmark)

Gieseke, Fabian Cristian; Oancea, Cosmin Eugen; Igel, Christian

2017-01-01

The bufferkdtree package is an open-source software that provides an efficient implementation for processing huge amounts of nearest neighbor queries in Euclidean spaces of moderate dimensionality. Its underlying implementation resorts to a variant of the classical k-d tree data structure, called...... buffer k-d tree, which can be used to efficiently perform bulk nearest neighbor searches on modern many-core devices. The package, which is based on Python, C, and OpenCL, is made publicly available online at https://github.com/gieseke/bufferkdtree under the GPLv2 license....

An efficient and extensible approach for compressing phylogenetic trees

KAUST Repository

Matthews, Suzanne J

2011-01-01

Background: Biologists require new algorithms to efficiently compress and store their large collections of phylogenetic trees. Our previous work showed that TreeZip is a promising approach for compressing phylogenetic trees. In this paper, we extend our TreeZip algorithm by handling trees with weighted branches. Furthermore, by using the compressed TreeZip file as input, we have designed an extensible decompressor that can extract subcollections of trees, compute majority and strict consensus trees, and merge tree collections using set operations such as union, intersection, and set difference.Results: On unweighted phylogenetic trees, TreeZip is able to compress Newick files in excess of 98%. On weighted phylogenetic trees, TreeZip is able to compress a Newick file by at least 73%. TreeZip can be combined with 7zip with little overhead, allowing space savings in excess of 99% (unweighted) and 92%(weighted). Unlike TreeZip, 7zip is not immune to branch rotations, and performs worse as the level of variability in the Newick string representation increases. Finally, since the TreeZip compressed text (TRZ) file contains all the semantic information in a collection of trees, we can easily filter and decompress a subset of trees of interest (such as the set of unique trees), or build the resulting consensus tree in a matter of seconds. We also show the ease of which set operations can be performed on TRZ files, at speeds quicker than those performed on Newick or 7zip compressed Newick files, and without loss of space savings.Conclusions: TreeZip is an efficient approach for compressing large collections of phylogenetic trees. The semantic and compact nature of the TRZ file allow it to be operated upon directly and quickly, without a need to decompress the original Newick file. We believe that TreeZip will be vital for compressing and archiving trees in the biological community. © 2011 Matthews and Williams; licensee BioMed Central Ltd.

Life-history traits in an evergreen Mediterranean oak respond differentially to previous experimental environments

Directory of Open Access Journals (Sweden)

J. M. Rey Benayas

2008-06-01

Full Text Available Living organisms respond both to current and previous environments, which can have important consequences on population dynamics. However, there is little experimental evidence based on long-term field studies of the effects of previous environments on the performance of individuals. We tested the hypothesis that trees that establish under different environmental conditions perform differently under similar post-establishment conditions. We used the slow-growing, evergreen Mediterranean oak Quercus ilex subsp. rotundifolia as target species. We analyzed the effects of previous environments, competition effects and tradeoffs among life-history traits (survival, growth, and reproduction. We enhanced seedling establishment for three years by reducing abiotic environmental harshness by means of summer irrigation and artificial shading in 12 experimental plots, while four plots remained as controls. Then these treatments were interrupted for ten years. Seedlings under ameliorated environmental conditions survived and grew faster during early establishment. During the post-management period, previous treatments 1 did not have any effect on survival, 2 experienced a slower above-ground growth, 3 decreased root biomass as indicated from reflectivity of Ground Penetration Radar, 4 increased acorn production mostly through a greater canopy volume and 5 increased acorn production effort. The trees exhibited a combination of effects related to acclimation for coping with abiotic stress and effects of intra-specific competition. In accordance with our hypothesis, tree performance overall depended on previous environmental conditions, and the response was different for different life-history traits. We recommend early management because it increased plot cover, shortened the time to attain sexual maturity and increased the amount of acorn production. Plots such as those assessed in this study may act as sources of propagules in deforested

Efficient sequential and parallel algorithms for record linkage.

Science.gov (United States)

Mamun, Abdullah-Al; Mi, Tian; Aseltine, Robert; Rajasekaran, Sanguthevar

2014-01-01

Integrating data from multiple sources is a crucial and challenging problem. Even though there exist numerous algorithms for record linkage or deduplication, they suffer from either large time needs or restrictions on the number of datasets that they can integrate. In this paper we report efficient sequential and parallel algorithms for record linkage which handle any number of datasets and outperform previous algorithms. Our algorithms employ hierarchical clustering algorithms as the basis. A key idea that we use is radix sorting on certain attributes to eliminate identical records before any further processing. Another novel idea is to form a graph that links similar records and find the connected components. Our sequential and parallel algorithms have been tested on a real dataset of 1,083,878 records and synthetic datasets ranging in size from 50,000 to 9,000,000 records. Our sequential algorithm runs at least two times faster, for any dataset, than the previous best-known algorithm, the two-phase algorithm using faster computation of the edit distance (TPA (FCED)). The speedups obtained by our parallel algorithm are almost linear. For example, we get a speedup of 7.5 with 8 cores (residing in a single node), 14.1 with 16 cores (residing in two nodes), and 26.4 with 32 cores (residing in four nodes). We have compared the performance of our sequential algorithm with TPA (FCED) and found that our algorithm outperforms the previous one. The accuracy is the same as that of this previous best-known algorithm.

TreePics: visualizing trees with pictures

Directory of Open Access Journals (Sweden)

Nicolas Puillandre

2017-09-01

Full Text Available While many programs are available to edit phylogenetic trees, associating pictures with branch tips in an efficient and automatic way is not an available option. Here, we present TreePics, a standalone software that uses a web browser to visualize phylogenetic trees in Newick format and that associates pictures (typically, pictures of the voucher specimens to the tip of each branch. Pictures are visualized as thumbnails and can be enlarged by a mouse rollover. Further, several pictures can be selected and displayed in a separate window for visual comparison. TreePics works either online or in a full standalone version, where it can display trees with several thousands of pictures (depending on the memory available. We argue that TreePics can be particularly useful in a preliminary stage of research, such as to quickly detect conflicts between a DNA-based phylogenetic tree and morphological variation, that may be due to contamination that needs to be removed prior to final analyses, or the presence of species complexes.

Tree automata-based refinement with application to Horn clause verification

DEFF Research Database (Denmark)

Kafle, Bishoksan; Gallagher, John Patrick

2015-01-01

In this paper we apply tree-automata techniques to refinement of abstract interpretation in Horn clause verification. We go beyond previous work on refining trace abstractions; firstly we handle tree automata rather than string automata and thereby can capture traces in any Horn clause derivation...... compare the results with other state of the art Horn clause verification tools....

When a tree falls: Controls on wood decay predict standing dead tree fall and new risks in changing forests.

Science.gov (United States)

Oberle, Brad; Ogle, Kiona; Zanne, Amy E; Woodall, Christopher W

2018-01-01

When standing dead trees (snags) fall, they have major impacts on forest ecosystems. Snag fall can redistribute wildlife habitat and impact public safety, while governing important carbon (C) cycle consequences of tree mortality because ground contact accelerates C emissions during deadwood decay. Managing the consequences of altered snag dynamics in changing forests requires predicting when snags fall as wood decay erodes mechanical resistance to breaking forces. Previous studies have pointed to common predictors, such as stem size, degree of decay and species identity, but few have assessed the relative strength of underlying mechanisms driving snag fall across biomes. Here, we analyze nearly 100,000 repeated snag observations from boreal to subtropical forests across the eastern United States to show that wood decay controls snag fall in ways that could generate previously unrecognized forest-climate feedback. Warmer locations where wood decays quickly had much faster rates of snag fall. The effect of temperature on snag fall was so strong that in a simple forest C model, anticipated warming by mid-century reduced snag C by 22%. Furthermore, species-level differences in wood decay resistance (durability) accurately predicted the timing of snag fall. Differences in half-life for standing dead trees were similar to expected differences in the service lifetimes of wooden structures built from their timber. Strong effects of temperature and wood durability imply future forests where dying trees fall and decay faster than at present, reducing terrestrial C storage and snag-dependent wildlife habitat. These results can improve the representation of forest C cycling and assist forest managers by helping predict when a dead tree may fall.

Metal fate and partitioning in soils under bark beetle-killed trees.

Science.gov (United States)

Bearup, Lindsay A; Mikkelson, Kristin M; Wiley, Joseph F; Navarre-Sitchler, Alexis K; Maxwell, Reed M; Sharp, Jonathan O; McCray, John E

2014-10-15

Recent mountain pine beetle infestation in the Rocky Mountains of North America has killed an unprecedented acreage of pine forest, creating an opportunity to observe an active re-equilibration in response to widespread land cover perturbation. This work investigates metal mobility in beetle-impacted forests using parallel rainwater and acid leaches to estimate solid-liquid partitioning coefficients and a complete sequential extraction procedure to determine how metals are fractionated in soils under trees experiencing different phases of mortality. Geochemical model simulations analyzed in consideration with experimental data provide additional insight into the mechanisms controlling metal complexation. Metal and base-cation mobility consistently increased in soils under beetle-attacked trees relative to soil under healthy trees. Mobility increases were more pronounced on south facing slopes and more strongly correlated to pH under attacked trees than under healthy trees. Similarly, soil moisture was significantly higher under dead trees, related to the loss of transpiration and interception. Zinc and cadmium content increased in soils under dead trees relative to living trees. Cadmium increases occurred predominantly in the exchangeable fraction, indicating increased mobilization potential. Relative increases of zinc were greatest in the organic fraction, the only fraction where increases in copper were observed. Model results reveal that increased organic complexation, not changes in pH or base cation concentrations, can explain the observed differences in metal partitioning for zinc, nickel, cadmium, and copper. Predicted concentrations would be unlikely to impair human health or plant growth at these sites; however, higher exchangeable metals under beetle-killed trees relative to healthy trees suggest a possible decline in riverine ecosystem health and water quality in areas already approaching criteria limits and drinking water standards. Impairment of water

Computing all hybridization networks for multiple binary phylogenetic input trees.

Science.gov (United States)

Albrecht, Benjamin

2015-07-30

The computation of phylogenetic trees on the same set of species that are based on different orthologous genes can lead to incongruent trees. One possible explanation for this behavior are interspecific hybridization events recombining genes of different species. An important approach to analyze such events is the computation of hybridization networks. This work presents the first algorithm computing the hybridization number as well as a set of representative hybridization networks for multiple binary phylogenetic input trees on the same set of taxa. To improve its practical runtime, we show how this algorithm can be parallelized. Moreover, we demonstrate the efficiency of the software Hybroscale, containing an implementation of our algorithm, by comparing it to PIRNv2.0, which is so far the best available software computing the exact hybridization number for multiple binary phylogenetic trees on the same set of taxa. The algorithm is part of the software Hybroscale, which was developed specifically for the investigation of hybridization networks including their computation and visualization. Hybroscale is freely available(1) and runs on all three major operating systems. Our simulation study indicates that our approach is on average 100 times faster than PIRNv2.0. Moreover, we show how Hybroscale improves the interpretation of the reported hybridization networks by adding certain features to its graphical representation.

A Fast Exact k-Nearest Neighbors Algorithm for High Dimensional Search Using k-Means Clustering and Triangle Inequality.

Science.gov (United States)

Wang, Xueyi

2012-02-08

The k-nearest neighbors (k-NN) algorithm is a widely used machine learning method that finds nearest neighbors of a test object in a feature space. We present a new exact k-NN algorithm called kMkNN (k-Means for k-Nearest Neighbors) that uses the k-means clustering and the triangle inequality to accelerate the searching for nearest neighbors in a high dimensional space. The kMkNN algorithm has two stages. In the buildup stage, instead of using complex tree structures such as metric trees, kd-trees, or ball-tree, kMkNN uses a simple k-means clustering method to preprocess the training dataset. In the searching stage, given a query object, kMkNN finds nearest training objects starting from the nearest cluster to the query object and uses the triangle inequality to reduce the distance calculations. Experiments show that the performance of kMkNN is surprisingly good compared to the traditional k-NN algorithm and tree-based k-NN algorithms such as kd-trees and ball-trees. On a collection of 20 datasets with up to 10(6) records and 10(4) dimensions, kMkNN shows a 2-to 80-fold reduction of distance calculations and a 2- to 60-fold speedup over the traditional k-NN algorithm for 16 datasets. Furthermore, kMkNN performs significant better than a kd-tree based k-NN algorithm for all datasets and performs better than a ball-tree based k-NN algorithm for most datasets. The results show that kMkNN is effective for searching nearest neighbors in high dimensional spaces.

Scalable parallel prefix solvers for discrete ordinates transport

International Nuclear Information System (INIS)

Pautz, S.; Pandya, T.; Adams, M.

2009-01-01

The well-known 'sweep' algorithm for inverting the streaming-plus-collision term in first-order deterministic radiation transport calculations has some desirable numerical properties. However, it suffers from parallel scaling issues caused by a lack of concurrency. The maximum degree of concurrency, and thus the maximum parallelism, grows more slowly than the problem size for sweeps-based solvers. We investigate a new class of parallel algorithms that involves recasting the streaming-plus-collision problem in prefix form and solving via cyclic reduction. This method, although computationally more expensive at low levels of parallelism than the sweep algorithm, offers better theoretical scalability properties. Previous work has demonstrated this approach for one-dimensional calculations; we show how to extend it to multidimensional calculations. Notably, for multiple dimensions it appears that this approach is limited to long-characteristics discretizations; other discretizations cannot be cast in prefix form. We implement two variants of the algorithm within the radlib/SCEPTRE transport code library at Sandia National Laboratories and show results on two different massively parallel systems. Both the 'forward' and 'symmetric' solvers behave similarly, scaling well to larger degrees of parallelism then sweeps-based solvers. We do observe some issues at the highest levels of parallelism (relative to the system size) and discuss possible causes. We conclude that this approach shows good potential for future parallel systems, but the parallel scalability will depend heavily on the architecture of the communication networks of these systems. (authors)

Regolith properties under trees and the biomechanical effects caused by tree root systems as recognized by electrical resistivity tomography (ERT)

Science.gov (United States)

Pawlik, Łukasz; Kasprzak, Marek

2018-01-01

Following previous findings regarding the influence of vascular plants (mainly trees) on weathering, soil production and hillslope stability, in this study, we attempted to test a hypothesis regarding significant impacts of tree root systems on soil and regolith properties. Different types of impacts from tree root system (direct and indirect) are commonly gathered under the key term of "biomechanical effects". To add to the discussion of the biomechanical effects of trees, we used a non-invasive geophysical method, electrical resistivity tomography (ERT), to investigate the profiles of four different configurations at three study sites within the Polish section of the Outer Western Carpathians. At each site, one long profile (up to 189 m) of a large section of a hillslope and three short profiles (up to 19.5 m), that is, microsites occupied by trees or their remnants, were made. Short profiles included the tree root zone of a healthy large tree, the tree stump of a decaying tree and the pit-and-mound topography formed after a tree uprooting. The resistivity of regolith and bedrock presented on the long profiles and in comparison with the short profiles through the microsites it can be seen how tree roots impact soil and regolith properties and add to the complexity of the whole soil/regolith profile. Trees change soil and regolith properties directly through root channels and moisture migration and indirectly through the uprooting of trees and the formation of pit-and-mound topography. Within tree stump microsites, the impact of tree root systems, evaluated by a resistivity model, was smaller compared to microsites with living trees or those with pit-and-mound topography but was still visible even several decades after the trees were windbroken or cut down. The ERT method is highly useful for quick evaluation of the impact of tree root systems on soils and regolith. This method, in contrast to traditional soil analyses, offers a continuous dataset for the entire

An Extension of the Optimal Homotopy Asymptotic Method to Coupled Schrödinger-KdV Equation

Directory of Open Access Journals (Sweden)

Hakeem Ullah

2014-01-01

Full Text Available We consider the approximate solution of the coupled Schrödinger-KdV equation by using the extended optimal homotopy asymptotic method (OHAM. We obtained the extended OHAM solution of the problem and compared with the exact, variational iteration method (VIM and homotopy perturbation method (HPM solutions. The obtained solution shows that extended OHAM is effective, simpler, easier, and explicit and gives a suitable way to control the convergence of the approximate solution.

[Influence of cattle cord blood fraction below 5 kD on biochemical parameters of blood in experimental chronic stomach ulcer in rats].

Science.gov (United States)

Gulevskiĭ, A K; Abakumova, E S; Moiseeva, N N; Dolgikh, O L

2008-01-01

Influence of cattle cord blood fraction (below 5 kD) on lipid peroxidation product content and alkaline phosphatase activity-in peripheral blood was studied on the experimental subchronic stomach ulcer model in rats. It has been shown that the fraction administrations normalize thiobarbituric-active product content and alkaline phosphatase activity in blood, which testifies to decreasing inflammatory reaction in the mucous membrane of the stomach. The fraction administrations accelerate the processes of regeneration of the mucous membrane of the stomach up to complete healing of ulcer defects. Cord blood fraction below 5 kD from cattle possesses antiulcer activity which is analogous to the actovegin activity. It has been shown by gel-penetrating chromatography that the pattern of cord blood fraction low molecular substances is different from the actovegin pattern both qualitatively and quantitatively.

Extraction of Phrase-Structure Fragments with a Linear Average Time Tree-Kernel

NARCIS (Netherlands)

van Cranenburgh, Andreas

2014-01-01

We present an algorithm and implementation for extracting recurring fragments from treebanks. Using a tree-kernel method the largest common fragments are extracted from each pair of trees. The algorithm presented achieves a thirty-fold speedup over the previously available method on the Wall Street

Metal fate and partitioning in soils under bark beetle-killed trees

Energy Technology Data Exchange (ETDEWEB)

Bearup, Lindsay A., E-mail: lbearup@mines.edu [Department of Civil and Environmental Engineering, Colorado School of Mines, 1500 Illinois Street, Golden, CO 80401 (United States); Hydrological Science and Engineering Program, Colorado School of Mines, 1500 Illinois Street, Golden, CO 80401 (United States); Mikkelson, Kristin M. [Department of Civil and Environmental Engineering, Colorado School of Mines, 1500 Illinois Street, Golden, CO 80401 (United States); Hydrological Science and Engineering Program, Colorado School of Mines, 1500 Illinois Street, Golden, CO 80401 (United States); Wiley, Joseph F. [Department of Civil and Environmental Engineering, Colorado School of Mines, 1500 Illinois Street, Golden, CO 80401 (United States); Navarre-Sitchler, Alexis K.; Maxwell, Reed M. [Hydrological Science and Engineering Program, Colorado School of Mines, 1500 Illinois Street, Golden, CO 80401 (United States); Department of Geology and Geological Engineering, Colorado School of Mines, 1500 Illinois Street, Golden, CO 80401 (United States); Sharp, Jonathan O.; McCray, John E. [Department of Civil and Environmental Engineering, Colorado School of Mines, 1500 Illinois Street, Golden, CO 80401 (United States); Hydrological Science and Engineering Program, Colorado School of Mines, 1500 Illinois Street, Golden, CO 80401 (United States)

2014-10-15

Recent mountain pine beetle infestation in the Rocky Mountains of North America has killed an unprecedented acreage of pine forest, creating an opportunity to observe an active re-equilibration in response to widespread land cover perturbation. This work investigates metal mobility in beetle-impacted forests using parallel rainwater and acid leaches to estimate solid–liquid partitioning coefficients and a complete sequential extraction procedure to determine how metals are fractionated in soils under trees experiencing different phases of mortality. Geochemical model simulations analyzed in consideration with experimental data provide additional insight into the mechanisms controlling metal complexation. Metal and base-cation mobility consistently increased in soils under beetle-attacked trees relative to soil under healthy trees. Mobility increases were more pronounced on south facing slopes and more strongly correlated to pH under attacked trees than under healthy trees. Similarly, soil moisture was significantly higher under dead trees, related to the loss of transpiration and interception. Zinc and cadmium content increased in soils under dead trees relative to living trees. Cadmium increases occurred predominantly in the exchangeable fraction, indicating increased mobilization potential. Relative increases of zinc were greatest in the organic fraction, the only fraction where increases in copper were observed. Model results reveal that increased organic complexation, not changes in pH or base cation concentrations, can explain the observed differences in metal partitioning for zinc, nickel, cadmium, and copper. Predicted concentrations would be unlikely to impair human health or plant growth at these sites; however, higher exchangeable metals under beetle-killed trees relative to healthy trees suggest a possible decline in riverine ecosystem health and water quality in areas already approaching criteria limits and drinking water standards. Impairment of

Antibodies to SS-A/Ro-52kD and centromere in autoimmune liver disease: a clue to diagnosis and prognosis of primary biliary cirrhosis.

Science.gov (United States)

Granito, A; Muratori, P; Muratori, L; Pappas, G; Cassani, F; Worthington, J; Ferri, S; Quarneti, C; Cipriano, V; de Molo, C; Lenzi, M; Chapman, R W; Bianchi, F B

2007-09-15

Primary biliary cirrhosis (PBC) may be associated with various rheumatological disorders. To investigate the frequency and significance of 'rheumatological' antinuclear antibodies in the field of autoimmune chronic liver disease, with special regard to PBC. We studied 105 patients with PBC, 162 autoimmune liver disease controls (type 1 and 2 autoimmune hepatitis, primary sclerosing cholangitis), 30 systemic lupus erythematosus and 50 blood donors. Sera were tested for the presence of antibodies to extractable nuclear antigens (anti-ENA) by counterimmunoelectrophoresis, enzyme-linked and immunoblot (IB) assay, and for the presence of anti-centromere antibodies (ACA) by indirect immunofluorescence on HEp-2 cells and IB. The overall prevalence of IB-detected anti-ENA in PBC (30%) was higher than in type 1 autoimmune hepatitis (2.5%, P < 0.0001), type 2 autoimmune hepatitis (0%, P < 0.0001) and primary sclerosing cholangitis (11.5%, P = 0.006) and lower than in systemic lupus erythematosus (53%, P = 0.03). The most frequent anti-ENA reactivity in PBC was anti-SSA/Ro-52kD (28%). ACA were detected by IB in 21% PBC patients and never in the other subjects (P < 0.0001). Anti-SS-A/Ro/52kD positive PBC patients had at the time of diagnosis a more advanced histological stage (P = 0.01) and higher serum levels of bilirubin (P = 0.01) and IgM (P = 0.03) compared with negative ones. In the autoimmune liver disease setting, anti-SS-A/Ro-52kD and ACA have a high specificity for PBC and can thus be of diagnostic relevance in anti-mitochondrial antibodies negative cases. If confirmed in further studies with adequate follow-up, anti-SS-A/Ro-52kD antibodies might identify PBC patients with a more advanced and active disease.

High Efficiency EBCOT with Parallel Coding Architecture for JPEG2000

Directory of Open Access Journals (Sweden)

Chiang Jen-Shiun

2006-01-01

Full Text Available This work presents a parallel context-modeling coding architecture and a matching arithmetic coder (MQ-coder for the embedded block coding (EBCOT unit of the JPEG2000 encoder. Tier-1 of the EBCOT consumes most of the computation time in a JPEG2000 encoding system. The proposed parallel architecture can increase the throughput rate of the context modeling. To match the high throughput rate of the parallel context-modeling architecture, an efficient pipelined architecture for context-based adaptive arithmetic encoder is proposed. This encoder of JPEG2000 can work at 180 MHz to encode one symbol each cycle. Compared with the previous context-modeling architectures, our parallel architectures can improve the throughput rate up to 25%.

A parallel direct solver for the self-adaptive hp Finite Element Method

KAUST Repository

Paszyński, Maciej R.

2010-03-01

In this paper we present a new parallel multi-frontal direct solver, dedicated for the hp Finite Element Method (hp-FEM). The self-adaptive hp-FEM generates in a fully automatic mode, a sequence of hp-meshes delivering exponential convergence of the error with respect to the number of degrees of freedom (d.o.f.) as well as the CPU time, by performing a sequence of hp refinements starting from an arbitrary initial mesh. The solver constructs an initial elimination tree for an arbitrary initial mesh, and expands the elimination tree each time the mesh is refined. This allows us to keep track of the order of elimination for the solver. The solver also minimizes the memory usage, by de-allocating partial LU factorizations computed during the elimination stage of the solver, and recomputes them for the backward substitution stage, by utilizing only about 10% of the computational time necessary for the original computations. The solver has been tested on 3D Direct Current (DC) borehole resistivity measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive h p-FEM, with finite elements of various sizes and polynomial orders of approximation varying from p = 1 to p = 9. From the presented experiments it follows that the parallel solver scales well up to the maximum number of utilized processors. The limit for the solver scalability is the maximum sequential part of the algorithm: the computations of the partial LU factorizations over the longest path, coming from the root of the elimination tree down to the deepest leaf. © 2009 Elsevier Inc. All rights reserved.

ColorTree: a batch customization tool for phylogenic trees.

Science.gov (United States)

Chen, Wei-Hua; Lercher, Martin J

2009-07-31

Genome sequencing projects and comparative genomics studies typically aim to trace the evolutionary history of large gene sets, often requiring human inspection of hundreds of phylogenetic trees. If trees are checked for compatibility with an explicit null hypothesis (e.g., the monophyly of certain groups), this daunting task is greatly facilitated by an appropriate coloring scheme. In this note, we introduce ColorTree, a simple yet powerful batch customization tool for phylogenic trees. Based on pattern matching rules, ColorTree applies a set of customizations to an input tree file, e.g., coloring labels or branches. The customized trees are saved to an output file, which can then be viewed and further edited by Dendroscope (a freely available tree viewer). ColorTree runs on any Perl installation as a stand-alone command line tool, and its application can thus be easily automated. This way, hundreds of phylogenic trees can be customized for easy visual inspection in a matter of minutes. ColorTree allows efficient and flexible visual customization of large tree sets through the application of a user-supplied configuration file to multiple tree files.

Tree improvement and environmental forestry

Science.gov (United States)

Warren T. Doolittle

1971-01-01

I was invited to talk to you about some of the things tree improvement can do to help our forest environment. Now I do not claim to have a corner on the market for ideas that geneticists can use in our environment, and I know that a number of scholarly papers have been presented previously on this subject.

Estimating Coextinction Risks from Epidemic Tree Death: Affiliate Lichen Communities among Diseased Host Tree Populations of Fraxinus excelsior

Science.gov (United States)

Jönsson, Mari T.; Thor, Göran

2012-01-01

At least 10% of the world’s tree species are threatened with extinction and pathogens are increasingly implicated in tree threats. Coextinction and threats to affiliates as a consequence of the loss or decline of their host trees is a poorly understood phenomenon. Ash dieback is an emerging infectious disease causing severe dieback of common ash Fraxinus excelsior throughout Europe. We utilized available empirical data on affiliate epiphytic lichen diversity (174 species and 17,800 observations) among 20 ash dieback infected host tree populations of F. excelsior on the island Gotland in the Baltic Sea, Sweden. From this, we used structured scenario projections scaled with empirical data of ash dieback disease to generate probabilistic models for estimating local and regional lichen coextinction risks. Average coextinction probabilities (Ā) were 0.38 (95% CI ±0.09) for lichens occurring on F. excelsior and 0.14 (95% CI ±0.03) when considering lichen persistence on all tree species. Ā was strongly linked to local disease incidence levels and generally increasing with lichen host specificity to F. excelsior and decreasing population size. Coextinctions reduced affiliate community viability, with significant local reductions in species richness and shifts in lichen species composition. Affiliates were projected to become locally extirpated before their hosts, illuminating the need to also consider host tree declines. Traditionally managed open wooded meadows had the highest incidence of ash dieback disease and significantly higher proportions of affiliate species projected to go extinct, compared with unmanaged closed forests and semi-open grazed sites. Most cothreatened species were not previously red-listed, which suggest that tree epidemics cause many unforeseen threats to species. Our analysis shows that epidemic tree deaths represent an insidious, mostly overlooked, threat to sessile affiliate communities in forested environments. Current conservation and

On the Accuracy of Language Trees

Science.gov (United States)

Pompei, Simone; Loreto, Vittorio; Tria, Francesca

2011-01-01

Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available information are typically lists of homologous (lexical, phonological, syntactic) features or characters for many different languages: a set of parallel corpora whose compilation represents a paramount achievement in linguistics. From this perspective the reconstruction of language trees is an example of inverse problems: starting from present, incomplete and often noisy, information, one aims at inferring the most likely past evolutionary history. A fundamental issue in inverse problems is the evaluation of the inference made. A standard way of dealing with this question is to generate data with artificial models in order to have full access to the evolutionary process one is going to infer. This procedure presents an intrinsic limitation: when dealing with real data sets, one typically does not know which model of evolution is the most suitable for them. A possible way out is to compare algorithmic inference with expert classifications. This is the point of view we take here by conducting a thorough survey of the accuracy of reconstruction methods as compared with the Ethnologue expert classifications. We focus in particular on state-of-the-art distance-based methods for phylogeny reconstruction using worldwide linguistic databases. In order to assess the accuracy of the inferred trees we introduce and characterize two generalizations of standard definitions of distances between trees. Based on these scores we quantify the relative performances of the distance-based algorithms considered. Further we quantify how the completeness and the coverage of the available databases affect the accuracy of the reconstruction. Finally we draw some conclusions about where the accuracy of the reconstructions in historical linguistics stands and about the leading directions to improve it. PMID:21674034

On the accuracy of language trees.

Directory of Open Access Journals (Sweden)

Simone Pompei

Full Text Available Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available information are typically lists of homologous (lexical, phonological, syntactic features or characters for many different languages: a set of parallel corpora whose compilation represents a paramount achievement in linguistics. From this perspective the reconstruction of language trees is an example of inverse problems: starting from present, incomplete and often noisy, information, one aims at inferring the most likely past evolutionary history. A fundamental issue in inverse problems is the evaluation of the inference made. A standard way of dealing with this question is to generate data with artificial models in order to have full access to the evolutionary process one is going to infer. This procedure presents an intrinsic limitation: when dealing with real data sets, one typically does not know which model of evolution is the most suitable for them. A possible way out is to compare algorithmic inference with expert classifications. This is the point of view we take here by conducting a thorough survey of the accuracy of reconstruction methods as compared with the Ethnologue expert classifications. We focus in particular on state-of-the-art distance-based methods for phylogeny reconstruction using worldwide linguistic databases. In order to assess the accuracy of the inferred trees we introduce and characterize two generalizations of standard definitions of distances between trees. Based on these scores we quantify the relative performances of the distance-based algorithms considered. Further we quantify how the completeness and the coverage of the available databases affect the accuracy of the reconstruction. Finally we draw some conclusions about where the accuracy of the reconstructions in historical linguistics stands and about the leading directions to improve

A fault tree analysis strategy using binary decision diagrams

International Nuclear Information System (INIS)

Reay, Karen A.; Andrews, John D.

2002-01-01

The use of binary decision diagrams (BDDs) in fault tree analysis provides both an accurate and efficient means of analysing a system. There is a problem, however, with the conversion process of the fault tree to the BDD. The variable ordering scheme chosen for the construction of the BDD has a crucial effect on its resulting size and previous research has failed to identify any scheme that is capable of producing BDDs for all fault trees. This paper proposes an analysis strategy aimed at increasing the likelihood of obtaining a BDD for any given fault tree, by ensuring the associated calculations are as efficient as possible. The method implements simplification techniques, which are applied to the fault tree to obtain a set of 'minimal' subtrees, equivalent to the original fault tree structure. BDDs are constructed for each, using ordering schemes most suited to their particular characteristics. Quantitative analysis is performed simultaneously on the set of BDDs to obtain the top event probability, the system unconditional failure intensity and the criticality of the basic events

Gambaran Igg4 dan Ige terhadap Protein Mikrofilaria pada Sera Penduduk Endemis Filariasis di Kecamatan Pasir Penyu, Riau

OpenAIRE

SU, Basundari; Kurniawan, Liliana; A., Soeroto; Marleta, Rita; Yasin, M

1993-01-01

Western blot test to detect specific IgG4 and IgE was performed to 12 microfilaraemic and 13 amicrofilaraemic individuals from malayan filariasis endemic area, Pasir Penyu, Riau. No differences in binding patterns of IgG4 and IgE antibodies to microfUarial protein components was shown. There was a parallel protein components recognition by IgG4 and IgE of molecular weight ranging from 158 kd to 14 kd. Protein component of 125 kd was only recognized by IgG4 and of 112 kd only by IgE. These fin...

Parallel Programming with Intel Parallel Studio XE

CERN Document Server

Blair-Chappell , Stephen

2012-01-01

Optimize code for multi-core processors with Intel's Parallel Studio Parallel programming is rapidly becoming a "must-know" skill for developers. Yet, where to start? This teach-yourself tutorial is an ideal starting point for developers who already know Windows C and C++ and are eager to add parallelism to their code. With a focus on applying tools, techniques, and language extensions to implement parallelism, this essential resource teaches you how to write programs for multicore and leverage the power of multicore in your programs. Sharing hands-on case studies and real-world examples, the

Real-time SHVC software decoding with multi-threaded parallel processing

Science.gov (United States)

Gudumasu, Srinivas; He, Yuwen; Ye, Yan; He, Yong; Ryu, Eun-Seok; Dong, Jie; Xiu, Xiaoyu

2014-09-01

This paper proposes a parallel decoding framework for scalable HEVC (SHVC). Various optimization technologies are implemented on the basis of SHVC reference software SHM-2.0 to achieve real-time decoding speed for the two layer spatial scalability configuration. SHVC decoder complexity is analyzed with profiling information. The decoding process at each layer and the up-sampling process are designed in parallel and scheduled by a high level application task manager. Within each layer, multi-threaded decoding is applied to accelerate the layer decoding speed. Entropy decoding, reconstruction, and in-loop processing are pipeline designed with multiple threads based on groups of coding tree units (CTU). A group of CTUs is treated as a processing unit in each pipeline stage to achieve a better trade-off between parallelism and synchronization. Motion compensation, inverse quantization, and inverse transform modules are further optimized with SSE4 SIMD instructions. Simulations on a desktop with an Intel i7 processor 2600 running at 3.4 GHz show that the parallel SHVC software decoder is able to decode 1080p spatial 2x at up to 60 fps (frames per second) and 1080p spatial 1.5x at up to 50 fps for those bitstreams generated with SHVC common test conditions in the JCT-VC standardization group. The decoding performance at various bitrates with different optimization technologies and different numbers of threads are compared in terms of decoding speed and resource usage, including processor and memory.

Parallel Monte Carlo Search for Hough Transform

Science.gov (United States)

Lopes, Raul H. C.; Franqueira, Virginia N. L.; Reid, Ivan D.; Hobson, Peter R.

2017-10-01

We investigate the problem of line detection in digital image processing and in special how state of the art algorithms behave in the presence of noise and whether CPU efficiency can be improved by the combination of a Monte Carlo Tree Search, hierarchical space decomposition, and parallel computing. The starting point of the investigation is the method introduced in 1962 by Paul Hough for detecting lines in binary images. Extended in the 1970s to the detection of space forms, what came to be known as Hough Transform (HT) has been proposed, for example, in the context of track fitting in the LHC ATLAS and CMS projects. The Hough Transform transfers the problem of line detection, for example, into one of optimization of the peak in a vote counting process for cells which contain the possible points of candidate lines. The detection algorithm can be computationally expensive both in the demands made upon the processor and on memory. Additionally, it can have a reduced effectiveness in detection in the presence of noise. Our first contribution consists in an evaluation of the use of a variation of the Radon Transform as a form of improving theeffectiveness of line detection in the presence of noise. Then, parallel algorithms for variations of the Hough Transform and the Radon Transform for line detection are introduced. An algorithm for Parallel Monte Carlo Search applied to line detection is also introduced. Their algorithmic complexities are discussed. Finally, implementations on multi-GPU and multicore architectures are discussed.

Passive control potentials of trees and on-street parked cars in reduction of air pollution exposure in urban street canyons

International Nuclear Information System (INIS)

Abhijith, K.V.; Gokhale, Sharad

2015-01-01

This study investigates the passive-control-potentials of trees and on-street parked cars on pedestrian exposure to air pollutants in a street canyon using three-dimensional CFD. Since, according to some studies trees deteriorate air quality and cars parked roadside improve it, the combine as well as separate effects of trees and on-street parked cars have been examined. For this, different tree canopy layouts and parking configurations have been developed and pedestrian exposure for each has been analysed. The results showed, for example, tree crown with high porosity and low-stand density in combination with parallel or perpendicular car parking reduced the pedestrian exposure considerably. - Highlights: • Trees and on-street parked cars can manipulate pollutant levels in street canyons. • Low stand density trees with 0° or 90° car parking reduce pedestrian exposure. • Trees with medium crown, high porosity, low stand density reduce pollutant levels. - This study investigated the combination of trees and on-street parked cars to manipulate pollutant levels in urban street canyons to reduce pedestrian exposure

Tree Colors: Color Schemes for Tree-Structured Data.

Science.gov (United States)

Tennekes, Martijn; de Jonge, Edwin

2014-12-01

We present a method to map tree structures to colors from the Hue-Chroma-Luminance color model, which is known for its well balanced perceptual properties. The Tree Colors method can be tuned with several parameters, whose effect on the resulting color schemes is discussed in detail. We provide a free and open source implementation with sensible parameter defaults. Categorical data are very common in statistical graphics, and often these categories form a classification tree. We evaluate applying Tree Colors to tree structured data with a survey on a large group of users from a national statistical institute. Our user study suggests that Tree Colors are useful, not only for improving node-link diagrams, but also for unveiling tree structure in non-hierarchical visualizations.

Cesium accumulation in native trees from the Brazilian Cerrado

International Nuclear Information System (INIS)

Franca, E.J.D.; Miranda, M.V.F.E.S.; Santos, T.O.; Cantinha, R.S.; Fernandes, E.A.D.N.

2016-01-01

Even considered not essential for plants, cesium may cycle within forest ecosystems. Taking into account the lack of knowledge on the distribution of this chemical element in Brazilian ecosystems, this work encompasses the unexpected cesium accumulation in native plant leaves from Cerradao, a Brazilian hotspot of world biodiversity. Some trees were Cs accumulators, achieving mass fractions in leaves 700 times higher (up to 12.7 mg kg -1 ) when compared to other Brazilian native tree leaves from the Atlantic Forest. In fact, such trace element accumulation in leaves was not previously noticed for Brazilian ecosystems despite the intra- and inter-species variability observed in Cerrado tree leaves. (author)

TreePOD: Sensitivity-Aware Selection of Pareto-Optimal Decision Trees.

Science.gov (United States)

Muhlbacher, Thomas; Linhardt, Lorenz; Moller, Torsten; Piringer, Harald

2018-01-01

Balancing accuracy gains with other objectives such as interpretability is a key challenge when building decision trees. However, this process is difficult to automate because it involves know-how about the domain as well as the purpose of the model. This paper presents TreePOD, a new approach for sensitivity-aware model selection along trade-offs. TreePOD is based on exploring a large set of candidate trees generated by sampling the parameters of tree construction algorithms. Based on this set, visualizations of quantitative and qualitative tree aspects provide a comprehensive overview of possible tree characteristics. Along trade-offs between two objectives, TreePOD provides efficient selection guidance by focusing on Pareto-optimal tree candidates. TreePOD also conveys the sensitivities of tree characteristics on variations of selected parameters by extending the tree generation process with a full-factorial sampling. We demonstrate how TreePOD supports a variety of tasks involved in decision tree selection and describe its integration in a holistic workflow for building and selecting decision trees. For evaluation, we illustrate a case study for predicting critical power grid states, and we report qualitative feedback from domain experts in the energy sector. This feedback suggests that TreePOD enables users with and without statistical background a confident and efficient identification of suitable decision trees.

Two Trees: Migrating Fault Trees to Decision Trees for Real Time Fault Detection on International Space Station

Science.gov (United States)

Lee, Charles; Alena, Richard L.; Robinson, Peter

2004-01-01

We started from ISS fault trees example to migrate to decision trees, presented a method to convert fault trees to decision trees. The method shows that the visualizations of root cause of fault are easier and the tree manipulating becomes more programmatic via available decision tree programs. The visualization of decision trees for the diagnostic shows a format of straight forward and easy understands. For ISS real time fault diagnostic, the status of the systems could be shown by mining the signals through the trees and see where it stops at. The other advantage to use decision trees is that the trees can learn the fault patterns and predict the future fault from the historic data. The learning is not only on the static data sets but also can be online, through accumulating the real time data sets, the decision trees can gain and store faults patterns in the trees and recognize them when they come.

Development of parallel Fokker-Planck code ALLAp

International Nuclear Information System (INIS)

Batishcheva, A.A.; Sigmar, D.J.; Koniges, A.E.

1996-01-01

We report on our ongoing development of the 3D Fokker-Planck code ALLA for a highly collisional scrape-off-layer (SOL) plasma. A SOL with strong gradients of density and temperature in the spatial dimension is modeled. Our method is based on a 3-D adaptive grid (in space, magnitude of the velocity, and cosine of the pitch angle) and a second order conservative scheme. Note that the grid size is typically 100 x 257 x 65 nodes. It was shown in our previous work that only these capabilities make it possible to benchmark a 3D code against a spatially-dependent self-similar solution of a kinetic equation with the Landau collision term. In the present work we show results of a more precise benchmarking against the exact solutions of the kinetic equation using a new parallel code ALLAp with an improved method of parallelization and a modified boundary condition at the plasma edge. We also report first results from the code parallelization using Message Passing Interface for a Massively Parallel CRI T3D platform. We evaluate the ALLAp code performance versus the number of T3D processors used and compare its efficiency against a Work/Data Sharing parallelization scheme and a workstation version

Anti-parallel dimer and tetramer formation of propylene carbonate

Directory of Open Access Journals (Sweden)

Ayana Tagawa

2017-09-01

Full Text Available Raman scattering and infrared (IR absorption spectra of enantiopure (R-propylene carbonate ((RPC and racemic propylene carbonate (PC were recorded at room temperature, 25 °C, in benzene (Bz solution and in the pure liquid state to investigate the presence of dimers and other higher order intermolecular associations. (RPC and PC both demonstrated a strong C=O stretching vibrational band. The band exhibited changes in its shape and resonance wavenumber highly dependent on the concentrations of PCs, whereas a difference between the chirality of (RPC and PC had little influence. In an extremely dilute condition, doubly split bands were observed at 1807 and 1820 cm-1 in both Raman and IR spectra, which are assigned to the characteristic bands of isolated monomeric PCs. An additional band appeared at 1795 cm-1 in a dilute to concentrated regime, and its magnitude strengthened with increasing concentrations accompanied with slight increasing in the magnitude of 1807 cm-1 band in Raman spectra, while an increase in the magnitude of 1807 cm-1 band was clearly greater than that of 1795 cm-1 band in IR spectra. The spectrum changes at 1795 and 1807 cm-1 were attributed to characteristics of anti-parallel dimer formation of PCs caused by strong dipole-dipole interactions between C=O groups. Moreover, another additional signal was clearly observed at 1780-1790 cm-1 in a concentrated regime, and became the primary signal in the pure liquid state with slight increasing in the intensity of 1795 cm-1 band in Raman spectra. On the other hand, in IR spectra the observed increasing of 1780-1790 cm-1 band was much less than that of 1795 cm-1 band. These newly found spectrum changes in the concentrated regime are attributed to the formation of anti-parallel tetramers of PCs based on the characteristics of band selection rule found in Raman and IR spectra. Equilibrium constants for the anti-parallel dimer (KD and tetramer formation (KT of PCs in Bz solution and in

A high performance parallel approach to medical imaging

International Nuclear Information System (INIS)

Frieder, G.; Frieder, O.; Stytz, M.R.

1988-01-01

Research into medical imaging using general purpose parallel processing architectures is described and a review of the performance of previous medical imaging machines is provided. Results demonstrating that general purpose parallel architectures can achieve performance comparable to other, specialized, medical imaging machine architectures is presented. A new back-to-front hidden-surface removal algorithm is described. Results demonstrating the computational savings obtained by using the modified back-to-front hidden-surface removal algorithm are presented. Performance figures for forming a full-scale medical image on a mesh interconnected multiprocessor are presented

Modular high-temperature gas-cooled reactor simulation using parallel processors

International Nuclear Information System (INIS)

Ball, S.J.; Conklin, J.C.

1989-01-01

The MHPP (Modular HTGR Parallel Processor) code has been developed to simulate modular high-temperature gas-cooled reactor (MHTGR) transients and accidents. MHPP incorporates a very detailed model for predicting the dynamics of the reactor core, vessel, and cooling systems over a wide variety of scenarios ranging from expected transients to very-low-probability severe accidents. The simulations routines, which had originally been developed entirely as serial code, were readily adapted to parallel processing Fortran. The resulting parallelized simulation speed was enhanced significantly. Workstation interfaces are being developed to provide for user (operator) interaction. In this paper the benefits realized by adapting previous MHTGR codes to run on a parallel processor are discussed, along with results of typical accident analyses

Contributions to computational stereology and parallel programming

DEFF Research Database (Denmark)

Rasmusson, Allan

rotator, even without the need for isotropic sections. To meet the need for computational power to perform image restoration of virtual tissue sections, parallel programming on GPUs has also been part of the project. This has lead to a significant change in paradigm for a previously developed surgical...

Long-Term Effects of Ketogenic Diet on Subsequent Seizure-Induced Brain Injury During Early Adulthood: Relationship of Seizure Thresholds to Zinc Transporter-Related Gene Expressions.

Science.gov (United States)

Tian, Tian; Li, Li-Li; Zhang, Shu-Qi; Ni, Hong

2016-12-01

The divalent cation zinc is associated with cortical plasticity. However, the mechanism of zinc in the pathophysiology of cortical injury-associated neurobehavioral damage following neonatal seizures is uncertain. We have previously shown upregulated expression of ZnT-3; MT-3 in hippocampus of neonatal rats submitted to flurothyl-induced recurrent seizures, which was restored by pretreatment with ketogenic diet (KD). In this study, utilizing a novel "twist" seizure model by coupling early-life flurothyl-induced seizures with later exposure to penicillin, we further investigated the long-term effects of KD on cortical expression of zinc homeostasis-related genes in a systemic scale. Ten Sprague-Dawley rats were assigned each averagely into the non-seizure plus normal diet (NS + ND), non-seizure plus KD (NS + KD), recurrent seizures plus normal diet (RS + ND) and recurrent seizures plus KD (RS + KD) group. Recurrent seizures were induced by volatile flurothyl during P9-P21. During P23-P53, rats in NS + KD and RS + KD groups were dieted with KD. Neurological behavioral parameters of brain damage (plane righting reflex, cliff avoidance reflex, and open field test) were observed at P43. At P63, we examined seizure threshold using penicillin, then the cerebral cortex were evaluated for real-time RT-PCR and western blot study. The RS + ND group showed worse performances in neurological reflex tests and reduced latencies to myoclonic seizures induced by penicillin compared with the control, which was concomitant with altered expressions of ZnT-7, MT-1, MT-2, and ZIP7. Specifically, there was long-term elevated expression of ZIP7 in RS + ND group compared with that in NS + ND that was restored by chronic ketogenic diet (KD) treatment in RS + KD group, which was quite in parallel with the above neurobehavioral changes. Taken together, these findings indicate that the long-term altered expression of the metal transporter ZIP7 in adult cerebral cortex might

Preliminary results on comparison of adsorption-desorption methods and statistical techniques to generate Kd predictor equations

International Nuclear Information System (INIS)

Serne, R.J.; Rai, D.; Relyea, J.F.

1979-01-01

The radioactive waste isolation safety assessment program (WISAP) is being performed for the United States Department of Energy. A large bank of data have been collected under this program. A part of the program is devoted to the evaluation of radionuclide-geomedia interactions in order to determine the behavior of different elements in the environment. This paper introduces and briefly summarizes data collected thus far on methods of determining adsorption coefficients, thermodynamic predictions of stable solid and solution species, Kd data, and studies for determining adsorption mechanisms

Tree-ring analysis of ancient baldcypress trees and subfossil wood

Science.gov (United States)

Stahle, David W.; Burnette, Dorian J.; Villanueva, Jose; Cerano, Julian; Fye, Falko K.; Griffin, R. Daniel; Cleaveland, Malcolm K.; Stahle, Daniel K.; Edmondson, Jesse R.; Wolff, Kathryn P.

2012-02-01

Ancient baldcypress trees found in wetland and riverine environments have been used to develop a network of exactly dated annual ring-width chronologies extending from the southeastern United States, across Mexico, and into western Guatemala. These chronologies are sensitive to growing season precipitation in spite of frequently flooded site conditions, and have been used to reconstruct moisture levels the southeastern United States and Mexico for over 1000 years. The El Nino/Southern Oscillation (ENSO) is a major influence on the climate reconstructions derived from these baldcypress chronologies, especially in Mexico where some of the most extreme reconstructed droughts occurred during El Nino events. In the Southeast, the ENSO influence on climate and tree growth changes sign from spring to summer, and this change in dynamical forcing is recorded by sub-seasonal chronologies of earlywood and latewood width. Most existing baldcypress chronologies have been extended with tree-ring data from "subfossil" wood recovered from surface and submerged deposits. Well-preserved subfossil logs have also been recovered in quantity from buried deposits of great age, and may permit development of long continuously dated Holocene chronologies and discontinuous "floating" Pleistocene chronologies. The extensive subfossil baldcypress swamp discovered 6 m below the streets of Washington D.C. was overrun by a transgression of the Potomac estuary, possibly during the previous super interglacial (marine OIS 5e), and provides direct evidence for one potential impact of unmitigated anthropogenic warming and sea level rise.

A molecular phylogeny of scaly tree ferns (Cyatheaceae).

Science.gov (United States)

Korall, Petra; Conant, David S; Metzgar, Jordan S; Schneider, Harald; Pryer, Kathleen M

2007-05-01

Tree ferns recently were identified as the closest sister group to the hyperdiverse clade of ferns, the polypods. Although most of the 600 species of tree ferns are arborescent, the group encompasses a wide range of morphological variability, from diminutive members to the giant scaly tree ferns, Cyatheaceae. This well-known family comprises most of the tree fern diversity (∼500 species) and is widespread in tropical, subtropical, and south temperate regions of the world. Here we investigate the phylogenetic relationships of scaly tree ferns based on DNA sequence data from five plastid regions (rbcL, rbcL-accD IGS, rbcL-atpB IGS, trnG-trnR, and trnL-trnF). A basal dichotomy resolves Sphaeropteris as sister to all other taxa and scale features support these two clades: Sphaeropteris has conform scales, whereas all other taxa have marginate scales. The marginate-scaled clade consists of a basal trichotomy, with the three groups here termed (1) Cyathea (including Cnemidaria, Hymenophyllopsis, Trichipteris), (2) Alsophila sensu stricto, and (3) Gymnosphaera (previously recognized as a section within Alsophila) + A. capensis. Scaly tree ferns display a wide range of indusial structures, and although indusium shape is homoplastic it does contain useful phylogenetic information that supports some of the larger clades recognised.

Stability properties of solitary waves for fractional KdV and BBM equations

Science.gov (United States)

Angulo Pava, Jaime

2018-03-01

This paper sheds new light on the stability properties of solitary wave solutions associated with Korteweg-de Vries-type models when the dispersion is very low. Using a compact, analytic approach and asymptotic perturbation theory, we establish sufficient conditions for the existence of exponentially growing solutions to the linearized problem and so a criterium of spectral instability of solitary waves is obtained for both models. Moreover, the nonlinear stability and spectral instability of the ground state solutions for both models is obtained for some specific regimen of parameters. Via a Lyapunov strategy and a variational analysis, we obtain the stability of the blow-up of solitary waves for the critical fractional KdV equation. The arguments presented in this investigation show promise for use in the study of the instability of traveling wave solutions of other nonlinear evolution equations.

Three-dimensional segmentation and skeletonization to build an airway tree data structure for small animals

International Nuclear Information System (INIS)

Chaturvedi, Ashutosh; Lee, Zhenghong

2005-01-01

Quantitative analysis of intrathoracic airway tree geometry is important for objective evaluation of bronchial tree structure and function. Currently, there is more human data than small animal data on airway morphometry. In this study, we implemented a semi-automatic approach to quantitatively describe airway tree geometry by using high-resolution computed tomography (CT) images to build a tree data structure for small animals such as rats and mice. Silicon lung casts of the excised lungs from a canine and a mouse were used for micro-CT imaging of the airway trees. The programming language IDL was used to implement a 3D region-growing threshold algorithm for segmenting out the airway lung volume from the CT data. Subsequently, a fully-parallel 3D thinning algorithm was implemented in order to complete the skeletonization of the segmented airways. A tree data structure was then created and saved by parsing through the skeletonized volume using the Python programming language. Pertinent information such as the length of all airway segments was stored in the data structure. This approach was shown to be accurate and efficient for up to six generations for the canine lung cast and ten generations for the mouse lung cast

Tree Nut Allergies

Science.gov (United States)

... Blog Vision Awards Common Allergens Tree Nut Allergy Tree Nut Allergy Learn about tree nut allergy, how ... a Tree Nut Label card . Allergic Reactions to Tree Nuts Tree nuts can cause a severe and ...

A parallel solver for huge dense linear systems

Science.gov (United States)

Badia, J. M.; Movilla, J. L.; Climente, J. I.; Castillo, M.; Marqués, M.; Mayo, R.; Quintana-Ortí, E. S.; Planelles, J.

2011-11-01

: Linux/Unix Has the code been vectorized or parallelized?: Yes, includes MPI primitives. RAM: Tested for up to 190 GB Classification: 6.5 External routines: MPI ( http://www.mpi-forum.org/), BLAS ( http://www.netlib.org/blas/), PLAPACK ( http://www.cs.utexas.edu/~plapack/), POOCLAPACK ( ftp://ftp.cs.utexas.edu/pub/rvdg/PLAPACK/pooclapack.ps) (code for PLAPACK and POOCLAPACK is included in the distribution). Catalogue identifier of previous version: AEHU_v1_0 Journal reference of previous version: Comput. Phys. Comm. 182 (2011) 533 Does the new version supersede the previous version?: Yes Nature of problem: Huge scale dense systems of linear equations, Ax=B, beyond standard LAPACK capabilities. Solution method: The linear systems are solved by means of parallelized routines based on the LU factorization, using efficient secondary storage algorithms when the available main memory is insufficient. Reasons for new version: In many applications we need to guarantee a high accuracy in the solution of very large linear systems and we can do it by using double-precision arithmetic. Summary of revisions: Version 1.1 Can be used to solve linear systems using double-precision arithmetic. New version of the initialization routine. The user can choose the kind of arithmetic and the values of several parameters of the environment. Running time: About 5 hours to solve a system with more than 200 000 equations and more than 10 000 right-hand side vectors using double-precision arithmetic on an eight-node commodity cluster with a total of 64 Intel cores.

Integrative Dynamic Reconfiguration in a Parallel Stream Processing Engine

DEFF Research Database (Denmark)

Madsen, Kasper Grud Skat; Zhou, Yongluan; Cao, Jianneng

2017-01-01

Load balancing, operator instance collocations and horizontal scaling are critical issues in Parallel Stream Processing Engines to achieve low data processing latency, optimized cluster utilization and minimized communication cost respectively. In previous work, these issues are typically tackled...... solution called ALBIC, which support general jobs. We implement the proposed techniques on top of Apache Storm, an open-source Parallel Stream Processing Engine. The extensive experimental results over both synthetic and real datasets show that our techniques clearly outperform existing approaches....

Sensitivity Analysis of the Proximal-Based Parallel Decomposition Methods

Directory of Open Access Journals (Sweden)

Feng Ma

2014-01-01

Full Text Available The proximal-based parallel decomposition methods were recently proposed to solve structured convex optimization problems. These algorithms are eligible for parallel computation and can be used efficiently for solving large-scale separable problems. In this paper, compared with the previous theoretical results, we show that the range of the involved parameters can be enlarged while the convergence can be still established. Preliminary numerical tests on stable principal component pursuit problem testify to the advantages of the enlargement.

KD901G X-ray system to reject contaminants

International Nuclear Information System (INIS)

Shinohara, Hachiro

1995-01-01

Among the complaints to the foods that consumers bought, the proportion of the mixing of alien substances is more than 20%. The number of the cases classified by the kinds of alien substances, and that of minerals and animal substances are shown. The causes of the mixing of alien substances are classified into those due to the mixing in raw materials, production places, processing machines and workers. In case of using primary products as raw materials, the alien substances closely related to those raw materials are difficult to detect, such as bones and hairs in animal meat, fish bones, egg shells and fruit seeds. There are problems and limitation in the inspection of alien substance mixing by visual or touching inspection, metal detectors and the visual inspection of X-ray radiographs. The judgement of the presence of alien substances by automatically processing X-ray radiograph information has been tried one or two-dimensionally. The X-ray alien substance detector KD901G adopted the one-dimensional line sensor type, and its features are shown. The effective introduction of the X-ray alien substance detector, its comparison with metal detectors, and the safety of workers against radiation exposure and the safety of inspected foods are discussed. (K.I.)

Phylogenetic affinity of tree shrews to Glires is attributed to fast evolution rate.

Science.gov (United States)

Lin, Jiannan; Chen, Guangfeng; Gu, Liang; Shen, Yuefeng; Zheng, Meizhu; Zheng, Weisheng; Hu, Xinjie; Zhang, Xiaobai; Qiu, Yu; Liu, Xiaoqing; Jiang, Cizhong

2014-02-01

Previous phylogenetic analyses have led to incongruent evolutionary relationships between tree shrews and other suborders of Euarchontoglires. What caused the incongruence remains elusive. In this study, we identified 6845 orthologous genes between seventeen placental mammals. Tree shrews and Primates were monophyletic in the phylogenetic trees derived from the first or/and second codon positions whereas tree shrews and Glires formed a monophyly in the trees derived from the third or all codon positions. The same topology was obtained in the phylogeny inference using the slowly and fast evolving genes, respectively. This incongruence was likely attributed to the fast substitution rate in tree shrews and Glires. Notably, sequence GC content only was not informative to resolve the controversial phylogenetic relationships between tree shrews, Glires, and Primates. Finally, estimation in the confidence of the tree selection strongly supported the phylogenetic affiliation of tree shrews to Primates as a monophyly. Copyright © 2013 Elsevier Inc. All rights reserved.

Harvesting costs and production rates for seed-tree removal in young-growth, mixed-conifer stands

Science.gov (United States)

Philip M. McDonald

1969-01-01

Ponderosa pine seed trees left from a previous cutting on the Challenge Experimental Forest, California, were removed in October 1963. Logging costs and production rates were compared with those for a seed-tree cutting on an area nearby. Production rates for seed-tree removal greatly exceeded those for the operation as a whole. Skidding production increased by 38...

Influence of weather and climate variables on the basal area growth of individual shortleaf pine trees

Science.gov (United States)

Pradip Saud; Thomas B. Lynch; Duncan S. Wilson; John Stewart; James M. Guldin; Bob Heinemann; Randy Holeman; Dennis Wilson; Keith Anderson

2015-01-01

An individual-tree basal area growth model previously developed for even-aged naturally occurring shortleaf pine trees (Pinus echinata Mill.) in western Arkansas and southeastern Oklahoma did not include weather variables. Individual-tree growth and yield modeling of shortleaf pine has been carried out using the remeasurements of over 200 plots...

Big trees, old trees, and growth factor tables

Science.gov (United States)

Kevin T. Smith

2018-01-01

The potential for a tree to reach a great size and to live a long life frequently captures the public's imagination. Sometimes the desire to know the age of an impressively large tree is simple curiosity. For others, the date-of-tree establishment can make a big diff erence for management, particularly for trees at historic sites or those mentioned in property...

A Suffix Tree Or Not a Suffix Tree?

DEFF Research Database (Denmark)

Starikovskaya, Tatiana; Vildhøj, Hjalte Wedel

2015-01-01

In this paper we study the structure of suffix trees. Given an unlabeled tree r on n nodes and suffix links of its internal nodes, we ask the question “Is r a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure as r? We place no restrictions on S, in part...

Effect of logging wounds on diameter growth of sawlog-size Appalachian hardwood crop trees

Science.gov (United States)

Neil I. Lamson; H. Clay Smith; H. Clay Smith

1988-01-01

In previously thinned, even-aged Appalachian hardwood stands, 5-year diameter growth of 102 wounded and 102 unwounded codominant crop trees were compared. A wounded crop tre was defined as one with at least one exposed sapwood logging wound at least 100 inch2 in size. An unwounded crop tree of the same species and size was selected near each of the 102 wounded trees....

Parallelization of one image compression method. Wavelet, Transform, Vector Quantization and Huffman Coding

International Nuclear Information System (INIS)

Moravie, Philippe

1997-01-01

Today, in the digitized satellite image domain, the needs for high dimension increase considerably. To transmit or to stock such images (more than 6000 by 6000 pixels), we need to reduce their data volume and so we have to use real-time image compression techniques. The large amount of computations required by image compression algorithms prohibits the use of common sequential processors, for the benefits of parallel computers. The study presented here deals with parallelization of a very efficient image compression scheme, based on three techniques: Wavelets Transform (WT), Vector Quantization (VQ) and Entropic Coding (EC). First, we studied and implemented the parallelism of each algorithm, in order to determine the architectural characteristics needed for real-time image compression. Then, we defined eight parallel architectures: 3 for Mallat algorithm (WT), 3 for Tree-Structured Vector Quantization (VQ) and 2 for Huffman Coding (EC). As our system has to be multi-purpose, we chose 3 global architectures between all of the 3x3x2 systems available. Because, for technological reasons, real-time is not reached at anytime (for all the compression parameter combinations), we also defined and evaluated two algorithmic optimizations: fix point precision and merging entropic coding in vector quantization. As a result, we defined a new multi-purpose multi-SMIMD parallel machine, able to compress digitized satellite image in real-time. The definition of the best suited architecture for real-time image compression was answered by presenting 3 parallel machines among which one multi-purpose, embedded and which might be used for other applications on board. (author) [fr

A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

Science.gov (United States)

Venter, Gerhard; Sobieszczanski-Sobieski, Jaroslaw

2005-01-01

A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.

Minimizing the cost of translocation failure with decision-tree models that predict species' behavioral response in translocation sites.

Science.gov (United States)

Ebrahimi, Mehregan; Ebrahimie, Esmaeil; Bull, C Michael

2015-08-01

The high number of failures is one reason why translocation is often not recommended. Considering how behavior changes during translocations may improve translocation success. To derive decision-tree models for species' translocation, we used data on the short-term responses of an endangered Australian skink in 5 simulated translocations with different release conditions. We used 4 different decision-tree algorithms (decision tree, decision-tree parallel, decision stump, and random forest) with 4 different criteria (gain ratio, information gain, gini index, and accuracy) to investigate how environmental and behavioral parameters may affect the success of a translocation. We assumed behavioral changes that increased dispersal away from a release site would reduce translocation success. The trees became more complex when we included all behavioral parameters as attributes, but these trees yielded more detailed information about why and how dispersal occurred. According to these complex trees, there were positive associations between some behavioral parameters, such as fight and dispersal, that showed there was a higher chance, for example, of dispersal among lizards that fought than among those that did not fight. Decision trees based on parameters related to release conditions were easier to understand and could be used by managers to make translocation decisions under different circumstances. © 2015 Society for Conservation Biology.

AZTEC: A parallel iterative package for the solving linear systems

Energy Technology Data Exchange (ETDEWEB)

Hutchinson, S.A.; Shadid, J.N.; Tuminaro, R.S. [Sandia National Labs., Albuquerque, NM (United States)

1996-12-31

We describe a parallel linear system package, AZTEC. The package incorporates a number of parallel iterative methods (e.g. GMRES, biCGSTAB, CGS, TFQMR) and preconditioners (e.g. Jacobi, Gauss-Seidel, polynomial, domain decomposition with LU or ILU within subdomains). Additionally, AZTEC allows for the reuse of previous preconditioning factorizations within Newton schemes for nonlinear methods. Currently, a number of different users are using this package to solve a variety of PDE applications.

Parallel generation of architecture on the GPU

KAUST Repository

Steinberger, Markus

2014-05-01

In this paper, we present a novel approach for the parallel evaluation of procedural shape grammars on the graphics processing unit (GPU). Unlike previous approaches that are either limited in the kind of shapes they allow, the amount of parallelism they can take advantage of, or both, our method supports state of the art procedural modeling including stochasticity and context-sensitivity. To increase parallelism, we explicitly express independence in the grammar, reduce inter-rule dependencies required for context-sensitive evaluation, and introduce intra-rule parallelism. Our rule scheduling scheme avoids unnecessary back and forth between CPU and GPU and reduces round trips to slow global memory by dynamically grouping rules in on-chip shared memory. Our GPU shape grammar implementation is multiple orders of magnitude faster than the standard in CPU-based rule evaluation, while offering equal expressive power. In comparison to the state of the art in GPU shape grammar derivation, our approach is nearly 50 times faster, while adding support for geometric context-sensitivity. © 2014 The Author(s) Computer Graphics Forum © 2014 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd.

The domain packing and temperature dependence of the spontaneous shear angle in ferroelastic compound KD3(SeO3)2

International Nuclear Information System (INIS)

Balagurov, A.M.; Beskrovnyj, A.I.; Savenko, B.N.; Shuvalov, L.A.

1984-01-01

The domain structure in ferroelastic phase of KD 3 (SeO 3 ) 2 (DKTS) conpound was investigated by neutron time-of-flight diffractometry. The temperature dependence of spontaneous shear angle was determined from diffraction intensity measurements for a lot of spots in reciprocal lattice. The domain structure was found similar with that of KH 2 PO 4

Tree-growth analyses to estimate tree species' drought tolerance

NARCIS (Netherlands)

Eilmann, B.; Rigling, A.

2012-01-01

Climate change is challenging forestry management and practices. Among other things, tree species with the ability to cope with more extreme climate conditions have to be identified. However, while environmental factors may severely limit tree growth or even cause tree death, assessing a tree

Highly efficient parallel direct solver for solving dense complex matrix equations from method of moments

Directory of Open Access Journals (Sweden)

Yan Chen

2017-03-01

Full Text Available Based on the vectorised and cache optimised kernel, a parallel lower upper decomposition with a novel communication avoiding pivoting scheme is developed to solve dense complex matrix equations generated by the method of moments. The fine-grain data rearrangement and assembler instructions are adopted to reduce memory accessing times and improve CPU cache utilisation, which also facilitate vectorisation of the code. Through grouping processes in a binary tree, a parallel pivoting scheme is designed to optimise the communication pattern and thus reduces the solving time of the proposed solver. Two large electromagnetic radiation problems are solved on two supercomputers, respectively, and the numerical results demonstrate that the proposed method outperforms those in open source and commercial libraries.

TreeNetViz: revealing patterns of networks over tree structures.

Science.gov (United States)

Gou, Liang; Zhang, Xiaolong Luke

2011-12-01

Network data often contain important attributes from various dimensions such as social affiliations and areas of expertise in a social network. If such attributes exhibit a tree structure, visualizing a compound graph consisting of tree and network structures becomes complicated. How to visually reveal patterns of a network over a tree has not been fully studied. In this paper, we propose a compound graph model, TreeNet, to support visualization and analysis of a network at multiple levels of aggregation over a tree. We also present a visualization design, TreeNetViz, to offer the multiscale and cross-scale exploration and interaction of a TreeNet graph. TreeNetViz uses a Radial, Space-Filling (RSF) visualization to represent the tree structure, a circle layout with novel optimization to show aggregated networks derived from TreeNet, and an edge bundling technique to reduce visual complexity. Our circular layout algorithm reduces both total edge-crossings and edge length and also considers hierarchical structure constraints and edge weight in a TreeNet graph. These experiments illustrate that the algorithm can reduce visual cluttering in TreeNet graphs. Our case study also shows that TreeNetViz has the potential to support the analysis of a compound graph by revealing multiscale and cross-scale network patterns. © 2011 IEEE

Tree rings and radiocarbon calibration

International Nuclear Information System (INIS)

Barbetti, M.

1999-01-01

Only a few kinds of trees in Australia and Southeast Asia are known to have growth rings that are both distinct and annual. Those that do are therefore extremely important to climatic and isotope studies. In western Tasmania, extensive work with Huon pine (Lagarostrobos franklinii) has shown that many living trees are more than 1,000 years old, and that their ring widths are sensitive to temperature, rainfall and cloud cover (Buckley et al. 1997). At the Stanley River there is a forest of living (and recently felled) trees which we have sampled and measured. There are also thousands of subfossil Huon pine logs, buried at depths less than 5 metres in an area of floodplain extending over a distance of more than a kilometre with a width of tens of metres. Some of these logs have been buried for 50,000 years or more, but most of them belong to the period between 15,000 years and the present. In previous expeditions in the 1980s and 1990s, we excavated and sampled about 350 logs (Barbetti et al. 1995; Nanson et al. 1995). By measuring the ring-width patterns, and matching them between logs and living trees, we have constructed a tree-ring dated chronology from 571 BC to AD 1992. We have also built a 4254-ring floating chronology (placed by radiocarbon at ca. 3580 to 7830 years ago), and an earlier 1268-ring chronology (ca. 7,580 to 8,850 years ago). There are many individuals, or pairs of logs which match and together span several centuries, at 9,000 years ago and beyond

A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations

International Nuclear Information System (INIS)

Lin Lin; Chao Yang; Jiangfeng Lu; Lexing Ying; Weinan, E.

2009-01-01

We present an efficient parallel algorithm and its implementation for computing the diagonal of H -1 where H is a 2D Kohn-Sham Hamiltonian discretized on a rectangular domain using a standard second order finite difference scheme. This type of calculation can be used to obtain an accurate approximation to the diagonal of a Fermi-Dirac function of H through a recently developed pole-expansion technique LinLuYingE2009. The diagonal elements are needed in electronic structure calculations for quantum mechanical systems HohenbergKohn1964, KohnSham 1965,DreizlerGross1990. We show how elimination tree is used to organize the parallel computation and how synchronization overhead is reduced by passing data level by level along this tree using the technique of local buffers and relative indices. We analyze the performance of our implementation by examining its load balance and communication overhead. We show that our implementation exhibits an excellent weak scaling on a large-scale high performance distributed parallel machine. When compared with standard approach for evaluating the diagonal a Fermi-Dirac function of a Kohn-Sham Hamiltonian associated a 2D electron quantum dot, the new pole-expansion technique that uses our algorithm to compute the diagonal of (H-z i I) -1 for a small number of poles z i is much faster, especially when the quantum dot contains many electrons.

A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations

Energy Technology Data Exchange (ETDEWEB)

Lin, Lin; Yang, Chao; Lu, Jiangfeng; Ying, Lexing; E, Weinan

2009-09-25

We present an efficient parallel algorithm and its implementation for computing the diagonal of $H^-1$ where $H$ is a 2D Kohn-Sham Hamiltonian discretized on a rectangular domain using a standard second order finite difference scheme. This type of calculation can be used to obtain an accurate approximation to the diagonal of a Fermi-Dirac function of $H$ through a recently developed pole-expansion technique \\cite{LinLuYingE2009}. The diagonal elements are needed in electronic structure calculations for quantum mechanical systems \\citeHohenbergKohn1964, KohnSham 1965,DreizlerGross1990. We show how elimination tree is used to organize the parallel computation and how synchronization overhead is reduced by passing data level by level along this tree using the technique of local buffers and relative indices. We analyze the performance of our implementation by examining its load balance and communication overhead. We show that our implementation exhibits an excellent weak scaling on a large-scale high performance distributed parallel machine. When compared with standard approach for evaluating the diagonal a Fermi-Dirac function of a Kohn-Sham Hamiltonian associated a 2D electron quantum dot, the new pole-expansion technique that uses our algorithm to compute the diagonal of $(H-z_i I)^-1$ for a small number of poles $z_i$ is much faster, especially when the quantum dot contains many electrons.

Multispecies Coevolution Particle Swarm Optimization Based on Previous Search History

Directory of Open Access Journals (Sweden)

Danping Wang

2017-01-01

Full Text Available A hybrid coevolution particle swarm optimization algorithm with dynamic multispecies strategy based on K-means clustering and nonrevisit strategy based on Binary Space Partitioning fitness tree (called MCPSO-PSH is proposed. Previous search history memorized into the Binary Space Partitioning fitness tree can effectively restrain the individuals’ revisit phenomenon. The whole population is partitioned into several subspecies and cooperative coevolution is realized by an information communication mechanism between subspecies, which can enhance the global search ability of particles and avoid premature convergence to local optimum. To demonstrate the power of the method, comparisons between the proposed algorithm and state-of-the-art algorithms are grouped into two categories: 10 basic benchmark functions (10-dimensional and 30-dimensional, 10 CEC2005 benchmark functions (30-dimensional, and a real-world problem (multilevel image segmentation problems. Experimental results show that MCPSO-PSH displays a competitive performance compared to the other swarm-based or evolutionary algorithms in terms of solution accuracy and statistical tests.

TREE SELECTING AND TREE RING MEASURING IN DENDROCHRONOLOGICAL INVESTIGATIONS

Directory of Open Access Journals (Sweden)

Sefa Akbulut

2004-04-01

Full Text Available Dendrochronology is a method of dating which makes use of the annual nature of tree growth. Dendrochronology may be divided into a number of subfields, each of which covers one or more aspects of the use of tree ring data: dendroclimatology, dendrogeomorphology, dendrohydrology, dendroecology, dendroarchaelogy, and dendrogylaciology. Basic of all form the analysis of the tree rings. The wood or tree rings can aid to dating past events about climatology, ecology, geology, hydrology. Dendrochronological studies are conducted either on increment cores or on discs. It may be seen abnormalities on tree rings during the measurement like that false rings, missing rings, reaction wood. Like that situation, increment cores must be extracted from four different sides of each tree and be studied as more as on tree.

Long term radiocesium contamination of fruit trees following the Chernobyl accident.

Science.gov (United States)

Antonopoulos-Domis, M; Clouvas, A; Gagianas, A

1996-12-01

Radiocesium contamination from the Chernobyl accident of fruits and leaves from various fruit trees was systematically studied from 1990 to 1995 on two agricultural experimentation farms in Northern Greece. The results are discussed in the framework of a previously published model describing the long-term radiocesium contamination mechanism of deciduous fruit trees after a nuclear accident. The results of the present work qualitatively verify the model predictions.

Visualizing Individual Tree Differences in Tree-Ring Studies

Directory of Open Access Journals (Sweden)

Mario Trouillier

2018-04-01

Full Text Available Averaging tree-ring measurements from multiple individuals is one of the most common procedures in dendrochronology. It serves to filter out noise from individual differences between trees, such as competition, height, and micro-site effects, which ideally results in a site chronology sensitive to regional scale factors such as climate. However, the climate sensitivity of individual trees can be modulated by factors like competition, height, and nitrogen deposition, calling attention to whether average chronologies adequately assess climatic growth-control. In this study, we demonstrate four simple but effective methods to visually assess differences between individual trees. Using individual tree climate-correlations we: (1 employed jitter plots with superimposed metadata to assess potential causes for these differences; (2 plotted the frequency distributions of climate correlations over time as heat maps; (3 mapped the spatial distribution of climate sensitivity over time to assess spatio-temporal dynamics; and (4 used t-distributed Stochastic Neighborhood Embedding (t-SNE to assess which trees were generally more similar in terms of their tree-ring pattern and their correlation with climate variables. This suite of exploratory methods can indicate if individuals in tree-ring datasets respond differently to climate variability, and therefore, should not solely be explored with climate correlations of the mean population chronology.

Fault tree handbook

International Nuclear Information System (INIS)

Haasl, D.F.; Roberts, N.H.; Vesely, W.E.; Goldberg, F.F.

1981-01-01

This handbook describes a methodology for reliability analysis of complex systems such as those which comprise the engineered safety features of nuclear power generating stations. After an initial overview of the available system analysis approaches, the handbook focuses on a description of the deductive method known as fault tree analysis. The following aspects of fault tree analysis are covered: basic concepts for fault tree analysis; basic elements of a fault tree; fault tree construction; probability, statistics, and Boolean algebra for the fault tree analyst; qualitative and quantitative fault tree evaluation techniques; and computer codes for fault tree evaluation. Also discussed are several example problems illustrating the basic concepts of fault tree construction and evaluation

Analysis of large fault trees based on functional decomposition

International Nuclear Information System (INIS)

Contini, Sergio; Matuzas, Vaidas

2011-01-01

With the advent of the Binary Decision Diagrams (BDD) approach in fault tree analysis, a significant enhancement has been achieved with respect to previous approaches, both in terms of efficiency and accuracy of the overall outcome of the analysis. However, the exponential increase of the number of nodes with the complexity of the fault tree may prevent the construction of the BDD. In these cases, the only way to complete the analysis is to reduce the complexity of the BDD by applying the truncation technique, which nevertheless implies the problem of estimating the truncation error or upper and lower bounds of the top-event unavailability. This paper describes a new method to analyze large coherent fault trees which can be advantageously applied when the working memory is not sufficient to construct the BDD. It is based on the decomposition of the fault tree into simpler disjoint fault trees containing a lower number of variables. The analysis of each simple fault tree is performed by using all the computational resources. The results from the analysis of all simpler fault trees are re-combined to obtain the results for the original fault tree. Two decomposition methods are herewith described: the first aims at determining the minimal cut sets (MCS) and the upper and lower bounds of the top-event unavailability; the second can be applied to determine the exact value of the top-event unavailability. Potentialities, limitations and possible variations of these methods will be discussed with reference to the results of their application to some complex fault trees.

Analysis of large fault trees based on functional decomposition

Energy Technology Data Exchange (ETDEWEB)

Contini, Sergio, E-mail: sergio.contini@jrc.i [European Commission, Joint Research Centre, Institute for the Protection and Security of the Citizen, 21020 Ispra (Italy); Matuzas, Vaidas [European Commission, Joint Research Centre, Institute for the Protection and Security of the Citizen, 21020 Ispra (Italy)

2011-03-15

With the advent of the Binary Decision Diagrams (BDD) approach in fault tree analysis, a significant enhancement has been achieved with respect to previous approaches, both in terms of efficiency and accuracy of the overall outcome of the analysis. However, the exponential increase of the number of nodes with the complexity of the fault tree may prevent the construction of the BDD. In these cases, the only way to complete the analysis is to reduce the complexity of the BDD by applying the truncation technique, which nevertheless implies the problem of estimating the truncation error or upper and lower bounds of the top-event unavailability. This paper describes a new method to analyze large coherent fault trees which can be advantageously applied when the working memory is not sufficient to construct the BDD. It is based on the decomposition of the fault tree into simpler disjoint fault trees containing a lower number of variables. The analysis of each simple fault tree is performed by using all the computational resources. The results from the analysis of all simpler fault trees are re-combined to obtain the results for the original fault tree. Two decomposition methods are herewith described: the first aims at determining the minimal cut sets (MCS) and the upper and lower bounds of the top-event unavailability; the second can be applied to determine the exact value of the top-event unavailability. Potentialities, limitations and possible variations of these methods will be discussed with reference to the results of their application to some complex fault trees.

Soil cover by natural trees in agroforestry systems

Science.gov (United States)

Diaz-Ambrona, C. G. H.; Almoguera Millán, C.; Tarquis Alfonso, A.

2009-04-01

The dehesa is common agroforestry system in the Iberian Peninsula. These open oak parklands with silvo-pastoral use cover about two million hectares. Traditionally annual pastures have been grazed by cows, sheep and also goats while acorns feed Iberian pig diet. Evergreen oak (Quercus ilex L.) has other uses as fuelwood collection and folder after tree pruning. The hypothesis of this work is that tree density and canopy depend on soil types. We using the spanish GIS called SIGPAC to download the images of dehesa in areas with different soil types. True colour images were restoring to a binary code, previously canopy colour range was selected. Soil cover by tree canopy was calculated and number of trees. Processing result was comparable to real data. With these data we have applied a dynamic simulation model Dehesa to determine evergreen oak acorn and annual pasture production. The model Dehesa is divided into five submodels: Climate, Soil, Evergreen oak, Pasture and Grazing. The first three require the inputs: (i) daily weather data (maximum and minimum temperatures, precipitation and solar radiation); (ii) the soil input parameters for three horizons (thickness, field capacity, permanent wilting point, and bulk density); and (iii) the tree characterization of the dehesa (tree density, canopy diameter and height, and diameter of the trunk). The influence of tree on pasture potential production is inversely proportional to the canopy cover. Acorn production increase with tree canopy cover until stabilizing itself, and will decrease if density becomes too high (more than 80% soil tree cover) at that point there is competition between the trees. Main driving force for dehesa productivity is soil type for pasture, and tree cover for acorn production. Highest pasture productivity was obtained on soil Dystric Planosol (Alfisol), Dystric Cambisol and Chromo-calcic-luvisol, these soils only cover 22.4% of southwest of the Iberian peninssula. Lowest productivity was

Beam dynamics simulations using a parallel version of PARMILA

International Nuclear Information System (INIS)

Ryne, R.D.

1996-01-01

The computer code PARMILA has been the primary tool for the design of proton and ion linacs in the United States for nearly three decades. Previously it was sufficient to perform simulations with of order 10000 particles, but recently the need to perform high resolution halo studies for next-generation, high intensity linacs has made it necessary to perform simulations with of order 100 million particles. With the advent of massively parallel computers such simulations are now within reach. Parallel computers already make it possible, for example, to perform beam dynamics calculations with tens of millions of particles, requiring over 10 GByte of core memory, in just a few hours. Also, parallel computers are becoming easier to use thanks to the availability of mature, Fortran-like languages such as Connection Machine Fortran and High Performance Fortran. We will describe our experience developing a parallel version of PARMILA and the performance of the new code

Beam dynamics simulations using a parallel version of PARMILA

International Nuclear Information System (INIS)

Ryne, Robert

1996-01-01

The computer code PARMILA has been the primary tool for the design of proton and ion linacs in the United States for nearly three decades. Previously it was sufficient to perform simulations with of order 10000 particles, but recently the need to perform high resolution halo studies for next-generation, high intensity linacs has made it necessary to perform simulations with of order 100 million particles. With the advent of massively parallel computers such simulations are now within reach. Parallel computers already make it possible, for example, to perform beam dynamics calculations with tens of millions of particles, requiring over 10 GByte of core memory, in just a few hours. Also, parallel computers are becoming easier to use thanks to the availability of mature, Fortran-like languages such as Connection Machine Fortran and High Performance Fortran. We will describe our experience developing a parallel version of PARMILA and the performance of the new code. (author)

IMPACT OF Global Warming on Trees

Energy Technology Data Exchange (ETDEWEB)

Nasrullah Khan [COMSATS Institute of Information Technology, Islamabad (Pakistan); Naeem Abas [2Department of Electrical Engineering, University of Gujrat, Gujrat (Pakistan); Norman Mariun [University Putra Malaysia, Faculty of Engineering, UPM Serdang, Serdang (Malaysia)

2008-09-30

Trees store CO{sub 2}, drive food chain, produce oxygen and cause cooling effects through the transpiration process. However, increasing forests to cool the planet needs a lot of care regarding locations and types of trees. Initially it was thought that the city trees fight climate change but later it was found that only tropical trees do the best. Ozone absorption in soil affects its natural carbon sequestration capability. Interaction of plants and soil with changing atmosphere and climate is very complex and not yet understood. Some crops like cotton, wheat and rice are more productive in elevated CO{sub 2} but their response at high temperatures needs further studies (GWDTR, 1997-2007; ITGW, 1990-2008). Use of CO{sub 2} as input raw material in fuel cells might be a revolutionary innovation but there is a long way to go ahead. At this moment we can only start energy education to cope up the time to come. On average CO{sub 2} concentration has been increasing at rate of 2.25ppm/yr from 2004 to 2008 but later from 2007 to 2008 it has been found increasing exponentially at rate of 4ppm/yr. It continues to increase at this rate even after oil peaking then it might exceed 500ppm by 2040-2050. CO{sub 2} concentration in atmosphere was 280 ppm before industrial revolution and in last few centuries it has increased to 385 ppm at an average annual rate of 2 ppm. Weeds normally show poor response to high CO{sub 2} concentrations but crops, fruits and vegetables flourish well. Previous draught cycle was only three years long but recent draught cycle is much longer than earlier (IGWT, 1997-2008). However, few trees in the same constellation are still quite healthy and alive. Some trees were seen dead even close to water canals. Based on literature review and observations recorded in this study it is concluded that high CO{sub 2} induced heat wave (global warming) is responsible for helping beetles and wood ants to eat trees roots and stem to kill them by starvation. The

New substitution models for rooting phylogenetic trees.

Science.gov (United States)

Williams, Tom A; Heaps, Sarah E; Cherlin, Svetlana; Nye, Tom M W; Boys, Richard J; Embley, T Martin

2015-09-26

The root of a phylogenetic tree is fundamental to its biological interpretation, but standard substitution models do not provide any information on its position. Here, we describe two recently developed models that relax the usual assumptions of stationarity and reversibility, thereby facilitating root inference without the need for an outgroup. We compare the performance of these models on a classic test case for phylogenetic methods, before considering two highly topical questions in evolutionary biology: the deep structure of the tree of life and the root of the archaeal radiation. We show that all three alignments contain meaningful rooting information that can be harnessed by these new models, thus complementing and extending previous work based on outgroup rooting. In particular, our analyses exclude the root of the tree of life from the eukaryotes or Archaea, placing it on the bacterial stem or within the Bacteria. They also exclude the root of the archaeal radiation from several major clades, consistent with analyses using other rooting methods. Overall, our results demonstrate the utility of non-reversible and non-stationary models for rooting phylogenetic trees, and identify areas where further progress can be made. © 2015 The Authors.

Higher-spin and W∞(J) algebras in Virasoro-constrained KP and N-KdV hierarchies

International Nuclear Information System (INIS)

Semikhatov, A.M.

1991-02-01

Virasoro constraints on the KP hierarchy, arising in matrix models, are studied by reexpressing them in terms of dressing operators of the hierarchy. There exists a one-parameter family of Virasoro representations on the KP hierarchy (depending on a number J which can be identified as the conformal weight of an abstract bc system). The respective full invariance algebra is the ''Borel'' subalgebra of W ∞ (J), which we describe as an extension of the ''wedge'', or higher spin, algebra B λ=J-J 2 by the L 2 Virasoro generator. Reductions of these structures to the N-KdV hierarchies are performed explicitly. (author). 26 refs

Practical parallel computing

CERN Document Server

Morse, H Stephen

1994-01-01

Practical Parallel Computing provides information pertinent to the fundamental aspects of high-performance parallel processing. This book discusses the development of parallel applications on a variety of equipment.Organized into three parts encompassing 12 chapters, this book begins with an overview of the technology trends that converge to favor massively parallel hardware over traditional mainframes and vector machines. This text then gives a tutorial introduction to parallel hardware architectures. Other chapters provide worked-out examples of programs using several parallel languages. Thi

Silencing, positive selection and parallel evolution: busy history of primate cytochromes C.

Science.gov (United States)

Pierron, Denis; Opazo, Juan C; Heiske, Margit; Papper, Zack; Uddin, Monica; Chand, Gopi; Wildman, Derek E; Romero, Roberto; Goodman, Morris; Grossman, Lawrence I

2011-01-01

Cytochrome c (cyt c) participates in two crucial cellular processes, energy production and apoptosis, and unsurprisingly is a highly conserved protein. However, previous studies have reported for the primate lineage (i) loss of the paralogous testis isoform, (ii) an acceleration and then a deceleration of the amino acid replacement rate of the cyt c somatic isoform, and (iii) atypical biochemical behavior of human cyt c. To gain insight into the cause of these major evolutionary events, we have retraced the history of cyt c loci among primates. For testis cyt c, all primate sequences examined carry the same nonsense mutation, which suggests that silencing occurred before the primates diversified. For somatic cyt c, maximum parsimony, maximum likelihood, and Bayesian phylogenetic analyses yielded the same tree topology. The evolutionary analyses show that a fast accumulation of non-synonymous mutations (suggesting positive selection) occurred specifically on the anthropoid lineage root and then continued in parallel on the early catarrhini and platyrrhini stems. Analysis of evolutionary changes using the 3D structure suggests they are focused on the respiratory chain rather than on apoptosis or other cyt c functions. In agreement with previous biochemical studies, our results suggest that silencing of the cyt c testis isoform could be linked with the decrease of primate reproduction rate. Finally, the evolution of cyt c in the two sister anthropoid groups leads us to propose that somatic cyt c evolution may be related both to COX evolution and to the convergent brain and body mass enlargement in these two anthropoid clades.

Silencing, positive selection and parallel evolution: busy history of primate cytochromes C.

Directory of Open Access Journals (Sweden)

Denis Pierron

Full Text Available Cytochrome c (cyt c participates in two crucial cellular processes, energy production and apoptosis, and unsurprisingly is a highly conserved protein. However, previous studies have reported for the primate lineage (i loss of the paralogous testis isoform, (ii an acceleration and then a deceleration of the amino acid replacement rate of the cyt c somatic isoform, and (iii atypical biochemical behavior of human cyt c. To gain insight into the cause of these major evolutionary events, we have retraced the history of cyt c loci among primates. For testis cyt c, all primate sequences examined carry the same nonsense mutation, which suggests that silencing occurred before the primates diversified. For somatic cyt c, maximum parsimony, maximum likelihood, and Bayesian phylogenetic analyses yielded the same tree topology. The evolutionary analyses show that a fast accumulation of non-synonymous mutations (suggesting positive selection occurred specifically on the anthropoid lineage root and then continued in parallel on the early catarrhini and platyrrhini stems. Analysis of evolutionary changes using the 3D structure suggests they are focused on the respiratory chain rather than on apoptosis or other cyt c functions. In agreement with previous biochemical studies, our results suggest that silencing of the cyt c testis isoform could be linked with the decrease of primate reproduction rate. Finally, the evolution of cyt c in the two sister anthropoid groups leads us to propose that somatic cyt c evolution may be related both to COX evolution and to the convergent brain and body mass enlargement in these two anthropoid clades.

Parallel rendering

Science.gov (United States)

Crockett, Thomas W.

1995-01-01

This article provides a broad introduction to the subject of parallel rendering, encompassing both hardware and software systems. The focus is on the underlying concepts and the issues which arise in the design of parallel rendering algorithms and systems. We examine the different types of parallelism and how they can be applied in rendering applications. Concepts from parallel computing, such as data decomposition, task granularity, scalability, and load balancing, are considered in relation to the rendering problem. We also explore concepts from computer graphics, such as coherence and projection, which have a significant impact on the structure of parallel rendering algorithms. Our survey covers a number of practical considerations as well, including the choice of architectural platform, communication and memory requirements, and the problem of image assembly and display. We illustrate the discussion with numerous examples from the parallel rendering literature, representing most of the principal rendering methods currently used in computer graphics.

Genome-wide comparative analysis of phylogenetic trees: the prokaryotic forest of life.

Science.gov (United States)

Puigbò, Pere; Wolf, Yuri I; Koonin, Eugene V

2012-01-01

Genome-wide comparison of phylogenetic trees is becoming an increasingly common approach in evolutionary genomics, and a variety of approaches for such comparison have been developed. In this article, we present several methods for comparative analysis of large numbers of phylogenetic trees. To compare phylogenetic trees taking into account the bootstrap support for each internal branch, the Boot-Split Distance (BSD) method is introduced as an extension of the previously developed Split Distance method for tree comparison. The BSD method implements the straightforward idea that comparison of phylogenetic trees can be made more robust by treating tree splits differentially depending on the bootstrap support. Approaches are also introduced for detecting tree-like and net-like evolutionary trends in the phylogenetic Forest of Life (FOL), i.e., the entirety of the phylogenetic trees for conserved genes of prokaryotes. The principal method employed for this purpose includes mapping quartets of species onto trees to calculate the support of each quartet topology and so to quantify the tree and net contributions to the distances between species. We describe the application of these methods to analyze the FOL and the results obtained with these methods. These results support the concept of the Tree of Life (TOL) as a central evolutionary trend in the FOL as opposed to the traditional view of the TOL as a "species tree."

Efficient Parallel Kernel Solvers for Computational Fluid Dynamics Applications

Science.gov (United States)

Sun, Xian-He

1997-01-01

Distributed-memory parallel computers dominate today's parallel computing arena. These machines, such as Intel Paragon, IBM SP2, and Cray Origin2OO, have successfully delivered high performance computing power for solving some of the so-called "grand-challenge" problems. Despite initial success, parallel machines have not been widely accepted in production engineering environments due to the complexity of parallel programming. On a parallel computing system, a task has to be partitioned and distributed appropriately among processors to reduce communication cost and to attain load balance. More importantly, even with careful partitioning and mapping, the performance of an algorithm may still be unsatisfactory, since conventional sequential algorithms may be serial in nature and may not be implemented efficiently on parallel machines. In many cases, new algorithms have to be introduced to increase parallel performance. In order to achieve optimal performance, in addition to partitioning and mapping, a careful performance study should be conducted for a given application to find a good algorithm-machine combination. This process, however, is usually painful and elusive. The goal of this project is to design and develop efficient parallel algorithms for highly accurate Computational Fluid Dynamics (CFD) simulations and other engineering applications. The work plan is 1) developing highly accurate parallel numerical algorithms, 2) conduct preliminary testing to verify the effectiveness and potential of these algorithms, 3) incorporate newly developed algorithms into actual simulation packages. The work plan has well achieved. Two highly accurate, efficient Poisson solvers have been developed and tested based on two different approaches: (1) Adopting a mathematical geometry which has a better capacity to describe the fluid, (2) Using compact scheme to gain high order accuracy in numerical discretization. The previously developed Parallel Diagonal Dominant (PDD) algorithm

Geometry of convex polygons and locally minimal binary trees spanning these polygons

International Nuclear Information System (INIS)

Ivanov, A O; Tuzhilin, A A

1999-01-01

In previous works the authors have obtained an effective classification of planar locally minimal binary trees with convex boundaries. The main aim of the present paper is to find more subtle restrictions on the possible structure of such trees in terms of the geometry of the given boundary set. Special attention is given to the case of quasiregular boundaries (that is, boundaries that are sufficiently close to regular ones in a certain sense). In particular, a series of quasiregular boundaries that cannot be spanned by a locally minimal binary tree is constructed

Species-level para- and polyphyly in DNA barcode gene trees

DEFF Research Database (Denmark)

Mutanen, Marko; Kivelä, Sami M.; Vos, Rutger A.

2016-01-01

was paid to accurate species identification to ensure data integrity. We investigated the effects of tree-building method, sampling effort, and other methodological issues, all of which can influence estimates of non-monophyly. We found a 12% incidence of non-monophyly, a value significantly lower than...... between species and gene genealogies, as indicated by situations where conspecific individuals do not form a monophyletic cluster in a gene tree. In two previous reviews, non-monophyly has been reported as being common in mitochondrial DNA gene trees. We developed a novel web service "Monophylizer......" to detect non-monophyly in phylogenetic trees and used it to ascertain the incidence of species non-monophyly in COI (a.k.a. cox1) barcode sequence data from 4977 species and 41,583 specimens of European Lepidoptera, the largest data set of DNA barcodes analyzed from this regard. Particular attention...

[Prediction of the total Japanese cedar pollen counts based on male flower-setting conditions of standard trees].

Science.gov (United States)

Yuta, Atsushi; Ukai, Kotaro; Sakakura, Yasuo; Tani, Hideshi; Matsuda, Fukiko; Yang, Tian-qun; Majima, Yuichi

2002-07-01

We made a prediction of the Japanese cedar (Cryptomeria japonica) pollen counts at Tsu city based on male flower-setting conditions of standard trees. The 69 standard trees from 23 kinds of clones, planted at Mie Prefecture Science and Technology Promotion Center (Hakusan, Mie) in 1964, were selected. Male flower-setting conditions for 276 faces (69 trees x 4 points of the compass) were scored from 0 to 3. The average of scores and total pollen counts from 1988 to 2000 was analyzed. As the results, the average scores from standard trees and total pollen counts except two mass pollen-scattered years in 1995 and 2000 had a positive correlation (r = 0.914) by linear function. On the mass pollen-scattered years, pollen counts were influenced from the previous year. Therefore, the score of the present year minus that of the previous year were used for analysis. The average scores from male flower-setting conditions and pollen counts had a strong positive correlation (r = 0.994) when positive scores by taking account of the previous year were analyzed. We conclude that prediction of pollen counts are possible based on the male flower-setting conditions of standard trees.

Parallel and Multivalued Logic by the Two-Dimensional Photon-Echo Response of a Rhodamine–DNA Complex

Science.gov (United States)

2015-01-01

Implementing parallel and multivalued logic operations at the molecular scale has the potential to improve the miniaturization and efficiency of a new generation of nanoscale computing devices. Two-dimensional photon-echo spectroscopy is capable of resolving dynamical pathways on electronic and vibrational molecular states. We experimentally demonstrate the implementation of molecular decision trees, logic operations where all possible values of inputs are processed in parallel and the outputs are read simultaneously, by probing the laser-induced dynamics of populations and coherences in a rhodamine dye mounted on a short DNA duplex. The inputs are provided by the bilinear interactions between the molecule and the laser pulses, and the output values are read from the two-dimensional molecular response at specific frequencies. Our results highlights how ultrafast dynamics between multiple molecular states induced by light–matter interactions can be used as an advantage for performing complex logic operations in parallel, operations that are faster than electrical switching. PMID:25984269

Modular tree automata

DEFF Research Database (Denmark)

Bahr, Patrick

2012-01-01

Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular...

Parallel computations

CERN Document Server

1982-01-01

Parallel Computations focuses on parallel computation, with emphasis on algorithms used in a variety of numerical and physical applications and for many different types of parallel computers. Topics covered range from vectorization of fast Fourier transforms (FFTs) and of the incomplete Cholesky conjugate gradient (ICCG) algorithm on the Cray-1 to calculation of table lookups and piecewise functions. Single tridiagonal linear systems and vectorized computation of reactive flow are also discussed.Comprised of 13 chapters, this volume begins by classifying parallel computers and describing techn

Rate of tree carbon accumulation increases continuously with tree size.

Science.gov (United States)

Stephenson, N L; Das, A J; Condit, R; Russo, S E; Baker, P J; Beckman, N G; Coomes, D A; Lines, E R; Morris, W K; Rüger, N; Alvarez, E; Blundo, C; Bunyavejchewin, S; Chuyong, G; Davies, S J; Duque, A; Ewango, C N; Flores, O; Franklin, J F; Grau, H R; Hao, Z; Harmon, M E; Hubbell, S P; Kenfack, D; Lin, Y; Makana, J-R; Malizia, A; Malizia, L R; Pabst, R J; Pongpattananurak, N; Su, S-H; Sun, I-F; Tan, S; Thomas, D; van Mantgem, P J; Wang, X; Wiser, S K; Zavala, M A

2014-03-06

Forests are major components of the global carbon cycle, providing substantial feedback to atmospheric greenhouse gas concentrations. Our ability to understand and predict changes in the forest carbon cycle--particularly net primary productivity and carbon storage--increasingly relies on models that represent biological processes across several scales of biological organization, from tree leaves to forest stands. Yet, despite advances in our understanding of productivity at the scales of leaves and stands, no consensus exists about the nature of productivity at the scale of the individual tree, in part because we lack a broad empirical assessment of whether rates of absolute tree mass growth (and thus carbon accumulation) decrease, remain constant, or increase as trees increase in size and age. Here we present a global analysis of 403 tropical and temperate tree species, showing that for most species mass growth rate increases continuously with tree size. Thus, large, old trees do not act simply as senescent carbon reservoirs but actively fix large amounts of carbon compared to smaller trees; at the extreme, a single big tree can add the same amount of carbon to the forest within a year as is contained in an entire mid-sized tree. The apparent paradoxes of individual tree growth increasing with tree size despite declining leaf-level and stand-level productivity can be explained, respectively, by increases in a tree's total leaf area that outpace declines in productivity per unit of leaf area and, among other factors, age-related reductions in population density. Our results resolve conflicting assumptions about the nature of tree growth, inform efforts to undertand and model forest carbon dynamics, and have additional implications for theories of resource allocation and plant senescence.

iTree-Hydro: Snow hydrology update for the urban forest hydrology model

Science.gov (United States)

Yang Yang; Theodore A. Endreny; David J. Nowak

2011-01-01

This article presents snow hydrology updates made to iTree-Hydro, previously called the Urban Forest Effects—Hydrology model. iTree-Hydro Version 1 was a warm climate model developed by the USDA Forest Service to provide a process-based planning tool with robust water quantity and quality predictions given data limitations common to most urban areas. Cold climate...

Modulation, plasticity and pathophysiology of the parallel fiber-Purkinje cell synapse

Directory of Open Access Journals (Sweden)

Eriola Hoxha

2016-11-01

Full Text Available The parallel fiber-Purkinje cell synapse represents the point of maximal signal divergence in the cerebellar cortex with an estimated number of about 60 billion synaptic contacts in the rat and 100,000 billions in humans. At the same time, the Purkinje cell dendritic tree is a site of remarkable convergence of more than 100,000 parallel fiber synapses. Parallel fibers activity generates fast postsynaptic currents via AMPA receptors, and slower signals, mediated by mGlu1 receptors, resulting in Purkinje cell depolarization accompanied by sharp calcium elevation within dendritic regions. Long-term depression and long-term potentiation have been widely described for the parallel fiber-Purkinje cell synapse and have been proposed as mechanisms for motor learning. The mechanisms of induction for LTP and LTD involve different signaling mechanisms within the presynaptic terminal and/or at the postsynaptic site, promoting enduring modification in the neurotransmitter release and change in responsiveness to the neurotransmitter. The parallel fiber-Purkinje cell synapse is finely modulated by several neurotransmitters, including serotonin, noradrenaline, and acetylcholine. The ability of these neuromodulators to gate LTP and LTD at the parallel fiber-Purkinje cell synapse could, at least in part, explain their effect on cerebellar-dependent learning and memory paradigms. Overall, these findings have important implications for understanding the cerebellar involvement in a series of pathological conditions, ranging from ataxia to autism. For example, parallel fiber-Purkinje cell synapse dysfunctions have been identified in several murine models of spinocerebellar ataxia (SCA types 1, 3, 5 and 27. In some cases, the defect is specific for the AMPA receptor signaling (SCA27, while in others the mGlu1 pathway is affected (SCA1, 3, 5. Interestingly, the parallel fiber-Purkinje cell synapse has been shown to be hyper-functional in a mutant mouse model of autism

Parallel sorting algorithms

CERN Document Server

Akl, Selim G

1985-01-01

Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the

Multilevel Parallelization of AutoDock 4.2

Directory of Open Access Journals (Sweden)

Norgan Andrew P

2011-04-01

Full Text Available Abstract Background Virtual (computational screening is an increasingly important tool for drug discovery. AutoDock is a popular open-source application for performing molecular docking, the prediction of ligand-receptor interactions. AutoDock is a serial application, though several previous efforts have parallelized various aspects of the program. In this paper, we report on a multi-level parallelization of AutoDock 4.2 (mpAD4. Results Using MPI and OpenMP, AutoDock 4.2 was parallelized for use on MPI-enabled systems and to multithread the execution of individual docking jobs. In addition, code was implemented to reduce input/output (I/O traffic by reusing grid maps at each node from docking to docking. Performance of mpAD4 was examined on two multiprocessor computers. Conclusions Using MPI with OpenMP multithreading, mpAD4 scales with near linearity on the multiprocessor systems tested. In situations where I/O is limiting, reuse of grid maps reduces both system I/O and overall screening time. Multithreading of AutoDock's Lamarkian Genetic Algorithm with OpenMP increases the speed of execution of individual docking jobs, and when combined with MPI parallelization can significantly reduce the execution time of virtual screens. This work is significant in that mpAD4 speeds the execution of certain molecular docking workloads and allows the user to optimize the degree of system-level (MPI and node-level (OpenMP parallelization to best fit both workloads and computational resources.

Multilevel Parallelization of AutoDock 4.2.

Science.gov (United States)

Norgan, Andrew P; Coffman, Paul K; Kocher, Jean-Pierre A; Katzmann, David J; Sosa, Carlos P

2011-04-28

Virtual (computational) screening is an increasingly important tool for drug discovery. AutoDock is a popular open-source application for performing molecular docking, the prediction of ligand-receptor interactions. AutoDock is a serial application, though several previous efforts have parallelized various aspects of the program. In this paper, we report on a multi-level parallelization of AutoDock 4.2 (mpAD4). Using MPI and OpenMP, AutoDock 4.2 was parallelized for use on MPI-enabled systems and to multithread the execution of individual docking jobs. In addition, code was implemented to reduce input/output (I/O) traffic by reusing grid maps at each node from docking to docking. Performance of mpAD4 was examined on two multiprocessor computers. Using MPI with OpenMP multithreading, mpAD4 scales with near linearity on the multiprocessor systems tested. In situations where I/O is limiting, reuse of grid maps reduces both system I/O and overall screening time. Multithreading of AutoDock's Lamarkian Genetic Algorithm with OpenMP increases the speed of execution of individual docking jobs, and when combined with MPI parallelization can significantly reduce the execution time of virtual screens. This work is significant in that mpAD4 speeds the execution of certain molecular docking workloads and allows the user to optimize the degree of system-level (MPI) and node-level (OpenMP) parallelization to best fit both workloads and computational resources.

Parallel Careers and their Consequences for Companies in Brazil

Directory of Open Access Journals (Sweden)

Maria Candida Baumer Azevedo

2014-04-01

Full Text Available Given the relevance of the need to manage parallel careers to attract and retain people in organizations, this paper provides insight into this phenomenon from an organizational perspective. The parallel career concept, introduced by Alboher (2007 and recently addressed by Schuiling (2012, has previously been examined only from the perspective of the parallel career holder (PC holder. The paper provides insight from both individual and organizational perspectives on the phenomenon of parallel careers and considers how it can function as an important tool for attracting and retaining people by contributing to human development. This paper employs a qualitative approach that includes 30 semi-structured one-on-one interviews. The organizational perspective arises from the 15 interviews with human resources (HR executives from different companies. The individual viewpoint originates from the interviews with 15 executives who are also PC holders. An inductive content analysis approach was used to examine Brazilian companies and the Brazilian office of multinationals. Companies that are concerned about having the best talent on their teams can benefit from a deeper understanding of parallel careers, which can be used to attract, develop, and retain talent. Limitations and directions for future research are discussed.

CLIMATE-TREE GROWTH RELATIONSHIPS OF Mimosa tenuiflora IN SEASONALLY DRY TROPICAL FOREST, BRAZIL

Directory of Open Access Journals (Sweden)

Patrícia Póvoa Mattos

2015-03-01

Full Text Available Mimosa tenuiflora is a native pioneer tree from the Caatinga used commercially as firewood due to its high calorific value. It is deciduous, its trunk does not reach large diameters and it has good regrowth capacity. This study intended to determine the annual increment in diameter of M. tenuiflora and its correlation with rainfall, as basis for fuel wood management. Disks from the stem base of M. tenuiflora trees were collected in 2008 in Sertânia and Serra Talhada, Pernambuco State, from regrowth of trees coppiced in 2003 and in Limoeiro do Norte, Ceará State, from a plantation established in 2002. The trees have well-defined annual growth rings, highly correlated with annual precipitation and are well-suited for dendrochronological investigations. Forest managers must consider the influence of previous drier years in the wood production when predicting fuel wood harvesting. The high growth correlation with the previous year’s rainfall in regions where the rains start after photoperiodic stimulation indicate the necessity of understanding the growth dynamics of the species under dry forest conditions through additional ecophysiology studies.

Maintenance and conservation of historical pomegranate tree in the garden of Thessaloniki Ataturk’s House

Directory of Open Access Journals (Sweden)

Süleyman Çoban

2016-01-01

Full Text Available Historical pomegranate tree in the garden of Atatürk’s House in Thessaloniki storied that planted by the father of Ataturk, Ali Rıza Efendi, has been one of the most attractive points at the museum. However, in addition to the problems of natural ageing period, constructional works in the garden during restoration of the museum and unappropriate prunings caused serious health problems on the tree. For this reason, in order to cease or delay tree collapsing period and prolong survival of the tree, regular maintenance treatments have to be conducted. In this study, technical information has been given regarding the precautions of specific tree maintenance and conservation works, which are normally applied to long lived monumental trees in the literature, on the pomegranate tree. However, these precautions have not been previously applied on such a tree, particularly on the pomegranate tree.

A bijection between phylogenetic trees and plane oriented recursive trees

OpenAIRE

Prodinger, Helmut

2017-01-01

Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the respective representations a 2-partitions and trapezoidal words.

Performance studies of the parallel VIM code

International Nuclear Information System (INIS)

Shi, B.; Blomquist, R.N.

1996-01-01

In this paper, the authors evaluate the performance of the parallel version of the VIM Monte Carlo code on the IBM SPx at the High Performance Computing Research Facility at ANL. Three test problems with contrasting computational characteristics were used to assess effects in performance. A statistical method for estimating the inefficiencies due to load imbalance and communication is also introduced. VIM is a large scale continuous energy Monte Carlo radiation transport program and was parallelized using history partitioning, the master/worker approach, and p4 message passing library. Dynamic load balancing is accomplished when the master processor assigns chunks of histories to workers that have completed a previously assigned task, accommodating variations in the lengths of histories, processor speeds, and worker loads. At the end of each batch (generation), the fission sites and tallies are sent from each worker to the master process, contributing to the parallel inefficiency. All communications are between master and workers, and are serial. The SPx is a scalable 128-node parallel supercomputer with high-performance Omega switches of 63 microsec latency and 35 MBytes/sec bandwidth. For uniform and reproducible performance, they used only the 120 identical regular processors (IBM RS/6000) and excluded the remaining eight planet nodes, which may be loaded by other's jobs

Automatic parallelization of while-Loops using speculative execution

International Nuclear Information System (INIS)

Collard, J.F.

1995-01-01

Automatic parallelization of imperative sequential programs has focused on nests of for-loops. The most recent of them consist in finding an affine mapping with respect to the loop indices to simultaneously capture the temporal and spatial properties of the parallelized program. Such a mapping is usually called a open-quotes space-time transformation.close quotes This work describes an extension of these techniques to while-loops using speculative execution. We show that space-time transformations are a good framework for summing up previous restructuration techniques of while-loop, such as pipelining. Moreover, we show that these transformations can be derived and applied automatically

Measuring urban tree loss dynamics across residential landscapes.

Science.gov (United States)

Ossola, Alessandro; Hopton, Matthew E

2018-01-15

The spatial arrangement of urban vegetation depends on urban morphology and socio-economic settings. Urban vegetation changes over time because of human management. Urban trees are removed due to hazard prevention or aesthetic preferences. Previous research attributed tree loss to decreases in canopy cover. However, this provides little information about location and structural characteristics of trees lost, as well as environmental and social factors affecting tree loss dynamics. This is particularly relevant in residential landscapes where access to residential parcels for field surveys is limited. We tested whether multi-temporal airborne LiDAR and multi-spectral imagery collected at a 5-year interval can be used to investigate urban tree loss dynamics across residential landscapes in Denver, CO and Milwaukee, WI, covering 400,705 residential parcels in 444 census tracts. Position and stem height of trees lost were extracted from canopy height models calculated as the difference between final (year 5) and initial (year 0) vegetation height derived from LiDAR. Multivariate regression models were used to predict number and height of tree stems lost in residential parcels in each census tract based on urban morphological and socio-economic variables. A total of 28,427 stems were lost from residential parcels in Denver and Milwaukee over 5years. Overall, 7% of residential parcels lost one stem, averaging 90.87 stems per km 2 . Average stem height was 10.16m, though trees lost in Denver were taller compared to Milwaukee. The number of stems lost was higher in neighborhoods with higher canopy cover and developed before the 1970s. However, socio-economic characteristics had little effect on tree loss dynamics. The study provides a simple method for measuring urban tree loss dynamics within and across entire cities, and represents a further step toward high resolution assessments of the three-dimensional change of urban vegetation at large spatial scales. Published by

Study of structural phase transition in KD3 (Se O3)2 and Na H3(Se O3)2 by EPR

International Nuclear Information System (INIS)

Silva, J.C.M. da.

1988-01-01

The electron paramagnetic resonance of Se O - 2 centers in KD 3 (Se O 3 ) 2 and Na H 3 (Se O 3 ) 2 was done in the temperature ranges of -170 0 C o +80 0 C and +25 0 C to -185 0 C, respectively. (A.C.A.S.)

The role of parallelism in the real-time processing of anaphora.

Science.gov (United States)

Poirier, Josée; Walenski, Matthew; Shapiro, Lewis P

2012-06-01

Parallelism effects refer to the facilitated processing of a target structure when it follows a similar, parallel structure. In coordination, a parallelism-related conjunction triggers the expectation that a second conjunct with the same structure as the first conjunct should occur. It has been proposed that parallelism effects reflect the use of the first structure as a template that guides the processing of the second. In this study, we examined the role of parallelism in real-time anaphora resolution by charting activation patterns in coordinated constructions containing anaphora, Verb-Phrase Ellipsis (VPE) and Noun-Phrase Traces (NP-traces). Specifically, we hypothesised that an expectation of parallelism would incite the parser to assume a structure similar to the first conjunct in the second, anaphora-containing conjunct. The speculation of a similar structure would result in early postulation of covert anaphora. Experiment 1 confirms that following a parallelism-related conjunction, first-conjunct material is activated in the second conjunct. Experiment 2 reveals that an NP-trace in the second conjunct is posited immediately where licensed, which is earlier than previously reported in the literature. In light of our findings, we propose an intricate relation between structural expectations and anaphor resolution.

Rate of tree carbon accumulation increases continuously with tree size

Science.gov (United States)

Stephenson, N.L.; Das, A.J.; Condit, R.; Russo, S.E.; Baker, P.J.; Beckman, N.G.; Coomes, D.A.; Lines, E.R.; Morris, W.K.; Rüger, N.; Álvarez, E.; Blundo, C.; Bunyavejchewin, S.; Chuyong, G.; Davies, S.J.; Duque, Á.; Ewango, C.N.; Flores, O.; Franklin, J.F.; Grau, H.R.; Hao, Z.; Harmon, M.E.; Hubbell, S.P.; Kenfack, D.; Lin, Y.; Makana, J.-R.; Malizia, A.; Malizia, L.R.; Pabst, R.J.; Pongpattananurak, N.; Su, S.-H.; Sun, I-F.; Tan, S.; Thomas, D.; van Mantgem, P.J.; Wang, X.; Wiser, S.K.; Zavala, M.A.

2014-01-01

Forests are major components of the global carbon cycle, providing substantial feedback to atmospheric greenhouse gas concentrations. Our ability to understand and predict changes in the forest carbon cycle—particularly net primary productivity and carbon storage - increasingly relies on models that represent biological processes across several scales of biological organization, from tree leaves to forest stands. Yet, despite advances in our understanding of productivity at the scales of leaves and stands, no consensus exists about the nature of productivity at the scale of the individual tree, in part because we lack a broad empirical assessment of whether rates of absolute tree mass growth (and thus carbon accumulation) decrease, remain constant, or increase as trees increase in size and age. Here we present a global analysis of 403 tropical and temperate tree species, showing that for most species mass growth rate increases continuously with tree size. Thus, large, old trees do not act simply as senescent carbon reservoirs but actively fix large amounts of carbon compared to smaller trees; at the extreme, a single big tree can add the same amount of carbon to the forest within a year as is contained in an entire mid-sized tree. The apparent paradoxes of individual tree growth increasing with tree size despite declining leaf-level and stand-level productivity can be explained, respectively, by increases in a tree’s total leaf area that outpace declines in productivity per unit of leaf area and, among other factors, age-related reductions in population density. Our results resolve conflicting assumptions about the nature of tree growth, inform efforts to understand and model forest carbon dynamics, and have additional implications for theories of resource allocation and plant senescence.

Cloning and identification of the gene coding for the 140-kd subunit of Drosophila RNA polymerase II

OpenAIRE

Faust, Daniela M.; Renkawitz-Pohl, Renate; Falkenburg, Dieter; Gasch, Alexander; Bialojan, Siegfried; Young, Richard A.; Bautz, Ekkehard K. F.

1986-01-01

Genomic clones of Drosophila melanogaster were isolated from a λ library by cross-hybridization with the yeast gene coding for the 150-kd subunit of RNA polymerase II. Clones containing a region of ∼2.0 kb with strong homology to the yeast gene were shown to code for a 3.9-kb poly(A)+-RNA. Part of the coding region was cloned into an expression vector. A fusion protein was obtained which reacted with an antibody directed against RNA polymerase II of Drosophila. Peptide mapping of the fusion p...

Large amplitude parallel propagating electromagnetic oscillitons

International Nuclear Information System (INIS)

Cattaert, Tom; Verheest, Frank

2005-01-01

Earlier systematic nonlinear treatments of parallel propagating electromagnetic waves have been given within a fluid dynamic approach, in a frame where the nonlinear structures are stationary and various constraining first integrals can be obtained. This has lead to the concept of oscillitons that has found application in various space plasmas. The present paper differs in three main aspects from the previous studies: first, the invariants are derived in the plasma frame, as customary in the Sagdeev method, thus retaining in Maxwell's equations all possible effects. Second, a single differential equation is obtained for the parallel fluid velocity, in a form reminiscent of the Sagdeev integrals, hence allowing a fully nonlinear discussion of the oscilliton properties, at such amplitudes as the underlying Mach number restrictions allow. Third, the transition to weakly nonlinear whistler oscillitons is done in an analytical rather than a numerical fashion

Equity trees and graphs via information theory

Science.gov (United States)

Harré, M.; Bossomaier, T.

2010-01-01

We investigate the similarities and differences between two measures of the relationship between equities traded in financial markets. Our measures are the correlation coefficients and the mutual information. In the context of financial markets correlation coefficients are well established whereas mutual information has not previously been as well studied despite its theoretically appealing properties. We show that asset trees which are derived from either the correlation coefficients or the mutual information have a mixture of both similarities and differences at the individual equity level and at the macroscopic level. We then extend our consideration from trees to graphs using the "genus 0" condition recently introduced in order to study the networks of equities.

Influence of water trees on breakdown voltage of polymeric cables insulations

Energy Technology Data Exchange (ETDEWEB)

Stancu, Cristina [INCDIE ICPE CA, Bucharest (Romania); Notingher, Petru V.; Plopeanu, Mihai Gabriel [Politehnica University of Bucharest, Bucharest (Romania)

2011-07-01

In a previous paper was shown that water trees development modifies considerably the electric field repartition, which increases significantly in the vicinity of treed areas. In order to find the water trees influence on the breakdown voltage, in the present paper, an experimental study on model cables insulated with low density polyethylene is done. In insulation samples, water trees with various dimensions and densities were developed. For the reduction of the test duration, an electric field with a higher frequency (3-5 kHz) was used. For breakdown voltage measurement an automatic setup was realized. For each value of the ageing time the dimensions and densities of water trees and breakdown voltage were measured and the dependency of the breakdown voltage with these quantities were analysed. The results show a significant reduction of the breakdown voltage of treed cables insulations compared to un-treed ones. Key words: polyethylene, water treeing, electric field, breakdown, power cables.

A Weibull-based compositional approach for hierarchical dynamic fault trees

International Nuclear Information System (INIS)

Chiacchio, F.; Cacioppo, M.; D'Urso, D.; Manno, G.; Trapani, N.; Compagno, L.

2013-01-01

The solution of a dynamic fault tree (DFT) for the reliability assessment can be achieved using a wide variety of techniques. These techniques have a strong theoretical foundation as both the analytical and the simulation methods have been extensively developed. Nevertheless, they all present the same limits that appear with the increasing of the size of the fault trees (i.e., state space explosion, time-consuming simulations), compromising the resolution. We have tested the feasibility of a composition algorithm based on a Weibull distribution, addressed to the resolution of a general class of dynamic fault trees characterized by non-repairable basic events and generally distributed failure times. The proposed composition algorithm is used to generalize the traditional hierarchical technique that, as previous literature have extensively confirmed, is able to reduce the computational effort of a large DFT through the modularization of independent parts of the tree. The results of this study are achieved both through simulation and analytical techniques, thus confirming the capability to solve a quite general class of dynamic fault trees and overcome the limits of traditional techniques.

Parallel MR imaging.

Science.gov (United States)

Deshmane, Anagha; Gulani, Vikas; Griswold, Mark A; Seiberlich, Nicole

2012-07-01

Parallel imaging is a robust method for accelerating the acquisition of magnetic resonance imaging (MRI) data, and has made possible many new applications of MR imaging. Parallel imaging works by acquiring a reduced amount of k-space data with an array of receiver coils. These undersampled data can be acquired more quickly, but the undersampling leads to aliased images. One of several parallel imaging algorithms can then be used to reconstruct artifact-free images from either the aliased images (SENSE-type reconstruction) or from the undersampled data (GRAPPA-type reconstruction). The advantages of parallel imaging in a clinical setting include faster image acquisition, which can be used, for instance, to shorten breath-hold times resulting in fewer motion-corrupted examinations. In this article the basic concepts behind parallel imaging are introduced. The relationship between undersampling and aliasing is discussed and two commonly used parallel imaging methods, SENSE and GRAPPA, are explained in detail. Examples of artifacts arising from parallel imaging are shown and ways to detect and mitigate these artifacts are described. Finally, several current applications of parallel imaging are presented and recent advancements and promising research in parallel imaging are briefly reviewed. Copyright © 2012 Wiley Periodicals, Inc.

Long term radiocesium contamination of fruit trees following the Chernobyl accident

International Nuclear Information System (INIS)

Antonopoulos-Domis, M.; Clouvas, A.; Gagianas, A.

1996-01-01

Radiocesium contamination form the Chernobyl accident of fruits and leaves from various fruit trees was systematically studied form 1990-1995 on two agricultural experimentation farms in Northern Greece. The results are discussed in the framework of a previously published model describing the long-term radiocesium contamination mechanism of deciduous fruit trees after a nuclear accident. The results of the present work qualitatively verify the model predictions. 11 refs., 5 figs., 1 tab

Optimal conductive constructal configurations with “parallel design”

International Nuclear Information System (INIS)

Eslami, M.

2016-01-01

Highlights: • A new parallel design is proposed for conductive cooling of heat generating rectangles. • The geometric features are optimized analytically. • The internal structure morph as a function of available conductive material. • Thermal performance is superior to the previously numerically optimized designs. - Abstract: Today, conductive volume to point cooling of heat generating bodies is under investigation as an alternative method for thermal management of electronic chipsets with high power density. In this paper, a new simple geometry called “parallel design” is proposed for effective conductive cooling of rectangular heat generating bodies. This configuration tries to minimize the thermal resistance associated with the temperature drop inside the heat generating volume. The geometric features of the design are all optimized analytically and expressed with simple explicit equations. It is proved that optimal number of parallel links is equal to the thermal conductivity ratio multiplied by the porosity (or the volume ratio). With the universal aspect ratio of H/L = 2, total thermal resistance of the present parallel design is lower than the recently proposed networks of various shapes that are optimized with help of numerical simulations; especially when more conducting material is available.

IcyTree: rapid browser-based visualization for phylogenetic trees and networks.

Science.gov (United States)

Vaughan, Timothy G

2017-08-01

IcyTree is an easy-to-use application which can be used to visualize a wide variety of phylogenetic trees and networks. While numerous phylogenetic tree viewers exist already, IcyTree distinguishes itself by being a purely online tool, having a responsive user interface, supporting phylogenetic networks (ancestral recombination graphs in particular), and efficiently drawing trees that include information such as ancestral locations or trait values. IcyTree also provides intuitive panning and zooming utilities that make exploring large phylogenetic trees of many thousands of taxa feasible. IcyTree is a web application and can be accessed directly at http://tgvaughan.github.com/icytree . Currently supported web browsers include Mozilla Firefox and Google Chrome. IcyTree is written entirely in client-side JavaScript (no plugin required) and, once loaded, does not require network access to run. IcyTree is free software, and the source code is made available at http://github.com/tgvaughan/icytree under version 3 of the GNU General Public License. tgvaughan@gmail.com. © The Author(s) 2017. Published by Oxford University Press.

High-Performance Psychometrics: The Parallel-E Parallel-M Algorithm for Generalized Latent Variable Models. Research Report. ETS RR-16-34

Science.gov (United States)

von Davier, Matthias

2016-01-01

This report presents results on a parallel implementation of the expectation-maximization (EM) algorithm for multidimensional latent variable models. The developments presented here are based on code that parallelizes both the E step and the M step of the parallel-E parallel-M algorithm. Examples presented in this report include item response…

ESPRIT-Forest: Parallel clustering of massive amplicon sequence data in subquadratic time.

Science.gov (United States)

Cai, Yunpeng; Zheng, Wei; Yao, Jin; Yang, Yujie; Mai, Volker; Mao, Qi; Sun, Yijun

2017-04-01

The rapid development of sequencing technology has led to an explosive accumulation of genomic sequence data. Clustering is often the first step to perform in sequence analysis, and hierarchical clustering is one of the most commonly used approaches for this purpose. However, it is currently computationally expensive to perform hierarchical clustering of extremely large sequence datasets due to its quadratic time and space complexities. In this paper we developed a new algorithm called ESPRIT-Forest for parallel hierarchical clustering of sequences. The algorithm achieves subquadratic time and space complexity and maintains a high clustering accuracy comparable to the standard method. The basic idea is to organize sequences into a pseudo-metric based partitioning tree for sub-linear time searching of nearest neighbors, and then use a new multiple-pair merging criterion to construct clusters in parallel using multiple threads. The new algorithm was tested on the human microbiome project (HMP) dataset, currently one of the largest published microbial 16S rRNA sequence dataset. Our experiment demonstrated that with the power of parallel computing it is now compu- tationally feasible to perform hierarchical clustering analysis of tens of millions of sequences. The software is available at http://www.acsu.buffalo.edu/∼yijunsun/lab/ESPRIT-Forest.html.

Using parallel factor analysis modeling (PARAFAC) and self-organizing maps to track senescence-induced patterns in leaf litter leachate

Science.gov (United States)

Wheeler, K. I.; Levia, D. F., Jr.; Hudson, J. E.

2017-12-01

As trees undergo autumnal processes such as resorption, senescence, and leaf abscission, the dissolved organic matter (DOM) contribution of leaf litter leachate to streams changes. However, little research has investigated how the fluorescent DOM (FDOM) changes throughout the autumn and how this differs inter- and intraspecifically. Two of the major impacts of global climate change on forested ecosystems include altering phenology and causing forest community species and subspecies composition restructuring. We examined changes in FDOM in leachate from American beech (Fagus grandifolia Ehrh.) leaves in Maryland, Rhode Island, Vermont, and North Carolina and yellow poplar (Liriodendron tulipifera L.) leaves from Maryland throughout three different phenophases: green, senescing, and freshly abscissed. Beech leaves from Maryland and Rhode Island have previously been identified as belonging to the same distinct genetic cluster and beech trees from Vermont and the study site in North Carolina from the other. FDOM in samples was characterized using excitation-emission matrices (EEMs) and a six-component parallel factor analysis (PARAFAC) model was created to identify components. Self-organizing maps (SOMs) were used to visualize variation and patterns in the PARAFAC component proportions of the leachate samples. Phenophase and species had the greatest influence on determining where a sample mapped on the SOM when compared to genetic clusters and geographic origin. Throughout senescence, FDOM from all the trees transitioned from more protein-like components to more humic-like ones. Percent greenness of the sampled leaves and the proportion of the tyrosine-like component 1 were found to significantly differ between the two genetic beech clusters. This suggests possible differences in photosynthesis and resorption between the two genetic clusters of beech. The use of SOMs to visualize differences in patterns of senescence between the different species and genetic

Linear parallel processing machines I

Energy Technology Data Exchange (ETDEWEB)

Von Kunze, M

1984-01-01

As is well-known, non-context-free grammars for generating formal languages happen to be of a certain intrinsic computational power that presents serious difficulties to efficient parsing algorithms as well as for the development of an algebraic theory of contextsensitive languages. In this paper a framework is given for the investigation of the computational power of formal grammars, in order to start a thorough analysis of grammars consisting of derivation rules of the form aB ..-->.. A/sub 1/ ... A /sub n/ b/sub 1/...b /sub m/ . These grammars may be thought of as automata by means of parallel processing, if one considers the variables as operators acting on the terminals while reading them right-to-left. This kind of automata and their 2-dimensional programming language prove to be useful by allowing a concise linear-time algorithm for integer multiplication. Linear parallel processing machines (LP-machines) which are, in their general form, equivalent to Turing machines, include finite automata and pushdown automata (with states encoded) as special cases. Bounded LP-machines yield deterministic accepting automata for nondeterministic contextfree languages, and they define an interesting class of contextsensitive languages. A characterization of this class in terms of generating grammars is established by using derivation trees with crossings as a helpful tool. From the algebraic point of view, deterministic LP-machines are effectively represented semigroups with distinguished subsets. Concerning the dualism between generating and accepting devices of formal languages within the algebraic setting, the concept of accepting automata turns out to reduce essentially to embeddability in an effectively represented extension monoid, even in the classical cases.

Fast Image Texture Classification Using Decision Trees

Science.gov (United States)

Thompson, David R.

2011-01-01

Texture analysis would permit improved autonomous, onboard science data interpretation for adaptive navigation, sampling, and downlink decisions. These analyses would assist with terrain analysis and instrument placement in both macroscopic and microscopic image data products. Unfortunately, most state-of-the-art texture analysis demands computationally expensive convolutions of filters involving many floating-point operations. This makes them infeasible for radiation- hardened computers and spaceflight hardware. A new method approximates traditional texture classification of each image pixel with a fast decision-tree classifier. The classifier uses image features derived from simple filtering operations involving integer arithmetic. The texture analysis method is therefore amenable to implementation on FPGA (field-programmable gate array) hardware. Image features based on the "integral image" transform produce descriptive and efficient texture descriptors. Training the decision tree on a set of training data yields a classification scheme that produces reasonable approximations of optimal "texton" analysis at a fraction of the computational cost. A decision-tree learning algorithm employing the traditional k-means criterion of inter-cluster variance is used to learn tree structure from training data. The result is an efficient and accurate summary of surface morphology in images. This work is an evolutionary advance that unites several previous algorithms (k-means clustering, integral images, decision trees) and applies them to a new problem domain (morphology analysis for autonomous science during remote exploration). Advantages include order-of-magnitude improvements in runtime, feasibility for FPGA hardware, and significant improvements in texture classification accuracy.

Parallel processing of dose calculation for external photon beam therapy

International Nuclear Information System (INIS)

Kunieda, Etsuo; Ando, Yutaka; Tsukamoto, Nobuhiro; Ito, Hisao; Kubo, Atsushi

1994-01-01

We implemented external photon beam dose calculation programs into a parallel processor system consisting of Transputers, 32-bit processors especially suitable for multi-processor configuration. Two network conformations, binary-tree and pipeline, were evaluated for rectangular and irregular field dose calculation algorithms. Although computation speed increased in proportion to the number of CPU, substantial overhead caused by inter-processor communication occurred when a smaller computation load was delivered to each processor. On the other hand, for irregular field calculation, which requires more computation capability for each calculation point, the communication overhead was still less even when more than 50 processors were involved. Real-time responses could be expected for more complex algorithms by increasing the number of processors. (author)

Horn clause verification with convex polyhedral abstraction and tree automata-based refinement

DEFF Research Database (Denmark)

Kafle, Bishoksan; Gallagher, John Patrick

2017-01-01

In this paper we apply tree-automata techniques to refinement of abstract interpretation in Horn clause verification. We go beyond previous work on refining trace abstractions; firstly we handle tree automata rather than string automata and thereby can capture traces in any Horn clause derivations...... underlying the Horn clauses. Experiments using linear constraint problems and the abstract domain of convex polyhedra show that the refinement technique is practical and that iteration of abstract interpretation with tree automata-based refinement solves many challenging Horn clause verification problems. We...... compare the results with other state-of-the-art Horn clause verification tools....

Radiocarbon Dating of an Olive Tree Cross-Section: New Insights on Growth Patterns and Implications for Age Estimation of Olive Trees

Directory of Open Access Journals (Sweden)

Yael Ehrlich

2017-11-01

Full Text Available The age of living massive olive trees is often assumed to be between hundreds and even thousands of years. These estimations are usually based on the girth of the trunk and an extrapolation based on a theoretical annual growth rate. It is difficult to objectively verify these claims, as a monumental tree may not be cut down for analysis of its cross-section. In addition, the inner and oldest part of the trunk in olive trees usually rots, precluding the possibility of carting out radiocarbon analysis of material from the first years of life of the tree. In this work we present a cross-section of an olive tree, previously estimated to be hundreds of years old, which was cut down post-mortem in 2013. The cross-section was radiocarbon dated at numerous points following the natural growth pattern, which was made possible to observe by viewing the entire cross-section. Annual growth rate values were calculated and compared between different radii. The cross-section also revealed a nearly independent segment of growth, which would clearly offset any estimations based solely on girth calculations. Multiple piths were identified, indicating the beginning of branching within the trunk. Different radii were found to have comparable growth rates, resulting in similar estimates dating the piths to the 19th century. The estimated age of the piths represent a terminus ante quem for the age of the tree, as these are piths of separate branches. However, the tree is likely not many years older than the dated piths, and certainly not centuries older. The oldest radiocarbon-datable material in this cross-section was less than 200 years old, which is in agreement with most other radiocarbon dates of internal wood from living olive trees, rarely older than 300 years.

Random number generators for large-scale parallel Monte Carlo simulations on FPGA

Science.gov (United States)

Lin, Y.; Wang, F.; Liu, B.

2018-05-01

Through parallelization, field programmable gate array (FPGA) can achieve unprecedented speeds in large-scale parallel Monte Carlo (LPMC) simulations. FPGA presents both new constraints and new opportunities for the implementations of random number generators (RNGs), which are key elements of any Monte Carlo (MC) simulation system. Using empirical and application based tests, this study evaluates all of the four RNGs used in previous FPGA based MC studies and newly proposed FPGA implementations for two well-known high-quality RNGs that are suitable for LPMC studies on FPGA. One of the newly proposed FPGA implementations: a parallel version of additive lagged Fibonacci generator (Parallel ALFG) is found to be the best among the evaluated RNGs in fulfilling the needs of LPMC simulations on FPGA.

TreeScaper: Visualizing and Extracting Phylogenetic Signal from Sets of Trees.

Science.gov (United States)

Huang, Wen; Zhou, Guifang; Marchand, Melissa; Ash, Jeremy R; Morris, David; Van Dooren, Paul; Brown, Jeremy M; Gallivan, Kyle A; Wilgenbusch, Jim C

2016-12-01

Modern phylogenomic analyses often result in large collections of phylogenetic trees representing uncertainty in individual gene trees, variation across genes, or both. Extracting phylogenetic signal from these tree sets can be challenging, as they are difficult to visualize, explore, and quantify. To overcome some of these challenges, we have developed TreeScaper, an application for tree set visualization as well as the identification of distinct phylogenetic signals. GUI and command-line versions of TreeScaper and a manual with tutorials can be downloaded from https://github.com/whuang08/TreeScaper/releases TreeScaper is distributed under the GNU General Public License. © The Author 2016. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Predicting gene function using hierarchical multi-label decision tree ensembles

Directory of Open Access Journals (Sweden)

Kocev Dragi

2010-01-01

Full Text Available Abstract Background S. cerevisiae, A. thaliana and M. musculus are well-studied organisms in biology and the sequencing of their genomes was completed many years ago. It is still a challenge, however, to develop methods that assign biological functions to the ORFs in these genomes automatically. Different machine learning methods have been proposed to this end, but it remains unclear which method is to be preferred in terms of predictive performance, efficiency and usability. Results We study the use of decision tree based models for predicting the multiple functions of ORFs. First, we describe an algorithm for learning hierarchical multi-label decision trees. These can simultaneously predict all the functions of an ORF, while respecting a given hierarchy of gene functions (such as FunCat or GO. We present new results obtained with this algorithm, showing that the trees found by it exhibit clearly better predictive performance than the trees found by previously described methods. Nevertheless, the predictive performance of individual trees is lower than that of some recently proposed statistical learning methods. We show that ensembles of such trees are more accurate than single trees and are competitive with state-of-the-art statistical learning and functional linkage methods. Moreover, the ensemble method is computationally efficient and easy to use. Conclusions Our results suggest that decision tree based methods are a state-of-the-art, efficient and easy-to-use approach to ORF function prediction.

Are tall trees more sensitive to prolonged drought in tropical per-humid forests?

Science.gov (United States)

Schuldt, Bernhard; Horna, Viviana; Leuschner, Christoph

2010-05-01

Seasonality of water flux was investigated for common tree species of a Central Sulawesi pre-montane perhumid forest located in the Lore Lindu National Park. Trees were exposed to reduced soil water levels under a rainfall exclusion experiment (Sulawesi Throughfall Displacement Experiment, STD), to simulate drought effects and to monitor species-specific short-term responses to extended water stress. Several climate scenarios predict more frequent occurrence of ENSO droughts with increasing severity induced by global warming. Detailed assessments of the ecological consequences of droughts in perhumid forests are scarce and knowledge whether and how these ecosystems are adapted to severe droughts is limited. Key research questions were: (1) how do tall rainforest trees cope with long pathways under low evaporative demand, (2) how sensitive are trees from tropical perhumid forests and how do they acclimate to drought-stress and 3) does wood density determine the drought sensitivity of perhumid forest trees? From June 2007 until October 2009 we monitored 95 trees from 8 common tree species. Half of them were located under the STD Experiment and the other half in control areas. We used the constant heated method to continuously monitor stem xylem flux density and conduct parallel measurements of xylem anatomy and hydraulic conductivity in twigs, stems and roots. After almost 22 months of experimental drought only 25% of xylem flux density reduction was observed in the experimental trees. But the reaction to water stress was species-specific and in some species xylem flux went down to 50 % compared to the individuals located at the control plots. Wood density did not correlate with any hydraulic measurement, but anatomy and hydraulic architecture observations showed a positive correlation between xylem conductivity and vessel size with tree height. These results reveal a well adapted hydraulic system of tall canopy trees allowing for highly efficient water flow under

Two 'extinct' trees rediscovered near Kilwa, Tanzania | Clarke ...

African Journals Online (AJOL)

Preliminary botanical explorations in the little-known Namatimbili–Ngarama forest block located some 35 km inland of Kilwa in south-east Tanzania have rediscovered and further confirmed the presence of two tree species, Erythrina schliebenii Harms and Karomia gigas (Faden) Verdc., that were previously thought to have ...

Flowering Trees

Indian Academy of Sciences (India)

IAS Admin

Flowering Trees. Ailanthus excelsa Roxb. (INDIAN TREE OF. HEAVEN) of Simaroubaceae is a lofty tree with large pinnately compound alternate leaves, which are ... inflorescences, unisexual and greenish-yellow. Fruits are winged, wings many-nerved. Wood is used in making match sticks. 1. Male flower; 2. Female flower.

Spanning Tree Based Attribute Clustering

DEFF Research Database (Denmark)

Zeng, Yifeng; Jorge, Cordero Hernandez

2009-01-01

Attribute clustering has been previously employed to detect statistical dependence between subsets of variables. We propose a novel attribute clustering algorithm motivated by research of complex networks, called the Star Discovery algorithm. The algorithm partitions and indirectly discards...... inconsistent edges from a maximum spanning tree by starting appropriate initial modes, therefore generating stable clusters. It discovers sound clusters through simple graph operations and achieves significant computational savings. We compare the Star Discovery algorithm against earlier attribute clustering...

Compressed Data Structures for Range Searching

DEFF Research Database (Denmark)

Bille, Philip; Gørtz, Inge Li; Vind, Søren Juhl

2015-01-01

matrices and web graphs. Our contribution is twofold. First, we show how to compress geometric repetitions that may appear in standard range searching data structures (such as K-D trees, Quad trees, Range trees, R-trees, Priority R-trees, and K-D-B trees), and how to implement subsequent range queries...... on the compressed representation with only a constant factor overhead. Secondly, we present a compression scheme that efficiently identifies geometric repetitions in point sets, and produces a hierarchical clustering of the point sets, which combined with the first result leads to a compressed representation...

Why do trees die? Characterizing the drivers of background tree mortality

Science.gov (United States)

Das, Adrian J.; Stephenson, Nathan L.; Davis, Kristin P.

2016-01-01

The drivers of background tree mortality rates—the typical low rates of tree mortality found in forests in the absence of acute stresses like drought—are central to our understanding of forest dynamics, the effects of ongoing environmental changes on forests, and the causes and consequences of geographical gradients in the nature and strength of biotic interactions. To shed light on factors contributing to background tree mortality, we analyzed detailed pathological data from 200,668 tree-years of observation and 3,729 individual tree deaths, recorded over a 13-yr period in a network of old-growth forest plots in California's Sierra Nevada mountain range. We found that: (1) Biotic mortality factors (mostly insects and pathogens) dominated (58%), particularly in larger trees (86%). Bark beetles were the most prevalent (40%), even though there were no outbreaks during the study period; in contrast, the contribution of defoliators was negligible. (2) Relative occurrences of broad classes of mortality factors (biotic, 58%; suppression, 51%; and mechanical, 25%) are similar among tree taxa, but may vary with tree size and growth rate. (3) We found little evidence of distinct groups of mortality factors that predictably occur together on trees. Our results have at least three sets of implications. First, rather than being driven by abiotic factors such as lightning or windstorms, the “ambient” or “random” background mortality that many forest models presume to be independent of tree growth rate is instead dominated by biotic agents of tree mortality, with potentially critical implications for forecasting future mortality. Mechanistic models of background mortality, even for healthy, rapidly growing trees, must therefore include the insects and pathogens that kill trees. Second, the biotic agents of tree mortality, instead of occurring in a few predictable combinations, may generally act opportunistically and with a relatively large degree of independence from

A SPECT reconstruction method for extending parallel to non-parallel geometries

International Nuclear Information System (INIS)

Wen Junhai; Liang Zhengrong

2010-01-01

Due to its simplicity, parallel-beam geometry is usually assumed for the development of image reconstruction algorithms. The established reconstruction methodologies are then extended to fan-beam, cone-beam and other non-parallel geometries for practical application. This situation occurs for quantitative SPECT (single photon emission computed tomography) imaging in inverting the attenuated Radon transform. Novikov reported an explicit parallel-beam formula for the inversion of the attenuated Radon transform in 2000. Thereafter, a formula for fan-beam geometry was reported by Bukhgeim and Kazantsev (2002 Preprint N. 99 Sobolev Institute of Mathematics). At the same time, we presented a formula for varying focal-length fan-beam geometry. Sometimes, the reconstruction formula is so implicit that we cannot obtain the explicit reconstruction formula in the non-parallel geometries. In this work, we propose a unified reconstruction framework for extending parallel-beam geometry to any non-parallel geometry using ray-driven techniques. Studies by computer simulations demonstrated the accuracy of the presented unified reconstruction framework for extending parallel-beam to non-parallel geometries in inverting the attenuated Radon transform.

Urinary Colorimetric Sensor Array and Algorithm to Distinguish Kawasaki Disease from Other Febrile Illnesses.

Directory of Open Access Journals (Sweden)

Zhen Li

Full Text Available Kawasaki disease (KD is an acute pediatric vasculitis of infants and young children with unknown etiology and no specific laboratory-based test to identify. A specific molecular diagnostic test is urgently needed to support the clinical decision of proper medical intervention, preventing subsequent complications of coronary artery aneurysms. We used a simple and low-cost colorimetric sensor array to address the lack of a specific diagnostic test to differentiate KD from febrile control (FC patients with similar rash/fever illnesses.Demographic and clinical data were prospectively collected for subjects with KD and FCs under standard protocol. After screening using a genetic algorithm, eleven compounds including metalloporphyrins, pH indicators, redox indicators and solvatochromic dye categories, were selected from our chromatic compound library (n = 190 to construct a colorimetric sensor array for diagnosing KD. Quantitative color difference analysis led to a decision-tree-based KD diagnostic algorithm.This KD sensing array allowed the identification of 94% of KD subjects (receiver operating characteristic [ROC] area under the curve [AUC] 0.981 in the training set (33 KD, 33 FC and 94% of KD subjects (ROC AUC: 0.873 in the testing set (16 KD, 17 FC. Color difference maps reconstructed from the digital images of the sensing compounds demonstrated distinctive patterns differentiating KD from FC patients.The colorimetric sensor array, composed of common used chemical compounds, is an easily accessible, low-cost method to realize the discrimination of subjects with KD from other febrile illness.

Flowering Trees

Indian Academy of Sciences (India)

Flowering Trees. Gyrocarpus americanus Jacq. (Helicopter Tree) of Hernandiaceae is a moderate size deciduous tree that grows to about 12 m in height with a smooth, shining, greenish-white bark. The leaves are ovate, rarely irregularly ... flowers which are unpleasant smelling. Fruit is a woody nut with two long thin wings.

The language parallel Pascal and other aspects of the massively parallel processor

Science.gov (United States)

Reeves, A. P.; Bruner, J. D.

1982-01-01

A high level language for the Massively Parallel Processor (MPP) was designed. This language, called Parallel Pascal, is described in detail. A description of the language design, a description of the intermediate language, Parallel P-Code, and details for the MPP implementation are included. Formal descriptions of Parallel Pascal and Parallel P-Code are given. A compiler was developed which converts programs in Parallel Pascal into the intermediate Parallel P-Code language. The code generator to complete the compiler for the MPP is being developed independently. A Parallel Pascal to Pascal translator was also developed. The architecture design for a VLSI version of the MPP was completed with a description of fault tolerant interconnection networks. The memory arrangement aspects of the MPP are discussed and a survey of other high level languages is given.

Parallel Atomistic Simulations

Energy Technology Data Exchange (ETDEWEB)

HEFFELFINGER,GRANT S.

2000-01-18

Algorithms developed to enable the use of atomistic molecular simulation methods with parallel computers are reviewed. Methods appropriate for bonded as well as non-bonded (and charged) interactions are included. While strategies for obtaining parallel molecular simulations have been developed for the full variety of atomistic simulation methods, molecular dynamics and Monte Carlo have received the most attention. Three main types of parallel molecular dynamics simulations have been developed, the replicated data decomposition, the spatial decomposition, and the force decomposition. For Monte Carlo simulations, parallel algorithms have been developed which can be divided into two categories, those which require a modified Markov chain and those which do not. Parallel algorithms developed for other simulation methods such as Gibbs ensemble Monte Carlo, grand canonical molecular dynamics, and Monte Carlo methods for protein structure determination are also reviewed and issues such as how to measure parallel efficiency, especially in the case of parallel Monte Carlo algorithms with modified Markov chains are discussed.

Myocardial Perfusion: Characteristics of Distal Intramyocardial Arteriolar Trees.

Science.gov (United States)

Zamir, Mair; Vercnocke, Andrew J; Edwards, Phillip K; Anderson, Jill L; Jorgensen, Steven M; Ritman, Erik L

2015-11-01

A combination of experimental, theoretical, and imaging methodologies is used to examine the hierarchical structure and function of intramyocardial arteriolar trees in porcine hearts to provide a window onto a region of myocardial microvasculature which has been difficult to fully explore so far. A total of 66 microvascular trees from 6 isolated myocardial specimens were analyzed, with a cumulative number of 2438 arteriolar branches greater than or equal to 40 μm lumen diameter. The distribution of flow rates within each tree was derived from an assumed power law relationship for that tree between the diameter of vessel segments and flow rates that are consistent with that power law and subject to conservation of mass along hierarchical structure of the tree. The results indicate that the power law index increases at levels of arteriolar vasculature closer to the capillary level, consistent with a concomitant decrease in shear stress acting on endothelial tissue. These results resolve a long standing predicament which could not be resolved previously because of lack of data about the 3D, interconnected, arterioles. In the context of myocardial perfusion, the results indicate that the coefficient of variation of flow rate in pre-capillary distal arterioles is high, suggesting that heterogeneity of flow rate in these arterioles is not entirely random but may be due at least in part to active control.

Does water transport scale universally with tree size?

Science.gov (United States)

F.C. Meinzer; B.J. Bond; J.M. Warren; D.R. Woodruff

2005-01-01

1. We employed standardized measurement techniques and protocols to describe the size dependence of whole-tree water use and cross-sectional area of conducting xylem (sapwood) among several species of angiosperms and conifers. 2. The results were not inconsistent with previously proposed 314-power scaling of water transport with estimated above-...

Flowering Trees

Indian Academy of Sciences (India)

Flowering Trees. Boswellia serrata Roxb. ex Colebr. (Indian Frankincense tree) of Burseraceae is a large-sized deciduous tree that is native to India. Bark is thin, greenish-ash-coloured that exfoliates into smooth papery flakes. Stem exudes pinkish resin ... Fruit is a three-valved capsule. A green gum-resin exudes from the ...

Systolic trees and systolic language recognition by tree automata

Energy Technology Data Exchange (ETDEWEB)

Steinby, M

1983-01-01

K. Culik II, J. Gruska, A. Salomaa and D. Wood have studied the language recognition capabilities of certain types of systolically operating networks of processors (see research reports Cs-81-32, Cs-81-36 and Cs-82-01, Univ. of Waterloo, Ontario, Canada). In this paper, their model for systolic VLSI trees is formalised in terms of standard tree automaton theory, and the way in which some known facts about recognisable forests and tree transductions can be applied in VLSI tree theory is demonstrated. 13 references.

DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.

Science.gov (United States)

Wehe, André; Bansal, Mukul S; Burleigh, J Gordon; Eulenstein, Oliver

2008-07-01

DupTree is a new software program for inferring rooted species trees from collections of gene trees using the gene tree parsimony approach. The program implements a novel algorithm that significantly improves upon the run time of standard search heuristics for gene tree parsimony, and enables the first truly genome-scale phylogenetic analyses. In addition, DupTree allows users to examine alternate rootings and to weight the reconciliation costs for gene trees. DupTree is an open source project written in C++. DupTree for Mac OS X, Windows, and Linux along with a sample dataset and an on-line manual are available at http://genome.cs.iastate.edu/CBL/DupTree

Some aspects of radial flow between parallel disks

International Nuclear Information System (INIS)

Tabatabai, M.; Pollard, A.

1985-01-01

Radial flow of air between two closely spaced parallel disks is examined experimentally. A comprehensive review of the previous work performed on similar flow situations is given by Tabatabai and Pollard. The present paper is a discussion of some of the results obtained so far and offers some observations on the decay of turbulence in this flow. (author)

Flowering Trees

Indian Academy of Sciences (India)

More Details Fulltext PDF. Volume 8 Issue 8 August 2003 pp 112-112 Flowering Trees. Zizyphus jujuba Lam. of Rhamnaceae · More Details Fulltext PDF. Volume 8 Issue 9 September 2003 pp 97-97 Flowering Trees. Moringa oleifera · More Details Fulltext PDF. Volume 8 Issue 10 October 2003 pp 100-100 Flowering Trees.

Embedding complete ternary tree in hypercubes using AVL trees

NARCIS (Netherlands)

S.A. Choudum; I. Raman (Indhumathi)

2008-01-01

htmlabstractA complete ternary tree is a tree in which every non-leaf vertex has exactly three children. We prove that a complete ternary tree of height h, TTh, is embeddable in a hypercube of dimension . This result coincides with the result of [2]. However, in this paper, the embedding utilizes

Ghost-tree: creating hybrid-gene phylogenetic trees for diversity analyses.

Science.gov (United States)

Fouquier, Jennifer; Rideout, Jai Ram; Bolyen, Evan; Chase, John; Shiffer, Arron; McDonald, Daniel; Knight, Rob; Caporaso, J Gregory; Kelley, Scott T

2016-02-24

Fungi play critical roles in many ecosystems, cause serious diseases in plants and animals, and pose significant threats to human health and structural integrity problems in built environments. While most fungal diversity remains unknown, the development of PCR primers for the internal transcribed spacer (ITS) combined with next-generation sequencing has substantially improved our ability to profile fungal microbial diversity. Although the high sequence variability in the ITS region facilitates more accurate species identification, it also makes multiple sequence alignment and phylogenetic analysis unreliable across evolutionarily distant fungi because the sequences are hard to align accurately. To address this issue, we created ghost-tree, a bioinformatics tool that integrates sequence data from two genetic markers into a single phylogenetic tree that can be used for diversity analyses. Our approach starts with a "foundation" phylogeny based on one genetic marker whose sequences can be aligned across organisms spanning divergent taxonomic groups (e.g., fungal families). Then, "extension" phylogenies are built for more closely related organisms (e.g., fungal species or strains) using a second more rapidly evolving genetic marker. These smaller phylogenies are then grafted onto the foundation tree by mapping taxonomic names such that each corresponding foundation-tree tip would branch into its new "extension tree" child. We applied ghost-tree to graft fungal extension phylogenies derived from ITS sequences onto a foundation phylogeny derived from fungal 18S sequences. Our analysis of simulated and real fungal ITS data sets found that phylogenetic distances between fungal communities computed using ghost-tree phylogenies explained significantly more variance than non-phylogenetic distances. The phylogenetic metrics also improved our ability to distinguish small differences (effect sizes) between microbial communities, though results were similar to non

Multivariate analysis of flow cytometric data using decision trees.

Science.gov (United States)

Simon, Svenja; Guthke, Reinhard; Kamradt, Thomas; Frey, Oliver

2012-01-01

Characterization of the response of the host immune system is important in understanding the bidirectional interactions between the host and microbial pathogens. For research on the host site, flow cytometry has become one of the major tools in immunology. Advances in technology and reagents allow now the simultaneous assessment of multiple markers on a single cell level generating multidimensional data sets that require multivariate statistical analysis. We explored the explanatory power of the supervised machine learning method called "induction of decision trees" in flow cytometric data. In order to examine whether the production of a certain cytokine is depended on other cytokines, datasets from intracellular staining for six cytokines with complex patterns of co-expression were analyzed by induction of decision trees. After weighting the data according to their class probabilities, we created a total of 13,392 different decision trees for each given cytokine with different parameter settings. For a more realistic estimation of the decision trees' quality, we used stratified fivefold cross validation and chose the "best" tree according to a combination of different quality criteria. While some of the decision trees reflected previously known co-expression patterns, we found that the expression of some cytokines was not only dependent on the co-expression of others per se, but was also dependent on the intensity of expression. Thus, for the first time we successfully used induction of decision trees for the analysis of high dimensional flow cytometric data and demonstrated the feasibility of this method to reveal structural patterns in such data sets.

Hybrid tree-rule firewall for high speed data transmission

NARCIS (Netherlands)

Chomsiri, Thawatchai; He, Xiangjian; Nanda, Priyadarsi; Tan, Zhiyuan

2017-01-01

Traditional firewalls employ listed rules in both configuration and process phases to regulate network traffic. However, configuring a firewall with listed rules may create rule conflicts, and slows down the firewall. To overcome this problem, we have proposed a Tree-rule firewall in our previous