A Time-Domain Numerical Simulation for Free Motion Responses of Two Ships Advancing in Head Waves

The constant panel method within the framework of potential flow theory in the time domain is developed for solving the hydrodynamic interactions between two parallel ships with forward speed.When solving problems within a time domain framework,the free water surface needs to simultaneously satisfy both the kinematic and dynamic boundary conditions of the free water surface.This provides conditions for adding artificial damping layers.Using the Runge−Kutta method to solve equations related to time.An upwind differential scheme is used in the present method to deal with the convection terms on the free surface to prevent waves upstream.Through the comparison with the available experimental data and other numerical methods,the present method is proved to have good mesh convergence,and satisfactory results can be obtained.The constant panel method is applied to calculate the hydrodynamic interaction responses of two parallel ships advancing in head waves.Numerical simulations are conducted on the effects of forward speed,different longitudinal and lateral distances on the motion response of two modified Wigley ships in head waves.Then further investigations are conducted on the effects of different ship types on the motion response.

Bilevel Optimal Infrastructure Planning Method for the Inland Battery Swapping Stations and Battery-Powered Ships

Green shipping and electrification have been the main topics in the shipping industry.In this process,the pure battery-powered ship is developed,which is zero-emission and well-suited for inland shipping.Currently,battery swapping stations and ships are being explored since battery charging ships may not be feasible for inland long-distance trips.However,improper infrastructure planning for battery swapping stations and ships will increase costs and decrease operation efficiency.Therefore,a bilevel optimal infrastructure planning method is proposed in this paper for battery swapping stations and ships.First,the energy consumption model for the battery swapping ship is established considering the influence of the sailing environment.Second,a bilevel optimization model is proposed to minimize the total cost.Specifically,the battery swapping station(BSS)location problem is investigated at the upper level.The optimization of battery size in each battery swapping station and ship and battery swapping scheme are studied at the lower level based on speed and energy optimization.Finally,the bilevel self-adaptive differential evolution algorithm(BlSaDE)is proposed to solve this problem.The simulation results show that total cost could be reduced by 5.9%compared to the original results,and the effectiveness of the proposed method is confirmed.

Stage at diagnosis of colorectal cancer through diagnostic route:Who should be screened?

BACKGROUND Colorectal cancer(CRC)is a global health concern,with advanced-stage diagnoses contributing to poor prognoses.The efficacy of CRC screening has been well-established;nevertheless,a significant proportion of patients remain unscreened,with>70%of cases diagnosed outside screening.Although identifying specific subgroups for whom CRC screening should be particularly recommended is crucial owing to limited resources,the association between the diagnostic routes and identification of these subgroups has been less appreciated.In the Japanese cancer registry,the diagnostic routes for groups discovered outside of screening are primarily categorized into those with comorbidities found during hospital visits and those with CRC-related symptoms.AIM To clarify the stage at CRC diagnosis based on diagnostic routes.METHODS We conducted a retrospective observational study using a cancer registry of patients with CRC between January 2016 and December 2019 at two hospitals.The diagnostic routes were primarily classified into three groups:Cancer screening,follow-up,and symptomatic.The early-stage was defined as Stages 0 or I.Multivariate and univariate logistic regressions were exploited to determine the odds of early-stage diagnosis in the symptomatic and cancer screening groups,referencing the follow-up group.The adjusted covariates were age,sex,and tumor location.RESULTS Of the 2083 patients,715(34.4%),1064(51.1%),and 304(14.6%)belonged to the follow-up,symptomatic,and cancer screening groups,respectively.Among the 2083 patients,CRCs diagnosed at an early stage were 57.3%(410 of 715),23.9%(254 of 1064),and 59.5%(181 of 304)in the follow-up,symptomatic,and cancer screening groups,respectively.The symptomatic group exhibited a lower likelihood of early-stage diagnosis than the follow-up group[P<0.001,adjusted odds ratio(aOR),0.23;95%confidence interval(95%CI):0.19-0.29].The likelihood of diagnosis at an early stage was similar between the follow-up and cancer screening groups(P=0.493,aOR for early-stage diagnosis in the cancer screening group vs follow-up group=1.11;95%CI=0.82-1.49).CONCLUSION CRCs detected during hospital visits for comorbidities were diagnosed earlier,similar to cancer screening.CRC screening should be recommended,particularly for patients without periodical hospital visits for comorbidities.

