Crystallization kinetics of narrow molecular weight distribution metallocene short-chain-branched polyethylene

Isothermal and non-isothermal crystallization kinetics of three metallocene-catalysed short-chain-branched polyethylene (SCBPE) fractions with different degree of branching were investigated by using differential scanning calorimetry (DSC). Narrow molecular weight fractions (M-w = 20,000 and M-w/M-n < 1.15) are used and the degree of branching (CH3 per 1000C) are 1.6, 10.4, 40 respectively. The regime I - II transition temperature are 119.8C, 115.9 degreesC, 113.3 degreesC with the decreasing of degree of branching. Increasing the branch content decreases the rate of secondary nucleation, i,relative to the rate of surface spreading and so increases the range of supercooling over which regime I exists. The rate of bulk crystallization for both isothermal and non-isothermal crystallization decreases with the increasing of degree of branching. Both Ozawa Equation and Kissinger Equation are invalid for non-isothermal crystallization kinetics of SCBPE fractions,that means the effects of the branched chain on crystallization process are more complex than expected.

Existence, recurrence and equilibrium properties of Markov branching processes with instantaneous immigration

Attention has recently focussed on stochastic population processes that can undergo total annihilation followed by immigration into state j at rate αj. The investigation of such models, called Markov branching processes with instantaneous immigration (MBPII), involves the study of existence and recurrence properties. However, results developed to date are generally opaque, and so the primary motivation of this paper is to construct conditions that are far easier to apply in practice. These turn out to be identical to the conditions for positive recurrence, which are very easy to check. We obtain, as a consequence, the surprising result that any MBPII that exists is ergodic, and so must possess an equilibrium distribution. These results are then extended to more general MBPII, and we show how to construct the associated equilibrium distributions.

Generalized Markov branching processes

A generalized Markov Brnching Process (GMBP) is a Markov branching model where the infinitesimal branching rates are modified with an interaction index. It is proved that there always exists only one GMBP. An associated differential-integral equation is derived. The extinction probalility and the mean and conditional mean extinction times are obtained. Ergodicity and stability of GMBP with resurrection are also considered. Easy checking criteria are established for ordinary and strong ergodicty. The equilibrium distribution is given in an elegant closed form. The probability meaning of our results is clear and thus explained.

Ergodicity and stability of generalised Markov branching processes with resurrection

This paper concentrates on investigating ergodicity and stability for generalised Markov branching processes with resurrection. Easy checking criteria including several clear-cut corollaries are established for ordinary and strong ergodicity of such processes. The equilibrium distribution is given in an elegant closed form for the ergodic case. The probabilistic interpretation of the results is clear and thus explained.

Equilibrium polymerization of cyclic carbonate oligomers. III. Chain branching and the gel transition

Ring-opening polymerization of cyclic polycarbonate oligomers, where monofunctional active sites act on difunctional monomers to produce an equilibrium distribution of rings and chains, leads to a "living polymer." Monte Carlo simulations [two-dimensional (2D) and three-dimensional (3D)] of the effects of single [J. Chem. Phys. 115, 3895 (2001)] and multiple active sites [J. Chem. Phys. 116, 7724 (2002)] are extended here to trifunctional active sites that lead to branching. Low concentrations of trifunctional particles c(3) reduce the degree of polymerization significantly in 2D, and higher concentrations (up to 32%) lead to further large changes in the phase diagram. Gel formation is observed at high total density and sizable c(3) as a continuous transition similar to percolation. Polymer and gel are much more stable in 3D than in 2D, and both the total density and the value of c(3) required to produce high molecular weight aggregates are reduced significantly. The degree of polymerization in high-density 3D systems is increased by the addition of trifunctional monomers and reduced slightly at low densities and low c(3). The presence of branching makes equilibrium states more sensitive (in 2D and 3D) to changes in temperature T. The stabilities of polymer and gel are enhanced by increasing T, and-for sufficiently high values of c(3)-there is a reversible polymer-gel transformation at a density-dependent floor temperature. (C) 2002 American Institute of Physics.

