基于YOLOv5s-FCS的钢材表面缺陷检测

针对传统钢材表面缺陷检测方法易出现误检、漏检和部分缺陷种类检测精度低等问题,本文设计了一种钢材表面缺陷网络YOLOv5s-FCS。首先本文引用了FReLU激活函数构建了卷积模块CBF,有效增强了网络的空间解析能力,优化了网络检测精度;其次,本文将坐标注意力机制嵌入到网络的neck部分来增强网络特征融合的能力,从而使网络能够提取更加丰富的特征信息;最后,将YOLOv5s的损失函数替换为SIoU loss,提高了预测框的回归精度。通过在NEU-DET数据集上进行消融实验、可视化对比实验,结果表明,YOLOv5s-FCS网络的mAP值达到了0.747,相较于原YOLOv5s网络提高了8.3%,相较于YOLOv3网络提高了11.8%,相较于YOLOXs网络提高了4.2%,相较于YOLOv6s提高了1.4%,验证了该方法的可行性、有效性。     

一种面向在轨服务卫星地面应用系统的软件开发方法

为解决现有在轨服务卫星地面应用系统瀑布式软件开发模型灵活性差,难以适应用户需求变化等不足,通过利用敏捷开发模型的思路,设计了一种迭代式在轨服务卫星地面应用系统软件开发方法,将用户纳入到软件开发过程中,在各个研制阶段持续与用户进行需求迭代,完成业务软件的功能升级。结果表明：该方法可提升业务软件功能与用户需求的匹配程度,并为后续在轨服务卫星地面应用系统的建设提供参考。     

石榴枯萎病的生防木霉菌株的筛选及鉴定

目的 石榴枯萎病是由甘薯长喙壳菌引起,对石榴有严重危害的土传病害。利用拮抗微生物抑制病原菌的繁殖是石榴枯萎病绿色防控的有效手段。通过筛选具有对石榴枯萎病原菌产生拮抗效果的微生物,研究其抑制菌作用,以期为石榴枯萎病生物防控提供菌种资源。方法 从石榴的根际土壤中分离出真菌,根据产孢量、生长速率、拮抗系数及平板对峙结果进行筛选,对防效较好的真菌根据形态学和分子系统学进行鉴定,通过盆栽实验评估其对石榴枯萎病的防治效果。结果 能有效抑制石榴枯萎病菌菌丝的生长的菌株T9经鉴定为非洲哈茨木霉菌（Trichoderma afroharzianum）,盆栽防治效果最高可达71.35%。结论 该菌株展现出了对石榴枯萎病的生物防治效果,具有应用价值。     

Attentional negativity bias moderated by positive mood arousal

Automatically allocation of more attention to negative stimuli is called emotional negativity bias. An event-related potentials (ERPs) experiment investigated whether or not this bias was altered by positive mood arousal. The results suggested that the attention bias towards negative stimuli was attenuated when positive information was accessible.     

热浸Zn-Ni-V合金镀层的氧化行为

研究了热浸纯Zn和Zn-0.05%Ni-0.05%V镀层在350℃下的恒温氧化行为。采用SEM、OM、EDS、XRD等方法分析了镀层氧化前后的表面、截面形貌及相组成。结果表明:Zn-0.05%Ni-0.05%V镀层可以有效地抑制Fe-Zn反应和ζ相层的超厚生长;350℃下氧化150h后,纯Zn和Zn-0.05%Ni-0.05%V镀层由ZnO和FeZn8.87两相组成;各镀层氧化动力学曲线主要为抛物线类型;在氧化过程中,纯Zn镀层形成大量的孔洞,氧化增重速率快,而Zn-0.05%Ni-0.05%V镀层组织较致密,具有更优的抗氧化性能     

Research on secure buyer-seller watermarking protocol

A new buyer-seller watermarking protocol is proposed by applying a double encryption method and a novel mechanism of embedding a buyer＇s watermark. The protocol can effectively prevent against collusion attacks and the man in the middle attack if the third party is not trusted. Also, based on the proposed scheme for the first-hand transaction, a new buyer-reseller watermarking protocol and a formal multi-party watermarking protocol are also proposed. The proposed buyer-resell watermarking protocol only needs the original seller to provide transfer certificate and encryption-decryption service to support the second-hand transaction, and the multi-party watermarking protocol with distributed certificate authorities can overcome the difficulty in the combination of multicast mechanism with multiple unique watermarks and allow a seller to multicast the watermarked digital contents and key transaction information to n buyers. Furthermore, the idea of zero knowledge proof is also applied into the proposed scheme to allow the seller to take an effective control on the task performed by the third party.     

Cluster Synchronization in a Complex Dynamical Network with Two Nonidentical Clusters

This paper further investigates cluster synchronization in a complex dynamical network with two-cluster. Each cluster contains a number of identical dynamical systems, however, the subsystems composing the two clusters can be different, i.e., the individual dynamical system in one cluster can differ from that in the other cluster. Complete synchronization within each cluster is possible only if each node from one cluster receives the same input from nodes in other cluster. In this case, the stability condition of one-cluster synchronization is known to contain two terms： the first accounts for the contribution of the inner-cluster coupling structure while the second is simply an extra linear term, which can be deduced by the ＂same-input＂ condition. Applying the connection graph stability method, the authors obtain an upper bound of input strength for one cluster if the first account is known, by which the synchronizability of cluster can be scaled. For different clusters, there are different upper bound of input strength by virtue of different dynamics and the corresponding cluster structure. Moreover, two illustrative examples are presented and the numerical simulations coincide with the theoretical analysis.     

Data fusion control and guidance of surface-to-air missile under the complex circumstance based on neural-net technology

Under the complicated electromagnetism circumstance, the model of data fusion control and guidance of surface-to-air missile weapon systems is established. Such ways and theories as Elman-NN, radar tracking and filter＇s data fusion net based on the group method for data-processing （GMRDF） are applied to constructing the model of data fusion. The highly reliable state estimation of the tracking targets and the improvement in accuracy of control and guidance are obtained. The purpose is optimization design of data fusion control and guidance of surface-to-air missile weapon systems and improving the fighting effectiveness of surface-to-air missile weapon systems.     

Optimal maintenance and replacement of extraction machinery

This paper considers a problem of optimal preventive maintenance and replacement schedule of equipment devoted to extracting resources from known deposits. Typical examples are oil drills, mine shovels, etc. At most one replacement of the existing machinery by a new one is allowed. The problem is formulated as an optimal control problem subject to the state constraint that the remaining deposit at any given time is nonnegative. We show that the optimal preventive maintenance, production rates, and the replacement and salvage times of the existing machinery and the new one, if required, can be obtained by solving sequentially a series of free-end-point optimal control problems. Moreover, an algorithm based on this result is developed and used to solve two illustrative examples.     

An improved branch-and-bound algorithm to minimize the weighted flowtime on identical parallel machines with family setup times

This article investigates identical parallel machines scheduling with family setup times. The objective function being the weighted sum of completion times, the problem is known to be strongly NP-hard. We propose a constructive heuristic algorithm and three complementary lower bounds. Two of these bounds proceed by elimination of setup times or by distributing each of them to jobs of the corresponding family, while the third one is based on a lagrangian relaxation. The bounds and the heuristic are incorporated into a branch-and-bound algorithm. Experimental results obtained outperform those of the methods presented in previous works, in term of size of solved problems.