A spectral clustering algorithm for manufacturing cell formation

A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature. (C) 2009 Elsevier Ltd. All rights reserved.

CD4+T cells from HIV-1-infected patients recognize wild-type and mutant human immunodeficiency virus-1 protease epitopes

P>Human immunodeficiency virus (HIV)-1 protease is a known target of CD8+ T cell responses, but it is the only HIV-1 protein in which no fully characterized HIV-1 protease CD4 epitopes have been identified to date. We investigated the recognition of HIV-1 protease by CD4+ T cells from 75 HIV-1-infected, protease inhibitor (PI)-treated patients, using the 5,6-carboxyfluorescein diacetate succinimidyl ester-based proliferation assay. In order to identify putative promiscuous CD4+ T cell epitopes, we used the TEPITOPE algorithm to scan the sequence of the HXB2 HIV-1 protease. Protease regions 4-23, 45-64 and 73-95 were identified; 32 sequence variants of the mentioned regions, encoding frequent PI-induced mutations and polymorphisms, were also tested. On average, each peptide bound to five of 15 tested common human leucocyte antigen D-related (HLA-DR) molecules. More than 80% of the patients displayed CD4+ as well as CD8+ T cell recognition of at least one of the protease peptides. All 35 peptides were recognized. The response was not associated with particular HLA-DR or -DQ alleles. Our results thus indicate that protease is a frequent target of CD4+ along with CD8+ proliferative T cell responses by the majority of HIV-1-infected patients under PI therapy. The frequent finding of matching CD4+ and CD8+ T cell responses to the same peptides may indicate that CD4+ T cells provide cognate T cell help for the maintenance of long-living protease-specific functional CD8+ T cells.

A simulated annealing algorithm for finding consensus sequences

Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. Results: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.

A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function

A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.

Molecular evidence for the common origin of snap-traps among carnivorous plants

The snap-trap leaves of the aquatic waterwheel plant (Aldrovanda) resemble those of Venus' flytrap (Dionaea), its distribution and habit are reminiscent of bladderworts (Utricularia), but it shares many reproductive characters with sundews (Drosera). Moreover, Aldrovanda has never been included in molecular phylogenetic studies, so it has been unclear whether snap-traps evolved only once or more than once among angiosperms. Using sequences from nuclear 18S and plastid rbcL, atpB, and matK genes, we show that Aldrovanda is sister to Dionaea, and this pair is sister to Drosera. Our results indicate that snap-traps are derived from flypaper-traps and have a common ancestry among flowering plants, despite the fact that this mechanism is used by both a terrestrial species and an aquatic one. Genetic and fossil evidence for the close relationship between these unique and threatened organisms indicate that carnivory evolved from a common ancestor within this caryophyllid clade at least 65 million years ago.

Genetic variability in cultivated common bean beyond the two major gene pools

It is generally accepted that two major gene pools exist in cultivated common bean (Phaseolus vulgaris L.), a Middle American and an Andean one. Some evidence, based on unique phaseolin morphotypes and AFLP analysis, suggests that at least one more gene pool exists in cultivated common bean. To investigate this hypothesis, 1072 accessions from a common bean core collection from the primary centres of origin, held at CIAT, were investigated. Various agronomic and morphological attributes (14 categorical and 11 quantitative) were measured. Multivariate analyses, consisting of homogeneity analysis and clustering for categorical data, clustering and ordination techniques for quantitative data and nonlinear principal component analysis for mixed data, were undertaken. The results of most analyses supported the existence of the two major gene pools. However, the analysis of categorical data of protein types showed an additional minor gene pool. The minor gene pool is designated North Andean and includes phaseolin types CH, S and T; lectin types 312, Pr, B and K; and mostly A5, A6 and A4 types alpha-amylase inhibitor. Analysis of the combined categorical data of protein types and some plant categorical data also suggested that some other germplasm with C type phaseolin are distinguished from the major gene pools.

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.

Comparação do cálculo de dose com os algoritmos Analytical Anisotropic Algorithm e Pencil Beam Convolution na patologia de pulmão

Mestrado em Radioterapia.

A genetic algorithm for the job shop scheduling with a new local search using Monte Carlo method

This paper presents a methodology for applying scheduling algorithms using Monte Carlo simulation. The methodology is based on a decision support system (DSS). The proposed methodology combines a genetic algorithm with a new local search using Monte Carlo Method. The methodology is applied to the job shop scheduling problem (JSSP). The JSSP is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. The methodology is tested on a set of standard instances taken from the literature and compared with others. The computation results validate the effectiveness of the proposed methodology. The DSS developed can be utilized in a common industrial or construction environment.

A cost study of common surface finish systems for steel structures

This paper presents part of a study aimed at finding a suitable, yet cost-effective, surface finish for a steel structure subject to the car washing environment and corrosive chemicals. The initial, life cycle and average equivalent annual (AEAC) costs for surface finishing methods were calculated for a steel structure using the LCCC algorithm developed by American Galvanizers Association (AGA). The cost study consisted of 45 common surface finish systems including: hot-dip galvanization (HDG), metallization, acrylic, alkyd and epoxy as well as duplex coatings such as epoxy zinc and inorganic zinc (IOZ). The results show that initial, life cycle and AEAC costs for hot dip galvanization are the lowest among all the other methods, followed by coal tar epoxy painting. The annual average cost of HDG for this structure was estimated about €0.22/m2, while the other cost-effective alternatives were: IOZ, polyurea, epoxy waterborne and IOZ/epoxy duplex coating.

Common symptoms of Nepalese soft contact lens wearers: A pilot study

