Extraction and analysis of multiple time window features associated with muscle fatigue conditions using sEMG signals

In this work, an attempt has been made to differentiate surface electromyography (sEMG) signals under muscle fatigue and non-fatigue conditions with multiple time window (MTW) features. sEMG signals are recorded from biceps brachii muscles of 50 volunteers. Eleven MTW features are extracted from the acquired signals using four window functions, namely rectangular windows, Hamming windows, trapezoidal windows, and Slepian windows. Prominent features are selected using genetic algorithm and information gain based ranking. Four different classification algorithms, namely naïve Bayes, support vector machines, k-nearest neighbour, and linear discriminant analysis, are used for the study. Classifier performances with the MTW features are compared with the currently used time- and frequency-domain features. The results show a reduction in mean and median frequencies of the signals under fatigue. Mean and variance of the features differ by an order of magnitude between the two cases considered. The number of features is reduced by 45% with the genetic algorithm and 36% with information gain based ranking. The k-nearest neighbour algorithm is found to be the most accurate in classifying the features, with a maximum accuracy of 93% with the features selected using information gain ranking.     

Bin packing and related problems: General arc-flow formulation with graph compression

We present an exact method, based on an arc-flow formulation with side constraints, for solving bin packing and cutting stock problems—including multi-constraint variants—by simply representing all the patterns in a very compact graph. Our method includes a graph compression algorithm that usually reduces the size of the underlying graph substantially without weakening the model.Our formulation is equivalent to Gilmore and Gomory׳s, thus providing a very strong linear relaxation. However, instead of using column-generation in an iterative process, the method constructs a graph, where paths from the source to the target node represent every valid packing pattern.The same method, without any problem-specific parameterization, was used to solve a large variety of instances from several different cutting and packing problems. In this paper, we deal with vector packing, bin packing, cutting stock, cardinality constrained bin packing, cutting stock with cutting knife limitation, bin packing with conflicts, and other problems. We report computational results obtained with many benchmark test datasets, some of them showing a large advantage of this formulation with respect to the traditional ones.     

A population-based iterated greedy algorithm for the delimitation and zoning of rural settlements

In this paper we present a Population-Based Iterated Greedy (PBIG) algorithm for delimiting and zoning rural settlements. Each cadastral plots is allocated to a category (traditional–historical, common or none) considering restrictions such as the characteristics of the existing edifications and the building density. Since the problem has multiple solutions, heuristic search algorithms, as PBIG, are a good strategy to solve it. Besides the resolution of the problem according to the requirements of the laws, our work explores also new methods of delimitation. The comparison between both types of solutions can help to improve the current methodology. The algorithm, implemented using the Java programming language and integrated into an open-source GIS software, has been tested in rural settlements with different morphological characteristics, providing adjustable solutions to the specific needs of each rural settlement.     

An improved scatter search algorithm for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times

In this paper, a scatter search algorithm with improved component modules is proposed to solve the single machine total weighted tardiness problem with sequence-dependent setup times. For diversification generation module, both random strategy based heuristics and construction heuristic are adopted to generate the diversified population. For improvement module, variable neighborhood search based local searches are embedded into the algorithm to improve the trial solutions and the combined solutions. For reference set update module, the number of edges by which the two solutions differ from each other is counted to measure the diversification value between two solutions. We also propose a new strategy in which the length of the reference set could be adjusted adaptively to balance the computing time and solving ability. In addition, a discrete differential evolution operator is proposed with another two operators constitute the combination module to generate the new trial solutions with the solutions in the subsets. The proposed algorithm is tested on the 120 benchmark instances from the literature. Computational results indicate that the average relative percentage deviations of the improved algorithm from the ACO_AP, DPSO, DDE and GVNS are −5.16%, −3.33%, −1.81% and −0.08%, respectively. Comparing with the state-of-the-art and exact algorithms, the proposed algorithm can obtain 78 optimal solutions out of 120 instances within a reasonable computational time.     

The national and international impacts of coal-to-gas switching in the Chinese power sector

We evaluate the national and international impacts—on energy consumption and production, trade, and economic activity—of Chinese coal-to-gas switching in the electric power sector. We find that assumptions about growth rates in electricity generation from renewables are the key determinant in evaluating the economic consequences for coal-to-gas switching in China. The ability to supplement natural gas generation with renewables leads to smaller reductions in Chinese and global economic activity than the alternatives.     

Efficient implementation of chaotic image encryption in transform domains

