Skip to main content
SpringerLink
Log in

Using Graph Complexity Connectivity Method to Predict Information from Design Representations: A Comparative Study

  • Conference paper
  • First Online:
Design Computing and Cognition '16

Abstract

The objective of this research is to compare the value of information in a design representation used in product development. Two representations are explored in this study: assembly models and function structures. These representations are used to predict assembly time and market value for electromechanical products. This works builds on previous work on using complexity connectivity method to predict assembly time. The precision error is used as a metric to understand how valuable a representation is in answering a specific question. By measuring the value of a representation, designers can select between different representations and monitor the information accumulation in the design project.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Ahn J, Crawford R (1994) Complexity analysis of computational engineering design. In: ASME international design engineering technical conferences and computers and information in engineering conference, ASME, Minneapolis, MN, pp 205–220

    Google Scholar 

  • Ameri F, Summers JD, Mocko GM, Porter M (2008) Engineering design complexity: an investigation of methods and measures. Res Eng Des 19(2):161–179

    Article  Google Scholar 

  • Bader GD, and Hogue CWV (2003) An automated method for finding molecular complexes in large interaction network. BMC Bioinf 4

    Google Scholar 

  • Balazs M, Brown D (2002) Design simplification by analogical reasoning. From knowledge intensive CAD to knowledge intensive engineering. Kluwer, Norwell, pp 29–44

    Google Scholar 

  • Barclay I, Dann Z (2000) New-product-development performance evaluation: a product-complexity-based methodology. IEE Proc: Sci Meas Technol 147(3):41–55

    Google Scholar 

  • Bashir HA, Thomson V (2001) An analogy-based model for estimating design effort. Des Stud 22:157–167

    Article  Google Scholar 

  • Braha D, Maimon O (1998a) The measurement of a design structural and functional complexity. IEEE Trans Syst Man Cybern (Part A Syst. Humans) 28(4):527–535

    Google Scholar 

  • Braha D, Maimon O (1998b) A mathematical theory of design: foundations, algorithms, and applications. Kluwer, Dordrecht

    Book  MATH  Google Scholar 

  • Deshmukh A, Talavage J, Barash M (1998) Complexity in manufacturing systems—part 1: analysis of static complexity. IIE Trans 30:645

    Google Scholar 

  • Dixon J, Duffey M, Irani R, Meurier K, Orelup M (1988) A proposed taxonomy of mechanical design problems. In: Computers in engineering conference, ASME, New York, pp 41–46

    Google Scholar 

  • El-Haik B, Yang K (1999) The components of complexity in engineering design. IIE Trans 31:925–934

    Google Scholar 

  • Fitzhorn P (1994) Engineering design as a computable function. Artif Intell Eng Des Anal Manuf 8:35–44

    Article  Google Scholar 

  • Freeman L (1977) A set of measures of centrality based on betweenness. Soc Netw 40:35–41

    Google Scholar 

  • Freeman L (1979) Centrality in social networks: conectual clarification. Soc Netw 1:215–239

    Article  Google Scholar 

  • Goldberg AV, Tarjan RE (1986) A new approach to the maximum flow problem. In: Annual ACM symposium theory on computational, New York, pp 136–146

    Google Scholar 

  • Harrison W, Magel K (1981) A complexity measure based on nesting level. SIGPLAN Not. 16:63–74

    Article  Google Scholar 

  • Kohzadi N, Boyd MS, Kermanshahi B, Kaastra I, Khozadi N (1996) A comparison of artificial neural networks and time series models for forecasting commodity prices. Neurocomputing 10(2):161–181

    Article  MATH  Google Scholar 

  • Koschutzki D, Lehmann KA, Peeters L, Richer S, Tenfelde-Podehl D, Zlotowski (2005) Centrality indices. In: Brandes U, Erlebach T (eds) Network analysis: methodological foundations. Springer, New York

    Google Scholar 

  • Mathieson JL, Summers JD (2009) Relational DSMs in connectivity complexity measurement. In Proceedings of the 11th international DSM conference, pp 15–26

    Google Scholar 

  • Mathieson JL, Summers JD (2010) Complexity metrics for directional node-link system representations: theory and applications. In: ASME international design engineering technical conferences and computers and information in engineering conference, ASME, Montreal, Canada, pp DETC2010–28561

    Google Scholar 

  • Mathieson JL, Wallace BA, Summers JD (2013) Assembly time modelling through connective complexity metrics. Int J Comput Integr Manuf 26(10):955–967. doi:10.1080/0951192X.2012.684706

    Article  Google Scholar 

  • Namouz E, Summers JD (2014) Comparison of graph generation methods for structural complexity based assembly time estimation. ASME Trans J Comput Inf Sci Eng 14(2):021003

    Article  Google Scholar 

  • Ostergaard KJ, Summers JD (2007) Resistance based modeling of collaborative design. Concurr Eng 15(1):21–32

    Article  Google Scholar 

  • Owensby JE, Namouz EZ, Shanthakumar A, Summers JD (2012) Representation: extracting mate complexity from assembly models to automatically predict assembly times. In: ASME international design engineering technical conferences and computers and information in engineering conference, ASME, Chicago, pp DETC2012–70995

    Google Scholar 

  • Pahl G, Beitz W, Wallace K, Blessing L (2007) Engineering design: a systematic approach. Springer London Limited, London

    Book  Google Scholar 

  • Perzyk M, Biernacki R, KochaÅ„ski A (2005) Modeling of manufacturing processes by learning systems: the naïve Bayesian classifier versus artificial neural networks. J Mater Process Technol 164:1430–1435

    Article  Google Scholar 

  • Phukan A, Kalava M, Prabhu V (2005) Complexity metrics for manufacturing control architecture based on software and information flow. Comput Ind Eng 49:1–20

    Article  Google Scholar 

  • Pramanick I, Ali H (1994) Analysis and experiments for a parallel solution to the all pairs shortest path problem. In: IEEE international symposium on circuits systems, New York

    Book  Google Scholar 

  • Sabidussi G (1966) The Centrality Index of a Graph. Psychometrika 31:581–603

    Article  MathSciNet  MATH  Google Scholar 

  • Shah JJ, Runger G (2011) Misuse of information-theoretic dispersion measures as design complexity metrics. In: ASME international design engineering technical conferences and computers and information in engineering conference, ASME, Washington, pp DETC2011/DTM–48295

    Google Scholar 

  • Sharda R, Patil RB (1992) Connectionist approach to time series prediction: an empirical test. J Intell Manuf 3:317–323

    Article  Google Scholar 

  • Shtub A, Versano R (1999) Estimating the cost of steel pipe bending: a comparison between neural networks and regression analysis. Int J Prod Econ 62:201–207

    Article  Google Scholar 

  • Simon H (1998) The sciences of the artificial. MIT Press, Cambridge

    Google Scholar 

  • Singh G, Balaji S, Shah JJ, Corman D, Howard R, Mattikalli R, Stuart D (2012) Evaluation of network measures as complexity metrics. In: ASME international design engineering technical conferences and computers and information in engineering conference, ASME, Chicago, pp DETC2012–70483

    Google Scholar 

  • Sinha K, de Weck OL (2013a) A network-based structural complexity metric for engineered complex systems. In: 2013 IEEE international systems conference (SysCon), pp 426–430

    Google Scholar 

  • Sinha K, de Weck OL (2013b) Structural complexity quantification for engineered complex systems and implications on system architecture and design. In: ASME 2013 international design engineering technical conferences and computers and information in engineering conference, American Society of Mechanical Engineers, pp V03AT03A044–V03AT03A044

    Google Scholar 

  • Suh N (1999) A theory of complexity, periodicity, and the design axioms. Res Eng Des 11:116–131

    Article  Google Scholar 

  • Suh N (2001) Axiomatic design: advances and applications. Oxford University Press, New York

    Google Scholar 

  • Summers JD, Ameri F (2008) An algorithm for assessing design complexity through a connectivity view. In: Proceedings of the TMCE 2008

    Google Scholar 

  • Summers JD, Shah JJ (2010) Mechanical engineering design complexity metrics: size, coupling, and solvability. J Mech Des 132(2):021004

    Article  Google Scholar 

  • Summers JD, Eckert C, Goel AK (2013) Function in engineering: benchmarking representations and models. In: International conference on engineering design. The Design Society, Seoul

    Google Scholar 

  • Summers JD, Miller MG, Mathieson JL, Mocko GM, Summers JD, Mathieson JL, Mocko GM (2014) Manufacturing assembly time estimation using structural complexity metric trained artificial neural networks. J Comput Inf Sci Eng 14(1):11005

    Article  Google Scholar 

  • Tu JV (1996) Advantages and disadvantages of using artificial neural networks versus logistic regression for predicting medical outcomes. J Clin Epidemiol 49(11):1225–1231

    Article  Google Scholar 

  • Varma D, Trachterberg E (1990) On the estimation of logic complexity for design automation applications. In: International conference on computer design: VLSI in computers and processors, Cambridge

    Google Scholar 

  • Watts DJ, Strogatz S (1998) Collective dynamics of ‘Small-World’ Networks. Nature 393(6):440–442

    Article  Google Scholar 

  • Zhang G, Patuwo BE, Hu MY (1998) Forecasting with artificial neural network: the state of the art. Int J Forecast 14(1):35–62

    Article  Google Scholar 

  • Zuse H (1991) Software complexity: measures and methods. Walter de Gruyter and Co., New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Clemson University, Clemson, South Carolina, USA

    C. V. Sri Ram Mohinder, Amaninder Gill & Joshua D. Summers

Authors
  1. C. V. Sri Ram Mohinder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amaninder Gill
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joshua D. Summers
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joshua D. Summers .

Editor information

Editors and Affiliations

  1. Department of Computer Science and School of Architecture, University of North Carolina at Charlotte, Charlotte, North Carolina, USA

    John. S Gero

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this paper

Cite this paper

Sri Ram Mohinder, C.V., Gill, A., Summers, J.D. (2017). Using Graph Complexity Connectivity Method to Predict Information from Design Representations: A Comparative Study. In: Gero, J. (eds) Design Computing and Cognition '16. Springer, Cham. https://doi.org/10.1007/978-3-319-44989-0_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44989-0_36

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44988-3

  • Online ISBN: 978-3-319-44989-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation