Search

How to improve the high resolution and remove the noise of composite infrared thermal wave detection image have become important research topics in machine vision. Therefore, this paper proposes a composite image enhancement algorithm based on edge adaptive total variation of direction. Using the improved adaptive directional total variation model to construct the guidance image of the guidance filter can provide better structural information for the guidance filter and conduct the guidance filter. This process is iterated to eliminate noise and ladder effect. Experimental results show that this algorithm is superior to other advanced methods in objective evaluation index and subjective vision. The algorithm proposed in this paper can not only effectively eliminate noise and ladder effect, but also highlight image details and structure information, which proves the effectiveness of this algorithm. Discover the cutting-edge algorithm for high-resolution improvement and noise elimination in infrared thermal wave detection images. Our innovative composite image enhancement technique, based on edge adaptive total variation, outperforms traditional methods. The improved directional model provides better structural information, optimizing the guidance filter process. Experimental results reveal its superiority in objective evaluation and subjective vision. This algorithm effectively eliminates noise and ladder effect while highlighting image details, validating its remarkable effectiveness. [ABSTRACT FROM AUTHOR]

This paper explores citation-based metrics, how they differ in ranking papers and authors, and why. We initially take as example three main metrics that we believe significant; the standard citation count, the more and more popular h-index, and a variation we propose of PageRank applied to papers (called PaperRank), that is appealing as it mirrors proven and successful algorithms for ranking web pages. As part of analyzing them, we develop generally applicable techniques and metrics for qualitatively and quantitatively analyzing indexes that evaluate content and people, as well as for understanding the causes of their different behaviors. Finally, we extend the analysis to other popular indexes, to show whether the choice of the index has a significant effect in how papers and authors are ranked. We put the techniques at work on a dataset of over 260 K ACM papers, and discovered that the difference in ranking results is indeed very significant (even when restricting to citation-based indexes), with half of the top-ranked papers differing in a typical 20-element long search result page for papers on a given topic, and with the top researcher being ranked differently over half of the times in an average job posting with 100 applicants. [ABSTRACT FROM AUTHOR]

At present, there are many semantic segmentation algorithms with excellent performance for intelligent driving vehicles, but most of them only work well on scenes with good illumination. In order to solve the problem of scene segmentation under low illumination, this paper proposes a novel semantic segmentation algorithm that combines visible and infrared images. In this algorithm, two parallel encoders are designed as the input of the images, and the decoder divides the fused images output from the encoder. The model is based on ResNet algorithm, and the residual attention module is used in each branch to mine and enhance the spatial features of multilevel channels to extract images information. Experiments are carried out on publicly available thermal infrared and visible datasets. The results show that the algorithm proposed in this paper is superior to the algorithm using only visible images in semantic segmentation of traffic environment. [ABSTRACT FROM AUTHOR]

Personalized recommendation systems learn user preference characteristics by analyzing behavioral data such as ratings and comments generated by users in the Internet, and provide precise recommendations for individual users accordingly. However, in real life, users often conduct group activities like group buying and traveling together. How to recommend for groups has become a heated research topic in recent years. Most existing group recommendation algorithms are recommended for given divided groups by collectively combining the preferences of members in the group. However, in most cases, users' group properties are fickle. As the results of group detection are decisive to the performance of group recommendation, group detection is particularly important to the group recommendation algorithm. After analyzing problems of existing group recommendation algorithms, this paper proposes the density peak clustering group detection algorithm based on GRU-CNN and the group recommendation algorithm based on the mechanism. With respect to group detection, most of the existing group detection algorithms suffer from certain deficiencies: First, depending solely on the users' static preference features while ignoring the variation of users' interest over time when finding the group structure in the network; second, group division based on users' topic features extracted from reviews is difficult to support further digging of the in-depth features in reviews. To address the above-mentioned problems, this paper proposes a density peak clustering group detection algorithm based on CNN-GRU. It would first extract representative keywords in the reviews with LDA topic model, and then model time series information based on GRU attaining users' dynamic topic features. Coupling with deeper characteristics cored out by CNN, density peak clustering algorithm completes its group detection finally. Experiments on real dataset indicate that the features mined by the fusion depth neural network model effectively capture users' dynamic preferences, and yield better results of group detection than that of existing algorithms. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet of Things (IoT) and Internet technology, the product of the combination of the two, the Industrial Internet, has also received extensive attention and there are more and more research achievements related to the Industrial Internet. In the industrial Internet system, the communication network system composed of sensors, communication nodes, controllers and other intelligent devices can realize efficient and convenient data interaction between people and machines, providing an important infrastructure and technical support for industrial big data analysis and intelligent production. However, in the current industrial Internet system, industrial equipment users generally have the problem of low computing energy efficiency, and the collected industrial data has a high-security risk in the transmission, processing and other processes. At the same time, the size and scale of the industrial Internet equipment group is huge, and the lack of rational resource allocation leads to excessive waste of computing resources in the system, which is also a prominent problem of the current industrial Internet system. In response to the above questions, this paper, on the basis of reading a large number of documents, integrates the improved DRL algorithm, End-Edge-Cloud architecture and blockchain to form a new industrial Internet architecture. The architecture realizes computing offload through the three-tier structure of terminal layer, edge layer and cloud layer, and guarantees the security of industrial data through the decentralized feature of blockchain, ultimately achieving the goal of reducing energy consumption, computing overhead and trusted computing. In the architecture proposed in this paper, the dynamic unloading of industrial data and computing tasks is achieved through a three-tier architecture. The MDP is used to build an optimization problem model, and the improved DRL algorithm is used to iteratively solve the optimal computing resource scheduling strategy. The main research contents of this paper include (1) Using MDP to model optimization problems; (2) Propose an industrial Internet system architecture that integrates and improves DRL, "end edge cloud" and blockchain; (3) The MDP problem is solved iteratively based on deep reinforcement learning. The simulation results show that the proposed architecture has more advantages than the existing six architectures in terms of computing cost, equipment energy consumption and total working time. [ABSTRACT FROM AUTHOR]

Assume that we are given a sequence F of k homogeneous polynomials in n variables of degree at most d and the ideal ℐ generated by this sequence. The aim of this paper is to present a new and effective method to determine, within the arithmetic complexity d O (n) , whether F is regular. This algorithm has been implemented in Maple and its efficiency (compared to the classical approaches for regular sequence test) is evaluated via a set of benchmark polynomials. Furthermore, we show that if F is regular then we can transform ℐ into Nœther position and at the same time compute a reduced Gröbner basis for the transformed ideal within the arithmetic complexity d O (n 2) . Finally, under the same assumption, we establish the new upper bound 2 (d k / 2) 2 n − k − 1 for the maximum degree of the elements of any reduced Gröbner basis of ℐ in the case that n > k. [ABSTRACT FROM AUTHOR]

