A Note on the Inverse Connected p-Median Problem on Block Graphs

Recently, the inverse connected p-median problem on block graphs G(V,E,w) under various cost functions, say rectilinear norm, Chebyshev norm, and bottleneck Hamming distance. Their contributions include finding a necessary and sufficient condition for the connected p-median problem on block graphs, developing algorithms and showing that these problems can be solved in O(n log n) time, where n is the number of vertices in the underlying block graph. Using similar technique, we show that some results are incorrect by a counter-example. Then we redefine some notations, reprove Theorem 1 and redescribe Theorem 2, Theorem 3 and Theorem 4.

Ensuring Secure Platooning of Constrained Intelligent and Connected Vehicles Against Byzantine Attacks:A Distributed MPC Framework

This study investigates resilient platoon control for constrained intelligent and connected vehicles(ICVs)against F-local Byzantine attacks.We introduce a resilient distributed model-predictive platooning control framework for such ICVs.This framework seamlessly integrates the predesigned optimal control with distributed model predictive control(DMPC)optimization and introduces a unique distributed attack detector to ensure the reliability of the transmitted information among vehicles.Notably,our strategy uses previously broadcasted information and a specialized convex set,termed the“resilience set”,to identify unreliable data.This approach significantly eases graph robustness prerequisites,requiring only an(F+1)-robust graph,in contrast to the established mean sequence reduced algorithms,which require a minimum(2F+1)-robust graph.Additionally,we introduce a verification algorithm to restore trust in vehicles under minor attacks,further reducing communication network robustness.Our analysis demonstrates the recursive feasibility of the DMPC optimization.Furthermore,the proposed method achieves exceptional control performance by minimizing the discrepancies between the DMPC control inputs and predesigned platoon control inputs,while ensuring constraint compliance and cybersecurity.Simulation results verify the effectiveness of our theoretical findings.

Approximately Bi-Similar Symbolic Model for Discretetime Interconnected Switched System

Dear Editor,This letter concerns the development of approximately bi-similar symbolic models for a discrete-time interconnected switched system(DT-ISS).The DT-ISS under consideration is formed by connecting multiple switched systems known as component switched systems(CSSs).Although the problem of constructing approximately bi-similar symbolic models for DT-ISS has been addressed in some literature,the previous works have relied on the assumption that all the subsystems of CSSs are incrementally input-state stable.

FADSF:A Data Sharing Model for Intelligent Connected Vehicles Based on Blockchain Technology

With the development of technology,the connected vehicle has been upgraded from a traditional transport vehicle to an information terminal and energy storage terminal.The data of ICV(intelligent connected vehicles)is the key to organically maximizing their efficiency.However,in the context of increasingly strict global data security supervision and compliance,numerous problems,including complex types of connected vehicle data,poor data collaboration between the IT(information technology)domain and OT(operation technology)domain,different data format standards,lack of shared trust sources,difficulty in ensuring the quality of shared data,lack of data control rights,as well as difficulty in defining data ownership,make vehicle data sharing face a lot of problems,and data islands are widespread.This study proposes FADSF(Fuzzy Anonymous Data Share Frame),an automobile data sharing scheme based on blockchain.The data holder publishes the shared data information and forms the corresponding label storage on the blockchain.The data demander browses the data directory information to select and purchase data assets and verify them.The data demander selects and purchases data assets and verifies them by browsing the data directory information.Meanwhile,this paper designs a data structure Data Discrimination Bloom Filter(DDBF),making complaints about illegal data.When the number of data complaints reaches the threshold,the audit traceability contract is triggered to punish the illegal data publisher,aiming to improve the data quality and maintain a good data sharing ecology.In this paper,based on Ethereum,the above scheme is tested to demonstrate its feasibility,efficiency and security.

Heterogeneous Task Allocation Model and Algorithm for Intelligent Connected Vehicles

