Similarity solutions for flow and heat transfer of non-Newtonian fluid over a stretching surface

Similarity solutions are carried out for flow of power law non-Newtonian fluid film on unsteady stretching surface subjected to constant heat flux. Free convection heat transfer induces thermal boundary layer within a semi-infinite layer of Boussinesq fluid. The nonlinear coupled partial differential equations (PDE) governing the flow and the boundary conditions are converted to a system of ordinary differential equations (ODE) using two-parameter groups. This technique reduces the number of independent variables by two, and finally the obtained ordinary differential equations are solved numerically for the temperature and velocity using the shooting method. The thermal and velocity boundary layers are studied by the means of Prandtl number and non-Newtonian power index plotted in curves.

Physical activity parenting measurement and research : challenges, explanations, and solutions

Physical activity (PA) parenting research has proliferated over the past decade, with findings verifying the influential role that parents play in children's emerging PA behaviors. This knowledge, however, has not translated into effective family-based PA interventions. During a preconference workshop to the 2012 International Society for Behavioral Nutrition and Physical Activity annual meeting, a PA parenting workgroup met to: (1) Discuss challenges in PA parenting research that may limit its translation, (2) identify explanations or reasons for such challenges, and; (3) recommend strategies for future research. Challenges discussed by the workgroup included a proliferation of disconnected and inconsistently measured constructs, a limited understanding of the dimensions of PA parenting, and a narrow conceptualization of hypothesized moderators of the relationship between PA parenting and child PA. Potential reasons for such challenges emphasized by the group included a disinclination to employ theory when developing measures and examining predictors and outcomes of PA parenting as well as a lack of agreed-upon measurement standards. Suggested solutions focused on the need to link PA parenting research with general parenting research, define and adopt rigorous standards of measurement, and identify new methods to assess PA parenting. As an initial step toward implementing these recommendations, the workgroup developed a conceptual model that: (1) Integrates parenting dimensions from the general parenting literature into the conceptualization of PA parenting, (2) draws on behavioral and developmental theory, and; (3) emphasizes areas which have been neglected to date including precursors to PA parenting and effect modifiers.

Random projections on manifolds of symmetric positive definite matrices for image classification

Recent advances suggest that encoding images through Symmetric Positive Definite (SPD) matrices and then interpreting such matrices as points on Riemannian manifolds can lead to increased classification performance. Taking into account manifold geometry is typically done via (1) embedding the manifolds in tangent spaces, or (2) embedding into Reproducing Kernel Hilbert Spaces (RKHS). While embedding into tangent spaces allows the use of existing Euclidean-based learning algorithms, manifold shape is only approximated which can cause loss of discriminatory information. The RKHS approach retains more of the manifold structure, but may require non-trivial effort to kernelise Euclidean-based learning algorithms. In contrast to the above approaches, in this paper we offer a novel solution that allows SPD matrices to be used with unmodified Euclidean-based learning algorithms, with the true manifold shape well-preserved. Specifically, we propose to project SPD matrices using a set of random projection hyperplanes over RKHS into a random projection space, which leads to representing each matrix as a vector of projection coefficients. Experiments on face recognition, person re-identification and texture classification show that the proposed approach outperforms several recent methods, such as Tensor Sparse Coding, Histogram Plus Epitome, Riemannian Locality Preserving Projection and Relational Divergence Classification.

Physical inactivity remains the greatest public health problem of the 21st century : evidence, improved methods and solutions using the '7 investments that work' as a framework

In 2009, BJSM's first editorial argued that ‘Physical inactivity is the greatest public health problem of the 21st century’.1 The data supporting that claim have not yet been challenged. Now, 5 years after BJSM published its first dedicated ‘Physical Activity is Medicine’ theme issue (http://bjsm.bmj.com/content/43/1.toc) we are pleased to highlight 23 new contributions from six countries. This issue contains an analysis of the cost of physical inactivity from the US Centre for Diseases Control.2 We also report the cost-effectiveness of one particular physical activity intervention for adults.3

Hydrolysis of triasulfuron, metsulfuron-methyl and chlorsulfuron in alkaline soil and aqueous solutions

The hydrolysis of triasulfuron, metsulfuron-methyl and chlorsulfuron in aqueous buffer solutions and in soil suspensions at pH values ranging from 5.2 to 11.2 was investigated. Hydrolysis of all three compounds in both aqueous buffer and soil suspensions was highly pH-sensitive. The rate of hydrolysis was much faster in the acidic pH range (5.2-6.2) than under neutral and moderately alkaline conditions (8.2-9.4), but it increased rapidly as the pH exceeded 10.2. All three compounds degraded faster at pH 5.2 than at pH 11.2. Hydrolysis rates of all three compounds could be described well with pseudo-first-order kinetics. There were no significant differences (P =0.05) in the rate constants (k, day-1) of the three compounds in soil suspensions from those in buffer solutions within the pH ranges studied. A functional relationship based on the propensity of nonionic and anionic species of the herbicides to hydrolyse was used to describe the dependence of the 'rate constant' on pH. The hydrolysis involving attack by neutral water was at least 100-fold faster when the sulfonylurea herbicides were undissociated (acidic conditions) than when they were present as the anion at near neutral pH. In aqueous buffer solution at pH > 11, a prominent degradation pathway involved O-demethylation of metsulfuron-methyl to yield a highly polar degradate, and hydrolytic opening of the triazine ring. It is concluded that these herbicides are not likely to degrade substantially through hydrolysis in most agricultural (C) 2000 Society of Chemical Industry.