Aim: To determine the common symptoms in current soft contact lens (CL) wearers and theirassociation with other factors among Nepalese population.Methods: All the current CL wearers who started to wear soft CL in Nepal Eye Hospital between July 2007 and June 2012 were invited for the participation. Frequency of the ten most common symptoms, divided into never, occasionally, frequently and consistent were recorded. Association between degree of symptoms with other factors, e.g. age, gender, profession, cigarette smoking, ethnicity, level of education and duration and wearing modality of CL wear were analyzed.Results: Out of 129 subjects participated in this study, 67% were female; the mean age of the subjects was 23.9 ± 4.3 years. Ninety seven percent of them had at least one symptom occasionally or frequently or consistently. Discomfort was found in 88.4% of the total subjects.Other common symptoms were foreign body sensation in 73.6%, redness in 65.9%, reduced wearing time in 63.6% and dryness in 62.8%. Symptoms were found occasionally in the majority of subjects. Degree of symptoms was not associated with age, gender, profession, education status, ethnicity of subjects and duration or modality of lens wear (p > 0.05) but was positively associated with passive cigarette smoking (p < 0.001).Conclusion: Almost all of the Nepalese soft CL wearers had some types of symptoms at least occasionally. Discomfort was the most common symptom. Degree of symptoms was associated with the passive smoking but not with other factors like age, sex, profession and duration of lens wear.

A note on parallelizing the parameterized expectations algorithm

The parameterized expectations algorithm (PEA) involves a long simulation and a nonlinear least squares (NLS) fit, both embedded in a loop. Both steps are natural candidates for parallelization. This note shows that parallelization can lead to important speedups for the PEA. I provide example code for a simple model that can serve as a template for parallelization of more interesting models, as well as a download link for an image of a bootable CD that allows creation of a cluster and execution of the example code in minutes, with no need to install any software.

Can genetic algorithms explain experimental anomalies? An application to common property resources

It is common to find in experimental data persistent oscillations in the aggregate outcomes and high levels of heterogeneity in individual behavior. Furthermore, it is not unusual to find significant deviations from aggregate Nash equilibrium predictions. In this paper, we employ an evolutionary model with boundedly rational agents to explain these findings. We use data from common property resource experiments (Casari and Plott, 2003). Instead of positing individual-specific utility functions, we model decision makers as selfish and identical. Agent interaction is simulated using an individual learning genetic algorithm, where agents have constraints in their working memory, a limited ability to maximize, and experiment with new strategies. We show that the model replicates most of the patterns that can be found in common property resource experiments.

Exome sequencing identifies DYNC2H1 mutations as a common cause of asphyxiating thoracic dystrophy (Jeune syndrome) without major polydactyly, renal or retinal involvement.

BACKGROUND: Jeune asphyxiating thoracic dystrophy (JATD) is a rare, often lethal, recessively inherited chondrodysplasia characterised by shortened ribs and long bones, sometimes accompanied by polydactyly, and renal, liver and retinal disease. Mutations in intraflagellar transport (IFT) genes cause JATD, including the IFT dynein-2 motor subunit gene DYNC2H1. Genetic heterogeneity and the large DYNC2H1 gene size have hindered JATD genetic diagnosis. AIMS AND METHODS: To determine the contribution to JATD we screened DYNC2H1 in 71 JATD patients JATD patients combining SNP mapping, Sanger sequencing and exome sequencing. RESULTS AND CONCLUSIONS: We detected 34 DYNC2H1 mutations in 29/71 (41%) patients from 19/57 families (33%), showing it as a major cause of JATD especially in Northern European patients. This included 13 early protein termination mutations (nonsense/frameshift, deletion, splice site) but no patients carried these in combination, suggesting the human phenotype is at least partly hypomorphic. In addition, 21 missense mutations were distributed across DYNC2H1 and these showed some clustering to functional domains, especially the ATP motor domain. DYNC2H1 patients largely lacked significant extra-skeletal involvement, demonstrating an important genotype-phenotype correlation in JATD. Significant variability exists in the course and severity of the thoracic phenotype, both between affected siblings with identical DYNC2H1 alleles and among individuals with different alleles, which suggests the DYNC2H1 phenotype might be subject to modifier alleles, non-genetic or epigenetic factors. Assessment of fibroblasts from patients showed accumulation of anterograde IFT proteins in the ciliary tips, confirming defects similar to patients with other retrograde IFT machinery mutations, which may be of undervalued potential for diagnostic purposes.

Expression of neuroectodermal antigens common to melanomas, gliomas, and neuroblastomas. I. Identification by monoclonal anti-melanoma and anti-glioma antibodies.

The reactivity spectrum of five different monoclonal anti-melanoma antibodies cross-reacting with gliomas and neuroblastomas and one monoclonal anti-glioma antibody cross-reacting with melanomas and neuroblastomas was investigated. Comparison of the binding activity of these monoclonal antibodies for 11 melanoma, seven glioma, and three neuroblastoma cell lines showed that each of these clones had a different pattern of cross-reactivity. The results indicated that the antigenic determinants detected by these antibodies were not associated with the same antigen and thus suggested the existence of at least six different antigens common to melanomas, gliomas, and neuroblastomas. Since all these tumors are known to derive from cells originating embryologically from the neural crest, it can be assumed that the antigens recognized by our monoclonal antibodies are neuroectodermal differentiation antigens. However, absorption with fetal brain homogenates abolished only the binding of monoclonal anti-glioma antibody, but did not modify the binding of monoclonal anti-melanoma antibodies.