With the development of vehicles towards intelligence and connectivity,vehicular data is diversifying and growing dramatically.A task allocation model and algorithm for heterogeneous Intelligent Connected Vehicle(ICV)applications are proposed for the dispersed computing network composed of heterogeneous task vehicles and Network Computing Points(NCPs).Considering the amount of task data and the idle resources of NCPs,a computing resource scheduling model for NCPs is established.Taking the heterogeneous task execution delay threshold as a constraint,the optimization problem is described as the problem of maximizing the utilization of computing resources by NCPs.The proposed problem is proven to be NP-hard by using the method of reduction to a 0-1 knapsack problem.A many-to-many matching algorithm based on resource preferences is proposed.The algorithm first establishes the mutual preference lists based on the adaptability of the task requirements and the resources provided by NCPs.This enables the filtering out of un-schedulable NCPs in the initial stage of matching,reducing the solution space dimension.To solve the matching problem between ICVs and NCPs,a new manyto-many matching algorithm is proposed to obtain a unique and stable optimal matching result.The simulation results demonstrate that the proposed scheme can improve the resource utilization of NCPs by an average of 9.6%compared to the reference scheme,and the total performance can be improved by up to 15.9%.

MSADCN:Multi-Scale Attentional Densely Connected Network for Automated Bone Age Assessment

Bone age assessment(BAA)helps doctors determine how a child’s bones grow and develop in clinical medicine.Traditional BAA methods rely on clinician expertise,leading to time-consuming predictions and inaccurate results.Most deep learning-based BAA methods feed the extracted critical points of images into the network by providing additional annotations.This operation is costly and subjective.To address these problems,we propose a multi-scale attentional densely connected network(MSADCN)in this paper.MSADCN constructs a multi-scale dense connectivity mechanism,which can avoid overfitting,obtain the local features effectively and prevent gradient vanishing even in limited training data.First,MSADCN designs multi-scale structures in the densely connected network to extract fine-grained features at different scales.Then,coordinate attention is embedded to focus on critical features and automatically locate the regions of interest(ROI)without additional annotation.In addition,to improve the model’s generalization,transfer learning is applied to train the proposed MSADCN on the public dataset IMDB-WIKI,and the obtained pre-trained weights are loaded onto the Radiological Society of North America(RSNA)dataset.Finally,label distribution learning(LDL)and expectation regression techniques are introduced into our model to exploit the correlation between hand bone images of different ages,which can obtain stable age estimates.Extensive experiments confirm that our model can converge more efficiently and obtain a mean absolute error(MAE)of 4.64 months,outperforming some state-of-the-art BAA methods.

Evaluating the Robustness of MDSS Maintenance Forecasts Using Connected Vehicle Data

The Indiana Department of Transportation (INDOT) adopted the Maintenance Decision Support System (MDSS) for user-defined plowing segments in the winter of 2008-2009. Since then, many new data sources, including connected vehicle data, enhanced weather data, and fleet telematics, have been integrated into INDOT winter operations activities. The objective of this study was to use these new data sources to conduct a systematic evaluation of the robustness of the MDSS forecasts. During the 2023-2024 winter season, 26 unique MDSS forecast data attributes were collected at 0, 1, 3, 6, 12 and 23-hour intervals from the observed storm time for 6 roadway segments during 13 individual storms. In total, over 888,000 MDSS data points were archived for this evaluation. This study developed novel visualizations to compare MDSS forecasts to multiple other independent data sources, including connected vehicle data, National Oceanic and Atmospheric Administration (NOAA) weather data, road friction data and snowplow telematics. Three Indiana storms, with varying characteristics and severity, were analyzed in detailed case studies. Those storms occurred on January 6th, 2024, January 13th, 2024 and February 16th, 2024. Incorporating these visualizations into winter weather after-action reports increases the robustness of post-storm performance analysis and allows road weather stakeholders to better understand the capabilities of MDSS. The results of this analysis will provide a framework for future MDSS evaluations and implementations as well as training tools for winter operation stakeholders in Indiana and beyond.

Application of Connected Truck Data to Evaluate Spatiotemporal Impact of Rest Area Closures on Ramp Parking

