Open Computer Science最新文献

筛选
英文 中文
Convolutional neural-network-based classification of retinal images with different combinations of filtering techniques 基于卷积神经网络的视网膜图像分类与不同滤波技术的组合
IF 1.5
Open Computer Science Pub Date : 2021-01-01 DOI: 10.1515/comp-2020-0177
Asha Gnana Priya Henry, Anitha Jude
{"title":"Convolutional neural-network-based classification of retinal images with different combinations of filtering techniques","authors":"Asha Gnana Priya Henry, Anitha Jude","doi":"10.1515/comp-2020-0177","DOIUrl":"https://doi.org/10.1515/comp-2020-0177","url":null,"abstract":"Abstract Retinal image analysis is one of the important diagnosis methods in modern ophthalmology because eye information is present in the retina. The image acquisition process may have some effects and can affect the quality of the image. This can be improved by better image enhancement techniques combined with the computer-aided diagnosis system. Deep learning is one of the important computational application techniques used for a medical imaging application. The main aim of this article is to find the best enhancement techniques for the identification of diabetic retinopathy (DR) and are tested with the commonly used deep learning techniques, and the performances are measured. In this article, the input image is taken from the Indian-based database named as Indian Diabetic Retinopathy Image Dataset, and 13 filters are used including smoothing and sharpening filters for enhancing the images. Then, the quality of the enhancement techniques is compared using performance metrics and better results are obtained for Median, Gaussian, Bilateral, Wiener, and partial differential equation filters and are combined for improving the enhancement of images. The output images from all the enhanced filters are given as the convolutional neural network input and the results are compared to find the better enhancement method.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49158105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Towards the Modelling of Veillance based Citizen Profiling using Knowledge Graphs 利用知识图谱建立基于监控的公民侧写模型
IF 1.5
Open Computer Science Pub Date : 2021-01-01 DOI: 10.1515/comp-2020-0209
Siraj Munir, S. I. Jami, Shaukat Wasi
{"title":"Towards the Modelling of Veillance based Citizen Profiling using Knowledge Graphs","authors":"Siraj Munir, S. I. Jami, Shaukat Wasi","doi":"10.1515/comp-2020-0209","DOIUrl":"https://doi.org/10.1515/comp-2020-0209","url":null,"abstract":"Abstract In this work we have proposed a model for Citizen Profiling. It uses veillance (Surveillance and Sousveillance) for data acquisition. For representation of Citizen Profile Temporal Knowledge Graph has been used through which we can answer semantic queries. Previously, most of the work lacks representation of Citizen Profile and have used surveillance for data acquisition. Our contribution is towards enriching the data acquisition process by adding sousveillance mechanism and facilitating semantic queries through representation of Citizen Profiles using Temporal Knowledge Graphs. Our proposed solution is storage efficient as we have only stored data logs for Citizen Profiling instead of storing images, audio, and video for profiling purposes. Our proposed system can be extended to Smart City, Smart Traffic Management, Workplace profiling etc. Agent based mechanism can be used for data acquisition where each Citizen has its own agent. Another improvement can be to incorporate a decentralized version of database for maintaining Citizen profile.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0209","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48893442","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Optimization of a k-covering of a bounded set with circles of two given radii 具有两个给定半径的圆的有界集合的k覆盖优化
IF 1.5
Open Computer Science Pub Date : 2021-01-01 DOI: 10.1515/comp-2020-0219
A. Khorkov, Sh. I. Galiev
{"title":"Optimization of a k-covering of a bounded set with circles of two given radii","authors":"A. Khorkov, Sh. I. Galiev","doi":"10.1515/comp-2020-0219","DOIUrl":"https://doi.org/10.1515/comp-2020-0219","url":null,"abstract":"Abstract A numerical method for investigating k-coverings of a convex bounded set with circles of two given radii is proposed. Cases with constraints on the distances between the covering circle centers are considered. An algorithm for finding an approximate number of such circles and the arrangement of their centers is described. For certain specific cases, approximate lower bounds of the density of the k-covering of the given domain are found. We use either 0–1 linear programming or general integer linear programming models. Numerical results demonstrating the effectiveness of the proposed methods are presented.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0219","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49013215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Classification of plant diseases using machine and deep learning 利用机器和深度学习对植物病害进行分类
IF 1.5
Open Computer Science Pub Date : 2021-01-01 DOI: 10.1515/comp-2020-0122
Monika Lamba, Yogita Gigras, A. Dhull
{"title":"Classification of plant diseases using machine and deep learning","authors":"Monika Lamba, Yogita Gigras, A. Dhull","doi":"10.1515/comp-2020-0122","DOIUrl":"https://doi.org/10.1515/comp-2020-0122","url":null,"abstract":"Abstract Detection of plant disease has a crucial role in better understanding the economy of India in terms of agricultural productivity. Early recognition and categorization of diseases in plants are very crucial as it can adversely affect the growth and development of species. Numerous machine learning methods like SVM (support vector machine), random forest, KNN (k-nearest neighbor), Naïve Bayes, decision tree, etc., have been exploited for recognition, discovery, and categorization of plant diseases; however, the advancement of machine learning by DL (deep learning) is supposed to possess tremendous potential in enhancing the accuracy. This paper proposed a model comprising of Auto-Color Correlogram as image filter and DL as classifiers with different activation functions for plant disease. This proposed model is implemented on four different datasets to solve binary and multiclass subcategories of plant diseases. Using the proposed model, results achieved are better, obtaining 99.4% accuracy and 99.9% sensitivity for binary class and 99.2% accuracy for multiclass. It is proven that the proposed model outperforms other approaches, namely LibSVM, SMO (sequential minimal optimization), and DL with activation function softmax and softsign in terms of F-measure, recall, MCC (Matthews correlation coefficient), specificity and sensitivity.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46667810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
A Design of an Integrated Cloud-based Intrusion Detection System with Third Party Cloud Service 基于云的第三方云服务集成入侵检测系统设计
IF 1.5
Open Computer Science Pub Date : 2021-01-01 DOI: 10.1515/comp-2020-0214
Wisam Elmasry, A. Akbulut, A. Zaim
{"title":"A Design of an Integrated Cloud-based Intrusion Detection System with Third Party Cloud Service","authors":"Wisam Elmasry, A. Akbulut, A. Zaim","doi":"10.1515/comp-2020-0214","DOIUrl":"https://doi.org/10.1515/comp-2020-0214","url":null,"abstract":"Abstract Although cloud computing is considered the most widespread technology nowadays, it still suffers from many challenges, especially related to its security. Due to the open and distributed nature of the cloud environment, this makes the cloud itself vulnerable to various attacks. In this paper, the design of a novel integrated Cloud-based Intrusion Detection System (CIDS) is proposed to immunise the cloud against any possible attacks. The proposed CIDS consists of five main modules to do the following actions: monitoring the network, capturing the traffic flows, extracting features, analyzing the flows, detecting intrusions, taking a reaction, and logging all activities. Furthermore an enhanced bagging ensemble system of three deep learning models is utilized to predict intrusions effectively. Moreover, a third-party Cloud-based Intrusion Detection System Service (CIDSS) is also exploited to control the proposed CIDS and provide the reporting service. Finally, it has been shown that the proposed approach overcomes all problems associated with attacks on the cloud raised in the literature.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0214","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44829962","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
QoS Based Optimal Resource Allocation and Workload Balancing for Fog Enabled IoT 基于QoS的雾赋能物联网优化资源分配和工作负载平衡
IF 1.5
Open Computer Science Pub Date : 2021-01-01 DOI: 10.1515/comp-2020-0162
A. Khalid, Q. Ain, Awais Qasim, Zeeshan Aziz
{"title":"QoS Based Optimal Resource Allocation and Workload Balancing for Fog Enabled IoT","authors":"A. Khalid, Q. Ain, Awais Qasim, Zeeshan Aziz","doi":"10.1515/comp-2020-0162","DOIUrl":"https://doi.org/10.1515/comp-2020-0162","url":null,"abstract":"Abstract This paper is aimed at efficiently distributing workload between the Fog Layer and the Cloud Network and then optimizing resource allocation in cloud networks to ensure better utilization and quick response time of the resources available to the end user. We have employed a Dead-line aware scheme to migrate the data between cloud and Fog networks based on data profiling and then used K-Means clustering and Service-request prediction model to allocate the resources efficiently to all requests. To substantiate our model, we have used iFogSim, which is an extension of the CloudSim simulator. The results clearly show that when an optimized network is used the Quality of Service parameters exhibit better efficiency and output.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0162","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45257421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Improving Data Delivery in Large Environments and Mobile Areas 改善大环境和移动区域的数据传输
IF 1.5
Open Computer Science Pub Date : 2021-01-01 DOI: 10.1515/comp-2020-0211
Nada I. Najim
{"title":"Improving Data Delivery in Large Environments and Mobile Areas","authors":"Nada I. Najim","doi":"10.1515/comp-2020-0211","DOIUrl":"https://doi.org/10.1515/comp-2020-0211","url":null,"abstract":"Abstract Advances in communication technology have significantly altered our knowledge about telephone networks. The remarkable expansion in communication is obvious in numerous aspects of life of life; the transmission of information has never been easier. Wireless communication has also had a remarkable development, and these facilities have become more reliable and easily accessible. This study, through a descriptive approach in accordance with earlier studies, aims to explain how to increase the capacity of wireless data delivery in addition to other important challenges that face the enhancement of these services in remote areas. This study highlights the challenges that accompany the adoption of wireless networks in remote areas: particularly signal strength. This is highly linked to the specific features of rural areas in terms of living habits in separated nodes rather than in high-density population centers areas.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0211","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48456937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhanced shuffled frog leaping algorithm with improved local exploration and energy-biased load reduction phase for load balancing of gateways in WSNs 用于无线传感器网络中网关负载平衡的改进的混洗蛙跳算法,具有改进的局部探索和能量偏置负载降低阶段
IF 1.5
Open Computer Science Pub Date : 2021-01-01 DOI: 10.1515/comp-2020-0218
A. Adamuthe, A. Pathan
{"title":"Enhanced shuffled frog leaping algorithm with improved local exploration and energy-biased load reduction phase for load balancing of gateways in WSNs","authors":"A. Adamuthe, A. Pathan","doi":"10.1515/comp-2020-0218","DOIUrl":"https://doi.org/10.1515/comp-2020-0218","url":null,"abstract":"Abstract Wireless sensor networks (WSNs) have grown widely due to their application in various domains, such as surveillance, healthcare, telecommunication, etc. In WSNs, there is a necessity to design energy-efficient algorithms for different purposes. Load balancing of gateways in cluster-based WSNs is necessary to maximize the lifetime of a network. Shuffled frog leaping algorithm (SFLA) is a popular heuristic algorithm that incorporates a deterministic approach. Performance of any heuristic algorithm depends on its exploration and exploitation capability. The main contribution of this article is an enhanced SFLA with improved local search capability. Three strategies are tested to enhance the local search capability of SFLA to improve the load balancing of gateways in WSNs. The first proposed approach is deterministic in which the participation of the global best solution in information exchange is increased. The next two variations reduces the deterministic approach in the local search component of SFLA by introducing probability-based selection of frogs for information exchange. All three strategies improved the success of local search. Second contribution of article is increased lifetime of gateways in WSNs with a novel energy-biased load reduction phase introduced after the information exchange step. The proposed algorithm is tested with 15 datasets of varying areas of deployment, number of sensors and number of gateways. Proposed ESFLA-RW variation shows significant improvement over other variations in terms of successful local explorations, best fitness values, average fitness values and convergence rate for all datasets. Obtained results of proposed ESFLA-RW are significantly better in terms of network energy consumption, load balancing, first gateway die and network life. The proposed variations are tested to check the effect of various algorithm-specific parameters namely frog population size, probability of information exchange and probability of energy-biased load reduction phase. Higher population size and probabilities give better solutions and convergence rate.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43796864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Angular 3D Path Selection Protocol in Wireless Sensor Networks 无线传感器网络中的角度三维路径选择协议
IF 1.5
Open Computer Science Pub Date : 2021-01-01 DOI: 10.1515/comp-2020-0203
N. Gupta, R. S. Yadav, R. Nagaria, D. Gupta
{"title":"An Angular 3D Path Selection Protocol in Wireless Sensor Networks","authors":"N. Gupta, R. S. Yadav, R. Nagaria, D. Gupta","doi":"10.1515/comp-2020-0203","DOIUrl":"https://doi.org/10.1515/comp-2020-0203","url":null,"abstract":"Abstract Geographical routing is an area of interest for wireless sensor networks because of its scalability and local decision making capability. Usually, geographical routing protocols rely on greedy approach and suffer from the void node problem (VNP). This paper presents an angular three-dimensional routing protocol (A3DR) for wireless sensor networks. In A3DR, the next hop is selected from nodes available in solid angle decided dynamically based on network density, i.e., larger solid angle for sparse networks while a smaller angle for dense one. The delay based contention mechanism has been proposed to select a suitable forwarding node among nodes lying in a particular solid angle. A3DR has a provision to adaptively tune the solid angle to resolve the void node problem. Further, the proposed protocol A3DR will take care of traffic congestion problem suffered by beaconless routing protocol. The A3DR tackle the concave void problem by allowing conditional backtracking to find another suitable path and prevent looping. Additionally, A3DR address overhear problem by utilizing the concept of request-to-forward and clear-to-forward for the nodes lying outside the solid angle 60°. The performance of proposed A3DR is compared with existing protocols by implementing it on the INET framework under OMNET++ simulator. The simulation results indicate that A3DR achieves a high packet reception rate while maximizing the residual energy and minimizing traffic overhead.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0203","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49379876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
On the 100 Gbps DWDM with Optical Carrier Suppression Modulation 具有光载波抑制调制的100Gbps DWDM
IF 1.5
Open Computer Science Pub Date : 2021-01-01 DOI: 10.1515/comp-2020-0104
Tomás Huszaník, J. Turán, Ľ. Ovseník
{"title":"On the 100 Gbps DWDM with Optical Carrier Suppression Modulation","authors":"Tomás Huszaník, J. Turán, Ľ. Ovseník","doi":"10.1515/comp-2020-0104","DOIUrl":"https://doi.org/10.1515/comp-2020-0104","url":null,"abstract":"Abstract This paper investigates the transmission performance of 16-channel DWDM (Dense Wavelength Division Multiplexing) system with two complex Optical Differential Quadrature Phase Shift Keying modulator configurations using 2 LiNb MZM (Mach-Zehnder Modulator) and 3 LiNb MZM. The link performance is evaluated for 100 Gbps data rate per channel in a total 750 km single mode fiber link. The perfomance is analyzed in terms of forward power, reflected power and bit-error rate of the received signal. From the simulation results we prove, that the link performance can be improved by adopting the high efficiency optical modulation.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0104","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42232211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信