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

Asian and Pacific Conference on Synthetic Aperture Radar (APSAR)

作者： Minghu Fan Xianyu Zuo Junfeng Tian Key Laboratory of Big Data Analysis and Processing of Henan Province College of Computer Science and Information Engineering Henan University Kaifeng China

ISBN: (数字)9781728129129

ISBN: (纸本)9781728129136

R-D model is the most commonly location model in geometric processing of SAR images. How to improve its location accuracy has been one of the focuses in application. Based on the in-depth analysis of the solving process of R-D equation, two kinds of influencing factors are selected to study. They are elevation and satellite orbit interpolation method. Then, aiming at the pixel location of high-resolution spaceborne SAR images, three kinds of DEM and two orbit interpolation algorithms were studied. The experimental results show that these two kinds of factors mainly affect the location accuracy of range direction, both the horizontal and vertical resolution of elevation have great influence on location accuracy, the quartic polynomial orbit interpolation can meet requirements of high accuracy location, and further improvement of the location accuracy need other auxiliary means.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A layered parallel algorithm for data clustering via fuzzy c-means technique

Research Square

引用

Research Square 2021年

作者： Mu, Yashuang Wei, Wei Guo, Hongyue Sun, Lijun Key Laboratory of Grain Information Processing and Control Henan University of Technology Ministry of Education Zhengzhou450001 China School of Artificial Intelligence and Big Data Henan University of Technology Zhengzhou450001 China College of Information Science and Engineering Henan University of Technology Zhengzhou450001 China School of Maritime Economics and Management Dalian Maritime University Dalian116026 China Collaborative Innovation Center for Transport Studies Dalian Maritime University Dalian116026 China

In this study, a layered parallel algorithm via fuzzy c-means (FCM) technique, called LP-FCM, is proposed in the framework of Map-Reduce for data clustering problems. The LP-FCM mainly contains three layers. The first layer follows a parallel data partitioning method which is developed to randomly divide the original dataset into several subdatasets. The second layer uses a parallel cluster centers searching method based on Map-Reduce, where the classic FCM algorithm is applied to search the cluster centers for each subdataset in Map phases, and all the centers are gathered to the Reduce phase for the confirmation of the final cluster centers through FCM technique again. The third layer implements a parallel data clustering method based on the final cluster centers. After comparing with some famous classic random initialization sequential clustering algorithms which include K-means, K-medoids, FCM and MinMaxK-means on 20 benchmark datasets, the feasibility in terms of clustering accuracy is evaluated. Furthermore, the clustering time and the parallel performance are also tested on some generated large-scale datasets for the parallelism. © 2021, CC BY.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Li, Yuqing Yan, Nan Chen, Jing Wang, Xiong Hong, Jianan He, Kun Wang, Wei Li, Bo Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University RiZhao Information Technology Institute Rizhao276800 China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China Shanghai Jiao Tong University School of Cyber Science and Engineering Shanghai200240 China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

Cross-silo federated learning (FL) enables multiple institutions (clients) to collaboratively build a global model without sharing private data. To prevent privacy leakage during aggregation, homomorphic encryption (HE) is widely used to encrypt model updates, yet incurs high computation and communication overheads. To reduce these overheads, packed HE (PHE) has been proposed to encrypt multiple plaintexts into a single ciphertext. However, the original design of PHE assumes all clients share a single private key, making the system vulnerable to security threats of ciphertexts being intercepted and decrypted by honest-but-curious clients. Also, it does not consider the heterogeneity among different clients, resulting in undermined training efficiency with slow convergence and stragglers. To address these challenges, we propose FedPHE, a secure and efficient FL framework with PHE by jointly exploiting contribution-aware secure aggregation and straggler-resistant client selection. Using CKKS with sparsification and blinding, FedPHE achieves efficient secure aggregation that allows clients to only provide obscured encrypted updates while the server can perform aggregation by accounting for contributions of local updates. To mitigate the straggler effect, we devise a perturbed sketch-based selection to cherry-pick representative clients with heterogeneous models and computing capabilities in a communication-efficient and privacy-preserving manner. We show, through rigorous security analysis and extensive experiments, that FedPHE can efficiently safeguard clients' privacy, achieve 2.45-6.56× training speedup, cut the communication overhead by 1.32-24.85×, and reduce straggler effects by 1.89-2.78×. © 2004-2012 IEEE.

