RF Sputtered Er2O3 Thin Films as High-k Gate Dielectrics for Germanium MOS Devices

We report the material and electrical properties of Erbium Oxide (Er2O3) thin films grown on n-Ge (100) by RF sputtering. The properties of the films are correlated with the processing conditions. The structural characterization reveals that the films annealed at 550 degrees C, has densified as compared to the as-grown ones. Fixed oxide charges and interface charges, both of the order of 10(13)/cm(2) is observed.

Soft gluon k(t)-resummation and the Froissart bound

We study soft gluon k(t)-resurnmation and the relevance of InfraRed (IR) gluons for the energy dependence of total hadronic cross-sections. In our model, consistency with the Froissart bound is directly related to the ansatz that the IR behaviour of the QCD coupling constant follows an inverse power law.

On the Structure of Contractible Edges in k-connected Partial k-trees

Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one of the end points of e is a neighbor of the new vertex. An edge in a k-connected graph is contractible if its contraction does not result in a graph with lesser connectivity; otherwise the edge is called non-contractible. In this paper, we present results on the structure of contractible edges in k-trees and k-connected partial k-trees. Firstly, we show that an edge e in a k-tree is contractible if and only if e belongs to exactly one (k + 1) clique. We use this characterization to show that the graph formed by contractible edges is a 2-connected graph. We also show that there are at least |V(G)| + k - 2 contractible edges in a k-tree. Secondly, we show that if an edge e in a partial k-tree is contractible then e is contractible in any k-tree which contains the partial k-tree as an edge subgraph. We also construct a class of contraction critical 2k-connected partial 2k-trees.

STEM education K-12: perspectives on integration

This commentary was stimulated by Yeping Li's first editorial (2014) citing one of the journal's goals as adding multidisciplinary perspectives to current studies of single disciplines comprising the focus of other journals. In this commentary I argue for a greater focus on STEM integration, with a more equitable representation of the four disciplines in studies purporting to advance STEM learning. The STEM acronym is often used in reference to just one of the disciplines, commonly science. Although the integration of STEM disciplines is increasingly advocated in the literature, studies that address multiple disciplines appear scant with mixed findings and inadequate directions for STEM advancement. Perspectives on how discipline integration can be achieved are varied, with reference to multidisciplinary, interdisciplinary, and transdisciplinary approaches adding to the debates. Such approaches include core concepts and skills being taught separately in each discipline but housed within a common theme; the introduction of closely linked concepts and skills from two or more disciplines with the aim of deepening understanding and skills; and the adoption of a transdisciplinary approach, where knowledge and skills from two or more disciplines are applied to real-world problems and projects with the aim of shaping the total learning experience. Research that targets STEM integration is an embryonic field with respect to advancing curriculum development and various student outcomes. For example, we still need more studies on how student learning outcomes arise not only from different forms of STEM integration but also from the particular disciplines that are being integrated. As noted in this commentary, it seems that mathematics learning benefits less than the other disciplines in programs claiming to focus on STEM integration. Factors contributing to this finding warrant more scrutiny. Likewise, learning outcomes for engineering within K-12 integrated STEM programs appear under-researched. This commentary advocates a greater focus on these two disciplines within integrated STEM education research. Drawing on recommendations from the literature, suggestions are offered for addressing the challenges of integrating multiple disciplines faced by the STEM community.

Two-level k-means clustering algorithm for k-tau relationship establishment and linear-time classification

Partitional clustering algorithms, which partition the dataset into a pre-defined number of clusters, can be broadly classified into two types: algorithms which explicitly take the number of clusters as input and algorithms that take the expected size of a cluster as input. In this paper, we propose a variant of the k-means algorithm and prove that it is more efficient than standard k-means algorithms. An important contribution of this paper is the establishment of a relation between the number of clusters and the size of the clusters in a dataset through the analysis of our algorithm. We also demonstrate that the integration of this algorithm as a pre-processing step in classification algorithms reduces their running-time complexity.

DMT of Multi-hop Cooperative Networks-Part I: K-Parallel-Path Networks

We consider single-source, single-sink multi-hop relay networks, with slow-fading Rayleigh fading links and single-antenna relay nodes operating under the half-duplex constraint. While two hop relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this two-part paper, we identify two families of networks that are multi-hop generalizations of the two hop network: K-Parallel-Path (KPP) networks and Layered networks. In the first part, we initially consider KPP networks, which can be viewed as the union of K node-disjoint parallel paths, each of length > 1. The results are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the optimal DMT of KPP(D) networks with K >= 4, and KPP(I) networks with K >= 3. Along the way, we derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. As a special case, the DMT of two-hop relay network without direct link is obtained. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two, as previously believed and that, simple AF protocols are often sufficient to attain the best possible DMT.

