This study presents a new way for new 3D energy harvesting energy with vertically aligned nanorods arrays. ZnO nanoparticles array on Au/Cr/Si substrate are directly patterned by electrospray. First, gel solutions with zinc acetate, monoethanolamine and 2-methoxyethanol as the precursor by sol-gel technology were formulated. Then, the solutions were stirred to become clear and homogeneous liquid. Second, the precursor solutions were prepared by electrospray, where a Taylor cone was formed to produce ZnO nanoparticles. Then the ZnO nanoparticles were annealed as seed layers for nanorods. By varying the property of the ZnO solution, needle with collector distance, applied voltage, annealing temperature and molar ratio were discussed. After annealing, the orientation of the ZnO nanorods depend on the crystalline orientation of ZnO nanoparticles. The ZnO nanorods were obtained at a temperature of 90 ¢XC by aqueous solution method. The experimental parameters of lengths, diameters, and pH level of the reaction medium of the Zno nanorod were observed and controlled. The physical structures of ZnO were characterized by X-ray diffraction (XRD) and Field Emission Scanning Electron Microscopy (FESEM) analyses. The results show that the ZnO nanoparticles become more intensity with increasing in annealing temperature. The SEM analysis reveals that the ZnO nanorods have diameters about 100-400 nm and length about 200-1200 nm. Finally, Pt electrode atop as Schottky contacts were packed to fabricate nanogenerator with ZnO nanorods. Then the nanogenerator was driven by ultrasonic wave vibration. The wave drives the electrode up and down to vibrate the nanorods, and its voltage and current were also characterized. The measurement results show the maximum power is 0.004х10-8 W during the operation frequency of 42 kHz.

Classically, researchers in Computational Physics and specifically in Computational Electromagnetics have sought to find numerical solutions to complex physical problems. Several techniques have been developed to accomplish such tasks, each of which having advantages over their counterparts. Typically, each solution method has been developed separately despite having numerous commonalities with other methods. This fact motivates a unified software tool to house each solution method to avoid duplicating previous efforts. Subsequently, these solution methods can be used alone or in conjunction with one another in a straightforward manner. The aforementioned goals can be accomplished by using an Object Oriented software approach. Thus, the goal of the presented research was to incorporate a specific solution technique, an Integral Equation Nystrm method, into a general, Object Oriented software framework.

京都大学 / 0048 / 新制・課程博士 / 博士(工学) / 甲第21786号 / 工博第4603号 / 新制||工||1717(附属図書館) / 京都大学大学院工学研究科物質エネルギー化学専攻 / (主査)教授 村田 靖次郎, 教授 辻 康之, 教授 小澤 文幸 / 学位規則第4条第1項該当 / Doctor of Philosophy (Engineering) / Kyoto University / DGAM

No / An investigation of the surface current distribution in a normal-mode helical antenna (NMHA) is reported. This enables precise prediction of the performance of NMHAs, since traditional wire-antenna simulations ignore important details, such as non-uniform and transverse current distributions. A moment-method formulation is developed, using two-dimensional basis functions to represent the total non-uniform surface current distribution over the surface of the wire of the helix. Piecewise-sinusoidal basis functions are employed in two normal directions, with an exact kernel formulation and application of Galerkin's solution method. The numerical solution of the singular integrals associated with self-impedance terms was computed with a very low relative error. The surface current distribution was computed for different helix geometries. It was found that the axially-directed component of the current distribution around the surface of the wire was highly non-uniform and that there was also a significant circumferential current flow due to inter-turn capacitance, both effects that are overlooked by standard filamentary current representations.

