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.

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.

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.

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.

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.

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.

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与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算法。通过引入高质量随机点和动态步长的方法,提高了生成随机树的质量并减少了冗余节点数量;采用正向寻优和逆向贪婪的方式,改善了搜索路径较长的问题。实验结果表明,改进RRT-Connect算法平均路径规划时间缩短26.41%,平均路径规划长度缩短19.05%,平均路径规划节点个数减少41.91%,证明了改进RRT-Connect算法相比于原算法规划效率更高,规划时间更少,规划路径质量更优。

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。

Unpredictability of Digital Twin for Connected Vehicles

Digital twin is an essential enabling technology for 6G connected vehicles.Through highfidelity mobility simulation,digital twin is expected to make accurate prediction about the vehicle trajectory,and then support intelligent applications such as safety monitoring and self-driving for connected vehicles.However,it is observed that even if a digital twin model is perfectly derived,it might still fail to predict the trajectory due to tiny measurement noise or delay in the initial vehicle locations.This paper aims at investigating the sources of unpredictability of digital twin.Take the car-following behaviors in connected vehicles for case study.The theoretical analysis and experimental results indicate that the predictability of digital twin naturally depends on its system complexity.Once a system enters a complex pattern,its longterm states are unpredictable.Furthermore,our study discloses that the complexity is determined,on the one hand,by the intrinsic factors of the target physical system such as the driver’s response sensitivity and delay,and on the other hand,by the crucial parameters of the digital twin system such as the sampling interval and twining latency.

Correlating Connected Vehicle Estimated Deceleration Events with Crash Incidents near Interstate Interchanges

Historical roadway safety analyses have used labor and time-intensive crash data collection procedures. However, crash reporting is often delayed and crash locations are reported with varying levels of spatial accuracy and detail. Recent advances in connected vehicle (CV) data provide an opportunity for stakeholders to proactively identify areas of safety concerns in near-real time with high spatial precision. Public and private sector stakeholders including automotive original equipment manufacturers (OEM) and insurance providers may independently define acceleration thresholds for reporting unsafe driver behavior. Although some OEMs have provided fixed threshold hard-braking event data for a number of years, this varies by OEM and there is no published literature on the best thresholds to use for identifying emerging safety issues. This research proposes a methodology to estimate deceleration events from raw CV trajectory data at varying thresholds that can be scaled to any CV. The estimated deceleration events and crash incident records around 629 interstate exits in Indiana were analyzed for a three-month period from March 1-May 31, 2023. Nearly 20 million estimated deceleration events and 4800 crash records were spatially joined to a 2-mile search radius around each exit ramp. Results showed that deceleration events between -0.5 g and -0.4 g had the highest correlation with an R2 of 0.69. This study also identifies the top 20 interstate exit locations with highest deceleration events. The framework presented in this study enables agencies and transportation professionals to perform safety evaluations on raw trajectory data without the need to integrate external data sources.

Efficient control of connected and automated vehicles on a two-lane highway with a moving bottleneck

This paper investigates the traffic flow of connected and automated vehicles(CAVs)inducing by a moving bottleneck on a two-lane highway.A heuristic rules-based algorithm(HRA)has been used to control the traffic flow upstream of the moving bottleneck.In the HRA,some CAVs in the control zone are mapped onto the neighboring lane as virtual ones.To improve the driving comfort,the command acceleration caused by virtual vehicle is restricted.Comparing with the benchmark in which the CAVs change lane as soon as the lane changing condition is met,the HRA significantly improves the traffic flow:the overtaking throughput as well as the outflow rate increases,the travel delay and the fuel consumption decrease,the comfort level could also be improved.

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.

Stability of connected and automated vehicles platoon considering communications failures

As a form of a future traffic system,a connected and automated vehicle(CAV)platoon is a typical nonlinear physical system.CAVs can communicate with each other and exchange information.However,communication failures can change the platoon system status.To characterize this change,a dynamic topology-based car-following model and its generalized form are proposed in this work.Then,a stability analysis method is explored.Finally,taking the dynamic cooperative intelligent driver model(DC-IDM)for example,a series of numerical simulations is conducted to analyze the platoon stability in different communication topology scenarios.The results show that the communication failures reduce the stability,but information from vehicles that are farther ahead and the use of a larger desired time headway can improve stability.Moreover,the critical ratio of communication failures required to ensure stability for different driving parameters is studied in this work.

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.

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.

Building an Open, Inclusive and Interconnected World For Common Development

Keynote Speech by H.E.Xi Jinping President of the People's Republic of China At the Opening Ceremony of the Third Belt and Road Forum for International Cooperation October 18,2023 Your Excellencies Heads of State and Government,Heads of International Organizations,Representatives of Various Countries,Distinguished Guests.

Comparison of Estimated Cycle Split Failures from High-Resolution Controller Event and Connected Vehicle Trajectory Data

Current traffic signal split failure (SF) estimations derived from high-resolution controller event data rely on detector occupancy ratios and preset thresholds. The reliability of these techniques depends on the selected thresholds, detector lengths, and vehicle arrival patterns. Connected vehicle (CV) trajectory data can more definitively show when a vehicle split fails by evaluating the number of stops it experiences as it approaches an intersection, but it has limited market penetration. This paper compares cycle-by-cycle SF estimations from both high-resolution controller event data and CV trajectory data, and evaluates the effect of data aggregation on SF agreement between the two techniques. Results indicate that, in general, split failure events identified from CV data are likely to also be captured from high-resolution data, but split failure events identified from high-resolution data are less likely to be captured from CV data. This is due to the CV market penetration rate (MPR) of ~5% being too low to capture representative data for every controller cycle. However, data aggregation can increase the ratio in which CV data captures split failure events. For example, day-of-week data aggregation increased the percentage of split failures identified with high-resolution data that were also captured with CV data from 35% to 56%. It is recommended that aggregated CV data be used to estimate SF as it provides conservative and actionable results without the limitations of intersection and detector configuration. As the CV MPR increases, the accuracy of CV-based SF estimation will also improve.