Branching ratios of x-ray photons from dielectronic recombination processes in H-like titanium ions

In dielectronic recombination of hydrogenlike ions an intermediate doubly excited heliumlike ion is formed. Since the K shell is empty, both excited electrons can decay sequentially to the ground state. In this paper we analyze the x-ray radiation emitted from doubly and singly excited heliumlike titanium ions produced inside the Tokyo electron beam ion trap. Theoretical population densities of the singly excited states after the first transition and the transition probabilities of these states into the ground state were also calculated. This allowed theoretical branching ratios to be determined for each manifold. These branching ratios are compared to the experimentally obtained x-ray distribution by fitting across the relevant peak using a convolution of the theoretically obtained resonance strengths and energies. By taking into account 2E1 transitions which are not observed in the experiment, the measured and calculated ratios agree well. This method provides a valuable insight into the transition dynamics of excited highly charged ions.

Optimization models for a short sea fuel oil distribution problem

O transporte marítimo e o principal meio de transporte de mercadorias em todo o mundo. Combustíveis e produtos petrolíferos representam grande parte das mercadorias transportadas por via marítima. Sendo Cabo Verde um arquipelago o transporte por mar desempenha um papel de grande relevância na economia do país. Consideramos o problema da distribuicao de combustíveis em Cabo Verde, onde uma companhia e responsavel por coordenar a distribuicao de produtos petrolíferos com a gestão dos respetivos níveis armazenados em cada porto, de modo a satisfazer a procura dos varios produtos. O objetivo consiste em determinar políticas de distribuicão de combustíveis que minimizam o custo total de distribuiçao (transporte e operacões) enquanto os n íveis de armazenamento sao mantidos nos n íveis desejados. Por conveniencia, de acordo com o planeamento temporal, o prob¬lema e divido em dois sub-problemas interligados. Um de curto prazo e outro de medio prazo. Para o problema de curto prazo sao discutidos modelos matemáticos de programacao inteira mista, que consideram simultaneamente uma medicao temporal cont ínua e uma discreta de modo a modelar multiplas janelas temporais e taxas de consumo que variam diariamente. Os modelos sao fortalecidos com a inclusão de desigualdades validas. O problema e então resolvido usando um "software" comercial. Para o problema de medio prazo sao inicialmente discutidos e comparados varios modelos de programacao inteira mista para um horizonte temporal curto assumindo agora uma taxa de consumo constante, e sao introduzidas novas desigualdades validas. Com base no modelo escolhido sao compara¬das estrategias heurísticas que combinam três heur ísticas bem conhecidas: "Rolling Horizon", "Feasibility Pump" e "Local Branching", de modo a gerar boas soluçoes admissíveis para planeamentos com horizontes temporais de varios meses. Finalmente, de modo a lidar com situaçoes imprevistas, mas impor¬tantes no transporte marítimo, como as mas condicões meteorológicas e congestionamento dos portos, apresentamos um modelo estocastico para um problema de curto prazo, onde os tempos de viagens e os tempos de espera nos portos sao aleatórios. O problema e formulado como um modelo em duas etapas, onde na primeira etapa sao tomadas as decisões relativas as rotas do navio e quantidades a carregar e descarregar e na segunda etapa (designada por sub-problema) sao consideradas as decisoes (com recurso) relativas ao escalonamento das operacões. O problema e resolvido por um metodo de decomposto que usa um algoritmo eficiente para separar as desigualdades violadas no sub-problema.

Evolutionary branching in deme-structured populations.

