Library

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
  • 1
    Electronic Resource
    Electronic Resource
    An object design framework for structural engineering (1995)
    Springer
    Engineering with computers 11 (1995), S. 213-226 
    Details
    ISSN: 1435-5663
    Keywords: Communication channel ; Communication path ; Data attribute ; Design object ; Method group ; Object-oriented ; Receiving interface ; Relationship ; Relationship attribute ; Sending method
    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 Object-oriented principles have introduced several useful concepts for developing complex software systems. As a result, several methodologies have been suggested for the overall design of software systems based on these concepts. Methodologies and frameworks for designing objects that are to be part of the software systems are currently lacking. This paper proposes anobject design framework andmethodology, which utilizes the object-oriented concepts, for planning, organizing and designing structural engineering design objects. Design objects in an integrated structural engineering system are complex and often related to each other in various different ways. The paper also identifies several important relationships among structural engineering design objects. These relationships serve as communication channels through wich design objects send messages to and receive responses from each other. Several examples, drawn from reinforced concrete structures, will be presented to demonstrate the object design methodology and to illustrate how the framework is effective in reducing the complexity of design objects in an integrated structural engineering system.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01208815
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain (1995)
    Springer
    Applicable algebra in engineering, communication and computing 6 (1995), S. 309-323 
    Details
    ISSN: 1432-0622
    Keywords: Polynomial remainder sequence ; Berlekamp-Massey algorithm ; linear recurring sequence ; factorial domain
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics , Technology
    Notes: Abstract We present an extended polynomial remainder sequence algorithm XPRS for R[X] whereR is a domain. From this we derive a Berlekamp-Massey algorithm BM/R overR. We show that if (α) is a linear recurring sequence in a factorial domainU, then the characteristic polynomials for (α) form aprincipal ideal which is generated by a primitive minimal polynomial. Moreover, this generator ismonic when U[[X]] is factorial (for example, whenU is Z orK[X 1,X2,...,Xn] whereK is a field). From XPRS we derive an algorithm MINPOL for determining the minimal polynomial of (α) when an upper bound on the degree of some characteristic polynomial and sufficiently many initial terms of (α) are known. We also show how to obtain a Berlekamp-Massey type minimal polynomial algorithm from BM/U and state BM_MINPOL/K explicitly with a further refinement. Examples are given forU=Z, GF(2)[Y].
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01235722
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    The Berlekamp-Massey Algorithm and Linear Recurring Sequences Over a Factorial Domain (1995)
    Springer
    Applicable algebra in engineering, communication and computing 6 (1995), S. 309-323 
    Details
    ISSN: 1432-0622
    Keywords: Keywords: Polynomial remainder sequence ; Berlekamp-Massey algorithm ; linear recurring sequence ; factorial domain.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics , Technology
    Notes: Abstract.  We present an extended polynomial remainder sequence algorithm XPRS for R[X] where R is a domain. From this we derive a Berlekamp-Massey algorithm BM/R over R. We show that if (α) is a linear recurring sequence in a factorial domain U, then the characteristic polynomials for (α) form a principal ideal which is generated by a primitive minimal polynomial. Moreover, this generator is monic when U[ [X] ] is factorial (for example, when U is Z or K[X 1 , X 2 , . . . , X n ] where K is a field). From XPRS we derive an algorithm MINPOL for determining the minimal polynomial of (α) when an upper bound on the degree of some characteristic polynomial and sufficiently many initial terms of (α) are known. We also show how to obtain a Berlekamp-Massey type minimal polynomial algorithm from BM/U and state BM – MINPOL/K explicitly with a further refinement. Examples are given for U = Z, GF(2) [Y ].
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s002000050008
    Library Location Call Number Volume/Issue/Year 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...