Ensuring adequate access to truck parking is critical to the safe and efficient movement of freight traffic. There are strict federal guidelines for commercial truck driver rest periods. Rest areas and private truck stops are the only places for the trucks to stop legally and safely. In locations without sufficient parking areas, trucks often park on interstate ramps, which create safety risks for other interstate motorists. Historically, agencies have employed costly and time intensive manual counting methods, camera surveillance, and driver surveys to assess truck parking. Connected truck data, available in near real-time, offers an efficient alternative to practitioners to assess truck parking patterns and identify areas where there may be insufficient safe parking spaces. This paper presents a case study of interstate I-70 in east central Indiana and documents the observed spatiotemporal impacts of a rest area closure on truck parking on nearby interstate ramps. Results showed that there was a 28% increase in parking on ramps during the rest area closure. Analysis also found that ramps closest to the rest area were most impacted by the closure, seeing a rise in truck parking sessions as high as 2.7 times. Parking duration on the ramps during rest area closure also increased drastically. Although it was expected that this would result in increased parking by trucks on adjacent ramps, this before, during, after scenario provided an ideal scenario to evaluate the robustness of these techniques to assess changing parking characteristics of long-haul commercial trucks. The data analytics and visualization tools presented in this study are scalable nationwide and will aid stakeholders in informed data-driven decision making when allocating resources towards improving the nations commercial vehicle parking infrastructure.

Intelligent Network-Connected New Energy Vehicle Technology and Application Under the Dual-Carbon Strategy

In responding to the“dual carbon”strategy,intelligent networked new energy vehicle technology plays a crucial role.This type of vehicle combines the advantages of new energy technology and intelligent network technology,effectively reduces carbon emissions in the transportation sector,improves energy utilization efficiency,and contributes to the green transportation system through intelligent transportation management and collaborative work between vehicles,making significant contributions.This article aims to explore the development of intelligent network-connected new energy vehicle technology and applications under the dual-carbon strategy and lay the foundation for the future development direction of the automotive industry.

改进RRT-Connect与DWA算法的巡检机器人路径规划研究

针对传统RRT-Connect算法在密集复杂环境中路径规划效率低、动态避障效果差等问题,提出一种改进RRT-Connect与DWA融合算法。该算法通过改进采样策略、动态步长优化和碰撞检测引导随机树生长;在随机树中采用贪心策略和角度约束优化路径。基于巡检机器人建立运动学模型,通过速度采样空间生成轨迹簇;建立模糊逻辑系统自适应调整DWA算法评价函数的权重系数,将全局最优路径点融入DWA算法中实现全局最优路径和实时避障。仿真结果表明,在油气站场密集复杂环境中,改进RRT-Connect算法较传统算法路径缩短约27.09%,平滑度提高约84.6%,碰撞距离提高约18.75%;改进融合算法路径减少约2.97%,平滑度提高约78.8%,碰撞距离提高约30.6%,验证了提出算法的有效性。

基于逆向重布线改进RRT-Connect算法的机械臂路径规划

为解决RRT-Connect算法在复杂非结构环境下规划出的路径成本较长、有效节点数过多、曲折不平滑等问题,提出了一种基于逆向重布线的改进RRT-Connect算法(Improved-RRT-Connect).首先,在算法的起始位置加入碰撞检测函数,当起点和终点之间不存在障碍物时,能够快速生成一条路径;其次,通过对生成的路径采取逆向重布线的措施,对生成的路径中的节点进行重新筛选布线,达到缩短生成路径长度,减少有效节点数量的目的;最后,通过结合B样条曲线对生成的路径进行拟合处理,得到一条平滑连续的路径.通过Improved-RRT-Connect算法与RRT、RRT^(*)-Smart、RRT-Connect等算法的对比实验表明,在规划时间上,Improved-RRT-Connect算法比RRT、RRT^(*)-Smart算法减少了52.14%、98.53%,在路径成本上比RRT、RRT-Connect算法减少了19.39%、17.15%,阐明了提出的Improved-RRT-Connect算法的优越性.

An efficient microreactor with continuous serially connected micromixers for the synthesis of superparamagnetic magnetite nanoparticles

A new microreactor with continuous serially connected micromixers(CSCM)was tailored for the coprecipitation process to synthesize Fe_(3)O_(4) nanoparticles.Numerical simulation reveals that the two types of CSCM microchannels(V-typed and U-typed)proposed in this work exhibited markedly better mixing performances than the Zigzag and capillary microchannels due to the promotion of Dean vortices.Complete mixing was achieved in the V-typed microchannel in 2.7 s at an inlet Reynolds number of 27.Fe_(3)O_(4) nanoparticles synthesized in a planar glass microreactor with the V-typed microchannel,possessing an average size of 9.3 nm and exhibiting superparamagnetism,had obviously better dispersity and uniformity and higher crystallinity than those obtained in the capillary microreactor.The new CSCM microreactor developed in this work can act as a potent device to intensify the synthesis of similar inorganic nanoparticles via multistep chemical precipitation processes.

