A hybrid genetic algorithm for sequencing PCB component placement

A chip shooter machine for electronic components assembly has a movable feeder carrier holding components, a movable X-Y table carrying a printed circuit board (PCB), and a rotary turret having multiple assembly heads. This paper presents a hybrid genetic algorithm to optimize the sequence of component placements for a chip shooter machine. The objective of the problem is to minimize the total traveling distance of the X-Y table or the board. The genetic algorithm developed in the paper hybridizes the nearest neighbor heuristic, and an iterated swap procedure, which is a new improved heuristic. We have compared the performance of the hybrid genetic algorithm with that of the approach proposed by other researchers and have demonstrated our algorithm is superior in terms of the distance traveled by the X-Y table or the board.

DNA Mutation of the progranulin (GRN) gene in familial frontotemporal lobar degeneration (FTLD):a study of the pathology of nine cases

Frontotemporal lobar degeneration (FTLD) with transactive response (TAR) DNA-binding protein of 43kDa (TDP-43) proteinopathy (FTLD-TDP) is a neurodegenerative disease characterized by variable neocortical and allocortical atrophy principally affecting the frontal and temporal lobes. Histologically, there is neuronal loss, microvacuolation in the superficial cortical laminae, and a reactive astrocytosis. A variety of TDP-43 immunoreactive changes are present in FTLD-TDP including neuronal cytoplasmic inclusions (NCI), neuronal intranuclear inclusions (NII), dystrophic neurites (DN) and, oligodendroglial inclusions (GI). Many cases of familial FTLD-TDP are caused by DNA mutations of the progranulin (GRN) gene. Hence, the density, spatial patterns, and laminar distribution of the pathological changes were studied in nine cases of FLTD-TDP with GRN mutation. The densities of NCI and DN were greater in cases caused by GRN mutation compared with sporadic cases. In cortical regions, the commonest spatial pattern exhibited by the TDP-43 immunoreactive lesions was the presence of clusters of inclusions regularly distributed parallel to the pia mater. In approximately 50% of cortical gyri, the NCI exhibited a peak of density in the upper cortical laminae while the GI were commonly distributed across all laminae. The distribution of the NII and DN was variable, the most common pattern being a peak of NII density in the lower cortical laminae and DN in the upper cortical laminae. These results suggest in FTLD-TDP caused by GRN mutation: 1) there are greater densities of NCI and DN than in sporadic cases of the disease, 2) there is degeneration of the cortico-cortical and cortico-hippocampal pathways, and 3) cortical degeneration occurs across the cortical laminae, the various TDP-43 immunoreactive inclusions often being distributed in different cortical laminae.

Neuropathological heterogeneity in frontotemporal lobar degeneration with TDP-43 proteinopathy: a quantitative study of 94 cases using principal components analysis

Studies suggest that frontotemporal lobar degeneration with transactive response (TAR) DNA-binding protein of 43kDa (TDP-43) proteinopathy (FTLD-TDP) is heterogeneous with division into four or five subtypes. To determine the degree of heterogeneity and the validity of the subtypes, we studied neuropathological variation within the frontal and temporal lobes of 94 cases of FTLD-TDP using quantitative estimates of density and principal components analysis (PCA). A PCA based on the density of TDP-43 immunoreactive neuronal cytoplasmic inclusions (NCI), oligodendroglial inclusions (GI), neuronal intranuclear inclusions (NII), and dystrophic neurites (DN), surviving neurons, enlarged neurons (EN), and vacuolation suggested that cases were not segregated into distinct subtypes. Variation in the density of the vacuoles was the greatest source of variation between cases. A PCA based on TDP-43 pathology alone suggested that cases of FTLD-TDP with progranulin (GRN) mutation segregated to some degree. The pathological phenotype of all four subtypes overlapped but subtypes 1 and 4 were the most distinctive. Cases with coexisting motor neuron disease (MND) or hippocampal sclerosis (HS) also appeared to segregate to some extent. We suggest: 1) pathological variation in FTLD-TDP is best described as a ‘continuum’ without clearly distinct subtypes, 2) vacuolation was the single greatest source of variation and reflects the ‘stage’ of the disease, and 3) within the FTLD-TDP ‘continuum’ cases with GRN mutation and with coexisting MND or HS may have a more distinctive pathology.

SemSearch:a search engine for the semantic web

