An optimizing selection model in preparation of powdery emulsion explosives

In order to get cheap and excellent PEE (Powdery Emulsion Explosives), themodel of optimizing selection on preparation of PEE was established by the Neural Net Theory (NNT).On the basis of some data in the study of PEE, the training, prediction and optimizing selection ofthe Neural Net (NN) model were finished by compiling procedures. The results indicate that the modelis helpful to the preparation of PEE and worthy to extend and apply broadly.

Optimizing selection of bridge raft based on fuzzy matter-element model and combination weighting

It＇ s a necessary selection to support the maneuver across Yangtze River by floating bridge constructed by portable steel bridge and civilian ships. It is a comprehensive index for the scheme of bridge raft, containing a variety of technical factors and uncertainties. The optimization is the selection in the constructing time, quantity of equipments and man power. Based on the calculation result of bridge rafts, an evaluating system is established, consisting of index of spacing between interior bays, raft length, truss numbers, operation difficulty and maximal bending stress. A fuzzy matter element model of optimizing selection of bridge rafts was built up by combining quantitative analysis with qualitative analysis. The method of combination weighting was used to calculate the value of weights index to reduce the subjective randomness. The sequence of schemes and the optimization resuh were gained finally based on euclid approach degree. The application result shows that it is simple and practical.

Towards complex scenes: A deep learning-based camouflaged people detection method for snapshot multispectral images

Camouflaged people are extremely expert in actively concealing themselves by effectively utilizing cover and the surrounding environment. Despite advancements in optical detection capabilities through imaging systems, including spectral, polarization, and infrared technologies, there is still a lack of effective real-time method for accurately detecting small-size and high-efficient camouflaged people in complex real-world scenes. Here, this study proposes a snapshot multispectral image-based camouflaged detection model, multispectral YOLO(MS-YOLO), which utilizes the SPD-Conv and Sim AM modules to effectively represent targets and suppress background interference by exploiting the spatial-spectral target information. Besides, the study constructs the first real-shot multispectral camouflaged people dataset(MSCPD), which encompasses diverse scenes, target scales, and attitudes. To minimize information redundancy, MS-YOLO selects an optimal subset of 12 bands with strong feature representation and minimal inter-band correlation as input. Through experiments on the MSCPD, MS-YOLO achieves a mean Average Precision of 94.31% and real-time detection at 65 frames per second, which confirms the effectiveness and efficiency of our method in detecting camouflaged people in various typical desert and forest scenes. Our approach offers valuable support to improve the perception capabilities of unmanned aerial vehicles in detecting enemy forces and rescuing personnel in battlefield.

Molecular Dynamic Simulation on the Absorbing Process of Isolating and Coating of α-olefin Drag Reducing Polymer

The absorbing process in isolating and coating process of α-olefin drag reducing polymer was studied by molecular dynamic simulation method, on basis of coating theory of α-olefin drag reducing polymer particles with polyurethane as coating material. The distributions of sodium laurate, sodium dodeeyl sulfate, and sodium dodeeyl benzene sulfonate on the surface of α-olefin drag reducing polymer particles were almost the same, but the bending degrees of them were obviously different. The bending degree of SLA molecules was greater than those of the other two surfactant molecules. Simulation results of absorbing and accumulating structure showed that, though hydrophobie properties of surfactant molecules were almost the same, water density around long chain sulfonate sodium was bigger than that around alkyl sulfate sodium. This property goes against useful absorbing and accumulating on the surface of α-olefin drag reducing polymer particles; simulation results of interactions of different surfactant and multiple hydroxyl compounds on surface of particles showed that, interactions of different surfaetant and one kind of multiple hydroxyl compound were similar to those of one kind of surfaetant and different multiple hydroxyl compounds. These two contrast types of interactions also exhibited the differences of absorbing distribution and closing degrees to surface of particles. The sequence of closing degrees was derived from simulation; control step of addition polymerization interaction in coating process was absorbing mass transfer process, so the more closed to surface of particle the multiple hydroxyl compounds were, the easier interactions With isoeyanate were. Simulation results represented the compatibility relationship between surfactant and multiple hydroxyl compounds. The isolating and coating processes of α-olefin drag reducing polymer were further understood on molecule and atom level through above simulation research, and based on the simulation, a referenced theoretical basis was provided for practical optimal selection and experimental preparation of α-olefin drag reducing polymer particles suspension isolation agent.

