Naturally light invisible axion in models with large local discrete symmetries

We show that by introducing appropriate local Z(N)(Ngreater than or equal to13) symmetries in electroweak models it is possible to implement an automatic Peccei-Quinn symmetry, at the same time keeping the axion protected against gravitational effects. Although we consider here only an extension of the standard model and a particular 3-3-1 model, the strategy can be used in any kind of electroweak model. An interesting feature of this 3-3-1 model is that if we add (i) right-handed neutrinos, (ii) the conservation of the total lepton number, and (iii) a Z(2) symmetry, the Z(13) and the chiral Peccei-Quinn U(1)P-Q symmetries are both accidental symmetries in the sense that they are not imposed on the Lagrangian but are just a consequence of the particle content of the model, its gauge invariance, renormalizability, and Lorentz invariance. In addition, this model has no domain wall problem.

Naturally light invisible axion and local Z(13)circle times Z(3) symmetries

We show that by imposing local Z(13)circle timesZ(3) symmetries in an SU(2)circle timesU(1) electroweak model we can implement an invisible axion in such a way that (i) the Peccei-Quinn symmetry is an automatic symmetry of the classical Lagrangian, and (ii) the axion is protected from semiclassical gravitational effects. In order to be able to implement such a large discrete symmetry, and at the same time allow a general mixing in each charge sector, we introduce right-handed neutrinos and enlarge the scalar sector of the model. The domain wall problem is briefly considered.

Finding invariant tori in the problem of a periodically corrugated waveguide

Some dynamic properties for a light ray suffering specular reflections inside a periodically corrugated waveguide are studied. The dynamics of the model is described in terms of a two dimensional nonlinear area preserving map. We show that the phase space is mixed in the sense that there are KAM islands surrounded by a large chaotic sea that is confined by two invariant spanning curves. We have used a connection with the Standard Mapping near a transition from local to global chaos and found the position of these two invariant spanning curves limiting the size of the chaotic sea as function of the control parameter.

Uma nova heurística para o problema de minimização de trocas de ferramentas

O problema de minimização de troca de ferramentas (MTSP) busca uma sequência de processamento de um conjunto de tarefas, de modo a minimizar o número de trocas de ferramentas requeridas. Este trabalho apresenta uma nova heurística para o MTSP, capaz de produzir bons limitantes superiores para um algoritmo enumerativo. Esta heurística possui duas fases: uma fase construtiva que é baseada em um grafo em que os vértices correspondem a ferramentas e existe um arco k = (i, j) que liga os vértices i e j se e somente se as ferramentas i e j são necessárias para a execução de alguma tarefa k; e uma fase de refinamento baseada na meta-heurística Busca Local Iterativa. Resultados computacionais mostram que a heurística proposta tem um bom desempenho para os problemas testados, contribuindo para uma redução significativa no número de nós gerados de um algoritmo enumerativo.

On the solution of the extended linear complementarity problem

The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasarian and Pang. In the present research, minimization problems with simple bounds associated to this problem are defined. When the XLCP is solvable, their solutions are global minimizers of the associated problems. Sufficient conditions that guarantee that stationary points of the associated problems are solutions of the XLCP will be proved. These theoretical results support the conjecture that local methods for box constrained optimization applied to the associated problems could be efficient tools for solving the XLCP. (C) 1998 Elsevier B.V. All rights reserved.

The STATFLUX code: a statistical method for calculation of flow and set of parameters, based on the Multiple-Compartment Biokinetical Model

