ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 53 (1992), S. 323-338 
    ISSN: 1436-4646
    Keywords: Random search ; Monte Carlo optimization ; global optimization ; complexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. That is, at any iteration, the next point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. The complexity of this algorithm is measured by the expected number of iterations required to achieve a given accuracy of solution. We show that for global mathematical programs satisfying the Lipschitz condition, its complexity increases at mostlinearly in the dimension of the problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 43 (1989), S. 317-328 
    ISSN: 1436-4646
    Keywords: Random search ; Monte Carlo optimization ; convex programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 3 (1993), S. 171-192 
    ISSN: 1573-2916
    Keywords: Random search ; Monte Carlo optimization ; algorithm complexity ; global optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Improving Hit-and-Run is a random search algorithm for global optimization that at each iteration generates a candidate point for improvement that is uniformly distributed along a randomly chosen direction within the feasible region. The candidate point is accepted as the next iterate if it offers an improvement over the current iterate. We show that for positive definite quadratic programs, the expected number of function evaluations needed to arbitrarily well approximate the optimal solution is at most O(n5/2) wheren is the dimension of the problem. Improving Hit-and-Run when applied to global optimization problems can therefore be expected to converge polynomially fast as it approaches the global optimum.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Biotechnology and Bioengineering 60 (1998), S. 369-374 
    ISSN: 0006-3592
    Keywords: rotavirus ; virus-like particle ; insect cell lines ; Chemistry ; Biochemistry and Biotechnology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: When the three major structural proteins, VP2, VP6, and VP7, of rotavirus are co-expressed in insect cells infected with recombinant baculoviruses, they self-assemble into triple-layered virus-like particles (VLPs) that are similar in morphology to native rotavirus. In order to establish the most favorable conditions for the synthesis of rotavirus VLPs, we have compared the kinetics of 2/6/7-VLP synthesis in two different insect cell lines: High Five cells propagated in Excell 405 medium and Spodoptera frugiperda 9 cells in Excell 400 medium. The majority of VLPs produced in both cell lines were released into the culture medium, and these released VLPs were predominantly triple-layered and were found to be stable for the period of six or seven days examined. The optimal synthesis of VLPs depended upon the cell line and the culture medium used as well as the time of harvesting infected cell cultures. The highest yield of VLPs was obtained from High Five cultures in the late phase of infection when the yield was at least 5-fold higher than that from S. frugiperda 9 cultures on a per cell basis. Our results demonstrate the usefulness of High Five cells for the production of VLPs as potential rotavirus subunit vaccines. © 1998 John Wiley & Sons, Inc. Biotechnol Bioeng 60: 369-374, 1998.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Biotechnology and Bioengineering 17 (1975), S. 785-814 
    ISSN: 0006-3592
    Keywords: Chemistry ; Biochemistry and Biotechnology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: The metabolic fate of drugs and other xenobiotics in mammalian organisms represents an area of intense contemporary interest. Traditionally, it is a difficult area of research becausethe biological systems which are used to study biotransformations are capable of yielding only minute quantities of metabolites. Recent developments in comparative biochemistry have made itpossible to link diverse metabolic systems through similarities in the pathways by which they alter foreign organic compounds. The potential thus exists for utilizing microbial metabolic systems to study and possibly predict the metabolic fate of a drug or other foreign compound in mammals. The ease with which microbial systems may be used to obtain large amounts of metabolites is an obvious Advantage.We havhe attemped to review the ways in which mammalian and microbialorganisms metabolize a variety of organic compounds. Attention has been focused on the similarities and differences in the mechanisms by which these living systems metabolize xenobiotics. Particular emphasis has been given to four types of reactions which are important in drug biotransformations: aromatic hydroxylationl; N- and O-dealkylations; and sulfur oxygenations.
    Additional Material: 16 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    ISSN: 0173-0835
    Keywords: Chemistry ; Biochemistry and Biotechnology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Chemistry and Pharmacology
    Notes: A large-scale preparative gel electrophoresis method effectively separates individual voltage-gated calcium channel (VGCC) subunits. with high resolution, starting with up to 4 mg of rabbit skeletal muscle L-type VGCC complex. Using this method, we separated α1 and α2 subunits of rabbit skeletal muscle VGCC with a high efficiency and with protein recoveries of 83%. The separated α1 and α2 subunits eluted from the gel in a 1:1 molar ratio. The method should be applicable for separating the other VGCC subunits or subunits of other protein complexes.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...