Advanced global optimisation for mission analysis and design

This report describes the analysis and development of novel tools for the global optimisation of relevant mission design problems. A taxonomy was created for mission design problems, and an empirical analysis of their optimisational complexity performed - it was demonstrated that the use of global optimisation was necessary on most classes and informed the selection of appropriate global algorithms. The selected algorithms were then applied to the di®erent problem classes: Di®erential Evolution was found to be the most e±cient. Considering the speci¯c problem of multiple gravity assist trajectory design, a search space pruning algorithm was developed that displays both polynomial time and space complexity. Empirically, this was shown to typically achieve search space reductions of greater than six orders of magnitude, thus reducing signi¯cantly the complexity of the subsequent optimisation. The algorithm was fully implemented in a software package that allows simple visualisation of high-dimensional search spaces, and e®ective optimisation over the reduced search bounds.

Attention through self-synchronisation in the spiking neuron stochastic diffusion network

The paper discusses ensemble behaviour in the Spiking Neuron Stochastic Diffusion Network, SNSDN, a novel network exploring biologically plausible information processing based on higher order temporal coding. SNSDN was proposed as an alternative solution to the binding problem [1]. SNSDN operation resembles Stochastic Diffusin on Search, SDS, a non-deterministic search algorithm able to rapidly locate the best instantiation of a target pattern within a noisy search space ([3], [5]). In SNSDN, relevant information is encoded in the length of interspike intervals. Although every neuron operates in its own time, ‘attention’ to a pattern in the search space results in self-synchronised activity of a large population of neurons. When multiple patterns are present in the search space, ‘switching of at- tention’ results in a change of the synchronous activity. The qualitative effect of attention on the synchronicity of spiking behaviour in both time and frequency domain will be discussed.

Software evolution: a graph based model

A model based on graph isomorphisms is used to formalize software evolution. Step by step we narrow the search space by an informed selection of the attributes based on the current state-of-the-art in software engineering and generate a seed solution. We then traverse the resulting space using graph isomorphisms and other set operations over the vertex sets. The new solutions will preserve the desired attributes. The goal of defining an isomorphism based search mechanism is to construct predictors of evolution that can facilitate the automation of ’software factory’ paradigm. The model allows for automation via software tools implementing the concepts.

Software evolution: a graph based model

A model based on graph isomorphisms is used to formalize software evolution. Step by step we narrow the search space by an informed selection of the attributes based on the current state-of-the-art in software engineering and generate a seed solution. We then traverse the resulting space using graph isomorphisms and other set operations over the vertex sets. The new solutions will preserve the desired attributes. The goal of defining an isomorphism based search mechanism is to construct predictors of evolution that can facilitate the automation of ’software factory’ paradigm. The model allows for automation via software tools implementing the concepts.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

Using ant colonies for solve the multiprocessor task graph scheduling

The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). In the MPSP, no preemption is allowed and each operation demands a setup time on the machines. The problem seeks to compose a schedule that minimizes the total completion time.We therefore rely on heuristics to find solutions since solution methods are not feasible for most problems as such. This novel heuristic searching approach to the multiprocessor based on the ACO algorithm a collection of agents cooperate to effectively explore the search space.A computational experiment is conducted on a suit of benchmark application. By comparing our algorithm result obtained to that of previous heuristic algorithm, it is evince that the ACO algorithm exhibits competitive performance with small error ratio.

Optimization of cable cycles : a trade-off between reliability and cost

This paper elaborates the routing of cable cycle through available routes in a building in order to link a set of devices, in a most reasonable way. Despite of the similarities to other NP-hard routing problems, the only goal is not only to minimize the cost (length of the cycle) but also to increase the reliability of the path (in case of a cable cut) which is assessed by a risk factor. Since there is often a trade-off between the risk and length factors, a criterion for ranking candidates and deciding the most reasonable solution is defined. A set of techniques is proposed to perform an efficient and exact search among candidates. A novel graph is introduced to reduce the search-space, and navigate the search toward feasible and desirable solutions. Moreover, admissible heuristic length estimation helps to early detection of partial cycles which lead to unreasonable solutions. The results show that the method provides solutions which are both technically and financially reasonable. Furthermore, it is proved that the proposed techniques are very efficient in reducing the computational time of the search to a reasonable amount.