关键词： Privacy by design

来源：评论

学校读者我要写书评

暂无评论

Feature Location Benchmark for Decomposing and Reusing Android Apps

arXiv

引用

arXiv 2020年

作者： Tang, Yutian Zhou, Hao Xu, Zhou Luo, Xiapu Cai, Yan Zhang, Tao Department of Computing Hong Kong Polytechnic University Hong Kong School of Big Data and Software Engineering Chongqing University China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Faculty of Information Technology Macau University of Science and Technology China

Software reuse enables developers to reuse architecture, programs and other software artifacts. Realizing a systematical reuse in software brings a large amount of benefits for stakeholders, including lower maintenance efforts, lower development costs, and time to market. Unfortunately, currently implementing a framework for large-scale software reuse in Android apps is still a huge problem, regarding the complexity of the task and lacking of practical technical support from either tools or domain experts. Therefore, proposing a feature location benchmark for apps will help developers either optimize their feature location techniques or reuse the assets created in the benchmark for reusing. In this paper, we release a feature location benchmark, which can be used for those developers, who intend to compose software product lines (SPL) and release reuse in apps. The benchmark not only contributes to the research community for reuse research, but also helps participants in industry for optimizing their architecture and enhancing modularity. In addition, we also develop an Android Studio plugin named caIDE for developers to view and operate on the benchmark. Copyright © 2020, The Authors. All rights reserved.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Study of Star/Galaxy Classification Based on the XGBoost Algorithm

引用

Chinese Astronomy and Astrophysics 2019年第4期43卷 539-548页

作者： Chao, Li Wen-hui, Zhang Ji-ming, Lin College of Information and Communication Engineering Guilin University of Electronic Technology Guilin 541004 Key Laboratory of Cognitive Radio and Information Processing the Ministry of Education Guilin University of Electronic Technology Guilin 541004 Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin 541004 Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems Guilin University of Electronic Technology Guilin 541004

Machine learning has achieved great success in many areas today. The lifting algorithm has a strong ability to adapt to various scenarios with a high accuracy, and has played a great role in many fields. But in astronomy, the application of lifting algorithms is still rare. In response to the low classification accuracy of the dark star/galaxy source set in the Sloan Digital Sky Survey (SDSS), a new research result of machine learning, eXtreme Gradient Boosting (XGBoost), has been introduced. The complete photometric data set is obtained from the SDSS-DR7, and divided into a bright source set and a dark source set according to the star magnitude. Firstly, the ten-fold cross-validation method is used for the bright source set and the dark source set respectively, and the XGBoost algorithm is used to establish the star/galaxy classification model. Then, the grid search and other methods are used to adjust the XGBoost parameters. Finally, based on the galaxy classification accuracy and other indicators, the classification results are analyzed, by comparing with the models of function tree (FT), Adaptive boosting (Adaboost), Random Forest (RF), Gradient Boosting Decision Tree (GBDT), Stacked Denoising AutoEncoders (SDAE), and Deep Belief Nets (DBN). The experimental results show that, the XGBoost improves the classification accuracy of galaxies in the dark source classification by nearly 10% as compared to the function tree algorithm, and improves the classification accuracy of sources with the darkest magnitudes in the dark source set by nearly 5% as compared to the function tree algorithm. Compared with other traditional machine learning algorithms and deep neural networks, the XGBoost also has different degrees of improvement. © 2019

关键词： Stars: fundamental parameters—galaxies: fundamental parameters—techniques: photometric—methods: data analysis

来源：评论

学校读者我要写书评

暂无评论

Parallel Geometric Correction for Single Spaceborne SAR Image

Parallel Geometric Correction for Single Spaceborne SAR Imag...

