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

2023 IEEE International Conference on Computing, ICOCO 2023

作者： Saadoon, Muntadher Hamid, Siti Hafizah Ab. Sofian, Hazrina Altarturi, Hamza Nasuha, Nur Azizul, Zati Hakim Khalid, Haqi Universiti Malaya Faculty of Computer Science and Information Technology Department of Software Engineering Kuala Lumpur50603 Malaysia Universiti Malaya Faculty of Computer Science and Information Technology Department of Computer System and Technology Kuala Lumpur50603 Malaysia Universiti Malaya Faculty of Computer Science and Information Technology Department of Artificial Intelligence Kuala Lumpur50603 Malaysia Universiti Putra Malaysia Faculty of Engineering Department of Computer and Communication Selangor 43400 Malaysia

ISBN: (纸本)9798350302684

Internet of Things, edge computing devices, the widespread use of artificial intelligence and machine learning applications, and the extensive adoption of cloud computing pose significant challenges to maintaining fault tolerance in distributed systems. As the volume and complexity of systems continue to grow, the probability of system failures also grows, leading to downtime and poor performance. Fault tolerance is pivotal in modern computing systems by preventing downtime and service disruptions, even during failures. However, adopting fault tolerance comes with additional resource consumption, such as memory, CPU, disk, and network bandwidth usage, impacting system performance. Balancing fault tolerance with system performance is crucial to optimize resource utilization while minimizing the costs associated with detecting and recovering from faults. This paper introduces a node-to-node fault tolerance coordination mechanism for distributed systems to facilitate the tradeoff between fault tolerance and the cost of performance penalties and resource consumption. The proposed mechanism is preliminarily implemented on HDFS cluster. Our proposal enables opportunities to minimize the cost of the fault tolerance impact on performance and resource usage compared to the existing fault tolerance coordination mechanism. © 2023 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

LeaderKV: Improving Read Performance of KV Stores via Learned Index and Decoupled KV Table

LeaderKV: Improving Read Performance of KV Stores via Learne...

引用

International Conference on Data engineering

作者： Yi Wang Jianan Yuan Shangyu Wu Huan Liu Jiaxian Chen Chenlin Ma Jianbin Qin College of Computer Science and Software Engineering Shenzhen University Department of Computer Science City University of Hong Kong

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Log-structured merge-tree (LSM-tree) is a storage architecture widely used in key-value (KV) stores. To enhance the read efficiency of LSM-tree, recent works utilize the learned index to learn the mapping between keys and locations. However, in existing learned-index-aided KV stores, inefficient design of the learned index and disk access significantly impact the read performance. How to design a learned KV store to improve index efficiency and minimize disk access remains a critical problem. This paper presents LeaderKV, a read-optimized LSM-tree-based KV store. LeaderKV employs decoupled KV tables (DK-Table) and efficient learned indexes for data retrieval. DKTables are storage files in Leader Kvbecause they avoid reading irrelevant data in collaboration with learned indexes during queries. A learned index called Leader is proposed to accelerate data retrieval within DKTable. Leader is composed of precise models and approximate models. A redirect mechanism is designed to reduce the cost of mispredictions in Leader. We integrate DKTable and Leader into LeaderKV and demonstrate its effectiveness using a variety of datasets and workloads. Experimental results show that LeaderKV significantly improves the read performance compared to representative schemes.

关键词： Training Lead acid batteries Costs Graphics processing units Collaboration Bandwidth Data engineering

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for Throughput Maximization in Cognitive Radio Network with NOMA

引用

computers, Materials & Continua 2022年第1期70卷 195-212页

作者： Xiaoli He Yu Song Yu Xue Muhammad Owais Weijian Yang Xinwen Cheng School of Computer Science Sichuan University of Science and EngineeringZigong643000China Department of Network Information Management Center Sichuan University of Science and EngineeringZigong643000China School of Information Engineering South West University of Science and TechnologyMianyang621010China School of Computer and Software Nanjing University of Information Science and TechnologyJiangsu210044China Alhamd Islamic University Airport Road Quetta BalochistanPakistan

