Microencapsulation of casein hydrolysate by complex coacervation with SPI/pectin

The aim of this work was to encapsulate casein hydrolysate by complex coacervation with soybean protein isolate (SPI)/pectin. Three treatments were studied with wall material to core ratio of 1:1, 1:2 and 1:3. The samples were evaluated for morphological characteristics, moisture, hygroscopicity, solubility, hydrophobicity, surface tension, encapsulation efficiency and bitter taste with a trained sensory panel using a paired comparison test. The samples were very stable in cold water. The hydrophobicity decreased inversely with the hydrolysate content in the microcapsule. Encapsulated samples had lower hygroscopicity values than free hydrolysate. The encapsulation efficiency varied from 91.62% to 78.8%. Encapsulated samples had similar surface tension, higher values than free hydrolysate. The results of the sensory panel test considering the encapsulated samples less bitter (P < 0.05) than the free hydroly-state, showed that complex coacervation with SPI/pectin as wall material was an efficient method for microencapsulation and attenuation of the bitter taste of the hydrolysate. (C) 2009 Elsevier Ltd. All rights reserved.

GALAXY EVOLUTION IN A COMPLEX ENVIRONMENT: A MULTI-WAVELENGTH STUDY OF HCG 7

The environment where galaxies are found heavily influences their evolution. Close groupings, like the ones in the cores of galaxy clusters or compact groups, evolve in ways far more dramatic than their isolated counterparts. We have conducted a multi-wavelength study of Hickson Compact Group 7 (HCG 7), consisting of four giant galaxies: three spirals and one lenticular. We use Hubble Space Telescope (HST) imaging to identify and characterize the young and old star cluster populations. We find young massive clusters (YMCs) mostly in the three spirals, while the lenticular features a large, unimodal population of globular clusters (GCs) but no detectable clusters with ages less than a few Gyr. The spatial and approximate age distributions of the similar to 300 YMCs and similar to 150 GCs thus hint at a regular star formation history in the group over a Hubble time. While at first glance the HST data show the galaxies as undisturbed, our deep ground-based, wide-field imaging that extends the HST coverage reveals faint signatures of stellar material in the intragroup medium (IGM). We do not, however, detect the IGM in H I or Chandra X-ray observations, signatures that would be expected to arise from major mergers. Despite this fact, we find that the H I gas content of the individual galaxies and the group as a whole are a third of the expected abundance. The appearance of quiescence is challenged by spectroscopy that reveals an intense ionization continuum in one galaxy nucleus, and post-burst characteristics in another. Our spectroscopic survey of dwarf galaxy members yields a single dwarf elliptical galaxy in an apparent stellar tidal feature. Based on all this information, we suggest an evolutionary scenario for HCG 7, whereby the galaxies convert most of their available gas into stars without the influence of major mergers and ultimately result in a dry merger. As the conditions governing compact groups are reminiscent of galaxies at intermediate redshift, we propose that HCGs are appropriate for studying galaxy evolution at z similar to 1-2.

Dynamic portrait of the planetary 2/1 mean-motion resonance - II. Systems with a more massive inner planet

This paper presents the second part in our study of the global structure of the planar phase space of the planetary three-body problem, when both planets lie in the vicinity of a 2/1 mean-motion resonance. While Paper I was devoted to cases where the outer planet is the more massive body, the present work is devoted to the cases where the more massive body is the inner planet. As before, outside the well-known Apsidal Corotation Resonances (ACR), the phase space shows a complex picture marked by the presence of several distinct regimes of resonant and non-resonant motion, crossed by families of periodic orbits and separated by chaotic zones. When the chosen values of the integrals of motion lead to symmetric ACR, the global dynamics are generally similar to the structure presented in Paper I. However, for asymmetric ACR the resonant phase space is strikingly different and shows a galore of distinct dynamical states. This structure is shown with the help of dynamical maps constructed on two different representative planes, one centred on the unstable symmetric ACR and the other on the stable asymmetric equilibrium solution. Although the study described in the work may be applied to any mass ratio, we present a detailed analysis for mass values similar to the Jupiter-Saturn case. Results give a global view of the different dynamical states available to resonant planets with these characteristics. Some of these dynamical paths could have marked the evolution of the giant planets of our Solar system, assuming they suffered a temporary capture in the 2/1 resonance during the latest stages of the formation of our Solar system.

