Reliable traffic violation detection is essential for improving road and pedestrian safety. Existing monocular vision-based methods often rely on pixel-level object representations, which limit spatial reasoning and real-world applicability. This paper presents an end-to-end, real-time traffic violation detection framework that operates in world coordinates, enabling spatially consistent violation analysis. The framework integrates transformer-based object detection with camera parameter estimation from image–world correspondences using a pinhole camera model, achieving a measurement error of approximately 20 cm and a speed estimation MAE of 0.467 m/s. The complete framework achieves 44 FPS, demonstrating practicality for real-time roadside monitoring.

Intelligent radio maps (IRMs) have emerged as a critical enabler for next-generation wireless networks, offering comprehensive spatiotemporal awareness of the electromagnetic environment with limited sensing resources and low computational overhead. They play a crucial role in enhancing spectrum efficiency, enabling intelligent resource allocation, supporting anti-jamming communications, improving interference management, and facilitating environment-aware networking. This paper presents a systematic overview of how to construct high-quality IRMs. We first introduce six evaluation metrics aligned with practical deployment requirements and evolving wireless network demands. Guided by these metrics and recent advances in artificial intelligence (AI), we provide an in-depth review of spectrum sensing approaches and state-of-the-art methods for spectrum inference. We further explore the intrinsic connections between these two steps and propose an integrated sensing–inference construction scheme. Extensive experiments demonstrate that the integrated scheme achieves superior IRM construction performance under sparse sensing, validating its practical potential for future wireless networks.

Effective urban traffic signal control in large-scale networks remains challenging due to complex interdependencies among intersections and unpredictable fluctuations in traffic conditions. To address these challenges, this paper proposes a novel Adaptive Hybrid Multi-Objective Optimization Algorithm with Reinforcement Learning (AHMOA-RL) for robust and scalable traffic signal management. The core innovation of AHMOA-RL lies in a hierarchical optimization framework that efficiently decomposes the problem into global region-level coordination and local intersection-level refinements, significantly reducing computational complexity while ensuring synchronized control across extensive urban networks. A Q-learning agent dynamically selects among multiple evolutionary operators—Genetic Algorithm, Differential Evolution, Particle Swarm Optimization, and Local Search—to strategically balance exploration and exploitation during optimization. Additionally, a memory-based evaluation mechanism leveraging historical data is integrated to smooth transient traffic anomalies and provide stable performance estimates. Extensive simulations on large-scale city networks inspired by Manhattan, Paris, São Paulo, and Istanbul demonstrate that AHMOA-RL consistently outperforms state-of-the-art methods, achieving substantial reductions in average vehicle delays, improved network stability, and enhanced robustness under diverse traffic conditions. The algorithm’s compact Pareto fronts and superior convergence characteristics validate its effectiveness for practical deployment in complex urban environments.

While coordination among multiple flying vehicles improves aerial logistics efficiency, safe and orderly operation requires robust detection and collision-avoidance capabilities. These requirements apply to passenger aircraft as well as to urban traffic and maritime environments, including emerging underwater flying vehicles. However, existing detection methods often fail under challenging conditions such as low illumination or cluttered backgrounds. Their progress is further constrained by the lack of large-scale benchmarks and the high computational and memory costs required to achieve high accuracy, which limits their deployment in resource-constrained scenarios, such as air-to-air collision avoidance in aerial vehicles. To address this gap, we introduce FT55k, an open-source benchmark comprising over 55,000 annotated RGB and infrared images across diverse environments. We further provide baseline approaches tailored for platforms with different computational demands. Extensive experiments on FT55k and three public datasets demonstrate the superior accuracy and efficiency of our methods compared with state-of-the-art approaches. Notably, our approach is the first flying vehicle detection method with a computational cost below 0.5 BFLOPs, achieving real-time performance at 62.3 FPS on an edge-computing device. This work presents the first comprehensive benchmark for flying vehicle detection in complex environments, establishing a practical and scalable foundation for future research and deployment in intelligent transportation safety. Our datasets is publicly accessible athttps://github.com/chriszxk/Flying-Vehicle-Detection

Designing effective incentive mechanisms in mobile crowdsensing (MCS) networks is crucial for engaging distributed mobile users (workers) to contribute heterogeneous data for various applications (tasks). In this paper, we propose a novel stagewise trading framework to achieve efficient and stable task-worker matching, explicitly accounting for task diversity (e.g., spatio-temporal limitations) and network dynamics inherent in MCS environments. This framework integrates both futures and spot trading stages. In the former, we introduce the futures trading-driven stable matching and pre-path-planning mechanism (FT-SMP3), which enables long-term taskworker assignment and pre-planning of workers' trajectories based on historical statistics and risk-aware analysis. In the latter, we develop the spot trading-driven DQN-based path planning and onsite worker recruitment mechanism (ST-DP2WR), which dynamically improves the practical utilities of tasks and workers by supporting real-time recruitment and path adjustment. We rigorously prove that the proposed mechanisms satisfy key economic and algorithmic properties, including stability, individual rationality, competitive equilibrium, and weak Pareto optimality. Extensive experiements further validate the effectiveness of our framework in realistic network settings, demonstrating superior performance in terms of service quality, computational efficiency, and decision-making overhead.

