检索结果-南通市图书馆

CA-KSE: a combinatorial algorithm for benchmarking in knowledge sharing environment

International Journal of Intelligent Computing and Cybernetics 2019年第1期12卷 2-22页

作者： Femi Emmanuel Ayo olusegun folorunso Sakinat Oluwabukonla folorunso Department of Computer Science Federal University of AgricultureAbeokutaNigeria Department of Physical and Computer Sciences McPherson UniversitySeriki SotayoNigeria Department of Computer Science College of Physical SciencesFederal University of AgricultureAbeokutaNigeria Department of Mathematical Sciences Olabisi Onabanjo UniversityAgo IwoyeNigeria

Purpose–Over the past decade,the cost of product development has increased drastically,and this is due to the inability of most enterprises to locate suitable and optimal collaborators for knowledge ***,knowledge sharing is a mechanism that helps people find the best collaborators with relevant ***,a new approach for locating optimal collaborators with relevant knowledge is needed,which couldhelp enterprisein reducingcost andtime ina *** aimsto discuss these ***/methodology/approach–One unique challenge in the domain of knowledge sharing is that collaborators do not possess the same number of events resident in the knowledge available for *** this paper,the authors present a new approach for locating optimal collaborators in knowledge-sharing environment using the combinatorial algorithm(CA-KSE).Findings–The proposed pattern-matching approach implemented in Java is considered efficient for solving the issue peculiar to collaboration in knowledge-sharing *** authors benchmarked the proposed approach with its semi-global pairwise alignment and global alignment counterparts through scores comparison and the receiver operating characteristic *** results obtained from the comparisons showedthat CA-KSEis a perfect test havinganarea undercurveof 0.9659,comparedto the other *** limitations/implications–The paper has proposed an efficient algorithm,which is considered better than related methods,for matching several collaborators(more than two)in KS *** method could be deployed in medical field for gene analysis,software organizations for distributed development and academics for knowledge ***/value–One sign of strength of this approach,compared to most sequence alignment approaches that can only match two collaborators at a time,is that it can match several collaborators at a faster rate.

关键词： Combinatorial algorithm Knowledge sharing(KS) Collaborators Pattern matching,Benchmark score

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Hate speech detection in Twitter using hybrid embeddings and improved cuckoo search-based neural networks

引用

International Journal of Intelligent Computing and Cybernetics 2020年第4期13卷 485-525页

作者： Femi Emmanuel Ayo olusegun folorunso Friday Thomas Ibharalu Idowu Ademola Osinuga Computer Science College of Natural and Applied SciencesMcPherson UniversitySeriki SotayoNigeria Computer Science College of Natural SciencesFederal University of Agriculture AbeokutaAbeokutaNigeria Computer Science Federal University of Agriculture AbeokutaAbeokutaNigeria Mathematics Federal University of Agriculture AbeokutaAbeokutaNigeria

Purpose-Hate speech is an expression of intense *** has become a popular analytical tool for the prediction and monitoring of abusive *** speech detection with social media data has witnessed special research attention in recent studies,hence,the need to design a generic metadata architecture and efficient feature extraction technique to enhance hate speech ***/methodology/approach-This study proposes a hybrid embeddings enhanced with a topic inference method and an improved cuckoo search neural network for hate speech detection in Twitter *** proposed method uses a hybrid embeddings technique that includes Term Frequency-Inverse Document Frequency(TF-IDF)for word-level feature extraction and Long Short Term Memory(LSTM)which is a variant of recurrent neural networks architecture for sentence-level feature *** extracted features from the hybrid embeddings then serve as input into the improved cuckoo search neural network for the prediction of a tweet as hate speech,offensive language or ***-The proposed method showed better results when tested on the collected Twitter datasets compared to other related *** order to validate the performances of the proposed method,t-test and post hoc multiple comparisons were used to compare the significance and means of the proposed method with other related methods for hate speech ***,Paired Sample t-Test was also conducted to validate the performances of the proposed method with other related *** limitations/implications-Finally,the evaluation results showed that the proposed method outperforms other related methods with mean F1-score of ***/value-The main novelty of this study is the use of an automatic topic spotting measure based on na€ıve Bayes model to improve features representation.

关键词： Twitter Hate speech detection Embeddings Cuckoo search Neural networks

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

TCP Window Based Congestion Control -Slow-Start Approach

引用

Communications and Network 2011年第2期3卷 85-98页

作者： Kolawole I. Oyeyinka Ayodeji O. Oluwatope Adio. T. Akinwale olusegun folorunso Ganiyu A. Aderounmu Olatunde O. Abiona 不详

Transmission control protocol (TCP) has undergone several transformations. Several proposals have been put forward to change the mechanisms of TCP congestion control to improve its performance. A line of research tends to reduce speed in the face of congestion thereby penalizing itself. In this group are the window based congestion control algorithms that use the size of congestion window to determine transmission speed. The two main algorithm of window based congestion control are the congestion avoidance and the slow start. The aim of this study is to survey the various modifications of window based congestion control. Much work has been done on congestion avoidance hence specific attention is placed on the slow start in order to motivate a new direction of research in network utility maximization. Mathematical modeling of the internet is discussed and proposals to improve TCP startup were reviewed. There are three lines of research on the improvement of slow start. A group uses the estimation of certain parameters to determine initial speed. The second group uses bandwidth estimation while the last group uses explicit request for network assistance to determine initial startup speed. The problems of each proposal are analyzed and a multiple startup for TCP is proposed. Multiple startups for TCP specify that startup speed is selectable from an n-arry set of algorithms. We then introduced the e-speed start which uses the prevailing network condition to determine a suitable starting speed.

关键词： Data Communication Network Protocols TCP Congestion Control Slow-Start (Keywords)

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：