Library

X
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
    Influence of Cannabinoids on Electrically Evoked Dopamine Release and Cyclic AMP Generation in the Rat Striatum (1997)
    Oxford, UK : Blackwell Science Ltd
    Journal of neurochemistry 69 (1997), S. 0 
    Details
    ISSN: 1471-4159
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Medicine
    Notes: Abstract: Using the endogenous cannabinoid receptor agonist anandamide, the synthetic agonist CP 55940 {[1α,2β(R)5α]-(−)-5-(1,1-dimethylheptyl)-2-[5-hydroxy-2-(3-hydroxypropyl)cyclohexyl]phenol}, and the specific antagonist SR 141716 [N-(piperidin-1-yl)-5-(4-chlorophenyl)-1-(2,4-dichlorophenyl)-4-methyl-1H-pyrazole-3-carboxamide hydrochloride], second messenger activation of the central cannabinoid receptor (CB1) was examined in rat striatal and cortical slices. The effects of these cannabinoid ligands on electrically evoked dopamine (DA) release from [3H]dopamine-prelabelled striatal slices were also investigated. CP 55940 (1 µM) and anandamide (10 µM) caused significant reductions in forskolin-stimulated cyclic AMP accumulation in rat striatal slices, which were reversed in the presence of SR 141716 (1 µM). CP 55940 (1 µM) had no effect on either KCl- or neurotransmitter-stimulated 3H-inositol phosphate accumulation in rat cortical slices. CP 55940 and anandamide caused significant reductions in the release of dopamine after electrical stimulation of [3H]dopamine-prelabelled striatal slices, which were antagonised by SR 141716. SR 141716 alone had no effect on electrically evoked dopamine release from rat striatal slices. These data indicate that the CB1 receptors in rat striatum are negatively linked to adenylyl cyclase and dopamine release. That the CB1 receptor may influence dopamine release in the striatum suggests that cannabinoids play a modulatory role in dopaminergic neuronal pathways.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1046/j.1471-4159.1997.69031131.x
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Resolving degeneracy in combinatorial linear programs: Steepest edge, steepest ascent, and parametric ascent (1995)
    Springer
    Mathematical programming 68 (1995), S. 155-168 
    Details
    ISSN: 1436-4646
    Keywords: Linear programming degeneracy ; Pivot rules
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract While variants of the steepest edge pivot rule are commonly used in linear programming codes they are not known to have the theoretically attractive property of avoiding an infinite sequence of pivots at points of degeneracy. An example is presented demonstrating that the steepest edge pivot rule can fail to terminate finitely. It is then shown that a natural extension of the steepest edge pivot rule based on steepest ascent is guaranteed to determine a direction of ascent or a proof that no such direction exists after a finite number of pivots, although without modification the extension may not terminate with an ascent direction corresponding to an edge. Finally, it is demonstrated that a computationally more efficient pivot rule proposed by Magnanti and Orlin has similar theoretical properties to steepest ascent with probability 1independent of the linear program being solved. Unlike alternative methods such as primal lexicographic rules and Bland's rule, the algorithms described here have the advantage that they choose the pivot element without explicit knowledge of the set of all active constraints at a point of degeneracy, thus making them attractive in combinatorial settings where the linear program is represented implicitly.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01585762
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Cutting planes for mixed-integer knapsack polyhedra (1998)
    Springer
    Mathematical programming 81 (1998), S. 257-262 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm for generating cutting planes for mixed-integer knapsack polyhedra is described. The algorithm represents an exact separation procedure and is based on a general methodology proposed by one of the authors in an earlier paper. Computational results are presented. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581108
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Book
    Book
    Integer programming and combinatorial optimization; 6th international IPCO conference, Houston, Texas, June 1998, proceedings; 1412 (1998)
    Berlin u.a. :Springer,
    Details
    Title: Integer programming and combinatorial optimization; 6th international IPCO conference, Houston, Texas, June 1998, proceedings; 1412
    Contributer: Bixby, Robert E. , Boyd, E. Andrew , Rios-Mercado, Roger Z.
    Publisher: Berlin u.a. :Springer,
    Year of publication: 1998
    Pages: 435 S.
    Series Statement: Lecture notes in computer science 1412
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...