Federated Learning (FL) offers a pioneering distributed learning paradigm that enables devices/clients to build a shared global model that can be obtained through frequent model transmissions between clients and a central server, causing high latency, energy consumption, and congestion over backhaul links. To overcome these drawbacks, Hierarchical Federated Learning (HFL) has emerged, which organizes clients into multiple clusters and utilizes edge nodes (e.g., edge servers) for intermediate model aggregations between clients and the central server. Current research on HFL mainly focus on enhancing model accuracy, latency, and energy consumption in scenarios with a stable/fixed set of clients. However, addressing the dynamic availability of clients – a critical aspect of real-world scenarios – remains underexplored. This study delves into optimizing client selection and client-to-edge associations in HFL under intermittent client participation so as to minimize overall system costs (i.e., delay and energy), while achieving fast model convergence. We unveil that achieving this goal involves solving a complex NP-hard problem. To tackle this, we propose a stagewise methodology that splits the solution into two stages, referred to as Plan A and Plan B. Plan A focuses on identifying long-term clients with high chance of participation in subsequent model training rounds. Plan B serves as a backup, selecting alternative clients when long-term clients are unavailable during model training rounds. This stagewise methodology offers a fresh perspective on client selection that can enhance both HFL and conventional FL via enabling low-overhead decision-making processes. Through evaluations on diverse datasets, we show that our methodology outperforms existing benchmarks on crucial factors such as model accuracy and system costs.

Vehicular clouds (VCs) play a crucial role in the Internet-of-Vehicles (IoV) ecosystem by securing essential computing resources for a wide range of tasks. This paPertackles the intricacies of resource provisioning in dynamic VCs for computation-intensive tasks, represented by undirected graphs for parallel processing over multiple vehicles. We model the dynamics of VCs by considering multiple factors, including varying communication quality among vehicles, fluctuating computing capabilities of vehicles, uncertain contact duration among vehicles, and dynamic data exchange costs between vehicles. Our primary goal is to obtain feasible assignments between task components and nearby vehicles, calledtemplates, in a timely manner with minimized task completion time and data exchange overhead. To achieve this, wepropose ahybrid graphtaskscheduling (P-HTS) methodology that combines offline and online decision-making modes. For the offline mode, we introduce an approach called risk-aware pilot isomorphic subgraph searching (RA-PilotISS), which predicts feasible solutions for task scheduling in advance based on historical information. Then, for the online mode, we propose time-efficient instantaneous isomorphic subgraph searching (TE-InstaISS), serving as a backup approach for quickly identifying new optimal scheduling template when the one identified by RA-PilotISS becomes invalid due to changing conditions. Through comprehensive experiments, we demonstrate the superiority of our proposed hybrid mechanism compared to state-of-the-art methods in terms of various evaluative metrics, e.g., time efficiency such as the delay caused by seeking for possible templates and task completion time, as well as cost function, upon considering different VC scales and graph task topologies.

To facilitate responsive and cost-effective computing service delivery over edge networks, this paper investigates a novel two-stage double auction methodology via discovering an interesting idea of resource overbooking to overcome dynamic and uncertain nature of supply of edge servers (sellers) and demand generated from mobile devices (as buyers). The proposed auction integrates multiple essential goals such as maximizing social welfare as well as accelerating the decision-making process from both short-term and long-term perspectives (e.g., the time required to determine winning seller-buyer pairs), by introducing a stagewise strategy: an overbooking-driven pre-double auction (OPDAuction) for determining long-term cooperations between sellers and buyers before practical resource transactions as Stage I, and a real-time backup double auction (RBDAuction) for quickly coping with residual resource demands during actual transactions. In particular, by embedding a proper overbooking rate, OPDAuction helps with facilitating trading contracts between appropriate sellers and buyers as guidance for future transactions, by allowing the booked resources to exceed theoretical supply. Then, since pre-auctions may cause risks, our RBDAuction adjusts to real-time market changes, further enhancing the overall social welfare. More importantly, we offer an interesting view to show that our proposed two-stage auction can support significant design properties such as truthfulness, individual rationality, and budget balance. Extensive experiments demonstrate that our TwoSAuction achieves up to 76.8% reduction in decision-making time compared to conventional double auctions when considering 150 buyers and 25 sellers, while maintaining superior performance in social welfare and computational scalability over dynamic edge settings.

