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

P3DC:Reducing DRAM Cache Hit Latency by Hybrid Mappings

Journal of Computer Science & technology 2024年第6期39卷 1341-1360页

作者： Ye Chi Ren-Tong Guo Xiao-Fei Liao Hai-Kun Liu Jianhui Yue National Engineering Research Center for Big Data Technology and System Wuhan 430074China Services Computing Technology and System Laboratory Wuhan 430074China Cluster and Grid Computing Laboratory Wuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China School of Big Data and Internet Shenzhen Technology UniversityShenzhen 518118China Department of Computer Science Michigan Technological UniversityHoughton 49931-1295U.S.A.

Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main *** fully realize their potential,it is essential to improve DRAM cache hit rate and lower its cache hit *** order to take advantage of the high hit-rate of set-association and the low hit latency of direct-mapping at the same time,we propose a partial direct-mapped die-stacked DRAM cache called *** design is motivated by a key observation,i.e.,applying a unified mapping policy to different types of blocks cannot achieve a high cache hit rate and low hit latency *** address this problem,P3DC classifies data blocks into leading blocks and following blocks,and places them at static positions and dynamic positions,respectively,in a unified set-associative *** also propose a replacement policy to balance the miss penalty and the temporal locality of different *** addition,P3DC provides a policy to mitigate cache thrashing due to block type *** results demonstrate that P3DC can reduce the cache hit latency by 20.5%while achieving a similar cache hit rate compared with typical set-associative caches.P3DC improves the instructions per cycle(IPC)by up to 66%(12%on average)compared with the state-of-the-art direct-mapped cache—BEAR,and by up to 19%(6%on average)compared with the tag-data decoupled set-associative cache—DEC-A8.

关键词： die-stacked dynamic random access memory(DRAM) cache set-associative direct-mapped hit latency

来源：评论

学校读者我要写书评

暂无评论

Leveraging Deep Learning and Blockchain for Enhanced Transparency and Traceability in the Indian Herbal Product Supply Chain

Leveraging Deep Learning and Blockchain for Enhanced Transpa...

引用

2024 International Conference on Intelligent Systems for Cybersecurity, ISCS 2024

作者： Uniyal, Prateek Singh, Charanjeet Dinesh, G. SRM Institute of Science and Technology Dept of Computational Intelligence School of Computing School of Engineering and Technology Chennai Kattankulathur India

ISBN: (纸本)9798350375237

Medicinal plants have been a cornerstone of healthcare practices globally, serving a significant population in developing countries who rely on affordable herbal remedies. However, the current marketing system through Mandis and wholesale markets suffers from opacity. Numerous intermediaries create an information gap for farmers regarding fair pricing and market trends. Additionally, concerns exist about misidentification and adulteration of medicinal plants due to limited knowledge among collectors and traders. The National Medicinal Plants Board (NMPB) recognizes the need for a robust supply chain. This paper proposes a blockchain-based platform 'Indian Herbal Blockchain Network (IHBN)' integrated with Deep Learning for image processing. The deep learning model has achieved a decent accuracy of 90.24% which decreases the chance of misidentification. The platform ensures transparent traceability of medicinal plants from source to consumer, along with accurate identification using image analysis. This system promotes transparency within the medicinal plant supply chain, reducing the risk of adulteration and improving overall trust. © 2024 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Designing Proportional-Integral Consensus Protocols for Second-Order Multi-Agent Systems Using Delayed and Memorized State Information

引用

IEEE/CAA Journal of Automatica Sinica 2024年第4期11卷 878-892页

作者： Honghai Wang Qing-Long Han the College of Information Science and Engineering State Key Laboratory of Synthetical Automation for Process IndustriesNortheastern UniversityShenyang 110819China the School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyMelbourneVIC 3122Australia

This paper is concerned with consensus of a secondorder linear time-invariant multi-agent system in the situation that there exists a communication delay among the agents in the network.A proportional-integral consensus protocol is designed by using delayed and memorized state *** the proportional-integral consensus protocol,the consensus problem of the multi-agent system is transformed into the problem of asymptotic stability of the corresponding linear time-invariant time-delay *** that the location of the eigenvalues of the corresponding characteristic function of the linear time-invariant time-delay system not only determines the stability of the system,but also plays a critical role in the dynamic performance of the *** this paper,based on recent results on the distribution of roots of quasi-polynomials,several necessary conditions for Hurwitz stability for a class of quasi-polynomials are first *** allowable regions of consensus protocol parameters are *** necessary and sufficient conditions for determining effective protocol parameters are *** designed protocol can achieve consensus and improve the dynamic performance of the second-order multi-agent ***,the effects of delays on consensus of systems of harmonic oscillators/double integrators under proportional-integral consensus protocols are ***,some results on proportional-integral consensus are derived for a class of high-order linear time-invariant multi-agent systems.

