Search

• Offering a novel fuzzy robust approach for closed-loop supply chain network design. • Examining the hybrid uncertainties and flexibility of constraints in the problem. • Considering economic, responsibility, and environmental subjects in modeling. • Using the interactive fuzzy programming approach to solve the multi-objective model. • Introducing a new application for stone paper closed-loop supply chain network design. Nowadays, the production of stone paper, in addition to its widespread utilization in various fields, does not require water consumption, cutting down trees, and stone paper products are easily recyclable and recoverable. Due to the importance of developing and using stone paper and paying attention to environmental matters, Closed-Loop Supply Chain Network Design (CLSCND) is very important for stone paper products. Moreover, due to epistemic, randomness uncertainties, the uncertainties in Objective Function (OF), and the flexible constraints for CLSCND in the real world, this paper introduces a novel Mixed Robust Stochastic, Possibilistic, and Flexible Programming (MRSPFP) approach based on credibility theory. The different attitudes of the Decision-Makers (DMs) are addressed by a more flexible measurement of the optimistic and pessimistic parameters using the criterion of credibility. In the study, a comprehensive procedure is proposed for stone paper CLSCND, to minimize costs, increase responsiveness by minimizing transit time between different facilities, and regarding environmental concerns into account through minimizing carbon emissions. The model is solved utilizing an interactive fuzzy programming solution procedure and the Best-Worst Method (BWM). The results of sensitivity analysis, the effect of changing the problem parameters, and the performance of the proposed model are investigated and compared. The results show that the MRSPFP model has a better performance compared to other previous models. The MRSPFP model performs better in strategic decisions that require high investment costs due to the minimization of the absolute deviation of OF from its mean. Also, the applied results of the study show that CLSCND has a good capability and potential for sustainable development in the field of stone paper. [ABSTRACT FROM AUTHOR]

Regular Ship hull maintenance is an essential for sustainability. The maintenance work of ship hulls that involve human labor suffers from many shortcomings. Maintenance robots have been introduced for drydocks to eliminate these shortcomings. An energy-efficient Complete Coverage Path Planning (CCPP) is a crucial requirement from a ship hull maintenance robot. This paper proposes a novel energy-efficient CCPP method based on Glasius Bioinspired Neural Network (GBNN) for a ship hull inspection robot. The proposed method accounts for a comprehensive energy model for path planning. This energy model reflects the energy usage of a ship hull maintenance robot due to changes in direction, distance, and vertical position. Furthermore, the proposed method is effective for dynamic workspaces since it performs online path planning. These are the major contributions made to state of the art by the work proposed in this paper. The behavior and the performance of the proposed method have been compared against state of the art through simulations considering Hornbill, a multipurpose ship hull maintenance robot. The validation confirms the ability of the proposed in realizing a complete coverage of a given dynamic workspace. According to the statistical outcomes of the comparison, the performance of the proposed method significantly surpasses that of the state-of-the-art methods in terms of energy usage. Therefore, the proposed method contributes to the development of energy-efficient CCPP methods for a ship hull maintenance robot. • A novel coverage method based on Glasius Bioinspired Neural Network is proposed. • The proposed method is intended for a multipurpose ship hull maintenance robot. • A comprehensive energy model is utilized by the proposed method for path planning. • The proposed method is significantly efficient than the state of the art methods. • The paper contributes to the development of a ship hull maintenance robot. [ABSTRACT FROM AUTHOR]

Automatically generating a survey draft is a challenge to text summarization research because it needs to select important sentences from important references in a large set of candidate papers for composing sections that are in line with section titles and different sections discuss the most relevant reference papers of different number, which are beyond the capability of previous text summarization approaches as they assume that all candidate papers should be included into one summary. This paper proposes an approach to generating survey draft according to a pattern consisting of sections with titles given by the user who requests the survey. The problem of generating each section can be divided into the following sub-problems: (1) rank the input scientific documents (in short documents) according to the title of a section, (2) determine the number of documents that are most relevant to the title, and (3) rank and select sentences from the selected documents according to the title. A position closeness distance of key word is proposed to rank a set of documents by measuring how closely two key words within section title are distributed within each document, which is used to rank the documents. The rationale is that the positions of the neighboring key words of a section title should be closer in more relevant documents than other words. As different sections have different number of selected documents, a method is proposed to determine the number of documents to be included into the current section based on the slope shape of the sorted rank curve of documents according to the section title. Based on the duality property of the closeness, ranks of sentences within a document can be directly obtained when the document is ranked according to the title of section, and both the importance and coherence of selected sentences can be reflected without extra calculation for ranking sentences. Experiments and manual evaluation show that the proposed methods achieve significant improvements compared with other approaches. The proposed approach is significant in applications as different surveys can be generated according to different patterns given by different users. [ABSTRACT FROM AUTHOR]

