Search

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]

The sparse triangular solver (SpTRSV) is mostly used for scientific and engineering applications. The structured-grid triangular solver of regular dependencies (STRSV) is a special kind of SpTRSV. Some general SpTRSVs that disregards the regularity of the matrix are unsuitable for solving this problem. This paper proposes an efficient parallel algorithm for STRSV on the SW26010 (a kind of China independently designed many-core processors), namely swStructTRSV. The algorithm makes full use of the fine-grained and low latency communication characteristics of the SW26010 to reduce the waiting time for synchronization, maximizes the regularity of access to improve memory access bandwidth, and achieves overlap between memory access and computation simultaneously. Moreover, the idea of the algorithm can be extended to incomplete LU factorization (ILU factorization) because of consistent dependencies. The experimental results on a core group(8 * 8 network composed of 64 cores) of SW26010 show that swStructTRSV can achieve an average speedup of over 30 in the sequential version. swStructTRSV on SW26010 achieves solving speedups of 2.2 and 6.3 over the fast STRSV (fSpTRSV) previously implemented on SW26010 and MKL on Intel Xeon Gold 6132, respectively. swStructTRSV significantly outperforms cuSparse on NVIDIA TITAN RTX in terms of overall execution time. [ABSTRACT FROM AUTHOR]

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

This paper studies the reliable uncapacitated facility location problem in which facilities are subject to uncertain disruptions. A two-stage distributionally robust model is formulated, which optimizes the facility location decisions so as to minimize the fixed facility location cost and the expected transportation cost of serving customers under the worst-case disruption distribution. The model is formulated in a general form, where the uncertain joint distribution of disruptions is partially characterized and is allowed to have any prespecified dependency structure. This model extends several related models in the literature, including the stochastic one with explicitly given disruption distribution and the robust one with moment information on disruptions. An efficient cutting plane algorithm is proposed to solve this model, where the separation problem is solved respectively by a polynomial-time algorithm in the stochastic case and by a column generation approach in the robust case. Extensive numerical study shows that the proposed cutting plane algorithm not only outperforms the best-known algorithm in the literature for the stochastic problem under independent disruptions but also efficiently solves the robust problem under correlated disruptions. The practical performance of the robust models is verified in a simulation based on historical typhoon data in China. The numerical results further indicate that the robust model with even a small amount of information on disruption correlation can mitigate the conservativeness and improve the location decision significantly. Summary of Contribution: In this paper, we study the reliable uncapacitated facility location problem under uncertain facility disruptions. The problem is formulated as a two-stage distributionally robust model, which generalizes several related models in the literature, including the stochastic one with explicitly given disruption distribution and the robust one with moment information on disruptions. To solve this generalized model, we propose a cutting plane algorithm, where the separation problem is solved respectively by a polynomial-time algorithm in the stochastic case and by a column generation approach in the robust case. The efficiency and effectiveness of the proposed algorithm are validated through extensive numerical experiments. We also conduct a data-driven simulation based on historical typhoon data in China to verify the practical performance of the proposed robust model. The numerical results further reveal insights into the value of information on disruption correlation in improving the robust location decisions. [ABSTRACT FROM AUTHOR]

In order to solve the problem of low accuracy, high cost, and difficult detection of traditional algorithms, a new algorithm based on ultrasound imaging is proposed in this paper. The algorithm is based on fuzzy clustering to diagnose the disease and effectively improve the accuracy of the algorithm. By testing the actual scene, it effectively proves the effectiveness and accuracy of the algorithm, which can find and treat diseases in time and can be widely used and popularized in clinical research in China. [ABSTRACT FROM AUTHOR]

The paper considers the design of a multimodal and multilayer inbound logistics network for iron ore to be delivered from suppliers to steel plants. To make cost-efficient logistics and transportation planning decisions, steel companies should account for uncertainty in the demand for iron ore and the economies of scale during transshipment process in the port, which are two critical elements affecting decisions. To this end, we propose a two-stage nonlinear stochastic programming model with the first stage determining the choice of the port to perform transshipment operations and the needed capacity, and the second stage selecting transportation modes after demand uncertainty has been realized. To solve this problem, we first reformulate and linearize the model based on a quantity discount policy applied to the transshipment ports, and then, we develop a scenario-based decomposition algorithm. We conduct a case study based on the data of a steel company in China to illustrate the applicability of our proposed model. Moreover, we perform numerical experiments to demonstrate the effectiveness of our algorithm. [ABSTRACT FROM AUTHOR]

