检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:梁梓源 杨春燕[1,2] Liang Zi-yuan;Yang Chun-yan(Institute of Extenics and Innovation Methods,Guangdong University of Technology,Guangzhou 510006,China;School of Electromechanical Engineering,Guangdong University of Technology,Guangzhou 510006,China)
机构地区:[1]广东工业大学可拓学与创新方法研究所,广东广州510006 [2]广东工业大学机电工程学院,广东广州510006
出 处:《广东工业大学学报》2023年第5期1-7,共7页Journal of Guangdong University of Technology
基 金:国家自然科学基金资助项目(72071049)。
摘 要:当前,信息和知识的数量都在快速增长,企业、组织和个人所面临的很多问题都呈现出非线性、不确定性强、动态化等特点。将目标和领域相对确定,边界条件不确定或不足导致问题表达不清晰、目标难以实现的问题称为开放性问题。本文以可拓学中矛盾问题的可拓模型构建方法和求解方法为基础,提出了开放性问题的初始可拓模型的构建方法和利用拓展分析方法与可拓变换方法对单目标开放性问题进行求解的方法。最后通过一个案例证明该方法的可行性。由于该研究应用了形式化定量化相结合的方法,因此也为单目标开放性问题的智能化求解及多目标开放性问题求解的研究打下了基础。Currently,the amount of both information and knowledge is growing rapidly,and many problems faced by enterprises,organizations and individuals are characterized by non-linearity,high uncertainty and dynamism.Problems with relatively definite goals and domains and uncertain or insufficient boundary conditions leading to unclear problem expression and difficult goal achievement are called ill-defined problems.In this research,based on the method of constructing the extension model and solving the contradictory problem in Extenics,the method of constructing the initial extension model of the ill-defined problems and the method of solving the single-goal illdefined problems are proposed by using the extensible analysis method and the extension transformation method.Finally,the feasibility of the method is demonstrated by a case study.Since this study applies a combination of formal and quantitative methods,it also lays the foundation for the intelligent solution of single-goal ill-defined problems and the study of multi-goal ill-defined problems.
关 键 词:开放性问题 可拓模型 拓展分析 可拓变换 可拓学
分 类 号:TH122[机械工程—机械设计及理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7