In view of the problems of high production cost, scarcity and lack of diversity of 3D face datasets, this paper designs an end-to-end self-supervised learning 3D face reconstruction algorithm with a single 2D face image as input, which only uses 2D face datasets to complete model training. First, the improved ResNet module is introduced to preprocess the input face image. The deep residual neural network has strong feature extraction and characterization ability for the image, which can provide rich high-level semantic feature maps for the subsequent subnetwork. Then, add transformer module completely based on self-attention mechanism to the parameter prediction subnetwork, which can make different parameters of the subnetwork focus on self-related feature map information and avoid interference from invalid feature map information, so as to further improve the parameter prediction accuracy of the subnetwork. Next, training, ablation and comparison experiments were conducted on CelebA, BFM and Photoface datasets, and the combined function of pixel loss function and perceptual loss function was selected as the loss function. The experimental results show that: compared with the historical optimal results of the same network structure, the scale-invariant depth error (SIDE) and mean angle deviation (MAD) are improved by 5.9% and 10.8%, respectively, which strongly proves the effectiveness of the algorithm. Finally, in order to verify the actual effect of the 3D face reconstruction algorithm, examples are selected in this paper for reconstruction. The 3D faces generated by the algorithm all have a good sense of reality, which intuitively and effectively proves the advancement of the algorithm. [ABSTRACT FROM AUTHOR]

Intelligent agriculture has become the development trend of agriculture in the future, and it has a wide range of research and application scenarios. Using machine learning to complete basic tasks for people has become a reality, and this ability is also used in machine vision. In order to save the time in the fruit picking process and reduce the cost of labor, the robot is used to achieve the automatic picking in the orchard environment. Cherry target detection algorithms based on deep learning are proposed to identify and pick cherries. However, most of the existing methods are aimed at relatively sparse fruits and cannot solve the detection problem of small and dense fruits. In this paper, we propose a cherry detection model based on YOLOv5s. First, the shallow feature information is enhanced by convolving the feature maps sampled by two times down in BackBone layer of the original network model to the input end of the second and third CSP modules. In addition, the depth of CSP module is adjusted and RFB module is added in feature extraction stage to enhance feature extraction capability. Finally, Soft- Non-Maximum Suppression (Soft-NMS) is used to minimize the target loss caused by occlusion. We test the performance of the model, and the results show that the improved YOLOv5s-cherry model has the best detection performance for small and dense cherry detection, which is conducive to intelligent picking. [ABSTRACT FROM AUTHOR]

This research paper develops an algorithm to solve a neutrosophic linear fractional optimization problem, where the cost of the objective functions, the technology coefficients, and the resources are neutrosophic numbers (triangular and trapezoidal numbers). Two defuzzification methods are used here to convert the neutrosophic linear fractional optimization problem into a multi-objective linear fractional optimization problem (MOLFOP). The fractional objective function is defuzzified using the component-wise optimization method, and the linear constraints are defuzzified using the aggregation ranking function strategy. Hence, the MOLFOP is then solved using the fuzzy goal programming method. In order to further explain our suggested algorithm, two numerical examples are solved at the end, and the outcomes obtained by our method are compared with the outcomes obtained using the other algorithm. [ABSTRACT FROM AUTHOR]

In stock trading, a common phenomenon is that the trends of stocks in the same industry are very similar. In contrast, the movements of stocks in different industries are often different. Therefore, applying the same model to all stock trading is inappropriate without distinguishing the industries in which the stocks belong. However, recommending an optimal industry stock trading model is very challenging based on performance evaluation indicators. First, the indicators of the trading model are diverse. Second, the ranking of multiple indicators is often inconsistent. In the paper, we model the problem to be solved as a multi-criteria decision-making process. Therefore, we first divide stock dataset into nine industries according to their main business. Then, we apply several machine learning algorithms as candidate models to generate trading signals. Second, we conduct daily trading backtesting based on the trading signals to obtain multiple performance evaluation indicators. Third, we propose an optimal recommendation algorithm for the industry stock trading model with TODIM. The experimental results in the US stock market and China's A-share market show that the proposed algorithm can get a better trading model out-of-sample industry stock. Moreover, we effectively evaluate the generalization ability of the algorithm based on the proposed metrics. Finally, the proposed long–short portfolios based on the algorithm have achieved returns exceeding the benchmark on most out-of-sample datasets. [ABSTRACT FROM AUTHOR]

To achieve a dynamic comprehensive risk assessment of road transport of hazardous chemicals, this paper first collected 213 road transport accidents involving hazardous chemicals that occurred between 2015 and 2020 to build a case library. Then, it established a risk assessment system (including 9 primary indicators and 28 secondary indicators) based on the frequencies of reasons for accident cases and explored the quantification methods for indicators based on their definitions. Subsequently, this paper calculated the weights of indicators based on the backpropagation neural network algorithm and the data in the case library and formulated a model for dynamic risk assessment of road transport of hazardous chemicals. The model takes into account the impact of comprehensive indicators such as drivers, vehicles, goods, roads, and the environment. The accuracy of the model calculation results is 93%. Eventually, the study verified the model using simulation data in real scenarios. The validation results show that the model could achieve a dynamic comprehensive assessment of risks in road transport of hazardous chemicals. [ABSTRACT FROM AUTHOR]

Twin delayed deep deterministic (TD3) policy gradient has several limitations when applied in planning a path in environment with a number of dilemmas according to our experiment, due to the complexity of the robot path planning task, the rate of convergence of TD3 algorithm is slow and the rate of collision is high. To address this problem, deep dense dueling twin delayed deep deterministic (D3-TD3) architecture is proposed, a method that preserves important information from cross-layer inputs through dense connections and divides the network into a value function and a dominance function, thus, allowing for faster convergence when solving complex tasks. Finally, a spatial model based on three-dimension (3D) point cloud is built, and simulation experimental results show that in static environment, the algorithm proposed in the paper has 40.6% fewer collisions compared to TD3, 30% fewer collisions compared to TD3-BC, 19.2% fewer collisions compared to Dueling TD3 and 17.4% fewer collisions compared to deep dense TD3. In dynamic and static environment, the algorithm proposed in the paper has 34.4% fewer collisions compared to TD3, 24% fewer collisions compared to TD3-BC, 6% fewer collisions compared to Dueling TD3 and 25% fewer collisions compared to deep dense TD3. [ABSTRACT FROM AUTHOR]

