Complex network modeling characterizes system relationships and structures,while network visualization enables intuitive analysis and interpretation of these patterns.However,existing network visualization tools exhib...Complex network modeling characterizes system relationships and structures,while network visualization enables intuitive analysis and interpretation of these patterns.However,existing network visualization tools exhibit significant limitations in representing attributes of complex networks at various scales,particularly failing to provide advanced visual representations of specific nodes and edges,community affiliation attribution,and global scalability.These limitations substantially impede the intuitive analysis and interpretation of complex network patterns through visual representation.To address these limitations,we propose SFFSlib,a multi-scale network visualization framework incorporating novel methods to highlight attribute representation in diverse network scenarios and optimize structural feature visualization.Notably,we have enhanced the visualization of pivotal details at different scales across diverse network scenarios.The visualization algorithms proposed within SFFSlib were applied to real-world datasets and benchmarked against conventional layout algorithms.The experimental results reveal that SFFSlib significantly enhances the clarity of visualizations across different scales,offering a practical solution for the advancement of network attribute representation and the overall enhancement of visualization quality.展开更多
Automation in the layout of fixture components is important to achieve efficiency and flexibility in computer aided fixture design. Based on basic genetic algorithm and particulars of different fixture components, a m...Automation in the layout of fixture components is important to achieve efficiency and flexibility in computer aided fixture design. Based on basic genetic algorithm and particulars of different fixture components, a method of layout space division is presented. Such techniques as suitable crossover rate, mutation rate and selection arithmetic element are adopted in the genetic operation. The results show that genetic algorithm can effectively be applied in the automatic layout of fixture components.展开更多
Layout design problem is to determine a suitable arrangement for the departments so that the total costs associated with the flow among departments become least. Single Row Facility Layout Problem, SRFLP, is one of th...Layout design problem is to determine a suitable arrangement for the departments so that the total costs associated with the flow among departments become least. Single Row Facility Layout Problem, SRFLP, is one of the layout problems that have many practical applications. This problem and its specific scenarios are often used to model many of the raised issues in the field of facility location. SRFLP is an arrangement of n departments with a specified length in a straight line so that the sum of the weighted distances between the pairs of departments is minimized. This problem is NP-hard. In this paper, first, a lower bound for a special case of SRFLP is presented. Then, a general case of SRFLP is presented in which some new and real assumptions are added to generate more practical model. Then a lower bound, as well as an algorithm, is proposed for solving the model. Experimental results on some instances in literature show the efficiency of our algorithm.展开更多
Stopes can be simply defined as an underground opening from which ore has been excavated.Selection of the best combination of available stope boundary will directly affect the profitability of the operation.While a fe...Stopes can be simply defined as an underground opening from which ore has been excavated.Selection of the best combination of available stope boundary will directly affect the profitability of the operation.While a few attempts has been initiated to generate the optimum stope boundary for underground mining, they fail to guarantee a true optimality in three-dimension block models.This paper proposed a new methodology which can find optimum stope layout for a given resource model in three-dimensions.The paper initially critically reviewed important stope boundary optimisation studies thus far, then proposed a new methodology in order to find the best stope layout for a given deposit.Subsequently it applied the proposed methodology into a block model to test its ability of producing optimum results and demonstrated its applicability in a number of different scenarios.In the last section, further analysis on strategies to find the optimum stope boundaries were demonstrated.The results prove that the proposed algorithm can find optimum stope boundaries and layouts in three-dimension for different stope sizes and stope selections trategies.展开更多
煤炭作为我国的主体能源,其智能通风系统是安全生产的核心。针对矿井通风网络中风量感知信息冗余、解算初始风量分配不合理等导致网络解算效率低的问题,提出一种融合风量智能推演理论与传感器优化布设的协同框架。首先,基于通风网络拓...煤炭作为我国的主体能源,其智能通风系统是安全生产的核心。针对矿井通风网络中风量感知信息冗余、解算初始风量分配不合理等导致网络解算效率低的问题,提出一种融合风量智能推演理论与传感器优化布设的协同框架。首先,基于通风网络拓扑约束与风量平衡定律,结合奇异值分解(Single Value Decomposition,SVD)强化树枝与余树弦风量的数学耦合关系,严格证明大型网络中独立回路数与分支总数之比趋近于1/3的规律,揭示仅需布设约33%分支的传感器即可实现全风网风量推演的理论可行性。其次,构建灵敏度双因子加权生成树模型,以分支自身灵敏度与被影响度的乘积定义边权,结合Kruskal算法确定高信息密度的余树弦分支集。再次,以利用平衡方程直接求解风量的分支数量最大化为优化目标,将余树弦分支集作为解空间,建立一种传感器布局优化模型。最后,设计DETMAX-Tabu混合优化算法,引入禁忌表动态存储高价值分支,突破传统算法局部收敛局限。案例验证表明,基于监测的推演风量可显著加速解算迭代收敛,在22分支的试验网络中,将安装8个传感器对应的推演风量作为初始风量,可使网络解算收敛迭代次数从1062次减少到455次,共减少57.2%。研究成果为矿井通风实时调控提供了一套“传感器优化布置—风量智能推演—解算快速收敛”完整的技术路径,可助力智能通风系统动态响应能力提升。展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.61773091 and 62476045)the LiaoNing Revitalization Talents Program(Grant No.XLYC1807106)the Program for the Outstanding Innovative Teams of Higher Learning Institutions of Liaoning(Grant No.LR2016070).
摘要Complex network modeling characterizes system relationships and structures,while network visualization enables intuitive analysis and interpretation of these patterns.However,existing network visualization tools exhibit significant limitations in representing attributes of complex networks at various scales,particularly failing to provide advanced visual representations of specific nodes and edges,community affiliation attribution,and global scalability.These limitations substantially impede the intuitive analysis and interpretation of complex network patterns through visual representation.To address these limitations,we propose SFFSlib,a multi-scale network visualization framework incorporating novel methods to highlight attribute representation in diverse network scenarios and optimize structural feature visualization.Notably,we have enhanced the visualization of pivotal details at different scales across diverse network scenarios.The visualization algorithms proposed within SFFSlib were applied to real-world datasets and benchmarked against conventional layout algorithms.The experimental results reveal that SFFSlib significantly enhances the clarity of visualizations across different scales,offering a practical solution for the advancement of network attribute representation and the overall enhancement of visualization quality.
摘要Automation in the layout of fixture components is important to achieve efficiency and flexibility in computer aided fixture design. Based on basic genetic algorithm and particulars of different fixture components, a method of layout space division is presented. Such techniques as suitable crossover rate, mutation rate and selection arithmetic element are adopted in the genetic operation. The results show that genetic algorithm can effectively be applied in the automatic layout of fixture components.
摘要Layout design problem is to determine a suitable arrangement for the departments so that the total costs associated with the flow among departments become least. Single Row Facility Layout Problem, SRFLP, is one of the layout problems that have many practical applications. This problem and its specific scenarios are often used to model many of the raised issues in the field of facility location. SRFLP is an arrangement of n departments with a specified length in a straight line so that the sum of the weighted distances between the pairs of departments is minimized. This problem is NP-hard. In this paper, first, a lower bound for a special case of SRFLP is presented. Then, a general case of SRFLP is presented in which some new and real assumptions are added to generate more practical model. Then a lower bound, as well as an algorithm, is proposed for solving the model. Experimental results on some instances in literature show the efficiency of our algorithm.
摘要Stopes can be simply defined as an underground opening from which ore has been excavated.Selection of the best combination of available stope boundary will directly affect the profitability of the operation.While a few attempts has been initiated to generate the optimum stope boundary for underground mining, they fail to guarantee a true optimality in three-dimension block models.This paper proposed a new methodology which can find optimum stope layout for a given resource model in three-dimensions.The paper initially critically reviewed important stope boundary optimisation studies thus far, then proposed a new methodology in order to find the best stope layout for a given deposit.Subsequently it applied the proposed methodology into a block model to test its ability of producing optimum results and demonstrated its applicability in a number of different scenarios.In the last section, further analysis on strategies to find the optimum stope boundaries were demonstrated.The results prove that the proposed algorithm can find optimum stope boundaries and layouts in three-dimension for different stope sizes and stope selections trategies.
摘要煤炭作为我国的主体能源,其智能通风系统是安全生产的核心。针对矿井通风网络中风量感知信息冗余、解算初始风量分配不合理等导致网络解算效率低的问题,提出一种融合风量智能推演理论与传感器优化布设的协同框架。首先,基于通风网络拓扑约束与风量平衡定律,结合奇异值分解(Single Value Decomposition,SVD)强化树枝与余树弦风量的数学耦合关系,严格证明大型网络中独立回路数与分支总数之比趋近于1/3的规律,揭示仅需布设约33%分支的传感器即可实现全风网风量推演的理论可行性。其次,构建灵敏度双因子加权生成树模型,以分支自身灵敏度与被影响度的乘积定义边权,结合Kruskal算法确定高信息密度的余树弦分支集。再次,以利用平衡方程直接求解风量的分支数量最大化为优化目标,将余树弦分支集作为解空间,建立一种传感器布局优化模型。最后,设计DETMAX-Tabu混合优化算法,引入禁忌表动态存储高价值分支,突破传统算法局部收敛局限。案例验证表明,基于监测的推演风量可显著加速解算迭代收敛,在22分支的试验网络中,将安装8个传感器对应的推演风量作为初始风量,可使网络解算收敛迭代次数从1062次减少到455次,共减少57.2%。研究成果为矿井通风实时调控提供了一套“传感器优化布置—风量智能推演—解算快速收敛”完整的技术路径,可助力智能通风系统动态响应能力提升。