Catalyst-free plasma enhanced growth of graphene from sustainable sources

Details of a fast and sustainable bottom-up process to grow large area high quality graphene films without the aid of any catalyst are reported in this paper. We used Melaleuca alternifolia, a volatile natural extract from tea tree plant as the precursor. The as-fabricated graphene films yielded a stable contact angle of 135°, indicating their potential application in very high hydrophobic coatings. The electronic devices formed by sandwiching pentacene between graphene and aluminum films demonstrated memristive behavior, and hence, these graphene films could find use in nonvolatile memory devices also.

Time evolution of graphene growth on SiC as a function of annealing temperature

We followed by X-ray Photoelectron Spectroscopy (XPS) the time evolution of graphene layers obtained by annealing 3C SiC(111)/Si(111) crystals at different temperatures. The intensity of the carbon signal provides a quantification of the graphene thickness as a function of the annealing time, which follows a power law with exponent 0.5. We show that a kinetic model, based on a bottom-up growth mechanism, provides a full explanation to the evolution of the graphene thickness as a function of time, allowing to calculate the effective activation energy of the process and the energy barriers, in excellent agreement with previous theoretical results. Our study provides a complete and exhaustive picture of Si diffusion into the SiC matrix, establishing the conditions for a perfect control of the graphene growth by Si sublimation.

Insights into PBDE uptake, body burden, and elimination gained from Australian age–Concentration trends observed shortly after peak exposure

Background Population pharmacokinetic models combined with multiple sets of age– concentration biomonitoring data facilitate back-calculation of chemical uptake rates from biomonitoring data. Objectives We back-calculated uptake rates of PBDEs for the Australian population from multiple biomonitoring surveys (top-down) and compared them with uptake rates calculated from dietary intake estimates of PBDEs and PBDE concentrations in dust (bottom-up). Methods Using three sets of PBDE elimination half-lives, we applied a population pharmacokinetic model to the PBDE biomonitoring data measured between 2002–2003 and 2010–2011 to derive the top-down uptake rates of four key PBDE congeners and six age groups. For the bottom-up approach, we used PBDE concentrations measured around 2005. Results Top-down uptake rates of Σ4BDE (the sum of BDEs 47, 99, 100, and 153) varied from 7.9 to 19 ng/kg/day for toddlers and from 1.2 to 3.0 ng/kg/day for adults; in most cases, they were—for all age groups—higher than the bottom-up uptake rates. The discrepancy was largest for toddlers with factors up to 7–15 depending on the congener. Despite different elimination half-lives of the four congeners, the age–concentration trends showed no increase in concentration with age and were similar for all congeners. Conclusions In the bottom-up approach, PBDE uptake is underestimated; currently known pathways are not sufficient to explain measured PBDE concentrations, especially in young children. Although PBDE exposure of toddlers has declined in the past years, pre- and postnatal exposure to PBDEs has remained almost constant because the mothers’ PBDE body burden has not yet decreased substantially.

Top-predator control-induced trophic cascades: an alternative hypothesis to the conclusion of Colman et al.

Recently argued that observed positive relationships between dingoes and small mammals were a result of top-down processes whereby lethal dingo control reduced dingoes and increased mesopredators and herbivores, which then suppressed small mammals. Here, I show that the prerequisite negative effects of dingo control on dingoes were not shown, and that the same positive relationships observed may simply represent well-known bottom-up processes whereby more generalist predators are found in places with more of their preferred prey. Identification of top-predator controlinduced trophic cascades first requires demonstration of some actual effect of control on predators, typically possible only through manipulative experiments with the ability to identify cause and effect.

Transforming higher education and student engagement through collaborative review to inform educational design

This paper reports on staff perceptions arising from a review process designed to assist staff in making informed decisions regarding educational design, approaches to engage students in learning, and the technology to support engagement in the classroom and across multiple locations and delivery modes. The aim of the review process was to transform the level of student engagement in the business faculty of an Australian university. The process took a collaborative approach through consultation with academic staff involved in the design and delivery of the units under review, and included targeted professional development as necessary. An institutional framework that characterises engagement indicator contexts and their attributes facilitated dialog during the review process. This paper reports on a mixed method study that included a survey of participants, and purposeful interviews to evaluate the effectiveness of the process. Although the study identified factors that hindered implementation and operationalization of review recommendations in some instances, study participants were generally of the view that recommendations would enhance student engagement. It is demonstrated that the bottom-up approach described in this paper is consistent with theoretical frameworks for transformational change in teaching and learning and the adoption of innovations.