Resilient and Safe Platooning Control of Connected Automated Vehicles Against Intermittent Denial-of-Service Attacks

Connected automated vehicles(CAVs)serve as a promising enabler for future intelligent transportation systems because of their capabilities in improving traffic efficiency and driving safety,and reducing fuel consumption and vehicle emissions.A fundamental issue in CAVs is platooning control that empowers a convoy of CAVs to be cooperatively maneuvered with desired longitudinal spacings and identical velocities on roads.This paper addresses the issue of resilient and safe platooning control of CAVs subject to intermittent denial-of-service(DoS)attacks that disrupt vehicle-to-vehicle communications.First,a heterogeneous and uncertain vehicle longitudinal dynamic model is presented to accommodate a variety of uncertainties,including diverse vehicle masses and engine inertial delays,unknown and nonlinear resistance forces,and a dynamic platoon leader.Then,a resilient and safe distributed longitudinal platooning control law is constructed with an aim to preserve simultaneous individual vehicle stability,attack resilience,platoon safety and scalability.Furthermore,a numerically efficient offline design algorithm for determining the desired platoon control law is developed,under which the platoon resilience against DoS attacks can be maximized but the anticipated stability,safety and scalability requirements remain preserved.Finally,extensive numerical experiments are provided to substantiate the efficacy of the proposed platooning method.

Rail Surface Defect Detection Based on Improved UPerNet and Connected Component Analysis

To guarantee the safety of railway operations,the swift detection of rail surface defects becomes imperative.Traditional methods of manual inspection and conventional nondestructive testing prove inefficient,especially when scaling to extensive railway networks.Moreover,the unpredictable and intricate nature of defect edge shapes further complicates detection efforts.Addressing these challenges,this paper introduces an enhanced Unified Perceptual Parsing for Scene Understanding Network(UPerNet)tailored for rail surface defect detection.Notably,the Swin Transformer Tiny version(Swin-T)network,underpinned by the Transformer architecture,is employed for adept feature extraction.This approach capitalizes on the global information present in the image and sidesteps the issue of inductive preference.The model’s efficiency is further amplified by the windowbased self-attention,which minimizes the model’s parameter count.We implement the cross-GPU synchronized batch normalization(SyncBN)for gradient optimization and integrate the Lovász-hinge loss function to leverage pixel dependency relationships.Experimental evaluations underscore the efficacy of our improved UPerNet,with results demonstrating Pixel Accuracy(PA)scores of 91.39%and 93.35%,Intersection over Union(IoU)values of 83.69%and 87.58%,Dice Coefficients of 91.12%and 93.38%,and Precision metrics of 90.85%and 93.41%across two distinct datasets.An increment in detection accuracy was discernible.For further practical applicability,we deploy semantic segmentation of rail surface defects,leveraging connected component processing techniques to distinguish varied defects within the same frame.By computing the actual defect length and area,our deep learning methodology presents results that offer intuitive insights for railway maintenance professionals.

Design and Implementation of a Battery Big Data Platform Through Intelligent Connected Electric Vehicles

The development of a battery management algorithm is highly dependent on high-quality battery operation data,especially the data in extreme conditions such as low temperatures.The data in faults are also essential for failure and safety management research.This study developed a battery big data platform to realize vehicle operation,energy interaction and data management.First,we developed an electric vehicle with vehicle navigation and position detection and designed an environmental cabin that allows the vehicle to operate autonomously.Second,charging and heating systems based on wireless energy transfer were developed and equipped on the vehicle to investigate optimal charging and heating methods of the batteries in the vehicle.Third,the data transmission network was designed,a real-time monitoring interface was developed,and the self-developed battery management system was used to measure,collect,upload,and store battery operation data in real time.Finally,experimental validation was performed on the platform.Results demonstrate the efficiency and reliability of the platform.Battery state of charge estimation is used as an example to illustrate the availability of battery operation data.

Integrated Sensing and Communication Enabled Multiple Beamwidth and Power Allocation for Connected Automated Vehicles

