Towards rapid redesign - Decomposition patterns for large-scale and complex redesign problems

被引:0
|
作者
Chen, Li [1 ]
Li, Simon [1 ]
Macwan, Ashish [1 ]
机构
[1] United Technol Res Ctr, E Hartford, CT 06108 USA
关键词
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In an effort to develop a decomposition-based rapid redesign methodology, this paper introduces the basis of such a methodology on decomposition patterns for a general redesign problem that is computation-intensive and simulation-complex. In particular, through pattern representation and quantification, this paper elaborates the role and utility of the decomposition patterns in decomposition-based rapid redesign. In pattern representation, it shows how a decomposition pattern can be used to capture and portray the intrinsic properties of a redesign problem. Thus, through pattern synthesis, the collection of proper decomposition patterns allows one to effectively represent in a concise form the complete body of redesign knowledge covering all redesign problem types. In pattern quantification, it shows how a decomposition pattern can be used to extract and convey the quantum information of a redesign problem using the pattern characteristics. Thus, through pattern analysis, the formulation of an index incorporating two redesign metrics allows one to efficiently predict in a simple manner the amount of potential redesign effort for a given redesign problem. This work represents a breakthrough in extending the decomposition-based solution approach to computational redesign problems.
引用
收藏
页码:73 / 82
页数:10
相关论文
共 50 条
  • [41] DECOMPOSITION AGGREGATION AND PARALLEL COMPUTATIONS IN LARGE-SCALE EXTREMAL PROBLEMS
    LITVINCHEV, IS
    ADVANCES IN ENGINEERING SOFTWARE, 1995, 22 (01) : 21 - 27
  • [42] Solving Large-Scale Planning Problems by Decomposition and Macro Generation
    Asai, Masataro
    Fukunaga, Alex
    PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING, 2015, : 16 - 24
  • [43] A decomposition algorithm for solving large-scale quadratic programming problems
    Li, HM
    Zhang, KC
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 173 (01) : 394 - 403
  • [44] A problem decomposition approach for large-scale global optimization problems
    Vakhnin, A. V.
    Sopov, E. A.
    Panfilov, I. A.
    Polyakova, A. S.
    Kustov, D. V.
    INTERNATIONAL WORKSHOP ADVANCED TECHNOLOGIES IN MATERIAL SCIENCE, MECHANICAL AND AUTOMATION ENGINEERING - MIP: ENGINEERING - 2019, 2019, 537
  • [45] Towards an Understanding of Large-Scale Biodiversity Patterns on Land and in the Sea
    Beaugrand, Gregory
    BIOLOGY-BASEL, 2023, 12 (03):
  • [46] The utility of rapid application development in large-scale, complex projects
    Berger, Hilary
    Beynon-Davies, Paul
    INFORMATION SYSTEMS JOURNAL, 2009, 19 (06) : 549 - 570
  • [47] Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs
    Wang, Kai
    Lin, Xuemin
    Qin, Lu
    Zhang, Wenjie
    Zhang, Ying
    VLDB JOURNAL, 2022, 31 (02): : 203 - 226
  • [48] Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs
    Kai Wang
    Xuemin Lin
    Lu Qin
    Wenjie Zhang
    Ying Zhang
    The VLDB Journal, 2022, 31 : 203 - 226
  • [49] Towards Self-Healing of Large-Scale Complex Simulations
    Haupt, Tomasz
    Sukhija, Nitin
    PROCEEDINGS OF THE 2012 GRAND CHALLENGES IN MODELING & SIMULATION (GCMS '12), 2012, 44 (11): : 70 - 77
  • [50] Space-decomposition minimization method for large-scale minimization problems
    Liu, CS
    Tseng, CH
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1999, 37 (07) : 73 - 88