Objective: Breast cancer is the most common female cancer in the world, and it poses a huge threat to women's health. There is currently promising research concerning its early diagnosis using deep learning methodologies. However, some commonly used Convolutional Neural Network (CNN) and their variations, such as AlexNet, VGGNet, GoogleNet and so on, are prone to overfitting in breast cancer classification, due to both small-scale breast pathology image datasets and overconfident softmax-cross-entropy loss. To alleviate the overfitting issue for better classification accuracy, we propose a novel framework for breast pathology classification, called the AlexNet-BC model. The model is pre-trained using the ImageNet dataset and fine-tuned using an augmented dataset. We also devise an improved cross-entropy loss function to penalize overconfident low-entropy output distributions and make the predictions suitable for uniform distributions. The proposed approach is then validated through a series of comparative experiments on BreaKHis, IDC and UCSB datasets. The experimental results show that the proposed method outperforms the state-of-the-art methods at different magnifications. Its strong robustness and generalization capabilities make it suitable for histopathology clinical computer-aided diagnosis systems.

Recycling, reusing, and remanufacturing of end-of-life (EOL) products have been receiving increasing attention. They effectively preserve the ecological environment and promote the development of economy. Disassembly sequencing and line balancing problems are indispensable to recycling and remanufacturing EOL products. A set of subassemblies can be obtained by disassembling an EOL product. In practice, there are many different types of EOL products that can be disassembled on a disassembly line, and a high-level uncertainty exists in the disassembly process of those EOL products. Hence, this paper proposes a stochastic multi-product multi-objective disassembly-sequencing-line-balancing problem aiming at maximizing disassembly profit and minimizing energy consumption and carbon emission. A simulated annealing and multi-objective discrete grey wolf optimizer with a stochastic simulation approach is proposed. Furthermore, real cases are used to examine the efficiency and feasibility of the proposed algorithm. Comparisons with multi-objective discrete grey wolf optimization, non-dominated sorting genetic algorithm II, Multi-population multi-objective evolutionary algorithm, and multi-objective evolutionary algorithm demonstrate the superiority of the proposed approach. Note to Practitioners —Disassembly line balancing has been widely recognized as the most ecological way of retrieving EOL products. Through in-depth research, we present a Stochastic Multi-product Multi-objective Disassembly-sequencing-line-balancing Problem. Furthermore, we consider that the uncertainty of products might cause disassembly failure. To solve this problem effectively and quickly, we combine the simulated annealing algorithm with the Grey Wolf Optimizer. The results show that the algorithm can effectively solve the proposed problem. The disassembly scheme provided by the obtained solution set offers a variety of options for decision-makers.

Technological advancement has given education a new definition--parallel intelligent education--resulting in fundamentally new ways of teaching and learning. This article exemplifies an important component of parallel intelligent education--artificial education system in a narrative game environment to offer personalized learning. The system collects data on the player's actions while they play, assessing their concept knowledge via k-nearest-neighbor (kNN) classification, and provides tailored feedback to that student as they play the game. Based on an empirical evaluation, the kNN-based game system is shown to accurately provide players with differentiated instructions to guide them through the learning process based on the estimation of their knowledge levels.

Selective disassembly sequence planning (SDSP) is regarded as an efficient strategy to determine optimal disassembly sequences for extracting target parts (TP) from complex end-of-life (EOL) products. Previous research assumes that all EOL products have the same structure and the optimal selective disassembly sequences are given before the EOL products are removed. However, the products have different operation states during their use stage, which results in high structure uncertainty of EOL products. The structure uncertainty of EOL products often makes the predetermined selective disassembly sequences impractical for minimizing disassembly time and maximizing disassembly profit. This letter undertakes this challenge by integrated reinforcement learning (RL) to determine the optimal disassembly sequences adaptive to the structure uncertainty of the EOL products. Firstly, a multi-level selective disassembly hybrid graph model (MSDHGM) is developed to illustrate the contact, precedence, and level relationships among parts. Then, the SDSP is formulated as a finite Markov Decision Process and a deep Q-network based selective disassembly sequence planning (DQN-SDSP) is proposed. Finally, extensive comparative experiments are conducted to verify the proposed method compared with NSGA-II and ABC algorithms.

Existing projector-camera calibration methods typically warp keypoints from a camera image to a projector image using estimated homographies and often suffer from errors in camera parameters and noises due to imperfect planarity of the calibration target. This article proposes a practical and robust projector-camera calibration system that explicitly deals with these challenges. First, a graph-theory-based correspondence algorithm is built on top of a color-coded spatial structured light (SL) pattern. Such SL correspondences are then used for a coarse projector-camera calibration. To gain more robustness against noises from an imperfect planar calibration board, we develop a bundle adjustment algorithm to jointly optimize the estimated projector-camera parameters and the correspondences' coordinates. Moreover, our system requires only one shot of an SL pattern for each calibration board pose, which is much more practical than multishot solutions. Comprehensive experimental validation is conducted on both synthetic and real data sets, and our method clearly outperforms the existing methods in all experiments. For the benefit of the society, a practical open-source software with graphical user interface (GUI) of the developed system is publicly available at https://github.com/bingyaohuang/single-shot-pro-cam-calib.

Product disassembly is critically important in recycling end-of-life products, reducing their negative impact on environmental pollution and minimizing resource waste. Disassembly line balancing problems have attracted much attention from researchers and industrial practitioners. Most of the existing studies, however, consider only human disassembly or robot disassembly alone. This work considers human-robot collaboration. It proposes an human-robot collaborative disassembly line balancing model considering stochastic task time, where an AND/OR graph is adopted to describe a product’s disassembly process. The objectives are to maximize the total profit and minimize energy consumption. A Pareto improved multi-objective shuffled frog leaping algorithm with a stochastic simulation strategy is proposed to solve the model. In addition, an elite strategy is introduced in global search to enhance the algorithm’s optimization capability. Through experiments on disassembling products of different sizes, the feasibility and effectiveness of this algorithm are demonstrated. Its comparison with some most popular state-of-the-art methods is performed. Note to Practitioners —This paper is motivated by the benefits of human-robot collaboration in the disassembly systems. The presented approach is suitable for disassembly lines with multiple objectives, and the weight of each objective cannot be accurately grasped. Most of the existing operation allocation methods are based on the correlation between humans and robots and the factors affecting disassembly. This paper suggests the selection of humans and robots is completely random and decided by an optimization algorithm. This paper designs an improved multi-objective shuffled frog leaping algorithm based on Pareto’s rule. Experimental results show that this algorithm can be applied to solve practical disassembly line balancing problems.