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

Artificial Intelligence and Natural Language Processing Inspired Chabot Technologies

Recent Advances in computer Science and Communications 2024年第1期17卷 11-20页

作者： Singh, Deepti Manju Jatain, Aman Netaji Subhash Institute of Technology New Delhi India Department of Computer Science and Engineering & Information Technology Jaypee Institute of Information Technology Noida India Department of Computer Science and Engineering Amity University Haryana India

Chatbots use artificial intelligence (AI) and natural language processing (NLP) algorithms to construct a clever system. By copying human connections in the most helpful way possi-ble, chatbots emulate individuals and serve as virtual assistants. They easily interface and respond to customers' requests. In the modern technical environment, these conversation agents or chatbots are considered the next-generation invention. Chatbot has become more popular in the business field right now as it can reduce customer service cost and handle multiple users at a time. There are many techniques used to involve such intelligent experts in daily business. A comprehensive analysis of the methods is needed to determine the viability of the different strategies. This paper tracks the progress of this invention and further clarifies the influence of chatbots on numerous businesses. Besides, a survey of the multiple chatbot methodologies suggested by various researchers is provid-ed. Along with the survey, a chatbot e-commerce customer service is designed to provide an efficient and accurate answer for any query based on the dataset of frequently asked questions. This chatbot can reduce customer service costs and can handle multiple customers at the same time. © 2024 Bentham Science Publishers.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Multi-dimensional information-driven many-objective software remodularization approach

引用

Frontiers of computer Science 2023年第3期17卷 45-62页

作者： Amarjeet PRAJAPATI Anshu PARASHAR Amit RATHEE Department of Computer Science Engineering&Information Technology Jaypee Istitute of Information TechnologyNoida 201307India Department of Computer Science&Engineering Thapar Institute of Engineering&TechnologyPunjab 147004India Department of Computer Science Government College BarotaHaryana 131301India

Most of the search-based software remodularization(SBSR)approaches designed to address the software remodularization problem(SRP)areutilizing only structural information-based coupling and cohesion quality ***,in practice apart from these quality criteria,there require other aspects of coupling and cohesion quality criteria such as lexical and changed-history in designing the modules of the software ***,consideration of limited aspects of software information in the SBSR may generate a sub-optimal modularization ***,such modularization can be good from the quality metrics perspective but may not be acceptable to the *** produce a remodularization solution acceptable from both quality metrics and developers’perspectives,this paper exploited more dimensions of software information to define the quality criteria as modularization ***,these objectives are simultaneously optimized using a tailored manyobjective artificial bee colony(MaABC)to produce a remodularization *** assess the effectiveness of the proposed approach,we applied it over five software *** obtained remodularization solutions are evaluated with the software quality metrics and developers view of *** demonstrate that the proposed software remodularization is an effective approach for generating good quality modularization solutions.

关键词： software restructuring remodularization multiobjective optimization software coupling and cohesion

来源：评论

学校读者我要写书评

暂无评论

QoS-Aware Application Assignment and Resource Utilisation Maximization Using AHP in Edge Computing

引用

IEEE Internet of Things Journal 2025年第11期12卷 17717-17728页

作者： Koganti, Yasasvitha Sridhar, Vidhyuth Yadav, Ram Narayan Pratap, Ajay Iitram Department of Electrical and Computer Science Engineering Ahmedabad380026 India Indiana University Department of Computer Science and Engineering Bloomington United States Banaras Hindu University Indian Institute of Technology Department of Computer Science and Engineering Varanasi India

Edge computing has emerged as a promising technology to satisfy the demand for data computational resources in Internet of Things (IoT) networks. With edge computing, processing of the massive data-intensive tasks can be done in the proximity of IoT users. Thus, the required constraints related to tasks such as latency requirements, and the Quality Of Service (QoS) can be guaranteed. However, the question that how to determine the task offloading strategy under various constraints of resources, distance, and cost is still an open issue. In this paper, we study the task offloading problem from a matching perspective and propose an Edge-User Assignment Algorithm (EUAA) that aims to maximize the resource utilization of edge servers and maximize the number of assigned IoT users. The main concern, in any matching algorithm, is how to generate the preference order of either side. To generate preference orders for edge servers, we use the concept of the Analytical Hierarchy Process (AHP). We have considered the following criteria: distance from users to the server, latency, available resources, and pricing. This generates the priority of the users for matching to edge servers. From IoT users' perspective, we use cost, and QoS parameters to improve their satisfaction. We have used state-of-the-art schemes to compare the performance of the proposed algorithm under different simulation scenarios. We compare the performance using the number of assigned users, servers' profit, number of satisfied users, edge server resources used, and execution time. The simulation results confirm that significant profit and satisfied user can be achieved by the proposed algorithm. © 2014 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

