Search

Aiming at the specific target search and controllable angle guidance of unmanned surface ships in uncertain waters, this paper explores the target detection method based on YOLO and the guidance control method based on side angle constraint. On the basis of analyzing the uncertain conditions such as sea fog, the paper designs the correlation filter with im- proved YOLOv5 algorithm to extract the target features, combines depth information to realize the detection and positioning of water surface targets, sliding mode variable structure guidance control to achieve the high maneuverability target side angle constraint guidance. TCP/IP combined with ROS is used to create a comer constrained terminal guidance system for information processing. Two-dimensional simulation experiment is completed with Autolabor platform, and the result of target guidance error is 1.54%, which proves the effectiveness of the method proposed. [ABSTRACT FROM AUTHOR]

Aiming at the problem of tracking skip-glide targets using radar, this paper proposes an Unscented Kalman Filter (UKF) tracking algorithm based on the improved Jerk model. Aiming at the estimation error introduced by the artificial preset acceleration variance and Jerk frequency of the conventional Jerk algorithm, this method calculates the acceleration variance adaptively through the current position estimation value and the current position one-step prediction value, and correlates the jerk frequency with the acceleration variance, realizing the adaptive adjustment of the model parameters while estimating the target motion state. At the same time, the improved Jerk model is combined with UKF algorithm, and the overall algorithm flow is given, and simulation experiments are carried out. The simulation results show that compared with the conventional Jerk model algorithm, the method proposed in this paper realizes the adaptive adjustment of model parameters, making the tracking process more adaptable to the maneuvering characteristics of the target. [ABSTRACT FROM AUTHOR]

Synthetic minority oversampling technique (SMOTE) has become one of the mainstream methods for dealing with unbalanced data due to its ability to effectively deal with minority samples, and many SMOTE improvement algorithms have been proposed, but very little research existing considers popular algorithmic-level improvement methods. Therefore a more comprehensive analysis of existing SMOTE class algorithms is provided. Firstly, the basic principles of the SMOTE method are elaborated in detail, and then the SMOTE class algorithms are systematically analyzed mainly from the two levels of data level and algorithmic level, and the new ideas of the hybrid improvement of data level and algorithmic level are introduced. Data-level improvement is to balance the data distribution by deleting or adding data through different operations during preprocessing; algorithmic-level improvement will not change the data distribution, and mainly strengthens the focus on minority samples by modifying or creating algorithms. Comparison between these two kinds of methods shows that, data- level methods are less restricted in their application, and algorithmic-level improvements generally have higher algorithmic robustness. In order to provide more comprehensive basic research material on SMOTE class algorithms, this paper finally lists the commonly used datasets, evaluation metrics, and gives ideas of research in the future to better cope with unbalanced data problem. [ABSTRACT FROM AUTHOR]

