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 Hybrid Optimization Algorithm for Materialized View Selection from Data Warehouse Environments

Responding to complex analytical queries in the data warehouse(DW)is one of the most challenging tasks that require prompt attention.The problem of materialized view(MV)selection relies on selecting the most optimal views that can respond to more queries simultaneously.This work introduces a combined approach in which the constraint handling process is combined with metaheuristics to select the most optimal subset of DW views from DWs.The proposed work initially refines the solution to enable a feasible selection of views using the ensemble constraint handling technique(ECHT).The constraints such as self-adaptive penalty,epsilon(ε)-parameter and stochastic ranking(SR)are considered for constraint handling.These two constraints helped the proposed model select the finest views that minimize the objective function.Further,a novel and effective combination of Ebola and coot optimization algorithms named hybrid Ebola with coot optimization(CHECO)is introduced to choose the optimal MVs.Ebola and Coot have recently introduced metaheuristics that identify the global optimal set of views from the given population.By combining these two algorithms,the proposed framework resulted in a highly optimized set of views with minimized costs.Several cost functions are described to enable the algorithm to choose the finest solution from the problem space.Finally,extensive evaluations are conducted to prove the performance of the proposed approach compared to existing algorithms.The proposed framework resulted in a view maintenance cost of 6,329,354,613,784,query processing cost of 3,522,857,483,566 and execution time of 226 s when analyzed using the TPC-H benchmark dataset.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Efficient Virtual Network Embedding Algorithm Based on Restrictive Selection and Optimization Theory Approach

Network virtualization(NV) is widely considered as a key component of the future network and promises to allow multiple virtual networks(VNs) with different protocols to coexist on a shared substrate network(SN). One main challenge in NV is virtual network embedding(VNE). VNE is a NPhard problem. Previous VNE algorithms in the literature are mostly heuristic, while the remaining algorithms are exact. Heuristic algorithms aim to find a feasible embedding of each VN, not optimal or sub-optimal, in polynomial time. Though presenting the optimal or sub-optimal embedding per VN, exact algorithms are too time-consuming in smallscaled networks, not to mention moderately sized networks. To make a trade-off between the heuristic and the exact, this paper presents an effective algorithm, labeled as VNE-RSOT(Restrictive Selection and Optimization Theory), to solve the VNE problem. The VNERSOT can embed virtual nodes and links per VN simultaneously. The restrictive selection contributes to selecting candidate substrate nodes and paths and largely cuts down on the number of integer variables, used in the following optimization theory approach. The VNE-RSOT fights to minimize substrate resource consumption and accommodates more VNs. To highlight the efficiency of VNERSOT, a simulation against typical and stateof-art heuristic algorithms and a pure exact algorithm is made. Numerical results reveal that virtual network request(VNR) acceptance ratio of VNE-RSOT is, at least, 10% higher than the best-behaved heuristic. Other metrics, such as the execution time, are also plotted to emphasize and highlight the efficiency of VNE-RSOT.

Optimal Selection Model of Equipment Design Scheme Based on Set Pair Analysis

Selecting the optimal one from similar schemes is a paramount work in equipment design.In consideration of similarity of schemes and repetition of characteristic indices,the theory of set pair analysis(SPA)is proposed,and then an optimal selection model is established.In order to improve the accuracy and flexibility,the model is modified by the contribution degree.At last,this model has been validated by an example,and the result demonstrates the method is feasible and valuable for practical usage.

Tool selection and collision-free in 5-axis numerical control machining of free-form surfaces

The methodology of 5-axis cutter selection to avert collision for free-form surface machining by flat-end cutters is presented. The combination of different cutters is adopt aiming at short machining time and high precision. The optimal small cutter is determined based on the geometric information of the points where a cutter most probably collide with the machined surface. Several larger cutters are selected to machine the surface in order to find the interference-free area. The difference of machining time for this area between the optimal small cutter and the large cutters is calculated. The functional relationship between the machining time and the radius of a cutter is established, by which the optimal number of cutters is obtained. The combination of cutters, which possesses the minimum overall machining time, is selected as the optimal cutter sizes. A case study has demonstrated the validity of the proposed methodology and algorithms.

Optimal Route Selection Method Based on Vague Sets

Optimal route selection is an important function of vehicle trac flow guidance system. Its core is to determine the index weight for measuring the route merits and to determine the evaluation method for selecting route. In this paper, subjective weighting method which relies on driver preference is used to determine the weight and the paper proposes the multi-criteria weighted decision method based on vague sets for selecting the optimal route. Examples show that, the usage of vague sets to describe route index value can provide more decision-making information for route selection.

Optimization of Selecting Air Conditioning Cold/Heat Sources with Grey Relation Analysis

Selection of air conditioning（AC） cold/heat sources generally concerns about certain aspects and cannot reveal the whole profile of the problems. Grey relation analysis （GRA） is a data processing method to categorize the correlation extent of compared sequences and a certain reference sequence in a system with uncertain information. It is applied to evaluating and selecting AC cold/heat sources from four main aspects, which are technology, economy, reliability, and operation and management. Case study shows that the result for selecting AC cold/heat sources with the GRA method can be more reasonable and convincible. Thus it offers a new approach for designers in heating, ventilating and air conditioning field to compare and evaluate different AC cold/heat sou rces.

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.

面向工业互联网平台的二维制造服务协作优化

工业互联网平台被公认为智能制造的必要推动者,使物理制造资源得以虚拟化,并允许资源以服务的形式进行协作。作为平台的核心功能,制造服务协作优化致力于为制造任务提供高质量的服务协作解决方案。这种优化与任务的功能和数量要求密不可分,在编排服务时必须满足这些要求。然而,现有的制造服务协作优化方法主要关注服务之间针对功能需求的横向协作,很少考虑纵向协作来覆盖所需的数量。为了解决这一差距,本文提出了一种结合功能和数量协作的二维服务协作方法。首先,提出了一种描述服务的多粒度制造服务建模方法。在此基础上,建立了二维制造服务协同优化模型。在垂直维度上,多个功能等效的服务组成一个服务集群来完成一个子任务;在水平维度上,互补服务集群协作完成整个任务。服务的选择和所选服务的金额分配是模型中的关键问题。为了解决这个问题,设计了一种具有多个局部搜索算子的多目标模因算法。将该算法嵌入竞争机制来动态调整本地搜索算子的选择概率。实验结果表明,与常用算法相比,该算法在收敛性、解质量和综合度量方面具有优势。