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

arXiv 2021年

作者： Praveen, Nalla Punn, Narinder Singh Sonbhadra, Sanjay Kumar Agarwal, Sonali Syafrullah, M. Adiyarta, Krisna Dept. of Information Technology Indian Institute of Information Technology Allahabad Prayagraj India Program of Master of Computer Science Universitas Budi Luhur Indonesia

—Machine learning has endless applications in the health care industry. White blood cell classification is one of the interesting and promising area of research. The classification of the white blood cells plays an important part in the medical diagnosis. In practise white blood cell classification is performed by the haematologist by taking a small smear of blood and careful examination under the microscope. The current procedures to identify the white blood cell subtype is more time taking and error-prone. The computer aided detection and diagnosis of the white blood cells tend to avoid the human error and reduce the time taken to classify the white blood cells. In the recent years several deep learning approaches have been developed in the context of classification of the white blood cells that are able to identify but are unable to localize the positions of white blood cells in the blood cell image. Following this, the present research proposes to utilize YOLOv3 object detection technique to localize and classify the white blood cells with bounding boxes. With exhaustive experimental analysis, the proposed work is found to detect the white blood cell with 99.2% accuracy and classify with 90% accuracy. © 2021, CC BY.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Diffusion-based Reinforcement Learning for Edge-enabled AI-Generated Content Services

TechRxiv

引用

TechRxiv 2023年

作者： Du, Hongyang Li, Zonghang Niyato, Dusit Kang, Jiawen Xiong, Zehui Huang, Huawei Mao, Shiwen School of Computer Science and Engineering The Energy Research Institute @ NTU Interdisciplinary Graduate Program Nanyang Technological University Singapore School of Information and Communication Engineering University of Electronic Sciences and Technology of China Chengdu China School of Automation Guangdong University of Technology China Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore School of Software Engineering Sun Yat-Sen University Zhuhai China Department of Electrical and Computer Engineering Auburn University Auburn United States

As Metaverse emerges as the next-generation Internet paradigm, the ability to efficiently generate content is paramount. AI-Generated Content (AIGC) emerges as a key solution, yet the resource-intensive nature of large Generative AI (GAI) models presents challenges. To address this issue, we introduce an AIGC-as-a-Service (AaaS) architecture, which deploys AIGC models in wireless edge networks to ensure broad AIGC services accessibility for Metaverse users. Nonetheless, an important aspect of providing personalized user experiences requires carefully selecting AIGC Service Providers (ASPs) capable of effectively executing user tasks, which is complicated by environmental uncertainty and variability. Addressing this gap in current research, we introduce the AI-Generated Optimal Decision (AGOD) algorithm, a diffusion model-based approach for generating the optimal ASP selection decisions. Integrating AGOD with Deep Reinforcement Learning (DRL), we develop the Deep Diffusion Soft Actor-Critic (D2SAC) algorithm, enhancing the efficiency and effectiveness of ASP selection. Our comprehensive experiments demonstrate that D2SAC outperforms seven leading DRL algorithms. Furthermore, the proposed AGOD algorithm has the potential for extension to various optimization problems in wireless networks, positioning it as a promising approach for future research on AIGC-driven services. The implementation of our proposed method is available at: https://***/Lizonghang/AGOD. © 2023, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Diffusion-based Reinforcement Learning for Edge-enabled AI-Generated Content Services

arXiv

引用

arXiv 2023年

作者： Du, Hongyang Li, Zonghang Niyato, Dusit Kang, Jiawen Xiong, Zehui Huang, Huawei Mao, Shiwen The School of Computer Science and Engineering The Energy Research Institute @ NTU Interdisciplinary Graduate Program Nanyang Technological University Singapore The School of Information and Communication Engineering University of Electronic Sciences and Technology of China Chengdu China The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The School of Software Engineering Sun Yat-Sen University Zhuhai China The Department of Electrical and Computer Engineering Auburn University Auburn United States

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Reduction of the dataset of Baitul Mal aid recipients using the principal component analysis (PCA) method to improve C5.0 algorithm classification results

引用

AIP Conference Proceedings 2024年第1期3222卷

作者： Evi Susanti Sawaluddin Poltak Sihombing Master of Informatics Program Faculty of Computer Science and Information Technology Universitas Sumatera Utara Medan Indonesia

