- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 401 to 410 of 10626 (0.122 seconds)| 401 |
Creation and implementation of off-line programming for a high speed machining robotWerschmidt, Carol Louise 05 1900 (has links)
No description available.
|
| 402 |
A study of control system design and hardware selection by computerThorman, Baxter Lee 12 1900 (has links)
No description available.
|
| 403 |
A linear programming model for the analysis of traffic in a highway networkHeanue, Kevin Edward 12 1900 (has links)
No description available.
|
| 404 |
Development and application of a rational water quality planning modelDysart, Benjamin Clay 05 1900 (has links)
No description available.
|
| 405 |
Nonmonotone methods in optimization and DC optimization of location problemsZhou, Fangjun 12 1900 (has links)
No description available.
|
| 406 |
The Z8000 microprocessor software for a real-time graphics colour animation display system /Kashef, Bahram. January 1983 (has links)
No description available.
|
| 407 |
A system for interactive manipulation of tree structuresWilson, J. R. January 1984 (has links)
No description available.
|
| 408 |
Development and analysis of fast and robust Newton-type adaptation algorithmsDe Campos, Marcello Luiz Rodrigues 27 May 2015 (has links)
Graduate
|
| 409 |
Protein side-chain placement using CLPSwain, Martin T. January 2001 (has links)
Constraint logic programming (CLP) techniques can be used in protein side-chain placement, an important sub-task in comparative modelling. In a simple formulation values for domain variables represent rotamer side-chain conformations, and constraints represent atomic clashes. These constraints can be visualised using a "rotamer contact map", and observations made with this visualisation tool have been used to develop a strategy that overcomes limitations present in CLP caused by over-constrained residues. Null rotamers provide a mechanism that can automatically identify over-constrained residues. The use of null rotamers makes possible an iterative modelling strategy where, at each iteration, a CLP program is generated automatically; each program representing successively tighter packing constraints corresponding to larger atomic radii. Different CLP enumeration heuristics have been evaluated for use with this side-chain placement method, and it has been tested with several different rotamer libraries; a backbone-dependent rotamer library, when used with first-fail enumeration heuristics, was shown to be the most successful. Side-chain conformations predicted by this CLP method compare favourably against those predicted using other side-chain placement methods. The CLP method has been applied to two modelling problems. The first involved building models of class II MHC molecules in order to increase the utility of a peptide threading program. This program uses an allele's known or modelled 3D structure with a heuristic scoring function to predict peptides that are likely to bind to it - thus using CLP to model class II MHC alleles increases the program's utility. The second application used the CLP method to build structures of ribosome inactivating proteins (RIPs). These models were built using CLP together with comparative modelling approaches, and a model of bouganin, a recently identified wild RIF protein, has been built to help design engineered therapeutic proteins.
|
| 410 |
Multiple Choice Integer Programming with few constraintsKayal, N. M. W. January 1984 (has links)
No description available.
|
Page generated in 0.2931 seconds