Studies on Plant Aspartate Transcarbamylase Purification and Properties of the Enzyme from Mung-Bean (Phaseolus aureus) Seedlings

Aspartate transcarbamylase is purified from mung bean seedlings by a series of steps involving manganous sulphate treatment, ammonium sulphate fractionation, DEAE-cellulose chromatography, followed by a second ammonium sulphate fractionation and finally gel filtration on Sephadex-G 100. The enzyme is homogeneous on ultracentrifugation and on polyacrylamide gel electrophoresis. It functions optimally at 55°C. It has two pH optima, one at 8.0 and the other at 10.2. The enzyme follows Michaelis-Menten kinetics with l-aspartate as the variable substrate. However, it exhibits sigmoid saturation curves at both the pH optima when the concentration of carbamyl phosphate is varied. The enzyme is allosterically inhibited by UMP at both the pH optima. Increasing phosphorylation of the uridine nucleotide decreases the inhibitory effect. The enzyme is desensitized to inhibition by UMP on treatment with p-hydroxymercuribenzoate, gel electrophoresis indicating that the enzyme is dissociated by this treatment; the dissociated enzyme can be reassociated by treatment with 2-mercaptoethanol. The properties of the mung bean enzyme are compared with the enzyme from other sources.

A note on non-separable solutions of linear partial differential equation

A method has been presented for constructing non-separable solutions of homogeneous linear partial differential equations of the type F(D, D′)W = 0, where D = ∂/∂x, D′ = ∂/∂y, Image where crs are constants and n stands for the order of the equation. The method has also been extended for equations of the form Φ(D, D′, D″)W = 0, where D = ∂/∂x, D′ = ∂/∂y, D″ = ∂/∂z and Image As illustration, the method has been applied to obtain nonseparable solutions of the two and three dimensional Helmholtz equations.

L2-stability of nonstationary feedback systems: Frequency-domain criteria

A frequency-domain positivity condition is derived for linear time-varying operators in2and is used to develop2stability criteria for linear and nonlinear feedback systems. These criteria permit the use of a very general class of operators in2with nonstationary kernels, as multipliers. More specific results are obtained by using a first-order differential operator with a time-varying coefficient as multiplier. Finally, by employing periodic multipliers, improved stability criteria are derived for the nonlinear damped Mathieu equation with a forcing function.

Zeaxanthin biofortification of sweet-corn and factors affecting zeaxanthin accumulation and colour change

Zeaxanthin, along with its isomer lutein, are the major carotenoids contributing to the characteristic colour of yellow sweet-corn. From a human health perspective, these two carotenoids are also specifically accumulated in the human macula, and are thought to protect the photoreceptor cells of the eye from blue light oxidative damage and to improve visual acuity. As humans cannot synthesise these compounds, they must be accumulated from dietary components containing zeaxanthin and lutein. In comparison to most dietary sources, yellow sweet-corn (Zea mays var. rugosa) is a particularly good source of zeaxanthin, although the concentration of zeaxanthin is still fairly low in comparison to what is considered a supplementary dose to improve macular pigment concentration (2 mg/person/day). In our present project, we have increased zeaxanthin concentration in sweet-corn kernels from 0.2 to 0.3 mg/100 g FW to greater than 2.0 mg/100 g FW at sweet-corn eating-stage, substantially reducing the amount of corn required to provide the same dosage of zeaxanthin. This was achieved by altering the carotenoid synthesis pathway to more than double total carotenoid synthesis and to redirect carotenoid synthesis towards the beta-arm of the pathway where zeaxanthin is synthesised. This resulted in a proportional increase of zeaxanthin from 22% to 70% of the total carotenoid present. As kernels increase in physiological maturity, carotenoid concentration also significantly increases, mainly due to increased synthesis but also due to a decline in moisture content of the kernels. When fully mature, dried kernels can reach zeaxanthin and carotene concentrations of 8.7 mg/100 g and 2.6 mg/100 g, respectively. Although kernels continue to increase in zeaxanthin when harvested past their normal harvest maturity stage, the texture of these 'over-mature' kernels is tough, making them less appealing for fresh consumption. Increase in zeaxanthin concentration and other orange carotenoids such as p-carotene also results in a decline in kernel hue angle of fresh sweet-corn from approximately 90 (yellow) to as low as 75 (orange-yellow). This enables high-zeaxanthin sweet-corn to be visually-distinguishable from standard yellow sweet-corn, which is predominantly pigmented by lutein.

