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

A survey for light field super-resolution

High-Confidence Computing 2024年第1期4卷 118-129页

作者： Mingyuan Zhao Hao Sheng Da Yang Sizhe Wang Ruixuan Cong Zhenglong Cui Rongshan Chen Tun Wang Shuai Wang Yang Huang Jiahao Shen State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and EngineeringBeihang UniversityBeijing 100191China Key Laboratory of Data Science and Intelligent Computing International Innovation InstituteBeihang UniversityHangzhou 311115China State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang UniversityBeijing 100191China

Compared to 2D imaging data,the 4D light field(LF)data retains richer scene’s structure information,which can significantly improve the computer’s perception capability,including depth estimation,semantic segmentation,and LF ***,there is a contradiction between spatial and angular resolution during the LF image acquisition *** overcome the above problem,researchers have gradually focused on the light field super-resolution(LFSR).In the traditional solutions,researchers achieved the LFSR based on various optimization frameworks,such as Bayesian and Gaussian *** learning-based methods are more popular than conventional methods because they have better performance and more robust generalization *** this paper,the present approach can mainly divided into conventional methods and deep learning-based *** discuss these two branches in light field spatial super-resolution(LFSSR),light field angular super-resolution(LFASR),and light field spatial and angular super-resolution(LFSASR),***,this paper also introduces the primary public datasets and analyzes the performance of the prevalent approaches on these ***,we discuss the potential innovations of the LFSR to propose the progress of our research field.

关键词： Light field super-resolution Convolutional neural network Transformer Sub-aperture image Epipolar-plane image

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Fast Area Optimization Approach for Mixed Polarity Reed-Muller Logic Circuits

引用

Chinese Journal of Electronics 2024年第5期33卷 1165-1180页

作者： Yuhao ZHOU Zhenxue HE Jianhui JIANG Xiaojun ZHAO Fan ZHANG Limin XIAO Xiang WANG School of Software Engineering Tongji University Key Laboratory of Agricultural Big Data of Hebei Province Hebei Agricultural University School of Computer Science and Engineering Beihang University School of Electronic and Information Engineering Beihang University

Area has become one of the main bottlenecks restricting the development of integrated circuits. The area optimization approaches of existing XNOR/OR-based mixed polarity Reed-Muller(MPRM) circuits have poor optimization effect and efficiency. Given that the area optimization of MPRM logic circuits is a combinatorial optimization problem, we propose a whole annealing adaptive bacterial foraging algorithm(WAA-BFA), which includes individual evolution based on Markov chain and Metropolis acceptance criteria, and individual mutation based on adaptive probability. To address the issue of low conversion efficiency in existing polarity conversion approaches, we introduce a fast polarity conversion algorithm(FPCA). Moreover, we present an MPRM circuits area optimization approach that uses the FPCA and WAA-BFA to search for the best polarity corresponding to the minimum circuits area. Experimental results demonstrate that the proposed MPRM circuits area optimization approach is effective and can be used as a promising EDA tool.

关键词： Integrated circuits Microorganisms Annealing Logic circuits Circuits Benchmark testing Delays

来源：评论

学校读者我要写书评

暂无评论

Container-Aware Service Function Chains Placement and Optimization in Vehicular Edge Computing 22

Container-Aware Service Function Chains Placement and Optimi...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Zhang, Kaixin Hu, Shihong Qu, Zhihao Ye, Baoliu Hohai University School of Computer Science and Software Engineering China Nanjing University National Key Laboratory for Novel Software Technology China

ISBN: (纸本)9798331509712