The emergence of artificial intelligence (AI) and its related capabilities has led industries to rethink the existing practices of conventional supply chain management and data analysis. Machine learning (ML), Deep Learning (DL) and their unique ability to predict future data and classify data have led to important research in the supply chain (SC) domain, particularly in identifying and prioritizing supply chain risks. This paper proposes several DL methodologies to exploit the benefit of DL, particularly to identify whether any product will be delivered late due to any unforeseen reason in a complex SC system. Four different DL architectures (Simple-LSTM, Deep-LSTM, 1D-CNN, and TCN-1DSPCNN models) are proposed to extract features, while six variant classifiers: Softmax, random trees (RT), random forest (RF), K-nearest neighbor (KNN), artificial neural network (ANN), and support vector machine (SVM), were used to classify delay or non-delay information. By seamlessly capturing intricate temporal dependencies, these DL models enhance accuracy in robustly identifying supply chain late orders. Leveraging their hierarchical feature learning, these proposed DL models excel in recognizing subtle patterns and correlations, making them ideal for classifying late orders within the supply chain. Their parallel processing prowess facilitates real-time decision support, allowing organizations to address potential delays and allocate resources effectively and proactively. Five-fold cross-validation is presented to avoid over-fitting and to prove the efficiency of the proposed DL models. The total accuracies of the six ML classifiers are 74.03, 75.81, 93.35, 87.72, 93.59, and 95.10, respectively, while the maximum accuracies obtained from four proposed DL methodologies obtained an accuracy of 97.6, 98.63, 100, 100% respectively using the SVM classifier for predicting late orders based on five-fold cross-validation. • This paper investigates a few DL approaches to extract features of SC data. • Both RNN and CNN are applied in the same model. • An improved CNN model has been proposed for feature extraction. • An online dataset is employed to validate the proposed DL architectures. [ABSTRACT FROM AUTHOR]

In this paper, we study the problem of multi-institutional regionalization of primary health care units. The problem consists of deciding where to place new facilities, capacity expansions for existing facilities, and demand allocation in a multi-institutional system to minimize the total travel distance from demand points to health care units. It is known that traditional exact methods as branch-and-bound are limited to solving small- to medium-size instances of the problem. Given that real world-instances can be large, in this paper we propose an iterated greedy algorithm with variable neighborhood descent search for handling large-scale instances. Within this solution framework, several methods are developed. A greedy constructive method and two deconstruction strategies are developed. Another interesting component is the exact optimization of a demand allocation subproblem that is obtained when the location of facilities is previously fixed. An empirical assessment using real-world data from the State of Mexico's Public Health Care System is carried out. The results demonstrate the effectiveness of the proposed metaheuristic in handling large-scale instances. [ABSTRACT FROM AUTHOR]

Multiple Instance Learning (MIL) is a learning paradigm, where training instances are arranged in sets, called bags, and only bag-level labels are available during training. This learning paradigm has been successfully applied in various real-world scenarios, including medical image analysis, object detection, image classification, drug activity prediction, and many others. This survey paper presents a comprehensive analysis of MIL, highlighting its significance, recent advancements, methodologies, applications, and evolving trends across diverse domains. The survey begins by explaining the core principles that form the basis of MIL and how it differs from traditional learning approaches. This sets the foundation for comprehending the distinct challenges and techniques of solving MIL problems. Next, we discuss how supervised learning algorithms are tailored to support MIL and combine this discussion with a review of seminal MIL algorithms as well as the latest innovations that incorporate neural networks, deep learning architectures, and attention techniques. This comprehensive analysis helps to understand the strengths, limitations, and adaptability of these methods across diverse data modalities, complexities, and applications. In summary, this survey paper provides an essential resource for researchers, practitioners, and enthusiasts seeking a comprehensive understanding of Multiple Instance Learning. It covers foundational concepts, traditional methods, recent advancements, and future directions. By providing a holistic view of MIL's dynamic landscape, this paper aims to inspire further innovation and exploration in this ever-evolving field. • A survey on the current state of the Multiple Instance Learning. • We provide applications of Multiple instance learning in various domains. • We discuss how existing supervised learning algorithms are modified to support MIL. • Publicly available datasets and open research challenges in MIL are discussed. [ABSTRACT FROM AUTHOR]