Stratified resolution

We introduce a calculus of stratified resolution, in which special attention is paid to clauses that "define" relations. If such clauses are discovered in the initial set of clauses, they are treated using the rule of definition unfolding, i.e. the rule that replaces defined relations by their definitions. Stratified resolution comes with a powerful notion of redundancy: a clause to which definition unfolding has been applied can be removed from the search space. To prove the completeness of stratified resolution with redundancies, we use a novel combination of Bachmair and Ganzingerâ??s model construction technique and a hierarchical construction of orderings and least fixpoints.

Atributos físicos nos tempos de adoção de manejos em Latossolo cultivado com soja

A condução das operações de preparo de forma inadequada ocasiona sérios problemas de conservação do solo, destacando-se a compactação, que acarreta a redução do espaço poroso, principalmente dos macroporos, e altera os atributos físico-hídricos. Este trabalho teve como objetivo verificar a influência dos diferentes sistemas e tempos de adoção de manejos em Latossolo Vermelho de Jaboticabal, Estado de São Paulo, por meio da densidade máxima, e correlacioná-la com a produtividade da soja, a densidade relativa e a umidade crítica de compactação. O delineamento experimental foi o inteiramente casualizado com parcelas subdivididas (cinco sistemas de uso e três camadas), com quatro repetições. Os cinco sistemas de uso foram: plantio direto por cino anos (SPD5), plantio direto por sete anos (SPD7), plantio direto por nove anos (SPD9), preparo convencional (SPC) e uma área adjacente de mata nativa (MN). As camadas do solo avaliadas foram as de 0-0,10, 0,10-0,20 e 0,20-0,30 m, nas quais foram determinados a densidade máxima do solo (Ds máx), a umidade crítica de compactação (Ugc), a densidade relativa do solo (Dsr), a composição granulométrica, a porosidade e o teor de matéria orgânica do solo. Os resultados mostraram que o comportamento das curvas de compactação do solo foi o mesmo em todas as camadas dos diferentes manejos e que os teores de matéria orgânica não justificaram as pequenas alterações da Ds máx. Para o Latossolo Vermelho, as operações mecanizadas nos sistemas de manejo podem ser executadas na faixa de 0,13 a 0,19 kg kg-1 de umidade sem causar degradação física. Verificou-se que a Dsr ótima e a umidade crítica de compactação foram de 0,86 e 0,15 kg kg-1, respectivamente, embora os diferentes sistemas e tempos de adoção de manejo tenham apresentado comportamento semelhante quanto à produtividade da soja.

Análise e síntese de antenas e superfícies seletivas de frequência utilizando computação evolucionária e inteligência de enxames