This article concerns the stochastic generalized Nash equilibrium problem (NEP) characterized by uncertain expected value cost functions and shared constraints. In a full-decision information setting, we develop a novel distributed stochastic reflected forward–backward (FB) algorithm, which requires that each agent has access to the others’ decisions. Considering that agents only know the decisions from their immediate neighbors, a distributed stochastic RFB (SRFB) algorithm under partial-decision information is proposed. By recasting the problem as a monotone inclusion problem, both algorithms almost surely converge to a stochastic generalized Nash equilibrium by combining the stochastic approximation scheme and the variance reduction scheme. Finally, the numerical experiment validates the feasibility of the proposed algorithms and confirms the correctness of the theory.

In various practical applications, collaborative inspection systems in which multiple agents work together to accomplish inspection tasks are becoming increasingly important for enhancing operational efficiency. This paper addresses the routing problem in multi-agent collaborative inspection systems, where certain inspection points require the simultaneous presence of multiple agents to perform inspection operations. A novel approach using max-plus algebra is presented to model the collaborative inspection process and it provides a foundation for research and applications in system control and scheduling optimization. The max-plus linear (MPL) model is then converted into a Mixed Integer Linear Programming (MILP) formulation to tackle the routing problem with complex constraints inherent in the collaborative scene. Experimental results validate that the proposed MPL model and MILP approach reduce inspection completion time and waiting time at collaborative points.

This paper proposes SANet, a small but accurate detector for aerial flying objects. The detector introduces an attention module into the feature extraction module (FEM) for enhancing the accuracy. This FEM with fewer convolutional kernel channels can reduce the parameters, speed up the inference time, and mitigate the computational burden. Furthermore, we optimize the Spatial Pyramid Pooling (SPP) module to enhance both the accuracy and speed. By analyzing the structure characteristic of the ResNet and RepVGG network that are usually utilized to extract features, a feature fusion module named RepNeck is designed to comprehensively fuse features extracted by the FEM, further enhancing the speed and accuracy. Eventually, we develop a neural network with an impressively small model size of only 4.5M. This network can achieve the state-of-the-art performance on three challenging datasets. Apart from its superior performance, our approach enjoys a real-time detection speed of 14.8 frames per second (fps) and power consumption of only 2.9W while the CPU and GPU temperatures are maintained below 50◦C even on an edge-computing device, highlighting the practicality of our approach for long-duration flying object detection and monitoring tasks.

Since autonomous driving (AD) is one of the most critical problems in the automobile industry, it has garnered the interest of many academics in recent years. An AD framework or a simulator is used to simulate autonomous vehicles (AVs), it can test modules that an AV needs. There are a large number of researchers studying specific AD simulation tasks, but few studies of systematic AD frameworks and simulators exist. This study distinguishes the functions of AD frameworks and simulators, and it makes a deep study of them, helping promote AV development for researchers, enterprises , and developers. This paper reviews open-source and commercial AD frameworks and simulators, introducing and comparing their features, functionalities, and so on. Additionally, we analyze current research on open-source AD frameworks and simulators according to different applied algorithms and hardware studies and discuss efforts to improve their simulation performance. In the last part, this paper proposes promising research fronts for AD frameworks and simulators for the near future from the viewpoints of hardware deficiencies, AD algorithms, scenario generation, vehicle-to-everything, safety and performance, and co-simulation.

Fingerprint-based indoor localization is one of the most promising solutions for various Intelligent Internet of Things (IIoT) systems. However, recent studies show that the key design challenges of current fingerprint-based localization techniques come from the following three aspects: 1) temporal variation caused by various patterns of IIoT device operations and stochastic fluctuation of wireless signals, 2) spatial unevenness of collected RSSI samples due to complex multi-floor environments, and 3) high feature sparsity of collected RSSI samples in large areas. To address these challenges, we present a localization architecture for multi-floor indoor localization in multi-building environment and accordingly propose a fingerprint-based localization method (referred to as GrowNetLoc) based on Gradient Boosting Neural Network (GrowNet) and Long Short-Term Memory (LSTM) network. Regarding building/floor identification, the gradient ensemble model GrowNet is utilized for extracting the mapping relationship between uneven RSSI samples and building/floor indices. Regarding location estimation, LSTM network is adopted as one layer of base learner to extract temporal features of RSSI samples, and a gradient boosting strategy is further used for overcoming the sample sparsity issue and improving the location estimation performance. Extensive experiments are conducted on real datasets and the results demonstrate that GrowNetLoc has superior localization accuracy and robustness performance compared with the existing methods.

