Serine/Threonine/Tyrosine Protein Kinase Phosphorylates Oleosin, a Regulator of Lipid Metabolic Functions

Plant oils are stored in oleosomes or oil bodies, which are surrounded by a monolayer of phospholipids embedded with oleosin proteins that stabilize the structure. Recently, a structural protein, Oleosin3 (OLE3), was shown to exhibit both monoacylglycerol acyltransferase and phospholipase A(2) activities. The regulation of these distinct dual activities in a single protein is unclear. Here, we report that a serine/threonine/tyrosine protein kinase phosphorylates oleosin. Using bimolecular fluorescence complementation analysis, we demonstrate that this kinase interacts with OLE3 and that the fluorescence was associated with chloroplasts. Oleosin-green fluorescent protein fusion protein was exclusively associated with the chloroplasts. Phosphorylated OLE3 exhibited reduced monoacylglycerol acyltransferase and increased phospholipase A(2) activities. Moreover, phosphatidylcholine and diacylglycerol activated oleosin phosphorylation, whereas lysophosphatidylcholine, oleic acid, and Ca2+ inhibited phosphorylation. In addition, recombinant peanut (Arachis hypogaea) kinase was determined to predominantly phosphorylate serine residues, specifically serine-18 in OLE3. Phosphorylation levels of OLE3 during seed germination were determined to be higher than in developing peanut seeds. These findings provide direct evidence for the in vivo substrate selectivity of the dual-specificity kinase and demonstrate that the bifunctional activities of oleosin are regulated by phosphorylation.

Effect of thickness variation of hole injection and hole blocking layers on the performance of fluorescent green organic light emitting diodes

In this paper we present the effect of thickness variation of hole injection and hole blocking layers on the performance of fluorescent green organic light emitting diodes (OLEDs). A number of OLED devices have been fabricated with combinations of hole injecting and hole blocking layers of varying thicknesses. Even though hole blocking and hole injection layers have opposite functions, yet there is a particular combination of their thicknesses when they function in conjunction and luminous efficiency and power efficiency are maximized. The optimum thickness of CuPc (Copper(II) phthalocyanine) layer, used as hole injection layer and BCP (2,9 dimethyl-4,7-diphenyl-1,10-phenanthroline) used as hole blocking layer were found to be 18 nm and 10 nm respectively. It is with this delicate adjustment of thicknesses, charge balancing is achieved and luminous efficiency and power efficiency were optimized. The maximum luminous efficiency of 3.82 cd/A at a current density of 24.45 mA/cm(2) and maximum power efficiency of 2.61 lm/W at a current density of 5.3 mA/cm(2) were achieved. We obtained luminance of 5993 cd/m(2) when current density was 140 mA/cm(2). The EL spectra was obtained for the LEDs and found that it has a peaking at 524 nm of wavelength. (C) 2012 Elsevier B.V. All rights reserved.

Spectral moment sum rules for the retarded Green's function and self-energy of the inhomogeneous Bose-Hubbard model in equilibrium and nonequilibrium

We derive exact expressions for the zeroth and the first three spectral moment sum rules for the retarded Green's function and for the zeroth and the first spectral moment sum rules for the retarded self-energy of the inhomogeneous Bose-Hubbard model in nonequilibrium, when the local on-site repulsion and the chemical potential are time-dependent, and in the presence of an external time-dependent electromagnetic field. We also evaluate these expressions for the homogeneous case in equilibrium, where all time dependence and external fields vanish. Unlike similar sum rules for the Fermi-Hubbard model, in the Bose-Hubbard model case, the sum rules often depend on expectation values that cannot be determined simply from parameters in the Hamiltonian like the interaction strength and chemical potential but require knowledge of equal-time many-body expectation values from some other source. We show how one can approximately evaluate these expectation values for the Mott-insulating phase in a systematic strong-coupling expansion in powers of the hopping divided by the interaction. We compare the exact moment relations to the calculated moments of spectral functions determined from a variety of different numerical approximations and use them to benchmark their accuracy. DOI: 10.1103/PhysRevA.87.013628