The surveillance or monitoring of places is crucial to ensuring security, protecting people and assets, preventing crimes, and detecting emergencies, to mention some. Unmanned Aerial Vehicles (UAVs) play a vital role in these applications, offering versatility, agility, and aerial vision. A crucial step for such tasks is to protect the UAV path ahead. This paper focuses on a methodology harnessing the unpredictable nature of chaotic systems to generate trajectories around a closed area or contour. However, although a vast quantity of research papers mention the use of chaotic path generation, they have yet to learn about the control system and the dynamics affecting the UAV, where developing the control theory is challenging. In this paper, we design controllers based on predetermined-time stability, ensuring the achievement of the desired trajectory before a specified time. Additionally, adjusting control parameters is a crucial step during the control design, impacting the control performance. Hence, we present a method to optimize and adapt controller parameters through evolutionary optimization, demonstrating precision enhancement. We validate the proposed system's performance and the controllers through numerical simulations, indicating that the UAV effectively and accurately follows some types of chaotic trajectories like a square contour, aiming at the feasibility of this methodology in real UAV surveillance applications. • Design of Predefined-Time Control (PTC) for chaotic trajectory tracking with UAVs. • Generation of complex and unpredictable trajectories based on chaotic systems. • Optimization of controller parameters by Differential Evolution metaheuristic. • Lyapunov analysis for the design and convergence of Predefined-Time Controllers. [ABSTRACT FROM AUTHOR]

The existing feature selection algorithms often utilize local structure of data, but do not fully mine internal structure and ignore potential correlation information between samples. To address the problems and fully utilize manifold information of data, this paper proposes non-convex feature selection based on feature correlation representation and dual manifold optimization (FDNFS). Firstly, FDNFS constructs feature graph of original data, which can obtain feature correlation representation to represent the interconnection information. Based on the obtained interconnection information, FDNFS unifies feature correlation representation learning and feature selection through feature transformation matrix, so that the interconnection information between data guides feature selection. Secondly, to make multivariate frameworks guide feature selection, FDNFS introduces self-representation on the improved sparse regression model. Using self-representation can make basis matrix and reconstruction coefficient matrix reconstruct original data more accurately. Next, in order to preserve local structure information abundantly, FDNFS has two-part manifold regularization on the pseudo-label matrix in sparse regression model and the reconstructed coefficient matrix in self-representation framework. This can fully use the manifold information of data. In addition, FDNFS imposes the non-convex constraints. It can ensure the sparsity of feature selection matrix. In turn, this can select features with lower redundancy, and then select a better feature subset. Finally, this paper adopts an iterative optimization method. FDNFS is compared with nine algorithms on seven datasets. The clustering results reflect better performance of FDNFS. • Feature correlation representation and dual manifold optimization is proposed. • It constructs feature graph to represent the interconnection information. • It unifies feature correlation representation learning and feature selection. • It introduces self-representation on the improved sparse regression model. • It has two-part manifold regularization on the pseudo-label matrix. [ABSTRACT FROM AUTHOR]

The research on bipedal robots with limited foot area is gaining increasing attention. To tackle the challenge of dealing with unknown disturbances in the environment, the adjustment of footstep placement plays a vital role in maintaining stable motion during bipedal walking. This paper introduces an innovative approach based on the relationship between the Divergent Component of Motion (DCM) and footstep. It utilizes a DCM prediction model to optimize the optimal speed for recovering the foothold position. The goal is to enable quick and relevant footstep selection for bipedal robots, thereby facilitating the swift recovery of robot speed. The paper provides insights into the process of designing the desired DCM for achieving an optimal average walking speed without relying on predefined footstep sequences. By establishing a state equation between the DCM and footstep placement, this approach enables the prediction of multiple footstep positions within a fixed walking cycle, thereby facilitating the desired average motion speed. Extensive numerical simulations are conducted to compare the proposed method with various conventional footstep adjustment algorithms. The results emphasize our method's ability to converge more rapidly to the target speed, even with minor step adjustments. To validate the feasibility and robustness of the algorithm, we conduct experiments on the bipedal robot BHR-B2. These experiments further confirm the algorithm's effectiveness. Given its promising performance, this algorithm holds potential for applications in legged robots with point feet. • The adjustment of the footstep is crucial for the speed recovery of bipedal walking. • A multi-step prediction footsteps adjustment algorithm based on DCM is proposed. • The desired speed of motion is mathematically related to the target DCM state. • Three adjustment algorithms were compared through simulation. • Algorithms have been applied and effectively validated on a bipedal platform. [ABSTRACT FROM AUTHOR]

