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

Journal of Computer Science & Computational Mathematics最新文献

筛选
英文 中文
Frequency Analysis of Annual Maximum River Flow by Generalized Extreme Value Distribution with Bayesian MCMC 广义极值分布与贝叶斯MCMC的年最大河流量频率分析
Journal of Computer Science & Computational Mathematics Pub Date : 2018-12-31 DOI: 10.20967/JCSCM.2018.04.004
R. Y. Cheong, D. Gabda
{"title":"Frequency Analysis of Annual Maximum River Flow by Generalized Extreme Value Distribution with Bayesian MCMC","authors":"R. Y. Cheong, D. Gabda","doi":"10.20967/JCSCM.2018.04.004","DOIUrl":"https://doi.org/10.20967/JCSCM.2018.04.004","url":null,"abstract":"The aim of this paper is to fit 9 annual maximum river flows in Sabah for a period record of over 20-48 years into the generalized extreme value (GEV) distribution. Bayesian Markov Chain Monte Carlo is employed as the parameter estimation which is believed to provide a more robust inference through prior and posterior distribution. In this study, scale parameter is being associated with the linear trend function. Based on the 95% credible interval in this study, the results suggest that the additional covariate to the model has no impact at most of the river sites. Hence, return level with 10and 100year for each river sites have been obtained by using a simple model which is urged in substituting complex models such as logistic model.","PeriodicalId":374608,"journal":{"name":"Journal of Computer Science & Computational Mathematics","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128123162","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
Numerical Solutions of Poisson Image Blending Problem using 4-EDGSOR Iteration 泊松图像混合问题的4-EDGSOR迭代数值解
Journal of Computer Science & Computational Mathematics Pub Date : 2018-12-31 DOI: 10.20967/jcscm.2018.04.005
Hong Eng Jeng, A. Saudi, J. Sulaiman
{"title":"Numerical Solutions of Poisson Image Blending Problem using 4-EDGSOR Iteration","authors":"Hong Eng Jeng, A. Saudi, J. Sulaiman","doi":"10.20967/jcscm.2018.04.005","DOIUrl":"https://doi.org/10.20967/jcscm.2018.04.005","url":null,"abstract":"Poisson image blending is an operation in image processing to generate a new image by using Poisson partial differential equation. In this paper, 4-EDGSOR iteration is used to solve the Poisson image blending problem and its efficiency in solving the proposed problem is illustrated. The approximation Poisson equation is formed by applying a finite difference method. Then, the rotated Laplacian operator which is constructed by a rotated finite difference scheme is used in this paper. Then a linear system is formed and solved using the 4-EDGSOR iterative method. The performance of the 4-EDGSOR iterative method in solving the proposed problem is compared to the SOR and 4-EGSOR iterative methods. The results obtained from numerical solutions showed that the 4-EDGSOR iterative method required lesser time and number of iterations to blend an image. From quality point of view, all images obtained the same natural look.","PeriodicalId":374608,"journal":{"name":"Journal of Computer Science & Computational Mathematics","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127126819","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
Suppressing Order Reduction on 2-Stage Gauss Method 二阶高斯方法的抑制阶约降
Journal of Computer Science & Computational Mathematics Pub Date : 2018-12-31 DOI: 10.20967/jcscm.2018.04.003
Noorhelyna Razali, M. Jedi, N. Zulkarnain, S. H. M. Yasin
{"title":"Suppressing Order Reduction on 2-Stage Gauss Method","authors":"Noorhelyna Razali, M. Jedi, N. Zulkarnain, S. H. M. Yasin","doi":"10.20967/jcscm.2018.04.003","DOIUrl":"https://doi.org/10.20967/jcscm.2018.04.003","url":null,"abstract":"","PeriodicalId":374608,"journal":{"name":"Journal of Computer Science & Computational Mathematics","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131902540","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
Reliable Secret Key Generation For Counting-Based Secret Sharing 基于计数的秘密共享的可靠密钥生成
Journal of Computer Science & Computational Mathematics Pub Date : 2018-12-31 DOI: 10.20967/JCSCM.2018.04.006
Adel D. Al-qurashi, A. Gutub
{"title":"Reliable Secret Key Generation For Counting-Based Secret Sharing","authors":"Adel D. Al-qurashi, A. Gutub","doi":"10.20967/JCSCM.2018.04.006","DOIUrl":"https://doi.org/10.20967/JCSCM.2018.04.006","url":null,"abstract":"Secret sharing scheme is becoming famous for increasing the security to access sensitive information for applications and resources that have to be protected by more than one person. It divides the secret key into shares, distributed to participants such that only subsets of participants can reconstruct the secret key. This paper adopts counting-based secret sharing scheme as a promising secret sharing technique presented recently. This counting-based method works on constructing shares by changing one or two 0-bits within the secret key to one at different locations for producing needed shares. The combination of selected shares is counting the ones in parallel to recover the secret key. This paper proposed improving the reliability of this counting-based secret sharing scheme by increasing the size of the secret key to 64-bits as realistically needed by most applications. The work also improved the security of the secret key affecting its shares by adjusting the generation algorithm to involve applicable statistical randomness tests from NIST 800-22 standard where any unreliable secret key is regenerated again whenever needed. The proposal is implemented and compared with the original scheme via Java platform modeling showing interesting practical remarks providing remarkable contributions.","PeriodicalId":374608,"journal":{"name":"Journal of Computer Science & Computational Mathematics","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127003946","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}
引用次数: 31
Hyperbolic k-Fibonacci Quaternions 双曲k-斐波那契四元数
Journal of Computer Science & Computational Mathematics Pub Date : 2018-11-29 DOI: 10.20967/jcscm.2019.04.003
F. T. Aydın
{"title":"Hyperbolic k-Fibonacci Quaternions","authors":"F. T. Aydın","doi":"10.20967/jcscm.2019.04.003","DOIUrl":"https://doi.org/10.20967/jcscm.2019.04.003","url":null,"abstract":"In this paper, hyperbolic k-Fibonacci quaternions are defined. Also, some algebraic properties of hyperbolic k-Fibonacci quaternions which are connected with hyperbolic numbers and k-Fibonacci numbers are investigated. Furthermore, D'Ocagne's identity, the Honsberger identity, Binet's formula, Cassini's identity and Catalan's identity for these quaternions are given.","PeriodicalId":374608,"journal":{"name":"Journal of Computer Science & Computational Mathematics","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121411589","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
Customization of Software as a Service Application: Problems and Objectives 软件作为服务应用的定制:问题与目标
Journal of Computer Science & Computational Mathematics Pub Date : 2018-09-30 DOI: 10.20967/JCSCM.2018.03.001
A. Q. Ali, A. B. Sultan, A. Ghani, H. Zulzalil
{"title":"Customization of Software as a Service Application: Problems and Objectives","authors":"A. Q. Ali, A. B. Sultan, A. Ghani, H. Zulzalil","doi":"10.20967/JCSCM.2018.03.001","DOIUrl":"https://doi.org/10.20967/JCSCM.2018.03.001","url":null,"abstract":"The key feature of SaaS application is that it addresses the needs of many different customers using only one software, rather than multiple developments and versions, a concept known as multi-tenancy. However, it typically results in a one-size-fits-all approach and the application only fulfills the requirements that are generic to all tenants. Therefore, a multi-tenancy SaaS application is reliant upon an ability to be customized in order to be successful. Responding to distinctive needs of each customer and maintaining the key feature of developing SaaS application creates complexity in SaaS customization. This paper delves into some challenges related to SaaS customization, and then maps among these challenges in order to structure the problem and objective trees of SaaS customization. This paper may serve as a step towards reducing complexity in SaaS customization.","PeriodicalId":374608,"journal":{"name":"Journal of Computer Science & Computational Mathematics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128770196","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
The Five Ws Taxonomy on Customization of Software as a Service Applications 软件即服务应用程序定制的五个w分类
Journal of Computer Science & Computational Mathematics Pub Date : 2018-09-30 DOI: 10.20967/JCSCM.2018.03.003
A. Q. Ali, A. B. Sultan, A. Ghani, H. Zulzalil
{"title":"The Five Ws Taxonomy on Customization of Software as a Service Applications","authors":"A. Q. Ali, A. B. Sultan, A. Ghani, H. Zulzalil","doi":"10.20967/JCSCM.2018.03.003","DOIUrl":"https://doi.org/10.20967/JCSCM.2018.03.003","url":null,"abstract":"Software as a Service has become a common model for various business applications. Increasingly, software application development companies have followed this model in delivering their software to their customers. SaaS delivery model is a multi-tenant model which reduces operational cost by increasing the resource sharing of one instance of application among multi customers (commonly named tenants). In this model, SaaS provider is not allowed to provide a copy of application code for each tenant, yet they have to permit each tenant to fulfill their different and varying requirements by enabling them to customize the application. This paper explores SaaS customization and the processes which make up the overall procedure. Accordingly, the Five Ws (who, when, what, where, and why) method is used to capture the core elements of SaaS customization, as well as how customization plays a role for the various SaaS stakeholders to introduce a taxonomy of SaaS customization. This taxonomy could provide guidance on SaaS customization.","PeriodicalId":374608,"journal":{"name":"Journal of Computer Science & Computational Mathematics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125109514","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
(H^1)-Convergence of FEM-BDS for Linear Parabolic Interface Problems (H^1)线性抛物界面问题FEM-BDS的收敛性
Journal of Computer Science & Computational Mathematics Pub Date : 2018-09-30 DOI: 10.20967/jcscm.2018.03.004
Matthew O. Adewole
{"title":"(H^1)-Convergence of FEM-BDS for Linear Parabolic Interface Problems","authors":"Matthew O. Adewole","doi":"10.20967/jcscm.2018.03.004","DOIUrl":"https://doi.org/10.20967/jcscm.2018.03.004","url":null,"abstract":"","PeriodicalId":374608,"journal":{"name":"Journal of Computer Science & Computational Mathematics","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131175877","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
Compression Multi-Level Crypto Stego Security of Texts Utilizing Colored Email Forwarding 压缩多级加密Stego安全文本利用彩色电子邮件转发
Journal of Computer Science & Computational Mathematics Pub Date : 2018-09-30 DOI: 10.20967/JCSCM.2018.03.002
Abrar Alsaidi, Khulood Al-lehaibi, Huda A. Alzahrani, M. Al-Ghamdi, A. Gutub
{"title":"Compression Multi-Level Crypto Stego Security of Texts Utilizing Colored Email Forwarding","authors":"Abrar Alsaidi, Khulood Al-lehaibi, Huda A. Alzahrani, M. Al-Ghamdi, A. Gutub","doi":"10.20967/JCSCM.2018.03.002","DOIUrl":"https://doi.org/10.20967/JCSCM.2018.03.002","url":null,"abstract":"Encrypted messages will draw the attention of third parties, leading attempts to break the original messages and disclose it. Obscuring facts and communications can be achieved by concealing the message using a technique called steganography, which hides the presence of messages and secrets from the public. Several digital mediums, such as texts, images, audio and video, can be used as cover media for digital steganography, with text steganography being our focus in this research. Utilizing text as a target medium is complex due to the lack of available redundant data-bits within text file. Steganography can be used together with cryptography to offer higher level of privacy and security over the communication channel. This paper presents a multi-level security method that takes the sensitive text and compresses it through the LZW compression algorithm and then encrypts it using the Advanced Encryption Standard (AES) algorithm in order to be stego-hidden in forward email colored platform. Implementation results show that this proposed multi-level scheme is giving motivating security, highcapacity, and practical performance text crypto stego interesting technique showing attractive contribution.","PeriodicalId":374608,"journal":{"name":"Journal of Computer Science & Computational Mathematics","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116638457","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}
引用次数: 36
Dual Complex Pell Quaternions 对偶复佩尔四元数
Journal of Computer Science & Computational Mathematics Pub Date : 2018-09-25 DOI: 10.20967/JCSCM.2020.02.001
F. T. Aydın
{"title":"Dual Complex Pell Quaternions","authors":"F. T. Aydın","doi":"10.20967/JCSCM.2020.02.001","DOIUrl":"https://doi.org/10.20967/JCSCM.2020.02.001","url":null,"abstract":"In this paper, dual complex Pell numbers and quaternions are defined. Also, some algebraic properties of dual-complex Pell numbers and quaternions which are connected with dual complex numbers and Pell numbers are investigated. Furthermore, the Honsberger identity, Binet's formula, Cassini's identity, Catalan's identity for these quaternions are given.","PeriodicalId":374608,"journal":{"name":"Journal of Computer Science & Computational Mathematics","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126173397","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信