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

TechRxiv 2022年

作者： Liu, Xin Zhang, Dawei Li, Yingsong Huang, Zhixiang College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China Anhui Province Key Laboratory of Target Recognition and Feature Extraction Lu'An230088 China

In this paper, a super-broadband (SBB) rectifier using a wideband resistance compression network (WRCN) and harmonic cycling is proposed, simulated, fabricated, measured and analyzed in detail for the harvesting of ambient Radio frequency (RF) energy. Meanwhile, impedance compression and matching are achieved to implement the SBB using WRCN and impedance operation networks. Additionally, harmonic cycling structure and bending technology are employed to improve the power conversion efficiency (PCE) and reduce the size, respectively. For demonstration, a prototype of the proposed rectifier is fabricated and measured. The measured results are in good accordance with the simulated ones, indicating that the rectifier can provide high efficiency and ultra-broadband rectification characteristics. A PCE over 50% is realized at 3.5 GHz with an input power range of 6–24 dBm, and a PCE of 75% is obtained at an input power of 18 dBm. The PCE is greater than 50% at 17 dBm with an input frequency of 2.7–4.6 GHz. This work can find significant applications in the development of RF-harvesting. © 2022, CC BY.

关键词： Harvesting

来源：评论

学校读者我要写书评

暂无评论

A Note on the Conditional Fault-Tolerant Strong Menger Edge Connectivity of Regular Graphs∗

SSRN

引用

SSRN 2023年

作者： Li, Pingshan Xu, Min Cheng, Eddie Key Laboratory of Intelligent Computing & Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematical Sciences Beijing Normal University Laboratory of Mathematics and Complex Systems Ministry of Education Beijing100875 China Department of Mathematics and Statistics Oakland University RochesterMI48309 United States

A graph G is said to be strongly Menger edge-connected (SM-λ for short) if every two of its vertices u,v are connected by min{dG(u),dG(v)}) edge-disjoint paths, where dG(u) is the degree of u. The maximum conditional edge-fault-tolerant with respect to the SM-λ property of G, denoted by smrλ(G), is the maximum integer m such that G − F remains SM-λ for every edge set F with |F| ≤ m and δ(G−F) ≥ r. So far, most of the exact values of smrλ(G) are for the case when r ≤ 2 for special class of graphs. In this paper, we give a sufficient condition to characterize smrλ(G) for general r on regular graphs. As an application, we determine the exact value of smλ2 r −1(AQn) for 1 ≤ r ≤ n − 2 where AQn is the n-dimensional augmented cube. © 2023, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

High-Level Synthesis for Microfluidic Biochips Considering Actual Volume Management and Channel Storage

High-Level Synthesis for Microfluidic Biochips Considering A...

引用

IEEE International Symposium on Quality Electronic Design

作者： Zhengyang Chen Yuhan Zhu Zhen Chen Zhisheng Chen Genggeng Liu College of Computer and Data Science Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing (Fuzhou University) Fuzhou China School of Informatics Xiamen University Xiamen China

ISBN: (数字)9798350309270

ISBN: (纸本)9798350309287

In recent years, microfluidic biochips have been widely applied in various fields of human society. The emergence of distributed channel-storage architecture enables fluid to be directly cached within the flow channels without being transported to the dedicated storage. However, the volume of the flow channels is limited, it is important to carefully consider the fluid volume to be cached to ensure it can be accommodated within the appropriate flow channels. In this paper, we propose a high-level synthesis method considering actual volume management and channel storage through integer linear programming, providing a rational analysis of fluid caching and the temporal relationships between different fluid-handling tasks. Experimental results conducted on multiple benchmark tests demonstrate the effectiveness of the proposed method in reducing the completion time of bioassay, the number of caches, the maximum fluid caching volume, and the number of fluid-handling tasks.

关键词： Fluids Biochips Estimation Cells (biology) Integer linear programming Benchmark testing Task analysis

来源：评论

学校读者我要写书评

暂无评论

Optimizing Model-Driven Federated Learning for Rational and Data-Efficient in Social Mobile Network

引用

IEEE Network 2024年

作者： Lu, Jianfeng Zhang, Ying Cao, Shuqin Wang, Wei Tang, Changbing Wuhan University of Science and Technology School of Computer Science and Technology Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology Ministry of Education China Zhejiang Normal University College of Physics and Electronic Information Engineering Jinhua321004 China

With the rise of data-intensive services in mobile networks, the demand for intelligent and efficient learning frameworks has grown exponentially. Federated Learning (FL), as an emerging paradigm, enables decentralized edge devices to collaboratively train large models without sharing raw data, ensuring privacy preservation. However, deploying FL in resource-constrained mobile environments faces significant challenges, such as free-riding and malicious behavior. These challenges hinder model performance and raise concerns about data integrity and inter-user cooperation. To address these issues, we propose a layered dynamic framework for social mobile networks, called FedSMN, which aims to enhance the generalization ability of collaboratively trained large models in FL environments. FedSMN leverages Bayesian inference to evaluate user behavior and employs evolutionary game theory to simulate dynamic interactions, thereby optimizing cooperation strategies and reducing communication overhead. Unlike traditional approaches that assume fully rational actors, FedSMN accounts for irrational behavior and fluctuating resources, designing an efficient incentive mechanism to improve data utilization. Extensive experiments on large-scale datasets demonstrate that FedSMN increases model accuracy by 21% and reduces communication overhead by 49%, paving the way for scalable, intelligent mobile networks powered by large models. © 1986-2012 IEEE.