In 2019, a chaotic image encryption scheme based on a variant of the Hill cipher (VHC-CIES) was proposed by the Moroccan scholars. VHC-CIES introduces a Hill cipher variant and three improved one-dimensional chaotic maps to enhance the security. In this paper, we conduct a comprehensive cryptanalysis, and find that VHC-CIES can resist neither chosen-plaintext attack nor chosen-ciphertext attack due to its inherent flaws. When it comes to chosen-plaintext attack, firstly, we select a plaintext with the pixel values are all 0 and its corresponding ciphertext, and then use algebraic analysis to obtain the equivalent key stream for cracking VHC-CIES. Secondly, we select a plaintext which the pixel values are invariably 1 and obtain its corresponding ciphertext to obtain some Hill cipher variant parameters of VHC-CIES. Finally, we use the resulting steps of the first two to recover the original plain image from a given target cipher image. Similarly, a chosen-ciphertext attack method can also break VHC-CIES. Theoretical analysis and experimental results show that both chosen-plaintext attack and chosen-ciphertext attack can effectively crack VHC-CIES with data complexity of only O (2). For color images of size 256 × 256 × 3 , when our simulation encryption time is 0.3150 s, the time for complete breaking by chosen-plaintext attack and chosen-ciphertext attack is about 0.6020 s and 0.9643 s, respectively. To improve its security, some suggestions for further improvement are also given. The cryptanalysis work in this paper may provide some reference for the security enhancement of chaos-based image cryptosystem design. [ABSTRACT FROM AUTHOR]

In the context of early childhood education, students need to acquire fundamental writing skills for their lifelong development. Public schools, especially in low- and middle-income countries, should monitor individual student progress to mitigate the detrimental effects of socioeconomic vulnerabilities in education. Furthermore, the volume of students often overwhelms teachers responsible for assessing handwriting texts and providing feedback. This article conducts a Systematic Literature Review (SLR) focusing on solutions for automatically evaluating students' handwriting, discussing their performance, future research directions, and areas needing further investigation. We used a mixed-methods approach to conduct our SLR, encompassing a search across four databases (ACM Digital Library, IEEE Xplore, ScienceDirect, and SpringerLink) and employed the snowballing technique. We used the initial set of papers from the database search as the foundation for the subsequent snowballing search. Findings revealed that the studies introduced computational techniques, examined or enhanced existing methods, and developed assessment tools. These solutions predominantly employed techniques such as artificial neural networks and used available datasets comprising handwritten images, answers, or student essays. Only some studies provide low-cost solutions for automatically assessing the writing abilities of underserved public school students. • We reviewed 491 papers, extracting data from 22 focusing on handwriting assessment. • We applied a mixed method using database search and the snowballing technique. • Studies frequently adopt deep learning methods to tackle the handwriting recognition problem. • Studies employ various methods to automatically assess text production, such as ANN, latent semantic analysis, content vector analysis, and CNN. • The mean accuracy for handwriting assessment was notably high at 93.64%, suggesting that the models in this group exhibited good performance. [ABSTRACT FROM AUTHOR]

Adversarial attacks can mislead deep learning models to make false predictions by implanting small perturbations to the original input that are imperceptible to the human eye, which poses a huge security threat to computer vision systems based on deep learning. Physical adversarial attacks, which is more realistic, as the perturbation is introduced to the input before it is captured and converted to a image inside the vision system, when compared to digital adversarial attacks. In this paper, we focus on physical adversarial attacks and further classify them into invasive and non-invasive. Optical-based physical adversarial attack techniques (e.g. using light irradiation) belong to the non-invasive category. The perturbations can be easily ignored by humans as the perturbations are very similar to the effects generated by a natural environment in the real world. With high invisibility and executability, optical-based physical adversarial attacks can pose a significant or even lethal threat to real systems. This paper focuses on optical-based physical adversarial attack techniques for computer vision systems, with emphasis on the introduction and discussion of optical-based physical adversarial attack techniques. [ABSTRACT FROM AUTHOR]

This paper proposes physics-informed meta-learning-based surrogate modeling (PI-MLSM), a novel approach that combines meta-learning and physics-informed deep learning to train surrogate models with limited labeled data. PI-MLSM consists of two stages: meta-learning and physics-informed task adaptation. The proposed approach is demonstrated to outperform other methods in four numerical examples while reducing errors in prediction and reliability analysis, exhibiting robustness, and requiring less labeled data during optimization. Moreover, compared to other approaches, the proposed approach exhibits better performance in solving out-of-distribution tasks. Although this paper acknowledges certain limitations and challenges, such as the subjective nature of physical information, it highlights the key contributions of PI-MLSM, including its effectiveness in solving a wide range of tasks and its ability in handling situations wherein physical laws are not explicitly known. Overall, PI-MLSM demonstrates potential as a powerful and versatile approach for surrogate modeling. • A proposed approach uses meta-learning and PIDL to train surrogates with small data. • A model-agnostic meta-learning model is introduced to learn surrogate model weights. • A PIDL approach is introduced to adapt to target tasks with meta-learned weights. • Our approach outperformed other methods in numerical examples given limited data. • Proposed approach showed robustness in solving out-of-distribution tasks. [ABSTRACT FROM AUTHOR]