Driver monitoring systems are becoming more common in modern cars, and they are crucial as autonomous vehicles depend on the driver’s continued attention. The increasing application of the deep learning techniques in in-car driver monitoring systems can be attributed to their success in estimating the human body position. In the 3-D human posture estimation, recent transformer-based methods have demonstrated remarkable effectiveness. However, as the number of joints increases, the computing cost to generate the joint-to-joint affinity matrix grows quadratically. To this end, this research develops a pretrained spatial-temporal transformer (PST-Transformer) model to facilitate the issue. In the pretrained phase, a masking module is used to randomly mask the joints. An autoencoder is employed to rebuild the distorted 2-D poses. During the training process, a temporal downsampling approach is advised to cut down on the duplicate data. To forecast the 3-D driving poses, an aggregator is paired with the fine tuned pretrained encoder. Prior to extracting 3-D spatial and temporal characteristics, the encoder in the PST-Transformer could learn the 2-D spatial-temporal relationships. To test the suggested approach, a new driving posture data set named human driving in vehicle (HDIV) is also created, which includes a variety of driving behaviors. Extensive experiments on the HDIV and the widely used Human3.6M data set show that our technique beats the state-of-the-art methods in terms of accuracy and computing complexity.

Large-scale multiobjective optimization problems (LSMOPs) continue to be challenging for existing multiobjective evolutionary algorithms (MOEAs). The main difficulties are that: 1) the diversity preservation in both the objective space and the decision space needs to be taken into account when solving LSMOPs and 2) the existing learning structures in current MOEAs usually make the learning operators only coincidentally serve convergence and diversity, leading to difficulties in balancing these two factors. Therefore, balancing convergence and diversity in current MOEAs is difficult. To address these issues, this article proposes a multiobjective particle swarm optimizer with enhanced balance of convergence and diversity (MPSO-EBCD). In MPSO-EBCD, a novel velocity update structure for multiobjective particle swarm optimization is put forward, dividing the convergence, and diversity preservation operations into independent components. Following the proposed update structure, a weighted convergence factor is introduced to serve the convergence strategy, whilst a diversity preservation strategy is built to uniformly distribute the particles in the searched space based on a proposed multidimensional local sparseness degree indicator. By this means, MPSO-EBCD is able to balance convergence and diversity with specific parameters in independent operators. Experimental results on LSMOP benchmarks and a voltage transformer optimization problem demonstrate the competitiveness of the proposed algorithm compared to several state-of-the-art MOEAs.

Communication has been seen as a significant bottleneck in industrial applications over large-scale networks. To alleviate the communication burden, sign-based optimization algorithms have gained popularity recently in both industrial and academic communities, which is shown to be closely related to adaptive gradient methods, such as Adam. Along this line, this article investigates faster convergence for a variant of sign-based gradient descent, called scaledsignGD, in three cases: First, the objective function is strongly convex; second, the objective function is nonconvex but satisfies the Polyak–Łojasiewicz inequality; third the gradient is stochastic, called scaledsignSGD in this case. For the first two cases, it can be shown that the scaledsignGD converges at a linear rate. For case third, the algorithm is shown to converge linearly to a neighborhood of the optimal value when a constant learning rate is employed, and the algorithm converges at a rate of$O(1/k+1/k^{2}+1/k^{3})$when using a diminishing learning rate, where$k$is the iteration number. The results are also extended to the distributed setting by majority vote in a parameter-server framework. Finally, numerical experiments are performed to corroborate the theoretical findings.

The misuse of drones can jeopardize public safety and privacy. The detection and catching of intruding drones are crucial and urgent issues to be investigated. This work proposes VDTNet, an accurate, lightweight, and fast network for visually detecting and tracking intruding drones. We first incorporate an SPP module into the first head of YOLOv4 to enhance detection accuracy. Model compression is utilized to shrink the model size and concurrently speed up inference. We then propose and insert an SPPS module and a ResNeck module into the neck, and introduce an effective attention module for the backbone to compensate for the accuracy drop brought on by compression. With the above strategies, we present the accurate and compact VDTNet with a model size of merely 3.9 MB, ensuring low computational cost and fast detection and tracking performance in real time. Extensive experiments on four challenging public datasets show that our proposed network outperforms state-of-the-art approaches. In real-world scenarios, the comparative ground-to-air detection testing proves the generalization ability of the VDTNet, and we further demonstrate the portability and practicability of the network by deploying it on drone onboard edge-computing devices for air-to-air real-time detection of the intruding drones.

