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

42nd International Symposium on Theoretical Aspects of computer Science, STACS 2025

作者： Agrawal, Akanksha Lokshtanov, Daniel Panolan, Fahad Saurabh, Saket Verma, Shaily Indian Institute of Technology Madras India University of California Santa BarbaraCA United States School of Computer Science University of Leeds United Kingdom The Institute of Mathematical Sciences HBNI Chennai India Department of Informatics University of Bergen Norway Algorithm Engineering Group Hasso Plattner Institute Potsdam Germany

ISBN: (纸本)9783959773652

The classic greedy coloring algorithm considers the vertices of an input graph G in a given order and assigns the first available color to each vertex v in G. In the Grundy Coloring problem, the task is to find an ordering of the vertices that will force the greedy algorithm to use as many colors as possible. In the Partial Grundy Coloring, the task is also to color the graph using as many colors as possible. This time, however, we may select both the ordering in which the vertices are considered and which color to assign the vertex. The only constraint is that the color assigned to a vertex v is a color previously used for another vertex if such a color is available. Whether Grundy Coloring and Partial Grundy Coloring admit fixed-parameter tractable (FPT) algorithms, algorithms with running time f(k)nO(1), where k is the number of colors, was posed as an open problem by Zaker and by Effantin et al., respectively. Recently, Aboulker et al. (STACS 2020 and Algorithmica 2022) resolved the question for Grundy Coloring in the negative by showing that the problem is W[1]-hard. For Partial Grundy Coloring, they obtain an FPT algorithm on graphs that do not contain Ki,j as a subgraph (a.k.a. Ki,j-free graphs). Aboulker et al. re-iterate the question of whether there exists an FPT algorithm for Partial Grundy Coloring on general graphs and also asks whether Grundy Coloring admits an FPT algorithm on Ki,j-free graphs. We give FPT algorithms for Partial Grundy Coloring on general graphs and for Grundy Coloring on Ki,j-free graphs, resolving both the questions in the affirmative. We believe that our new structural theorems for partial Grundy coloring and "representative-family" like sets for Ki,j-free graphs that we use in obtaining our results may have wider algorithmic applications. © Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Shaily Verma.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

MAX CUT in Weighted random Intersection Graphs and Discrepancy of Sparse random Set Systems 32

MAX CUT in Weighted Random Intersection Graphs and Discrepan...

引用

32nd International Symposium on Algorithms and Computation, ISAAC 2021

作者： Nikoletseas, Sotiris raptopoulos, Christoforos Spirakis, Paul Computer Engineering and Informatics Department University of Patras Greece Computer Technology Institute Patras Greece Computer Engineering and Informatics Department University of Patras Greece Department of Computer Science University of Liverpool United Kingdom

ISBN: (纸本)9783959772143

Let V be a set of n vertices, M a set of m labels, and let R be an m × n matrix of independent Bernoulli random variables with probability of success p;columns of R are incidence vectors of label sets assigned to vertices. A random instance G(V, E, RT R) of the weighted random intersection graph model is constructed by drawing an edge with weight equal to the number of common labels (namely [RT R]v,u) between any two vertices u, v for which this weight is strictly larger than 0. In this paper we study the average case analysis of Weighted Max Cut, assuming the input is a weighted random intersection graph, i.e. given G(V, E, RT R) we wish to find a partition of V into two sets so that the total weight of the edges having exactly one endpoint in each set is maximized. In particular, we initially prove that the weight of a maximum cut of G(V, E, RT R) is concentrated around its expected value, and then show that, when the number of labels is much smaller than the number of vertices (in particular, m = nα, α Θ(1)n), we show that with high probability, a majority type randomized algorithm outputs a cut with weight that is larger than the weight of a random cut by a multiplicative constant strictly larger than 1. Then, we formally prove a connection between the computational problem of finding a (weighted) maximum cut in G(V, E, RT R) and the problem of finding a 2-coloring that achieves minimum discrepancy for a set system Σ with incidence matrix R (i.e. minimum imbalance over all sets in Σ). We exploit this connection by proposing a (weak) bipartization algorithm for the case m = n, p = Θ(1)n that, when it terminates, its output can be used to find a 2-coloring with minimum discrepancy in a set system with incidence matrix R. In fact, with high probability, the latter 2-coloring corresponds to a bipartition with maximum cut-weight in G(V, E, RT R). Finally, we prove that our (weak) bipartization algorithm terminates in polynomial time, with high probability, at least w

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Big data link stability-based path observation for network security

