Neuroethologic differences in sleep deprivation induced by the single- and multiple-platform methods

It has been proposed that the multiple-platform method (MP) for desynchronized sleep (DS) deprivation eliminates the stress induced by social isolation and by the restriction of locomotion in the single-platform (SP) method. MP, however, induces a higher increase in plasma corticosterone and ACTH levels than SP. Since deprivation is of heuristic value to identify the functional role of this state of sleep, the objective of the present study was to determine the behavioral differences exhibited by rats during sleep deprivation induced by these two methods. All behavioral patterns exhibited by a group of 7 albino male Wistar rats submitted to 4 days of sleep deprivation by the MP method (15 platforms, spaced 150 mm apart) and by 7 other rats submitted to sleep deprivation by the SP method were recorded in order to elaborate an ethogram. The behavioral patterns were quantitated in 10 replications by naive observers using other groups of 7 rats each submitted to the same deprivation schedule. Each quantification session lasted 35 min and the behavioral patterns presented by each rat over a period of 5 min were counted. The results obtained were: a) rats submitted to the MP method changed platforms at a mean rate of 2.62 ± 1.17 platforms h-1 animal-1; b) the number of episodes of noninteractive waking patterns for the MP animals was significantly higher than that for SP animals (1077 vs 768); c) additional episodes of waking patterns (26.9 ± 18.9 episodes/session) were promoted by social interaction in MP animals; d) the cumulative number of sleep episodes observed in the MP test (311) was significantly lower (chi-square test, 1 d.f., P<0.05) than that observed in the SP test (534); e) rats submitted to the MP test did not show the well-known increase in ambulatory activity observed after the end of the SP test; f) comparison of 6 MP and 6 SP rats showed a significantly shorter latency to the onset of DS in MP rats (7.8 ± 4.3 and 29.0 ± 25.0 min, respectively; Student t-test, P<0.05). We conclude that the social interaction occurring in the MP test generates additional stress since it increases the time of forced wakefulness and reduces the time of rest promoted by synchronized sleep.

O problema de corte de estoque em indústrias de móveis de pequeno e médio portes

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

Inferência fuzzy para o problema de corte de estoque com sobras aproveitáveis de material

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

Um modelo de otimização inteira mista e heurísticas relax and fix para a programação da produção de fábricas de refrigerantes de pequeno porte

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

Um problema de programação da produção numa fundição automatizada

Este trabalho apresenta a modelagem de um problema particular de Programação da Produção numa Fundição Automatizada e sua resolução por um algoritmo de busca heurística, que explora a estrutura do problema.

Integração de modelos de localização a sistemas de informações geográficas

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

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.

Automatic identification of terpenoid skeletons by feed-forward neural networks

Feed-forward neural networks (FFNNs) were used to predict the skeletal type of molecules belonging to six classes of terpenoids. A database that contains the (13)C NMR spectra of about 5000 compounds was used to train the FFNNs. An efficient representation of the spectra was designed and the constitution of the best FFNN input vector format resorted from an heuristic approach. The latter was derived from general considerations on terpenoid structures. (c) 2006 Elsevier B.V. All rights reserved.

APPLICATIONS OF ARTIFICIAL-INTELLIGENCE IN ORGANIC-CHEMISTRY .17. NEW PROGRAMS IN THE SISTEMAT PROJECT

This work describes the new improvements of the SISTEMAT project, one system for structural elucidation mainly in the field of Natural Products Chemistry. Some examples of the resolution of problems using C-13 Nuclear Magnetic Resonance and Mass Spectroscopy are given. Programs to discover new heuristic rules for structure generation are discussed. The data base contains about 10000 C-13 NMR spectra.

Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry.

Power system transmission network expansion planning using AC model

An optimisation technique to solve transmission network expansion planning problem, using the AC model, is presented. This is a very complex mixed integer nonlinear programming problem. A constructive heuristic algorithm aimed at obtaining an excellent quality solution for this problem is presented. An interior point method is employed to solve nonlinear programming problems during the solution steps of the algorithm. Results of the tests, carried out with three electrical energy systems, show the capabilities of the method and also the viability of using the AC model to solve the problem.

Automatic absolute orientation of scanned aerial photographs

Image orientation is a basic problem in Digital Photogrammetry. While interior and relative orientations were succesfully automated, the same can not be said about absolute orientation. This process can be automated by using an approach based on relational matching and a heuristic that uses the analytical relation between straight features in the object space and its homologous in the image space. A build-in self-diagnosis is also used in this method, that is based on the implementation of data snooping statistic test in the process of spatial resection, using the Iterated Extended Kalman Filtering (IEKF). The aim of this paper is to present the basic principles of the proposed approach and results based on real data.

Tabu search algorithm for network synthesis

Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures (configurations obtained with different sets of circuit/transformer additions). The proposed parallel tabu search algorithm has shown to be effective in exploring this type of optimization landscape. The algorithm is a third generation tabu search procedure with several advanced features. This is the most comprehensive combinatorial optimization technique available for treating difficult problems such as the transmission expansion planning. The method includes features of a variety of other approaches such as heuristic search, simulated annealing and genetic algorithms. In all test cases studied there are new generation, load sites which can be connected to an existing main network: such connections may require more than one line, transformer addition, which makes the problem harder in the sense that more combinations have to be considered.

Strategy to detect ground control in digital images

The identification of ground control on photographs or images is usually carried out by a human operator, who uses his natural skills to make interpretations. In Digital Photogrammetry, which uses techniques of digital image processing extraction of ground control can be automated by using an approach based on relational matching and a heuristic that uses the analytical relation between straight features of object space and its homologous in the image space. A build-in self-diagnosis is also used in this method. It is based on implementation of data snooping statistic test in the process of spatial resection using the Iterated Extended Kalman Filtering (IEKF). The aim of this paper is to present the basic principles of the proposed approach and results based on real data.

When the Casimir energy is not a sum of zero-point energies

We compute the leading radiative correction to the Casimir force between two parallel plates in the lambdaPhi(4) theory. Dirichlet and periodic boundary conditions are considered. A heuristic approach, in which the Casimir energy is computed as the sum of one-loop corrected zero-point energies, is shown to yield incorrect results, but we show how to amend it. The technique is then used in the case of periodic boundary conditions to construct a perturbative expansion which is free of infrared singularities in the massless limit. In this case we also compute the next-to-leading order radiative correction, which turns out to be proportional to lambda(3/2).