• Comprehensive CHP unit scheduling formulation. • Quality assurance through optimal gap evaluation. • Two-stage stochastic approach with MINLP. • Uncertainty management in unit commitment. • Modeling of electrical and thermal ramp constraints. Renowned for their remarkable overall efficiencies ranging from 70% to 90%, combined heat and power systems stand as a pivotal strategy for optimizing energy consumption by capitalizing on the synergistic relationship between electricity and thermal energy production. However, achieving optimal performance in combined heat and power systems remains a formidable challenge due to the intricate interplay of numerous variables. This paper presents a novel approach to daily scheduling optimization for combined heat and power units, focusing on the integration of electrical and thermal storage systems and meticulous consideration of security constraints. The optimization of combined heat and power unit scheduling introduces a mixed-integer nonlinear programming challenge, replete with deterministic and random variables. Addressing this complexity requires resilient solutions. In this study, we employ a multilevel optimization technique, transforming the problem into a bilevel structure. The initial step involves mapping operating parameters and minimizing costs through a water cycle optimization algorithm, laying a robust foundation for combined heat and power unit operation. Subsequently, we immerse ourselves in the realm of stochastic contingency scenarios, acknowledging the myriad uncertainties inherent in real-world systems. To empirically validate the efficacy of our proposed algorithm, extensive simulations are conducted on IEEE 18-bus and 24-bus test systems that emulate practical power networks. The results unequivocally showcase the power of our approach in navigating the complexities of optimal CHP unit planning. This paper's contributions lie in its innovative multilevel optimization technique, adeptly addressing both deterministic and stochastic aspects, ultimately paving the way for increased energy efficiency and enhanced system reliability in practical applications. [ABSTRACT FROM AUTHOR]

With the wide application of vision in the fields of autonomous driving and medical imaging, the demand for overexposure image correction algorithms is becoming increasingly urgent. However, existing overexposure image correction algorithms can lead to problems such as blurring, color bias, and over-enhancement of the generated images. Optimizing overexposure image quality has a significant impact on improving system performance, accuracy, and safety. In this paper, we propose an overexposure image correction network. First, we built the Detail Enhancement Module (DEM). It adopts global average pooling on each channel of the input feature map. After pooling, an activation function is used for nonlinear mapping to generate a channel attention weight vector. And it is multiplied with the original input feature map to achieve the purpose of enhancing the details of the overexposed image. Second, we construct a context-aware backbone (CAB) to extract features such as color and texture. The linear attention gating mechanism replaces the multi-head attention module in Transformer, and reduces the computational complexity in high-resolution images while maintaining performance by learning linear transformation and attention gating. Finally, we design an attention-guided feature fusion (AGFF) to fuse shallow and deep features. It computes weight vectors for shallow features through an attention module. The calculated result is converted to the same dimension as the input feature by bilinear interpolation, so as to enrich the semantic information and detailed information of the generated image. In addition to designing the network structure, we design a hybrid loss function to improve the quality of the generated image from the spatial and structural aspects, and the exposure function can correct the exposure degree of the generated image. Experiments are conducted on two public datasets and the dataset in this paper. Specifically, the PSNR and SSIM of images generated on the dataset MSEC increased by 1.3813% and 5.56%. The PSNR and SSIM of images generated on the dataset SICE increased by 1.545% and 4.64%. The proposed method can effectively generate clear and high-fidelity images. • An end-to-end overexposure correction algorithm. • The context-aware networks is constructed to extract exposed feature information. • The exposure loss is employed to prevent over-enhancement. • The proposed model aims to generator normally exposed images. [ABSTRACT FROM AUTHOR]

The human-centric philosophy is considered a crucial development direction for smart Product-Service Systems (smart PSS). Smart PSS has effectively advanced the circular economy by enhancing user experience, incorporating servitization and digital servitization, and extending product lifecycle, among other key aspects of sustainable development. However, there is currently a lack of a reasonable, accurate, and actionable framework and methodology to express the human element, namely user profiling, within this philosophy. To address this gap, this paper utilizes statistical methods such as factor analysis, cluster analysis, and regression analysis, building upon the concept of traditional user profiling. The aim is to integrate the three prominent approaches of goal-oriented, scenario-based, and data-driven user profiling, with the goal of complementing each other and designing a top-level user profiling framework for smart PSS. Furthermore, Industry 4.0 technologies and text mining techniques are employed to collect data on users' product and service usage. As these data contain real-time information about user needs, behaviors and goals at different time periods, they can be used to construct dynamic features of user profiling, and ultimately achieve the construction of dynamic user profiling for smart PSS. To validate the proposed user profiling framework and dynamic user features of smart PSS, this paper presents a case study focusing on the user group of maternal women. This case study promotes the in-depth exploration of smart PSS research in expressing the human element. [ABSTRACT FROM AUTHOR]