Lower bounds for testing triangle-freeness in Boolean functions

Given a Boolean function , we say a triple (x, y, x + y) is a triangle in f if . A triangle-free function contains no triangle. If f differs from every triangle-free function on at least points, then f is said to be -far from triangle-free. In this work, we analyze the query complexity of testers that, with constant probability, distinguish triangle-free functions from those -far from triangle-free. Let the canonical tester for triangle-freeness denotes the algorithm that repeatedly picks x and y uniformly and independently at random from , queries f(x), f(y) and f(x + y), and checks whether f(x) = f(y) = f(x + y) = 1. Green showed that the canonical tester rejects functions -far from triangle-free with constant probability if its query complexity is a tower of 2's whose height is polynomial in . Fox later improved the height of the tower in Green's upper bound to . A trivial lower bound of on the query complexity is immediate. In this paper, we give the first non-trivial lower bound for the number of queries needed. We show that, for every small enough , there exists an integer such that for all there exists a function depending on all n variables which is -far from being triangle-free and requires queries for the canonical tester. We also show that the query complexity of any general (possibly adaptive) one-sided tester for triangle-freeness is at least square root of the query complexity of the corresponding canonical tester. Consequently, this means that any one-sided tester for triangle-freeness must make at least queries.

Algorithmic challenges in green data centers

With data centers being the supporting infrastructure for a wide range of IT services, their efficiency has become a big concern to operators, as well as to society, for both economic and environmental reasons. The goal of this thesis is to design energy-efficient algorithms that reduce energy cost while minimizing compromise to service. We focus on the algorithmic challenges at different levels of energy optimization across the data center stack. The algorithmic challenge at the device level is to improve the energy efficiency of a single computational device via techniques such as job scheduling and speed scaling. We analyze the common speed scaling algorithms in both the worst-case model and stochastic model to answer some fundamental issues in the design of speed scaling algorithms. The algorithmic challenge at the local data center level is to dynamically allocate resources (e.g., servers) and to dispatch the workload in a data center. We develop an online algorithm to make a data center more power-proportional by dynamically adapting the number of active servers. The algorithmic challenge at the global data center level is to dispatch the workload across multiple data centers, considering the geographical diversity of electricity price, availability of renewable energy, and network propagation delay. We propose algorithms to jointly optimize routing and provisioning in an online manner. Motivated by the above online decision problems, we move on to study a general class of online problem named "smoothed online convex optimization", which seeks to minimize the sum of a sequence of convex functions when "smooth" solutions are preferred. This model allows us to bridge different research communities and help us get a more fundamental understanding of general online decision problems.

Fast Lattice Green's Function Methods for Viscous Incompressible Flows on Unbounded Domains

In this thesis, a collection of novel numerical techniques culminating in a fast, parallel method for the direct numerical simulation of incompressible viscous flows around surfaces immersed in unbounded fluid domains is presented. At the core of all these techniques is the use of the fundamental solutions, or lattice Green’s functions, of discrete operators to solve inhomogeneous elliptic difference equations arising in the discretization of the three-dimensional incompressible Navier-Stokes equations on unbounded regular grids. In addition to automatically enforcing the natural free-space boundary conditions, these new lattice Green’s function techniques facilitate the implementation of robust staggered-Cartesian-grid flow solvers with efficient nodal distributions and fast multipole methods. The provable conservation and stability properties of the appropriately combined discretization and solution techniques ensure robust numerical solutions. Numerical experiments on thin vortex rings, low-aspect-ratio flat plates, and spheres are used verify the accuracy, physical fidelity, and computational efficiency of the present formulations.

Green function for the diffusion limit of one-dimensional continuous time random walks

