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

arXiv 2023年

作者： Pasechnyuk, Dmitrii A. Gasnikov, Alexander Takáč, Martin Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates Moscow Institute of Physics and Technology Russia Kharkevich Institute for Information Transmission Problems RAS Russia Ivannikov Institute for System Programming RAS Russia

Preconditioning is a crucial operation in gradient-based numerical optimisation. It helps decrease the local condition number of a function by appropriately transforming its gradient. For a convex function, where the gradient can be computed exactly, the optimal linear transformation corresponds to the inverse of the Hessian operator, while the optimal convex transformation is the convex conjugate of the function. Different conditions result in variations of these dependencies. Practical algorithms often employ low-rank or stochastic approximations of the inverse Hessian matrix for preconditioning. However, theoretical guarantees for these algorithms typically lack a justification for the defining property of preconditioning. This paper presents a simple theoretical framework that demonstrates, given a smooth function and an available unbiased stochastic approximation of its gradient, that it is possible to refine the dependency of the convergence rate on the Lipschitz constant of the *** Codes 65K10 © 2023, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

A Horizontal Federated Learning Approach to IoT Malware Traffic Detection: An Empirical Evaluation with N-BaIoT Dataset 26

A Horizontal Federated Learning Approach to IoT Malware Traf...

引用

26th International Conference on Advanced Communications technology, ICACT 2024

作者： Do, Phuc Hao Le, Tran Duc Vishnevsky, Vladimir Berezkin, Aleksandr Kirichek, Ruslan The Bonch-Bruevich Saint-Petersburg State University of Telecommunications Saint-Petersburg Russia Danang Architecture University Da Nang Viet Nam University of Telecommunications Department of Communication Networks and Data Transmission at Bonch-Bruevich Saint-Petersburg State Russia University of Science and Technology The University of Danang Da Nang Viet Nam The University of Danang University of Science and Technology Information Technology Faculty Danang Viet Nam V. A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences Moscow Russia Institute of Control Sciences of Russian Academy of Sciences Russia Bonch Bruevich Saint Petersburg State University of Telecommunications Department of Programming Engineering and Computer Science Russia

ISBN: (纸本)9791188428120

The increasing prevalence of botnet attacks in IoT networks has led to the development of deep learning techniques for their detection. However, conventional centralized deep learning models pose challenges in simultaneously ensuring user data privacy and detecting botnet attacks. To address this issue, this study evaluates the efficacy of Federated Learning (FL) in detecting IoT malware traffic while preserving user privacy. The study employs N-BaIoT, a dataset of real-world IoT network traffic infected by malware, and compares the effectiveness of FL models using Convolutional Neural Network, Long Short-Term Memory, and Gated Recurrent Unit models with a centralized approach. The results indicate that FL can achieve high performance in detecting abnormal traffic in IoT networks, with the CNN model yielding the best results among the three models evaluated. The study recommends the use of FL for IoT malware traffic detection due to its ability to preserve data privacy. © 2024 Global IT Research Institute - GIRI.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Methodology of Teaching programming Science Through Online Platforms

Methodology of Teaching Programming Science Through Online P...

引用

Informatics, Electronics, and Radio Engineering (PIERE), International Conference Problems of

作者： Akram Nishanov Oybek Allamov Janar Yusupova Marks Matyakubov Baxtiyor Qalandarov Reyimberganov Bahrom Department of Systematic and Practical Programming Tashkent University of Information Technologies named after Muhammad al-Khwarizmi Tashkent Uzbekistan Department of Software Engineering Urgench Branch of Tashkent University of Information Technology named after Muhammad al-Khwarizmi Urgench Uzbekistan Master of Urgench branch of TATU named after Muhammad al-Khwarizmi Urgench Branch of Tashkent University of Information Technology named after Muhammad al-Khwarizmi Urgench Uzbekistan Student of Urgench branch of TATU named after Muhammad al-Khwarizmi Urgench Branch of Tashkent University of Information Technology named after Muhammad al-Khwarizmi Urgench Uzbekistan

ISBN: (数字)9798331516321

ISBN: (纸本)9798331516338

This article presents an experiment conducted among students of the Faculty of “Software Engineering” of the Urgench branch of TATU named after Muhammad al-Khwarizmi. Teaching programming using online platforms in education has shown promising results in improving student outcomes. This article discusses the methodology used, the comparative results, and the impact of the platform on software education. The rapid adoption of online platforms in education has changed the way programming is taught, providing students with an interactive, hands-on learning environment. This shift is especially relevant in teaching programming, where real-time feedback and practice are essential to mastering algorithms and coding concepts. The study compared two groups: one was trained using the https://***/platform and the assignments were checked using this system, and the second group was trained using traditional methods. The results showed that students who used the online platform had a high level of mastery, which highlighted the effectiveness of integrating https://***/into programming education.

关键词： Education Software algorithms Real-time systems Software Encoding Computer science education Problem-solving Informatics programming profession

来源：评论

