Thermal tunability of photonic bandgaps in photonic crystal fibers selectively filled with nematic liquid crystal

We address the bandgap effect and the thermo-optical response of high-index liquid crystal (LC) infiltrated in photonic crystal fibers (PCF) and in hybrid photonic crystal fibers (HPCF). The PCF and HPCF consist of solid-core microstructured optical fibers with hexagonal lattice of air-holes or holes filled with LC. The HPCF is built from the PCF design by changing its cladding microstructure only in a horizontal central line by including large holes filled with high-index material. The HPCF supports propagating optical modes by two physical effects: the modified total internal reflection (mTIR) and the photonic bandgap (PBG). Nevertheless conventional PCF propagates light by the mTIR effect if holes are filled with low refractive index material or by the bandgap effect if the microstructure of holes is filled with high refractive-index material. The presence of a line of holes with high-index LC determines that low-loss optical propagation only occurs on the bandgap condition. The considered nematic liquid crystal E7 is an anisotropic uniaxial media with large thermo-optic coefficient; consequently temperature changes cause remarkable shifts in the transmission spectrums allowing thermal tunability of the bandgaps. Photonic bandgap guidance and thermally induced changes in the transmission spectrum were numerically investigated by using a computational program based on the beam propagation method. © 2010 SPIE.

Distribution system restoration in a DG environment using a heuristic constructive multi-start algorithm

This paper proposes a heuristic constructive multi-start algorithm (HCMA) to distribution system restoration in real time considering distributed generators installed in the system. The problem is modeled as nonlinear mixed integer and considers the two main goals of the restoration of distribution networks: minimizing the number of consumers without power and the number of switching. The proposed algorithm is implemented in C++ programming language and tested using a large real-life distribution system. The results show that the proposed algorithm is able to provide a set of feasible and good quality solutions in a suitable time for the problem. © 2011 IEEE.

Recepção de informações sobre meio ambiente por integrantes do Programa de Horta Comunitária de Botucatu

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

Caracterização estrutural e propriedades óticas e mecânicas do diglime polimerizado a plasma

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

Filmes finos preparados a partir da matriz vítrea a base de WO3. Propriedades e aplicações

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

Um método para determinação de pontos de operação com diversidade em linha digital de assinante usando balanceamento de espectro e algoritmo evolucionário

Este trabalho apresenta um método para encontrar um conjunto de pontos de operação, os quais são ótimos de Pareto com diversidade, para linhas digitais de assinante (DSL - digital subscriber line). Em diversos trabalhos encontrados na literatura, têm sido propostos algoritmos para otimização da transmissão de dados em linhas DSL, que fornecem como resultado apenas um ponto de operação para os modems. Esses trabalhos utilizam, em geral, algoritmos de balanceamento de espectro para resolver um problema de alocação de potência, o que difere da abordagem apresentada neste trabalho. O método proposto, chamado de diverseSB , utiliza um processo híbrido composto de um algoritmo evolucionário multiobjetivo (MOEA - multi-objective evolutionary algorithm), mais precisamente, um algoritmo genético com ordenamento por não-dominância (NSGA-II - Non-Dominated Sorting Genetic Algorithm II), e usando ainda, um algoritmo de balanceamento de espectro. Os resultados obtidos por simulações mostram que, para uma dada diversidade, o custo computacional para determinar os pontos de operação com diversidade usando o algoritmo diverseSB proposto é muito menor que métodos de busca de “força bruta”. No método proposto, o NSGA-II executa chamadas ao algoritmo de balanceamento de espectro adotado, por isso, diversos testes envolvendo o mesmo número de chamadas ao algoritmo foram realizadas com o método diverseSB proposto e o método de busca por força bruta, onde os resultados obtidos pelo método diverseSB proposto foram bem superiores do que os resultados do método de busca por força bruta. Por exemplo, o método de força bruta realizando 1600 chamadas ao algoritmo de balanceamento de espectro, obtém um conjunto de pontos de operação com diversidade semelhante ao do método diverseSB proposto com 535 chamadas.

Vespas sociais da Floresta Nacional de Caxiuanã, Melgaço, Pará: descrição da fauna numa grade de 25 Km² e compararação entre protocolos de amostragem (Hymenoptera, vespidae)

Vespas sociais destacam-se pela complexidade da organização social, pela arquitetura dos ninhos e pela importância na cadeia alimentar, como predadores de outros insetos e artrópodes. Os levantamentos faunísticos no Brasil ainda são considerados reduzidos e há carência de padronização entre protocolos de coleta, o que dificulta a comparação dos resultados obtidos. O presente trabalho consiste em estudo da fauna de vespas sociais numa parcela de floresta de terra firme em Caxiuanã, Melgaço, PA, um quadrado de 25 km² previamente demarcado com trilhas de 5000 m entrecruzadas, em formato de grade. A coleta consistiu na busca ativa por indivíduos e colônias de vespas sociais ao longo das trilhas e na instalação de armadilhas de Malaise em alguns cruzamentos de trilhas. Foram percorridas 60 trilhas e instaladas 26 armadilhas, ao longo de 44 dias descontínuos de campo. Foram registradas 65 espécies de vespas sociais pertencentes a 12 gêneros. Polybia e Mischocyttarus destacaram-se como os principais gêneros em número de espécies. Agelaia fulvofasciata e Angiopolybia pallens foram as espécies mais freqüentes. Busca ativa apresentou um melhor desempenho quanto à descoberta de espécies de vespas sociais (63) do que armadilha de Malaise (26). Dois subconjuntos de 25 amostras, cujas respectivas acumulações também resultam em totais de 63 espécies, foram obtidos através do programa DIVA-GIS, demonstrando que o resultado geral do inventário poderia em tese ser alcançado com um esforço consideravelmente menor, distribuído por toda a extensão da grade. O levantamento representou um incremento de 21 espécies à lista obtida anteriormente para Caxiuanã, totalizando 100 espécies para a região, e de dois novos registros para o estado do Pará (Polybia brunnea e Mischocyttarus vaqueroi).

