检索结果-内蒙古大学图书馆

MIDDLE: A Mobility-Driven Device-Edge-Cloud Federated Learning Framework

IEEE Transactions on Mobile computing 2025年第06期24卷 4589-4606页

作者： Zhang, Songli Zheng, Zhenzhe Wu, Fan Li, Bingshuai Shao, Yunfeng Chen, Guihai Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems China Huawei Technologies Huawei Noah's Ark Lab China

Federated learning (FL) can be implemented in large-scale wireless networks in a hierarchical way, introducing edge servers as relays between the cloud server and devices. These devices are dispersed within multiple clusters coordinated by edges. However, the devices are typically mobile users with unpredictable trajectories, and the impact of their mobility on the model training process is not well-studied. In this work, we propose a new MobIlity-Driven feDerated LEarning framework, namely MIDDLE. MIDDLE addresses unbalanced model updates by capitalizing on model aggregation opportunities on mobile devices due to their mobility across edges. It consists of two components: on-device model aggregation, which aggregates models from different edges carried by mobile devices as they move across edges, and in-edge device selection, adjusting the current edge optimization direction through careful device selection. Theoretical analysis emphasizes that on-device model aggregation can reduce bias in model updating on edges and the cloud, thereby accelerating the FL model convergence. Building on this analysis, we introduce on-device global control averaging, modifying the training process on mobile devices and extending MIDDLE into MIDDLE+. Extensive experimental results validate that MIDDLE and MIDDLE+ can reduce the time steps to reach the target accuracy by 19.44% and 20.37% at least, respectively. © 2002-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges

引用

IEEE Transactions on Knowledge and Data Engineering 2025年第6期37卷 3342-3355页

作者： Zhou, Xiaotian Zehmakan, Ahad N. Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China Institute of Intelligent Complex Systems Fudan University Shanghai200433 China School of Computing Australian National University Canberra Australia

The Kirchhoff index, which is the sum of the resistance distance between every pair of nodes in a network, is a key metric for gauging network performance, where lower values signify enhanced performance. In this paper, we study the problem of minimizing the Kirchhoff index by adding edges. We first provide a greedy algorithm for solving this problem and give an analysis of its quality based on the bounds of the submodularity ratio and the curvature. Then, we introduce a gradient-based greedy algorithm as a new paradigm to solve this problem. To accelerate the computation cost, we leverage geometric properties, convex hull approximation, and approximation of the projected coordinate of each point. To further improve this algorithm, we use pre-pruning and fast update techniques, rending its especially apt for large-scale networks. Our proposed algorithms have nearly-linear time complexity. We provide extensive experiments on ten real networks to evaluate the quality of our algorithms. The results demonstrate that our proposed algorithms outperform the state-of-the-art methods in terms of efficiency and effectiveness. Moreover, our algorithms are scalable to large graphs with over 5 million nodes and 12 million edges. © 2025 IEEE Computer Society. All rights reserved.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Encoder-Decoder Framework for Carpooling Route Planning

引用

IEEE Transactions on Mobile computing 2025年

作者： Gao, Yucen Ma, Li Yu, Zhemeng Zhang, Songjian Gao, Hui Fang, Jun Gao, Xiaofeng Shanghai Jiao Tong University Shanghai Key Laboratory of Scalable Computing and Systems College of Computer Science and Engineering Shanghai200240 China Didi Global Inc. Beijing100190 China

Carpooling Route Planning (CRP) has become an important issue with the growth of low-carbon traffic systems. We investigate a novel, meaningful and challenging scenario for CRP in industry, called Multi-Candidate Carpooling Route Planning (MCRP) problem, where each passenger may have several potential positions to get on and off the car. We surprisingly notice that this problem can be easily generalized for similar services such as express, takeout, or crowdsensing services, which means MCRP is a new fundamental combinatorial optimization problem. Traditional graph search algorithms or indexing methods are usually time and space consuming or perform poorly, which are not suitable for solving the problem. In this paper, we propose an end-to-end encoder-decoder model to plan a route for each many-to-one carpooling order with various data-driven mechanisms such as graph partitioning and feature crossover. The encoder is a filter-integrated Graph Convolution Network with external information fusion combining a supervised pre-training classification task, while the latter mimics a pointer network with a rule-based mask mechanism and a domain feature crossover module. We validate the effectiveness and efficiency of our model based on both synthetic and real-world datasets. Our code is available at https://***/GaoYucen/Lite-GD © 2002-2012 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Quality over Quantity: Boosting Data Efficiency Through Ensembled Multimodal Data Curation

arXiv

引用

arXiv 2025年