关键词： Consensus protocol Hurwitz stability multi-agent systems quasi-polynomials time delay

来源：评论

学校读者我要写书评

暂无评论

Scalable Transactional Stream Processing on Multicore Processors

引用

IEEE Transactions on Knowledge and Data engineering 2025年第7期37卷 4254-4269页

作者： Zhao, Jianjun Mao, Yancan Yang, Zhonghao Liu, Haikun Zhang, Shuhao Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China National University of Singapore 119077 Singapore Nanyang Technological University 639798 Singapore

Transactional stream processing engines (TSPEs) are central to modern stream applications handling shared mutable states. However, their full potential, particularly in adaptive scheduling, remains largely unexplored. We present MorphStream, a TSPE designed to optimize parallelism and performance for transactional stream processing on multicores. Through a unique three-stage execution paradigm (i.e., planning, scheduling, and execution), MorphStream enables adaptive scheduling under varying workload characteristics. Building on this foundation, MorphStream is further enhanced with support for non-deterministic state access, employing a stateful task precedence graph to handle undefined read/write sets at runtime while guaranteeing transaction semantics. Additionally, MorphStream incorporates a generalized framework for managing window-based operations, enabling efficient tracking and maintenance of overlapping windows using multi-versioned state management. These extensions enhance the system’s ability to process dynamic and irregular workloads. Experimental results demonstrate up to 3.4 times higher throughput and 69.1% lower latency compared to state-of-the-art TSPEs, validating its scalability and adaptability in real-world streaming scenarios. © 1989-2012 IEEE.

关键词： Multicore programming

来源：评论

学校读者我要写书评

暂无评论

Cyberbullying Advisory Model 15

Cyberbullying Advisory Model

引用

15th International Conference on Advances in computing, Control, and Telecommunication Technologies, ACT 2024

作者： Dhulipala, Sai Kowshik Jaswanth, Vungarala Ragunthar, T. Department of Computing Technologies Faculty of Engineering and Technology School of Computing SRM Institute of Science and Technology Kattankulathur Tamil Nadu Chennai603203 India

ISBN: (纸本)9798331300579

In the current digital environment, cyberbullying remains a significant threat to online safety and well-being. This study explores the technological advancements and strategies utilized in the project, providing compelling evidence of its effectiveness in reshaping the landscape of cyberbullying recovery. To tackle this urgent issue, we introduce the "Cyberbullying Advisory," an innovative AI-powered solution. Unlike traditional technologies, our platform is specifically designed to offer a dedicated space for cyberbullying victims across different online platforms, allowing them to share their stories and begin a journey towards emotional healing. Notably, it goes a step further by providing legal guidance to assist users in navigating the complexities of online harassment. Incorporating technologies such as Natural Language Processing (NLP), Natural Language Understanding (NLU), and Deep Learning, our models utilize task-specific datasets to implement key features like Toxicity Level Detection, Empathetic Response, and Intent Recognition. By leveraging the BERT Model for improved user interaction, these technologies enable real-time empathetic responses and personalized legal advice, revolutionizing the user experience in combating cyberbullying. The integration of AI-driven analysis and supervised learning techniques ensures accurate identification and categorization of toxic content, allowing users to receive tailored support. The uniqueness of our project lies in the seamless integration of these components, emphasizing precision through the use of task-specific datasets. By providing victims with empathetic and context-aware responses, our platform serves as a steadfast ally, offering assistance to those impacted by cyberbullying across diverse digital platforms. © Grenze Scientific Society, 2024.

关键词： Phishing

来源：评论

学校读者我要写书评

暂无评论

Improved Double Deep Q Network-Based Task Scheduling Algorithm in Edge computing for Makespan Optimization

引用

Tsinghua Science and technology 2024年第3期29卷 806-817页

作者： Lei Zeng Qi Liu Shigen Shen Xiaodong Liu School of Computer Science Nanjing University of Information Science and TechnologyNanjing 210044China School of Software Nanjing University of Information Science and TechnologyNanjing 210044China School of Information Engineering Huzhou UniversityHuzhou 313000China School of Computing Edinburgh Napier UniversityEdinburghEH105DTUK