Allosteric serine hydroxymethyltransferase from monkey liver: temperature induced conformational transitions

The homogeneous serine hydroxymethyltransferase from monkey liver was optimally activate at 60°C and the Arrhenius plot for the enzyme was nonlinear with a break at 15°C. The monkey liver enzyme showed high thermal stability of 62°C, as monitored by circular dichroism at 222 nm, absorbance at 280 nm and enzyme activity. The enzyme exhibited a sharp co-operative thermal transition in the range of 50°-70° (Tm= 65°C), as monitored by circular dichroism. L-Serine protected the enzyme against both thermal inactivation and thermal disruption of the secondary structure. The homotropic interactions of tetrahydrofolate with the enzyme was abolished at high temperatures (at 70°C, the Hill coefficient value was 1.0). A plot of h values vs. assay temperature of tetrahydrofolate saturation experiments, showed the presence of an intermediate conformer with an h value of 1.7 in the temperature range of 45°-60°C. Inclusion of a heat denaturation step in the scheme employed for the purification of serine hydroxymethyltransferase resulted in the loss of cooperative interactions with tetrahydrofolate. The temperature effects on the serine hydroxylmethyltransferase, reported for the first time, lead to a better understanding of the heat induced alterations in conformation and activity for this oligomeric protein.

Individuals on the Move : Body Condition Dependent Dispersal and Quasi-Local Competition in Metapopulations

Individual movement is very versatile and inevitable in ecology. In this thesis, I investigate two kinds of movement body condition dependent dispersal and small-range foraging movements resulting in quasi-local competition and their causes and consequences on the individual, population and metapopulation level. Body condition dependent dispersal is a widely evident but barely understood phenomenon. In nature, diverse relationships between body condition and dispersal are observed. I develop the first models that study the evolution of dispersal strategies that depend on individual body condition. In a patchy environment where patches differ in environmental conditions, individuals born in rich (e.g. nutritious) patches are on average stronger than their conspecifics that are born in poorer patches. Body condition (strength) determines competitive ability such that stronger individuals win competition with higher probability than weak individuals. Individuals compete for patches such that kin competition selects for dispersal. I determine the evolutionarily stable strategy (ESS) for different ecological scenarios. My models offer explanations for both dispersal of strong individuals and dispersal of weak individuals. Moreover, I find that within-family dispersal behaviour is not always reflected on the population level. This supports the fact that no consistent pattern is detected in data on body condition dependent dispersal. It also encourages the refining of empirical investigations. Quasi-local competition defines interactions between adjacent populations where one population negatively affects the growth of the other population. I model a metapopulation in a homogeneous environment where adults of different subpopulations compete for resources by spending part of their foraging time in the neighbouring patches, while their juveniles only feed on the resource in their natal patch. I show that spatial patterns (different population densities in the patches) are stable only if one age class depletes the resource very much but mainly the other age group depends on it.

Boundedness of weakly singular integral operators on domains