Searches for light- and heavy-flavour three-jet resonances in pp collisions at root s=8 TeV

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

Characterization of a polymer-infiltrated ceramic-network material

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

Diferentes métodos de aglutinação para melhoria de processos com múltiplas respostas

Pós-graduação em Engenharia Mecânica - FEG

Dynamic Traffic Grooming Algorithms for Reconfigurable SONET Over WDM Networks

The emergence of wavelength-division multiplexing (WDM) technology provides the capability for increasing the bandwidth of synchronous optical network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add–drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom the traffic, and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently. Moreover, the traffic pattern of the optical network changes from time to time. How to develop dynamic reconfiguration algorithms for traffic grooming is an important issue. In this paper, two cases (best fit and full fit) for handling reconfigurable SONET over WDM networks are proposed. For each approach, an integer linear programming model and heuristic algorithms (TS-1 and TS-2, based on the tabu search method) are given. The results demonstrate that the TS-1 algorithm can yield better solutions but has a greater running time than the greedy algorithm for the best fit case. For the full fit case, the tabu search heuristic yields competitive results compared with an earlier simulated annealing based method and it is more stable for the dynamic case.

Survivable Traffic Grooming with Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength division multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated protection and shared protection schemes are considered. Given the network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. We first resort to the integer linear programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA) and tabu search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu search method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Query rewriting in information retrieval: automatic context extraction from local user documents to improve query results

The central objective of research in Information Retrieval (IR) is to discover new techniques to retrieve relevant information in order to satisfy an Information Need. The Information Need is satisfied when relevant information can be provided to the user. In IR, relevance is a fundamental concept which has changed over time, from popular to personal, i.e., what was considered relevant before was information for the whole population, but what is considered relevant now is specific information for each user. Hence, there is a need to connect the behavior of the system to the condition of a particular person and his social context; thereby an interdisciplinary sector called Human-Centered Computing was born. For the modern search engine, the information extracted for the individual user is crucial. According to the Personalized Search (PS), two different techniques are necessary to personalize a search: contextualization (interconnected conditions that occur in an activity), and individualization (characteristics that distinguish an individual). This movement of focus to the individual's need undermines the rigid linearity of the classical model overtaken the ``berry picking'' model which explains that the terms change thanks to the informational feedback received from the search activity introducing the concept of evolution of search terms. The development of Information Foraging theory, which observed the correlations between animal foraging and human information foraging, also contributed to this transformation through attempts to optimize the cost-benefit ratio. This thesis arose from the need to satisfy human individuality when searching for information, and it develops a synergistic collaboration between the frontiers of technological innovation and the recent advances in IR. The search method developed exploits what is relevant for the user by changing radically the way in which an Information Need is expressed, because now it is expressed through the generation of the query and its own context. As a matter of fact the method was born under the pretense to improve the quality of search by rewriting the query based on the contexts automatically generated from a local knowledge base. Furthermore, the idea of optimizing each IR system has led to develop it as a middleware of interaction between the user and the IR system. Thereby the system has just two possible actions: rewriting the query, and reordering the result. Equivalent actions to the approach was described from the PS that generally exploits information derived from analysis of user behavior, while the proposed approach exploits knowledge provided by the user. The thesis went further to generate a novel method for an assessment procedure, according to the "Cranfield paradigm", in order to evaluate this type of IR systems. The results achieved are interesting considering both the effectiveness achieved and the innovative approach undertaken together with the several applications inspired using a local knowledge base.

Multi-software modeling technique for field distribution propagation through an optical vertical interconnect assembly

Embedded siloxane polymer waveguides have shown promising results for use in optical backplanes. They exhibit high temperature stability, low optical absorption, and require common processing techniques. A challenging aspect of this technology is out-of-plane coupling of the waveguides. A multi-software approach to modeling an optical vertical interconnect (via) is proposed. This approach utilizes the beam propagation method to generate varied modal field distribution structures which are then propagated through a via model using the angular spectrum propagation technique. Simulation results show average losses between 2.5 and 4.5 dB for different initial input conditions. Certain configurations show losses of less than 3 dB and it is shown that in an input/output pair of vias, average losses per via may be lower than the targeted 3 dB.

Scheduling the factory pick-up of new cars

Car manufacturers increasingly offer delivery programs for the factory pick-up of new cars. Such a program consists of a broad range of event-marketing activities. In this paper we investigate the problem of scheduling the delivery program activities of one day such that the sum of the customers’ waiting times is minimized. We show how to model this problem as a resource-constrained project scheduling problem with nonregular objective function, and we present a relaxation-based beam-search solution heuristic. The relaxations are solved by exploiting a duality relationship between temporal scheduling and min-cost network flow problems. This approach has been developed in cooperation with a German automaker. The performance of the heuristic has been evaluated based on practical and randomly generated test instances.