The primary goal of this paper is security management in data image transmission and storage. Because of the increased use of images in industrial operations, it is necessary to protect the secret data of the image against unauthorized access. In this paper, we introduce a novel approach for image encryption based on employing a cyclic shift and the 2-D chaotic Baker map in different transform domains. The Integer Wavelet Transform (IWT), the Discrete Wavelet Transform (DWT), and the Discrete Cosine Transform (DCT) are exploited in the proposed encryption approach. The characteristics of the transform domains are studied and used to carry out the chaotic encryption. A comparison study between the transform-domain encryption approaches in the presence of attacks shows the superiority of encryption in the DWT domain.     

Outlier based literature exploration for cross-domain linking of Alzheimer’s disease and gut microbiota

In knowledge discovery, experts frequently need to combine knowledge from different domains to get new insights and derive new conclusions. Intelligent systems should support the experts in the search for relationships between concepts from different domains, where huge amounts of possible combinations require the systems to be efficient but also sufficiently general, open and interactive to enable the experts to creatively guide the discovery process. The paper proposes a cross-domain literature mining methodology that achieves this functionality by combining the functionality of two complementary text mining tools: clustering and topic ontology creation tool OntoGen and cross-domain bridging terms exploration tool CrossBee. Focusing on outlier documents identified by OntoGen contributes to the efficiency, while CrossBee allows for flexible and user-friendly bridging concepts exploration and identification. The proposed approach, which is domain independent and can support cross-domain knowledge discovery in any field of science, is illustrated on a biomedical case study dealing with Alzheimer’s disease, one of the most threatening age-related diseases, deteriorating lives of numerous individuals and challenging the ageing society as a whole. By applying the proposed methodology to Alzheimer’s disease and gut microbiota PubMed articles, we have identified Nitric oxide synthase (NOS) as a potentially valuable link between these two domains. The results support the hypothesis of neuroinflammatory nature of Alzheimer’s disease, and is indicative for the quest for identifying strategies to control nitric oxide-associated pathways in the periphery and in the brain. By addressing common mediators of inflammation using literature-based discovery, we have succeeded to uncover previously unidentified molecular links between Alzheimer’s disease and gut microbiota with a multi-target therapeutic potential.     

A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem

This paper investigates the prize-collecting vehicle routing problem (PCVRP), which has a strong background in practical industries. In the PCVRP, the capacities of all available vehicles are not sufficient to satisfy the demands of all customers. Consequently it is not a compulsory requirement that all customers should be visited. However, a prize can be collected once a customer is visited. In addition, it is required that the total demands of visited customers should reach a pre-specified value at least. The objective is to establish a schedule of vehicle routes so as to minimize the total transportation cost and at the same time maximize the prize collected by all vehicles. The total transportation cost consists of the total distance of vehicle routes and the sum of vehicles used in the schedule. To solve the PCVRP, a two-level self-adaptive variable neighborhood search (TLSAVNS) algorithm is developed according to the two levels of decisions in the PCVRP, namely the selection of customers to visit and the visiting sequence of selected customers in each vehicle route. The proposed TLSAVNS algorithm is self-adaptive because the neighborhoods and their search sequence are determined automatically by the algorithm itself based on the analysis of its search history. In addition, a graph extension method is adopted to obtain the lower bound for PCVRP by transforming the proposed mixed integer programming model of PCVRP into an equivalent traveling salesman problem (TSP) model, and the obtained lower bound is used to evaluate the proposed TLSAVNS algorithm. Computational results on benchmark problems show that the proposed TLSAVNS algorithm is efficient for PCVRP.     

Induced generalized hesitant fuzzy operators and their application to multiple attribute group decision making

In this paper, we develop a series of induced generalized aggregation operators for hesitant fuzzy or interval-valued hesitant fuzzy information, including induced generalized hesitant fuzzy ordered weighted averaging (IGHFOWA) operators, induced generalized hesitant fuzzy ordered weighted geometric (IGHFOWG) operators, induced generalized interval-valued hesitant fuzzy ordered weighted averaging (IGIVHFOWA) operators, and induced generalized interval-valued hesitant fuzzy ordered weighted geometric (IGIVHFOWG) operators. Next, we investigate their various properties and some of their special cases. Furthermore, some approaches based on the proposed operators are developed to solve multiple attribute group decision making (MAGDM) problems with hesitant fuzzy or interval-valued hesitant fuzzy information. Finally, some numerical examples are provided to illustrate the developed approaches.