Ship Weather Routing Based on Hybrid Genetic Algorithm Under Complicated Sea Conditions

Considering the effects of increased economic globalization and global warming,developing methods for reducing shipping costs and greenhouse gas emissions in ocean transportation has become crucial.Owing to its key role in modern navigation technology,ship weather routing is the research focus of several scholars in this field.This study presents a hybrid genetic algorithm for the design of an optimal ship route for safe transoceanic navigation under complicated sea conditions.On the basis of the basic genetic algorithm,simulated annealing algorithm is introduced to enhance its local search ability and avoid premature convergence,with the ship’s voyage time and fuel consumption as optimization goals.Then,a mathematical model of ship weather routing is developed based on the grid system.A measure of fitness calibration is proposed,which can change the selection pressure of the algorithm as the population evolves.In addition,a hybrid crossover operator is proposed to enhance the ability to find the optimal solution and accelerate the convergence speed of the algorithm.Finally,a multi-population technique is applied to improve the robustness of the algorithm using different evolutionary strategies.

Ship-YOLOv8:一种轻量级高分辨遥感图像船舶细粒度检测算法

针对高分辨率影像的船舶细粒度目标检测分类任务中类内差异大、类间相似性高、物体和场景的尺度变化范围大、特征提取困难、样本小等特点,提出了一种基于YOLOv8为基础的改进算法。首先,在骨干网络中引入SimAM注意力机制,使得模型在复杂背景中更加聚焦船舶对象;其次,在颈部引入SPD-Conv模块,改善复杂背景下船舶尺度变化大和小目标检测的问题;最后针对细粒度船舶目标检测的特点,替换Mish激活函数和Focal-Loss损失函数,加快模型收敛,提高模型精度。经对比实验可知,改进的算法在保证检测速度和模型参数量的同时,在FAIR1M_Ship数据集取得了94.49%的检测精度,与目前流行的目标检测算法相比,在检测精度上有一定的提升。

Multi-Objective Weather Routing Algorithm for Ships Based on Hybrid Particle Swarm Optimization

Maritime transportation has become an important part of the international trade system.To promote its sustainable de-velopment,it is necessary to reduce the fuel consumption of ships,decrease navigation risks,and shorten the navigation time.Ac-cordingly,planning a multi-objective route for ships is an effective way to achieve these goals.In this paper,we propose a multi-ob-jective optimal ship weather routing system framework.Based on this framework,a ship route model,ship fuel consumption model,and navigation risk model are established,and a non-dominated sorting and multi-objective ship weather routing algorithm based on particle swarm optimization is proposed.To fasten the convergence of the algorithm and improve the diversity of route solutions,a mutation operation and an elite selection operation are introduced in the algorithm.Based on the Pareto optimal front and Pareto optimal solution set obtained by the algorithm,a recommended route selection criterion is designed.Finally,two sets of simulated navigation simulation experiments on a container ship are conducted.The experimental results show that the proposed multi-objective optimal weather routing system can be used to plan a ship route with low navigation risk,short navigation time,and low fuel consumption,fulfilling the safety,efficiency,and economic goals.

Multipoint Heave Motion Prediction Method for Ships Based on the PSO-TGCN Model