Existing semantic search tools have been primarily designed to enhance the performance of traditional search technologies but with little support for ordinary end users who are not necessarily familiar with domain specific semantic data, ontologies, or SQL-like query languages. This paper presents SemSearch, a search engine, which pays special attention to this issue by providing several means to hide the complexity of semantic search from end users and thus make it easy to use and effective.

Objective accommodative amplitude and dynamics with the 1CU accommodative intraocular lens

PURPOSE. To compare the objective accommodative amplitude and dynamics of eyes implanted with the one-compartment-unit (1CU; HumanOptics AG, Erlangen, Germany) accommodative intraocular lenses (IOLs) with that measured subjectively. METHODS. Twenty eyes with a 1CU accommodative IOL implanted were refracted and distance and near acuity measured with a logMAR (logarithm of the minimum angle of resolution) chart. The objective accommodative stimulus-response curve for static targets between 0.17 and 4.00 D accommodative demand was measured with the SRW-5000 (Shin-Nippon Commerce Inc., Tokyo, Japan) and PowerRefractor (PlusOptiX, Nürnberg, Germany) autorefractors. Continuous objective recording of dynamic accommodation was measured with the SRW-5000, with the subject viewing a target moving from 0 to 2.50 D at 0.3 Hz through a Badal lens system. Wavefront aberrometry measures (Zywave; Bausch & Lomb, Rochester, NY) were made through undilated pupils. Subjective amplitude of accommodation was measured with the RAF (Royal Air Force accommodation and vergence measurement) rule. RESULTS. Four months after implantation best-corrected acuity was -0.01 ± 0.16 logMAR at distance and 0.60 ± 0.09 logMAR at near. Objectively, the static amplitude of accommodation was 0.72 ± 0.38 D. The average dynamic amplitude of accommodation was 0.71 ± 0.47 D, with a lag behind the target of 0.50 ± 0.48 seconds. Aberrometry showed a decrease in power of the lens-eye combination from the center to the periphery in all subjects (on average, -0.38 ± 0.28 D/mm). Subjective amplitude of accommodation was 2.24 ± 0.42 D. Two years after 1CU implantation, refractive error and distance visual acuity remained relatively stable, but near visual acuity, and the subjective and objective amplitudes of accommodation decreased. CONCLUSIONS. The objective accommodating effects of the 1CU lens appear to be limited, although patients are able to track a moving target. Subjective and objective accommodation was reduced at the 2-year follow-up. The greater subjective amplitude of accommodation is likely to result from the eye's depth of focus of and the aspheric nature of the IOL. Copyright © Association for Research in Vision and Ophthalmology.

HW Implementation of a Optimized Algorithm for the Application of Active Rules in a Transition P-system

P systems or Membrane Computing are a type of a distributed, massively parallel and non deterministic system based on biological membranes. They are inspired in the way cells process chemical compounds, energy and information. These systems perform a computation through transition between two consecutive configurations. As it is well known in membrane computing, a configuration consists in a m-tuple of multisets present at any moment in the existing m regions of the system at that moment time. Transitions between two configurations are performed by using evolution rules which are in each region of the system in a non-deterministic maximally parallel manner. This work is part of an exhaustive investigation line. The final objective is to implement a HW system that evolves as it makes a transition P-system. To achieve this objective, it has been carried out a division of this generic system in several stages, each of them with concrete matters. In this paper the stage is developed by obtaining the part of the system that is in charge of the application of the active rules. To count the number of times that the active rules is applied exist different algorithms. Here, it is presents an algorithm with improved aspects: the number of necessary iterations to reach the final values is smaller than the case of applying step to step each rule. Hence, the whole process requires a minor number of steps and, therefore, the end of the process will be reached in a shorter length of time.

Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem

In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results demonstrate that the proposed algorithm has reached optimal solutions on all 20 test instances for which optimal solutions are known, and this in short computational time.

A new VRPPD model and a hybrid heuristic solution approach for e-tailing

We analyze a business model for e-supermarkets to enable multi-product sourcing capacity through co-opetition (collaborative competition). The logistics aspect of our approach is to design and execute a network system where “premium” goods are acquired from vendors at multiple locations in the supply network and delivered to customers. Our specific goals are to: (i) investigate the role of premium product offerings in creating critical mass and profit; (ii) develop a model for the multiple-pickup single-delivery vehicle routing problem in the presence of multiple vendors; and (iii) propose a hybrid solution approach. To solve the problem introduced in this paper, we develop a hybrid metaheuristic approach that uses a Genetic Algorithm for vendor selection and allocation, and a modified savings algorithm for the capacitated VRP with multiple pickup, single delivery and time windows (CVRPMPDTW). The proposed Genetic Algorithm guides the search for optimal vendor pickup location decisions, and for each generated solution in the genetic population, a corresponding CVRPMPDTW is solved using the savings algorithm. We validate our solution approach against published VRPTW solutions and also test our algorithm with Solomon instances modified for CVRPMPDTW.