A State-Migration Particle Swarm Optimizer for Adaptive Latent Factor Analysis of High-Dimensional and Incomplete Data

引用

IEEE/CAA Journal of Automatica Sinica 2024年第11期11卷 2220-2235页

作者： Jiufang Chen Kechen Liu Xin Luo Ye Yuan Khaled Sedraoui Yusuf Al-Turki MengChu Zhou IEEE the College of Computer Science and Technology Chongqing University of Posts and Telecommunications the Department of Computer Science Columbia University the College of Computer and Information Science Southwest University the Department of Electrical and Computer Engineering Faculty of Engineeringand also with K.A.CARE Energy Research and Innovation CenterKing Abdulaziz University the Center of Research Excellence in Renewable Energy and Power Systems the Department of Electrical and Computer EngineeringFaculty of Engineeringand also with K.A.CARE Energy Research and Innovation CenterKing Abdulaziz University the Department of Electrical and Computer Engineering New Jersey Institute of Technology

High-dimensional and incomplete(HDI) matrices are primarily generated in all kinds of big-data-related practical applications. A latent factor analysis(LFA) model is capable of conducting efficient representation learning to an HDI matrix,whose hyper-parameter adaptation can be implemented through a particle swarm optimizer(PSO) to meet scalable ***, conventional PSO is limited by its premature issues,which leads to the accuracy loss of a resultant LFA model. To address this thorny issue, this study merges the information of each particle's state migration into its evolution process following the principle of a generalized momentum method for improving its search ability, thereby building a state-migration particle swarm optimizer(SPSO), whose theoretical convergence is rigorously proved in this study. It is then incorporated into an LFA model for implementing efficient hyper-parameter adaptation without accuracy loss. Experiments on six HDI matrices indicate that an SPSO-incorporated LFA model outperforms state-of-the-art LFA models in terms of prediction accuracy for missing data of an HDI matrix with competitive computational ***, SPSO's use ensures efficient and reliable hyper-parameter adaptation in an LFA model, thus ensuring practicality and accurate representation learning for HDI matrices.

关键词： Data science generalized momentum high-dimensional and incomplete(HDI)data hyper-parameter adaptation latent factor analysis(LFA) particle swarm optimization(PSO)

来源：评论

学校读者我要写书评

暂无评论

Design of a ML-based trust prediction model using intelligent TrustBoxes in challenged networks

引用

International Journal of Systems, Control and Communications 2024年第3期15卷 209-234页

作者： Barai, Smritikona Kundu, Anindita Bhaumik, Parama Department of Computer Science and Engineering Heritage Institute of Technology Kolkata India Department of Software Systems School of Computer Science and Engineering Vellore Institute of Technology Tamil Nadu India Department of Information Technology Jadavpur University Kolkata India

Challenged networks (CNs) contain resource-constrained nodes deployed in regions where human intervention is difficult. Opportunistic networks (OppNets) are CNs with no predefined source-to-destination paths. Due to their inherent properties, CNs and OppNets are highly susceptible to black-hole (BH) attacks, resulting in degraded packet-delivery ratio. In this work, an ML-based trust prediction model (MLTPM) is proposed to identify potential BH nodes in OppNets. MLTPM uses a novel function to calculate the total-trust-value (TTV) of each node. Intelligent TrustBoxes are introduced in the network to identify possible BH nodes, using TTV, along with five more node-behaviour features. TrustBoxes reduce the computational overhead of the resource-constrained nodes. Three simulated scenarios are compared - no detection, non-ML-based detection, and MLTPM, each using epidemic, prophet, and spray-and-wait routing protocols. MLTPM performs best with spray-and-wait, exhibiting about 25.21% and 80% mean improvement in delivery-ratio and dropped-message numbers respectively, compared to non-ML-based detection. An overall 12.62% improvement in delivery-ratio and 26.7% improvement in dropped messages is observed using MLTPM, compared to the above-mentioned scenarios. © 2024 Inderscience Enterprises Ltd.

