ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (65)
  • Springer  (65)
  • 2020-2024
  • 2010-2014
  • 1975-1979  (65)
  • 1955-1959
  • 1975  (65)
  • Computer Science  (65)
Collection
  • Articles  (65)
Source
Keywords
Publisher
Years
  • 2020-2024
  • 2010-2014
  • 1975-1979  (65)
  • 1955-1959
Year
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Perturbation effects on stability of gravity receptors (1975)
    Springer
    Biological cybernetics 17 (1975), S. 99-108 
    Details
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract Stability properties of gravity receptor transduction mechanisms were investigated by recording action potentials from the eighth nerve of cats maintained at two spatial positions both with and without an added click perturbation. The cells were demonstrated to present directional sensitivity, multivaluedness and wandering of mean rate trajectories. To the wandering were fitted appropriate stability boundaries corresponding to recent theories of finite time stability. Results supported the hypothesis that physiological stimuli result in local deformations of a flexible trampoline-like macula.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00363949
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    facet.materialart.
    Unknown
    Perturbation effects on stability of gravity receptors (1975)
    Springer
    Details
    Publication Date: 1975-01-01
    Print ISSN: 0340-1200
    Electronic ISSN: 1432-0770
    Topics: Biology , Computer Science , Physics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 3
    Electronic Resource
    Electronic Resource
    Necessary and sufficient conditions for a penalty method to be exact (1975)
    Springer
    Mathematical programming 9 (1975), S. 87-99 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper identifies necessary and sufficient conditions for a penalty method to yield an optimal solution or a Lagrange multiplier of a convex programming problem by means of a single unconstrained minimization. The conditions are given in terms of properties of the objective and constraint functions of the problem as well as the penalty function adopted. It is shown among other things that all linear programs with finite optimal value satisfy such conditions when the penalty function is quadratic.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01681332
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Eine Anwendung des Brouwerschen Fixpunktsatzes in der Intervallarithmetik der Matrizen (1975)
    Springer
    Computing 14 (1975), S. 141-147 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A theorem is proved by means of Brouwer's theorem which allows to decide whether a given interval matrix [S] has the inclusion property relative to the unknown inverseA −1 of a known matrixA. It is demonstrated in which cases the theorem may be used and how to choose [S] in these cases.
    Notes: Zusammenfassung Mittels des Satzes von Brouwer wird ein Satz bewiesen, nach dem man entscheiden kann, ob eine gegebene Intervallmatrix [S] die Einschließungseigenschaft bezüglich der unbekannten InversenA −1 einer bekannten MatrixA hat. Es wird vorgeführt, in welchen Fällen der Satz anwendbar ist und wie [S] in diesen Fällen gewählt werden kann.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02242312
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    The non-renameability of honesty classes (1975)
    Springer
    Computing 14 (1975), S. 183-193 
    Details
    ISSN: 1436-5057
    Keywords: Complexity classes ; honesty classes ; honesty procedures ; naming theorem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Ein wichtiges Ergebnis der Komplexitätstheorie ist der Umbenennungssatz von E. M. McCreight, der besagt, daß es einen Algorithmus σ gibt, der alle Namen ϕi des Systems der Komplexitätsklassen in neue Namen ϕσ(i) überführt, derart, daß die neuen Namen die Schrittmaßbedingung „λi,n,m[ϕσ(i)(n)≦m] entscheidbar” erfüllen. Unsere Untersuchung der „gutartigen Funktionenklassen” zeigt, daß ein entsprechender Umbenennungsalgorithmus für diese Klassen nicht existiert.
    Notes: Abstract An important result in the theory of complexity classes is the naming theorem of E. M. McCreight, which states that the system of complexity classes can be renamed uniformly by a measured set of names. Our investigation of honesty classes shows that for these classes the analogous assertion is false. No measured transformation of programs renames correctly all honesty classes.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02242317
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1975)
    Springer
    Computing 15 (1975), S. 287-290 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02242375
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Facet of regular 0–1 polytopes (1975)
    Springer
    Mathematical programming 8 (1975), S. 179-206 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The role of 0–1 programming problems having monotone or regular feasible sets was pointed out in [6]. The solution sets of covering and of knapsack problems are examples of monotone and of regular sets respectively. Some connections are established between prime implicants of a monotone or a regular Boolean functionβ on the one hand, and facets of the convex hullH of the zeros ofβ on the other. In particular (Corollary 2) a necessary and sufficient condition is given for a constraint of a covering problem to be a facet of the corresponding integer polyhedron. For any prime implicantP ofβ, a nonempty familyF(P) of facets ofH is constructed. Proposition 17 gives easy-to-determine sharp upper bounds for the coefficients of these facets whenβ is regular. A special class of prime implicants is described for regular functions and it is shown that for anyP in this class,F(P) consists of one facet ofH, and this facet has 0–1 coefficients. Every nontrivial facet ofH with 0–1 coefficients is obtained from this class.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01580442
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    SELECT: A computer program to identify associationally rich words for content analysis (1975)
    Springer
    Computers and the humanities 9 (1975), S. 3-12 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Conclusions An overview of these results indicates that SELECT is, in general, producing results in which elicited themes parallel those produced by frequency-based word selection. More importantly —and consonant with the impetus for development of the method — SELECT is delivering factors which are larger, more easily interpretable, and more discriminable than these available from frequency data and is doing so within the constraint of basic thematic identities.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02404315
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Computer printing of Braille music using the IML-MIR system (1975)
    Springer
    Computers and the humanities 9 (1975), S. 115-121 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02404294
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Minimal-program complexity of pseudo-recursive and pseudo-random sequences (1975)
    Springer
    Theory of computing systems 9 (1975), S. 83-94 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01698128
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...