作者： Xu, Jinda Song, Yuhao Wang, Daming Zhao, Weiwei Chen, Minghua Chen, Kangliang Li, Qinya Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China HAOMO.AI Technology Co. Ltd. China

In an era overwhelmed by vast amounts of data, the effective curation of web-crawl datasets is essential for optimizing model performance. This paper tackles the challenges associated with the unstructured and heterogeneous nature of such datasets. Traditional heuristic curation methods often inadequately capture complex features, resulting in biases and the exclusion of relevant data. We introduce an advanced, learning-driven approach, Ensemble Curation Of DAta ThroUgh Multimodal Operators (EcoDatum), incorporating a novel quality-guided deduplication method to ensure balanced feature distributions. EcoDatum strategically integrates various unimodal and multimodal data curation operators within a weak supervision ensemble framework, utilizing automated optimization to score each data point effectively. EcoDatum, which significantly improves the data curation quality and efficiency, outperforms existing state-of-the-art (SOTA) techniques, ranked 1st on the DataComp leaderboard, with an average performance score of 0.182 across 38 diverse evaluation datasets. This represents a 28% improvement over the DataComp baseline method, demonstrating its effectiveness in improving dataset curation and model training efficiency. © 2025, CC BY-NC-SA.

关键词： Data quality

来源：评论

学校读者我要写书评

暂无评论

Embedding differential privacy in decision tree algorithm with different depths

引用

Science China(Information Sciences) 2017年第8期60卷 136-150页

作者： Xuanyu BAI Jianguo YAO Mingxuan YUAN Ke DENG Xike XIE Haibing GUAN Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University

Differential privacy(DP) has become one of the most important solutions for privacy protection in recent years. Previous studies have shown that prediction accuracy usually increases as more data mining(DM)logic is considered in the DP implementation. However, although one-step DM computation for decision tree(DT) model has been investigated, existing research has not studied the scenarios when the DP is embedded in two-step DM computation, three-step DM computation until the whole model DM computation. It is very challenging to embed DP in more than two steps of DM computation since the solution space exponentially increases with the increase of computational complexity. In this work, we propose algorithms by making use of Markov Chain Monte Carlo(MCMC) method, which can efficiently search a computationally infeasible space to embed DP into DT generation algorithm. We compare the performance when embedding DP in DT with different depths, i.e., one-step DM computation(previous work), two-step, three-step and the whole model. We find that the deep combination of DP and DT does help to increase the prediction accuracy. However, when the privacy budget is very large(e.g., ? = 10), this may overwhelm the complexity of DT model, and the increasing trend is not obvious. We also find that the prediction accuracy decreases with the increase of model complexity.

关键词： differential privacy decision tree exponential mechanism exhaustive search MCMC

来源：评论

学校读者我要写书评

暂无评论

Wide-Sense Nonblocking Conditions for Flex-grid OXC-Clos Networks

引用

IEEE Journal on Selected Areas in Communications 2025年

作者： Yao, Yibei Ye, Tong Deng, Ning Shanghai Jiao Tong University State Key Laboratory of Advanced Optical Communication Systems and Networks Shanghai China Great Bay University School of Computing and Information Technology Guangdong China

The emerging high-capacity optical networks make it urgent to design large-scale flexible mesh optical cross-connect (OXC). Though Clos networks are the theory for building scalable and cost-effective switching fabrics, the nonblocking conditions for flex-grid optical Clos networks without wavelength conversion remain unknown. This paper studies the nonblocking conditions for the flex-grid OXC-Clos network, which is constructed from a number of small-size standard OXCs. We first show that a strictly nonblocking (SNB) OXC-Clos network will incur a high cost, as small-granularity lightpaths may abuse central modules (CMs), rendering them unavailable for large-granularity requests due to frequency conflicts. Hence, we propose a granularity differential routing (GDR) strategy, the idea of which is to restrict the set of CMs that can be utilized by the lightpaths of each granularity. Under the GDR strategy, we investigate two system models, called granularity-port binding and unbinding models, and prove the wide-sense nonblocking (WSNB) conditions. We show that the cost of WSNB network is remarkably smaller than that of SNB network, and find that the granularity-port unbinding model can offer more flexible network-bandwidth utilization compared to the binding model, with a slight cost associated with switching fabrics. © 1983-2012 IEEE.

关键词： Cross connections (water distribution)

来源：评论

学校读者我要写书评

暂无评论

Against Mobile Collusive Eavesdroppers: Cooperative Secure Transmission and Computation in UAV-Assisted MEC Networks

引用