Ontology user portraits describe the semantic structure of users' interests. It is very important to study the similar relationship between user portraits to find the communities with overlapping interests. The hierarchical characteristics of user interest can generate multiple similarity relations, which is conducive to the formation of interest clusters. This paper proposed a method of overlapping community detection combining the hierarchical characteristics of user interest and the module distribution entropy of node. First, a hierarchical user interest model was constructed based on the ontology knowledge base to measure the multi-granularity topic similarity of users. Then, a heterogeneous hypergraph was established by using the multi-granularity topic similarity and the following similarity of users to represent the interest network. Based on the mechanism of module distribution entropy of nodes, the community detection algorithm was applied to identify the interested community. The real performance of the proposed algorithm on multiple networks was verified by experiments. The experimental results show that the proposed algorithm is better than the typical overlapping community detection algorithm in terms of accuracy and recall rate. [ABSTRACT FROM AUTHOR]

With the rapid development of Internet medical information technology, a large amount of medical data appeared on the Internet, however, how to extract effective information from the massive and complex medical data to provide professional medical services and suggestions to users has become a hot spot for this research. The recommendation system can effectively solve the problem of accurate matching of complex medical data resources; however, the cold start, data sparsity and user interest migration of the system in the complex data environment have a large impact on the recommendation effect; therefore, this paper proposes a weighted neural matrix decomposition improved health management recommendation scheme incorporating deep learning techniques. The scheme first uses an implicit feedback method to improve the prediction scores and improve the linear model performance of the matrix decomposition algorithm to form a weighted neural matrix decomposition health management recommendation algorithm. Second, the improved method and deep neural network are fused to improve the performance of the nonlinear model part of the algorithm by using the structural properties of the neural network. Finally, this paper's method is compared with the mainstream six recommendation algorithms on four publicly available real datasets. The experimental results show that the root mean square error (RMSE) of the WENMF algorithm is smaller than that of the comparison algorithm on all four datasets, and the convergence speed is faster. The hit rate (HR) and normalized discounted cumulative gain (NDCG) of the WENMF algorithm are higher than those of the comparison algorithm on all four datasets, and the maximum difference is 0.04. Therefore, the recommendation accuracy and ranking quality of the WENMF algorithm in the recommendation system are verified, and the cold start and data sparsity problems of the recommendation system are effectively alleviated. [ABSTRACT FROM AUTHOR]

With the deepening application of wearable devices in the field of indoor positioning, the mining and application of human behavior patterns based on new technologies such as mobile terminals, channel technologies and intelligent algorithms have gradually become a research hotspot in the field of intelligent positioning. At this stage, outdoor positioning satellite technology has been gradually improved, but it cannot work effectively in indoor environment, and indoor positioning technology has not formed a set of standard and effective scheme at this stage, which leads to a scene of a hundred contentions for indoor positioning technology. This paper proposes an indoor intelligent localization algorithm based on channel state information, which first forms the measurements of antenna subarrays by the fixed antenna subset arrays located in different paths to achieve the phase estimation based on channel state; then determines the AoA of the direct path from the target to the AP using ToF information and eliminates the STO noise of channel state information by unfolding the best linear fit of CSI phase; again the AoA and ToF estimates from multiple measurements are plotted in two-dimensional space, and the direct path possibility estimation is achieved by identifying the estimates through five clusters of Gaussian-averaged clustering algorithm; finally the coordinates of the target to be located are obtained by coupling direct propagation path, estimation clustering and least-squares estimation using three APs as the receiver and the target to be located as the transmitter. The simulation results show that the intelligent localization algorithm proposed in this paper is able to lack the localization accuracy at the decimeter level in the indoor localization environment with three fixed APs, and the average error is better than the localization algorithms of support vector machine, deep learning and limit learning. [ABSTRACT FROM AUTHOR]

In the production process of the communication circulator, defects such as solder joints, missing pieces, and wool may appear due to the current processing technology. The current communication circulator detection relies on manual experience for identification and classification. This method seriously affects production efficiency; and visual fatigue, physical condition, and working environment will affect the accuracy of manual detection; therefore, the production line of communication circulators urgently needs to be online automatic detection system. This paper will design a set of the stable automatic detection system. The main contributions are: (1) In the sample collection stage, by enhancing the limited samples, it proposes the morphological transformation of the limited defects themselves to realize the diversification of the number of samples and the morphology; (2) By reusing a sample, a cascaded Faster-RCNN and You Only Look Once (YOLO) target detection method is proposed, and the Faster-RCNN and YOLO models are trained, respectively; the model training stage uses migration learning and optimization of hyperparameters to obtain higher accuracy high training model; (3) In the inference stage, by cascading the two excellent target detection algorithms, Faster-RCNN and YOLO, this paper proposes a new decision conflict resolution algorithm, and finally obtains a higher comprehensive detection accuracy; (4) In the deployment phase, in view of the increased performance and computing power overhead caused by algorithm cascading, this paper proposes a solution for graphics processing unit shard sharing. Experimental results explain: The communication circulator surface defect detection system based on the deep learning method can effectively locate and identify various defects. The final recognition accuracy rate is about 98.5%, and the recognition speed can reach about 0.45, which is compared with traditional detection methods, which greatly improves the accuracy and speed of recognition. [ABSTRACT FROM AUTHOR]

The CDT subproblem, which minimizes a quadratic function over the intersection of two ellipsoids, is a classical quadratic programming problem. In this paper, we study a method of solving CDT with a positive Lagrangian duality gap. An efficient splitting algorithm is proposed for finding the global optimal solutions. A cutting plane is firstly added to divide the feasible set of CDT into two subsets, and then two new quadratic programming problems with ellipsoidal and linear constraints are generated accordingly. Using the newly developed technique — second-order cone constraints to enhance the efficiencies of the SDP relaxation-based algorithms on the two subproblems, an optimal solution of CDT can be acquired by comparing the objective values of the two subproblems. Numerical experiments show that the new algorithm outperforms the two recent SDP relaxation-based algorithms, the two-parameter eigenvalue-based algorithm and the solver Gurobi 9.5 for certain types of CDT. [ABSTRACT FROM AUTHOR]

