ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Bingley : Emerald
    Internet research 13 (2003), S. 242-258 
    ISSN: 1066-2243
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: With the worldwide growth of open telecommunication networks and in particular the Internet, the privacy and security concerns of people using these networks have increased. On the one hand, users are concerned about their privacy, and desire to anonymously access the network. On the other hand, some organizations are concerned about how this anonymous access might be abused. This paper intends to bridge these conflicting interests, and proposes a solution for revocable anonymous access to the Internet. Moreover, the paper presents some legal background and motivation for such a solution. However, the paper also indicates some difficulties and disadvantages of the proposed solution, and suggests the need for further debate on the issue of online anonymity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Circuits, systems and signal processing 9 (1990), S. 301-317 
    ISSN: 1531-5878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract The objective of this paper is to present an algebraic theory for analyzing the infinite structures of singular systems. The key concept used in the development is the so-called homogeneous form for polynomial and rational matrices, which can be seen as a generalization of the well-known notion of homogeneous form for matrix pencils. We show how familiar concepts such as matrix fraction description, infinite poles and zeros, irreducibility, and cancellation at infinity appear naturally in this framework. The characterizations for some of these concepts are derived in terms of homogeneous forms. Considering singular systems to be alternative representations for (possibly nonproper) rational matrices, we are able to relate the fundamental concepts of controllability and reconstructibility for singular systems to the concept of complete coprimeness for rational matrices, and to relate the concept of minimal order of singular systems to the concept of the McMillan degree of rational matrices. As an important result, the equivalence relations among the concepts of joint controllability and reconstructibility, minimal order, and complete irreducibility are established. Moreover, we show that for any rational matrix factorized in matrix fraction description, the determinantal degree of the denominator matrix is the McMillan degree of the rational matrix if and only if the matrix fraction description is completely irreducible.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 57 (1992), S. 415-426 
    ISSN: 1436-4646
    Keywords: Linear complementarity ; piecewise linear equations ; double description method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Motivated by a number of typical applications, a generalization of the classicallinear complementarity problem is presented together with an algorithm to determine the complete solution set. The algorithm is based on the double description method for solving linear inequalities and succeeds in describing continuous as well as unbounded solution sets.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 55 (1989), S. 431-449 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 15A18 ; 65F20 CR: G1.3
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper the closeness of the total least squares (TLS) and the classical least squares (LS) problem is studied algebraically. Interesting algebraic connections between their solutions, their residuals, their corrections applied to data fitting and their approximate subspaces are proven. All these relationships point out the parameters which mainly determine the equivalences and differences between the two techniques. These parameters also lead to a better understanding of the differences in sensitivity between both approaches with respect to perturbations of the data. In particular, it is shown how the differences between both approaches increase when the equationsAX≈B become less compatible, when the length ofB orX is growing or whenA tends to be rank-deficient. They are maximal whenB is parallel with the singular vector ofA associated with its smallest singular value. Furthermore, it is shown how TLS leads to a weighted LS problem, and assumptions about the underlying perturbation model of both techniques are deduced. It is shown that many perturbation models correspond with the same TLS solution.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    The journal of VLSI signal processing systems for signal, image, and video technology 23 (1999), S. 449-463 
    ISSN: 1573-109X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract This paper is concerned with the implementation of an image comparison algorithm and cryptographic hash functions on the regular array of cellular neural network (CNN) cells. These operations are necessary for message authentication and copyright protection in the multimedia service environment, serving both the interest of the copyright owner and the user. The basic problems of multimedia protection along with the requirements and role of the different actors in a multimedia service environment are also described here.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    The journal of VLSI signal processing systems for signal, image, and video technology 3 (1991), S. 163-172 
    ISSN: 1573-109X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract In this contribution, a covariance counterpart is described of the information matrix approach to constrained recursive least squares estimation. Unlike information-type algorithms, covariance algorithms are amenable to parallel implementation, e.g., on processor arrays, and this is also demonstrated. As compared to previously described combined covariance-information algorithms/arrays, the present implementation avoids a doubling of the hardware requirement, and therefore constitutes a significant improvement over these combined implementations as well.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    The journal of VLSI signal processing systems for signal, image, and video technology 3 (1991), S. 193-200 
    ISSN: 1573-109X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract High level memory management is an important step during the automatic synthesis of application specific micro coded processors aimed at multi-dimensional signal processing in real-time. For given throughput and I/O flow requirements, the objective is to derive the optimal background memory organization where the cost due to storage size and address requirements are minimized. In this paper, a contribution will be proposed to this complex problem. A strategy will be presented to detect the possibility forin-place storage and to deduce thememory requirements for the implementation of numerical matrix type of algorithms on a single ASIC chip.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    ISSN: 1572-9699
    Keywords: biotechnological modeling ; maintenance and endogenous metabolism ; parameter estimation ; penicillin fed-batch fermentation ; unstructured model
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract The mathematical model for the penicillin G fed-batch fermentation proposed by Heijnen et al. (1979) is compared with the model of Bajpai & Reuß (1980). Although the general structure of these models is similar, the difference in metabolic assumptions and specific growth and production kinetics results in a completely different behaviour towards product optimization. A detailed analysis of both models reveals some physical and biochemical shortcomings. It is shown that it is impossible to make a reliable estimation of the model parameters, only using experimental data of simple constant glucose feed rate fermentations with low initial substrate amount. However, it is demonstrated that some model parameters might be key factors in concluding whether or not altering the substrate feeding strategy has an important influence on the final amount of product. It is illustrated that feeding strategy optimization studies can be a tool in designing experiments for parameter estimation purposes.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 1987-04-01
    Print ISSN: 0024-3795
    Electronic ISSN: 1873-1856
    Topics: Mathematics
    Published by Elsevier
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 1987-08-01
    Print ISSN: 0024-3795
    Electronic ISSN: 1873-1856
    Topics: Mathematics
    Published by Elsevier
    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...