A Shapley value analysis to coordinate the formation of procurement

In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged. Formation of such procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions. Recent research in supply chain management has emphasized that such decisions need to take into account the fact that suppliers and buyers are intelligent and rational agents who act strategically. In this paper, we view the problem of Procurement Network Formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a fair manner. We study the implications of using the Shapley value as a solution concept for forming such procurement networks. We also present a protocol, based on the extensive form game realization of the Shapley value, for forming these networks.

The core and shapley value analysis for cooperative formation of procurement networks

Formation of high value procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions, where suppliers are intelligent and rational agents who act strategically. In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged We model the problem of Procurement Network Formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a stable and fair manner We first investigate the stability of such networks by examining the conditions under which the core of the game is non-empty. We then present a protocol, based on the extensive form game realization of the core, for forming such networks so that the resulting network is stable. We also mention a key result when the Shapley value is applied as a solution concept.

Robust heuristics for scalable optimization of complex SQL queries

Modern database systems incorporate a query optimizer to identify the most efficient "query execution plan" for executing the declarative SQL queries submitted by users. A dynamic-programming-based approach is used to exhaustively enumerate the combinatorially large search space of plan alternatives and, using a cost model, to identify the optimal choice. While dynamic programming (DP) works very well for moderately complex queries with up to around a dozen base relations, it usually fails to scale beyond this stage due to its inherent exponential space and time complexity. Therefore, DP becomes practically infeasible for complex queries with a large number of base relations, such as those found in current decision-support and enterprise management applications. To address the above problem, a variety of approaches have been proposed in the literature. Some completely jettison the DP approach and resort to alternative techniques such as randomized algorithms, whereas others have retained DP by using heuristics to prune the search space to computationally manageable levels. In the latter class, a well-known strategy is "iterative dynamic programming" (IDP) wherein DP is employed bottom-up until it hits its feasibility limit, and then iteratively restarted with a significantly reduced subset of the execution plans currently under consideration. The experimental evaluation of IDP indicated that by appropriate choice of algorithmic parameters, it was possible to almost always obtain "good" (within a factor of twice of the optimal) plans, and in the few remaining cases, mostly "acceptable" (within an order of magnitude of the optimal) plans, and rarely, a "bad" plan. While IDP is certainly an innovative and powerful approach, we have found that there are a variety of common query frameworks wherein it can fail to consistently produce good plans, let alone the optimal choice. This is especially so when star or clique components are present, increasing the complexity of th- e join graphs. Worse, this shortcoming is exacerbated when the number of relations participating in the query is scaled upwards.

Fast in-memory XPath search using compressed indexes

A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicates can be efficiently implemented using a compressed self-index of the document's text nodes. Most queries, however, contain some parts querying the text of the document, plus some parts querying the tree structure. It is therefore a challenge to choose an appropriate evaluation order for a given query, which optimally leverages the execution speeds of the text and tree indexes. Here the SXSI system is introduced. It stores the tree structure of an XML document using a bit array of opening and closing brackets plus a sequence of labels, and stores the text nodes of the document using a global compressed self-index. On top of these indexes sits an XPath query engine that is based on tree automata. The engine uses fast counting queries of the text index in order to dynamically determine whether to evaluate top-down or bottom-up with respect to the tree structure. The resulting system has several advantages over existing systems: (1) on pure tree queries (without text search) such as the XPathMark queries, the SXSI system performs on par or better than the fastest known systems MonetDB and Qizx, (2) on queries that use text search, SXSI outperforms the existing systems by 1-3 orders of magnitude (depending on the size of the result set), and (3) with respect to memory consumption, SXSI outperforms all other systems for counting-only queries.

A compiler writing system based on affix grammars

We present an algorithm for testing the suitability of an affix grammar for deterministic, one-pass, bottom-up parsing which is an improvement over the one suggested by Pohlmann [1]. The space requirements of the new algorithm are considerably less than that of Pohlmann's. We also describe an implementation of Pohlmann's algorithm and methods for improving its space requirements.

A new methodology for analyzing distributed systems modeled by petri nets