森林优化特征选择算法的增强与扩展

特征选择作为一种重要的数据预处理方法,不但能解决维数灾难问题,还能提高算法的泛化能力.各种各样的方法已被应用于解决特征选择问题,其中,基于演化计算的特征选择算法近年来获得了更多的关注并取得了一些成功.近期研究结果表明,森林优化特征选择算法具有更好的分类性能及维度缩减能力.然而,初始化阶段的随机性、全局播种阶段的人为参数设定,影响了该算法的准确率和维度缩减能力;同时,算法本身存在着高维数据处理能力不足的本质缺陷.从信息增益率的角度给出了一种初始化策略,在全局播种阶段,借用模拟退火控温函数的思想自动生成参数,并结合维度缩减率给出了适应度函数;同时,针对形成的优质森林采取贪心算法,形成一种特征选择算法EFSFOA(enhanced feature selection using forest optimization algorithm).此外,在面对高维数据的处理时,采用集成特征选择的方案形成了一个适用于EFSFOA的集成特征选择框架,使其能够有效处理高维数据特征选择问题.通过设计对比实验,验证了EFSFOA与FSFOA相比在分类准确率和维度缩减率上均有明显的提高,高维数据处理能力更是提高到了100 000维.将EFSFOA与近年来提出的比较高效的基于演化计算的特征选择方法进行对比,EFSFOA仍具有很强的竞争力.

Dynamic services selection algorithm in Web services composition supporting cross-enterprises collaboration

Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.

Application of fuzzy optimal selection of similar slopes to the evaluation of slope stability

The numerical calculation method is widely used in the evaluation of slope stability,but it cannot take the randomness and fuzziness into account that exist in rock and soil engineering objectively.The fuzzy optimization theory is thus introduced to the evaluation of slope stability by this paper and a method of fuzzy optimal selection of similar slopes is put forward to analyze slope stability.By comparing the relative membership degrees that the evaluated object sample of slope is similar to the source samples of which the stabilities are detected clearly,the source sample with the maximal relative membership degree will be chosen as the best similar one to the object sample,and the stability of the object sample can be evaluated by that of the best similar source sample.In the process many uncertain influential factors are considered and characteristics and knowledge of the source samples are obtained.The practical calculation indicates that it can achieve good results to evaluate slope stability by using this method.

Test selection and optimization for PHM based on failure evolution mechanism model

The test selection and optimization （TSO） can improve the abilities of fault diagnosis, prognosis and health-state evalua- tion for prognostics and health management （PHM） systems. Traditionally, TSO mainly focuses on fault detection and isolation, but they cannot provide an effective guide for the design for testability （DFT） to improve the PHM performance level. To solve the problem, a model of TSO for PHM systems is proposed. Firstly, through integrating the characteristics of fault severity and propa- gation time, and analyzing the test timing and sensitivity, a testability model based on failure evolution mechanism model （FEMM） for PHM systems is built up. This model describes the fault evolution- test dependency using the fault-symptom parameter matrix and symptom parameter-test matrix. Secondly, a novel method of in- herent testability analysis for PHM systems is developed based on the above information. Having completed the analysis, a TSO model, whose objective is to maximize fault trackability and mini- mize the test cost, is proposed through inherent testability analysis results, and an adaptive simulated annealing genetic algorithm （ASAGA） is introduced to solve the TSO problem. Finally, a case of a centrifugal pump system is used to verify the feasibility and effectiveness of the proposed models and methods. The results show that the proposed technology is important for PHM systems to select and optimize the test set in order to improve their performance level.

