SDGNN: Symmetry-Preserving Dual-Stream Graph Neural Networks

Dear Editor,This letter proposes a symmetry-preserving dual-stream graph neural network(SDGNN) for precise representation learning to an undirected weighted graph(UWG). Although existing graph neural networks(GNNs) are influential instruments for representation learning to a UWG, they invariably adopt a unique node feature matrix for illustrating the sole node set of a UWG.

Privacy-Preserving Consensus-Based Distributed Economic Dispatch of Smart Grids via State Decomposition

This paper studies the privacy-preserving distributed economic dispatch(DED)problem of smart grids.An autonomous consensus-based algorithm is developed via local data exchange with neighboring nodes,which covers both the islanded mode and the grid-connected mode of smart grids.To prevent power-sensitive information from being disclosed,a privacy-preserving mechanism is integrated into the proposed DED algorithm by randomly decomposing the state into two parts,where only partial data is transmitted.Our objective is to develop a privacy-preserving DED algorithm to achieve optimal power dispatch with the lowest generation cost under physical constraints while preventing sensitive information from being eavesdropped.To this end,a comprehensive analysis framework is established to ensure that the proposed algorithm can converge to the optimal solution of the concerned optimization problem by means of the consensus theory and the eigenvalue perturbation approach.In particular,the proposed autonomous algorithm can achieve a smooth transition between the islanded mode and the grid-connected mode.Furthermore,rigorous analysis is given to show privacy-preserving performance against internal and external eavesdroppers.Finally,case studies illustrate the feasibility and validity of the developed algorithm.

A Cloud-Fog Enabled and Privacy-Preserving IoT Data Market Platform Based on Blockchain

The dynamic landscape of the Internet of Things(IoT)is set to revolutionize the pace of interaction among entities,ushering in a proliferation of applications characterized by heightened quality and diversity.Among the pivotal applications within the realm of IoT,as a significant example,the Smart Grid(SG)evolves into intricate networks of energy deployment marked by data integration.This evolution concurrently entails data interchange with other IoT entities.However,there are also several challenges including data-sharing overheads and the intricate establishment of trusted centers in the IoT ecosystem.In this paper,we introduce a hierarchical secure data-sharing platform empowered by cloud-fog integration.Furthermore,we propose a novel non-interactive zero-knowledge proof-based group authentication and key agreement protocol that supports one-to-many sharing sets of IoT data,especially SG data.The security formal verification tool shows that the proposed scheme can achieve mutual authentication and secure data sharing while protecting the privacy of data providers.Compared with previous IoT data sharing schemes,the proposed scheme has advantages in both computational and transmission efficiency,and has more superiority with the increasing volume of shared data or increasing number of participants.

An Arbitrarily High Order and Asymptotic Preserving Kinetic Scheme in Compressible Fluid Dynamic

We present a class of arbitrarily high order fully explicit kinetic numerical methods in compressible fluid dynamics,both in time and space,which include the relaxation schemes by Jin and Xin.These methods can use the CFL number larger or equal to unity on regular Cartesian meshes for the multi-dimensional case.These kinetic models depend on a small parameter that can be seen as a"Knudsen"number.The method is asymptotic preserving in this Knudsen number.Also,the computational costs of the method are of the same order of a fully explicit scheme.This work is the extension of Abgrall et al.(2022)[3]to multidimensional systems.We have assessed our method on several problems for two-dimensional scalar problems and Euler equations and the scheme has proven to be robust and to achieve the theoretically predicted high order of accuracy on smooth solutions.

Ship recognition based on HRRP via multi-scale sparse preserving method

In order to extract the richer feature information of ship targets from sea clutter, and address the high dimensional data problem, a method termed as multi-scale fusion kernel sparse preserving projection(MSFKSPP) based on the maximum margin criterion(MMC) is proposed for recognizing the class of ship targets utilizing the high-resolution range profile(HRRP). Multi-scale fusion is introduced to capture the local and detailed information in small-scale features, and the global and contour information in large-scale features, offering help to extract the edge information from sea clutter and further improving the target recognition accuracy. The proposed method can maximally preserve the multi-scale fusion sparse of data and maximize the class separability in the reduced dimensionality by reproducing kernel Hilbert space. Experimental results on the measured radar data show that the proposed method can effectively extract the features of ship target from sea clutter, further reduce the feature dimensionality, and improve target recognition performance.

