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

Oppositional Red Fox Optimization Based Task Scheduling Scheme for Cloud Environment

computer Systems science & engineering 2023年第4期45卷 483-495页

作者： B.Chellapraba D.Manohari K.Periyakaruppan M.S.Kavitha Department of Information Technology Karpagam Institute of TechnologyCoimbatore641032TamilnaduIndia Department of Computer Science and Engineering St.Joseph’s Institute of TechnologyChennai600119India Department of Computer Science&Engineering SNS College of EngineeringCoimbatore641107India Department of Computer Science&Engineering SNS College of TechnologyCoimbatore641035India

Owing to massive technological developments in Internet of Things(IoT)and cloud environment,cloud computing(CC)offers a highly flexible heterogeneous resource pool over the network,and clients could exploit various resources on *** IoT-enabled models are restricted to resources and require crisp response,minimum latency,and maximum bandwidth,which are outside the *** was handled as a resource-rich solution to aforementioned *** high delay reduces the performance of the IoT enabled cloud platform,efficient utilization of task scheduling(TS)reduces the energy usage of the cloud infrastructure and increases the income of service provider via minimizing processing time of user ***,this article concentration on the design of an oppositional red fox optimization based task scheduling scheme(ORFOTSS)for IoT enabled cloud *** presented ORFO-TSS model resolves the problem of allocating resources from the IoT based cloud *** achieves the makespan by performing optimum TS procedures with various aspects of incoming *** designing of ORFO-TSS method includes the idea of oppositional based learning(OBL)as to traditional RFO approach in enhancing their efficiency.A wide-ranging experimental analysis was applied on the CloudSim *** experimental outcome highlighted the efficacy of the ORFO-TSS technique over existing approaches.

关键词： Metaheuristics task scheduling cloud computing internet of things makespan red fox optimizer

来源：评论

学校读者我要写书评

暂无评论

Manhattan-based k-member clustering and enhanced rabbit optimization algorithm for k-anonymization in social network

引用

Multimedia Tools and Applications 2024年第30期83卷 74739-74756页

作者： Sivasankari, K. Maheswari, K. M. Uma Department of computer science and engineering SRM Institute of Science and Technology Ramapuram Chennai India Department of computing technologies School of Computing College of Engineering and Technology SRM Institute of Science and Technology Kattankulathur India

Online social networks are becoming more and more popular, according to recent trends. The user's primary concern is the secure preservation of their data and privacy. A well-known method for preventing individual identity in publicly accessible datasets is K-anonymization. Existing anonymity techniques' primary drawback is that they're susceptible to similarity and attribute disclosure attacks. Furthermore, a large amount of data has been lost in the given database. To address this limitation, the proposed model integrated an anonymizing algorithm with Manhattan-based k-member clustering and an enhanced rabbit optimization algorithm (MKCAEROA). The Manhattan distance-based k member (MKCA) clustering algorithm is employed in this case to cluster the initial database. The resulting clusters are then further optimized, and the original database is made anonymous, using the enhanced rabbit optimization algorithm (EROA). In the suggested model, EROA is included to satisfy the specified anonymity constraints while concurrently minimizing the clustering error rate and the generated information loss. When compared to existing approaches, the experimental results demonstrate that the suggested method provides the highest clustering accuracy with the least amount of information loss. The MATLAB workbench will be used to implement the suggested model. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Regularized Multilayer Perceptron for Input Noise Immunity

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第1期5卷 115-126页

作者： Mondal, Rahul Pal, Tandra Dey, Prasenjit National Institute of Technology Durgapur Department of Computer Science and Engineering Durgapur713209 India Cooch Behar Government Engineering College Department of Computer Science and Engineering Cooch Behar736170 India