Spectrum resources are the precious and limited natural *** order to improve the utilization of spectrum resources and maximize the network throughput,this paper studies the resource allocation of the downlink cognitive radio network with non-orthogonalmultiple access(CRN-NOMA).NOMA,as the key technology of the fifth-generation communication(5G),can effectively increase the capacity of 5G *** optimization problem proposed in this paper aims to maximize the number of secondary users(SUs)accessing the system and the total throughput in the *** the constraints of total power,minimum rate,interference and SINR,CRN-NOMA throughput is maximized by allocating optimal transmission ***,for the situation of multiple sub-users,an adaptive optimization method is proposed to reduce the complexity of the optimization ***,for the optimization problem of nonlinear programming,a maximization throughput optimization algorithm based on Chebyshev and convex(MTCC)for CRN-NOMA is proposed,which converts multi-objective optimization problem into single-objective optimization problem to *** the same time,the convergence and time complexity of the algorithm are *** analysis and simulation results show that the algorithm can effectively improve the system *** terms of interference and throughput,the performance of the sub-optimal solution is better than that of orthogonal-frequency-division-multiple-access(OFDMA).This paper provides important insights for the research and application of NOMA in future communications.

关键词： Resource allocation non-orthogonal multiple access cognitive radio network throughput maximization Chebyshev convex

来源：评论

学校读者我要写书评

暂无评论

An empirical IoT and cloud-based customizable healthcare surveillance system

引用

International Journal of Information Technology (Singapore) 2024年第8期16卷 5317-5323页

作者： Meti, Subhash Razauddin, S. Nallakumar, R. Mansingh, P. M. Benson Sameen, Aws Zuhair Pandey, Sakshi Bhatt, Sanjeev Kumar Jayabalan, Bhuvana Department of Electronics and Communication Engineering SKSVMACET Lakshmeshwar Karnataka Gadag India College of Computer Science and Engineering University of Hail Hail Saudi Arabia Department of Artificial Intelligence and Data Science Karpagam Institute of Technology Coimbatore India Department of Advanced Computer Science and Engineering Vignan’s Foundation for Science Technology and Research Andhra Pradesh Guntur India College of Medical Techniques Al-Farahidi University Baghdad Iraq Centre of Interdisciplinary Research in Business and Technology Chitkara Institute of Engineering and Technology Chitkara University Punjab Rajpura India Software Architect and Research Scholar Digital Innovation College PDM University Bahadurgarh India Department of Computer Science and Information Technology JAIN (Deemed-to-Be University) Karnataka Bengaluru India

In certain emergencies, patients must be continuously monitored and cared for. However, visiting the hospital to do such activities is difficult because of time constraints. To modernize the healthcare sector, the study in question presents an empirical Internet of Things and cloud-based, customizable healthcare monitoring system. Initially, a cloud-based algorithm called particle swarm intelligence (PGI) is used in the proposed healthcare monitoring system to group recorded data, hence increasing the prediction rate. Subsequently, features are selected and extracted, and back propagation neural networks (BPNN) are employed to classify healthcare for humans. In the end, the effectiveness of the suggested system is evaluated using a healthcare dataset and contrasted with current deep learning/machine learning classifiers. The suggested surveillance system performs better than the methods employed in the previous research, according to the findings. © Bharati Vidyapeeth's Institute of computer Applications and Management 2024.

关键词： BPNN Cloud computing Healthcare surveillance IoT Particle swarm intelligence (PSI)

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning for Joint Service Placement and Request Scheduling in Mobile Edge Computing Networks 28

Deep Reinforcement Learning for Joint Service Placement and ...

引用

28th IEEE Symposium on computers and Communications, ISCC 2023

作者： Deng, Yuxuan Li, Xiuhua Sun, Chuan Hao, Jinlong Wang, Xiaofei Leung, Victor C. M. School of Big Data and Software Engineering Chongqing University Chongqing China Chongqing Changan Automobile Software Technology Co. Ltd Chongqing China TKLAN College of Intelligence and Computing Tianjin University Tianjin China College of Computer Science and Software Engineering Shenzhen University Shenzhen China The University of British Columbia Department of Electrical and Computer Engineering Vancouver Canada

ISBN: (纸本)9798350300482

Mobile edge computing aims to provide cloud-like services on edge servers located near Mobile Devices (MDs) with higher Quality of Service (QoS). However, the mobility of MDs makes it difficult to find a global optimal solution for the coupled service placement and request scheduling problem. To address these issues, we consider a three-Tier MEC network with vertical and horizontal cooperation. Then we formulate the joint service placement and request scheduling problem in a mobile scenario with heterogeneous services and resource limits, and convert it into two Markov decision processes to decouple decisions across successive time slots. We propose a Cyclic Deep Q-network-based Service placement and Request scheduling (CDSR) framework to find a long-Term optimal solution despite future information unavailability. Specifically, to solve the issue of enormous action space, we decompose the system agent and train them cyclically. Evaluation results demonstrates the effectiveness of our proposed CDSR on user-perceived QoS. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Enhancing Content-Based Histopathology Image Retrieval Using QR Code Representation