In the evolution of the Internet from Web 1.0 to Web 3.0, algorithms have played an irreplaceable role, enabling information technology to functionally realize the transmission of one-way content to decentralized interaction. Algorithms have a subtle impact on people's lives, work, and learning, and this impact is so great that it has produced the idea of algorithmic society and algorithmic era. Algorithms belong to the basic category of digital law and are an important tool for digital rule of law. In existing research, scholars are more concerned about how to regulate algorithms, and less concerned about the legal nature of algorithms. There has been a brief discussion on this issue. However, how the legal nature of algorithms should be defined is still inconclusive. This article aims to answer this question. To this end, this paper sorts out the existing theoretical schemes of the legal nature of algorithms and their interrelationships, including speech, due process, patents, and trade secrets, and analyzes the sources and arguments of these theoretical schemes. There are internal and external reasons why the legal nature of algorithms has formed many disputes. These reasons are also difficult to define the legal nature of algorithms, including: the algorithm ontology and carrier are easy to confuse, the algorithm and the program are indiscriminate, the algorithm and data, the result mix, and the limitation of governance rules. When seeking justification for various theoretical claims, one logical premise is easily overlooked, that is, the criteria for determining the legal nature of algorithms. This paper puts forward these standards, namely the principle of legality, the principle of respecting the fruits of labor, the principle of maintaining public safety, the principle of promoting innovation, and the principle of maximizing social benefits. On this basis, this paper examines various theoretical schemes, and finally proves that the legal nature of the algorithm is a trade secret, not something else. In terms of methodology, this paper uses the method of identification analysis to discuss various scenarios one by one. Compared with previous literature, this paper makes contributions in the following aspects: first, this paper sorts out the existing debates on the legal nature of algorithms in detail, grasps the arguments of these theoretical schemes, and specifically examines them. Second, this paper analyzes the reasons for many disputes over the legal nature of algorithms. The widespread use of algorithms has also caused heated debates about algorithms. Algorithms have been in the field of legal science for a long time, but there are frequent misunderstandings about how their legal nature should be defined, and the reasons behind them deserve careful analysis. Third, this paper clarifies the criteria for defining the legal nature of algorithms, and argues that algorithms are trade secrets on this basis. Algorithms cannot be called speech, nor are they due process. The argument that algorithms are patents is also untenable, and although algorithms have the possibility of patentability in the current legal system, algorithm patenting is not a good solution. [ABSTRACT FROM AUTHOR]

Copyright of China Rural Water & Hydropower is the property of China Rural Water & Hydropower Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Railway Standard Design is the property of Railway Standard Design Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Study on Optical Communications / Guangtongxin Yanjiu is the property of Study on Optical Communications Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Harbin University of Science & Technology is the property of Journal of Harbin University of Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Atomic Energy Science & Technology is the property of Editorial Board of Atomic Energy Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The existing YOLO target detection algorithm, based on one-stage concept, aims for multi-objective detection. But this algorithm performs not well for dual classification detection and add more performance overhead while detection. In order to improve the detection efficiency of dual classification mask wearing during the period of COVID-19, this paper proposes a real-time detection method based on YOLO for detecting the condition of bi-objective mask wearing. The optimization is based on the latest YOLO version 4: firstly, the feedforward input layer of the model is improved to optimize the data augment part and the adaptive image scaling is added to improve the efficiency of the detection for both dual classification and small objectives; secondly, the adaptive anchoring frame is added to replace the activation function so as to reduce the computation and thus improve its efficiency; thirdly, the optimization of Neck and the addition of Focus structure improve the capability of feature fusion and reduce the amount of parameters to raise the efficiency. The experimental results showed that, compared with the existing YOLO version 4, using this method in this paper improves F1 by 0.33% and mAp by 0.71% in the data set. Also, the detection efficiency is also improved significantly under the same experimental condition. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

With the continuous growth of vehicle ownership and the popularization of Internet of Vehicles applications， vehicle terminals generate large amounts of data messages that need to be processed in real time. In the scene of high-speed vehicle movement， the traditional Internet of Vehicles navigation system has a transmission delay due to vehicle differential positioning data， which results in a certain deviation in vehicle positioning results and cannot obtain high-precision positioning results in time. Based on this， this paper proposes a technology solution for car networking navigation based on BDS positioning and edge computing. It uses an improved genetic algorithm to allocate resources for terminal positioning requests， effectively reduces the service delay of the entire edge network， and uses optimize the lossless Kalman filter algorithm based on edge node to improve the positioning accuracy of the car network node. Experiments show that the method proposed in this paper can provide real-time accurate， low-latency and high-precision positioning services for large-scale Internet of Vehicles terminals， and has high practical application value. [ABSTRACT FROM AUTHOR]