During ship operations,frequent heave movements can pose significant challenges to the overall safety of the ship and completion of cargo loading.The existing heave compensation systems suffer from issues such as dead zones and control system time lags,which necessitate the development of reasonable prediction models for ship heave movements.In this paper,a novel model based on a time graph convolutional neural network algorithm and particle swarm optimization algorithm(PSO-TGCN)is proposed for the first time to predict the multipoint heave movements of ships under different sea conditions.To enhance the dataset's suitability for training and reduce interference,various filter algorithms are employed to optimize the dataset.The training process utilizes simulated heave data under different sea conditions and measured heave data from multiple points.The results show that the PSO-TGCN model predicts the ship swaying motion in different sea states after 2 s with 84.7%accuracy,while predicting the swaying motion in three different positions.By performing a comparative study,it was also found that the present method achieves better performance that other popular methods.This model can provide technical support for intelligent ship control,improve the control accuracy of intelligent ships,and promote the development of intelligent ships.

Review on the Progress and Issues in Liquid Tank Sloshing of Ships

With the development of large liquid cargo ships,liquid tank sloshing has gradually become a hot research topic in the area of shipping and ocean Engineering.Liquid tank sloshing,characterized by strong nonlinearity and randomness,not only affects the stability of the ship but also generates a huge impact force on the wall of the tank.To further investigate liquid tank sloshing,a comprehensive review is given on the research process of the most focused subjects of liquid sloshing.Summarizing the existing research will help to identify issues in the current field and provide useful references.The methods for investigating sloshing,the research progress and the situations worldwide are discussed.The advantages and defects of experiments and numerical simulations are also explored.The problems which need to be explored in the future are subsequently proposed.

Deep Neural Network Based Detection and Segmentation of Ships for Maritime Surveillance

In recent years,computer visionfinds wide applications in maritime surveillance with its sophisticated algorithms and advanced architecture.Auto-matic ship detection with computer vision techniques provide an efficient means to monitor as well as track ships in water bodies.Waterways being an important medium of transport require continuous monitoring for protection of national security.The remote sensing satellite images of ships in harbours and water bodies are the image data that aid the neural network models to localize ships and to facilitate early identification of possible threats at sea.This paper proposes a deep learning based model capable enough to classify between ships and no-ships as well as to localize ships in the original images using bounding box tech-nique.Furthermore,classified ships are again segmented with deep learning based auto-encoder model.The proposed model,in terms of classification,provides suc-cessful results generating 99.5%and 99.2%validation and training accuracy respectively.The auto-encoder model also produces 85.1%and 84.2%validation and training accuracies.Moreover the IoU metric of the segmented images is found to be of 0.77 value.The experimental results reveal that the model is accu-rate and can be implemented for automatic ship detection in water bodies consid-ering remote sensing satellite images as input to the computer vision system.

MTCR-CR Routing Strategy for Connection-Oriented Routing over Satellite Networks

The high-speed movement of satellites makes it not feasible to directly apply the mature routing scheme on the ground to the satellite network.DT-DVTR in the snapshot-based connectionoriented routing strategy is one of the representative solutions,but it still has room for improvement in terms of routing stability.In this paper,we propose an improved scheme for connection-oriented routing strategy named the Minimal Topology Change Routing based on Collaborative Rules(MTCR-CR).The MTCR-CR uses continuous time static topology snapshots based on satellite status to search for intersatellite link(ISL)construction solutions that meet the minimum number of topology changes to avoid route oscillations.The simulation results in Beidou-3 show that compared with DT-DVTR,MTCR-CR reduces the number of routing changes by about 92%,the number of path changes caused by routing changes is about38%,and the rerouting time is reduced by approximately 47%.At the same time,in order to show our algorithm more comprehensively,the same experimental index test was also carried out on the Globalstar satellite constellation.

Efficient Route Planning for Real-Time Demand-Responsive Transit

