期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Preventing Cloud Network from Spamming Attacks Using Cloudflare and KNN
1
作者 Muhammad Nadeem Ali Arshad +4 位作者 Saman Riaz SyedaWajiha Zahra Muhammad Rashid Shahab S.Band Amir Mosavi 《Computers, Materials & Continua》 SCIE EI 2023年第2期2641-2659,共19页
Cloud computing is one of the most attractive and cost-saving models,which provides online services to end-users.Cloud computing allows the user to access data directly from any node.But nowadays,cloud security is one... Cloud computing is one of the most attractive and cost-saving models,which provides online services to end-users.Cloud computing allows the user to access data directly from any node.But nowadays,cloud security is one of the biggest issues that arise.Different types of malware are wreaking havoc on the clouds.Attacks on the cloud server are happening from both internal and external sides.This paper has developed a tool to prevent the cloud server from spamming attacks.When an attacker attempts to use different spamming techniques on a cloud server,the attacker will be intercepted through two effective techniques:Cloudflare and K-nearest neighbors(KNN)classification.Cloudflare will block those IP addresses that the attacker will use and prevent spamming attacks.However,the KNN classifiers will determine which area the spammer belongs to.At the end of the article,various prevention techniques for securing cloud servers will be discussed,a comparison will be made with different papers,a conclusion will be drawn based on different results. 展开更多
关键词 Intrusion prevention system SPAMMING knn classification SPAM cyber security BOTNET
下载PDF
MICkNN:Multi-Instance Covering kNN Algorithm 被引量:6
2
作者 Shu Zhao Chen Rui Yanping Zhang 《Tsinghua Science and Technology》 SCIE EI CAS 2013年第4期360-368,共9页
Mining from ambiguous data is very important in data mining. This paper discusses one of the tasks for mining from ambiguous data known as multi-instance problem. In multi-instance problem, each pattern is a labeled b... Mining from ambiguous data is very important in data mining. This paper discusses one of the tasks for mining from ambiguous data known as multi-instance problem. In multi-instance problem, each pattern is a labeled bag that consists of a number of unlabeled instances. A bag is negative if all instances in it are negative. A bag is positive if it has at least one positive instance. Because the instances in the positive bag are not labeled, each positive bag is an ambiguous. The mining aim is to classify unseen bags. The main idea of existing multi-instance algorithms is to find true positive instances in positive bags and convert the multi-instance problem to the supervised problem, and get the labels of test bags according to predict the labels of unknown instances. In this paper, we aim at mining the multi-instance data from another point of view, i.e., excluding the false positive instances in positive bags and predicting the label of an entire unknown bag. We propose an algorithm called Multi-Instance Covering kNN (MICkNN) for mining from multi-instance data. Briefly, constructive covering algorithm is utilized to restructure the structure of the original multi-instance data at first. Then, the kNN algorithm is applied to discriminate the false positive instances. In the test stage, we label the tested bag directly according to the similarity between the unseen bag and sphere neighbors obtained from last two steps. Experimental results demonstrate the proposed algorithm is competitive with most of the state-of-the-art multi-instance methods both in classification accuracy and running time. 展开更多
关键词 mining ambiguous data multi-instance classification constructive covering algorithm knn algorithm
原文传递
Structural form-finding of bending components in buildings by using parametric tools and principal stress lines
3
作者 Zhenya Yu Hang Dai Ziying Shi 《Frontiers of Architectural Research》 CSCD 2022年第3期561-573,共13页
This paper aims to provide an efficient and straightforward structural form-finding method for designers to extrapolate component forms during the conceptual stage.The core idea is to optimize the classical method of ... This paper aims to provide an efficient and straightforward structural form-finding method for designers to extrapolate component forms during the conceptual stage.The core idea is to optimize the classical method of structural form-finding based on principal stress lines by using parametric tools.The traditional operating process of this method relies excessively on the designer’s engineering experience and lacks precision.Meanwhile,the current optimization work for this method is overly complicated for architects,and limitations in component type and final result exist.Therefore,to facilitate an architect’s conceptual work,the optimization metrics of the method in this paper are set as simplicity,practicality,freedom,and rapid feedback.For that reason,this paper optimizes the method from three aspects:modeling strategy for continuum structures,classification processing of data by using the k-nearest neighbor algorithm,and topological form-finding process based on stress lines.Eventually,it allows architects to create structural texture with formal aesthetics and modify it in real time on the basis of structural analysis results.This paper also explores a comprehensive application strategy with internal force analysis diagramming to form-finding.The finite element analysis tool Karamba3D verifies the structural performance of the form-finding method.The performance is compared with that of the conventional form,and the comparison results show the practicality and potential of the strategy in this paper. 展开更多
关键词 Parametric design Structural formfinding Principal stress lines classification algorithm knn Internal force analysis Bending components
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部