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

Innovations in Power and Advanced Computing Technologies (i-PACT)

作者： Steve Mathew D A School of Information Technology and Engineering Vellore Institute of Technology Vellore India Programming and Data Science Indian Institute of Technology Madras Chennai India

ISBN: (纸本)9781665426923

Asymptotic Notations have been very effective in representing the efficiencies of algorithms by analyzing the number of steps and the nature of traversals and operations that the algorithm is bound to perform. Though they represent the nature of growth of the time or space consumed by the algorithms, they only consider the fastest-growing term and not the other terms. The result from this kind of analysis often seems to be fruitful in grading the algorithms based on their efficiency, but theoretically, there seem to be evident deviations when these complexities are extrapolated to larger datasets, hypothetically ‘infinitely large’ datasets. This deviation is tracked down when the constant and slow-growing terms involved are considered. The practical difficulty of empirically verifying this fact due to the ambiguity in defining a very large number of inputs is overcome by theoretically calculating the ratio between the time complexities of algorithms of interest and applying their limit to be infinity. In this study, the algorithms heapsort and merge sort are analyzed and the drastic deviation between them is shown mathematically though they both have the complexity of $n(log(n))$ , concluding that the merge sort is actually twice as fast as heap sort when approaching infinitely large data elements.

关键词： Computers Technological innovation Complexity theory Time complexity Sorting

来源：评论

学校读者我要写书评

暂无评论

Development of a visual programming tool called SmrAI for function testing to mitigate the shortage of programming personnel in the manufacturing

Computer Software

引用

Computer Software 2022年第4期39卷 61-74页

作者： Sugiyama, Ko-Ichiro Okuda, Satsuki Tanabe, Tsubasa Takao, Kouji Higashi, Hirohito Tanaka, Kazuaki Dept. of Information Engineering National Institute of Technology Matsue College Japan NIPPO Co. Ltd. Japan Ruby Programming Shounendan Japan Shimane IT Open-innovation Center Japan Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Japan

We have developed a visual programming tool called SmrAI for function testing, and investigated whether wrapping existing source code with Scratch Blocks is an effective means of mitigating the shortage of programming personnel in the manufacturing. SmrAI is based on Smalruby, which can convert Scratch Blocks into Ruby code. In addition, SmrAI introduces two new sets of Blocks that wrap existing Ruby libraries for function testing. Since existing tools and libraries were utilized, the cost of developing SmrAI was low, and there were no changes in the function testing procedure. We conducted a verification test using staff members who were familiar with the function testing process but had little or no programming experience, and confirmed that they were able to program using SmrAI and that they had confidence in its business applications. These results are expected to contribute to the diversification and increase of programming personnel responsible for function test programming. © 2022 Japan Society for Software Science and technology. All rights reserved.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Min-max optimization over slowly time-varying graphs

arXiv

引用

arXiv 2023年

作者： Nguyen, Nhat Trung Rogozin, Alexander Metelev, Dmitriy Gasnikov, Alexander Moscow Institute of Physics and Technology Moscow Russia Institute for Information Transportation Problems Moscow Russia Caucasus Mathematic Center Adygh State University Moscow Russia Ivannikov Institute for System Programming The Russian Academy of Sciences Research Center for Trusted Artificial Intelligence Moscow Russia

Distributed optimization is an important direction of research in modern optimization theory. Its applications include large scale machine learning, distributed signal processing and many others. The paper studies decentralized min-max optimization for saddle point problems. Saddle point problems arise in training adversarial networks and in robust machine learning. The focus of the work is optimization over (slowly) time-varying networks. The topology of the network changes from time to time, and the velocity of changes is limited. We show that, analogically to decentralized optimization, it is sufficient to change only two edges per iteration in order to slow down convergence to the arbitrary time-varying case. At the same time, we investigate several classes of time-varying graphs for which the communication complexity can be reduced. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Prototype Memory for Large-scale Face Representation Learning

