Relaxation algorithm to hyperbolic states in Gross-Pitaevskii equation

A new version of the relaxation algorithm is proposed in order to obtain the stationary ground-state solutions of nonlinear Schrodinger-type equations, including the hyperbolic solutions. In a first example, the method is applied to the three-dimensional Gross-Pitaevskii equation, describing a condensed atomic system with attractive two-body interaction in a non-symmetrical trap, to obtain results for the unstable branch. Next, the approach is also shown to be very reliable and easy to be implemented in a non-symmetrical case that we have bifurcation, with nonlinear cubic and quintic terms. (c) 2006 Elsevier B.V. All rights reserved.

Algorithm for probing the unitarity of topologically massive models

An uncomplicated and easy handling prescription that converts the task of checking the unitarity of massive, topologically massive, models into a straightforward algebraic exercise, is developed. The algorithm is used to test the unitarity of both topologically massive higher-derivative electromagnetism (TMHDE) and topologically massive higher-derivative gravity (TMHDG). The novel and amazing features of these effective field models are also discussed.

cAMP signaling pathway controls glycogen metabolism in Neurospora crassa by regulating the glycogen synthase gene expression and phosphorylation

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Ambient pH Controls Glycogen Levels by Regulating Glycogen Synthase Gene Expression in Neurospora crassa. New Insights into the pH Signaling Pathway

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Reaction pathway to the synthesis of anatase via the chemical modification of titanium isopropoxide with acetic acid

Anatase nanoparticles were obtained through a modified sol-gel route from titanium isopropoxide modified with acetic acid in order to control hydrolysis and condensation reactions. The modification of Ti(O(i)Pr)(4) with acetic acid reduces the availability of groups that hydrolyze and condense easily through the formation of a stable complex whose structure was determined to be Ti(OCOCH(3))(O(i)Pr)(2) by means of FTIR and (13)C NMR. The presence of this complex was confirmed with FTIR in the early stages of the process. A doublet in 1542 and 1440 cm(-1) stands for the asymmetric and symmetric stretching vibrations of the carboxylic group coordinated to Ti as a bidentate ligand. The gap of 102 cm(-1) between these signals suggests that acetate acts preferentially as a bidentate rather than as a bridging ligand between two titanium atoms. The use of acetic acid as modifier allows the control of both the degree of condensation and oligomerization of the precursor and leads to the preferential crystallization of TiO(2) in the anatase phase. A possible reaction pathway toward the formation of anatase is proposed on the basis of the intermediate species present in a 1:1 Ti(O(i)Pr)(4):CH(3)COOH molar system in which esterification reactions that introduce H(2)O into the reaction mixture were seen to be negligible. The Rietveld refinement and TEM analysis revealed that the powder is composed of isotropic anatase nanocrystallites.

Putative metabolic pathway of mannitol and sorbitol and in sugarcane

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

An improved tabu-based vector optimal algorithm for design optimizations of electromagnetic devices

This paper introduces an improved tabu-based vector optimal algorithm for multiobjective optimal designs of electromagnetic devices. The improvements include a division of the entire search process, a new method for fitness assignment, a novel scheme for the generation and selection of neighborhood solutions, and so forth. Numerical results on a mathematical function and an engineering multiobjective design problem demonstrate that the proposed method can produce virtually the exact Pareto front, in both parameter and objective spaces, even though the iteration number used by it is only about 70% of that required by its ancestor.

Constructive heuristic algorithm for the DC model in network transmission expansion planning

A novel constructive heuristic algorithm to the network expansion planning problem is presented the basic idea comes from Garver's work applied to the transportation model, nevertheless the proposed algorithm is for the DC model. Tests results with most known systems in the literature are carried out to show the efficiency of the method.

Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning

A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.

Modified Chebyshev algorithm: some applications

Two applications of the modified Chebyshev algorithm are considered. The first application deals with the generation of orthogonal polynomials associated with a weight function having singularities on or near the end points of the interval of orthogonality. The other application involves the generation of real Szego polynomials.

Branch and bound algorithm for transmission system expansion planning using a transportation model

A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.

Compact disks, a new source for gold electrodes. Application to the quantification of copper by PSA

In this work we describe a versatile and very sensitive way for copper quantification by potentiometric stripping analysis using gold electrodes obtained from recordable compact disks (CDs). This new source of electrodes (CDtrodes) shown similar performance to the commercial gold electrodes with superior versatility and lower cost. Recordable CDs contains a highly pure gold film with thickness between 50 and 100 nm and superficial area of ca. 100 cm(2). The working electrode developed was used successfully in stationary cell and many experimental parameters have been optimized. For copper, the detection limit attained was 30 ng L-1 (600 s deposition time) with remarkable precision (standard deviation of 1.8 % for 20 repetitive measurements using 25 mu gL(-1) of copper with 60 s of deposition time). The gold electrode developed was used for analysis of copper in sugar cane spirits and tap water samples. The results were compared with those obtained by atomic absorption spectroscopy.

Specialised branch-and-bound algorithm for transmission network expansion planning

An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.