Resumo: O alumínio (Al) é um dos principais responsáveis pela baixa adaptação de plantas em solos ácidos, por isso, se faz necessária a busca por cultivares tolerantes e a definição da dose utilizada no estresse são alvos para estudos no capim-braquiária. O objetivo neste trabalho foi avaliar genótipos de braquiária quanto à tolerância ao Al em solução. Realizaram-se dois experimentos, o primeiro visando auxiliar na escolha de genitores para obtenção de uma população segregante para estudos de herança e mapeamento; e, o segundo para determinar a dose de Al para utilização em estudos de expressão gênica. No primeiro experimento avaliaram-se cinco genótipos de Urochloa decumbens e cinco de U. ruziziensis em solução contendo apenas cálcio (200 mM CaCl2) e duas doses de Al (0 e 200 mM AlCl3) em pH 4,2. Medidas do comprimento da raiz (CR) e diâmetro da raiz (DR) foram avaliadas e os genótipos foram classificados pelos índices de tolerância relativa (ITR). Os resultados apontaram o genótipo D62 (cv. Basilisk) como o único tolerante ao Al e o R50 o único sensível, os demais genótipos apresentaram de média a baixa tolerância ao Al. No segundo experimento, as cultivares U. decumbens cv. Basilisk (tolerante) e U. brizantha cv. Marandu (sensível) foram submetidas a quatro doses de Al (0; 200; 400 e 600 mM AlCl3, pH 4,2). As variáveis avaliadas foram CR, DR e peso seco (PS) das raízes. Os resultados evidenciaram que a cv. Marandu foi sensível a todas as doses e a cv. Basilisk foi tolerante até a dose 400 μM, perdendo sua tolerância em 600 μM de AlCl3 / Abstract: Aluminum (Al) is the one of main causes in low adaptation of plants in acid soils, therefore it's necessary to search for tolerant cultivars and the definition of the dose of stress are targets for studies on brachiariagrass. The objective was to evaluate genotypes for tolerance of Al in solution. There were two experiments, first, seeking help in the choice of parents to obtain a segregating population for studies of inheritance and mapping, and the second, to determine the dose of Al for used in studies of gene expression. In the first experiment was evaluated in five genotypes of Urochloa decumbens and five U. ruziziensis in solution containing only calcium (200 mM CaCl2) and two doses of Al (0 and 200 mM AlCl3) with pH 4,2. Measurements of length of root (CR) diameter of root (RD) were evaluated and the genotypes were classified by the indices of tolerance (ITR). The results indicated the D62 genotype (cv. Basilisk) as the only tolerant to Al and R50 the only sensitive, the other genotypes showed average to low tolerance to Al. In the second experiment, cultivars U. decumbens cv. Basilisk (tolerant) and U. brizantha cv. Marandu (sensitive) were subjected at four doses of Al (0, 200, 400 and 600 mM AlCl3 pH4,2). The variables were evaluated CR, DR and dry weight (PS) of roots. The results showed cv. Marandu was sensitive to all doses and a cv. Basilisk was tolerant to the dose of 400 mM AlCl3, losing their tolerance at 600 μM of AlCl3 / Orientador: José Roberto Moro / Coorientadora: Lucimara Chiari / Banca: Ricardo Machado da Silva / Banca: Rinaldo Cesar de Paula / Mestre

Made available in DSpace on 2014-06-11T19:26:09Z (GMT). No. of bitstreams: 0 Previous issue date: 2010-07-05Bitstream added on 2014-06-13T20:33:53Z : No. of bitstreams: 1 bitencourt_ga_me_jabo.pdf: 303780 bytes, checksum: 7ef39a3507b5ce333644ca2bd5cae932 (MD5) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / O alumínio (Al) é um dos principais responsáveis pela baixa adaptação de plantas em solos ácidos, por isso, se faz necessária a busca por cultivares tolerantes e a definição da dose utilizada no estresse são alvos para estudos no capim-braquiária. O objetivo neste trabalho foi avaliar genótipos de braquiária quanto à tolerância ao Al em solução. Realizaram-se dois experimentos, o primeiro visando auxiliar na escolha de genitores para obtenção de uma população segregante para estudos de herança e mapeamento; e, o segundo para determinar a dose de Al para utilização em estudos de expressão gênica. No primeiro experimento avaliaram-se cinco genótipos de Urochloa decumbens e cinco de U. ruziziensis em solução contendo apenas cálcio (200 mM CaCl2) e duas doses de Al (0 e 200 mM AlCl3) em pH 4,2. Medidas do comprimento da raiz (CR) e diâmetro da raiz (DR) foram avaliadas e os genótipos foram classificados pelos índices de tolerância relativa (ITR). Os resultados apontaram o genótipo D62 (cv. Basilisk) como o único tolerante ao Al e o R50 o único sensível, os demais genótipos apresentaram de média a baixa tolerância ao Al. No segundo experimento, as cultivares U. decumbens cv. Basilisk (tolerante) e U. brizantha cv. Marandu (sensível) foram submetidas a quatro doses de Al (0; 200; 400 e 600 mM AlCl3, pH 4,2). As variáveis avaliadas foram CR, DR e peso seco (PS) das raízes. Os resultados evidenciaram que a cv. Marandu foi sensível a todas as doses e a cv. Basilisk foi tolerante até a dose 400 μM, perdendo sua tolerância em 600 μM de AlCl3 / Aluminum (Al) is the one of main causes in low adaptation of plants in acid soils, therefore it’s necessary to search for tolerant cultivars and the definition of the dose of stress are targets for studies on brachiariagrass. The objective was to evaluate genotypes for tolerance of Al in solution. There were two experiments, first, seeking help in the choice of parents to obtain a segregating population for studies of inheritance and mapping, and the second, to determine the dose of Al for used in studies of gene expression. In the first experiment was evaluated in five genotypes of Urochloa decumbens and five U. ruziziensis in solution containing only calcium (200 mM CaCl2) and two doses of Al (0 and 200 mM AlCl3) with pH 4,2. Measurements of length of root (CR) diameter of root (RD) were evaluated and the genotypes were classified by the indices of tolerance (ITR). The results indicated the D62 genotype (cv. Basilisk) as the only tolerant to Al and R50 the only sensitive, the other genotypes showed average to low tolerance to Al. In the second experiment, cultivars U. decumbens cv. Basilisk (tolerant) and U. brizantha cv. Marandu (sensitive) were subjected at four doses of Al (0, 200, 400 and 600 mM AlCl3 pH4,2). The variables were evaluated CR, DR and dry weight (PS) of roots. The results showed cv. Marandu was sensitive to all doses and a cv. Basilisk was tolerant to the dose of 400 mM AlCl3, losing their tolerance at 600 μM of AlCl3