In the domain of Vehicular Edge Computing (VEC), this paper addresses the complex problem of Service Function Chain (SFC) placement, which is crucial for the efficient deployment of cloud applications in vehicular environments. Our approach leverages Virtual Network Function (VNF) technology, transitioning network services from traditional hardware to more flexible, container-based edge computing frameworks. The primary objective is to organize these VNFs into functional SFCs, thereby minimizing service delays in VEC systems. SFC placement faces two significant challenges. The first is the sequential dependency among VNFs within an SFC, which adds substantial complexity to container deployment. The second challenge is the cold start delay of VNF containers, a critical issue in scenarios requiring swift response times, which negatively impacts service quality in VEC applications. To address these challenges, we propose a comprehensive model for SFC placement that considers the deployment status of VNF containers, acknowledging the complexity of this NP-hard problem. The core of our contribution is the development of the Single SFC Placement Algorithm (SSPA), a sophisticated, greedy-based approach designed for the effective placement of individual SFCs. We enhance this algorithm by incorporating a Particle Swarm Optimization (PSO) technique, making it capable of efficiently handling the placement of multiple SFCs. Our solution aims to improve edge resource utilization and mitigate startup delays associated with the initial activation of containers, thereby reducing service delays. Extensive experimental evaluations demonstrate that our algorithm achieves a 34.3% average reduction in service delay compared to four baselines and a 5.8% average reduction compared to other container-aware algorithms. © 2024 IEEE.

关键词： service function chain SFC placement vehicle edge computing virtual network function

来源：评论

学校读者我要写书评

暂无评论

ForkXplorer:an approach of fork summary generation

引用

Frontiers of Computer Science 2022年第2期16卷 1-15页

作者： Zhang ZHANG Xinjun MAO Chao ZHANG Yao LU Key Laboratory of Software Engineering for Complex Systems College of ComputerNational University of Defense TechnologyChangsha 410073China

Pull-based development has become an important paradigm for distributed software *** this model,each developer independently works on a copied repository(i.e.,a fork)from the central *** is essential for developers to maintain awareness of the state of other forks to improve collaboration *** this paper,we propose a method to automatically generate a summary of a *** first use the random forest method to generate the label of a fork,i.e.,feature implementation or a bug *** on the information of the fork-related commits,we then use the TextRank algorithm to generate detailed activity information of the ***,we apply a set of rules to integrate all related information to construct a complete fork *** validate the effectiveness of our method,we conduct 30 groups of manual experiment and 77 groups of case studies on *** propose Fea_(avg)to evaluate the performance of Fea_(avg)the generated fork summary,considering the content accuracy,content integrity,sentence fluency,and label extraction *** results show that the average of of the fork summary generated by this method is *** than 63%of project maintainers and the contributors believe that the fork summary can improve development efficiency.

关键词： open source software pull-based development fork summary distributed cooperative development

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable Intelligent Surface-Aided Covert Communications: A Multi-User Scenario

引用

IEEE Transactions on Vehicular Technology 2025年第6期74卷 10052-10057页

作者： Hu, Xiaoyan Zhao, Pengze Xiao, Han Zheng, Tong-Xing Wang, Wenjie Yang, Kun Xi'an Jiaotong University School of Information and Communications Engineering Xi'an710049 China Southeast University National Mobile Communications Research Laboratory Nanjing210096 China Nanjing University State Key Laboratory of Novel Software Technology Nanjing210008 China School of Intelligent Software and Engineering Suzhou215163 China University of Essex School of Computer Science and Electronic Engineering United Kingdom

This paper explores a multi-user covert communication scenario with the assistance of a reconfigurable intelligent surface (RIS). Except a covert user monitored by the warden, there are multiple public users existing in the service area. For the purpose of evaluating the efficacy of the covert communication system, a covert constraint is derived measuring the minimum detection error probability of the warden through the Kullback-Leibler (KL) divergence. Then an optimization problem is formulated to maximize the convert rate, while ensuring the constraints of covertness, transmit power and quality of service (QoS) for public users. A two-step iterative algorithm jointly designing the active and passive beamforming, is put forth to efficiently resolve this non-convex optimization problem. Additionally, the numerical results clearly demonstrate that the proposed RIS-assisted scheme can significantly enhance the covert communication performance on the premise of guaranteeing the public communication performance of the system. © 1967-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

