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

Analysis of Banking and Financial Sector Services Using Artificial Intelligence (AI) 1

8th International Conference on Information System Design and Intelligent Applications, ISDIA 2024

作者： Isavnin, Alexey Kosorukova, Irina Madaminov, Inomjon Laxmi Lydia, E. Satapathy, Suresh Department of Business-Informatics and Mathematical Methods in Economics Naberezhnye Chelny Institute KFU Kazan Federal University Naberezhnye Chelny Russia Department of Corporate Finance and Corporate Governance Financial University under the Government of the Russian Federation Moscow Russia Department of Accounting and Auditing Urgench State University Urgench Uzbekistan Department of Computer Science and Engineering Vignan’s Institute of Information Technology Visakhapatnam530049 India School of Computer Engineering KIIT Deemed to be University Bhubaneswar India

ISBN: (数字)9789819748921

ISBN: (纸本)9789819748914

This research proposes the assessment of banking and financial services using AI to monitor how banks apply AI approaches and the feedback they receive from customers. In order to better track, anticipate, and react to customer behavior, the financial information generated by the growing utilization of digital pay and banking can be mined by banks and other financial institutions. Based on research, secondary sources are reviewed to ascertain the data used in banking and financial services. A methodical survey is designed to gather the main information clients have regarding AI applications. The study is that private banks and other financial institutions use a variety of artificial intelligence (AI) services to better serve their clients and ensure that they are happy with their financial services, as some clients are not happy with banking services. Additionally, the results indicated that clients would be more committed to banking and financial services representatives by providing creative preparation for the advancement of AI practices in the workplace. © The Author(s).

关键词： Decentralized finance

来源：评论

学校读者我要写书评

暂无评论

Augmented Node Placement Model in t-WSN Through Multiobjective Approach

引用

computers, Materials & Continua 2021年第12期69卷 3629-3644页

作者： Kalaipriyan Thirugnansambandam Debnath Bhattacharyya Jaroslav Frnda Dinesh Kumar Anguraj Jan Nedoma School of Computer Science and Engineering VIT UniversityChennai CampusTamilnaduIndia Department of Computer Science and Engineering Koneru Lakshmaiah Education FoundationVaddeswaramGunturIndia Department of Quantitative Methods and Economic Informatics Faculty of Operation and Economics of Transport and CommunicationsUniversity of Zilina01026 ZilinaSlovakia Department of Telecommunications Faculty of Electrical Engineering and Computer ScienceVSB-Technical University of Ostrava70833 Ostrava-PorubaCzech Republic

In Wireless Sensor Network(WSN),coverage and connectivity are the vital challenges in the target-based *** linear objective is to find the positions to cover the complete target nodes and connectivity between each sensor for data forwarding towards the base station given a grid with target points and a potential sensor placement *** this paper,a multiobjective problem on target-based WSN(t-WSN)is derived,which minimizes the number of deployed nodes,and maximizes the cost of coverage and sensing *** Evolutionary-based Non-Dominated Sorting Genetic Algorithm-II(NSGA-II)is incorporated to tackle this multiobjective problem *** problems are intended to solve different objectives of a problem ***-inspired algorithms address the NP-hard problem most effectively in recent *** NSGA-II,the Non-Dominated sorting preserves the better solution in different objectives simultaneously using dominance *** the diversity maintenance phase,density estimation and crowd comparison are the two components that balance the exploration and exploitation phase of the *** of NSGA-II on this multiobjective problem is evaluated in terms of performance indicators Overall Non-dominated Vector Generation(ONGV)and Spacing(SP).The simulation results show the proposed method performs outperforms the existing algorithms in different aspects of the model.

关键词： Focused wireless sensor network m-coverage k-connectivity problem non-dominated sorting NSGA-II

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Encryption in a Residual Number System 14

Hierarchical Encryption in a Residual Number System

引用

14th International Conference on Advanced computer Information Technologies, ACIT 2024

作者： Yakymenko, Igor Martyniuk, Olesya Martyniuk, Serhii Martyniuk, Andrii Yakymenko, Yurii Kasianchuk, Mykhailo West Ukrainian National University Department of Cyber Security Ternopil Ukraine West Ukrainian National University Department of Applied Mathematies Ternopil Ukraine Ternopil Volodymyr Hnatiuk National Pedagogical University Department of Computer Science and Teaching Methods Ternopil Ukraine Taras Shevchenko National University of Kyiv Faculty of Mechanics and Mathematics Kyiv Ukraine