The code STATFLUX, implementing a new and simple statistical procedure for the calculation of transfer coefficients in radionuclide transport to animals and plants, is proposed. The method is based on the general multiple-compartment model, which uses a system of linear equations involving geometrical volume considerations. Flow parameters were estimated by employing two different least-squares procedures: Derivative and Gauss-Marquardt methods, with the available experimental data of radionuclide concentrations as the input functions of time. The solution of the inverse problem, which relates a given set of flow parameter with the time evolution of concentration functions, is achieved via a Monte Carlo Simulation procedure.Program summaryTitle of program: STATFLUXCatalogue identifier: ADYS_v1_0Program summary URL: http://cpc.cs.qub.ac.uk/summaries/ADYS_v1_0Program obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandLicensing provisions: noneComputer for which the program is designed and others on which it has been tested: Micro-computer with Intel Pentium III, 3.0 GHzInstallation: Laboratory of Linear Accelerator, Department of Experimental Physics, University of São Paulo, BrazilOperating system: Windows 2000 and Windows XPProgramming language used: Fortran-77 as implemented in Microsoft Fortran 4.0. NOTE: Microsoft Fortran includes non-standard features which are used in this program. Standard Fortran compilers such as, g77, f77, ifort and NAG95, are not able to compile the code and therefore it has not been possible for the CPC Program Library to test the program.Memory, required to execute with typical data: 8 Mbytes of RAM memory and 100 MB of Hard disk memoryNo. of bits in a word: 16No. of lines in distributed program, including test data, etc.: 6912No. of bytes in distributed Program, including test data, etc.: 229 541Distribution format: tar.gzNature of the physical problem: the investigation of transport mechanisms for radioactive substances, through environmental pathways, is very important for radiological protection of populations. One such pathway, associated with the food chain, is the grass-animal-man sequence. The distribution of trace elements in humans and laboratory animals has been intensively studied over the past 60 years [R.C. Pendlenton, C.W. Mays, R.D. Lloyd, A.L. Brooks, Differential accumulation of iodine-131 from local fallout in people and milk, Health Phys. 9 (1963) 1253-1262]. In addition, investigations on the incidence of cancer in humans, and a possible causal relationship to radioactive fallout, have been undertaken [E.S. Weiss, M.L. Rallison, W.T. London, W.T. Carlyle Thompson, Thyroid nodularity in southwestern Utah school children exposed to fallout radiation, Amer. J. Public Health 61 (1971) 241-249; M.L. Rallison, B.M. Dobyns, F.R. Keating, J.E. Rall, F.H. Tyler, Thyroid diseases in children, Amer. J. Med. 56 (1974) 457-463; J.L. Lyon, M.R. Klauber, J.W. Gardner, K.S. Udall, Childhood leukemia associated with fallout from nuclear testing, N. Engl. J. Med. 300 (1979) 397-402]. From the pathways of entry of radionuclides in the human (or animal) body, ingestion is the most important because it is closely related to life-long alimentary (or dietary) habits. Those radionuclides which are able to enter the living cells by either metabolic or other processes give rise to localized doses which can be very high. The evaluation of these internally localized doses is of paramount importance for the assessment of radiobiological risks and radiological protection. The time behavior of trace concentration in organs is the principal input for prediction of internal doses after acute or chronic exposure. The General Multiple-Compartment Model (GMCM) is the powerful and more accepted method for biokinetical studies, which allows the calculation of concentration of trace elements in organs as a function of time, when the flow parameters of the model are known. However, few biokinetics data exist in the literature, and the determination of flow and transfer parameters by statistical fitting for each system is an open problem.Restriction on the complexity of the problem: This version of the code works with the constant volume approximation, which is valid for many situations where the biological half-live of a trace is lower than the volume rise time. Another restriction is related to the central flux model. The model considered in the code assumes that exist one central compartment (e.g., blood), that connect the flow with all compartments, and the flow between other compartments is not included.Typical running time: Depends on the choice for calculations. Using the Derivative Method the time is very short (a few minutes) for any number of compartments considered. When the Gauss-Marquardt iterative method is used the calculation time can be approximately 5-6 hours when similar to 15 compartments are considered. (C) 2006 Elsevier B.V. All rights reserved.

Sequence, evolution and ligand binding properties of mammalian Duffy antigen/receptor for chemokines

The Duffy antigen/receptor for chemokine, DARC, acts as a widely expressed promiscuous chemokine receptor and as the erythrocyte receptor for Plasmodium vivax. To gain insight into the evolution and structure/function relations of DARC, we analyzed the binding of anti-human Fy monoclonal antibodies (mAbs) and human chemokines to red blood cells (RBCs) from 11 nonhuman primates and two nonprimate mammals, and we elucidated the structures of the DARC genes from gorilla, gibbon, baboon, marmoset, tamarin, night monkey and cattle. CXCL-8 and CCL-5 chemokine binding analysis indicated that the promiscuous binding profile characteristic of DARC is conserved across species. Among three mAbs that detected the Fy6 epitope by flow cytometric analysis of human and chimpanzee RBCs, only one reacted with night monkey and squirrel monkey. Only chimpanzee RBCs bound a significant amount of the anti-Fy3 mAb. Fy3 was also poorly detected on RBCs from gorilla, baboon and rhesus monkey, but not from new world monkeys. Alignment of DARC homologous sequences allowed us to construct a phylogenetic tree in which all branchings were in accordance with current knowledge of primate phylogeny. Although DARC was expected to be under strong internal and external selection pressure, in order to maintain chemokine binding and avoid Plasmodium vivax binding, respectively, our present study did not provide arguments in favor of a selection pressure on the extracellular domains involved in ligand specificity. The amino acid variability of DARC-like polypeptides was found to be well correlated with the hydrophylicity indexes, with the highest divergence on the amino-terminal extracellular domain. Analysis of the deduced amino acid sequences highlighted the conservation of some amino acid residues, which should prove to be critical for the structural and functional properties of DARC.