The immunity of multilayer perceptron (MLP) is less effective toward input noise. In this article, we have focused on the robustness of MLP with respect to input noise where noise can be additive or multiplicative. Here, we have proposed a DropConnect-based regularized MLP to reduce the coadaptation among the neurons of the hidden layer. At first, we have empirically and statistically shown that by reducing coadaptation among the hidden neurons, an MLP can achieve better noise immunity. We have also empirically shown that an MLP with input noise injection and $l_{2}$ regularizer is an effective approach to improve its noise immunity. However, the results indicate that it does not adjust the coadaptation among the hidden neurons. Therefore, for further improvement, we have proposed a hybrid regularized MLP (HRMLP), where DropConnect is combined with the noise injection and $l_{2}$ regularizer. In addition to input noise, we have also verified the robustness of HRMLP with respect to $\mathbf {20\%}$ outliers in the dataset. To justify the effectiveness of the proposed HRMLP, we have compared it with MLP, MLP with noise injection, MLP with $l_{2}$ regularizer, MLP with noise injection and $l_{2}$ regularizer, and MLP with DropConnect along with two state-of-the-art works based on $\mathbf {20}$ standard datasets. The experimental results for both noisy inputs and outliers confirm that the performance of HRMLP is significant compared to other methods. © 2020 IEEE.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

Event-triggered tracking control for a class of nonholonomic systems in chained form

引用

science China(Information sciences) 2023年第7期66卷 147-161页

作者： Liang XU Youfeng SU He CAI Center for Discrete Mathematics and Theoretical Computer Science Fuzhou University College of Computer and Data Science Fuzhou University School of Automation Science and Engineering South China University of Technology

In this study, the event-triggered asymptotic tracking control problem is considered for a class of nonholonomic systems in chained form for the time-varying reference input. First, to eliminate the ripple phenomenon caused by the imprecise compensation of the time-varying reference input, a novel time-varying event-triggered piecewise continuous control law and a triggering mechanism with a time-varying triggering function are developed. Second, an explicit integral input-to-state stable Lyapunov function is constructed for the time-varying closed-loop system regarding the sampling error as the external input. The origin of the closed-loop system is shown to be uniformly globally asymptotically stable for any global exponential decaying threshold signals, which in turn rules out the Zeno behavior. Moreover, infinitely fast sampling can be avoided by appropriately tuning the exponential convergence rate of the threshold signal. A numerical simulation example is provided to illustrate the proposed control approach.

关键词： event-triggered nonholonomic systems strict Lyapunov function tracking integral input-to-state stable

来源：评论

学校读者我要写书评

暂无评论

Conditional adversarial segmentation and deep learning approach for skin lesion sub-typing from dermoscopic images

引用

Neural Computing and Applications 2024年第26期36卷 16445-16463页

作者： Mirunalini, P. Desingu, Karthik Aswatha, S. Deepika, R. Deepika, V. Jaisakthi, S.M. Department of Computer Science Engineering Sri Sivasubramaniya Nadar College of Engineering Chennai603110 India School of Computer Science and Engineering Vellore Institute of Technology Chennai Campus Chennai600127 India

Automatic skin lesion subtyping is a crucial step for diagnosing and treating skin cancer and acts as a first level diagnostic aid for medical experts. Although, in general, deep learning is very effective in image processing tasks, there are notable areas of the processing pipeline in the dermoscopic image regime that can benefit from refinement. Our work identifies two such areas for improvement. First, most benchmark dermoscopic datasets for skin cancers and lesions are highly imbalanced due to the relative rarity and commonality in the occurrence of specific lesion types. Deep learning methods tend to exhibit biased performance in favor of the majority classes with such datasets, leading to poor generalization. Second, dermoscopic images can be associated with irrelevant information in the form of skin color, hair, veins, etc.;hence, limiting the information available to a neural network by retaining only relevant portions of an input image has been successful in prompting the network towards learning task-relevant features and thereby improving its performance. Hence, this research work augments the skin lesion characterization pipeline in the following ways. First, it balances the dataset to overcome sample size biases. Two balancing methods, synthetic minority oversampling TEchnique (SMOTE) and Reweighting, are applied, compared, and analyzed. Second, a lesion segmentation stage is introduced before classification, in addition to a preprocessing stage, to retain only the region of interest. A baseline segmentation approach based on Bi-Directional ConvLSTM U-Net is improved using conditional adversarial training for enhanced segmentation performance. Finally, the classification stage is implemented using EfficientNets, where the B2 variant is used to benchmark and choose between the balancing and segmentation techniques, and the architecture is then scaled through to B7 to analyze the performance boost in lesion classification. From these experiments, we find

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Natural Language Processing Algorithms for Sentiment Analysis