arXiv

引用

arXiv 2021年

作者： Smirnov, Evgeny Garaev, Nikita Galyuk, Vasiliy Lukyanets, Evgeny Speech Technology Center Saint Petersburg194044 Russia Department of Information Technologies and Programming ITMO University Saint Petersburg197101 Russia

Face representation learning using datasets with a massive number of identities requires appropriate training methods Softmax-based approach, currently the state-of-the-art in face recognition, in its usual "full softmax" form is not suitable for datasets with millions of persons Several methods, based on the "sampled softmax" approach, were proposed to remove this limitation These methods, however, have a set of disadvantages One of them is a problem of "prototype obsolescence": classifier weights (prototypes) of the rarely sampled classes receive too scarce gradients and become outdated and detached from the current encoder state, resulting in incorrect training signals This problem is especially serious in ultra-large-scale datasets In this paper, we propose a novel face representation learning model called Prototype Memory, which alleviates this problem and allows training on a dataset of any size Prototype Memory consists of the limited-size memory module for storing recent class prototypes and employs a set of algorithms to update it in appropriate way New class prototypes are generated on the fly using exemplar embeddings in the current mini-batch These prototypes are enqueued to the memory and used in a role of classifier weights for softmax classification-based training To prevent obsolescence and keep the memory in close connection with the encoder, prototypes are regularly refreshed, and oldest ones are dequeued and disposed of Prototype Memory is computationally efficient and independent of dataset size It can be used with various loss functions, hard example mining algorithms and encoder architectures We prove the effectiveness of the proposed model by extensive experiments on popular face recognition benchmarks. © 2021, CC BY.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Data poisoning: issues, challenges, and needs

Data poisoning: issues, challenges, and needs

引用

7th IET Smart Cities Symposium (SCS 2023)

作者： Mohammad Aljanabi Alaa Hamza Omran Maad M Mijwil Mostafa Abotaleb El-Sayed M. El-kenawy Sahar Yousif Mohammed Abdelhameed Ibrahim Department of computer College of Education Aliarqai university Baghdad Iraq University of information technology and communications Baghdad Iraq Computer Techniques Engineering Department Baghdad College of Economic Sciences University Baghdad Iraq Department of System Programming South Ural State University Chelyabinsk Russia Department of Communications and Electronics Delta Higher Institute of Engineering and Technology Egypt Computer Science Department Computer Science & Information Technology College Anbar University Anbar Iraq Computer Engineering and Control Systems Department Faculty of Engineering Mansoura University Mansoura Egypt

Data poisoning attacks, where adversaries manipulate training data to degrade model performance, are an emerging threat as machine learning becomes widely deployed in sensitive applications. This paper provides a comprehensive overview of data poisoning including attack techniques, adversary incentives, impacts on security and reliability, detection methods, defenses, and key research gaps. We examine label flipping, instance injection, backdoors, and other attack categories that enable malicious outcomes ranging from IP theft to accidents in autonomous systems. Promising detection approaches include statistical tests, robust learning, and forensics. However, significant challenges remain in translating academic defenses like adversarial training and sanitization into practical tools ready for operational use. With safety and trustworthiness at stake, more research on benchmarking evaluations, adaptive attacks, fundamental tradeoffs, and real-world deployment of defenses is urgently needed. Understanding vulnerabilities and developing resilient machine learning pipelines will only grow in importance as data integrity is fundamental to developing safe artificial intelligence.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design of Intelligent Decision Support System With Ensembled Machine Learning to Predict Students' Performance

Design of Intelligent Decision Support System With Ensembled...

引用

Communication, Computer Sciences and Engineering (IC3SE), International Conference on