The monograph dissertation deals with kernel integral operators and their mapping properties on Euclidean domains. The associated kernels are weakly singular and examples of such are given by Green functions of certain elliptic partial differential equations. It is well known that mapping properties of the corresponding Green operators can be used to deduce a priori estimates for the solutions of these equations. In the dissertation, natural size- and cancellation conditions are quantified for kernels defined in domains. These kernels induce integral operators which are then composed with any partial differential operator of prescribed order, depending on the size of the kernel. The main object of study in this dissertation being the boundedness properties of such compositions, the main result is the characterization of their Lp-boundedness on suitably regular domains. In case the aforementioned kernels are defined in the whole Euclidean space, their partial derivatives of prescribed order turn out to be so called standard kernels that arise in connection with singular integral operators. The Lp-boundedness of singular integrals is characterized by the T1 theorem, which is originally due to David and Journé and was published in 1984 (Ann. of Math. 120). The main result in the dissertation can be interpreted as a T1 theorem for weakly singular integral operators. The dissertation deals also with special convolution type weakly singular integral operators that are defined on Euclidean spaces.

Aspects of atomic decompositions and Bergman projections

The concept of an atomic decomposition was introduced by Coifman and Rochberg (1980) for weighted Bergman spaces on the unit disk. By the Riemann mapping theorem, functions in every simply connected domain in the complex plane have an atomic decomposition. However, a decomposition resulting from a conformal mapping of the unit disk tends to be very implicit and often lacks a clear connection to the geometry of the domain that it has been mapped into. The lattice of points, where the atoms of the decomposition are evaluated, usually follows the geometry of the original domain, but after mapping the domain into another this connection is easily lost and the layout of points becomes seemingly random. In the first article we construct an atomic decomposition directly on a weighted Bergman space on a class of regulated, simply connected domains. The construction uses the geometric properties of the regulated domain, but does not explicitly involve any conformal Riemann map from the unit disk. It is known that the Bergman projection is not bounded on the space L-infinity of bounded measurable functions. Taskinen (2004) introduced the locally convex spaces LV-infinity consisting of measurable and HV-infinity of analytic functions on the unit disk with the latter being a closed subspace of the former. They have the property that the Bergman projection is continuous from LV-infinity onto HV-infinity and, in some sense, the space HV-infinity is the smallest possible substitute to the space H-infinity of analytic functions. In the second article we extend the above result to a smoothly bounded strictly pseudoconvex domain. Here the related reproducing kernels are usually not known explicitly, and thus the proof of continuity of the Bergman projection is based on generalised Forelli-Rudin estimates instead of integral representations. The minimality of the space LV-infinity is shown by using peaking functions first constructed by Bell (1981). Taskinen (2003) showed that on the unit disk the space HV-infinity admits an atomic decomposition. This result is generalised in the third article by constructing an atomic decomposition for the space HV-infinity on a smoothly bounded strictly pseudoconvex domain. In this case every function can be presented as a linear combination of atoms such that the coefficient sequence belongs to a suitable Köthe co-echelon space.

On the Geometry of Infinite-Dimensional Grassmannian Manifolds and Gauge Theory

This PhD Thesis is about certain infinite-dimensional Grassmannian manifolds that arise naturally in geometry, representation theory and mathematical physics. From the physics point of view one encounters these infinite-dimensional manifolds when trying to understand the second quantization of fermions. The many particle Hilbert space of the second quantized fermions is called the fermionic Fock space. A typical element of the fermionic Fock space can be thought to be a linear combination of the configurations m particles and n anti-particles . Geometrically the fermionic Fock space can be constructed as holomorphic sections of a certain (dual)determinant line bundle lying over the so called restricted Grassmannian manifold, which is a typical example of an infinite-dimensional Grassmannian manifold one encounters in QFT. The construction should be compared with its well-known finite-dimensional analogue, where one realizes an exterior power of a finite-dimensional vector space as the space of holomorphic sections of a determinant line bundle lying over a finite-dimensional Grassmannian manifold. The connection with infinite-dimensional representation theory stems from the fact that the restricted Grassmannian manifold is an infinite-dimensional homogeneous (Kähler) manifold, i.e. it is of the form G/H where G is a certain infinite-dimensional Lie group and H its subgroup. A central extension of G acts on the total space of the dual determinant line bundle and also on the space its holomorphic sections; thus G admits a (projective) representation on the fermionic Fock space. This construction also induces the so called basic representation for loop groups (of compact groups), which in turn are vitally important in string theory / conformal field theory. The Thesis consists of three chapters: the first chapter is an introduction to the backround material and the other two chapters are individually written research articles. The first article deals in a new way with the well-known question in Yang-Mills theory, when can one lift the action of the gauge transformation group on the space of connection one forms to the total space of the Fock bundle in a compatible way with the second quantized Dirac operator. In general there is an obstruction to this (called the Mickelsson-Faddeev anomaly) and various geometric interpretations for this anomaly, using such things as group extensions and bundle gerbes, have been given earlier. In this work we give a new geometric interpretation for the Faddeev-Mickelsson anomaly in terms of differentiable gerbes (certain sheaves of categories) and central extensions of Lie groupoids. The second research article deals with the question how to define a Dirac-like operator on the restricted Grassmannian manifold, which is an infinite-dimensional space and hence not in the landscape of standard Dirac operator theory. The construction relies heavily on infinite-dimensional representation theory and one of the most technically demanding challenges is to be able to introduce proper normal orderings for certain infinite sums of operators in such a way that all divergences will disappear and the infinite sum will make sense as a well-defined operator acting on a suitable Hilbert space of spinors. This research article was motivated by a more extensive ongoing project to construct twisted K-theory classes in Yang-Mills theory via a Dirac-like operator on the restricted Grassmannian manifold.