Enhancing Content-Based Histopathology Image Retrieval Using...

引用

2023 IEEE Symposium Series on Computational Intelligence, SSCI 2023

作者： Rouzegar, Hamidreza Rahnamayan, Shahryar Bidgoli, Azam Asilian Makrehchi, Masoud Ontario Tech University Department of Electrical Computer and Software Engineering OshawaON Canada Brock University Engineering Department St. CatharinesON Canada Laurier University Faculty of Science Wilfrid WaterlooON Canada

ISBN: (纸本)9781665430654

The growing field of Content-Based Medical Image Retrieval (CBMIR) plays an integral role in the diagnosis and treatment plan of numerous diseases, including cancer. However, the effective representation of gigapixel medical images via a large number of extracted features remains a challenging task, crucially influencing other processes in a digital workflow. In this paper, we propose a novel QR code representation strategy to enhance retrieval performance. Unlike the traditional one-dimensional binary representation methods (i.e., barcodes), this 2D approach captures more intricate and informative patterns from the features by differentiating each pair of features resulting in a 2D binary vector. We delve into three distinct QR code generation strategies, namely, the Thresholding QR, the MinMax QR, and the Hybrid QR, each offering unique strengths. Our experiments on representing whole slide images of the Cancer Genome Atlas (TCGA) dataset reveal that while the Hybrid QR tends to provide balanced performance, there are instances where the other two methods outshine. Even though this approach requires more memory usage, the considerable enhancement in accuracy justifies this trade-off;obviously, in medical applications, accuracy holds the highest priority. Hence, the findings indicate that QR codes can effectively improve the performance of CBMIR systems by not only accelerating the retrieval process but also increasing the accuracy of image retrieval, leading to potentially more accurate diagnoses and treatment planning. © 2023 IEEE.

关键词： Barcode Content-Based Image Retrieval Histopathology Images Medical Image Analysis QR Code

来源：评论

学校读者我要写书评

暂无评论

Alignment efficient image-sentence retrieval considering transferable cross-modal representation learning

引用

Frontiers of computer science 2024年第1期18卷 77-91页

作者： Yang YANG Jinyi GUO Guangyu LI Lanyu LI Wenjie LI Jian YANG School of Computer Science and Engineering Nanjing University of Science and TechnologyNanjing 210094China Department of Computing Hong Kong Polytechnic UniversityHong Kong 100872China State Key Lab.for Novel Software Technology Nanjing UniversityNanjing 210094China 14th Research Institute of China Electronics Technology Group Corporation Nanjing 210094China guangyu.li2017@***

Traditional image-sentence cross-modal retrieval methods usually aim to learn consistent representations of heterogeneous modalities,thereby to search similar instances in one modality according to the query from another modality in *** basic assumption behind these methods is that parallel multi-modal data(i.e.,different modalities of the same example are aligned)can be obtained in *** other words,the image-sentence cross-modal retrieval task is a supervised task with the alignments as ***,in many real-world applications,it is difficult to realign a large amount of parallel data for new scenarios due to the substantial labor costs,leading the non-parallel multi-modal data and existing methods cannot be used *** the other hand,there actually exists auxiliary parallel multi-modal data with similar semantics,which can assist the non-parallel data to learn the consistent ***,in this paper,we aim at“Alignment Efficient Image-Sentence Retrieval”(AEIR),which recurs to the auxiliary parallel image-sentence data as the source domain data,and takes the non-parallel data as the target domain *** single-modal transfer learning,AEIR learns consistent image-sentence cross-modal representations of target domain by transferring the alignments of existing parallel ***,AEIR learns the image-sentence consistent representations in source domain with parallel data,while transferring the alignment knowledge across domains by jointly optimizing a novel designed cross-domain cross-modal metric learning based constraint with intra-modal domain adversarial ***,we can effectively learn the consistent representations for target domain considering both the structure and semantic ***,extensive experiments on different transfer scenarios validate that AEIR can achieve better retrieval results comparing with the baselines.

关键词： image-sentence retrieval transfer learning semantic transfer structure transfer

来源：评论

学校读者我要写书评

暂无评论

Compact NSGA-II for Multi-objective Feature Selection

Compact NSGA-II for Multi-objective Feature Selection

引用

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

作者： Miyandoab, Sevil Zanjani Rahnamayan, Shahryar Bidgoli, Azam Asilian Ontario Tech University Department of Electrical Computer and Software Engineering OshawaON Canada Brock University Department of Engineering St. CatharinesON Canada Wilfrid Laurier University Faculty of Science WaterlooON Canada