引用

SN computer science 2024年第6期5卷 724页

作者： Silviya, S. H. Annie Faith, S. Julia Seetha, R. Hemalatha, M. Department of Computer Science and Engineering Rajalakshmi Institute of Technology (RIT) Department of Information Technology S.A.Engineering College Department of Information Technology Vellore Institute of Technology Department of Computer Science and Engineering RMD Engineering College

Sentiment analysis can be used to identify if a text’s sentiment is neutral, positive, or negative. One type of natural language processing is sentiment analysis. An interdisciplinary field encompassing linguistics, computer science, and artificial intelligence called “natural language processing” studies how computers and human language interact, with a focus on how to teach computers to process and analyze vast volumes of natural language data. Sentiment analysis, sometimes referred to as opinion mining or emotion artificial intelligence, is the methodical identification, extraction, quantification, and study of affective states and subjective data using natural language processing, text analysis, computational linguistics, and biometrics. Sentiment analysis is frequently used in online and social media platforms, voice of the customer materials (such as reviews and survey replies), and healthcare materials for marketing, customer service, and clinical medicine purposes. This paper discusses different sentiment analysis methods and selects the best approach for a certain task. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2024.

关键词： Biometrics Computational linguistics Natural language processing Sentiment analysis Text analysis

来源：评论

学校读者我要写书评

暂无评论

An innovative Telugu text summarization framework using the pointer network and optimized attention layer

引用

Multimedia Tools and Applications 2024年第37期83卷 84539-84564页

作者： M, Varaprasad Rao Chakma, Kunal Jamatia, Anupam Rudrapal, Dwijen Department of Computer Science & amp Engineering National Institute of Technology Agartala Tripura799046 India Department of Computer Science & amp Engineering CVR College of Engineering Telangana Hyderabad501510 India

Summarizing lengthy text involves distilling crucial information into a concise form by covering the key events in the source text. Previous researchers mostly explored the supervised approaches for the task, but due to its strong reliance on the quality of text features, the resulting summaries often lack precision and coherence. The performance of the state-of-the-art summarizers becomes poor when applied to various Indian languages due to several challenges. The current research paper proposes a summarization approach for Telugu text based on a Pointer Network with an Optimised Attention Layer (PN-OAL). In this approach, the attention layer’s weights are adjusted using a hybrid optimization method that combines the Fusion of Coyote Optimization and Squirrel Search method (FCO-SSA). Weight optimization is conducted in order to address the goal function, which involves the maximization of the cosine similarity between the source text and the summary text. A novel loss function is incorporated within the framework of the constructed network architecture to generate a robust summary. The proposed approach is experimented with alternative baseline approaches in order to validate its efficacy for summarizing Telugu documents. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

An Ophthalmic Evaluation of Central Serous Chorioretinopathy

引用

computer Systems science & engineering 2023年第1期44卷 613-628页

作者： L.K.Shoba P.Mohan Kumar Department of Information Technology Jeppiaar Engineering CollegeChennai600119India Department of Computer Science and Engineering Sri Krishna College of Engineering and TechnologyCoimbatore641008India

Nowadays in the medicalfield,imaging techniques such as Optical Coherence Tomography(OCT)are mainly used to identify retinal *** this paper,the Central Serous Chorio Retinopathy(CSCR)image is analyzed for various stages and then compares the difference between CSCR before as well as after treatment using different application *** approach,which was focused on image quality,improves medical image *** enhancement algorithm was implemented to improve the OCT image contrast and denoise purpose called Boosted Anisotropic Diffusion with an Unsharp Masking Filter(BADWUMF).The classifier used here is tofigure out whether the OCT image is a CSCR case or not.150 images are checked for this research work(75 abnormal from Optical Coherence Tomography Image Retinal Database,in-house clinical database,and 75 normal images).This article explicitly decides that the approaches suggested aid the ophthalmologist with the precise retinal analysis and hence the risk factors to be *** total precision is 90 percent obtained from the Two Class Support Vector Machine(TCSVM)classifier and 93.3 percent is obtained from Shallow Neural Network with the Powell-Beale(SNNWPB)classifier using the MATLAB 2019a program.

