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

arXiv 2022年

作者： Wei, Kang Li, Jun Ma, Chuan Ding, Ming Wei, Sha Wu, Fan Chen, Guihai Ranbaduge, Thilina School of Electrical and Optical Engineering Nanjing University of Science and Technology Nanjing210094 China Ministry of Education China Data61 CSIRO SydneyNSW2015 Australia Beijing100191 China The Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China The State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China

Recently, federated learning (FL) has emerged as a promising distributed machine learning (ML) technology, owing to the advancing computational and sensing capacities of end-user devices, as well as the increasing concerns on users' privacy. As a special architecture in FL, vertical FL (VFL) is capable of constructing a hyper ML model by embracing sub-models from different types of clients. These sub-models are trained locally by vertically partitioned data with distinct attributes. Therefore, the design of VFL is fundamentally different from that of conventional FL, raising new and unique research issues. In this paper, we aim to discuss key challenges in VFL with effective solutions, and conduct experiments on real-life datasets to shed light on these issues. Specifically, we first propose a general framework on VFL, and highlight the key differences between VFL and conventional FL. Then, we discuss research challenges rooted in VFL systems from four aspects, i.e., security and privacy risks, expensive computation and communication costs, possible structural damage caused by model splitting, and system heterogeneity. Afterwards, we develop solutions to addressing the aforementioned challenges, and conduct extensive experiments to showcase the effectiveness of the proposed solutions. Copyright © 2022, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Accelerating Real-Time Imaging for Radiotherapy: Leveraging Multi-GPU Training with PyTorch

Accelerating Real-Time Imaging for Radiotherapy: Leveraging ...

引用

International Conference on Machine Learning and Applications (ICMLA)

作者： Ruth Obe Brandt Kaufmann Kaelen Baird Sam Kadel Yasmin Soltani Mostafa Cham Matthias K. Gobbert Carlos A. Barajas Zhuoran Jiang Vijay R. Sharma Lei Ren Stephen W. Peterson Jerimy C. PoIf Dept. of Computer Science and of Software Engineering U. of Houston-Clear Lake USA Dept. of Mathematics and Statistics U. of San Francisco USA Dept. of Computer Science and of Mathematics Skidmore College USA Dept. of Computer Science and of Psychology Mount Holyoke College USA Dept. of Biomedical Engineering U. of Houston USA Dept. of Information Systems U. of Maryland Baltimore County Dept. of Mathematics and Statistics U. of Maryland Baltimore County Medical Physics Graduate Program Duke University USA Dept. of Radiation Oncology U. of Maryland School of Medicine USA Department of Radiation Oncology U. of Maryland School of Medicine USA Dept. of Physics U. of Cape Town South Africa H3D Inc. USA

Proton beam therapy is an advanced form of cancer radiotherapy that uses high-energy proton beams to deliver precise and targeted radiation to tumors. This helps to mit-igate unnecessary radiation exposure in healthy tissues. Real-time imaging of prompt gamma rays with Compton cameras has been suggested to improve therapy efficacy. However, the camera's non-zero time resolution leads to incorrect interaction classifications and noisy images that are insufficient for accurately assessing proton delivery in patients. To address the challenges posed by the Compton camera's image quality, machine learning techniques are employed to classify and refine the generated data. These machine-learning techniques include recurrent and feedforward neural networks. A PyTorch model was designed to improve the data captured by the Compton camera. This decision was driven by PyTorch's flexibility, powerful capabilities in handling sequential data, and enhanced G PU usage. This accelerates the model's computations on large-scale radiotherapy data. Through hyperparameter tuning, the validation accuracy of our PyTorch model has been improved from an initial 7 % to over 60 %. Moreover, the PyTorch Distributed Data Parallelism strategy was used to train the RNN models on multiple G PU s, which significantly reduced the training time with a minor impact on model accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Animating turbulent fluid with a robust and efficient high-order advection method

Animating turbulent fluid with a robust and efficient high-o...

引用

作者： Zhu, Jian Li, Silong Cai, Ruichu Hao, Zhifeng Huang, Guoheng Sheng, Bin Wu, Enhua School of Computers Guangdong University of Technology Guangzhou China School of Mathematics and Big Data Foshan University Foshan China Department of Computer Science & Engineering Shanghai Jiao Tong University Shanghai China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