It is shown how the fractional probability density diffusion equation for the diffusion limit of one-dimensional continuous time random walks may be derived from a generalized Markovian Chapman-Kolmogorov equation. The non-Markovian behaviour is incorporated into the Markovian Chapman-Kolmogorov equation by postulating a Levy like distribution of waiting times as a kernel. The Chapman-Kolmogorov equation so generalised then takes on the form of a convolution integral. The dependence on the initial conditions typical of a non-Markovian process is treated by adding a time dependent term involving the survival probability to the convolution integral. In the diffusion limit these two assumptions about the past history of the process are sufficient to reproduce anomalous diffusion and relaxation behaviour of the Cole-Cole type. The Green function in the diffusion limit is calculated using the fact that the characteristic function is the Mittag-Leffler function. Fourier inversion of the characteristic function yields the Green function in terms of a Wright function. The moments of the distribution function are evaluated from the Mittag-Leffler function using the properties of characteristic functions and a relation between the powers of the second moment and higher order even moments is derived. (C) 2004 Elsevier B.V. All rights reserved.

Escape times for rigid Brownian rotators in a bistable potential from the time evolution of the Green function and the characteristic time of the probability evolution

The greatest relaxation time for an assembly of three- dimensional rigid rotators in an axially symmetric bistable potential is obtained exactly in terms of continued fractions as a sum of the zero frequency decay functions (averages of the Legendre polynomials) of the system. This is accomplished by studying the entire time evolution of the Green function (transition probability) by expanding the time dependent distribution as a Fourier series and proceeding to the zero frequency limit of the Laplace transform of that distribution. The procedure is entirely analogous to the calculation of the characteristic time of the probability evolution (the integral of the configuration space probability density function with respect to the position co-ordinate) for a particle undergoing translational diffusion in a potential; a concept originally used by Malakhov and Pankratov (Physica A 229 (1996) 109). This procedure allowed them to obtain exact solutions of the Kramers one-dimensional translational escape rate problem for piecewise parabolic potentials. The solution was accomplished by posing the problem in terms of the appropriate Sturm-Liouville equation which could be solved in terms of the parabolic cylinder functions. The method (as applied to rotational problems and posed in terms of recurrence relations for the decay functions, i.e., the Brinkman approach c.f. Blomberg, Physica A 86 (1977) 49, as opposed to the Sturm-Liouville one) demonstrates clearly that the greatest relaxation time unlike the integral relaxation time which is governed by a single decay function (albeit coupled to all the others in non-linear fashion via the underlying recurrence relation) is governed by a sum of decay functions. The method is easily generalized to multidimensional state spaces by matrix continued fraction methods allowing one to treat non-axially symmetric potentials, where the distribution function is governed by two state variables. (C) 2001 Elsevier Science B.V. All rights reserved.

Convergence acceleration of the doubly periodic Green's function for the analysis of thin wire arrays

A method is proposed to accelerate the evaluation of the Green's function of an infinite double periodic array of thin wire antennas. The method is based on the expansion of the Green's function into series corresponding to the propagating and evanescent waves and the use of Poisson and Kummer transformations enhanced with the analytic summation of the slowly convergent asymptotic terms. Unlike existing techniques the procedure reported here provides uniform convergence regardless of the geometrical parameters of the problem or plane wave excitation wavelength. In addition, it is numerically stable and does not require numerical integration or internal tuning parameters, since all necessary series are directly calculated in terms of analytical functions. This means that for nonlinear problem scenarios that the algorithm can be deployed without run time intervention or recursive adjustment within a harmonic balance engine. Numerical examples are provided to illustrate the efficiency and accuracy of the developed approach as compared with the Ewald method for which these classes of problems requires run time splitting parameter adaptation.

Quantum annealing of an ising spin-glass by Green's function Monte Carlo