Organization of ventral tegmental area projections to the ventral tegmental area-nigral complex in the rat

The ventral tegmental area (VTA) is a nodal link in reward circuitry. Based on its striatal output, it has been subdivided in a caudomedial part which targets the ventromedial striatum, and a lateral part which targets the ventrolateral striatum [Ikemoto S (2007) Dopamine reward circuitry: two projection systems from the ventral midbrain to the nucleus accumbens-olfactory tubercle complex. Brain Res Rev 56:27-78]. Whether these two VTA parts are interconnected and to what extent the VTA innervates the substantia nigra compacta (SNc) and retrorubral nucleus (RR) are critical issues for understanding information processing in the basal ganglia. Here, VTA projections to the VTA-nigral complex were examined in rats, using Phaseolus vulgaris leucoagglutinin (PHA-L) as anterograde tracer. The results show that the dorsolateral VTA projects to itself, as well as to the dorsal tier of the SNc and RR, largely avoiding the caudomedial VTA. The ventrolateral VTA innervates mainly the interfascicular nucleus. The components of the caudomedial VTA (the interfascicular, paranigral and caudal linear nuclei) are connected with each other. In addition, the caudomedial VTA (especially the paranigral and caudal linear nuclei) innervates the lateral VTA, and, to a lesser degree, the SNc and RR. The caudal pole of the VTA sends robust, bilateral projections to virtually all the VTA-nigral complex, which terminate in the dorsal and ventral tiers. Modest inputs from the medial supramammillary nucleus to ventromedial parts of the VTA-nigral complex were also identified. In double-immunostained sections, PHA-L-labeled varicosities were sometimes found apposed to tyrosine hydroxylase-positive neurons in the ventral mesencephalon. Overall, the results underscore that VTA projections to the VTA-nigral complex are substantial and topically organized. In general, these projections, like the spiralated striato-nigro-striatal loops, display a medial-to-lateral organization. This anatomical arrangement conceivably permits the ventromedial striatum to influence the activity of the lateral striatum. The caudal pole of the VTA appears to be a critical site for a global recruitment of the mesotelencephalic system. (C) 2008 IBRO. Published by Elsevier Ltd. All rights reserved.

Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.

Gevrey solvability near the characteristic set for a class of planar complex vector fields of infinite type

We study the Gevrey solvability of a class of complex vector fields, defined on Omega(epsilon) = (-epsilon, epsilon) x S(1), given by L = partial derivative/partial derivative t + (a(x) + ib(x))partial derivative/partial derivative x, b not equivalent to 0, near the characteristic set Sigma = {0} x S(1). We show that the interplay between the order of vanishing of the functions a and b at x = 0 plays a role in the Gevrey solvability. (C) 2008 Elsevier Inc. All rights reserved.

Scalable model-based configuration management of security services in complex enterprise networks

Security administrators face the challenge of designing, deploying and maintaining a variety of configuration files related to security systems, especially in large-scale networks. These files have heterogeneous syntaxes and follow differing semantic concepts. Nevertheless, they are interdependent due to security services having to cooperate and their configuration to be consistent with each other, so that global security policies are completely and correctly enforced. To tackle this problem, our approach supports a comfortable definition of an abstract high-level security policy and provides an automated derivation of the desired configuration files. It is an extension of policy-based management and policy hierarchies, combining model-based management (MBM) with system modularization. MBM employs an object-oriented model of the managed system to obtain the details needed for automated policy refinement. The modularization into abstract subsystems (ASs) segment the system-and the model-into units which more closely encapsulate related system components and provide focused abstract views. As a result, scalability is achieved and even comprehensive IT systems can be modelled in a unified manner. The associated tool MoBaSeC (Model-Based-Service-Configuration) supports interactive graphical modelling, automated model analysis and policy refinement with the derivation of configuration files. We describe the MBM and AS approaches, outline the tool functions and exemplify their applications and results obtained. Copyright (C) 2010 John Wiley & Sons, Ltd.

