ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (79)
  • 2010-2014  (39)
  • 1995-1999  (40)
  • 1920-1924
  • Computer Science  (79)
Collection
  • Articles  (79)
Years
Year
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Queueing systems 19 (1995), S. 193-214 
    ISSN: 1572-9443
    Keywords: M/M/c queue ; transient solution ; lattice path counting ; depth of path
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We apply the lattice path counting method to the analysis of the transientM/M/c queueing system. A closed-form solution is obtained for the probability of exactlyi arrivals andj departures within a time interval of lengtht in anM/M/c queueing system that is empty at the initial time. The derivation of the probability is based on the counting of paths from the origin to(i,j) on thexy-plane, that have exactly rd x-steps whose depth from the liney=x isd (d=0,1,...,c−1). The closed-form solution has an expression useful for numerical calculation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Queueing systems 19 (1995), S. 377-397 
    ISSN: 1572-9443
    Keywords: GI/G/s queues ; diffusion model ; conditional departure process ; renewal-process approximations ; consistent discretization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper develops a diffusion-approximation model for a stableGI/G/s queue: The queue-length process in theGI/G/s queue is approximated by a diffusion process on the nonnegative real line. Some heuristics on the state space and the infinitesimal parameters of the approximating diffusion process are introduced to obtain an approximation formula for the steady-state queue-length distribution. It is shown that the formula is consistent with the exact results for theM/M/s andM/G/∞ queues. The accuracy of the approximations for principal congestion measures are numerically examined for some particular cases.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    The visual computer 14 (1998), S. 166-176 
    ISSN: 1432-2315
    Keywords: Key words: Geometric modeling ; Metamorphosis ; Harmonic mapping ; Correspondence problem
    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 ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Artificial life and robotics 3 (1999), S. 217-220 
    ISSN: 1614-7456
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper presents a perspective of complexity from the control engineering point of view. The implication of complexity in control system design is clarified as a source of difficulty in modeling, which leads us to the notion of physical complexity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Annals of software engineering 8 (1999), S. 223-238 
    ISSN: 1573-7489
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In general, the software testing-efforts which are spent in large-scale software development account for a half of the total amount of the development effort. Therefore, the management of fault-detection and fault-correction activities in the testing phase is very important to efficiently and economically develop a highly-reliable software product. In this paper, a software management tool which aids the quality/reliability assessment and testing-progress control in the testing phase is developed. This tool consists of several sub-systems that analyze software fault-detection data and assess software quality/reliability and testing-progress based on adopted software reliability growth models. Also, we use JAVA language to implement the tool. The JAVA language is widely known as an object-oriented and platform-free programming language. These characteristics are suitable for constructing our tool, because the tool will be revised to adopt new software reliability growth models and/or new testing-control techniques.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Designs, codes and cryptography 9 (1996), S. 71-77 
    ISSN: 1573-7586
    Keywords: Dihedral groups ; Hadamard matrices
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Let D 2p be adihedral group of order 2p, where pis an odd integer. Let Z D 2p be the group ringof D 2p over the ring Z of integers.We identify elements of Z D 2p and their matricesof the regular representation of Z D 2p . Recently we characterized the Hadamard matrices of order 28 ([6]) and ([7]). There are exactly 487 Hadamardmatrices of order 28, up to equivalence. In thesematrices there exist matrices with some interesting properties.That is, these are constructed by elements of ZD 6.We discuss relation of Z D 2p and Hadamard matricesof order n=8p+4, and give some examples of Hadamardmatrices constructed by dihedral groups.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Designs, codes and cryptography 6 (1995), S. 91-96 
    ISSN: 1573-7586
    Keywords: self-dual codes ; extremal codes ; generator matrices and symmetric designs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, we consider a general construction of doubly-even self-dual codes. From three symmetric 2-(31, 10, 3) designs, we construct at least 3228 inequivalent extremal doubly-even [64, 32, 12] codes. These codes are distinguished by their K-matrices.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Designs, codes and cryptography 9 (1996), S. 71-77 
    ISSN: 1573-7586
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Let D 2p be a dihedral group of order 2p, where p is an odd integer. Let ZD 2p be the group ring of D 2p over the ring Z of integers. We identify elements of ZD 2p and their matrices of the regular representation of ZD 2p . Recently we characterized the Hadamard matrices of order 28 ([6] and [7]). There are exactly 487 Hadamard matrices of order 28, up to equivalence. In these matrices there exist matrices with some interesting properties. That is, these are constructed by elements of ZD 6. We discuss relation of ZD 2p and Hadamard matrices of order n=8p+4, and give some examples of Hadamard matrices constructed by dihedral groups.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Neural computing & applications 7 (1998), S. 260-272 
    ISSN: 1433-3058
    Keywords: Bend-extraction ; Disinhibition ; Handwritten digits ; Neocognition ; Neural network model ; Pattern recognition ; Vision
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We have reported previously that the performance of a neocognitron can be improved by a built-in bend-extracting layer. The conventional bend-extracting layer can detect bend points and end points of lines correctly, but not always crossing points of lines. This paper shows that an introduction of a mechanism of disinhibition can make the bend-extracting layer detect not only bend points and end points, but also crossing points of lines correctly. This paper also demonstrates that a neocognitron with this improved bend-extracting layer can recognise handwritten digits in the real world with a recognition rate of about 98%. We use the technique of dual thresholds for feature-extracting S-cells, and higher threshold values are used in the learning than in the recognition phase. We discuss how the threshold values affect the recognition rate.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Autonomous robots 7 (1999), S. 247-258 
    ISSN: 1573-7527
    Keywords: quadruped robot ; neural oscillator ; reflex mechanism ; walking on irregular terrain ; gait transition in running
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract In the present study we attempt to induce a quadruped robot to walk dynamically on irregular terrain and run on flat terrain by using a nervous system model. For dynamic walking on irregular terrain, we employ a control system involving a neural oscillator network, a stretch reflex and a flexor reflex. Stable dynamic walking when obstructions to swinging legs are present is made possible by the flexor reflex and the crossed extension reflex. A modification of the single driving input to the neural oscillator network makes it possible for the robot to walk up a step. For running on flat terrain, we combine a spring mechanism and the neural oscillator network. It became clear in this study that the matching of two oscillations by the spring-mass system and the neural oscillator network is important in order to keep jumping in a pronk gait. The present study also shows that entrainment between neural oscillators causes the running gait to change from pronk to bound. This finding renders running fairly easy to attain in a bound gait. It must be noticed that the flexible and robust dynamic walking on irregular terrain and the transition of the running gait are realized by the modification of a few parameters in the neural oscillator network.
    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...