关键词： Collaborative learning

来源：评论

学校读者我要写书评

暂无评论

A Wideband Circularly Polarized Folded Transmitarray Antenna With Linearly Polarized Feed

A Wideband Circularly Polarized Folded Transmitarray Antenna...

引用

IEEE International Conference on Electronic Information and Communication Technology (ICEICT)

作者： Xiangdong Sun Xulong Guo Yin Li Yongliang Zhang Yingsong Li School of Electronic Information Engineering Inner Mongolia University Hohhot China Inner Mongolia Branch of National Computer Network Emergency Response Technical Team/Coordination Center of China Inner Mongolia University Hohhot China Peng Cheng Laboratory Shenzhen China School of Transportation Institute Inner Mongolia University Hohhot China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China

ISBN: (数字)9798350384437

ISBN: (纸本)9798350384444

A low-profile, high-gain, wideband circularly polarized folded transmitarray antenna (CPFTA) is proposed, and a polarization-selective linear-to-circular polarization (LP-CP) conversion element is introduced. The CPFTA consists of a linearly polarized (LP) magnetoelectric dipole antenna and a circularly polarized (CP) helical patch antenna. The CPFTA demonstrates excellent performance with a 3dB gain bandwidth of 29.5% and a 3dB axial ratio (AR) bandwidth of 40.9%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

SpreadFGL: Edge-Client Collaborative Federated Graph Learnin...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Luying Zhong Yueyang Pi Zheyi Chen Zhengxin Yu Wang Miao Xing Chen Geyong Min College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster UK School of Engineering Computing and Mathematics University of Plymouth UK Department of Computer Science University of Exeter UK

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms.

关键词： Training Accuracy Collaboration Benchmark testing Imputation Generators Topology

来源：评论

学校读者我要写书评

暂无评论

Singular Value Decomposition Compressed Ghost Imaging Based on Non-negative Constraints 11

Singular Value Decomposition Compressed Ghost Imaging Based ...

引用

2019第十一届数字图像处理国际会议

作者： Cheng Zhang Jun Tang Yuanyuan Zhu Meiqin Wang Qianwen Chen Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University

ISBN: (数字)9781510630765

ISBN: (纸本)9781510630758

Compressed ghost imaging can effectively enhance the quality of original image from far fewer measurements,but due to the non-negativity of the measurement matrix,the recover quality is thus *** this paper,singular value decomposition compressed ghost imaging is proposed;First,the singular value decomposition be used to decompose the measurement matrix,and then the optimized measurement matrix and measurements are used to recover the original *** experiments verify the superiority of our proposed singular value decomposition compression ghost imaging method.

关键词： ghost imaging compressed ghost imaging singular value decomposition compressed ghost imaging

来源：评论

学校读者我要写书评

暂无评论

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection 41

Size-Invariance Matters: Rethinking Metrics and Losses for I...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright 2024 by the author(s)

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

A quaternary analogue of Tang-Ding codes

arXiv

引用

arXiv 2023年

作者： Shi, Minjia Tao, Sihui Kim, Jon-Lark Solé, Patrick The Key Laboratory of Intelligent Computing Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China State Key Laboratory of Integrated Service Networks Xidian University Xi’an710071 China Department of Mathematics Sogang University Seoul Korea Republic of Aix Marseille Univ CNRS Centrale Marseille I2M Marseille France

In a recent paper, Tang and Ding introduced a class of binary cyclic codes of rate close to one half with a designed lower bound on their minimum distance. The definition involves the base 2 expansion of the integers in their defining set. In this paper we propose an analogue for quaternary codes. In addition, the performances of the subfield subcode and of the trace code (two binary cyclic codes) are investigated. Copyright © 2023, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FedCross: Intertemporal Federated Learning Under Evolutionary Games

arXiv

引用

arXiv 2024年

作者： Lu, Jianfeng Zhang, Ying Jia, Riheng Cao, Shuqin Liu, Jing Fu, Hao School of Computer Science and Technology Wuhan University of Science and Technology China Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology Ministry of Education China School of Computer Science and Technology Zhejiang Normal University China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China

Federated Learning (FL) mitigates privacy leakage in decentralized machine learning by allowing multiple clients to train collaboratively locally. However, dynamic mobile networks with high mobility, intermittent connectivity, and bandwidth limitation severely hinder model updates to the cloud server. Although previous studies have typically addressed user mobility issue through task reassignment or predictive modeling, frequent migrations may result in high communication overhead. Addressing this challenge involves not only dealing with resource constraints, but also finding ways to mitigate the challenges posed by user migrations. We therefore propose an intertemporal incentive framework, FedCross, which ensures the continuity of FL tasks by migrating interrupted training tasks to feasible mobile devices. Specifically, FedCross comprises two distinct stages. In Stage 1, we address the task allocation problem across regions under resource constraints by employing a multi-objective migration algorithm to quantify the optimal task receivers. Moreover, we adopt evolutionary game theory to capture the dynamic decision-making of users, forecasting the evolution of user proportions across different regions to mitigate frequent migrations. In Stage 2, we utilize a procurement auction mechanism to allocate rewards among base stations, ensuring that those providing high-quality models receive optimal compensation. This approach incentivizes sustained user participation, thereby ensuring the overall feasibility of FedCross. Finally, experimental results validate the theoretical soundness of FedCross and demonstrate its significant reduction in communication overhead. Copyright © 2024, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：