Topological stability through tame retractions

A smooth map is said to be stable if small perturbations of the map only differ from the original one by a smooth change of coordinates. Smoothly stable maps are generic among the proper maps between given source and target manifolds when the source and target dimensions belong to the so-called nice dimensions, but outside this range of dimensions, smooth maps cannot generally be approximated by stable maps. This leads to the definition of topologically stable maps, where the smooth coordinate changes are replaced with homeomorphisms. The topologically stable maps are generic among proper maps for any dimensions of source and target. The purpose of this thesis is to investigate methods for proving topological stability by constructing extremely tame (E-tame) retractions onto the map in question from one of its smoothly stable unfoldings. In particular, we investigate how to use E-tame retractions from stable unfoldings to find topologically ministable unfoldings for certain weighted homogeneous maps or germs. Our first results are concerned with the construction of E-tame retractions and their relation to topological stability. We study how to construct the E-tame retractions from partial or local information, and these results form our toolbox for the main constructions. In the next chapter we study the group of right-left equivalences leaving a given multigerm f invariant, and show that when the multigerm is finitely determined, the group has a maximal compact subgroup and that the corresponding quotient is contractible. This means, essentially, that the group can be replaced with a compact Lie group of symmetries without much loss of information. We also show how to split the group into a product whose components only depend on the monogerm components of f. In the final chapter we investigate representatives of the E- and Z-series of singularities, discuss their instability and use our tools to construct E-tame retractions for some of them. The construction is based on describing the geometry of the set of points where the map is not smoothly stable, discovering that by using induction and our constructional tools, we already know how to construct local E-tame retractions along the set. The local solutions can then be glued together using our knowledge about the symmetry group of the local germs. We also discuss how to generalize our method to the whole E- and Z- series.

Optical and Physical Properties of Atmospheric Aerosols over the Bay of Bengal during ICARB

Simultaneous and collocated measurements of total and hemispherical backscattering coefficients (σ and β, respectively) at three wavelengths, mass size distributions, and columnar spectral aerosol optical depth (AOD) were made onboard an extensive cruise experiment covering, for the first time, the entire Bay of Bengal (BoB) and northern Indian Ocean. The results are synthesized to understand the optical properties of aerosols in the marine atmospheric boundary layer and their dependence on the size distribution. The observations revealed distinct spatial and spectral variations of all the aerosol parameters over the BoB and the presence of strong latitudinal gradients. The size distributions varied spatially, with the majority of accumulation modes decreasing from north to south. The scattering coefficient decreased from very high values (resembling those reported for continental/urban locations) in the northern BoB to very low values seen over near-pristine environments in the southeastern BoB. The average mass scattering efficiency of BoB aerosols was found to be 2.66 ± 0.1 m2 g−1 at 550 nm. The spectral dependence of columnar AOD deviated significantly from that of the scattering coefficients in the northern BoB, implying vertical heterogeneity in the aerosol type in that region. However, a more homogeneous scenario was observed in the southern BoB. Simultaneous lidar and in situ measurements onboard an aircraft over the ocean revealed the presence of elevated aerosol layers of enhanced extinction at altitudes of 1 to 3 km with an offshore extent of a few hundred kilometers. Back-trajectory analyses showed these layers to be associated with advection from west Asia and western India. The large spatial variations and vertical heterogeneity in aerosol properties, revealed by the present study, need to be included in the regional radiative forcing over the Bay of Bengal.