Recommendation system can help users quickly find useful information and improve the retrieval efficiency of users effectively. However, the recommendation system has problems such as data sparsity and cold start, most of the existing recommendation algorithms that integrate social relations ignore the sparsity of social relations data, and there are few recommendation algorithms that integrate social relations and item attribute data at the same time. This paper proposes a recommendation model that is multi-task feature learning approach for social relationship and knowledge graph enhanced recommendation (MSAKR) in response to solve the above problems. Firstly, the algorithm extracts the user's social relations through the graph convolutional neural network to get the user's feature vector, then selects the neighbor by the graph centrality, and generates the virtual neighbor by the word2vec model, so as to alleviate the sparsity of the social data. This paper uses the attention mechanism to gather the neighbors. Secondly, multi-task learning and semantic-based matching model are used to extract the information of attribute knowledge graph to obtain the feature vector of the item. Finally, comprehensive recommendation is made to the user based on the obtained user and item feature vectors. In order to assess the performance of the recommendation algorithm, experiments are carried out on real datasets Douban and Yelp. Click-through rate prediction and Top-K recommendation are used to evaluate the performance of the model respectively. Experimental results show that the proposed model is superior to other benchmark models. [ABSTRACT FROM AUTHOR]

Aiming at the problem of incomplete location and fuzzy edge of salient region, this paper proposes a method of RGB-D salient target detection. Firstly, a cross-modal feature fusion module is designed to integrate RGB and depth information layer by layer. Six modal fusion feature outputs are obtained. This module reduces the discrepancy between RGB and depth information, providing more common and complementary deep features for the subsequent advanced semantic repair. Multiple levels of information is obtained based on the above modules. This paper uses the last three layer features to jointly extract richer high-level semantic information, and the initial salient map is obtained. After that, the network structure of U-Net is used to fuse from top to the bottom of the network. After upsampling, each layer is fused with the next layer in channel dimension. The first three layers of bottom features are guided by advanced semantic features before and after fusion, to complete the repair of the lowlevel features. Finally, the final salient map is obtained. The proposed cross-modal feature fusion module can adaptively fuse multi-modal features, highlight the commonness and complementarity of fusion features, and reduce the ambiguity of fusion. The proposed advanced semantic repair strategy is helpful to accurately detect the salient region and improve the edge clarity. Experimental results show that the proposed algorithm outperforms most excellent methods on five datasets, including NJU2K, NLPR, STERE, DES and SIP, which achieves relatively advanced performance. [ABSTRACT FROM AUTHOR]

TVM (tensor virtual machine) is a deep learning compiler, that translates the deep learning operators described by tensor expression to TVM IR (TVM intermediate representation) programs. After a series of operatorlevel optimizations on TVM IR, TVM generates the target code across diverse hardware back-ends. Tensor expression, a domain- specific language for tensor computation, performs loop transformation to operators. The result of loop transformation is a number of complicated expressions emerging in nested loop statements, which contain loop invariant code. However, in the context of deep learning applications, the traditional loop invariant code motion algorithm has severe limitations. Firstly, it's difficult to determine the extra-benefit of moving certain invariant code out of loops. Secondly, it's difficult to detect loop invariant code which has different orders of operands. Thirdly, it cannot process nested condition expressions well. Furthermore, there are conflicts with target hardware compiler optimizations. The application of loop invariant code motion technique is constrained by the aforementioned problems. In this paper, a new loop invariant code motion algorithm is proposed, which takes deep learning application characteristics into consideration in a heuristics way. The algorithm normalizes the program by manipulating the expression operands and simplifying the nested condition expression. This paper introduces a new cost model, which evaluates the cost of moving certain loop invariant code while the characteristics of TVM IR and target hardware back-ends are fully considered. The algorithm is implemented as a registered TVM pass on opensource compiler TVM version 0.7. To testify the effectiveness and correctness of this algorithm, experiments are conducted on TVM TOPI benchmark with 27 operators and 511 test cases under different input. Experimental results show that this algorithm improves 47.6% of operators'performance, and achieves speedups up to 40.0%. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to solve the problems of difficulty and low efficiency in selecting water resources allocation scheme, a multi-attribute Decision-making method of water resources allocation scheme based on Pythagorean fuzzy set with interval value and PROMETHEE algorithm is proposed in this paper. Firstly, the interval fuzzy decision matrix of decision-makers is constructed, and the weights of decision-makers and attributes are determined by the distance of relative proximity coefficient method, entropy method and Pythagorean fuzzy number. Secondly, the comprehensive weight and IVPFWA operator are used to aggregate the decision matrix of each decision-maker into the comprehensive matrix, and then the final ranking results of water resources allocation schemes are obtained by PROMETHEE method. Finally, the algorithm used in this paper to select the optimal water resources allocation plan in City S as a case, and through comparison with the results of other methods, it finally shows that the method in this paper can accurately determine a reasonable water resources allocation plan, and the method is effective and reliable. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Railway Standard Design is the property of Railway Standard Design Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Harbin University of Science & Technology is the property of Journal of Harbin University of Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Aiming at the low accuracy and time-consuming problems of AKAZE algorithm in image matching of glass-encapsulated electrical connectors, an improved image matching algorithm based on LK optical flow and grid motion statistics is proposed in this paper. Firstly, the AKAZE algorithm is used to extract the feature points of the glass-encapsulated electrical connector, and the M-LDB descriptor is used for the feature description. Then, LK optical flow method is used to calculate the matching area for conditional constraints, so as to obtain matching points, and the FLANN algorithm is used for feature matching. Finally, the image of the glass-encapsulated electrical connector is divided into multiple grids, and the number of correct matching points in the neighborhood of the well-matched feature points by FLANN is calculated and the threshold value is used to eliminate the incorrect matching points. The experiments in this paper use public data sets and glass-encapsulated electrical connector data to verify and analyze the performance of the algorithm in terms of real-time and accuracy. The results show that the improved algorithm has a matching accuracy of more than 93% when dealing with image pairs of glass-encapsulated electrical connectors with changes in blur, brightness and rotation, and takes less than 0.4 s, which proves the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

