Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Digitale Medien
    Digitale Medien
    s.l. : American Chemical Society
    Industrial & engineering chemistry 46 (1954), S. 1590-1594 
    ISSN: 1520-5045
    Quelle: ACS Legacy Archives
    Thema: Chemie und Pharmazie , Werkstoffwissenschaften, Fertigungsverfahren, Fertigung
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    s.l. : American Chemical Society
    Industrial & engineering chemistry 49 (1957), S. 1181-1186 
    ISSN: 1520-5045
    Quelle: ACS Legacy Archives
    Thema: Chemie und Pharmazie , Werkstoffwissenschaften, Fertigungsverfahren, Fertigung
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 6 (1964), S. 250-260 
    ISSN: 0945-3245
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Springer
    Psychopharmacology 144 (1999), S. 1-7 
    ISSN: 1432-2072
    Schlagwort(e): Key words Cocaine ; Startle ; Fear ; Anxiety ; Occasion-setting
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Medizin
    Notizen: Abstract   Rationale: Following cocaine withdrawal, humans may experience an abstinence syndrome with high levels of anxiety. Studying anxious behavior in animals following repeated cocaine administration may help elucidate important variables that contribute to a withdrawal syndrome. Objectives: This study investigated whether repeated cocaine pre-exposure produced lasting increases in conditioned fear as measured by fear-potentiated startle responses in rats. Methods: Startle was measured in response to 50 ms acoustic stimuli of 95, 105 and 115 dB. Cocaine (20 mg/kg, IP) or saline was administered for 7 days and after each injection rats were either placed in startle chambers for 30 min or returned to the home cage. After a 1-week cocaine-free period, most rats were given ten light-footshock pairings in the startle chamber. Fear-potentiated startle was tested by presenting acoustic startle-eliciting stimuli of 95, 105 and 115 dB in the presence or absence of the light. Rats that were not fear conditioned received acoustic stimuli one week after 7 days of 20 mg/kg cocaine. Results: Startle responses, both in the presence and absence of the light CS, were greater in fear-conditioned rats that received cocaine pre-exposure in the startle chamber than in saline pre-exposed rats. Startle responses in the presence of the light CS were further augmented at 115 dB. In contrast, home-cage exposure to cocaine did not enhance startle responses. In rats that were not fear conditioned, cocaine pre-exposure reduced acoustic startle. Conclusions: Repeated cocaine pre-exposure can increase, decrease or not change acoustic startle depending on whether fear conditioning occurred and whether cocaine was given in the testing chamber. The data suggest that cocaine pre-exposure may act as a contextually conditioned occasion setting stimulus that can facilitate anxious behavior similar to the postulated human cocaine abstinence syndrome.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 24 (1982), S. 229-232 
    ISSN: 1436-4646
    Schlagwort(e): Integer Programming ; Global Minimum ; Concave Quadratic Programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract The equivalence of zero–one integer programming and a concave quadratic penalty function problem has been shown by Raghavachari, for a sufficiently large value of the penalty. A lower bound for this penalty is obtained here, which in specific cases cannot be reduced.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 24 (1982), S. 353-355 
    ISSN: 1436-4646
    Schlagwort(e): Global Minimization ; Linear Constraints ; Quadratic Concave Function
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract A method is presented for the construction of test problems for which the global minimum point is known. Given a bounded convex polyhedron inR n , and a selected vertex, a concave quadratic function is constructed which attains its global minimum at the selected vertex. In general, this function will also have many other local minima.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Digitale Medien
    Digitale Medien
    Springer
    Computing 39 (1987), S. 281-291 
    ISSN: 1436-5057
    Schlagwort(e): 65K05 ; 90C30
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Wir schlagen einen neuen „branch and bound” Algorithmus vor, um globale Optima indefiniter quadratischer Probleme über einem Polytop zu berechnen. Unser Algorithmus benutzt separable Programmierung und Techniken der konkaven Optimierung zur näherungsweisen Berechnung von Lösungen. Ferner wird eine Fehleranalyse durchgeführt und es wird über vorläufige experimentelle Ergebnisse (auf einer Cray 1 S) berichtet.
    Notizen: Abstract A branch and bound algorithm is proposed for finding the global optimum of large-scale indefinite quadratic problems over a polytope. The algorithm uses separable programming and techniques from concave optimization to obtain approximate solutions. Results on error bounding are given and preliminary computational results using the Cray 1S supercomputer as reported.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Digitale Medien
    Digitale Medien
    Springer
    Annals of operations research 14 (1988), S. 77-104 
    ISSN: 1572-9338
    Schlagwort(e): Combinatorial Optimization ; Linear Complementarity Problem ; Mathematical Programming ; Multitasking ; Parallel Processing
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: Abstract The concept of multitasking mathematical programs is discussed, and an application of multitasking to the multiple-cost-row linear programming problem is considered. Based on this, an algorithm for solving the Linear Complementarity Problem (LCP) in parallel is presented. A variety of computational results are presented using this multitasking approach on the CRAY X-MP/48. These results were obtained for randomly generated LCP's where thenxn dense matrixM has no special properties (hence, the problem is NP-hard). based on these results, an average time performance ofO(n 4) is observed.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Digitale Medien
    Digitale Medien
    Springer
    Annals of operations research 22 (1990), S. 23-41 
    ISSN: 1572-9338
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: Abstract Many important large-scale optimization problems can be formulated as linear programs with a block-angular structure. This structure lends itself naturally to parallel solutions and is used to great advantage in the solution method described. To demonstrate the efficiency of the method, it has been implemented and computationally tested on both a shared-memory vector multiprocessor (CRAY-2) and a local-memory hypercube (NCUBE/seven) with 64 processors. Computational results for problems with as many as 24,000 rows and 74,000 columns (1,024 blocks and 1.4 million nonzero elements) are presented. A problem of this size was solved on the NCUBE in less than four minutes and the CRAY-2 in 37 seconds.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Digitale Medien
    Digitale Medien
    Springer
    Annals of operations research 25 (1990), S. VI 
    ISSN: 1572-9338
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...