Edge computing nodes undertake an increasing number of tasks with the rise of business ***,how to efficiently allocate large-scale and dynamic workloads to edge computing resources has become a critical *** study proposes an edge task scheduling approach based on an improved Double Deep Q Network(DQN),which is adopted to separate the calculations of target Q values and the selection of the action in two networks.A new reward function is designed,and a control unit is added to the experience replay unit of the *** management of experience data are also modified to fully utilize its value and improve learning *** learning agents usually learn from an ignorant state,which is *** such,this study proposes a novel particle swarm optimization algorithm with an improved fitness function,which can generate optimal solutions for task *** optimized solutions are provided for the agent to pre-train network parameters to obtain a better cognition *** proposed algorithm is compared with six other methods in simulation *** show that the proposed algorithm outperforms other benchmark methods regarding makespan.

关键词： edge computing task scheduling reinforcement learning makespan Double Deep Q Network(DQN)

来源：评论

学校读者我要写书评

暂无评论

Research on an Intelligent Evaluation System for Used Car Prices Based on Improved Machine Learning Algorithms

Journal of Network Intelligence

引用

Journal of Network Intelligence 2023年第2期8卷 461-477页

作者： Lin, Xianning Hashim, Salwa School of Information Technology Guangdong Technology College Zhaoqing526100 China Faculty of Engineering Computing and Science Swinburne University of Technology Kuching93350 Malaysia

The advent of the big data era offers great opportunities for the development of online trading platforms for used cars. However, problems such as lack of appraisal data, asymmetric appraisal information and high cost of the appraisal process can limit the use of the three traditional used car price appraisal methods. Therefore, it is important to design an accurate and reasonable used car valuation method in the current immature market. As an advanced machine learning model, the Random Forest algorithm has strong advantages in terms of prediction accuracy, missing value handling and noise tolerance. Therefore, this paper introduces the Random Forest model into the study of used car value evaluation and improves the Random Forest model. Firstly, based on the characteristic price theory, 16 indicators were selected as characteristic variables among the factors influencing the value of used cars, and divided into 7 physical variables, 6 functional variables and 3 market variables. Secondly, aiming at the problems of poor training accuracy and relatively poor voting ability, an Inertia Bacterial Foraging Optimization Random Forest algorithm (IBFO-RF) is proposed. A multiplicative weight is set for all decision trees to match their training accuracy, and then the basic parameters of the Random Forest algorithm are optimally selected iteratively using inertia weighted bacterial foraging optimization to improve the output correctness. Finally, the data is imported into the random forest model, and according to the average decreasing degree of mean square error, an intelligent evaluation system for evaluating the value of used cars is established. It was validated against other algorithms on four datasets in the UCI dataset. The experimental results show that the validation of the proposed IBFO-RF algorithm can effectively improve the accuracy of the final classification and has significant advantages in handling the classification problem. The proposed intelligent used ca

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

Real-Time Multi-Feature Approximation Model-Based Efficient Brain Tumor Classification Using Deep Learning Convolution Neural Network Model

引用

Computer Systems Science & engineering 2023年第9期46卷 3883-3899页

作者： Amarendra Reddy Panyala M.Baskar Department of Computer Science and Engineering School of ComputingSRM Institute of Science and TechnologyKattankulathurChengalpattuChennai603203TamilnaduIndia Department of Information Technology MLR Institute of TechnologyHyderabad500043TelanganaIndia Department of Computing Technologies School of ComputingSRM Institute of Science and TechnologyKattankulathurChengalpattuChennai603203TamilnaduIndia

The deep learning models are identified as having a significant impact on various *** same can be adapted to the problem of brain tumor ***,several deep learning models are presented earlier,but they need better classification *** efficient Multi-Feature Approximation Based Convolution Neural Network(CNN)model(MFACNN)is proposed to handle this *** method reads the input 3D Magnetic Resonance Imaging(MRI)images and applies Gabor filters at multiple *** noise-removed image has been equalized for its quality by using histogram ***,the features like white mass,grey mass,texture,and shape are extracted from the *** features are trained with deep learning Convolution Neural Network(CNN).The network has been designed with a single convolution layer towards dimensionality *** texture features obtained from the brain image have been transformed into a multi-dimensional feature matrix,which has been transformed into a single-dimensional feature vector at the convolution *** neurons of the intermediate layer are designed to measure White Mass Texture Support(WMTS),GrayMass Texture Support(GMTS),WhiteMass Covariance Support(WMCS),GrayMass Covariance Support(GMCS),and Class Texture Adhesive Support(CTAS).In the test phase,the neurons at the intermediate layer compute the support as mentioned above values towards various classes of *** on that,the method adds a Multi-Variate Feature Similarity Measure(MVFSM).Based on the importance ofMVFSM,the process finds the class of brain image given and produces an efficient result.