Cloud-aidedmobileedgenetworks (CAMENs) allow edge servers (ESs) to purchase resources from remote cloud servers (CSs), while overcoming resource shortage when handling computation-intensive tasks of mobile users (MUs). Conventional trading mechanisms (e.g., onsite trading) confront many challenges, including decision-making overhead (e.g., latency) and potential trading failures. This paper investigates a series of cross-layer matching mechanisms to achieve stable and cost-effective resource provisioning across different layers (i.e., MUs, ESs, CSs), seamlessly integrated into a novel hybrid paradigm that incorporates futures and spot trading. In futures trading, we explore anoverbooking-drivenaforehandcross-layermatching (OA-CLM) mechanism, facilitating two future contract types: contract between MUs and ESs, and contract between ESs and CSs, while assessing potential risks under historical statistical analysis. In spot trading, we design two backup plans respond to current network/market conditions: determination on contractual MUs that should switch to local processing from edge/cloud services; and anonsitecross-layermatching (OS-CLM) mechanism that engages participants in real-time practical transactions. We next show that our matching mechanisms theoretically satisfy stability, individual rationality, competitive equilibrium, and weak Pareto optimality. Comprehensive simulations in real-world and numerical network settings confirm the corresponding efficacy, while revealing remarkable improvements in time/energy efficiency and social welfare.

In this brief, we aim to provide a distributed Nash equilibrium seeking algorithm in continuous time with discrete communications. A group of agents are considered playing a continuous-kernel noncooperative game over a network. The agents need to seek the Nash equilibrium when each player cannot get the overall action profiles in real time, rather are only able to get information from its networked neighbors. Meanwhile, a continuous-time dynamics is discussed for the players to update their variables, but the communications over the network are only assumed to allow at discrete-time instants, since continuous-time communications are prohibitive and cumbersome in practice. First, the periodic communication is considered at a fixed interval, and the solvability of Nash equilibrium seeking is shown with discrete communications. Then, an event-trigger communication scheme is proposed to further reduce the communication rounds. Nevertheless, the event-trigger communication scheme requires each player continuously monitoring its local states. To alleviate the monitoring burden, a periodic event detection mechanism is further developed. The exponential convergence of the dynamics with the three discrete communication schemes is proven. Finally, the comparative simulation studies are designed to illustrate the algorithm performance with different communication schemes and parameter settings.

We propose a lightweight, effective, and efficient anti-drone network, namely ADMNet, for visually detecting and monitoring unfriendly drones with a constrained view field, flying against a complex environment. We merge an SPP module to the first head of YOLOv4 to improve accuracy and perform network compression to reduce inference latency and model size. To compensate for the accuracy loss caused by condensation, we propose an SPPS module and a ResNeck module for the neck of the network and implement an effective attention module for the backbone. Eventually, we present an accurate and compact ADMNet with barely 3.9 MB, ensuring low computational cost and real-time detection. Our method achieves state-of-the-art performance on three challenging real-world datasets (Average Precision @0.5IoU): Det-Fly 96.2%, NPS-Drones 92.0%, and TIBNet 89.7%. The throughput is higher than the prior work, in addition to its superior performance. The comparative testing in real-world scenarios proves that our method exhibits strong reliability and generalization ability. Deploying the network on drone onboard edge-computing devices enables real-time detection and monitoring of flying drones, highlighting the portability and viability of the ADMNet.

Within the realm of distributed optimization, each node in the network possesses computational capabilities. Nodes perform local calculations on their own data, and by communicating local information (e.g., local gradients) with neighboring nodes, agents collectively achieve a globally optimal solution. In recent years, distributed optimization has garnered interest across diverse disciplines, particularly in situations where communication abilities are limited or data are private. In this paper, a distributed second-order algorithm, based on an augmented Lagrangian function, is proposed with an enhanced diffusion communication strategy. An R-linear convergence rate is established under a relaxed locally restricted strong convexity assumption, along with a widely employed L-smoothness assumption. Finally, the superiority of the algorithm is showcased by a distributed logistic regression example utilizing a synthetic dataset with various parameter settings.

The theory of criticality has been applied exploratively to the industry in recent years since complex systems in critical states often have a high degree of uncertainty. As a first step towards examining the evolutionary process in complex manufacturing systems, this paper verifies that the self-organized criticality theory also exists in complex manufacturing systems. Based on six real production lines in Shanghai, a semiconductor manufacturing system model is constructed, which serves as the verification object. Several preprocessing techniques are used to prepare the simulation results, including principal component analysis and Pearson correlation coefficients method. An analysis of the manufacturing system based on mathematical derivation and statistical analysis confirms the phenomenon of self-organized criticality. In addition, the results of the experiments demonstrate that the theory of self-organized criticality is applicable to complex manufacturing systems as well.

