Page 316 - Practical Design Ships and Floating Structures
P. 316

29 I
        seven  inputs.  In  this manner,  the  database  can  be  populated  with  extended data  of  seakeeping
        characteristics for future analysis.


        5  DISCUSSION AND CONCLUSION
        Consideration of  reuse  in  design  is  usually  related  to  components.  Data  reuse,  although  not
        uncommon, is rarely, if ever, discussed.  And yet large and reliable databases of design data are often
        put  together for future use.  It  can  be observed  that the use  of  such databases can  be  made more
        intelligent and rewarding by considering data reuse in a formal manner.  It is obvious that it is possible
        to have decomposition without reuse and reuse without decomposition, but when used in combination
        it opens up new opportunities for either approach.

        This paper addresses three common tasks performed by a designer: decomposing design problems into
        manageable tasks, applying past  experience (knowledge and  design  data)  and  extending  design
        knowledge.  The first task relates to decomposition and  the latter two  to  reuse.  These tasks are
        illustrated through a preliminary ship design example.
        The hypergraph partitioning approach used in the example in this paper is able to decompose a design
        problem into sub-problems with a minimum number of linking variables (hence co-ordination effort).
        Apart  from  design constraint equations, the hypergraph representation can  also be  used  to model
        design activities and variables.  The example design problem is decomposed into two sub-problems
        using this approach.  The division of work shows a sensible pattern.  Reuse concepts are then used to
        assemble candidate  Pareto  optimal designs for  one  of  the  sub-problems into  which  the  original
        problem  was decomposed.  The reuse concept  is then extended to  include an  associated satellite
        application.  It is clear, on the basis of the above, that decomposition and data reuse have in-built
        capabilities that can be beneficially  taken advantage of.


        References
        Chao, K.  M.;  Smith, P.;  Hills W.;  Florida-James, B. and Norman, P. (1998). Knowledge Sharing and
        Reuse for Engineering Design Integration, Expert systems with applications. 14~3,399.
        Hendrickson,  B. and Leland R. (1995). A Multilevel Algorithm for Partitioning Graphs, Proceedings
        of Supercomputing 95, 1995 December, San Diego, CA, 62-57.
        Karypis,  G.; Aggarwal, R.;  Kumar, V.  and Shekhar, S. (1997).  Multilevel Hypergraph Partitioning:
        application in VLSI Domain, 3k  Design Automation Confrence, 1997 June, Anaheim, CA, 526-529.
        Karypis, G. and Kumar, V.  (1998).  Wetis, A Hypergraph Partitioning Package, Version 1.5.3  (User
        Guide),  University  of  Minnesota, Department  of  Computer Science  & Engineering, Army  HPC
        Research Center, Minneapolis, MN 55455.
        Koopman, P. J. (1995). A Taxonomy of Decomposition Strategies Based on Structures, Behaviors, and
        Goals,  9th International  Conference Design  Theoly and  Methodology,  September  Boston,  ASME
        Publications DE 1995, 83:2,611-618.
        Rao,  Z and  Sen, P.  (1999).  Design  Decomposition  and Coordination of Multidisciplinary System
        Optimisation, International Conference on Engineering Design, 12th August 1999,Munich, Germany,
        Wdk Workshop Design Konstruktion,  2:26,733-738.
        Sen, P. and Yang, J. B. (1998).  Multiple Criteria Decision Support in Engineering Design, Springer-
        Verlag, London.
        Scott, J.  and  Sen, P. (1998).  Focusing Design Reuse Initiatives using the Design Structure Matrix
        System,  Engineering Design Conference 98,35 1-359.
        Sivaloganathan, S.  and Shahin, T. M. M.  (1999).  Design Reuse.:  An Overview, Proceedings  of the
        Institution  of Mechanical Engineers. Part B, Journal of engineering manufacture. 213:7,641-654.
   311   312   313   314   315   316   317   318   319   320   321