Removal of methyl orange from aqueous solutions through adsorption by calcium aluminate hydrates

Methyl orange (MO) is a kind of anionic dye and widely used in industry. In this study, tricalcium aluminate hydrates (Ca-Al-LDHs) are used as an adsorbent to remove methyl orange (MO) from aqueous solutions. The resulting products were studied by X-ray diffraction (XRD), infrared spectroscopy (MIR), thermal analysis (TG-DTA) and scanning electron microscope (SEM). The XRD results indicated that the MO molecules were successfully intercalated into the tricalcium aluminate hydrates, with the basal spacing of Ca-Al-LDH expanding to 2.48 nm. The MIR spectrum for CaAl-MO-LDH shows obvious bands assigned to the N@N, N@H stretching vibrations and S@O, SO_ 3 group respectively, which are considered as marks to assess MO_ ion intercalation into the interlayers of LDH. The overall morphology of CaAl-MOLDH displayed a ‘‘honey-comb’’ like structure, with the adjacent layers expanded.

Two dynamic discrete choice estimation problems and simulation method solutions

This paper considers two problems that frequently arise in dynamic discrete choice problems but have not received much attention with regard to simulation methods. The first problem is how to simulate unbiased simulators of probabilities conditional on past history. The second is simulating a discrete transition probability model when the underlying dependent variable is really continuous. Both methods work well relative to reasonable alternatives in the application discussed. However, in both cases, for this application, simpler methods also provide reasonably good results.

Approximate solutions to stochastic dynamic programs

This paper examines the properties of various approximation methods for solving stochastic dynamic programs in structural estimation problems. The problem addressed is evaluating the expected value of the maximum of available choices. The paper shows that approximating this by the maximum of expected values frequently has poor properties. It also shows that choosing a convenient distributional assumptions for the errors and then solving exactly conditional on the distributional assumption leads to small approximation errors even if the distribution is misspecified. © 1997 Cambridge University Press.

Renormalization group interpretation of the Born and Rytov approximations

In this paper the method of renormalization group (RG) [Phys. Rev. E 54, 376 (1996)] is related to the well-known approximations of Rytov and Born used in wave propagation in deterministic and random media. Certain problems in linear and nonlinear media are examined from the viewpoint of RG and compared with the literature on Born and Rytov approximations. It is found that the Rytov approximation forms a special case of the asymptotic expansion generated by the RG, and as such it gives a superior approximation to the exact solution compared with its Born counterpart. Analogous conclusions are reached for nonlinear equations with an intensity-dependent index of refraction where the RG recovers the exact solution. © 2008 Optical Society of America.

Some solutions for a compressible isotropic elastic material

In this article we obtain closed-form solutions for the combined inflation and axial shear of an elastic tube in respect of the compressible Isotropic elastic material introduced by Levinson and Burgess. Several other boundary-value problems are also examined, including the bending of a rectangular block and straightening of a cylindrical sector, both coupled with stretching and shearing, and an axially varying twist deformation. Some of the solutions appear in closed form, others are expressible in terms of elliptic functions.

Shared generation of pseudo-random functions

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽trandom collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where fsi(·)'s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali–Sidney scheme is a special case of this general construction. We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Shared generation of pseudo-random functions with cumulative maps

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Cost efficiency of Japanese steam power generation companies : a Bayesian comparison of random and fixed frontier models

This study analyses and compares the cost efficiency of Japanese steam power generation companies using the fixed and random Bayesian frontier models. We show that it is essential to account for heterogeneity in modelling the performance of energy companies. Results from the model estimation also indicate that restricting CO2 emissions can lead to a decrease in total cost. The study finally discusses the efficiency variations between the energy companies under analysis, and elaborates on the managerial and policy implications of the results.

A random key genetic algorithm for live migration of multiple virtual machines in data centers

Live migration of multiple Virtual Machines (VMs) has become an integral management activity in data centers for power saving, load balancing and system maintenance. While state-of-the-art live migration techniques focus on the improvement of migration performance of an independent single VM, only a little has been investigated to the case of live migration of multiple interacting VMs. Live migration is mostly influenced by the network bandwidth and arbitrarily migrating a VM which has data inter-dependencies with other VMs may increase the bandwidth consumption and adversely affect the performances of subsequent migrations. In this paper, we propose a Random Key Genetic Algorithm (RKGA) that efficiently schedules the migration of a given set of VMs accounting both inter-VM dependency and data center communication network. The experimental results show that the RKGA can schedule the migration of multiple VMs with significantly shorter total migration time and total downtime compared to a heuristic algorithm.

Emerging Opportunities for "Design Thinking" to Deliver Sustainable Solutions in the Built Environment

In the built environment sector, a range of innovations are delivering environmental improvements with mixed success worldwide. The authors of this paper argue that a more “disruptive” form of innovation is needed to bring about significant and systemic change within the sector. Critical to this transition is the development of new behaviours and values. In particular, built environment professionals need to become active change agents in cultivating these new behaviours and values through the development of collaborative visions, scenarios, practices, and ideas. This paper identifies and discusses the critical role that design (in its broadest sense) can play in this process. Drawing on a comprehensive review of literature, the authors highlight a number of transformational opportunities for cross professional learning and sharing between design and built environment disciplines in achieving environmental innovation (eco-innovation). The paper also considers several design-based concepts that have a potential application in the built environment sector including: design thinking, social innovation (human-centered), and disruptive innovation (transformational) approaches. The research findings will assist in building the capabilities of designers and innovators to create sustainable solutions to global problems, and in supporting the social diffusion of systems-changing ideas in the built environment sector.