Made available in DSpace on 2015-05-15T11:46:13Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 3111180 bytes, checksum: 6016827aa037226f3d419628a23b8daf (MD5) Previous issue date: 2012-03-22 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In this work, using variational methods and the sub and super solutions method we study the existence and multiplicity of positive solutions for some classes of problems involving the p-Laplacian operator in bounded domains of RN. Initially, we study a result of existence of positive solution for a problem where the nonlinearity does not satisfy the classical Ambrosetti-Rabinowitz condition, and then we study the existence and multiplicity result of positive solutions for a class of problems where the considered nonlinearity can change sign. / Neste trabalho, utilizando métodos variacionais e o método de sub e supersolução estudamos a existência e multiplicidade de soluções positivas para algumas classes de problemas envolvendo o operador p-Laplaciano em domínios limitados do RN: Inicial- mente, estudamos um resultado de existência de solução positiva para um problema onde a não-linearidade não satisfaz a clássica condição de Ambrosetti-Rabinowitz, e em seguida estudamos um resultado de existência e multiplicidade de soluções positivas para uma classe de problemas onde a não-linearidade pode mudar de sinal.

Robust preconditioners on block-triangular and block-factorized form for three types of linear systems of two-by-two block form are studied in this thesis. The first type of linear systems, which are dense, arise from a boundary element type of discretization of crack propagation problems. Numerical experiment show that simple algebraic preconditioning strategies results in iterative schemes that are highly competitive with a direct solution method. The second type of algebraic systems, which are sparse, indefinite and nonsymmetric, arise from a finite element (FE) discretization of the partial differential equations (PDE) that describe (visco)elastic glacial isostatic adjustment (GIA). The Schur complement approximation in the block preconditioners is constructed by assembly of local, exactly computed Schur matrices. The quality of the approximation is verified in numerical experiments. When the block preconditioners for the indefinite problem are combined with an inner iterative scheme preconditioned by a (nearly) optimal multilevel preconditioner, the resulting preconditioner is (nearly) optimal and robust with respect to problem size, material parameters, number of space dimensions, and coefficient jumps. Two approaches to mathematically formulate the PDEs for GIA are compared. In the first approach the equations are formulated in their full complexity, whereas in the second their formulation is confined to the features and restrictions of the employed FE package. Different solution methods for the algebraic problem are used in the two approaches. Analysis and numerical experiments reveal that the first strategy is more accurate and efficient than the latter. The block structure in the third type of algebraic systems is due to a fine-coarse splitting of the unknowns. The inverse of the pivot block is approximated by a sparse matrix which is assembled from local, exactly inverted matrices. Numerical experiments and analysis of the approximation show that it is robust with respect to problem size and coefficient jumps.