Aiming at many problems caused by manual acceptance in decoration projects, this paper proposes an improved SSD algorithm and applies it to supervision work to replace manual acceptance and promote the realization of intelligent supervision. Since the SSD algorithm has problems such as re-examination of the same target and poor detection of small targets, the DPN network is used to replace the basic feature extraction network VGG16 in this paper. DPN combines the advantages of Resnet and Densenet and has better feature extraction ability. The feature maps are fused by weighted FPN to highlight the contributions of feature maps of different layers and enrich the semantics of feature maps for prediction. The use of depthwise separable convolution reduces the number of parameters of the model and improves the inference speed of the algorithm. The experimental comparison shows that the average accuracy of the improved model is increased by 3.47%, and the average accuracy of small number detection is improved by up to 15%, which proves that the new model has a good effect in the task of supervision target detection. [ABSTRACT FROM AUTHOR]

The materials supply for sea islands is the basis for ensuring survival needs of persons on sea islands. Considering factors such as transportation cost，storage cost，recycling demand and transportation capacity, it is a vehicle path planning problem with time window and capacity limit to use many transportation tools to supply materials for sea islands within a time cycle. The intelligent algorithm provides a preferable solution to solve this complex irregular optimization problem. The paper establishes a mathematical model of mission planning of materials supply for sea islands, explores the solving process of genetic algorithm， and uses an example to calculate it. The optimization result shows that the scheme can save transportation costs and storage costs， and also meet the need of materials supply cycle，which can provide a reference for scientific mission planning of materials supply for sea islands. [ABSTRACT FROM AUTHOR]

The complexity of modern war is increasing，and the rapid operational mission planning is of great importance to improve the efficiency of command and control. This paper presents a joint operational Task Matrix （TM） model，which is a theoretical method for mission planning; A belief network model is put forward to describe the relationship among the elements in TM model ;A naive bayesian learning method for belief network is designed; A mechanism of imagination is put forward to speed up the learning process ; A search algorithm named Deep Minimum Threat Generation Tree（DMTGT） is proposed, which can efficiently calculate task priority by balancing search error and search speed. Finally, the validity of above models and algorithms is verified by simulation experiments. [ABSTRACT FROM AUTHOR]

