• A framework for cloud remanufacturing, encompassing a series of remanufacturing macroscopic phases, is established. • A multi-phase integrated scheduling problem for the proposed cloud remanufacturing system is introduced. • A mathematical model is developed to explain the scheduling problem. • An improved whale optimization algorithm integrating enhanced population updating mechanisms is designed to address this problem. The cloud remanufacturing system embraces a series of interdependent remanufacturing macroscopic phases (RMAs) with intricate precedence relationships, increasing the complexity of task scheduling and resource allocation. Thus, the multi-phase integrated scheduling is necessary to manage remanufacturing tasks and optimize resources and capabilities effectively in the cloud environment. This research investigates the multi-phase integrated scheduling problem for cloud remanufacturing system involving a series of RMAs including initial inspection, disassembly, reprocessing, reassembly, and final test. A mathematical model is created to explain the scheduling issue using the suggested cloud remanufacturing framework. Due to the high complexity of integrated scheduling, traditional meta -heuristic algorithms cannot be directly applied to solving the problem. Thus, an improved whale optimization algorithm (IWOA) incorporating the self-adaptive weighting and quadratic interpolation techniques is proposed for addressing the studied problem efficiently. A case study is designed and conducted, and the findings indicate that the IWOA is more effective than other methods in addressing the proposed complex scheduling issues with better accuracy, faster computation, and improved convergence efficiency.

The rapid geographic spread of COVID-19, to which various factors may have contributed, has caused a global health crisis. Recently, the analysis and forecast of the COVID-19 pandemic have attracted worldwide attention. In this work, a large COVID-19 data set consisting of COVID-19 pandemic, COVID-19 testing capacity, economic level, demographic information, and geographic location data in 184 countries and 1241 areas from December 18, 2019, to September 30, 2020, were developed from public reports released by national health authorities and bureau of statistics. We proposed a machine learning model for COVID-19 prediction based on the broad learning system (BLS). Here, we leveraged random forest (RF) to screen out the key features. Then, we combine the bagging strategy and BLS to develop a random-forest-bagging BLS (RF-Bagging-BLS) approach to forecast the trend of the COVID-19 pandemic. In addition, we compared the forecasting results with linear regression (LR) model, [Formula: see text]-nearest neighbors (KNN), decision tree (DT), adaptive boosting (Ada), RF, gradient boosting DT (GBDT), support vector regression (SVR), extra trees (ETs) regressor, CatBoost (CAT), LightGBM (LGB), XGBoost (XGB), and BLS.The RF-Bagging BLS model showed better forecasting performance in terms of relative mean-square error (RMSE), coefficient of determination ([Formula: see text]), adjusted coefficient of determination ([Formula: see text]), median absolute error (MAD), and mean absolute percentage error (MAPE) than other models. Hence, the proposed model demonstrates superior predictive power over other benchmark models.

High-speed rail (HSR) systems potentially provide a more efficient way of door-to-door transportation than airplane. However, they also pose unprecedented challenges in delivering seamless Internet service for on-board passengers. In this paper, we conduct a large-scale active-passive measurement study of TCP performance over LTE on HSR. Our measurement targets the HSR routes in China operating at above 300 km/h. We performed extensive data collection through both controlled setting and passive monitoring, obtaining 1732.9 GB data collected over 135719 km of trips. Leveraging such a unique dataset, we measure important performance metrics such as TCP goodput, latency, loss rate, as well as key characteristics of TCP flows, application breakdown, and users' behaviors. We further quantitatively study the impact of frequent cellular handover on HSR networking performance, and conduct in-depth examination of the performance of two widely deployed transport-layer protocols: TCP CUBIC and TCP BBR. Our findings reveal the performance of today's commercial HSR networks "in the wild'', as well as identify several performance inefficiencies, which motivate us to design a simple yet effective congestion control algorithm based on BBR to further boost the throughput by up to 36.5%. They together highlight the need to develop dedicated protocol mechanisms that are friendly to extreme mobility.

In this paper, we present new randomized algorithms that improve the complexity of the classic (Δ+1)-coloring problem, and its generalization (Δ+1)-list-coloring, in three well-studied models of distributed, parallel, and centralized computation: Distributed Congested Clique: We present an O(1)-round randomized algorithm for (Δ + 1)-list-coloring in the congested clique model of distributed computing. This settles the asymptotic complexity of this problem. It moreover improves upon the O(log* Δ)-round randomized algorithms of Parter and Su [DISC'18] and O((log log Δ)⋅ log* Δ)-round randomized algorithm of Parter [ICALP'18].

International audience

Real-time processing of data streams emanating from sensors is becoming a common task in industrial scenarios. An increasing number of processing jobs executed over such platforms are requiring reasoning mechanisms. The key implementation goal is thus to efficiently handle massive incoming data streams and support reasoning, data analytic services. Moreover, in an on-going industrial project on anomaly detection in large potable water networks, we are facing the effect of dynamically changing data and work characteristics in stream processing. The Strider system addresses these research and implementation challenges by considering scalability, fault-tolerance, high throughput and acceptable latency properties. We will demonstrate the benefits of Strider on an Internet of Things-based real world and industrial setting.

This paper deals with the problem of stabilization for networked stochastic systems with transmitted data dropout. The plant in the networked control system (NCS) under consideration is a discrete stochastic time-delay nonlinear system represented by a Takagi-Sugeno fuzzy model. Exponential stability criteria of the NCS are developed by using a common quadratic Lyapunov function and a fuzzy Lyapunov function, respectively. A stabilization controller with convergence rate constraint can be designed by solving a set of linear matrix inequalities that is numerically feasible with commercially available software. Three numerical examples are presented to demonstrate the effectiveness of the proposed methods.

It is a standard result that a finite impulse response channel of length L can be uniquely identified by feeding in a known (and persistently exciting) sequence of 2L-1 consecutive data points. Equivalently, given only 2L-2 consecutive data points, the channel can be uniquely identified up to a multiplicative constant. This paper significantly extends the identifiability criterion to the case when the known inputs are non-consecutively located. It is argued that by introducing 2L-1 non-consecutively spaced zeros into the input stream, for almost all input sequences, the channel can be uniquely identified up to a multiplicative constant. Furthermore, the result can be extended to the case when the known inputs are non-zero, in which case the channel can almost always be identified uniquely. To arrive at these results, general properties of systems of polynomial equations are derived. These properties do not seem to have appeared in the literature before.

The objective of this paper is to obtain minimum order input-output equations for a class of linear time-varying digital filters in state equation with constant dimension state vector. It is shown that the minimum order of the input-output equation may not be identical to the dimension of the state vector and there exists a nonunique solution for the minimum order input-output equation.