Bipolar hip arthroplasty using conjoined tendon preserving posterior lateral approach in treatment of displaced femoral neck fractures

BACKGROUND Hip fractures account for 23.8%of all fractures in patients over the age of 75 years.More than half of these patients are older than 80 years.Bipolar hemiarthroplasty(BHA)was established as an effective management option for these patients.Various approaches can be used for the BHA procedure.However,there is a high risk of postoperative dislocation.The conjoined tendon-preserving posterior(CPP)lateral approach was introduced to reduce postoperative dislocation rates.AIM To evaluate the effectiveness and safety of the CPP lateral approach for BHA in elderly patients.METHODS We retrospectively analyzed medical data from 80 patients with displaced femoral neck fractures who underwent BHA.The patients were followed up for at least 1 year.Among the 80 patients,57(71.3%)were female.The time to operation averaged 2.3 d(range:1-5 d).The mean age was 80.5 years(range:67-90 years),and the mean body mass index was 24.9 kg/m^(2)(range:17-36 kg/m^(2)).According to the Garden classification,42.5%of patients were typeⅢand 57.5%of patients were typeⅣ.Uncemented bipolar hip prostheses were used for all patients.Torn conjoined tendons,dislocations,and adverse complications during and after surgery were recorded.RESULTS The mean postoperative follow-up time was 15.3 months(range:12-18 months).The average surgery time was 52 min(range:40-70 min)with an average blood loss of 120 mL(range:80-320 mL).The transfusion rate was 10%(8 of 80 patients).The gemellus inferior was torn in 4 patients(5%),while it was difficult to identify in 2 patients(2.5%)during surgery.The posterior capsule was punctured by the fractured femoral neck in 3 patients,but the conjoined tendon and the piriformis tendon remained intact.No patients had stem varus greater than 3 degrees or femoral fracture.There were no patients with stem subsidence more than 5 mm at the last follow-up.No postoperative dislocations were observed throughout the follow-up period.No significance was found between preoperative and postoperative mean Health Service System scores(87.30±2.98 vs 86.10±6.10,t=1.89,P=0.063).CONCLUSION The CPP lateral approach can effectively reduce the incidence of postoperative dislocation without increasing perioperative complications.For surgeons familiar with the posterior lateral approach,there is no need for additional surgical instruments,and it does not increase surgical difficulty.

Clinical Observation on the Treatment of Diabetic Kidney Disease with Damp-heat Stasis Syndrome in Clinical Proteinuria Stage by Kunkui Kidney Preserving Paste

[Objectives]To evaluate the clinical efficacy and safety of Kunkui Kidney Preserving Paste in the treatment of diabetic kidney disease(DKD)patients with damp-heat stasis syndrome in the clinical proteinuria stage.[Methods]Retrospective analysis was made on 30 patients with DKD who were diagnosed with damp-heat stasis syndrome in the clinical proteinuria stage from March 2021 to March 2023 in Jiangsu Province Hospital of Chinese Medicine,and who took Kunkui Kidney Preserving Paste continuously for six months.The urinary albumin/creatinine ratio(UACR),urinary complement C3,and urea nitrogen(BUN)of DKD patients before and after treatment were compared,and estimated glomerular filtration rate(eGFR),blood creatinine(Scr),and cystatin C(CysC)were estimated,and the therapeutic effects on renal function and urinary protein were evaluated.[Results]After treatment,UACR significantly decreased(P<0.01),and urinary complement C3 and Scr decreased(P<0.05),while other indicators showed no significant statistical difference(P>0.05).In terms of evaluating the efficacy of urinary protein therapy,8 cases showed recent relief;8 cases showed significant effect;9 cases were effective,and 5 cases were invalid after treatment,with a total effective rate of 83.33%.In terms of renal function efficacy evaluation,8 cases showed significant effect;4 cases were effective;11 cases were stable,and 7 cases were invalid,with a total effective rate of 76.67%.In the safety evaluation,there were no obvious adverse reactions.[Conclusions]The Kunkui Kidney Preserving Past has significant clinical efficacy and safety in treating DKD patients with damp-heat stasis syndrome in the clinical proteinuria period.It has significant advantages in reducing urinary protein and protecting renal function,which is worthy of clinical promotion.