Formal validation of automated policy refinement in the management of network security systems

Policy hierarchies and automated policy refinement are powerful approaches to simplify administration of security services in complex network environments. A crucial issue for the practical use of these approaches is to ensure the validity of the policy hierarchy, i.e. since the policy sets for the lower levels are automatically derived from the abstract policies (defined by the modeller), we must be sure that the derived policies uphold the high-level ones. This paper builds upon previous work on Model-based Management, particularly on the Diagram of Abstract Subsystems approach, and goes further to propose a formal validation approach for the policy hierarchies yielded by the automated policy refinement process. We establish general validation conditions for a multi-layered policy model, i.e. necessary and sufficient conditions that a policy hierarchy must satisfy so that the lower-level policy sets are valid refinements of the higher-level policies according to the criteria of consistency and completeness. Relying upon the validation conditions and upon axioms about the model representativeness, two theorems are proved to ensure compliance between the resulting system behaviour and the abstract policies that are modelled.

Thermodynamic Stabillity of Hydrogen-Bonded Systems in Polar and Nonpolar Environments

The thermodynamic properties of a selected set of benchmark hydrogen-bonded systems (acetic acid dimer and the complexes of acetic acid with acetamide and methanol) was studied with the goal of obtaining detailed information on solvent effects on the hydrogen-bonded interactions using water, chloroform, and n-heptane as representatives for a wide range in the dielectric constant. Solvent effects were investigated using both explicit and implicit solvation models. For the explicit description of the solvent, molecular dynamics and Monte Carlo simulations in the isothermal isobaric (NpT) ensemble combined with the free energy perturbation technique were performed to determine solvation free energies. Within the implicit solvation approach, the polarizable continuum model and the conductor-like screening model were applied. Combination of gas phase results with the results obtained from the different solvation models through an appropriate thermodynamic cycle allows estimation of complexation free energies, enthalpies, and the respective entropic contributions in solution. Owing to the strong solvation effects of water the cyclic acetic acid dimer is not stable in aqueous solution. In less polar solvents the double hydrogen bond structure of the acetic acid dimer remains stable. This finding is in agreement with previous theoretical and experimental results. A similar trend as for the acetic acid dimer is also observed for the acetamide complex. The methanol complex was found to be thermodynamically unstable in gas phase as well as in any of the three solvents. (C) 2010 Wiley Periodicals, Inc. J Comput Chem 31: 2046-2055, 2010

How complex a dynamical network can be?

Positive Lyapunov exponents measure the asymptotic exponential divergence of nearby trajectories of a dynamical system. Not only they quantify how chaotic a dynamical system is, but since their sum is an upper bound for the rate of information production, they also provide a convenient way to quantify the complexity of a dynamical network. We conjecture based on numerical evidences that for a large class of dynamical networks composed by equal nodes, the sum of the positive Lyapunov exponents is bounded by the sum of all the positive Lyapunov exponents of both the synchronization manifold and its transversal directions, the last quantity being in principle easier to compute than the latter. As applications of our conjecture we: (i) show that a dynamical network composed of equal nodes and whose nodes are fully linearly connected produces more information than similar networks but whose nodes are connected with any other possible connecting topology; (ii) show how one can calculate upper bounds for the information production of realistic networks whose nodes have parameter mismatches, randomly chosen: (iii) discuss how to predict the behavior of a large dynamical network by knowing the information provided by a system composed of only two coupled nodes. (C) 2011 Elsevier B.V. All rights reserved.

A complex network approach to text summarization