In computer vision, automatically identifying and locating text in images or videos is an important task. Traditional text detection methods are not effective in detecting complex scenes in irregular rectangular areas such as text bending, spacing, and special shapes, which are mainly reflected in the fragmentation of text detection areas. In this paper, a text detection method based on edge attention mechanism is proposed to better adapt to complex scenes. The proposed method takes Encoder–Decoder as the core idea. First of all, an edge attention module is designed, including global attention and local attention. The global attention module is used to perceive the features of text regions and nontext regions, while the local attention module is used to learn the information of text boundaries. Then a multi-scale feature fusion process is designed, which can strengthen the edge information and key information of text regions. Finally, the model outputs probability maps and threshold maps, and generates high-precision binary maps of text regions. After experimental verification, the proposed method on the public data set significantly reduces the fragmentation of the detection area, improves the detection accuracy of the text area, and has better robustness for text detection scenes with unconventional rectangular areas. [ABSTRACT FROM AUTHOR]

As a widely used network security defense technology, network intrusion detection has more deep learning methods used to improve the performance of intrusion detection. However, this method requires a large-scale network traffic data set for training, increasing privacy leakage risk. In this paper, a network intrusion detection algorithm based on Gaussian differential privacy federated learning (NIDS-FLGDP) is proposed. NIDS-FLGDP adopts the client–server architecture of federated learning, introduces the differential privacy of the Gaussian mechanism to ensure the security of the calculation process, uses the improved FedAvg algorithm to reduce communication overhead, and uses the improved 1D CNN to participate in collaborative training for the local model. Optimal parameters for Gaussian differential privacy and the optimal number of participating clients were determined from experiments. Model accuracy rates for binary classification and multi-classification training NIDS-FLGDP are 0.97, 0.975, 0.97 and 0.97, 0.985, 0.96, respectively, for KDD CUP99, NSL_KDD, and UNSW_NB15 network intrusion detection datasets. The results show that NIDS-FLGDP improves intrusion detection performance while protecting network traffic privacy compared with the previous methods. Its applicability and effectiveness have been fully verified, which provides a practical reference for the safe processing and analysis of a large number of diversified network traffic data in the future. [ABSTRACT FROM AUTHOR]

This paper proposes a novel algorithm that combines symbolic execution and data flow testing to generate test cases satisfying multiple coverage criteria of critical software applications. The coverage criteria considered are data flow coverage as the primary criterion, software safety requirements, and equivalence partitioning as sub-criteria. black The characteristics of the subjects used for the study include high-precision floating-point computation and iterative programs. The work proposes an algorithm that aids the tester in automated test data generation, satisfying multiple coverage criteria for critical software. The algorithm adapts itself and selects different heuristics based on program characteristics. The algorithm has an intelligent agent as its decision support system to accomplish this adaptability. Intelligent agent uses the knowledge base to select different low-level heuristics based on the current state of the problem instance during each generation of genetic algorithm execution. The knowledge base mimics the expert's decision in choosing the appropriate heuristics. black The algorithm outperforms by accomplishing 100% data flow coverage for all subjects. In contrast, the simple genetic algorithm, random testing and a hyper-heuristic algorithm could accomplish a maximum of 83%, 67% and 76.7%, respectively, for the subject program with high complexity. black The proposed algorithm covers other criteria, namely equivalence partition coverage and software safety requirements, with fewer iterations. black The results reveal that test cases generated by the proposed algorithm are also effective in fault detection, with 87.2% of mutants killed when compared to a maximum of 76.4% of mutants killed for the complex subject with test cases of other methods. [ABSTRACT FROM AUTHOR]

Microwave hyperthermia is a new method of treating cancer, where the therapeutic effect is determined by the heating temperature. Traditional active temperature sensors are interfered by high frequency so that the accuracy of temperature measurement cannot be guaranteed. It is of great significance to study the high-precision fluorescent optical fiber temperature sensor with complete insulation. This paper has realized a compact and practical fluorescent optical fiber temperature sensor after studying the optical path, circuit, data processing algorithm. In order to improve the accuracy of the system, the weighted linear least-squares fitting algorithm is improved in this paper. Through experimental tests, compared with the standard linear least-squares fitting algorithm and the unimproved weighted linear least-squares fitting algorithm, the accuracy of the algorithm is improved by about 98% and 65.5%, respectively. In addition, the response time is reduced by about 36.5%, compared with the unimproved weighted linear least-squares fitting algorithm. This algorithm fully meets the precision requirements of microwave hyperthermia. [ABSTRACT FROM AUTHOR]

In this paper, aiming at the problems of slow estimation speed and low estimation precision of traditional fractional-order system (FOS) parameter estimation method, an improved Archimedes optimization algorithm (IAOA) is proposed to calculate the optimal value. By establishing the parameter estimation model and the cost function, the parameter estimation problem is formulated as an optimization problem. As opposed to the Archimedes optimization algorithm (AOA), the IAOA introduces three improvements: leadership behavior, levy flight behavior and a new adaptive strategy. This paper verifies the performance of the IAOA by selecting 10 classic test functions. IAOA is applied to the parameter estimation problem of fractional-order unified system to verify the accuracy and feasibility of the algorithm. The simulation results prove that the IAOA has better global optimization ability and estimation accuracy than the original algorithm. [ABSTRACT FROM AUTHOR]

Let = { T 1 , T 2 , ... , T k } be a set of k ≥ 2 spanning trees in a graph G. The k spanning trees are called completely independent spanning trees (CISTs for short) if the paths joining every pair of vertices x and y in any two trees have neither vertex nor edge in common except for x and y. Particularly, is called a dual-CIST provided k = 2. For data transmission applications in reliable networks, the existence of a dual-CIST can provide a configuration of fault-tolerant routing called protection routing. This paper investigates the problem of constructing a dual-CIST in the n -dimensional hierarchical folded cubic network H F Q n . The network is a two-level network using folded hypercube F Q n as clusters to reduce the diameter, hardware overhead and improve the fault tolerance ability. We propose a recursive algorithm to construct a dual-CIST of H F Q n in (2 2 n) time for n ≥ 2 , where the time required is the same scale as the number of vertices of H F Q n . Also, the diameter of each constructed CIST is 4 n + 1. [ABSTRACT FROM AUTHOR]

