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  (36)
  • Springer  (36)
  • American Physical Society (APS)
  • Springer Nature
  • Computer Science  (36)
Collection
  • Articles  (36)
Source
Keywords
Publisher
Years
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Adaptive mesh refinement using piecewise-linear shape functions based on the blending function method (1996)
    Springer
    Engineering with computers 12 (1996), S. 84-93 
    Details
    ISSN: 1435-5663
    Keywords: Adaptive mesh refinement ; Finite element method ; Mesh generation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Notes: Abstract Use of quadrilateral elements for finite element mesh refinement can lead either to so-called ‘irregular’ meshes or the necessity of adjustments between finer and coarser parts of the mesh necessary. In the case of ‘irregular’ meshes, constraints have to be introduced in order to maintain continuity of the displacements. Introduction of finite elements based on blending function interpolation shape functions using piecewise boundary interpolation avoids these problems. This paper introduces an adaptive refinement procedure for these types of elements. The refinement is anh-method. Error estimation is performed using the Zienkiewicz-Zhu method. The refinement is controlled by a switching function representation. The method is applied to the plane stress problem. Numerical examples are given to show the efficiency of the methodology.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01299394
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Book reviews (1981)
    Springer
    Computers and the humanities 15 (1981), S. 37-50 
    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/BF02404372
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Das MeDoc-System – ein elektronischer Publikations- und Nachweisdienst für die Informatik (1998)
    Springer
    Informatik, Forschung und Entwicklung 13 (1998), S. 110-121 
    Details
    ISSN: 0949-2925
    Keywords: Schlüsselwörter: Elektronische Bibliothek, Internet, Informationsvermittlung, Abrechnung ; Key words: Digital library, internet, information brokering, accounting ; CR Subject Classifications: H.3.5, H.3.6
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract. The objective of the MeDoc project was the conception of a full-text based publication and reference service for computer science literature, its prototypical implementation and evaluation. The service shall enhance information exchange and supply researchers with literature more easily. Therefore an internet based system was developed that allows for searching, browsing, delivering and storing documents and supports searching in heterogeneous, distributed information systems. Part of the documents offered via the MeDoc service are billable. This article describes the functionality and architecture of the MeDoc system.
    Notes: Zusammenfassung. Ziele des MeDoc-Projektes waren die Konzeption, prototypische Entwicklung und Erprobung volltextbasierter Informations- und Publikationsdienste für die Informatik, um den Informationsaustausch und die Literaturversorgung in der Wissenschaft effektiver gestalten zu können. Dazu wurde im Rahmen des Projektes ein internet-basiertes System entwickelt, in dem Informatik & Fachinformation im Volltext gespeichert, recherchiert, abgerufen und gelesen werden kann und das die Suche nach Informatik-Literatur in heterogenen, verteilten Informationsquellen im Internet unterstützt. Das Informationsangebot ist dabei teilweise kostenpflichtig. In diesem Artikel werden Ziele, Funktionalität und Architektur des MeDoc-Systems beschrieben.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s004500050104
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Book reviews (1980)
    Springer
    Computers and the humanities 14 (1980), S. 119-145 
    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/BF02403804
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Sustainable Development: Gestaltungsaufgabe für die Informatik (1996)
    Springer
    Informatik-Spektrum 19 (1996), S. 206-213 
    Details
    ISSN: 1432-122X
    Keywords: Schlüsselwörter  Sustainable Development ; Ökobilanzen ; Life-Cycle-Assessment ; Petri-Netzmethode ; Stoffstromnetze ; Key words  Sustainable development ; petri-net-method ; ecobalance ; life-cycle-assessment
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s002870050032
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Neural clustering networks based on global optimisation of prototypes in metric spaces (1997)
    Springer
    Neural computing & applications 5 (1997), S. 2-13 
    Details
    ISSN: 1433-3058
    Keywords: Global optimisation ; Clustering ; Unsupervised learning ; Neural networks ; Random optimisation ; EEG processing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The utilisation of clustering algorithms based on the optimisation of prototypes in neural networks is demonstrated for unsupervised learning. Stimulated by common clustering methods of this type (learning vector quantisation [LVQ, GLVQ] and K-means) a globally operating algorithm was developed to cope with known shortcomings of existing tools. This algorithm and K-means (for the common methods) were applied to the problem of clustering EEG patterns being pre-processed. It can be shown that the algorithm based on global random optimisation may find an optimal solution repeatedly, whereas K-means provides different sub-optimal solutions with respect to the quality measure defined as objective function. The results are presented. The performance of the algorithms is discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01414098
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Gröbner bases of ideals defined by functionals with an application to ideals of projective points (1993)
    Springer
    Applicable algebra in engineering, communication and computing 4 (1993), S. 103-145 
    Details
    ISSN: 1432-0622
    Keywords: Gröbner bases ; Polynomial ideals ; Dual bases ; Interpolation ; 0-dimensional schemes
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics , Technology
    Notes: Abstract In this paper we study 0-dimensional polynomial ideals defined by a dual basis, i.e. as the set of polynomials which are in the kernel of a set of linear morphisms from the polynomial ring to the base field. For such ideals, we give polynomial complexity algorithms to compute a Gröbner basis, generalizing the Buchberger-Möller algorithm for computing a basis of an ideal vanishing at a set of points and the FGLM basis conversion algorithm. As an application to Algebraic Geometry, we show how to compute in polynomial time a minimal basis of an ideal of projective points.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01386834
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    On decomposing systems of polynomial equations with finitely many solutions (1993)
    Springer
    Applicable algebra in engineering, communication and computing 4 (1993), S. 217-230 
    Details
    ISSN: 1432-0622
    Keywords: Algebraic variety decomposition ; Gröbner bases ; Systems of nonlinear equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics , Technology
    Notes: Abstract This paper deals with systems ofm polynomial equations inn unknown, which have only finitely many solutions. A method is presented which decomposes the solution set into finitely many subsets, each of them given by a system of type $$f_1 \left( {x_1 } \right) = 0,f_2 \left( {x_1 ,x_2 } \right) = 0, \ldots ,f_n \left( {x_1 , \ldots ,x_n } \right) = 0$$ . The main tools for the decomposition are from ideal theory and use symbolical manipulations. For the ideal generated by the polynomials which describe the solution set, a lexicographical Gröbner basis is required. A particular element of this basis allows the decomposition of the solution set. By a recursive application of these decomposition techniques the triangular subsystems are finally obtained. The algorithm gives even for non-finite solution sets often also usable decompositions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01200146
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    An upper bound for the minimum diameter of integral point sets (1993)
    Springer
    Discrete & computational geometry 9 (1993), S. 427-432 
    Details
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For alln〉 d there existn points in the Euclidean spaceE d such that not all points are in a hyperplane and all mutual distances are integral. It is proved that the minimum diameter of such integral point sets has an upper bound of 2 c logn log logn .
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02189331
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Insect visual homing strategies in a robot with analog processing (2000)
    Springer
    Biological cybernetics 83 (2000), S. 231-243 
    Details
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract.  The visual homing abilities of insects can be explained by the snapshot hypothesis. It asserts that an animal is guided to a previously visited location by comparing the current view with a snapshot taken at that location. The average landmark vector (ALV) model is a parsimonious navigation model based on the snapshot hypothesis. According to this model, the target location is unambiguously characterized by a signature vector extracted from the snapshot image. This article provides threefold support for the ALV model by synthetic modeling. First, it was shown that a mobile robot using the ALV model returns to the target location with only small position errors. Second, the behavior of the robot resembled the behavior of bees in some experiments. And third, the ALV model was implemented on the robot in analog hardware. This adds validity to the ALV model, since analog electronic circuits share a number of information-processing principles with biological nervous systems; the analog implementation therefore provides suggestions for how visual homing abilities might be implemented in the insect's brain.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00007973
    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...