An Adaptively Filtered Precise Integration Method Considering Perturbation for Stochastic Dynamics Problems

引用

Acta Mechanica Solida Sinica 2023年第2期36卷 317-326页

作者： Li Zhu Keqi Ye Dongwei Huang Feng Wu Wanxie Zhong State Key Laboratory of Structural Analysis Optimization and CAE Software for Industrial EquipmentDepartment of MechanicsFaculty of Vehicle Engineering and MechanicsDalian University of TechnologyDalian 116024China

The difficulty in solving stochastic dynamics problems lies in the need for a large number of repeated computations of deterministic dynamic equations,which has been a challenge in stochastic dynamics analysis and was discussed in this *** efficiently and accurately compute the exponential of the dynamics state matrix and the matrix functions due to external loads,an adaptively filtered precise integration method was proposed,which inherits the high precision of the precise integrationmethod,improves the computational efficiency and saves the memory ***,the perturbation method was introduced to avoid repeated computations of matrix exponential and terms due to external *** on the filtering and perturbation techniques,an adaptively filtered precise integration method considering perturbation for stochastic dynamics problems was *** numerical experiments,including a model of phononic crystal and a bridge model considering random parameters,were performed to test the performance of the proposed method in terms of accuracy and *** results show that the accuracy and efficiency of the proposed method are better than those of the existing precise integration method,the Newmark-βmethod and the Wilson-θmethod.

关键词： Precise integration method Stochastic dynamics problem Perturbation Filtered Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

A survey on federated learning:a perspective from multi-party computation

引用

Frontiers of Computer Science 2024年第1期18卷 93-103页

作者： Fengxia LIU Zhiming ZHENG Yexuan SHI Yongxin TONG Yi ZHANG Institute of Artificial Intelligence and Key Laboratory of Mathematics Informatics Behavioral Semantics Beihang UniversityBeijing 100191China State Key Laboratory of Software Development Environment and Advanced Innovation Center for Future Blockchain and Privacy Computing Beihang UniversityBeijing 100191China Pengcheng Laboratory Shenzhen 518055China Zhongguancun Laboratory Beijing 100190China Institute for Mathematical Sciences and Engineering Research Center of Financial Computing and Digital Engineering Renmin University of ChinaBeijing 100872China

Federated learning is a promising learning paradigm that allows collaborative training of models across multiple data owners without sharing their raw *** enhance privacy in federated learning,multi-party computation can be leveraged for secure communication and computation during model *** survey provides a comprehensive review on how to integrate mainstream multi-party computation techniques into diverse federated learning setups for guaranteed privacy,as well as the corresponding optimization techniques to improve model accuracy and training *** also pinpoint future directions to deploy federated learning to a wider range of applications.

关键词： sfederated learning multi-party ycomputation privacy-preserving data mining distributed learning

来源：评论

学校读者我要写书评

暂无评论

OpenSN: An Open Source Library for Emulating LEO Satellite Networks

引用

IEEE Transactions on Parallel and Distributed Systems 2025年第8期36卷 1574-1590页

作者： Lu, Wenhao Wang, Zhiyuan Zhang, Hefan Zhang, Shan Luo, Hongbin Beihang University School of Computer Science and Engineering Beijing 100191 China Zhongguancun Laboratory State Key Laboratory of Virtual Reality Technology and Systems Beijing 100191 China State Key Laboratory of Software Development Environment China