In this paper, we changed the methodology for pixel value differencing. The proposed method work on RGB color images improves the existing PVD technique in terms of embedding capacity and overcomes the issue of falling off boundaries in the traditional PVD technique, and provides security to the secret message from histogram quantization attack. Color images are composed of three different color channels (red, green, and blue), so we cannot apply the traditional pixel value differencing algorithm to them. Due to that, the proposed technique divides the RGB photograph in red, blue, and green channels. Following that the modified pixel value differencing algorithm is employed to all successive pixels of color channels. We get the total embedding capacity by adding the embedding capacities of each color component. After embedding the data, we concatenate the color channels to get the stegoimage. On a series of color images, we tested our pixel value differencing approach and found that the stego-picture's visual excellence and payload capacity were reasonable. The variation in histogram between the stego and cover photographs was minor, making it resistant to histogram quantization attacks, and the suggested approach also solves the issue of falling off the boundary. [ABSTRACT FROM AUTHOR]

In the online facility assignment problem OFA (k , { c i } i = 1 k) , there exist k servers s 1 , ... , s k on a metric space where each s i has an integer capacity c i and a request arrives one-by-one. The task of an online algorithm is to irrevocably match a current request with one of the servers with vacancies before the next request arrives. As special cases for OFA (k , { c i } i = 1 k) , we consider OFA (k , { c i } i = 1 k) on a line , which is denoted by OFAL (k , { c i } i = 1 k) and OFAL eq (k , { c i } i = 1 k) , where the latter is the case of OFAL (k , { c i } i = 1 k) with equidistant servers. In this paper, we perform the competitive analysis for the above problems. As a natural generalization of the greedy algorithm grdy, we introduce a class of algorithms called MPFS (Most Preferred Free Servers) and show that any MPFS algorithm has the capacity-insensitive property, i.e., for any MPFS algorithm alg for OFA (k , { c i } i = 1 k) , if alg is c -competitive when c 1 = ⋯ = c k = 1 , then alg is c -competitive for general { c i } i = 1 k . By applying the capacity-insensitive property of the greedy algorithm grdy, we derive the matching upper and lower bounds 4 k − 5 on the competitive ratio of grdy for OFAL eq (k , { c i } i = 1 k). To investigate the capability of MPFS algorithms, we show that the competitive ratio of any MPFS algorithm alg for OFAL eq (k , { c i } i = 1 k) is at least 2 k − 1. Then, we propose a new MPFS algorithm idas (Interior Division for Adjacent Servers) for OFAL (k , { c i } i = 1 k) and show that the competitive ratio of idas for OFAL eq (k , { c i } i = 1 k) is at most 2 k − 1 , i.e., idas for OFAL eq (k , { c i } i = 1 k) is best possible in all the MPFS algorithms. We also give numerical experiments to investigate the performance of idas and grdy and show that idas performs better than grdy for distribution of request sequences with locality. [ABSTRACT FROM AUTHOR]

Aiming at the limitations of existing algorithms of network intrusion detection in dealing with complex data of imbalance and high dimensionality, this paper proposes an intrusion detection algorithm based on convolutional neural network (CNN) and Light Gradient Boosting Machine (LightGBM). First, the data-type conversion, oversampling technology and image data conversion are included in the data preprocessing to make the data balanced and adapt to the input format. Then, by the convolutional layer, pooling layer and fully connected layer of the CNN model, the main features are abstracted from the converted image data. Finally, data of the main features is used for training and testing the LightGBM model, so as to get the final classification results. This paper uses KDDCUP99 dataset to carry out multi-classification experiments. By comparing the experiments before and after balancing the dataset, and comparing with similar algorithms, it verifies the superiority of the proposed algorithm in the classification performance of intrusion detection, especially for the minority attack classes. [ABSTRACT FROM AUTHOR]

In computerized tool path programming, the operator/user can generate the tool path based on the shape and geometry of the part to be produced by choosing from a set of predefined strategies available in the library of Computer Aided Manufacturing (CAM) software. These tool paths are typically not optimum, specifically for complex geometries. This paper employed Travelling Salesman Problem (TSP) as a foundation to propose a new tool path optimization algorithm for drilling to minimize the tool path length and subsequently reduce the time spent on nonproductive movements. The proposed algorithm was solved using local search approach in the presence of multiple constraints including geometric obstacles and initial location of tool origin. The outcome was a near-optimum tool path for drilling operations with no collision with workpiece features. The computational efficiency of the proposed algorithm was also compared with other methods in available literature using a standard workpiece as a benchmark. The results confirmed that for given examples, the near-optimum collision-free tool paths using the developed model in this paper were almost 50% shorter than the tool path generated by a commercial CAM software. [ABSTRACT FROM AUTHOR]

In recent days, the major concern for diabetic patients is foot ulcers. According to the survey, among 15 people among 100 are suffering from this foot ulcer. The wound or ulcer found which is found in diabetic patients consumes more time to heal, also required more conscious treatment. Foot ulcers may lead to deleterious danger condition and also may be the cause for loss of limb. By understanding this grim condition, this paper proposes Fractional-Order Darwinian Particle Swarm Optimization (FO-DPSO) technique for analyzing foot ulcer 2D color images. This paper deals with standard image processing, i.e. efficient segmentation using FO-DPSO algorithm and extracting textural features using Gray Level Co-occurrence Matrix (GLCM) technique. The whole effort projected results as accuracy of 91.2%, sensitivity of 100% and specificity as 96.7% for Naïve Bayes classifier and accuracy of 91.2%, sensitivity of 100% and sensitivity of 79.6% for Hoeffding tree classifier. [ABSTRACT FROM AUTHOR]

The key to the in-depth management of science and technology is to model the behavior characteristics of scientific and technological personnel and then find groups by analyzing the diverse associations among them. Aiming at the analysis of team relationship among scientific and technological personnel, this paper proposed a method to recognize the group of scientific and technological personnel based on relational graph. The relationship model of scientific and technological personnel was designed, and based on this, the entity and relationship recognition and extraction are performed on the structured and unstructured source data to construct a relational graph. An improved frequent item mining algorithm based on Hadoop was proposed, which enabled getting the group of scientific and technological personnel by mining and analyzing the data in the relational graph. In this paper, the proposed method was experimented on both open and private datasets, and compared with several classical algorithms. The results showed that the method proposed in this paper has a significant improvement in execution efficiency. [ABSTRACT FROM AUTHOR]