Inactivation of Aspergillus flavus spores by curcumin-mediated photosensitization

Minimizing fungal infection is essential to the control of mycotoxin contamination of foods and feeds but many potential control methods are not without their own safety concerns for the consumers. Photodynamic inactivation is a novel light-based approach which offers a promising alternative to conventional methods for the control of mycotoxigenic fungi. This study describes the use of curcumin to inactivate spores of Aspergillus flavus, one of the major aflatoxin producing fungi in foods and feeds. Curcumin is a natural polyphenolic compound from the spice turmeric (Curcuma longa). In this study the plant has shown to be an effective photosensitiser when combined with visible light (420 nm). The experiment was conducted in in vitro and in vivo where A. flavus spores were treated with different photosensitiser concentration and light dose both in buffer solution and on maize kernels. Comparison of fungal load from treated and untreated samples was determined, and reductions of fungal spore counts of up to 3 log CFU ml−1 in suspension and 2 log CFU g−1 in maize kernels were obtained using optimal dye concentrations and light dose combinations. The results in this study indicate that curcumin-mediated photosensitization is a potentially effective method to decontaminate A. flavus spores in foods and feeds.

Middleware for Mobile Sensing Applications in Urban Environments

Sensor networks represent an attractive tool to observe the physical world. Networks of tiny sensors can be used to detect a fire in a forest, to monitor the level of pollution in a river, or to check on the structural integrity of a bridge. Application-specific deployments of static-sensor networks have been widely investigated. Commonly, these networks involve a centralized data-collection point and no sharing of data outside the organization that owns it. Although this approach can accommodate many application scenarios, it significantly deviates from the pervasive computing vision of ubiquitous sensing where user applications seamlessly access anytime, anywhere data produced by sensors embedded in the surroundings. With the ubiquity and ever-increasing capabilities of mobile devices, urban environments can help give substance to the ubiquitous sensing vision through Urbanets, spontaneously created urban networks. Urbanets consist of mobile multi-sensor devices, such as smart phones and vehicular systems, public sensor networks deployed by municipalities, and individual sensors incorporated in buildings, roads, or daily artifacts. My thesis is that "multi-sensor mobile devices can be successfully programmed to become the underpinning elements of an open, infrastructure-less, distributed sensing platform that can bring sensor data out of their traditional close-loop networks into everyday urban applications". Urbanets can support a variety of services ranging from emergency and surveillance to tourist guidance and entertainment. For instance, cars can be used to provide traffic information services to alert drivers to upcoming traffic jams, and phones to provide shopping recommender services to inform users of special offers at the mall. Urbanets cannot be programmed using traditional distributed computing models, which assume underlying networks with functionally homogeneous nodes, stable configurations, and known delays. Conversely, Urbanets have functionally heterogeneous nodes, volatile configurations, and unknown delays. Instead, solutions developed for sensor networks and mobile ad hoc networks can be leveraged to provide novel architectures that address Urbanet-specific requirements, while providing useful abstractions that hide the network complexity from the programmer. This dissertation presents two middleware architectures that can support mobile sensing applications in Urbanets. Contory offers a declarative programming model that views Urbanets as a distributed sensor database and exposes an SQL-like interface to developers. Context-aware Migratory Services provides a client-server paradigm, where services are capable of migrating to different nodes in the network in order to maintain a continuous and semantically correct interaction with clients. Compared to previous approaches to supporting mobile sensing urban applications, our architectures are entirely distributed and do not assume constant availability of Internet connectivity. In addition, they allow on-demand collection of sensor data with the accuracy and at the frequency required by every application. These architectures have been implemented in Java and tested on smart phones. They have proved successful in supporting several prototype applications and experimental results obtained in ad hoc networks of phones have demonstrated their feasibility with reasonable performance in terms of latency, memory, and energy consumption.