Mission Planning of Border Control operations refers to the process in which the relevant forces of border control make use of the Mission Planning system to plan and design relevant actions in order to achieve a specific action destination, so as to form a relatively scientific and reasonable action plan. In this paper, strategic analysis is carried out from the subject object, system composition and hierarchy of border control action task planning, and based on the transmission algorithm, the basic process of border control action task planning is discussed. [ABSTRACT FROM AUTHOR]

SM9 identity-based encryption algorithm is a commercial identity-based encryption algorithm independently designed by our country, which has become the standard of the domestic identity-based encryption algorithm industry, and is widely used in e-mail, electronic voting and online negotiation, etc. However, SM9 identity-based encryption algorithm can't effectively protect the identity privacy of the sender. Based on SM9 identity-based encryption algorithm, combined with the deniable authentication protocol, this paper proposes SM9 identity-based encryption algorithm with deniable authentication. This algorithm allows the sender to deny its participation after the protocol runs, and only the intended receiver can identify the true source of the given message. At the same time, the receiver can't convince any other third party that the message is sent by a specific sender. Under the assumption of DBDH's difficult problem, the formal definition and security model of SM9 identity-based encryption algorithm with deniable authentication are given, and the security analysis of the algorithm is given under the random oracle model, which proves that the algorithm can satisfy denial, confidentiality and deniable authentication at the same time. Theoretical analysis and simulation experiments show that the proposed algorithm not only maintains the efficiency advantage of SM9 identity-based encryption algorithm, but also has a lower computational overhead than other identity-based encryption algorithms with deniable authentication. [ABSTRACT FROM AUTHOR]

Copyright of Zhejiang Electric Power is the property of Zhejiang Electric Power Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In the era of the digitaleconomic, computing power has become an important indicator to measure the degree of national economic development. With analyzing the two national strategies of "Channel Computing Resources from the East to the West" progect and "Construction of Chengdu-Chongqing Economic Circle", and based on the construction of Chengdu-Chongqing Hub Node, the reasons that why Chengdu-Chongqing hub node has been laid out as one of the eastern hub nodes were analyzed. It due to four aspects, namely, strategic location advantage of computing, data integration system guarantee, computing infrastructure compaction, and maturity of computing application scenarios. Further, the operations in the advanced data center of Western (Chongqing) Science City demonstrate that the nationalcomputing hub built in Chengdu-Chongqing economic circle boosts the project that channels computing resources from the east to the west. Then the paper discussed the coordinated development between Tianfu data center cluster and Chongqing data center cluster, as well as the coordinated development between national computing hub built in Chengdu-Chongqing economic circle and national computing hub built in Guizhou province. It suggested that Tianfu data center cluster and Chongqing data center cluster should build coordination mechanisms from six aspects, including the network, data, computing power, industry, algorithm and energy. The neighboring national computing hubs can implement coordination based on the allocation of computing power business, the cross-domain circulation of data elements, and new business formats for digital cooperation. [ABSTRACT FROM AUTHOR]

Copyright of Food & Machinery is the property of Food & Machinery Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to study the waveform selection of radar seeker in the terminal guidance and tracking phase, this paper proposes a waveform selection algorithm in the guidance and tracking process of cognitive radar seeker. Firstly, we establish the processing flow of radar seeker waveform selection by combining the seeker guidance and observation filtering models; Secondly, we use the interactive multiple model unscented Kalman filter (IMMUKF) algorithm to solve the nonlinear tracking problem. We minimize tracking error by searching for waveform parameters based on the maximum mutual information criterion. The simulation results show that the waveform selection algorithm can effectively improve the seeker tracking accuracy and provide stable guidance overload. [ABSTRACT FROM AUTHOR]