Lecture Notes on Data Engineering and Communications Technol...

引用

Lecture Notes on Data engineering and Communications Technologies 2021年 66卷 459-468页

作者： Arappali, Nedumaran Mekonnen, Melaku Tamene Tefera, Wondatir Teka Sundaram, B. Barani Karthika, P. Department of Electrical and Computer Engineering Wollo University Kombolcha Institute of Technology Kombolcha Ethiopia Department of Computer Science College of Informatics Bule Hora University Bule Hora Ethiopia Department of Computer Application Kalasalingam Univerity Viruthunagar Tamilnadu India

Wireless ad hoc network [WANET] systems are creating multihop communication structure between the mobiles to transfer the data groups. The remarkable qualities of remote frameworks cause the correspondence to interface among the conflicting mobiles. To manage high convey ability and biological blocks, most physical directing shows will not believe the stable associations during pack communication, which prompts the elevated delay and bundle reducing in the master-mind. The proposed research work recommends a way perception support physical steering convention that specifies POPR for WANET. The anticipated guiding show merges the relative partition, course and mid-expand forwarder center point with transfer thickness to propel data toward the objective in order to recover physical sending among the connection point. Multiplication results illustrate the projected directing convention, which performs superior to the existing arrangements. © The Author(s).

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Information Fusion Technique for Device to Server-Enabled Communication in the Internet of Things:A Hybrid Approach

引用

computers, Materials & Continua 2024年第7期80卷 1305-1323页

作者： Amal Al-rasheed rahim Khan Tahani Alsaed Mahwish Kundi Mohamad Hanif Md.Saad Mahidur R.Sarker Department of Information Systems College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Department of Computer Science AbdulWali Khan University MardanMardan23200Pakistan Faculty of Computing and Informatics University Malaysia SabahKota KinabaluSabah88400Malaysia Applied College Taibah UniversityMadinah41477Saudi Arabia Maynooth International Engineering College Maynooth UniversityCo KildareW23 X021Irland Department of Mechanical Engineering Faculty of Engineering and Built EnvironmentUniversiti Kebangsaan MalaysiaBangiSelangor43600Malaysia Institute of Visual Informatics Universiti Kebangsaan MalaysiaBangiSelangor43600Malaysia University of Design Innovation and Technology(UDIT)Av.Alfonso XIII97Madrid28016Spain

Due to the overwhelming characteristics of the Internet of Things(IoT)and its adoption in approximately every aspect of our lives,the concept of individual devices’privacy has gained prominent attention from both customers,i.e.,people,and industries as wearable devices collect sensitive information about patients(both admitted and outdoor)in smart healthcare *** addition to privacy,outliers or noise are among the crucial issues,which are directly correlated with IoT infrastructures,as most member devices are resource-limited and could generate or transmit false data that is required to be refined before processing,i.e.,***,the development of privacy-preserving information fusion techniques is highly encouraged,especially those designed for smart IoT-enabled *** this paper,we are going to present an effective hybrid approach that can refine raw data values captured by the respectivemember device before transmission while preserving its privacy through the utilization of the differential privacy technique in IoT *** window,i.e.,δi based dynamic programming methodology,is implemented at the device level to ensure precise and accurate detection of outliers or noisy data,and refine it prior to activation of the respective transmission ***,an appropriate privacy budget has been selected,which is enough to ensure the privacy of every individualmodule,i.e.,a wearable device such as a smartwatch attached to the patient’s *** contrast,the end module,i.e.,the server in this case,can extract important information with approximately the maximum level of ***,refined data has been processed by adding an appropriate nose through the Laplace mechanism to make it useless or meaningless for the adversary modules in the *** proposed hybrid approach is trusted from both the device’s privacy and the integrity of the transmitted information *** and analytical results ha

