Propagação de Camellia sinensis: efeito do genótipo, estaca, substrato, recipiente e ácido indolbutírico

Tem sido relatado que as estacas de Camellia sinensis possuem baixa capacidade de emitir raízes, motivando assim a realização de estudos básicos para otimização do processo de propagação por estacas. Assim sendo, o presente trabalho objetivou quantificar o potencial rizogênico de diferentes genótipos e o efeito da posição da estaca no ramo e incisão na base, do substrato, tamanho do recipiente e ácido indolbutírico no enraizamento de estacas semi-lenhosas dessa espécie. Para tal, foram coletados ramos dos genótipos IAC 259, F15 e Comum, em Pariquera-Açu-SP, no inverno de 2010. em seguida, preparadas as estacas, contendo uma gema e uma folha, foram mantidas em viveiro com 70% de sombreamento. Estacas da posição basal e mediana dos ramos são as mais adequadas para estaquia devido a menor mortalidade e maior enraizamento. A injúria na base da estaca não afeta a mortalidade e o enraizamento das estacas, porém induz à formação de calo. Também não houve diferenças na mortalidade e no enraizamento das estacas quando as mesmas foram mantidas em recipiente de 50, 90 e 120 cm³. Comparado com vermiculita, areia e casca de arroz carbonizada, o solo foi o melhor substrato para estaquia, que na presença do ferimento, juntamente com o tratamento das estacas com 10 g L-1 de AIB promoveu a maior porcentagem de enraizamento. Todavia, ainda nessa condição a mortalidade média das estacas foi de 42%. O potencial de enraizamento do genótipo Comum foi superior ao do IAC 259 e F15.

Interrupted searches in the BBMCSFilter context for MINLP problems

The BBMCSFilter method was developed to solve mixed integer nonlinear programming problems. This kind of problems have integer and continuous variables and they appear very frequently in process engineering problems. The objective of this work is to analyze the performance of the method when the coordinate searches are interrupted in the context of the multistart strategy. From the numerical experiments, we observed a reduction on the number of function evaluations and on the CPU time.

Mathematical Programming Models for Influence Maximization on Social Networks

In this dissertation, we apply mathematical programming techniques (i.e., integer programming and polyhedral combinatorics) to develop exact approaches for influence maximization on social networks. We study four combinatorial optimization problems that deal with maximizing influence at minimum cost over a social network. To our knowl- edge, all previous work to date involving influence maximization problems has focused on heuristics and approximation. We start with the following viral marketing problem that has attracted a significant amount of interest from the computer science literature. Given a social network, find a target set of customers to seed with a product. Then, a cascade will be caused by these initial adopters and other people start to adopt this product due to the influence they re- ceive from earlier adopters. The idea is to find the minimum cost that results in the entire network adopting the product. We first study a problem called the Weighted Target Set Selection (WTSS) Prob- lem. In the WTSS problem, the diffusion can take place over as many time periods as needed and a free product is given out to the individuals in the target set. Restricting the number of time periods that the diffusion takes place over to be one, we obtain a problem called the Positive Influence Dominating Set (PIDS) problem. Next, incorporating partial incentives, we consider a problem called the Least Cost Influence Problem (LCIP). The fourth problem studied is the One Time Period Least Cost Influence Problem (1TPLCIP) which is identical to the LCIP except that we restrict the number of time periods that the diffusion takes place over to be one. We apply a common research paradigm to each of these four problems. First, we work on special graphs: trees and cycles. Based on the insights we obtain from special graphs, we develop efficient methods for general graphs. On trees, first, we propose a polynomial time algorithm. More importantly, we present a tight and compact extended formulation. We also project the extended formulation onto the space of the natural vari- ables that gives the polytope on trees. Next, building upon the result for trees---we derive the polytope on cycles for the WTSS problem; as well as a polynomial time algorithm on cycles. This leads to our contribution on general graphs. For the WTSS problem and the LCIP, using the observation that the influence propagation network must be a directed acyclic graph (DAG), the strong formulation for trees can be embedded into a formulation on general graphs. We use this to design and implement a branch-and-cut approach for the WTSS problem and the LCIP. In our computational study, we are able to obtain high quality solutions for random graph instances with up to 10,000 nodes and 20,000 edges (40,000 arcs) within a reasonable amount of time.

Enhancement to the Mortgage Licensing Process

The Consumer Finance Division of the South Carolina State Board of Financial Institutions is responsible for the supervision, licensing and examination of all consumer finance companies, deferred presentment companies, check cashing companies, and non-depository mortgage lenders and their loan originators. This project specifically focuses on the licensing of Mortgage Lender/Servicer ( company), Mortgage Lender/Servicer Branch (branch) and Mortgage Loan Originator (loan originator) licenses. The problem statement is how the Division can handle increasing the number of mortgage loan originators in the state without delaying the time to process applications. The goal of this project is to make the current licensing process more efficient so that the Division can handle the increased workload without having to hire additional personnel.

Exact Combinatorial Optimization with Graph Convolutional Neural Networks

Combinatorial optimization problems are typically tackled by the branch-and-bound paradigm. We propose to learn a variable selection policy for branch-and-bound in mixed-integer linear programming, by imitation learning on a diversified variant of the strong branching expert rule. We encode states as bipartite graphs and parameterize the policy as a graph convolutional neural network. Experiments on a series of synthetic problems demonstrate that our approach produces policies that can improve upon expert-designed branching rules on large problems, and generalize to instances significantly larger than seen during training.

Offline Detection, Identification, and Correction of Branch Parameter Errors Based on Several Measurement Snapshots

