期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
Test Generation and Design-for-Testability Based on Acyclic Structure with Hold Registers
1
作者 Tomoo Inoue Debesh Kumar Das +2 位作者 Chiiho Sano Takahiro Mihara Hideo Fujiwara 《湖南大学学报(自然科学版)》 EI CAS CSCD 2000年第S2期1-10,共10页
We present a method of test generation for acyclic sequential circuits with hold registers. A complete (100% fault efficiency) test sequence for an acyclic sequential circuit can be obtained by applying a combinationa... We present a method of test generation for acyclic sequential circuits with hold registers. A complete (100% fault efficiency) test sequence for an acyclic sequential circuit can be obtained by applying a combinational test generator to all the maximal time-expansion models (TEMs) of the circuit. We propose a class of acyclic sequential circuits for which the number of maximal TEMs is one, i.e, the maximum TEM exists. For a circuit in the class, test generation can be performed by using only the maximum TEM. The proposed class of sequential circuits with the maximum TEM properly includes several known classes of acyclic sequential circuits such as balanced structures and acyclic sequential circuits without hold registers for which test generation can be also performed by using a combinational test generator. Therefore, in general, the hardware overhead for partial scan based on the proposed structure is smaller than that based on balanced or acyclic sequential structure without hold registers. 展开更多
关键词 acyclic sequential circuits combinational test generation hold registers maximum time-expansion model partial scan
在线阅读 下载PDF
Discovering causal models for structural,construction and defense-related engineering phenomena
2
作者 M.Z.Naser 《Defence Technology(防务技术)》 2025年第1期60-79,共20页
Causality,the science of cause and effect,has made it possible to create a new family of models.Such models are often referred to as causal models.Unlike those of mathematical,numerical,empirical,or machine learning(M... Causality,the science of cause and effect,has made it possible to create a new family of models.Such models are often referred to as causal models.Unlike those of mathematical,numerical,empirical,or machine learning(ML)nature,causal models hope to tie the cause(s)to the effect(s)pertaining to a phenomenon(i.e.,data generating process)through causal principles.This paper presents one of the first works at creating causal models in the area of structural and construction engineering.To this end,this paper starts with a brief review of the principles of causality and then adopts four causal discovery algorithms,namely,PC(Peter-Clark),FCI(fast causal inference),GES(greedy equivalence search),and GRa SP(greedy relaxation of the sparsest permutation),have been used to examine four phenomena,including predicting the load-bearing capacity of axially loaded members,fire resistance of structural members,shear strength of beams,and resistance of walls against impulsive(blast)loading.Findings from this study reveal the possibility and merit of discovering complete and partial causal models.Finally,this study also proposes two simple metrics that can help assess the performance of causal discovery algorithms. 展开更多
关键词 CAUSALITY Causal discovery Directed acyclic graphs Machine learning Metrics
在线阅读 下载PDF
一种基于模糊聚类的网格DAG任务图调度算法 被引量:48
3
作者 杜晓丽 蒋昌俊 +1 位作者 徐国荣 丁志军 《软件学报》 EI CSCD 北大核心 2006年第11期2277-2288,共12页
针对网格环境中,任务调度的目标系统具有规模庞大、分布异构和动态性等特点,提出一种基于模糊聚类的网格异构任务调度算法.以往的很多调度算法需要在调度的每一步遍历整个目标系统,虽然能够获得较小的makespan,但是无疑增加了整个调度的... 针对网格环境中,任务调度的目标系统具有规模庞大、分布异构和动态性等特点,提出一种基于模糊聚类的网格异构任务调度算法.以往的很多调度算法需要在调度的每一步遍历整个目标系统,虽然能够获得较小的makespan,但是无疑增加了整个调度的Runtime.定义了一组刻画处理单元综合性能的特征,利用模糊聚类方法对目标系统(处理单元网络)进行预处理,实现了对处理单元网络的合理划分,使得在任务调度时能够较准确地优先选择综合性能较好的处理单元聚类,从而缩小搜索空间,大量减少任务调度时选择处理单元的时间耗费.此外,就绪任务优先级的构造既隐含考虑了关键路径上节点的执行情况对整个程序执行的影响,又考虑了异构资源对任务执行的影响.实验及性能分析比较的结果表明,定义的处理器特征能够实现对处理器网络的合理划分,而且随着目标系统规模的增大,所提出的算法优越性越来越明显. 展开更多
关键词 网格 DAG(direct acyclic grapb) 任务调度 模糊聚类 异构计算环境
在线阅读 下载PDF
Multi-satellite observation integrated scheduling method oriented to emergency tasks and common tasks 被引量:23
4
作者 Guohua Wu Manhao Ma +1 位作者 Jianghan Zhu Dishan Qiu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2012年第5期723-733,共11页
Satellite observation scheduling plays a significant role in improving the efficiency of satellite observation systems.Although many scheduling algorithms have been proposed,emergency tasks,characterized as importance... Satellite observation scheduling plays a significant role in improving the efficiency of satellite observation systems.Although many scheduling algorithms have been proposed,emergency tasks,characterized as importance and urgency(e.g.,observation tasks orienting to the earthquake area and military conflict area),have not been taken into account yet.Therefore,it is crucial to investigate the satellite integrated scheduling methods,which focus on meeting the requirements of emergency tasks while maximizing the profit of common tasks.Firstly,a pretreatment approach is proposed,which eliminates conflicts among emergency tasks and allocates all tasks with a potential time-window to related orbits of satellites.Secondly,a mathematical model and an acyclic directed graph model are constructed.Thirdly,a hybrid ant colony optimization method mixed with iteration local search(ACO-ILS) is established to solve the problem.Moreover,to guarantee all solutions satisfying the emergency task requirement constraints,a constraint repair method is presented.Extensive experimental simulations show that the proposed integrated scheduling method is superior to two-phased scheduling methods,the performance of ACO-ILS is greatly improved in both evolution speed and solution quality by iteration local search,and ACO-ILS outperforms both genetic algorithm and simulated annealing algorithm. 展开更多
关键词 satellite scheduling emergency task ant colony optimization(ACO) iteration local search(ILS) acyclic directed graph model
在线阅读 下载PDF
Modified origin-based algorithm for traffic equilibrium assignment problems 被引量:1
5
作者 张天然 杨超 陈冬栋 《Journal of Central South University》 SCIE EI CAS 2011年第5期1765-1772,共8页
Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes w... Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes were proposed.The methods of step-size searching and bush construction are proved to be practical.The modified OUE algorithm procedure was also optimized to take the advantage of multi-thread process.Convergence performances were compared with those of other algorithms by different sizes of urban transportation networks.The result shows this modified OUE algorithm is more efficient and consumes less time to achieve the reasonable relative gap in practical applications. 展开更多
关键词 traffic assignment origin-based user equilibrium algorithm acyclic network
在线阅读 下载PDF
EZDCP:A new static task scheduling algorithm with edge-zeroing based on dynamic critical paths 被引量:1
6
作者 陈志刚 华强胜 《Journal of Central South University of Technology》 2003年第2期140-144,共5页
A new static task scheduling algorithm named edge-zeroing based on dynamic critical paths is proposed. The main ideas of the algorithm are as follows: firstly suppose that all of the tasks are in different clusters; s... A new static task scheduling algorithm named edge-zeroing based on dynamic critical paths is proposed. The main ideas of the algorithm are as follows: firstly suppose that all of the tasks are in different clusters; secondly, select one of the critical paths of the partially clustered directed acyclic graph; thirdly, try to zero one of graph communication edges; fourthly, repeat above three processes until all edges are zeroed; finally, check the generated clusters to see if some of them can be further merged without increasing the parallel time. Comparisons of the previous algorithms with edge-zeroing based on dynamic critical paths show that the new algorithm has not only a low complexity but also a desired performance comparable or even better on average to much higher complexity heuristic algorithms. 展开更多
关键词 EZDCP directed acyclic graph DYNAMIC critical PATH TASK scheduling algorithm
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部