Connected autonomous vehicles(CAVs)are a promising paradigm for implementing intelligent transportation systems.However,in CAVs scenarios,the sensing blind areas cause serious safety hazards.Existing vehicle-to-vehicle(V2V)technology is difficult to break through the sensing blind area and ensure reliable sensing information.To overcome these problems,considering infrastructures as a means to extend the sensing range is feasible based on the integrated sensing and communication(ISAC)technology.The mmWave base station(mmBS)transmits multiple beams consisting of communication beams and sensing beams.The sensing beams are responsible for sensing objects within the CAVs blind area,while the communication beams are responsible for transmitting the sensed information to the CAVs.To reduce the impact of inter-beam interference,a joint multiple beamwidth and power allocation(JMBPA)algorithm is proposed.By maximizing the communication transmission rate under the sensing constraints.The proposed non-convex optimization problem is transformed into a standard difference of two convex functions(D.C.)problem.Finally,the superiority of the lutions.The average transmission rate of communication beams remains over 3.4 Gbps,showcasing a significant improvement compared to other algorithms.Moreover,the satisfaction of sensing services remains steady.

Computing Connected Resolvability of Graphs Using Binary Enhanced Harris Hawks Optimization

In this paper,we consider the NP-hard problem offinding the minimum connected resolving set of graphs.A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the ver-tices in B.A resolving set B of G is connected if the subgraph B induced by B is a nontrivial connected subgraph of G.The cardinality of the minimal resolving set is the metric dimension of G and the cardinality of minimum connected resolving set is the connected metric dimension of G.The problem is solved heuristically by a binary version of an enhanced Harris Hawk Optimization(BEHHO)algorithm.This is thefirst attempt to determine the connected resolving set heuristically.BEHHO combines classical HHO with opposition-based learning,chaotic local search and is equipped with an S-shaped transfer function to convert the contin-uous variable into a binary one.The hawks of BEHHO are binary encoded and are used to represent which one of the vertices of a graph belongs to the connected resolving set.The feasibility is enforced by repairing hawks such that an addi-tional node selected from V\B is added to B up to obtain the connected resolving set.The proposed BEHHO algorithm is compared to binary Harris Hawk Optimi-zation(BHHO),binary opposition-based learning Harris Hawk Optimization(BOHHO),binary chaotic local search Harris Hawk Optimization(BCHHO)algorithms.Computational results confirm the superiority of the BEHHO for determining connected metric dimension.

基于改进RRT-Connect算法的全局路径规划

针对RRT-Connect算法在复杂环境内的路径规划中存在探索性弱、收敛速度慢、冗余节点多、搜索路径较长等问题,提出一种改进的RRT-Connect算法。通过引入高质量随机点和动态步长的方法,提高了生成随机树的质量并减少了冗余节点数量;采用正向寻优和逆向贪婪的方式,改善了搜索路径较长的问题。实验结果表明,改进RRT-Connect算法平均路径规划时间缩短26.41%,平均路径规划长度缩短19.05%,平均路径规划节点个数减少41.91%,证明了改进RRT-Connect算法相比于原算法规划效率更高,规划时间更少,规划路径质量更优。

耦合优化蚁群算法与P-Median model的选址模型设计

为节省城建部门对于公共体育设施的投入成本以及提高城市人民生活质量,以运动场所优化选址为例,提出一种新型设施选址模型。该模型主要基于P-Median model(最小化阻抗模型)根据需求点数量从全部候选设施选址中选择设施空间位置,让用户达到离自己最近设施距离成本总和最小的目的,对选址的基本原则和实际情况提出要求,构造目标函数用于优化后蚁群算法求解进行选址工作。优化蚁群算法实现基于Python语言模块,通过改进蚁群原始信息素,提升原有算法的收敛速度,求出目标函数最优解,可以很好地模拟对于运动场所的选址。用二者耦合进行优势互补所设计的选址模型来搜寻研究区蚁群信息素浓度残留最大的栅格像元,从而确定未被已有设施点服务半径覆盖的最佳设施点建立位置。实验结果表明,该新型选址模型相较于最小化阻抗模型与最大化覆盖模型,新增优化设施点使整体服务半径覆盖率分别高出10.42%和6.95%,适合求解较为精确且小规模空间下的选址问题。

The importance of being connected:membrane contact sites and Parkinson’s disease

Membrane contact sites (MCS) occur between closely apposed organelles and are a means to transport ions and macromolecules between themselves,co-ordinate cellular metabolism,and direct organelle fission and transport.While MCS between the endoplasmic reticulum (ER)and mitochondria has long been investigated。