Since Correlation Filter appeared in the field of video object tracking, it is very popular due to its excellent performance. The Correlation Filter-based tracking algorithms are very competitive in terms of accuracy and speed as well as robustness. However, there are still some fields for improvement in the Correlation Filter-based tracking algorithms. First, during the training of the classifier, the background information that can be utilized is very limited. Moreover, the introduction of the cosine window further reduces the background information. These reasons reduce the discriminating power of the classifier. This paper introduces more global background information on the basis of the DCF tracker to improve the discriminating ability of the classifier. Then, in some complex scenes, tracking loss is easy to occur. At this point, the tracker will be treated the background information as the object. To solve this problem, this paper introduces a novel re-detection component. Finally, the current Correlation Filter-based tracking algorithms use the linear interpolation model update method, which cannot adapt to the object changes in time. This paper proposes an adaptive model update strategy to improve the robustness of the tracker. The experimental results on multiple datasets can show that the tracking algorithm proposed in this paper is an excellent algorithm. [ABSTRACT FROM AUTHOR]

Many damage identification methods are based on a comparison of structure response between healthy and damaged states. However, the healthy state response of especially old bridges is rarely available. In this paper, a new output-only damage identification approach is proposed to locate damage in multi-span bridges. In this method, only the damaged state strain and displacement influence lines are required. This approach is theoretically explained for a three-span girder. The middle span, the health condition of which is in quest, is modeled as a single-span beam, supported by rotational springs with unknown stiffness. A new algorithm is proposed to estimate the healthy state displacement influence line of the middle point of the span. In this algorithm, the ratio of the flexural stiffness of the girder to the spring's rotational stiffness is determined in such a way that the estimated displacement, is as close to the measured response, as possible. Then, the estimated displacement is scaled based on two constraints. First, it is expected to be lower than the pseudo-static component of measured displacement because damage increases the response globally. Second, the difference between the scaled and pseudo-static component of the measured response is minimized. Eventually, damage is located using a novel damage index based on the local deviation of pseudo-static component of measured displacement from the estimated scaled response. The proposed method is numerically evaluated in a three-span girder. The damage is successfully identified in all different scenarios. Also, its application to Powder Mill Pond Bridge is numerically investigated which yielded promising results. [ABSTRACT FROM AUTHOR]

Recently, there had been a massive group of people, who were being rapidly affected by melanoma. Melanoma is a form of skin cancer that develops on the skin's surface layer. This is primarily caused due to excessive skin exposure to UV radiation and severe sunburns. Thus, the early detection of melanoma can aid us to cure it completely. This paper intends to introduce a new melanoma detection framework with four main phases viz. segmentation, feature extraction, optimal feature selection, as well as detection. Initially, the segmentation process takes place to the input skin image via Fuzzy C-Means Clustering (FCM) approach. From the segmented image ( Im seg ) , some of the features such as Gray Level Run Length Matrix (GLRM), Local Vector Pattern (LVP), Local Binary Pattern (LBP), Local Directional Pattern (LDP) and Local Tetra Pattern (LTrP) are extracted. As the extracted features (F) suffered from the issue of "curse of dimensionality", this paper utilizes optimization to select optimal features, which makes the detection more precise. As a novelty, a new hybrid algorithm Particle-Assisted Moth Search Algorithm (PA-MSA) is introduced that hybridizes the concept of Moth Search Algorithm (MSA) and Particle Swarm Optimization (PSO), respectively. For the classification process, the optimally chosen features (F opt ) are fed as input, where Deep Convolution Neural Network (DCNN) is used. Finally, a performance-based comparative analysis is conducted among the proposed PA-MSA as well as the existing models with respect to various measures. [ABSTRACT FROM AUTHOR]

Numerical procedure plays a key role in tackling the solutions of nonlinear dynamical systems. With the advent of the age of big data and high-power computing, developing efficient and fast numerical algorithms is an urgent task. This paper extends the Lie derivative discretization algorithm to the nonautonomous nonlinear systems and investigates the numerical solutions of the systems. The periodic solutions of three different classical nonlinear systems are calculated, and the results are compared to those values calculated from the Runge–Kutta fourth-order algorithm, which demonstrated that the Lie derivative algorithm has the advantages of large time step and short computation time. [ABSTRACT FROM AUTHOR]

For the parameter estimation problem in research related to the fractional-order chaotic systems (FOCSs), a modified optimization algorithm based on Salp Swarm Algorithm (SSA) was developed in this paper. The proposed algorithm introduced several improvements on SSA: adding a grouping step, introducing "betrayal" behavior, and improving the update method of the followers. We applied multiple classical optimization algorithms to conduct the parameter estimation experiments on the fractional-order Lorenz chaotic system (Lorenz-FOCS) and the fractional-order Financial chaotic system (Financial-FOCS). In addition, we explored the impact of searching space on parameters estimation through experiments. The experimental results confirmed the feasibility of the modified Salp Swarm Algorithm (MSSA). The MSSA performed better than the SSA and other classical optimization algorithms in terms of the estimation accuracy and convergence rate. [ABSTRACT FROM AUTHOR]

In order to improve the decision-making and control effect of autonomous vehicles, in this paper, combined with literature research and process analysis, the control algorithm of autopilot vehicle is analyzed, and the driving process is analyzed combined with the flow method. In order to improve the effect of autonomous driving, with the support of improved algorithms, an integrated decision-making control system for autonomous vehicles under multi-task constraints in intelligent traffic scenarios is constructed, and system performance is improved by simulating autonomous driving decisions in a variety of complex situations. Moreover, this paper designs the road driving model according to actual needs, sets the functional modules of the entire system, and build the overall framework of the system. Finally, in order to study the integrated decision-making effect of this system, this paper conducts test research by designing a simulation test method. From the simulation test results, it can be seen that the intelligent decision-making system for autonomous vehicles constructed in this paper has certain effects. [ABSTRACT FROM AUTHOR]

In order to deal with the problem of encryption algorithms being overly simplistic, and the relatively low security of color images that creates potential to be attacked in the transmission process, this paper will introduce a new encryption algorithm that is designed to divide color images into R, G and B layers. In the scrambling operation: the first scrambling is aimed to block the clear text image scrambling; The second scrambling is the dynamic Arnold scrambling of the ciphertext after the first scrambling. In the diffusion operation, the scrambled ciphertext image was taken as the input, and the pseudo-random sequence generated by Tent mapping and Sine mapping was embedded. The sequence generated by Logistic mapping was used to select sub-blocks for block diffusion of the image. Tent-Sine mapping was applied to the second diffusion to obtain the final ciphertext image. The algorithm designed in this paper combines image block scrambling and dynamic Arnold scrambling, the scrambling degree of each layer of image pixels would be greatly improved, thus improving the security of color images. In the process of diffusion, chaos sequence is selected for diffusion operation, which increases the difficulty of decoding ciphertext. The simulation results show that the new algorithm has desirable encryption effect, strong key sensitivity and large key space, and complex encryption algorithm can effectively resist attacks, which certainly has value in image information security. [ABSTRACT FROM AUTHOR]