Solution approaches for the soft drink integrated production lot sizing and scheduling problem

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

On a moment problem associated with Chebyshev polynomials

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

On the resolution of the generalized nonlinear complementarity problem

Minimization of a differentiable function subject to box constraints is proposed as a strategy to solve the generalized nonlinear complementarity problem (GNCP) defined on a polyhedral cone. It is not necessary to calculate projections that complicate and sometimes even disable the implementation of algorithms for solving these kinds of problems. Theoretical results that relate stationary points of the function that is minimized to the solutions of the GNCP are presented. Perturbations of the GNCP are also considered, and results are obtained related to the resolution of GNCPs with very general assumptions on the data. These theoretical results show that local methods for box-constrained optimization applied to the associated problem are efficient tools for solving the GNCP. Numerical experiments are presented that encourage the use of this approach.

An investigations on local and global behavior of a (SMA) oscillator of 3 - DOF driven by a limited power supply

SMART material systems offer great possibilities in terms of providing novel and economical solutions to engineering problems. The technological advantages of these materials over traditional ones are due to their unique microstructure and molecular properties. Smart materials such as shape memory alloys (SMA), has been used in such diverse areas of engineering science, nowadays. In this paper, we present a numerical investigation of the dynamics interaction of a nonideal structure (NIS). We analyze the phenomenon of the passage through resonance region in the steady state processes. We remarked that this kind of problem can lead to the so-called Sommerfeld effect: steady state frequencies of the DC motor will usually increase as more power (voltage) is given to it in a step-by-step fashion. When a resonance condition with the structure it is reached, the better part of this energy it is consumed to generate large amplitude vibrations of the foundation without sensible change of the motor frequency as before. The results obtained by using numerical simulations are discussed in details. Copyright © 2009 by ASME.

GRASP with evolutionary path-relinking for the capacitated arc routing problem

The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.

Domain reduction using GRASP construction phase for transmission expansion planning problem

This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.

An Educational international partnership responding to local needs: Process evaluation of the Brazil FAIMER Regional Institute

The Brazilian public health system requires competent professionals sensitive to the needs of the population. The Foundation for Advancement of International Medical Education and Research (FAIMER) provides a two-year faculty development programme for health professions educators, aiming to build leadership in education to improve health. A partnership with governmental initiatives and FAIMER was established for meeting these needs. This paper describes the initial process evaluation results of the Brazilian FAIMER Institute Fellowship (FAIMER BR). Methods: Data were analysed for the classes 2007-2010 regarding: application processes; innovation project themes; retrospective post-pre self-ratings of knowledge acquisition; and professional development portfolios. Results: Seventeen of 26 Brazilian states were represented among 98 Fellows, predominantly from public medical schools (75.5%) and schools awarded Ministry of Health grants to align education with public health services (89.8%). One-third (n = 32) of Fellows' innovation projects were related to these grants. Significant increases occurred in all topic subscales on self-report of knowledge acquisition (eff ect sizes, 1.21-2.77). In the follow up questionnaire, 63% of Fellows reported that their projects were incorporated into the curriculum or institutional policies. The majority reported that the programme deepened their knowledge (98%), provided new ideas about medical education (90%) and provided skills for conflict management (63%). One-half of the Fellows reported sustained benefits from the programme listserv and other communications, including breadth of expertise, establishment of research collaboration and receiving emotional support. Conclusion: Contributors to initial programme success included alignment of curriculum with governmental initiatives, curriculum design merging educational technology, leadership and management skills and central role of an innovation educational project responding to local needs.

A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem

In many production processes, a key material is prepared and then transformed into different final products. The lot sizing decisions concern not only the production of final products, but also that of material preparation in order to take account of their sequence-dependent setup costs and times. The amount of research in recent years indicates the relevance of this problem in various industrial settings. In this paper, facility location reformulation and strengthening constraints are newly applied to a previous lot-sizing model in order to improve solution quality and computing time. Three alternative metaheuristics are used to fix the setup variables, resulting in much improved performance over previous research, especially regarding the use of the metaheuristics for larger instances. © 2013 Elsevier Ltd. All rights reserved.