Le problème d’ordre linéaire (LOP) a reçu beaucoup d’attention dans différents domaines d’application, allant de l’archéologie à l’ordonnancement en passant par l’économie et même de la psychologie mathématique. Ce problème est aussi connu pour être parmi les problèmes NP-difficiles. Nous considérons dans cette thèse une variante de (LOP) sous contrainte de cardinalité. Nous cherchons donc un ordre linéaire d’un sous-ensemble de sommets du graphe de préférences de cardinalité fixée et de poids maximum. Ce problème, appelé (FCLOP) pour ’fixed-cardinality linear ordering problem’, n’a pas été étudié en tant que tel dans la littérature scientifique même si plusieurs applications dans les domaines de macro-économie, de classification dominante ou de transport maritime existent concrètement. On retrouve en fait ses caractéristiques dans les modèles étendus de sous-graphes acycliques. Le problème d’ordre linéaire est déjà connu comme un problème NP-difficile et il a donné lieu à de nombreuses études, tant théoriques sur la structure polyédrale de l’ensemble des solutions réalisables en variables 0-1 que numériques grâce à des techniques de relaxation et de séparation progressive. Cependant on voit qu’il existe de nombreux cas dans la littérature, dans lesquelles des solveurs de Programmation Linéaire en nombres entiers comme CPLEX peuvent en résoudre certaines instances en moins de 10 secondes, mais une fois que la cardinalité est limitée, ces mêmes instances deviennent très difficiles à résoudre. Sur les aspects polyédraux, nous avons étudié le polytope de FCLOP, défini plusieurs classes d’inégalités valides et identifié la dimension ainsi que certaines inégalités qui définissent des facettes pour le polytope de FCLOP. Nous avons introduit un algorithme Relax-and-Cut basé sur ces résultats pour résoudre les instances du problème. Dans cette étude, nous nous sommes également concentrés sur la relaxation Lagrangienne pour résoudre ces cas difficiles. Nous avons étudié différentes stratégies de relaxation et nous avons comparé les bornes duales par rapport à la consolidation obtenue à partir de chaque stratégie de relâcher les contraintes afin de détecter le sous-ensemble des contraintes le plus approprié. Les résultats numériques montrent que nous pouvons trouver des bornes duales de très haute qualité. Nous avons également mis en place une méthode de décomposition Lagrangienne. Dans ce but, nous avons décomposé le modèle de FCLOP en trois sous-problèmes (au lieu de seulement deux) associés aux contraintes de ’tournoi’, de ’graphes sans circuits’ et de ’cardinalité’. Les résultats numériques montrent une amélioration significative de la qualité des bornes duales pour plusieurs cas. Nous avons aussi mis en oeuvre une méthode de plans sécants (cutting plane algorithm) basée sur la relaxation pure des contraintes de circuits. Dans cette méthode, on a relâché une partie des contraintes et on les a ajoutées au modèle au cas où il y a des de/des violations. Les résultats numériques montrent des performances prometteuses quant à la réduction du temps de calcul et à la résolution d’instances difficiles hors d’atteinte des solveurs classiques en PLNE. / Linear Ordering Problem (LOP) has receive significant attention in different areas of application, ranging from transportation and scheduling to economics and even archeology and mathematical psychology. It is classified as a NP-hard problem. Assume a complete weighted directed graph on V n , |V n |= n. A permutation of the elements of this finite set of vertices is a linear order. Now let p be a given fixed integer number, 0 ≤ p ≤ n. The p-Fixed Cardinality Linear Ordering Problem (FCLOP) is looking for a subset of vertices containing p nodes and a linear order on the nodes in S. Graphically, there exists exactly one directed arc between every pair of vertices in an LOP feasible solution, which is also a complete cycle-free digraph and the objective is to maximize the sum of the weights of all the arcs in a feasible solution. In the FCLOP, we are looking for a subset S ⊆ V n such that |S|= p and an LOP on these S nodes. Hence the objective is to find the best subset of the nodes and an LOP over these p nodes that maximize the sum of the weights of all the arcs in the solution. Graphically, a feasible solution of the FCLOP is a complete cycle-free digraph on S plus a set of n − p vertices that are not connected to any of the other vertices. There are several studies available in the literature focused on polyhedral aspects of the linear ordering problem as well as various exact and heuristic solution methods. The fixed cardinality linear ordering problem is presented for the first time in this PhD study, so as far as we know, there is no other study in the literature that has studied this problem. The linear ordering problem is already known as a NP-hard problem. However one sees that there exist many instances in the literature that can be solved by CPLEX in less than 10 seconds (when p = n), but once the cardinality number is limited to p (p < n), the instance is not anymore solvable due to the memory issue. We have studied the polytope corresponding to the FCLOP for different cardinality values. We have identified dimension of the polytope, proposed several classes of valid inequalities and showed that among these sets of valid inequalities, some of them are defining facets for the FCLOP polytope for different cardinality values. We have then introduced a Relax-and-Cut algorithm based on these results to solve instances of the FCLOP. To solve the instances of the problem, in the beginning, we have applied the Lagrangian relaxation algorithm. We have studied different relaxation strategies and compared the dual bound obtained from each case to detect the most suitable subproblem. Numerical results show that some of the relaxation strategies result better dual bound and some other contribute more in reducing the computational time and provide a relatively good dual bound in a shorter time. We have also implemented a Lagrangian decomposition algorithm, decom-6 posing the FCLOP model to three subproblems (instead of only two subproblems). The interest of decomposing the FCLOP model to three subproblems comes mostly from the nature of the three subproblems, which are relatively quite easier to solve compared to the initial FCLOP model. Numerical results show a significant improvement in the quality of dual bounds for several instances. We could also obtain relatively quite better dual bounds in a shorter time comparing to the other relaxation strategies. We have proposed a cutting plane algorithm based on the pure relaxation strategy. In this algorithm, we firstly relax a subset of constraints that due to the problem structure, a very few number of them are active. Then in the course of the branch-and-bound tree we verify if there exist any violated constraint among the relaxed constraints or. Then the characterized violated constraints will be globally added to the model. (...)