In this work, we design a distributed algorithm for time-varying convex optimization over networks with quantized communications. Each agent has its local time-varying objective function, while the agents need to cooperatively track the optimal solution trajectories of global time-varying functions. The distributed algorithm is motivated by the alternating direction method of multipliers, but the agents can only share quantization information through an undirected graph. To reduce the tracking error due to information loss in quantization, we apply the dynamic quantization scheme with a decaying scaling function. The tracking error is explicitly characterized with respect to the limit of the decaying scaling function in quantization. Furthermore, we are able to show that the algorithm could asymptotically track the optimal solution when time-varying functions converge, even with quantization information loss. Finally, the theoretical results are validated via numerical simulation.

In visual recognition tasks, few-shot learning requires the ability to learn object categories with few support examples. Its re-popularity in light of the deep learning development is mainly in image classification. This work focuses on few-shot semantic segmentation, which is still a largely unexplored field. A few recent advances are often restricted to single-class few-shot segmentation. In this paper, we first present a novel multi-way (class) encoding and decoding architecture which effectively fuses multi-scale query information and multi-class support information into one query-support embedding. Multi-class segmentation is directly decoded upon this embedding. For better feature fusion, a multi-level attention mechanism is proposed within the architecture, which includes the attention for support feature modulation and attention for multi-scale combination. Last, to enhance the embedding space learning, an additional pixel-wise metric learning module is introduced with triplet loss formulated on the pixel-level of the query-support embedding. Extensive experiments on standard benchmarks PASCAL-$5^{i}$and COCO-$20^{i}$show clear benefits of our method over the state of the art in multi-class few-shot segmentation.

Surrogate-assisted evolutionary algorithms (EAs) have been intensively used to solve computationally expensive problems with some success. However, traditional EAs are not suitable to deal with high-dimensional expensive problems (HEPs) with high-dimensional search space even if their fitness evaluations are assisted by surrogate models. The recently proposed autoencoder-embedded evolutionary optimization (AEO) framework is highly appropriate to deal with high-dimensional problems. This work aims to incorporate surrogate models into it to further boost its performance, thus resulting in surrogate-assisted AEO (SAEO). It proposes a novel model management strategy that can guarantee reasonable amounts of re-evaluations; hence, the accuracy of surrogate models can be enhanced via being updated with new evaluated samples. Moreover, to ensure enough data samples before constructing surrogates, a problem-dimensionality-dependent activation condition is developed for incorporating surrogates into the SAEO framework. SAEO is tested on seven commonly used benchmark functions and compared with state-of-the-art algorithms for HEPs. The experimental results show that SAEO can further enhance the performance of AEO on most cases and SAEO performs significantly better than other algorithms. Therefore, SAEO has great potential to deal with HEPs.

Optimal energy management of smart grids requires the information exchange between devices, which may disclose private information to the adversaries and further lead to great losses. To this end, this article considers the privacy-preserving optimal energy management problem for smart grids, which integrates both the power allocation of distributed energy resources on the supply side and the demand response of distributed load demands on the demand side. We first propose a cloud-edge computing structure of the smart grid and model the optimal energy management problem as the maximization problem of social welfare including the supply-side net benefit and the demand-side net utility, while maintaining the supply–demand balance and satisfying the operating constraints. A privacy-preserving average consensus algorithm is then developed, where each node sends the projected states to their neighbors to protect the privacy of the initial state. By applying the privacy-preserving average consensus algorithm, we propose a distributed privacy-preserving optimal energy management algorithm based on the generalized alternating direction method of multipliers. Finally, simulation examples are provided to validate the effectiveness of the proposed algorithms.

Due to the growing awareness of driving safety and the development of sophisticated technologies, advanced driving/driver assistance system (ADAS) has been equipped in more and more vehicles with higher accuracy and lower price. The latest progress in this field has called for a review to sum up the conventional knowledge of ADAS, the state-of-the-art researches, novel applications and standards in real world. With the help of this kind of review, newcomers in this field can get basic knowledge easier and other researchers may be inspired with potential future development possibility. This paper makes a general introduction about ADAS by analyzing its hardware support, computation algorithms and current development state. Different types of perception sensors are introduced from their interior feature classifications, installation positions, supporting ADAS functions, and pros and cons. The comparisons between different sensors are concluded and illustrated from their inherent characters and specific usages serving for each ADAS function. The current algorithms for ADAS functions are also collected and briefly presented in this paper from both traditional methods and novel ideas. Additionally, discussions about current regulations and market state of ADAS in China are reviewed in this paper, and other open issues related to ADAS are also introduced in particular.