关键词： HTTP

来源：评论

学校读者我要写书评

暂无评论

Introduction to the Special Issue on the Bottleneck of Blockchain Techniques Scalability,Security and Privacy Protection

引用

computer Modeling in engineering & Sciences 2024年第12期141卷 1933-1937页

作者： Shen Su Daojing He Neeraj Kumar Cyberspace Institute of Advanced Technology Guangzhou UniversityGuangzhou510006China School of Computer Science and Technology Harbin Institute of Technology(Shenzhen)Shenzhen518055China Department of Computer Science and Engineering Thapar Institute of Engineering and TechnologyPatiala147004India

Blockchain technology has been extensively studied over the past decade as a foundation for decentralized information-sharing platforms due to its promising *** the success of existing blockchain architectures like Bitcoin,Ethereum,Filecoin,Hyperledger Fabric,BCOS,and BCS,current blockchain applications are still quite *** struggles with scenarios requiring high-speed transactions(e.g.,online markets)or large data storage(e.g.,video services)due to consensus efficiency *** restrictions pose risks to investors in blockchain-based economic systems(e.g.,DeFi),deterring current and potential *** protection challenges make it difficult to involve sensitive data in blockchain applications.

关键词： services Ether limitations

来源：评论

学校读者我要写书评

暂无评论

Hybrid Approach for Cost Efficient Application Placement in Fog-Cloud Computing Environments

引用

computers, Materials & Continua 2024年第6期79卷 4127-4148页

作者： Abdulelah Alwabel Chinmaya Kumar Swain Department of Computer Sciences College of Computer Engineering and SciencesPrince Sattam bin Abdulaziz UniversityAl-Kharj11942Saudi Arabia Department of Computer Science and Engineering Institute of Management and Information TechnologyCuttackBPUTOdishaIndia

Fog computing has recently developed as a new paradigm with the aim of addressing time-sensitive applications better than with cloud computing by placing and processing tasks in close proximity to the data ***,the majority of the fog nodes in this environment are geographically scattered with resources that are limited in terms of capabilities compared to cloud nodes,thus making the application placement problem more complex than that in cloud *** approach for cost-efficient application placement in fog-cloud computing environments that combines the benefits of both fog and cloud computing to optimize the placement of applications and services while minimizing *** approach is particularly relevant in scenarios where latency,resource constraints,and cost considerations are crucial factors for the deployment of *** this study,we propose a hybrid approach that combines a genetic algorithm(GA)with the Flamingo Search Algorithm(FSA)to place application modules while minimizing *** consider four cost-types for application deployment:Computation,communication,energy consumption,and *** proposed hybrid approach is called GA-FSA and is designed to place the application modules considering the deadline of the application and deploy them appropriately to fog or cloud nodes to curtail the overall cost of the *** extensive simulation is conducted to assess the performance of the proposed approach compared to other state-of-the-art *** results demonstrate that GA-FSA approach is superior to the other approaches with respect to task guarantee ratio(TGR)and total cost.

关键词： Placement mechanism application module placement fog computing cloud computing genetic algorithm flamingo search algorithm

来源：评论

学校读者我要写书评

暂无评论

Classifying the state of knowledge-based question answering: patterns, progress, and prospects

引用

International Journal of computers and Applications 2025年第1期47卷 93-105页

作者： Sharma, Sumit Jain, Sarika Tiwari, Mukesh Kumar lal, Sohan Department of Computer Science and Engineering Quantum University Roorkee Uttarakhand Roorkee India Department of Computer Applications National Institute of Technology Haryana Kurukshetra India