Distributed computing systems can be modeled adequately by Petri nets. The computation of invariants of Petri nets becomes necessary for proving the properties of modeled systems. This paper presents a two-phase, bottom-up approach for invariant computation and analysis of Petri nets. In the first phase, a newly defined subnet, called the RP-subnet, with an invariant is chosen. In the second phase, the selected RP-subnet is analyzed. Our methodology is illustrated with two examples viz., the dining philosophers' problem and the connection-disconnection phase of a transport protocol. We believe that this new method, which is computationally no worse than the existing techniques, would simplify the analysis of many practical distributed systems.

A Shapley Value Analysis to Coordinate the Formation of Procurement Networks

In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged. Formation of such procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions. Research in supply chain management has emphasized that such decisions need to take into account the fact that suppliers and buyers are intelligent and rational agents who act strategically. In this paper, we view the problem of procurement network formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a fair manner. We study the implications of using the Shapley value as a solution concept for forming such procurement networks. We also present a protocol, based on the extensive form game realization of the Shapley value, for forming these networks.

Self-Assembling Peptides: From Molecules to Nanobiomaterials

Abstract | Molecular self-assembly plays a vital role in the construction of various nanostructures using the ‘bottom-up’ approach. Peptides have been considered important bio-molecular building blocks for different nanoscale structures as they are biocompatible, biodegradable, generally non-toxic and can be attuned to environmental responses like pH, temperature, salt concentration and others. Peptide based nanostructures can offer various wonderful biological applications in tissue engineering, cell culture, regenerative medicine and drug delivery. In this review, the construction of short peptide-based different nanostructures including nanotubes, nanovesicles and nanofibers, short peptide-based nanoporous materials, short peptide-based nanofibrous hydrogels and nanovesicles for various biological applications has been discussed. Moreover, morphological transformations from one nanoscopic structure to an other type of nanostructure (e.g., nanotubes to nanovesicles) are also clearly discussed in this review.

Model projections for household energy use in India

Energy use in developing countries is heterogeneous across households. Present day global energy models are mostly too aggregate to account for this heterogeneity. Here, a bottom-up model for residential energy use that starts from key dynamic concepts on energy use in developing countries is presented and applied to India. Energy use and fuel choice is determined for five end-use functions (cooking, water heating, space heating, lighting and appliances) and for five different income quintiles in rural and urban areas. The paper specifically explores the consequences of different assumptions for income distribution and rural electrification on residential sector energy use and CO(2) emissions, finding that results are clearly sensitive to variations in these parameters. As a result of population and economic growth, total Indian residential energy use is expected to increase by around 65-75% in 2050 compared to 2005, but residential carbon emissions may increase by up to 9-10 times the 2005 level. While a more equal income distribution and rural electrification enhance the transition to commercial fuels and reduce poverty, there is a trade-off in terms of higher CO(2) emissions via increased electricity use. (C) 2011 Elsevier Ltd. All rights reserved.

Realization of thermally durable close-packed 2D gold nanoparticle arrays using self-assembly and plasma etching

Realization of thermally and chemically durable, ordered gold nanostructures using bottom-up self-assembly techniques are essential for applications in a wide range of areas including catalysis, energy generation, and sensing. Herein, we describe a modular process for realizing uniform arrays of gold nanoparticles, with interparticle spacings of 2 nm and above, by using RF plasma etching to remove ligands from self-assembled arrays of ligand-coated gold nanoparticles. Both nanoscale imaging and macroscale spectroscopic characterization techniques were used to determine the optimal conditions for plasma etching, namely RF power, operating pressure, duration of treatment, and type of gas. We then studied the effect of nanoparticle size, interparticle spacing, and type of substrate on the thermal durability of plasma-treated and untreated nanoparticle arrays. Plasma-treated arrays showed enhanced chemical and thermal durability, on account of the removal of ligands. To illustrate the application potential of the developed process, robust SERS (surface-enhanced Raman scattering) substrates were formed using plasma-treated arrays of silver-coated gold nanoparticles that had a silicon wafer or photopaper as the underlying support. The measured value of the average SERS enhancement factor (2 x 10(5)) was quantitatively reproducible on both silicon and paper substrates. The silicon substrates gave quantitatively reproducible results even after thermal annealing. The paper-based SERS substrate was also used to swab and detect probe molecules deposited on a solid surface.