Center for Plant Conservation's Best Practice Guidelines for the reintroduction of rare plants

Recent estimates indicate that one-fifth of botanical species worldwide are considered at risk of becoming extinct in the wild. One available strategy for conserving many rare plant species is reintroduction, which holds much promise especially when carefully planned by following guidelines and when monitored long-term. We review the Center for Plant Conservation Best Reintroduction Practice Guidelines and highlight important components for planning plant reintroductions. Before attempting reintroductions practitioners should justify them, should consider alternative conservation strategies, understand threats, and ensure that these threats are absent from any recipient site. Planning a reintroduction requires considering legal and logistic parameters as well as target species and recipient site attributes.Carefully selecting the genetic composition of founders, founder population size, and recipient site will influence establishment and population growth. Whenever possible practitioners should conduct reintroductions as experiments and publish results. To document whether populations are sustainable will require long-term monitoring for decades, therefore planning an appropriate monitoring technique for the taxon must consider current and future needs. Botanical gardens can play a leading role in developing the science and practice of plant reintroduction.

AHP-Based Optimal Selection of Garment Sizes for Online Shopping

Garment online shopping has been accepted by more and more consumers in recent years. In online shopping, a buyer only chooses the garment size judged by his own experience without trying-on, so the selected garment may not be the fittest one for the buyer due to the variety of body's figures. Thus, we propose a method of optimal selection of garment sizes for online shopping based on Analytic Hierarchy Process (AHP). The hierarchical structure model for optimal selection of garment sizes is structured and the fittest garment for a buyer is found by calculating the matching degrees between individual's measurements and the corresponding key-part values of ready-to-wear clothing sizes. In order to demonstrate its feasibility, we provide an example of selecting the fittest sizes of men's bottom. The result shows that the proposed method is useful in online clothing sales application.

Directional Filter for SAR Images Based on Nonsubsampled Contourlet Transform and Immune Clonal Selection

A directional filter algorithm for intensity synthetic aperture radar （SAR） image based on nonsubsampled contourlet transform （NSCT） and immune clonal selection （ICS） is presented. The proposed filter mainly focuses on exploiting different features of edges and noises by NSCT. Furthermore, ICS strategy is introduced to optimize threshold parameter and amplify parameter adaptively. Numerical experiments on real SAR images show that there are improvements in both visual effects and objective indexes.

A Genetic Fuzzy Analytical Hierarchy Process Based Projection Pursuit Method for Selecting Schemes of Water Transportation Projects

The optimal selection of schemes of water transportation projects is a process of choosing a relatively optimal scheme from a number of schemes of water transportation programming and management projects, which is of importance in both theory and practice in water resource systems engineering. In order to achieve consistency and eliminate the dimensions of fuzzy qualitative and fuzzy quantitative evaluation indexes, to determine the weights of the indexes objectively, and to increase the differences among the comprehensive evaluation index values of water transportation project schemes, a projection pursuit method, named FPRM-PP for short, was developed in this work for selecting the optimal water transportation project scheme based on the fuzzy preference relation matrix. The research results show that FPRM-PP is intuitive and practical, the correction range of the fuzzy rained is both stable and accurate; preference relation matrix A it produces is relatively small, and the result obtherefore FPRM-PP can be widely used in the optimal selection of different multi-factor decision-making schemes.

Research on handover algorithm to reduce the blocking probability in LEO satellite network

Based on the characteristics of guaranteed handover （GH） algorithm, the finite capacity in one system makes the blocking probability （PB） of GH algorithm increase rapidly in the case of high traffic losd. So, when large amounts of multimedia services are transmitted via a single low earth orbit （LEO） satellite system, the PB of it is much higher. In order to solve the problem, a novel handover scheme defined by multi-tier optimal layer selection is proposed. The scheme sufficiently takes into account the characteristics of double-tier satellite network, which is constituted by LEO satellites combined with medium earth orbit （MEO） satellites, and the multimedia transmitted by such network, so it can augment this systematic capacity and effectively reduces the traffic loed in the LEO which performs GH algorithm. The detailed processes are also presented. The simulation and numerical results show that the approach integrated with GH algorithm achieves a significant improvement in the PB and practicality, as compared to the single LEO layer network.