Starlink is the only giant constellation in low Earth orbit currently being rapidly deployed. This paper analyzes the advantages and characteristics of low orbit satellite communication and summarizes Starlink construction and system architecture. The Satellite Toolkit (STK) is used to model and simulate 1 584 satellites of the first stage " Group 1". Then, according to the networking mode of Starlink satellite equipped with laser communication payload, Dijkstra algorithm is used to solve the shortest inter-satellite communication link distance between any two Starlink satellites. Thus, the theoretical shortest communication delay is calculated. The average communication delay from Hawaii Camp Smith to the Yokota. Air Base is 42. 700 7492 ms. Based on the simulation results, the military application of Starlink in communication is predicted. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Harbin University of Science & Technology is the property of Journal of Harbin University of Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The continuous development of deep learning technology has provided new ideas for image repair research over the years, and the image repair methods can understand the semantic information of image through the study of massive image data. Although the existing image repair methods have been able to generate desirable repair results, it is insufficient to deal with the details of missing part from the image when facing the image with more complex missing part, thus the restoration results are excessively smooth or blurry, and the complex structural information that misses from the image cannot be repaired well. In order to solve the issues above, an edge-guided image repair method based on generative adversarial networks technology and the corresponding algorithm are proposed in this paper, and the repair process is divided into two stages. First, the edge repair model is trained to generate more realistic edge information of the missing area. Then, the content generation model is trained to fill in the missing content information based on the edge information that has been repaired. Lastly, the experimental verification is conducted on the CelebA dataset and ParisStreet-View dataset to compare with the Shift-Net model, deep image prior (DIP) model and field factorization machine (FFM) model, and the visual qualitative analysis and quantitative index analysis are carried out on the experimental repair results. The experimental results prove that the repair method proposed in this paper for the missing complex structure information in the image is superior to the existing methods, and also reflect the edge information plays a crucial role in image repair. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Harbin University of Science & Technology is the property of Journal of Harbin University of Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Zhejiang Electric Power is the property of Zhejiang Electric Power Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Coal Science & Technology (0253-2336) is the property of Coal Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Harbin University of Science & Technology is the property of Journal of Harbin University of Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Zhejiang Electric Power is the property of Zhejiang Electric Power Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In maritime operations, the use of firepower is one of the important issues studied in the decision-making stage of command and control. The core issue of the use of firepower in maritime operations is to reasonably formulate the matching scheme between maritime combat forces, weapons and enemy targets within the effective time limit, so as to optimize the ground preparation efficiency of maritime formation and minimize our losses. This paper analyzes and summarizes the current situation of the development of firepower application methods in maritime operations, studies the current main firepower application methods and puts forward some enlightenment and suggestions on the firepower application methods in future maritime operations. [ABSTRACT FROM AUTHOR]

Copyright of Food & Machinery is the property of Food & Machinery Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Aimed at the problems such as slow convergence speed, low accuracy and easy to fall into local optimality, an improved sparrow search algorithm based on multiple strategies（ISSAMS） is proposed in this paper. Circle chaotic mapping was introduced to initialize the population, increase the diversity of the population, and improve the global search ability. Using sine and cosine search strategy was used to update the location of the finder, select the best location, enhance the local search ability, and avoid falling into the global optimization. Firefly disturbance was added to update the optimal individual position, search for feasible solutions, and improve the local search ability and search speed. In order to verify the effectiveness of the improved algorithm, five reference functions were selected for simulation experiments, among which three functions were single-peak functions and two functions were multi-peak functions, and compared with genetic algorithm, grey wolf algorithm, particle swarm optimization algorithm and sparrow search algorithm. The simulation results show that the improved sparrow search algorithm based on multiple strategies has the ability to jump out of the local optimal solution, the convergence speed is faster, the accuracy is higher, and the overall performance is better than the other four algorithms. By applying this improvement to the threshold and weight of the optimized BP neural network, the error of the BP model optimized by no improved sparrow search algorithm is reduced by 14. 73%. Compared with the BP model optimized by the other three algorithms, the average absolute percentage error of the optimized model based on the multi-strategy improved sparrow search algorithm is the lowest and has the best effect. The effectiveness of the improved algorithm is further verified. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Shanghai Jiao Tong University (1006-2467) is the property of Journal of Shanghai Jiao Tong University Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Zhejiang University (Science Edition) is the property of Journal of Zhejiang University (Science Edition) Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)