Phase diagram of the system Ca-Ti-O at 1200 K

Phase relations in the system Ca-Ti-O have been established by equilibration of several samples at 1200 K for prolonged periods and identification of phases in quenched samples by optical and scanning electron microscopy, XRD and EDS. Samples representing 20 compositions in the ternary system were analyzed. There was negligible solid solubility of Ca in the phases along the binary Ti-O, and of Ti in CaO. Four ternary oxides were identified: CaTiO3, Ca4Ti3O10 and Ca3Ti2O7 containing tetravalent titanium, and CaTi2O4 containing trivalent titanium. Tie-lines link calcium titanite (CaTi2O4) with the three calcium titanates (CaTiO3, Ca4Ti3O10 and Ca3Ti2O7), CaO, oxygen excess TiO1+delta and stoichiometric TiO. Tie-lines connect CaTiO3 with TiO2-x, Magneli phases TinO2n-1 (28 >= n >= 4), Ti3O5, Ti2O3 and TiO1+delta. CaO was found to coexist with TiO, and Ti-O solid solutions alpha and beta. The phase diagram is useful for understanding the mechanisms and kinetics of direct calciothermic reduction of TiO2 to metal and electrochemical reduction of TiO2 using graphite anode and molten CaCl2 electrolyte.

Avian diversification patterns across the K-Pg boundary: Influence of calibrations, datasets, and model misspecification

Birds represent the most diverse extant tetrapod clade, with ca. 10,000 extant species, and the timing of the crown avian radiation remains hotly debated. The fossil record supports a primarily Cenozoic radiation of crown birds, whereas molecular divergence dating analyses generally imply that this radiation was well underway during the Cretaceous. Furthermore, substantial differences have been noted between published divergence estimates. These have been variously attributed to clock model, calibration regime, and gene type. One underappreciated phenomenon is that disparity between fossil ages and molecular dates tends to be proportionally greater for shallower nodes in the avian Tree of Life. Here, we explore potential drivers of disparity in avian divergence dates through a set of analyses applying various calibration strategies and coding methods to a mitochondrial genome dataset and an 18-gene nuclear dataset, both sampled across 72 taxa. Our analyses support the occurrence of two deep divergences (i.e., the Palaeognathae/Neognathae split and the Galloanserae/Neoaves split) well within the Cretaceous, followed by a rapid radiation of Neoaves near the K-Pg boundary. However, 95% highest posterior density intervals for most basal divergences in Neoaves cross the boundary, and we emphasize that, barring unreasonably strict prior distributions, distinguishing between a rapid Early Paleocene radiation and a Late Cretaceous radiation may be beyond the resolving power of currently favored divergence dating methods. In contrast to recent observations for placental mammals, constraining all divergences within Neoaves to occur in the Cenozoic does not result in unreasonably high inferred substitution rates. Comparisons of nuclear DNA (nDNA) versus mitochondrial DNA (mtDNA) datasets and NT- versus RY-coded mitochondrial data reveal patterns of disparity that are consistent with substitution model misspecifications that result in tree compression/tree extension artifacts, which may explain some discordance between previous divergence estimates based on different sequence types. Comparisons of fully calibrated and nominally calibrated trees support a correlation between body mass and apparent dating error. Overall, our results are consistent with (but do not require) a Paleogene radiation for most major clades of crown birds.

Thermodynamic activities in the Pb(Zr1-XTiX)O-3 solid solution at 1373 K

Although Pb(Zr1-XTiX)O-3 solid solution is the cornerstone of the piezoelectric ceramics, there is no information in the literature on thermodynamic activities of the component phases in the solid solution. Using inter-crystalline ion exchange equilibria between Pb(Zr1-XTiX)O-3 solid solution with cubic perovskite structure and (Zr1-YTiY)O-2 solid solutions with monoclinic and tetragonal structures, activities of PbTiO3 and PbZrO3 in the perovskite solid solution have been derived at 1373 K using the modified Gibbs-Duhem integration technique of Jacob and Jeffes. Tie-lines from the cubic solid solution are skewed towards the ZrO2 corner. Activities in the zirconia-rich (Zr1-YTiY)02 solid solutions are taken from a recent emf study. The results for the perovskite solid solution at 1373 K can be represented by a sub-regular solution model: Delta G(E.M) (J mol(-1)) = X-PbTiO3 X-PbZrO3(5280X(PbTiO3) - 1980X(PbZrO3)) where Delta G(E.M) is the excess Gibbs energy of mixing of the cubic solid solution and Xi represents the mole fraction of component i. There is a significant positive deviation from ideality for PbTiO3-rich compositions and mild negative deviation near the PbZrO3 corner. The cubic solid solution is intrinsically stable against composition fluctuations at temperatures down to 840 K. The results contrast sharply with the recent calorimetric data on enthalpy of mixing which signal instability of the cubic perovskite solid solution. (C) 2007 Elsevier B.V. All rights reserved.

Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm

