针对无线通信条件下数据链网络性能测试和评估难题,设计了数据链网络性能评估方法。首先,采集数据链的记录数据;然后,通过对战术数据系统(Tactical Data System, TDS)数据的消息协议解析,按照数据链消息标准格式化TDS数据,提取时间、消...针对无线通信条件下数据链网络性能测试和评估难题,设计了数据链网络性能评估方法。首先,采集数据链的记录数据;然后,通过对战术数据系统(Tactical Data System, TDS)数据的消息协议解析,按照数据链消息标准格式化TDS数据,提取时间、消息类型、数据链平台和收发消息四维变量;最后,结合集合映射理论,分析通信网络连通性,生成连通性评估报告和战术消息时序图。基于数据链网络实际业务数据,分析了测试样本经过传输造成的丢包、误码和时延抖动等影响,验证了多源融合方法的可行性和有效性。展开更多
In order to overcome the difficulties caused by singular optima, in the present paper, a new method for the solutions of structural topology optimization problems is proposed. The distinctive feature of this method is...In order to overcome the difficulties caused by singular optima, in the present paper, a new method for the solutions of structural topology optimization problems is proposed. The distinctive feature of this method is that instead of solving the original optimization problem directly, we turn to seeking the solutions of a sequence of approximated problems which are formulated by relaxing the constraints of the original problem to some extent. The approximated problem can be solved efficiently by employing the algorithms developed for sizing optimization problems because its solution is not singular. It can also be proved that when the relaxation parameter is tending to zero, the solution of the approximated problem will converge to the solution of the original problem uniformly. Numerical examples illustrate the effectiveness and validity of the present approach. Results are also compared with those obtained by traditional methods.展开更多
In this paper,we study linear bilevel programming without the assumption that the reaction set of the follower is a singleton.Several properties of the feasible region of the leader are presented.A new solution concep...In this paper,we study linear bilevel programming without the assumption that the reaction set of the follower is a singleton.Several properties of the feasible region of the leader are presented.A new solution concept is introduced to deal with the uncertainty resulting from multiple potential reactions of the follower.To solve a bilevel program with multiple potential reactions,we propose,meadod to transform the original problem into a bilevel programming proproblem which can be solved by some known algorithms.展开更多
文摘针对无线通信条件下数据链网络性能测试和评估难题,设计了数据链网络性能评估方法。首先,采集数据链的记录数据;然后,通过对战术数据系统(Tactical Data System, TDS)数据的消息协议解析,按照数据链消息标准格式化TDS数据,提取时间、消息类型、数据链平台和收发消息四维变量;最后,结合集合映射理论,分析通信网络连通性,生成连通性评估报告和战术消息时序图。基于数据链网络实际业务数据,分析了测试样本经过传输造成的丢包、误码和时延抖动等影响,验证了多源融合方法的可行性和有效性。
基金The project supported by the National Natural Science Foundation of China under project No.19572023
文摘In order to overcome the difficulties caused by singular optima, in the present paper, a new method for the solutions of structural topology optimization problems is proposed. The distinctive feature of this method is that instead of solving the original optimization problem directly, we turn to seeking the solutions of a sequence of approximated problems which are formulated by relaxing the constraints of the original problem to some extent. The approximated problem can be solved efficiently by employing the algorithms developed for sizing optimization problems because its solution is not singular. It can also be proved that when the relaxation parameter is tending to zero, the solution of the approximated problem will converge to the solution of the original problem uniformly. Numerical examples illustrate the effectiveness and validity of the present approach. Results are also compared with those obtained by traditional methods.
文摘In this paper,we study linear bilevel programming without the assumption that the reaction set of the follower is a singleton.Several properties of the feasible region of the leader are presented.A new solution concept is introduced to deal with the uncertainty resulting from multiple potential reactions of the follower.To solve a bilevel program with multiple potential reactions,we propose,meadod to transform the original problem into a bilevel programming proproblem which can be solved by some known algorithms.