Competitive Swarm Optimization with Encryption Based Steganography for Digital Image Security

Digital image security is a fundamental and tedious process on shared communication channels.Several methods have been employed for accomplishing security on digital image transmission,such as encryption,steganography,and watermarking.Image stenography and encryption are commonly used models to achieve improved security.Besides,optimal pixel selection process(OPSP)acts as a vital role in the encryption process.With this motivation,this study designs a new competitive swarmoptimization with encryption based stenographic technique for digital image security,named CSOES-DIS technique.The proposed CSOES-DIS model aims to encrypt the secret image prior to the embedding process.In addition,the CSOES-DIS model applies a double chaotic digital image encryption(DCDIE)technique to encrypt the secret image,and then embedding method was implemented.Also,the OPSP can be carried out by the design of CSO algorithm and thereby increases the secrecy level.In order to portray the enhanced outcomes of the CSOES-DIS model,a comparative examination with recent methods is performed and the results reported the betterment of the CSOES-DIS model based on different measures.

Multi-Source Adaptive Selection and Fusion for Pedestrian Dead Reckoning

Accurate multi-source fusion is based on the reliability, quantity, and fusion mode of the sources. The problem of selecting the optimal set for participating in the fusion process is nondeterministic-polynomial-time-hard and is neither sub-modular nor super-modular. Furthermore, in the case of the Kalman filter(KF) fusion algorithm, accurate statistical characteristics of noise are difficult to obtain, and this leads to an unsatisfactory fusion result. To settle the referred cases, a distributed and adaptive weighted fusion algorithm based on KF has been proposed in this paper. In this method, on the basis of the pseudo prior probability of the estimated state of each source, the reliability of the sources is evaluated and the optimal set is selected on a certain threshold. Experiments were performed on multi-source pedestrian dead reckoning for verifying the proposed algorithm. The results obtained from these experiments indicate that the optimal set can be selected accurately with minimal computation, and the fusion error is reduced by 16.6% as compared to the corresponding value resulting from the algorithm without improvements.The proposed adaptive source reliability and fusion weight evaluation is effective against the varied-noise multi-source fusion system, and the fusion error caused by inaccurate statistical characteristics of the noise is reduced by the adaptive weight evaluation.The proposed algorithm exhibits good robustness, adaptability,and value on applications.

Comparison between PCA and KPCA methods in comprehensive evaluation of robotic kinematic dexterity

Due to the correlation and diversity of robotic kinematic dexterity indexes, the principal component analysis （PCA） and kernel principal component analysis （KPCA） based on linear dimension reduction and nonlinear dimension reduction principle could be respectively introduced into comprehensive kinematic dexterity performance evaluation of space 3R robot of different tasks. By comparing different dimension reduction effects, the KPCA method could deal more effectively with the nonlinear relationship among different single kinematic dexterity indexes, and its calculation result is more reasonable for containing more comprehensive information. KPCA＇ s calculation provides scientific basis for optimum order of robotic tasks, and furthermore a new optimization method for robotic task selection is proposed based on various performance indexes.

Using Extension Theory and Fuzzy Analytic Hierarchy Process on Heterogeneous Wireless Network Selection Algorithm

In order to solve the problem that determining decision factors weights is of subjectivity in heterogeneous wireless network selection algorithm, a network selection algorithm based on extension theory and fuzzy analytic hierarchy process （FAHP） is proposed in this paper. In addition, user and operator codetermine the optimal network using the proposed algorithm, which can give consideration to user and operator benefits. The fuzzy judgment matrix is coustructed by membership degree of decision factors which is calculated according to extension theory. The comprehensive weight of each decision factor is obtained using FAHP. Finally, the optimal network is selected through total property value ranldng of each candidate network under user preference and operator preference. The simulation results show that the proposed algorithm can select the optimal network efficiently and accurately, satisfy user preference, and implement load balance between networks.

