Multi-agent system for distributed manufacturing scheduling with genetic algorithms and tabu search

Computerized scheduling methods and computerized scheduling systems according to exemplary embodiments. A computerized scheduling method may be stored in a memory and executed on one or more processors. The method may include defining a main multi-machine scheduling problem as a plurality of single machine scheduling problems; independently solving the plurality of single machine scheduling problems thereby calculating a plurality of near optimal single machine scheduling problem solutions; integrating the plurality of near optimal single machine scheduling problem solutions into a main multi-machine scheduling problem solution; and outputting the main multi-machine scheduling problem solution.

GLODS: Global and Local Optimization using Direct Search

Locating and identifying points as global minimizers is, in general, a hard and time-consuming task. Difficulties increase in the impossibility of using the derivatives of the functions defining the problem. In this work, we propose a new class of methods suited for global derivative-free constrained optimization. Using direct search of directional type, the algorithm alternates between a search step, where potentially good regions are located, and a poll step where the previously located promising regions are explored. This exploitation is made through the launching of several instances of directional direct searches, one in each of the regions of interest. Differently from a simple multistart strategy, direct searches will merge when sufficiently close. The goal is to end with as many direct searches as the number of local minimizers, which would easily allow locating the global extreme value. We describe the algorithmic structure considered, present the corresponding convergence analysis and report numerical results, showing that the proposed method is competitive with currently commonly used global derivative-free optimization solvers.

Optimization of cruciform specimens for biaxial fatigue loading with direct multi search

In order to correctly assess the biaxial fatigue material properties one must experimentally test different load conditions and stress levels. With the rise of new in-plane biaxial fatigue testing machines, using smaller and more efficient electrical motors, instead of the conventional hydraulic machines, it is necessary to reduce the specimen size and to ensure that the specimen geometry is appropriate for the load capacity installed. At the present time there are no standard specimen's geometries and the indications on literature how to design an efficient test specimen are insufficient. The main goal of this paper is to present the methodology on how to obtain an optimal cruciform specimen geometry, with thickness reduction in the gauge area, appropriate for fatigue crack initiation, as a function of the base material sheet thickness used to build the specimen. The geometry is optimized for maximum stress using several parameters, ensuring that in the gauge area the stress distributions on the loading directions are uniform and maximum with two limit phase shift loading conditions (delta = 0 degrees and (delta = 180 degrees). Therefore the fatigue damage will always initiate on the center of the specimen, avoiding failure outside this region. Using the Renard Series of preferred numbers for the base material sheet thickness as a reference, the reaming geometry parameters are optimized using a derivative-free methodology, called direct multi search (DMS) method. The final optimal geometry as a function of the base material sheet thickness is proposed, as a guide line for cruciform specimens design, and as a possible contribution for a future standard on in-plane biaxial fatigue tests

Search of intravascular hemolysis in patients with the cutaneous form of loxoscelism

Haptoglobin assay, a highly sensitive method to detect intravascular hemolysis was carried out in the sera of 19 patients referred to Hospital Vital Brazil with the cutaneous form of loxoscelism in order to investigate the occurrence of mild intravascular hemolysis. Data from this series did not show decreased levels haptoglobin, ruling out intravascular hemolysis in these patients with cutaneous form of loxoscelism.

Multilayer Perceptron Neural Networks Training Through Charged System Search and its Application for Non-Technical Losses Detection

The non-technical loss is not a problem with trivial solution or regional character and its minimization represents the guarantee of investments in product quality and maintenance of power systems, introduced by a competitive environment after the period of privatization in the national scene. In this paper, we show how to improve the training phase of a neural network-based classifier using a recently proposed meta-heuristic technique called Charged System Search, which is based on the interactions between electrically charged particles. The experiments were carried out in the context of non-technical loss in power distribution systems in a dataset obtained from a Brazilian electrical power company, and have demonstrated the robustness of the proposed technique against with several others natureinspired optimization techniques for training neural networks. Thus, it is possible to improve some applications on Smart Grids.

Coordinated Maneuver for Gradient Search Using Multiple AUV's

OCEANS 2003. Proceedings (Volume:1 )

Hybrid Maneuver for Gradient Search with Multiple Coordinated AUVs

This work presents a hybrid maneuver for gradient search with multiple AUV's. The mission consists in following a gradient field in order to locate the source of a hydrothermal vent or underwater freshwater source. The formation gradient search exploits the environment structuring by the phenomena to be studied. The ingredients for coordination are the payload data collected by each vehicle and their knowledge of the behaviour of other vehicles and detected formation distortions.

