P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
Katerina Asdre; Stavros D. Nikolopoulos
2006-01-01
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block Ptree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for maintaining future events in a general purpose discrete event simulation system, and studies the performance of their event set algorithms under the event horizon principle. For comparison reasons, some well-known event set algorithms have been selected and studied, that is, the Dynamic-heap and the P-tree algorithms. To gain insight into the performance of the proposed event set algorithms and allow comparisons with the other selected algorithms, they are tested under a wide variety of conditions in an experimental way. The time needed for the execution of the Hold operation is taken as the measure for estimating the average time complexity of the algorithms.The experimental results show that the BP-tree algorithm and the IBP-tree algorithm behave very well with the event set of all the sizes and their performance is almost independent of the stochastic distributions.
Tree modules and counting polynomials
Kinser, Ryan
2011-01-01
We give a formula for counting tree modules for the quiver S_g with g loops and one vertex in terms of tree modules on its universal cover. This formula, along with work of Helleloid and Rodriguez-Villegas, is used to show that the number of d-dimensional tree modules for S_g is polynomial in g with the same degree and leading coefficient as the counting polynomial A_{S_g}(d, q) for absolutely indecomposables over F_q, evaluated at q=1.
Lin, Lei; Wang, Qian; Sadek, Adel W
2016-06-01
The duration of freeway traffic accidents duration is an important factor, which affects traffic congestion, environmental pollution, and secondary accidents. Among previous studies, the M5P algorithm has been shown to be an effective tool for predicting incident duration. M5P builds a tree-based model, like the traditional classification and regression tree (CART) method, but with multiple linear regression models as its leaves. The problem with M5P for accident duration prediction, however, is that whereas linear regression assumes that the conditional distribution of accident durations is normally distributed, the distribution for a "time-to-an-event" is almost certainly nonsymmetrical. A hazard-based duration model (HBDM) is a better choice for this kind of a "time-to-event" modeling scenario, and given this, HBDMs have been previously applied to analyze and predict traffic accidents duration. Previous research, however, has not yet applied HBDMs for accident duration prediction, in association with clustering or classification of the dataset to minimize data heterogeneity. The current paper proposes a novel approach for accident duration prediction, which improves on the original M5P tree algorithm through the construction of a M5P-HBDM model, in which the leaves of the M5P tree model are HBDMs instead of linear regression models. Such a model offers the advantage of minimizing data heterogeneity through dataset classification, and avoids the need for the incorrect assumption of normality for traffic accident durations. The proposed model was then tested on two freeway accident datasets. For each dataset, the first 500 records were used to train the following three models: (1) an M5P tree; (2) a HBDM; and (3) the proposed M5P-HBDM, and the remainder of data were used for testing. The results show that the proposed M5P-HBDM managed to identify more significant and meaningful variables than either M5P or HBDMs. Moreover, the M5P-HBDM had the lowest overall mean
Counting Trees in Supersymmetric Quantum Mechanics
Cordova, Clay
2015-01-01
We study the supersymmetric ground states of the Kronecker model of quiver quantum mechanics. This is the simplest quiver with two gauge groups and bifundamental matter fields, and appears universally in four-dimensional N=2 systems. The ground state degeneracy may be written as a multi-dimensional contour integral, and the enumeration of poles can be simply phrased as counting bipartite trees. We solve this combinatorics problem, thereby obtaining exact formulas for the degeneracies of an infinite class of models. We also develop an algorithm to compute the angular momentum of the ground states, and present explicit expressions for the refined indices of theories where one rank is small.
Herfort, Wolfgang; Zapata, Theo
2011-01-01
Let G be a finitely generated infinite pro-p group acting on a pro-p tree such that the restriction of the action to some open subgroup is free. Then we prove that G splits as a pro-p amalgamated product or as a pro-p HNN-extension over an edge stabilizer. Using this result we prove under certain conditions that free pro-p products with procyclic amalgamation inherit from its free factors the property of each 2-generated subgroup being free pro-p. This generalizes known pro-p results, as well as some pro-p analogs of classical results in abstract combinatorial group theory.
A new method for counting trees with vertex partition
2008-01-01
A direct and elementary method is provided in this paper for counting trees with vertex partition instead of recursion, generating function, functional equation, Lagrange inversion, and matrix methods used before.
Michelle Johnson; Lindsay K. Campbell; Erika. Svendsen
2017-01-01
We present the results of an assessment of participants in the TreesCount! tree census initiative, which occurred in New York City during 2015 and 2016. We posed questions to volunteers about their motivations and experiences of the program and their feelings on how they or their neighborhood may have been changed by the experience of counting...
The Accuracy of Tree-based Counting in Dynamic Networks
Krishnamurthy, Supriya; Ardelius, John; Aurell, Erik; Dam, Mads; Stadler, Rolf; Wuhib, Fetahi
2010-01-01
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn, however, node joins and failures can have complex global effects on the tree overlays, making analysis surprisingly subtle. To our knowledge, few prior analytic results for performance estimation of tree based protocols under churn are currently known. We study a simple Bellman-Ford-like protocol which performs net...
Application of LIDAR to forest inventory for tree count in stands of Eucalyptus sp
Fausto Weimar Acerbi Junior
2012-06-01
Full Text Available Light Detection and Ranging, or LIDAR, has become an effective ancillary tool to extract forest inventory data and for use in other forest studies. This work was aimed at establishing an effective methodology for using LIDAR for tree count in a stand of Eucalyptus sp. located in southern Bahia state. Information provided includes in-flight gross data processing to final tree count. Intermediate processing steps are of critical importance to the quality of results and include the following stages: organizing point clouds, creating a canopy surface model (CSM through TIN and IDW interpolation and final automated tree count with a local maximum algorithm with 5 x 5 and 3 x 3 windows. Results were checked against manual tree count using Quickbird images, for verification of accuracy. Tree count using IDW interpolation with a 5x5 window for the count algorithm was found to be accurate to 97.36%. This result demonstrates the effectiveness of the methodology and its use potential for future applications.
Counting spanning trees on fractal graphs and their asymptotic complexity
Anema, Jason A.; Tsougkas, Konstantinos
2016-09-01
Using the method of spectral decimation and a modified version of Kirchhoff's matrix-tree theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely ramified fractal is given in theorem 3.4. We show how spectral decimation implies the existence of the asymptotic complexity constant and obtain some bounds for it. Examples calculated include the Sierpiński gasket, a non-post critically finite analog of the Sierpiński gasket, the Diamond fractal, and the hexagasket. For each example, the asymptotic complexity constant is found.
Detection and Counting of On-Tree Citrus Fruit for Crop Yield Estimation
Zeeshan Malik
2016-05-01
Full Text Available In this paper, we present a technique to estimate citrus fruit yield from the tree images. Manually counting the fruit for yield estimation for marketing and other managerial tasks is time consuming and requires human resources, which do not always come cheap. Different approaches have been used for the said purpose, yet separation of fruit from its background poses challenges, and renders the exercise inaccurate. In this paper, we use k-means segmentation for recognition of fruit, which segments the image accurately thus enabling more accurate yield estimation. We created a dataset containing 83 tree images with 4001 citrus fruits from three different fields. We are able to detect the on-tree fruits with an accuracy of 91.3%. In addition, we find a strong correlation between the manual and the automated fruit count by getting coefficients of determination R2 up to 0.99.
P.Ptolemy (psuedonym
2008-06-01
Full Text Available There's carbon in the atmosphere, it's rising as we speak. It's past three eighty parts per mil, and heading for apeak. It's higher than it's ever been, than we've ever seen before. Says old air trapped in ice, from an Antarcticcore. The Arctic ice is melting, and the sea is on the rise. We've got to slow emissions; we've got to stabilise.
P.Ptolemy (psuedonym)
2008-01-01
There's carbon in the atmosphere, it's rising as we speak. It's past three eighty parts per mil, and heading for apeak. It's higher than it's ever been, than we've ever seen before. Says old air trapped in ice, from an Antarcticcore. The Arctic ice is melting, and the sea is on the rise. We've got to slow emissions; we've got to stabilise.
许有国
2005-01-01
Most people began to count in tens because they had ten fingers on their hands. But in some countries, people counted on one hand and used the three parts of their four fingers. So they counted in twelves, not in tens.
Maillard, Philippe; Gomes, Marília F.
2016-06-01
This article presents an original algorithm created to detect and count trees in orchards using very high resolution images. The algorithm is based on an adaptation of the "template matching" image processing approach, in which the template is based on a "geometricaloptical" model created from a series of parameters, such as illumination angles, maximum and ambient radiance, and tree size specifications. The algorithm is tested on four images from different regions of the world and different crop types. These images all have < 1 meter spatial resolution and were downloaded from the GoogleEarth application. Results show that the algorithm is very efficient at detecting and counting trees as long as their spectral and spatial characteristics are relatively constant. For walnut, mango and orange trees, the overall accuracy was clearly above 90%. However, the overall success rate for apple trees fell under 75%. It appears that the openness of the apple tree crown is most probably responsible for this poorer result. The algorithm is fully explained with a step-by-step description. At this stage, the algorithm still requires quite a bit of user interaction. The automatic determination of most of the required parameters is under development.
Masato Katoh
2012-05-01
Full Text Available A method of counting the number of coniferous trees by species within forest compartments was developed by combining an individual tree crown delineation technique with a treetop detection technique, using high spatial resolution optical sensor data. When this method was verified against field data from the Shinshu University Campus Forest composed of various cover types, the accuracy for the total number of trees per stand was higher than 84%. This shows improvements over the individual tree crown delineation technique alone which had accuracies lower than 62%, or the treetop detection technique alone which had accuracies lower than 78%. However, the accuracy of the number of trees classified by species was less than 84%. The total number of trees by species per stand was improved with exclusion of the understory species and ranged from 45.2% to 93.8% for Chamaecyparis obtusa and C. pisifera and from 37.9% to 98.1% for broad-leaved trees because many of these were understory species. The better overall results are attributable primarily to the overestimation of Pinus densiflora, Larix kaempferi and broad-leaved trees compensating for the underestimation of C. obtusa and C. pisifera. Practical forest management can be enhanced by registering the output resulting from this technology in a forest geographical information system database. This approach is mostly useful for conifer plantations containing medium to old age trees, which have a higher timber value.
Counting spanning trees of the hypercube and its $q$-analogs by explicit block diagonalization
Srinivasan, Murali K
2011-01-01
The number of spanning trees of a graph $G$ is called the {\\em complexity} of $G$ and is denoted $c(G)$. Let C(n) denote the {\\em (binary) hypercube} of dimension $n$. A classical result in enumerative combinatorics (based on explicit diagonalization) states that $c(C(n)) = \\prod_{k=2}^n (2k)^{n\\choose k}$. In this paper we use the explicit block diagonalization methodology to derive formulas for the complexity of two $q$-analogs of C(n), the {\\em nonbinary hypercube} $\\Cq(n)$, defined for $q\\geq 2$, and the {\\em vector space analog of the hypercube} $\\Cfq(n)$, defined for prime powers $q$. We consider the nonbinary and vector space analogs of the Boolean algebra. We show the existence, in both cases, of a graded Jordan basis (with respect to the up operator) that is orthogonal (with respect to the standard inner product) and we write down explicit formulas for the ratio of the lengths of the successive vectors in the Jordan chains (i.e., the singular values). With respect to (the normalizations of) these bas...
Adelusi, O. O.
2016-12-01
Full Text Available This experiment was carried out to assess the effect of Azadirachta indica, Newbouldia laevis and Spondias mombin leaves on rumen fermentation, microbial count and blood urea nitrogen (BUN of West African Dwarf (WAD goats. Sixteen WAD bucks (11.6 ? 0.9 kg in body weight were allocated to 4 treatments: 1 Control and 2 40 g/day of Azadirachta indica, 3 40 g/day of Newbouldia laevis and 4 40 g/day of Spondias mombin leaves arranged in a completely randomised design. The ground leaves were included in concentrate diets served on dry matter basis at 2% of body weight while Panicum maximum was fed ad libitum. The control diet had no tree leaves. Data were collected on chemical composition, rumen fermentation and microbial ecology, and BUN. Saponin was highest (P < 0.05 in S. mombin (8.14% while A. indica and N. laevis had 5.78% and 1.56%, respectively. Rumen ammonia nitrogen was least (P < 0.05 in goats fed A. indica (8.35 mg/dL while the highest (P < 0.05 total volatile fatty acid (TVFA was obtained from goats fed S. mombin with 125.51 mM. Goats fed N. laevis yielded the highest (P < 0.05 acetate with 70.65 mol/100 mol while propionate production was highest (P < 0.05 in the rumen of goats fed S. mombin (27.15 mol/100 mol. Viable bacteria count was lowest (P < 0.05 in rumen of goats fed A. indica (3.95?1012 cfu/ml while the least (P < 0.05 protozoa population was obtained from the rumen of bucks fed S. mombin (4.18?109 cfu/ml. All goats in the treatments containing tree leaves had higher (P < 0.05 and a rapid increase in BUN between 0 and 6 h post feeding when compared with the Control. It is concluded that feeding ground leaves of S. mombin to goats increases rumen total volatile fatty acid and propionate production and reduces the protozoa population.
Al-Khaja, Nawal
2007-01-01
This is a thematic lesson plan for young learners about palm trees and the importance of taking care of them. The two part lesson teaches listening, reading and speaking skills. The lesson includes parts of a tree; the modal auxiliary, can; dialogues and a role play activity.
Kopka, B. [Goettingen Univ. (Germany). Isotopenlaboratorium fuer Biologische und Medizinische Forschung; Schikowski, J. [Goettingen Univ. (Germany). Isotopenlaboratorium fuer Biologische und Medizinische Forschung; Porstendoerfer, J. [Goettingen Univ. (Germany). Isotopenlaboratorium fuer Biologische und Medizinische Forschung
1997-03-01
The government of Schleswig Holstein funded a study to perform the retrospective determination of airborne {sup 3}H and {sup 14}C concentrations. It is well known, that in tree rings most of the hydrogen and cabron is fixed after insertion in the matrix of wood and that the radionuclide concentration correlates with former airborne activity concentrations. For the retrospective study wood disks of trees located in the region near the nuclear power plant of Kruemmel and control disks of unsuspected areas were selected. The hydrogen of the wood was transformed to water and the carbon to carbondioxide by classical oxidation processes (combustion in a furnace). The contents of {sup 3}H in the water and {sup 14}C of the carbondioxide (solved in scintillation liquid) were determined by liquid scintillation counting, using a low-level counter (type Quantulus 1220, Wallac). (orig.)
Henri Epstein
2016-01-01
An algebraic formalism, developed with V. Glaser and R. Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized retarded functions associated with any tree graph. Integrating over the variables associated to internal vertices to obtain the perturbative generalized retarded functions for interacting fields arising from such graphs is shown to be possible for a large cate...
Epstein, Henri
2016-01-01
An algebraic formalism, developped with V. Glaser and R. Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized retarded functions associated with any tree graph. Integrating over the variables associated to internal vertices to obtain the perturbative generalized retarded functions for interacting fields arising from such graphs is shown to be possible for a large cat...
Epstein, Henri
2016-01-01
An algebraic formalism, developped with V.~Glaser and R.~Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized retarded functions associated with any tree graph. Integrating over the variables associated to internal vertices to obtain the perturbative generalized retarded functions for interacting fields arising from such graphs is shown to be possible for a large category of space-times.
Counting coalescent histories.
Rosenberg, Noah A
2007-04-01
Given a species tree and a gene tree, a valid coalescent history is a list of the branches of the species tree on which coalescences in the gene tree take place. I develop a recursion for the number of valid coalescent histories that exist for an arbitrary gene tree/species tree pair, when one gene lineage is studied per species. The result is obtained by defining a concept of m-extended coalescent histories, enumerating and counting these histories, and taking the special case of m = 1. As a sum over valid coalescent histories appears in a formula for the probability that a random gene tree evolving along the branches of a fixed species tree has a specified labeled topology, the enumeration of valid coalescent histories can considerably reduce the effort required for evaluating this formula.
Carb counting; Carbohydrate-controlled diet; Diabetic diet; Diabetes-counting carbohydrates ... Many foods contain carbohydrates (carbs), including: Fruit and fruit juice Cereal, bread, pasta, and rice Milk and milk products, soy milk Beans, legumes, ...
National Oceanic and Atmospheric Administration, Department of Commerce — Database of seal counts from aerial photography. Counts by image, site, species, and date are stored in the database along with information on entanglements and...
... their spleen removed surgically Use of birth control pills (oral contraceptives) Some conditions may cause a temporary (transitory) increased ... increased platelet counts include estrogen and birth control pills (oral contraceptives). Mildly decreased platelet counts may be seen in ...
Geist, William H. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-12-01
This set of slides begins by giving background and a review of neutron counting; three attributes of a verification item are discussed: ^{240}Pu_{eff} mass; α, the ratio of (α,n) neutrons to spontaneous fission neutrons; and leakage multiplication. It then takes up neutron detector systems – theory & concepts (coincidence counting, moderation, die-away time); detector systems – some important details (deadtime, corrections); introduction to multiplicity counting; multiplicity electronics and example distributions; singles, doubles, and triples from measured multiplicity distributions; and the point model: multiplicity mathematics.
... radiation therapy, or infection) Cirrhosis of the liver Anemia caused by low iron levels, or low levels of vitamin B12 or folate Chronic kidney disease Reticulocyte count may be higher during pregnancy.
... Lab and Imaging Tests Understanding Blood Counts Understanding Blood Counts Understanding Blood Counts SHARE: Print Glossary Blood cell counts give ... your blood that's occupied by red cells. Normal Blood Counts Normal blood counts fall within a range ...
... limited. Home Visit Global Sites Search Help? White Blood Cell Count Share this page: Was this page helpful? ... Count; Leukocyte Count; White Count Formal name: White Blood Cell Count Related tests: Complete Blood Count , Blood Smear , ...
Perry, Mike; Kader, Gary
1998-01-01
Presents an activity on the simplification of penguin counting by employing the basic ideas and principles of sampling to teach students to understand and recognize its role in statistical claims. Emphasizes estimation, data analysis and interpretation, and central limit theorem. Includes a list of items for classroom discussion. (ASK)
Damonte, Kathleen
2004-01-01
Scientists use sampling to get an estimate of things they cannot easily count. A population is made up of all the organisms of one species living together in one place at the same time. All of the people living together in one town are considered a population. All of the grasshoppers living in a field are a population. Scientists keep track of the…
Alfredo Tomasetta
2010-06-01
Full Text Available Timothy Williamson supports the thesis that every possible entity necessarily exists and so he needs to explain how a possible son of Wittgenstein’s, for example, exists in our world:he exists as a merely possible object (MPO, a pure locus of potential. Williamson presents a short argument for the existence of MPOs: how many knives can be made by fitting together two blades and two handles? Four: at the most two are concrete objects, the others being merely possible knives and merely possible objects. This paper defends the idea that one can avoid reference and ontological commitment to MPOs. My proposal is that MPOs can be dispensed with by using the notion of rules of knife-making. I first present a solution according to which we count lists of instructions - selected by the rules - describing physical combinations between components. This account, however, has its own difficulties and I eventually suggest that one can find a way out by admitting possible worlds, entities which are more commonly accepted - at least by philosophers - than MPOs. I maintain that, in answering Williamson’s questions, we count classes of physically possible worlds in which the same instance of a general rule is applied.
Jaeger, Manfred
2006-01-01
We introduce type extension trees as a formal representation language for complex combinatorial features of relational data. Based on a very simple syntax this language provides a unified framework for expressing features as diverse as embedded subgraphs on the one hand, and marginal counts...... of attribute values on the other. We show by various examples how many existing relational data mining techniques can be expressed as the problem of constructing a type extension tree and a discriminant function....
Jaeger, Manfred
2006-01-01
We introduce type extension trees as a formal representation language for complex combinatorial features of relational data. Based on a very simple syntax this language provides a unified framework for expressing features as diverse as embedded subgraphs on the one hand, and marginal counts...... of attribute values on the other. We show by various examples how many existing relational data mining techniques can be expressed as the problem of constructing a type extension tree and a discriminant function....
Hoosbeek, Marcel R.; Remme, Roy P.; Rusch, Graciela M.
2016-01-01
<p>Tree occurrence in silvopastoral systems of Central America has been under pressure for various reasons including attempts to improve grassland productivity and the need for wood. However, scattered isolated trees are also recognized to provide ecosystem services like shade, fodder and fruits tha
Hoosbeek, Marcel R.; Remme, Roy P.; Rusch, Graciela M.
2016-01-01
<p>Tree occurrence in silvopastoral systems of Central America has been under pressure for various reasons including attempts to improve grassland productivity and the need for wood. However, scattered isolated trees are also recognized to provide ecosystem services like shade, fodder and fruits
Non-Contiguous Pattern Avoidance in Binary Trees
Dairyko, Michael; Tyner, Samantha; Wynn, Casey
2012-01-01
In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare these results to analogous work for contiguous tree patterns. Next, we give an explicit generating function that counts binary trees avoiding a single non-contiguous tree pattern according to number of leaves. In addition, we enumerate binary trees that simultaneously avoid more than one tree pattern. Finally, we explore connections between pattern-avoiding trees and pattern-avoiding permutations.
Aval, Jean-Christophe; Nadeau, Philippe
2011-01-01
In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux which gives a clear proof that tableaux of size n are counted by n!, and which moreover respects most of the well-known statistics studied originally on alternative and permutation tableaux. Our insertion procedure allows to define in particular two simple new bijections between tree-like tableaux and permutations: the first one is conceived specifically to respect the generalized pattern 2-31, while the second one respects the underlying tree of a tree-like tableau.
Relationship of Climatic and Forest Factors to Drought- and Heat-Induced Tree Mortality.
Zhang, Qingyin; Shao, Ming'an; Jia, Xiaoxu; Wei, Xiaorong
2017-01-01
Tree mortality due to warming and drought is a critical aspect of forest ecosystem in responding to climate change. Spatial patterns of tree mortality induced by drought and its influencing factors, however, have yet to be documented at the global scale. We collected observations from 248 sites globally where trees have died due to drought and then assessed the effects of climatic and forest factors on the rate of tree mortality. The global mean annual mortality rate was 5.5%. The rate of tree mortality was significantly and negatively correlated with mean annual precipitation (P Tree mortality was lowest in tropical rainforests with mean annual precipitation >2000 mm and was severe in regions with mean annual precipitation trees (3.2%), and mortality rates significantly decreased with increasing wood density for all species (P tree mortality around the globe varied with climatic and forest factors. The differences between tree species, wood density, stand density, and stand age should be considered when evaluating tree mortality at a large spatial scale during future climatic extremes.
Totally optimal decision trees for Boolean functions
Chikalov, Igor
2016-07-28
We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters characterizing both time (in the worst- and average-case) and space complexity of decision trees, i.e., depth, total path length (average depth), and number of nodes. We have created tools based on extensions of dynamic programming to study totally optimal trees. These tools are applicable to both exact and approximate decision trees, and allow us to make multi-stage optimization of decision trees relative to different parameters and to count the number of optimal trees. Based on the experimental results we have formulated the following hypotheses (and subsequently proved): for almost all Boolean functions there exist totally optimal decision trees (i) relative to the depth and number of nodes, and (ii) relative to the depth and average depth.
Coplestone-Loomis, Lenny
1981-01-01
Pumpkin seeds are counted after students convert pumpkins to jack-o-lanterns. Among the activities involved, pupils learn to count by 10s, make estimates, and to construct a visual representation of 1,000. (MP)
Kucharczyk, Robert A
2012-01-01
In this note we discuss trees similar to the Calkin-Wilf tree, a binary tree that enumerates all positive rational numbers in a simple way. The original construction of Calkin and Wilf is reformulated in a more algebraic language, and an elementary application of methods from analytic number theory gives restrictions on possible analogues.
Tree compression with top trees
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...
Tree compression with top trees
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
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...
Ganzinger, Harald; Nieuwenhuis, Robert; Nivela, Pilar
2001-01-01
Indexing data structures are well-known to be crucial for the efficiency of the current state-of-the-art theorem provers. Examples are \\emph{discrimination trees}, which are like tries where terms are seen as strings and common prefixes are shared, and \\emph{substitution trees}, where terms keep their tree structure and all common \\emph{contexts} can be shared. Here we describe a new indexing data structure, \\emph{context trees}, where, by means of a limited kind of conte...
Cochrane, John. H.; Longstaff, Francis A.; Santa-Clara, Pedro
2004-01-01
We solve a model with two â€œLucas trees.â€ Each tree has i.i.d. dividend growth. The investor has log utility and consumes the sum of the two treesâ€™ dividends. This model produces interesting asset-pricing dynamics, despite its simple ingredients. Investors want to rebalance their portfolios after any change in value. Since the size of the trees is fixed, however, prices must adjust to oï¬€set this desire. As a result, expected returns, excess returns, and return volatility all vary throug...
1970-01-01
The Health Physics counting room, where the quantity of induced radioactivity in materials is determined. This information is used to evaluate possible radiation hazards from the material investigated.
Atmospheric pollen count in Monterrey, Mexico.
González-Díaz, Sandra N; Rodríguez-Ortiz, Pablo G; Arias-Cruz, Alfredo; Macías-Weinmann, Alejandra; Cid-Guerrero, Dagoberto; Sedo-Mejia, Giovanni A
2010-01-01
There are few reports of pollen count and identification in Mexico; therefore, it is important to generate more information on the subject. This study was designed to describe the prevalence of pollen in the city of Monterrey, Mexico, during the year 2004. Atmospheric pollen was collected with a Hirst air sampler, with an airflow of 10 L/minute during 2004. Pollen was identified with light microscopy; the average monthly pollen count as well as total was calculated from January 2004 to January 2005. The months with the highest concentration of pollen were February and March (289 and 142 grains/m(3) per day, respectively), and July and November had the lowest concentration (20 and 11 grains/m(3) per day, respectively). Most of the pollen recollected corresponded to tree pollen (72%). Fraxinus spp had the highest concentration during the year (19 grains/m(3) per day; 27.5% of the total concentration of pollen). Tree pollen predominated from January through March; with Fraxinus spp, Morus spp, Celtis spp, Cupressus spp, and Pinus spp as the most important. Weed pollen predominated in May, June, and December and the most frequently identified, were Amaranthaceae/Chenopodiaceae, Ambrosia spp, and Parietaria spp. The highest concentration of grass pollen was reported during the months of May, June, September, October, and December with Gramineae/Poaceae predominating. Tree pollen was the most abundant during the year, with the ash tree having the highest concentration. Weed and grass pollen were perennial with peaks during the year.
Tolman, Marvin
2005-01-01
Students love outdoor activities and will love them even more when they build confidence in their tree identification and measurement skills. Through these activities, students will learn to identify the major characteristics of trees and discover how the pace--a nonstandard measuring unit--can be used to estimate not only distances but also the…
Anarthria impairs subvocal counting.
Cubelli, R; Nichelli, P; Pentore, R
1993-12-01
We studied subvocal counting in two pure anarthric patients. Analysis showed that they performed definitively worse than normal subjects free to articulate subvocally and their scores were in the lower bounds of the performances of subjects suppressing articulation. These results suggest that subvocal counting is impaired after anarthria.
Phillip P. Allen
2014-05-01
Full Text Available Techniques that analyze biological remains from sediment sequences for environmental reconstructions are well established and widely used. Yet, identifying, counting, and recording biological evidence such as pollen grains remain a highly skilled, demanding, and time-consuming task. Standard procedure requires the classification and recording of between 300 and 500 pollen grains from each representative sample. Recording the data from a pollen count requires significant effort and focused resources from the palynologist. However, when an adaptation to the recording procedure is utilized, efficiency and time economy improve. We describe EcoCount, which represents a development in environmental data recording procedure. EcoCount is a voice activated fully customizable digital count sheet that allows the investigator to continuously interact with a field of view during the data recording. Continuous viewing allows the palynologist the opportunity to remain engaged with the essential task, identification, for longer, making pollen counting more efficient and economical. EcoCount is a versatile software package that can be used to record a variety of environmental evidence and can be installed onto different computer platforms, making the adoption by users and laboratories simple and inexpensive. The user-friendly format of EcoCount allows any novice to be competent and functional in a very short time.
The Shapley Value of Phylogenetic Trees
Haake, Claus-Jochen; Su, Francis Edward
2007-01-01
Every weighted tree corresponds naturally to a cooperative game that we call a "tree game"; it assigns to each subset of leaves the sum of the weights of the minimal subtree spanned by those leaves. In the context of phylogenetic trees, the leaves are species and this assignment captures the diversity present in the coalition of species considered. We consider the Shapley value of tree games and suggest a biological interpretation. We determine the linear transformation M that shows the dependence of the Shapley value on the edge weights of the tree, and we also compute a null space basis of M. Both depend on the "split counts" of the tree. Finally, we characterize the Shapley value on tree games by four axioms, a counterpart to Shapley's original theorem on the larger class of cooperative games.
Baños, Hector; Bushek, Nathaniel; Davidson, Ruth; Gross, Elizabeth; Harris, Pamela E.; Krone, Robert; Long, Colby; Stewart, Allen; WALKER, Robert
2016-01-01
We introduce the package PhylogeneticTrees for Macaulay2 which allows users to compute phylogenetic invariants for group-based tree models. We provide some background information on phylogenetic algebraic geometry and show how the package PhylogeneticTrees can be used to calculate a generating set for a phylogenetic ideal as well as a lower bound for its dimension. Finally, we show how methods within the package can be used to compute a generating set for the join of any two ideals.
Sublattice Counting and Orbifolds
Hanany, Amihay; Reffert, Susanne
2010-01-01
Abelian orbifolds of C^3 are known to be encoded by hexagonal brane tilings. To date it is not known how to count all such orbifolds. We fill this gap by employing number theoretic techniques from crystallography, and by making use of Polya's Enumeration Theorem. The results turn out to be beautifully encoded in terms of partition functions and Dirichlet Series. The same methods apply to counting orbifolds of any toric non-compact Calabi-Yau singularity. As additional examples, we count the orbifolds of the conifold, of the L^{aba} theories, and of C^4.
Game tree algorithms and solution trees
W.H.L.M. Pijls (Wim); A. de Bruin (Arie)
1998-01-01
textabstractIn this paper, a theory of game tree algorithms is presented, entirely based upon the concept of solution tree. Two types of solution trees are distinguished: max and min trees. Every game tree algorithm tries to prune nodes as many as possible from the game tree. A cut-off criterion in
Appelt, Ane L; Rønde, Heidi S
2013-01-01
The photo shows a close-up of a Lichtenberg figure – popularly called an “electron tree” – produced in a cylinder of polymethyl methacrylate (PMMA). Electron trees are created by irradiating a suitable insulating material, in this case PMMA, with an intense high energy electron beam. Upon discharge......, during dielectric breakdown in the material, the electrons generate branching chains of fractures on leaving the PMMA, producing the tree pattern seen. To be able to create electron trees with a clinical linear accelerator, one needs to access the primary electron beam used for photon treatments. We...... appropriated a linac that was being decommissioned in our department and dismantled the head to circumvent the target and ion chambers. This is one of 24 electron trees produced before we had to stop the fun and allow the rest of the accelerator to be disassembled....
Appelt, Ane L; Rønde, Heidi S
2013-01-01
The photo shows a close-up of a Lichtenberg figure – popularly called an “electron tree” – produced in a cylinder of polymethyl methacrylate (PMMA). Electron trees are created by irradiating a suitable insulating material, in this case PMMA, with an intense high energy electron beam. Upon discharge......, during dielectric breakdown in the material, the electrons generate branching chains of fractures on leaving the PMMA, producing the tree pattern seen. To be able to create electron trees with a clinical linear accelerator, one needs to access the primary electron beam used for photon treatments. We...... appropriated a linac that was being decommissioned in our department and dismantled the head to circumvent the target and ion chambers. This is one of 24 electron trees produced before we had to stop the fun and allow the rest of the accelerator to be disassembled....
US Fish and Wildlife Service, Department of the Interior — The goal of St. Vincent National Wildlife Refuge's Track Count Protocol is to provide an index to the population size of game animals inhabiting St. Vincent Island.
Your blood contains red blood cells (RBC), white blood cells (WBC), and platelets. Blood count tests measure the number and types of cells in your blood. This helps doctors check on your overall health. ...
Kersting, Kristian; Natarajan, Sriraam
2012-01-01
A major benefit of graphical models is that most knowledge is captured in the model structure. Many models, however, produce inference problems with a lot of symmetries not reflected in the graphical structure and hence not exploitable by efficient inference techniques such as belief propagation (BP). In this paper, we present a new and simple BP algorithm, called counting BP, that exploits such additional symmetries. Starting from a given factor graph, counting BP first constructs a compressed factor graph of clusternodes and clusterfactors, corresponding to sets of nodes and factors that are indistinguishable given the evidence. Then it runs a modified BP algorithm on the compressed graph that is equivalent to running BP on the original factor graph. Our experiments show that counting BP is applicable to a variety of important AI tasks such as (dynamic) relational models and boolean model counting, and that significant efficiency gains are obtainable, often by orders of magnitude.
Analog multivariate counting analyzers
Nikitin, A V; Armstrong, T P
2003-01-01
Characterizing rates of occurrence of various features of a signal is of great importance in numerous types of physical measurements. Such signal features can be defined as certain discrete coincidence events, e.g. crossings of a signal with a given threshold, or occurrence of extrema of a certain amplitude. We describe measuring rates of such events by means of analog multivariate counting analyzers. Given a continuous scalar or multicomponent (vector) input signal, an analog counting analyzer outputs a continuous signal with the instantaneous magnitude equal to the rate of occurrence of certain coincidence events. The analog nature of the proposed analyzers allows us to reformulate many problems of the traditional counting measurements, and cast them in a form which is readily addressed by methods of differential calculus rather than by algebraic or logical means of digital signal processing. Analog counting analyzers can be easily implemented in discrete or integrated electronic circuits, do not suffer fro...
Department of Housing and Urban Development — This report displays the data communities reported to HUD about the nature of their dedicated homeless inventory, referred to as their Housing Inventory Count (HIC)....
Allegheny County Traffic Counts
Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Traffic sensors at over 1,200 locations in Allegheny County collect vehicle counts for the Pennsylvania Department of Transportation. Data included in the Health...
Carlsson, Sten
1993-01-01
In liquid scintillation counting (LSC) we use the process of luminescense to detect ionising radiation emit$ed from a radionuclide. Luminescense is emission of visible light of nonthermal origin. 1t was early found that certain organic molecules have luminescent properties and such molecules are used in LSC. Today LSC is the mostwidespread method to detect pure beta-ernitters like tritium and carbon-14. 1t has unique properties in its efficient counting geometry, deteetability and the lack of...
2015-01-01
In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface $S$, and fix a number of points $F$ on its boundary. We ask: how many configurations of disjoint arcs are there on $S$ whose boundary is $F$? We find that this enumerative problem, counting curves on surfaces, has a rich structure. For instance, we show that the curve counts obey an effective recursion, in the general framework of to...
Gukov, Sergei
2016-01-01
Interpreting renormalization group flows as solitons interpolating between different fixed points, we ask various questions that are normally asked in soliton physics but not in renormalization theory. Can one count RG flows? Are there different "topological sectors" for RG flows? What is the moduli space of an RG flow, and how does it compare to familiar moduli spaces of (supersymmetric) dowain walls? Analyzing these questions in a wide variety of contexts --- from counting RG walls to AdS/C...
The combinatorics of tandem duplication trees.
Gascuel, Olivier; Hendy, Michael D; Jean-Marie, Alain; McLachlan, Robert
2003-02-01
We developed a recurrence relation that counts the number of tandem duplication trees (either rooted or unrooted) that are consistent with a set of n tandemly repeated sequences generated under the standard unequal recombination (or crossover) model of tandem duplications. The number of rooted duplication trees is exactly twice the number of unrooted trees, which means that on average only two positions for a root on a duplication tree are possible. Using the recurrence, we tabulated these numbers for small values of n. We also developed an asymptotic formula that for large n provides estimates for these numbers. These numbers give a priori probabilities for phylogenies of the repeated sequences to be duplication trees. This work extends earlier studies where exhaustive counts of the numbers for small n were obtained. One application showed the significance of finding that most maximum-parsimony trees constructed from repeat sequences from human immunoglobins and T-cell receptors were tandem duplication trees. Those findings provided strong support to the proposed mechanisms of tandem gene duplication. The recurrence relation also suggests efficient algorithms to recognize duplication trees and to generate random duplication trees for simulation. We present a linear-time recognition algorithm.
Van Esch, Patrick; Crisanti, Marta; Mutti, Paolo [Institut Laue Langevin, Grenoble (France)
2015-07-01
A research project is presented in which we aim at counting individual neutrons with CCD-like cameras. We explore theoretically a technique that allows us to use imaging detectors as counting detectors at lower counting rates, and transits smoothly to continuous imaging at higher counting rates. As such, the hope is to combine the good background rejection properties of standard neutron counting detectors with the absence of dead time of integrating neutron imaging cameras as well as their very good spatial resolution. Compared to Xray detection, the essence of thermal neutron detection is the nuclear conversion reaction. The released energies involved are of the order of a few MeV, while X-ray detection releases energies of the order of the photon energy, which is in the 10 KeV range. Thanks to advances in camera technology which have resulted in increased quantum efficiency, lower noise, as well as increased frame rate up to 100 fps for CMOS-type cameras, this more than 100-fold higher available detection energy implies that the individual neutron detection light signal can be significantly above the noise level, as such allowing for discrimination and individual counting, which is hard to achieve with X-rays. The time scale of CMOS-type cameras doesn't allow one to consider time-of-flight measurements, but kinetic experiments in the 10 ms range are possible. The theory is next confronted to the first experimental results. (authors)
Tree Density and Species Decline in the African Sahel Attributable to Climate
Gonzalez, Patrick; Tucker, Compton J.; Sy, H.
2012-01-01
Increased aridity and human population have reduced tree cover in parts of the African Sahel and degraded resources for local people. Yet, tree cover trends and the relative importance of climate and population remain unresolved. From field measurements, aerial photos, and Ikonos satellite images, we detected significant 1954-2002 tree density declines in the western Sahel of 18 +/- 14% (P = 0.014, n = 204) and 17 +/- 13% (P = 0.0009, n = 187). From field observations, we detected a significant 1960-2000 species richness decline of 21 +/- 11% (P = 0.0028, n = 14) across the Sahel and a southward shift of the Sahel, Sudan, and Guinea zones. Multivariate analyses of climate, soil, and population showed that temperature most significantly (P tree cover changes. Multivariate and bivariate tests and field observations indicated the dominance of temperature and precipitation, supporting attribution of tree cover changes to climate variability. Climate change forcing of Sahel climate variability, particularly the significant (P tree cover changes to global climate change. This suggests roles for global action and local adaptation to address ecological change in the Sahel.
Algorithms for enumerating and counting D2CS of some graphs
Reddy, P Venkata Subba
2010-01-01
A D2CS of a graph G is a set $S \\subseteq V(G)$ with $diam(G[S]) \\leq 2$. We study the problem of counting and enumerating D2CS of a graph. First we give an explicit formula for the number of D2CS in a complete k-ary tree, Fibonacci tree, binary Fibonacci tree and the binomial tree. Next we give an algorithm for enumerating and counting D2CS of a graph. We then give a linear time algorithm for finding all maximal D2CS in a strongly chordal graph.
Interpreting Tree Ensembles with inTrees
Deng, Houtao
2014-01-01
Tree ensembles such as random forests and boosted trees are accurate but difficult to understand, debug and deploy. In this work, we provide the inTrees (interpretable trees) framework that extracts, measures, prunes and selects rules from a tree ensemble, and calculates frequent variable interactions. An rule-based learner, referred to as the simplified tree ensemble learner (STEL), can also be formed and used for future prediction. The inTrees framework can applied to both classification an...
Tamura, Takako
2015-12-01
The circulating blood volume accounts for 8% of the body weight, of which 45% comprises cellular components (blood cells) and 55% liquid components. We can measure the number and morphological features of blood cells (leukocytes, red blood cells, platelets), or count the amount of hemoglobin in a complete blood count: (CBC). Blood counts are often used to detect inflammatory diseases such as infection, anemia, a bleeding tendency, and abnormal cell screening of blood disease. This count is widely used as a basic data item of health examination. In recent years, clinical tests before consultation have become common among outpatient clinics, and the influence of laboratory values on consultation has grown. CBC, which is intended to count the number of raw cells and to check morphological features, is easily influenced by the environment, techniques, etc., during specimen collection procedures and transportation. Therefore, special attention is necessary to read laboratory data. Providing correct test values that accurately reflect a patient's condition from the laboratory to clinical side is crucial. Inappropriate medical treatment caused by erroneous values resulting from altered specimens should be avoided. In order to provide correct test values, the daily management of devices is a matter of course, and comprehending data variables and positively providing information to the clinical side are important. In this chapter, concerning sampling collection, blood collection tubes, dealing with specimens, transportation, and storage, I will discuss their effects on CBC, along with management or handling methods.
Photon counting digital holography
Demoli, Nazif; Skenderović, Hrvoje; Stipčević, Mario; Pavičić, Mladen
2016-05-01
Digital holography uses electronic sensors for hologram recording and numerical method for hologram reconstruction enabling thus the development of advanced holography applications. However, in some cases, the useful information is concealed in a very wide dynamic range of illumination intensities and successful recording requires an appropriate dynamic range of the sensor. An effective solution to this problem is the use of a photon-counting detector. Such detectors possess counting rates of the order of tens to hundreds of millions counts per second, but conditions of recording holograms have to be investigated in greater detail. Here, we summarize our main findings on this problem. First, conditions for optimum recording of digital holograms for detecting a signal significantly below detector's noise are analyzed in terms of the most important holographic measures. Second, for time-averaged digital holograms, optimum recordings were investigated for exposures shorter than the vibration cycle. In both cases, these conditions are studied by simulations and experiments.
National Audubon Society, New York, NY.
Included are an illustrated student reader, "The Story of Trees," a leaders' guide, and a large tree chart with 37 colored pictures. The student reader reviews several aspects of trees: a definition of a tree; where and how trees grow; flowers, pollination and seed production; how trees make their food; how to recognize trees; seasonal changes;…
Soeker, H. [Deutsches Windenergie-Institut (Germany)
1996-09-01
As state of the art method the rainflow counting technique is presently applied everywhere in fatigue analysis. However, the author feels that the potential of the technique is not fully recognized in wind energy industries as it is used, most of the times, as a mere data reduction technique disregarding some of the inherent information of the rainflow counting results. The ideas described in the following aim at exploitation of this information and making it available for use in the design and verification process. (au)
40Ar/39Ar age calibration against counted annuallayers
Storey, Michael; Stecher, Ole
2008-01-01
worth exploring for an improved absolute age basis for the 40Ar/39Ar system is through cross-calibration with counted annual layers (e.g. tree rings, varves and ice cores). North Atlantic Ash Zone (NAAZ) II is found within the dated part of the annual Greenland ice core record. NAAZ II has been...
Dougherty Stahl, Katherine A.
2014-01-01
Each disciplinary community has its own criteria for determining what counts as evidence of knowledge in their academic field. The criteria influence the ways that a community's knowledge is created, communicated, and evaluated. Situating reading, writing, and language instruction within the content areas enables teachers to explicitly…
... may be ordered when: CBC results show a decreased RBC count and/or a decreased hemoglobin and hematocrit A healthcare practitioner wants to ... and hematocrit, to help determine the degree and rate of overproduction of RBCs ... during pregnancy . Newborns have a higher percentage of reticulocytes, but ...
Stuart P. Green
2016-08-01
Full Text Available What counts, or should count, as prostitution? In the criminal law today, prostitution is understood to involve the provision of sexual services in exchange for money or other benefits. But what exactly is a ‘sexual service’? And what exactly is the nature of the required ‘exchange’? The key to answering these questions is to recognize that how we choose to define prostitution will inevitably depend on why we believe one or more aspects of prostitution are wrong or harmful, or should be criminalized or otherwise deterred, in the first place. These judgements, in turn, will often depend on an assessment of the contested empirical evidence on which they rest. This article describes a variety of real-world contexts in which the ‘what counts as prostitution’ question has arisen, surveys a range of leading rationales for deterring prostitution, and demonstrates how the answer to the definition question depends on the answer to the normative question. The article concludes with some preliminary thoughts on how analogous questions about what should count as sexual conduct arise in the context of consensual offences such as adultery and incest, as well as non-consensual offences such as sexual assault.
Counting permutations with no long monotone subsequence via generating trees
Bousquet-Mélou, Mireille
2010-01-01
We recover Gessel's determinantal formula for the generating function of permutations with no ascending subsequence of length m+1. The starting point of our proof is the recursive construction of these permutations by insertion of the largest entry. This construction is of course extremely simple. The cost of this simplicity is that we need to take into account in the enumeration m-1 additional parameters --- namely, the positions of the leftmost increasing subsequences of length i, for i=2,...,m. This yields for the generating function a functional equation with m-1 "catalytic" variables, and the heart of the paper is the solution of this equation. We perform a similar task for involutions with no descending subsequence of length m+1, constructed recursively by adding a cycle containing the largest entry. We refine this result by keeping track of the number of fixed points. In passing, we prove that the ordinary generating functions of these families of permutations can be expressed as constant terms of rati...
Canfield, Elaine
2002-01-01
Describes a fifth-grade art activity that offers a new approach to creating pictures of Aspen trees. Explains that the students learned about art concepts, such as line and balance, in this lesson. Discusses the process in detail for creating the pictures. (CMK)
Assessment of student conceptions of evolutionary trees
Blacquiere, Luke
Biologists use evolutionary trees to depict hypotheses about the relationships among taxa. Trees possess lines that represent lineages, internal nodes that represent where lineages become evolutionarily isolated from one another and terminal nodes that represent the taxa under consideration. Interpreting a tree (i.e., "tree-thinking") is an important skill for biologists yet many students struggle when reading evolutionary trees. Common documented misconceptions include using morphological similarity, internal node counting or terminal node proximity, instead of identifying the internal node that represents a most recent common ancestor (MRCA), to determine relationships among taxa. I developed an instrument to assess whether students were using common ancestry or another, non-scientific, strategy to determine relationships among taxa. The study is the first to explicitly test hypotheses about how students approach reading evolutionary trees. To test the hypotheses an instrument was developed. The instrument is the first reliable and valid assessment testing student understanding of how to use most recent common ancestor to interpret evolutionary relationships in tree diagrams. Instructors can use the instrument as a diagnostic tool enabling them to help students learn this challenging concept. This study shows that, contrary to the assertion that students hold misconceptions about evolutionary trees made in the literature, students do not consistently use erroneous strategies when interpreting trees. This study suggests that a constructivist perspective of cognitive structure describes students' conception of evolutionary trees more closely than a misconception perspective.
Unimodular trees versus Einstein trees
Alvarez, Enrique; Gonzalez-Martin, Sergio [Universidad Autonoma, Instituto de Fisica Teorica, IFT-UAM/CSIC, Madrid (Spain); Universidad Autonoma de Madrid, Departamento de Fisica Teorica, Madrid (Spain); Martin, Carmelo P. [Universidad Complutense de Madrid (UCM), Departamento de Fisica Teorica I Facultad de Ciencias Fisicas, Madrid (Spain)
2016-10-15
The maximally helicity violating tree-level scattering amplitudes involving three, four or five gravitons are worked out in Unimodular Gravity. They are found to coincide with the corresponding amplitudes in General Relativity. This a remarkable result, insofar as both the propagators and the vertices are quite different in the two theories. (orig.)
Unimodular Trees versus Einstein Trees
Alvarez, Enrique; Martin, Carmelo P
2016-01-01
The maximally helicity violating (MHV) tree level scattering amplitudes involving three, four or five gravitons are worked out in Unimodular Gravity. They are found to coincide with the corresponding amplitudes in General Relativity. This a remarkable result, insofar as both the propagators and the vertices are quite different in both theories.
Unimodular trees versus Einstein trees
Álvarez, Enrique; González-Martín, Sergio; Martín, Carmelo P.
2016-10-01
The maximally helicity violating tree-level scattering amplitudes involving three, four or five gravitons are worked out in Unimodular Gravity. They are found to coincide with the corresponding amplitudes in General Relativity. This a remarkable result, insofar as both the propagators and the vertices are quite different in the two theories.
Decision trees with minimum average depth for sorting eight elements
AbouEisha, Hassan
2015-11-19
We prove that the minimum average depth of a decision tree for sorting 8 pairwise different elements is equal to 620160/8!. We show also that each decision tree for sorting 8 elements, which has minimum average depth (the number of such trees is approximately equal to 8.548×10^326365), has also minimum depth. Both problems were considered by Knuth (1998). To obtain these results, we use tools based on extensions of dynamic programming which allow us to make sequential optimization of decision trees relative to depth and average depth, and to count the number of decision trees with minimum average depth.
The right to count does not always count
Sodemann, Morten
2013-01-01
The best prescription against illness is learning to read and to count. People who are unable to count have a harder time learning to read. People who have difficulty counting make poorer decisions, are less able to combine information and are less likely to have a strategy for life...
Finite Sholander Trees, Trees, and their Betweenness
Chvátal, Vašek; Schäfer, Philipp Matthias
2011-01-01
We provide a proof of Sholander's claim (Trees, lattices, order, and betweenness, Proc. Amer. Math. Soc. 3, 369-381 (1952)) concerning the representability of collections of so-called segments by trees, which yields a characterization of the interval function of a tree. Furthermore, we streamline Burigana's characterization (Tree representations of betweenness relations defined by intersection and inclusion, Mathematics and Social Sciences 185, 5-36 (2009)) of tree betweenness and provide a relatively short proof.
National Oceanic and Atmospheric Administration, Department of Commerce — Fish egg counts and standardized counts for eggs captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets], and...
Symptoms High red blood cell count By Mayo Clinic Staff A high red blood cell count is an increase in oxygen-carrying cells in your bloodstream. Red blood cells transport oxygen from your lungs to tissues throughout ...
Counting and Topological Order
陈阳军
1997-01-01
The counting method is a simple and efficient method for processing linear recursive datalog queries.Its time complexity is bounded by O(n,e)where n and e denote the numbers the numbers of nodes and edges,respectively,in the graph representing the input.relations.In this paper,the concepts of heritage appearance function and heritage selection function are introduced,and an evaluation algorithm based on the computation of such functions in topological order is developed .This new algorithm requires only linear time in the case of non-cyclic data.
Masson, Josiane; Soille, Pierre; Mueller, Rick
2004-10-01
In the context of the Common Agricultural Policy (CAP) there is a strong interest of the European Commission for counting and individually locating fruit trees. An automatic counting algorithm developed by the JRC (OLICOUNT) was used in the past for olive trees only, on 1m black and white orthophotos but with limits in case of young trees or irregular groves. This study investigates the improvement of fruit tree identification using VHR images on a large set of data in three test sites, one in Creta (Greece; one in the south-east of France with a majority of olive trees and associated fruit trees, and the last one in Florida on citrus trees. OLICOUNT was compared with two other automatic tree counting, applications, one using the CRISP software on citrus trees and the other completely automatic based on regional minima (morphological image analysis). Additional investigation was undertaken to refine the methods. This paper describes the automatic methods and presents the results derived from the tests.
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 r...
David J. Nowak; Jeffrey T. Walton; James Baldwin; Jerry. Bond
2015-01-01
Information on street trees is critical for management of this important resource. Sampling of street tree populations provides an efficient means to obtain street tree population information. Long-term repeat measures of street tree samples supply additional information on street tree changes and can be used to report damages from catastrophic events. Analyses of...
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...
Bonzom, Valentin
2016-01-01
Three--dimensional colored triangulations are gluings of tetrahedra whose faces carry the colors 0, 1, 2, 3 and in which the attaching maps between tetrahedra are defined using the colors. This framework makes it possible to generalize the notion of two--dimensional $2p$--angulations to three dimensions in a way which is suitable for combinatorics and enumeration. In particular, universality classes of three--dimensional triangulations can be investigated within this framework. Here we study colored triangulations obtained by gluing octahedra. Those which maximize the number of edges at fixed number of octahedra are fully characterized and are shown to have the topology of the 3--sphere. They are further shown to be in bijection with a family of trees, a result which is confirmed by the exact enumeration.
Oscillations in counting statistics
Wilk, Grzegorz
2016-01-01
The very large transverse momenta and large multiplicities available in present LHC experiments on pp collisions allow a much closer look at the corresponding distributions. Some time ago we discussed a possible physical meaning of apparent log-periodic oscillations showing up in p_T distributions (suggesting that the exponent of the observed power-like behavior is complex). In this talk we concentrate on another example of oscillations, this time connected with multiplicity distributions P(N). We argue that some combinations of the experimentally measured values of P(N) (satisfying the recurrence relations used in the description of cascade-stochastic processes in quantum optics) exhibit distinct oscillatory behavior, not observed in the usual Negative Binomial Distributions used to fit data. These oscillations provide yet another example of oscillations seen in counting statistics in many different, apparently very disparate branches of physics further demonstrating the universality of this phenomenon.
Genealogical Trees of Scientific Papers.
Waumans, Michaël Charles; Bersini, Hugues
2016-01-01
Many results have been obtained when studying scientific papers citations databases in a network perspective. Articles can be ranked according to their current in-degree and their future popularity or citation counts can even be predicted. The dynamical properties of such networks and the observation of the time evolution of their nodes started more recently. This work adopts an evolutionary perspective and proposes an original algorithm for the construction of genealogical trees of scientific papers on the basis of their citation count evolution in time. The fitness of a paper now amounts to its in-degree growing trend and a "dying" paper will suddenly see this trend declining in time. It will give birth and be taken over by some of its most prevalent citing "offspring". Practically, this might be used to trace the successive published milestones of a research field.
Genealogical Trees of Scientific Papers.
Michaël Charles Waumans
Full Text Available Many results have been obtained when studying scientific papers citations databases in a network perspective. Articles can be ranked according to their current in-degree and their future popularity or citation counts can even be predicted. The dynamical properties of such networks and the observation of the time evolution of their nodes started more recently. This work adopts an evolutionary perspective and proposes an original algorithm for the construction of genealogical trees of scientific papers on the basis of their citation count evolution in time. The fitness of a paper now amounts to its in-degree growing trend and a "dying" paper will suddenly see this trend declining in time. It will give birth and be taken over by some of its most prevalent citing "offspring". Practically, this might be used to trace the successive published milestones of a research field.
Jia-Yu Tang; Zu-Hui Fan
2003-01-01
We study the counts of resolved SZE (Sunyaev-Zel'dovich effect) clus-ters expected from an interferometric survey in different cosmological models underdifferent conditions. The self-similar universal gas model and Press-Schechter massfunction are used. We take the observing frequency to be 90 GHz, and consider twodish diameters, 1.2 m and 2.5 m. We calculate the number density of the galaxyclusters dN/(dΩdz) at a high flux limit Slimv = 100mJy and at a relative lowSlimv = 10 mJy. The total numbers of SZE clusters N in two low-Ω0 models arecompared. The results show that the influence of the resolved effect depends notonly on D, but also on Slimv: at a given D, the effect is more significant for a highthan for a low Slim Also, the resolved effect for a flat universe is more impressivethan that for an open universe. For D = 1.2m and Slimv= 10mJy, the resolvedeffect is very weak. Considering the designed interferometers which will be used tosurvey SZE clusters, we find that the resolved effect is insignificant when estimatingthe expected yield of the SZE cluster surveys.
Multivariate ultrametric root counting
Avendano, Martin
2011-01-01
Let $K$ be a field, complete with respect to a discrete non-archimedian valuation and let $k$ be the residue field. Consider a system $F$ of $n$ polynomial equations in $K\\vars$. Our first result is a reformulation of the classical Hensel's Lemma in the language of tropical geometry: we show sufficient conditions (semiregularity at $w$) that guarantee that the first digit map $\\delta:(K^\\ast)^n\\to(k^\\ast)^n$ is a one to one correspondence between the solutions of $F$ in $(K^\\ast)^n$ with valuation $w$ and the solutions in $(k^\\ast)^n$ of the initial form system ${\\rm in}_w(F)$. Using this result, we provide an explicit formula for the number of solutions in $(K^\\ast)^n$ of a certain class of systems of polynomial equations (called regular), characterized by having finite tropical prevariety, by having initial forms consisting only of binomials, and by being semiregular at any point in the tropical prevariety. Finally, as a consequence of the root counting formula, we obtain the expected number of roots in $(K...
Making environmental DNA count.
Kelly, Ryan P
2016-01-01
The arc of reception for a new technology or method--like the reception of new information itself--can pass through predictable stages, with audiences' responses evolving from 'I don't believe it', through 'well, maybe' to 'yes, everyone knows that' to, finally, 'old news'. The idea that one can sample a volume of water, sequence DNA out of it, and report what species are living nearby has experienced roughly this series of responses among biologists, beginning with the microbial biologists who developed genetic techniques to reveal the unseen microbiome. 'Macrobial' biologists and ecologists--those accustomed to dealing with species they can see and count--have been slower to adopt such molecular survey techniques, in part because of the uncertain relationship between the number of recovered DNA sequences and the abundance of whole organisms in the sampled environment. In this issue of Molecular Ecology Resources, Evans et al. (2015) quantify this relationship for a suite of nine vertebrate species consisting of eight fish and one amphibian. Having detected all of the species present with a molecular toolbox of six primer sets, they consistently find DNA abundances are associated with species' biomasses. The strength and slope of this association vary for each species and each primer set--further evidence that there is no universal parameter linking recovered DNA to species abundance--but Evans and colleagues take a significant step towards being able to answer the next question audiences tend to ask: 'Yes, but how many are there?'
LAWRENCE RADIATION LABORATORY COUNTING HANDBOOK
Group, Nuclear Instrumentation
1966-10-01
The Counting Handbook is a compilation of operational techniques and performance specifications on counting equipment in use at the Lawrence Radiation Laboratory, Berkeley. Counting notes have been written from the viewpoint of the user rather than that of the designer or maintenance man. The only maintenance instructions that have been included are those that can easily be performed by the experimenter to assure that the equipment is operating properly.
Counting Frequencies from Zotero Items
Spencer Roberts
2013-04-01
Full Text Available In Counting Frequencies you learned how to count the frequency of specific words in a list using python. In this lesson, we will expand on that topic by showing you how to get information from Zotero HTML items, save the content from those items, and count the frequencies of words. It may be beneficial to look over the previous lesson before we begin.
Social Security Administration — Staging Instance for all SUMs Counts related projects including: Redeterminations/Limited Issue, Continuing Disability Resolution, CDR Performance Measures, Initial...
无
2000-01-01
Healthy trees are important to us all. Trees provide shade, beauty, and homes for wildlife. Trees give us products like paper and wood. Trees can give us all this only if they are healthy.They must be well cared for to remain healthy.
Köse, Nesibe; Tuncay Güner, H.; Harley, Grant L.; Guiot, Joel
2017-01-01
The meteorological observational period in Turkey, which starts ca. 1930 CE, is too short for understanding long-term climatic variability. Tree rings have been used intensively as proxy records to understand summer precipitation history of the region, primarily because they have a dominant precipitation signal. Yet, the historical context of temperature variability is unclear. Here, we used higher-order principle components of a network of 23 tree-ring chronologies to provide a high-resolution spring (March-April) temperature reconstruction over Turkey during the period 1800-2002. The reconstruction model accounted for 67 % (Adj. R2 = 0.64, p tree-ring network (first principle component) showed highly significant correlations with gridded summer drought index reconstruction over Turkey and Mediterranean countries. Our results showed that, beside the dominant precipitation signal, a temperature signal can be extracted from tree-ring series and they can be useful proxies in reconstructing past temperature variability.
Reference counting for reversible languages
Mogensen, Torben Ægidius
2014-01-01
deallocation. This requires the language to be linear: A pointer can not be copied and it can only be eliminated by deallocating the node to which it points. We overcome this limitation by adding reference counts to nodes: Copying a pointer to a node increases the reference count of the node and eliminating...
Coinductive counting with weighted automata
Rutten, J.J.M.M.
2002-01-01
A general methodology is developed to compute the solution of a wide variety of basic counting problems in a uniform way: (1) the objects to be counted are enumerated by means of an infinite weighted automaton; (2) the automaton is reduced by means of the quantitative notion of stream bisimulation;
Symptoms Low white blood cell count By Mayo Clinic Staff A low white blood cell count (leukopenia) is a decrease in disease-fighting cells ( ... a decrease in a certain type of white blood cell (neutrophil). The definition of low white blood cell ...
Hanford whole body counting manual
Palmer, H.E.; Brim, C.P.; Rieksts, G.A.; Rhoads, M.C.
1987-05-01
This document, a reprint of the Whole Body Counting Manual, was compiled to train personnel, document operation procedures, and outline quality assurance procedures. The current manual contains information on: the location, availability, and scope of services of Hanford's whole body counting facilities; the administrative aspect of the whole body counting operation; Hanford's whole body counting facilities; the step-by-step procedure involved in the different types of in vivo measurements; the detectors, preamplifiers and amplifiers, and spectroscopy equipment; the quality assurance aspect of equipment calibration and recordkeeping; data processing, record storage, results verification, report preparation, count summaries, and unit cost accounting; and the topics of minimum detectable amount and measurement accuracy and precision. 12 refs., 13 tabs.
Classification and regression trees
Breiman, Leo; Olshen, Richard A; Stone, Charles J
1984-01-01
The methodology used to construct tree structured rules is the focus of this monograph. Unlike many other statistical procedures, which moved from pencil and paper to calculators, this text's use of trees was unthinkable before computers. Both the practical and theoretical sides have been developed in the authors' study of tree methods. Classification and Regression Trees reflects these two sides, covering the use of trees as a data analysis method, and in a more mathematical framework, proving some of their fundamental properties.
Linear algorithm for lexicographic enumeration of CFG parse trees
DONG YunMei
2009-01-01
We study CFG parse tree enumeration in this paper. By dividing the set of all parse trees into infinite hierarchies according to height of parse tree, the hierarchical lexicographic order on the set of parse trees is established. Then grammar-based algorithms for counting and enumerating CFG parse trees in this order are presented. To generate a parse tree of height n, the time complexity is O(n). If τ is a lowest parse tree for its yield, then O(n) =O(‖τ‖ +1), where ‖τ‖ is the length of the sentence (yield) generated by τ. The sentence can be obtained as a by-product of the parse tree. To compute sentence from its parse tree (needn't be lowest one), the time complexity is O(node)+O(‖τ‖ +1), where node is the number of non-leaf nodes of parse tree τ. To generate both a complete lowest parse tree and its yield at the same time, the time complexity is O(‖τ‖ +1).
The origins of counting algorithms.
Cantlon, Jessica F; Piantadosi, Steven T; Ferrigno, Stephen; Hughes, Kelly D; Barnard, Allison M
2015-06-01
Humans' ability to count by verbally labeling discrete quantities is unique in animal cognition. The evolutionary origins of counting algorithms are not understood. We report that nonhuman primates exhibit a cognitive ability that is algorithmically and logically similar to human counting. Monkeys were given the task of choosing between two food caches. First, they saw one cache baited with some number of food items, one item at a time. Then, a second cache was baited with food items, one at a time. At the point when the second set was approximately equal to the first set, the monkeys spontaneously moved to choose the second set even before that cache was completely baited. Using a novel Bayesian analysis, we show that the monkeys used an approximate counting algorithm for comparing quantities in sequence that is incremental, iterative, and condition controlled. This proto-counting algorithm is structurally similar to formal counting in humans and thus may have been an important evolutionary precursor to human counting. © The Author(s) 2015.
High Count Rate Single Photon Counting Detector Array Project
National Aeronautics and Space Administration — An optical communications receiver requires efficient and high-rate photon-counting capability so that the information from every photon, received at the aperture,...
Vote Counting as Mathematical Proof
Schürmann, Carsten; Pattinson, Dirk
2015-01-01
Trust in the correctness of an election outcome requires proof of the correctness of vote counting. By formalising particular voting protocols as rules, correctness of vote counting amounts to verifying that all rules have been applied correctly. A proof of the outcome of any particular election......-based formalisation of voting protocols inside a theorem prover, we synthesise vote counting programs that are not only provably correct, but also produce independently verifiable certificates. These programs are generated from a (formal) proof that every initial set of ballots allows to decide the election winner...
White blood cell counting system
1972-01-01
The design, fabrication, and tests of a prototype white blood cell counting system for use in the Skylab IMSS are presented. The counting system consists of a sample collection subsystem, sample dilution and fluid containment subsystem, and a cell counter. Preliminary test results show the sample collection and the dilution subsystems are functional and fulfill design goals. Results for the fluid containment subsystem show the handling bags cause counting errors due to: (1) adsorption of cells to the walls of the container, and (2) inadequate cleaning of the plastic bag material before fabrication. It was recommended that another bag material be selected.
Butler, Ricky W.; Boerschlein, David P.
1993-01-01
Fault-Tree Compiler (FTC) program, is software tool used to calculate probability of top event in fault tree. Gates of five different types allowed in fault tree: AND, OR, EXCLUSIVE OR, INVERT, and M OF N. High-level input language easy to understand and use. In addition, program supports hierarchical fault-tree definition feature, which simplifies tree-description process and reduces execution time. Set of programs created forming basis for reliability-analysis workstation: SURE, ASSIST, PAWS/STEM, and FTC fault-tree tool (LAR-14586). Written in PASCAL, ANSI-compliant C language, and FORTRAN 77. Other versions available upon request.
Allegheny County / City of Pittsburgh / Western PA Regional Data Center — The Make My Trip Count (MMTC) commuter survey, conducted in September and October 2015 by GBA, the Pittsburgh 2030 District, and 10 other regional transportation...
Categorizing Ideas about Trees: A Tree of Trees
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. PMID:23950877
Chanier, Thomas
2015-01-01
The Maya were known for their astronomical proficiency. This is demonstrated in the Mayan codices where ritual practices were related to astronomical events/predictions. Whereas Mayan mathematics were based on a vigesimal system, they used a different base when dealing with long periods of time, the Long Count Calendar (LCC), composed of different Long Count Periods: the Tun of 360 days, the Katun of 7200 days and the Baktun of 144000 days. There were two other calendars used in addition to t...
Counting Word Frequencies with Python
William J. Turkel
2012-07-01
Full Text Available Your list is now clean enough that you can begin analyzing its contents in meaningful ways. Counting the frequency of specific words in the list can provide illustrative data. Python has an easy way to count frequencies, but it requires the use of a new type of variable: the dictionary. Before you begin working with a dictionary, consider the processes used to calculate frequencies in a list.
Mining tree-query associations in graphs
Hoekx, Eveline
2010-01-01
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasetsstructured as graphs. We introduce a novel class of tree-shapedpatterns called tree queries, and present algorithms for miningtree queries and tree-query associations in a large data graph. Novel about our class of patterns is that they can containconstants, and can contain existential nodes which are not counted when determining the number of occurrences of the patternin the data graph. Our algorithms have a number of provableoptimality properties, which are based on the theory of conjunctive database queries. We propose a practical, database-oriented implementation in SQL, and show that the approach works in practice through experiments on data about food webs, protein interactions, and citation analysis.
Yen Hung Chen
2012-01-01
minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper, we present two polynomial time approximation schemes (PTASs for the constrained minimum spanning tree problem.
Making Tree Ensembles Interpretable
Hara, Satoshi; Hayashi, Kohei
2016-01-01
Tree ensembles, such as random forest and boosted trees, are renowned for their high prediction performance, whereas their interpretability is critically limited. In this paper, we propose a post processing method that improves the model interpretability of tree ensembles. After learning a complex tree ensembles in a standard way, we approximate it by a simpler model that is interpretable for human. To obtain the simpler model, we derive the EM algorithm minimizing the KL divergence from the ...
Mitchell, William
1992-01-01
This paper, dating from May 1991, contains preliminary (and unpublishable) notes on investigations about iteration trees. They will be of interest only to the specialist. In the first two sections I define notions of support and embeddings for tree iterations, proving for example that every tree iteration is a direct limit of finite tree iterations. This is a generalization to models with extenders of basic ideas of iterated ultrapowers using only ultrapowers. In the final section (which is m...
Baumbach, Jan; Guo, Jian-Ying; Ibragimov, Rashid
2013-01-01
We study the tree edit distance problem with edge deletions and edge insertions as edit operations. We reformulate a special case of this problem as Covering Tree with Stars (CTS): given a tree T and a set of stars, can we connect the stars in by adding edges between them such that the resulting ...
Baumbach, Jan; Guo, Jiong; Ibragimov, Rashid
2015-01-01
We study the tree edit distance problem with edge deletions and edge insertions as edit operations. We reformulate a special case of this problem as Covering Tree with Stars (CTS): given a tree T and a set of stars, can we connect the stars in by adding edges between them such that the resulting ...
Engelfriet, Joost; Vogler, Heiko
1985-01-01
Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled. In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical
Sweeney, Debra; Rounds, Judy
2011-01-01
Trees are great inspiration for artists. Many art teachers find themselves inspired and maybe somewhat obsessed with the natural beauty and elegance of the lofty tree, and how it changes through the seasons. One such tree that grows in several regions and always looks magnificent, regardless of the time of year, is the birch. In this article, the…
Finbow, Arthur; Frendrup, Allan; Vestergaard, Preben D.
cardinality then G is a total well dominated graph. In this paper we study composition and decomposition of total well dominated trees. By a reversible process we prove that any total well dominated tree can both be reduced to and constructed from a family of three small trees....
Brooks, Sarah DeWitt
2010-01-01
This article describes the author's experience in implementing a Wish Tree project in her school in an effort to bring the school community together with a positive art-making experience during a potentially stressful time. The concept of a wish tree is simple: plant a tree; provide tags and pencils for writing wishes; and encourage everyone to…
Brooks, Sarah DeWitt
2010-01-01
This article describes the author's experience in implementing a Wish Tree project in her school in an effort to bring the school community together with a positive art-making experience during a potentially stressful time. The concept of a wish tree is simple: plant a tree; provide tags and pencils for writing wishes; and encourage everyone to…
Engelfriet, Joost; Vogler, Heiko
1985-01-01
Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled. In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical
Hanford whole body counting manual
Palmer, H.E.; Rieksts, G.A.; Lynch, T.P.
1990-06-01
This document describes the Hanford Whole Body Counting Program as it is administered by Pacific Northwest Laboratory (PNL) in support of the US Department of Energy--Richland Operations Office (DOE-RL) and its Hanford contractors. Program services include providing in vivo measurements of internally deposited radioactivity in Hanford employees (or visitors). Specific chapters of this manual deal with the following subjects: program operational charter, authority, administration, and practices, including interpreting applicable DOE Orders, regulations, and guidance into criteria for in vivo measurement frequency, etc., for the plant-wide whole body counting services; state-of-the-art facilities and equipment used to provide the best in vivo measurement results possible for the approximately 11,000 measurements made annually; procedures for performing the various in vivo measurements at the Whole Body Counter (WBC) and related facilities including whole body counts; operation and maintenance of counting equipment, quality assurance provisions of the program, WBC data processing functions, statistical aspects of in vivo measurements, and whole body counting records and associated guidance documents. 16 refs., 48 figs., 22 tabs.
Degyi
2008-01-01
Trees are flourishing in Lhasa wherever the history exists. There is such a man. He has already been through cus-toms after his annual trek to Lhasa, which he has been doing for over twenty years in succession to visit his tree.Although he has been making this journey for so long,it is neither to visit friends or family,nor is it his hometown.It is a tree that is tied so profoundly to his heart.When the wind blows fiercely on the bare tree and winter snow falls,he stands be-fore the tree with tears of jo...
Morozov, Dmitriy; Weber, Gunther H.
2014-03-31
Topological techniques provide robust tools for data analysis. They are used, for example, for feature extraction, for data de-noising, and for comparison of data sets. This chapter concerns contour trees, a topological descriptor that records the connectivity of the isosurfaces of scalar functions. These trees are fundamental to analysis and visualization of physical phenomena modeled by real-valued measurements. We study the parallel analysis of contour trees. After describing a particular representation of a contour tree, called local{global representation, we illustrate how di erent problems that rely on contour trees can be solved in parallel with minimal communication.
Rollinson, Susan Wells
2012-01-01
The growth of a pine tree is examined by preparing "tree cookies" (cross-sectional disks) between whorls of branches. The use of Christmas trees allows the tree cookies to be obtained with inexpensive, commonly available tools. Students use the tree cookies to investigate the annual growth of the tree and how it corresponds to the number of whorls…
Rollinson, Susan Wells
2012-01-01
The growth of a pine tree is examined by preparing "tree cookies" (cross-sectional disks) between whorls of branches. The use of Christmas trees allows the tree cookies to be obtained with inexpensive, commonly available tools. Students use the tree cookies to investigate the annual growth of the tree and how it corresponds to the number of whorls…
VersaCount: customizable manual tally software for cell counting
DeRisi Joseph L
2010-01-01
Full Text Available Abstract Background The manual counting of cells by microscopy is a commonly used technique across biological disciplines. Traditionally, hand tally counters have been used to track event counts. Although this method is adequate, there are a number of inefficiencies which arise when managing large numbers of samples or large sample sizes. Results We describe software that mimics a traditional multi-register tally counter. Full customizability allows operation on any computer with minimal hardware requirements. The efficiency of counting large numbers of samples and/or large sample sizes is improved through the use of a "multi-count" register that allows single keystrokes to correspond to multiple events. Automatically updated multi-parameter values are implemented as user-specified equations, reducing errors and time required for manual calculations. The user interface was optimized for use with a touch screen and numeric keypad, eliminating the need for a full keyboard and mouse. Conclusions Our software provides an inexpensive, flexible, and productivity-enhancing alternative to manual hand tally counters.
Programming macro tree transducers
Bahr, Patrick; Day, Laurence E.
2013-01-01
A tree transducer is a set of mutually recursive functions transforming an input tree into an output tree. Macro tree transducers extend this recursion scheme by allowing each function to be defined in terms of an arbitrary number of accumulation parameters. In this paper, we show how macro tree...... transducers can be concisely represented in Haskell, and demonstrate the benefits of utilising such an approach with a number of examples. In particular, tree transducers afford a modular programming style as they can be easily composed and manipulated. Our Haskell representation generalises the original...... definition of (macro) tree transducers, abolishing a restriction on finite state spaces. However, as we demonstrate, this generalisation does not affect compositionality....
Programming macro tree transducers
Bahr, Patrick; Day, Laurence E.
2013-01-01
A tree transducer is a set of mutually recursive functions transforming an input tree into an output tree. Macro tree transducers extend this recursion scheme by allowing each function to be defined in terms of an arbitrary number of accumulation parameters. In this paper, we show how macro tree...... transducers can be concisely represented in Haskell, and demonstrate the benefits of utilising such an approach with a number of examples. In particular, tree transducers afford a modular programming style as they can be easily composed and manipulated. Our Haskell representation generalises the original...... definition of (macro) tree transducers, abolishing a restriction on finite state spaces. However, as we demonstrate, this generalisation does not affect compositionality....
The Origins of Counting Algorithms
Cantlon, Jessica F.; Piantadosi, Steven T.; Ferrigno, Stephen; Hughes, Kelly D.; Allison M Barnard
2015-01-01
Humans’ ability to ‘count’ by verbally labeling discrete quantities is unique in animal cognition. The evolutionary origins of counting algorithms are not understood. We report that non-human primates exhibit a cognitive ability that is algorithmically and logically similar to human counting. Monkeys were given the task of choosing between two food caches. Monkeys saw one cache baited with some number of food items, one item at a time. Then, a second cache was baited with food items, one at a...
Koop, G.; Dik, N; Nielen, M; Lipman, L. J. A.
2010-01-01
The aims of this study were to assess how different bacterial groups in bulk milk are related to bulk milk somatic cell count (SCC), bulk milk total bacterial count (TBC), and bulk milk standard plate count (SPC) and to measure the repeatability of bulk milk culturing. On 53 Dutch dairy goat farms, 3 bulk milk samples were collected at intervals of 2 wk. The samples were cultured for SPC, coliform count, and staphylococcal count and for the presence of Staphylococcus aureus. Furthermore, SCC ...
KIDS COUNT New Hampshire, 2000.
Shemitz, Elllen, Ed.
This Kids Count report presents statewide trends in the well-being of New Hampshire's children. The statistical report is based on 22 indicators of child well-being in 5 interrelated areas: (1) children and families (including child population, births, children living with single parent, and children experiencing parental divorce); (2) economic…
Counting a Culture of Mealworms
Ashbrook, Peggy
2007-01-01
Math is not the only topic that will be discussed when young children are asked to care for and count "mealworms," a type of insect larvae (just as caterpillars are the babies of butterflies, these larvae are babies of beetles). The following activity can take place over two months as the beetles undergo metamorphosis from larvae to adults. As the…
Verbal Counting in Bilingual Contexts
Donevska-Todorova, Ana
2015-01-01
Informal experiences in mathematics often include playful competitions among young children in counting numbers in as many as possible different languages. Can these enjoyable experiences result with excellence in the formal processes of education? This article discusses connections between mathematical achievements and natural languages within…
Shakespeare Live! and Character Counts.
Brookshire, Cathy A.
This paper discusses a live production of Shakespeare's "Macbeth" (in full costume but with no sets) for all public middle school and high school students in Harrisonburg and Rockingham, Virginia. The paper states that the "Character Counts" issues that are covered in the play are: decision making, responsibility and…
On Counting the Rational Numbers
Almada, Carlos
2010-01-01
In this study, we show how to construct a function from the set N of natural numbers that explicitly counts the set Q[superscript +] of all positive rational numbers using a very intuitive approach. The function has the appeal of Cantor's function and it has the advantage that any high school student can understand the main idea at a glance…
Counting problems for number rings
Brakenhoff, Johannes Franciscus
2009-01-01
In this thesis we look at three counting problems connected to orders in number fields. First we study the probability that for a random polynomial f in Z[X] the ring Z[X]/f is the maximal order in Q[X]/f. Connected to this is the probability that a random polynomial has a squarefree discriminant. T
Counting a Culture of Mealworms
Ashbrook, Peggy
2007-01-01
Math is not the only topic that will be discussed when young children are asked to care for and count "mealworms," a type of insect larvae (just as caterpillars are the babies of butterflies, these larvae are babies of beetles). The following activity can take place over two months as the beetles undergo metamorphosis from larvae to adults. As the…
Pattern Avoidance in Ternary Trees
Gabriel, Nathan; Pudwell, Lara; Tay, Samuel
2011-01-01
This paper considers the enumeration of ternary trees (i.e. rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree patterns; then, for more complex trees, we compute generating functions by extending a known algorithm for pattern-avoiding binary trees. Next, we present an alternate one-dimensional notation for trees which we use to find bijections that explain why certain pairs of tree patterns yield the same avoidance generating function. Finally, we compare our bijections to known "replacement rules" for binary trees and generalize these bijections to a larger class of trees.
Teaching Emotionally Disturbed Students to Count Feelings.
Bartels, Cynthia S.; Calkin, Abigail B.
The paper describes a program to teach high school students with emotional and behavior problems to count their feelings, thereby improving their self concept. To aid in instruction, a hierarchy was developed which involved four phases: counting tasks completed and tasks not completed, counting independent actions in class, counting perceptions of…
Predictive Model Assessment for Count Data
2007-09-05
critique count regression models for patent data, and assess the predictive performance of Bayesian age-period-cohort models for larynx cancer counts...the predictive performance of Bayesian age-period-cohort models for larynx cancer counts in Germany. We consider a recent suggestion by Baker and...Figure 5. Boxplots for various scores for patent data count regressions. 11 Table 1 Four predictive models for larynx cancer counts in Germany, 1998–2002
Blundell, Charles; Heller, Katherine A
2012-01-01
Hierarchical structure is ubiquitous in data across many domains. There are many hier- archical clustering methods, frequently used by domain experts, which strive to discover this structure. However, most of these meth- ods limit discoverable hierarchies to those with binary branching structure. This lim- itation, while computationally convenient, is often undesirable. In this paper we ex- plore a Bayesian hierarchical clustering algo- rithm that can produce trees with arbitrary branching structure at each node, known as rose trees. We interpret these trees as mixtures over partitions of a data set, and use a computationally efficient, greedy ag- glomerative algorithm to find the rose trees which have high marginal likelihood given the data. Lastly, we perform experiments which demonstrate that rose trees are better models of data than the typical binary trees returned by other hierarchical clustering algorithms.
Favre, Charles
2004-01-01
This volume is devoted to a beautiful object, called the valuative tree and designed as a powerful tool for the study of singularities in two complex dimensions. Its intricate yet manageable structure can be analyzed by both algebraic and geometric means. Many types of singularities, including those of curves, ideals, and plurisubharmonic functions, can be encoded in terms of positive measures on the valuative tree. The construction of these measures uses a natural tree Laplace operator of independent interest.
Cardona, Gabriel; Llabrés, Mercè; Rosselló, Francesc; Valiente, Gabriel
2011-01-01
Galled trees, directed acyclic graphs that model evolutionary histories with isolated hybridization events, have become very popular due to both their biological significance and the existence of polynomial-time algorithms for their reconstruction. In this paper, we establish to which extent several distance measures for the comparison of evolutionary networks are metrics for galled trees, and hence, when they can be safely used to evaluate galled tree reconstruction methods.
A theory of game trees, based on solution trees
W.H.L.M. Pijls (Wim); A. de Bruin (Arie); A. Plaat (Aske)
1996-01-01
textabstractIn this paper a complete theory of game tree algorithms is presented, entirely based upon the notion of a solution tree. Two types of solution trees are distinguished: max and min solution trees respectively. We show that most game tree algorithms construct a superposition of a max and a
A theory of game trees, based on solution trees
W.H.L.M. Pijls (Wim); A. de Bruin (Arie); A. Plaat (Aske)
1996-01-01
textabstractIn this paper a complete theory of game tree algorithms is presented, entirely based upon the notion of a solution tree. Two types of solution trees are distinguished: max and min solution trees respectively. We show that most game tree algorithms construct a superposition of a max and a
Brodal, Gerth Stølting; Sioutas, Spyros; Pantazos, Kostas;
2015-01-01
We present a new overlay, called the Deterministic Decentralized tree (D2-tree). The D2-tree compares favorably to other overlays for the following reasons: (a) it provides matching and better complexities, which are deterministic for the supported operations; (b) the management of nodes (peers......-balancing scheme of elements into nodes is deterministic and general enough to be applied to other hierarchical tree-based overlays. This load-balancing mechanism is based on an innovative lazy weight-balancing mechanism, which is interesting in its own right....
Sexton, Alan P
2010-01-01
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. To date, no algorithm has been published for the corresponding Delete operation. We believe this to be non-trivial because of the design of the M-tree's Insert algorithm. We propose a modification to Insert that overcomes this problem and give the corresponding Delete algorithm. The performance of the tree is comparable to the M-tree and offers additional benefits in terms of supported operations, which we briefly discuss.
Sitchinava, Nodar; Zeh, Norbert
2012-01-01
We present the parallel buffer tree, a parallel external memory (PEM) data structure for batched search problems. This data structure is a non-trivial extension of Arge's sequential buffer tree to a private-cache multiprocessor environment and reduces the number of I/O operations by the number...... of available processor cores compared to its sequential counterpart, thereby taking full advantage of multicore parallelism. The parallel buffer tree is a search tree data structure that supports the batched parallel processing of a sequence of N insertions, deletions, membership queries, and range queries...
Chanier, Thomas
2013-01-01
The Maya had a very elaborate and accurate calendar. First, the Mayan Long Count Calendar (LCC) was used to point historical events from a selected "beginning of time". It is also characterized by the existence of a religious month Tzolk'in of 260 days and a civic year Haab' of 365 days. The LCC is supposed to begin on 11 August -3114 BC known as the Goodman-Martinez-Thompson (GMT) correlation to the Gregorian calendar based on historical facts and end on 21 December 2012 corresponding to a period of approximately 5125 years or 13 Baktun. We propose here to explain the origin the 13 Baktun cycle, the Long Count Periods and the religious month Tzolk'in.
Counting Irreducible Double Occurrence Words
Burns, Jonathan
2011-01-01
A double occurrence word $w$ over a finite alphabet $\\Sigma$ is a word in which each alphabet letter appears exactly twice. Such words arise naturally in the study of topology, graph theory, and combinatorics. Recently, double occurrence words have been used for studying DNA recombination events. We develop formulas for counting and enumerating several elementary classes of double occurrence words such as palindromic, irreducible, and strongly-irreducible words.
Approximate Counting of Graphical Realizations.
Erdős, Péter L; Kiss, Sándor Z; Miklós, István; Soukup, Lajos
2015-01-01
In 1999 Kannan, Tetali and Vempala proposed a MCMC method to uniformly sample all possible realizations of a given graphical degree sequence and conjectured its rapidly mixing nature. Recently their conjecture was proved affirmative for regular graphs (by Cooper, Dyer and Greenhill, 2007), for regular directed graphs (by Greenhill, 2011) and for half-regular bipartite graphs (by Miklós, Erdős and Soukup, 2013). Several heuristics on counting the number of possible realizations exist (via sampling processes), and while they work well in practice, so far no approximation guarantees exist for such an approach. This paper is the first to develop a method for counting realizations with provable approximation guarantee. In fact, we solve a slightly more general problem; besides the graphical degree sequence a small set of forbidden edges is also given. We show that for the general problem (which contains the Greenhill problem and the Miklós, Erdős and Soukup problem as special cases) the derived MCMC process is rapidly mixing. Further, we show that this new problem is self-reducible therefore it provides a fully polynomial randomized approximation scheme (a.k.a. FPRAS) for counting of all realizations.
Approximate Counting of Graphical Realizations.
Péter L Erdős
Full Text Available In 1999 Kannan, Tetali and Vempala proposed a MCMC method to uniformly sample all possible realizations of a given graphical degree sequence and conjectured its rapidly mixing nature. Recently their conjecture was proved affirmative for regular graphs (by Cooper, Dyer and Greenhill, 2007, for regular directed graphs (by Greenhill, 2011 and for half-regular bipartite graphs (by Miklós, Erdős and Soukup, 2013. Several heuristics on counting the number of possible realizations exist (via sampling processes, and while they work well in practice, so far no approximation guarantees exist for such an approach. This paper is the first to develop a method for counting realizations with provable approximation guarantee. In fact, we solve a slightly more general problem; besides the graphical degree sequence a small set of forbidden edges is also given. We show that for the general problem (which contains the Greenhill problem and the Miklós, Erdős and Soukup problem as special cases the derived MCMC process is rapidly mixing. Further, we show that this new problem is self-reducible therefore it provides a fully polynomial randomized approximation scheme (a.k.a. FPRAS for counting of all realizations.
Monitoring Milk Somatic Cell Counts
Gheorghe Şteţca
2014-11-01
Full Text Available The presence of somatic cells in milk is a widely disputed issue in milk production sector. The somatic cell counts in raw milk are a marker for the specific cow diseases such as mastitis or swollen udder. The high level of somatic cells causes physical and chemical changes to milk composition and nutritional value, and as well to milk products. Also, the mastitic milk is not proper for human consumption due to its contribution to spreading of certain diseases and food poisoning. According to these effects, EU Regulations established the maximum threshold of admitted somatic cells in raw milk to 400000 cells / mL starting with 2014. The purpose of this study was carried out in order to examine the raw milk samples provided from small farms, industrial type farms and milk processing units. There are several ways to count somatic cells in milk but the reference accepted method is the microscopic method described by the SR EN ISO 13366-1/2008. Generally samples registered values in accordance with the admissible limit. By periodical monitoring of the somatic cell count, certain technological process issues are being avoided and consumer’s health ensured.
Manual and automated reticulocyte counts.
Simionatto, Mackelly; de Paula, Josiane Padilha; Chaves, Michele Ana Flores; Bortoloso, Márcia; Cicchetti, Domenic; Leonart, Maria Suely Soares; do Nascimento, Aguinaldo José
2010-12-01
Manual reticulocyte counts were examined under light microscopy, using the property whereby supravital stain precipitates residual ribosomal RNA versus the automated flow methods, with the suggestion that in the latter there is greater precision and an ability to determine both mature and immature reticulocyte fractions. Three hundred and forty-one venous blood samples of patients were analyzed of whom 224 newborn and the rest adults; 51 males and 66 females, with ages between 0 and 89 years, as part of the laboratory routine for hematological examinations at the Clinical Laboratory of the Hospital Universitário do Oeste do Paraná. This work aimed to compare manual and automated methodologies for reticulocyte countings and evaluate random and systematic errors. The results obtained showed that the difference between the two methods was very small, with an estimated 0·4% systematic error and 3·9% random error. Thus, it has been confirmed that both methods, when well conducted, can reflect precisely the reticulocyte counts for adequate clinical use.
J.R. Simpson; E.G. McPherson
2011-01-01
Urban trees can produce a number of benefits, among them improved air quality. Biogenic volatile organic compounds (BVOCs) emitted by some species are ozone precursors. Modifying future tree planting to favor lower-emitting species can reduce these emissions and aid air management districts in meeting federally mandated emissions reductions for these compounds. Changes...
Matching Subsequences in Trees
Bille, Philip; Gørtz, Inge Li
2009-01-01
Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new...
Structural Equation Model Trees
Brandmaier, Andreas M.; von Oertzen, Timo; McArdle, John J.; Lindenberger, Ulman
2013-01-01
In the behavioral and social sciences, structural equation models (SEMs) have become widely accepted as a modeling tool for the relation between latent and observed variables. SEMs can be seen as a unification of several multivariate analysis techniques. SEM Trees combine the strengths of SEMs and the decision tree paradigm by building tree…
Tree biology and dendrochemistry
Kevin T. Smith; Walter C. Shortle
1996-01-01
Dendrochemistry, the interpretation of elemental analysis of dated tree rings, can provide a temporal record of environmental change. Using the dendrochemical record requires an understanding of tree biology. In this review, we pose four questions concerning assumptions that underlie recent dendrochemical research: 1) Does the chemical composition of the wood directly...
The major tree nuts include almonds, Brazil nuts, cashew nuts, hazelnuts, macadamia nuts, pecans, pine nuts, pistachio nuts, and walnuts. Tree nut oils are appreciated in food applications because of their flavors and are generally more expensive than other gourmet oils. Research during the last de...
Detection of Citrus Trees from Uav Dsms
Ok, A. O.; Ozdarici-Ok, A.
2017-05-01
This paper presents an automated approach to detect citrus trees from digitals surface models (DSMs) as a single source. The DSMs in this study are generated from Unmanned Aerial Vehicles (UAVs), and the proposed approach first considers the symmetric nature of the citrus trees, and it computes the orientation-based radial symmetry in an efficient way. The approach also takes into account the local maxima (LM) information to verify the output of the radial symmetry. Our contributions in this study are twofold: (i) Such an integrated approach (symmetry + LM) has not been tested to detect (citrus) trees (in orchards), and (ii) the validity of such an integrated approach has not been experienced for an input, e.g. a single DSM. Experiments are performed on five test patches. The results reveal that our approach is capable of counting most of the citrus trees without manual intervention. Comparison to the state-of-the-art reveals that the proposed approach provides notable detection performance by providing the best balance between precision and recall measures.
Coded Splitting Tree Protocols
Sørensen, Jesper Hemming; Stefanovic, Cedomir; Popovski, Petar
2013-01-01
This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several instances of the tree splitting protocol are initiated, each...... instance is terminated prematurely and subsequently iterated. The combined set of leaves from all the tree instances can then be viewed as a graph code, which is decodable using belief propagation. The main design problem is determining the order of splitting, which enables successful decoding as early...... as possible. Evaluations show that the proposed protocol provides considerable gains over the standard tree splitting protocol applying SIC. The improvement comes at the expense of an increased feedback and receiver complexity....
Analysis of electrical tree propagation in XLPE power cable insulation
Bao Minghui, E-mail: baominghui@21cn.co [College of Electrical and Electronic Engineering, Huazhong University of Science and Technology, Wuhan (China); Yin Xiaogen; He Junjia [College of Electrical and Electronic Engineering, Huazhong University of Science and Technology, Wuhan (China)
2011-04-01
Electrical treeing is one of the major breakdown mechanisms for solid dielectrics subjected to high electrical stress. In this paper, the characteristics of electrical tree growth in XLPE samples have been investigated. XLPE samples are obtained from a commercial XLPE power cable, in which electrical trees have been grown from pin to plane in the frequency range of 4000-10,000 Hz, voltage range of 4-10 kV, and the distances between electrodes of 1 and 2 mm. Images of trees and their growing processes were taken by a CCD camera. The fractal dimensions of electric trees were obtained by using a simple box-counting technique. The results show that the tree growth rate and fractal dimension was bigger when the frequency or voltage was higher, or the distance between electrodes was smaller. Contrary to our expectation, it has been found that when the distance between electrodes changed from 1 to 2 mm, the required voltage of the similar electrical trees decreased only 1or 2 kV. In order to evaluate the difficulties of electrical tree propagation in different conditions, a simple energy threshold analysis method has been proposed. The threshold energy, which presents the minimum energy that a charge carrier in the well at the top of the tree should have to make the tree grow, has been computed considering the length of electrical tree, the fractal dimension, and the growth time. The computed results indicate that when one of the three parameters of voltage, frequency, and local electric field increase, the trends of energy threshold can be split into 3 regions.
Koop, G.; Dik, N.; Nielen, M.; Lipman, L.J.A.
2010-01-01
The aims of this study were to assess how different bacterial groups in bulk milk are related to bulk milk somatic cell count (SCC), bulk milk total bacterial count (TBC), and bulk milk standard plate count (SPC) and to measure the repeatability of bulk milk culturing. On 53 Dutch dairy goat farms,
Alaska Steller Sea Lion Pup Count Database
National Oceanic and Atmospheric Administration, Department of Commerce — This database contains counts of Steller sea lion pups on rookeries in Alaska made between 1961 and 2015. Pup counts are conducted in late June-July. Pups are...
CalCOFI Egg Counts Positive Tows
National Oceanic and Atmospheric Administration, Department of Commerce — Fish egg counts and standardized counts for eggs captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets], and...
CalCOFI Larvae Counts Positive Tows
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for eggs captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
Phylogenetic trees in bioinformatics
Burr, Tom L [Los Alamos National Laboratory
2008-01-01
Genetic data is often used to infer evolutionary relationships among a collection of viruses, bacteria, animal or plant species, or other operational taxonomic units (OTU). A phylogenetic tree depicts such relationships and provides a visual representation of the estimated branching order of the OTUs. Tree estimation is unique for several reasons, including: the types of data used to represent each OTU; the use ofprobabilistic nucleotide substitution models; the inference goals involving both tree topology and branch length, and the huge number of possible trees for a given sample of a very modest number of OTUs, which implies that fmding the best tree(s) to describe the genetic data for each OTU is computationally demanding. Bioinformatics is too large a field to review here. We focus on that aspect of bioinformatics that includes study of similarities in genetic data from multiple OTUs. Although research questions are diverse, a common underlying challenge is to estimate the evolutionary history of the OTUs. Therefore, this paper reviews the role of phylogenetic tree estimation in bioinformatics, available methods and software, and identifies areas for additional research and development.
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...
Böcker, Sebastian; Dührkop, Kai
2016-01-01
Untargeted metabolomics commonly uses liquid chromatography mass spectrometry to measure abundances of metabolites; subsequent tandem mass spectrometry is used to derive information about individual compounds. One of the bottlenecks in this experimental setup is the interpretation of fragmentation spectra to accurately and efficiently identify compounds. Fragmentation trees have become a powerful tool for the interpretation of tandem mass spectrometry data of small molecules. These trees are determined from the data using combinatorial optimization, and aim at explaining the experimental data via fragmentation cascades. Fragmentation tree computation does not require spectral or structural databases. To obtain biochemically meaningful trees, one needs an elaborate optimization function (scoring). We present a new scoring for computing fragmentation trees, transforming the combinatorial optimization into a Maximum A Posteriori estimator. We demonstrate the superiority of the new scoring for two tasks: both for the de novo identification of molecular formulas of unknown compounds, and for searching a database for structurally similar compounds, our method SIRIUS 3, performs significantly better than the previous version of our method, as well as other methods for this task. SIRIUS 3 can be a part of an untargeted metabolomics workflow, allowing researchers to investigate unknowns using automated computational methods.Graphical abstractWe present a new scoring for computing fragmentation trees from tandem mass spectrometry data based on Bayesian statistics. The best scoring fragmentation tree most likely explains the molecular formula of the measured parent ion.
DC KIDS COUNT e-Databook Indicators
DC Action for Children, 2012
2012-01-01
This report presents indicators that are included in DC Action for Children's 2012 KIDS COUNT e-databook, their definitions and sources and the rationale for their selection. The indicators for DC KIDS COUNT represent a mix of traditional KIDS COUNT indicators of child well-being, such as the number of children living in poverty, and indicators of…
Monte Carlo Simulation of Counting Experiments.
Ogden, Philip M.
A computer program to perform a Monte Carlo simulation of counting experiments was written. The program was based on a mathematical derivation which started with counts in a time interval. The time interval was subdivided to form a binomial distribution with no two counts in the same subinterval. Then the number of subintervals was extended to…
Digital coincidence counting - initial results
Butcher, K. S. A.; Watt, G. C.; Alexiev, D.; van der Gaast, H.; Davies, J.; Mo, Li; Wyllie, H. A.; Keightley, J. D.; Smith, D.; Woods, M. J.
2000-08-01
Digital Coincidence Counting (DCC) is a new technique in radiation metrology, based on the older method of analogue coincidence counting. It has been developed by the Australian Nuclear Science and Technology Organisation (ANSTO), in collaboration with the National Physical Laboratory (NPL) of the United Kingdom, as a faster more reliable means of determining the activity of ionising radiation samples. The technique employs a dual channel analogue-to-digital converter acquisition system for collecting pulse information from a 4π beta detector and an NaI(Tl) gamma detector. The digitised pulse information is stored on a high-speed hard disk and timing information for both channels is also stored. The data may subsequently be recalled and analysed using software-based algorithms. In this letter we describe some recent results obtained with the new acquistion hardware being tested at ANSTO. The system is fully operational and is now in routine use. Results for 60Co and 22Na radiation activity calibrations are presented, initial results with 153Sm are also briefly mentioned.
Fan Aihua
2004-01-01
The vertices of an infinite locally finite tree T are labelled by a collection of i.i.d. real random variables {Xσ}σ∈T which defines a tree indexed walk Sσ = ∑θ＜r≤σXr. We introduce and study the oscillations of the walk:Exact Hausdorff dimension of the set of such ξ 's is calculated. An application is given to study the local variation of Brownian motion. A general limsup deviation problem on trees is also studied.
How much do women count if they not counted?
Federica Taddia
2006-01-01
Full Text Available The condition of women throughout the world is marked by countless injustices and violations of the most fundamental rights established by the Universal Declaration of human rights and every culture is potentially prone to commit discrimination against women in various forms. Women are worse fed, more exposed to physical violence, more exposed to diseases and less educated; they have less access to, or are excluded from, vocational training paths; they are the most vulnerable among prisoners of conscience, refugees and immigrants and the least considered within ethnic minorities; from their very childhood, women are humiliated, undernourished, sold, raped and killed; their work is generally less paid compared to men’s work and in some countries they are victims of forced marriages. Such condition is the result of old traditions that implicit gender-differentiated education has long promoted through cultural models based on theories, practices and policies marked by discrimination and structured differentially for men and women. Within these cultural models, the basic educational institutions have played and still play a major role in perpetuating such traditions. Nevertheless, if we want to overcome inequalities and provide women with empowerment, we have to start right from the educational institutions and in particular from school, through the adoption of an intercultural approach to education: an approach based on active pedagogy and on methods of analysis, exchange and enhancement typical of socio-educational animation. The intercultural approach to education is attentive to promote the realisation of each individual and the dignity and right of everyone to express himself/herself in his/her own way. Such an approach will give women the opportunity to become actual agents of collective change and to get the strength and wellbeing necessary to count and be counted as human beings entitled to freedom and equality, and to have access to all
Ferrenberg, Scott; Kane, Jeffrey M; Mitton, Jeffry B
2014-04-01
Bark beetles have recently killed billions of trees, yet conifer defenses are formidable and some trees resist attack. A primary anti-insect defense of pines is oleoresin from a system of resin ducts throughout the tree. Resin defense traits are heritable, and evidence suggests that resin duct characteristics are associated with resistance to insects. However, comparisons of resin ducts in trees killed by bark beetles to trees that resisted attack are unavailable. We compared vertical resin duct characteristics (number, density, and size) and growth rates from trees that were "resistant" (survived mass attack) versus "susceptible" (killed by attack) to bark beetles in lodgepole (Pinus contorta) and limber (Pinus flexilis) pines. Resistant trees of both species had significantly more resin ducts in recent growth than susceptible trees. Discriminant analysis (DA) correctly categorized 84% of lodgepole and 92% of limber pines as susceptible/resistant based on combinations of resin duct and growth characteristics from recent 5- through 20-year growth intervals. DA models using measures from only the most recent 5 years of growth correctly categorized 72 and 81% of lodgepole and limber pines, respectively. Comparing resistant to susceptible trees independent of species identity led to the correct categorization of 82% of trees based on factors from 5- to 20-year intervals, and 73% of trees using only resin duct counts from the most recent 5 years. We conclude that resin duct characteristics can be used to assess tree resistance to bark beetles across pine species, and offer a metric for management to enhance pest resistance.
Tree-growth analyses to estimate tree species' drought tolerance
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 specie
Generalising tree traversals and tree transformations to DAGs
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...
Automatic cell counting with ImageJ.
Grishagin, Ivan V
2015-03-15
Cell counting is an important routine procedure. However, to date there is no comprehensive, easy to use, and inexpensive solution for routine cell counting, and this procedure usually needs to be performed manually. Here, we report a complete solution for automatic cell counting in which a conventional light microscope is equipped with a web camera to obtain images of a suspension of mammalian cells in a hemocytometer assembly. Based on the ImageJ toolbox, we devised two algorithms to automatically count these cells. This approach is approximately 10 times faster and yields more reliable and consistent results compared with manual counting.
Student interpretations of phylogenetic trees in an introductory biology course.
Dees, Jonathan; Momsen, Jennifer L; Niemi, Jarad; Montplaisir, Lisa
2014-01-01
Phylogenetic trees are widely used visual representations in the biological sciences and the most important visual representations in evolutionary biology. Therefore, phylogenetic trees have also become an important component of biology education. We sought to characterize reasoning used by introductory biology students in interpreting taxa relatedness on phylogenetic trees, to measure the prevalence of correct taxa-relatedness interpretations, and to determine how student reasoning and correctness change in response to instruction and over time. Counting synapomorphies and nodes between taxa were the most common forms of incorrect reasoning, which presents a pedagogical dilemma concerning labeled synapomorphies on phylogenetic trees. Students also independently generated an alternative form of correct reasoning using monophyletic groups, the use of which decreased in popularity over time. Approximately half of all students were able to correctly interpret taxa relatedness on phylogenetic trees, and many memorized correct reasoning without understanding its application. Broad initial instruction that allowed students to generate inferences on their own contributed very little to phylogenetic tree understanding, while targeted instruction on evolutionary relationships improved understanding to some extent. Phylogenetic trees, which can directly affect student understanding of evolution, appear to offer introductory biology instructors a formidable pedagogical challenge.
Larson, David; Jacob, Sharon E
2012-01-01
Tea tree oil is an increasingly popular ingredient in a variety of household and cosmetic products, including shampoos, massage oils, skin and nail creams, and laundry detergents. Known for its potential antiseptic properties, it has been shown to be active against a variety of bacteria, fungi, viruses, and mites. The oil is extracted from the leaves of the tea tree via steam distillation. This essential oil possesses a sharp camphoraceous odor followed by a menthol-like cooling sensation. Most commonly an ingredient in topical products, it is used at a concentration of 5% to 10%. Even at this concentration, it has been reported to induce contact sensitization and allergic contact dermatitis reactions. In 1999, tea tree oil was added to the North American Contact Dermatitis Group screening panel. The latest prevalence rates suggest that 1.4% of patients referred for patch testing had a positive reaction to tea tree oil.
Minnesota Department of Natural Resources — The National Land Cover Database 2001 tree canopy layer for Minnesota (mapping zones 39-42, 50-51) was produced through a cooperative project conducted by the...
Kelly, K.; White, K.
1981-03-01
An important harvesting alternative in North America is the Full Tree Method, in which trees are felled and transported to roadside, intermediate or primary landings with limbs and branches intact. The acceptance of Full Tree Systems is due to many factors including: labour productivity and increased demands on the forest for ''new products''. These conditions are shaping the future look for forest Harvesting Systems, but must not be the sole determinants. All harvesting implications, such as those affecting Productivity and silviculture, should be thoroughly understood. This paper does not try to discuss every implication, nor any particular one in depth; its purpose is to highlight those areas requiring consideration and to review several current North American Full Tree Systems. (Refs. 5).
1981-01-01
to be Evaluated Manufacturer Location Seismic Susceptibility Flood Susceptibility Temperature Humidity Radiation Wear-out Susceptibility Test...For the category " Seismic Susceptibility," we might define several sensitivity levels ranging from no sensitivity to extreme sensitivity, and for more... Hanford Company, Richland, Wash- ington, ARH-ST-l 12, July 1975. 40. W.E. Vesely, "Analysis of Fault Trees by Kinetic Tree Theory," Idaho Nuclear
Somchaipeng, Kerawit; Sporring, Jon; Johansen, Peter
2007-01-01
We propose MultiScale Singularity Trees (MSSTs) as a structure to represent images, and we propose an algorithm for image comparison based on comparing MSSTs. The algorithm is tested on 3 public image databases and compared to 2 state-of-theart methods. We conclude that the computational complexity...... of our algorithm only allows for the comparison of small trees, and that the results of our method are comparable with state-of-the-art using much fewer parameters for image representation....
Schmidt, Lars Holger
Forest tree improvement encompasses a number of scientific and technical areas like floral-, reproductive- and micro-biology, genetics breeding methods and strategies, propagation, gene conservation, data analysis and statistics, each area with a comprehensive terminology. The terms selected...... for definition here are those most frequently used in tree improvement literature. Clonal propagation is included in the view of the great expansion of that field as a means of mass multiplication of improved material....
A practical O(n log2 i>n>) time algorithm for computing the triplet distance on binary trees
Sand, Andreas; Brodal, Gerth Stølting; Fagerberg, Rolf;
2013-01-01
The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two ...
Discrete calculus methods for counting
Mariconda, Carlo
2016-01-01
This book provides an introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find not only coverage of the basic elements of the subjects but also deep insights into a range of less common topics rarely considered within a single book, such as counting with occupancy constraints, a clear distinction between algebraic and analytical properties of formal power series, an introduction to discrete dynamical systems with a thorough description of Sarkovskii’s theorem, symbolic calculus, and a complete description of the Euler-Maclaurin formulas and their applications. Although several books touch on one or more of these aspects, precious few cover all of them. The authors, both pure mathematicians, have attempted to develop methods that will allow the student to formulate a given problem in a precise mathematical framework. The aim is to equip readers with a sound strategy for classifying and solving problems by pursuing a mathematically rigorous yet ...
Photon counting compressive depth mapping
Howland, Gregory A; Ware, Matthew R; Howell, John C
2013-01-01
We demonstrate a compressed sensing, photon counting lidar system based on the single-pixel camera. Our technique recovers both depth and intensity maps from a single under-sampled set of incoherent, linear projections of a scene of interest at ultra-low light levels around 0.5 picowatts. Only two-dimensional reconstructions are required to image a three-dimensional scene. We demonstrate intensity imaging and depth mapping at 256 x 256 pixel transverse resolution with acquisition times as short as 3 seconds. We also show novelty filtering, reconstructing only the difference between two instances of a scene. Finally, we acquire 32 x 32 pixel real-time video for three-dimensional object tracking at 14 frames-per-second.
Generalized Entropy Concentration for Counts
Oikonomou, Kostas N
2016-01-01
We consider the phenomenon of entropy concentration under linear constraints in a discrete setting, using the "balls and bins" paradigm, but without the assumption that the number of balls allocated to the bins is known. Therefore instead of \\ frequency vectors and ordinary entropy, we have count vectors with unknown sum, and a certain generalized entropy. We show that if the constraints bound the allowable sums, this suffices for concentration to occur even in this setting. The concentration can be either in terms of deviation from the maximum generalized entropy value, or in terms of the norm of the difference from the maximum generalized entropy vector. Without any asymptotic considerations, we quantify the concentration in terms of various parameters, notably a tolerance on the constraints which ensures that they are always satisfied by an integral vector. Generalized entropy maximization is not only compatible with ordinary MaxEnt, but can also be considered an extension of it, as it allows us to address...
Manwani, Naresh
2010-01-01
In this paper we present a new algorithm for learning oblique decision trees. Most of the current decision tree algorithms rely on impurity measures to assess the goodness of hyperplanes at each node while learning a decision tree in a top-down fashion. These impurity measures do not properly capture the geometric structures in the data. Motivated by this, our algorithm uses a strategy to assess the hyperplanes in such a way that the geometric structure in the data is taken into account. At each node of the decision tree, we find the clustering hyperplanes for both the classes and use their angle bisectors as the split rule at that node. We show through empirical studies that this idea leads to small decision trees and better performance. We also present some analysis to show that the angle bisectors of clustering hyperplanes that we use as the split rules at each node, are solutions of an interesting optimization problem and hence argue that this is a principled method of learning a decision tree.
2014-01-01
With a view to creating new landscapes and making its population of trees safer and healthier, this winter CERN will complete the tree-felling campaign started in 2010. Tree felling will take place between 15 and 22 November on the Swiss part of the Meyrin site. This work is being carried out above all for safety reasons. The trees to be cut down are at risk of falling as they are too old and too tall to withstand the wind. In addition, the roots of poplar trees are very powerful and spread widely, potentially damaging underground networks, pavements and roadways. Compensatory tree planting campaigns will take place in the future, subject to the availability of funding, with the aim of creating coherent landscapes while also respecting the functional constraints of the site. These matters are being considered in close collaboration with the Geneva nature and countryside directorate (Direction générale de la nature et du paysage, DGNP). GS-SE Group
Attack Trees with Sequential Conjunction
Jhawar, Ravi; Kordy, Barbara; Mauw, Sjouke; Radomirović, Sasa; Trujillo-Rasua, Rolando
2015-01-01
We provide the first formal foundation of SAND attack trees which are a popular extension of the well-known attack trees. The SAND at- tack tree formalism increases the expressivity of attack trees by intro- ducing the sequential conjunctive operator SAND. This operator enables the modeling of
On the neighbourhoods of trees
Humphries, Peter J
2012-01-01
Tree rearrangement operations typically induce a metric on the space of phylogenetic trees. One important property of these metrics is the size of the neighbourhood, that is, the number of trees exactly one operation from a given tree. We present an expression for the size of the TBR (tree bisection and reconnection) neighbourhood, thus answering a question first posed in [Annals of Combinatorics, 5, 2001 1-15].
Development of young oil palm tree recognition using Haar- based rectangular windows
Daliman, S.; Abu-Bakar, S. A. R.; Nor Azam, S. H. Md
2016-06-01
This paper presents development of Haar-based rectangular windows for recognition of young oil palm tree based on WorldView-2 imagery data. Haar-based rectangular windows or also known as Haar-like rectangular features have been popular in face recognition as used in Viola-Jones object detection framework. Similar to face recognition, the oil palm tree recognition would also need a suitable Haar-based rectangular windows that best suit to the characteristics of oil palm tree. A set of seven Haar-based rectangular windows have been designed to better match specifically the young oil palm tree as the crown size is much smaller compared to the matured ones. Determination of features for oil palm tree is an essential task to ensure a high successful rate of correct oil palm tree detection. Furthermore, features that reflects the identification of oil palm tree indicate distinctiveness between an oil palm tree and other objects in the image such as buildings, roads and drainage. These features will be trained using support vector machine (SVM) to model the oil palm tree for classifying the testing set and subimages of WorldView-2 imagery data. The resulting classification of young oil palm tree with sensitivity of 98.58% and accuracy of 92.73% shows a promising result that it can be used for intention of developing automatic young oil palm tree counting.
Maxwell, Justin T.; Harley, Grant L.
2016-10-01
Understanding the historic variability in the hydroclimate provides important information on possible extreme dry or wet periods that in turn inform water management plans. Tree rings have long provided historical context of hydroclimate variability of the U.S. However, the tree-ring network used to create these countrywide gridded reconstructions is sparse in certain locations, such as the Midwest. Here, we increase (n = 20) the spatial resolution of the tree-ring network in southern Indiana and compare a summer (June-August) Palmer Drought Severity Index (PDSI) reconstruction to existing gridded reconstructions of PDSI for this region. We find both droughts and pluvials that were previously unknown that rival the most intense PDSI values during the instrumental period. Additionally, historical drought occurred in Indiana that eclipsed instrumental conditions with regard to severity and duration. During the period 1962-2004 CE, we find that teleconnections of drought conditions through the Atlantic Meridional Overturning Circulation have a strong influence (r = -0.60, p tree growth in this region for the late spring-early summer season. These findings highlight the importance of continuing to increase the spatial resolution of the tree-ring network used to infer past climate dynamics to capture the sub-regional spatial variability. Increasing the spatial resolution of the tree-ring network for a given region can better identify sub-regional variability, improve the accuracy of regional tree-ring PDSI reconstructions, and provide better information for climatic teleconnections.
The inference of gene trees with species trees.
Szöllősi, Gergely J; Tannier, Eric; Daubin, Vincent; Boussau, Bastien
2015-01-01
This article reviews the various models that have been used to describe the relationships between gene trees and species trees. Molecular phylogeny has focused mainly on improving models for the reconstruction of gene trees based on sequence alignments. Yet, most phylogeneticists seek to reveal the history of species. Although the histories of genes and species are tightly linked, they are seldom identical, because genes duplicate, are lost or horizontally transferred, and because alleles can coexist in populations for periods that may span several speciation events. Building models describing the relationship between gene and species trees can thus improve the reconstruction of gene trees when a species tree is known, and vice versa. Several approaches have been proposed to solve the problem in one direction or the other, but in general neither gene trees nor species trees are known. Only a few studies have attempted to jointly infer gene trees and species trees. These models account for gene duplication and loss, transfer or incomplete lineage sorting. Some of them consider several types of events together, but none exists currently that considers the full repertoire of processes that generate gene trees along the species tree. Simulations as well as empirical studies on genomic data show that combining gene tree-species tree models with models of sequence evolution improves gene tree reconstruction. In turn, these better gene trees provide a more reliable basis for studying genome evolution or reconstructing ancestral chromosomes and ancestral gene sequences. We predict that gene tree-species tree methods that can deal with genomic data sets will be instrumental to advancing our understanding of genomic evolution.
Du, Ding-Zhu
2001-01-01
This book is a collection of articles studying various Steiner tree prob lems with applications in industries, such as the design of electronic cir cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Sch...
Bose, Prosenjit; Douieb, Karim; Dujmovic, Vida; King, James; Morin, Pat
2010-01-01
Let R^d -> A be a query problem over R^d for which there exists a data structure S that can compute P(q) in O(log n) time for any query point q in R^d. Let D be a probability measure over R^d representing a distribution of queries. We describe a data structure called the odds-on tree, of size O(n^\\epsilon) that can be used as a filter that quickly computes P(q) for some query values q in R^d and relies on S for the remaining queries. With an odds-on tree, the expected query time for a point drawn according to D is O(H*+1), where H* is a lower-bound on the expected cost of any linear decision tree that solves P. Odds-on trees have a number of applications, including distribution-sensitive data structures for point location in 2-d, point-in-polytope testing in d dimensions, ray shooting in simple polygons, ray shooting in polytopes, nearest-neighbour queries in R^d, point-location in arrangements of hyperplanes in R^d, and many other geometric searching problems that can be solved in the linear-decision tree mo...
Zhu, Ruoqing; Zeng, Donglin; Kosorok, Michael R
In this paper, we introduce a new type of tree-based method, reinforcement learning trees (RLT), which exhibits significantly improved performance over traditional methods such as random forests (Breiman, 2001) under high-dimensional settings. The innovations are three-fold. First, the new method implements reinforcement learning at each selection of a splitting variable during the tree construction processes. By splitting on the variable that brings the greatest future improvement in later splits, rather than choosing the one with largest marginal effect from the immediate split, the constructed tree utilizes the available samples in a more efficient way. Moreover, such an approach enables linear combination cuts at little extra computational cost. Second, we propose a variable muting procedure that progressively eliminates noise variables during the construction of each individual tree. The muting procedure also takes advantage of reinforcement learning and prevents noise variables from being considered in the search for splitting rules, so that towards terminal nodes, where the sample size is small, the splitting rules are still constructed from only strong variables. Last, we investigate asymptotic properties of the proposed method under basic assumptions and discuss rationale in general settings.
Berestovskii, V N
2007-01-01
We show that every inner metric space X is the metric quotient of a complete R-tree via a free isometric action, which we call the covering R-tree of X. The quotient mapping is a weak submetry (hence, open) and light. In the case of compact 1-dimensional geodesic space X, the free isometric action is via a subgroup of the fundamental group of X. In particular, the Sierpin'ski gasket and carpet, and the Menger sponge all have the same covering R-tree, which is complete and has at each point valency equal to the continuum. This latter R-tree is of particular interest because it is "universal" in at least two senses: First, every R-tree of valency at most the continuum can be isometrically embedded in it. Second, every Peano continuum is the image of it via an open light mapping. We provide a sketch of our previous construction of the uniform universal cover in the special case of inner metric spaces, the properties of which are used in the proof.
A multiscale assessment of tree avoidance by prairie birds
Thompson, Sarah J.; Arnold, Todd W.; Amundson, Courtney L.
2014-01-01
In North America, grassland bird abundances have declined, likely as a result of loss and degradation of prairie habitat. Given the expense and limited opportunity to procure new grasslands, managers are increasingly focusing on ways to improve existing habitat for grassland birds, using techniques such as tree removal. To examine the potential for tree removal to benefit grassland birds, we conducted 446 point counts on 35 grassland habitat patches in the highly fragmented landscape of west-central Minnesota during 2009–2011. We modeled density of four grassland bird species in relation to habitat composition at multiple scales, focusing on covariates that described grass, woody vegetation (trees and large shrubs), or combinations of grass and woody vegetation. The best-supported models for all four grassland bird species incorporated variables measured at multiple scales, including local features such as grass height, litter depth, and local tree abundance, as well as landscape-level measures of grass and tree cover. Savannah Sparrows (Passerculus sandwichensis), Sedge Wrens (Cistothorus platensis), and Bobolinks (Dolichonyx oryzivorus) responded consistently and negatively to woody vegetation, but response to litter depth, grass height, and grassland extent were mixed among species. Our results suggest that reducing shrub and tree cover is more likely to increase the density of grassland birds than are attempts to improve grass quality or quantity. In particular, tree removal is more likely to increase density of Savannah Sparrows and Sedge Wrens than any reasonable changes in grass quality or quantity. Yet tree removal may not result in increased abundance of grassland birds if habitat composition is not considered at multiple scales. Managers will need to either manage at large scales (80–300 ha) or focus their efforts on removing trees in landscapes that contain some grasslands but few nearby wooded areas.
Counting pairs of faint galaxies
Woods, D; Richer, H B; Woods, David; Fahlman, Gregory G; Richer, Harvey B
1995-01-01
The number of close pairs of galaxies observed to faint magnitude limits, when compared to nearby samples, determines the interaction or merger rate as a function of redshift. The prevalence of mergers at intermediate redshifts is fundamental to understanding how galaxies evolve and the relative population of galaxy types. Mergers have been used to explain the excess of galaxies in faint blue counts above the numbers expected from no-evolution models. Using deep CFHT (I\\leq24) imaging of a ``blank'' field we find a pair fraction which is consistent with the galaxies in our sample being randomly distributed with no significant excess of ``physical'' close pairs. This is contrary to the pair fraction of 34\\%\\pm9\\% found by Burkey {\\it et al.} for similar magnitude limits and using an identical approach to the pair analysis. Various reasons for this discrepancy are discussed. Colors and morphologies of our close pairs are consistent with the bulk of them being random superpositions although, as indicators of int...
Complete Blood Count and Retinal Vessel Calibers
Gerald Liew; Jie Jin Wang; Elena Rochtchina; Tien Yin Wong; Paul Mitchell
2014-01-01
OBJECTIVE: The influence of hematological indices such as complete blood count on microcirculation is poorly understood. Retinal microvasculature can be directly visualized and vessel calibers are associated with a range of ocular and systemic diseases. We examined the association of complete blood count with retinal vessel calibers. METHODS: Cross-sectional population-based Blue Mountains Eye Study, n = 3009, aged 49+ years. Complete blood count was measured from fasting blood samples taken ...
Improvement of Delayed Neutron Counting System
YUAN; Guo-jun; XIAO; Cai-jin; YANG; Wei; ZHANG; Gui-ying; JIN; Xiang-chun; WANG; Ping-sheng; NI; Bang-fa
2012-01-01
<正>A new delayed neutron counting system, which is good at qualitative and quantitative analysis of fissionable nuclide mixture, will be established at China Advanced Research Reactor (CARR). We use 3 He proportional counters to count the delayed neutrons after the samples irradiated by reactor neutrons, including U3O8-stantard, uranium ore and enriched uranium. Then, the counting efficiency and limit of this system were calculated.
Vector perturbations of galaxy number counts
Durrer, Ruth; Tansella, Vittorio
2016-07-01
We derive the contribution to relativistic galaxy number count fluctuations from vector and tensor perturbations within linear perturbation theory. Our result is consistent with the the relativistic corrections to number counts due to scalar perturbation, where the Bardeen potentials are replaced with line-of-sight projection of vector and tensor quantities. Since vector and tensor perturbations do not lead to density fluctuations the standard density term in the number counts is absent. We apply our results to vector perturbations which are induced from scalar perturbations at second order and give numerical estimates of their contributions to the power spectrum of relativistic galaxy number counts.
Vector perturbations of galaxy number counts
Durrer, Ruth
2016-01-01
We derive the contribution to relativistic galaxy number count fluctuations from vector and tensor perturbations within linear perturbation theory. Our result is consistent with the the relativistic corrections to number counts due to scalar perturbation, where the Bardeen potentials are replaced with line-of-sight projection of vector and tensor quantities. Since vector and tensor perturbations do not lead to density fluctuations the standard density term in the number counts is absent. We apply our results to vector perturbations which are induced from scalar perturbations at second order and give numerical estimates of their contributions to the power spectrum of relativistic galaxy number counts.
Visualization of Uncertain Contour Trees
Kraus, Martin
2010-01-01
Contour trees can represent the topology of large volume data sets in a relatively compact, discrete data structure. However, the resulting trees often contain many thousands of nodes; thus, many graph drawing techniques fail to produce satisfactory results. Therefore, several visualization methods...... were proposed recently for the visualization of contour trees. Unfortunately, none of these techniques is able to handle uncertain contour trees although any uncertainty of the volume data inevitably results in partially uncertain contour trees. In this work, we visualize uncertain contour trees...... by combining the contour trees of two morphologically filtered versions of a volume data set, which represent the range of uncertainty. These two contour trees are combined and visualized within a single image such that a range of potential contour trees is represented by the resulting visualization. Thus...
Edvardsson, Johannes; Šimanauskienė, Rasa; Taminskas, Julius; Baužienė, Ieva; Stoffel, Markus
2015-02-01
Over the past century an ongoing establishment of Scots pine (Pinus sylvestris L.), sometimes at accelerating rates, is noted at three studied Lithuanian peat bogs, namely Kerėplis, Rėkyva and Aukštumala, all representing different degrees of tree coverage and geographic settings. Present establishment rates seem to depend on tree density on the bog surface and are most significant at sparsely covered sites where about three-fourth of the trees have established since the mid-1990s, whereas the initial establishment in general was during the early to mid-19th century. Three methods were used to detect, compare and describe tree establishment: (1) tree counts in small plots, (2) dendrochronological dating of bog pine trees, and (3) interpretation of aerial photographs and historical maps of the study areas. In combination, the different approaches provide complimentary information but also weigh up each other's drawbacks. Tree counts in plots provided a reasonable overview of age class distributions and enabled capturing of the most recently established trees with ages less than 50 years. The dendrochronological analysis yielded accurate tree ages and a good temporal resolution of long-term changes. Tree establishment and spread interpreted from aerial photographs and historical maps provided a good overview of tree spread and total affected area. It also helped to verify the results obtained with the other methods and an upscaling of findings to the entire peat bogs. The ongoing spread of trees in predominantly undisturbed peat bogs is related to warmer and/or drier climatic conditions, and to a minor degree to land-use changes. Our results therefore provide valuable insights into vegetation changes in peat bogs, also with respect to bog response to ongoing and future climatic changes. Copyright © 2014 Elsevier B.V. All rights reserved.
Forrow, Aden; Dunkel, Jörn
2016-01-01
Coherent, large scale dynamics in many nonequilibrium physical, biological, or information transport networks are driven by small-scale local energy input. We introduce and explore a generic model for compressible active flows on tree networks. In contrast to thermally-driven systems, active friction selects discrete states with only a small number of oscillation modes activated at distinct fixed amplitudes. This state selection interacts with graph topology to produce different localized dynamical time scales in separate regions of large networks. Using perturbation theory, we systematically predict the stationary states of noisy networks and find good agreement with a Bayesian state estimation based on a hidden Markov model applied to simulated time series data on binary trees. While the number of stable states per tree scales exponentially with the number of edges, the mean number of activated modes in each state averages $\\sim 1/4$ the number of edges. More broadly, these results suggest that the macrosco...
Durhuus, Bergfinnur Jøgvan; Napolitano, George Maria
2012-01-01
The Ising model on a class of infinite random trees is defined as a thermodynamiclimit of finite systems. A detailed description of the corresponding distribution of infinite spin configurations is given. As an application, we study the magnetization properties of such systems and prove that they......The Ising model on a class of infinite random trees is defined as a thermodynamiclimit of finite systems. A detailed description of the corresponding distribution of infinite spin configurations is given. As an application, we study the magnetization properties of such systems and prove...... that they exhibit no spontaneous magnetization. Furthermore, the values of the Hausdorff and spectral dimensions of the underlying trees are calculated and found to be, respectively,¯dh =2 and¯ds = 4/3....
Roux, Kenneth H; Teuber, Suzanne S; Sathe, Shridhar K
2003-08-01
Allergic reactions to tree nuts can be serious and life threatening. Considerable research has been conducted in recent years in an attempt to characterize those allergens that are most responsible for allergy sensitization and triggering. Both native and recombinant nut allergens have been identified and characterized and, for some, the IgE-reactive epitopes described. Some allergens, such as lipid transfer proteins, profilins, and members of the Bet v 1-related family, represent minor constituents in tree nuts. These allergens are frequently cross-reactive with other food and pollen homologues, and are considered panallergens. Others, such as legumins, vicilins, and 2S albumins, represent major seed storage protein constituents of the nuts. The allergenic tree nuts discussed in this review include those most commonly responsible for allergic reactions such as hazelnut, walnut, cashew, and almond as well as those less frequently associated with allergies including pecan, chestnut, Brazil nut, pine nut, macadamia nut, pistachio, coconut, Nangai nut, and acorn.
Springer, Mark S; Gatesy, John
2016-01-01
Higher-level relationships among placental mammals are mostly resolved, but several polytomies remain contentious. Song et al. (2012) claimed to have resolved three of these using shortcut coalescence methods (MP-EST, STAR) and further concluded that these methods, which assume no within-locus recombination, are required to unravel deep-level phylogenetic problems that have stymied concatenation. Here, we reanalyze Song et al.'s (2012) data and leverage these re-analyses to explore key issues in systematics including the recombination ratchet, gene tree stoichiometry, the proportion of gene tree incongruence that results from deep coalescence versus other factors, and simulations that compare the performance of coalescence and concatenation methods in species tree estimation. Song et al. (2012) reported an average locus length of 3.1 kb for the 447 protein-coding genes in their phylogenomic dataset, but the true mean length of these loci (start codon to stop codon) is 139.6 kb. Empirical estimates of recombination breakpoints in primates, coupled with consideration of the recombination ratchet, suggest that individual coalescence genes (c-genes) approach ∼12 bp or less for Song et al.'s (2012) dataset, three to four orders of magnitude shorter than the c-genes reported by these authors. This result has general implications for the application of coalescence methods in species tree estimation. We contend that it is illogical to apply coalescence methods to complete protein-coding sequences. Such analyses amalgamate c-genes with different evolutionary histories (i.e., exons separated by >100,000 bp), distort true gene tree stoichiometry that is required for accurate species tree inference, and contradict the central rationale for applying coalescence methods to difficult phylogenetic problems. In addition, Song et al.'s (2012) dataset of 447 genes includes 21 loci with switched taxonomic names, eight duplicated loci, 26 loci with non-homologous sequences that are
Adaptive Context Tree Weighting
O'Neill, Alexander; Shao, Wen; Sunehag, Peter
2012-01-01
We describe an adaptive context tree weighting (ACTW) algorithm, as an extension to the standard context tree weighting (CTW) algorithm. Unlike the standard CTW algorithm, which weights all observations equally regardless of the depth, ACTW gives increasing weight to more recent observations, aiming to improve performance in cases where the input sequence is from a non-stationary distribution. Data compression results show ACTW variants improving over CTW on merged files from standard compression benchmark tests while never being significantly worse on any individual file.
Oflazer, K
1996-01-01
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree approximately, that is, within a certain error tolerance. It has natural language processing applications in searching for matches in example-based translation systems, and retrieval from lexical databases containing entries of complex feature structures. The algorithm has been implemented on SparcStations, and for large randomly generated synthetic tree databases (some having tens of thousands of trees) it can associatively search for trees with a small error, in a matter of tenths of a second to few seconds.
Injury count model for quantification of risk of occupational injury.
Khanzode, Vivek V; Maiti, J; Ray, P K
2011-06-01
Reduction of risk of occupational injuries is one of the most challenging problems faced by industry. Assessing and comparing risks involved in different jobs is one of the important steps towards reducing injury risk. In this study, a comprehensive scheme is given for assessing and comparing injury risks with the development of injury count model, injury risk model and derived statistics. The hazards present in a work system and the nature of the job carried out by workers are perceived as important drivers of injury potential of a work system. A loglinear model is used to quantify injury counts and the event-tree approach with joint, marginal and conditional probabilities is used to quantify injury risk. A case study was carried out in an underground coal mine. Finally a number of indices are proposed for the case study mine to capture risk of injury in different jobs. The findings of this study will help in designing injury intervention strategies for the mine studied. The job-wise risk profiles will be used to prioritise the jobs for redesign. The absolute indices can be applied for benchmarking job-wise risks and the relative indices can be used for comparing job-wise risks across work systems.
Fingerprint Gender Classification using Univariate Decision Tree (J48
S. F. Abdullah
2016-09-01
Full Text Available Data mining is the process of analyzing data from a different category. This data provide information and data mining will extracts a new knowledge from it and a new useful information is created. Decision tree learning is a method commonly used in data mining. The decision tree is a model of decision that looklike as a tree-like graph with nodes, branches and leaves. Each internal node denotes a test on an attribute and each branch represents the outcome of the test. The leaf node which is the last node will holds a class label. Decision tree classifies the instance and helps in making a prediction of the data used. This study focused on a J48 algorithm for classifying a gender by using fingerprint features. There are four types of features in the fingerprint that is used in this study, which is Ridge Count (RC, Ridge Density (RD, Ridge Thickness to Valley Thickness Ratio (RTVTR and White Lines Count (WLC. Different cases have been determined to be executed with the J48 algorithm and a comparison of the knowledge gain from each test is shown. All the result of this experiment is running using Weka and the result achieve 96.28% for the classification rate.
Counting losses due to saturation effects of scintillation counters at high count rates
Hashimoto, K
1999-01-01
The counting statistics of a scintillation counter, with a preamplifier saturated by an overloading input, are investigated. First, the formulae for the variance and the mean number of counts, accumulated within a given gating time, are derived by considering counting-loss effects originating from the saturation and a finite resolving time of the electronic circuit. Numerical examples based on the formulae indicate that the saturation makes a positive contribution to the variance-to-mean ratio and that the contribution increases with count rate. Next the ratios are measured under high count rates when the preamplifier saturation can be observed. By fitting the present formula to the measured data, the counting-loss parameters can be evaluated. Corrections based on the parameters are made for various count rates measured in a nuclear reactor. As a result of the corrections, the linearity between count rate and reactor power can be restored.
Genetic Regulatory Networks that count to 3
Lehmann, Martin; Sneppen, K.
2013-01-01
that contain repressive links, which we model by Michaelis-Menten terms. Interestingly, we find that counting to 3 does not require a hierarchy in Hill coefficients, in contrast to counting to 2, which is known from lambda phage. Furthermore, we find two main circuit architectures: one design also found...
Correcting Finger Counting to Snellen Acuity.
Karanjia, Rustum; Hwang, Tiffany Jean; Chen, Alexander Francis; Pouw, Andrew; Tian, Jack J; Chu, Edward R; Wang, Michelle Y; Tran, Jeffrey Show; Sadun, Alfredo A
2016-10-01
In this paper, the authors describe an online tool with which to convert and thus quantify count finger measurements of visual acuity into Snellen equivalents. It is hoped that this tool allows for the re-interpretation of retrospectively collected data that provide visual acuity in terms of qualitative count finger measurements.
Is It Counting, or Is It Adding?
Eisenhardt, Sara; Fisher, Molly H.; Thomas, Jonathan; Schack, Edna O.; Tassell, Janet; Yoder, Margaret
2014-01-01
The Common Core State Standards for Mathematics (CCSSI 2010) expect second grade students to "fluently add and subtract within 20 using mental strategies" (2.OA.B.2). Most children begin with number word sequences and counting approximations and then develop greater skill with counting. But do all teachers really understand how this…
It Is Time to Count Learning Communities
Henscheid, Jean M.
2015-01-01
As the modern learning community movement turns 30, it is time to determine just how many, and what type, of these programs exist at America's colleges and universities. This article first offers a rationale for counting learning communities followed by a description of how disparate counts and unclear definitions hamper efforts to embed these…
Is It Counting, or Is It Adding?
Eisenhardt, Sara; Fisher, Molly H.; Thomas, Jonathan; Schack, Edna O.; Tassell, Janet; Yoder, Margaret
2014-01-01
The Common Core State Standards for Mathematics (CCSSI 2010) expect second grade students to "fluently add and subtract within 20 using mental strategies" (2.OA.B.2). Most children begin with number word sequences and counting approximations and then develop greater skill with counting. But do all teachers really understand how this…
A Suffix Tree Or Not a Suffix Tree?
Starikovskaya, Tatiana; Vildhøj, Hjalte Wedel
2015-01-01
, in particular we do not require that S ends with a unique symbol. This corresponds to considering the more general definition of implicit or extended suffix trees. Such general suffix trees have many applications and are for example needed to allow efficient updates when suffix trees are built online. We prove...
Tree Modeling with Real Tree-Parts Examples.
Xie, Ke; Yan, Feilong; Sharf, Andrei; Deussen, Oliver; Huang, Hui; Chen, Baoquan
2016-12-01
We introduce a 3D tree modeling technique that utilizes examples of real trees to enhance tree creation with realistic structures and fine-level details. In contrast to previous works that use smooth generalized cylinders to represent tree branches, our method generates realistic looking tree models with complex branching geometry by employing an exemplar database consisting of real-life trees reconstructed from scanned data. These trees are sliced into representative parts (denoted as tree-cuts), representing trunk logs and branching structures. In the modeling process, tree-cuts are positioned in space in an intuitive manner, serving as efficient proxies that guide the creation of the complete tree. Allometry rules are taken into account to ensure reasonable relations between adjacent branches. Realism is further enhanced by automatically transferring geometric textures from our database onto tree branches as well as by guided growing of foliage. Our results demonstrate the complexity and variety of trees that can be generated with our method within few minutes. We carry a user study to test the effectiveness of our modeling technique.
Balgooy, van M.M.J.
1998-01-01
With the publication of the second volume of the series ‘Malesian Seed Plants’, entitled ‘Portraits of Tree Families’, I would like to refer to the Introduction of the first volume, ‘Spot-characters’ for a historical background and an explanation of the aims of this series. The present book treats 1
Certified Kruskal's Tree Theorem
Christian Sternagel
2014-07-01
Full Text Available This article presents the first formalization of Kurskal's tree theorem in aproof assistant. The Isabelle/HOL development is along the lines of Nash-Williams' original minimal bad sequence argument for proving the treetheorem. Along the way, proofs of Dickson's lemma and Higman's lemma, as well as some technical details of the formalization are discussed.
2009-01-01
west of Tiananmen Square in Beijing, in Zhongshan Park, there stand several ancient cypress trees, each more than 1,000 years old. Their leafy crowns are all more than 20 meters high, while four have trunks that are 6 meters in circumference. The most unique of these
Assent, Ira; Krieger, Ralph; Afschari, Farzad;
2008-01-01
Continuous growth in sensor data and other temporal data increases the importance of retrieval and similarity search in time series data. Efficient time series query processing is crucial for interactive applications. Existing multidimensional indexes like the R-tree provide efficient querying fo...
Assent, Ira; Krieger, Ralph; Afschari, Farzad
2008-01-01
Continuous growth in sensor data and other temporal data increases the importance of retrieval and similarity search in time series data. Efficient time series query processing is crucial for interactive applications. Existing multidimensional indexes like the R-tree provide efficient querying fo...
Tree Transduction Tools for Cdec
Austin Matthews
2014-09-01
Full Text Available We describe a collection of open source tools for learning tree-to-string and tree-to-tree transducers and the extensions to the cdec decoder that enable translation with these. Our modular, easy-to-extend tools extract rules from trees or forests aligned to strings and trees subject to different structural constraints. A fast, multithreaded implementation of the Cohn and Blunsom (2009 model for extracting compact tree-to-string rules is also included. The implementation of the tree composition algorithm used by cdec is described, and translation quality and decoding time results are presented. Our experimental results add to the body of evidence suggesting that tree transducers are a compelling option for translation, particularly when decoding speed and translation model size are important.
Tree Formation Using Coordinate Method
Monika Choudhary
2015-06-01
Full Text Available In this paper we are introducing a new method of tree formation, we propose a coordinate based method by which we can store and access tree structures. As we know in NLP, parsing is the most important module. The output of this module is generally parsed trees. Currently, TAG (Tree Adjoining Grammar is widely used grammar due to its linguistic and formal nature. It is simply tree generating system. The unit structure used in TAG is structured trees. So we used our new method to store trees where we worked on English to Hindi language. We worked on different sentences from English to Hindi, our method is the easiest way to manipulate tree. We have implemented within small corpus and for finite number of structures and further can be extended in future.
Andersen, Esben Sloth
2002-01-01
The purpose of this paper is to bring forth an interaction between evolutionary economics and industrial systematics. The suggested solution is to reconstruct the "family tree" of the industries. Such a tree is based on similarities, but it may also reflect the evolutionary history in industries...... finding of optimal industrial trees. The results are presented as taxonomic trees that can easily be compared with the hierarchical structure of existing systems of industrial classification....
Protecting Trees Means Protecting Ourselves
刘国虹; 张超
2016-01-01
As everyone knows,spring is a planting season.Every year people all over China go out to plant trees.Trees can make our environment more beautifully~①.Trees can stop wind from blowing the earth and sand away.They can also prevent soil from being washed away by wa-
Junction trees of general graphs
Xiaofei WANG; Jianhua GUO
2008-01-01
In this paper,we study the maximal prime subgraphs and their corresponding structure for any undirected graph.We introduce the notion of junction trees and investigate their structural characteristics,including junction properties,induced-subtree properties,running-intersection properties and maximum-weight spanning tree properties.Furthermore,the characters of leaves and edges on junction trees are discussed.
Tree decompositions with small cost
Bodlaender, H.L.; Fomin, F.V.
2002-01-01
The f-cost of a tree decomposition ({Xi | i e I}, T = (I;F)) for a function f : N -> R+ is defined as EieI f(|Xi|). This measure associates with the running time or memory use of some algorithms that use the tree decomposition. In this paper we investigate the problem to find tree decompositions
Distance labeling schemes for trees
Alstrup, Stephen; Gørtz, Inge Li; Bistrup Halvorsen, Esben;
2016-01-01
We consider distance labeling schemes for trees: given a tree with n nodes, label the nodes with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the distance in the tree between the two nodes. A lower bound by Gavoille et al. [Gavoill...
孟凡洪; 苏耕; 杨继
2000-01-01
The present paper shows the coordinates of a tree and its vertices, defines a kind of Trees with Odd-Number Radiant Type (TONRT), deals with the gracefulness of TONRT by using the edge-moving theorem, and uses graceful TONRT to construct another class of graceful trees.
Generalising tree traversals to DAGs
Bahr, Patrick; Axelsson, Emil
2015-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 and then apply it to compact graph representations of trees instead. The resulting graph traversals avoid...
Spanning trees crossing few barriers
Asano, T.; Berg, M. de; Cheong, O.; Guibas, L.J.; Snoeyink, J.; Tamaki, H.
2002-01-01
We consider the problem of finding low-cost spanning trees for sets of n points in the plane, where the cost of a spanning tree is defined as the total number of intersections of tree edges with a given set of m barriers. We obtain the following results: (i) if the barriers are possibly intersecting
Selecting Landscape Plants: Flowering Trees
Relf, Diane; Appleton, Bonnie Lee, 1948-2012
2009-01-01
This publication helps the reader to select wisely among the many species and varieties of flowering trees available. The following are considerations that should be taken into account when choosing flowering trees for the home landscape: selections factors, environmental responses, availability and adaptability, and flowering tree descriptions.
Rectilinear Full Steiner Tree Generation
Zachariasen, Martin
1999-01-01
The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a two-phase scheme: First, a small but sufficient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic...
Generalising tree traversals to DAGs
Bahr, Patrick; Axelsson, Emil
2015-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 and then apply it to compact graph representations of trees instead. The resulting graph traversals avoid...
Nyhuis, Jane
Referring as often as possible to traditional Hopi practices and to materials readily available on the reservation, the illustrated booklet provides information on the care and maintenance of young fruit trees. An introduction to fruit trees explains the special characteristics of new trees, e.g., grafting, planting pits, and watering. The…
A suffix tree or not a suffix tree?
Starikovskaya, Tatiana; Vildhøj, Hjalte Wedel
2015-01-01
In this paper we study the structure of suffix trees. Given an unlabeled tree τ on n nodes and suffix links of its internal nodes, we ask the question “Is τ a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure as τ? We place no restrictions on S, in part......In this paper we study the structure of suffix trees. Given an unlabeled tree τ on n nodes and suffix links of its internal nodes, we ask the question “Is τ a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure as τ? We place no restrictions on S......, in particular we do not require that S ends with a unique symbol. This corresponds to considering the more general definition of implicit or extended suffix trees. Such general suffix trees have many applications and are for example needed to allow efficient updates when suffix trees are built online. Deciding...
Fringe trees, Crump-Mode-Jagers branching processes and $m$-ary search trees
Holmgren, Cecilia; Janson, Svante
2016-01-01
This survey studies asymptotics of random fringe trees and extended fringe trees in random trees that can be constructed as family trees of a Crump-Mode-Jagers branching process, stopped at a suitable time. This includes random recursive trees, preferential attachment trees, fragmentation trees, binary search trees and (more generally) $m$-ary search trees, as well as some other classes of random trees. We begin with general results, mainly due to Aldous (1991) and Jagers and Nerman (1984). T...
PoInTree: A Polar and Interactive Phylogenetic Tree
Carreras Marco; Gianti Eleonora; Sartori Luca; Plyte Simon Edward; Isacchi Antonella; Bosotti Roberta
2005-01-01
PoInTree (Polar and Innteractive Tree) is an application that allows to build, visualize, and customize phylogenetic trees in a polar, interactive, and highly flexible view. It takes as input a FASTA file or multiple alignment formats. Phylogenetic tree calculation is based on a sequence distance method and utilizes the Neighbor Joining (NJ) algorithm. It also allows displaying precalculated trees of the major protein families based on Pfam classification. In PoInTree, nodes can be dynamically opened and closed and distances between genes are graphically represented.Tree root can be centered on a selected leaf. Text search mechanism, color-coding and labeling display are integrated. The visualizer can be connected to an Oracle database containing information on sequences and other biological data, helping to guide their interpretation within a given protein family across multiple species.The application is written in Borland Delphi and based on VCL Teechart Pro 6 graphical component (Steema software).
TREE SELECTING AND TREE RING MEASURING IN DENDROCHRONOLOGICAL INVESTIGATIONS
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.
Rate of tree carbon accumulation increases continuously with tree size.
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.
Noun Countability; Count Nouns and Non-count Nouns, What are the Syntactic Differences Between them?
Azhar A. Alkazwini
2016-11-01
Full Text Available Words that function as the subjects of verbs, objects of verbs or prepositions and which can have a plural form and possessive ending are known as nouns. They are described as referring to persons, places, things, states, or qualities and might also be used as an attributive modifier. In this paper, classes and subclasses of nouns shall be presented, then, noun countability branching into count and non-count nous shall be discussed. A number of present examples illustrating differences between count and non-count nouns and this includes determiner-head-co-occurrence restrictions of number, subject-verb agreement, in addition to some exceptions to this agreement rule shall be discussed. Also, the lexically inherent number in nouns and how inherently plural nouns are classified in terms of (+/- count are illustrated. This research will discuss partitive construction of count and non-count nouns, nouns as attributive modifier and, finally, conclude with the fact that there are syntactic difference between count and non-count in the English Language. Keywords: English Language, Nouns, Count, Non-count, Syntactic Differences, Proper Nouns
Count response model for the CMB spots
Giovannini, Massimo
2010-01-01
The statistics of the curvature quanta generated during a stage of inflationary expansion is used to derive a count response model for the large-scale phonons determining, in the concordance lore, the warmer and the cooler spots of the large-scale temperature inhomogeneities. The multiplicity distributions for the counting statistics are shown to be generically overdispersed in comparison with conventional Poissonian regressions. The generalized count response model deduced hereunder accommodates an excess of correlations in the regime of high multiplicities and prompts dedicated analyses with forthcoming data collected by instruments of high angular resolution and high sensitivity to temperature variations per pixel.
The theory and practice of scintillation counting
Birks, John Bettely
1964-01-01
The Theory and Practice of Scintillation Counting is a comprehensive account of the theory and practice of scintillation counting. This text covers the study of the scintillation process, which is concerned with the interactions of radiation and matter; the design of the scintillation counter; and the wide range of applications of scintillation counters in pure and applied science. The book is easy to read despite the complex nature of the subject it attempts to discuss. It is organized such that the first five chapters illustrate the fundamental concepts of scintillation counting. Chapters 6
McGregor, Grant Duncan
2008-12-16
In this thesis we examine the method of counting B{bar B} events produced in the BABAR experiment. The original method was proposed in 2000, but improvements to track reconstruction and our understanding of the detector since that date make it appropriate to revisit the B Counting method. We propose a new set of cuts designed to minimize the sensitivity to time-varying backgrounds. We find the new method counts B{bar B} events with an associated systematic uncertainty of {+-} 0.6%.
Butler, Ricky W.; Martensen, Anna L.
1992-01-01
FTC, Fault-Tree Compiler program, is reliability-analysis software tool used to calculate probability of top event of fault tree. Five different types of gates allowed in fault tree: AND, OR, EXCLUSIVE OR, INVERT, and M OF N. High-level input language of FTC easy to understand and use. Program supports hierarchical fault-tree-definition feature simplifying process of description of tree and reduces execution time. Solution technique implemented in FORTRAN, and user interface in Pascal. Written to run on DEC VAX computer operating under VMS operating system.
Zhu, Zhen; Puliga, Michelangelo; Cerina, Federica; Chessa, Alessandro; Riccaboni, Massimo
2015-01-01
The fragmentation of production across countries has become an important feature of the globalization in recent decades and is often conceptualized by the term “global value chains” (GVCs). When empirically investigating the GVCs, previous studies are mainly interested in knowing how global the GVCs are rather than how the GVCs look like. From a complex networks perspective, we use the World Input-Output Database (WIOD) to study the evolution of the global production system. We find that the industry-level GVCs are indeed not chain-like but are better characterized by the tree topology. Hence, we compute the global value trees (GVTs) for all the industries available in the WIOD. Moreover, we compute an industry importance measure based on the GVTs and compare it with other network centrality measures. Finally, we discuss some future applications of the GVTs. PMID:25978067
Pushdown machines for the macro tree transducer
Engelfriet, Joost; Vogler, Heiko
1986-01-01
The macro tree transducer can be considered as a system of recursive function procedures with parameters, where the recursion is on a tree (e.g., the syntax tree of a program). We investigate characterizations of the class of tree (tree-to-string) translations which is induced by macro tree transduc
Tree Rings: Timekeepers of the Past.
Phipps, R. L.; McGowan, J.
One of a series of general interest publications on science issues, this booklet describes the uses of tree rings in historical and biological recordkeeping. Separate sections cover the following topics: dating of tree rings, dating with tree rings, tree ring formation, tree ring identification, sample collections, tree ring cross dating, tree…
Pushdown machines for the macro tree transducer
Engelfriet, Joost; Vogler, Heiko
1986-01-01
The macro tree transducer can be considered as a system of recursive function procedures with parameters, where the recursion is on a tree (e.g., the syntax tree of a program). We investigate characterizations of the class of tree (tree-to-string) translations which is induced by macro tree
Rob Garbutt
2013-10-01
Full Text Available Our paper focuses on the materiality, cultural history and cultural relations of selected artworks in the exhibition Wood for the trees (Lismore Regional Gallery, New South Wales, Australia, 10 June – 17 July 2011. The title of the exhibition, intentionally misreading the aphorism “Can’t see the wood for the trees”, by reading the wood for the resource rather than the collective wood[s], implies conservation, preservation, and the need for sustaining the originating resource. These ideas have particular resonance on the NSW far north coast, a region once rich in rainforest. While the Indigenous population had sustainable practices of forest and land management, the colonists deployed felling and harvesting in order to convert the value of the local, abundant rainforest trees into high-value timber. By the late twentieth century, however, a new wave of settlers launched a protest movements against the proposed logging of remnant rainforest at Terania Creek and elsewhere in the region. Wood for the trees, curated by Gallery Director Brett Adlington, plays on this dynamic relationship between wood, trees and people. We discuss the way selected artworks give expression to the themes or concepts of productive labour, nature and culture, conservation and sustainability, and memory. The artworks include Watjinbuy Marrawilil’s (1980 Carved ancestral figure ceremonial pole, Elizabeth Stops’ (2009/10 Explorations into colonisation, Hossein Valamanesh’s (2008 Memory stick, and AñA Wojak’s (2008 Unread book (in a forgotten language. Our art writing on the works, a practice informed by Bal (2002, Muecke (2008 and Papastergiadis (2004, becomes a conversation between the works and the themes or concepts. As a form of material excess of the most productive kind (Grosz, 2008, p. 7, art seeds a response to that which is in the air waiting to be said of the past, present and future.
Jonge, de, H.J.
2002-01-01
Dividing software systems in components improves software reusability as well as software maintainability. Components live at several levels, we concentrate on the implementation level where components are formed by source files, divided over directory structures. Such source code components are usually strongly coupled in the directory structure of a software system. Their compilation is usually controlled by a single global build process. This entangling of source trees and build processes ...
Grünewald, Stefan
2010-01-01
A classical problem in phylogenetic tree analysis is to decide whether there is a phylogenetic tree $T$ that contains all information of a given collection $\\cP$ of phylogenetic trees. If the answer is "yes" we say that $\\cP$ is compatible and $T$ displays $\\cP$. This decision problem is NP-complete even if all input trees are quartets, that is binary trees with exactly four leaves. In this paper, we prove a sufficient condition for a set of binary phylogenetic trees to be compatible. That result is used to give a short and self-contained proof of the known characterization of quartet sets of minimal cardinality which are displayed by a unique phylogenetic tree.
Making CSB + -Trees Processor Conscious
Samuel, Michael; Pedersen, Anders Uhl; Bonnet, Philippe
2005-01-01
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...... 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...... 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....
Forrow, Aden; Woodhouse, Francis G.; Dunkel, Jörn
2016-11-01
Coherent, large scale dynamics in many nonequilibrium physical, biological, or information transport networks are driven by small-scale local energy input. We introduce and explore a generic model for compressible active flows on tree networks. In contrast to thermally-driven systems, active friction selects discrete states with only a small number of oscillation modes activated at distinct fixed amplitudes. This state selection can interact with graph topology to produce different localized dynamical time scales in separate regions of large networks. Using perturbation theory, we systematically predict the stationary states of noisy networks. Our analytical predictions agree well with a Bayesian state estimation based on a hidden Markov model applied to simulated time series data on binary trees. While the number of stable states per tree scales exponentially with the number of edges, the mean number of activated modes in each state averages 1 / 4 the number of edges. More broadly, these results suggest that the macroscopic response of active networks, from actin-myosin networks in cells to flow networks in Physarum polycephalum, can be dominated by a few select modes.
Khina, Anatoly
2016-08-15
We consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize such a plant, one needs real-time encoding and decoding with an error probability profile that decays exponentially with the decoding delay. The works of Schulman and Sahai over the past two decades have developed the notions of tree codes and anytime capacity, and provided the theoretical framework for studying such problems. Nonetheless, there has been little practical progress in this area due to the absence of explicit constructions of tree codes with efficient encoding and decoding algorithms. Recently, linear time-invariant tree codes were proposed to achieve the desired result under maximum-likelihood decoding. In this work, we take one more step towards practicality, by showing that these codes can be efficiently decoded using sequential decoding algorithms, up to some loss in performance (and with some practical complexity caveats). We supplement our theoretical results with numerical simulations that demonstrate the effectiveness of the decoder in a control system setting.
Gene tree correction for reconciliation and species tree inference
Swenson Krister M
2012-11-01
Full Text Available Abstract Background Reconciliation is the commonly used method for inferring the evolutionary scenario for a gene family. It consists in “embedding” inferred gene trees into a known species tree, revealing the evolution of the gene family by duplications and losses. When a species tree is not known, a natural algorithmic problem is to infer a species tree from a set of gene trees, such that the corresponding reconciliation minimizes the number of duplications and/or losses. The main drawback of reconciliation is that the inferred evolutionary scenario is strongly dependent on the considered gene trees, as few misplaced leaves may lead to a completely different history, with significantly more duplications and losses. Results In this paper, we take advantage of certain gene trees’ properties in order to preprocess them for reconciliation or species tree inference. We flag certain duplication vertices of a gene tree, the “non-apparent duplication” (NAD vertices, as resulting from the misplacement of leaves. In the case of species tree inference, we develop a polynomial-time heuristic for removing the minimum number of species leading to a set of gene trees that exhibit no NAD vertices with respect to at least one species tree. In the case of reconciliation, we consider the optimization problem of removing the minimum number of leaves or species leading to a tree without any NAD vertex. We develop a polynomial-time algorithm that is exact for two special classes of gene trees, and show a good performance on simulated data sets in the general case.
Rate of tree carbon accumulation increases continuously with tree size
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.
Low white blood cell count and cancer
... this page: //medlineplus.gov/ency/patientinstructions/000675.htm Low white blood cell count and cancer To use ... high blood pressure, or seizures Continue Reading How Low is too Low? When your blood is tested, ...
Mourning Dove Call-count Survey
US Fish and Wildlife Service, Department of the Interior — The Mourning Dove (Zenaida macroura) Call-Count Survey was developed to provide an index to population size and to detect annual changes in mourning dove breeding...
Furbearer track count index testing and development
US Fish and Wildlife Service, Department of the Interior — Indices of abundance can be useful in monitoring furbearer populations where actual counts of individual animals are difficult. I sampled marten and snowshoe hare...
Calorie count - sodas and energy drinks
... ency/patientinstructions/000888.htm Calorie count - sodas and energy drinks To use the sharing features on this page, ... to have a few servings of soda or energy drinks a day without thinking about it. Like other ...
VSRR Provisional Drug Overdose Death Counts
U.S. Department of Health & Human Services — This data contains provisional counts for drug overdose deaths based on a current flow of mortality data in the National Vital Statistics System. National...
Uranium Determination by Delayed Neutron Counting
2008-01-01
<正>Uranium is a very important resource in nuclear industry, especially in the exploiture of nuclear energy. Determination of uranium using delayed neutron counting (DNC) is simple, non-destructive, and
Four square mile survey pair count instructions
US Fish and Wildlife Service, Department of the Interior — This standard operating procedure (SOP) provides guidance for conducting bird pair count measurements on wetlands for the HAPETs Four-Square-Mile survey. This set of...
CoC Housing Inventory Count Reports
Department of Housing and Urban Development — Continuum of Care (CoC) Homeless Assistance Programs Housing Inventory Count Reports are a snapshot of a CoC’s housing inventory, available at the national and state...
2012 bobwhite whistle count : performance report
US Fish and Wildlife Service, Department of the Interior — Performance report for the 2012 spring whistle count to monitor northern bobwhite abundance in Kansas state. This survey was initiated in 1998, and is preformed on...
2013 bobwhite whistle count : performance report
US Fish and Wildlife Service, Department of the Interior — Performance report for the 2013 spring whistle count to monitor northern bobwhite abundance in Kansas state. This survey was initiated in 1998, and is preformed on...
Statistical modelling for falls count data.
Ullah, Shahid; Finch, Caroline F; Day, Lesley
2010-03-01
Falls and their injury outcomes have count distributions that are highly skewed toward the right with clumping at zero, posing analytical challenges. Different modelling approaches have been used in the published literature to describe falls count distributions, often without consideration of the underlying statistical and modelling assumptions. This paper compares the use of modified Poisson and negative binomial (NB) models as alternatives to Poisson (P) regression, for the analysis of fall outcome counts. Four different count-based regression models (P, NB, zero-inflated Poisson (ZIP), zero-inflated negative binomial (ZINB)) were each individually fitted to four separate fall count datasets from Australia, New Zealand and United States. The finite mixtures of P and NB regression models were also compared to the standard NB model. Both analytical (F, Vuong and bootstrap tests) and graphical approaches were used to select and compare models. Simulation studies assessed the size and power of each model fit. This study confirms that falls count distributions are over-dispersed, but not dispersed due to excess zero counts or heterogeneous population. Accordingly, the P model generally provided the poorest fit to all datasets. The fit improved significantly with NB and both zero-inflated models. The fit was also improved with the NB model, compared to finite mixtures of both P and NB regression models. Although there was little difference in fit between NB and ZINB models, in the interests of parsimony it is recommended that future studies involving modelling of falls count data routinely use the NB models in preference to the P or ZINB or finite mixture distribution. The fact that these conclusions apply across four separate datasets from four different samples of older people participating in studies of different methodology, adds strength to this general guiding principle.
How to count an introduction to combinatorics
Allenby, RBJT
2010-01-01
What's It All About? What Is Combinatorics? Classic Problems What You Need to Know Are You Sitting Comfortably? Permutations and Combinations The Combinatorial Approach Permutations CombinationsApplications to Probability Problems The Multinomial Theorem Permutations and Cycles Occupancy Problems Counting the Solutions of Equations New Problems from Old A ""Reduction"" Theorem for the Stirling Numbers The Inclusion-Exclusion Principle Double Counting Derangements A Formula for the Stirling NumbersStirling and Catalan Numbers Stirling Numbers Permutations and Stirling Numbers Catalan Numbers Pa
It is difficult to tell if there is a Condorcet spanning tree.
Darmann, Andreas
We apply the well-known Condorcet criterion from voting theory outside of its classical framework and link it with spanning trees of an undirected graph. In situations in which a network, represented by a spanning tree of an undirected graph, needs to be installed, decision-makers typically do not agree on the network to be implemented. Instead, each of these decision-makers has her own ideal conception of the network. In order to derive a group decision, i.e., a single spanning tree for the entire group of decision-makers, the goal would be a spanning tree that beats each other spanning tree in a simple majority comparison. When comparing two dedicated spanning trees, a decision-maker will be considered to be more satisfied with the one that is "closer" to her proposal. In this context, the most basic and natural measure of distance is the usual set difference: we simply count the number of edges the spanning tree has in common with the proposal of the decision-maker. In this work, we show that it is computationally intractable to decide (1) if such a spanning tree exists, and (2) if a given spanning tree satisfies the Condorcet criterion.
Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining
Hussain, Shahid
2016-07-10
This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.
Application of date palm trees mulch as a bedding material for dry heifers in Saudi Arabia
Sadik M.W
2012-09-01
Full Text Available A study was conducted to determine the safety of using Saudi date palm trees mulch as a bedding material for dry heifers. Date palm trees mulch was used as bedding material for 10 days. Final Composite regulated elements (N, P, K, Na, Ca, and Mg, NDF, ADF, pH, moisture, and EC were improved by use of date palm trees mulch as a bedding material especially in concrete area (1.85%, 0.50%, 1.42%, 0.59%, 2.56%, 0.26%, 60.00%, 49.40%, 7.53, 30%, 16.88 for N, P, K, Na, Ca. Mg, NDF, ADF, pH, Moisture and Electrical conductivity, respectively. On a dry matter basis, highly enriched element fresh manure was collected from the concrete section bedded with date palm trees mulch. Both Concrete area bedded with date palm trees mulch and Sand area bedded with date palm trees mulch were free of salmonella after 10 days. Date palm trees mulch was unsuitable medium for pathogenic bacteria especially Escherichia coli O157:H7 .Total viable bacterial counts failed to increase with the incubation time (104. Date palm tree mulch was unsuitable medium for flies and minimizes density of house flies. Date palm trees mulch seemed to be a safe, comfortable and effective bedding material for cow’s feedlots.
The Complexity of Approximately Counting Stable Matchings
Chebolu, Prasad; Martin, Russell
2010-01-01
We investigate the complexity of approximately counting stable matchings in the $k$-attribute model, where the preference lists are determined by dot products of "preference vectors" with "attribute vectors", or by Euclidean distances between "preference points" and "attribute points". Irving and Leather proved that counting the number of stable matchings in the general case is $#P$-complete. Counting the number of stable matchings is reducible to counting the number of downsets in a (related) partial order and is interreducible, in an approximation-preserving sense, to a class of problems that includes counting the number of independent sets in a bipartite graph ($#BIS$). It is conjectured that no FPRAS exists for this class of problems. We show this approximation-preserving interreducibilty remains even in the restricted $k$-attribute setting when $k \\geq 3$ (dot products) or $k \\geq 2$ (Euclidean distances). Finally, we show it is easy to count the number of stable matchings in the 1-attribute dot-product ...
Evaluation of DAPI direct count, computer assisted and plate count methods
Chivu, Bogdan
2010-01-01
The feasibility of using automatic counting of bacteria stained with highly specific and sensitive fluorescing DNA stain DAPI, 4',6-diamidino-2-phenylindole, and direct manual counting to enumerate both pure culture of Pseudomonas putida overnight culture and sea water enhanced culture, was tested in correlation with plate direct counting, turbidity and absorbance at 600nm, to obtain cross validation. Six diluted samples from overnight pure culture of Pseudomonas putida and sea water culture ...
Benjamin Thompson, Count Rumford Count Rumford on the nature of heat
Brown, Sanborn C
1967-01-01
Men of Physics: Benjamin Thompson - Count Rumford: Count Rumford on the Nature of Heat covers the significant contributions of Count Rumford in the fields of physics. Count Rumford was born with the name Benjamin Thompson on March 23, 1753, in Woburn, Massachusetts. This book is composed of two parts encompassing 11 chapters, and begins with a presentation of Benjamin Thompson's biography and his interest in physics, particularly as an advocate of an """"anti-caloric"""" theory of heat. The subsequent chapters are devoted to his many discoveries that profoundly affected the physical thought
Casado Arroyo, Carlos
2016-01-01
“Tree plastic bark" consiste en la realización de una intervención artística en un entorno natural concreto, generando de esta manera un Site Specific(1). Como hace alusión Rosalind Krauss en sus reflexiones “La escultura en el campo expandido”(2), comenta que su origen esta claramente ligado con el concepto de monumentalidad. La escultura es un monumento, se crea para conmemorar algún hecho o personaje relevante y está realizada para una ubicación concreta. La investigación parte de la id...
Williams, Kathryn R.
1999-10-01
Starting in September 1925, JCE reproduced pictures of famous chemists or chemistry-related works of art as frontispieces. Often, the Journal included a biography or other article about the picture. The August 1945 frontispiece featured the largest cork oak in the United States. An accompanying article described the goals of the Cork Project to plant cork trees in suitable locations in the U.S., to compensate for uncertain European and African sources during World War II. The final frontispiece appeared in December 1956. To view supplementary material, please refer to JCE Online's supplementary links.
Martensen, Anna L.; Butler, Ricky W.
1987-01-01
The Fault Tree Compiler Program is a new reliability tool used to predict the top event probability for a fault tree. Five different gate types are allowed in the fault tree: AND, OR, EXCLUSIVE OR, INVERT, and M OF N gates. The high level input language is easy to understand and use when describing the system tree. In addition, the use of the hierarchical fault tree capability can simplify the tree description and decrease program execution time. The current solution technique provides an answer precise (within the limits of double precision floating point arithmetic) to the five digits in the answer. The user may vary one failure rate or failure probability over a range of values and plot the results for sensitivity analyses. The solution technique is implemented in FORTRAN; the remaining program code is implemented in Pascal. The program is written to run on a Digital Corporation VAX with the VMS operation system.
R. P. Meenaakshi Sundari
2014-01-01
Full Text Available In this study by using the modified Wallace tree multiplier, an error compensated adder tree is constructed in order to round off truncation errors and to obtain high through put discrete cosine transform design. Peak Signal to Noise Ratio (PSNR is met efficiently since modified Wallace Tree method is an efficient, hardware implementable digital circuit that multiplies two integers resulting an output with reduced delays and errors. Nearly 6% of delays and around 1% of gate counts are reduced. The number of look up tables consumed is 2% lesser than that of the previous multipliers. Thus an area efficient discrete cosine transform is built to achieve high throughput with minimum gate counts and delays for the required Peak Signal to Noise Ratio when compared to the existing DCT’s.
New Explorations for Decision Trees
无
2001-01-01
Traditionally, the decision tree method is defined and used for finding the optimal solution of a Bayesian decision problem. And it is difficult to use the decision tree method to find the sub-optimal solution, not to mention to rank alternatives. This paper discusses how to use the decision tree method for the alternative selecting and ranking.A practical case study is given to illustrate the applicability.
The Acquisition of Counting Skill in Preschooler
Kadir Çakır
2013-03-01
Full Text Available Abstract- The aim of this study was to find out more information on the acquisition of counting skill in preschool children. For this purpose, children’s judgment of acceptability of a counting activity was used to investigate whether children’s counting skills are governed by their implicit knowledge of a number of counting principles. Data showed that children easily recognized the violation of one or more counting principles in a one’s application of counting principles in sequences of English and Turkish count words, implying that children have the understanding of counting principles. The sessions on counting in Turkish make it very likely that the children were responding to violations of rules rather than merely violation of well-learning of count words. These results give additional support to the assumption that there are innate counting principles that rule young children’s counting. Keywords: counting principles, error-detection task, mathematical development. Özet- Okul Öncesi Çocuklarda Sayma İlkeleri. Bu çalışmada çocukların bir sayma etkinliğinin geçerli olup olmadığı hakkındaki yargıları kullanılarak, sayma becerisinin doğuştan sahip olunan bir dizi örtük ilkeler tarafından yönlendirilip yönlendirilmediği incelenmiştir. Bu amaç doğrultusunda, bir grup okul öncesi çocuklardan videodan izledikleri bir aktör çocuğun hem anadilinde (İngilizce hem de bilmedikleri bir yabancı dilde (Türkçe yaptığı farklı hatalar içeren sayma serilerinin doğru veya yanlış olup olmadığı belirtmesi istenmiştir. Elde edilen sonuçlar çocukların sayma etkinliklerine rehberlik eden doğuştan getirdikleri örtük “sayma ilkelerine” sahip olduklarına ilişkin görüşleri destekler yönündedir. Örneğin, gerek İngilizce gerekse Türkçe sayma serilerinde, “standart (doğru sayma” serisi diğer tüm serilere göre anlamlı ölçüde “doğru” bir sayma olarak değerlendirilirken, T
Sunde, Peter; Jessen, Lonnie
2013-01-01
Spotlight surveys conducted by volunteers is a promising method to assess the abundance of nocturnally active mammals, but estimates are subject to bias if different observer groups differ in their ability to detect animals in the dark. We quantified the variation amongst volunteer spotlight...... with non-hunters and decreased as function of age but were independent of sex or educational background. If observer-specific detection probabilities were applied to real counting routes, point count estimates from inexperienced observers without a hunting background would only be 43 % (95 % CI, 39...
Photon-counting spaceborne altimeter simulator
Blazej, Josef
2004-11-01
We are presenting of a photon counting laser altimeter simulator. The simulator is designed to be a theoretical and numerical complement for a Technology Demonstrator of the space born laser altimeter for planetary studies built on our university. The European Space Agency has nominated the photon counting altimeter as one of the attractive devices for planetary research. The device should provide altimetry in the range 400 to 1400 km with one meter range resolution under rough conditions - Sun illumination, radiation, etc. The general altimeter concept expects the photon counting principle laser radar. According to this concept, the simulator is based on photon counting radar simulation, which has been enhanced to handle planetary surface roughness, vertical terrain profile and its reflectivity. The simulator is useful complement for any photon counting altimeter both for altimeter design and for measured data analysis. Our simulator enables to model the orbital motion, range, terrain profile, reflectivity, and their influence on the over all energy budget and the ultimate signal to noise ratio acceptable for the altimetry. The simulator can be adopted for various air or space born application.
Tree wavelet approximations with applications
XU Yuesheng; ZOU Qingsong
2005-01-01
We construct a tree wavelet approximation by using a constructive greedy scheme(CGS). We define a function class which contains the functions whose piecewise polynomial approximations generated by the CGS have a prescribed global convergence rate and establish embedding properties of this class. We provide sufficient conditions on a tree index set and on bi-orthogonal wavelet bases which ensure optimal order of convergence for the wavelet approximations encoded on the tree index set using the bi-orthogonal wavelet bases. We then show that if we use the tree index set associated with the partition generated by the CGS to encode a wavelet approximation, it gives optimal order of convergence.
Phylogenetic trees and Euclidean embeddings.
Layer, Mark; Rhodes, John A
2017-01-01
It was recently observed by de Vienne et al. (Syst Biol 60(6):826-832, 2011) that a simple square root transformation of distances between taxa on a phylogenetic tree allowed for an embedding of the taxa into Euclidean space. While the justification for this was based on a diffusion model of continuous character evolution along the tree, here we give a direct and elementary explanation for it that provides substantial additional insight. We use this embedding to reinterpret the differences between the NJ and BIONJ tree building algorithms, providing one illustration of how this embedding reflects tree structures in data.
王燕文
2007-01-01
Once there was a well-known hill here. There were many lush trees, beautiful flowers and green grasses on it. One day, the hill said to the trees proudly, “Look, how beautiful I am! But you look so ugly on my back. It must be better if I could drive you away.” One of the trees said, “You won't have beautiful and green clothing without us trees? If you leave us, you will die away.” The hill laughed and said again,”I feel very ashamed for I am staying with you together. Sooner or later I will drive you all...
Tree felling: a necessary evil
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...
Occurrence of leguminous trees
Kirkbride, J.H.; Arkcoll, D.B.A.; Turnbull, J.W.; Magalhaes, L.M.S.; Fernandes, N.P.
1984-01-01
Five papers from the symposium are presented. Kirkbride, J.H. Jr.; Legumes of the cerrado. pp 23-46 (Refs. 55) A review is given. Some 548 legume species in 59 genera are listed that have been reported from cerrado vegetation. Felker, P.; Legume trees in semi-arid and arid areas. pp 47-59 (Refs. 41) A review is given of worldwide research activities. Arkcoll, D.B.; A comparison of some fast growing species suitable for woodlots in the wet tropics. pp 61-68 (Refs. 9) Studies are described near Manaus on intensive silviculture (for fuelwood production) of Eucalyptus deglupta, Cedrelinga catanaeformis (catenaeformis), Jacaranda copaia, and Inga edulis. Turnbull, J.W.; Six phyllodinous Acacia species for planting in the humid tropical lowlands. pp 69-73 (Refs. 14) Distribution, ecology, growth, and utilization are described for A. auriculiformis, A. mangium, A. aulacocarpa, A. crassicarpa, A. cincinnata, and A. polystachya. Magalhaes, L.M.S., Fernandes, N.P.; Experimental stands of leguminous trees in the Manaus region. pp 75-79 (Refs. 8) Performance up to age 20 yr of Cedrelinga catenaeformis, Dalbergia nigra, Dinizia excelsa, Dipteryx odorata, Dipteryx sp., Diplotropis sp., Eperua bijuga, Pithecellobium racemosum, Vouacapoua pallidior, and Hymenaea sp. is described.
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.
Rasmuson, Marianne
2008-02-01
Heredity can be followed in persons or in genes. Persons can be identified only a few generations back, but simplified models indicate that universal ancestors to all now living persons have occurred in the past. Genetic variability can be characterized as variants of DNA sequences. Data are available only from living persons, but from the pattern of variation gene trees can be inferred by means of coalescence models. The merging of lines backwards in time leads to a MRCA (most recent common ancestor). The time and place of living for this inferred person can give insights in human evolutionary history. Demographic processes are incorporated in the model, but since culture and customs are known to influence demography the models used ought to be tested against available genealogy. The Icelandic data base offers a possibility to do so and points to some discrepancies. Mitochondrial DNA and Y chromosome patterns give a rather consistent view of human evolutionary history during the latest 100 000 years but the earlier epochs of human evolution demand gene trees with longer branches. The results of such studies reveal as yet unsolved problems about the sources of our genome.
Hwang, FK; Winter, P
1992-01-01
The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all the points will be shorter than otherwise possible. These new points are called Steiner points - locating them has proved problematic and research has diverged along many different avenues. This volume is devoted to the assimilation of the rich field of intriguing analyses and the consolidation of the fragments. A section has been given to each of the three major areas of interest which have emerged. The first concerns the Euclidean Steiner Problem, historically the original Steiner tree problem proposed by Jarník and Kössler in 1934. The second deals with the Steiner Problem in Networks, which was propounded independently by Hakimi and Levin and has enjoyed the most...
Sussing Merger Trees: A proposed Merger Tree data format
Thomas, Peter A; Tweed, Dylan; Benson, Andrew J; Croton, Darren; Elahi, Pascal; Henriques, Bruno; Iliev, Ilian T; Knebe, Alexander; Lux, Hanni; Mao, Yao-Yuan; Neyrinck, Mark; Pearce, Frazer R; Rodriguez-Gomez, Vicente; Schneider, Aurel; Srisawat, Chaichalit
2015-01-01
We propose a common terminology for use in describing both temporal merger trees and spatial structure trees for dark-matter halos. We specify a unified data format in HDF5 and provide example I/O routines in C, FORTRAN and PYTHON.
DIF Trees: Using Classification Trees to Detect Differential Item Functioning
Vaughn, Brandon K.; Wang, Qiu
2010-01-01
A nonparametric tree classification procedure is used to detect differential item functioning for items that are dichotomously scored. Classification trees are shown to be an alternative procedure to detect differential item functioning other than the use of traditional Mantel-Haenszel and logistic regression analysis. A nonparametric…
Tree Decomposition based Steiner Tree Computation over Large Graphs
2013-01-01
In this paper, we present an exact algorithm for the Steiner tree problem. The algorithm is based on certain pre-computed index structures. Our algorithm offers a practical solution for the Steiner tree problems on graphs of large size and bounded number of terminals.
Moraes, D; Nygård, E
2008-01-01
This ASIC is a counting mode front-end electronic optimized for the readout of CdZnTe/CdTe and silicon sensors, for possible use in applications where the flux of ionizing radiation is high. The chip is implemented in 0.25 μm CMOS technology. The circuit comprises 128 channels equipped with a transimpedance amplifier followed by a gain shaper stage with 21 ns peaking time, two discriminators and two 18-bit counters. The channel architecture is optimized for the detector characteristics in order to achieve the best energy resolution at counting rates of up to 5 M counts/second. The amplifier shows a linear sensitivity of 118 mV/fC and an equivalent noise charge of about 711 e−, for a detector capacitance of 5 pF. Complete evaluation of the circuit is presented using electronic pulses and pixel detectors.
High Count Rate Electron Probe Microanalysis
Geller, Joseph D.; Herrington, Charles
2002-01-01
Reducing the measurement uncertainty of quantitative analyses made using electron probe microanalyzers (EPMA) requires a careful study of the individual uncertainties from each definable step of the measurement. Those steps include measuring the incident electron beam current and voltage, knowing the angle between the electron beam and the sample (takeoff angle), collecting the emitted x rays from the sample, comparing the emitted x-ray flux to known standards (to determine the k-ratio) and transformation of the k-ratio to concentration using algorithms which includes, as a minimum, the atomic number, absorption, and fluorescence corrections. This paper discusses the collection and counting of the emitted x rays, which are diffracted into the gas flow or sealed proportional x-ray detectors. The representation of the uncertainty in the number of collected x rays collected reduces as the number of counts increase. The uncertainty of the collected signal is fully described by Poisson statistics. Increasing the number of x rays collected involves either counting longer or at a higher counting rate. Counting longer means the analysis time increases and may become excessive to get to the desired uncertainty. Instrument drift also becomes an issue. Counting at higher rates has its limitations, which are a function of the detector physics and the detecting electronics. Since the beginning of EPMA analysis, analog electronics have been used to amplify and discriminate the x-ray induced ionizations within the proportional counter. This paper will discuss the use of digital electronics for this purpose. These electronics are similar to that used for energy dispersive analysis of x rays with either Si(Li) or Ge(Li) detectors except that the shaping time constants are much smaller. PMID:27446749
Count rate performance of a silicon-strip detector for photon-counting spectral CT
Liu, X.; Grönberg, F.; Sjölin, M.; Karlsson, S.; Danielsson, M.
2016-08-01
A silicon-strip detector is developed for spectral computed tomography. The detector operates in photon-counting mode and allows pulse-height discrimination with 8 adjustable energy bins. In this work, we evaluate the count-rate performance of the detector in a clinical CT environment. The output counts of the detector are measured for x-ray tube currents up to 500 mA at 120 kV tube voltage, which produces a maximum photon flux of 485 Mphotons/s/mm2 for the unattenuated beam. The corresponding maximum count-rate loss of the detector is around 30% and there are no saturation effects. A near linear relationship between the input and output count rates can be observed up to 90 Mcps/mm2, at which point only 3% of the input counts are lost. This means that the loss in the diagnostically relevant count-rate region is negligible. A semi-nonparalyzable dead-time model is used to describe the count-rate performance of the detector, which shows a good agreement with the measured data. The nonparalyzable dead time τn for 150 evaluated detector elements is estimated to be 20.2±5.2 ns.
Trees and Shrubs for Overhead Utility Easements
Appleton, Bonnie Lee, 1948-2012; French, Sue (Sue C.); Johnson-Asnicar, Brenda; Relf, Diane; Day, Susan D.; Nunnally, Richard, 1947-; Vest, John
2009-01-01
Trees are one of the major causes of power outages in areas of overhead utility lines due to direct tree contact with lines, or to trees or tree limbs falling on the lines. This publication covers conflict resolution options and tree selection and planting when dealing with landscaping around power lines.
Counting dyons in N = 4 string theory
Dijkgraaf, Robbert; Verlinde, Erik; Verlinde, Herman
1997-02-01
We present a microscopic index formula for the degeneracy of dyons in four-dimensional N = 4 string theory. This counting formula is manifestly symmetric under the duality group, and its asymptotic growth reproduces the macroscopic Bekenstein-Hawking entropy. We give a derivation of this result in terms of the type 11 five-brane compactified on K3, by assuming that its fluctuations are described by a closed string theory on its world-volume. We find that the degeneracies are given in terms of the denominator of a generalized super Kac-Moody algebra. We also discuss the correspondence of this result with the counting of D-brane states.
Counting dyons in N=4 string theory
Dijkgraaf, R; Verlinde, Herman L
1997-01-01
We present a microscopic index formula for the degeneracy of dyons in four-dimensional N=4 string theory. This counting formula is manifestly symmetric under the duality group, and its asymptotic growth reproduces the macroscopic Bekenstein-Hawking entropy. We give a derivation of this result in terms of the type II five-brane compactified on K3, by assuming that its fluctuations are described by a closed string theory on its world-volume. We find that the degeneracies are given in terms of the denominator of a generalized super Kac-Moody algebra. We also discuss the correspondence of this result with the counting of D-brane states.
Vernstrom, Tessa; Wall, Jasper; Scott, Douglas
2014-05-01
We describe an analysis of 3-GHz confusion-limited data from the Karl J. Jansky Very Large Array (VLA). We show that with minimal model assumptions, P(D), Bayesian and Markov-Chain Mone-Carlo (MCMC) methods can define the source count to levels some 10 times fainter than the conventional confusion limit. Our verification process includes a full realistic simulation that considers known information on source angular extent and clustering. It appears that careful analysis of the statistical properties of an image is more effective than counting individual objects.
The Borda count and agenda manipulation
Michael Dummett
1998-01-01
A standard objection to the Borda count, as an actual voting procedure, is that it is subject to agenda manipulation. The classical example is the introduction, in order to favour a candidate or option y, of a new option z ranked on every voter's preference scale immediately below y; y may as a result obtain the highest Borda count, although, if z had not been introduced, a different option would have done so. Strategic use of this device is not greatly to be feared, but it does point to a de...
Oil Palm Tree Detection with High Resolution Multi-Spectral Satellite Imagery
Panu Srestasathiern
2014-10-01
Full Text Available Oil palm tree is an important cash crop in Thailand. To maximize the productivity from planting, oil palm plantation managers need to know the number of oil palm trees in the plantation area. In order to obtain this information, an approach for palm tree detection using high resolution satellite images is proposed. This approach makes it possible to count the number of oil palm trees in a plantation. The process begins with the selection of the vegetation index having the highest discriminating power between oil palm trees and background. The index having highest discriminating power is then used as the primary feature for palm tree detection. We hypothesize that oil palm trees are located at the local peak within the oil palm area. To enhance the separability between oil palm tree crowns and background, the rank transformation is applied to the index image. The local peak on the enhanced index image is then detected by using the non-maximal suppression algorithm. Since both rank transformation and non-maximal suppression are window based, semi-variogram analysis is used to determine the appropriate window size. The performance of the proposed method was tested on high resolution satellite images. In general, our approach uses produced very accurate results, e.g., about 90 percent detection rate when compared with manual labeling.
Adjustable chain trees for proteins
Winter, Pawel; Fonseca, Rasmus
2012-01-01
A chain tree is a data structure for changing protein conformations. It enables very fast detection of clashes and free energy potential calculations. A modified version of chain trees that adjust themselves to the changing conformations of folding proteins is introduced. This results in much...
Temperature and tree growth [editorial
Michael G. Ryan
2010-01-01
Tree growth helps US forests take up 12% of the fossil fuels emitted in the USA (Woodbury et al. 2007), so predicting tree growth for future climates matters. Predicting future climates themselves is uncertain, but climate scientists probably have the most confidence in predictions for temperature. Temperatures are projected to rise by 0.2 Â°C in the next two decades,...
c, Aleksandar Ili\\'; Feng, Lihua
2011-01-01
The Harary index of a graph $G$ is recently introduced topological index, defined on the reverse distance matrix as $H(G)=\\sum_{u,v \\in V(G)}\\frac{1}{d(u,v)}$, where $d(u,v)$ is the length of the shortest path between two distinct vertices $u$ and $v$. We present the partial ordering of starlike trees based on the Harary index and we describe the trees with the second maximal and the second minimal Harary index. In this paper, we investigate the Harary index of trees with $k$ pendent vertices and determine the extremal trees with maximal Harary index. We also characterize the extremal trees with maximal Harary index with respect to the number of vertices of degree two, matching number, independence number, domination number, radius and diameter. In addition, we characterize the extremal trees with minimal Harary index and given maximum degree. We concluded that in all presented classes, the trees with maximal Harary index are exactly those trees with the minimal Wiener index, and vice versa.
Andersen, Esben Sloth
2002-01-01
The purpose of this paper is to bring forth an interaction between evolutionary economics and industrial systematics. The suggested solution is to reconstruct the "family tree" of the industries. Such a tree is based on similarities, but it may also reflect the evolutionary history in industries ...
Tree Hydraulics: How Sap Rises
Denny, Mark
2012-01-01
Trees transport water from roots to crown--a height that can exceed 100 m. The physics of tree hydraulics can be conveyed with simple fluid dynamics based upon the Hagen-Poiseuille equation and Murray's law. Here the conduit structure is modelled as conical pipes and as branching pipes. The force required to lift sap is generated mostly by…
Tree Hydraulics: How Sap Rises
Denny, Mark
2012-01-01
Trees transport water from roots to crown--a height that can exceed 100 m. The physics of tree hydraulics can be conveyed with simple fluid dynamics based upon the Hagen-Poiseuille equation and Murray's law. Here the conduit structure is modelled as conical pipes and as branching pipes. The force required to lift sap is generated mostly by…
Random Projection Trees Revisited
Dhesi, Aman
2010-01-01
The Random Projection Tree structures proposed in [Freund-Dasgupta STOC08] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of data. We prove new results for both the RPTreeMax and the RPTreeMean data structures. Our result for RPTreeMax gives a near-optimal bound on the number of levels required by this data structure to reduce the size of its cells by a factor $s \\geq 2$. We also prove a packing lemma for this data structure. Our final result shows that low-dimensional manifolds have bounded Local Covariance Dimension. As a consequence we show that RPTreeMean adapts to manifold dimension as well.
Gurau, R; Rivasseau, V
2008-01-01
We propose a new formalism for quantum field theory which is neither based on functional integrals, nor on Feynman graphs, but on marked trees. This formalism is constructive, i.e. it computes correlation functions through convergent rather than divergent expansions. It applies both to Fermionic and Bosonic theories. It is compatible with the renormalization group, and it allows to define non-perturbatively {\\it differential} renormalization group equations. It accommodates any general stable polynomial Lagrangian. It can equally well treat noncommutative models or matrix models such as the Grosse-Wulkenhaar model. Perhaps most importantly it removes the space-time background from its central place in QFT, paving the way for a nonperturbative definition of field theory in noninteger dimension.
Nieto-Barajas, Luis E; Müller, Peter
2012-03-01
Polya trees (PT) are random probability measures which can assign probability 1 to the set of continuous distributions for certain specifications of the hyperparameters. This feature distinguishes the PT from the popular Dirichlet process (DP) model which assigns probability 1 to the set of discrete distributions. However, the PT is not nearly as widely used as the DP prior. Probably the main reason is an awkward dependence of posterior inference on the choice of the partitioning subsets in the definition of the PT. We propose a generalization of the PT prior that mitigates this undesirable dependence on the partition structure, by allowing the branching probabilities to be dependent within the same level. The proposed new process is not a PT anymore. However, it is still a tail-free process and many of the prior properties remain the same as those for the PT.
Bertoin, Jean
2010-01-01
We consider random dynamics on the edges of a uniform Cayley tree with $n$ vertices, in which edges are either inflammable, fireproof, or burt. Every inflammable edge is replaced by a fireproof edge at unit rate, while fires start at smaller rate $n^{-\\alpha}$ on each inflammable edge, then propagate through the neighboring inflammable edges and are only stopped at fireproof edges. A vertex is called fireproof when all its adjacent edges are fireproof. We show that as $n\\to \\infty$, the density of fireproof vertices converges to 1 when $\\alpha>1/2$, to 0 when $\\alpha<1/2$, and to some non-degenerate random variable when $\\alpha=1/2$. We further study the connectivity of the fireproof forest, in particular the existence of a giant component.
A simple model of trees for unicellular maps
Chapuy, Guillaume; Fusy, Eric
2012-01-01
We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for these objects. In this paper, we give another bijection that explicitly describes the "recursive part" of the first bijection. As a result we obtain a very simple description of unicellular maps as pairs made by a plane tree and a permutation-like structure. All the previously known formulas follow as an immediate corollary or easy exercise, thus giving a bijective proof for each of them, in a unified way. For some of these formulas, this is the first bijective proof, e.g. the Harer-Zagier recurrence formula, or the Lehman-Walsh/Goupil-Schaeffer formulas. Thanks to previous work of the second author this also leads us to a new expression for Stanley character polynomials, which evaluate irreducible characters of the symmetric group.
Dimensional Reduction for the General Markov Model on Phylogenetic Trees.
Sumner, Jeremy G
2017-03-01
We present a method of dimensional reduction for the general Markov model of sequence evolution on a phylogenetic tree. We show that taking certain linear combinations of the associated random variables (site pattern counts) reduces the dimensionality of the model from exponential in the number of extant taxa, to quadratic in the number of taxa, while retaining the ability to statistically identify phylogenetic divergence events. A key feature is the identification of an invariant subspace which depends only bilinearly on the model parameters, in contrast to the usual multi-linear dependence in the full space. We discuss potential applications including the computation of split (edge) weights on phylogenetic trees from observed sequence data.
TREE DECOMPOSITIONS OF MULTIGRAPHS
SHI Minyong
1999-01-01
For a graph G, ifE(G) can be partitioned into several pairwise disjointsets as { E1, E2,……,El} such thatthe subgraph induced by Ei is a tree of orderki, (i=1,2, ……, l), then G is said to have a {k1,k2,……, kl}-tree-decomposition, denoted by {k1,k2,……, kl}∈G.For k≥1 and l≥0, a collection(G)(k,l) is the setof multigraphs such that G∈(G)(k,l) if and only if ε(G) = k(|G|-1)-l and ε(H)≤max{(k-1)(|H|-1), k(|H|-1)-l} for any subgraph H of G.We prove that (1) If k≥2, 0≤l≤3 and G∈(G)(k,l) of order n≥l+1, then {n,n,……, n-l}∈ G. (2) If k≥2 and G∈(G)(k,2) oforder n≥3, then {n,n,……, n,n-2}∈G and {n,n,……, n,n-1,n-1}∈G. (3) If k3 and G∈(G)(k,3) oforder n≥4, then {n,n,……, n,n-3}∈G ,{ n,n,……, n,n-1,n-2}∈ G and {n,n, ……, n,n-1,n-1,n-1}∈G.
Purahong, Witoon; Durka, Walter; Fischer, Markus; Dommert, Sven; Schöps, Ricardo; Buscot, François; Wubet, Tesfaye
2016-01-01
Tree species identity and tree genotypes contribute to the shaping of soil microbial communities. However, knowledge about how these two factors influence soil ecosystem functions is still lacking. Furthermore, in forest ecosystems tree genotypes co-occur and interact with each other, thus the effects of tree genotypic diversity on soil ecosystem functions merit attention. Here we investigated the effects of tree species, tree genotypes and genotypic diversity levels, alongside soil physicoch...
Modelling tree biomasses in Finland
Repola, J.
2013-06-01
Biomass equations for above- and below-ground tree components of Scots pine (Pinus sylvestris L), Norway spruce (Picea abies [L.] Karst) and birch (Betula pendula Roth and Betula pubescens Ehrh.) were compiled using empirical material from a total of 102 stands. These stands (44 Scots pine, 34 Norway spruce and 24 birch stands) were located mainly on mineral soil sites representing a large part of Finland. The biomass models were based on data measured from 1648 sample trees, comprising 908 pine, 613 spruce and 127 birch trees. Biomass equations were derived for the total above-ground biomass and for the individual tree components: stem wood, stem bark, living and dead branches, needles, stump, and roots, as dependent variables. Three multivariate models with different numbers of independent variables for above-ground biomass and one for below-ground biomass were constructed. Variables that are normally measured in forest inventories were used as independent variables. The simplest model formulations, multivariate models (1) were mainly based on tree diameter and height as independent variables. In more elaborated multivariate models, (2) and (3), additional commonly measured tree variables such as age, crown length, bark thickness and radial growth rate were added. Tree biomass modelling includes consecutive phases, which cause unreliability in the prediction of biomass. First, biomasses of sample trees should be determined reliably to decrease the statistical errors caused by sub-sampling. In this study, methods to improve the accuracy of stem biomass estimates of the sample trees were developed. In addition, the reliability of the method applied to estimate sample-tree crown biomass was tested, and no systematic error was detected. Second, the whole information content of data should be utilized in order to achieve reliable parameter estimates and applicable and flexible model structure. In the modelling approach, the basic assumption was that the biomasses of
Piacentini, F; Levi, M P; Avella, A; López, M; Kück, S; Polyakov, S V; Degiovanni, I P; Brida, G; Genovese, M
2015-04-01
Here we present a reconstruction of the positive operator-value measurement of a photon-number-resolving detector comprised of three 50∶50 beam-splitters in a tree configuration, terminated with four single-photon avalanche detectors. The four detectors' outputs are processed by an electronic board that discriminates detected photon number states from 0 to 4 and implements a "smart counting" routine to compensate for dead time issues at high count rates.
Sampling forest tree regeneration with a transect approach
D. Hessenmöller
2013-05-01
Full Text Available A new transect approach for sampling forest tree regeneration isdeveloped with the aim to minimize the amount of field measurements, and to produce an accurate estimation of tree species composition and density independent of tree height. This approach is based on the “probability proportional to size” (PPS theory to assess heterogeneous vegetation. This new method is compared with other approaches to assess forest regeneration based on simulated and measured, real data. The main result is that the transect approach requires about 50% of the time to assess stand density as compared to the plot approach, due to the fact that only 25% of the tree individuals are measured. In addition, tall members of the regeneration are counted with equal probability as small members. This is not the case in the plot approach. The evenness is 0.1 to 0.2 units larger in the transect by PPS than in the plot approach, which means that the plot approach shows a more homogeneous regeneration layer than the PPS approach, even though the stand densities and height distributions are similar. The species diversity is variable in both approaches and needs further investigations.
Sampling forest tree regeneration with a transect approach
D. Hessenmoeller
2013-07-01
Full Text Available A new transect approach for sampling forest tree regeneration is developed with the aim to minimize the amount of field measurements, and to produce an accurate estimation of tree species composition and density independent of tree height. This approach is based on the probability proportional to size (PPS theory to assess heterogeneous vegetation. This new method is compared with other approaches to assess forest regeneration based on simulated and measured, real data. The main result is that the transect approach requires about 50% of the time to assess stand density as compared to the plot approach, due to the fact that only 25% of the tree individuals are measured. In addition, tall members of the regeneration are counted with equal probability as small members. This is not the case in the plot approach. The evenness is 0.1 to 0.2 units larger in the transect by PPS than in the plot approach, which means that the plot approach shows a more homogenous regeneration layer than the PPS approach, even though the stand densities and height distributions are similar. The species diversity is variable in both approaches and needs further investigations.
Martins, Bo; Forchhammer, Søren
1998-01-01
Presently, sequential tree coders are the best general purpose bilevel image coders and the best coders of halftoned images. The current ISO standard, Joint Bilevel Image Experts Group (JBIG), is a good example. A sequential tree coder encodes the data by feeding estimates of conditional...... probabilities to an arithmetic coder. The conditional probabilities are estimated from co-occurrence statistics of past pixels, the statistics are stored in a tree. By organizing the code length calculations properly, a vast number of possible models (trees) reflecting different pixel orderings can...... is one order of magnitude slower than JBIG, obtains excellent and highly robust compression performance. A multipass free tree coding scheme produces superior compression results for all test images. A multipass free template coding scheme produces significantly better results than JBIG for difficult...
Quantum Computation and Decision Trees
Farhi, E; Farhi, Edward; Gutmann, Sam
1998-01-01
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root. We devise a quantum mechanical algorithm that evolves a state, initially localized at the root, through the tree. We prove that if the classical strategy succeeds in reaching level n in time polynomial in n, then so does the quantum algorithm. Moreover, we find examples of trees for which the classical algorithm requires time exponential in n, but for which the quantum algorithm succeeds in polynomial time. The examples we have so far, however, could also be solved in polynomial time by different classical algorithms.
Spatial Distribution and Site-Specific Spraying of Main Sucking Pests of Elm Trees.
Karimzadeh, R; Iranipour, S
2016-11-09
Elm trees are important landscape trees and sucking insects weaken the elm trees and produce large amounts of honeydew. The main objectives of this study were to identify main honeydew-producing pests of elm trees and do site-specific spraying against these pests. To map the spatial distribution of the sucking pests in the large scale, the study area was divided into 40 × 40 m grids and one tree was chosen randomly from each grid (a total of 55 trees). These trees were sampled twice a year in 2011 and 2012. Each sample was a 30-cm branch terminal. Eight samples were taken from each tree in four cardinal directions and two canopy levels. The number of sucking insects and leaves of each sample were counted and recorded. Spatial analysis of the data was carried out using geostatistics. Kriging was used for producing prediction maps. Insecticide application was restricted to the regions with populations higher than threshold. To identify within-tree distribution of the honeydew-producing pests, six and four elm trees were chosen in 2011 and 2012 respectively, and sampled weekly. These trees were sampled as described previously. European elm scale (EES), Gossyparia spuria (Modeer) and two species of aphids were the dominant honeydew-producing pests. The results revealed that the effects of direction, canopy level and their interactions on insect populations were not statistically significant (P < 0.05). Site-specific spraying decreased the amount of insecticides used by ca. 20%, while satisfactory control of the sucking pests and honeydew excretion was obtained. Considering the environmental and economic benefits of site-specific spraying, it is worth doing more complementary works in this area.
An analytical model of crater count equilibrium
Hirabayashi, Masatoshi; Minton, David A.; Fassett, Caleb I.
2017-06-01
Crater count equilibrium occurs when new craters form at the same rate that old craters are erased, such that the total number of observable impacts remains constant. Despite substantial efforts to understand this process, there remain many unsolved problems. Here, we propose an analytical model that describes how a heavily cratered surface reaches a state of crater count equilibrium. The proposed model formulates three physical processes contributing to crater count equilibrium: cookie-cutting (simple, geometric overlap), ejecta-blanketing, and sandblasting (diffusive erosion). These three processes are modeled using a degradation parameter that describes the efficiency for a new crater to erase old craters. The flexibility of our newly developed model allows us to represent the processes that underlie crater count equilibrium problems. The results show that when the slope of the production function is steeper than that of the equilibrium state, the power law of the equilibrium slope is independent of that of the production function slope. We apply our model to the cratering conditions in the Sinus Medii region and at the Apollo 15 landing site on the Moon and demonstrate that a consistent degradation parameterization can successfully be determined based on the empirical results of these regions. Further developments of this model will enable us to better understand the surface evolution of airless bodies due to impact bombardment.
A multilevel analysis of intercompany claim counts
Antonio, K.; Frees, E.W.; Valdez, E.A.
2009-01-01
In this paper, we use multilevel models to analyze data on claim counts provided by the General Insurance Association of Singapore, an organization consisting of most of the general insurers in Singapore. Our data comes from the financial records of automobile insurance policies followed over a peri
Asynchronous ASCII Event Count Status Code
2012-03-01
IRIG STANDARD 215-12 TELECOMMUNICATIONS AND TIMING GROUP ASYNCHRONOUS ASCII EVENT COUNT STATUS CODES...Inter-range Instrumentation Group ( IRIG ) Standard for American Standard Code for Information Interchange (ASCII)-formatted EC status transfer which can be...circuits and Ethernet networks. Provides systems engineers and equipment vendors with an Inter-range Instrumentation Group ( IRIG ) Standard for American
Approximately Counting Embeddings into Random Graphs
Furer, Martin
2008-01-01
Let H be a graph, and let C(H,G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C(H,G). Previous results cover only a few specific instances of this general problem, for example, the case when H has degree at most one (monomer-dimer problem). In this paper, we present the first general subcase of the subgraph isomorphism counting problem which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labeling of the vertices generating a sequence of bipartite graphs. The decomposition permits us to break the problem of counting embeddings of large subgraphs into that of counting embeddings of small subgraphs. Using this method, we present a simple randomized algorithm for the counting problem. For all decomposable graphs H and all graphs G, the algorithm is an unbiased estimator. Furthermore, for all graphs H having a decomposition where each of the bipa...
Differential white cell count by centrifugal microfluidics.
Sommer, Gregory Jon; Tentori, Augusto M.; Schaff, Ulrich Y.
2010-07-01
We present a method for counting white blood cells that is uniquely compatible with centrifugation based microfluidics. Blood is deposited on top of one or more layers of density media within a microfluidic disk. Spinning the disk causes the cell populations within whole blood to settle through the media, reaching an equilibrium based on the density of each cell type. Separation and fluorescence measurement of cell types stained with a DNA dye is demonstrated using this technique. The integrated signal from bands of fluorescent microspheres is shown to be proportional to their initial concentration in suspension. Among the current generation of medical diagnostics are devices based on the principle of centrifuging a CD sized disk functionalized with microfluidics. These portable 'lab on a disk' devices are capable of conducting multiple assays directly from a blood sample, embodied by platforms developed by Gyros, Samsung, and Abaxis. [1,2] However, no centrifugal platform to date includes a differential white blood cell count, which is an important metric complimentary to diagnostic assays. Measuring the differential white blood cell count (the relative fraction of granulocytes, lymphocytes, and monocytes) is a standard medical diagnostic technique useful for identifying sepsis, leukemia, AIDS, radiation exposure, and a host of other conditions that affect the immune system. Several methods exist for measuring the relative white blood cell count including flow cytometry, electrical impedance, and visual identification from a stained drop of blood under a microscope. However, none of these methods is easily incorporated into a centrifugal microfluidic diagnostic platform.
A multilevel analysis of intercompany claim counts
Antonio, K.; Frees, E.W.; Valdez, E.A.
2009-01-01
In this paper, we use multilevel models to analyze data on claim counts provided by the General Insurance Association of Singapore, an organization consisting of most of the general insurers in Singapore. Our data comes from the financial records of automobile insurance policies followed over a peri
Kids Count in Delaware: Fact Book, 1995.
Delaware Univ., Newark. Kids Count in Delaware.
This Kids Count fact book examines statewide trends in the well-being of Delaware's children. The statistical portrait is based on key indicators in four areas: single-parent families, births to teenage mothers, juvenile crime and violence, and education. Following brief sections on the state's demographics and economic status, the fact book…
ESL Proficiency and a Word Frequency Count.
Harlech-Jones, Brian
1983-01-01
In a study of the vocabulary proficiency of some South African ESL teacher trainees, the General Service List of English Words' validity was evaluated. It was found that mastery of this list would meet most of the vocabulary needs of the test group. Recommendations are made for practical uses of word counts. (MSE)
KIDS COUNT in Virginia, 2001 [Data Book].
Action Alliance for Virginia's Children and Youth, Richmond.
This Kids Count data book details statewide trends in the well-being of Virginia's children. The statistical portrait is based on the following four areas of children's well-being: health and safety; education; family; and economy. Key indicators examined are: (1) prenatal care; (2) low birth weight babies; (3) infant mortality; (4) child abuse or…
Renormalization of singular potentials and power counting
Long, B.; van Koick, U.; van Kolck, U.
2008-01-01
We use a toy model to illustrate how to build effective theories for singular potentials. We consider a central attractive 1/r(2) potential perturbed by a 1/r(4) correction. The power-counting rule, an important ingredient of effective theory, is established by seeking the minimum set of short-range
Reduced Component Count RGB LED Driver
De Pedro, I.; Ackermann, B.
2008-01-01
The goal of this master thesis is to develop new drive and contrololutions, for creating white light from mixing the light of different-color LEDs, aiming at a reduced component count resulting in less space required by the electronics and lower cost. It evaluates the LED driver concept proposed in
Single Entity Electrochemistry Progresses to Cell Counting.
Gooding, J Justin
2016-10-10
Red blood cells have been counted in an electrochemical collision experiment recently described by Compton and co-workers. As a cell collides with the electrode it lyses and a current is observed from the reduction of oxygen from within the cell.
Stalking the count. Dracula, Fandom and Tourism
S.L. Reijnders (Stijn)
2011-01-01
textabstractLarge numbers of tourists travel to Transylvania every year, looking for traces of Count Dracula. This article investigates why people feel the need to connect fictional stories, such as Dracula, with identifiable physical locations, and why they subsequently want to visit these
Statistical tests to compare motif count exceptionalities
Vandewalle Vincent
2007-03-01
Full Text Available Abstract Background Finding over- or under-represented motifs in biological sequences is now a common task in genomics. Thanks to p-value calculation for motif counts, exceptional motifs are identified and represent candidate functional motifs. The present work addresses the related question of comparing the exceptionality of one motif in two different sequences. Just comparing the motif count p-values in each sequence is indeed not sufficient to decide if this motif is significantly more exceptional in one sequence compared to the other one. A statistical test is required. Results We develop and analyze two statistical tests, an exact binomial one and an asymptotic likelihood ratio test, to decide whether the exceptionality of a given motif is equivalent or significantly different in two sequences of interest. For that purpose, motif occurrences are modeled by Poisson processes, with a special care for overlapping motifs. Both tests can take the sequence compositions into account. As an illustration, we compare the octamer exceptionalities in the Escherichia coli K-12 backbone versus variable strain-specific loops. Conclusion The exact binomial test is particularly adapted for small counts. For large counts, we advise to use the likelihood ratio test which is asymptotic but strongly correlated with the exact binomial test and very simple to use.
Adaptive and Approximate Orthogonal Range Counting
Chan, Timothy M.; Wilkinson, Bryan Thomas
2013-01-01
, we consider the 1-D range selection problem, where a query in an array involves finding the kth least element in a given subarray. This problem is closely related to 2-D 3-sided orthogonal range counting. Recently, Jørgensen and Larsen [SODA 2011] presented a linear-space adaptive data structure...
Health Advocacy--Counting the Costs
Dyall, Lorna; Marama, Maria
2010-01-01
Access to, and delivery of, safe and culturally appropriate health services is increasingly important in New Zealand. This paper will focus on counting the costs of health advocacy through the experience of a small non government charitable organisation, the Health Advocates Trust, (HAT) which aimed to provide advocacy services for a wide range of…
Fast box-counting algorithm on GPU.
Jiménez, J; Ruiz de Miras, J
2012-12-01
The box-counting algorithm is one of the most widely used methods for calculating the fractal dimension (FD). The FD has many image analysis applications in the biomedical field, where it has been used extensively to characterize a wide range of medical signals. However, computing the FD for large images, especially in 3D, is a time consuming process. In this paper we present a fast parallel version of the box-counting algorithm, which has been coded in CUDA for execution on the Graphic Processing Unit (GPU). The optimized GPU implementation achieved an average speedup of 28 times (28×) compared to a mono-threaded CPU implementation, and an average speedup of 7 times (7×) compared to a multi-threaded CPU implementation. The performance of our improved box-counting algorithm has been tested with 3D models with different complexity, features and sizes. The validity and accuracy of the algorithm has been confirmed using models with well-known FD values. As a case study, a 3D FD analysis of several brain tissues has been performed using our GPU box-counting algorithm.
Adaptive and Approximate Orthogonal Range Counting
Chan, Timothy M.; Wilkinson, Bryan Thomas
2013-01-01
, we consider the 1-D range selection problem, where a query in an array involves finding the kth least element in a given subarray. This problem is closely related to 2-D 3-sided orthogonal range counting. Recently, Jørgensen and Larsen [SODA 2011] presented a linear-space adaptive data structure...
Going Online to Make Learning Count
Brigham, Cathy; Klein-Collins, Rebecca
2011-01-01
Adult students often come to higher education with college-level learning that they have acquired outside of the classroom--from the workplace, military service, self-study, or hobbies. For decades, many forward-thinking colleges and universities have been offering services to evaluate that learning and award it college credit that counts towards…
ADAPTIVE COUNTING RULE FOR COOPERATIVE SPECTRUM SENSING UNDER CORRELATED ENVIRONMENTS
Pratas, Nuno; Marchetti, Nicola; Prasad, Neeli R.;
2010-01-01
counting rule to perform the data fusion. The proposed scheme is evaluated against other common counting rules (e.g. 1-out-of-n and n-out-of-n) and the optimum counting rule, under different correlation conditions. The impact of correlation on the performance of the data fusion schemes, based on counting...
Quantum abacus for counting and factorizing numbers
Suslov, M. V.; Lesovik, G. B.; Blatter, G.
2011-05-01
We generalize the binary quantum counting algorithm of Lesovik, Suslov, and Blatter [Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.82.012316 82, 012316 (2010)] to higher counting bases. The algorithm makes use of qubits, qutrits, and qudits to count numbers in a base-2, base-3, or base-d representation. In operating the algorithm, the number n
Emuchay, Charles Iheanyichi; Okeniyi, Shemaiah Olufemi; Okeniyi, Joshua Olusegun
2014-04-01
The expensive and technology limited setting of CD4 count testing is a major setback to the initiation of HAART in a resource limited country like Nigeria. Simple and inexpensive tools such as Hemoglobin (Hb) measurement and Total Lymphocyte Count (TLC) are recommended as substitute marker. In order to assess the correlations of these parameters with CD4 count, 100 "apparently healthy" male volunteers tested HIV positive aged ≥ 20 years but ≤ 40 years were recruited and from whom Hb, Hct, TLC and CD4 count were obtained. The correlation coefficients, R, the Nash-Sutcliffe Coefficient of Efficiency (CoE) and the p-values of the ANOVA model of Hb, Hct and TLC with CD4 count were assessed. The assessments show that there is no significant relationship of any of these parameters with CD4 count and the correlation coefficients are very weak. This study shows that Hb, Hct and TLC cannot be substitute for CD4 count as this might lead to certain individuals' deprivation of required treatment.
To count or not to count: the effect of instructions on expecting a break in timing.
Gaudreault, Rémi; Fortin, Claudette
2013-04-01
When a break is expected during a time interval production, longer intervals are produced as the break occurs later during the interval. This effect of break location was interpreted as a result of distraction related to break expectancy in previous studies. In the present study, the influence of target duration and of instructions about chronometric counting strategies on the break location effect was examined. Using a strategy such as chronometric counting enhances the reliability of temporal processing, typically in terms of reduced variability, and could influence how timing is affected by break expectancy, especially when relatively long target durations are used. In two experiments, results show that time productions lengthened with increasing value of break location at various target durations and that variability was greater in the no-counting than in the counting instruction condition. More important, the break location effect was stronger in the no-counting than in the counting instruction condition. We conclude that chronometric counting orients attention toward timing processes, making them less likely to be disrupted by concurrent nontemporal processes.
Hideaki Taira
1998-01-01
Full Text Available Prediction of yearly atmospheric pollen counts is a very important component in the prevention of allergenic symptoms. We investigated the relationship between atomspheric pollen counts and the formation of male flowers of Cryptomeriajaponica D. Don (C. japonica. An atmospheric pollen survey of C. japonica was conducted from 1983 to 1996 using a Durham’s sampler. A regression analysis was performed between the total pollen count and July temperature in previous years. The atmospheric pollen counts of C. japonica had a high positive correlation with the mean temperature in July of the previous year. However, the predicted using average mean July temperature records of the previous year were insufficient, especially in years following high pollen count. In experimental conditions, using 60 C. japonica trees in pots, the formation of male flowers was shown to increase with a rise in incubation temperature. In a forest of C. japonica, our results showed that the length and weight of new needle growth from old needles, which produced many flowers in the previous year, were shorter and lighter, respectively. These aerobiological and plant physiological studies provide evidence that a smaller number of pollen counts are a common result in a year following one in which many male flowers are produced, even if the mean July temperature of that year was high.
Aksoy, Asuman Guven
2010-01-01
Using isometric embedding of metric trees into Banach spaces, this paper will investigate barycenters, type and cotype, and various measures of compactness of metric trees. A metric tree ($T$, $d$) is a metric space such that between any two of its points there is an unique arc that is isometric to an interval in $\\mathbb{R}$. We begin our investigation by examining isometric embeddings of metric trees into Banach spaces. We then investigate the possible images $x_0=\\pi ((x_1+\\ldots+x_n)/n)$, where $\\pi$ is a contractive retraction from the ambient Banach space $X$ onto $T$ (such a $\\pi$ always exists) in order to understand the "metric" barycenter of a family of points $ x_1, \\ldots,x_n$ in a tree $T$. Further, we consider the metric properties of trees such as their type and cotype. We identify various measures of compactness of metric trees (their covering numbers, $\\epsilon$-entropy and Kolmogorov widths) and the connections between them. Additionally, we prove that the limit of the sequence of Kolmogorov...
Lowell; Ponte; 史书碧
1998-01-01
文章开头说:Trees are so common and quiet that we pay them little mind. 其实,初见此标题——What Good Is a Tree?笔者也pay this essay little mind。这个题目还能够讲出多少新意来呢?不料,细读之后,竟不忍释手! Trees sustain our lives and our planet in a thousand practical ways. Trees do more than make life pleasant;they make life possible. 这是文章的两句主题句。读罢全文,认真一想,便觉这决非耸人听闻之言:无言的树,“挪死”的树,支撑着我们这个星球,庇护着天下的生灵！诸如: …they draw carbon dioxide from the air…and oxygen iS released. Without tree our entire world would be a much drier place. For centuries,the Chinese have derived medicines form the ginkgo tree. 让读者双眼一亮的是,文章提供了许多你我都不曾想到的有关树的信息: a.树木能彼此互通信息: …trees send unseen signals to each other.When willows are attacked bywebworms and tent caterpillars,they give off a chemical that alerts nearby trees.Theneighboring trees respond by pumping more tannin into their leaves,making them moredifficult for the insects tO digest。 更让人?
Davies, D.J.G.; Macfarlane, R.P.
1979-01-01
The potential for soil conservation and agroforestry of several native and exotic legumes is discussed. Flowering period, chemical composition of leaves/pods, hardiness to frost and drought, timber value, forage potential for livestock and bees, ornamental value and other products are tabulated with information on up to 38 species. Two low-growing species that have proved useful for slope stabilization as well as forage are tree lucerne (Cytisus palmensis) and tree medick (Medicago arborea), the latter being shrubby and more suitable for cold districts. Gleditsia triacanthos is recommended as a shade and fodder tree for farm pasture.
Memory effect in growing trees
Malarz, K.; Kulakowski, K.
2003-01-01
We show that the structure of a growing tree preserves an information on the shape of an initial graph. For the exponential trees, evidence of this kind of memory is provided by means of the iterative equations, derived for the moments of the node-node distance distribution. Numerical calculations confirm the result and allow to extend the conclusion to the Barabasi--Albert scale-free trees. The memory effect almost disappears, if subsequent nodes are connected to the network with more than o...
SPDE Approximation for Random Trees
Bakhtin, Yuri
2009-01-01
We consider the genealogy tree for a critical branching process conditioned on non-extinction. We enumerate vertices in each generation of the tree so that for each two generations one can define a monotone map describing the ancestor--descendant relation between their vertices. We show that under appropriate rescaling this family of monotone maps converges in distribution in a special topology to a limiting flow of discontinuous monotone maps which can be seen as a continuum tree. This flow is a solution of an SPDE with respect to a Brownian sheet.
赵明
2005-01-01
Trees are useful to man in three impor-tant ways. They provide him with wood and other products;they give him shade;they help prevent drought(干旱)and floods. Unfortunately,in many parts of the world, man has not realized that the third one is the most important. Two thousand years ago a rich and pow-erful country cut down its trees to build war-ships, with which to gain itself an empire. It gained the empire,however,without its trees, its soil became hard and poor. When the em-pire fell to pieces, the home c...
Sang, T.
1980-04-01
For centuries Chinese peasants have planted paulownia trees, not only for their beauty but also for their fast-growing characteristics - an amazing average of 0.37 cubic meters of timber per year. The leaves, flowers, fruits and bark can be used as medicines and, because of their high nitrogen content the leaves are used as fodder. But above all, paulownias are increasingly being used by Chinese peasants to boost grain output. In Lanka county, Henan province, for example, grain output has increased to an average of 5.25 tons per hectare from less than 0.75 tons in 1963 when paulownia interplanting as a system was introduced. They help crops to withstand sandstorms, droughts and frosts, they increase air humidity and reduce evaporation of moisture in the fields. They do not compete with crops for fertilizer and water since about 80% of their absorbing roots reach a depth of 40-100 cm, while most cereals roots are less than 40 cm.
Falls from trees and tree associated injuries in rural Melanesians.
Barss, P; Dakulala, P; Doolan, M
Falls from trees and other tree related injuries are the most common cause of trauma in some parts of rural Melanesia. A four year review of all admissions for trauma to the Provincial Hospital at Alotau, Milne Bay Province, Papua New Guinea, showed that 27% were due to falls from trees, and a further 10% were due to related injuries, such as being struck by a falling branch or a coconut. A questionnaire distributed to rural health centres showed that during the study period at least 28 villagers died from falls from trees before reaching hospital. Head and chest trauma were common causes of death. Many injured patients were boys. Forearm fractures were the most common injuries, but more serious injuries were also frequently encountered. Trees responsible for most deaths and injuries included the coconut palm, betel palm, mango, and breadfruit. There are many strategies for preventing such injuries; perhaps the most important is to stop small boys climbing tall trees. Such falls are a serious occupational hazard for many subsistence farmers.
Counting dyons in N=4 string theory
Dijkgraaf, R. [Amsterdam Univ. (Netherlands). Dept. of Mathematics and Computer Science; Verlinde, E. [TH-Division, CERN, CH-1211 Geneva 23 (Switzerland)]|[Institute for Theoretical Physics, Universtity of Utrecht, 3508 TA Utrecht (Netherlands); Verlinde, H. [Institute for Theoretical Physics, University of Amsterdam, 1018 XE Amsterdam (Netherlands)]|[Joseph Henry Laboratories, Princeton University, Princeton, NJ 08544 (United States)
1997-01-27
We present a microscopic index formula for the degeneracy of dyons in four-dimensional N=4 string theory. This counting formula is manifestly symmetric under the duality group, and its asymptotic growth reproduces the macroscopic Bekenstein-Hawking entropy. We give a derivation of this result in terms of the type II five-brane compactified on K3, by assuming that its fluctuations are described by a closed string theory on its world-volume. We find that the degeneracies are given in terms of the denominator of a generalized super Kac-Moody algebra. We also discuss the correspondence of this result with the counting of D-brane states. (orig.).
Efficient Prime Counting and the Chebyshev Primes
Michel Planat
2013-01-01
Full Text Available The function where is the logarithm integral and the number of primes up to is well known to be positive up to the (very large Skewes' number. Likewise, according to Robin's work, the functions and , where and are Chebyshev summatory functions, are positive if and only if Riemann hypothesis (RH holds. One introduces the jump function at primes and one investigates , , and . In particular, , and for . Besides, for any odd , an infinite set of the so-called Chebyshev primes. In the context of RH, we introduce the so-called Riemann primes as champions of the function (or of the function . Finally, we find a good prime counting function , that is found to be much better than the standard Riemann prime counting function.
MOIRCS Deep Survey. I: DRG Number Counts
Kajisawa, M; Suzuki, R; Tokoku, C; Uchimoto, Y K; Yoshikawa, T; Akiyama, M; Ichikawa, T; Ouchi, M; Omata, K; Tanaka, I; Nishimura, T; Yamada, T; Kajisawa, Masaru; Konishi, Masahiro; Suzuki, Ryuji; Tokoku, Chihiro; Uchimoto, Yuka Katsuno; Yoshikawa, Tomohiro; Akiyama, Masayuki; Ichikawa, Takashi; Ouchi, Masami; Omata, Koji; Tanaka, Ichi; Nishimura, Tetsuo; Yamada, Toru
2006-01-01
We use very deep near-infrared imaging data taken with Multi-Object InfraRed Camera and Spectrograph (MOIRCS) on the Subaru Telescope to investigate the number counts of Distant Red Galaxies (DRGs). We have observed a 4x7 arcmin^2 field in the Great Observatories Origins Deep Survey North (GOODS-N), and our data reach J=24.6 and K=23.2 (5sigma, Vega magnitude). The surface density of DRGs selected by J-K>2.3 is 2.35+-0.31 arcmin^-2 at K22 is smaller than that expected from the number counts at the brighter magnitude. The result indicates that while there are many bright galaxies at 222 suggest that the mass-dependent color distribution, where most of low-mass galaxies are blue while more massive galaxies tend to have redder colors, had already been established at that epoch.
Direct calibration of click-counting detectors
Bohmann, M.; Kruse, R.; Sperling, J.; Silberhorn, C.; Vogel, W.
2017-03-01
We introduce and experimentally implement a method for the detector calibration of photon-number-resolving time-bin multiplexing layouts based on the measured click statistics of superconducting nanowire detectors. In particular, the quantum efficiencies, the dark count rates, and the positive operator-valued measures of these measurement schemes are directly obtained with high accuracy. The method is based on the moments of the click-counting statistics for coherent states with different coherent amplitudes. The strength of our analysis is that we can directly conclude—on a quantitative basis—that the detection strategy under study is well described by a linear response function for the light-matter interaction and that it is sensitive to the polarization of the incident light field. Moreover, our method is further extended to a two-mode detection scenario. Finally, we present possible applications for such well-characterized detectors, such as sensing of atmospheric loss channels and phase sensitive measurements.
Going Online to Make Learning Count
Cathy Brigham
2011-01-01
Full Text Available Adult students often come to higher education with college-level learning that they have acquired outside of the classroom – from the workplace, military service, self-study, or hobbies. For decades, many forward-thinking colleges and universities have been offering services to evaluate that learning and award it college credit that counts towards a degree. However, for a range of reasons, not every institution can offer prior learning assessment (PLA in every discipline or for every student. With funding from several U.S. philanthropic organizations, the Council for Adult and Experiential Learning (CAEL is launching Learning Counts, a national online service that will offer students a range of opportunities to have their learning evaluated for college credit. This online service will expand the capacity of institutions offering PLA to students and provide an efficient and scalable delivery mechanism for the awarding of credit through PLA.
Mesoscopic full counting statistics and exclusion models
Roche, P.-E.; Derrida, B.; Douçot, B.
2005-02-01
We calculate the distribution of current fluctuations in two simple exclusion models. Although these models are classical, we recover even for small systems such as a simple or a double barrier, the same distibution of current as given by traditional formalisms for quantum mesoscopic conductors. Due to their simplicity, the full counting statistics in exclusion models can be reduced to the calculation of the largest eigenvalue of a matrix, the size of which is the number of internal configurations of the system. As examples, we derive the shot noise power and higher order statistics of current fluctuations (skewness, full counting statistics, ....) of various conductors, including multiple barriers, diffusive islands between tunnel barriers and diffusive media. A special attention is dedicated to the third cumulant, which experimental measurability has been demonstrated lately.
Counting and Enumeration Problems with Bounded Treewidth
Pichler, Reinhard; Rümmele, Stefan; Woltran, Stefan
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. This result was extended to counting problems by Arnborg et al. and to enumeration problems by Flum et al. Despite the undisputed importance of these results for proving fixed-parameter tractability, they do not directly yield implementable algorithms. Recently, Gottlob et al. presented a new approach using monadic datalog to close the gap between theoretical tractability and practical computability for MSO-definable decision problems. In the current work we show how counting and enumeration problems can be tackled by an appropriate extension of the datalog approach.
Pharmacy Automation-Pill Counting Design
Omer Mohamed Adam Adlan
2015-03-01
Full Text Available Dispensing medications in a community pharmacy was a time-consuming operation. The pharmacist dispensed most prescriptions that were in tablet or capsule form with a simple tray and spatula. Many new medications were being developed by pharmaceutical manufacturers at an ever-increasing pace, and the prices of those medications were rising steeply. A typical community pharmacist was working longer hours and often forced to hire additional staff to handle increased workloads. This extra workload did not allow the time to focus on safety issues. This new factor led to the concept of using a machine to count medications. This paper introduces a design based on using microcontrollers for counting tablets and capsules . A production flow is build to automate the whole operations
Total bacterial count and somatic cell count in refrigerated raw milk stored in communal tanks
Edmar da Costa Alves
2014-09-01
Full Text Available The current industry demand for dairy products with extended shelf life has resulted in new challenges for milk quality maintenance. The processing of milk with high bacterial counts compromises the quality and performance of industrial products. The study aimed to evaluate the total bacteria counts (TBC and somatic cell count (SCC in 768 samples of refrigerated raw milk, from 32 communal tanks. Samples were collected in the first quarter of 2010, 2011, 2012 and 2013 and analyzed by the Laboratory of Milk Quality - LQL. Results showed that 62.5%, 37.5%, 15.6% and 27.1% of the means for TBC in 2010, 2011, 2012 and 2013, respectively, were above the values established by legislation. However, we observed a significant reduction in the levels of total bacterial count (TBC in the studied periods. For somatic cell count, 100% of the means indicated values below 600.000 cells/mL, complying with the actual Brazilian legislation. The values found for the somatic cell count suggests the adoption of effective measures for the sanitary control of the herd. However, the results must be considered with caution as it highlights the need for quality improvements of the raw material until it achieves reliable results effectively.
Method of detecting and counting bacteria
Picciolo, G. L.; Chappelle, E. W. (Inventor)
1976-01-01
An improved method is provided for determining bacterial levels, especially in samples of aqueous physiological fluids. The method depends on the quantitative determination of bacterial adenosine triphosphate (ATP) in the presence of nonbacterial ATP. The bacterial ATP is released by cell rupture and is measured by an enzymatic bioluminescent assay. A concentration technique is included to make the method more sensitive. It is particularly useful where the fluid to be measured contains an unknown or low bacteria count.
Refined curve counting on complex surfaces
Göttsche, Lothar; Shende, Vivek
2012-01-01
We define refined invariants which "count" nodal curves in sufficiently ample linear systems on surfaces, conjecture that their generating function is multiplicative, and conjecture explicit formulas in the case of K3 and abelian surfaces. We also give a refinement of the Caporaso-Harris recursion, and conjecture that it produces the same invariants in the sufficiently ample setting. The refined recursion specializes at y = -1 to the Itenberg-Kharlamov-Shustin recursion for Welschinger invari...
Positive motivic measures are counting measures
Ellenberg, Jordan S
2009-01-01
Let K be a field. A positive motivic measure on the Grothendieck ring K_0(Var_K) is a homomorphism from K_0(Var_K) to the real numbers assigning a nonnegative value to every variety. In this note we show that the only positive motivic measures are the counting measures: measures on K_0(Var_{F_q}) which send a variety to its number of rational points over some fixed finite extension of F_q.
Going Online to Make Learning Count
Cathy Brigham; Rebecca Klein-Collins
2011-01-01
Adult students often come to higher education with college-level learning that they have acquired outside of the classroom – from the workplace, military service, self-study, or hobbies. For decades, many forward-thinking colleges and universities have been offering services to evaluate that learning and award it college credit that counts towards a degree. However, for a range of reasons, not every institution can offer prior learning assessment (PLA) in every discipline or for every student...
Faint Submillimter Galaxy Counts at 450 micron
Chen, Chian-Chou; Barger, Amy J; Casey, Caitlin M; Lee, Nicholas; Sanders, David B; Wang, Wei-Hao; Williams, Jonathan P
2012-01-01
We present the results of SCUBA2 observations at 450 micron and 850 micron of the field lensed by the massive cluster A370. With a total survey area > 100 arcmin2 and 1 sigma sensitivities of 3.92 and 0.82 mJy/beam at 450 and 850 micron respectively, we find a secure sample of 20 sources at 450 micron and 26 sources at 850 micron with a signal-to-noise ratio > 4. Using the latest lensing model of A370 and Monte Carlo simulations, we derive the number counts at both wavelengths. The 450 micron number counts probe a factor of four deeper than the counts recently obtained from the Herschel Space Telescope at similar wavelengths, and we estimate that ~47-61% of the 450 micron extragalactic background light (EBL) resolved into individual sources with 450 micron fluxes greater than 4.5 mJy. The faint 450 micron sources in the 4 sigma sample have positional accuracies of 3 arcseconds, while brighter sources (signal-to-noise > 6 sigma) are good to 1.4 arcseconds. Using the deep radio map (1 sigma ~ 6 uJy) we find tha...
Passive hand movements disrupt adults’ counting strategies
Ineke eImbo
2011-09-01
Full Text Available In the present study, we experimentally tested the role of hand motor circuits in simple-arithmetic strategies. Educated adults solved simple additions (e.g., 8+3 or simple subtractions (e.g., 11–3 while they were required to retrieve the answer from long-term memory (e.g., knowing that 8+3 = 11, to transform the problem by making an intermediate step (e.g., 8+3 = 8+2+1 = 10+1 = 11 or to count one-by-one (e.g., 8+3 = 8…9…10…11. During the process of solving the arithmetic problems, the experimenter did or did not move the participants’ hand on a 4-point matrix. The results show that passive hand movements disrupted the counting strategy while leaving the other strategies unaffected. This pattern of results is in agreement with a procedural account, showing that the involvement of hand motor circuits in adults’ mathematical abilities is reminiscent of finger counting during childhood.
Automatic vehicle counting system for traffic monitoring
Crouzil, Alain; Khoudour, Louahdi; Valiere, Paul; Truong Cong, Dung Nghy
2016-09-01
The article is dedicated to the presentation of a vision-based system for road vehicle counting and classification. The system is able to achieve counting with a very good accuracy even in difficult scenarios linked to occlusions and/or presence of shadows. The principle of the system is to use already installed cameras in road networks without any additional calibration procedure. We propose a robust segmentation algorithm that detects foreground pixels corresponding to moving vehicles. First, the approach models each pixel of the background with an adaptive Gaussian distribution. This model is coupled with a motion detection procedure, which allows correctly location of moving vehicles in space and time. The nature of trials carried out, including peak periods and various vehicle types, leads to an increase of occlusions between cars and between cars and trucks. A specific method for severe occlusion detection, based on the notion of solidity, has been carried out and tested. Furthermore, the method developed in this work is capable of managing shadows with high resolution. The related algorithm has been tested and compared to a classical method. Experimental results based on four large datasets show that our method can count and classify vehicles in real time with a high level of performance (>98%) under different environmental situations, thus performing better than the conventional inductive loop detectors.
FIRBACK Source Counts and Cosmological Implications
Dole, H; Lagache, G; Puget, J L; Aussel, H; Bouchet, F R; Ciliegi, P; Clements, D L; Césarsky, C J; Désert, F X; Elbaz, D; Franceschini, A; Guiderdoni, B; Harwit, M; Laureijs, R J; Lemke, D; McMahon, R; Moorwood, A F M; Oliver, S; Reach, W T; Rowan-Robinson, M; Stickel, M; Dole, Herve; Gispert, Richard; Lagache, Guilaine; Puget, Jean-Loup
2000-01-01
FIRBACK is a one of the deepest surveys performed at 170 microns with ISOPHOTonboard ISO, and is aimed at the study of cosmic far infrared backgroundsources. About 300 galaxies are detected in an area of four square degrees, andsource counts present a strong slope of 2.2 on an integral "logN-logS" plot,which cannot be due to cosmological evolution if no K-correction is present.The resolved sources account for less than 100f the Cosmic InfraredBackground at 170 microns. In order to understand the nature of the sourcescontributing to the CIB, and to explain deep source counts at otherwavelengths, we have developed a phenomenological model, which constrains in asimple way the luminosity function evolution with redshift, and fits all theexisting deep source counts from the mid-infrared to the submillimetre range.Images, materials and papers available on the FIRBACK web:http://wwwfirback.ias.u-psud.fr wwwfirback.ias.u-psud.fr
Elephant impact on shoot distribution on trees and on rebrowsing by smaller browsers
Makhabu, Shimane W.; Skarpe, Christina; Hytteborn, Håkan
2006-09-01
In order to determine the effects of a megaherbivore, the African elephant ( Loxodonta africana) on browse available for mesoherbivores, we assessed the vertical distribution of shoots (< 6 mm in diameter) on trees with different accumulated elephant impact. We also determined the foraging responses by a mixed feeder, impala ( Aepyceros melampus) and a browser, greater kudu ( Tragelaphus strepsiceros) which are mesoherbivores. The foraging responses by impala and kudu were in terms of preferences of trees with different accumulated elephant impact levels and whether animals browsed in different height sections in proportion to availability of shoots. We counted shoots in each 20 cm height section up to 2.6 m on trees in 25 m by 25 m plots and on trees observed to be browsed by impala and kudu. In most tree species, individuals with high accumulated elephant impact were shorter and had more shoots at low levels than tree individuals with either low or no accumulated elephant impact. Impala and kudu preferred to browse tree individuals with accumulated elephant impact over those without such impact. Impala and kudu browsed more than expected at height sections with many shoots and less than expected at height sections with fewer shoots indicating a non-linear overmatching foraging response. We suggest that increased shoot abundance at low levels in the canopy might explain part of the observed preferences. Elephants, therefore, seem to facilitate browsing by mesoherbivores by generating 'browsing lawns'. Such benefits need to be considered when making decisions on how to manage populations of megaherbivores like elephant.
Money laundering regulatory risk evaluation using Bitmap Index-based Decision Tree
Vikas Jayasree
2017-06-01
Full Text Available This paper proposes to evaluate the adaptability risk in money laundering using Bitmap Index-based Decision Tree (BIDT technique. Initially, the Bitmap Index-based Decision Tree learning is used to induce the knowledge tree which helps to determine a company’s money laundering risk and improve scalability. A bitmap index in BIDT is used to effectively access large banking databases. In a BIDT bitmap index, account in a table is numbered in sequence with each key value, account number and a bitmap (array of bytes used instead of a list of row ids. Subsequently, BIDT algorithm uses the “select” query performance to apply count and bit-wise logical operations on AND. Query result coincides exactly to build a decision tree and more precisely to evaluate the adaptability risk in the money laundering operation. For the root node, the main account of the decision tree, the population frequencies are obtained by simply counting the total number of “1” in the bitmaps constructed on the attribute to predict money laundering and evaluate the risk factor rate. The experiment is conducted on factors such as regulatory risk rate, false positive rate, and risk identification time.
Distance labeling schemes for trees
Alstrup, Stephen; Gørtz, Inge Li; Bistrup Halvorsen, Esben
2016-01-01
We consider distance labeling schemes for trees: given a tree with n nodes, label the nodes with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the distance in the tree between the two nodes. A lower bound by Gavoille et al. [Gavoille...... variants such as, for example, small distances in trees [Alstrup et al., SODA, 2003]. We improve the known upper and lower bounds of exact distance labeling by showing that 1/4 log2(n) bits are needed and that 1/2 log2(n) bits are sufficient. We also give (1 + ε)-stretch labeling schemes using Theta......(log(n)) bits for constant ε> 0. (1 + ε)-stretch labeling schemes with polylogarithmic label size have previously been established for doubling dimension graphs by Talwar [Talwar, STOC, 2004]. In addition, we present matching upper and lower bounds for distance labeling for caterpillars, showing that labels...
Skeletal Rigidity of Phylogenetic Trees
Cheng, Howard; Li, Brian; Risteski, Andrej
2012-01-01
Motivated by geometric origami and the straight skeleton construction, we outline a map between spaces of phylogenetic trees and spaces of planar polygons. The limitations of this map is studied through explicit examples, culminating in proving a structural rigidity result.
Hiemstra, J.A.; Schoenmaker-van der Bijl, E.; Tonneijck, A.E.G.; Hoffman, M.H.A.
2008-01-01
Mogelijkheden ter bestrijding van fijnstofThis brochure describes the underlying principles that form a basis for better-informed choices with regards to the management of trees and shrubs in cities and the design of functional planting schemes.
Efficient Frequent Pattern Tree Construction
D.Bujji Babu
2014-03-01
Full Text Available Association rule learning is a popular and well researched technique for discovering interesting relations between variables in large databases in the area of data mining. The association rules are a part of intelligent systems. Association rules are usually required to satisfy a user-specified minimum support and a user-specified minimum confidence at the same time. Apriori and FP-Growth algorithms are very familiar algorithms for association rule mining. In this paper we are more concentrated on the Construction of efficient frequent pattern trees. Here, we present the novel frequent pattern trees and the performance issues. The proposed trees are fast and efficient trees helps to extract the frequent patterns. This paper provides the major advantages in the FP-Growth algorithm for association rule mining with using the newly proposed approach.
Visualizing Contour Trees within Histograms
Kraus, Martin
2010-01-01
Many of the topological features of the isosurfaces of a scalar volume field can be compactly represented by its contour tree. Unfortunately, the contour trees of most real-world volume data sets are too complex to be visualized by dot-and-line diagrams. Therefore, we propose a new visualization...... that is suitable for large contour trees and efficiently conveys the topological structure of the most important isosurface components. This visualization is integrated into a histogram of the volume data; thus, it offers strictly more information than a traditional histogram. We present algorithms...... to automatically compute the graph layout and to calculate appropriate approximations of the contour tree and the surface area of the relevant isosurface components. The benefits of this new visualization are demonstrated with the help of several publicly available volume data sets....
Algorithms for Decision Tree Construction
Chikalov, Igor
2011-01-01
The study of algorithms for decision tree construction was initiated in 1960s. The first algorithms are based on the separation heuristic [13, 31] that at each step tries dividing the set of objects as evenly as possible. Later Garey and Graham [28] showed that such algorithm may construct decision trees whose average depth is arbitrarily far from the minimum. Hyafil and Rivest in [35] proved NP-hardness of DT problem that is constructing a tree with the minimum average depth for a diagnostic problem over 2-valued information system and uniform probability distribution. Cox et al. in [22] showed that for a two-class problem over information system, even finding the root node attribute for an optimal tree is an NP-hard problem. © Springer-Verlag Berlin Heidelberg 2011.
Spanning Tree Based Attribute Clustering
Zeng, Yifeng; Jorge, Cordero Hernandez
2009-01-01
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...
Goodwin, Adrian N
2009-01-01
A flexible tree taper model based on a cubic polynomial is described. It is algebraically invertible and integrable, and can be constrained by one or two diameters, neither of which need be diameter at breast height (DBH...
Tree and tree-like species of Mexico: gymnosperms, monocotyledons, and tree ferns
Martin Ricker; Héctor M. Hernández
2010-01-01
Trees or tree-like plants are defined here broadly as perennial, self-supporting plants with an adult height of at least 5 m (without ascending leaves or inflorescences), and with 1 or several erect stems with a diameter of at least 10 cm. We present an updated list of all Mexican tree species under that definition in the Gymnospermae (86 species, 38% endemic to Mexico), Monocotyledonae (75 species, 55% endemic), and Pteridophyta (9 species, none endemic). The list contains a total of 170 spe...
Quantum Simulation of Phylogenetic Trees
Ellinas, Demosthenes
2011-01-01
Quantum simulations constructing probability tensors of biological multi-taxa in phylogenetic trees are proposed, in terms of positive trace preserving maps, describing evolving systems of quantum walks with multiple walkers. Basic phylogenetic models applying on trees of various topologies are simulated following appropriate decoherent quantum circuits. Quantum simulations of statistical inference for aligned sequences of biological characters are provided in terms of a quantum pruning map operating on likelihood operator observables, utilizing state-observable duality and measurement theory.
Generic physical protection logic trees
Paulus, W.K.
1981-10-01
Generic physical protection logic trees, designed for application to nuclear facilities and materials, are presented together with a method of qualitative evaluation of the trees for design and analysis of physical protection systems. One or more defense zones are defined where adversaries interact with the physical protection system. Logic trees that are needed to describe the possible scenarios within a defense zone are selected. Elements of a postulated or existing physical protection system are tagged to the primary events of the logic tree. The likelihood of adversary success in overcoming these elements is evaluated on a binary, yes/no basis. The effect of these evaluations is propagated through the logic of each tree to determine whether the adversary is likely to accomplish the end event of the tree. The physical protection system must be highly likely to overcome the adversary before he accomplishes his objective. The evaluation must be conducted for all significant states of the site. Deficiencies uncovered become inputs to redesign and further analysis, closing the loop on the design/analysis cycle.
Longest common extensions in trees
Bille, Philip; Gawrychowski, Pawel; Gørtz, Inge Li;
2016-01-01
to trees and suggest a few applications of LCE in trees to tries and XML databases. Given a labeled and rooted tree T of size n, the goal is to preprocess T into a compact data structure that support the following LCE queries between subpaths and subtrees in T. Let v1, v2, w1, and w2 be nodes of T...... such that w1 and w2 are descendants of v1 and v2 respectively. - LCEPP(v1, w1, v2, w2): (path-path LCE) return the longest common prefix of the paths v1 ~→ w1 and v2 ~→ w2. - LCEPT(v1, w1, v2): (path-tree LCE) return maximal path-path LCE of the path v1 ~→ w1 and any path from v2 to a descendant leaf. - LCETT......(v1, v2): (tree-tree LCE) return a maximal path-path LCE of any pair of paths from v1 and v2 to descendant leaves. We present the first non-trivial bounds for supporting these queries. For LCEPP queries, we present a linear-space solution with O(log* n) query time. For LCEPT queries, we present...
Longest Common Extensions in Trees
Bille, Philip; Gawrychowski, Pawel; Gørtz, Inge Li;
2015-01-01
to trees and suggest a few applications of LCE in trees to tries and XML databases. Given a labeled and rooted tree T of size n, the goal is to preprocess T into a compact data structure that support the following LCE queries between subpaths and subtrees in T. Let v1, v2, w1, and w2 be nodes of T...... such that w1 and w2 are descendants of v1 and v2 respectively. - LCEPP(v1, w1, v2, w2): (path-path LCE) return the longest common prefix of the paths v1 ~→ w1 and v2 ~→ w2. - LCEPT(v1, w1, v2): (path-tree LCE) return maximal path-path LCE of the path v1 ~→ w1 and any path from v2 to a descendant leaf. - LCETT......(v1, v2): (tree-tree LCE) return a maximal path-path LCE of any pair of paths from v1 and v2 to descendant leaves. We present the first non-trivial bounds for supporting these queries. For LCEPP queries, we present a linear-space solution with O(log* n) query time. For LCEPT queries, we present...
Bose, Prosenjit; Dujmović, Vida; Howat, John
2009-01-01
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as splay trees, can achieve this property in the amortized sense, while data structures that are not binary search trees are known to have this property in the worst case. We close this gap and present a binary search tree called a layered working-set tree that guarantees the working-set property in the worst case. The unified bound [Badoiu et al., TCS, 2007] roughly states that searching for an element is fast if it is near (in terms of rank distance) to a recently accessed element. We show how layered working-set trees can be used to achieve the unified bound to within a small additive term in the amortized sense while maintaining in the worst case an access time that is both logarithmic and within a small multiplicative factor of the working-set bound.
Leaché, Adam D.; Banbury, Barbara L.; Felsenstein, Joseph; de Oca, Adrián nieto-Montes; Stamatakis, Alexandros
2015-01-01
Single nucleotide polymorphisms (SNPs) are useful markers for phylogenetic studies owing in part to their ubiquity throughout the genome and ease of collection. Restriction site associated DNA sequencing (RADseq) methods are becoming increasingly popular for SNP data collection, but an assessment of the best practises for using these data in phylogenetics is lacking. We use computer simulations, and new double digest RADseq (ddRADseq) data for the lizard family Phrynosomatidae, to investigate the accuracy of RAD loci for phylogenetic inference. We compare the two primary ways RAD loci are used during phylogenetic analysis, including the analysis of full sequences (i.e., SNPs together with invariant sites), or the analysis of SNPs on their own after excluding invariant sites. We find that using full sequences rather than just SNPs is preferable from the perspectives of branch length and topological accuracy, but not of computational time. We introduce two new acquisition bias corrections for dealing with alignments composed exclusively of SNPs, a conditional likelihood method and a reconstituted DNA approach. The conditional likelihood method conditions on the presence of variable characters only (the number of invariant sites that are unsampled but known to exist is not considered), while the reconstituted DNA approach requires the user to specify the exact number of unsampled invariant sites prior to the analysis. Under simulation, branch length biases increase with the amount of missing data for both acquisition bias correction methods, but branch length accuracy is much improved in the reconstituted DNA approach compared to the conditional likelihood approach. Phylogenetic analyses of the empirical data using concatenation or a coalescent-based species tree approach provide strong support for many of the accepted relationships among phrynosomatid lizards, suggesting that RAD loci contain useful phylogenetic signal across a range of divergence times despite the
Field guide to red tree vole nests
Damon B. Lesmeister; James K. Swingle
2017-01-01
Surveys for red tree vole (Arborimus longicaudus) nests require tree climbing because the species is a highly specialized arboreal rodent that live in the tree canopy of coniferous forests in western Oregon and northwestern California. Tree voles are associated with old coniferous forest (â¥80 years old) that are structurally complex, but are often...
A Tool for Displaying Syntactic Trees.
Morgan, Jerry L.
A computer program for drawing syntactic phrase markers as trees is described. The program was developed for use on Texas Instruments Explorer Lisp machines. The tree is drawn by recursive descent, left to right. The tree-drawing function takes two arguments: (1) an atom constituting the tree, and (2) a font specification to be used in drawing the…
Balanced binary trees in the Tamari lattice
Giraudo, Samuele
2010-01-01
We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T0, T1] where T0 and T1 are balanced trees are isomorphic as posets to a hypercube. We introduce tree patterns and synchronous grammars to get a functional equation of the generating series enumerating balanced tree intervals.
Hasan Hüseyin Koç
2014-02-01
Full Text Available Microbial population of soil and its structure is affected with chemical and biological changes such as plant-root secretions. Upper layer of the soil is exposed to mixture of stems, fruiting bodies and leaves of trees. Seven trees growing at same area were chosen. Their upper layers of the soil were collected from depth 5-10 cm as samples in spring and autumn. Their microbial populations were investigated in order to determine in terms of climate changes. In order to determine the number of the total microorganisms, gram-negative bacteria and spore-forming bacteria (cfu/g were used by the serial dilution techniques. As a result, the highest numbers of microorganisms from the soil of the apple tree were determined as the total microbial count in the autumn, although the lowest number of microorganisms was obtained from the soil of the pine tree. However, the number of the gram-negative bacteria was the highest in the soil of linden tree, although the number of gram negative bacteria was the lowest in the soil of apricot, mulberry and apple trees. For spore - forming bacterium, the highest number from the mulberry soil and the lowest number from the linden tree have been obtained. In the spring, the highest numbers of microorganisms from the soil of the apple tree were obtained as the total microbial count, although the lowest number of microorganisms was obtained from the soil of the apricot tree. For the number of the gram-negative bacteria was the highest in the soil of walnut tree, although the number of gram negative bacteria was the lowest in the soil of apricot trees. However spore - forming bacterium, the highest number from the soil of the poplar tree and the lowest number from the mulberry tree have been obtained. In general, the rich diversity of the microbial population was shown morphologically in autumn.
Microwave sensing of tree trunks
Jezova, Jana; Mertens, Laurence; Lambot, Sebastien
2015-04-01
The main subject of this research is the observation of the inner part of living tree trunks using ground-penetrating radar (GPR). Trees are everyday part of human life and therefore it is important to pay attention to the tree conditions. The most obvious consequence of the poor tree condition is dead or injury caused by falling tree. The trunk internal structure is divided into three main parts: heartwood, sapwood and bark, which make this medium highly anisotropic and heterogeneous. Furthermore, the properties of the wood are not only specie-dependent but also depend on genetic and on environmental conditions. In urban areas the main problem for the stability of the trees relies in the apparition of decays provoked by fungi, insect or birds. This results in cavities or decreasing of the support capacity of the tree. GPR has proved itself to be a very powerful electromagnetic tool for non-destructive detection of buried objects. Since the beginning of the 20th century it has been used in several different areas (archaeology, landmine detection, civil engineering, ...). GPR uses the principle of the scattering of the electromagnetic waves that are radiated from a transmitting antenna. Then the waves propagate through the medium and are reflected from the object and then they are received by a receiving antenna. The velocity of the scattered signal is determined primarily by the permittivity of the material. The optimal functionality of the GPR was investigated using the numerical simulation tool gprMax2D. This tool is based on a Finite-Difference Time-Domain (FDTD) numerical model. Subsequently, the GPR functionality was tested using the laboratory model of a decayed tree trunk. Afterwards, the results and lessons learnt in the simplified tests will be used in the processing of the real data and will help to achieve deeper understanding of them. The laboratory model of the tree trunk was made by plastic or carton pipes and filled by sand. Space inside the model
Computing Refined Buneman Trees in Cubic Time
Brodal, G.S.; Fagerberg, R.; Östlin, A.
2003-01-01
Reconstructing the evolutionary tree for a set of n species based on pairwise distances between the species is a fundamental problem in bioinformatics. Neighbor joining is a popular distance based tree reconstruction method. It always proposes fully resolved binary trees despite missing evidence...... in the underlying distance data. Distance based methods based on the theory of Buneman trees and refined Buneman trees avoid this problem by only proposing evolutionary trees whose edges satisfy a number of constraints. These trees might not be fully resolved but there is strong combinatorial evidence for each...
Marriott, Kim; Sbarski, Peter; van Gelder, Tim; Prager, Daniel; Bulka, Andy
2011-03-01
We introduce hi-trees, a new visual representation for hierarchical data in which, depending on the kind of parent node, the child relationship is represented using either containment or links. We give a drawing convention for hi-trees based on the standard layered drawing convention for rooted trees, then show how to extend standard bottom-up tree layout algorithms to draw hi-trees in this convention. We also explore a number of other more compact layout styles for layout of larger hi-trees and give algorithms for computing these. Finally, we describe two applications of hi-trees: argument mapping and business decision support.
Counting, Measuring And The Semantics Of Classifiers
Susan Rothstein
2010-12-01
Full Text Available This paper makes two central claims. The first is that there is an intimate and non-trivial relation between the mass/count distinction on the one hand and the measure/individuation distinction on the other: a (if not the defining property of mass nouns is that they denote sets of entities which can be measured, while count nouns denote sets of entities which can be counted. Crucially, this is a difference in grammatical perspective and not in ontological status. The second claim is that the mass/count distinction between two types of nominals has its direct correlate at the level of classifier phrases: classifier phrases like two bottles of wine are ambiguous between a counting, or individuating, reading and a measure reading. On the counting reading, this phrase has count semantics, on the measure reading it has mass semantics.ReferencesBorer, H. 1999. ‘Deconstructing the construct’. In K. Johnson & I. Roberts (eds. ‘Beyond Principles and Parameters’, 43–89. Dordrecht: Kluwer publications.Borer, H. 2008. ‘Compounds: the view from Hebrew’. In R. Lieber & P. Stekauer (eds. ‘The Oxford Handbook of Compounds’, 491–511. Oxford: Oxford University Press.Carlson, G. 1977b. Reference to Kinds in English. Ph.D. thesis, University of Massachusetts at Amherst.Carlson, G. 1997. Quantifiers and Selection. Ph.D. thesis, University of Leiden.Carslon, G. 1977a. ‘Amount relatives’. Language 53: 520–542.Chierchia, G. 2008. ‘Plurality of mass nouns and the notion of ‘semantic parameter”. In S. Rothstein (ed. ‘Events and Grammar’, 53–103. Dordrecht: Kluwer.Danon, G. 2008. ‘Definiteness spreading in the Hebrew construct state’. Lingua 118: 872–906.http://dx.doi.org/10.1016/j.lingua.2007.05.012Gillon, B. 1992. ‘Toward a common semantics for English count and mass nouns’. Linguistics and Philosophy 15: 597–640.http://dx.doi.org/10.1007/BF00628112Grosu, A. & Landman, F. 1998. ‘Strange relatives of the third kind
36 CFR 223.4 - Exchange of trees or portions of trees.
2010-07-01
... 36 Parks, Forests, and Public Property 2 2010-07-01 2010-07-01 false Exchange of trees or portions of trees. 223.4 Section 223.4 Parks, Forests, and Public Property FOREST SERVICE, DEPARTMENT OF AGRICULTURE SALE AND DISPOSAL OF NATIONAL FOREST SYSTEM TIMBER General Provisions § 223.4 Exchange of trees or portions of trees. Trees or portions...
Simplifying gene trees for easier comprehension
Mundry Marvin; Lott Paul-Ludwig; Sassenberg Christoph; Lorkowski Stefan; Fuellen Georg
2006-01-01
Abstract Background In the genomic age, gene trees may contain large amounts of data making them hard to read and understand. Therefore, an automated simplification is important. Results We present a simplification tool for gene trees called TreeSimplifier. Based on species tree information and HUGO gene names, it summarizes "monophyla". These monophyla correspond to subtrees of the gene tree where the evolution of a gene follows species phylogeny, and they are simplified to single leaves in ...
A bicriterion Steiner tree problem on graph
Vujošević Mirko B.
2003-01-01
Full Text Available This paper presents a formulation of bicriterion Steiner tree problem which is stated as a task of finding a Steiner tree with maximal capacity and minimal length. It is considered as a lexicographic multicriteria problem. This means that the bottleneck Steiner tree problem is solved first. After that, the next optimization problem is stated as a classical minimums Steiner tree problem under the constraint on capacity of the tree. The paper also presents some computational experiments with the multicriteria problem.
geoCount: An R Package for the Analysis of Geostatistical Count Data
Liang Jing
2015-02-01
Full Text Available We describe the R package geoCount for the analysis of geostatistical count data. The package performs Bayesian analysis for the Poisson-lognormal and binomial-logitnormal spatial models, which are subclasses of the class of generalized linear spatial models proposed by Diggle, Tawn, and Moyeed (1998. The package implements the computational intensive tasks in C++ using an R/C++ interface, and has parallel computation capabilities to speed up the computations. geoCount also implements group updating, Langevin- Hastings algorithms and a data-based parameterization, algorithmic approaches proposed by Christensen, Roberts, and Sko ?ld (2006 to improve the efficiency of the Markov chain Monte Carlo algorithms. In addition, the package includes functions for simulation and visualization, as well as three geostatistical count datasets taken from the literature. One of those is used to illustrate the package capabilities. Finally, we provide a side-by-side comparison between geoCount and the R packages geoRglm and INLA.
Bibliometric Approach to Research Assessment: Publication Count, Citation Count, & Author Rank
Yang, Kiduk
2013-03-01
Full Text Available We investigated how bibliometric indicators such as publication count and citation count affect the assessment of research performance by computing various bibliometric scores of the works of Korean LIS faculty members and comparing the rankings by those scores. For the study data, we used the publication and citation data of 159 tenure-track faculty members of Library and Information Science departments in 34 Korean universities. The study results showed correlation between publication count and citation count for authors with many publications but the opposite evidence for authors with few publications. The study results suggest that as authors publish more and more work, citations to their work tend to increase along with publication count. However, for junior faculty members who have not yet accumulated enough publications, citations to their work are of great importance in assessing their research performance. The study data also showed that there are marked differences in the magnitude of citations between papers published in Korean journals and papers published in international journals.
A mind you can count on: validating breath counting as a behavioral measure of mindfulness
Daniel B Levinson
2014-10-01
Full Text Available Mindfulness practice of present moment awareness promises many benefits, but has eluded rigorous behavioral measurement. To date, research has relied on self-reported mindfulness or heterogeneous mindfulness trainings to infer skillful mindfulness practice and its effects. In four independent studies with over 400 total participants, we present the first construct validation of a behavioral measure of mindfulness, breath counting. We found it was reliable, correlated with self-reported mindfulness, differentiated long-term meditators from age-matched controls, and was distinct from sustained attention and working memory measures. In addition, we employed breath counting to test the nomological network of mindfulness. As theorized, we found skill in breath counting associated with more meta-awareness, less mind wandering, better mood, and greater nonattachment (i.e. less attentional capture by distractors formerly paired with reward. We also found in a randomized online training study that 4 weeks of breath counting training improved mindfulness and decreased mind wandering relative to working memory training and no training controls. Together, these findings provide the first evidence for breath counting as a behavioral measure of mindfulness.
Koop, G; Dik, N; Nielen, M; Lipman, L J A
2010-06-01
The aims of this study were to assess how different bacterial groups in bulk milk are related to bulk milk somatic cell count (SCC), bulk milk total bacterial count (TBC), and bulk milk standard plate count (SPC) and to measure the repeatability of bulk milk culturing. On 53 Dutch dairy goat farms, 3 bulk milk samples were collected at intervals of 2 wk. The samples were cultured for SPC, coliform count, and staphylococcal count and for the presence of Staphylococcus aureus. Furthermore, SCC (Fossomatic 5000, Foss, Hillerød, Denmark) and TBC (BactoScan FC 150, Foss) were measured. Staphylococcal count was correlated to SCC (r=0.40), TBC (r=0.51), and SPC (r=0.53). Coliform count was correlated to TBC (r=0.33), but not to any of the other variables. Staphylococcus aureus did not correlate to SCC. The contribution of the staphylococcal count to the SPC was 31%, whereas the coliform count comprised only 1% of the SPC. The agreement of the repeated measurements was low. This study indicates that staphylococci in goat bulk milk are related to SCC and make a significant contribution to SPC. Because of the high variation in bacterial counts, repeated sampling is necessary to draw valid conclusions from bulk milk culturing.
CalCOFI Larvae Counts, Scientific Names MB to MO
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names SU to TE
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names SB to SC
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names CD to CH
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names NB to OL
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names AS to BA
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names CP to DE
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names C to CE
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
Alaska Steller sea lion Count Database (Non-pups)
National Oceanic and Atmospheric Administration, Department of Commerce — This database contains counts of adult and juvenile (non-pup) Steller sea lions on rookeries and haulouts in Alaska made between 1904 and 2015. Non-pup counts have...
Low Blood Cell Counts: Side Effect of Cancer Treatment
... cell counts can be a serious complication during cancer treatment. Know why your doctor closely tracks your blood ... monitor your blood cell counts carefully during your cancer treatment. There's a good reason you're having your ...
CalCOFI Larvae Counts, Scientific Names LB to LI
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names SJ to ST
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
91st Christmas Bird Count : Tewaukon National Wildlife Refuge
US Fish and Wildlife Service, Department of the Interior — These are the results of the 1990 Christmas Bird Count on Tewaukon National Wildlife Refuge. A total of 14 species and 1,469 individual birds were counted.
92nd Christmas Bird Count : Tewaukon National Wildlife Refuge
US Fish and Wildlife Service, Department of the Interior — These are the results of the 1991 Christmas Bird Count on Tewaukon National Wildlife Refuge. A total of 25 species and 2,655 individual birds were counted.
Avian Point Count Locations - Dahomey NWR 2007-2008
US Fish and Wildlife Service, Department of the Interior — Map depicts locations of avian point counts conducted on Dahomey in 2007 and 2008. Actual point count data are contained in the avian knowledge network database
CalCOFI Larvae Counts, Scientific Names OY to PI
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names V to Z
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names DH to EC
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names BCE to BZ
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names SD to SI
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names CI to CO
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names LJ to MA
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names EV to GN
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names A to AM
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names Q to SA
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names HJ to ID
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names PP to PZ
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names ED to EU
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names PL to PO
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
Controlling Hay Fever Symptoms with Accurate Pollen Counts
... counts Share | Controlling Hay Fever Symptoms with Accurate Pollen Counts This article has been reviewed by Thanai ... rhinitis known as hay fever is caused by pollen carried in the air during different times of ...
CalCOFI Larvae Counts, Scientific Names HB to HI
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names AN to AR
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
CalCOFI Larvae Counts, Scientific Names MP to NA
National Oceanic and Atmospheric Administration, Department of Commerce — Fish larvae counts and standardized counts for larvae captured in CalCOFI icthyoplankton nets (primarily vertical [Calvet or Pairovet], oblique [bongo or ring nets],...
A new sieve for distinct coordinate counting
无
2010-01-01
We present a new sieve for the distinct coordinate counting problem.This significantly improves the classical inclusion-exclusion sieve for this problem,in the sense that the number of terms is reduced from 2(k 2) to k!,and reduced further to p(k) in the symmetric case,where p(k) denotes the number of partitions of k.As an illustration of applications,we give an in-depth study of a basic example arising from coding theory and graph theory.
BMI in relation to sperm count
Sermondade, N; Faure, C; Fezeu, L
2013-01-01
with meta-analysis. METHODS A systematic review of available literature (with no language restriction) was performed to investigate the impact of BMI on sperm count. Relevant studies published until June 2012 were identified from a Pubmed and EMBASE search. We also included unpublished data (n = 717 men...... concentration did not differ significantly across BMI categories. There was a J-shaped relationship between BMI categories and risk of oligozoospermia or azoospermia. Compared with men of normal weight, the odds ratio (95% confidence interval) for oligozoospermia or azoospermia was 1.15 (0...
Accurate Atom Counting in Mesoscopic Ensembles
Hume, D B; Joos, M; Muessel, W; Strobel, H; Oberthaler, M K
2013-01-01
Many cold atom experiments rely on precise atom number detection, especially in the context of quantum-enhanced metrology where effects at the single particle level are important. Here, we investigate the limits of atom number counting via resonant fluorescence detection for mesoscopic samples of trapped atoms. We characterize the precision of these fluorescence measurements beginning from the single-atom level up to more than one thousand. By investigating the primary noise sources, we obtain single-atom resolution for atom numbers as high as 1200. This capability is an essential prerequisite for future experiments with highly entangled states of mesoscopic atomic ensembles.
Accurate Atom Counting in Mesoscopic Ensembles
Hume, D. B.; Stroescu, I.; Joos, M.; Muessel, W.; Strobel, H.; Oberthaler, M. K.
2013-12-01
Many cold atom experiments rely on precise atom number detection, especially in the context of quantum-enhanced metrology where effects at the single particle level are important. Here, we investigate the limits of atom number counting via resonant fluorescence detection for mesoscopic samples of trapped atoms. We characterize the precision of these fluorescence measurements beginning from the single-atom level up to more than one thousand. By investigating the primary noise sources, we obtain single-atom resolution for atom numbers as high as 1200. This capability is an essential prerequisite for future experiments with highly entangled states of mesoscopic atomic ensembles.
Neutron coincidence counting with digital signal processing
Bagi, Janos [Institute of Isotopes (IKI)-Budapest (Hungary); Dechamp, Luc; Dransart, Pascal; Dzbikowicz, Zdzislaw [European Commission, Joint Research Centre, IPSC-Ispra, VA (Italy); Dufour, Jean-Luc [Institut de Radioprotection et Surete Nucleaire-Fontenay-aux-Roses (France); Holzleitner, Ludwig [European Commission, Joint Research Centre, IPSC-Ispra (Italy); Huszti, Joseph [Institute of Isotopes (IKI)-Budapest (Hungary); Looman, Marc [Consulenze Tecniche-Cocquio Trevisago (Italy); Marin Ferrer, Montserrat [European Commission, Joint Research Centre, IPSC-Ispra (Italy); Lambert, Thierry [Institut de Radioprotection et Surete Nucleaire-Fontenay-aux-Roses (France); Peerani, Paolo [European Commission, Joint Research Centre, IPSC-Ispra (Italy)], E-mail: paolo.peerani@jrc.it; Rackham, Jamie [VT Nuclear Services-Sellafield, Seascale (United Kingdom); Swinhoe, Martyn; Tobin, Steve [N-1, Safeguards Science and Technology Group, LANL-Los Alamos, NM (United States); Weber, Anne-Laure [Institut de Radioprotection et Surete Nucleaire-Fontenay-aux-Roses (France); Wilson, Mark [VT Nuclear Services-Sellafield, Seascale (United Kingdom)
2009-09-11
Neutron coincidence counting is a widely adopted nondestructive assay (NDA) technique used in nuclear safeguards to measure the mass of nuclear material in samples. Nowadays, most neutron-counting systems are based on the original-shift-register technology, like the (ordinary or multiplicity) Shift-Register Analyser. The analogue signal from the He-3 tubes is processed by an amplifier/single channel analyser (SCA) producing a train of TTL pulses that are fed into an electronic unit that performs the time- correlation analysis. Following the suggestion of the main inspection authorities (IAEA, Euratom and the French Ministry of Industry), several research laboratories have started to study and develop prototypes of neutron-counting systems with PC-based processing. Collaboration in this field among JRC, IRSN and LANL has been established within the framework of the ESARDA-NDA working group. Joint testing campaigns have been performed in the JRC PERLA laboratory, using different equipment provided by the three partners. One area of development is the use of high-speed PCs and pulse acquisition electronics that provide a time stamp (LIST-Mode Acquisition) for every digital pulse. The time stamp data can be processed directly during acquisition or saved on a hard disk. The latter method has the advantage that measurement data can be analysed with different values for parameters like predelay and gate width, without repeating the acquisition. Other useful diagnostic information, such as die-away time and dead time, can also be extracted from this stored data. A second area is the development of 'virtual instruments.' These devices, in which the pulse-processing system can be embedded in the neutron counter itself and sends counting data to a PC, can give increased data-acquisition speeds. Either or both of these developments could give rise to the next generation of instrumentation for improved practical neutron-correlation measurements. The paper will
Counting Processes for Retail Default Modeling
Kiefer, Nicholas Maximilian; Larson, C. Erik
in a discrete state space. In a simple case, the states could be default/non-default; in other models relevant for credit modeling the states could be credit scores or payment status (30 dpd, 60 dpd, etc.). Here we focus on the use of stochastic counting processes for mortgage default modeling, using data...... on high LTV mortgages. Borrowers seeking to finance more than 80% of a house's value with a mortgage usually either purchase mortgage insurance, allowing a first mortgage greater than 80% from many lenders, or use second mortgages. Are there differences in performance between loans financed...
Strange Curves, Counting Rabbits, & Other Mathematical Explorations
Ball, Keith
2011-01-01
How does mathematics enable us to send pictures from space back to Earth? Where does the bell-shaped curve come from? Why do you need only 23 people in a room for a 50/50 chance of two of them sharing the same birthday? In Strange Curves, Counting Rabbits, and Other Mathematical Explorations, Keith Ball highlights how ideas, mostly from pure math, can answer these questions and many more. Drawing on areas of mathematics from probability theory, number theory, and geometry, he explores a wide range of concepts, some more light-hearted, others central to the development of the field and used dai
Applied categorical and count data analysis
Tang, Wan; Tu, Xin M
2012-01-01
Introduction Discrete Outcomes Data Source Outline of the BookReview of Key Statistical ResultsSoftwareContingency Tables Inference for One-Way Frequency TableInference for 2 x 2 TableInference for 2 x r TablesInference for s x r TableMeasures of AssociationSets of Contingency Tables Confounding Effects Sets of 2 x 2 TablesSets of s x r TablesRegression Models for Categorical Response Logistic Regression for Binary ResponseInference about Model ParametersGoodness of FitGeneralized Linear ModelsRegression Models for Polytomous ResponseRegression Models for Count Response Poisson Regression Mode
Perturbative tests of non-perturbative counting
Dabholkar, Atish; Gomes, João
2010-03-01
We observe that a class of quarter-BPS dyons in mathcal{N} = 4 theories with charge vector ( Q, P) and with nontrivial values of the arithmetic duality invariant I := gcd( Q∧ P) are nonperturbative in one frame but perturbative in another frame. This observation suggests a test of the recently computed nonperturbative partition functions for dyons with nontrivial values of the arithmetic invariant. For all values of I, we show that the nonperturbative counting yields vanishing indexed degeneracy for this class of states everywhere in the moduli space in precise agreement with the perturbative result.
Expected Number Counts of Radio Galaxy Clusters
无
2002-01-01
Clusters of galaxies may contain radio sources if they still experience successive mergers at present. This has been confirmed by radio observations that about 30% of nearby clusters possess radio halos. We present a theoretical prediction of radio cluster counts using a semi-analytic approach which incorporates the empirical correlation between radio power and dynamical mass of clusters, and the cluster mass function described by the Press-Schechter formalism. The total population of radio clusters over the whole sky and their redshift distribution are given.
Accurate atom counting in mesoscopic ensembles.
Hume, D B; Stroescu, I; Joos, M; Muessel, W; Strobel, H; Oberthaler, M K
2013-12-20
Many cold atom experiments rely on precise atom number detection, especially in the context of quantum-enhanced metrology where effects at the single particle level are important. Here, we investigate the limits of atom number counting via resonant fluorescence detection for mesoscopic samples of trapped atoms. We characterize the precision of these fluorescence measurements beginning from the single-atom level up to more than one thousand. By investigating the primary noise sources, we obtain single-atom resolution for atom numbers as high as 1200. This capability is an essential prerequisite for future experiments with highly entangled states of mesoscopic atomic ensembles.
An exact exponential time algorithm for counting bipartite cliques
Kutzkov, Konstantin
2012-01-01
We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.249^n), improving upon known exact algorithms for finding and counting bipartite cliques.......We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.249^n), improving upon known exact algorithms for finding and counting bipartite cliques....
Utilization of nitrogen fixing trees
Brewbaker, J.L.; Beldt, R. van den; MacDicken, K.; Budowski, G.; Kass, D.C.L.; Russo, R.O.; Escalante, G.; Herrera, R.; Aranguren, J.; Arkcoll, D.B.; Doebereinger, J. (cord.)
1983-01-01
Six papers from the symposium are noted. Brewbaker, J.L., Beldt, R. van den, MacDicken, K. Fuelwood uses and properties of nitrogen-fixing trees, pp 193-204, (Refs. 15). Includes a list of 35 nitrogen-fixing trees of high fuelwood value. Budowski, G.; Kass, D.C.L.; Russo, R.O. Leguminous trees for shade, pp 205-222, (Refs. 68). Escalante, G., Herrera, R., Aranguren, J.; Nitrogen fixation in shade trees (Erythrina poeppigiana) in cocoa plantations in northern Venezuela, pp 223-230, (Refs. 13). Arkcoll, D.B.; Some leguminous trees providing useful fruits in the North of Brazil, pp 235-239, (Refs. 13). This paper deals with Parkia platycephala, Pentaclethra macroloba, Swartzia sp., Cassia leiandra, Hymenaea courbaril, dipteryz odorata, Inga edulis, I. macrophylla, and I. cinnamonea. Baggio, A.J.; Possibilities of the use of Gliricidia sepium in agroforestry systems in Brazil, pp 241-243; (Refs. 15). Seiffert, N.F.; Biological nitrogen and protein production of Leucaena cultivars grown to supplement the nutrition of ruminants, pp 245-249, (Refs. 14). Leucaena leucocephala cv. Peru, L. campina grande (L. leucocephala), and L. cunningham (L. leucocephalae) were promising for use as browse by beef cattle in central Brazil.
View Dependent Sequential Point Trees
Wen-Cheng Wang; Feng Wei; En-Hua Wu
2006-01-01
Sequential point trees provide the state-of-the-art technique for rendering point models, by re-arranging hierarchical points sequentially according to geometric errors running on GPU for fast rendering. This paper presents a view dependent method to augment sequential point trees by embedding the hierarchical tree structures in the sequential list of hierarchical points. By the method, two kinds of indices are constructed to facilitate the points rendering in an order mostly from near to far and from coarse to fine. As a result, invisible points can be culled view-dependently in high efficiency for hardware acceleration, and at the same time, the advantage of sequential point trees could be still fully taken. Therefore, the new method can run much faster than the conventional sequential point trees, and the acceleration can be highly promoted particularly when the objects possess complex occlusion relationship and viewed closely because invisible points would be in a high percentage of the points at finer levels.
Spatial patterns of tree-growth anomalies in the United States and southeastern Canada
Meko, D.; Stockton, C.W.; Hughes, M.K. (Univ. of Arizona, Tucson, AZ (United States)); Cook, E.R. (Lamont-Doherty Earth Observatory, Palisades, NY (United States)); Stahle, D.W. (Univ. of Arkansas, Fayetteville, AR (United States))
1993-09-01
A network of 248 tree-ring chronologies in the conterminous United States is assembled and analyzed by rotated principal components analysis (RPCA) to delineate [open quotes]regions[close quotes] of common tree-growth variation during the period 1705-1979. Spatial continuity of the tree-ring data is summarized by variogram analysis, and tree-ring data are gridded before RPCA to reduce effects of site clustering. Principal component drought information is evaluated by comparing PC scores and primary pattern coefficients with Palmer Drought Severity Index (PDSI) data from instrumental records. High PC pattern coefficients group geographically into regions coinciding roughly with nine drought regions delineated by RPCA of PDSI by other researchers. The drought signal as measured by the correlation between tree-ring PC scores and July PDSI, 1929-79, is strongest in the South and the interior West (r>0.7), and weakest in the Northeast and Pacific Northwest (r<0.16). A count of years with large negative PC scores in multiple regions marks the 1950s as the extreme in widespread drought across the southern United States to 1705. Tree-growth regions are sensitive to whether tree-ring data are gridded before RPCA. Principal components on ungridded tree-ring data to center on dense clusters of sites. The importance of site density is most noticeable in the RPCA results for the southeast, where the gridded data yield a PC centered on a group of climate-sensitive but widely spaced bald cypress chronologies. Cross-validation indicates that gridding of tree-ring anomalies over different species for drought reconstruction is more appropriate in the semiarid southwest than in cooler, moisture regions-especially the northeast and the Pacific Northwest. Our results endorse the large-scale chronology network as a long-term proxy for the spatial and temporal patterns of past drought across the United States. 41 refs., 12 figs., 2 tabs.
Development of New Drummed Nuclear Waste Neutron Counting System
ZHU; Li-qun; XU; Xiao-ming; BAI; Lei; LI; Xin-jun; GU; Shao-gang; HE; Li-xia; WANG; Mian
2012-01-01
<正>The development of a new neutron counting system (Fig. 1) for 200 L drummed radioactive waste measurement has been accomplished in this year. This waste neutron counting system is mainly used for solid radioactive waste classification. It is based on the passive neutron counting technique. The amount of radionuclide contained in the waste is
21 CFR 1210.16 - Method of bacterial count.
2010-04-01
... FEDERAL IMPORT MILK ACT Inspection and Testing § 1210.16 Method of bacterial count. The bacterial count of milk and cream refers to the number of viable bacteria as determined by the standard plate method of... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Method of bacterial count. 1210.16 Section...
21 CFR 864.6160 - Manual blood cell counting device.
2010-04-01
... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Manual blood cell counting device. 864.6160... (CONTINUED) MEDICAL DEVICES HEMATOLOGY AND PATHOLOGY DEVICES Manual Hematology Devices § 864.6160 Manual blood cell counting device. (a) Identification. A manual blood cell counting device is a device used...
Automated vehicle counting using image processing and machine learning
Meany, Sean; Eskew, Edward; Martinez-Castro, Rosana; Jang, Shinae
2017-04-01
Vehicle counting is used by the government to improve roadways and the flow of traffic, and by private businesses for purposes such as determining the value of locating a new store in an area. A vehicle count can be performed manually or automatically. Manual counting requires an individual to be on-site and tally the traffic electronically or by hand. However, this can lead to miscounts due to factors such as human error A common form of automatic counting involves pneumatic tubes, but pneumatic tubes disrupt traffic during installation and removal, and can be damaged by passing vehicles. Vehicle counting can also be performed via the use of a camera at the count site recording video of the traffic, with counting being performed manually post-recording or using automatic algorithms. This paper presents a low-cost procedure to perform automatic vehicle counting using remote video cameras with an automatic counting algorithm. The procedure would utilize a Raspberry Pi micro-computer to detect when a car is in a lane, and generate an accurate count of vehicle movements. The method utilized in this paper would use background subtraction to process the images and a machine learning algorithm to provide the count. This method avoids fatigue issues that are encountered in manual video counting and prevents the disruption of roadways that occurs when installing pneumatic tubes
Low-Background Counting at Homestake
Marshall, Iseley
2009-10-01
Background characterization at Homestake is an ongoing project crucial to the experiments located there. From neutrino physics to WIMP detection, low-background materials and their screening require highly sensitive detectors. Naturally, shielding is needed to lower ``noise'' in these detectors. Because of its vast depth, Homestake will be effective in shielding against cosmic-ray radiation. This means little, however, if radiation from materials used still interferes. Specifically, our group is working on designing the first low-background counting facility at the Homestake mine. Using a high-purity germanium crystal detector from ORTEC, measurements will be taken within a shield that is made to specifically account for radiation underground and fits the detector. Currently, in the design, there is a layer of copper surrounded by an intricate stainless steel casing, which will be manufactured air tight to accommodate for nitrogen purging. Lead will surround the stainless steel shell to further absorb gamma rays. A mobile lift system has been designed for easy access to the detector. In the future, this project will include multiple testing stations located in the famous Davis Cavern where future experiments will have the ability to use the site as an efficient and accurate counting facility for their needs (such as measuring radioactive isotopes in materials). Overall, this detector (and its shield system) is the beginning of a central testing facility that will serve Homestake's scientific community.
Maximal subbundles, quot schemes, and curve counting
Gillam, W D
2011-01-01
Let $E$ be a rank 2, degree $d$ vector bundle over a genus $g$ curve $C$. The loci of stable pairs on $E$ in class $2[C]$ fixed by the scaling action are expressed as products of $\\Quot$ schemes. Using virtual localization, the stable pairs invariants of $E$ are related to the virtual intersection theory of $\\Quot E$. The latter theory is extensively discussed for an $E$ of arbitrary rank; the tautological ring of $\\Quot E$ is defined and is computed on the locus parameterizing rank one subsheaves. In case $E$ has rank 2, $d$ and $g$ have opposite parity, and $E$ is sufficiently generic, it is known that $E$ has exactly $2^g$ line subbundles of maximal degree. Doubling the zero section along such a subbundle gives a curve in the total space of $E$ in class $2[C]$. We relate this count of maximal subbundles with stable pairs/Donaldson-Thomas theory on the total space of $E$. This endows the residue invariants of $E$ with enumerative significance: they actually \\emph{count} curves in $E$.
Regression Models for Count Data in R
Christian Kleiber
2008-06-01
Full Text Available The classical Poisson, geometric and negative binomial regression models for count data belong to the family of generalized linear models and are available at the core of the statistics toolbox in the R system for statistical computing. After reviewing the conceptual and computational features of these methods, a new implementation of hurdle and zero-inﬂated regression models in the functions hurdle( and zeroinfl( from the package pscl is introduced. It re-uses design and functionality of the basic R functions just as the underlying conceptual tools extend the classical models. Both hurdle and zero-inﬂated model, are able to incorporate over-dispersion and excess zeros-two problems that typically occur in count data sets in economics and the social sciences—better than their classical counterparts. Using cross-section data on the demand for medical care, it is illustrated how the classical as well as the zero-augmented models can be ﬁtted, inspected and tested in practice.
It's not the pixel count, you fool
Kriss, Michael A.
2012-01-01
The first thing a "marketing guy" asks the digital camera engineer is "how many pixels does it have, for we need as many mega pixels as possible since the other guys are killing us with their "umpteen" mega pixel pocket sized digital cameras. And so it goes until the pixels get smaller and smaller in order to inflate the pixel count in the never-ending pixel-wars. These small pixels just are not very good. The truth of the matter is that the most important feature of digital cameras in the last five years is the automatic motion control to stabilize the image on the sensor along with some very sophisticated image processing. All the rest has been hype and some "cool" design. What is the future for digital imaging and what will drive growth of camera sales (not counting the cell phone cameras which totally dominate the market in terms of camera sales) and more importantly after sales profits? Well sit in on the Dark Side of Color and find out what is being done to increase the after sales profits and don't be surprised if has been done long ago in some basement lab of a photographic company and of course, before its time.
Signatures of synchrony in pairwise count correlations
Tatjana Tchumatchenko
2010-04-01
Full Text Available Concerted neural activity can reflect specific features of sensory stimuli or behavioral tasks. Correlation coefficients and count correlations are frequently used to measure correlations between neurons, design synthetic spike trains and build population models. But are correlation coefficients always a reliable measure of input correlations? Here, we consider a stochastic model for the generation of correlated spike sequences which replicate neuronal pairwise correlations in many important aspects. We investigate under which conditions the correlation coefficients reflect the degree of input synchrony and when they can be used to build population models. We find that correlation coefficients can be a poor indicator of input synchrony for some cases of input correlations. In particular, count correlations computed for large time bins can vanish despite the presence of input correlations. These findings suggest that network models or potential coding schemes of neural population activity need to incorporate temporal properties of correlated inputs and take into consideration the regimes of firing rates and correlation strengths to ensure that their building blocks are an unambiguous measures of synchrony.
Language and counting: Some recent results
Bell, Garry
1990-02-01
It has long been recognised that the language of mathematics is an important variable in the learning of mathematics, and there has been useful work in isolating and describing the linkage. Steffe and his co-workers at Georgia, for example, (Steffe, von Glasersfeld, Richardson and Cobb, 1983) have suggested that young children may construct verbal countable items to count objects which are hidden from their view. Although there has been a surge of research interest in counting and early childhood mathematics, and in cultural differences in mathematics attainment, there has been little work reported on the linkage between culture as exemplified by language, and initial concepts of numeration. This paper reports on some recent clinical research with kindergarten children of European and Asian background in Australia and America. The research examines the influence that number naming grammar appears to have on young children's understandings of two-digit numbers and place value. It appears that Transparent Standard Number Word Sequences such as Japanese, Chinese and Vietnamese which follow the numerical representation pattern by naming tens and units in order ("two tens three"), may be associated with distinctive place value concepts which may support sophisticated mental algorithms.
Characterization of APDs for single photon counting
Buglak, Wladimir; Hannen, Volker; Joehren, Raphael; Surholt, Martin; Vollbrecht, Jonas; Weinheimer, Christian [Muenster Univ. (Germany). Inst. fuer Kernphysik; Noertershaeuser, Wilfried [Mainz Univ. (Germany). Inst. fuer Kernchemie; GSI Helmholtzzentrum fuer Schwerionenforschung, Darmstadt (Germany); Sanchez, Rodolfo [GSI Helmholtzzentrum fuer Schwerionenforschung, Darmstadt (Germany)
2013-07-01
For the SPECTRAP experiment at GSI, Germany, a detector system with single-photon counting capability operating in the wavelength region from 300 nm up to 1100 nm has been developed at the University of Muenster. The detector system utilises a silicon avalanche photo diode (APD) cooled to liquid nitrogen temperatures and operated near the breakdown voltage to obtain high gain values. While the current setup uses a 2 x 2 mm{sup 2} APD (type RMD S0223), it would be advantageous to have a larger active area for easier adjustment of the experiment optics. On the other hand a larger active area is accompanied by increased thermal noise which might harm the photon counting performance of the device. The characterization of a 8 x 8 mm{sup 2} APD (RMD S0814) is the subject of this poster. Furthermore a signal analysis software was developed to supress noise signals, e.g. caused by microphonic effects. The software processes signal waveforms recorded by a Flash ADC and should allow for a lower trigger threshold and thus higher detection efficiency.
Sampling site matters when counting lymphocyte subpopulations.
Benson Ogunjimi
Full Text Available Clinical and scientific work routinely relies on antecubital venipunctures for hematological, immunological or other analyses on blood. This study tested the hypothesis that antecubital veins can be considered to be a good proxy for other sampling sites. Using a hematocytometer and a flow cytometer, we analyzed the cell counts from samples coming from the radial artery, the dorsal hand veins and the antecubital veins from 18 volunteers. Most surprisingly, we identified the greatest difference not to exist between arterial and venous circulation, but between the distal (radial artery & dorsal hand veins and proximal (antecubital veins sampling sites. Naïve T cells had a higher cell count distally compared to proximally and the reverse was true for effector memory T cells. Despite these differences there were high correlations between the different sampling sites, which partially supports our initial hypothesis. Our findings are crucial for the future design and interpretation of immunological research, and for clinical practice. Furthermore, our results suggest a role for interval lymph nodes in the trafficking of lymphocytes.
B Decay Charm Counting Via Topological Vertexing
Chou, Aaron Sze Ting
2002-01-01
We present a new and unique measurement of the branching fractions of b hadrons to states with 0, 1, and 2 open charm hadrons, using a sample of 350,000 hadronic Z0 decays collected during the SLD/SLC 97–98 run. The analysis takes advantage of the excellent vertexing resolution of the VXD3, a pixel-based CCD vertex detector, which allows the separation of B and cascade D decay vertices. A fit of the vertex count and the decay length distributions to distribution shapes predicted by Monte Carlo simulation allows the extraction of the inclusive branching fractions. We measure: BRB→0D X=3.7±1.1 stat±2.1 syst% BRB→2D X=17.9±1.4 stat±3.3 syst% where B, and D represent mixtures of open b and open c hadrons. The corresponding charm count, Nc = 1.188 ± 0.010 ± 0.040 ± 0.006 is consistent with previous measurement averages but slightly closer to theoretical expectations.
B Decay Charm Counting via Topological Vertexing
Chou, Aaron S
2001-10-15
We present a new and unique measurement of the branching fractions of b hadrons to states with 0, 1, and 2 open charm hadrons, using a sample of 350,000 hadronic Z{sup 0} decays collected during the SLD/SLC 97-98 run. The method takes advantage of the excellent vertexing resolution of the VXD3, a pixel-based CCD vertex detector, which allows the separation of B and cascade D decay vertices. A fit of the vertex count and the decay length distributions to distribution shapes predicted by Monte Carlo simulation allows the extraction of the inclusive branching fractions. We measure: BR(B {yields} (0D)X) = (3.7{+-}1.1(stat) {+-} 2.1(syst))%; and BR(B {yields} (2D)X) = (17.9{+-}1.4(stat) {+-} 3.3(syst))% where B and D represent mixtures of open b and open c hadrons. The corresponding charm count, N{sub c} = 1.188 {+-} 0.010 {+-} 0.040 {+-} 0.006 is consistent with previous measurement averages but slightly closer to theoretical expectations.
Testing gravity with gravitational wave source counts
Calabrese, Erminia; Battaglia, Nicholas; Spergel, David N.
2016-08-01
We show that the gravitational wave source counts distribution can test how gravitational radiation propagates on cosmological scales. This test does not require obtaining redshifts for the sources. If the signal-to-noise ratio (ρ) from a gravitational wave source is proportional to the strain then it falls as {R}-1, thus we expect the source counts to follow {{d}}{N}/{{d}}ρ \\propto {ρ }-4. However, if gravitational waves decay as they propagate or propagate into other dimensions, then there can be deviations from this generic prediction. We consider the possibility that the strain falls as {R}-γ , where γ =1 recovers the expected predictions in a Euclidean uniformly-filled Universe, and forecast the sensitivity of future observations to deviations from standard General Relativity. We first consider the case of few objects, seven sources, with a signal-to-noise from 8 to 24, and impose a lower limit on γ, finding γ \\gt 0.33 at 95% confidence level. The distribution of our simulated sample is very consistent with the distribution of the trigger events reported by Advanced LIGO. Future measurements will improve these constraints: with 100 events, we estimate that γ can be measured with an uncertainty of 15%. We generalize the formalism to account for a range of chirp masses and the possibility that the signal falls as {exp}(-R/{R}0)/{R}γ .
The Great World Wide Star Count
Ward, D.; Meymaris, K.; Henderson, S.; Johnson, R. M.
2010-12-01
The Great World Wide Star Count is an international citizen science event encouraging everyone, astronomers and non-astronomers alike, to measure their local light pollution and report their observations online. This project is designed to raise awareness about light pollution as well as encourage learning in astronomy. Utilizing the international networking capabilities of Windows to the Universe, Star Count has engaged over 31,000 individuals from 64 countries and all 7 continents in its first 3 years. Data collection and online reporting is designed to be simple and user-friendly for citizen scientists of all ages. The collected data is available online in a variety of formats for use by students, teachers and scientists worldwide to assess how the quality of the night sky varies around the world. This session will share our results and demonstrate how students and scientists worldwide can explore and analyze the results from 2007—2010. We will discuss how the project team planned and executed the project in such a way that non-astronomers were able to make valid and useful contributions.
Testing Gravity with Gravitational Wave Source Counts
Calabrese, Erminia; Spergel, David N
2016-01-01
We show that the gravitational wave source counts distribution can test how gravitational radiation propagates on cosmological scales. This test does not require obtaining redshifts for the sources. If the signal-to-noise from a gravitational wave source is proportional to the strain then it falls as $R^{-1}$, thus we expect the source counts to follow $dN/dS \\propto S^{-4}$. However, if gravitational waves decay as they propagate or can propagate into other dimensions, then there can be deviations from this generic prediction. We consider the possibility that the signal-to-noise falls as $R^{-\\gamma}$, where $\\gamma=1$ recovers the expected predictions in a Euclidean uniformly-filled universe. We forecast the sensitivity of future observations in constraining gravitational wave physics using this method by simulating sources distributed over a finite range of signal-to-noise. We first consider the case of few objects, 7 sources, with a signal-to-noise from 8 to 24, and impose a lower limit on $\\gamma$, findi...
Photon Counting Using Edge-Detection Algorithm
Gin, Jonathan W.; Nguyen, Danh H.; Farr, William H.
2010-01-01
New applications such as high-datarate, photon-starved, free-space optical communications require photon counting at flux rates into gigaphoton-per-second regimes coupled with subnanosecond timing accuracy. Current single-photon detectors that are capable of handling such operating conditions are designed in an array format and produce output pulses that span multiple sample times. In order to discern one pulse from another and not to overcount the number of incoming photons, a detection algorithm must be applied to the sampled detector output pulses. As flux rates increase, the ability to implement such a detection algorithm becomes difficult within a digital processor that may reside within a field-programmable gate array (FPGA). Systems have been developed and implemented to both characterize gigahertz bandwidth single-photon detectors, as well as process photon count signals at rates into gigaphotons per second in order to implement communications links at SCPPM (serial concatenated pulse position modulation) encoded data rates exceeding 100 megabits per second with efficiencies greater than two bits per detected photon. A hardware edge-detection algorithm and corresponding signal combining and deserialization hardware were developed to meet these requirements at sample rates up to 10 GHz. The photon discriminator deserializer hardware board accepts four inputs, which allows for the ability to take inputs from a quadphoton counting detector, to support requirements for optical tracking with a reduced number of hardware components. The four inputs are hardware leading-edge detected independently. After leading-edge detection, the resultant samples are ORed together prior to deserialization. The deserialization is performed to reduce the rate at which data is passed to a digital signal processor, perhaps residing within an FPGA. The hardware implements four separate analog inputs that are connected through RF connectors. Each analog input is fed to a high-speed 1
The number of Huffman codes, compact trees, and sums of unit fractions
Elsholtz, Christian; Prodinger, Helmut
2011-01-01
The number of "nonequivalent" Huffman codes of length r over an alphabet of size t has been studied frequently. Equivalently, the number of "nonequivalent" complete t-ary trees has been examined. We first survey the literature, unifying several independent approaches to the problem. Then, improving on earlier work we prove a very precise asymptotic result on the counting function, consisting of two main terms and an error term.
Negative Tree Reweighted Belief Propagation
Liu, Qiang
2012-01-01
We introduce a new class of lower bounds on the log partition function of a Markov random field which makes use of a reversed Jensen's inequality. In particular, our method approximates the intractable distribution using a linear combination of spanning trees with negative weights. This technique is a lower-bound counterpart to the tree-reweighted belief propagation algorithm, which uses a convex combination of spanning trees with positive weights to provide corresponding upper bounds. We develop algorithms to optimize and tighten the lower bounds over the non-convex set of valid parameter values. Our algorithm generalizes mean field approaches (including naive and structured mean field approximations), which it includes as a limiting case.
Giambastiani, Yamuna; Preti, Federico; Errico, Alessandro; Penna, Daniele
2017-04-01
There is growing interest in developing models for predicting how root anchorage and tree bracing could influence tree stability. This work presents the results of different experiments aimed at evaluating the mechanical response of plate roots to pulling tests. Pulling tests have been executed with increasing soil water content and soil of different texture. Different types of tree bracing have been examined for evaluating its impact on plant stiffness. Root plate was anchored with different systems for evaluating the change in overturning resistance. The first results indicate that soil water content contributed to modify both the soil cohesion and the stabilizing forces. Wind effect, slope stability and root reinforcement could be better quantified by means of such a results.
Optimal allocation of point-count sampling effort
Barker, R.J.; Sauer, J.R.; Link, W.A.
1993-01-01
Both unlimited and fixedradius point counts only provide indices to population size. Because longer count durations lead to counting a higher proportion of individuals at the point, proper design of these surveys must incorporate both count duration and sampling characteristics of population size. Using information about the relationship between proportion of individuals detected at a point and count duration, we present a method of optimizing a pointcount survey given a fixed total time for surveying and travelling between count points. The optimization can be based on several quantities that measure precision, accuracy, or power of tests based on counts, including (1) meansquare error of estimated population change; (2) mean-square error of average count; (3) maximum expected total count; or (4) power of a test for differences in average counts. Optimal solutions depend on a function that relates count duration at a point to the proportion of animals detected. We model this function using exponential and Weibull distributions, and use numerical techniques to conduct the optimization. We provide an example of the procedure in which the function is estimated from data of cumulative number of individual birds seen for different count durations for three species of Hawaiian forest birds. In the example, optimal count duration at a point can differ greatly depending on the quantities that are optimized. Optimization of the mean-square error or of tests based on average counts generally requires longer count durations than does estimation of population change. A clear formulation of the goals of the study is a critical step in the optimization process.