Using wearable devices to realize the mining and application of human behavior patterns has become a hotspot in the field of intelligent positioning. Wearable devices provide an analyzable data foundation for indoor spatial distribution and human behavior pattern prediction. The development of the intelligent positioning system based on RSSI has encountered a bottleneck that it is difficult to improve the positioning accuracy. Therefore, some research works started emphasizing location technology based on channel state information (CSI). In this paper, the principle used by Wi-Fi channel state information to realize intelligent positioning is described, the characteristics of CSI are analyzed, and an intelligent positioning algorithm based on CSI is proposed. Specifically, the algorithm first estimates the angle of arrival (AoA) based on the MUSIC algorithm, separates the reflected paths in the multipath components, and accurately estimates the AoA of each path. Second, phase estimation with channel state information is achieved by forming different antenna subarray measurements under the consideration of a subset of antennas and subcarriers. Then, the phase response linear fitting of the data packet CSI is eliminated using the ToF purification algorithm to obtain the corrected phase response and realize the elimination of the STO noise of the channel state information. Finally, the target position is calculated by effectively filtering the reflection path through the likelihood value, and the accurate target positioning function is achieved. The experimental results demonstrate that the intelligent positioning algorithm proposed in this paper can achieve decimeter-level positioning accuracy under the condition of a fixed number of APs, and the average error is better than that of deep learning-based and SVM-based positioning algorithms. In other words, the accuracy of intelligent positioning is improved. [ABSTRACT FROM AUTHOR]

The price of the product has a great impact on the market competitiveness of the product. The manager can adjust the operation strategy according to the cost information of the product, cut costs, adjust the market decision and make the product more competitive in the market. Therefore, the research of product costing method has a very important significance. Considering that the physical resources in the processing of the virtual network mapping (VNM) fragment embedded in the request are rejected, and the problem of physical resource usage is weakened, a VNM algorithm based on the optimal subnet edge matching algorithm is proposed. After the VNM request is coarsened to the subnet, the breadth-first search algorithm is used to create the physical subnet candidate set, and the constraints of the virtual node and the coarsening network topology are complied with. The simulation results show that the proposed algorithm reduces the number of link mapping hops and can improve the acceptance rate and cost-benefit ratio of virtual networks. First of all, this paper analyzes the research background of manufacturing cost calculation and the research situation at home and abroad, discusses the advantages and disadvantages of standard cost calculation and studies and analyzes the principles, advantages and disadvantages of standard cost calculation in daily business activities. Second, design a new mathematical accounting model based on the mathematical model of standard cost calculation in daily business activities. This combines the advantages of standard costing and time-based activity costing, and provides theoretical support for manufacturing companies to use this accounting method. Finally, the research results of this paper are summarized, and the shortcomings of this paper are analyzed. Cost accounting method needs to be further studied. [ABSTRACT FROM AUTHOR]

Based on the distributed decision tree algorithm, this paper first proposes a method of vertically partitioning datasets and synchronously updating the hash table to establish an information-based mass data retrieval method in a heterogeneous distributed environment, as well as using interval segmentation and interval filtering technologies for improved algorithm of distributed decision tree. The distributed decision tree algorithm uses the attribute histogram data structure to merge the category list into each attribute list, reducing the amount of data that needs to reside in the memory. Second, we adopt the strategy of vertically dividing the dataset and synchronously updating the hash table, select the hash table entries that can be used to update according to the minimum Gini value, modify the corresponding entries and use the hash table to record and control each sub-site. In the case of node splitting, it has a high accuracy rate. In addition, for classification problems that meet monotonic constraints in a distributed environment, this paper will extend the idea of building a monotonic decision tree in a distributed environment, supplementing the distributed decision tree algorithm, adding a modification rule and modifying the generated nonmonotonic decision tree to monotonicity. In order to solve the high load problem of the privacy-protected data stream classification mining algorithm under a single node, a Storm platform for the parallel algorithm PPFDT_P based on the distributed decision tree algorithm is designed and implemented. At the same time, considering that the word vector model improves the deep representation of features and solves the problem of feature high-dimensional sparseness, and the iterative decision tree algorithm GBDT model is more suitable for non-high-dimensional dense features, the iterative decision tree algorithm will be integrated into the word vector model (GBDT) in the data retrieval application, using the distributed representation of words, namely word vectors, to classify short messages on the GBDT model. Experimental results show that the distributed decision tree algorithm has high efficiency, good speed-up and good scalability, so that there is no need to increase the number of datasets at each sub-site at any time. Only a small number of data items are inserted. By splitting some leaf nodes, a small amount is added by branching to achieve a monotonic decision tree. The proposed system achieves a massive data ratio of 54.1% while compared with other networks of massive data ratio. [ABSTRACT FROM AUTHOR]

The sine cosine algorithm (SCA) and multi-verse optimizer (MVO) are the recognized optimization strategies frequently employed in numerous scientific areas. However, both SCA and MVO grapple with optimizing the transition between the exploitation and exploration mechanisms. Furthermore, MVO exhibits constraints in its exploitation capabilities. To tackle these limitations, this paper introduces a hybrid model termed SMVO, combining the advantages of both SCA and MVO. This hybrid approach seeks to harmonize exploitation and exploration stages by leveraging the unique advantages of each parent algorithm. The efficacy of SMVO was assessed using 23 benchmark test functions, revealing its competitive performance against not only SCA and MVO but also the ant lion optimization (ALO) and the dragonfly algorithm (DA). Additionally, SMVO's applicability was further validated by successfully addressing three distinct engineering optimization challenges, underscoring its stability and promise as a global optimization tool. [ABSTRACT FROM AUTHOR]

