发布求助
文献互助 智能选刊 最新文献

Global journal of computer science and technology最新文献

筛选
英文 中文
Fabric Defect Detection using Image Processing 基于图像处理的织物缺陷检测
Global journal of computer science and technology Pub Date : 2022-05-21 DOI: 10.34257/gjcstgvol22is1pg1
Md. Rakibul Alam Khan, Halima Akhter
{"title":"Fabric Defect Detection using Image Processing","authors":"Md. Rakibul Alam Khan, Halima Akhter","doi":"10.34257/gjcstgvol22is1pg1","DOIUrl":"https://doi.org/10.34257/gjcstgvol22is1pg1","url":null,"abstract":"Fabric defect is one of the most important and serious matters of quality control in textile industry in Bangladesh. This task takes a lot of time and money. For this reason we have introduced a simple process to find defects on fabric based on edge detection. This process is mainly focused on image processing which can be integrated with fabric defect detection automation system. In this paper we have tried a new approach using the filter method with edge detection and found good results. Our algorithm can detect defected fabric area successfully. It can be also used in real-time defect detection considering light intensity, zoom, fabric width, camera resolution etc. As our algorithm mainly works on the principle of edge detection, it cannot detect defect on multicoloured or patterned fabric. It works well on single coloured fabric without any fold or edge.","PeriodicalId":340110,"journal":{"name":"Global journal of computer science and technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121021707","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
Website Text Translation and Image Translation from a URL using Optical Character Recognition (OCR) 使用光学字符识别(OCR)从URL进行网站文本翻译和图像翻译
Global journal of computer science and technology Pub Date : 2022-03-12 DOI: 10.34257/gjcstevol22is1pg9
Anam Islam, Eshita Agnes Purification, Fahima Akter Anni, Kishor K. Baroi
{"title":"Website Text Translation and Image Translation from a URL using Optical Character Recognition (OCR)","authors":"Anam Islam, Eshita Agnes Purification, Fahima Akter Anni, Kishor K. Baroi","doi":"10.34257/gjcstevol22is1pg9","DOIUrl":"https://doi.org/10.34257/gjcstevol22is1pg9","url":null,"abstract":"Now-a-days we are almost completely dependent on information system for our day-to-day work. Almost every organization of different sectors has their own website. These websites are visited not only by the native people but also by the foreigners. But sometimes they are unable to do so because of language barrier. At present, many translating tools are available but they are either for translating text of a website or translating text from an image. At some cases people have to copy the text and then translate it separately which is a lot of hassle and time consuming. We aim to implement a website translator which will take the URL of any website and translate it in any language. It can also translate the text of the images of that website. We have also created some more new algorithms for URL translation, English to Bangla number translation and English to Arabic number translation.","PeriodicalId":340110,"journal":{"name":"Global journal of computer science and technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122522624","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
Sentiment Polarity Identification of Social Media content using Artificial Neural Networks 基于人工神经网络的社交媒体内容情感极性识别
Global journal of computer science and technology Pub Date : 2022-01-22 DOI: 10.34257/gjcstdvol22is1pg1
K. Rajan, Brittney Jackson
{"title":"Sentiment Polarity Identification of Social Media content using Artificial Neural Networks","authors":"K. Rajan, Brittney Jackson","doi":"10.34257/gjcstdvol22is1pg1","DOIUrl":"https://doi.org/10.34257/gjcstdvol22is1pg1","url":null,"abstract":"Sentiment of people about consumer goods and government policies for decision making is normally collected through feedback forms, surveys etc. The social network sites and micro blogging sites are considered a very good source of information nowadays because people share and discuss their opinions about a certain topic freely. With the increased use of technology and social media, people proactively express their opinion through social media sites like Twitter, Facebook, Instagram etc. A social media sentiment analysis can help companies to understand how people feel about their products. On the other hand, extracting the sentiment from social media text is a challenging task due to the complexity of natural language processing of social media language. Often these messages reflect the emotion, opinion and sentiment of the public through a mix of text, image, emoticons etc. These statements are often called electronic Word of Mouth (eWOM) and are much prevalent in business and service industry to enable customers to share their point of view.","PeriodicalId":340110,"journal":{"name":"Global journal of computer science and technology","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127043340","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
Vehicle Routing Problem with Time Window Constrain using KMeans Clustering to Obtain the Closest Customer 基于KMeans聚类的时间窗约束车辆路径问题
Global journal of computer science and technology Pub Date : 2022-01-22 DOI: 10.34257/gjcstdvol22is1pg49
Jai Keerthy Chowlur Revanna, Nushwan Yousif B.Al-Nakash
{"title":"Vehicle Routing Problem with Time Window Constrain using KMeans Clustering to Obtain the Closest Customer","authors":"Jai Keerthy Chowlur Revanna, Nushwan Yousif B.Al-Nakash","doi":"10.34257/gjcstdvol22is1pg49","DOIUrl":"https://doi.org/10.34257/gjcstdvol22is1pg49","url":null,"abstract":"In this paper, the problem statement is solving the Vehicle Routing Problem with Time Window constraint using the Ant Colony Algorithm with K-Means Clustering. In this problem, the vehicles must start at a common depot, pickup from various warehouses, deliver to the respective nodes within the time window defined by the customer and return back to the depot.The objectives defined are to reduce number of vehicles employed, the total logistics cost and to reduce carbon emissions. The mathematical model described in this paper has considered multiple pickup and multiple delivery points. The proposed solution of this paper aims to provide better and more efficient solution while minimizing areas of conflict so as to provide the best output on a large scale.","PeriodicalId":340110,"journal":{"name":"Global journal of computer science and technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130714254","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}
引用次数: 8
Efficient Network Traffic Classification and Visualizing Abnormal Part Via Hybrid Deep Learning Approach : Xception + Bidirectional GRU 基于混合深度学习方法的高效网络流量分类与异常部分可视化:异常+双向GRU
Global journal of computer science and technology Pub Date : 2022-01-15 DOI: 10.34257/gjcsthvol21is3pg1
H. Joo, Hayoung Choi, ChangHui Yun, Minjong Cheon
{"title":"Efficient Network Traffic Classification and Visualizing Abnormal Part Via Hybrid Deep Learning Approach : Xception + Bidirectional GRU","authors":"H. Joo, Hayoung Choi, ChangHui Yun, Minjong Cheon","doi":"10.34257/gjcsthvol21is3pg1","DOIUrl":"https://doi.org/10.34257/gjcsthvol21is3pg1","url":null,"abstract":"Due to a rapid development in the field of information and communication, the information technologies yielded novel changes in both individual and organizational operations. Therefore, the accessibility of information became easier and more convenient than before, and malicious approaches such as hacking or spying aimed at various information kept increasing. With the aim of preventing malicious approaches, both classification and detecting malicious traffic are vital. Therefore, our research utilized various deep learning and machine learning models for better classification. The given dataset consists of normal and malicious data and these data types are png files. In order to achieve precise classification, our experiment consists of three steps. Firstly, only vanilla CNN was used for the classification and the highest score was 86.2%. Second of all, for the hybrid approach, the machine learning classifiers were used instead of fully connected layers from the vanilla CNN and it yielded about 87% with the extra tree classifier.At last, the Xception model was combined with the bidirectional GRU and it attained a 95.6% accuracy score, which was the highest among all.","PeriodicalId":340110,"journal":{"name":"Global journal of computer science and technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116678819","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
P vs NP: P is Equal to NP: Desired Proof P vs NP: P等于NP:期望证明
Global journal of computer science and technology Pub Date : 2021-09-12 DOI: 10.34257/gjcstgvol21is3pg1
Zulfia A. Chotchaeva
{"title":"P vs NP: P is Equal to NP: Desired Proof","authors":"Zulfia A. Chotchaeva","doi":"10.34257/gjcstgvol21is3pg1","DOIUrl":"https://doi.org/10.34257/gjcstgvol21is3pg1","url":null,"abstract":"Computations and computational complexity are fundamental for mathematics and all computer science, including web load time, cryptography (cryptocurrency mining), cybersecurity, artificial intelligence, game theory, multimedia processing, computational physics, biology (for instance, in protein structure prediction), chemistry, and the P vs. NP problem that has been singled out as one of the most challenging open problems in computer science and has great importance as this would essentially solve all the algorithmic problems that we have today if the problem is solved, but the existing complexity is deprecated and does not solve complex computations of tasks that appear in the new digital age as efficiently as it needs. Therefore, we need to realize a new complexity to solve these tasks more rapidly and easily. This paper presents proof of the equality of P and NP complexity classes when the NP problem is not harder to compute than to verify in polynomial time if we forget recursion that takes exponential running time and goes to regress only (every problem in NP can be solved in exponential time, and so it is recursive, this is a key concept that exists, but recursion does not solve the NP problems efficiently). The paper’s goal is to prove the existence of an algorithm solving the NP task in polynomial running time. We get the desired reduction of the exponential problem to the polynomial problem that takes O(log n) complexity.","PeriodicalId":340110,"journal":{"name":"Global journal of computer science and technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128221170","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
Statistical Literacy among Practicing Clinicians from India: A Brief Survey 印度执业临床医生的统计素养:一项简短调查
Global journal of computer science and technology Pub Date : 2021-09-12 DOI: 10.34257/gjcstgvol21is3pg13
Ankush Jindal, Dr. Manish Bansal, Dr. Anupam Jindal
{"title":"Statistical Literacy among Practicing Clinicians from India: A Brief Survey","authors":"Ankush Jindal, Dr. Manish Bansal, Dr. Anupam Jindal","doi":"10.34257/gjcstgvol21is3pg13","DOIUrl":"https://doi.org/10.34257/gjcstgvol21is3pg13","url":null,"abstract":"Objectives: To understand statistical literacy among practicing clinicians as well as to take suggestions on its implementation in medical curriculum.\u0000Methods: A web based online survey was conducted among practising clinicians of India. The questionnaire consisted of 30questions in three parts. Part A included questions on general information (5 questions), Part B included questions on application of statistical concepts (20 questions), and Part Casked for opinions on integration of biostatistics in medical curriculum (5 questions). Part B questions were rated on a 5-point Likert scale in which 1 indicated no confidence and 5indicated complete confidence.\u0000Results: A total of 416 clinicians responded to the questionnaire. Complete confidence in the use of SPSS software was seen in 15.8% whereas 26.7% had no confidence in it. The highest confidence was seen in statistical equations like graphical representation of data (44.7%), and sensitivity and specificity (45.2%) whereas lowest confidence was seen in COX proportional hazard regression (12.9%) and ROC curves (11.7%). Out of 416 clinicians, 136 (32.4%) had done training in statistics at undergraduate level, 128 (30.5%) did self-learning and 152 (37.1%) had received no formal training.","PeriodicalId":340110,"journal":{"name":"Global journal of computer science and technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117283423","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
A Framework to Model Site Reliability Engineering Implementations and its Consolidation 站点可靠性工程实施的模型框架及其整合
Global journal of computer science and technology Pub Date : 2021-05-19 DOI: 10.34257/gjcstgvol21is1pg23
Anand Sunder
{"title":"A Framework to Model Site Reliability Engineering Implementations and its Consolidation","authors":"Anand Sunder","doi":"10.34257/gjcstgvol21is1pg23","DOIUrl":"https://doi.org/10.34257/gjcstgvol21is1pg23","url":null,"abstract":"Site Reliability Engineering has opened a pandora’s box of new technological challenges [1],[3],[6],[10]. Trying to condense all of it into one structure or system is one such requirement. We show the interaction between people, processes, and technology as against the levels of maturity on reliability scale of 5.","PeriodicalId":340110,"journal":{"name":"Global journal of computer science and technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130395198","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
Exam Management System at Notre Dame University Bangladesh 孟加拉国圣母大学考试管理系统
Global journal of computer science and technology Pub Date : 2021-05-19 DOI: 10.34257/gjcstgvol21is1pg15
A. Islam, Md. Harun Aur Rashid Khan Ishan, Nilima Ahmed, Manabendra Kishore Chakraborty
{"title":"Exam Management System at Notre Dame University Bangladesh","authors":"A. Islam, Md. Harun Aur Rashid Khan Ishan, Nilima Ahmed, Manabendra Kishore Chakraborty","doi":"10.34257/gjcstgvol21is1pg15","DOIUrl":"https://doi.org/10.34257/gjcstgvol21is1pg15","url":null,"abstract":"Exam Management System (EMS) at Notre Dame University Bangladesh (NDUB) is an effective system for man- aging exam and course-related activities for NDUB. EMS auto- mates the conventional system of managing exams. EMS helps NDUB faculties, students, and other academic officers to manage the exam processing very easily and effectively and EMS can maintain mobility of these activities better than conventional manual systems. The main intentions of EMS are to conduct the exam and course-related activities very easily and rapidly. Comprehensively EMS has many interesting features altogether situated in a fair intended web application. EMS is designed using recent technologies like ‘Laravel 7.0’, ‘Bootstrap’, ‘JavaScript’, ‘jQuery’, ‘MySQL’. EMS’s working speed is very rapid and its database can take a massive user load at a time. EMS can be very useful for the exam and course-related operations of Notre Dame University Bangladesh.","PeriodicalId":340110,"journal":{"name":"Global journal of computer science and technology","volume":"360 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129819772","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
A Dynamic Level Technical Indicator Model for Oil Price Forecasting 石油价格预测的动态水平技术指标模型
Global journal of computer science and technology Pub Date : 2021-05-19 DOI: 10.34257/gjcstgvol21is1pg5
D. Oyemade, David Enebeli
{"title":"A Dynamic Level Technical Indicator Model for Oil Price Forecasting","authors":"D. Oyemade, David Enebeli","doi":"10.34257/gjcstgvol21is1pg5","DOIUrl":"https://doi.org/10.34257/gjcstgvol21is1pg5","url":null,"abstract":"Investment in commodities and stock requires a nearly accurate prediction of price to make profit and to prevent losses. Technical indicators are usually employed on the software platforms for commodities and stock for such price prediction and forecasting. However, many of the available and popular technical indicators have proved unprofitable and disappointing to investors, often resulting not only in ordinary losses but in total loss of investment capital. We propose a dynamic level technical indicator model for the forecasting of commodities’ prices. The proposed model creates dynamic price supports and resistances levels in different time frames of the price chart using a novel algorithm and employs them for price forecasting. In this study, the proposed model was applied to predict the prices of the United Kingdom (UK) Oil. It was compared with the combination of two popular and widely accepted technical indicators, the Moving Average Convergence and Divergence (MACD) and Stochastic Oscillator. The results showed that the proposed dynamic level technical indicator model outperformed MACD and Stochastic Oscillator in terms of profit.","PeriodicalId":340110,"journal":{"name":"Global journal of computer science and technology","volume":"380 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134454452","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学术官方微信