Problems and Algorithms for Sequence Segmentations

The analysis of sequential data is required in many diverse areas such as telecommunications, stock market analysis, and bioinformatics. A basic problem related to the analysis of sequential data is the sequence segmentation problem. A sequence segmentation is a partition of the sequence into a number of non-overlapping segments that cover all data points, such that each segment is as homogeneous as possible. This problem can be solved optimally using a standard dynamic programming algorithm. In the first part of the thesis, we present a new approximation algorithm for the sequence segmentation problem. This algorithm has smaller running time than the optimal dynamic programming algorithm, while it has bounded approximation ratio. The basic idea is to divide the input sequence into subsequences, solve the problem optimally in each subsequence, and then appropriately combine the solutions to the subproblems into one final solution. In the second part of the thesis, we study alternative segmentation models that are devised to better fit the data. More specifically, we focus on clustered segmentations and segmentations with rearrangements. While in the standard segmentation of a multidimensional sequence all dimensions share the same segment boundaries, in a clustered segmentation the multidimensional sequence is segmented in such a way that dimensions are allowed to form clusters. Each cluster of dimensions is then segmented separately. We formally define the problem of clustered segmentations and we experimentally show that segmenting sequences using this segmentation model, leads to solutions with smaller error for the same model cost. Segmentation with rearrangements is a novel variation to the segmentation problem: in addition to partitioning the sequence we also seek to apply a limited amount of reordering, so that the overall representation error is minimized. We formulate the problem of segmentation with rearrangements and we show that it is an NP-hard problem to solve or even to approximate. We devise effective algorithms for the proposed problem, combining ideas from dynamic programming and outlier detection algorithms in sequences. In the final part of the thesis, we discuss the problem of aggregating results of segmentation algorithms on the same set of data points. In this case, we are interested in producing a partitioning of the data that agrees as much as possible with the input partitions. We show that this problem can be solved optimally in polynomial time using dynamic programming. Furthermore, we show that not all data points are candidates for segment boundaries in the optimal solution.

Mining Sequential Data – in Search of Segmental Structures

Segmentation is a data mining technique yielding simplified representations of sequences of ordered points. A sequence is divided into some number of homogeneous blocks, and all points within a segment are described by a single value. The focus in this thesis is on piecewise-constant segments, where the most likely description for each segment and the most likely segmentation into some number of blocks can be computed efficiently. Representing sequences as segmentations is useful in, e.g., storage and indexing tasks in sequence databases, and segmentation can be used as a tool in learning about the structure of a given sequence. The discussion in this thesis begins with basic questions related to segmentation analysis, such as choosing the number of segments, and evaluating the obtained segmentations. Standard model selection techniques are shown to perform well for the sequence segmentation task. Segmentation evaluation is proposed with respect to a known segmentation structure. Applying segmentation on certain features of a sequence is shown to yield segmentations that are significantly close to the known underlying structure. Two extensions to the basic segmentation framework are introduced: unimodal segmentation and basis segmentation. The former is concerned with segmentations where the segment descriptions first increase and then decrease, and the latter with the interplay between different dimensions and segments in the sequence. These problems are formally defined and algorithms for solving them are provided and analyzed. Practical applications for segmentation techniques include time series and data stream analysis, text analysis, and biological sequence analysis. In this thesis segmentation applications are demonstrated in analyzing genomic sequences.