The frequency selective surfaces, or FSS (Frequency Selective Surfaces), are structures consisting of periodic arrays of conductive elements, called patches, which are usually very thin and they are printed on dielectric layers, or by openings perforated on very thin metallic surfaces, for applications in bands of microwave and millimeter waves. These structures are often used in aircraft, missiles, satellites, radomes, antennae reflector, high gain antennas and microwave ovens, for example. The use of these structures has as main objective filter frequency bands that can be broadcast or rejection, depending on the specificity of the required application. In turn, the modern communication systems such as GSM (Global System for Mobile Communications), RFID (Radio Frequency Identification), Bluetooth, Wi-Fi and WiMAX, whose services are highly demanded by society, have required the development of antennas having, as its main features, and low cost profile, and reduced dimensions and weight. In this context, the microstrip antenna is presented as an excellent choice for communications systems today, because (in addition to meeting the requirements mentioned intrinsically) planar structures are easy to manufacture and integration with other components in microwave circuits. Consequently, the analysis and synthesis of these devices mainly, due to the high possibility of shapes, size and frequency of its elements has been carried out by full-wave models, such as the finite element method, the method of moments and finite difference time domain. However, these methods require an accurate despite great computational effort. In this context, computational intelligence (CI) has been used successfully in the design and optimization of microwave planar structures, as an auxiliary tool and very appropriate, given the complexity of the geometry of the antennas and the FSS considered. The computational intelligence is inspired by natural phenomena such as learning, perception and decision, using techniques such as artificial neural networks, fuzzy logic, fractal geometry and evolutionary computation. This work makes a study of application of computational intelligence using meta-heuristics such as genetic algorithms and swarm intelligence optimization of antennas and frequency selective surfaces. Genetic algorithms are computational search methods based on the theory of natural selection proposed by Darwin and genetics used to solve complex problems, eg, problems where the search space grows with the size of the problem. The particle swarm optimization characteristics including the use of intelligence collectively being applied to optimization problems in many areas of research. The main objective of this work is the use of computational intelligence, the analysis and synthesis of antennas and FSS. We considered the structures of a microstrip planar monopole, ring type, and a cross-dipole FSS. We developed algorithms and optimization results obtained for optimized geometries of antennas and FSS considered. To validate results were designed, constructed and measured several prototypes. The measured results showed excellent agreement with the simulated. Moreover, the results obtained in this study were compared to those simulated using a commercial software has been also observed an excellent agreement. Specifically, the efficiency of techniques used were CI evidenced by simulated and measured, aiming at optimizing the bandwidth of an antenna for wideband operation or UWB (Ultra Wideband), using a genetic algorithm and optimizing the bandwidth, by specifying the length of the air gap between two frequency selective surfaces, using an optimization algorithm particle swarm

Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem

The Capacitated Centered Clustering Problem (CCCP) consists of defining a set of p groups with minimum dissimilarity on a network with n points. Demand values are associated with each point and each group has a demand capacity. The problem is well known to be NP-hard and has many practical applications. In this paper, the hybrid method Clustering Search (CS) is implemented to solve the CCCP. This method identifies promising regions of the search space by generating solutions with a metaheuristic, such as Genetic Algorithm, and clustering them into clusters that are then explored further with local search heuristics. Computational results considering instances available in the literature are presented to demonstrate the efficacy of CS. (C) 2010 Elsevier Ltd. All rights reserved.

A Strategy to Solve the Multistage Transmission Expansion Planning Problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

As Faces e os Disfaces da Informalidade no Capitalismo Conteporâneo: Um Estudo do Comércio de Rua em Pau dos Ferros/RN

This paper discusses the expression of informality in contemporary capitalism. Thematic of relevance to the analysis of the reality of work today and the logic that moves the capital, its real presence in the lives of individuals. The street trading of Pau dos Ferros town, popularly known as "street market" was chosen as the search space. The main objective is to seize and examine the articulations and logic, present in the configuration of the street trading of this city, located in the state of Rio Grande do Norte, explaining the functionality of informality for capitalist accumulation, but also for the reproduction of segments of the working class. Our analysis is based in the perspective of totality, trying to grasp the historical determinations of the phenomenon in focus. It includes the analysis of the mechanisms used by the capital to reproduce itself in the current historical context, which has been implicated in the composition of the labor markets of different countries and in various forms of exploitation to which workers in general are subject. It also means discussing the development of capitalism in Brazil, the logic that permeates its dependence, and especially the use of over-exploitation of labor, as a lever for internal accumulation. The course of investigation consisted of theoretical research to form the basis of theoretical and methodological analysis and to outline the context in which our research object is inserted, and field research conducted in two phases: systematic observation, which allowed to map traders features and the infrastructure of commerce, and the conduction of interviews with key informants. The material collected was scrutinized according to analytical scheme inspired by the content analysis. Among the main considerations developed from the research process we include: the street trading of Pau dos Ferros remains shrouded in the majority sale of agricultural products, this demonstrates the structural characteristics of the region. However, the supply of this product is no longer restricted to the excess of small local producers. The presence of the dealer changed the distribution of the product, streamlining it. In parallel, business practices are developed, practices in which traded goods (industrial) reflect the moment of capitalist restoration, a larger business network. The reflections also made it possible to show that street trading follows developing on the basis of informal work, which gains functionality to the system, as it is configured as a space commonly used to drain part of the production, of industries (clothing/shoes), especially if the distribution is considered as an essential element of the complex process that aims at capital appreciation. This activity has been functioning as a place of employment and income generation for the subjects who are away from formal employment, masking, this way, unemployment, moreover, they allow them to continue as consumers. Such expressions reflect the ability and the logic of capital to expand and aggregate into so many realities. It is underway today, the logic that has led many workers to join the project of domination of capital, by the illusory chance to become capitalists. The aim has been to turn the subject into a consumer and the worker an enterprising