IEEE Transactions on Mobile computing 2025年第06期24卷 5280-5297页

作者： Zhao, Mingxiong Wang, Zirui Guo, Kun Zhang, Rongqian Quek, Tony Q. S. Ministry of Education Engineering Research Center of Integration and Application of Digital Learning Technology Beijing100039 China Ministry of Education Engineering Research Center of Cyberspace Kunming650504 China Yunnan University of Finance and Economics Yunnan Key Laboratory of Service Computing Kunming650221 China Yunnan University Yunnan Key Laboratory of Software Engineering Kunming650091 China East China Normal University Shanghai Key Laboratory of Multidimensional Information Processing School of Communications and Electronics Engineering Shanghai200241 China Yunnan University School of Information Science and Engineering Kunming650500 China Singapore University of Technology and Design Information Systems Technology and Design 487372 Singapore National Pilot School of Software Yunnan University Kunming China

In Unmanned Aerial Vehicle (UAV)-assisted Mobile Edge computing (MEC) networks, the security of transmission faces significant challenges due to the vulnerabilities of line-of-sight links and potential eavesdropping on two-hop links. This paper addresses these challenges with an innovative Cooperative Secure Transmission and Computation strategy (CSTC), specifically engineered for time-slotted UAV-assisted MEC networks plagued by mobile collusive eavesdroppers. These eavesdroppers significantly bolster their interception capabilities through coordinated and optimized movements, escalating the security threats. To neutralize these risks, the proposed CSTC employs the UAV and remote devices as helper nodes to emit jamming signals, thereby thwarting eavesdropping activities, while simultaneously facilitating the efficient relay of users' tasks to the base station for advanced processing. The CSTC aims to maximize the sum Secrecy Transmission Rate (STR) satisfying task latency constraints. It involves a joint optimization of UAV trajectory, jamming beamformers, transmit power, and data offloading strategy to expedite task transmission. Additionally, a real-time computation scheduling approach is developed based on a newly defined metric, the Urgency Degree of Users (UDoU), to enhance task processing efficiency. Our extensive simulations validate that the CSTC not only elevates the sum STR but also consistently meets latency constraints, demonstrating its robustness against advanced mobile eavesdropping techniques. © 2002-2012 IEEE.

关键词： Jamming

来源：评论

学校读者我要写书评

暂无评论

Single-cell omics: experimental workflow, data analyses and applications

引用

Science China(Life Sciences) 2025年第1期68卷 5-102页

作者： Fengying Sun Haoyan Li Dongqing Sun Shaliu Fu Lei Gu Xin Shao Qinqin Wang Xin Dong Bin Duan Feiyang Xing Jun Wu Minmin Xiao Fangqing Zhao Jing-Dong J.Han Qi Liu Xiaohui Fan Chen Li Chenfei Wang Tieliu Shi Department of Clinical Laboratory the Affiliated Wuhu Hospital of East China Normal University(The Second People’s Hospital of Wuhu City)Wuhu 241000China Pharmaceutical Informatics Institute College of Pharmaceutical SciencesZhejiang UniversityHangzhou 310058China Key Laboratory of Spine and Spinal Cord Injury Repair and Regeneration(Tongji University) Ministry of EducationOrthopaedic DepartmentTongji HospitalBioinformatics DepartmentSchool of Life Sciences and TechnologyTongji UniversityShanghai 200082China Frontier Science Center for Stem Cells School of Life Sciences and TechnologyTongji UniversityShanghai 200092China Translational Medical Center for Stem Cell Therapy and Institute for Regenerative Medicine Shanghai East HospitalBioinformatics DepartmentSchool of Life Sciences and TechnologyTongji UniversityShanghai 200082China Research Institute of Intelligent Computing Zhejiang LabHangzhou 311121China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai 201210China Center for Single-cell Omics School of Public HealthShanghai Jiao Tong University School of MedicineShanghai 200025China National Key Laboratory of Chinese Medicine Modernization Innovation Center of Yangtze River DeltaZhejiang UniversityJiaxing 314103China Center for Bioinformatics and Computational Biology Shanghai Key Laboratory of Regulatory Biologythe Institute of Biomedical Sciences and School of Life SciencesEast China Normal UniversityShanghai 200241China Beijing Institutes of Life Science Chinese Academy of SciencesBeijing 100101China Peking-Tsinghua Center for Life Sciences Academy for Advanced Interdisciplinary StudiesCenter for Quantitative Biology(CQB)Peking UniversityBeijing 100871China Zhejiang Key Laboratory of Precision Diagnosis and Therapy for Major Gynecological Diseases Women’s HospitalZhejiang University School of MedicineHangzhou 310006China Key Laboratory of Advanced Theory and Application in Statistics and Data Science-MOE School of StatisticsEast China Normal U