Abstract Industrial Internet of Things (IIoT) is performed based on the multiple sourced data collection, communication, management and analysis from the industrial environment. The data can be generated at every point in the manufacturing production process by real-time monitoring, connection and interaction in the industrial field through various data sensing devices, which creates a big data environment for the industry. To collect, transfer, store and analyse such a big data efficiently and economically, several challenges have imposed to the conventional big data solution, such as high unreliable latency, massive energy consumption, and inadequate security. In order to address these issues, edge computing, as an emerging technique, has been researched and developed in different industries. This paper aims to propose a novel framework for the intelligent IIoT, named Industrial Internet of Learning (IIoL). It is built using an industrial wireless communication network called Low-power wide-area network (LPWAN). By applying edge computing technologies in the LPWAN, the high-intensity computing load is distributed to edge sides, which integrates the computing resource of edge devices to lighten the computational complexity in the central. It cannot only reduce the energy consumption of processing and storing big data but also low the risk of cyber-attacks. Additionally, in the proposed framework, the information and knowledge are discovered and generated from different parts of the system, including smart sensors, smart gateways and cloud. Under this framework, a pervasive knowledge network can be established to improve all the devices in the system. Finally, the proposed concept and framework were validated by two real industrial cases, which were the health prognosis and management of a water plant and asset monitoring and management of an automobile factory.

In this paper we focus on the dynamic state estimation which harnesses a vast amount of sensing data harvested by multiple parties and recognize that in many applications, to improve collaborations between parties, the estimation procedure must be designed with the awareness of protecting participants' data and model privacy, where the latter refers to the privacy of key parameters of observation models. We develop a state estimation paradigm for the scenario where multiple parties with data and model privacy concerns are involved. Multiple parties monitor a physical dynamic process by deploying their own sensor networks and update the state estimate according to the average state estimate of all the parties calculated by a cloud server and security module. The paradigm taps additively homomorphic encryption which enables the cloud server and security module to jointly fuse parties' data while preserving the data privacy. Meanwhile, all the parties collaboratively develop a stable (or optimal) fusion rule without divulging sensitive model information. For the proposed filtering paradigm, we analyze the stabilization and the optimality. First, to stabilize the multi-party state estimator while preserving observation model privacy, two stabilization design methods are proposed. For special scenarios, the parties directly design their estimator gains by the matrix norm relaxation. For general scenarios, after transforming the original design problem into a convex semi-definite programming problem, the parties collaboratively derive suitable estimator gains based on the alternating direction method of multipliers (ADMM). Second, an optimal collaborative gain design method with model privacy guarantees is provided, which results in the asymptotic minimum mean square error (MMSE) state estimation. Finally, numerical examples are presented to illustrate our design and theoretical findings.

This paper presents a DNN bottleneck reinforcement scheme to alleviate the vulnerability of Deep Neural Networks (DNN) against adversarial attacks. Typical DNN classifiers encode the input image into a compressed latent representation more suitable for inference.This information bottleneck makes a trade-off between the image-specific structure and class-specific information in an image. By reinforcing the former while maintaining the latter, any redundant information, be it adversarial or not, should be removed from the latent representation. Hence, this paper proposes to jointly train an auto-encoder (AE) sharing the same encoding weights with the visual classifier. In order to reinforce the information bottleneck,we introduce the multi-scale low-pass objective and multi-scale high-frequency communication for better frequency steering in the network. Unlike existing approaches, our scheme is the first reforming defense per se which keeps the classifier structure untouched without appending any pre-processing head and is trained with clean images only. Extensive experiments on MNIST, CIFAR-10 and ImageNet demonstrate the strong defense of our method againstvarious adversarial attacks.

Many ever-increasingly complex engineering optimization problems fall into the class of High-dimensional Expensive Problems (HEPs), where fitness evaluations are very time-consuming. It is extremely challenging and difficult to produce promising solutions in high-dimensional search space. In this paper, an Autoencoder-embedded Evolutionary Optimization (AEO) framework is proposed for the first time. As an efficient dimension reduction tool, an autoencoder is used to compress high-dimensional landscape to informative low-dimensional space. The search operation in this low-dimensional space can facilitate the population converge towards the optima more efficiently. To balance the exploration and exploitation ability during optimization, two sub-populations coevolve in a distributed fashion, where one is assisted by an autoencoder and the other undergoes a regular evolutionary process. The information between these two sub-populations are dynamically exchanged. The proposed algorithm is validated by testing several 200 dimensional benchmark functions. Compared with the state-of-art algorithms for HEPs, AEO shows extraordinarily high efficiency for these challenging problems.

Fuzzy c‐means algorithms have been widely utilised in several areas such as image segmentation, pattern recognition and data mining. However, the related studies showed the limitations in facing imbalanced datasets. The maximum fuzzy boundary tends to be located on the largest cluster which is not desirable. The overall fuzzy partition results in false grouping of edge objects and weakens the compactness of cluster. It is important the clusters are delineated by the maximum fuzzy boundary. In this study, a semi‐fuzzy c‐means algorithm is proposed by combining hard partition and soft partition. This study aims to provide an effective partition for the edge objects, such that the compactness of cluster can be improved. The proposed algorithm integrates the semi‐fuzzy c‐means method with the size‐insensitive integrity‐based fuzzy c‐means algorithm. In particular, the latter algorithm has the ability to deal with imbalanced data. With the experiment validation, the proposed algorithm is robust and outperforms the two component algorithms by using synthetic and widely known benchmark datasets.