ISBN: (纸本)9798350337020

Feature selection is an expensive challenging task in machine learning and data mining aimed at removing irrelevant and redundant features. This contributes to an improvement in classification accuracy, as well as the budget and memory requirements for classification, or any other post-processing task conducted after feature selection. In this regard, we define feature selection as a multi-objective binary optimization task with the objectives of maximizing classification accuracy and minimizing the number of selected features. In order to select optimal features, we have proposed a binary Compact NSGA-II (CNSGA-II) algorithm. Compactness represents the population as a probability distribution to enhance evolutionary algorithms not only to be more memory-efficient but also to reduce the number of fitness evaluations. Instead of holding two populations during the optimization process, our proposed method uses several Probability Vectors (PVs) to generate new individuals. Each PV efficiently explores a region of the search space to find non-dominated solutions instead of generating candidate solutions from a small population as is the common approach in most evolutionary algorithms. To the best of our knowledge, this is the first compact multi-objective algorithm proposed for feature selection. The reported results for expensive optimization cases with a limited budget on five datasets show that the CNSGA-II performs more efficiently than the well-known NSGA-II method in terms of the hypervolume (HV) performance metric requiring less memory. The proposed method and experimental results are explained and analyzed in detail. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Boosting Write Performance of KV Stores: An NVM - Enabled Storage Collaboration Approach

Boosting Write Performance of KV Stores: An NVM - Enabled St...

引用

International Conference on Data engineering

作者： Yi Wang Jiajian He Kaoyi Sun Yunhao Dong Jiaxian Chen Chenlin Ma Amelie Chi Zhou Rui Mao College of Computer Science and Software Engineering Shenzhen University Department of Computer Science Hong Kong Baptist University

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

As the most common data structure for key-value stores, LogStructured Merge Tree (LSM-tree) can eliminate random write operations and keep acceptable read performance. However, write stall and write amplification introduced by the leveled compaction of LSM-tree significantly degrade the system performance. The emerging non-volatile memory (NVM) provides byte-addressable access and low-latency data persistence. Integrating DIMM-interface NVM in the design of the LSM-tree can potentially alleviate the write stall and write amplification issue, as the access speed of NVM is several orders of magnitude faster than hard disk drives or flash memory-based solid-state drives. This hybrid storage should be carefully designed, requiring new architectural and key-value structural support. This paper presents ZigZagDB, an NVM-enabled data man-agement scheme for LSM-tree-based key-value stores. ZigZagDB adds additional layers of key-value stores and uses non-volatile memory as the storage media to hold these additional layers of data. The newly designed key-value stores alternately access the data from either SSD or NVM. This ‘ZigZag’ shape of storage collaboration and synchronization can benefit write efficiency and space utilization. By utilizing the NVM with very limited capacity, the redesigned organization of LSM-tree can effectively solve the write stall and write amplification issue. We demonstrate the viability of the proposed ZigZagDB using a set of extensive experiments. Experimental results show that ZigZagDB can significantly reduce the write amplification and boost the throughput in comparison with representative schemes.

关键词： Nonvolatile memory Solid state drives Shape System performance Collaboration Tail Throughput

来源：评论

学校读者我要写书评

暂无评论

Discovering Authorization Business Rules toward Detecting Web Applications Logic Flaws 23

Discovering Authorization Business Rules toward Detecting We...

引用

23rd International Arab Conference on Information Technology, ACIT 2022

作者： Alkofahi, Hamza Umphress, David Alawneh, Heba Jordan University of Science and Technology Department of Software Engineering Irbid Jordan Auburn University Department of Computer Science and Software Engineering Auburn United States Al Hussein Technical University Department of Cybersecurity Amman Jordan

ISBN: (纸本)9798350320244

Aggressive integration of validation checks into web framework software has altered the attack surface of web applications by reducing the opportunity for traditional injection flaws. The hacking community's reaction has shifted to a more subtle - and more challenging to detect - form of attacks, that of discovering and exploiting underlying application business logic. The lack of accurate business rules defining the final application product extends its logical vulnerability surface. We propose a novel black-box approach for discovering authorization business rules in web applications through users' dynamic behavior. Allowing applications that lack formal specifications to be better tested for logic vulnerabilities. Our approach discovers groups using agglomerative hierarchical clustering based on different profiling techniques that capture users' actions and privileges. We also automated the process of identifying the optimal number of roles. The results indicated high quality and stability in discovering business rules, even in smaller datasets. © 2022 IEEE.

关键词： Authorization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：