This research raises problems among Baitul Mal aid recipients regarding aid to micro businesses. The process of assisting is an important activity to develop micro-businesses so that they can continue to operate and develop. Selection is also needed to prevent aid from being distributed incorrectly. Therefore, the proposed solution is to utilize data mining techniques, especially classification methods (clustering) to identify potential aid recipients who truly deserve to receive aid. This research also uses the Principal Component Analysis (PCA) method to reduce attribute dimensions in the dataset to increase the accuracy of the classification process. By optimizing the classification process through appropriate attribute reduction, this research is expected to make a positive contribution to increasing the efficiency and accuracy of credit risk assessment in the banking sector. The results of this research are: accuracy after the dataset has been reduced by 2 (two) attributes has a higher value when compared to the dataset that has not been reduced, this happens because the attribute reduction process is carried out to reduce attributes that are not or less relevant. So it can be said that the reduction process influences the accuracy of the C5.0 algorithm classification results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hybrid cryptosystem enhanced RSA and RC4 chaotic map: A tutorial

引用

AIP Conference Proceedings 2024年第1期3222卷

作者： Arief Rahman Hakim Mohammad Andri Budiman Mahyuddin K. M. Nasution Master of Informatics Program Faculty of Computer Science and Information Technology Universitas Sumatera Utara Medan Indonesia

Since the RSA algorithm is no longer secure and a lot of research has been done to break down RSA security, it is necessary to do research by making a combination of modifications of RSA algorithms, in this case using enhanced RSA using fake modules, with RCCM (RC4 Chaotic Map) algorithms to produce a Hybrid Cryptosystem that is expected to be able to improve the security of secret messages. The combination process is done by encrypting the messages using the RCCM algorithm first, then the messages that have been encrypted back in the encryption using the enhanced RSA algorithm with fake modules. So the security of messages has been improved. As for the results of this study, the key generation process is automatically generated which produces keystream for RCCM and fake public key and fake private key for enhanced RSA. In addition, what distinguishes enhanced RSA from ordinary RSA is the use of four primes p, q, r, and s. as well as the application of chaotic maps to RCCM gives the advantage of the unnecessary use of generating keys manually. With these keys, the process of encryption and decryption can be carried out to generate a secret message. In addition, the program resulting from this research applies the kraitchik factorization algorithm as a medium of attack against the key. The conclusion of this study is that by doing a hybrid cryptosystem enhanced RSA and RCCM can be safer due to the occurrence of double encryption processes. In addition, an enhanced RSA algorithm determines a fake module where the value of X is a prime number so that if attacked using a kraitchik factorization algorithm it is difficult to find a factorization of X values that corresponds to the number of p, q, r, and s.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SRGAN with Total Variation Loss in Face Super-Resolution 7

SRGAN with Total Variation Loss in Face Super-Resolution

引用

7th NAFOSTED Conference on information and computer science, NICS 2020

作者： Nguyen-Truong, Hai Nguyen, Khoa N. A. Cao, San Advanced Program in Computer Science Faculty of Information Technology Vietnam National University Ho Chi Minh city Viet Nam

ISBN: (纸本)9780738105536

Facial image super-resolution is a crucial preprocessing for facial image analysis, face recognition, and image-based 3D face reconstruction. Convolutional neural networks were earlier used to produce high-resolution images that train quicker and shown excellent performance by learning mapping relation using pairs of low-resolution and high-resolution images. However, in some cases, they are incapable of recovering finer details and often generate blurry images. In this paper, we evaluate a method of applying Generative adversarial networks in generating realistic super-resolution images from low-resolution ones by using three typical losses for super-resolution: Content Loss, Adversarial Loss, Perceptual Loss, and proposed to use Total Variation Loss. We try different pre-trained famous Convolutional neural networks models (VGG19, FaceNet, and EfficientNet) in Perceptual Loss to have a general view with different backbones. Our network gains 32.67 of Peak signal-to-noise ratio (PSNR) and 0.89 of Structural similarity index (SSIM) in 100 random samples from the Flickr-Faces-HQ dataset. © 2020 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Multicast Routing Technique for Augmenting Routing Efficiency in Mobile WSN

Multicast Routing Technique for Augmenting Routing Efficienc...

引用

International Conference on Computing Methodologies and Communication (ICCMC)

作者： K. Anand M. Rajkumar Srikanth MS S. Radhika Department of Computer Science and Engineering Rajalakshmi Engineering College Chennai Tamil Nadu India School of Information Technology and Engineering VIT University Vellore Tamil Nadu India Program Specialist TNS India Foundation Bangalore Karnataka India Department of Computer Science and Engineering Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Chennai Tamil Nadu India

Mobile Wireless Sensor Network (MWSN) is an active network completely self-governing from a fixed structure. Also, MWSN has small channel bandwidth, great node movement, and inadequate battery energy. In WSN, flooding raises the reliability regarding successful communication of a packet with greater overhead. The flooding consumes the network's resources quickly, especially in terms of the lifetime of the node and energy, etc. Unicast routing creates an extra overhead and increases energy consumption because unicast routing mainly focuses on only minimum distance. But, multicasting is used when the desired destination is at maximum distance and increases the network's reliability in terms of throughput. This paper's objectives are to develop an efficient and reliable protocol using multicasting and unicasting to overcome the issue of higher overhead due to flooding. Multicast Routing Technique for Augmenting (MRTA) routing efficiency in MWSN is introduced. This method aims to enhance the link stability of the route for raising the route lifetime and diminishing the routing load. This method discovers the stable path from several ways to decline the overhead and delay between the sender and receiver. Simulation results demonstrate that this approach improves the network lifetime increases the throughput, and minimizes the routing load in the MWSN.