We present an implementation of quantum annealing (QA) via lattice Green's function Monte Carlo (GFMC), focusing on its application to the Ising spin glass in transverse field. In particular, we study whether or not such a method is more effective than the path-integral Monte Carlo- (PIMC) based QA, as well as classical simulated annealing (CA), previously tested on the same optimization problem. We identify the issue of importance sampling, i.e., the necessity of possessing reasonably good (variational) trial wave functions, as the key point of the algorithm. We performed GFMC-QA runs using such a Boltzmann-type trial wave function, finding results for the residual energies that are qualitatively similar to those of CA (but at a much larger computational cost), and definitely worse than PIMC-QA. We conclude that, at present, without a serious effort in constructing reliable importance sampling variational wave functions for a quantum glass, GFMC-QA is not a true competitor of PIMC-QA.

Broadband Green's Function and Applications to Fast Electromagnetic Analysis of High-Speed Interconnects

Thesis (Ph.D.)--University of Washington, 2015

Efficient calculation of two-dimensional periodic and waveguide acoustic Green’s functions

New representations and efficient calculation methods are derived for the problem of propagation from an infinite regularly spaced array of coherent line sources above a homogeneous impedance plane, and for the Green's function for sound propagation in the canyon formed by two infinitely high, parallel rigid or sound soft walls and an impedance ground surface. The infinite sum of source contributions is replaced by a finite sum and the remainder is expressed as a Laplace-type integral. A pole subtraction technique is used to remove poles in the integrand which lie near the path of integration, obtaining a smooth integrand, more suitable for numerical integration, and a specific numerical integration method is proposed. Numerical experiments show highly accurate results across the frequency spectrum for a range of ground surface types. It is expected that the methods proposed will prove useful in boundary element modeling of noise propagation in canyon streets and in ducts, and for problems of scattering by periodic surfaces.

Implementing green business processes : the importance of functional affordances of information systems

An environmentally sustainable and thus green business process is one that delivers organizational value whilst also exerting a minimal impact on the natural environment. Recent works from the field of Information Systems (IS) have argued that information systems can contribute to the design and implementation of sustainable business processes. While prior research has investigated how information systems can be used in order to support sustainable business practices, there is still a void as to the actual changes that business processes have to undergo in order to become environmentally sustainable, and the specific role that information systems play in enabling this change. In this paper, we provide a conceptualization of environmentally sustainable business processes, and discuss the role of functional affordances of information systems in enabling both incremental and radical changes in order to make processes environmentally sustainable. Our conceptualization is based on (a) a fundamental definition of the concept of environmental sustainability, grounded in two basic components: the environmental source and sink functions of any project or activity, and (b) the concept of functional affordances, which describe the potential uses originating in the material properties of information systems in relation to their use context. In order to illustrate the application of our framework and provide a first evaluation, we analyse two examples from prior research where information systems impacted on the sustainability of business processes.

Green logistics: key elements for a well-functioning sustainable logistics system

A growing awareness of the modern society about the direct relationship between a growing global community with increasing total industrial activities on one hand and various environmental problems and a natural limitation of natural resources on the other hand set the base for sustainable or “green” approaches within the supply chain. This paper therefore will look at the issue of “Green Logistics” which seeks to reduce the environmental impact of logistics activities by taking into account functions such as recycling, waste and carbon emission reduction and the use of alternative sources of energy. In order to analyze how these approaches and ideas are being perceived by the system as a whole two models from the area of prospective and scenario planning are being used and described to identify the main drivers and tendencies within the system in order to create feasible hypothesis. Using the URCA/CHIVAS model allows us to identify the driver variables out of a high number of variables that best describe the system “Green Logistics”. Followed by the analysis of the actor’s strategies in the system with the Mactor model it is possible to reduce the complexity of a completely holistic system to a few key drivers that can be analyzed further on. Here the implications of URCA/CHIVAS and Mactor are being used to formulate hypotheses about the perception of Green Logistics and its successful implementation among logistics decision makers by an online survey. This research seeks to demonstrate the usefulness of scenario planning to a highly complex system observing it from all angles and extracting information about the relevant factors of it. The results of this demonstration indicate that there are drivers much beyond the factory walls that need to be considered when implementing successfully a system such as Green Logistics.