Decomposition of a multiobjective optimization problem (MOP) into several simple multiobjective subproblems, named multiobjective evolutionary algorithm based on decomposition (MOEA/D)-M2M, is a new version of multiobjective optimization-based decomposition. However, it fails to consider different contributions from each subproblem but treats them equally instead. This paper proposes a collaborative resource allocation (CRA) strategy for MOEA/D-M2M, named MOEA/D-CRA. It allocates computational resources dynamically to subproblems based on their contributions. In addition, an external archive is utilized to obtain the collaborative information about contributions during a search process. Experimental results indicate that MOEA/D-CRA outperforms its peers on 61% of the test cases in terms of three metrics, thereby validating the effectiveness of the proposed CRA strategy in solving MOPs.

Uncertainty in semiconductor fabrication facilities (fabs) requires scheduling methods to attain quick real-time responses. They should be well tuned to track the changes of a production environment to obtain better operational performance. This paper presents an adaptive dispatching rule (ADR) whose parameters are determined dynamically by real-time information relevant to scheduling. First, we introduce the workflow of ADR that considers both batch and non-batch processing machines to obtain improved fab-wide performance. It makes use of such information as due date of a job, workload of a machine, and occupation time of a job on a machine. Then, we use a backward propagation neural network (BPNN) and a particle swarm optimization (PSO) algorithm to find the relations between weighting parameters and real-time state information to adapt these parameters dynamically to the environment. Finally, a real fab simulation model is used to demonstrate the proposed method. The simulation results show that ADR with constant weighting parameters outperforms the conventional dispatching rule on average; ADR with changing parameters tracking real-time production information over time is more robust than ADR with constant ones; and further improvements can be obtained by optimizing the weights and threshold values of BPNN with a PSO algorithm.

As one of the most complicated manufacturing processes, semiconductor manufacturing consists of four steps, wafer sort, wafer fabrication, assembly, and testing. Among them, wafer fabrication is the most costly, complex, and time consuming step. Its operation management and optimization are challenging modeling and scheduling researchers. To address its modeling issue, a hierarchical colored timed Petri net (HCTPN) is proposed, which can be used to describe various states, behavior and substructures of a wafer fabrication system. To address its scheduling issue, intelligent algorithms are introduced to the proposed HCTPN. An extended genetic algorithm (EGA) embedded scheduling strategy over HCTPN is studied to optimize the combination of scheduling policies. The combined approach can conduct more efficient search with better scheduling performance. At last, a real case is presented to illustrate the results. Based on comparing simulation results of different scheduling strategies, the HCTPN and EGA combined scheduling is proved to be valid and efficient.

A memetic algorithm MCLPSO based on the comprehensive learning PSO (CLPSO) is presented in this study. In MCLPSO, a chaotic local search operator is used and a Simulated Annealing (SA) based local search strategy is developed by combining the cognition-only PSO model with SA. The memetic scheme can enable the stagnant particles which cannot be improved by the comprehensive learning strategy to escape from the local optima and enable some elite particles to give fine-grained local search around the promising regions. The experimental result demonstrates a good performance of MCLPSO in optimizing the multimodal functions compared with some other variants of PSO including CLPSO.

Semiconductor manufacturing is considered as one of the most complex manufacturing process. Due to its large-scale, uncertainty, reentrance and mixed processing, it needs true dynamic scheduling method urgently. On the analysis of the self-organizing activities of ant colony system, the pheromone based dynamic scheduling rule is presented. The rule is simulated and the result analysis is given by comparing with other heuristic scheduling methods, which show that this method can optimize multi objectives of the semiconductor fabrication line and has a good perspective.

Semiconductor wafer fab cries for really dynamic dispatching approach, due to its high uncertainty, re-entrance and large-scale. A dispatching rule for improving on-time delivery for semiconductor wafer fab (ODDR) is proposed, which considers the dispatching of bottleneck machines, not-bottleneck machines, batching machines and hot lots. As a result, it can distinctly improve on-time delivery without decreasing the throughput and increasing the cycle time. Finally, a simplistic model, but with essential characteristics of semiconductor wafer fab, is used to compare ODDR with FIFO, EDD and CR. It can be seen from the experimental results that ODDR is prior to FIFO, EDD and CR on throughput, cycle time and on-time delivery with better performance, especially for on-time delivery.