Hot-rolled strip products have diverse applications, and enhancing the detection, diagnostics, and prognostics of product quality during hot rolling is essential. Nevertheless, the multivariable, strong coupling, nonlinear, and time-varying nature of the production process poses a rigorous challenge for accurate hot-rolled prognostics. This paper implements a progressive layered extraction (PLE) multi-task learning (MTL) framework to simultaneously estimate multiple quality indicators, such as strip crown, center line deviation, exit temperature, wedge, width, and symmetry flatness. Additionally, the paper proposes the implements of Hybrid Bayesian Neural Network (HBNN) experts and a gating network with attention mechanism to integrate private and shared task features. It also puts forth an auxiliary task involving a Variational Autoencoder with Generative Adversarial Networks (VAE-GAN) to extract latent states from the original sequence. Moreover, an adaptive joint loss optimization is employed to update the weight of individual task losses for MTL training problems, and three sets of field hot-rolled datasets are used for model evaluation. In the experimental validation, considering the noisy field data and limited conditions in the real hot rolled production, comparative experiments are conducted to demonstrate the improved generalization and robustness of the proposed MTL approach. These experiments involve different percentages of the total data, ranging from 5% to 20%, and various prediction horizons ranging from 1 to 50 steps for model establishment. In addition, the paper discusses the interpretation of the model and strategies for further enhancing model performance. [ABSTRACT FROM AUTHOR]

The primary objective of this paper is to aid game developers in finding the most suitable pathfinding algorithm for their games. Despite recent advancements in this field, there are few available studies that can be compared due to the absence of a standard benchmark set for weighted environments. This paper presents a new dataset for pathfinding in weighted environments. Furthermore, an investigation was conducted into the impact of node weights on pathfinding speed, and a correlation between them was identified. The complexity added to the maps due to node weights was defined as weight complexity, and two metrics were introduced to estimate it. The weight correlation factor has been identified as the most effective metric for estimating the weight complexity of the map. Another contribution of this paper pertains to the development of a model for estimating the pathfinding speed of algorithms based on weight complexity. This was accomplished through the utilization of the non-linear least squares method, which was applied to create a model for each algorithm, considering both its average search time and weight correlation factor values associated with the map. Finally an overall score metric was developed by using the integral of the models, enabling the evaluation of different algorithms in various scenarios. [Display omitted] • Testing JPSW (weighted jump point search) algorithm search speed. • Introducing the first standardized benchmark for weighted gridmaps. • Introducing a new metric for analyzing gridmap complexity. • Using edge detection techniques for weighted gridmap analysis. • Introducing a scoring system for pathfinding algorithms in weighted environments. [ABSTRACT FROM AUTHOR]

Keyphrase Extraction is an automatic task that involves identifying the key words or phrases that capture the main content of an article. It is useful for various downstream tasks, including text search, text clustering, and text classification. Embedding-based methods for keyphrase extraction have shown promising results by utilizing pre-trained language models to represent candidate phrases and documents separately. These methods then rank the candidate phrases based on the cosine similarity between the document and the candidate phrases embeddings. However, there are mainly two shortcomings in such methods: I) Redundancy errors, when there are partial repetitions of candidate keyphrases, the methods tend to use redundant long phrases as keyphrases; II) Low keyphrase coverage, such as some keyphrases used to describe locally important information are ignored. In this paper, we propose an unsupervised keyphrase extraction method called "MICRank", which evaluates the importance of candidate keyphrases from three perspectives: global information, local information, and attribute information, and solved the aforementioned issues. The experimental results on six benchmarks demonstrate that the proposed MICRank method outperforms the state-of-the-art unsupervised keyphrase extraction methods. In addition, this paper improves the judgment criterion of correct keyphrase extraction and introduces a new evaluation metric called S1@M (M ∈ {5,10,15}) to address the issue of synonyms being considered incorrect predictions. [ABSTRACT FROM AUTHOR]