关键词： OCT CSCR macula segmentation boosted anisotropic diffusion with unsharp maskingfilter two class support vector machine classifier and shallow neural network with powell-beale classifier

来源：评论

学校读者我要写书评

暂无评论

Dual-Enhanced High-Order Self-Learning Tensor Singular Value Decomposition for Robust Principal Component Analysis

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3564-3578页

作者： Xu, Honghui Fang, Chuangjie Wang, Renfang Chen, Shengyong Zheng, Jianwei Zhejiang University of Technology College of Computer Science and Technology Hangzhou310023 China Zhejiang Wanli University College of Big Data and Software Engineering Ningbo315200 China Tianjin University of Technology College of Computer Sciences and Engineering Tianjin300384 China

Recently, tensor singular value decomposition (TSVD) within high-order (Ho) algebra framework has shed new light on tensor robust principal component analysis (TRPCA) problem. However, HoTSVD lacks flexibility in handling the hidden correlations along different modes of large-scale multidimensional data. Moreover, the utilization of fixed or data-independent transformations in HoTSVD may result in suboptimality. For a relief, we propose a dual-enhanced self-learning TSVD along all modes to address computational flaws and learn a lossless transformation that induces a lower average-rank tensor. Specifically, we multiply the learnable semiorthogonal matrices obtained through Tucker compression with the original tensor along all modes, thus obtaining a core tensor with more inherent low rankness. Building upon this foundation, a new TNN is introduced by generalizing HoTSVD to Mode-k TSVD, followed by the facilitation to the core tensor, achieving dual-enhancement. Moreover, a reweighting scheme is imposed on the Mode-k HoTSVD to learn the global low-rank correlation and provide an efficient numerical solution. Finally, an alternating direction method of multipliers (ADMM)-based algorithm is developed as a solver. Experimental results on several types of multidimensional visual data, including light field images (LFI) and color videos, demonstrate the superiority of the proposal over previous state-of-the-art methods. © 2020 IEEE.

关键词： Discrete Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

An Advanced Dynamic Scheduling for Achieving Optimal Resource Allocation

引用

computer Systems science & engineering 2023年第1期44卷 281-295页

作者： R.Prabhu S.Rajesh Department of Computer Science and Engineering AAA College of Engineering and TechnologySivakasiTamilnaduIndia Department of Information Technology Mepco Schlenk Engineering College SivakasiTamilnadu India

Cloud computing distributes task-parallel among the various *** with self-service supported and on-demand service have rapid *** these applications,cloud computing allocates the resources dynami-cally via the internet according to user *** resource allocation is vital for fulfilling user *** contrast,improper resource allocations result to load imbalance,which leads to severe service *** cloud resources implement internet-connected devices using the protocols for storing,communi-cating,and *** extensive needs and lack of optimal resource allo-cating scheme make cloud computing more *** paper proposes an NMDS(Network Manager based Dynamic Scheduling)for achieving a prominent resource allocation scheme for the *** proposed system mainly focuses on dimensionality problems,where the conventional methods fail to address *** proposed system introduced three–threshold mode of task based on its size STT,MTT,LTT(small,medium,large task thresholding).Along with it,task mer-ging enables minimum energy consumption and response *** proposed NMDS is compared with the existing Energy-efficient Dynamic Scheduling scheme(EDS)and Decentralized Virtual Machine Migration(DVM).With a Network Manager-based Dynamic Scheduling,the proposed model achieves excellence in resource allocation compared to the other existing *** obtained results shows the proposed system effectively allocate the resources and achieves about 94%of energy efficient than the other *** evaluation metrics taken for comparison are energy consumption,mean response time,percentage of resource utilization,and migration.

关键词： Cloud computing resource allocation load balance dynamic scheduling dimensionality reduction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：