780 resultados para Bound Algorithm
Resumo:
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.
Resumo:
Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.
Resumo:
Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.
Resumo:
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.
Resumo:
An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.
Resumo:
CD133 antigen is an integral membrane glycoprotein that can bind with different cells. Originally, however. this cellular surface antigen was expressed in human stem cells and in various cellular progenitors of the haematopoietic system. Human cord blood has been described as an excellent source of CD133(+) haematopoietic progenitor cells with a large application potential. One of the main objectives of the present study is to describe for the first time the ultrastructural characteristics of CD133(+) stem cells using transmission electronic microscopy. Another objective of the manuscript is to demonstrate through transmission electronic microscopy the molecular image of magnetic nanoparticles connected to the stein cells of great biotechnological importance, as well as demonstrating the value of this finding for electronic paramagnetic resonance and its related nanobioscientific value. Ultrastructural results showed the monoclonal antibody anti-CD133 bound to the superparamagnetic nanoparticles by the presence of electrondense granules in cell membrane, as well as in the cytoplasm, revealing the ultrastructural characteristics of CD133(+) cells, exhibiting a round morphology with discrete cytoplasmic projections, having an active nucleus that follows this morphology. The cellular cytoplasm was filled up with mitochondrias, as well as microtubules and vesicles pinocitic. characterizing the process as being related to internalization of the magnetic nanoparticles that were endocyted by the cells in question. Electronic paramagnetic resonance analysis of the CD133(+) stem cells detected that the small (spectrum) generated by the labelled cells comes from the superparamagnetic nanoparticles that are bound to them. These results strongly suggest that these CD133(+) cells can be used in nanobiotechnology applications, with benefits in different biomedical areas.
Resumo:
The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.
Resumo:
We propose a simulated-annealing-based genetic algorithm for solving model parameter estimation problems. The algorithm incorporates advantages of both genetic algorithms and simulated annealing. Tests on computer-generated synthetic data that closely resemble optical constants of a metal were performed to compare the efficiency of plain genetic algorithms against the simulated-annealing-based genetic algorithms. These tests assess the ability of the algorithms to and the global minimum and the accuracy of values obtained for model parameters. Finally, the algorithm with the best performance is used to fit the model dielectric function to data for platinum and aluminum. (C) 1997 Optical Society of America.
Resumo:
SUBPOPULATIONS of olfactory receptor neurons, which are dispersed throughout the olfactory neuroepithelium, express specific cell surface carbohydrates and project to discrete regions of the olfactory bulb. Cell surface carbohydrates such as N-acetyl-lactosamine have been postulated to mediate sorting and selective fasciculation of discrete axon subpopulations during development of the olfactory pathway. Substrate-bound N-acetyl-lactosamine promotes neurite outgrowth by both clonal olfactory receptor neuron cell lines and olfactory receptor neurons in vitro, indicating that cell surface carbohydrates may be ligands for receptor-mediated stimulation of axon growth in vivo. In the present study, the role of transmembrane signaling in N-acetyl-lactosamine-stimulated neurite outgrowth was examined in the clonal olfactory neuron cell line 4.4.2. Substrate-bound N-acetyl-lactosamine stimulated neurite outgrowth which was specifically inhibited by antagonists to N- and L-type calcium channels and to tyrosine kinase phosphorylation. These results indicate that N-acetyl-lactosamine can evoke transmembrane receptor-mediated responses capable of influencing neurite outgrowth.
Resumo:
Background: Although various techniques have been used for breast conservation surgery reconstruction, there are few studies describing a logical approach to reconstruction of these defects. The objectives of this study were to establish a classification system for partial breast defects and to develop a reconstructive algorithm. Methods: The authors reviewed a 7-year experience with 209 immediate breast conservation surgery reconstructions. Mean follow-up was 31 months. Type I defects include tissue resection in smaller breasts (bra size A/B), including type IA, which involves minimal defects that do not cause distortion; type III, which involves moderate defects that cause moderate distortion; and type IC, which involves large defects that cause significant deformities. Type II includes tissue resection in medium-sized breasts with or without ptosis (bra size C), and type III includes tissue resection in large breasts with ptosis (bra size D). Results: Eighteen percent of patients presented type I, where a lateral thoracodorsal flap and a latissimus dorsi flap were performed in 68 percent. Forty-five percent presented type II defects, where bilateral mastopexy was performed in 52 percent. Thirty-seven percent of patients presented type III distortion, where bilateral reduction mammaplasty was performed in 67 percent. Thirty-five percent of patients presented complications, and most were minor. Conclusions: An algorithm based on breast size in relation to tumor location and extension of resection can be followed to determine the best approach to reconstruction. The authors` results have demonstrated that the complications were similar to those in other clinical series. Success depends on patient selection, coordinated planning with the oncologic surgeon, and careful intraoperative management.
Resumo:
In rabbit ligated ileal loops, two atypical enteropathogenic Escherichia coli (aEPEC) strains, 3991-1 and 0421-1, intimately associated with the cell membrane, forming the characteristic EPEC attachment and effacement lesion of the brush border, induced a mucous hypersecretion, whereas typical EPEC (tEPEC) strain E2348/69 did not. Using cultured human mucin-secreting intestinal HT29-MTX cells, we demonstrate that apically aEPEC infection is followed by increased production of secreted MUC2 and MUC5AC mucins and membrane-bound MUC3 and MUC4 mucins. The transcription of the MUC5AC and MUC4 genes was transiently upregulated after aEPEC infection. We provide evidence that the apically adhering aEPEC cells exploit the mucins` increased production since they grew in the presence of membrane-bound mucins, whereas tEPEC did not. The data described herein report a putative new virulence phenomenon in aEPEC.
Resumo:
The effect of FBP on folate bio-availability depends on its environment. The FBP of whole WPC enhances bioavailability of folates more than does purified FBP and its efficacy might be even greater when lipids are removed from the WPC. FBP polymerises and folate release from the polymer is found to be slower than that from the monomer. FBP has a role also as a folate receptor at cell surfaces and in this role folate binding increases polymerisation of FBP attached to lipid membranes.