2P3FL:A Novel Approach for Privacy Preserving in Financial Sectors Using Flower Federated Learning

The increasing data pool in finance sectors forces machine learning(ML)to step into new complications.Banking data has significant financial implications and is confidential.Combining users data from several organizations for various banking services may result in various intrusions and privacy leakages.As a result,this study employs federated learning(FL)using a flower paradigm to preserve each organization’s privacy while collaborating to build a robust shared global model.However,diverse data distributions in the collaborative training process might result in inadequate model learning and a lack of privacy.To address this issue,the present paper proposes the imple-mentation of Federated Averaging(FedAvg)and Federated Proximal(FedProx)methods in the flower framework,which take advantage of the data locality while training and guaranteeing global convergence.Resultantly improves the privacy of the local models.This analysis used the credit card and Canadian Institute for Cybersecurity Intrusion Detection Evaluation(CICIDS)datasets.Precision,recall,and accuracy as performance indicators to show the efficacy of the proposed strategy using FedAvg and FedProx.The experimental findings suggest that the proposed approach helps to safely use banking data from diverse sources to enhance customer banking services by obtaining accuracy of 99.55%and 83.72%for FedAvg and 99.57%,and 84.63%for FedProx.

Privacy-Preserving Healthcare and Medical Data Collaboration Service System Based on Blockchain and Federated Learning

As the volume of healthcare and medical data increases from diverse sources,real-world scenarios involving data sharing and collaboration have certain challenges,including the risk of privacy leakage,difficulty in data fusion,low reliability of data storage,low effectiveness of data sharing,etc.To guarantee the service quality of data collaboration,this paper presents a privacy-preserving Healthcare and Medical Data Collaboration Service System combining Blockchain with Federated Learning,termed FL-HMChain.This system is composed of three layers:Data extraction and storage,data management,and data application.Focusing on healthcare and medical data,a healthcare and medical blockchain is constructed to realize data storage,transfer,processing,and access with security,real-time,reliability,and integrity.An improved master node selection consensus mechanism is presented to detect and prevent dishonest behavior,ensuring the overall reliability and trustworthiness of the collaborative model training process.Furthermore,healthcare and medical data collaboration services in real-world scenarios have been discussed and developed.To further validate the performance of FL-HMChain,a Convolutional Neural Network-based Federated Learning(FL-CNN-HMChain)model is investigated for medical image identification.This model achieves better performance compared to the baseline Convolutional Neural Network(CNN),having an average improvement of 4.7%on Area Under Curve(AUC)and 7%on Accuracy(ACC),respectively.Furthermore,the probability of privacy leakage can be effectively reduced by the blockchain-based parameter transfer mechanism in federated learning between local and global models.

Insights into upper blepharoplasty: Conservative volume-preserving techniques

This editorial commentary critically examines the systematic review by Miotti et al,which discusses the evolving trends in upper lid blepharoplasty towards a conservative,volume-preserving approach.The review emphasizes the shift from traditional tissue resection to techniques that maintain anatomical integrity,paralleling broader trends in panfacial rejuvenation.Miotti et al delve into the nuances of fat pad management,advocating for conservation over reduction to sustain natural contours and improve long-term aesthetic outcomes.This perspective is supported by comparative studies and empirical data,such as those from Massry and Alghoul et al,highlighting the benefits of conservative approaches in terms of patient satisfaction and aesthetic longevity.The review also stresses the importance of surgeon discretion in adapting procedures to diverse patient demographics,particularly in addressing distinct features such as the Asian upper eyelid.However,it identifies a significant gap in long-term comparative research,underscoring the need for future studies to substantiate the safety and efficacy of these minimalist techniques.Overall,Miotti et al.'s work contributes profoundly to the discourse on personalized,conservative cosmetic surgery,urging ongoing research to refine and validate surgical best practices in upper eyelid blepharoplasty.

Analysis of quality of life in patients after transgastric natural orifice transluminal endoscopic gallbladder-preserving surgery

