On Hamilton cycles in locally connected graphs with vertex degree constraints

It is shown that every connected, locally connected graph with the maximum vertex degree Δ(G)=5 and the minimum vertex degree δ(G)3 is fully cycle extendable. For Δ(G)4, all connected, locally connected graphs, including infinite ones, are explicitly described. The Hamilton Cycle problem for locally connected graphs with Δ(G)7 is shown to be NP-complete

On the solvability of Hamilton's equations in Hilbert spaces

We construct a bounded function $H : l_2\times l_2 \to R$ with continuous Frechet derivative such that for any $q_0\in l_2$ the Cauchy problem $\dot p= - {\partial H\over\partial q}$, $\dot q={\partial H\over\partial p}$, $p(0) = 0$, q(0) = q_0$ has no solutions in any neighborhood of zero in R.

Sound Synthesis for Contact-Driven Musical Instruments via Discretisation of Hamilton's Equations

Physical modelling of musical instruments involves studying nonlinear interactions between parts of the instrument. These can pose several difficulties concerning the accuracy and stability of numerical algorithms. In particular, when the underlying forces are non-analytic functions of the phase-space variables, a stability proof can only be obtained in limited cases. An approach has been recently presented by the authors, leading to unconditionally stable simulations for lumped collision models. In that study, discretisation of Hamilton’s equations instead of the usual Newton’s equation of motion yields a numerical scheme that can be proven to be energy conserving. In this paper, the above approach is extended to collisions of distributed objects. Namely, the interaction of an ideal string with a flat barrier is considered. The problem is formulated within the Hamiltonian framework and subsequently discretised. The resulting nonlinearmatrix equation can be shown to possess a unique solution, that enables the update of the algorithm. Energy conservation and thus numerical stability follows in a way similar to the lumped collision model. The existence of an analytic description of this interaction allows the validation of the model’s accuracy. The proposed methodology can be used in sound synthesis applications involving musical instruments where collisions occur either in a confined (e.g. hammer-string interaction, mallet impact) or in a distributed region (e.g. string-bridge or reed-mouthpiece interaction).

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.

Problem-based learning and legal education : a case study in integrated experiential study

Resumen basado en el de la publicaci??n

Optimal pest control problem in population dynamics

One of the main goals of the pest control is to maintain the density of the pest population in the equilibrium level below economic damages. For reaching this goal, the optimal pest control problem was divided in two parts. In the first part, the two optimal control functions were considered. These functions move the ecosystem pest-natural enemy at an equilibrium state below the economic injury level. In the second part, the one optimal control function stabilizes the ecosystem in this level, minimizing the functional that characterizes quadratic deviations of this level. The first problem was resolved through the application of the Maximum Principle of Pontryagin. The Dynamic Programming was used for the resolution of the second optimal pest control problem.

Formalismo de Hamilton-Jacobi generalizado: teorias de campos com derivadas de ordem superior

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

Do cyanobacteria swim using traveling surface waves?

Bacteria that swim without the benefit of flagella might do so by generating longitudinal or transverse surface waves. For example, swimming speeds of order 25 microns/s are expected for a spherical cell propagating longitudinal waves of 0.2 micron length, 0.02 micron amplitude, and 160 microns/s speed. This problem was solved earlier by mathematicians who were interested in the locomotion of ciliates and who considered the undulations of the envelope swept out by ciliary tips. A new solution is given for spheres propagating sinusoidal waveforms rather than Legendre polynomials. The earlier work is reviewed and possible experimental tests are suggested.

Types of evolutionary stability and the problem of cooperation.

The evolutionary stability of cooperation is a problem of fundamental importance for the biological and social sciences. Different claims have been made about this issue: whereas Axelrod and Hamilton's [Axelrod, R. & Hamilton, W. (1981) Science 211, 1390-1398] widely recognized conclusion is that cooperative rules such as "tit for tat" are evolutionarily stable strategies in the iterated prisoner's dilemma (IPD), Boyd and Lorberbaum [Boyd, R. & Lorberbaum, J. (1987) Nature (London) 327, 58-59] have claimed that no pure strategy is evolutionarily stable in this game. Here we explain why these claims are not contradictory by showing in what sense strategies in the IPD can and cannot be stable and by creating a conceptual framework that yields the type of evolutionary stability attainable in the IPD and in repeated games in general. Having established the relevant concept of stability, we report theorems on some basic properties of strategies that are stable in this sense. We first show that the IPD has "too many" such strategies, so that being stable does not discriminate among behavioral rules. Stable strategies differ, however, on a property that is crucial for their evolutionary survival--the size of the invasion they can resist. This property can be interpreted as a strategy's evolutionary robustness. Conditionally cooperative strategies such as tit for tat are the most robust. Cooperative behavior supported by these strategies is the most robust evolutionary equilibrium: the easiest to attain, and the hardest to disrupt.

An integrated scheduling problem of PCB components on sequential pick-and-place machines:mathematical models and heuristic solutions

This paper formulates several mathematical models for determining the optimal sequence of component placements and assignment of component types to feeders simultaneously or the integrated scheduling problem for a type of surface mount technology placement machines, called the sequential pick-andplace (PAP) machine. A PAP machine has multiple stationary feeders storing components, a stationary working table holding a printed circuit board (PCB), and a movable placement head to pick up components from feeders and place them to a board. The objective of integrated problem is to minimize the total distance traveled by the placement head. Two integer nonlinear programming models are formulated first. Then, each of them is equivalently converted into an integer linear type. The models for the integrated problem are verified by two commercial packages. In addition, a hybrid genetic algorithm previously developed by the authors is adopted to solve the models. The algorithm not only generates the optimal solutions quickly for small-sized problems, but also outperforms the genetic algorithms developed by other researchers in terms of total traveling distance.

On The Cauchy Problem for Non Effectively Hyperbolic Operators, The Ivrii-Petkov-Hörmander Condition and the Gevrey Well Posedness

2000 Mathematics Subject Classification: 35L15, Secondary 35L30.

On an ODE Relevant for the General Theory of the Hyperbolic Cauchy Problem

2000 Mathematics Subject Classification: 34E20, 35L80, 35L15.

Directed Selection using Reinforcement Learning for the Examination Timetabling Problem

Traditional heuristic approaches to the Examination Timetabling Problem normally utilize a stochastic method during Optimization for the selection of the next examination to be considered for timetabling within the neighbourhood search process. This paper presents a technique whereby the stochastic method has been augmented with information from a weighted list gathered during the initial adaptive construction phase, with the purpose of intelligently directing examination selection. In addition, a Reinforcement Learning technique has been adapted to identify the most effective portions of the weighted list in terms of facilitating the greatest potential for overall solution improvement. The technique is tested against the 2007 International Timetabling Competition datasets with solutions generated within a time frame specified by the competition organizers. The results generated are better than those of the competition winner in seven of the twelve examinations, while being competitive for the remaining five examinations. This paper also shows experimentally how using reinforcement learning has improved upon our previous technique.