<?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[Technical research review on analysis and evaluation of anti-damage capability for missile launching vehicle]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202402019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Increasing transparency of modern warfare has brought serious challenges to the survival of missile launching vehicle on the battlefield. Around the launcher anti-damage ability of analysis and evaluation technology, the threat of damage and damage mechanism faced by launcher were analyzed, current research status of four types of damage(shock wave, kinetic energy, thermal, and electromagnetic) from the perspective of the application of anti-damage capability assessment were elaborated, and different damage types in the evaluation of anti-damage capability and application directions in the analysis were putted forward; based on the vulnerability analysis space theory, the development process of equipment vulnerability analysis was summarized. It was considered that the logical transfer relationship from physical space to performance space was the key to the vulnerability analysis of launchers at present. Research trends of vulnerability criteria were introduced from the physical criteria, performance criteria and classification criteria, and the key criteria for vulnerability of launchers was proposed. Research concept and the main problems faced by analytical methods of the anti-damage capability of the launcher were explicitly described. Research conclusions can provide references for the analysis and evaluate related research of the anti-damage capability of the missile launching vehicle.]]></description>
<pubDate>2024/4/7 0:00:00</pubDate>
<category><![CDATA[计算机科学与技术·数学与系统科学]]></category>
<author><![CDATA[GAO Qinhe, HUANG Tong, QIAN Bingwen, SHEN Fei, WANG Dong, GAO Lei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GAO Qinhe, HUANG Tong, QIAN Bingwen, SHEN Fei, WANG Dong, GAO Lei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202402019]]></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[Chinese cross-domain NL2SQL algorithm enhanced by auxiliary task]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202402020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[NL2SQL(natural language to structured query language) task aims to translate natural language queries into SQL(structured query language) executable by the database. A Chinese cross-domain NL2SQL algorithm enhanced by auxiliary tasks was proposed. Core idea was to perform multi-task training and improve the accuracy of the model by adding auxiliary tasks in the decoder and combining the prototype model. Auxiliary task was designed by modeling the database schema into a graph, predicting the dependency relations between the natural language queries and the nodes in the database schema graph, and explicitly modeling the dependency relations between the natural language query and the database schema. Through the improvement of auxiliary tasks, the model can better identify which tables/columns in the database schema are more effective for predicting the target SQL for specific natural language queries. Experimental results on the Chinese NL2SQL dataset DuSQL show that the algorithm after adding auxiliary tasks has achieved better results than the prototype model, and can better handle cross-domain NL2SQL task.]]></description>
<pubDate>2024/4/7 0:00:00</pubDate>
<category><![CDATA[计算机科学与技术·数学与系统科学]]></category>
<author><![CDATA[HU Yahong, LIU Yadong, ZHU Zhengdong, LIU Pengjie]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HU Yahong, LIU Yadong, ZHU Zhengdong, LIU Pengjie</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202402020]]></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[Spare parts demand fuzzy prediction model driven by data and knowledge]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202402021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aiming at the problem of scarcity of expert knowledge required by knowledge-driven demand forecasting model and insufficient interpretability of data-driven demand forecasting model, a fuzzy prediction model of spare parts demand driven by data and knowledge was proposed. Based on the fuzzy clustering algorithm, the numerical data was clustered into a rule base with simple structure and strong interpretability. The domain expert knowledge was represented as a Mamdani-type rule base by utilizing fuzzy logic. On this basis, a new type of intelligent computing theory—fuzzy network theory was introduced, the two types of rule bases were merged into an initial prediction model. A genetic algorithm was employed to optimize the fuzzy set parameters of the model′s rule base to enhance the model′s predictive accuracy. Compared with the fuzzy clustering algorithm, the proposed model has advantages in interpretability and accuracy.]]></description>
<pubDate>2024/4/7 0:00:00</pubDate>
<category><![CDATA[计算机科学与技术·数学与系统科学]]></category>
<author><![CDATA[WANG Xiaowei, CHEN Yanqiao, JIN Jiashan, WEI Shuhuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Xiaowei, CHEN Yanqiao, JIN Jiashan, WEI Shuhuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202402021]]></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[Accelerating path lookup in virtual file system of Linux]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202402022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To solve the increasingly prominent cost of traditional path lookup strategy in the Linux kernel, Staged Lookup was proposed to accelerate path lookup by dynamically caching hot directories to reduce file access latency.The essence of Staged Lookup lay in caching frequently used directory entries, thus avoiding the repetitive traversal of paths from the root node. Unlike the retrieval operations that start from the root node, Staged Lookup expanded the search strategy to allow for forward or backward path lookup from the most recently cached directory entry. A prototype of Staged Lookup was deployed on Linux kernel versions 3.14 and 5.4 and subjected to real system tests. Experimental data indicates that Staged Lookup can achieve performance improvements of up to 46.9% compared to traditional path lookup methods.]]></description>
<pubDate>2024/4/7 0:00:00</pubDate>
<category><![CDATA[计算机科学与技术·数学与系统科学]]></category>
<author><![CDATA[ZOU Yanliang, YIN Shu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZOU Yanliang, YIN Shu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202402022]]></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[Pyramid asymptotic fusion low-illumination image enhancement network]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202402023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Since existing low-illumination image enhancement networks have insufficient ability to perceive and express feature information of different scales, a low-illumination image enhancement network model based on pyramid asymptotic fusion was proposed. The network performed multiple down-sampling operations on the image to form a feature pyramid. It fused the feature maps at different scales by adding skip connections to three different branches of the feature pyramid. Fine recovery module further extracted the refined information, and restored the feature map to a normal light image. Results indicate that, the network model not only effectively enhances the brightness of the overall low-illumination image, but also maintains the detailed information and clear edge contours of the objects in the image. Moreover, it can effectively suppress the dark noise, and make the overall enhanced image realistic and natural.]]></description>
<pubDate>2024/4/7 0:00:00</pubDate>
<category><![CDATA[计算机科学与技术·数学与系统科学]]></category>
<author><![CDATA[YU Ying, XU Chaoyue, LI Miao, HE Penghao, YANG Hao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YU Ying, XU Chaoyue, LI Miao, HE Penghao, YANG Hao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202402023]]></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[Image denoising algorithm based on weighted kernel norm minimization and improved wavelet threshold function]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202402024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In view of the structural residual noise in the weighted nuclear norm minimization algorithm and the inability to maintain the edge structure of the image, a denoising method that minimizes the weighted kernel norm and improves the wavelet threshold was adopted. The total variation model to perform preliminary denoising of the noise image, and the noisy image to subtract the preliminary denoised image were used. An improved wavelet threshold function was used to denoise the noise difference image obtained after subtraction. The denoised residual image was superimposed with the preliminary denoised image, and the superimposed image was finally denoised using an iterative weighted kernel norm minimization algorithm based on the residual noise level. Compared with the more popular denoising algorithms, the PSNR and SSIM processed by this algorithm are improved, the texture structure of the image can be maintained, and the effect is better in a high-noise environment.]]></description>
<pubDate>2024/4/7 0:00:00</pubDate>
<category><![CDATA[计算机科学与技术·数学与系统科学]]></category>
<author><![CDATA[GUO Xingang, XU Lianjie, CHENG Chao, HUO Jinhua]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUO Xingang, XU Lianjie, CHENG Chao, HUO Jinhua</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202402024]]></guid><cfi:id>1</cfi:id><cfi:read>true</cfi:read></item>
</channel>
</rss>