The accuracy of advection has a great influence on the visual effect of fluid simulation. Constrained interpolation profile (CIP) method has been an important advection scheme because of its third-order accuracy and the fact that it only needs to be performed over a compact stencil, but extending it to high-dimensional advection equations is not easy, because it involves complex calculations and large memory overheads, and is usually unstable. In this article, we propose a stable and efficient three-dimensional (3D) CIP scheme which can maintain high accuracy but requires low computation and memory cost. We first construct an efficient two-dimensional (2D) CIP scheme based on dimensional splitting and local Taylor expansions, and then propose an effective way to extend it for 3D applications without decreasing the computational accuracy or affecting the stability. The experimental results show the advantages of our method over the state-of-the-art advection schemes. © 2020 John Wiley & Sons, Ltd.

关键词： Advection

来源：评论

学校读者我要写书评

暂无评论

A novel hybrid ensemble approach for wind speed forecasting with dual-stage decomposition strategy using optimized GRU and transformer models

引用

Energy 2025年 329卷

作者： Ullah, Sajid Chen, Xi Han, Han Wu, Junhao Dong, Jinghan Liu, Ruiqing Ding, Weijie Liu, Min Li, Qingli Qi, Honggang Huang, Yonggui Yu, Philip Lh East China Normal University Shanghai200241 China School of Geographic Sciences East China Normal University Shanghai200241 China Software Engineering Institute East China Normal University Shanghai200026 China State Key Laboratory of Estuarine and Coastal Research East China Normal University Shanghai200241 China Shanghai Key Laboratory of Multidimensional Information Processing East China Normal University Shanghai200241 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China Peking University Chongqing Research Institute of Big Data Chongqing High-tech Zone Science Valley Building 10 China Department of Mathematics and Information Technology The Education University of Hong Kong Hong Kong

Wind energy has attracted global interest owing to its sustainable and environmentally friendly characteristics. Nevertheless, precisely forecasting wind speed can be challenging due to its volatile and unpredictable nature. This paper presents a new hybrid forecasting approach based on dual stage decomposition mechanism, namely TMQGDT for wind speed prediction. At first, a decomposition technique called time-varying filtered based empirical mode decomposition (TVFEMD) is utilized to decompose the original wind speed data into several intrinsic mode functions (IMFs). Afterwards, multi-scale permutation entropy (MPE) is used to assess the complexity of each IMF. Based on the entropy values, the IMFs are further classified into high-frequency and low-frequency IMFs. To address the significant volatility observed in the high-frequency IMFs, discrete wavelet transform (DWT) method is employed to perform secondary decomposition. The low-frequency IMFs are forecasted using gated recurrent unit (GRU) model optimized with quantum particle swarm optimization (QPSO) algorithm, while the high-frequency IMFs are forecasted with the Transformer model. The proposed model is trained and validated using four wind speed time series datasets collected from Germany and China. Five individual models and six hybrid models are compared against the proposed model to validate the forecasting performance of the proposed TMQGDT model. The prediction outcomes reveals that the R2 of the model is 0.973, 0.968, 0.956, and 0.996 on the four dataset test sets, which has improved by 3.39 %, 3.93 %, 5.53 %, and 0.50 %, respectively, compared to the TVFEMD-MPE-QPSO-GRU-DWT-Autoformer model. The excellent accuracy performance of the TMQGDT model indicates that developing a hybrid model based on deep learning techniques using secondary decomposition mechanism and optimization algorithm can enhance the precision of wind speed prediction. © 2025

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

A Constraint Dissolving Approach for Nonsmooth Optimization over the Stiefel Manifold

arXiv

引用

arXiv 2022年

作者： Hu, Xiaoyin Xiao, Nachuan Liu, Xin Toh, Kim-Chuan School of Computer and Computing Science Hangzhou City University Hangzhou310015 China The Institute of Operations Research and Analytics National University of Singapore Singapore State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences University of Chinese Academy of Sciences China Department of Mathematics Institute of Operations Research and Analytics National University of Singapore Singapore119076 Singapore

This paper focus on the minimization of a possibly nonsmooth objective function over the Stiefel manifold. The existing approaches either lack efficiency or can only tackle prox-friendly objective functions. We propose a constraint dissolving function named NCDF and show that it has the same first-order stationary points and local minimizers as the original problem in a neighborhood of the Stiefel manifold. Furthermore, we show that the Clarke subdifferential of NCDF is easy to achieve from the Clarke subdifferential of the objective function. Therefore, various existing approaches for unconstrained nonsmooth optimization can be directly applied to nonsmooth optimization problems over the Stiefel manifold. We propose a framework for developing subgradient-based methods and establish their convergence properties based on prior works. Furthermore, based on our proposed framework, we can develop efficient approaches for optimization over the Stiefel manifold. Preliminary numerical experiments further highlight that the proposed constraint dissolving approach yields efficient and direct implementations of various unconstrained approaches to nonsmooth optimization problems over the Stiefel manifold. Copyright © 2022, The Authors. All rights reserved.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Atmosphere air temperature forecasting using the honey badger optimization algorithm: on the warmest and coldest areas of the world