Due to the mobile and random nature of services in cyber–physical–social systems (CPSSs), developing service composition approaches that ensure high availability, minimal energy consumption, and high quality of service (QoS) remains a complex challenge. Over the last two decades, several service composition approaches have been proposed in the literature to deal with this challenge. Nevertheless, the existing approaches have certain limitations, particularly in situations where services may move from one location to another, become unavailable due to intensive battery usage, encounter failures, or undergo a decline in quality. These limitations often arise because these approaches do not simultaneously integrate mobility, energy, and QoS constraints while defining the user's movement in a random manner. In this paper, the learning-based swarm optimization-aware service composition algorithm (LS-SCA) is proposed to overcome the aforementioned shortcoming. This approach surpasses existing ones by accounting simultaneously for the user's mobility, energy, and QoS criteria during the service composition process. First, the Small World in Motion (SWIM) mobility model is employed in this study to determine the user's mobility traces, avoiding the random generation of users' traces. Second, an energy consumption model is proposed to increase the energy efficiency by avoiding the overuse of the devices' batteries that can reduce the availability of services and lead to the composition failure. Third, the two-phase learning-based swarm optimizer (TPLSO) method is used in the composition process to find the sub-optimal composition that satisfies the global QoS constraints with the highest utility in terms of mobility, energy, and QoS. Unlike the most existing metaheuristic-based service composition approaches where the overall composition population is improved over a given number of iterations, the TPLSO method is exploited in this paper to improve only a subset of compositions, which reduces the composition time and increases the QoS utility of the composition. The simulation scenarios using two real datasets demonstrate that the LS-SCA approach outperforms six baselines in terms of energy consumption, QoS utility, and availability of composition. This notable performance makes the proposed approach more suitable for real-world applications where energy efficiency, QoS, and availability are crucial factors to consider. [ABSTRACT FROM AUTHOR]

• The interval data effectively aggregated by the induced continuous aggregation operator. • The Shanghai composite index can be accurately predicted by the combination prediction model. • Thorough study of effectiveness theory of the combination prediction model has been completed. This paper proposes an interval combination prediction model for Shanghai composite index, utilizing the Theil coefficient and the induced continuous generalized ordered weighted logarithmic harmonic averaging (ICGOWLHA) operator. The effectiveness of the proposed model under specific weight conditions and the existence of its analytical solution are demonstrated. Shanghai composite index's case analysis demonstrates that, in terms of interval root mean squared error (IRMSE), interval mean absolute error (IMAE), interval mean absolute percentage error (IMAPE), and interval mean squared percentage error (IMSPE), the proposed model's predictive performance improvements over the best-performing single prediction model are 29.33%, 25.72%, 26.10%, and 28.86%, respectively. At the same time, the theoretical properties of the model are verified in the results of the case analysis, and the model's convergence is reflected in sensitivity analysis. Through extensive model comparisons, it is observed that the model proposed in this paper exhibits strong generalization, without specific limitations on data size or feature count. It demonstrates good aggregation prediction performance for interval data. Moreover, it is applicable to various fields, including finance, environment, and others. [ABSTRACT FROM AUTHOR]

Automatic humor detection has compelling use cases in modern technologies, such as humanoid robots, chatbots, and virtual assistants. In this paper, we propose a novel approach for detecting and rating humor in short texts based on a popular linguistic theory of humor. The proposed technical method initiates by separating sentences of the given text and utilizing the BERT model to generate embeddings for each one. The embeddings are fed to a neural network as parallel lines of hidden layers in order to determine the congruity and other latent relationships between the sentences, and eventually, predict humor in the text. We accompany the paper with a novel dataset consisting of 200,000 short texts, labeled for the binary task of humor detection. In addition to evaluating our work on the novel dataset, we participated in a live machine-learning competition to rate humor in Spanish tweets. The proposed model obtained F1 scores of 0.982 and 0.869 in the performed experiments which outperform general and state-of-the-art models. The evaluation results confirm the model's strength and robustness and suggest two important factors in achieving high accuracy in the current task: (1) usage of sentence embeddings and (2) utilizing the linguistic structure of humor in designing the proposed model. • A novel method for humor detection and rating based on a general linguistic theory of humor. • Introduced a very large novel dataset with 200k short texts for humor detection. • Achieved 98% accuracy and outperformed five strong baselines on the new dataset. • Demonstrated accuracy and robustness in a data science competition for Spanish texts. • The novel approach and dataset contributed to tens of research projects. [ABSTRACT FROM AUTHOR]

• The 2S attack matrix on the actual time sequence with the two loopings. • The precise forensics' timeline on the real case attack. • The in-depth technical details of the attacks within the energy sector. • The insight into the attacker's behaviors for network admins. • The protection begins with a clear understanding of the ransomware attack pattern. Due to the Coronavirus pandemic (COVID-19) throughout 2020–22, remote working has played an important part in organizations, businesses, and agencies worldwide. This situation makes the various cybersecurity threats the Internet poses, especially ransomware. Ransomware will remain the top cybersecurity threat, and the energy sector is the prime target. Previously, research papers only focused on the analytical and protection frameworks. These papers rarely provide real evidence and detailed digital forensics. Interestingly, the ransomware gangs developed new methods but still used similar attack patterns. The authors envisage that a precise understanding of the ransomware attack characteristics is a starting point for the correct detection process. This paper presents a true case study demonstrating the actual occurrence of digital forensics and in-depth technical details of the attacks within the energy sector. The significant attack patterns, which have never been emphasized in research papers, can be proposed for the two loops. The results led to a novel ransomware attack matrix with two loop patterns (dwell time factor) applicable to other ransomware gangs for the detection stage of the NIST. [ABSTRACT FROM AUTHOR]