Demand Responsive Transit (DRT) responds to the dynamic users’ requests without any fixed routes and timetablesand determines the stop and the start according to the demands. This study explores the optimization of dynamicvehicle scheduling and real-time route planning in urban public transportation systems, with a focus on busservices. It addresses the limitations of current shared mobility routing algorithms, which are primarily designedfor simpler, single origin/destination scenarios, and do not meet the complex demands of bus transit systems. Theresearch introduces an route planning algorithm designed to dynamically accommodate passenger travel needsand enable real-time route modifications. Unlike traditional methods, this algorithm leverages a queue-based,multi-objective heuristic A∗ approach, offering a solution to the inflexibility and limited coverage of suburbanbus routes. Also, this study conducts a comparative analysis of the proposed algorithm with solutions based onGenetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), focusing on calculation time, routelength, passenger waiting time, boarding time, and detour rate. The findings demonstrate that the proposedalgorithmsignificantly enhances route planning speed, achieving an 80–100-fold increase in efficiency over existingmodels, thereby supporting the real-time demands of Demand-Responsive Transportation (DRT) systems. Thestudy concludes that this algorithm not only optimizes route planning in bus transit but also presents a scalablesolution for improving urban mobility.

CoopAI-Route: DRL Empowered Multi-Agent Cooperative System for Efficient QoS-Aware Routing for Network Slicing in Multi-Domain SDN

The emergence of beyond 5G networks has the potential for seamless and intelligent connectivity on a global scale.Network slicing is crucial in delivering services for different,demanding vertical applications in this context.Next-generation applications have time-sensitive requirements and depend on the most efficient routing path to ensure packets reach their intended destinations.However,the existing IP(Internet Protocol)over a multi-domain network faces challenges in enforcing network slicing due to minimal collaboration and information sharing among network operators.Conventional inter-domain routing methods,like Border Gateway Protocol(BGP),cannot make routing decisions based on performance,which frequently results in traffic flowing across congested paths that are never optimal.To address these issues,we propose CoopAI-Route,a multi-agent cooperative deep reinforcement learning(DRL)system utilizing hierarchical software-defined networks(SDN).This framework enforces network slicing in multi-domain networks and cooperative communication with various administrators to find performance-based routes in intra-and inter-domain.CoopAI-Route employs the Distributed Global Topology(DGT)algorithm to define inter-domain Quality of Service(QoS)paths.CoopAI-Route uses a DRL agent with a message-passing multi-agent Twin-Delayed Deep Deterministic Policy Gradient method to ensure optimal end-to-end routes adapted to the specific requirements of network slicing applications.Our evaluation demonstrates CoopAI-Route’s commendable performance in scalability,link failure handling,and adaptability to evolving topologies compared to state-of-the-art methods.

Enhancing Network Design through Statistical Evaluation of MANET Routing Protocols

This paper contributes a sophisticated statistical method for the assessment of performance in routing protocols salient Mobile Ad Hoc Network(MANET)routing protocols:Destination Sequenced Distance Vector(DSDV),Ad hoc On-Demand Distance Vector(AODV),Dynamic Source Routing(DSR),and Zone Routing Protocol(ZRP).In this paper,the evaluation will be carried out using complete sets of statistical tests such as Kruskal-Wallis,Mann-Whitney,and Friedman.It articulates a systematic evaluation of how the performance of the previous protocols varies with the number of nodes and the mobility patterns.The study is premised upon the Quality of Service(QoS)metrics of throughput,packet delivery ratio,and end-to-end delay to gain an adequate understanding of the operational efficiency of each protocol under different network scenarios.The findings explained significant differences in the performance of different routing protocols;as a result,decisions for the selection and optimization of routing protocols can be taken effectively according to different network requirements.This paper is a step forward in the general understanding of the routing dynamics of MANETs and contributes significantly to the strategic deployment of robust and efficient network infrastructures.

Dynamic Routing of Multiple QoS-Required Flows in Cloud-Edge Autonomous Multi-Domain Data Center Networks

