Combining the vector level set model,the shape sensitivity analysis theory with the gradient projection technique,a level set method for topology optimization with multi-constraints and multi-materials is presented in...Combining the vector level set model,the shape sensitivity analysis theory with the gradient projection technique,a level set method for topology optimization with multi-constraints and multi-materials is presented in this paper.The method implicitly describes structural material in- terfaces by the vector level set and achieves the optimal shape and topology through the continuous evolution of the material interfaces in the structure.In order to increase computational efficiency for a fast convergence,an appropriate nonlinear speed mapping is established in the tangential space of the active constraints.Meanwhile,in order to overcome the numerical instability of general topology opti- mization problems,the regularization with the mean curvature flow is utilized to maintain the interface smoothness during the optimization process.The numerical examples demonstrate that the approach possesses a good flexibility in handling topological changes and gives an interface representation in a high fidelity,compared with other methods based on explicit boundary variations in the literature.展开更多
Compared with the parallel mechanisms, the mobility analysis of the general multi-loop spatial mechanisms（GMSMs） is more difficult to obtain correct results. The reason is that its multi-loop is formed through sever...Compared with the parallel mechanisms, the mobility analysis of the general multi-loop spatial mechanisms（GMSMs） is more difficult to obtain correct results. The reason is that its multi-loop is formed through several times of closings and there also exists motion coupling even strong coupling, where the over-constraints are concealed. However, the mobility analysis for this kind of mechanisms has been paid few attentions. A new systemic methodology for analyzing mobility is proposed for GMSMs also based on the screw theory. The key issue for mobility analysis is to recognize the over-constraint. Firstly, three theorems are given and point out： the reason and site of over-constraint occurrence, calculating the number of over-constraints by the screw theory, and how to analyze the over-constraints for a single-loop mechanism as well. Then, three closing forms for GMSMs are proposed including rigid closure, movable closure and dynamic closure, and for the three different forms the different analysis methods are also given. Especially, for the most difficult issue of GMSMs with the multi-loop Closure in many times and the inevitable motion coupling, two important methods are proposed： ＂recognizing over-constraints by analyzing relative movement＂ and ＂recognizing over-constraints by virtual loop＂. The two methods are well used to solve the issue. Above-mentioned principles are not only systematic and effective but also unified. They provide a theoretical basis for the general multi-loop spatial mechanisms.展开更多
The pre-research on mobility analysis presented a unified-mobility formula and a methodology based on reciprocal screw theory by HUANG, which focused on classical and modem parallel mechanisms. However its range of ap...The pre-research on mobility analysis presented a unified-mobility formula and a methodology based on reciprocal screw theory by HUANG, which focused on classical and modem parallel mechanisms. However its range of application needs to further extend to general multi-loop spatial mechanism. This kind of mechanism is not only more complex in structure but also with strong motion coupling among loops, making the mobility analysis even more complicated, and the relevant research has long been ignored. It is focused on how to apply the new principle for general spatial mechanism to those various multi-loop spatial mechanisms, and some new meaningful knowledge is further found. Several typical examples of the genera/multi-loop spatial mechanisms with motion couple even strong motion couple are considered. These spatial mechanisms include different closing way： over-constraint appearing in rigid closure, in movable closure, and in dynamic closure as well; these examples also include two different new methods to solve this kind of issue： the way to recognize over-constraints by analyzing relative movement between two connected links and by constructing a virtual loop to recognize over-constraints. In addition, over-constraint determination tabulation is brought to analyze the motion couple. The researches above are all based upon the screw theory. All these multi-loop spatial mechanisms with different kinds of structures can completely be solved by following the directions and examples, and the new mobility theory based on the screw theory is also proved to be valid. This study not only enriches and develops the theory and makes the theory more universal, but also has a special meaning for innovation in mechanical engineering.展开更多
Over the years, a number of methods have been proposed for the generation of uniform and globally optimal Pareto frontiers in multi-objective optimization problems. This has been the case irrespective of the problem d...Over the years, a number of methods have been proposed for the generation of uniform and globally optimal Pareto frontiers in multi-objective optimization problems. This has been the case irrespective of the problem definition. The most commonly applied methods are the normal constraint method and the normal boundary intersection method. The former suffers from the deficiency of an uneven Pareto set distribution in the case of vertical （or horizontal） sections in the Pareto frontier, whereas the latter suffers from a sparsely populated Pareto frontier when the optimization problem is numerically demanding （ill-conditioned）. The method proposed in this paper, coupled with a simple Pareto filter, addresses these two deficiencies to generate a uniform, globally optimal, well-populated Pareto frontier for any feasible bi-objective optimization problem. A number of examples are provided to demonstrate the performance of the algorithm.展开更多
A method for deformation of 3D point clouds models was proposed with multi-constraints including arc-length constraints and multi-points position constraints. The energy function was built for the polyline which had b...A method for deformation of 3D point clouds models was proposed with multi-constraints including arc-length constraints and multi-points position constraints. The energy function was built for the polyline which had been converted from the curve. Based on the minimum energy curve method, the curve on the mesh was deformed. The test results show that the proposed method has good performance. Compared with the other method,shape preserving of the curve is better. Finally,this method is used for the deformation of the 3D mannequin model. Circumference changes of the mannequin model can be reflected by the arc-length change in the size of the cross section.展开更多
An improved approach is presented in this paper to implement highly constrained cooperative guidance to attack a stationary target.The problem with time-varying Proportional Navigation(PN)gain is first formulated as a...An improved approach is presented in this paper to implement highly constrained cooperative guidance to attack a stationary target.The problem with time-varying Proportional Navigation(PN)gain is first formulated as a nonlinear optimal control problem,which is difficult to solve due to the existence of nonlinear kinematics and nonconvex constraints.After convexification treatments and discretization,the solution to the original problem can be approximately obtained by solving a sequence of Second-Order Cone Programming(SOCP)problems,which can be readily solved by state-of-the-art Interior-Point Methods(IPMs).To mitigate the sensibility of the algorithm on the user-provided initial profile,a Two-Stage Sequential Convex Programming(TSSCP)method is presented in detail.Furthermore,numerical simulations under different mission scenarios are conducted to show the superiority of the proposed method in solving the cooperative guidance problem.The research indicated that the TSSCP method is more tractable and reliable than the traditional methods and has great potential for real-time processing and on-board implementation.展开更多
Because of explosive growth in Internet traffic and high complexity of heterogeneous networks, improving the routing and wavelength assignment （RWA） algorithm in underlying optical networks has become very important...Because of explosive growth in Internet traffic and high complexity of heterogeneous networks, improving the routing and wavelength assignment （RWA） algorithm in underlying optical networks has become very important. Where there are multiple links between different the node pairs, a traditional wavelength-assignment algorithm may be invalid for a wavelength-switched optical networks （WSON） that has directional blocking constraints. Also, impairments in network nodes and subsequent degradation of optical signals may cause modulation failure in the optical network. In this paper, we propose an RWA algorithm based on a novel evaluation model for a WSQN that has multiple constraints. The algorithm includes comprehensive evaluation model （CEM） and directional blocking constraint RWA based on CEM （DB-RWA）. Diverse constraints are abstracted into various constraint conditions in order to better assign routing and wavelength. We propose using the novel CEM to optimize routing according to an assessed value of constraints on transmission performance. This eliminates the effects of physical transmission impairments in a WSON. DB-RWA based on CEM abstracts directional blocking conditions in multiple links between network nodes into directional blocking constraints. It also satisfies rigorous network specifications and provides flexibility, scalability, and first-fit rate for the backbone, especially in multiple links between WSON nodes.展开更多
图像异常检测旨在识别并定位图像中的异常区域,针对现有算法中不同层次特征信息利用不充分的问题,提出了基于多层次特征融合网络的图像异常检测算法。通过使用融合了异常先验知识的伪异常数据生成算法,对训练集进行了异常数据扩充,将异...图像异常检测旨在识别并定位图像中的异常区域,针对现有算法中不同层次特征信息利用不充分的问题,提出了基于多层次特征融合网络的图像异常检测算法。通过使用融合了异常先验知识的伪异常数据生成算法,对训练集进行了异常数据扩充,将异常检测任务转化为监督学习任务;构建了多层次特征融合网络,将神经网络中不同层次特征进行融合,丰富了特征中的低层纹理信息和高层语义信息,使得用于异常检测的特征更具区分性;训练时,设计了分数约束损失和一致性约束损失,并结合特征约束损失对整个网络模型进行训练。实验结果表明,MVTec数据集上图像级检测接收机工作特性曲线下面积(area under the receiver operating characteristic, AUROC)平均值为98.7%,像素级定位AUROC平均值为97.9%,每区域重叠率平均值为94.2%,均高于现有的异常检测算法。展开更多
基金The project supported by the National Natural Science Foundation of China (59805001,10332010) and Key Science and Technology Research Project of Ministry of Education of China (No.104060)
文摘Combining the vector level set model,the shape sensitivity analysis theory with the gradient projection technique,a level set method for topology optimization with multi-constraints and multi-materials is presented in this paper.The method implicitly describes structural material in- terfaces by the vector level set and achieves the optimal shape and topology through the continuous evolution of the material interfaces in the structure.In order to increase computational efficiency for a fast convergence,an appropriate nonlinear speed mapping is established in the tangential space of the active constraints.Meanwhile,in order to overcome the numerical instability of general topology opti- mization problems,the regularization with the mean curvature flow is utilized to maintain the interface smoothness during the optimization process.The numerical examples demonstrate that the approach possesses a good flexibility in handling topological changes and gives an interface representation in a high fidelity,compared with other methods based on explicit boundary variations in the literature.
基金Supported by National Natural Science Foundation of China(Grant No.51005195)Natural Science Research Fund for Youth in Higher Education Institutions of Hebei Province,China(Grant No.QN2014175)
文摘Compared with the parallel mechanisms, the mobility analysis of the general multi-loop spatial mechanisms（GMSMs） is more difficult to obtain correct results. The reason is that its multi-loop is formed through several times of closings and there also exists motion coupling even strong coupling, where the over-constraints are concealed. However, the mobility analysis for this kind of mechanisms has been paid few attentions. A new systemic methodology for analyzing mobility is proposed for GMSMs also based on the screw theory. The key issue for mobility analysis is to recognize the over-constraint. Firstly, three theorems are given and point out： the reason and site of over-constraint occurrence, calculating the number of over-constraints by the screw theory, and how to analyze the over-constraints for a single-loop mechanism as well. Then, three closing forms for GMSMs are proposed including rigid closure, movable closure and dynamic closure, and for the three different forms the different analysis methods are also given. Especially, for the most difficult issue of GMSMs with the multi-loop Closure in many times and the inevitable motion coupling, two important methods are proposed： ＂recognizing over-constraints by analyzing relative movement＂ and ＂recognizing over-constraints by virtual loop＂. The two methods are well used to solve the issue. Above-mentioned principles are not only systematic and effective but also unified. They provide a theoretical basis for the general multi-loop spatial mechanisms.
基金Supported by National Natural Science Foundation of China(Grant No.51005195)Natural Science Research Fund for Youth in Higher Education Institutions of Hebei Province,China(Grant No.QN2014175)
文摘The pre-research on mobility analysis presented a unified-mobility formula and a methodology based on reciprocal screw theory by HUANG, which focused on classical and modem parallel mechanisms. However its range of application needs to further extend to general multi-loop spatial mechanism. This kind of mechanism is not only more complex in structure but also with strong motion coupling among loops, making the mobility analysis even more complicated, and the relevant research has long been ignored. It is focused on how to apply the new principle for general spatial mechanism to those various multi-loop spatial mechanisms, and some new meaningful knowledge is further found. Several typical examples of the genera/multi-loop spatial mechanisms with motion couple even strong motion couple are considered. These spatial mechanisms include different closing way： over-constraint appearing in rigid closure, in movable closure, and in dynamic closure as well; these examples also include two different new methods to solve this kind of issue： the way to recognize over-constraints by analyzing relative movement between two connected links and by constructing a virtual loop to recognize over-constraints. In addition, over-constraint determination tabulation is brought to analyze the motion couple. The researches above are all based upon the screw theory. All these multi-loop spatial mechanisms with different kinds of structures can completely be solved by following the directions and examples, and the new mobility theory based on the screw theory is also proved to be valid. This study not only enriches and develops the theory and makes the theory more universal, but also has a special meaning for innovation in mechanical engineering.
文摘Over the years, a number of methods have been proposed for the generation of uniform and globally optimal Pareto frontiers in multi-objective optimization problems. This has been the case irrespective of the problem definition. The most commonly applied methods are the normal constraint method and the normal boundary intersection method. The former suffers from the deficiency of an uneven Pareto set distribution in the case of vertical （or horizontal） sections in the Pareto frontier, whereas the latter suffers from a sparsely populated Pareto frontier when the optimization problem is numerically demanding （ill-conditioned）. The method proposed in this paper, coupled with a simple Pareto filter, addresses these two deficiencies to generate a uniform, globally optimal, well-populated Pareto frontier for any feasible bi-objective optimization problem. A number of examples are provided to demonstrate the performance of the algorithm.
基金the Key Project of the National Nature Science Foundation of China(No.61134009)Program for Changjiang Scholars and Innovation Research Team in University from the Ministry of Education,China(No.IRT1220)+2 种基金Specialized Research Funds for Shanghai Leading Talents,Project of the Shanghai Committee of Science and Technology,China(Nos.13JC1400200,11JC1400200)Innovation Program of Shanghai Municipal Education Commission,China(No.14ZZ067)the Fundamental Research Funds for the Central Universities,China(No.2232012A3-04)
文摘A method for deformation of 3D point clouds models was proposed with multi-constraints including arc-length constraints and multi-points position constraints. The energy function was built for the polyline which had been converted from the curve. Based on the minimum energy curve method, the curve on the mesh was deformed. The test results show that the proposed method has good performance. Compared with the other method,shape preserving of the curve is better. Finally,this method is used for the deformation of the 3D mannequin model. Circumference changes of the mannequin model can be reflected by the arc-length change in the size of the cross section.
基金supported by the Joint Foundation of the Ministry of Education of China(No.6141A02022340).
文摘An improved approach is presented in this paper to implement highly constrained cooperative guidance to attack a stationary target.The problem with time-varying Proportional Navigation(PN)gain is first formulated as a nonlinear optimal control problem,which is difficult to solve due to the existence of nonlinear kinematics and nonconvex constraints.After convexification treatments and discretization,the solution to the original problem can be approximately obtained by solving a sequence of Second-Order Cone Programming(SOCP)problems,which can be readily solved by state-of-the-art Interior-Point Methods(IPMs).To mitigate the sensibility of the algorithm on the user-provided initial profile,a Two-Stage Sequential Convex Programming(TSSCP)method is presented in detail.Furthermore,numerical simulations under different mission scenarios are conducted to show the superiority of the proposed method in solving the cooperative guidance problem.The research indicated that the TSSCP method is more tractable and reliable than the traditional methods and has great potential for real-time processing and on-board implementation.
基金supported in part by 973 Program(2010CB328204)NSFC project(60932004)RFDP Project(20090005110013)
文摘Because of explosive growth in Internet traffic and high complexity of heterogeneous networks, improving the routing and wavelength assignment （RWA） algorithm in underlying optical networks has become very important. Where there are multiple links between different the node pairs, a traditional wavelength-assignment algorithm may be invalid for a wavelength-switched optical networks （WSON） that has directional blocking constraints. Also, impairments in network nodes and subsequent degradation of optical signals may cause modulation failure in the optical network. In this paper, we propose an RWA algorithm based on a novel evaluation model for a WSQN that has multiple constraints. The algorithm includes comprehensive evaluation model （CEM） and directional blocking constraint RWA based on CEM （DB-RWA）. Diverse constraints are abstracted into various constraint conditions in order to better assign routing and wavelength. We propose using the novel CEM to optimize routing according to an assessed value of constraints on transmission performance. This eliminates the effects of physical transmission impairments in a WSON. DB-RWA based on CEM abstracts directional blocking conditions in multiple links between network nodes into directional blocking constraints. It also satisfies rigorous network specifications and provides flexibility, scalability, and first-fit rate for the backbone, especially in multiple links between WSON nodes.
文摘图像异常检测旨在识别并定位图像中的异常区域,针对现有算法中不同层次特征信息利用不充分的问题,提出了基于多层次特征融合网络的图像异常检测算法。通过使用融合了异常先验知识的伪异常数据生成算法,对训练集进行了异常数据扩充,将异常检测任务转化为监督学习任务;构建了多层次特征融合网络,将神经网络中不同层次特征进行融合,丰富了特征中的低层纹理信息和高层语义信息,使得用于异常检测的特征更具区分性;训练时,设计了分数约束损失和一致性约束损失,并结合特征约束损失对整个网络模型进行训练。实验结果表明,MVTec数据集上图像级检测接收机工作特性曲线下面积(area under the receiver operating characteristic, AUROC)平均值为98.7%,像素级定位AUROC平均值为97.9%,每区域重叠率平均值为94.2%,均高于现有的异常检测算法。