Disruptions occurring at an urban rail transit (URT) system can severely affect its normal operations, and an effective bus bridging service (BBS) is able to help to reduce the negative effects. Transit operators usually arrange BBS to depart from the disrupted stations to evacuate the stranded passengers. However, the overload of passengers at the disrupted stations, especially at turnover and transfer stations, may incur the secondary operation disruptions such as stampede accidents. To mitigate the negative effects of disruptions and reduce the number of passengers stranded at the disrupted stations, the strategy based on the passenger guidance and extended BBS (E-BBS) is introduced in this paper. Different from the widely applied standard BBS running within the disrupted links, E-BBS runs among the normal operating stations or between the normal operating stations and the disrupted stations. A mixed integer linear programming model is developed in this paper to guide the stranded passengers and design an optimal E-BBS solution to transport them. Considering the bi-directional running trains along the disrupted links, a dynamic decision framework is developed to manage the disruptions. Given the impacts of the high uncertainty on bus running time which could affect the performance of E-BBS, a robust model is proposed to obtain more reliable travel guidance and E-BBS schemes. Numerical experiments based on Chengdu subway system in China are conducted. The results indicate that the proposed model can obtain optimal travel guidance and E-BBS solutions in a timely manner. When the uncertainty on bus running time is ignored, the total travel cost for affected passengers is reduced 14.20 % on average with the aid of the optimal travel guidance and E-BBS solutions. Moreover, the number of passengers gathering at the disrupted stations decreases by 36.80 %. The robust model can obtain more reliable travel guidance and E-BBS schemes in consideration of uncertain bus running time. The proposed model shows great potential to effectively mitigate the negative effects of disruptions and help to enhance the capability of a URT system to respond to disruptions. [ABSTRACT FROM AUTHOR]

A dual stator winding induction motor (DSWIM) has two isolated three-phase windings in its stator, and its rotor is a usual squirrel cage type. In a sensor-less DSWIM drive, the standard and optimal operating mode in all operating speed ranges is the synchronous mode. Until now, researchers use the asynchronous mode to control it in the low speed range that is not the standard mode. But, this paper proposes a new intelligent model reference adaptive system (IMRAS) to control a DSWIM drive without the speed sensor based on a ten-switch converter in the low speed range. In the proposed intelligent sensor-less DSWIM drive, the rotor speed is estimated via an intelligent model as single and bi-objective functions. In the proposed IMRAS, the second objective increases the speed estimation accuracy at very low speeds. In this idea, the rotor speed error is used as data in the rotor speed estimation process. As a result, the convergence between estimated speed and reference speed in the proposed IMRAS is increased at zero and very low speeds. Also, in this paper, the power losses, the capital cost, and the number of switching elements in the converter are reduced via the concept of flux compensation and using a ten-switch converter. The intelligent proposed sensor-less DSWIM drive, unlike conventional methods, works in its standard operating mode (synchronous mode) and has a suitable performance in the low speed range. Hence, the converter power losses are significantly decreased. The suggested techniques are simulated in MATLAB software. The simulation of the proposed DSWIM drive system is performed under different scenarios of operating conditions and the obtained results approve the assumptions. [ABSTRACT FROM AUTHOR]

Largely inspired by the practice that both the brand name supplier and the platform motivate to encroach on the online retailing market, this paper investigates the optimal encroaching decisions in an online retailing marketplace that is currently owned by multiple online retailers. Depending on whether and who will encroach on, this paper conducts three different encroaching scenarios including the benchmark without encroaching, the brand name supplier encroaching, and the platform encroaching. A Stackelberg game model is then developed to capture competitions among three parties and thus address equilibria in this paper. With analytical studies and numerical experiments, several key findings are derived. For example, but not limited to, the optimal commission set by the platform is contingent largely upon the encroaching scenarios and the number of online retailers. Interestingly, the optimal commission tends to be consistent when there are as many online retailers as possible, regardless of whether and who will encroach. This paper also analytically reveals that the encroaching cost, the product inherent (the fraction of product cost over its market potential), and the optimal commission, induce key impacts on the individuals' retailing encroaching decisions. A free rider effect incurred by the retailing encroaching is found and examined in this platform supply chain. The results derived in our paper shed lights on operational and encroaching decisions for the platform supply chain. • Develop a game theoretical model in an E-commerce platform supply chain with multiple online retailers. • Explore an endogenous commission set by the platform across different encroaching scenarios. • Investigate the optimal retailing encroaching decisions for two potential entrants. • Reveal impacts of retailing encroaching on individual profits and find a free ride effect incurred by the encroaching. [ABSTRACT FROM AUTHOR]