The 6th generation mobile networks(6G)network is a kind of multi-network interconnection and multi-scenario coexistence network,where multiple network domains break the original fixed boundaries to form connections and convergence.In this paper,with the optimization objective of maximizing network utility while ensuring flows performance-centric weighted fairness,this paper designs a reinforcement learning-based cloud-edge autonomous multi-domain data center network architecture that achieves single-domain autonomy and multi-domain collaboration.Due to the conflict between the utility of different flows,the bandwidth fairness allocation problem for various types of flows is formulated by considering different defined reward functions.Regarding the tradeoff between fairness and utility,this paper deals with the corresponding reward functions for the cases where the flows undergo abrupt changes and smooth changes in the flows.In addition,to accommodate the Quality of Service(QoS)requirements for multiple types of flows,this paper proposes a multi-domain autonomous routing algorithm called LSTM+MADDPG.Introducing a Long Short-Term Memory(LSTM)layer in the actor and critic networks,more information about temporal continuity is added,further enhancing the adaptive ability changes in the dynamic network environment.The LSTM+MADDPG algorithm is compared with the latest reinforcement learning algorithm by conducting experiments on real network topology and traffic traces,and the experimental results show that LSTM+MADDPG improves the delay convergence speed by 14.6%and delays the start moment of packet loss by 18.2%compared with other algorithms.

Frequency-tunable single-photon router based on a microresonator containing a driven three-level emitter

We propose a frequency-tunable router of single photons with high routing efficiency, which is constructed by two waveguides mediately linked by a single-mode whispering gallery resonator with a driven three-level emitter. Quantum routing probability in the output port is obtained via the real-space Hamiltonian. By adjusting the resonator–emitter coupling and the drive, the desired continuous central frequencies for the resonance peaks of routing photons can be manipulated nearly linearly, with the assistance of Rabi splitting effect and optical Stark shift. The proposed routing system may provide potential applications in designing other frequency-modulation quantum optical devices, such as multiplexers,filters, and so on.

Unmanned Ship Identification Based on Improved YOLOv8s Algorithm

Aiming at defects such as low contrast in infrared ship images,uneven distribution of ship size,and lack of texture details,which will lead to unmanned ship leakage misdetection and slow detection,this paper proposes an infrared ship detection model based on the improved YOLOv8 algorithm(R_YOLO).The algorithm incorporates the Efficient Multi-Scale Attention mechanism(EMA),the efficient Reparameterized Generalized-feature extraction module(CSPStage),the small target detection header,the Repulsion Loss function,and the context aggregation block(CABlock),which are designed to improve the model’s ability to detect targets at multiple scales and the speed of model inference.The algorithm is validated in detail on two vessel datasets.The comprehensive experimental results demonstrate that,in the infrared dataset,the YOLOv8s algorithm exhibits improvements in various performance metrics.Specifically,compared to the baseline algorithm,there is a 3.1%increase in mean average precision at a threshold of 0.5(mAP(0.5)),a 5.4%increase in recall rate,and a 2.2%increase in mAP(0.5:0.95).Simultaneously,while less than 5 times parameters,the mAP(0.5)and frames per second(FPS)exhibit an increase of 1.7%and more than 3 times,respectively,compared to the CAA_YOLO algorithm.Finally,the evaluation indexes on the visible light data set have shown an average improvement of 4.5%.

An Energy-Efficient Routing Algorithm for UAV Formation Based on Time-Aggregated Graph

The limited energy and high mobility of unmanned aerial vehicles(UAVs)lead to drastic topology changes in UAV formation.The existing routing protocols necessitate a large number of messages for route discovery and maintenance,greatly increasing network delay and control overhead.A energyefficient routing method based on the discrete timeaggregated graph(TAG)theory is proposed since UAV formation is a defined time-varying network.The network is characterized using the TAG,which utilizes the prior knowledge in UAV formation.An energyefficient routing algorithm is designed based on TAG,considering the link delay,relative mobility,and residual energy of UAVs.The routing path is determined with global network information before requesting communication.Simulation results demonstrate that the routing method can improve the end-to-end delay,packet delivery ratio,routing control overhead,and residual energy.Consequently,introducing timevarying graphs to design routing algorithms is more effective for UAV formation.

Efficient Ship:A Hybrid Deep Learning Framework for Ship Detection in the River

