<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005">
<channel xmlns:cfi="http://www.microsoft.com/schemas/rss/core/2005/internal" cfi:lastdownloaderror="None">
<title cf:type="text"><![CDATA[Editorial department of the Journal of National University of Defense Technology -->国防科技大学]]></title>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Survey on converged networks of high-performance computing network and data center network]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202304001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the convergence trend of high performance computing, big data processing, cloud computing and artificial intelligence computing, the converged network of high-performance computing network and data center network becomes an important trend. The current research status of converged network was analyzed, and the representative converged networks were described in detail to comprehensively show the latest technologies and trends. The challenges faced by the converged network were put forward, and the trends of converged network were proposed, including the convergence and differentiation coexistence of the converged network protocols, the performance acceleration of the converged network based on in-network computing, and the performance optimization of the converged network for emerging applications.]]></description>
<pubDate>2023/7/20 0:00:00</pubDate>
<category><![CDATA[国防科技大学]]></category>
<author><![CDATA[LU Pingjing, DONG Dezun, LAI Mingche, QI Xingyun, XIONG Zeyu, CAO Jijun, XIAO Liquan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LU Pingjing, DONG Dezun, LAI Mingche, QI Xingyun, XIONG Zeyu, CAO Jijun, XIAO Liquan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202304001]]></guid><cfi:id>6</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Filtered pressure model in large eddy simulation coupled probability density function method for compressible flows]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202304002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The subgrid species-temperature correlation term significantly affects the accuracy of large eddy simulation of reactive flows. A new filtered pressure model was developed by using the basic characteristics of probability equivalence in the probability density function method, which can well close the subgrid species-temperature correlation term. The probability density function and its coupling solution method were introduced. Then, a new filtered pressure model was derived based on previous models. Numerical tests of different filtered pressure models were carried out in a three-dimensional supersonic hydrogen/air temporally evolving reactive mixing layer. The results show that, compared with the traditional filtered pressure model, the new filtered pressure model can significantly improve the simulation accuracy of the reaction mixing layer. In particular, based on the new filtered pressure model, the large eddy simulation coupled probability density function method can better simulate minor species in the chain reaction such as hydrogen peroxide, which is expected to more effectively reproduce complex combustion phenomena such as self ignition.]]></description>
<pubDate>2023/7/20 0:00:00</pubDate>
<category><![CDATA[国防科技大学]]></category>
<author><![CDATA[ZHANG Lin, LIANG Jianhan, WANG Yi, SUN Mingbo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Lin, LIANG Jianhan, WANG Yi, SUN Mingbo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202304002]]></guid><cfi:id>5</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Application of Wasserstein distance in fault detection for liquid-propellant rocket engines]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202304003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Health monitoring can effectively improve the reliability of liquid-propellant rocket engines. Aiming at the problem of fault detection in health monitoring for liquid-propellant rocket engines, a method based on Wasserstein distance was proposed and verified using ground hot test data of an LOX/LH2 rocket engine. The core idea was to use Wasserstein generative adversarial network to simulate the sample distribution of normal data, and used its discriminator to calculate the Wasserstein distance between the test sample and the simulated distribution, so as to achieve fault detection. The results show that the proposed method can overcome the difficulty of insufficient fault data, detect the faults in the steady-state process effectively without false alarm, and is sensitive to early anomalies. In the case of a small number of training samples, when the Wasserstein distance threshold is set to 3σ, the method is sensitive to early anomalies during the start-up transient. Starting fault can still be effectively detected with the threshold of 5σ, with a false alarming rate of 12.5%.]]></description>
<pubDate>2023/7/20 0:00:00</pubDate>
<category><![CDATA[国防科技大学]]></category>
<author><![CDATA[CHENG Yuqiang, DENG Lingzhi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHENG Yuqiang, DENG Lingzhi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202304003]]></guid><cfi:id>4</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Combining multi-view learning and consistent representation for face forgery detection]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202304004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Most of the existing face forgery detection methods usually achieve acceptable detection performance on known attacks, but still face the risk of overfitting and fail to maintain good detection capability when dealing with unknown scenes. To solve this problem, an effective face forgery detection framework based on multi-view learning and consistent representation was proposed. To capture more comprehensive forgery traces, the input image was transformed into two complementary views and a dual-stream backbone network was used for multi-view feature learning. The consistency metric was introduced to explicitly constrain the similarity of local features output from different viewpoints in a patch-level supervised manner. To improve the detection accuracy of the model, the feature decomposition strategy further optimized the forgery-relevant feature to reduce the interference of irrelevant factors, and the decision made from the forgery-relevant feature space was used as the final prediction. Extensive experiments on benchmark datasets show that the proposed method outperforms the existing mainstream approaches with good cross-domain generalization capability.]]></description>
<pubDate>2023/7/20 16:28:59</pubDate>
<category><![CDATA[国防科技大学]]></category>
<author><![CDATA[ZHANG Jun, YU Miaomiao, YANG Jiaxin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Jun, YU Miaomiao, YANG Jiaxin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202304004]]></guid><cfi:id>3</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Novel frequency selective surface-loaded dual-polarized ultra-wideband tightly coupled array antenna]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202304005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To achieve better electromagnetic characteristics and more stable radiation properties within an ultra-wide band, a novel dual-polarized ultra-wideband tightly coupled array antenna loaded with wide-angle impedance matching layer on a strip frequency selective surface was proposed. The array elements were studied and analyzed through the truncation by the periodic boundary conditions in high frequency electromagnetic simulation software CST. After investigating its electromagnetic properties of array impedance and radiation, a 6 × 6 array antenna was designed, manufactured for actual measurement. The measurement results show that the standing wave ratio of the antenna in the frequency band of 2~12 GHz is less than 3. The impedance bandwidth is 10 GHz. Moreover, the antenna has stable radiation within frequency band, more electromagnetic energy is concentrated in the mainlobe, and the cross polarization is small. In the operating frequency band, the maximum gain can reach 13 dBi. This kind of array antennas can be applied in the ultra-wideband phased array domain.]]></description>
<pubDate>2023/7/20 0:00:00</pubDate>
<category><![CDATA[国防科技大学]]></category>
<author><![CDATA[WU Weiwei, WANG Shaozhi, YAN Yuchen, FANG Yizhong, YUAN Naichang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Weiwei, WANG Shaozhi, YAN Yuchen, FANG Yizhong, YUAN Naichang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202304005]]></guid><cfi:id>2</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Distributed task scheduling method for networked UAV swarm based on computation-for-communication]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202304006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aiming at the problem of autonomous coordination of networked UAV swarm and the advantages and disadvantages of market auction method, the idea of “computation-for-communication” and its corresponding distributed task scheduling method were proposed. By analyzing explicit and implicit conflicting tasks, a set of task-related agents was established. A local optimization method based on task suppression was proposed to resolve some task conflicts in advance, so as to reduce the number of algorithm iterations. An agent position inference method based on historical bidding information was designed to provide necessary information input for local optimization. Monte Carlo simulation experiments were carried out based on the networking simulation platform and the swarm rescue scenario. The results show that compared with the representative consensus-based bundle algorithm and performance impact algorithm in the market auction method, the proposed method can obtain fewer iterations, shorter convergence time and better scheduling performance.]]></description>
<pubDate>2023/7/20 0:00:00</pubDate>
<category><![CDATA[国防科技大学]]></category>
<author><![CDATA[LI Jie, CHEN Runfeng, PENG Ting]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Jie, CHEN Runfeng, PENG Ting</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202304006]]></guid><cfi:id>1</cfi:id><cfi:read>true</cfi:read></item>
</channel>
</rss>