学校读者我要写书评

暂无评论

The prediction of students' Academic performances with a classification Model Built using Data Mining Techniques 6

The prediction of students' Academic performances with a cla...

引用

6th Smart Cities Symposium, SCS 2022

作者： Alkattan, Hussein Abotaleb, Mostafa Subhi, Alhumaima Ali Adelaja, Oluwaseun A. Kadi, Ammar Ibrahim Al-Mahdawi, Hassan K. Department of System Programming South Ural State University Chelyabinsk454080 Russia Electronic and Computer Center University of Diyala BaqubahMJJ2+R9G Iraq Information Communication and Technology Department Lagos State University Lagos102101 Nigeria Department of Food and Biotechnology South Ural State University Chelyabinsk454080 Russia

ISBN: (纸本)9781839538544

In the purview of most educational sectors today, numerous reviews regarding data mining have been the primary focus, with goals of discovering vast knowledge patterns for students' data. This paper focuses on building model that predicted the performance of computer science students in some courses they were examined through classification technique. The model built for the purpose of classification via decision tree classifier which was adopted in WEKA and KNIME analytics platform. The workflow model basically connected nodes to generate the decision trees while J4.8 Decision Tree Classifier programmable outputs were generated for the courses to obtain the confusion matrix and other instances. Bar Charts were plotted to display the students' performance in the courses. The mean absolute errors, RMS error and relative absolute error all read 0% while the kappa value obtained from the analysis ranged between 0.991 - 1.00 which perfectly agrees for most statistical values. © 2022 IET Conference Proceedings. All rights reserved.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Upper bounds on the maximum admissible level of noise in zeroth-order optimisation

arXiv

引用

arXiv 2023年

作者： Pasechniuk, Dmitrii A. Lobanov, Aleksandr Gasnikov, Alexander Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates Moscow Institute of Physics and Technology Dolgoprudny Russia Kharkevich Institute for Information Transmission Problems RAS Russia Ivannikov Institute for System Programming RAS Russia Skoltech Russia

MSC Codes 65K10In this paper, we leverage an information-theoretic upper bound on the maximum admissible level of noise (MALN) in convex Lipschitz-continuous zeroth-order optimisation to establish corresponding upper bounds for classes of strongly convex and smooth problems. We derive these bounds through non-constructive proofs via optimal reductions. Furthermore, we demonstrate that by employing a one-dimensional grid-search algorithm, one can devise an algorithm for simplex-constrained optimisation that offers a superior upper bound on the MALN compared to the case of ball-constrained optimisation and estimates asymptotic in dimensionality. © 2023, CC BY.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Social Engineering Attacks Detection Approach

Social Engineering Attacks Detection Approach

引用

IEEE International Conference on Dependable Systems, Services and Technologies (DESSERT)

作者： Sergii Lysenko Volodymyr Vorobiov Oleksandr Bokhonko Piotr Gaj Oleg Savenko Jacek Wołoszyn Department of Computer Engineering and Information Systems Khmelnitsky National University Khmelnitsky Ukraine Silesian University of Technology Gliwice Poland Department of Computer Engineering and System Programming Khmelnitsky National University Khmelnitsky Ukraine Department of Informatics and Teleinformatics Kazimierz Pulaski University of Technology and Humanities in Radom Radom Poland

The paper focuses on the problem of technical social engineering attacks that encompass the manipulation of individuals to reveal sensitive information, execute actions, or breach security systems. These exploits frequently capitalize on human psychology, trust, and a lack of vigilance to attain unauthorized entry to networks, systems, or data. In contrast to traditional social engineering tactics that center on psychological manipulation, technical social engineering attacks employ technological means and strategies to manipulate and beguile individuals. The paper presents an attempt to detect social engineering attacks. The approach utilized four machine learning algorithms (decision tree, random forest, K-nearest neighbor, and extreme gradient boosting). The analysis is centered on data collected from network hosts, which may serve as indicators of a potential social engineering attack. The empirical results demonstrated high detection accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Forecasting and modeling on average rainwater and vapor pressure in Chelyabinsk Russia using deep learning models

Forecasting and modeling on average rainwater and vapor pres...

引用

6th Smart Cities Symposium (SCS 2022)

作者： M. Abotaleb T. Makarovskikh A. Ali Subhi H. Alkattan A.O. Adebayo Department of System Programming South Ural State University Chelyabinsk Russia University of Diyala Diyala Iraq Information Communication and Technology Department Lagos State University Lagos Nigeria

Machine learning technique is full-fledged as a boosting sector to develop modeling and forecasting of complex time series observations in the present environment. This study made an attempt to inspect the future performance of rainfall data and vapor in Chelyabinsk by using a machine learning technique. The data series is divided into a training set (60%) and a test set (40%) for model developing a validation purpose. We further developed deep learning models such as, LSTM, BILSTM, GRU and compared on the basis of ME, RMSE, MAE, MPE, MAPE, ACF1 on the training data set. For testing data set, we compared these deep learning models based on RMSE. LSTM model acts as a superior machine learning model over BILSTM and GRU in this data series. Forecasting performance of these three models significantly at par. This finding may be significant to build a strong literature of the Chelyabinsk weather's forecast, which can be helpful for policy makers and researchers. Also, we strongly believe that, this work could be used as a literature adaptation of machine learning technique for complex time series over statistical models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Word-Based Turkish Lip Reading System with Two Stream 3dcnn and Bilstm