引用

engineering Applications of Computational Fluid Mechanics 2023年第1期17卷

作者： Zhou, Jincheng Wang, Dan Band, Shahab S. Mirzania, Ehsan Roshni, Thendiyath School of Computer and Information Qiannan Normal University for Nationalities Duyun China Key Laboratory of Complex Systems and Intelligent Optimization of Guizhou Province Duyun China Key Laboratory of Complex Systems and Intelligent Optimization of Qiannan Duyun China School of Mathematics and Statistics Qiannan Normal University for Nationalities Duyun China Future Technology Research Center College of Future National Yunlin University of Science and Technology Douliou Taiwan Department of Water Engineering University of Tabriz Tabriz Iran Department of Civil Engineering National Institute of Technology Patna Bihar India

Precisely forecasting air temperature as a significant meteorological parameter has a critical role in environment quality management. Hence, this study employs a hybrid intelligent model for accurately monthly temperature forecasting for one to three times ahead in the hottest and coldest regions of the world. The hybrid model contains the artificial neural network (ANN) hybridized with the powerful hetaeristic Honey Badger Algorithm (HBA-ANN). The average mutual information (AMI) technique is employed to find the optimal time delay values for the temperature variable for different time horizons. Finally, the performance of the developed hybrid model is compared with the classical ANN and the Gene Expression Programming (GEP) using some statistical criteria, and the Taylor and scatter diagrams. Results indicated that in each time horizon, the HBA-ANN model with the lowest distance from observation points based on Taylor diagram, high values for NSE and R², and low values for RMSE, MAE, and RSR outperformed the ANN and GEP models in both training and testing phases. Hence, using the Honey Badger Algorithm could increase the accuracy of the model. This model's precise performance supports the case for it to be employed to forecast other environmental parameters. © 2023 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.

关键词： Air temperature artificial neural network forecasting honey badger algorithm hybrid model warmest and coldest regions

来源：评论

学校读者我要写书评

暂无评论

An Exploratory Study on the Introduction and Removal of Different Types of Technical Debt

arXiv

引用

arXiv 2021年

作者： Liu, Jiakun Huang, Qiao Xia, Xin Shihab, Emad Lo, David Li, Shanping College of Computer Science and Technology Zhejiang University China PengCheng Laboratory China College of Computer Science and Technology Zhejiang University China Faculty of Information Technology Monash University Melbourne Australia Department of Computer Science and Software Engineering Concordia University Canada School of Information Systems Singapore Management University Singapore

To complete tasks faster, developers often have to sacrifice the quality of the software. Such compromised practice results in the increasing burden to developers in future development. The metaphor, technical debt, describes such practice. Prior research has illustrated the negative impact of technical debt, and many researchers investigated how developers deal with a certain type of technical debt. However, few studies focused on the removal of different types of technical debt in practice. To fill this gap, we use the introduction and removal of different types of self-admitted technical debt (i.e., SATD) in 7 deep learning frameworks as an example. This is because deep learning frameworks are some of the most important software systems today due to their prevalent use in life-impacting deep learning applications. Moreover, the field of the development of different deep learning frameworks is the same, which enables us to find common behaviors on the removal of different types of technical debt across projects. By mining the file history of these frameworks, we find that design debt is introduced the most along the development process. As for the removal of technical debt, we find that requirement debt is removed the most, and design debt is removed the fastest. Most of test debt, design debt, and requirement debt are removed by the developers who introduced them. Based on the introduction and removal of different types of technical debt, we discuss the evolution of the frequencies of different types of technical debt to depict the unresolved sub-optimal trade-offs or decisions that are confronted by developers along the development process. We also discuss the removal patterns of different types of technical debt, highlight future research directions, and provide recommendations for practitioners. © 2021, CC BY.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut

arXiv

引用

arXiv 2022年

作者： Shaydulin, Ruslan Lotshaw, Phillip C. Larson, Jeffrey Ostrowski, James Humble, Travis S. JPMorgan Chase New YorkNY United States Quantum Computational Science Group Oak Ridge National Laboratory Oak RidgeTN37830 United States Mathematics and Computer Science Division Argonne National Laboratory LemontIL60439 United States Department of Industrial and Systems Engineering University of Tennessee at Knoxville KnoxvilleTN37996 United States Quantum Science Center Oak Ridge National Laboratory Oak RidgeTN37830 United States