BACKGROUND At present,laparoscopic cholecystectomy(LC)is the main surgical treatment for gallstones.But,after gallbladder removal,there are many complications.Therefore,it is hoped to remove stones while preserving the function of the gallbladder,and with the development of endoscopic technology,natural orifice transluminal endoscopic surgery came into being.AIM To compare the quality of life,perioperative indicators,adverse events after LC and transgastric natural orifice transluminal endoscopic gallbladder-preserving surgery(EGPS)in patients with gallstones.METHODS Patients who were admitted to The First Affiliated Hospital of Xinjiang Medical University from 2020 to 2022 were retrospectively collected.We adopted propen-sity score matching(1:1)to compare EGPS and LC patients.RESULTS A total of 662 cases were collected,of which 589 cases underwent LC,and 73 cases underwent EGPS.Propensity score matching was performed,and 40 patients were included in each of the groups.In the EGPS group,except the gastr-ointestinal defecation(P=0.603),the total score,physical well-being,mental well-being,and gastrointestinal digestion were statistically significant compared with the preoperative score after surgery(P<0.05).In the LC group,except the mental well-being,the total score,physical well-being,gastrointestinal digestion,the gastrointestinal defecation was statistically significant compared with the preoperative score after surgery(P<0.05).When comparing between groups,gastrointestinal defecation had significantly difference(P=0.002)between the two groups,there was no statistically significant difference in the total postoperative score and the other three subscales.In the surgery duration,hospital stay and cost,LC group were lower than EGPS group.The recurrence factors of gallstones after EGPS were analyzed:and recurrence was not correlated with gender,age,body mass index,number of stones,and preoperative score.CONCLUSION Whether EGPS or LC,it can improve the patient’s symptoms,and the EGPS has less impact on the patient’s defecation.It needed to,prospective,multicenter,long-term follow-up,large-sample related studies to prove.

LOCAL STRUCTURE-PRESERVING ALGORITHMS FOR THE KLEIN-GORDON-ZAKHAROV EQUATION

In this paper, using the concatenating method, a series of local structure-preserving algorithms are obtained for the Klein-Gordon-Zakharov equation, including four multisymplectic algorithms, four local energy-preserving algorithms, four local momentumpreserving algorithms;of these, local energy-preserving and momentum-preserving algorithms have not been studied before. The local structure-preserving algorithms mentioned above are more widely used than the global structure-preserving algorithms, since local preservation algorithms can be preserved in any time and space domains, which overcomes the defect that global preservation algorithms are limited to boundary conditions. In particular, under appropriate boundary conditions, local preservation laws are global preservation laws.Numerical experiments conducted can support the theoretical analysis well.

A Privacy-Preserving Distributed Subgradient Algorithm for the Economic Dispatch Problem in Smart Grid

Dear Editor,This letter aims to establish a privacy-preserving distributed optimization algorithm by combining the consensus iteration by subgradients, which not only enables the privacy preservation of optimization but also guarantees the optimality of solutions with some bias bounds.In the setting of distributed optimization, a network of nodes, having their own objective functions depending on the global agents' state, would like to distributedly optimize the sum of all objective functions through the local agent-to-agent information change.

Loop Closure Detection via Locality Preserving Matching With Global Consensus

A critical component of visual simultaneous localization and mapping is loop closure detection(LCD),an operation judging whether a robot has come to a pre-visited area.Concretely,given a query image(i.e.,the latest view observed by the robot),it proceeds by first exploring images with similar semantic information,followed by solving the relative relationship between candidate pairs in the 3D space.In this work,a novel appearance-based LCD system is proposed.Specifically,candidate frame selection is conducted via the combination of Superfeatures and aggregated selective match kernel(ASMK).We incorporate an incremental strategy into the vanilla ASMK to make it applied in the LCD task.It is demonstrated that this setting is memory-wise efficient and can achieve remarkable performance.To dig up consistent geometry between image pairs during loop closure verification,we propose a simple yet surprisingly effective feature matching algorithm,termed locality preserving matching with global consensus(LPM-GC).The major objective of LPM-GC is to retain the local neighborhood information of true feature correspondences between candidate pairs,where a global constraint is further designed to effectively remove false correspondences in challenging sceneries,e.g.,containing numerous repetitive structures.Meanwhile,we derive a closed-form solution that enables our approach to provide reliable correspondences within only a few milliseconds.The performance of the proposed approach has been experimentally evaluated on ten publicly available and challenging datasets.Results show that our method can achieve better performance over the state-of-the-art in both feature matching and LCD tasks.We have released our code of LPM-GC at https://github.com/jiayi-ma/LPM-GC.

