โ Scribed by L.E. Stanfel
No coin nor oath required. For personal study only.
Hierarchical decomposition is the technique principally advocated for the representation, analysis, and design of information systems and, more generally, any sort of complicated system. Once the tree representation has been obtained the ensuing task is to partition the subsystems somehow and allocate this work to design groups. A new algorithm is given for this partitioning problem. It is based on the diverging branch systems treated by dynamic programming. A numerical example is provided, and the transition to very large trees (systems) is seen to be straightforward.
๐ SIMILAR VOLUMES
## Abstract An information system is not merely a container for documents; through the ways that resources are selected, organized, and made available to users, information systems themselves work as expressive media, enabling the communication of a specific point of view on the collected materials