Imed Kacem, Ahmed Kadri, Pierre Laroche

Intelligent Automation & Soft Computing, Vol.24, No.2, pp. 421-430, 2018, DOI:10.31209/2018.100000016

Abstract This paper addresses an inventory regulation problem in bicycle sharingsystems. The problem is to balance a network consisting of a set of stations by using a single vehicle, with the aim of minimizing the weighted sum of the waiting times during which some stations remain imbalanced. Motivated by the complexity of this problem, we propose a two-stage procedure based on decomposition. First, the network is divided into multiple zones by using two different clustering strategies. Then, the balancing problem is solved in each zone. Finally, the order in which the zones must be visited is defined. To solve these problems,… More >

Jinhui Ge¹, Xiaoliang Liu^{2, *}, Guo Liang³

CMC-Computers, Materials & Continua, Vol.64, No.3, pp. 1945-1958, 2020, DOI:10.32604/cmc.2020.010977

Abstract With the expansion of the application scope of social computing problems, many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various social attributes, cultures, and the emotional needs of customers. The actual soft time window vehicle routing problem, speeding up the response of customer needs, improving distribution efficiency, and reducing operating costs is the focus of current social computing problems. Therefore, designing fast and effective algorithms to solve this problem has certain theoretical and practical significance. In this paper, considering the time delay problem of customer demand, the… More >

Shuqiang Guo^{1, *}, Baohai Yue¹, Manyang Gao², Xinxin Zhou¹, Bo Wang³

CMC-Computers, Materials & Continua, Vol.64, No.1, pp. 233-251, 2020, DOI:10.32604/cmc.2020.010039

Abstract The recycling of glass bottles can reduce the consumption of resources and contribute to environmental protection. At present, the classification of recycled glass bottles is difficult due to the many differences in specifications and models. This paper proposes a classification algorithm for glass bottles that is divided into two stages, namely the extraction of candidate regions and the classification of classifiers. In the candidate region extraction stage, aiming at the problem of the large time overhead caused by the use of the SIFT (scale-invariant feature transform) descriptor in SS (selective search), an improved feature of HLSN (Haar-like based on SPP-Net)… More >

Yuhang Long¹, Wensheng Tang^{1, *}, Bo Yang^{1, *}, Xinyu Wang², Hua Ma¹, Hang Shi¹, Xueyu Cheng³

CMC-Computers, Materials & Continua, Vol.63, No.3, pp. 1445-1469, 2020, DOI:10.32604/cmc.2020.09944

Abstract Currently, the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding k. In the existing algorithms, although a level-wise-search could fully mine the target patterns, it usually leads to the delay of high rank patterns generation, resulting in the slow growth of the support threshold and the mining efficiency. Aiming at this problem, a greedy-strategy-based top-rank-k frequent patterns hybrid mining algorithm (GTK) is proposed in this paper. In this algorithm, top-rank-k patterns are stored in a static doubly linked list called RSL, and the patterns are divided into short patterns and long patterns. The short… More >

A. Rama Mohan Rao¹, S. Krishna Kumar¹, K. Lakshmi¹

Structural Durability & Health Monitoring, Vol.8, No.3, pp. 271-294, 2012, DOI:10.32604/sdhm.2012.008.271

Abstract Current advancements in structural health monitoring, sensor and sensor network technologies have encouraged using large number of sensor networks in monitoring spatially large civil structures like bridges. Large amount of spatial information obtained from these sensor networks will enhance the reliability in truly assessing the state of the health of the structure. However, if sensors go faulty during operation, the feature extraction techniques embedded into SHM scheme may lead to an erroneous conclusion and often end up with false alarms. Hence it is highly desirable to robustly detect the faulty sensors, isolate and correct the data, if the data at… More >

Xuwei Tang¹, Juan Xu^1,2,3,*, Bojia Duan¹

CMC-Computers, Materials & Continua, Vol.57, No.2, pp. 307-319, 2018, DOI:10.32604/cmc.2018.03693

Abstract Grover's search algorithm is one of the most significant quantum algorithms, which can obtain quadratic speedup of the extensive search problems. Since Grover's search algorithm cannot be implemented on a real quantum computer at present, its quantum simulation is regarded as an effective method to study the search performance. When simulating the Grover's algorithm, the storage space required is exponential, which makes it difficult to simulate the high-qubit Grover's algorithm. To this end, we deeply study the storage problem of probability amplitude, which is the core of the Grover simulation algorithm. We propose a novel memory-efficient method via amplitudes compression,… More >

Haolong Chen^1,2, Bo Yu¹, Huanlin Zhou^1*, Zeng Meng¹

CMC-Computers, Materials & Continua, Vol.53, No.4, pp. 271-290, 2017, DOI:10.3970/cmc.2017.053.271

Abstract The cuckoo search algorithm (CS) is improved by using the conjugate gradient method(CGM), and the CS-CGM is proposed. The unknown inner boundary shapes are generated randomly and evolved by Lévy flights and elimination mechanism in the CS and CS-CGM. The CS, CGM and CS-CGM are examined for the prediction of a pipe’s inner surface. The direct problem is two-dimensional transient heat conduction in functionally graded materials (FGMs). Firstly, the radial integration boundary element method (RIBEM) is applied to solve the direct problem. Then the three methods are compared to identify the pipe’s inner surfacewith the information of measured temperatures. Finally,… More >