关键词： Internet of things information fusion differential privacy dynamic programming Laplace function

来源：评论

学校读者我要写书评

暂无评论

Emotion Recognition using Deep Learning Techniques and Word Embeddings 6

Emotion Recognition using Deep Learning Techniques and Word ...

引用

6th IEEE/ACIS International Conference on Big Data, Cloud Computing, and Data Science, BCD 2021

作者： Kardakis, Spyridon Perikos, Isidoros Grivokostopoulou, Foteini Paraskevas, Michael Computer Technology Institute and Press 'Diophantus' and Computer Engineering University of Patras Informatics Department Patras Greece

ISBN: (纸本)9781728176819

Emotion recognition is a topic of vital importance in the world of Big Data. The accurate classification, analysis and interpretation of emotional content is highly desired in a wide spectrum of applications. In this work we examine the performance of Deep Learning models for an emotion recognition task. These models can also be applied to any classification task as well as text-related tasks in general. We examine the performance of deep learning methods in textual emotion recognition under different feature selection parameters such as one-hot-enconding, custom word2vec and more. An experimental study was designed and various deep learning methods were evaluated in publicly available datasets. The results are quite interesting and indicate the advantages of each method and each examined training approach. © 2021 IEEE.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

Reducing ADC Front-end Costs During Training of On-sensor Printed Multilayer Perceptrons

arXiv

引用

arXiv 2024年

作者： Afentaki, Florentia Duarte, Paula Carolina Lozano Zervakis, Georgios Tahoori, Mehdi B. Computer Engineering & Informatics Dept. University of Patras Patras26504 Greece Department of Computer Science Karlsruhe Institute of Technology Karlsruhe76131 Germany

Printed electronics technology offers a cost-effective and fully-customizable solution to computational needs beyond the capabilities of traditional silicon technologies, offering advantages such as on-demand manufacturing and conformal, low-cost hardware. However, the low-resolution fabrication of printed electronics, which results in large feature sizes, poses a challenge for integrating complex designs like those of machine learning (ML) classification systems. Current literature optimizes only the Multilayer Perceptron (MLP) circuit within the classification system, while the cost of analog-to-digital converters (ADCs) is overlooked. Printed applications frequently require on-sensor processing, yet while the digital classifier has been extensively optimized, the analog-to-digital interfacing, specifically the ADCs, dominates the total area and energy consumption. In this work, we target digital printed MLP classifiers and we propose the design of customized ADCs per MLP’s input which involves minimizing the distinct represented numbers for each input, simplifying thus the ADC’s circuitry. Incorporating this ADC optimization in the MLP training, enables eliminating ADC levels and the respective comparators, while still maintaining high classification accuracy. Our approach achieves 11.2x lower ADC area for less than 5% accuracy drop across varying MLPs. Copyright © 2024, The Authors. All rights reserved.

关键词： Comparator circuits

来源：评论

学校读者我要写书评

暂无评论

A Framework for Big Data Analytics with Wireless Communication of Network, Internet of Things and Cyber Security 2

A Framework for Big Data Analytics with Wireless Communicati...

引用

2nd International Conference on Advance Computing and Innovative Technologies in engineering, ICACITE 2022

作者： Tedyyana, Agus Sivakumar, G. Kumar, Anuj Velayudham, A. Pavithra, M. Gangodkar, Durgaprasad Politeknik Negeri Bengkalis Department of Informatics Engineering Indonesia Electronics and Communication Engineering Ramco Institute of Technology Rajapalayam India Uit Uttaranchal University Dehradun India Jansons Institute of Technology Department of Computer Science and Engineering Karumathampatti Coimbatore India Graphic Era Deemed to Be University Department of Computer Science & Engineering Uttarakhand Dehradun India

ISBN: (纸本)9781665437899