Finding high-quality parameters is a central obstacle to using the quantum approximate optimization algorithm (QAOA). Previous work partially addresses this issue for QAOA on unweighted MaxCut problems by leveraging similarities in the objective landscape among different problem instances. However, we show that the more general weighted MaxCut problem has significantly modified objective landscapes, with a proliferation of poor local optima. Our main contribution is a simple rescaling scheme that overcomes these deleterious effects of weights. We show that for a given QAOA depth, a single "typical" vector of QAOA parameters can be successfully transferred to weighted MaxCut instances. This transfer leads to a median decrease in the approximation ratio of only 2.0 percentage points relative to a considerably more expensive direct optimization on a dataset of 34,701 instances with up to 20 nodes and multiple weight distributions. This decrease can be reduced to 1.2 percentage points at the cost of only 10 additional QAOA circuit evaluations with parameters sampled from a pretrained metadistribution, or the transferred parameters can be used as a starting point for a single local optimization run to obtain approximation ratios equivalent to those achieved by exhaustive optimization in 96.35% of our cases. Copyright © 2022, The Authors. All rights reserved.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Multi-Resolution Localization of Individual Logs in Wooden Piles Utilizing YOLO with Tiling on Client/Server Architectures 33

Multi-Resolution Localization of Individual Logs in Wooden P...

引用

33rd European Modeling and Simulation Symposium, EMSS 2021

作者： Praschl, Christoph Auersperg-Castell, Philipp Forster-Heinlein, Brigitte Zwettler, Gerald Adam Research Group Advanced Information Systems and Technology Research and Development Department University of Applied Sciences Upper Austria Softwarepark 11 Hagenberg4232 Austria Department of Software Engineering School of Informatics Communications and Media University of Applied Sciences Upper Austria Softwarepark 11 Hagenberg4232 Austria Bluedynamics Auersperg-Castell KG Kritzing 31 Freinberg4785 Austria Faculty of Computer Science and Mathematics University of Passau Innstraße 43 Passau94032 Germany

In industrial domains with time and cost intensive manual or semi-automated inspection the demand for automation is high. Utilizing state of the art deep learning models for localization in vision-based domains such as wood log analysis, the precision can be increased while reducing the demand for manual inspection. In this paper a YOLO network is trained on wood log images to allow for detection of single wood piles in images with hundreds and thousands instances. Due to the high variability in scale and large amount of wood logs within the images, common YOLO architectures are not applicable. Thus, tiling is necessitated to implicitly form a multi-resolution image pyramid. Due to lack in training data, besides common data augmentation modelling of different seasonal and weather conditions is applied. The wood log detection process can be run on a client/server architecture to allow for both, preview and refined results. Evaluation on real-world data sets shows an log detection accuracy of 82,9% utilizing a tiny YOLO model and 94,1% with a fully connected YOLO model, respectively. © 2021 The Authors.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Advanced encryption of image based on S-box and chaos 2D (LSMCL) 1

Advanced encryption of image based on S-box and chaos 2D (LS...

引用

1st International Conference on Innovative Research in Applied science, engineering and Technology, IRASET 2020

作者： Elazzaby, Fouzia Akkad, Nabil El Kabbaj, Samir IBN TOFAIL University Department of Mathematics Faculty of Sciences BP: 14000 Kenitra Morocco FSDM of Fez. Sidi Mohamed Ben Abdellah University LIIAN Department of Computer Science Laboratory of Engineering Systems and Applications ENSA of Fez Fez Morocco

ISBN: (纸本)9781728149790

Due to the excellent properties of the chaotic system and its bounded behavior from a nonlinear system, it appears as pseudo-random noise. It is therefore used to camouflage or amalgamate the information sent for secure transmission. This document discusses a new contribution of encryption of color images based on two chaotic logistic maps with 2D modulated sinusoidal coupling (LSMCL). This process goes through several operating cycles. First, we provide a procedure for generating a substitution box using a chaotic 2D map performing a total permutation of the pixels of the original image. In addition, we apply an XOR operator between the second map 2D and the resulting matrix this contributes to a remarkable change in the pixel values and to reinforce the scrambling of the image. We add two transformations grouping the three image channels. One transforms the rows and the other transforms the columns by a progressive shift. Finally, we provide some experimental results and theoretical simulations of our proposed algorithm which demonstrates its performance and efficiency with good protection against any illegal manipulation. © 2020 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：