ISBN: (纸本)9798350350036

Within this article, a method of symmetric encryption of information based on a hierarchical residue number system has been developed. The corresponding mathematical and algorithmic framework is presented. The proposed approach simplifies hardware implementation and enhances operational speed by reducing modulus sizes and consequently numerical operands at each subsequent level, as well as by parallelizing computational processes. Utilizing this encryption method enables the creation of reliable, efficient, and resistant-to-cryptanalysis systems for protecting information streams. A encryption/decryption scheme and an application example of the method are provided. © 2024 IEEE.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Online Educational Community as a Platform for Online Teaching of Python Programming Language to Schoolchildren

Online Educational Community as a Platform for Online Teachi...

引用

Technology Enhanced Learning in Higher Education (TELE), International Conference on

作者： Sergey Kasyanov Katerina Fadeeva The Department of Computer Science and Methods of Teaching Computer Science) Volgograd State Socio-Pedagogical University Volgograd Russia The Department of Economics and Entrepreneurship Volgograd State Technical University Volgograd Russia

The issues of teaching schoolchildren of online communities programming in the Python environment using learning management systems (LMS) and Internet services: Google Docs and Google Colabratory are considered.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Detection of Fake Educational Sites Using Fuzzy String Match 2

Detection of Fake Educational Sites Using Fuzzy String Match

引用

2nd International Conference on Technology Enhanced Learning in Higher Education, TELE 2022

作者： Privalov, Aleksandr N. Smirnov, Vadim A. Tula State Lev Tolstoy Pedagogical University Department of Informatics and Information Technologies Tula Russia Ivanovo State University Department of Mathematics Computer Science and Teaching Methods Shuya Russia

ISBN: (纸本)9781665470070

The analysis of scientific paper and Internet sources devoted to the problem of information counteraction to threats of phishing sites of organizations is carried out. The need for the use of protective equipment on the side of organizations is shown. The relevance of the research topic is confirmed by the presence in the RU zone registry of domain names similar in spelling to well-known educational resources. A method for detecting fake websites based on checking the visual similarity of domain names is proposed. The developed method is based on the use of the Levenshtein metric used in the problem of fuzzy string comparison. The proposed method was tested on the dataset of domain names from the RU zone registry for a certain period of time. When implementing the fake site detection method, the Java programming language and the JGraphT library were used. The test results show an improvement in the quality of the search for domain names similar in spelling to the specified domain name of a web resource. The proposed method can be used in the implementation of one of the modules of a software tool for countering the threats of fake educational sites. © 2022 IEEE.

关键词： computer programming

来源：评论

学校读者我要写书评

暂无评论

Population-Based Novelty Searches Can Converge 34th

Population-Based Novelty Searches Can Converge

引用

34th International Florida Artificial Intelligence Research Society Conference, FLAIRS-34 2021

作者： Wiegand, R. Paul Department of Computer Science & Quantitative Methods Winthrop University Rock HillSC United States

Novelty search is a powerful tool for finding sets of complex objects in complicated, open-ended spaces. Recent empirical analysis on a simplified version of novelty search makes it clear that novelty search happens at the level of the archive space, not the individual point space. The sparseness measure and archive update criterion create a process that is driven by a clear pair of objectives: spread out to cover the space, while trying to remain as efficiently packed as possible driving these simplified variants to converge to an ɛ-net in the sense defined by k Nearest Neighbor theory. Among the simplifications was omission of a population: the archive itself served as both the potential candidate set solution, as well as the source of parents in the evolutionary search, which has the potential to fundamentally hamstring the search. In this paper, we relax this crucial assumption, generalizing the previous simplified novelty search so that a traditional population and (µ, λ) dynamics are used to produce new search points, and the population and the archive are updated separately. We show empirically that it still possible to converge, and that it can be even more likely to do so. © 2020, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence facing Multidimensional Poverty in Elderly 3

Artificial Intelligence facing Multidimensional Poverty in E...

引用

3rd Italian Workshop on Artificial Intelligence for an Ageing Society, AIxAS 2022