Optical image-based ship detection can ensure the safety of ships and promote the orderly management of ships in offshore waters.Current deep learning researches on optical image-based ship detection mainly focus on improving one-stage detectors for real-time ship detection but sacrifices the accuracy of detection.To solve this problem,we present a hybrid ship detection framework which is named EfficientShip in this paper.The core parts of the EfficientShip are DLA-backboned object location(DBOL)and CascadeRCNN-guided object classification(CROC).The DBOL is responsible for finding potential ship objects,and the CROC is used to categorize the potential ship objects.We also design a pixel-spatial-level data augmentation(PSDA)to reduce the risk of detection model overfitting.We compare the proposed EfficientShip with state-of-the-art(SOTA)literature on a ship detection dataset called Seaships.Experiments show our ship detection framework achieves a result of 99.63%(mAP)at 45 fps,which is much better than 8 SOTA approaches on detection accuracy and can also meet the requirements of real-time application scenarios.

QoS Routing Optimization Based on Deep Reinforcement Learning in SDN

To enhance the efficiency and expediency of issuing e-licenses within the power sector, we must confront thechallenge of managing the surging demand for data traffic. Within this realm, the network imposes stringentQuality of Service (QoS) requirements, revealing the inadequacies of traditional routing allocation mechanismsin accommodating such extensive data flows. In response to the imperative of handling a substantial influx of datarequests promptly and alleviating the constraints of existing technologies and network congestion, we present anarchitecture forQoS routing optimizationwith in SoftwareDefinedNetwork (SDN), leveraging deep reinforcementlearning. This innovative approach entails the separation of SDN control and transmission functionalities, centralizingcontrol over data forwardingwhile integrating deep reinforcement learning for informed routing decisions. Byfactoring in considerations such as delay, bandwidth, jitter rate, and packet loss rate, we design a reward function toguide theDeepDeterministic PolicyGradient (DDPG) algorithmin learning the optimal routing strategy to furnishsuperior QoS provision. In our empirical investigations, we juxtapose the performance of Deep ReinforcementLearning (DRL) against that of Shortest Path (SP) algorithms in terms of data packet transmission delay. Theexperimental simulation results show that our proposed algorithm has significant efficacy in reducing networkdelay and improving the overall transmission efficiency, which is superior to the traditional methods.

Fine-Grained Ship Recognition Based on Visible and Near-Infrared Multimodal Remote Sensing Images: Dataset,Methodology and Evaluation

Fine-grained recognition of ships based on remote sensing images is crucial to safeguarding maritime rights and interests and maintaining national security.Currently,with the emergence of massive high-resolution multi-modality images,the use of multi-modality images for fine-grained recognition has become a promising technology.Fine-grained recognition of multi-modality images imposes higher requirements on the dataset samples.The key to the problem is how to extract and fuse the complementary features of multi-modality images to obtain more discriminative fusion features.The attention mechanism helps the model to pinpoint the key information in the image,resulting in a significant improvement in the model’s performance.In this paper,a dataset for fine-grained recognition of ships based on visible and near-infrared multi-modality remote sensing images has been proposed first,named Dataset for Multimodal Fine-grained Recognition of Ships(DMFGRS).It includes 1,635 pairs of visible and near-infrared remote sensing images divided into 20 categories,collated from digital orthophotos model provided by commercial remote sensing satellites.DMFGRS provides two types of annotation format files,as well as segmentation mask images corresponding to the ship targets.Then,a Multimodal Information Cross-Enhancement Network(MICE-Net)fusing features of visible and near-infrared remote sensing images,has been proposed.In the network,a dual-branch feature extraction and fusion module has been designed to obtain more expressive features.The Feature Cross Enhancement Module(FCEM)achieves the fusion enhancement of the two modal features by making the channel attention and spatial attention work cross-functionally on the feature map.A benchmark is established by evaluating state-of-the-art object recognition algorithms on DMFGRS.MICE-Net conducted experiments on DMFGRS,and the precision,recall,mAP0.5 and mAP0.5:0.95 reached 87%,77.1%,83.8%and 63.9%,respectively.Extensive experiments demonstrate that the proposed MICE-Net has more excellent performance on DMFGRS.Built on lightweight network YOLO,the model has excellent generalizability,and thus has good potential for application in real-life scenarios.