ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (6,945)
  • 1980-1984  (6,945)
  • 1981  (6,945)
  • Computer Science  (6,945)
Collection
  • Articles  (6,945)
Years
  • 1980-1984  (6,945)
Year
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 39 (1981), S. 195-209 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The stimulus-event relation of single units in the auditory midbrain area, the torus semicircularis, of the anaesthetized grassfrog (Rana temporaria L.) during stimulation with a wide ensemble of natural stimuli, was analysed using first and second order statistical analysis techniques. The average stimulus preceding the occurrence of action potentials, in general, did not prove to give very informative results. The second order procedure consisted in the determination of the average dynamic power spectrum of the pre-event stimuli, following procedures as described elsewhere (Aertsen and Johannesma, 1980; Aertsen et al., 1980). The outcome of this analysis was filtered with the overall power spectrum of the complete stimulus ensemble in order to correct for its non-uniform spectral composition. The “stimulus-filtered” average pre-event dynamic spectrum gives a first indication of the “spectro-temporal receptive field” of a neuron under natural stimulus conditions. Results for a limited number of recordings are presented and, globally, compared to the outcome of an analogous analysis of experiments with tonal stimuli.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 39 (1981), S. 227-237 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract Saturation and hue perceived in monochromatic stimuli and in light mixtures were scaled psychophysically by a direct magnitude estimation method. The colors were of aperture mode and were presented against a dark background. As a result opponent-colors functions were obtained which show the hue sensations produced by the lights of the visible spectrum (under the observing conditions used). Compared to the opponent-colors functions of Hurwich and Jameson, obtained by a cancellation technique, the subjective hue sensation differed significantly. It may be concluded that these cancellation functions describe an earlier, probably a retinal level of data processing, while our results may be regarded as a description of the output of the color vision system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 127-137 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract A system of electronic analog neurons (neuromines) for modeling the activity in small neuronal networks is described. The system consists of sixteen analogs that simulate the integrative neuronal properties at the axon hillock and sixty-four analogs that serve to simulate synaptic interactions. The neuromime properties are based on a potential model incorporating the following properties: membrane potential, threshold, refractory period, adaption, post-inhibitory rebound, accommodation and pacemaker potential. Use of matrix switch boards provides for convenient interconnection of the neuromime elements, allowing the construction of even complex circuits.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 113-126 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract This is a model of the steady-state influence of one pacemaker neuron upon another across a synapse with EPSP's. Its postulates require firstly the spontaneous regularity of both cells, whose intervals are E and N, respectively. In addition, they require a special shortening or negative “delay” of the interspike interval by one or more EPSP's, with a V-shaped dependence of the delay on the position or “phase” of the EPSP's in the interval; the minimum of the delay function corresponds to the earliest EPSP arrival phase (λ) that triggers a spike immediately. Finally, they impose on the variables certain bounds. The model's behavior has two main features. The first is a zig-zag relationship with an overall increasing trend between the steady-state pre- and post-synaptic discharge intensities (Fig. 7). The zig-zag is formed predominantly, if not exclusively, by segments with positive slopes that are rational fractions. Passage from one such segment to others is negatively-sloped (“paradoxical”), involving staggered positively-sloped segments whose details are unclear for weak presynaptic discharges and discontinuities for intense discharges. The same postsynaptic intensity may result from several presynaptic ones; the maximum postsynaptic intensity may reflect refractoriness, or the earliest instants of immediate triggering. The second main feature is the “locking” of the discharges in an invariant forward and backward temporal relation. With at most one EPSP per postsynaptic spike, locking is always present. If the presynaptic interval E is in the closed {rN+λ,(r+1)N} range, locking is 1:r+1, either stable at a greater-than-λ phase or unstable at a smaller one; arrivals at integral multiples of N do not affect the postsynaptic intensity. If E is in {rN, rN+λ} (r〉0), locking is at other ratios (e.g., 2:3) and less apparent. With more than one EPSP per spike, when E is below bounds that depend on the interspike interval and the point of earliest triggering, locking happens in the simple s′:1 ratio (s′=2,3, ...) and is stable; when E is above those bounds, there are E ranges where locking is in other ratios (e.g., 3:2) and ranges where behavior is unclear. The validity of any model is based jointly upon an a priori judgment as to whether postulates depart reasonably little from nature, and upon an a posteriori experimental comparison of modelled and real behaviors. The model's domain of applicability depends on the specific embodiment, each of the latter tolerating characteristically each departure. The present model will be evaluated in the crayfish stretch-receptor neuron (Diez-Martínez et al., in preparation). The model is applicable to any physical system that complies with its postulates, and evidence compatible with this notion is available in many disparate fields. It illustrates the modelling path to a scientific proposition, other paths being inference from experimentation, or deduction from premises acceptable at other approach levels (in this case, for example, from that of synaptic mechanisms). The periodicity postulates set this model within the category of those for oscillators. The notion of an oscillator has a far broader applicability than appears at first sight, since all physically realizable systems have some predominant output frequency, i.e., to a certain extent are oscillators.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 171-179 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The Culex circadian pacemaker's response to phase-resetting light signals was studied in the first 3 cycles of darkness following a 12h light exposure. (1) In both cycles 1 and 2 there is a clear change from “type 1” to “type 0” phase-resetting as the resetting signal is prologed (Fig. 2). (2) Mosquitoes in cycle 1 are about half as sensitive to phase-resetting as those in cycles 2 or 3 (the criterion being the minimum pulse duration required to produce type 0 phase-resetting) (Fig. 2). (3) Each cycle appears to have a corkscrew-shaped phaseresetting surface and a phase singularity (Figs. 4, 5, and 7). The hypothesis that the Culex pacemaker reaches a stable limit cycle within the first cycle leads to an economical explanation of the results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 201-211 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract An associative memory system is presented which does not require a “teacher” to provide the desired associations. For each input key it conducts a search for the output pattern which optimizes an external payoff or reinforcement signal. The associative search network (ASN) combines pattern recognition and function optimization capabilities in a simple and effective way. We define the associative search problem, discuss conditions under which the associative search network is capable of solving it, and present results from computer simulations. The synthesis of sensory-motor control surfaces is discussed as an example of the associative search problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 223-231 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The static discharge rate of Renshaw cells (studied in deafferented, intercollicularly decerebrate cats) has a nonlinear dependence on the frequency of trains of stimulus impulses to α-motor axons in the ventral root. This dependence is well described by a rectangular hyperbola that approaches saturation with increasing stimulus frequency. The tendency to saturate is independent of the number of motor axons exciting a Renshaw cell. On average, the stimulus frequency at which the discharge rate reaches half its saturation value lies between 10 and 15 Hz. The effect of Renshaw cell activity — measured as the antidromic inhibition of individual α-motoneurons — reflects the form of the static frequency characteristics. An electric circuit analog of the Renshaw cell membrane is presented which serves to explain the qualitative features of the static input-output relations; the nonlinearity is the result of synapses with linear properties acting together at the cell membrane.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 41 (1981), S. 33-45 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract A sixth order nonlinear model for horizontal head rotations in humans is analyzed using an extended parameter sensitivity analysis and a global optimization algorithm. The sensitivity analysis is used in both the direct sense, as a model fitting tool, and in the indirect sense, as a guide to experimental design. Resolution is defined in terms of the sensitivity table, and is used to interpret the sensitivity results. Using sensitivity analyses, the head and eye movement systems are compared and contrasted. Controller signal parameters are the most influential. Their variations and effects on head movement trajectories and accelerations are investigated, and the conclusions are compared with clinical neurological findings. The global optimization algorithm, in addition to automating the fitting of various types of data, is combined with time optimality theory to give theoretical time-optimal inputs to the model.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 41 (1981), S. 81-89 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The influence of exchanges of lipids and antioxidants (AO) between the cells on the cell proliferation is studied in the frame of the membrane model of the cell cycle. It is shown theoretically that the easy-oxidative lipids exchange favours the synchronization of cell division, while the AO exchange leads to desynchronization. The analytical consideration and some numerical estimations are carried out. The qualitative consequences accessible to experimental verification are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract In this account fixation and the torque response to a transient moving stripe of flying femaleMusca domestica with monocular sight was tested. This was made by either covering one eye of the fly with opaque paint or by placing a screen in front of one side of the fly's visual field. A stripe was moved with constant speed once around the fly clockwise and, after a pause, counterclockwise. The torque response of the fly was measured during the motion of the stripe and shortly beforehand. The results demonstrated that the monocular torque response to progressive (from front to back) motion and regressive (from back to front) motion essentially do not differ from the binocular response, except for the region of bionocular overlap. The beginning of the response of a fly with monocular vision to progressive motion is 11 ° (on average) before the direction of flight (0°), which means that the maximal functional binocular overlap of femaleMusca domestica is stretched at least 15° to each side (3.1). In addition, the shape of the monocular torque response to a progressively moving stripe was determined (see Figs. 5Ia and 5IIb). In other experiments similar to the ones described above, a screen was placed on one side of the fly's visual field or then on the other, (instead of covering one eye) and the torque response to the moving stripe was measured. Using this method, a delay response of 90 ms was measured. We suggest that this is the delay of the direction-sensitive component of the torque response, and therefore an additional argument for the existence of two components for the optomotor torque response. Flies with a covered eye or with a screen placed in front of one side of the visual field were able to fixate a single narrow long black stripe. This, however, was possible only when an additional offset signal was added, in order to give the stripe a constant velocity component. As a result there was a shift of the fixation towards the unobscured eye. The shift was small for the monocular flies, and it was larger (13° on average) when the screen was on one side of the fly. A new type of laser torquethrust transducer was developed and is described.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 41 (1981), S. 131-138 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The many indistinguishable texture pairs having identical second-, but different third- and higher-order statistics, led to the conjecture thatglobally the preattentive texture discrimination system cannot process statistical parameters of third- or higher-order. Thus in cases when iso-second-order textures yield discrimination this must be based onlocal conspicuous features calledtextons (Julesz, 1980). Here it is shown that globally even second-order statistical parameters, such as autocorrelation, cannot be processed by the textural system, and texture discrimination is solely the result of first-order statistics (density) of textons. It is also shown that the perceivable distance of statistical constraints (coherence distance) in densely packed stochastic textures is very short, four dots or less. As of now, only three texton classes were found: color, elongated blobs (line segments) of given width, orientation, and length, and the terminators (end-points) of these elongated blobs. The strength of these textons is demonstrated by several examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 41 (1981), S. 119-130 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract This communication compares the well known phenomenon of respiratory driving by the respiratory pump through the Breuer Hering reflex with a model (Segundo, 1979) of a neuronal pacemaker (i.e. regularly firing) interactions via IPSP's. The assumption involves a linear dependence (“delay function”) of the postsynaptic interval lengthening (or “delay”) produced by the IPSP's on the position (or “phase”) with respect to the preceding spike of the latter's arrival. Cats anesthetized and paralized with gallamine were artificially ventilated using a computer driven respirator. The pump period and the respiratory period (identified by the phrenic discharge) corresponded to the model's presynaptic pacemaker interval and to that of the post synaptic one, respectively. The delay of the respiratory period by an inflation was related linearly and in increasing manner to the latter's phase with respect to the inspiration onset. In the steady state, plots of average respiratory period versus pump period consisted in a succession of broad “paradoxical” segments with positive slopes 3, 2, 1, 1/2, 1/3 in which respiration was locked with the pump as predicted by the model. The locked condition were less easy to reach when FA CO 2increased or when level of anaesthesia decreased. The limits of paradoxical segments were different when measured using pump periods that increased or using periods that decreased. There was therefore a hysteresis as if the delay function parameters changed, a behavior that was not part of the model that assumed fixed characteristics. These modifications were related to dependency of each cycle on the preceding one. The model proposed for simple neuronal pacemaker interactions can thus be applied satisfactorily to the drive of the complex respiratory neuronal oscillator by the respiratory pump through Breuer Hering reflex, providing nevertheless some additonal assumptions concerning respiratory cycle interdependency are introduced to account for the hysteresis phenomenon. The Breuer Hering reflex could be considered as the equivalent of IPSP acting on the central respiratory oscillator. FA CO 2increase and anesthesia level decrease produced the same effect as the addition of noise to the model's presynaptic pacemaker, thus leading to the hypothesis that they act by adding noise (e.g., randomly distributed excitatory input) at the level of Breuer Hering reflex inhibition.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 41 (1981), S. 197-201 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract From recent theoretical work (Poggio and Reichardt, 1981), high frequency oscillations are expected in the angular trajectory of houseflies tracking a moving target if the target's retinal position controls the flight torque by means of a stronger optomotor response to progressive than to regressive motion. Experiments designed to test this conjecture have shown that (a) asymptotic non-decaying oscillations are found in the torque of female houseflies tracking targets moving at constant angular velocity; (b) the magnitude of the oscillations grows monotonically with mean retinal excentricity of the target; (c) the period of the oscillation is around 180–200 ms. The experimental findings are consistent with the hypothesis that a “progressive-regressive mechanism” plays a significant role in the tracking behaviour of female houseflies. From this phenomenological point of view a flicker mechanism that is active only for nonzero motion is equivalent to a progressive-regressive system. The relatively long period of the oscillation requires more complex reaction dynamics than a pure single dead-time delay. As a specific example we show that a model where the reaction to progressive motion is “sticky”, holding for a longish time after the ending of the stimulus, is consistent with the experimental data.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 41 (1981), S. 235-238 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract Using a very simple hypothesis concerning the length of the depolarized area during propagation of action potentials, distributions of latencies in bundles of myelinated axons have been derived. The internodal length, the number of nodes of Ranvier, the depolarized area and the variation in internodal length are the important parameters. To demonstrate the applicability of the derivation proposed here some examples taken from neurophysiological experiments are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 157-170 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract LGN Y-cells in 3 anaesthetized (N2O/O2) and paralyzed rhesus monkeys were investigated with stimuli, intensity modulated by gaussian white noise, and with moving and counterphase modulated spatial sine wave gratings. The results support the model, postulated on the base of electrophysiological recordings in the retina of cat and mudpuppy, which consists of a linear centre and surround mechanism whose responses are modified in a frequency-selective multiplicative way by a nonlinear mechanism in the receptive field. This nonlinear mechanism is also held responsible for the second-order harmonic responses, which are the defining characteristic of Y-cells. The temporal and spatial characteristics of these mechanisms were determined. The responses obtained with the GWN stimulation and with modulated spatial sine wave gratings both indicate that the optimal temporal frequency of the linear mechanisms is near 7 Hz at 70 td and near 5 Hz for the nonlinear mechanism. The optimal spatial frequency for the linear mechanism is between 0.5–2 cycles/deg and between 6–12 cycles/deg for the nonlinear mechanism.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 39 (1981), S. 105-109 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract In the recently described simple model of dynamic receptor pattern generation we used a two-dimensional hexagonal area of a regular triangular network, formed by a statistically constant distribution of unit electrostatic charges in a dynamic equilibrium. A set of 16 transition rules was applied to all units simultaneously; the next state of each unit depended only on the previous state of its six nearest neighbours, and the transition of the total pattern into the new one occurred in a single jump. Hence we designated the initial simple model as “jump model”. In this paper we describe an advanced version of the model, in which simplified rules are applied to one unit after the other in a sequential order, from left to right, starting with the top row of units. In the advanced version the state of a unit depends not only on that of its six nearest neighbours, but also on the state of all units preceding in sequence the one actually considered. This results in flux-like transitions. We therefore designated the advanced version as the “flux model”. It is shown that the flux model represents a closer approximation of physical and biological realities than the original jump model.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 39 (1981), S. 129-137 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The stick insect Carausius morosus maintains the distance between the substrate and its body. The underlying feed-back servo mechanism has been analyzed in intact animals under open loop conditions by changing the body-substrate distance in a sinusoidal fashion. The center position z c has been varied as parameter and the force the animal elicits along its high axis has been measured. The response amplitude A is a nonlinear function of z c. This nonlinear relationship between A and z c is most probably caused by the relationship between the torque excerted at the joints and the measured force. The responses to sinusoidal stimulation reveal band-pass character of the feed-back loop. Due to the nonlinearity of the system the average value of the response to sinusoidal disturbances depends upon the frequency of modulation. The change of the average value with the frequency of modulation is partially due to cocontraction of the extensor and flexor muscles.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 39 (1981), S. 181-194 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The term cell assembly, first introduced by D. O. Hebb, is defined in the framework of graph theory. This definition leads to some beautiful problems concerning the number and size of cell assemblies in large graphs. Some approaches to solve these problems are presented. In particular, the graphs K n xK m are constructed that have n·m points, n+m-2 connections per point, and at least 2n+2m-4 assemblies. Several new notions of connectivity in directed graphs are introduced and their relationships are investigated. The insight into these notions and their relationships will be helpful for further construction of graphs with many assemblies and/or high connectivity. The resulting graphs are not only important for the idea of cell assemblies in the context of neurodynamics, they may also find applications in the construction of communication networks and associative memories.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 39 (1981), S. 223-226 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The threshold for rotation about the yaw axis was determined for constant acceleration stimuli as a function of their duration in the range from 3 to 25 s. From the torsion-swing model the following theoretical equation can be derived: 1 $$a_{{\text{thr}}} = {C \mathord{\left/ {\vphantom {C {\left[ {1 - \exp \left( { - {{t_s } \mathord{\left/ {\vphantom {{t_s } {\tau _1 }}} \right. \kern-\nulldelimiterspace} {\tau _1 }}} \right)} \right]}}} \right. \kern-\nulldelimiterspace} {\left[ {1 - \exp \left( { - {{t_s } \mathord{\left/ {\vphantom {{t_s } {\tau _1 }}} \right. \kern-\nulldelimiterspace} {\tau _1 }}} \right)} \right]}}$$ , where a thr=acceleration amplitude at threshold, t s =duration of the acceleration, τ1=time constant, C=threshold for very long stimuli. According to this formula the Mulder product (i.e. the product of the threshold acceleration amplitude and the duration of the stimulus) is constant for durations up to 0.3 τ1. The best fit of this theoretical function to the somatosensory data is found for τ1=14.5 s, and C=0.220/s 2. The time within the Mulder product is constant (about 5s) is doubtless due to the mechanics of the semicircular canals. For the oculogyral data a lower value of τ1 is found. We do not have any explanation for this lower value.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract Probability of neuronal spike initiation was considered within the framework of a simple stochastic model. The time of spike occurrence was defined as the first time crossing of a stochastic process and a determined time function. This problem has been investigated in the case of a stationary Gaussian stochastic process and a linear time function. An integral equation obtained for the probability density function of the first time crossing was numerically solved by means of computer calculations. The model was applied to the analysis of temporal pattern of spike activity evoked in the cat spinal motoneurones by depolarizing current injected through the recording microelectrode.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 41 (1981), S. 79-79 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 42 (1981), S. 145-156 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The spectro-temporal sensitivity of auditory neurons has been investigated experimentally by averaging the spectrograms of stimuli preceding the occurrence of action potentials or neural events (the APES: Aertsen et al., 1980, 1981). The properties of the stimulus ensemble are contained in this measure of neural selectivity. The spectro-temporal receptive field (STRF) has been proposed as a theoretical concept which should give a stimulus-invariant representation of the second order characteristics of the neuron's system function (Aertsen and Johannesma, 1981). The present paper investigates the relation between the experimental and the theoretical description of the neuron's spectro-temporal sensitivity for sound. The aim is to derive a formally based stimulus-normalization procedure for the results of the experimental averaging procedure. Under particular assumptions, regarding both the neuron and the stimulus ensemble, an integral equation connecting the APES and the STRF is derived. This integral expression enables to calculate the APES from the STRF by taking into account the stimulus spectral composition and the characteristics of the spectrogram analysis. The inverse relation, i.e. starting from the experimental results and by application of a formal normalization procedure arriving at the theoretical STRF, is effectively hindered by the nature of the spectrogram analysis. An approximative “normalization” procedure, based on intuitive manipulation of the integral equation, has been applied to a number of single unit recordings from the grassfrog's auditory midbrain area to tonal and natural stimulus ensembles. The results indicate that spectrogram analysis, while being a useful real-time tool in investigating the spectro-temporal transfer properties of auditory neurons, shows fundamental shortcomings for a theoretical treatment of the questions of interest.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 9-15 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract A discussion of the game dynamics for asymmetric contest between two animal populations is presented by means of qualitative analysis.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 49-57 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract A treadwheel system consisting of two light foam wheels rotating independently on a counterbalanced gimbal is described. A stick insect rigidly fixed by the meso- and metathorax walks readily on the two wheels and can make turning movements in which the wheels rotate with different velocity. The dynamics and coordination of the animal on this device are compared with free walking, walks on heavier single wheels and walking on mercury.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 77-77 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 93-99 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract In this paper, we report on two experiments concerning the effect of the visual field of fovea on the subjective estimation of angular velocity. Experiment 1 investigates the effect of a slow moving target on the perception of self motion. The result of this experiment can be summarized as follows: a slow moving target seen in the visual field of fovea by a stationary person generates in this person a sensation of self rotation in the same direction as the motion of the target. This phenomenon will be called foveal induced ego motion. Experiment 2 investigates the latency for the detection of a self angular acceleration when the person focusses his fovea on a slowly moving target. From the results of this experiment we conclude that the latency for detection of a small self angular acceleration is shorter if the person sees a small foveal target moving with respect to the person in the direction of self rotation than if that small foveal target is moving (with respect to the person) in the opposite direction. The results of these experiments help us in refining existing models of visual-vestibular interaction, by providing a model which accounts for the phenomenon of oculogyral illusion.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 139-149 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract A skeleton photoperiod consists of two short pulses which are applied on the circadian oscillator at times corresponding to the beginning and to the end of a continuous light stimulus. To study several problems in entrainment of circadian rhythms by skeleton photoperiods, we develop a simple diagrammatic solution of the steady state entrainment making use of phase transition curves which are directly gotten from phase response curves. The graphical method is simple and systematic to study entrainment by light cycles with various day lengths. As the method is also intuitive, we can easily examine three problems. (1) In Drosophila the phase relation (ψ) between rhythm and light cycle is a continuous function of day length of skeleton photoperiods up to about 12 h, but a marked discontinuity (ψ-jump) sets in between 13 and 14h. By the diagrammatic method we find that ψ-jump is mathematically a bifurcation phenomenon. (2) The action of photoperiods up to about 12 h is fully simulated by two 15-min skeleton pulses. Do 3-min skeleton pulses imitate the complete photoperiods? We find that pulse width is arbitrary to some extent. (3) Why skeleton photoperiods up to about 12 h are good models of complete photoperiods? The reason is the small amplitude and the nearly symmetrical form of phase response curves in the subjective day.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The present report considers goal directed human saccadic eye movements. It addresses the question how a given perceived target excentricity is transformed into the innervation pattern that creates the saccade to the target. More specifically, it investigates whether this pattern is an appropriately selected preprogram or whether it is continuously controlled by a local feedback loop that compares a non-visual eye position signal to the perceived target excentricity (a visual signal would be too slow). To this end, the relation between the accuracy of saccades aimed at a given target and their velocity and duration was examined. Duration and velocity were found to vary by as much as 60% while the amplitude showed no related variation and had an almost constant accuracy of about 90%. By administrating diazepam, the variability of saccade duration and velocity could be further increased, but still the amplitude remained almost constant. These results favour the hypothesis that saccadic innervation is controlled by a local feedback loop.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 39 (1981), S. 139-156 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract Handwriting production is viewed as a constrained modulation of an underlying oscillatory process. Coupled oscillations in horizontal and vertical directions produce letter forms, and when superimposed on a rightward constant velocity horizontal sweep result in spatially separated letters. Modulation of the vertical oscillation is responsible for control of letter height. Modulation of the horizontal oscillation is responsible for control of corner shape through altering phase or amplitude. The vertical velocity zero crossing in the velocity space diagram is important from the standpoint of control. Changing the horizontal velocity value at this zero crossing controls corner shape. Changing the slope at this zero crossing controls writing slant. The corner shape and slant constraints completely determine the amplitude and phase relations between the two oscillations. This theory applies generally to a number of acceleration oscillation patterns such as sinusoidal rectangular and trapezoidal oscillations. The oscillation theory also provides an explanation for how handwriting might degenerate with speed. An implementation of the theory in the context of the spring muscle model is developed. Here sinusoidal oscillations arise from a purely mechanical source; orthogonal antagonistic spring pairs generate particular cycloids depending on the initial conditions. Modulating between cycloids can be achieved by changing the spring zero settings at the appropriate times. Frequency can be modulated either by shifting between coactivation and alternating activation of the antagonistic springs or by presuming variable spring constant springs. An acceleration and position measuring apparatus was developed for measurements of human handwriting. Measurements of human writing are consistent with the oscillation theory.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 39 (1981), S. 165-170 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The characteristics of the response to stretch of a muscle fibre are investigated using a validated model of skeletal muscle. It is found that the model correctly predicts all the peculiar features of the stretch response: the initial rapid force rise; the subsequent slower rise; the slow decay of the force upon termination of the elongation; and the dependence of these phenomena upon stretching velocity and muscle length. The hypothesis explaining these phenomena is discussed in detail.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 1-8 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The ordinary differential equation which transformes the game theoretical model of Maynard-Smith into a dynamical system is discussed and some important theorems and applications to symmetric contests in animal societies are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 39-48 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract “Modulo system” is a general information extracting and processing network for modelling the nervous system. Its essential features are briefly summarized. The concept is applied to visual pattern recognition. The input is a two-dimensional picture of an object. The network extracts the contours, the linesegments, the lines of different directions, and thevertices of different numbers of lines, in succesive functional layers. Afterwards, it recognizes the simplest known pattern which has the actually extracted features. Uncertainty, association, and tolerance are also concerned. The network is detailed for the classification of three-dimensional geometrical objects.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 59-70 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract This paper continues the investigation of a three-loop representation of the segmental muscle stretch reflex system introduced in a preceding communication. Frequency response characteristics were computed for open-loop conditions, control and disturbance signal inputs under a variety of conditions: (i) “in parallel” and “in series” peripheral arrangements of muscle compartments, (ii) various patterns of central connectivity, (iii) various recruitment levels of motor units, (iv) various overall reflex gains, (v) absence or presence of muscle spindle accleration sensitivity. These computations disclosed a number of mechanisms by which the nervous system might improve system stability and behaviour. These mechanisms are discussed with regard to physiological data.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 71-75 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract A single vertical stripe (long or short) was moved clockwise, with constant speed, around a tethered femaleMusca domestica fly. The yaw torque response of the fly was analyzed as a function of the position of the object. After an interval of 8 s the stripe was moved counterclockwise and a similar analysis of the torque was made. This procedure was repeated a few times and averaged to each direction separately and for all the flies tested. The results suggested that: a) There are at least two mechanisms for computing the optomotor response in the lower part of the fly's eye, one performing a position-dependent velocity computation and the other depending on the position but not on the direction of motion of an object. b) These two components are parametrized over the position on the lower part of the eye. The results also show that: c) There is a significant difference in the response between the upper and the lower part of the eye. The position-dependent component cannot be detected in the upper part of the eye. In addition: d) Two different control mechanisms are proposed, one responding to progressive (from front to back) and one to regressive (from back to front) movement of objects.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 101-112 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The study of the orientation behavior of flies requires the consideration of a few simple control systems for fixation and tracking. In this paper two such control systems are analyzed, in terms of the corresponding difference and differential equations. The first control system corrects with a delay ɛ the angular trajectory proportionally to the error angle ψ; the second control system also corrects proportionally to the error angle ψ but only when the absolute value of ψ is increasing. The differential equations are (0) $$\mathop \psi \limits^ \circ (t) = - \alpha '\psi (t - \varepsilon ) + A'$$ and (*) $$\mathop \psi \limits^o (t) = - \alpha '\psi (t - \varepsilon ) \cdot u[\psi (t - \varepsilon )\mathop \psi \limits^o (t - \varepsilon )] + A'$$ u[ ] being the step function (u[x]=1 if x〉0, otherwise u[x]=0). Under suitable restrictions on the parameters it is proved (a) that the difference equations (0') $$x_{n + 1} = x_n - \alpha x_n + A$$ and (*') $$x_{n + 2} = x_{n + 1} - \alpha x_{n + 1} \cdot u[x_{n + 1} \cdot (x_{n + 1} - x_n )] + A,$$ which can be associated to Eqs. (0) and (*), are “asymptotically equivalent” (for large n) if the time scale is “smoothed” over two time units and (b) that the second equation, with 0〈α〈2, always converge to a set of oscillating solutions of period 2 for arbitrary initial conditions. Numerical simulations show that the delay-differential equations behave in a similar way. We have also demonstrated with computer simulations that both control systems can satisfactorily predict the 3-D trajectory of a fly chasing another fly. The main biological implications of the analysis are: (1) The two control systems are practically equivalent descriptions of the fly's control of flight on a “coarse” time scale (2 times the fly's delay), consistently with an earlier more general derivation of Eq. (0) (Poggio and Reichardt, 1973). (2) On a fine time scale the second control system is characterized by an asymptotic oscillation with period twice the fly's delay. It is conjectured that a wide range of control systems of the same general type must have a similar oscillatory behavior. Finally, we predict the existence of asymptotic oscillations in the angular trajectory and the torque of tracking flies (if a control system of the second type is involved to a significant extent). Such oscillations should have a basic period of twice the effective reaction delay, and should be best detectable outside the binocular region. Closed loop experiments and the analysis of free flight trajectories may provide critical tests of this prediction.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 151-156 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract 1. Graded and discrete receptor potentials are recorded from the visual cells of the Australian Bulldog-ant. The intensity dependence of the graded responses is described by a new formula [Eq. (3)]. While the frequency of the discrete potentials in relation to the number of light quanta fits best a Poisson distribution, the graded potentials are best described by a logarithmic Gaussian distribution. 2. It is shown that the non-linear summation of single bumps and the reduction of the bump amplitude lead to a logarithmic intensity dependence. 3. The frequency spectrum of single bumps is measured with a Fast-Fourier-Analysis. It is observed that the harmonic frequencies have a negative slope around 12 dB/octave. 4. A difference is found in the higher harmonics of bumps generated at lower light intensities from those generated at higher light intensities. It is shown that this difference becomes more obvious if the bumps are further divided into short and longer latency groups. 5. From these results, it is concluded, that there is a mutual influence between neighbouring visual cells. Using this influence as a basis, a model of the low electric coupling between the cells is discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 181-194 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The stability of the Culex circadian oscillation in darkness was tested by perturbing it with bright light pulses. (1) In the absence of perturbation the overt circadian rhythm persists in darkness for at least 2 weeks (Fig. 5). (2) The circadian pacemaker, as perceived by the response to a standard phaseresetting signal, also follows a regular cycle in the absence of perturbation (Fig. 4). (3) Almost all light pulse perturbations quickly shift the phase of both overt rhythm and pacemaker, and the system resumes normal oscillation within 24 h (Figs. 6, 7, 8, and 9). (4) By contrast, perturbations driving the pacemaker near its phase singularity cause unpredictable phase shifts and/or disrupt individuals' overt rhythms for many cucles (Figs. 12, 13, and 14). Such pulses also sharply reduce the perceived amplitude of the pacemaker's oscillation (Figs. 10, 11, and 15). Most mosquitoes resume normal oscillation within a week but in some cases abnormalities persist for at least 2 weeks. The results re-emphasize the analogy between the circadian pacemaker and a simple limit cycle oscillator. The lasting anomalous behaviour of some mosquitoes after some pulses can either be explained by invoking a weakly unstable singularity, or simply treated as a minor, and perhaps revealing, deviation from prediction.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 195-200 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract On the basis of recent neurophysiological findings on the mammalian visual cortex, a selforganizing neural network model is proposed for the understanding of the development of complex cells. The model is composed of two kinds of connections from LGN cells to a complex cell. One is direct excitatory connections and the other is indirect inhibitory connections via simple cells. Inhibitory synapses between simple cells and complex cells are assumed to be modifiable. The model was simulated on a computer to confirm its behavior.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 40 (1981), S. 233-238 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The human optokinetic response to a horizontally moving striped pattern surrounding the subject was investigated under quasi-open and closed loop conditions. Open loop conditions were produced by the addition of an external signal from measured slow phase eye velocity to stripe velocity. A comparison of open and closed loop responses to step and sinusoidal changes of stripe velocity indicates that the central nervous system controlling slow phase optokinetic following can be described as a simple first order lag (Ka/(s+a)) where K is 4.7 and the time constant, 1/a, is 1.25 s.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 41 (1981), S. 19-32 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract A sixth order nonlinear model for horizontal head rotations in humans is presented and investigated using experimental results on head movement trajectories and neck muscle EMG. The controller signals, structured in accordance with time optimal control theory, are parameterized, and controller signal parameter variations show a dominating influence on different aspects of the head movement trajectory. The model fits the common head acceleration types over a wide range of amplitudes, and also less common (dynamic overshoot) trajectories.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 42 (1981), S. 87-94 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The dynamic properties of sensory transduction in an insect mechanoreceptor, the femoral tactile spine of the cockroach, Periplaneta americana, have been studied by measurement of the frequency response function between randomly varying movement of the tactile spine and afferent action potentials from the sensory neuron which innervates it. The frequency response function of the mechanoreceptor has been characterized over a frequency range which is more than ten times larger than has previously been used for this preparation. Also the effects of varying the amplitude of the stimulating signal have been studied by the use of a range of input signal strengths from about 0.5 to 10 μm R.M.S. displacement. The measured frequency response functions can all be well fitted by a theoretical relationship which is a fractional exponent of complex frequency, provided that the time delay caused by conduction of the action potentials from the sensory dendrite to the recording electrodes is taken into account. Under small signal conditions the exponent of complex frequency is close to 0.5 but with larger displacements its value decreases to about half this value. The overall sensitivity of the receptor, as measured by the gain of the frequency response function at a natural frequency of 1 radian/s, is not significantly altered by changes in the input movement amplitude, so that the receptor behaves linearly in this respect. However, the mean rate of action potential occurrence is not linearly related to input movement amplitude. These results are discussed in terms of current theories of sensory transduction and the possible role of tubular bodies in the dynamic behaviour of insect cuticular mechanoreceptors.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 42 (1981), S. 129-132 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract A photochemical system is proposed that offers a possible link between the rate of quantal absorption and the visual response. In the proposed system the time courses of the concentrations of certain photoproducts turn out to be equal to the quantal absorption rate passed through various linear filters. The proposed system is consistent with the cone pigment kinetics proposed by Rushton (1958). The system produces afterimages and can provide Weber's law behavior.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 42 (1981), S. 17-21 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract In a recent paper, Kunihiko Fukushima described a “Neocognitron: a self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position”. The present paper presents a simplified version of the neocognitron. Whereas the latter employs a 16 x 16-element visual field which requires computer simulation, the simplified model uses a 10-element one-dimensional visual field. Two input examples are analyzed: a white sheet which is gradually lowered over a black background, and a white center dot which gradually stretches vertically in both directions until it covers the balck background. The model demonstrates invariance with respect to lateral shift.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 42 (1981), S. 9-15 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract In 12 epileptic patients suffering from “absences” 8-channel EEG was recorded by telemetry. The autoregressive model was applied to the signal and the prediction coefficients being the basis for calculation of the poles of the predictor. The location of the poles in thez- ands-planes was described as a function of time for 0.1 s steps along the pre-seizure EEG. In 10 of the 12 patients, and in 25 of the 28 recorded seizures this presentation of the poles of the predictor showed specific pattern linked with the occurrence of the siezure. The trajectory of the “most mobile pole” during the pre-seizure period could aid in the prediction of the seizure by several seconds.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 42 (1981), S. 29-38 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract As the maximal K+-conductance (or K+-channel density) of the Hodgkin-Huxley equations is reduced, the stable resting membrane potential bifurcates at a subcritical Hopf bifurcation into small amplitude unstable oscillations. These small amplitude solutions jump to large amplitude periodic solutions that correspond to a repetitive discharge of action potentials. Thus the specific channel density can act as a bifurcation parameter, and can control the excitability and autorhythmicity of excitable membranes.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 42 (1981), S. 51-56 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract Following disparities between physical stimuli and psychophysically measured sensation patterns are investigated: 1. long or short duration stimulation of the same area on the skin produces different sensation patterns. No transient response is observed. 2. when a set of points on the skin is stimulated one by one at the rate, at least 2 points per second, the subject perceives easily readible, continuously moving tactual sensation. As the rate of stimulation of the same points increases, the trajectory of the sensation changes. Investigations regarding the above distortions, supplemented with other experiments, lead to some conclusions concerning the structure of the nervous system serving mechanoreceptors, and show the connections between psychophysical, electrophysiological and theoretical observations of this system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 42 (1981), S. 79-85 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Summary The amplitude and rate of transient and maintained responses of an identified giant neurone of the pond-snail, Lymnaea stagnalis, to a maintained injected current were investigated. The responses of the isopotential soma to a maintained current density of less than 10 μA cm-2 includes repetitive discharges of action potentials, sawtooth oscillations and amplitudemodulated oscillations. The frequency of the maintained response increases as the injected current increases, while the amplitude decreases until the maintained response is a stable steady state at a membrane potential of about -20mV. This bifurcation from small amplitude periodic solutions to a depolarized stable steady state has the characteristics of a supercritical Hopf bifurcation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 42 (1981), S. 69-78 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract A theory of projections in the nervous system (such as the retino-tectal projection) is proposed. Components of axonal growth cones and target tissue interact and cooperate, within the area of contact, to generate a guiding parameter, in the simplest case a “guiding substance” of distributionp. The components which are involved in this production are assumed to have graded distributions with respect to position in the projecting and target area, respectively. The distributionp thus produced guides the growth cone in the direction of maximal slope until the minimal value ofp is reached. In this way, each growth cone can be guided to a position on the target tissue which depends on the origin of the fiber in such a manner that a projection results. Adhesive forces could but need not be involved in the guiding mechanism. The slope ofp may interfere with an intracellular pattern forming mechanism within the growth cone, determining the polarity of activation (as modelled previously on the basis of autocatalysis and lateral inhibition) and thus the direction of growth. For the generation of a distribution ofp leading to a reliable projection, simple graded distributions in the projecting and target area suffice, involving one or two components in each dimension. Their effect on the generation ofp may be activatory as well as inhibitory. Exponential gradients give rise to particularly simple mapping functions. The following is an example of this general type of model: Growth cones as well as target tissue contribute to the production of a guiding substance. For each dimension, there is, in the target tissue, an exponentially graded component exerting (directly or indirectly) two functions: it actively produces guiding substancep and it interacts, in an inhibitory fashion, with the production ofp by a component of the growth cone (which is, in turn, graded with respect to position of origin in the projecting area). While the theory is proposed as a fair approximation of the primary events in neural projections, superimposed regulatory effects can also be incorporated. These include fiber-fiber interactions, mechanisms smoothing out unequal density distributions of axon terminals and effects of time of arrival of fibers on the projection, which have been proposed previously as primary mechanisms generating projections. A further extension of the model is to assume that crude and more refined positional specificity is determined in a combinatorial fashion, allowing the possibility of interchanges and transformations of parameters.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 42 (1981), S. 107-116 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract A hypothesis is presented which describes, in biomechanical terms, the central programs underlying horizontal eye movements in man. It is suggested that eye movements are produced by means of programmed shifts of the so-called invariant muscle characteristics (static force vs angle ϕ of gaze). These shifts lead to a change of the equilibrium point resulting from the interaction of agnnist and antagonist muscles and, as a consequence, to movement and the attainment of a new position of gaze. A reciprocal or a coactivation command to agonist and antagonist muscles occurs when their characteristics shift with respect to the coordinate ϕ in the same or opposite directions, respectively. It is proposed that during pursuit and saccadic eye movements a supperposition of the both central commands occurs. During a saccade, the reciprocal command develops evenly up to a certain level. The initial and final levels of the reciprocal command dictate the respective position of gaze and therefore the size of the saccade. The coactivation command develops to a maximum level and is slowly switched off when the new position of gaze has been achieved. The magnitude of the coactivation command seems to be not connected with an absolute position of gaze. It provides probably a stability of the movement and, in particular, prevents overshoot and oscillation during the saccade. The same timing of these commands occurs during pursuit movements, but the magnitude of the coactivation command and the rates of the development of the both commands are less in this case and correlate with the velocity of the movement. This hypothesis enables the tension changes in the muscle during saccadic and pursuit movements to be simulated in qualitative accordance with unique experimental data obtained by Collins et al. (1975). The functional significance of superposition of these motor commands and similarity in the efferent organization of eye and limb movements are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 41 (1981), S. 157-163 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract Sinusoidally modulated current, I=A cos(2πft)+C, for A/C〉1/3, was injected into the soma of an identified molluscan neurone, for frequencies that gave about one action potential/cycle. Phase locked responses were characterised by the 1:1 phase-locking-phase angle; some entrained response were not phase-locked, and some responses were not periodic. These oscillatory free runs and non-periodic responses are the result of the internal noise that is also responsible for the variability of the endogenous discharge of the neurone.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 41 (1981), S. 211-222 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract This paper forms a preface and introduction to a new method for the estimation of evoked potentials: a posteriori time-varying filtering. A simple evoked potential model, consisting of a transient signal and additive noise, is discussed and the underlying assumptions explicitly formulated. Assuming this model, the problem of estimating the signal from an ensemble is considered from the statistical and communication engineering point of view, along with a brief survey of the pertinent literature. It is explained why ensemble averaging, in general, does not provide the best estimate in the mean-square error sense. After a summary of the controversial aspects of timeinvariant “a posteriori ‘Wiener’ filtering”, it is indicated how that method can be generalized to a time-varying counterpart, which is able to handle the essentially transient character of evoked potential waveforms. Finally, the new method is presented on a conceptual level and its application illustrated by examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 225-232 
    ISSN: 1436-4646
    Keywords: Combinatorial Optimization ; Vertex Packings ; Graph Theory ; Polynomial Algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The vertex packing problem for a given graph is to find a maximum number of vertices no two of which are joined by an edge. The weighted version of this problem is to find a vertex packingP such that the sum of the individual vertex weights is maximum. LetG be the family of graphs whose longest odd cycle is of length not greater than 2K + 1, whereK is any non-negative integer independent of the number (denoted byn) of vertices in the graph. We present an O(n 2K+1) algorithm for the maximum weighted vertex packing problem for graphs inG ≥ 1. A by-product of this algorithm is an algorithm for piecing together maximum weighted packings on blocks to find maximum weighted packings on graphs that contain more than one block. We also give an O(n 2K+3) algorithm for testing membership inG
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 121-136 
    ISSN: 1436-4646
    Keywords: Linear Programming ; Polynomial Algorithms ; Total Unimodularity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper describes several algorithms for solution of linear programs. The algorithms are polynomial when the problem data satisfy certain conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 182-189 
    ISSN: 1436-4646
    Keywords: Equilibrium ; Linear Monetary Economy ; Linear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm is presented for computing equilibria in a linear monetary economy, that is, an exchange economy in which all individuals have linear utility functions and in which goods are bought and sold only in exchange for money. The algorithm computes the equilibrium prices by solving a finite sequence of linear programming problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 254-254 
    ISSN: 1436-4646
    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 ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 327-347 
    ISSN: 1436-4646
    Keywords: Mathematical Programming ; Convex Functions ; Quasi-Concave and Quasi-Convex Functions ; Bifunctions ; Perturbation ; Saddle-points ; Lagrangian
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract General and quasi-concave non-differentiable cases of the maximization of the minimun between two functions are considered. With the aid of duality theory for mathematical programming involving conjugate-like operators and by defining a bifunction we construct a new Lagrangian and generate a class of perturbations. New saddle-point theorems are presented, and equivalence is proved between the existence of a saddle-point and the existence of a certain cone-supporting property of the perturbation function. These results suggest possible improvements in multiplier methods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 359-363 
    ISSN: 1436-4646
    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 ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 19-46 
    ISSN: 1436-4646
    Keywords: Traveling Salesman Problem ; Assignment Problem ; Branch and Bound ; Lagrangean Relaxation ; Hamiltonian Circuits ; Arc Premiums/Penalties
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We describe an algorithm for the asymmetric traveling salesman problem (TSP) using a new, restricted Lagrangean relaxation based on the assignment problem (AP). The Lagrange multipliers are constrained so as to guarantee the continued optimality of the initial AP solution, thus eliminating the need for repeatedly solving AP in the process of computing multipliers. We give several polynomially bounded procedures for generating valid inequalities and taking them into the Lagrangean function with a positive multiplier without violating the constraints, so as to strengthen the current lower bound. Upper bounds are generated by a fast tour-building heuristic. When the bound-strengthening techniques are exhausted without matching the upper with the lower bound, we branch by using two different rules, according to the situation: the usual subtour breaking disjunction, and a new disjunction based on conditional bounds. We discuss computational experience on 120 randomly generated asymmetric TSP's with up to 325 cities, the maximum time used for any single problem being 82 seconds. This is a considerable improvement upon earlier methods. Though the algorithm discussed here is for the asymmetric TSP, the approach can be adapted to the symmetric TSP by using the 2-matching problem instead of AP.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 90-97 
    ISSN: 1436-4646
    Keywords: Linear Programs ; Special Structure Constraints ; Identification ; Min-spike Algorithm ; Incidence Matrix
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In large LPs it may be that a major fraction of the constraints has a particularly simple form. Frequently this simple form may be exploited by either decomposition or implicit representation methods. In these cases, the effective size and computational difficulty are more closely related to the number of remaining nonspecial constraints than to the number of special constraints. A unified computational procedure is presented for mechanically identifying near maximal sets of special structure constraints for most of the kinds of special structures which have been identified thus far as being exploitable.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 172-181 
    ISSN: 1436-4646
    Keywords: Optimization ; Sparsity ; Matrix Updating
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper is concerned with two questions relating to quasi-Newton updates for unconstrained optimization that exploit any sparsity present in the second derivative matrix of the objective function. First, a family of such updates is derived, that reduces to any a priori known dense update formula when no sparsity is imposed. This family uses the Frobenius projection of the desired update on the subspace of matrices that satisfy all the needed conditions. In the second part, we prove that, under mild assumptions, a positive definite sparse quasi-Newton update always exists. The proof of this result includes the explicit determination of such an update.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 233-234 
    ISSN: 1436-4646
    Keywords: Polytope ; Subdivision ; Simplex ; Volume ; Centroid
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Subdivisions of polytopes are described which place any chosen vertex in a (near-) minimal number of simplices. Ancillary procedures to find volumes and centroids of polytopes are indicated.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 290-300 
    ISSN: 1436-4646
    Keywords: Nonlinear Equations ; Nonlinear Inequalities ; Quadratic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A new algorithm is proposed which, under mild assumptions, generates a sequence{x i } that starting at any point inR n will converge to a setX defined by a mixed system of equations and inequalities. Any iteration of the algorithm requires the solution of a linear programming problem with relatively few constraints. By only assuming that the functions involved are continuously differentiable a superlinear rate of convergence is achieved. No convexity whatsoever is required by the algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 241-261 
    ISSN: 1436-4646
    Keywords: Dual problem ; Duality Theory ; Optimality Conditions ; Price Functions ; Nonlinear Programming ; Integer Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We survey some recent developments in duality theory with the idea of explaining and unifying certain basic duality results in both nonlinear and integer programming. The idea of replacing dual variables (prices) by price functions, suggested by Everett and developed by Gould, is coupled with an appropriate dual problem with the consequence that many of the results resemble those used in linear programming. The dual problem adopted has a (traditional) economic interpretation and dual feasibility then provides a simple alternative to concepts such as conjugate functions or subdifferentials used in the study of optimality. In addition we attempt to make precise the relationship between primal, dual and saddlepoint results in both the traditional Lagrangean and the more general duality theories and to see the implications of passing from prices to price functions. Finally, and perhaps surprisingly, it appears that all the standard algorithms terminate by constructing primal and dual feasible solutions of equal value, i.e., by satisfying generalised optimality conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 331-347 
    ISSN: 1436-4646
    Keywords: Optimization ; Nonlinear Programming ; Unconstrained Optimization ; Discrete Optimal Control ; Differential Dynamic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Dynamic programming techniques have proven to be more successful than alternative nonlinear programming algorithms for solving many discrete-time optimal control problems. The reason for this is that, because of the stagewise decomposition which characterizes dynamic programming, the computational burden grows approximately linearly with the numbern of decision times, whereas the burden for other methods tends to grow faster (e.g.,n 3 for Newton's method). The idea motivating the present study is that the advantages of dynamic programming can be brought to bear on classical nonlinear programming problems if only they can somehow be rephrased as optimal control problems. As shown herein, it is indeed the case that many prominent problems in the nonlinear programming literature can be viewed as optimal control problems, and for these problems, modern dynamic programming methodology is competitive with respect to processing time. The mechanism behind this success is that such methodology achieves quadratic convergence without requiring solution of large systems of linear equations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 358-358 
    ISSN: 1436-4646
    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 ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 357-357 
    ISSN: 1436-4646
    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 ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 19-31 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Gegeben sei ein Pseudo-Zufallszahlen-Generator, der gleichverteilte StichprobenU aus dem Intervall (0, 1) liefert, und eine statistische Verteilung, beschrieben durch ihre VerteilungsfunktionF(x). Dann erzeugt die InversionsmethodeX←F −1(U) Stichproben vonF(x). Ein Verfahren wird entwickelt, das “Guide”-Tafeln erstellt, mit dem Ziel, diese Inversion zu ermöglichen, so daß das Verfahren für beliebigeF(x) effizient wird. Für diskrete Verteilungen sind diese Tafeln klein und leicht zu erstellen, und der entstehende Stichproben-Algorithmus kann mit bekannten allgemeinen Verfahren gut konkurrieren. Stetige Verteilungen erfordern längere Vorbereitungszeiten und mehr Speicherplatz für die Tafeln. Diese werden mit Hilfe gegebener Wahrscheinlichkeitsdichtenf(x) vorbereitet. Die Methode ist anwendbar auf “vernünftige”f(x), einschließlich der normalerweise in der Statistik vorkommenden Fälle. Aufgrund der angeführten Rechenerfahrung mit Poisson-, Normal-, Gamma- und Cauchy-Verteilungen zeigt sich, daß unser allgemeines Verfahren fast so schnell ist, wie die besten bekannten Methoden, die speziell auf diese Verteilungen zugeschnitten wurden.
    Notes: Abstract Given a basic pseudo-random number generator which returns uniformly distributed samplesU from the interval (0, 1) and a statistical distribution as defined by its distribution functionF(x). Then the inversion methodX←F −1 (U) produces samples fromF(x). A procedure is developed which prepares “guide tables” in order to facilitate this inversion so that sampling becomes efficient for arbitraryF(x). For discrete distributions these tables are small and easy to set up, and the resulting sampling algorithm compares well with known general methods. Continuous distributions require longer set-up times and more space for tables. These are prepared using given probability densitiesf(x). The method can cope with “reasonable”f(x) including most cases which are commonly encountered in statistics. The reported computational experience, on Poisson, Normal, Gamma and Cauchy distributions, indicates that our general routine is almost as fast as the best known sampling algorithms which were specially designed for these distributions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    ISSN: 1436-5057
    Keywords: 65 J ; 65 H
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary A generalization of the concept of a divided difference operator introduced by J. W. Schmidt is derived. The inclusion of solutions by certain Regula-falsi-methods realized by a well known approximation of the Jacobian matrix, which is no divided difference operator in the sense of Schmidt but a realization of this generalization, is proved.
    Notes: Zusammenfassung Durch Verallgemeinerung des von J. W. Schmidt eingeführten Steigungsbegriffes gelingt es, bei Durchführung gewisser Verfahren vom Regula-falsi-Typ mit einer naheliegenden und häufig verwendeten Approximation der Funktionalmatrix, die keine Steigung im herkömmlichen Sinne darstellt, jedoch eine Realisierung der oben genannten Verallgemeinerung liefert, Einschließungsaussagen für Lösungen von Operatorgleichungen nachzuweisen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 83-86 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir wenden den Satz, daß für eine Segmentfunktionf, deren SegmentableitungD(f) auf dem Segment [0, 1] von oben beschränkt ist, der Hausdorff-Abstand zwischenD(f) und der Ableitung eines linearen Operators durch den Modul derH-Stetigkeit vonD(f) und Konstante nach oben beschränkt ist, an auf Bernstein-Polynome und Mirakyan-Szász-Operatoren.
    Notes: Abstract Given a segment functionf, whose segment-derivative is bounded from above on the segment [0, 1] we applicate the theorem, that the Hausdorff distance betweenD(f) and the derivative of a linear operator is bounded from above by the modulus of H-continuity ofD(f) and some constants, to Bernstein polynomials and Mirakyan-Szász-operators.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 91-105 
    ISSN: 1436-5057
    Keywords: 65N20 ; Adaptive mesh refinement ; multigrid methods ; finite element methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Das Unterprogramm PLTMG ist ein FORTRAN-Programm zur Lösung selbstadjungierter elliptischer Randwertprobleme für beliebige Bereiche desR 2. Es basiert auf einer stückweise-linearen Finite-Element-Methode, einer adaptiven Gitterverfeinerungsmethode und einer mehrstufigen iterativen Methode zur Lösung des resultierenden Systems linearer Gleichungen. In dieser Arbeit wird die Methode beschrieben, und einige numerische Ergebnisse und Vergleiche werden dargelegt.
    Notes: Abstract Subroutine PLTMG is a Fortran program for solving self-adjoint elliptic boundary value problems in general regions ofR 2. It is based on a piecewise linear triangle finite element method, an adaptive grid refinement procedure, and a multi-level iterative method to solve the resulting sets of linear equations. In this work we describe the method and present some numerical results and comparisons.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    ISSN: 1436-5057
    Keywords: 90C30 ; 65K05 ; Nonlinear programming algorithms ; penalty algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Diese Arbeit beschreibt einen Algorithmus zur Minimierung einer nichtlinearen Funktion mit nichtlinearen Ungleichungen und Gleichungen als Nebenbedingungen. Die vorgeschlagene Methode hat die Eigenschaft, daß sie unter schwachen Voraussetzungen gegen einen Kuhn-Tucker-Punkt des betrachteten Optimierungsproblems konvergiert und unter stärkeren Voraussetzungen eine quadratische Konvergenzgeschwindigkeit aufweist. Ähnlich wie eine vor kurzem von Rosen vorgeschlagene Methode benutzt der Algorithmus eine Straffunktion, um einen Punkt in der Nähe der optimalen Lösung zu berechnen und schaltet dann auf Robinsons Methode um. Die neue Methode hat gegenüber dem Verfahren von Rosen zwei neue Eigenschaften. Erstens wird der richtige Wert des Parameters in der Straffunktion automatisch gefunden. Zweitens enthalten die mit der Methode von Robinson gelösten Teilprobleme nur lineare Gleichungen als Nebenbedingungen. Die Teilprobleme können daher besonders leicht gelöst werden. Vorläufige numerische Ergebnisse werden berichtet.
    Notes: Abstract This paper presents an algorithm for the minimization of a nonlinear objective function subject to nonlinear inequality and equality constraints. The proposed method has the two distinguishing properties that, under weak assumptions, it converges to a Kuhn-Tucker point for the problem and under somewhat stronger assumptions, the rate of convergence is quadratic. The method is similar to a recent method proposed by Rosen in that it begins by using a penalty function approach to generate a point in a neighborhood of the optimum and then switches to Robinson's method. The new method has two new features not shared by Rosen's method. First, a correct choice of penalty function parameters is constructed automatically, thus guaranteeing global convergence to a stationary point. Second, the linearly constrained subproblems solved by the Robinson method normally contain linear inequality constraints while for the method presented here, only linear equality constraints are required. That is, in a certain sense, the new method “knows” which of the linear inequality constraints will be active in the subproblems. The subproblems may thus be solved in an especially efficient manner. Preliminary computational results are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 189-195 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung ART-Algorithmen sind iterative Methoden zur Rekonstruktion von digitalen Bildern aus ihren Projektionen. Die Konvergenz des additiven und linearen (nicht restringierten) ART-Algorithmus mit Relaxation wird unter weit schwächeren Voraussetzungen über die Relaxationsparameter als bei bisher bekannten Resultaten bewiesen. Ein anderer Beweis zeigt die geometrisch schnelle Konvergenz des linearen relaxierten ART-Algorithmus.
    Notes: Abstract The convergence of the additive and linear ART algorithm with relaxation is proved in a new way and under weaker assumptions on the sequence of the relaation parameters than in earlier works. These algorithms are iterative methods for the reconstruction of digitized pictures from one-dimesional views. A second proof using elementary matrix algebra shows the geometric convergence of the linear ART algorithm with relaxation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 1-7 
    ISSN: 1436-5057
    Keywords: Distributive sorting ; bucket sorting ; average complexity ; expected running time ; 5.31
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir untersuchen die mittlere KomplexitätE(C) von Fachsortier-Algorithmen, die auf eine StichprobeX 1, ...,X n mit der Verteilungsdichtef aufR 1 angewendet werden. Wir nehmen an, daß die Zeit zur Bestimmung des Sortierfachs konstant ist, und daß für die Sortierung innerhalb jedes Fachs ein Algorithmus mit dem mittleren Zeitbedarfg(n) zur Verfügung steht. Dabei istg konvex,g(n)/n↑∞,g(n)/n 2 nichtsteigend undg unabhängig vonf. Wir zeigen: 1) Wennf kompakten Träger hat, dann gilt ∫g(f(x))dx〈∞ genau dann, wennE(C)=0(n). 2) Wennf keinen kompakten Träger hat, dann gilt $$E(C)/n\xrightarrow{n}\infty $$ . Überf benötigen wir keinerlei weitere Voraussetzungen.
    Notes: Abstract In this paper we investigate the expected complexityE(C) of distributive (“bucket”) sorting algorithms on a sampleX 1, ...,X n drawn from a densityf onR 1. Assuming constant time bucket membership determination and assuming the use of an average timeg(n) algorithm for subsequent sorting within each bucket (whereg is convex,g(n)/n↑∞,g(n)/n 2 is nonincreasing andg is independent off), the following is shown: 1) Iff has compact support, then ∫g(f(x))dx〈∞ if and only ifE(C)=0(n). 2) Iff does not have compact support, then $$E(C)/n\xrightarrow{n}\infty $$ . No additional restrictions are put onf.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 45-56 
    ISSN: 1436-5057
    Keywords: Order-convex operator ; Banach space ; Existence ; Convergence ; Operator equation ; partially ordered topological linear space ; 65J15 ; 47H17 ; 47H07
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung SeiF:X→Y ein ordnungskonvexer Operator, woX, Y halbgeordnete Banachräume sind. Es werden zwei verwandte Verfahren zur Lösung der GleichungF(x)=0 diskutiert, von denen eines schon von Pasquali beschrieben worden ist (s. [2]), das andere von Wolfe [12]. Existenz- und Konvergenzsätze für diese Verfahren sind dargestellt und mit Hilfe von Beispielen illustriert. Ferner liegen einige Bemerkungen über ein Verfahren von Traub vor, das auch schon von Wolfe diskutiert worden ist [12].
    Notes: Abstract LetF:X→Y be an order-convex operator, whereX, Y are partially ordered Banach spaces. Two related methods for the solution ofF(x)=0 are discussed, one of which has been studied by Pasquali (see [2]) and the other by Wolfe [12]. Existence-convergence theorems for the methods are given, and these are illustrated with the aid of example. Some remarks are also made on a method due to Traub [7] which has also been discussed by Wolfe [12].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 57-66 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract An algorithm is proposed for computation of the exponential of a matrixX which uses the well known continued fraction expansion of tanhX. ForX essentially-nonnegative the following is proved: In interval arithmetic the algorithm is feasible, numerically convergent and bound conserving; after possibly a few initial steps it gives alternatively lower and upper bounds to the exact result.
    Notes: Zusammenfassung Es wird ein Algorithmus zur Berechnung der Exponentialfunktion von MatrizenX vorgeschlagen, der die Kettenbruch-Entwicklung von tanhX benutzt. IstX wesentlich-nichtnegativ, dann gilt: Der Algorithmus ist in Intervall-Arithmetik durchführbar, numerisch konvergent und schrankentreu; von einem Index an liefert er alternierend untere und obere Schranken für das exakte Ergebnis.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 67-71 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die Berechnung von beliebigen Funktionen dreieckiger Matrizen ist rekursiveweise ermöglicht mittels einfacher Eigenschaften, dagelegt in diesem Bericht.
    Notes: Abstract Any function of a triangular matrix can be recursively calculated on the basis of simple properties stated in this paper.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 1-14 
    ISSN: 1436-5057
    Keywords: Deskriptive Regelspezifikationssprache ; semantisches relationales Datenmodell ; Surrogate ; Surrogatbedeutung ; Surrogatschemata ; Surrogatlogik ; semantische Algebren ; dynamischeL-Semantik ; diskrete Datensemantik ; weiche (nichtstandard) Datensemantiken ; Unschärfeverteilungen ; Descriptive rule specification language ; semantic relational data model ; surrogates ; surrogate meaning ; surrogate schemata ; surrogate logics ; semantic algebra ; dynamicL-semantics ; discrete data semantics ; soft (nonstandard) data semantics ; fuzziness distributions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract LEGOL-2 is an extremely high level descriptive language to merely specify the “what-to-do”-behaviour of information systems by means of rules operating upon a relational data base. In order to structure data modelling semantically, it provides the Surrogate Model embodying semantic features that impose upon data tables much stronger restrictions than the relational Third-Normal-Form does. — The Surrogate Model is being described together with its environmental framework. Subsequently, the Model is being criticized; special emphasis is laid upon distinctness, consistency, completeness, and semantic adequacy. Some formalizing attempts to indicate ways to solve remaining problems are introduced.
    Notes: Zusammenfassung LEGOL-2 ist eine extrem abstrakte deskriptive Sprache zur reinen Spezifikation des „Was”-Verhaltens von Informationssystemen mittels Regeln, die auf eine relationale Datenbasis wirken. Um das Modellieren von Daten semantisch zu strukturieren, stellt LEGOL-2 das „Surrogatmodell” bereit; das Modell weist semantische Merkmale auf, die Datentabellen erheblich strengeren Beschränkungen unterwerfen als die relationale Dritte-Normal-Form. — Das Surrogatmodell wird gemeinsam mit seinem Bezugsrahmen beschrieben. Anschließend wird das Modell kritisch diskutiert, wobei auf Klarheit, Konsistenz, Vollständigkeit und semantische Angemessenheit des Modells besonderes Gewicht gelegt wird. Einige Formalisierungsansätze werden vorgestellt, die beim Aufweisen von Wegen zur Lösung offener Probleme helfen sollen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 81-88 
    ISSN: 1436-5057
    Keywords: Primary: 65 D 30 ; 65 D 32 ; Secondary: 41 A 55 ; Cauchy type integrals ; principal value integrals ; finite-part integrals ; quadrature rule ; Gaussian quadrature rules ; differentiation under the integral sign ; Taylor's formula ; convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Quadraturformeln für die approximative Berechnung der Ableitungen Cauchyscher Hauptwertintegrale (bezüglich der freien Variablen der Integrale) können durch formale Differentiationen der rechten Seiten der verwendeten Integrationsformeln (ohne Ableitungen) genommen werden. Die Rechtfertigung dieser Methode unter geeigneten Bedingungen erscheint in dieser kurzen Mitteilung. Die Ergebnisse dieser kurzen Mitteilung sind auch anwendbar für die numerische Berechnung der endlichen Bestandteile gewisser divergenter Integrale und für die numerische Lösung singulärer Integrodifferentialgleichungen.
    Notes: Abstract Quadrature rules for the approximate evaluation of derivatives of Cauchy principal value integrals (with respect to the free variable inside the integral) can be obtained by formal differentiations of the right sides of the corresponding quadrature rules (without derivatives). The justification of this method, under appropriate conditions, is presented in this short communication. The results of this short communication are also applicable to the numerical evaluation of a class of finite-part integrals and to the numerical solution of singular integrodifferential equations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Direkte Methoden zur Lösung von singulären Integralgleichungen vom Cauchy-Typus (S. I. G.) beruhen auf der Gaussschen Regel für numerische Integration, wobei die S. I. G. durch Anwendung der resultierenden Funktionalgleichung an geeignet gewählten Kollokationspunkten auf ein lineares Gleichungssystem reduziert wird. In diesem Artikel wurde die Äquivalenz dieser Methode mit derjenigen, welche auf der Lagrangeschen Interpolations-Approximation der unbekannten Funktion, beruht, gezeigt. Indirekte Methoden zur Lösung von S. I. G. können durch Anwendung derselben numerischen Regel an der Fredholmschen Integralgleichung, auf welche die S. I. G. reduziert wird, erhalten werden. In diesem Artikel wurde gezeigt, daß beide Methoden, im Sinne, daß sie dieselben numerischen Resultate liefern, äquivalent sind. Schließlich wurde mit Hilfe dieser Resultate der, Fehler und die Konvergenz der Methoden festgestellt.
    Notes: Abstract Direct methods for solving Cauchy-type singular integral equations (S.I.E.) are based on Gauss numerical integration rule [1] where the S.I.E. is reduced to a linear system of equations by applying the resulting functional equation at properly selected collocation points. The equivalence of this formulation with the one based on the Lagrange interpolatory approximation of the unknown function was shown in the paper. Indirect methods for the solution of S. I. E. may be obtained after a reduction of it to an equivalent Fredholm integral equation and an application of the same numerical technique to the latter. It was shown in this paper that both methods are equivalent in the sense that they give the same numerical results. Using these results the error estimate and the convergence of the methods was established.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 113-121 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird eine Verallgemeinerung, der Methode von Walker für den Fall kontinuierlicher Verteilungen präsentiert. Die vorgeschlagene Methode arbeitet nach dem Rückweisungsverfahren, verwendet aber alle erzeugten Zufallswerte. Die Anwendung des Verfahrens auf den Generator für normalverteilte Zufallszahlen nach Kinderman und Ramage ergibt einen Algorithmus, der zum Algorithmus FL5 von Ahrens und Dieter äquivalent ist.
    Notes: Abstract A generalization of the Walker's method is presented for the case of continuous distributions. The proposed method is similar to the rejection technique but makes use of all the generated values. Application of the method for a normal random number generator of Kinderman and Ramage resulted in an algorithm that is equivalent to the FL5 procedure of Ahrens and Dieter.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 237-244 
    ISSN: 1436-5057
    Keywords: 65H10 ; 65J15 ; 47H17 ; Nonlinear equations ; Newton method ; Kantorovich theorem ; Error bounds
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die vorgestellte affin-invariante Version des Kantorovich-Theorems für das Newton-Verfahren umfaßt die Gragg-Tapia-Fehlerschranken, neuere optimale und schärfere obere Schranken, neue optimale und schärfere untere Schranken, und neue Ungleichungen zurq-quadratischen Konvergenz, sämtlich ausgedrückt durch die übliche majorisierende Folge. Für die Schranken werden geschlossene Ausdrücke angegeben.
    Notes: Abstract An affine invariant version of the Kantorovich theorem for Newton's method is presented. The result includes the Gragg-Tapia error bounds, as well as recent optimal and sharper upper bounds, new optimal and sharper lower bounds, and new inequalities showingq-quadratic convergence all in terms of the usual majorizing sequence. Closed form expressions for these bounds are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 285-298 
    ISSN: 1436-5057
    Keywords: 90 C 05 ; 90 C 25 ; Piecewise linear programming ; convex programming ; duality ; Stückweise lineare Optimierung ; konvexe Optimierung ; Dualität
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die zu einem Optimierungs-problem mit stückweise linearer, konvexer und stetiger Zielfunktion und linearen Nebenbedingungen duale Aufgabe wird untersucht. Es zeigt sich, daß das duale Problem vom selben Typ wie das primale ist und mit denselben Verfahren gelöst werden kann, wie sie in einer früheren Arbeit des Autors vorgeschlagen wurden. Erfahrungen die bei der Anwendung verschiedener Varianten dieser Verfahren zur Lösung einer Anzahl von Beispielen gemacht wurden, wobei sowohl von der primalen als auch von der dualen Version ausgegangen wurde, werden berichtet.
    Notes: Abstract The dual of an optimization problem with piecewise linear, convex, and continous objective function and linear restrictions is investigated. It is shown that the dual problem is of the same type as the primal and can be solved by the same methods as were proposed in a previous work of the author. Experiences arising from the application of different variants of these methods to solve a number of examples, where the primal as well as the dual version was employed, are reported.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 275-275 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 227-236 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es werden einige neue Resultate bezüglich des Fehlers bei der Gleitkomma-Multiplikation mitgeteilt. In Abhängigkeit vom Maß für den Fehler wird festgestellt, für welche Basen der mittlere Multiplikationsfehler minimal wird; dabei sind gegenüber früheren Untersuchungen neue Fehlermaße einbezogen worden. Ein Teil der Ergebnisse hat Nutzanwendungen auf den Computerentwurf.
    Notes: Abstract New results are given on error in floating point multiplication. Certain choices of the base minimize the mean multiplicative error. These choices depend on which measure of error is selected. Some measures are included which were not in earlier studies. Some of the results have application to computer design.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 299-318 
    ISSN: 1436-5057
    Keywords: Boundary value problem ; Green's function ; global error ; 65 L 10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird eine Analyse der globalen Fehler, die durch lokale diskretisierungsfehler verursacht werden, durchgeführt. Sie ist auf Abschätzungen der Greenschen Funktionen des diskretisierten Problems begründet, sofern der Raum der Lösungen des homogenen Problems in Teilräume von zunehmenden beziehungsweise nicht zunehmenden Lösungen aufgespalten werden kann. Es wird gezeigt, wie die Kondition des diskretisierten Problems (die stark von der Kondition des kontinuierlichen Problems abweichen kann) die Fehler beeinflußt und besonders, wie stark sie bei (steifen) Problemen mit glatten Lösungen abweichen kann. Eine Reihe von Beispielen illustriert diese Resultate.
    Notes: Abstract An analysis is given of the global error due to local discretization errors. This is based on estimating the “discrete” Green's function of the discretized problem, where the homogeneous solution space can be split into subspaces of increasing and nonincreasing solutions resp. It is shown how the conditioning of the discretized problem (which may well be different from the conditioning of the continuous problem) affects the errors and in particular how this may be different in (stiff) problems with smooth solutions. A number of examples sustain these results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 371-372 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir beweisen eine Vermutung von Bitzer [1] über eine Minimaleigenschaft der trigonometrischen Interpolation an äquidistanten Knoten.
    Notes: Abstract We prove a conjecture of Bitzer [1] concerning a minimal property of trigonometric interpolation at equidistant nodes.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 367-370 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird einO (nlogn)-Algorithmus beschrieben, der das Zweimaschinen-, Job-Shop-Scheduling-Problem mit insgesamtn Teiltätigkeiten für den Fall löst, daß man die maximale Verspätung zu minimieren hat. Der Algorithmus ist eine wesentliche Verallgemeinerung eines Ergebnisses von Hefetz und Adiri, die das gleiche Problem in Verbindung mit der einfachen Zielfunktion „Projektdauer” gelöst haben.
    Notes: Abstract AnO (nlogn)-algorithm is given for the two-machine, job-shop scheduling problem withn unit-time tasks in which maximum lateness is to be minimized. This algorithm generalizes recent results by Hefetz and Adiri for the corresponding makespan problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 253-284 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird ein Algorithmus zur automatischen zweidimensionalen Quadratur beschrieben, der speziell für Integranden mit singulärem Verhalten am Rand des Integrationsgebietes geeignet ist. Eine Implementierung dieses Algorithmus in Standard FORTRAN wird vorgestellt. Der Algorithmus beruht auf einer nichtlinearen Transformation des Integranden in beiden Veränderlichen, die so gewählt, wird, daß der transformierte Integrand und alle seine Ableitungen am Rand des (transformierten) Integrationsgebiets verschwinden. Auf den transformierten Integranden wird die Trapezregel in der Produktform angewendet. An Hand von numerischen Testresultaten wird die Effizienz des vorgestellten Algorithmus bei der automatischen Ermittlung von sehr genauen Näherungswerten für Integrale mit unspezifischen, pathologischen Singularitäten demonstriert.
    Notes: Abstract An automatic quadrature algorithm especially designed for double integration of functions with some form of singular behaviour on the boundary of the integration region is described, and its FORTRAN code is presented. The algorithm is based on the use of the product trapezoidal rule, after a non-linear transformation of the integrand in both variables renders a new integrand function whose derivatives vanish on the (transformed) boundary. Numerical results demonstrate the ability of the algorithm to obtain high accuracies in dealing automatically with pathological singularities of non-specific types.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 319-337 
    ISSN: 1436-5057
    Keywords: Linear inequalities ; inequalities ; polyhedral cones ; positivity of functions ; Jacobi polynomials ; approximation ; 15 A 39 ; 33 A 65 ; 65 D 99
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Funktionenreihen der Form $$f(x) = \sum\limits_{n = 0}^N {c_n f_n (x)} $$ werden im Intervalla≤x≤b unter der Nebenbedingungf(x)≥0 betrachtet. Der durch diese Bedingung bestimmte Kegel der Koeffizientenc n imR N+1 wird numerisch durch einen polyedrischen Kegel angenähert. Numerische Werte für die entstehenden Fehler und Wege zu ihrer Verbesserung werden angegeben. Die Diskussion einer speziellen Reihe mit Jakobipolynomen führt zu neuen Aussagen über Koeffizientenbereiche für welche die Reihe nicht-negativ ist.
    Notes: Abstract Function series of the form $$f(x) = \sum\limits_{n = 0}^N {c_n f_n (x)} $$ are considered under the constraintf(x)≥0 in a given intervala≤x≤b. The cone in teh spaceR N+1 of the coefficientsc n which is determined by the positivity constraint is approximated numerically by a polyhedral cone. A numerical estimate for the error involved is given and it is shown how it may be reduced. A special series of Jacobi polynomials is discussed and new estimates for the range of parameters for which this series is non-negative are obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 373-378 
    ISSN: 1436-5057
    Keywords: Principal value integrals ; isolated singularities ; poles ; Laurent's expansion ; analytic ; degree of precision ; (1970) Primary 65 D 30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird eine Quadraturformel zur numerischen Auswertung des Cauchyschen Hauptwertes eines Integrals vom Typ $$\int\limits_{ - 1}^1 {f(x)/(x - a) dx} $$ angegeben, wo −1〈a〈1 ist undf(x) eine Singularität im Komplexen in der Nähe des Integrationsweges besitzt. Eine Fehleranalyse wird durchgeführt.
    Notes: Abstract A quadrature rule for numerical evaluation of Cauchy principal value integrals of the type $$\int\limits_{ - 1}^1 {f(x)/(x - a) dx} $$ where −1〈a〈1 andf(x) possesses complex singularities near to the path of integration has been formulated. An analysis of the error has been provided.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 1-13 
    ISSN: 1436-4646
    Keywords: Minimax ; Nondifferentiable Optimization ; Quasi-Newton Methods ; Variable Metric Methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We develop a class of methods for minimizing a nondifferentiable function which is the maximum of a finite number of smooth functions. The methods proceed by solving iteratively quadratic programming problems to generate search directions. For efficiency the matrices in the quadratic programming problems are suggested to be updated in a variable metric way. By doing so, the methods possess many attractive features of variable metric methods and can be viewed as their natural extension to the nondifferentiable case. To avoid the difficulties of an exact line search, a practical stepsize procedure is also introduced. Under mild assumptions the resulting method converge globally.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 49-62 
    ISSN: 1436-4646
    Keywords: Algorithms ; Optimization ; Minimax ; Quasi-Newton ; Superlinear Convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present an algorithm for minimax optimization that combines LP methods and quasi-Newton methods. The quasi-Newton algorithm is used only if an irregular solution is detected, in which case second-order derivative information is needed in order to obtain a fast final rate of convergence. We prove that the algorithm can converge only to a stationary point and that normally the final rate of convergence will be either quadratic or superlinear. The performance is illustrated through some numerical examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 103-109 
    ISSN: 1436-4646
    Keywords: Linear Complementarity ; Solution Ray ; Z-matrix ; Boundary ; Complementary Cone ; K 0-matrix
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we prove two results concerning the unionC of all the degenerate complementary cones associated with the linear complementarity problem (M, q) whereM is aK 0-matrix. (1) C is the same as the set of allq ∈R n for which (M, q) has infinitely many solutions. (2) C is the same as the boundary of the set of allq ∈ R n for which (M, q) has a solution, an easily observable geometric result for a 2 × 2K 0-matrix.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 144-151 
    ISSN: 1436-4646
    Keywords: Unconstrained Minimization ; Quasi-Newton Methods ; Sparsity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In order to apply quasi-Newton methods to solve unconstrained minimization calculations when the number of variables is very large, it is usually necessary to make use of any sparsity in the second derivative matrix of the objective function. Therefore, it is important to extend to the sparse case the updating formulae that occur in variable metric algorithms to revise the estimate of the second derivative matrix. Suitable extensions suggest themselves when the updating formulae are derived by variational methods [1, 3]. The purpose of the present paper is to give a new proof of a theorem of Dennis and Schnabel [1], that shows the effect of sparsity on updating formulae for second derivative estimates.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 173-195 
    ISSN: 1436-4646
    Keywords: Integer Programming ; Duality ; Sensitivity Analysis ; Valid Inequalities ; Branch and Bound Methods ; Group Problems ; Lagrangean Relaxation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Recently a duality theory for integer programming has been developed. Here we examine some of the economic implications of this theory, in particular the necessity of using price functions in place of prices, and the possibility of carrying out sensitivity analysis of optimal solutions. In addition we consider the form of price functions that are generated by known algorithms for integer programming.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 245-250 
    ISSN: 1436-4646
    Keywords: Staircase Linear Programs ; Test Problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A set of staircase linear programming test problems are made available for computational experiments.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 348-352 
    ISSN: 1436-4646
    Keywords: Class of Matrices ; Linear Complementarity Problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This note presents a class ofQ-matrices which includes Saigal's classN ofQ-matrices with negative principal minors and the classE of strictly semi-monotoneQ-matrices.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 364-366 
    ISSN: 1436-4646
    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 ...
  • 99
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 319-330 
    ISSN: 1436-4646
    Keywords: Nonlinear Programming ; Geometric Programming ; Duality Theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The several published methods for mapping a dual solution estimate to a primal solution estimate in posynomial geometric programming provide no criteria for deciding how much deviation from primal feasibility, or discrepancy between the primal and dual objective function values, should be permitted before the primal solution estimate is accepted by the designer. This paper presents a new and simple dual-to-primal conversion method that uses the cost coefficients to provide a sound economic criterion for determining when to accept a primal solution estimate. The primal solution estimate generated is the exact solution to a modified primal obtained from the given primal by modifying the cost coefficients, with the exponent matrix left unchanged. The method is shown to have desirable properties when coupled with a convergent dual algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 348-356 
    ISSN: 1436-4646
    Keywords: Multi-extremal Optimization ; Multinomial Distribution ; Bayes Estimate ; Monte Carlo
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The solution of ak-extremal problem is defined as the set of pairs (x i * , θi),i = 1, ⋯ ,k, where x t * isi th local minimum andθ i is the volume of the set of attraction of this minimum. A Bayesian estimate ofk and (θ 1 , ⋯ , θ k ) is constructed.
    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...