Adaptive dynamics shows that a continuous trait under frequency dependent selection may first converge to a singular point followed by spontaneous transition from a unimodal trait distribution into a bimodal one, which is called "evolutionary branching". Here, we study evolutionary branching in a deme-structured population by constructing a quantitative genetic model for the trait variance dynamics, which allows us to obtain an analytic condition for evolutionary branching. This is first shown to agree with previous conditions for branching expressed in terms of relatedness between interacting individuals within demes and obtained from mutant-resident systems. We then show this branching condition can be markedly simplified when the evolving trait affect fecundity and/or survival, as opposed to affecting population structure, which would occur in the case of the evolution of dispersal. As an application of our model, we evaluate the threshold migration rate below which evolutionary branching cannot occur in a pairwise interaction game. This agrees very well with the individual-based simulation results.

Méthodes de génération et de validation de champs de déformation pour la recombinaison de distribution de dose à l’aide d’images 4DCT dans le cadre d’une planification de traitement de cancers pulmonaires

Des efforts de recherche considérables ont été déployés afin d'améliorer les résultats de traitement de cancers pulmonaires. L'étude de la déformation de l'anatomie du patient causée par la ventilation pulmonaire est au coeur du processus de planification de traitement radio-oncologique. À l'aide d'images de tomodensitométrie quadridimensionnelles (4DCT), une simulation dosimétrique peut être calculée sur les 10 ensembles d'images du 4DCT. Une méthode doit être employée afin de recombiner la dose de radiation calculée sur les 10 anatomies représentant une phase du cycle respiratoire. L'utilisation de recalage déformable d'images (DIR), une méthode de traitement d'images numériques, génère neuf champs vectoriels de déformation permettant de rapporter neuf ensembles d'images sur un ensemble de référence correspondant habituellement à la phase d'expiration profonde du cycle respiratoire. L'objectif de ce projet est d'établir une méthode de génération de champs de déformation à l'aide de la DIR conjointement à une méthode de validation de leur précision. Pour y parvenir, une méthode de segmentation automatique basée sur la déformation surfacique de surface à été créée. Cet algorithme permet d'obtenir un champ de déformation surfacique qui décrit le mouvement de l'enveloppe pulmonaire. Une interpolation volumétrique est ensuite appliquée dans le volume pulmonaire afin d'approximer la déformation interne des poumons. Finalement, une représentation en graphe de la vascularisation interne du poumon a été développée afin de permettre la validation du champ de déformation. Chez 15 patients, une erreur de recouvrement volumique de 7.6 ± 2.5[%] / 6.8 ± 2.1[%] et une différence relative des volumes de 6.8 ± 2.4 [%] / 5.9 ± 1.9 [%] ont été calculées pour le poumon gauche et droit respectivement. Une distance symétrique moyenne 0.8 ± 0.2 [mm] / 0.8 ± 0.2 [mm], une distance symétrique moyenne quadratique de 1.2 ± 0.2 [mm] / 1.3 ± 0.3 [mm] et une distance symétrique maximale 7.7 ± 2.4 [mm] / 10.2 ± 5.2 [mm] ont aussi été calculées pour le poumon gauche et droit respectivement. Finalement, 320 ± 51 bifurcations ont été détectées dans le poumons droit d'un patient, soit 92 ± 10 et 228 ± 45 bifurcations dans la portion supérieure et inférieure respectivement. Nous avons été en mesure d'obtenir des champs de déformation nécessaires pour la recombinaison de dose lors de la planification de traitement radio-oncologique à l'aide de la méthode de déformation hiérarchique des surfaces. Nous avons été en mesure de détecter les bifurcations de la vascularisation pour la validation de ces champs de déformation.

Distribution of small Rho GTPases in the developing rat submandibular gland

