84 resultados para Polygon decomposition


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The turbostratic mesoporous carbon blacks were prepared by catalytic chemical vapour decomposition (CCVD) of acetylene using Ni/MgO catalysts prepared by co-precipitation. The relationship between deposition conditions and the nanostructures of resultant carbon black materials was investigated. It was found that the turbostratic and textural structures of carbon blacks are dependent on the deposition temperature and nickel catalyst loading. Higher deposition temperature increases the carbon crystallite unit volume V-nano and reduces the surface area of carbon samples. Moreover, a smaller V-nano is produced by a higher Ni loading at the same deposition temperature. In addition of the pore structure and the active metal surface area of the catalyst, the graphitic degree or electronic conductivity of the carbon support is also a key issue to the activity of the supported catalyst. V-nano is a very useful parameter to describe the effect of the crystalline structure of carbon blacks on the reactivity of carbon blacks in oxygen-carbon reaction and the catalytic activity of carbon-supported catalyst in ammonia decomposition semi-quantitatively. (C) 2006 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Necessary conditions for the complete graph on n vertices to have a decomposition into 5-cubes are that 5 divides it - 1 and 80 divides it (it - 1)/2. These are known to be sufficient when n is odd. We prove them also sufficient for it even, thus completing the spectrum problem for the 5-cube and lending further weight to a long-standing conjecture of Kotzig. (c) 2005 Wiley Periodicals, Inc.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Plant litter and fine roots are important in maintaining soil organic carbon (C) levels as well as for nutrient cycling. The decomposition of surface-placed litter and fine roots of wheat ( Triticum aestivum ), lucerne ( Medicago sativa ), buffel grass ( Cenchrus ciliaris ), and mulga ( Acacia aneura ), placed at 10-cm and 30-cm depths, was studied in the field in a Rhodic Paleustalf. After 2 years, = 60% of mulga roots and twigs remained undecomposed. The rate of decomposition varied from 4.2 year -1 for wheat roots to 0.22 year -1 for mulga twigs, which was significantly correlated with the lignin concentration of both tops and roots. Aryl+O-aryl C concentration, as measured by 13 C nuclear magnetic resonance spectroscopy, was also significantly correlated with the decomposition parameters, although with a lower R 2 value than the lignin concentration. Thus, lignin concentration provides a good predictor of litter and fine root decomposition in the field.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The circulant graph Sn, where S ⊆ Zn \ {0}, has vertex set Zn and edge set {{x, x + s}|x ∈ Zn, s ∈ S}. It is shown that there is a Hamilton cycle decomposition of every 6-regular circulant graph Sn in which S has an element of order n.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mesoporous chromium oxide (Cr2O3) nanocrystals were first synthesized by the thermal decomposition reaction of Cr(NO3)(3)(circle)9H(2)O using citric acid monohydrate (CA) as the mesoporous template agent. The texture and chemistry of chromium oxide nanocrystals were characterized by N-2 adsorption-desorption isotherms, FTIR, X-ray diffraction (XRD), UV-vis, and thermoanalytical methods. It was shown that the hydrate water and CA are the crucial factors in influencing the formation of mesoporous Cr2O3 nanocrystals in the mixture system. The decomposition of CA results in the formation of a mesoporous structure with wormlike pores. The hydrate water of the mixture provides surface hydroxyls that act as binders, making the nanocrystals aggregate. The pore structures and phases of chromium oxide are affected by the ratio of precursor-to-CA, thermal temperature, and time.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This paper explains and explores the concept of "semantic molecules" in the NSM methodology of semantic analysis. A semantic molecule is a complex lexical meaning which functions as an intermediate unit in the structure of other, more complex concepts. The paper undertakes an overview of different kinds of semantic molecule, showing how they enter into more complex meanings and how they themselves can be explicated. It shows that four levels of "nesting" of molecules within molecules are attested, and it argues that while some molecules such as 'hands' and 'make', may well be language-universal, many others are language-specific.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This paper presents a new relative measure of signal complexity, referred to here as relative structural complexity, which is based on the matching pursuit (MP) decomposition. By relative, we refer to the fact that this new measure is highly dependent on the decomposition dictionary used by MP. The structural part of the definition points to the fact that this new measure is related to the structure, or composition, of the signal under analysis. After a formal definition, the proposed relative structural complexity measure is used in the analysis of newborn EEG. To do this, firstly, a time-frequency (TF) decomposition dictionary is specifically designed to compactly represent the newborn EEG seizure state using MP. We then show, through the analysis of synthetic and real newborn EEG data, that the relative structural complexity measure can indicate changes in EEG structure as it transitions between the two EEG states; namely seizure and background (non-seizure).

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists of a single cycle for every i j. A Latin square is atomic if all of its conjugates are pan-Hamiltonian. We give a complete enumeration of atomic squares for order 11, the smallest order for which there are examples distinct from the cyclic group. We find that there are seven main classes, including the three that were previously known. A perfect 1-factorization of a graph is a decomposition of that graph into matchings such that the union of any two matchings is a Hamiltonian cycle. Each pan-Hamiltonian Latin square of order n describes a perfect 1-factorization of Kn,n, and vice versa. Perfect 1-factorizations of Kn,n can be constructed from a perfect 1-factorization of Kn+1. Six of the seven main classes of atomic squares of order 11 can be obtained in this way. For each atomic square of order 11, we find the largest set of Mutually Orthogonal Latin Squares (MOLS) involving that square. We discuss algorithms for counting orthogonal mates, and discover the number of orthogonal mates possessed by the cyclic squares of orders up to 11 and by Parker's famous turn-square. We find that the number of atomic orthogonal mates possessed by a Latin square is not a main class invariant. We also define a new sort of Latin square, called a pairing square, which is mapped to its transpose by an involution acting on the symbols. We show that pairing squares are often orthogonal mates for symmetric Latin squares. Finally, we discover connections between our atomic squares and Franklin's diagonally cyclic self-orthogonal squares, and we correct a theorem of Longyear which uses tactical representations to identify self-orthogonal Latin squares in the same main class as a given Latin square.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The nutrient contents and accessions in litterfall over a period of 3 y are reported for undisturbed areas and at two sites disturbed by selective harvesting in tropical rain forest in North Queensland, Australia. Mean concentrations (mg g(-1) dry weight) of nutrients in litterfall ranged from 10 to 12 for nitrogen; 0.33 to 0.43 for phosphorus; 3.6 to 4.3 for potassium; 6.0 to 10.5 for calcium and 1.7 to 2.6 for magnesium. These concentrations are in the middle to lower part of the spectrum of values recorded for tropical forest. Accessions of nutrients in litterfall (kg ha(-1) y(-1)) ranged from 59 to 64 N; 1.9 to 2.4 P; 20 to 24K; 34 to 63 Ca; and 9 to 16 Mg. These rates, particularly for IN and P, are among the lowest recorded for tropical forests. There were no consistent between-site differences in total nutrient accessions in small litterfall. In terms of the contribution of litterfall to the accessions of nutrients to the forest floor, this suggests that the logged sites have recovered from the effects of selective harvesting within 25 y. Nutrient accessions at each site were distinctly seasonal, with maximum accessions occurring in the late dry season to late in the wet season. Leaf-fall accounted for the largest proportion of nutrient accessions over the study period, although at certain times accessions in both reproductive material and wood were significant. A cyclone which crossed the coast near the study sites resulted in large nutrient accessions over a short period but had little effect on the total annual accession. A comparison with previous studies of litterfall in Australian tropical rainforests indicates that nutrient return in litterfall is directly related to soil fertility.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The cost of spatial join processing can be very high because of the large sizes of spatial objects and the computation-intensive spatial operations. While parallel processing seems a natural solution to this problem, it is not clear how spatial data can be partitioned for this purpose. Various spatial data partitioning methods are examined in this paper. A framework combining the data-partitioning techniques used by most parallel join algorithms in relational databases and the filter-and-refine strategy for spatial operation processing is proposed for parallel spatial join processing. Object duplication caused by multi-assignment in spatial data partitioning can result in extra CPU cost as well as extra communication cost. We find that the key to overcome this problem is to preserve spatial locality in task decomposition. We show in this paper that a near-optimal speedup can be achieved for parallel spatial join processing using our new algorithms.