作者： S Deepan Dineshkumar Rajendran Navdeep Dhaliwal K Praveena Melanie Lourens Anandhi R J School of CS & AI SR University Warangal Telangana India Computer Games Design and Programming School of Computing and Innovative Technologies British University Vietnam Vietnam Lovely Professional University Phagwara India Institute of Aeronautical Engineering Dundigal Hyderabad Deputy Dean Faculty of Management Sciences Durban University of Technology South Africa Department of Information Science Engineering New Horizon College of Engineering Bangalore

ISBN: (数字)9798350366846

ISBN: (纸本)9798350366853

Evaluating student performance is important for universities and institutions in the current student education landscape because it helps them create models that work better for students. The automation of various features related to fundamental student traits and behaviours that manage massive amounts of data efficiently processes these. To handle student records that included information about students' behaviour and how it related to their academic performance, the companies employed models of classification with mining concepts. Additionally, the quality of result classification can be substantially improved by using learning analytics and Educational Data Mining (EDM). The educational establishments are making an effort to lower the low student performance. To address this issue, numerous methods for assessing student performance have been devised, allowing the relevant faculties to intervene and enhance the final product. Three classes—Low Performance Student, Average Student, and Smart Student—were created using the K-Mean Clustering methodology for classifying student records. Features including grade point, number of deficits, student attendance, medium of education, and board of education are taken into account when classifying the data. In this case, the WEKA tool is also utilized for implementing the model and outcome assessments.

关键词： Deep learning Decision support systems Analytical models Data analysis Automation Education Companies

来源：评论

学校读者我要写书评

暂无评论

The prediction of students' academic performances with a classification model built using data mining techniques

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

引用

6th Smart Cities Symposium (SCS 2022)

作者： H. Alkattan M. Abotaleb A. Ali Subhi O. A. Adelaja A. Kadi H. K. Ibrahim Al-Mahdawi 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 Department of Food and Biotechnology South Ural State University Chelyabinsk Russia

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analysing the Impact of COVID-19 outbreak and Economic Policy Uncertainty on Stock Markets in Major Affected Economies 6

Analysing the Impact of COVID-19 outbreak and Economic Polic...

引用

6th Smart Cities Symposium, SCS 2022

作者： Matuka, Adelajda Asafo, Shuffield Seyram Eweke, Gamaliel O. Mishra, Pradeep Ray, Soumik Abotaleb, Mostafa Makarovskikh, Tatiana Alhussan, Amel Ali Abdelhamid, Abdelaziz A. El-Kenawy, El-Sayed M. Dutta, P.K. Chowdhury, Subrata University of Macerata Department of Economics and Law Italy Niger Delta University Department of Banking & Finance Nigeria J.N.K.V.V. College of Agriculture M.P. Powarkheda India Centurion University of Technology and Management Odisha Paralakhemundi India Department of System Programming South Ural State University Chelyabinsk454080 Russia Department of Computer Sciences College of Computer and Information Sciences Princess Nourah Bint Abdulrahman University Saudi Arabia Department of Computer Science Faculty of Computer and Information Sciences Ain Shams University Egypt Department of Communications and Electronics Delta Higher Institute of Engineering and Technolog Egypt School of Engineering and Technology Amity University West Bengal Kolkata India AP Chittoor India

ISBN: (纸本)9781839538544

The covid-19 pandemic and Economic Policy Uncertainty resulting from the shutdown of production, withdrawal of investments, enforcement of lockdowns and quarantines globally, have been directly affecting stock markets worldwide. This study is thus an attempt to analyse the impact of the COVID-19 pandemic on stock market behaviour in major affected economies. Moreover, the time frame was extended by using current data which investigate the impact of the virus during the boom and the blast phase in the country's most hit by the pandemic crisis such as China, Italy, UK and US. The frequency of the data is daily, and it dates from 3 January 2020 up to 10 February 2021. The considered time framework will give a deep insight into how stock markets behave in the case of an exogenous shock. The Dickey-Fuller Augmented Unit Root Test indicates that all the variables are stationary at first difference, which is one of the main conditions to have robust result, and the ARCH-LM test for the heteroskedasticity of the residuals, which show that all the probability values are significant, rejecting the null hypothesis of no ARCH effect. Based on the results of GARCH (1,1), we conclude that the change in stock markets volatility is positive and significant in China, Italy, UK and USA. This suggests that the impacts of COVID-19 outbreak and economic policy uncertainty on Stock Markets are a significant and Homogeneous across the studied countries, and the shock on FTSE Italia All Share has the longest time to vanish which makes it the riskiest to invest during this period, while the shock on SP500 USA has the shortest time to disappear meaning that it is safest Stock Market in this study. These findings have significant implications for policymakers, institutional and individual investors and Financial Markets analysts. © 2022 IET Conference Proceedings. All rights reserved.

