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

Int. J. Comput. Sci. Math.最新文献

筛选
英文 中文
Respondents view of novel framework for data protection in social networking sites: an analysis 受访者对社交网站数据保护新框架的看法:一项分析
Int. J. Comput. Sci. Math. Pub Date : 2019-02-05 DOI: 10.1504/IJCSM.2019.097641
Shilpi Sharma
{"title":"Respondents view of novel framework for data protection in social networking sites: an analysis","authors":"Shilpi Sharma","doi":"10.1504/IJCSM.2019.097641","DOIUrl":"https://doi.org/10.1504/IJCSM.2019.097641","url":null,"abstract":"The era of social networking technologies has been met with mixed reactions by every user around the world. This study explored the novel framework for the data protection at the user's level in social networking site. The study followed a descriptive research design wherein a questionnaire was used as the main research tool. The data collected was analysed using SPSS 19. The data was gathered from the 300 users and analysed in accordance with the objectives of the study. As we know that the concerns rose about the disclosure of personal information on social network sites, users continue to disclose huge quantity of personal information. They find that the reading privacy policy is time consuming and changes made can result into improper settings. The analysis of the results concludes that the novel framework satisfies the requirements and the needs to secure user data in a platform, i.e., social media. The members of website have appreciated the implementation that lay towards graphical authentication, watermarking feature, encryption technique, approval of friendship request prior to approval and consent of service provider while processing or sharing information for the data protection in social networking sites.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116581156","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
T*: a weighted double-heuristic search algorithm to find the shortest path T*:寻找最短路径的加权双启发式搜索算法
Int. J. Comput. Sci. Math. Pub Date : 2019-02-05 DOI: 10.1504/IJCSM.2019.097636
Mohammad Samadi Gharajeh
{"title":"T*: a weighted double-heuristic search algorithm to find the shortest path","authors":"Mohammad Samadi Gharajeh","doi":"10.1504/IJCSM.2019.097636","DOIUrl":"https://doi.org/10.1504/IJCSM.2019.097636","url":null,"abstract":"This paper proposes a weighted double-heuristic search algorithm to find the shortest path between two points. It can be used in numerous fields such as graph theory, game theory, and network. This algorithm, called T*, uses a weighted and heuristic function as f(x) = α × t(x) + β × h1(x) + γ × h2(x). It selects the path which minimises f(x) where x is a current node on the path, t(x) is cost of the path from start to x, h1(x) is a heuristic to estimate the cost from x to the straight line passing through start and target, and h2(x) is a heuristic to estimate cost of the cheapest path from x to target. Furthermore, α, β, and γ indicate effective weights of each sub-function on f(x). T* algorithm is compared to the Greedy and A* algorithms in terms of hit rate and the number of processed nodes. Comparison results show that the proposed algorithm has a high efficiency compared to other algorithms.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129474696","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
Numerical solution of fuzzy differential equations using orthogonal polynomials 模糊微分方程的正交多项式数值解
Int. J. Comput. Sci. Math. Pub Date : 2019-02-05 DOI: 10.1504/IJCSM.2019.097634
S. Tapaswini, S. Chakraverty
{"title":"Numerical solution of fuzzy differential equations using orthogonal polynomials","authors":"S. Tapaswini, S. Chakraverty","doi":"10.1504/IJCSM.2019.097634","DOIUrl":"https://doi.org/10.1504/IJCSM.2019.097634","url":null,"abstract":"The present paper proposed a new method to solve nth order fuzzy differential equations using collocation type of method. In the solution procedure, Gram Schmidt orthogonalisation process is used with Legendre and Chebyshev polynomials. Known example problems are solved and compared with the exact results to illustrate the efficiency and reliability of the proposed method.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124359245","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
Further results on the generalised hypergeometric matrix functions 广义超几何矩阵函数的进一步结果
Int. J. Comput. Sci. Math. Pub Date : 2019-02-05 DOI: 10.1504/IJCSM.2019.097642
M. Abdalla
{"title":"Further results on the generalised hypergeometric matrix functions","authors":"M. Abdalla","doi":"10.1504/IJCSM.2019.097642","DOIUrl":"https://doi.org/10.1504/IJCSM.2019.097642","url":null,"abstract":"In recent years, various results of the special matrix functions have been established in many papers. In the present paper, we have developed certain properties involving generalised hypergeometric matrix functions, such as, integral representations and reduction formulae. Also, open problems concerning the generalised hypergeometric matrix functions are stated.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115497089","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}
引用次数: 15
Inclusion properties of hypergeometric functions in some class of analytic functions 一类解析函数中超几何函数的包含性质
Int. J. Comput. Sci. Math. Pub Date : 2019-02-05 DOI: 10.1504/IJCSM.2019.097645
S. Devi
{"title":"Inclusion properties of hypergeometric functions in some class of analytic functions","authors":"S. Devi","doi":"10.1504/IJCSM.2019.097645","DOIUrl":"https://doi.org/10.1504/IJCSM.2019.097645","url":null,"abstract":"The aim of the present paper is to determine the sufficient conditions on real parameters, so that the sequences formed by the coefficients of hypergeometric functions are convex decreasing. Interesting consequences of the results are also provided, which establish the mapping of the geometrical properties of hypergeometric functions onto the class of analytic functions defined by Ali et al. (2012).","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121867130","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
Arabic language and knowledge reduction in formal contexts 正式语境中的阿拉伯语和知识缩减
Int. J. Comput. Sci. Math. Pub Date : 2019-02-05 DOI: 10.1504/IJCSM.2019.097643
Issam Sahmoudi
{"title":"Arabic language and knowledge reduction in formal contexts","authors":"Issam Sahmoudi","doi":"10.1504/IJCSM.2019.097643","DOIUrl":"https://doi.org/10.1504/IJCSM.2019.097643","url":null,"abstract":"Formal concept analysis (FCA) is a mathematical tool that offers the conceptual data for knowledge representation, extraction and analysis with applications in the different areas. One of the main problems of FCA is the computational cost due to the large number of formal concepts generated. The objective of this paper is to address this problem by reducing the knowledge in formal contexts, we propose to use a linguistic approach, and we apply this latter for Arabic language. Objective performance evaluations are conducted to assess the efficiency of our proposed method.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134489922","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
A spline-based computational technique applicable for solution of boundary value problem arising in human physiology 一种基于样条的计算方法，适用于人体生理学边值问题的求解
Int. J. Comput. Sci. Math. Pub Date : 2019-02-05 DOI: 10.1504/IJCSM.2019.097635
P. Srivastava
{"title":"A spline-based computational technique applicable for solution of boundary value problem arising in human physiology","authors":"P. Srivastava","doi":"10.1504/IJCSM.2019.097635","DOIUrl":"https://doi.org/10.1504/IJCSM.2019.097635","url":null,"abstract":"Non-polynomial quintic spline functions based algorithms are used for computing an approximation to the nonlinear two point second order singular boundary value problems arising in human physiology. After removing the singularity by L' hospital rule, the resulting boundary value problem is then efficiently treated by employing non-polynomial quintic spline for finding the numerical solution. Two examples have been included and comparison of the numerical results made with cubic extended B-spline method and finite difference method.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130321289","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
Group acceptance sampling plans for resubmitted lots under exponentiated Fréchet distribution 按指数法分配的重新提交批次的组验收抽样计划
Int. J. Comput. Sci. Math. Pub Date : 2019-02-05 DOI: 10.1504/IJCSM.2019.097633
G. S. Rao, K. Rosaiah, M. S. Babu
{"title":"Group acceptance sampling plans for resubmitted lots under exponentiated Fréchet distribution","authors":"G. S. Rao, K. Rosaiah, M. S. Babu","doi":"10.1504/IJCSM.2019.097633","DOIUrl":"https://doi.org/10.1504/IJCSM.2019.097633","url":null,"abstract":"In quality control, we used to develop different types of sampling plans to ensure the quality of product lifetime. In this paper, we develop a group acceptance sampling plan (GASP) for lot resubmitting, to ensure the quality of product lifetime assuming that the product lifetime follows the exponentiated Frechet distribution. The GASP parameters are determined by satisfying the specified producer's and consumer's risks according to the experiment termination time and the number of testers. We compare the proposed plan with the ordinary group sampling plan and found that the proposed plan requires less sample size. Two examples are used for illustration.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134186561","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
Impulsive control on a non-autonomous dispersal almost periodic competition system 非自治分散几乎周期性竞争系统的脉冲控制
Int. J. Comput. Sci. Math. Pub Date : 2019-02-05 DOI: 10.1504/IJCSM.2019.097658
Liyan Pang, Lijun Xu
{"title":"Impulsive control on a non-autonomous dispersal almost periodic competition system","authors":"Liyan Pang, Lijun Xu","doi":"10.1504/IJCSM.2019.097658","DOIUrl":"https://doi.org/10.1504/IJCSM.2019.097658","url":null,"abstract":"This paper gives some new sufficient conditions for the uniform persistence, global asymptotical stability and almost periodic solution to a non-autonomous dispersal competition system with impulsive effects. The main results of this paper extend and improve some corresponding results in recent years. The method used in this paper provides a possible method to study the uniform persistence, global asymptotical stability and almost periodic solution of the models with impulsive perturbations in biological populations.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129773716","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
Energy consumption component analysis mathematical model of grinder energy unit 磨床能量单元能耗成分分析数学模型
Int. J. Comput. Sci. Math. Pub Date : 2018-11-30 DOI: 10.1504/IJCSM.2018.096316
Yan Zhou, Hua Zhang, W. Yan, Fengrong Ma, Gongfa Li, Wenjun Chang
{"title":"Energy consumption component analysis mathematical model of grinder energy unit","authors":"Yan Zhou, Hua Zhang, W. Yan, Fengrong Ma, Gongfa Li, Wenjun Chang","doi":"10.1504/IJCSM.2018.096316","DOIUrl":"https://doi.org/10.1504/IJCSM.2018.096316","url":null,"abstract":"Aiming at the characteristics of grinding machine with many energy sources, this paper studied the energy consumption of grinding machine from the aspect of energy consumption, analysed the energy consumption of each energy consumption unit of grinding machine, based on the energy balance equations of each energy consumption unit of grinder, the mathematical model of energy consumption component analysis of energy consumption unit is established. The model can provide a new theoretical method for energy efficiency analysis and prediction in the process of grinding machine. At the same time, it builds multi-source information fusion between machine tool and workpiece to support the production process decision-making, which is good for the manufacturing industry to become intelligent and green and the direction of development.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126079979","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
首页 上一页 下一页 尾页
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学术官方微信