Automatic summarization of texts is now crucial for several information retrieval tasks owing to the huge amount of information available in digital media, which has increased the demand for simple, language-independent extractive summarization strategies. In this paper, we employ concepts and metrics of complex networks to select sentences for an extractive summary. The graph or network representing one piece of text consists of nodes corresponding to sentences, while edges connect sentences that share common meaningful nouns. Because various metrics could be used, we developed a set of 14 summarizers, generically referred to as CN-Summ, employing network concepts such as node degree, length of shortest paths, d-rings and k-cores. An additional summarizer was created which selects the highest ranked sentences in the 14 systems, as in a voting system. When applied to a corpus of Brazilian Portuguese texts, some CN-Summ versions performed better than summarizers that do not employ deep linguistic knowledge, with results comparable to state-of-the-art summarizers based on expensive linguistic resources. The use of complex networks to represent texts appears therefore as suitable for automatic summarization, consistent with the belief that the metrics of such networks may capture important text features. (c) 2008 Elsevier Inc. All rights reserved.

On the effects of geographical constraints on task execution in complex

In the present work, the effects of spatial constraints on the efficiency of task execution in systems underlain by geographical complex networks are investigated, where the probability of connection decreases with the distance between the nodes. The investigation considers several configurations of the parameters defining the network connectivity, and the Barabasi-Albert network model is also considered for comparisons. The results show that the effect of connectivity is significant only for shorter tasks, the locality of connection simplied by the spatial constraints reduces efficiency, and the addition of edges can improve the efficiency of the execution, although with increasing locality of the connections the improvement is small.

Using metrics from complex networks to evaluate machine translation

Establishing metrics to assess machine translation (MT) systems automatically is now crucial owing to the widespread use of MT over the web. In this study we show that such evaluation can be done by modeling text as complex networks. Specifically, we extend our previous work by employing additional metrics of complex networks, whose results were used as input for machine learning methods and allowed MT texts of distinct qualities to be distinguished. Also shown is that the node-to-node mapping between source and target texts (English-Portuguese and Spanish-Portuguese pairs) can be improved by adding further hierarchical levels for the metrics out-degree, in-degree, hierarchical common degree, cluster coefficient, inter-ring degree, intra-ring degree and convergence ratio. The results presented here amount to a proof-of-principle that the possible capturing of a wider context with the hierarchical levels may be combined with machine learning methods to yield an approach for assessing the quality of MT systems. (C) 2010 Elsevier B.V. All rights reserved.

A pattern recognition approach to complex networks

Complex networks exist in many areas of science such as biology, neuroscience, engineering, and sociology. The growing development of this area has led to the introduction of several topological and dynamical measurements, which describe and quantify the structure of networks. Such characterization is essential not only for the modeling of real systems but also for the study of dynamic processes that may take place in them. However, it is not easy to use several measurements for the analysis of complex networks, due to the correlation between them and the difficulty of their visualization. To overcome these limitations, we propose an effective and comprehensive approach for the analysis of complex networks, which allows the visualization of several measurements in a few projections that contain the largest data variance and the classification of networks into three levels of detail, vertices, communities, and the global topology. We also demonstrate the efficiency and the universality of the proposed methods in a series of real-world networks in the three levels.

Novel manganese (III) porphyrin containing peripheral [RuCl(dppb)(X-bipy)](+) cations [dppb=1,4-bis(diphenylphosphino) butane and X = -CH3, -OMe, -Cl]. X-ray structure of the cis-[RuCl(dppb)(bipy)(4-Mepy)]PF6 complex

New tetraruthenated manganese (III) porphyrins were synthesized and characterized (P-31 NMR, cyclic voltammetry, UV-Vis). This new system presents four units of cationic ``[RuCl(dppb)(X-bipy)](+)``. The electrochemical and catalytic properties of the central manganese (III) show dependence on the characteristics of the peripheral ruthenium complexes as evidenced by the Mn-(III)/Mn-(II) reduction potential. The catalytic oxidation reactions of olefins, cyclohexene and cyclohexane, were carried out in the presence of tetrapyridyl manganese (III) porphyrins containing cationic ruthenium complex and using iodosylbenzene as oxygen donor. The performance of these new tetraruthenated porphyrins systems were evaluated and compared with the manganese porphyrin. (C) 2007 Elsevier Ltd. All rights reserved.