Dynamic capabilities and strategic paradox: a case study

Today’s business leaders must constantly review and develop their firm’s abilities to adapt to and benefit from external changes. Dynamic capabilities are the capacity of an organization to purposefully create, extend or modify its resource base. They enable it to exploit business, technological and market opportunities and adapt to market changes, an ability more often observed in highly dynamic industries, such as consumer electronics or telecommunications. Using the case study method, this article identifies dynamic capabilities in traditional, less dynamic industries when faced with a sudden drop of revenue. Four distinct routines emerge, namely structure and practices enduring time-sensitive strategic decision-making by the tice, and a culture encouraging learning and coevolving. Seemingly strategic paradox objectives encourage the management team to question the status quo and, when managed well, transform the tensions between old and new into an ability to advance superior ideas faster.

An evaluation of coping ability as a guide to the treatment of persons diagnosed with schizophrenia and substance abuse

This dissertation introduced substance abuse to the Dynamic Vulnerability Formulation (DVF) and the social competence model to determine if the relationship between schizophrenic symptomatology and coping ability in the DVF applied also to the dually diagnosed schizophrenic or if these variables needed to be modified. It compared the coping abilities of dually and singly diagnosed clients in day treatment and identified, examined, and assessed the relative influence of relevant mediating variables on two dimensions of coping ability of the dually diagnosed: coping skills and coping effort. These variables were: presence of negative and nonnegative symptoms, duration of mental illness, type of substance used, and age of first substance use.^ A priori effect sizes based on previous empirical research were used to interpret the results related to the comparison of demographic, socioeconomic, and treatment characteristics between the singly and dually diagnosed study samples. The data suggested that the singly diagnosed group had higher coping skills than the dually diagnosed group, particularly in the areas of housing stability, work affect, and total social adjustment. The dually diagnosed group had lower scores on one aspect of coping effort--agency or self-efficacy. The data supported the presence of an inverse relationship between symptom severity and coping skills, particularly for the dually diagnosed group. The data did not support the presence of an inverse relationship between symptom severity and coping effort, but did suggest a positive relationship between symptom severity and one measure of coping effort, agency, for the dually diagnosed group. Regression equations using each summary measure of coping skill--social adjustment and role functioning--yielded statistically significant F-ratios. Thirty-six percent of the variance in social adjustment and thirty-one percent of the variance in role functioning were explained by the relative influence of the relevant variables. Both negative and non-negative symptoms were the only significant predictors of social adjustment. The non-negative symptoms variable was the sole significant predictor of role functioning. The results of this study provided partial support for the use of the Dynamic Vulnerability Formulation (DVF) with the dually diagnosed. ^

The effects of semantic and syntactic instruction on user performance and satisfaction in search user interface design

The design of interfaces to facilitate user search has become critical for search engines, ecommercesites, and intranets. This study investigated the use of targeted instructional hints to improve search by measuring the quantitative effects of users' performance and satisfaction. The effects of syntactic, semantic and exemplar search hints on user behavior were evaluated in an empirical investigation using naturalistic scenarios. Combining the three search hint components, each with two levels of intensity, in a factorial design generated eight search engine interfaces. Eighty participants participated in the study and each completed six realistic search tasks. Results revealed that the inclusion of search hints improved user effectiveness, efficiency and confidence when using the search interfaces, but with complex interactions that require specific guidelines for search interface designers. These design guidelines will allow search designers to create more effective interfaces for a variety of searchapplications.

Formulações e algoritmos para o problema das p-medianas heterogêneo livre de penalidade