引用

Asian and Pacific Conference on Synthetic Aperture Radar (APSAR)

ISBN: (数字)9781728129129

ISBN: (纸本)9781728129136

The fast processing of SAR images is of great significance for SAR applications, and parallel computing is the most common solution. The paper studied the parallel computing algorithm for the geometric correction of single spaceborne SAR image, which is based on a classical serial geometric correction algorithm. After fully analyzing the parallel features of the algorithm, a CPU-oriented and a GPU-oriented global parallel correction algorithm were designed. Then, two spaceborne SAR images were used to test the speedup performance of the two algorithms. The experimental results show that the two parallel algorithms can greatly improve the speed of the geometric correction of spaceborne SAR image, and the performance of CPU-oriented parallel algorithm is mainly related to the number of CPU/cores, while the performance of GPU-oriented parallel algorithm is mainly related to the data granularity, and the latter has very high speedup ratio and is an efficient method for geometric correction of spaceborne SAR image.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A unified adaptive recoding framework for Batched network coding

arXiv

引用

arXiv 2021年

作者： Yin, Hoover H.F. Tang, Bin Ng, Ka Hei Yang, Shenghao Wang, Xishi Zhou, Qiaoqiao The N-hop Technologies Limited Hong Kong The Institute of Network Coding The Chinese University of Hong Kong Hong Kong The School of Computer and Information Hohai University Nanjing China The Department of Physics The Chinese University of Hong Kong Hong Kong The School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Shenzhen Key Laboratory of IoT Intelligent Systems and Wireless Network Technology Shenzhen Research Institute of Big Data Shenzhen China The Department of Information Engineering The Chinese University of Hong Kong Hong Kong

Batched network coding is a variation of random linear network coding which has low computational and storage costs. In order to adapt to random fluctuations in the number of erasures in individual batches, it is not optimal to recode and transmit the same number of packets for all batches. Different distributed optimization models, which are called adaptive recoding schemes, were formulated for this purpose. The key component of these optimization problems is the expected value of the rank distribution of a batch at the next network node, which is also known as the expected rank. In this paper, we put forth a unified adaptive recoding framework with an arbitrary recoding field size. We show that the expected rank functions are concave when the packet loss pattern is a stationary stochastic process, which covers but not limited to independent packet loss and Gilbert-Elliott packet loss model. Under this concavity assumption, we show that there always exists a solution which not only can minimize the randomness on the number of recoded packets but also can tolerate rank distribution errors due to inaccurate measurements or limited precision of the machine. We provide an algorithm to obtain such an optimal optimal solution, and propose tuning schemes that can turn any feasible solution into a desired optimal solution. © 2021, CC BY-NC-ND.

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

Study on the Influence of Rainfall Infiltration on the High rock Slope of Open-pit Mine Stability using a New Nonlinear Strength Reduction Method

Research Square

引用

Research Square 2021年

作者： Zhou, Tianbai Zhang, Lingfan Cheng, Jian Wang, Jianming Zhang, Xiaoyu Li, Maoyuan Research Institute of Mine Big Data China Coal Research Institute Beijing100013 China State Key Laboratory of Coal Mining and Clean Utilization Beijing100013 China School of Mechanics and Civil Engineering China University of Mining and Technology Beijing100083 China Institute of Geotechnical Engineering RWTH Aachen University Mies-van-der-Rohe-Str. 1 Aachen52074 Germany Ansteel Beijing Research Institute Beijing102209 China Housing and Urban Rural Development Bureau Sichuan Qionglai City611500 China

Due to long-term mining, a series of high and steep rock slopes have been formed in the open-pit mine. For high rock slopes, rainfall infiltration is the main cause of landslide. Therefore, the stability analysis of high rock slope under rainfall has become a key issue in the open-pit mine engineering. In this work, aiming at the high stress condition of high rock slope, the instantaneous internal friction angle and instantaneous cohesion of rock mass under different stress states are deduced, and the a nonlinear strength reduction method for high rock slope is established according to the relationship between normal stress and shear stress of rock mass under the Hoke-Brown criterion. The numerical calculation results show that the factor of safety (FOS) for high rock slope calculated by the proposed method is more reasonable. Taking the southwest slope of Dagushan Iron Mine as the research background, the safety factors of high rock slope under different rainfall conditions are calculated by COMSOL Multiphysics. And the stability analysis of high rock slope in open-pit mine under rainfall are carried out. © 2021, CC BY.