During the rat submandibular gland (SMG) development, organogenesis and cytodifferentiation depend on the actin cytoskeleton, which is regulated by small Rho GTPases. These proteins link cell surface receptors to pathways that regulate cell motility, polarity, gene expression, vesicular trafficking, proliferation and apoptosis. The aim of this study was to evaluate, by immunohistochemistry, the distribution pattern of RhoA, RhoB, RhoC, Rac1 and Cdc42 during cytodifferentiation of the rat SMG and in male adults. All GTPases were found in epithelial and mesenchymal tissues throughout gland development. Rac1 appeared to be important for parenchyma expansion at the beginning of cytodifferentiation, while RhoC, Cdc42 and the inactive phosphorylated form of Rac1 seemed associated with lumen formation and cell polarization in terminal tubules. RhoA and RhoB labeling was evident throughout development. All GTPases were differentially expressed in the adult gland, suggesting that they play specific roles during differentiation and function of the rat SMG.

A Constructive Heuristic Algorithm for Distribution System Planning

A constructive heuristic algorithm (CHA) to solve distribution system planning (DSP) problem is presented. The DSP is a very complex mixed binary nonlinear programming problem. A CHA is aimed at obtaining an excellent quality solution for the DSP problem. However, a local improvement phase and a branching technique were implemented in the CHA to improve its solution. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution system. This sensitivity index is obtained by solving the DSP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. Results of two tests systems and one real distribution system are presented in this paper in order to show the ability of the proposed algorithm.

Distribution network planning using a constructive heuristic algorithm

An optimization technique to solve distribution network planning (DNP) problem is presented. This is a very complex mixed binary nonlinear programming problem. A constructive heuristic algorithm (CHA) aimed at obtaining an excellent quality solution for this problem is presented. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution network. This sensitivity index is obtained solving the DNP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. A local improvement phase and a branching technique were implemented in the CHA. Results of two tests using a distribution network are presented in the paper in order to show the ability of the proposed algorithm. ©2009 IEEE.

Measurement of the Bs0→μ+μ- branching fraction and search for B0→μ+μ- with the CMS experiment

Results are presented from a search for the rare decays Bs0→μ+μ- and B0→μ+μ - in pp collisions at √s=7 and 8 TeV, with data samples corresponding to integrated luminosities of 5 and 20 fb-1, respectively, collected by the CMS experiment at the LHC. An unbinned maximum-likelihood fit to the dimuon invariant mass distribution gives a branching fraction B(Bs0→μ+μ-)=(3.0-0.9+1.0) ×10-9, where the uncertainty includes both statistical and systematic contributions. An excess of Bs0→μ+μ- events with respect to background is observed with a significance of 4.3 standard deviations. For the decay B0→μ+μ- an upper limit of B(B0→μ+μ-)<1.1×10 -9 at the 95% confidence level is determined. Both results are in agreement with the expectations from the standard model. © 2013 CERN. Published by the American Physical Society under the terms of the.

Searches for new physics using the t(t)over-bar invariant mass distribution in pp collisions at root s=8 TeV

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Mutually catalytic branching at infinite rate

The purpose of this doctoral thesis is to prove existence for a mutually catalytic random walk with infinite branching rate on countably many sites. The process is defined as a weak limit of an approximating family of processes. An approximating process is constructed by adding jumps to a deterministic migration on an equidistant time grid. As law of jumps we need to choose the invariant probability measure of the mutually catalytic random walk with a finite branching rate in the recurrent regime. This model was introduced by Dawson and Perkins (1998) and this thesis relies heavily on their work. Due to the properties of this invariant distribution, which is in fact the exit distribution of planar Brownian motion from the first quadrant, it is possible to establish a martingale problem for the weak limit of any convergent sequence of approximating processes. We can prove a duality relation for the solution to the mentioned martingale problem, which goes back to Mytnik (1996) in the case of finite rate branching, and this duality gives rise to weak uniqueness for the solution to the martingale problem. Using standard arguments we can show that this solution is in fact a Feller process and it has the strong Markov property. For the case of only one site we prove that the model we have constructed is the limit of finite rate mutually catalytic branching processes as the branching rate approaches infinity. Therefore, it seems naturalto refer to the above model as an infinite rate branching process. However, a result for convergence on infinitely many sites remains open.