作者： Bandini, Stefania Borodi, Valeria Marina Chieregato, David Cremaschi, Marco D’Antico, Federica Messina, Vincenzina Terraneo, Marco Terzera, Laura Gasparini, Francesca Department of Computer Science Systems and Communications University of Milano - Bicocca Italy Department of Sociology and Social Research University of Milano - Bicocca Italy Department of Statistics and Quantitative Methods University of Milano - Bicocca Italy

Poverty is a multidimensional concept that, besides the economic status and financial resources, should consider the lack of access to resources enabling a minimum standard of living and participation in society. In particular, elderly people are likely to require help with some or everyday activities and the total costs of this help can be very high and absorb a significant amount of their income, especially when they are alone and not in good health. This work proposes a strategy based on Bayesian Network to identify the risk of poverty in elderly people, relying on multidimensional indicators learned from heterogeneous sources of information, including the difficulty of accessing services, social exclusion and health status. Data cleaning and integration that include socio-demographic indicators are proposed here, and an overall framework of analysis that can be exportable to several other categories of the population at risk of poverty is presented. © 2021 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Tagged barcodes for the topological analysis of gradient-like vector fields

arXiv

引用

arXiv 2024年

作者： Bannwart, Clemens Landi, Claudia Department of Physics Mathematics and Computer Science University of Modena and Reggio Emilia Italy Department of Sciences and Methods for Engineering University of Modena and Reggio Emilia Italy

Intending to introduce a method for the topological analysis of fields, we present a pipeline that takes as an input a weighted and based chain complex, produces a factored chain complex, and encodes it as a barcode of tagged intervals (briefly, a tagged barcode). We show how to apply this pipeline to the weighted and based chain complex of a gradient-like Morse-Smale vector field on a compact Riemannian manifold in both the smooth and discrete settings. Interestingly for computations, it turns out that there is an isometry between factored chain complexes endowed with the interleaving distance and their tagged barcodes endowed with the bottleneck distance. Concerning stability, we show that the map taking a generic enough gradient-like vector field to its barcode of tagged intervals is continuous. Finally, we prove that the tagged barcode of any such vector field can be approximated by the tagged barcode of a combinatorial version of it with arbitrary *** Codes 55N31, 37B35, 57R25 Copyright © 2024, The Authors. All rights reserved.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Brain Storm Optimization based directional sensors deployment for coverage of targets 3

Brain Storm Optimization based directional sensors deploymen...

引用

3rd International Conference on Intelligent Computing, Instrumentation and Control Technologies, ICICICT 2022

作者： Balaji, S. Rajkumar, S. Sharma, Shekhar Yadav, Aditi Vellore Institute of Technology Division of Mathematics Sas Chennai India Boston University Department of Computer Science BostonMA United States IIM Ahmedabad Department of Production and Quantitative Methods India

ISBN: (数字)9781665410052

ISBN: (纸本)9781665410052

Sensors are used in various areas and have numerous applications including military surveillance, weather monitoring, maritime communication etc. Most of the applications need the multimedia sensors with directional sensing range of the sensors to perform advance task. Additionally, there are some constraints on the targets namely Q-constraints, such that each target must be covered by different number of sensors. The crucial issue in this case is deployment of minimum number of multimedia sensors to satisfy the Q-constraints. The optimization of the placement of the sensors can result in reduced number of sensors needed for the coverage of the specified targets. In this paper, the placement of the sensors is optimized using the Brain Storm Optimization Algorithm (BSO) which is inspired by the human brainstorming process. BSO algorithm efficiently designed for the considered problem to identify the optimal position of the sensors. The performance of the proposed algorithm is verified by simulation results, which performs better than the random deployment of the sensors. © 2022 IEEE.

关键词： Storms

来源：评论

学校读者我要写书评

暂无评论

Influence of the Sequence of Drilling Fields on the Maximum Total Gas Production

Influence of the Sequence of Drilling Fields on the Maximum ...

引用

International Conference on Management of Large-Scale System Development (MLSD)

作者： Alexander Skiba Department of Mathematical Methods of Regional Programming Federal Research Center "Computer Science and Control" of RAS Moscow Russia

We analyze an aggregated dynamic model for the development of gas fields. The same company consistently drills all fields. We pose and solve the problem of maximizing accumulated gas production over a predetermined pe...

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：