Low- earth-orbit (LEO) satellite constellations (e.g., Starlink) are becoming a necessary component of future Internet. There have been increasing studies on LEO satellite networking. It is a crucial problem how to evaluate these studies in a systematic and reproducible manner. In this paper, we present OpenSN, i.e., an open source library for emulating large-scale satellite network (SN). Different from Mininet-based SN emulators (e.g., LeoEM), OpenSN adopts container-based virtualization, thus allows for running distributed routing software on each node, and can achieve horizontal scalability via flexible multi-machine extension. Compared to other container-based SN emulators (e.g., StarryNet), OpenSN streamlines the interaction with Docker command line interface and significantly reduces unnecessary operations of creating virtual links. These modifications improve emulation efficiency and vertical scalability on a single machine. Furthermore, OpenSN separates user-defined configuration from container network management via a key-Value Database that records the necessary information for SN emulation. Such a separation architecture enhances the function extensibility. To sum up, OpenSN exhibits advantages in efficiency, scalability, and extensibility, thus is a valuable open source library that empowers research on LEO satellite networking. Experiment results show that OpenSN constructs mega-constellations 5X-10X faster than StarryNet, and updates link state 2X-4X faster than LeoEM. We also verify the scalability of OpenSN by successfully emulating the five-shell Starlink constellation with a total of 4408 satellites. © 1990-2012 IEEE.

关键词： Container low- earth-orbit satellite constellations satellite network emulator

来源：评论

学校读者我要写书评

暂无评论

Learning to represent code semantics

引用

Science China(Information Sciences) 2025年

作者： Fang LIU Ge LI Qianhui ZHAO Li ZHANG State Key Laboratory of Complex & Critical Software Environment School of Computer Science & Engineering Beihang University Key Laboratory of High Confidence Software Technologies (Peking University) Ministry of Education School of Computer Science Peking University

Code semantic learning serves as the basis of many program analysis tasks. Researchers have paid much effort to build robust and effective code representation models over the years. One line of work focuses on introducing the code structure into the representations. To further improve the robustness of the code representation, approaches based on compiler intermediate representations(IRs) are proposed. However, these IR-based models suffer from heavy computational costs and memory overhead. How to represent program semantics effectively and efficiently still remains a challenge. To this end, we propose EECS, an effective and efficient code semantic representation approach based on compiler IRs and a hybrid attention mechanism. For input representation, to address the unlimited vocabulary size issue in IR, we propose a variable identification strategy to allocate each register variable to a new ID that can represent their relative positions. Besides, we also extract the data flow information among the code blocks. Then we build a hierarchical multi-layer Transformer encoder to capture the data dependency information as well as the code semantics through a hybrid attention mechanism. To enable EECS to learn code semantics and functionality better, we optimize three objectives jointly during the training *** results on three code semantic understanding tasks show that EECS performs better than the state-of-the-art techniques, demonstrating the remarkable capability of EECS on program semantics understanding.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Personalized Federated Learning with Feature Alignment via Knowledge Distillation 21st

Personalized Federated Learning with Feature Alignment via...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Qi, Guangfei Qu, Zhihao Lyu, Shen-Huan Jia, Ninghui Ye, Baoliu Key Laboratory of Water Big Data Technology of Ministry of Water Resources College of Computer Science and Software Engineering Hohai University Nanjing China National Key Laboratory for Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9789819601189

Personalized Federated Learning (PFL) has gained significant attention for its ability to handle heterogeneous data effectively. Parameter decoupling is a typical approach to PFL. It decouples the model into a feature extractor and a classifier head, where the feature extractor is trained collaboratively to learn a common representation and the classifier head is personalized for local data. Since local training only learns personalized feature information and ignores global information, the generalization ability of the feature extractor is limited. To improve the performance of the local model, a feasible approach is to make the local feature extractor more generalized. However, prior work requires the transmission of additional feature data beyond the transmission of model parameters, which leads to privacy leakage and higher communication overhead. To address these shortcomings, we propose a PFL algorithm with feature alignment via knowledge distillation, named PFAKD. PFAKD enhances the training of local feature extractors by explicitly aligning each sample’s local features with global features, providing more detailed guidance. Meanwhile, it avoids additional communication overhead and the risk of privacy leakage. We conduct extensive experiments in heterogeneous data scenarios. PFAKD outperforms other state-of-the-art methods by up to 4.35% in terms of model accuracy. Our code is available at https://***/fei0829/PFAKD. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：