This paper proposes a three-stage offline approach to detect, identify, and correct series and shunt branch parameter errors. In Stage 1 the branches suspected of having parameter errors are identified through an Identification Index (II). The II of a branch is the ratio between the number of measurements adjacent to that branch, whose normalized residuals are higher than a specified threshold value, and the total number of measurements adjacent to that branch. Using several measurement snapshots, in Stage 2 the suspicious parameters are estimated, in a simultaneous multiple-state-and-parameter estimation, via an augmented state and parameter estimator which increases the V - theta state vector for the inclusion of suspicious parameters. Stage 3 enables the validation of the estimation obtained in Stage 2, and is performed via a conventional weighted least squares estimator. Several simulation results (with IEEE bus systems) have demonstrated the reliability of the proposed approach to deal with single and multiple parameter errors in adjacent and non-adjacent branches, as well as in parallel transmission lines with series compensation. Finally the proposed approach is confirmed on tests performed on the Hydro-Quebec TransEnergie network.

A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

Dorsal cutaneous branch of the ulnar nerve: a light and electron microscopy histometric study

This study describes the normal morphology and morphometry of the dorsal cutaneous branch of the ulnar nerve (DCBU) in humans. Fourteen nerves of eight donors were prepared by conventional techniques for paraffin and epoxy resin embedding. Semiautomatic morphometric analysis was performed by means of specific computer software. Histograms of the myelinated and unmyelinated fiber population and the G-ratio distribution of fibers were plotted. Myelinated fiber density per nerve varied from 5,910 to 10,166 fibers/mm(2), with an average of 8,170 +/- 393 fibers/mm(2). The distribution was bimodal with peaks at 4.0 and 9.5 mu m. Unmyelinated fiber density per nerve varied from 50,985 to 127,108, with an average of 78,474 +/- 6, 610 fibers/mm(2), with a unimodal distribution displaying a peak at 0.8 mu m. This study thus adds information about the fascicles and myelinated and unmyelinated fibers of DCBU nerves in normal people, which may be useful in further studies concerning ulnar nerve neuropathies, mainly leprosy neuropathy.

Genus for knots and links in renormalizable templates with several branch nodes

We apply kneading theory to describe the knots and links generated by the iteration of renormalizable nonautonomous dynamical systems with reducible kneading invariants, in terms of the links corresponding to each factor. As a consequence we obtain explicit formulas for the genus for this kind of knots and links.

Radiographic aspects and angioarchitectural arrangements in corrosion casts of the blood supply to the human sternocleidomastoid muscle by the sternocleidomastoid branch of the occipital artery

The contribution of the sternocleidomastoid branch of the occipital artery (superior arterial pedicle - SAP) to the irrigation of the sternocleidomastoid muscle (SCM) was evaluated in fresh human cadavers by injecting radiological dye and a resin for microvasculature corrosion casts. From its insertion in the mastoid process of the temporal bone, the SCM was divided into superior, medium, and inferior thirds. In most of the SCM, The SAP are formed by two longitudinal parallel branches. In all specimens, the radiological dye injected into the SAP reached or trespassed the middle part of the studied SCM. The SAP was poorly distributed in the lowermost region of the inferior third of the SCM, suggesting the contribution of other arteries or pedicles. The corrosion casts of the microvasculature showed a profuse network of microscopic vessels in those levels where the SAP was detected.

Myocardial Bridges and their Relationship to the Anterior Interventricular Branch of the Left Coronary Artery

OBJECTIVE: To analyze the relationship between myocardial bridges and the anterior interventricular branch (anterior descending) of the left coronary artery. METHODS: The study was carried out with postmortem material, and methods of dissection and observation were used. We assessed the perimeter of the anterior interventricular branch of the left coronary artery using a pachymeter, calculated its proximal and distal diameters in relation to the myocardial bridge, and also its diameter under the myocardial bridge in 30 hearts. We also observed the position of the myocardial bridge in relation to the origin of the anterior interventricular branch. RESULTS: The diameters of the anterior interventricular branch were as follows: the mean proximal diameter was 2.76±0.76 mm; the mean diameter under the myocardial bridge was 2.08±0.54 mm; and the mean distal diameter was 1.98±0.59 mm. In 33.33% (10/30) of the cases, the diameter of the anterior interventricular branch under the myocardial bridge was lower than the diameter of the anterior interventricular branch distal to the myocardial bridge. In 3.33% (1/30) of the cases, an atherosclerotic plaque was found in the segment under the myocardial bridge. The myocardial bridge was located in the middle third of the anterior interventricular branch in 86.66% (26/30) of the cases. CONCLUSION: Myocardial bridges are more frequently found in the middle third of the anterior interventricular branch of the left coronary artery. The diameter of the anterior interventricular branch of the left coronary artery under the myocardial bridge may be smaller than after the bridge. Myocardial bridges may not provide protection against the formation of atherosclerotic plaque inside the anterior interventricular branch of the left coronary artery.

Growth of positive words and lower bounds of the growth rate for Thompson's group (F)p

Vegeu el resum a l'inici del document del fitxer adjunt.

A New Test of the Real Interest Rate Parity Hypothesis: Bounds Approach and Structural Breaks

We test the real interest rate parity hypothesis using data for the G7 countries over the period 1970-2008. Our contribution is two-fold. First, we utilize the ARDL bounds approach of Pesaran et al. (2001) which allows us to overcome uncertainty about the order of integration of real interest rates. Second, we test for structural breaks in the underlying relationship using the multiple structural breaks test of Bai and Perron (1998, 2003). Our results indicate significant parameter instability and suggest that, despite the advances in economic and financial integration, real interest rate parity has not fully recovered from a breakdown in the 1980s.