关键词： CNN deep learning brain tumor classification MFA-CNN MVFSM 3D MRI texture Gabor

来源：评论

学校读者我要写书评

暂无评论

Adaptive sail fish optimizer based optimized region selection for robust video steganography

引用

International Journal of Information technology (Singapore) 2025年第4期17卷 2417-2427页

作者： Babu, J. Suresh Niranjana, G. Ramana, Kadiyala Department of Computing Science & Engineering School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamil Nadu Kattankulathur Chengalpattu India Department of Computing Technologies SRM Institute of Science and Technology Kattankulathur Chengalpattu India Department of Artificial Intelligence and Data Science Chaitanya Bharathi Institute of Technology (Autonomous) Hyderabad India

Securing data transmission in a digital era is a difficult one due to the broad application of the Internet, personal computers, and mobile phones for communication. Traditional video steganography techniques sometimes fail to identify the best pixels for encoding hidden data, resulting in lowerquality and robustness. To solve this issue, this article proposes an innovative steganography technique that improves the security and quality of data hiding. The proposed method takes cover video and secret images as input. The Structural Similarity Index Measurement (SSIM) first collects key frames from the input video. The adaptive sailfish optimizer (ASFO) is then used to find the best regions within these keyframes to insert the secret data in. To improve security, the discrete wavelet transform (DWT) is applied to the specified region, and the LL band is used for the hiding process. The secret image is encrypted by Adaptive elliptical curve cryptography (AECC) and transformed to binary bits, which then get embedded in the chosen band. This method leads to the construction of a stego-video. The extraction procedure is repeated using the same approach, which ensures secure and robust data transmission. Performance metrics, including PSNR, BER, NAE, TAF, and NC are analyzed to compare each method's efficacy. © Bharati Vidyapeeth's Institute of Computer Applications and Management 2025.

关键词： Adaptive elliptical curve cryptography And stego-video Discrete wavelet transform Structural similarity index measurement Video steganography

来源：评论

学校读者我要写书评

暂无评论

AI-Driven Symptom Checker: Leveraging Big Data Technologies for Real-Time Healthcare Triage and Diagnostics 5

AI-Driven Symptom Checker: Leveraging Big Data Technologies ...

引用

5th International Conference on Sustainable Communication Networks and Application, ICSCNA 2024

作者： Banerjee, Augnik Baibhav, Piyush Kumar, Nitin Singh, Aniket Gouthaman, P. School of Computing College of Engineering and Technology SRM Institute of Science and Technology Department of Networking and Communications Kattankulathur603203 India School of Computing SRM Institute of Science and Technology Faculty of Engineering and Technology Department of Networking and Communications Kattankulathur603203 India

ISBN: (纸本)9798331530013

The healthcare industry continues to face significant challenges in delivering timely and accurate diagnoses, particularly in remote and underserved areas where access to medical professionals is limited. The work aims to develop an AI-driven symptom checker that leverages big data technologies to offer preliminary diagnoses and support patient triage, ensuring quicker medical response times. Utilizing Hadoop for scalable data storage, Hive for advanced data analysis, and Spark for real-time distributed data processing, the system is designed to efficiently handle large volumes of patient data. Tableau is integrated for intuitive data visualization, allowing healthcare professionals to gain actionable insights and make informed decisions promptly. The proposed architecture enables the swift analysis of patient symptoms in real-time, significantly reducing diagnostic delays and enhancing the quality of care. By focusing on scalable and efficient data processing, the work addresses the need for a robust healthcare solution capable of operating in environments with limited resources. This system has the potential to transform patient care in remote areas by providing real-time analysis, identifying critical cases, and aiding in effective resource allocation. The solution's emphasis on rapid diagnosis and visualization offers a comprehensive approach to improving healthcare outcomes in underserved regions. © 2024 IEEE.

关键词： AI-Driven Symptom Checker Apache Spark Hadoop Healthcare Triage Hive Tableau

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：