检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学经济与管理学院,陕西西安710071
出 处:《系统工程》2013年第12期1-9,共9页Systems Engineering
基 金:中央高校基本科研业务费专项资金资助项目(JY10000906014);国家自然科学基金资助项目(71101114);中央高校基本科研业务费子项目研究生创新基金资助项目
摘 要:为满足企业的知识缺口需求,跨企业融知网络需要通过自组织进行重构以获得有序且非冗余的知识交流分层结构。在构造的分层融知系统中,首先解析了节点企业知识交流任务的反馈需求和时间约束特征;进一步根据知识状态流转及其时效性问题,利用带有时钟约束机制的时间自动机对分层融知系统的知识状态转换全过程进行精确描述和建模剖析,并结合可抢占式EDF调度算法动态优化知识流任务的截止期限及响应时间等。最后,针对分层融知系统中衍生的全部知识流任务进行了仿真实验和实时调度算法复杂度对比分析,并据此向节点企业用户提出了有效获取需求创新知识、降低时间成本的建议。This paper presents well-organized and non-redundant knowledge exchange hierarchical structures by self- organizing reconfiguration of the inter-enterprise knowledge-syncretism network, in perspective of satisfying the requirements of enterprises' knowledge gaps. First, the feedback demands and timing constraint features of the knowledge exchange tasks of enterprise nodes are analyzed in the hierarchical knowledge-syncretism system. Second, by considering the problems of knowledge state transition and its timeliness, this research presents an accurate description and a corresponding optimal theoretical model of the process of all the knowledge state transitions in the hierarchical knowledge- syncretism system, by using the time automata with the clock specification mechanism. The earliest deadline first (EDF) algorithm with a preemptive scheme is utilized to dynamically optimize the deadlines and response time of the knowledge flow tasks. Finally, simulations and contrastive analysis of the complexity of real-time scheduling algorithm are discussed for all the knowledge flow tasks derived in the hierarchical knowledge-syncretism system. Accordingly, some suggestions are presented for obtaining innovative knowledge and reducing time cost effectively for the enterprise nodes users.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.177