关键词： Wireless sensor networks Unicast Receivers Multicast communication Routing Throughput Stability analysis

来源：评论

学校读者我要写书评

暂无评论

UNIFORM CYCLIC GROUP FACTORIZATIONS OF FINITE GROUPS

arXiv

引用

arXiv 2023年

作者： Kanai, Kazuki Miyamoto, Kengo Nuida, Koji Shinagawa, Kazumasa General Education Program National Institute of Technology Kure College Hiroshima737-8506 Japan Department of Computer and Information Science Ibaraki University Ibaraki316-8511 Japan Kyushu University Fukuoka819-0395 Japan Tokyo135-0064 Japan

In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group G is said to admit a uniform group factorization if there exist subgroups H1, H2, . . ., Hk such that G = H1H2 · · · Hk and the number of ways to represent any element g ∈ G as g = h1h2 · · · hk (hi ∈ Hi) does not depend on the choice of g. Moreover, a uniform group factorization consisting of cyclic subgroups is called a uniform cyclic group factorization. First, we show that any finite solvable group admits a uniform cyclic group factorization. Second, we show that whether all finite groups admit uniform cyclic group factorizations or not is equivalent to whether all finite simple groups admit uniform group factorizations or not. Lastly, we give some concrete examples of such *** Codes 20D06, 20D08, 20D10, 20D20, 20D40, 94A60 Copyright © 2023, The Authors. All rights reserved.

关键词： Factorization

来源：评论

学校读者我要写书评

暂无评论

Hybrid ACO and PSO to minimize makespan in job shop scheduling problems

引用

AIP Conference Proceedings 2024年第1期3222卷

作者： Priljen Habeahan Erna Budhiarti Nababan Mahyuddin K. M. Nasution Informatics Engineering Master Program Faculty of Computer Science and Information Technology Universitas Sumatera Utara Medan Indonesia Data Science and Artificial Intelligence Faculty of Computer Science and Information Technology Universitas Sumatera Utara Medan Indonesia

The lowest time search in the dataset that E. Taillard utilized employs a heuristic approach based on tabu search techniques to get the predicted solution. Glover’s study gives a broad description of tabu search, which is commonly encountered in Taillard’s job shop scheduling difficulties and Widmer et al.’s flow shop sorting challenges. Although tabu search is relatively simple to use and typically yields excellent results, it takes a long time to complete. In this research a hybrid ACO and PSO was carried out to minimize makespan in the Job Shop Scheduling Problem which was used as sourced from benchmark data which is secondary data obtained from E. Taillard “Benchmarks for basic scheduling problems” which consists of job shop matrix data (job × machine) measuring 4 × 4, 5 × 5, 7 × 7, 10 × 10, 15 × 15, 20 × 20, 30 × 15, 30 × 20, 50 × 15 and 50 × 20. Hybrid is carried out by calculating the Pbest value, namely the process position of each job on the machine to get the best solution using the PSO algorithm. Next, calculate the Gbest (Global best) value for the position of each job on the best machine on the entire machine using the PSO algorithm and initialize the ACO parameters using the PBest and Gbest values. The results of research on datasets with sizes 10×10, 15×15, 20×20, 30×15, 30×20, 50×15 and 50×20 produce smaller makespan compared to the lower bound on the dataset with an average minimum makespan improvement value of 1.184.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Web Security and Vulnerability: A Literature Review 2

Web Security and Vulnerability: A Literature Review

引用

2nd International Conference on computer, science, Engineering, and technology, ICComSET 2019

作者： Yulianton, H. Warnars, H.L.H.S. Soewito, B. Gaol, F.L. Abdurachman, E. Computer Science Department BINUS Graduate Program - Doctor of Computer Science Bina Nusantara University Jakarta11480 Indonesia Faculty of Information Technology Universitas Stikubank Semarang50243 Indonesia

The web continues to grow and attacks against the web continue to increase. This paper focuses on the literature review on scanning web vulnerabilities and solutions to mitigate web attacks. Vulnerability scanning methods will be reviewed as well as frameworks for improving web security. This research is the basis for future work that will end with the elaboration of web scanning and security with the aim of proposing better innovations. © Published under licence by IOP Publishing Ltd.

关键词： Scanning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：