Cells are the fundamental units of biological systems and exhibit unique development trajectories and molecular *** exploration of how the genomes orchestrate the formation and maintenance of each cell,and control the cellular phenotypes of various organismsis,is both captivating and *** the inception of the first single-cell RNA technology,technologies related to single-cell sequencing have experienced rapid advancements in recent *** technologies have expanded horizontally to include single-cell genome,epigenome,proteome,and metabolome,while vertically,they have progressed to integrate multiple omics data and incorporate additional information such as spatial scRNA-seq and CRISPR ***-cell omics represent a groundbreaking advancement in the biomedical field,offering profound insights into the understanding of complex diseases,including ***,we comprehensively summarize recent advances in single-cell omics technologies,with a specific focus on the methodology *** overview aims to guide researchers in selecting appropriate methods for single-cell sequencing and related data analysis.

关键词： single-cell sequencing genome epigenome proteomics metabolomics multimodal spatial transcriptomics CRISPR screening

来源：评论

学校读者我要写书评

暂无评论

Multiscale Temporal-Convolution and Attention Improved Neural Network for Biased Mental State Recognition 17th

Multiscale Temporal-Convolution and Attention Improved Neur...

引用

17th International Conference on Brain Informatics, BI 2024

作者： Zuo, Guoyu Xiao, Erjun Zhang, Tielin Beijing Key Laboratory of Computing Intelligence and Intelligent Systems Beijing University of Technology Beijing100124 China Center for Excellence in Brain Science and Intelligence Technology University of Chinese Academy of Sciences Shanghai200031 China

ISBN: (纸本)9789819632930

Accurate detection of mental state is vital for sleep assessment and anesthesia monitoring. However, challenges exist, including 1) limited data sources caused by few modalities, few channels, biased sample distribution, or large individual differences;2) multiscale dynamic feature of mental state signals, containing complex and dynamic fluctuations. In this paper, we proposed a multiscale temporal convolution and attention improved neural network (MTA-NN) to handle these two challenges, including: a preprocessing method using a clustering-first and label-generation approach for data augmentation involves filtering the production samples to mitigate the impact of noise on model performance;multiscale temporal-convolution module for detecting different scales of temporal and frequency features;an attention module for decoding key features in different spatial and temporal channels, and for setting the importance of historical dependencies;a full-connection layer is designed to recognize different sleep stage. The proposed MTA-NN is then verified in three typical sleep-state recognition tasks, including SleepEDF-20, SleepEDF-78, and ISRUC3. Compared to some state-of-the-art algorithms, the proposed MTA-NN achieves higher performance. Further ablation experiments show the necessary and importance of these designed sub modules in MTA-NN. We consider the same algorithm can also be extended to further similar mental state recognition tasks such as anesthesia monitoring. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Anesthesiology

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design

引用

IEEE Transactions on Information Theory 2025年第3期71卷 1803-1823页

作者： Xiao, Shuixin Wang, Yuanlong Zhang, Jun Dong, Daoyi Mooney, Gary J. Petersen, Ian R. Yonezawa, Hidehiro University of New South Wales School of Engineering and Technology CanberraACT2600 Australia University of Michigan-Shanghai Jiao Tong University Joint Institute Shanghai Jiao Tong University Shanghai200240 China The Australian National University School of Engineering CanberraACT2601 Australia Chinese Academy of Sciences Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing100190 China The Australian National University CIICADA Laboratory School of Engineering CanberraACT2601 Australia The University of Melbourne School of Physics ParkvilleVIC3010 Australia RIKEN Center for Quantum Computing Saitama351-0198 Japan Centre for Quantum Computation and Communication Technology Australian Research Council CanberraACT2600 Australia

Quantum process tomography is a critical task for characterizing the dynamics of quantum systems and achieving precise quantum control. In this paper, we propose a two-stage solution for both trace-preserving and non-trace-preserving quantum process tomography. Utilizing a tensor structure, our algorithm exhibits a computational complexity of O(MLd2) where d is the dimension of the quantum system and M, L(M≥ d2, L≥ d2) represent the numbers of different input states and measurement operators, respectively. We establish an analytical error upper bound and then design the optimal input states and the optimal measurement operators, which are both based on minimizing the error upper bound and maximizing the robustness characterized by the condition number. Numerical examples and testing on IBM quantum devices are presented to demonstrate the performance and efficiency of our algorithm. © 1963-2012 IEEE.

关键词： Error analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：