Screening for pulmonary tuberculosis in Teresópolis, RJ, Brazil: the search for respiratory symptomatic patients in emergency service of "Hospital das Clínicas de Teresópolis Costantino Ottaviano, Fundação Educacional Serra dos Órgãos"

The aim of the present study was to investigate the detection percentage of tuberculosis among patients that are respiratory symptomatic (TB suspects). In this work, we present the preliminary results of research carried out at "Hospital das Clínicas de Teresópolis Costantino Ottaviano da Fundação Educacional Serra dos Órgãos (FESO)" from November 2003 to April 2004. Among the 40 respiratory symptomatic individuals identified and referred to the Tuberculosis Control Program in Teresópolis, two (5.0%) were characterized as smear-positive. These results confirm reports in the literature and underscore the need for and importance of this strategy.

Development of an Unmanned Capsule for large-scale maritime search and rescue

This paper describes the development and testing of a robotic capsule for search and rescue operations at sea. This capsule is able to operate autonomously or remotely controlled, is transported and deployed by a larger USV into a determined disaster area and is used to carry a life raft and inflate it close to survivors in large-scale maritime disasters. The ultimate goal of this development is to endow search and rescue teams with tools that extend their operational capability in scenarios with adverse atmospheric or maritime conditions.

Active search for leprosy cases in Midwestern Brazil: a serological evaluation of asymptomatic household contacts before and after prophylaxis with bacillus Calmette-Guérin

Leprosy is a disease caused by Mycobacterium leprae that carries a high risk of disability, making early diagnosis mandatory. This study aimed to determine the applicability of anti-PGL-1 IgM antibody detection, using the ML FLOW technique, as an assistant tool for the detection of leprosy infection in asymptomatic household contacts (AHHC) of multibacillary leprosy index cases from Midwest Brazil. Serological changes induced by the prophylaxis of these household contacts with Bacillus Calmette-Guérin (BCG) were also verified. A total of 91 AHHC were assessed, among which, 18.68% (n = 17) presented both positive bacilloscopy and positive anti-PGL-1 IgM serology. Positivity concordance between these two laboratorial exams (Kappa Index = 1; p < 0.001) was indicated, however, one case did not demonstrate concordance between the semiquantitative assessment of anti-PGL-1 IgM and the bacilloscopy index (Kappa Index = 0.96; p < 0.001). Among the 17 AHHC with positive bacilloscopy, eight were reassessed after prophylaxis with BCG and two of them presented negative anti-PGL-1 IgM serology, being these patients who had presented a bacilloscopy index of < 2[+] in the initial assessment. This study shows that anti-PGL-1 IgM detection may be used as a tool to determine the bacillary load in AHHC and to detect immune changes related to prophylaxis by nonspecific vaccination.

Host-induced changes in the cell surface N-linked glycoproteins, from Aspergillus fumigatus. Search for specific targets with potential for clinical therapy and/or diagnosis.

This dissertation is presented to obtain a Master degree in Structural and Functional Biochemistry

Improving search engines with open Web-based SKOS vocabularies

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Facing unemployment after being at the top: impact, job search strategies and crucial competences

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Constraint reasoning with local search for continuous optimization

Optimization is a very important field for getting the best possible value for the optimization function. Continuous optimization is optimization over real intervals. There are many global and local search techniques. Global search techniques try to get the global optima of the optimization problem. However, local search techniques are used more since they try to find a local minimal solution within an area of the search space. In Continuous Constraint Satisfaction Problems (CCSP)s, constraints are viewed as relations between variables, and the computations are supported by interval analysis. The continuous constraint programming framework provides branch-and-prune algorithms for covering sets of solutions for the constraints with sets of interval boxes which are the Cartesian product of intervals. These algorithms begin with an initial crude cover of the feasible space (the Cartesian product of the initial variable domains) which is recursively refined by interleaving pruning and branching steps until a stopping criterion is satisfied. In this work, we try to find a convenient way to use the advantages in CCSP branchand- prune with local search of global optimization applied locally over each pruned branch of the CCSP. We apply local search techniques of continuous optimization over the pruned boxes outputted by the CCSP techniques. We mainly use steepest descent technique with different characteristics such as penalty calculation and step length. We implement two main different local search algorithms. We use “Procure”, which is a constraint reasoning and global optimization framework, to implement our techniques, then we produce and introduce our results over a set of benchmarks.