Lightweight privacy-preserving truth discovery for vehicular air quality monitoring

Air pollution has become a global concern for many years.Vehicular crowdsensing systems make it possible to monitor air quality at a fine granularity.To better utilize the sensory data with varying credibility,truth discovery frameworks are introduced.However,in urban cities,there is a significant difference in traffic volumes of streets or blocks,which leads to a data sparsity problem for truth discovery.Protecting the privacy of participant vehicles is also a crucial task.We first present a data masking-based privacy-preserving truth discovery framework,which incorporates spatial and temporal correlations to solve the sparsity problem.To further improve the truth discovery performance of the presented framework,an enhanced version is proposed with anonymous communication and data perturbation.Both frameworks are more lightweight than the existing cryptography-based methods.We also evaluate the work with simulations and fully discuss the performance and possible extensions.

Privacy Preserving Demand Side Management Method via Multi-Agent Reinforcement Learning

The smart grid utilizes the demand side management technology to motivate energy users towards cutting demand during peak power consumption periods, which greatly improves the operation efficiency of the power grid. However, as the number of energy users participating in the smart grid continues to increase, the demand side management strategy of individual agent is greatly affected by the dynamic strategies of other agents. In addition, the existing demand side management methods, which need to obtain users’ power consumption information,seriously threaten the users’ privacy. To address the dynamic issue in the multi-microgrid demand side management model, a novel multi-agent reinforcement learning method based on centralized training and decentralized execution paradigm is presented to mitigate the damage of training performance caused by the instability of training experience. In order to protect users’ privacy, we design a neural network with fixed parameters as the encryptor to transform the users’ energy consumption information from low-dimensional to high-dimensional and theoretically prove that the proposed encryptor-based privacy preserving method will not affect the convergence property of the reinforcement learning algorithm. We verify the effectiveness of the proposed demand side management scheme with the real-world energy consumption data of Xi’an, Shaanxi, China. Simulation results show that the proposed method can effectively improve users’ satisfaction while reducing the bill payment compared with traditional reinforcement learning(RL) methods(i.e., deep Q learning(DQN), deep deterministic policy gradient(DDPG),QMIX and multi-agent deep deterministic policy gradient(MADDPG)). The results also demonstrate that the proposed privacy protection scheme can effectively protect users’ privacy while ensuring the performance of the algorithm.

Feature Preserving Parameterization for Quadrilateral Mesh Generation Based on Ricci Flow and Cross Field

We propose a newmethod to generate surface quadrilateralmesh by calculating a globally defined parameterization with feature constraints.In the field of quadrilateral generation with features,the cross field methods are wellknown because of their superior performance in feature preservation.The methods based on metrics are popular due to their sound theoretical basis,especially the Ricci flow algorithm.The cross field methods’major part,the Poisson equation,is challenging to solve in three dimensions directly.When it comes to cases with a large number of elements,the computational costs are expensive while the methods based on metrics are on the contrary.In addition,an appropriate initial value plays a positive role in the solution of the Poisson equation,and this initial value can be obtained from the Ricci flow algorithm.So we combine the methods based on metric with the cross field methods.We use the discrete dynamic Ricci flow algorithm to generate an initial value for the Poisson equation,which speeds up the solution of the equation and ensures the convergence of the computation.Numerical experiments show that our method is effective in generating a quadrilateral mesh for models with features,and the quality of the quadrilateral mesh is reliable.

A Novel Approach to Design Distribution Preserving Framework for Big Data