Nowadays, big data is being implemented in various fields due to its advantages in risk management, healthcare and other business fields. The conventional big data analytics system is not highly promising for implementation in every system. Therefore, the developers are integrating the Internet of Things (IoT), wireless communication and cyber security systems to strengthen the capability of big data analytics. The current research has explained the framework for big data analytics with IoT, wireless communication and cyber security. Initially, past literature was explained, and then, the research methodology has been described. Primary survey-based research has been conducted with 54 data analysis experts to understand the framework of big data, its applications and solutions for cyber security-based issues. Findings showed that a VPN system with a firewall is a great choice for preventing external attacks. Moreover, as the primary data suggested the use of encryption systems, the researchers used SHA-256 ('Secure Hashing Algorithm') for protecting the collected big data. Internet of Things (IoT) devices is used for collecting customer and operational data. After that, the data is collected via a wireless network and transferred to the respective access points. Users can access the data from access points and can generate meaningful information for executing various purposes. © 2022 IEEE.

关键词： Data Analytics

来源：评论

学校读者我要写书评

暂无评论

A Systematic Overview on Simulation of Connected Vehicles Infrastructure in Smart Cities 1

A Systematic Overview on Simulation of Connected Vehicles In...

引用

1st International Conference in Advanced Innovation on Smart City, ICAISC 2023

作者： Gupta, Manik Dhaou, Imed Ben Garg, Kamal Deep Sharma, Bhisham Chitkara University School of Engineering and Technology Chitkara University Himachal Pradesh India Dar Al-Hekma University Hekma School of Engineering Computing and Informatics Department of Computer Science Jeddah Saudi Arabia Chitkara University Institute of Engineering and Technology Chitkara University Punjab India

ISBN: (纸本)9781665472753

The development and use of connected vehicles are becoming increasingly important areas of study in the wireless networking and transportation research communities. These networks can provide various services such as collision warning. Unlike other types of devices, such as hand-held devices, the vehicles' nodes are not limited by their energy consumption and storage capacity. Therefore, the development of connected networks can be carried out with minimal resources. It is necessary to run a simulation in order to determine whether they are feasible. The availability of multiple devices and protocols has led to the creation of new utilization scenarios. Due to the complexity of the task, many simulation tools were developed during the past few years. This paper systematically reviews the current state of these tools and discusses their capabilities to evaluate the various scenarios related to the development of connected vehicles network. © 2023 IEEE.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Efficient Time-Delay System Optimization with Auto-Configured Metaheuristics

Efficient Time-Delay System Optimization with Auto-Configure...

引用

2023 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2023

作者： Senkerik, Roman Byrski, Aleksander Guzowski, Hubert Janku, Peter Kadavy, Tomas Oplatkova, Zuzana Kominkova Matusu, radek Pluhacek, Michal Pekar, Libor Smolka, MacIej Viktorin, Adam Tomas Bata University A.I. Lab Faculty of Applied Informatics Department of Informatics and Artificial Intelligence Zlin Czech Republic Tomas Bata University Faculty of Applied Informatics Department of Automation and Control Engineering Zlin Czech Republic Institute of Computer Science Agh University of Science and Technology Krakow Poland

ISBN: (纸本)9798350337020

This paper presents an experimental study that compares the performance of four selected metaheuristic algorithms for optimizing a time delay system model. Time delay system models are complex and challenging to optimize due to their inherent characteristics, such as non-linearity, multi-modality, and constraints. The study includes an explanation of the choice and core functionality of the selected algorithms, which are both baseline and state-of-the-art variants of self-organizing migrating algorithm (SOMA), state-of-the-art variant from the Success-History-based Adaptive Differential Evolution family of algorithms, with emphasis on diverse search (DISH algorithm), and Covariance Matrix Adaptation Evolution Strategy (CMA-ES) algorithm. The hyperparameters of the metaheuristic algorithms were set using the irace automatic algorithm configuration framework. The paper emphasizes the importance of metaheuristic algorithms in control engineering for time-delay systems to develop more effective and efficient control strategies and precise model identifications. The experimental results highlight the effectiveness of the state-of-the-art algorithms with specific adaptive mechanisms like population organization process, diverse search and adaptation mechanisms ensuring a gradual transition from exploration to exploitation. Overall, this study contributes to understanding the challenges and advantages of using metaheuristic algorithms in control engineering for time delay systems. The results provide valuable insights into the performance of modern metaheuristic algorithms and can help guide the selection of appropriate adaptive mechanisms of metaheuristics. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：