In response to inquiries posed in natural languages, question-answering systems (QASs) produce responses. The capabilities of early QASs are limited because they were designed for certain domains. The current generation of QASs focuses on the types of inquiries that users typically enquire, the features of the data sources that are used, and the formats in which the right responses are produced. Many QASs have been developed since the 1960s when research on the subject first started. There are several cutting-edge frameworks for answering questions that can be used to categorize the QA system according to a number of criteria. The necessity for an extensive survey on QASs comes naturally in order to determine the future focus of research in this field. In this study, QASs are analyzed by the number of criteria used to categorize question-answering (QA) and provide the dimension using a variety of standards to cover all the QAS. We describe the current state of research in each QAS area and make recommendations for its future direction. Based on the dimension criteria outlined in the research methodology, research studies are chosen for additional review and comparison. Constructed some criteria to classify the QASs, we provide the classification and go over the benefits and drawbacks of each class's QAS, as well as the problems with the corresponding study. Results are detailed summarized and compared. As a result of this study, a general architecture of frameworks for QA over knowledge base (KB) is drawn in addition to the comparative analysis of systems, serving as a reference for academics working on related topics. © 2024 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

TRE-DSP:A traceable and revocable CP-ABE based data sharing scheme for IoV with partially hidden policy

引用

Digital Communications and Networks 2025年第2期11卷 455-464页

作者： Yousheng Zhou Rundong Peng Yuanni Liu Pandi Vijayakumar Brij Gupta College of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing 400065China College of Cyber Security and Information Law Chongqing University of Posts and TelecommunicationsChongqing 400065China Department of Computer Science and Engineering University College of EngineeringTindivanamMelpakkamTamil nadu 604001India Department of Computer Engineering National Institute of Technology KurukshetraIndia

With the popularity of the Internet of Vehicles(IoV),a large amount of data is being generated every *** to securely share data between the IoV operator and various value-added service providers becomes one of the critical *** to its flexible and efficient fine-grained access control feature,Ciphertext-Policy Attribute-Based Encryption(CP-ABE)is suitable for data sharing in ***,there are many flaws in most existing CP-ABE schemes,such as attribute privacy leakage and key *** paper proposes a Traceable and Revocable CP-ABE-based Data Sharing with Partially hidden policy for IoV(TRE-DSP).A partially hidden access structure is adopted to hide sensitive user attribute values,and attribute categories are sent along with the ciphertext to effectively avoid privacy *** addition,key tracking and malicious user revocation are introduced with broadcast encryption to prevent key *** the main computation task is outsourced to the cloud,the burden of the user side is relatively *** of security and performance demonstrates that TRE-DSP is more secure and practical for data sharing in IoV.

关键词： Privacy-preserving Attribute-based encryption Partially hidden policy Traceability User revocation Internet of vehicles

来源：评论

学校读者我要写书评

暂无评论

Chi-Square Target Encoding for Categorical Data Representation: A Real-World Sensor Data Case Study

引用

SN computer Science 2025年第3期6卷 1-22页

作者： Anitha, M. Savarimuthu, Nickolas Bhanu, S. Mary Saira Department of Computer Applications National Institute of Technology Trichy India Department of Computer Science and Engineering National Institute of Technology Trichy India

Feature engineering is critical for improving machine learning performance (ML), especially when handling categorical data. Traditional encoding methods, such as one-hot and label encoding, often result in challenges like high dimensionality and loss of category significance. To address these limitations, this study introduces a novel Chi-Square Target Encoding (CSTE) approach, which transforms categorical variables into numerical representations by leveraging the chi-square statistic to evaluate the association between categories and the target variable, preserving information effectively. Unlike conventional techniques, CSTE uses Chi-square test values to generate target-based encoded representations, ensuring reliable transformation without information loss. Comprehensive empirical evaluations were conducted on various datasets for binary classification, showcasing CSTE’s superiority over methods like regularized target encoding, basic target encoding, and fuzzification. A case study on real-world sensor data further validated its efficiency and scalability for large-scale data-driven applications. The proposed CSTE method achieved an average increment rate of 3.9447%, surpassing one-hot and fuzzification (1.0430%) and regularized target encoding (1.8308%). Classification outcomes demonstrated F1-scores exceeding 0.90 and AUC values nearing 0.99 across diverse datasets, highlighting its robustness. Furthermore, the reduced dimensionality significantly enhanced inference time while maintaining high accuracy. The CSTE method offers a robust framework for categorical data transformation, addressing limitations of traditional encoding techniques. It improves the interpretability and efficiency of categorical data representation, boosting ML performance. This innovative approach is well-suited for applications across various domains involving categorical data. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2025.

关键词： Categorical data encoding Chi- Square statistics Data distribution preservation Feature engineering Machine learning Target encoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：