关键词： Investments

来源：评论

学校读者我要写书评

暂无评论

Synthesis Algorithm for a Continuous Robust Regulator on a Manifold for a Manipulator under Non-Random Noise Conditions

Synthesis Algorithm for a Continuous Robust Regulator on a M...

引用

2020 International Russian Automation Conference, RusAutoCon 2020

作者： Kolesnikov, A.A. Kolesnikova, S.I. Institute of Computer Technology and Information Security South Federal University Taganrog Russia Institute of Computational Systems and Programming St.Petersburg State University of Aerospae Instrumentation St. Petersburg Russia

ISBN: (纸本)9781728161303

The nonlinear adaptation algorithm is considered as applied to stabilization of the center of mass of a moving object subject to nonrandom noise in the control variable. An unknown disturbance is a bounded and continuous function of time. To solve the problem of its modeling and suppression, the following result is used: continuous functions can be described as partial solutions of some differential equations. The developed control algorithm guarantees full compensation of the external disturbance under certain conditions. The simulation result of the obtained control is applied to a manipulation object. © 2020 IEEE.

关键词： Differential equations

来源：评论

学校读者我要写书评

暂无评论

Speaker's Emotions Recognition Module Based on the GoogleLeNet Neural Network

Speaker's Emotions Recognition Module Based on the GoogleLeN...

引用

2022 International Conference on Smart information Systems and Technologies, SIST 2022

作者： Tereikovskyi, Ihor Tereikovska, Liudmyla Kryvoruchko, Olena Tereikovskyi, Oleh Tyshchenko, Dmytro Franchuk, Tamara National Technical University Of Ukraine Igor Sikorsky Kyiv Polytechnic Institute Dept. Of System Programming And Specialized Computer Systems Kyiv Ukraine Kyiv National University Of Construction And Architecture Dept. Of Information Technology For Design And Applied Mathematics Kyiv Ukraine Kyiv National University Of Trade And Economics Dept. Of Software Engineering And Cyber Security Kyiv Ukraine National Technical University Of Ukraine Igor Sikorsky Kyiv Polytechnic Institute Dept. Of Department Of Computer Engineering Kyiv Ukraine

ISBN: (数字)9781665467902

ISBN: (纸本)9781665467902

The article is devoted to the development of means for recognition of the emotions of the speaker, based on the neural network analysis of fixed fragments of the voice signal. The possibility of improving recognition tools through the use of a convolutional neural network of the GoogLeNet type is shown. The expediency of training the network on the examples of the TESS database is determined. A procedure for representing a voice signal in the form of a square grayscale image has been developed. Based on the use of the specified database, the modification of the GoogLeNet network was carried out. The architecture and software implementation of the recognition module have been developed. With the help of computer experiments, it has been established that after 150 epochs of training on a fairly limited training sample, the modified GoogLeNet makes it possible to achieve an accuracy of recognition of the speaker's emotions of approximately 0.97 on test examples. The obtained accuracy is comparable to the accuracy of the best modern systems of this purpose and confirms the promise of using neural network models like GoogLeNet for emotion recognition based on voice signal analysis. The need for further research aimed at reducing the resource intensity of the neural network model is shown. © 2022 IEEE.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：