A new algorithm for the solution of under constraint graph in sketch drawing is put forward. The directed process of constraint graph is completed by picking concealed constraints of adjacent entities in sketch of few...A new algorithm for the solution of under constraint graph in sketch drawing is put forward. The directed process of constraint graph is completed by picking concealed constraints of adjacent entities in sketch of few or no dimensions. In this paper, the priority of concealed constraint is given by the different constraint types and constructing orders, and some more priority concealed constraints are forced into obvious ones by the need number of constraint for every node in constraint solution process.展开更多
A promising approach on the search for geometric constraint of directionalgraph in off-line parametric design has been put forward. The method for representation of thedirectional graph is given firstly, then the cons...A promising approach on the search for geometric constraint of directionalgraph in off-line parametric design has been put forward. The method for representation of thedirectional graph is given firstly, then the constraint model for every geometry element is putforward. By the search of geometric constraint, it sets up the topology constraint relation on thedifferent element objects, which are not related in geometry data base, and achieves the identifyfor the directional graph. The algorithm of recognizing geometric constraint is described in detail,in the meantime, the application example in off-line parametric design on dimension-driven isgiven.展开更多
This paper presents one novel spatial geometric constraints histogram descriptors （SGCHD） based on curvature mesh graph for automatic three-dimensional （3D） pollen particles recognition. In order to reduce high di...This paper presents one novel spatial geometric constraints histogram descriptors （SGCHD） based on curvature mesh graph for automatic three-dimensional （3D） pollen particles recognition. In order to reduce high dimensionality and noise disturbance arising from the abnormal record approach under microscopy, the separated surface curvature voxels are ex- tracted as primitive features to represent the original 3D pollen particles, which can also greatly reduce the computation time for later feature extraction process. Due to the good invariance to pollen rotation and scaling transformation, the spatial geometric constraints vectors are calculated to describe the spatial position correlations of the curvature voxels on the 3D curvature mesh graph. For exact similarity evaluation purpose, the bidirectional histogram algorithm is applied to the spatial geometric constraints vectors to obtain the statistical histogram descriptors with fixed dimensionality, which is invariant to the number and the starting position of the curvature voxels. Our experimental results compared with the traditional methods validate the argument that the presented descriptors are invariant to different pollen particles geometric transformations （such as posing change and spatial rotation）, and high recognition precision and speed can be obtained simultaneously.展开更多
“双碳”背景下,异质能源的耦合加剧迫使综合能源系统(integrated energy system, IES)拓扑朝着更复杂、更灵活的方向不断演变。然而,现有优化调度方法对非欧网络拓扑知识及其异质潮流约束考虑不足。针对这一问题,提出一种基于图强化学...“双碳”背景下,异质能源的耦合加剧迫使综合能源系统(integrated energy system, IES)拓扑朝着更复杂、更灵活的方向不断演变。然而,现有优化调度方法对非欧网络拓扑知识及其异质潮流约束考虑不足。针对这一问题,提出一种基于图强化学习的综合能源系统优化调度方法。首先,基于图理论在保证节点多样状态的情况下,将异质能源网络拓扑转换为网络图模型。其次,通过建立基于真实图映射的状态-动作-奖励的框架,利用图强化学习的方法学习图模型的非欧拓扑信息,将异质潮流知识加入系统节点运行状态,从而实现IES的安全优化调度。最后,利用某工业园区的真实数据进行仿真验证,所提方法相对于传统方法有效缓解了节点电压越限的问题。结果表明,所提方法能够在考虑IES真实拓扑运行状态信息和异质潮流安全的情况下实现IES的优化调度。展开更多
This paper proposes a constructive approach to solving geometric constraint systems.The approach incorporates graph-based and rule-based approaches, and achieves interactive speed.The paper presents a graph representa...This paper proposes a constructive approach to solving geometric constraint systems.The approach incorporates graph-based and rule-based approaches, and achieves interactive speed.The paper presents a graph representation of geometric conStraint syStems, and discusses in detailthe algorithm of geometric reasoning based on poinl-cluster reduction. An example is made forillustration.展开更多
Given n unit execution time (UET) tasks whose precedence constraints form a directed acyclic graph, the arcs are associated with unit communication time (UCT) delays. The problem is to schedule the tasks on two identi...Given n unit execution time (UET) tasks whose precedence constraints form a directed acyclic graph, the arcs are associated with unit communication time (UCT) delays. The problem is to schedule the tasks on two identical processors in order to minimize the makespan. Several polynomial algorithms in the literature are proposed for special classes of digraphs, but the complexity of solving this problem in general case is still a challenging open question. We present in this paper an O(n) time algorithm to compute an optimal schedule for the class of bipartite digraphs of depth one.展开更多
文摘A new algorithm for the solution of under constraint graph in sketch drawing is put forward. The directed process of constraint graph is completed by picking concealed constraints of adjacent entities in sketch of few or no dimensions. In this paper, the priority of concealed constraint is given by the different constraint types and constructing orders, and some more priority concealed constraints are forced into obvious ones by the need number of constraint for every node in constraint solution process.
基金This project is supported by National 863/C1MS Plan(No.863-511-507) Provincial Natural Science Foundation of Anhui, China (No.01042209).
文摘A promising approach on the search for geometric constraint of directionalgraph in off-line parametric design has been put forward. The method for representation of thedirectional graph is given firstly, then the constraint model for every geometry element is putforward. By the search of geometric constraint, it sets up the topology constraint relation on thedifferent element objects, which are not related in geometry data base, and achieves the identifyfor the directional graph. The algorithm of recognizing geometric constraint is described in detail,in the meantime, the application example in off-line parametric design on dimension-driven isgiven.
基金supported by the National Natural Science Foundation of China(Grant No.61375030)the Natural Science Foundation of Jiangsu Province,China(Grant No.BK20090149)the Natural Science Foundation of Higher Education Institutions of Jiangsu Province,China(Grant No.08KJD520019)
文摘This paper presents one novel spatial geometric constraints histogram descriptors （SGCHD） based on curvature mesh graph for automatic three-dimensional （3D） pollen particles recognition. In order to reduce high dimensionality and noise disturbance arising from the abnormal record approach under microscopy, the separated surface curvature voxels are ex- tracted as primitive features to represent the original 3D pollen particles, which can also greatly reduce the computation time for later feature extraction process. Due to the good invariance to pollen rotation and scaling transformation, the spatial geometric constraints vectors are calculated to describe the spatial position correlations of the curvature voxels on the 3D curvature mesh graph. For exact similarity evaluation purpose, the bidirectional histogram algorithm is applied to the spatial geometric constraints vectors to obtain the statistical histogram descriptors with fixed dimensionality, which is invariant to the number and the starting position of the curvature voxels. Our experimental results compared with the traditional methods validate the argument that the presented descriptors are invariant to different pollen particles geometric transformations （such as posing change and spatial rotation）, and high recognition precision and speed can be obtained simultaneously.
文摘“双碳”背景下,异质能源的耦合加剧迫使综合能源系统(integrated energy system, IES)拓扑朝着更复杂、更灵活的方向不断演变。然而,现有优化调度方法对非欧网络拓扑知识及其异质潮流约束考虑不足。针对这一问题,提出一种基于图强化学习的综合能源系统优化调度方法。首先,基于图理论在保证节点多样状态的情况下,将异质能源网络拓扑转换为网络图模型。其次,通过建立基于真实图映射的状态-动作-奖励的框架,利用图强化学习的方法学习图模型的非欧拓扑信息,将异质潮流知识加入系统节点运行状态,从而实现IES的安全优化调度。最后,利用某工业园区的真实数据进行仿真验证,所提方法相对于传统方法有效缓解了节点电压越限的问题。结果表明,所提方法能够在考虑IES真实拓扑运行状态信息和异质潮流安全的情况下实现IES的优化调度。
文摘This paper proposes a constructive approach to solving geometric constraint systems.The approach incorporates graph-based and rule-based approaches, and achieves interactive speed.The paper presents a graph representation of geometric conStraint syStems, and discusses in detailthe algorithm of geometric reasoning based on poinl-cluster reduction. An example is made forillustration.
文摘Given n unit execution time (UET) tasks whose precedence constraints form a directed acyclic graph, the arcs are associated with unit communication time (UCT) delays. The problem is to schedule the tasks on two identical processors in order to minimize the makespan. Several polynomial algorithms in the literature are proposed for special classes of digraphs, but the complexity of solving this problem in general case is still a challenging open question. We present in this paper an O(n) time algorithm to compute an optimal schedule for the class of bipartite digraphs of depth one.