Medium-term optimal scheduling of hydropower plants (MOSHPP) should be frequently updated for recurring extreme precipitation events in China to reduce spillage and increase power generation; however, the curse of dimensionality makes obtaining a satisfactory solution in an acceptable time difficult. In this paper, a parallel improved dynamic programming with successive approximation (PIDPSA) for MOSHPPs is proposed to improve the solution quality and meet time requirements. The solution quality is improved by successive approximation of multiple plants instead of one plant for considering more hydraulic connections, a state space reduction strategy combined with constraint preprocessing is adopted to reduce unnecessary calculations and the fine-grained parallelism based on the fork/join framework is employed to greatly shorten the solution time. The proposed method was applied to 11 hydropower cascade plants in the Lancang River with a time horizon of 30 days. The results showed that higher quality solutions can be obtained by IDPSA than conventional methods and DPSA, and the space reduction strategy can effectively improve the solution efficiency. The computation time of PIDPSA decreased from 81345 s for the single-core environment to 6073 s for the 32-core environment, which proves the high efficiency and practical value of PIDPSA for solving MOSHPP problems. [ABSTRACT FROM AUTHOR]

Art education is an important part of quality education in China. It undertakes the important responsibility of cultivating students' aesthetic ability, art appreciation ability, art perception ability, and expression ability. In junior middle school art teaching, the skill of pattern creation is an ability that needs to be focused on cultivating students. The computer multimedia art patterns are currently created mainly relying on manual drawing. A computer multimedia art pattern production model is proposed based on the P-filling algorithm in this paper. After using the P-filling algorithm to quickly generate a large number of fake images and retrieve the code of the most recent damaged image, the code estimates the missing content by generating a model. On this basis, the semantic P-filling algorithm and the perceptual P-filling algorithm are combined, and the unsaturated region is enlarged by improving the activation function sigmoid function, which solves the problem that the gradient is easy to disappear. Experimental results show that, through this production model, users can produce a large number of computer multimedia art patterns with hand-drawn style features through very little interaction and parameter control. [ABSTRACT FROM AUTHOR]

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

The thyristor is the key device for the converter of the ultra-high-voltage DC (UHVDC) project to realize AC–DC conversion. The reliability of thyristors is directly related to the safe operation of the UHVDC transmission system. Due to the complex operating environment of the thyristor, there are many interrelated parameters that may affect the aging state of thyristors. To extract useful information from the massive high-dimensional data and further obtain the aging state of thyristors, a supervised tensor domain classification (STDC) method based on the adaptive syn-thetic sampling method, the gradient-boosting decision tree, and tensor domain theory is proposed in this paper. Firstly, the algorithm applies the continuous medium theory to analogize the aging state points of the thyristor to the mass points in the continuous medium. Then, the algorithm applies the concept of the tensor domain to identify the aging state of the thyristor and to transform the original state-identification problem into the state classification surface determination of the tensor domain. Secondly, a temporal fuzzy clustering algorithm is applied to realize automatic positioning of the classification surface of each tensor sub-domain. Furthermore, to solve the problem of unbalanced sample size between aging class data and normal class data in the state-identification domain, the improved adaptive synthetic sampling algorithm is applied to preprocess the data. The gradient-boosting decision tree algorithm is applied to solve the multi-classification problem of the thyristor. Finally, the comparison between the algorithm proposed and the conventional algorithm is performed through the field-test data provided by the CSG EHV Power Transmission Company of China's Southern Power Grid. It is verified that the evaluation method proposed has higher recognition accuracy and can effectively classify the thyristor states. [ABSTRACT FROM AUTHOR]