Strategy Selection for Moving Target Defense in Incomplete Information Game

As a core component of the network,web applications have become one of the preferred targets for attackers because the static configuration of web applications simplifies the exploitation of vulnerabilities by attackers.Although the moving target defense(MTD)has been proposed to increase the attack difficulty for the attackers,there is no solo approach can cope with different attacks;in addition,it is impossible to implement all these approaches simultaneously due to the resource limitation.Thus,the selection of an optimal defense strategy based on MTD has become the focus of research.In general,the confrontation of two players in the security domain is viewed as a stochastic game,and the reward matrices are known to both players.However,in a real security confrontation,this scenario represents an incomplete information game.Each player can only observe the actions performed by the opponent,and the observed actions are not completely accurate.To accurately describe the attacker’s reward function to reach the Nash equilibrium,this work simulated and updated the strategy selection distribution of the attacker by observing and investigating the strategy selection history of the attacker.Next,the possible rewards of the attacker in each confrontation via the observation matrix were corrected.On this basis,the Nash-Q learning algorithm with reward quantification was proposed to select the optimal strategy.Moreover,the performances of the Minimax-Q learning algorithm and Naive-Q learning algorithm were compared and analyzed in the MTD environment.Finally,the experimental results showed that the strategy selection algorithm can enable defenders to select a more reasonable defensive strategy and achieve the maximum possible reward.

Cooperative Channel and Optimized Route Selection in Adhoc Network

Over the last decade,mobile Adhoc networks have expanded dramati-cally in popularity,and their impact on the communication sector on a variety of levels is enormous.Its uses have expanded in lockstep with its growth.Due to its instability in usage and the fact that numerous nodes communicate data concur-rently,adequate channel and forwarder selection is essential.In this proposed design for a Cognitive Radio Cognitive Network(CRCN),we gain the confidence of each forwarding node by contacting one-hop and second level nodes,obtaining reports from them,and selecting the forwarder appropriately with the use of an optimization technique.At that point,we concentrate our efforts on their channel,selection,and lastly,the transmission of data packets via the designated forwarder.The simulation work is validated in this section using the MATLAB program.Additionally,steps show how the node acts as a confident forwarder and shares the channel in a compatible method to communicate,allowing for more packet bits to be transmitted by conveniently picking the channel between them.We cal-culate the confidence of the node at the start of the network by combining the reliability report for thefirst hop and the reliability report for the secondary hop.We then refer to the same node as the confident node in order to operate as a forwarder.As a result,we witness an increase in the leftover energy in the output.The percentage of data packets delivered has also increased.

A Novel Improved Artificial Bee Colony and Blockchain-Based Secure Clustering Routing Scheme for FANET

Flying Ad hoc Network(FANET)has drawn significant consideration due to its rapid advancements and extensive use in civil applications.However,the characteristics of FANET including high mobility,limited resources,and distributed nature,have posed a new challenge to develop a secure and ef-ficient routing scheme for FANET.To overcome these challenges,this paper proposes a novel cluster based secure routing scheme,which aims to solve the routing and data security problem of FANET.In this scheme,the optimal cluster head selection is based on residual energy,online time,reputation,blockchain transactions,mobility,and connectivity by using Improved Artificial Bee Colony Optimization(IABC).The proposed IABC utilizes two different search equations for employee bee and onlooker bee to enhance convergence rate and exploitation abilities.Further,a lightweight blockchain consensus algorithm,AI-Proof of Witness Consensus Algorithm(AI-PoWCA)is proposed,which utilizes the optimal cluster head for mining.In AI-PoWCA,the concept of the witness for block verification is also involved to make the proposed scheme resource efficient and highly resilient against 51%attack.Simulation results demonstrate that the proposed scheme outperforms its counterparts and achieves up to 90%packet delivery ratio,lowest end-to-end delay,highest throughput,resilience against security attacks,and superior in block processing time.