In several fields like financial dealing,industry,business,medicine,et cetera,Big Data(BD)has been utilized extensively,which is nothing but a collection of a huge amount of data.However,it is highly complicated along with time-consuming to process a massive amount of data.Thus,to design the Distribution Preserving Framework for BD,a novel methodology has been proposed utilizing Manhattan Distance(MD)-centered Partition Around Medoid(MD–PAM)along with Conjugate Gradient Artificial Neural Network(CG-ANN),which undergoes various steps to reduce the complications of BD.Firstly,the data are processed in the pre-processing phase by mitigating the data repetition utilizing the map-reduce function;subsequently,the missing data are handled by substituting or by ignoring the missed values.After that,the data are transmuted into a normalized form.Next,to enhance the classification performance,the data’s dimensionalities are minimized by employing Gaussian Kernel(GK)-Fisher Discriminant Analysis(GK-FDA).Afterwards,the processed data is submitted to the partitioning phase after transmuting it into a structured format.In the partition phase,by utilizing the MD-PAM,the data are partitioned along with grouped into a cluster.Lastly,by employing CG-ANN,the data are classified in the classification phase so that the needed data can be effortlessly retrieved by the user.To analogize the outcomes of the CG-ANN with the prevailing methodologies,the NSL-KDD openly accessible datasets are utilized.The experiential outcomes displayed that an efficient result along with a reduced computation cost was shown by the proposed CG-ANN.The proposed work outperforms well in terms of accuracy,sensitivity and specificity than the existing systems.

Evolutionary privacy-preserving learning strategies for edge-based IoT data sharing schemes

The fast proliferation of edge devices for the Internet of Things(IoT)has led to massive volumes of data explosion.The generated data is collected and shared using edge-based IoT structures at a considerably high frequency.Thus,the data-sharing privacy exposure issue is increasingly intimidating when IoT devices make malicious requests for filching sensitive information from a cloud storage system through edge nodes.To address the identified issue,we present evolutionary privacy preservation learning strategies for an edge computing-based IoT data sharing scheme.In particular,we introduce evolutionary game theory and construct a payoff matrix to symbolize intercommunication between IoT devices and edge nodes,where IoT devices and edge nodes are two parties of the game.IoT devices may make malicious requests to achieve their goals of stealing privacy.Accordingly,edge nodes should deny malicious IoT device requests to prevent IoT data from being disclosed.They dynamically adjust their own strategies according to the opponent's strategy and finally maximize the payoffs.Built upon a developed application framework to illustrate the concrete data sharing architecture,a novel algorithm is proposed that can derive the optimal evolutionary learning strategy.Furthermore,we numerically simulate evolutionarily stable strategies,and the final results experimentally verify the correctness of the IoT data sharing privacy preservation scheme.Therefore,the proposed model can effectively defeat malicious invasion and protect sensitive information from leaking when IoT data is shared.

“Parenchyma transection-first”strategy is superior to“tunnel-first”strategy in robotic spleen-preserving distal pancreatectomy with conservation of splenic vessels

Background: Creating a tunnel between the pancreas and splenic vessels followed by pancreatic parenchyma transection(“tunnel-first” strategy) has long been used in spleen-preserving distal pancreatectomy(SPDP) with splenic vessel preservation(Kimura’s procedure). However, the operation space is limited in the tunnel, leading to the risks of bleeding and difficulties in suturing. We adopted the pancreatic “parenchyma transection-first” strategy to optimize Kimura’s procedure. Methods: The clinical data of consecutive patients who underwent robotic SPDP with Kimura’s procedure between January 2017 and September 2022 at our center were retrieved. The cohort was classified into a “parenchyma transection-first” strategy(P-F) group and a “tunnel-first” strategy(T-F) group and analyzed. Results: A total of 91 patients were enrolled in this cohort, with 49 in the T-F group and 42 in the P-F group. Compared with the T-F group, the P-F group had significantly shorter operative time(146.1 ± 39.2 min vs. 174.9 ± 46.6 min, P < 0.01) and lower estimated blood loss [40.0(20.0–55.0) m L vs. 50.0(20.0–100.0) m L, P = 0.03]. Failure of splenic vessel preservation occurred in 10.2% patients in the TF group and 2.4% in the P-F group( P = 0.14). The grade 3/4 complications were similar between the two groups( P = 0.57). No differences in postoperative pancreatic fistula, abdominal infection or hemorrhage were observed between the two groups. Conclusions: The pancreatic “parenchyma transection-first” strategy is safe and feasible compared with traditional “tunnel-first strategy” in SPDP with Kimura’s procedure.