Collaborative multicenter pickup and delivery problems with time window assignment (CMPDPTWA) are introduced in this paper and formulated and solved as a two-stage optimization problem. First, the collaborative mechanism achieves optimal transportation resource configuration in a multicenter logistics network. Second, open-closed mixed pickup and delivery routes satisfying the demands and time windows of customers are proposed to enhance transportation efficiency and reduce the total logistics operating cost. A set of candidate-time windows is assigned to the corresponding customers through time window assignment (TWA) strategy to increase the operational efficiency of logistics network. A bi-objective programming model for CMPDPTWA is formulated to minimize the number of vehicles and total operating cost. An improved k -means clustering algorithm is used to cluster customers according to their proximities to pickup and delivery centers for reducing the computational complexity to solve the abovementioned problem. A self-learning non-dominated sorting genetic algorithm-II (SNSGA-II) is proposed to optimize the open-closed mixed pickup and delivery routes in CMPDPTWA. An update mechanism for the probabilities of crossover and mutation is devised to improve the efficiency of searching the solution space, and thus to accelerate the convergence of SNSGA-II. The performance of the proposed algorithm is compared with that of other algorithms, and the results indicate that it can generate near-optimal solutions for CMPDPTWA. A game theoretical method involving a cost gap allocation model and the strictly monotonic path strategy is proposed to find the best profit allocation scheme and the optimal coalition sequence for stabilizing the collaborative coalition. Finally, the proposed method is applied to a case study using the real-world logistics network in Chongqing City, China. Six scenarios with and without the collaborative mechanism and TWA strategy are simulated and compared with one another to verify the efficacy of the proposed method. The results show that the collaborative mechanism and TWA strategy can improve the utilization of transportation resources and operational efficiency. Thus, they can facilitate an efficient and sustainable urban logistics network. • Collaborative multicenter pickup and delivery problems with TWA is studied. • A bi-objective optimization model is developed based on collaborative networks. • A hybrid method with k -means clustering and SNSGA-II is devised to solve the model. • Profit allocation and coalition stability are tested under different game methods. • A case study is conducted to show the applicability of proposed approach. [ABSTRACT FROM AUTHOR]

The workforce scheduling problem in call centres is defined as assigning a number of employees to various overlapping shifts during a specified planning horizon, considering some regulations and preferences, so as to minimize the labour cost. This is often difficult to solve to optimality due to its combinatorial structure. In this paper, we propose an enhanced artificial bee colony (EABC) algorithm to solve the problem. After introducing a good-quality solution generated by a heuristic algorithm to the initial population, the solutions are further exploited by four elaborate neighbourhood structures, which are designed based on the decomposed structure of the problem and deeply embedded in the solution evolution mode. Furthermore, a modified abandoning mode is employed in the onlooker stage. Using real instances from Chengxi Call Centre in Suqian, China, the experimental results show that the proposed algorithm can achieve (sub-)optimal solutions for large-scale problems. Furthermore, a comparative evaluation of EABC is carried out against a hybrid artificial bee colony (HABC) and simulated annealing (SA). The results show that EABC outperforms the other two algorithms for all problem instances. In addition, we analyse the influence of the weekend-off fairness on the labour cost. • The study firstly deals with scheduling call centres with weekend-off fairness. • We decompose the problem structure and explore relationships between hierarchies. • An enhanced artificial bee colony algorithm is tailored for solving the problem. • The proposed algorithm can obtain the (sub-)optimal solutions of the problem. [ABSTRACT FROM AUTHOR]

The development of distribution linguistic provides a new research idea for linguistic information group decision-making (GDM) problems, which is more flexible and convenient for experts to express their opinions. However, in the process of using distribution linguistic fuzzy preference relations (DLFPRs) to solve linguistic information GDM problems, there are few studies that pay attention to both internal consistency adjustment and external consensus of experts. Therefore, this study proposes a fresh decision support model based on consistency adjustment algorithm and consensus adjustment algorithm to solve GDM problems with distribution linguistic data. Firstly, we review the concept of DLFPRs to describe the fuzzy linguistic evaluation information, and then we present the multiplicative consistency of DLFPRs and a new consistency measurement method based on the distance, and investigate the consistency adjustment algorithm to ameliorate the consistency level of DLFPRs. Subsequently, the consensus degree measurement is carried out, and a new consensus degree calculation method is put forward. At the same time, the consensus degree adjustment is taken the expert cost into account to make it reach the predetermined level. Finally, a distribution linguistic fuzzy group decision making (DLFGDM) method is designed to integrate the evaluation linguistic elements and obtain the final evaluation information. A case of the evaluation of China's state-owned enterprise equity incentive model is provided, and the validity and superiority of the proposed method are performed by comparative analysis. [ABSTRACT FROM AUTHOR]