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
Filter
  • Articles  (129)
  • Mathematics  (129)
Collection
  • Articles  (129)
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Bulletin of mathematical biology 62 (2000), S. 695-715 
    ISSN: 1522-9602
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Abstract We investigate bursting behaviour generated in an electrophysiological model of pituitary corticotrophs. The active and silent phases of this mode of bursting are generated by moving between two stable oscillatory solutions. The bursting is indirectly driven by slow modulation of the endoplasmic reticulum Ca2+ concentration. The model exhibits different modes of bursting, and we investigate mode transitions and similar modes of bursting in other Hodgkin-Huxley models. Bifurcation analysis and the use of null-surfaces facilitate a geometric interpretation of the model bursting modes and action potential generation, respectively.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 74 (1997), S. 223-238 
    ISSN: 1572-9338
    Keywords: optimal discriminant analysis ; ordered data ; statistical distribution theory ; mathematical proof
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Directional (one-tailed) two-category univariable optimal discriminant analysis has proved highly useful for applications involving ordered attributes. An important criterion in the use of this analysis for a given application is the generalized Type I error rate associated with a given level of classification accuracy. The distribution of optima arising from this analysis performed for random data had been discovered earlier, but not proven. This article presents a formal mathematical proof of this theoretical distribution for balanced applications.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 123-139 
    ISSN: 1572-9397
    Keywords: project management ; limited resources ; tabu search
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An appropriate tabu search implementation is designed to solve the resource constrained project scheduling problem. This approach uses well defined move strategies and a structured neighbourhood, defines appropriate tabu status and tenure and takes account of objective function approximation to speed up the search process. A sound understanding of the problem has helped in many ways in designing and enhancing the tabu search methodology. The method uses diversification, intensification and handles infeasibility via strategic oscillation. The above methodology is tested on existing problems from the literature and also on parametrically generated problems with encouraging results. For comparison of results, optimal solutions are used in the former and lower bounds obtained by Lagrangian heuristics are used in the latter.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Geometriae dedicata 20 (1986), S. 295-305 
    ISSN: 1572-9168
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This work is motivated by the stability problem for projection bodies of centrally symmetric convex bodies. The problem asks whether the closeness of two projection bodies implies closeness of the original bodies. Here we will give a negative answer and, in fact, work in a setting rather more general than that of the original problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Aequationes mathematicae 14 (1976), S. 293-301 
    ISSN: 1420-8903
    Keywords: Primary 62G30, 26A51 ; Secondary 26A87
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Letx 1, ⋯,x n be real numbers with∑ 1 n x j =0, |x 1 |≦|x 2 |≦⋯≦|x n |, and ∑ 1 n f(|x i |)=A〉0, wheref is a continuous, strictly increasing function on [0, ∞) withf(0)=0. Using a generalized Chebycheff inequality (or directly) it is easy to see that an upper bound for |x m | isf −1 (A/(n−m+1)). If (n−m+1) is even, this bound is best possible, but not otherwise. Best upper bounds are obtained in case (n−m+1) is odd provided either (i)f is strictly convex on [0, ∞), or (ii)f is strictly concave on [0, ∞). Explicit best bounds are given as examples of (i) and (ii), namely the casesf(x)=x p forp〉1 and 0〈p〈1 respectively.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Archiv der Mathematik 68 (1997), S. 503-513 
    ISSN: 1420-8938
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract. In a 1988 paper, Cowen found a formula expressing the adjoint of any linear fractional composition operator on the Hardy space as a product of Toeplitz operators and another linear fractional composition operator. In this paper, we use Cowen's adjoint formula to give a unitary equivalence relating composition operators on different weighted Hardy spaces. This result is then applied to some composition operators on the S a spaces. We find the spectrum of any linear fractional composition operator whose symbol has exactly one fixed point of multiplicity one on the unit circle.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Mathematische Zeitschrift 173 (1980), S. 185-194 
    ISSN: 1432-1823
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Neural computing & applications 9 (2000), S. 1-3 
    ISSN: 1433-3058
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Neural computing & applications 6 (1997), S. 187-192 
    ISSN: 1433-3058
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Neural computing & applications 6 (1997), S. 229-237 
    ISSN: 1433-3058
    Keywords: Genetic algorithms ; Mixed programming ; Simulation optimisation ; Simulation modelling ; Steelworks operation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A steelworks model is selected as representative of the stochastic and unpredictable behaviour of a complex discrete event simulation model. The steel-works has a number of different entity or object types. Using the number of each entity type as parameters, it is possible to find better and worse combinations of parameters for various management objectives. A simple real-coded genetic algorithm is presented that optimises the parameters, demonstrating the versatility that genetic algorithms offer in solving hard inverse problems.
    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...