Library

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
    Amsterdam : Elsevier
    Journal of Computational Physics 15 (1974), S. 117-133 
    ISSN: 0021-9991
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Computer Science , Physics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Neurological sciences 14 (1993), S. 129-137 
    ISSN: 1590-3478
    Keywords: Anticoagulants ; antiphospholipid antibodies
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Description / Table of Contents: Sommario Gli anticorpi antifosfolipidi sono immunoglobuline circolanti acquisite che interagiscono con i fosfolipidi. Questi fattori, in vitro, possono manifestare proprietà anticoagulanti interferendo con i test della coagulazione fosfolipidi-dipendenti. Tali anticorpi non sono tuttavia associati a diatesi emorragica. Infatti, contrariamente alle loro proprietà anticoagulanti in vitro, essi sono correlati ad episodi tromboembolici sistemici e cerebrali. Vengono descritti i reperti clinici e strumentali osservati in sette pazienti con ictus ischemico ed anticorpi antifosfolipidi in circolo, inquadrabili nella sindrome da anticorpi antifosfolipidi.
    Notes: Abstract Antiphospholipid antibodies are acquired circulating immunoglobulins that interact with phospholipids. These factors may manifest anticoagulant properties in vitro, interfering with phospholipid-dependent coagulation tests. They are not, however, associated with a hemorrhagic diathesis. Indeed, far from exerting the anticoagulant properties they possess in vitro, they are associated with episodes of thromboembolism, systemic and cerebral. We report the clinical and instrumental findings in 7 patients with ischemic stroke and circulating antiphospholipid antibodies classifiable as antiphospholipid antibodies syndrome.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    European journal of clinical microbiology & infectious diseases 15 (1996), S. 50-59 
    ISSN: 1435-4373
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Abstract In a study designed to gain data on the in vitro transferability of vancomycin resistance from enterococci of the VanA phenotype to listeriae of different species, three clinicalEnterococcus isolates —Enterococcus faecium LS10,Enterococcus faecalis LS4, andEnterococcus faecalis A3208, all harboring a plasmid that strongly hybridized with avanA probe — were used as donors in transfer experiments. Strains of fiveListeria species were used as recipients. FromEnterococcus faecium LS10, glycopeptide resistance was transferred toListeria monocytogenes, Listeria ivanovii, andListeria welshimeri recipients, whereas no transfer occurred toListeria seeligeri orListeria innocua strains. From the twoEnterococcus faecalis isolates, no transfer occurred to anyListeria recipient. MICs of both vancomycin and teicoplanin were ≥256 mg/l for all transconjugants tested. Furthermore, all transconjugants harbored a plasmid that strongly hybridized with thevanA probe, withvanA consistently located in anEcoRI fragment of about 4 kb. Exposure ofListeria transconjugants to vancomycin resulted in synthesis of a membrane protein similar in size (39 kDa) to a vancomycin-induced membrane protein ofEnterococcus faecium LS10. In retransfer experiments withListeria transconjugants used as donors, glycopeptide resistance was transferred to allListeria recipients tested, including strains ofListeria innocua andListeria seeligeri, which were unable to receive the resistance fromEnterococcus faecium LS10. The frequency ofvanA transfer to listerial recipients was greater in retransfer experiments than in the primary matings. These findings suggest that thevanA resistance determinant might spread to the established pathogenListeria monocytogenes, both directly from a resistant enterococcus and through strains of nonpathogenicListeria species acting as intermediate resistance vehicles.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 53 (1987), S. 181-217 
    ISSN: 1573-2878
    Keywords: Flight mechanics ; take-off ; windshear problems ; optimal trajectories ; guidance strategies ; piloting techniques ; feedback control ; gamma guidance ; simplified gamma guidance ; quick transition to horizontal flight
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper is concerned with guidance strategies and piloting techniques which ensure near-optimum performance and maximum survival capability in a severe windshear. The take-off problem is considered with reference to flight in a vertical plane. In addition to the horizontal shear, the presence of a downdraft is assumed. First, six particular guidance schemes are considered, namely: constant alpha guidance; maximum alpha guidance; constant velocity guidance; constant absolute path inclination guidance; constant rate of climb guidance; and constant pitch guidance. Among these, it is concluded that the best one is the constant pitch guidance. Next, in an effort to improve over the constant pitch guidance, three additional trajectories are considered: the optimal trajectory, which minimizes the maximum deviation of the absolute path inclination from a reference value, while employing global information on the wind flow field; the gamma guidance trajectory, which is based on the absolute path inclination and which approximates the behavior of the optimal trajectory, while employing local information on the windshear and the downdraft; and the simplified gamma guidance trajectory, which is the limiting case of the gamma guidance trajectory in a severe windshear and which does not require precise information on the windshear and the downdraft. The essence of the simplified gamma guidance trajectory is that it yields a quick transition to horizontal flight. Comparative numerical experiments show that the survival capability of the simplified gamma guidance trajectory is superior to that of the constant pitch trajectory and is close to that of the optimal trajectory. Next, with reference to the simplified gamma guidance trajectory, the effect of the feedback gain coefficient is studied. It is shown that larger values of the gain coefficient improve the survival capability in a severe windshear; however, excessive values of the gain coefficient are undesirable, because they result in larger altitude oscillations and lower average altitude. Finally, with reference to the simplified gamma guidance trajectory, the effect of time delays is studied, more specifically, the time delay τ1 in reacting to windshear onset and the time delay τ2 in reacting to windshear termination. While time delay τ2 has little effect on survival capability, time delay τ1 appears to be critical in the following sense: smaller values of τ1 correspond to better survival capability in a severe windshear, while larger values of τ1 are associated with a worsening of the survival capability in a severe windshear.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 3 (1969), S. 459-470 
    ISSN: 1573-2878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A new accelerated gradient method for finding the minimum of a functionf(x) whose variables are unconstrained is investigated. The new algorithm can be stated as follows: $$\tilde x = x + \delta x,\delta x = - \alpha g(x) + \beta \delta \hat x$$ where δx is the change in the position vectorx, g(x) is the gradient of the functionf(x), and α and β are scalars chosen at each step so as to yield the greatest decrease in the function. The symbol $$\delta \hat x$$ denotes the change in the position vector for the iteration preceding that under consideration. For a nonquadratic function, initial convergence of the present method is faster than that of the Fletcher-Reeves method because of the extra degree of freedom available. For a test problem, the number of iterations was about 40–50% that of the Fletcher-Reeves method and the computing time about 60–75% that of the Fletcher-Reeves method, using comparable search techniques.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 32 (1980), S. 397-398 
    ISSN: 1573-2878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 32 (1980), S. 577-593 
    ISSN: 1573-2878
    Keywords: Numerical methods ; computing methods ; optimal control ; optimality properties ; supplementary optimality properties ; gradient methods ; gradient-restoration algorithms ; sequential gradient-restoration algorithms ; general boundary conditions ; nondifferential constraints
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, sequential gradient-restoration algorithms for optimal control problems are considered, and attention is focused on the gradient phase. It is shown that the Lagrange multipliers associated with the gradient phase not only solve the auxiliary minimization problem of the gradient phase, but are also endowed with a supplementary optimality property: they minimize the error in the optimality conditions, subject to the multiplier differential equations and boundary conditions, for given state, control, and parameter.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 38 (1982), S. 111-135 
    ISSN: 1573-2878
    Keywords: Minimax problems ; minimax function ; minimax function depending on the state ; minimax function depending on the control ; optimal control ; minimax optimal control ; numerical methods ; computing methods ; transformation techniques ; gradient-restoration algorithms ; sequential gradient-restoration algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In a previous paper (Part 1), we presented general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We considered two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P). In this paper, the transformation techniques presented in Part 1 are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer. Both the single-subarc approach and the multiple-subarc approach are employed. Three test problems characterized by known analytical solutions are solved numerically. It is found that the combination of transformation techniques and sequential gradient-restoration algorithm yields numerical solutions which are quite close to the analytical solutions from the point of view of the minimax performance index. The relative differences between the numerical values and the analytical values of the minimax performance index are of order 10−3 if the single-subarc approach is employed. These relative differences are of order 10−4 or better if the multiple-subarc approach is employed.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 38 (1982), S. 97-109 
    ISSN: 1573-2878
    Keywords: Minimax problems ; minimax function ; minimax function depending on the state ; minimax function depending on the control ; optimal control ; minimax optimal control ; numerical methods ; computing methods ; transformation techniques ; gradient-restoration algorithms ; sequential gradient-restoration algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper contains general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We consider two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P). For Problem (Q), we exploit the analogy with a bounded-state problem in combination with a transformation of the Jacobson type. This requires the proper augmentation of the state vectorx(t), the control vectoru(t), and the parameter vector π, as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized. For Problem (R), we exploit the analogy with a bounded-control problem in combination with a transformation of the Valentine type. This requires the proper augmentation of the control vectoru(t) and the parameter vector π, as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized. In a subsequent paper (Part 2), the transformation techniques presented here are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer; both the single-subarc approach and the multiple-subarc approach are discussed.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 4 (1969), S. 213-243 
    ISSN: 1573-2878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The problem of minimizing a functionf(x) subject to the constraint ϕ(x)=0 is considered. Here,f is a scalar,x ann-vector, and ϕ aq-vector. Asequential algorithm is presented, composed of the alternate succession of gradient phases and restoration phases. In thegradient phase, a nominal pointx satisfying the constraint is assumed; a displacement Δx leading from pointx to a varied pointy is determined such that the value of the function is reduced. The determination of the displacement Δx incorporates information at only pointx for theordinary gradient version of the method (Part 1) and information at both pointsx and $$\hat x$$ for theconjugate gradient version of the method (Part 2). In therestoration phase, a nominal pointy not satisfying the constraint is assumed; a displacement Δy leading from pointy to a varied point $$\tilde x$$ is determined such that the constraint is restored to a prescribed degree of accuracy. The restoration is done by requiring the least-square change of the coordinates. If the stepsize α of the gradient phase is ofO(ε), then Δx=O(ε) and Δy=O(ε2). For ε sufficiently small, the restoration phase preserves the descent property of the gradient phase: the functionf decreases between any two successive restoration phases.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...