The Ball-Larus path-profiling algorithm is an efficient technique to collect acyclic path frequencies of a program. However, longer paths -those extending across loop iterations - describe the runtime behaviour of programs better. We generalize the Ball-Larus profiling algorithm for profiling k-iteration paths - paths that can span up to to k iterations of a loop. We show that it is possible to number suchk-iteration paths perfectly, thus allowing for an efficient profiling algorithm for such longer paths. We also describe a scheme for mixed-mode profiling: profiling different parts of a procedure with different path lengths. Experimental results show that k-iteration profiling is realistic.

Metal-spinel-corundum three phase equilibria in the system Ni-Cr-Al-O at 1373 K

The tie-lines representing the inter-crystalline ion exchange equilibria between the NiCr2O4-NiAl2O4 spinet solid solution and Cr2O3-Al2O3 corundum solid solution are determined by electron microprobe andEDAX pointcountanalysis of the oxide phases equilibrated with metallic Ni at 1373 K. The component activities in the spinet solid solution are derived from the tie-lines and thermodynamic data for Cr2O3-Al2O3 solid solution available in the literature. The Gibbs energy of mixing of the spinet solid solution calculated from the experimental data is discussed in relation to the values derived from the cation distribution models which assume random mixing of cations on both tetrahedral and octahedral sites. Positive deviation from the models is observed indicating significant positive enthalpy contribution arising form the size mismatch between Al+3 and Ni+2 ions on the tetrahedral site and Al+3, Ni+2 and Cr+3 on the octahedral site. Variation of the oxygen potential for threephase equilibrium involving metallic nickel, spinet solid solution and corundum solid solution is computed as a function of composition of the solid solutions at 1373 K. The oxygen potential exhibits a minimum at aluminum cationic fraction eta(Al)/(eta(Al) + eta(Cr)) = 0.524 in the oxide solid solutions.

If dung beetles (Scarabaeidae: Scarabaeinae) arose in association with dinosaurs, did they also suffer a mass co-extinction at the K-Pg boundary?

The evolutionary success of beetles and numerous other terrestrial insects is generally attributed to co-radiation with flowering plants but most studies have focused on herbivorous or pollinating insects. Non-herbivores represent a significant proportion of beetle diversity yet potential factors that influence their diversification have been largely unexamined. In the present study, we examine the factors driving diversification within the Scarabaeidae, a speciose beetle family with a range of both herbivorous and non-herbivorous ecologies. In particular, it has been long debated whether the key event in the evolution of dung beetles (Scarabaeidae: Scarabaeinae) was an adaptation to feeding on dinosaur or mammalian dung. Here we present molecular evidence to show that the origin of dung beetles occurred in the middle of the Cretaceous, likely in association with dinosaur dung, but more surprisingly the timing is consistent with the rise of the angiosperms. We hypothesize that the switch in dinosaur diet to incorporate more nutritious and less fibrous angiosperm foliage provided a palatable dung source that ultimately created a new niche for diversification. Given the well-accepted mass extinction of non-avian dinosaurs at the Cretaceous-Paleogene boundary, we examine a potential co-extinction of dung beetles due to the loss of an important evolutionary resource, i.e., dinosaur dung. The biogeography of dung beetles is also examined to explore the previously proposed "out of Africa" hypothesis. Given the inferred age of Scarabaeinae as originating in the Lower Cretaceous, the major radiation of dung feeders prior to the Cenomanian, and the early divergence of both African and Gondwanan lineages, we hypothesise that that faunal exchange between Africa and Gondwanaland occurred during the earliest evolution of the Scarabaeinae. Therefore we propose that both Gondwanan vicariance and dispersal of African lineages is responsible for present day distribution of scarabaeine dung beetles and provide examples.

RACK: RApid Clustering using K-means algorithm

The k-means algorithm is an extremely popular technique for clustering data. One of the major limitations of the k-means is that the time to cluster a given dataset D is linear in the number of clusters, k. In this paper, we employ height balanced trees to address this issue. Specifically, we make two major contributions, (a) we propose an algorithm, RACK (acronym for RApid Clustering using k-means), which takes time favorably comparable with the fastest known existing techniques, and (b) we prove an expected bound on the quality of clustering achieved using RACK. Our experimental results on large datasets strongly suggest that RACK is competitive with the k-means algorithm in terms of quality of clustering, while taking significantly less time.