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
    Computing 25 (1980), S. 379-386 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir stellen einen neuen Algorithmus zum Lösen von Systemen nichtlinearer Ungleichungen vor, der eine Kombination des sequentiellen Sekantenverfahrens mit dem Broydenschen Quasi-Newton-Verfahren mit projizierten Korrekturen ist, wie es von Gay und Schnabel vorgeschlagen worden ist. Der neue Algorithmus hat die Konvergenzordnung des sequentiellen Sekantenverfahrens, und die Wahl der ersten Inkremente ist durch das Prinzip der minimalen Variation bei Quasi-Newton-Verfahren gerechtfertigt. Zwei Fassungen des Verfahrens werden an einigen bekannten Testproblemen numerisch verglichen.
    Notes: Abstract We introduce a new algorithm for solving nonlinear simultaneous equations, which is a combination of the sequential secant method with Broyden's Quasi-Newton method with projected updates as introduced by Gay and Schnabel. The new algorithm has the order of convergence of the sequential secant method and the choice of the first increments is justified by the minimum variation principles of Quasi-Newton methods. Two versions of the method are compared numerically with some well-known test problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Computing 33 (1984), S. 353-362 
    ISSN: 1436-5057
    Keywords: 65H10 ; Nonlinear systems ; Quasi-Newton methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir stellen ein neues Quasi-Newton-Verfahren vor zur Lösung von nichtlinearen simultanen Gleichungen. Bei jeder Iteration wird lediglich eine Spalte vonB k verändert, umB k+1 zu erhalten. Dies erlaubt, wohlbekannte Techniken der Linearen Programmierung zur Faktorisierung vonB k zu benützen. Wir beweisen einen Satz über die lokale Konvergenz für die Methode. Der neue Algorithmus wird mit anderen bezüglich seiner numerischen Eigenschaften verglichen.
    Notes: Abstract In this paper we introduce a new Quasi-Newton method for solving nonlinear simultaneous equations. At each iteration only one column ofB k is changed to obtainB k+1 . This permits to use the well-known techniques of Linear Programming for modifying the factorization ofB k . We present a local convergence theorem for a restarted version of the method. The new algorithm is compared numerically with some other methods which were introduced for solving the same kind of problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 47 (1983), S. 33-41 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract A recurrent excitation loop was constructed by enabling each impulse from the slowly adapting stretch receptor organ SAO (crayfish) to trigger through an electronic circuit a brief stretch, or “tug,” of the receptor. When applied independently, each tug influenced the discharge as would an EPSP. Recurrent excitation led to characteristic discharge timings; hence, even an isolated neuron can have intrinsic mechanisms that prevent positive feedback from freezing it in an extreme non-operational state. Such timings depended critically on the “phase”, i.e., on the time elapsed between an SAO impulse and the tug. When the control discharge was stationary (because the SAO length remained invariant), phases of a few ms simply changed the pattern to one of doublets, and affected little the average rate. As the phase increased, bursts appeared, bursts and interburst intervals became more prolonged, and average rates increased. With the largest phases examined (40 ms), the discharge consisted of a slow alternation of high rate bursts, separated by long intervals. When the discharge was modulated (by 0.2/s sinusoidal length variation) with recurrent excitation, the peak-to-peak rate swing, i.e., the sensitivity, and the proportion of the cycle without afferent discharges increased, and the rate vs. length display was distorted even though remaining “loop-plus-extension.” Changes were phase-dependent: for example, loops could have a sharp high peak at one phase and be flat-topped at another. When the interspike interval variability was exaggerated (by a length jitter superimposed upon either invariant or sinusoidally varying lengths), recurrent excitation exerted fewer, weaker and somewhat different effects: e.g., it reduced the overall intensity of the invariant cases and the peak-to-peak swing in the modulated one. The precise mechanisms of these results can only be conjectured at but are likely to involve an electrogenic pump, electromechanical interactions, topographical issues, as well as their interplays. The functional implications involve, for instance, the modulation of the intensity, duration and occurrence of the bursting patterns in oscillating functions (e.g., breathing, chewing, etc.).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The correspondence between afferent discharges and sinusoidal length modulations (0.2–10 cps, under 10% of the natural length variations) was studied in isolated fast-adapting stretch receptor organs (FAO) of crayfish, largely using average displays of rate vs. length (or derivatives) along the cycle. Rate modulations were greatest during early cycles and then stabilized, an initial adjustment remindful of mechanical preconditioning. Responses to stimulation in the FAO, as in the slowly-adapting organs (SAO) and possibly other receptors, exhibit the following features, all striking because of their magnitude and ubiquity. i) A zig-zag overall afferent rate vs. stimulus frequency graph with positively and negatively sloped segments. This precludes the straighforward use of Bode plots. ii) Marked non-linearities as an obvious stimulus-response locking in the positively sloped segments, a double-valuedness with one rate while stretching and another while shortening, a lower-limit saturation with the receptor silent for more than half a cycle, and an asymmetric rate sensitivity. iii) Clear-cut discharge leads relative to the stimulus at low frequencies and lags at high ones. The FAO responds worse than the SAO to low frequencies, and better to high ones; it is locked 1-to-1 in a much broader range (e.g., 3–100 vs. 1–3 cps). All features were strongly frequency-dependent. With higher frequencies: i) the number of impulses per cycle fell from several to just one and finally to one every several cycles at higher values; ii) the two values of each length approached one another usually but not always; iii) the silent proportion of the cycle increased; and iv) the rate sensitivity changed. Each feature can arise in principle at any of the transduction stages from length to discharge: the mechanical transduction from length to dendritic deformation, and the encoder one from generator potentials to discharges are particularly likely candidates.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Acta informatica 17 (1982), S. 101-120 
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary The design and evaluation of a prepaging technique is presented. It consists in the preloading, at instants at which page-faults occur, of those pages whose use in the future is the most likely. These pages are determined as a function of an a-priori knowledge of program behavior. We shall first present two tools for predicting that behavior. The first is based on a Markov memory reference transition model, the second on a semi-Markov model of page-fault transitions. Both methods are successively experimented by a paging algorithm allowing prepaging. Experimentation shows that prepaging can significantly improve the performance of the paging algorithm, especially when the prediction is based on the transitions between page-faults. The sensitivity of prepaging performance to various working conditions is tested. Implementation of prepaging is examined and is shown to be feasible without the use of special hardware devices. The study is completed by an evaluation of the influence of prepaging on global system performance. Some common cases of system architecture experimentation show a non-negligible increase in CPU utilization.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Publication Date: 1984-09-01
    Print ISSN: 0010-485X
    Electronic ISSN: 1436-5057
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Publication Date: 1980-12-01
    Print ISSN: 0010-485X
    Electronic ISSN: 1436-5057
    Topics: Computer Science
    Published by Springer
    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...