This work presents a new model for the Heterogeneous p-median Problem (HPM), proposed to recover the hidden category structures present in the data provided by a sorting task procedure, a popular approach to understand heterogeneous individual’s perception of products and brands. This new model is named as the Penalty-free Heterogeneous p-median Problem (PFHPM), a single-objective version of the original problem, the HPM. The main parameter in the HPM is also eliminated, the penalty factor. It is responsible for the weighting of the objective function terms. The adjusting of this parameter controls the way that the model recovers the hidden category structures present in data, and depends on a broad knowledge of the problem. Additionally, two complementary formulations for the PFHPM are shown, both mixed integer linear programming problems. From these additional formulations lower-bounds were obtained for the PFHPM. These values were used to validate a specialized Variable Neighborhood Search (VNS) algorithm, proposed to solve the PFHPM. This algorithm provided good quality solutions for the PFHPM, solving artificial generated instances from a Monte Carlo Simulation and real data instances, even with limited computational resources. Statistical analyses presented in this work suggest that the new algorithm and model, the PFHPM, can recover more accurately the original category structures related to heterogeneous individual’s perceptions than the original model and algorithm, the HPM. Finally, an illustrative application of the PFHPM is presented, as well as some insights about some new possibilities for it, extending the new model to fuzzy environments

Algoritmos experimentais para o problema biobjetivo da árvore geradora quadrática em adjacência de arestas

The Quadratic Minimum Spanning Tree (QMST) problem is a generalization of the Minimum Spanning Tree problem in which, beyond linear costs associated to each edge, quadratic costs associated to each pair of edges must be considered. The quadratic costs are due to interaction costs between the edges. When interactions occur between adjacent edges only, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). Both QMST and AQMST are NP-hard and model a number of real world applications involving infrastructure networks design. Linear and quadratic costs are summed in the mono-objective versions of the problems. However, real world applications often deal with conflicting objectives. In those cases, considering linear and quadratic costs separately is more appropriate and multi-objective optimization provides a more realistic modelling. Exact and heuristic algorithms are investigated in this work for the Bi-objective Adjacent Only Quadratic Spanning Tree Problem. The following techniques are proposed: backtracking, branch-and-bound, Pareto Local Search, Greedy Randomized Adaptive Search Procedure, Simulated Annealing, NSGA-II, Transgenetic Algorithm, Particle Swarm Optimization and a hybridization of the Transgenetic Algorithm with the MOEA-D technique. Pareto compliant quality indicators are used to compare the algorithms on a set of benchmark instances proposed in literature.

Algoritmos experimentais para o problema biobjetivo da árvore geradora quadrática em adjacência de arestas

The Quadratic Minimum Spanning Tree (QMST) problem is a generalization of the Minimum Spanning Tree problem in which, beyond linear costs associated to each edge, quadratic costs associated to each pair of edges must be considered. The quadratic costs are due to interaction costs between the edges. When interactions occur between adjacent edges only, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). Both QMST and AQMST are NP-hard and model a number of real world applications involving infrastructure networks design. Linear and quadratic costs are summed in the mono-objective versions of the problems. However, real world applications often deal with conflicting objectives. In those cases, considering linear and quadratic costs separately is more appropriate and multi-objective optimization provides a more realistic modelling. Exact and heuristic algorithms are investigated in this work for the Bi-objective Adjacent Only Quadratic Spanning Tree Problem. The following techniques are proposed: backtracking, branch-and-bound, Pareto Local Search, Greedy Randomized Adaptive Search Procedure, Simulated Annealing, NSGA-II, Transgenetic Algorithm, Particle Swarm Optimization and a hybridization of the Transgenetic Algorithm with the MOEA-D technique. Pareto compliant quality indicators are used to compare the algorithms on a set of benchmark instances proposed in literature.

Estratégia de navegação com planejamento dinâmico e algoritmo genético aplicada a robôs móveis terrestres

This work proposes a new autonomous navigation strategy assisted by genetic algorithm with dynamic planning for terrestrial mobile robots, called DPNA-GA (Dynamic Planning Navigation Algorithm optimized with Genetic Algorithm). The strategy was applied in environments - both static and dynamic - in which the location and shape of the obstacles is not known in advance. In each shift event, a control algorithm minimizes the distance between the robot and the object and maximizes the distance from the obstacles, rescheduling the route. Using a spatial location sensor and a set of distance sensors, the proposed navigation strategy is able to dynamically plan optimal collision-free paths. Simulations performed in different environments demonstrated that the technique provides a high degree of flexibility and robustness. For this, there were applied several variations of genetic parameters such as: crossing rate, population size, among others. Finally, the simulation results successfully demonstrate the effectiveness and robustness of DPNA-GA technique, validating it for real applications in terrestrial mobile robots.