SSRN

引用

SSRN 2023年

作者： Erbey, Ali Barışçı, Necaattin Department of Computer Programming Distance Education Vocational School Usak University Usak64200 Turkey Department of Information Systems Informatics Institute Gazi University Ankara Turkey Department of Computer Engineering Faculty of Technology Gazi University Ankara06500 Turkey

Lip reading is a technique that aims to understand spoken words by analyzing people's lip movements. Deep learning algorithms are used as a powerful tool for detecting and recognizing lip movements more accurately. In this study, we present a lip-reading architecture for the Turkish language. The architecture is trained to recognize Turkish words using 3DCNN (3D Convolutional Neural Network) architecture and two-stream deep learning methods. The model was trained on video data representing lip movements and learned to classify words accurately. The Turkish lip reading system has been trained and tested on a large Turkish lip reading dataset. In the experiments, an accuracy of 87.12% was achieved with the proposed model, indicating successful results in the Turkish language. The proposed model demonstrates high accuracy rates in recognizing Turkish words, showcasing its effectiveness. This paper introduces a novel architecture, a lip-reading system that employs deep learning techniques, providing a robust tool for successful Turkish lipreading applications. © 2023, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Recursive Neyman Algorithm for Optimum Sample Allocation under Box Constraints on Sample Sizes in Strata

arXiv

引用

arXiv 2023年

作者： Wesolowski, Jacek Wieczorkowski, Robert Wójciak, Wojciech Programming Coordination of Statistical Surveys and Registers Department Statistics Poland Aleja Niepodleglości 208 Warsaw00-925 Poland Faculty of Mathematics and Information Science Warsaw University of Technology ul. Koszykowa 75 Warsaw00-662 Poland

The optimum sample allocation in stratified sampling is one of the basic issues of survey methodology. It is a procedure of dividing the overall sample size into strata sample sizes in such a way that for given sampling designs in strata the variance of the stratified π estimator of the population total (or mean) for a given study variable assumes its minimum. In this work, we consider the optimum allocation of a sample, under lower and upper bounds imposed jointly on sample sizes in strata. We are concerned with the variance function of some generic form that, in particular, covers the case of the simple random sampling without replacement in strata. The goal of this paper is twofold. First, we establish (using the Karush-Kuhn-Tucker conditions) a generic form of the optimal solution, the so-called optimality conditions. Second, based on the established optimality conditions, we derive an efficient recursive algorithm, named RNABOX, which solves the allocation problem under study. The RNABOX can be viewed as a generalization of the classical recursive Neyman allocation algorithm, a popular tool for optimum allocation when only upper bounds are imposed on sample strata-sizes. We implement RNABOX in R as a part of our package stratallo which is available from the Comprehensive R Archive Network (CRAN) repository. Copyright © 2023, The Authors. All rights reserved.

关键词： Sampling

来源：评论

学校读者我要写书评

暂无评论

Spider Structure of Photoelectron Momentum Distributions of Ionized Electrons from Hydrogen Atoms for Extraction of Carrier Envelope Phase of Few-Cycle Pulses

引用

Chinese Physics Letters 2020年第2期37卷 20-24页

作者： Jiu Tang Guizhong Zhang Yufei He Meng Li Xin Ding Jianquan Yao College of Precision Instrument and Optoelectronics Engineering Tianjin UniversityTianjin 300072 Key Lab of Optoelectronic Information Technology(Ministry of Education) Tianjin UniversityTianjin 300072 Key Laboratory of Operation Programming&Safety Technology of Air Traffic Management Civil Aviation University of ChinaTianjin 300300

The spider structure in the photoelectron momentum distributions(PMDs)of ionized electrons from the hydrogen atom is simulated by solving the time-dependent Schrodinger equation(TDSE).We find that the spider structure exhibits sensitive dependence on carrier envelope phase(CEP)of the few-cycle *** elucidate the striking CEP dependence of the spider structure,we select three physical parameters IL,IR,and IR/IL to quantitatively characterize the variations of the spider structure induced by altering the *** is the sum of the left half panel of the transverse cut curves(i.e.,the sum of all the negative momenta along the laser polarization direction),IR is the sum of the right half panel of the transverse cut curves(i.e.,the sum of all the positive momenta along the laser polarization direction),and IR/IL is the ratio between the two *** parameters are shown to have monotonic relation with the CEP value,which is exploited to extract the *** anticipate that our method will be useful for obtaining CEPs encoded in the spider structure of PMDs.

关键词： transverse Electron momentum

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：