This paper is concerned with the ℓ 1 , ∞ -norm ball constrained multi-task learning problem, which has received extensive attention in many research areas such as machine learning, cognitive neuroscience, and signal processing. To address the challenges of solving large-scale multi-task Lasso problems, this paper develops an inexact semismooth Newton-based augmented Lagrangian (Ssnal) algorithm. When solving the inner problems in the Ssnal algorithm, the semismooth Newton (Ssn) algorithm with superlinear or even quadratic convergence is applied. Theoretically, this paper presents the global and asymptotically superlinear local convergence of the Ssnal algorithm under standard conditions. Computationally, we derive an efficient procedure to construct the generalized Jacobian of the projector onto ℓ 1 , ∞ -norm ball, which is an important component of the Ssnal algorithm, making the computational cost in the Ssn algorithm very cheap. Comprehensive numerical experiments on the multi-task Lasso problems demonstrate that the Ssnal algorithm is more efficient and robust than several existing state-of-the-art first-order algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel nonconvex and nonsmooth optimization model for low-light or inhomogeneous image segmentation which is a hybrid of Mumford–Shah energy functional and Retinex theory. The given image is decomposed into the reflectance component and the illumination component by solving Retinex-based Mumford–Shah model with L 1 − L 2 regularizer. Indeed, the existence of the L 1 − L 2 regularizer means the nonsmooth term in the model is nonconvex. Thus, it is difficult to solve the proposed model directly. An alternating direction method of multipliers (ADMM) algorithm is developed to solve the proposed nonconvex and nonsmooth model. We apply a novel splitting technique in our algorithm to ensure that all subproblems admit closed-form solutions. Theoretically, we prove that the sequence generated by our proposed algorithm converges to a stationary point under mild conditions. Next, once the reflectance is obtained, the K -means clustering method is utilized to complete the segmentation. We compare the proposed Retinex-based method with other state-of-the-art segmentation methods under special lighting conditions. Experimental results show that the proposed method has better performance for both gray-scale images and color images efficiently in terms of the quantitative and qualitative results. [ABSTRACT FROM AUTHOR]

Noise radar waveform, as an important waveform in the field of low-probability-of-intercept radars, has been widely studied. However, the general noise waveform has a high peak average power ratio (PAPR), which leads to a reduction of signal-to-noise ratio. Thus, it is necessary to control the noise waveform PAPR to a suitable range. In this paper, the PAPR value reduction problem of low sidelobe noise waveform is studied. First, the proposed new algorithm is given a general overview. Then, the Combined Spectral Shaping and Peak-to-Average Power Ratio Reduction (COSPAR) algorithm is adjusted according to the alternate projection method and phase retrieval algorithm, and an improved COSPAR (ICOSPAR) algorithm with a faster execution speed and higher waveform generation efficiency is derived. The specific method performs waveform projection between the spectral constraint domain and the PAPR constraint domain and then evaluates the computational load of the ICOSPAR algorithm. Simulation results show that the ICOSPAR algorithm is reliable and efficient in generating low PAPRs and low sidelobe noise waveforms. [ABSTRACT FROM AUTHOR]

A charge and discharge management scheme is proposed. The stored electric energy in distributed storage devices will converge to the consistent. The consistency of the stored electric energy of the devices helps to maintain the maximum load capacity and maximum consumption capacity of distributed storage devices. The charging and discharging process is constructed as a time-varying optimization problem, and the proposed algorithm can respond to the time-varying parameters of the distributed storage devices in real time. The time-varying neurodynamic algorithms can obtain time-varying optimal solution trajectories to give the optimal charging and discharging strategy in real time. In addition, the proposed approach in this paper focuses on the privacy protection of device data. Each device can calculate the power of discharging or charging by communicating with the partially connected nodes. Numerical simulations of the proposed scheme in the paper are given to verify the effectiveness of the scheme. Numerical simulations show that our scheme can make the electric energy stored in each storage device converge and maintain the maximum load capacity or maximum consumption capacity of the whole distributed storage device. [ABSTRACT FROM AUTHOR]

The rapid growth of contents on the Web in different languages increases the demand of Cross-Lingual Information Retrieval (CLIR). The accuracy of result suffers due to many problems such as ambiguity and drift issue in query. Query Expansion (QE) offers reliable solution for obtaining suitable documents for user queries. In this paper, we proposed an architecture for Hindi–English CLIR system using QE for improving the relevancy of retrieved results. In this architecture, for the addition of term(s) at appropriate position(s), we proposed a location-based algorithm to resolve the drift query issue in QE. User queries in Hindi language have been translated into document language (i.e. English) and the accuracy of translation is improved using Back-Translation. Google search has been performed and the retrieved documents are ranked using Okapi BM25 to arrange the documents in the order of decreasing relevancy to select the most suitable terms for QE. We used term selection value (TSV) for QE and for retrieving the terms, we created three test collections namely the (i) description and narration of the Forum for Information Retrieval Evaluation (FIRE) dataset, (ii) Snippets of retrieved documents against each query and (iii) Nearest-Neighborhood (NN) words against each query word among the ranked documents. To evaluate the system, 50 queries of Hindi language are selected from the FIRE-2012 dataset. In this paper, we performed two experiments: (i) impact of the proposed location-based algorithm on the proposed architecture of CLIR; and (ii) analysis of QE using three datasets, i.e. FIRE, NN and Snippets. In the first case, result shows that the relevancy of Hindi–English CLIR is improved by performing QE using the location-based algorithm and a 12% of improvement is achieved as compared to the results of QE obtained without applying the location-based algorithm. In the second case, the location-based algorithm is applied on three datasets. The Mean Average Precision (MAP) values of retrieved documents after QE are 0.5379 (NN), 0.6018 (FIRE) and 0.6406 (Snippets) for the three test collections, whereas the MAP before QE is 0.37102. This clearly shows the significant improvement of retrieved results for all three test collections. Among the three test collections, QE has been found most effective along with Snippets as indicated by the results with the improvements of 6.48% and 19.12% over FIRE and NN test collections, respectively. [ABSTRACT FROM AUTHOR]

In this paper, we study mean–variance–Conditional Value-at-Risk (CVaR) portfolio optimization problem with short selling, cardinality constraint and transaction costs. To tackle its mixed-integer quadratic optimization model for large number of scenarios, we take advantage of the penalty decomposition method (PDM). It needs solving a quadratic optimization problem and a mixed-integer linear program at each iteration, where the later one has explicit optimal solution. The convergence of PDM to a partial minimum of original problem is proved. Finally, numerical experiments using the S&P index for 2020 are conducted to evaluate efficiency of the proposed algorithm in terms of return, variance and CVaR gaps and CPU times. [ABSTRACT FROM AUTHOR]