A influência da redução do espaço nasofaringeano na morfologia facial de pré-adolescentes

A redução do espaço nasofaringeano devido à hipertrofia adenoideana leva a adaptações posturais da cabeça, mandíbula, língua e lábios, podendo causar alterações no padrão esquelético facial. Foram coletadas 98 teleradiografias em norma lateral de pré-adolescentes na faixa etária de 7 a 10 anos na Clínica de Ortodontia da F.O. Araraquara, as quais foram selecionadas levando-se em consideração a dimensão da imagem do espaço nasofaringeano (ENF) (correspondente à menor distância do dorso do palato mole à parede faringeana posterior). As radiografias foram divididas em 3 grupos: Grupo I (estreito), ENF entre 1,7 e 5,1mm; Grupo II (médio), ENF entre 5,2 e 7,6mm; Grupo III (amplo), ENF entre 7,7 e 12,9mm. Utilizamos duas medidas angulares e seis medidas lineares para caracterizar a morfologia facial. As médias e o desvio padrão de cada medida efetuada foram obtidas, e por meio de teste de análise de variância (ANOVA), verificou-se diferença não significativa entre os grupos para as variáveis: ANperp, p=0,07; PgNperp, p=0,058, comprimento mandibular, p=0,15, comprimento maxilar, p=0,06, diferença maxilomandibular, p=0,98, eixo facial, p=0,96, altura facial inferior, p=0,84 e significativa na variável plano mandibular (p<0,01). Portanto, a redução do espaço nasofaringeano está associada a alterações no plano mandibular, que apresentou valores maiores com a diminuição do espaço nasofaringeano.

Avaliação cefalométrica do espaço aéreo posterior em pacientes com oclusão Classe II submetidos à cirurgia ortognática

OBJETIVO: o avanço maxilomandibular é um método cirúrgico comumente usado no tratamento de pacientes acometidos pela Síndrome da Apnéia Obstrutiva do Sono (SAOS) e portadores de anormalidades anatômicas identificáveis neste complexo, que estreitam e/ou obstruem o espaço aéreo. O intuito deste estudo foi analisar variações cefalométricas do espaço aéreo faríngeo em indivíduos Classe II de Angle, após a cirurgia ortognática. METODOLOGIA: a amostra consistiu de telerradiografias laterais equivalentes aos períodos pré e pós-operatório de 30 indivíduos, divididos no grupo com avanço cirúrgico mandibular (n=15) e no grupo com avanço maxilomandibular (n=15). Os parâmetros cefalométricos usados permitiram avaliar o espaço aéreo posterior em 3 níveis: a hipofaringe (PFI-V), a orofaringe (PFM-PM, PFM-PO, PFM-U, PFM-Up) e a nasofaringe (PFM-PN, pm-PFS). A análise esquelética foi na base do crânio (N-S-Ba) e na mandíbula (Ar-Go-Me). A média das diferenças entre os valores pré e pós-operatórios das mensurações lineares (mm) e angulares (graus) foi avaliada pelo teste t pareado. RESULTADOS E CONCLUSÕES: estatisticamente, não houve redução do espaço aéreo faríngeo pós-avanço cirúrgico. O que se observou foi que apenas PFM-PO e PFS-pM se mantiveram constantes e na maioria restante os valores aumentaram.