关键词： Rocks

来源：评论

学校读者我要写书评

暂无评论

Computation Offloading and Content Caching with Traffic Flow Prediction for Internet of Vehicles in Edge Computing

Computation Offloading and Content Caching with Traffic Flow...

引用

IEEE International Conference on Web Services (ICWS)

作者： Zijie Fang Xiaolong Xu Fei Dai Lianyong Qi Xuyun Zhang Wanchun Dou School of Computer and Software Nanjing University of Information Science and Technology Nanjing China School of Big Data and Intelligence Engineering Southwest Forestry University Kunming China School of Information Science and Engineering Qufu Normal University China Macquarie University Australia State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

ISBN: (数字)9781728187860

ISBN: (纸本)9781728187877

The development of the Internet of Vehicles (IoV) enables numerous emerging in-vehicle applications to accommodate users with various contents, thus enhancing their traveling experiences. In IoV, content decoding tasks are typically offloaded to edge servers for implementation, as edge computing is an admirable paradigm to provide low-latency services. However, as different vehicular users may request the same contents, processing these contents repeatedly leads to the waste of storage, computation and bandwidth resources. Therefore, fine-grained computation offloading and content caching are demanded in IoV. In this paper, a joint optimization method for computation offloading and content caching based on traffic flow prediction, named COC, is proposed. Firstly, traffic flow covered by each edge server is predicted by a modified deep spatiotemporal residual network (ST-ResNet). Secondly, the non-dominated sorting genetic algorithm III (NSGA-III) is leveraged to realize the many-objective optimization to shorten the execution time and reduce the energy consumption of computation and transmission in IoV. Finally, evaluated by real-world big data from Nanjing China, COC shows a great reduction in execution time and energy consumption of transmission and computation compared to other methods.

关键词： Energy consumption Intelligent vehicles Web services Optimization methods Bandwidth Servers Edge computing

来源：评论

学校读者我要写书评

暂无评论

Dynamic Task Offloading with Minority Game for Internet of Vehicles in Cloud-Edge Computing

Dynamic Task Offloading with Minority Game for Internet of V...

引用

IEEE International Conference on Web Services (ICWS)

作者： Bowen Shen Xiaolong Xu Fei Dai Lianyong Qi Xuyun Zhang Wanchun Dou School of Computer and Software Nanjing University of Information Science and Technology Nanjing China School of Big Data and Intelligence Engineering Southwest Forestry University Kunming China School of Information Science and Engineering Qufu Normal University China Macquaire University Australia State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

ISBN: (数字)9781728187860

ISBN: (纸本)9781728187877

With the advent of the Internet of Vehicles (IoV), drivers are now provided with diverse time-sensitive vehicular services that usually require a large scale of computation. As civilian vehicles are generally insufficient in computational resources, their service requests are offloaded to cloud data centers and edge computing devices (ECDs) with ample computational resources to enhance the quality of service (QoS). However, ECDs are often overloaded with excessive service requests. In addition, as the network conditions and service compositions are complicated and dynamic, the centralized control of ECDs is hard to achieve. To tackle these challenges, a dynamic task offloading method with minority game (MG) in cloud-edge computing, named DOM, is proposed in this paper. Technically, MG is an effective tool with a distributed mechanism which can minimize the dependency on centralized control in resource allocation. In the MG, reinforcement learning (RL) is applied to optimize the distributed decision-making of participants. Finally, with a real-world dataset of IoV services, the effectiveness and adaptability of DOM are evaluated.

关键词： Cloud computing Games Quality of service Reinforcement learning Space exploration Task analysis Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：