J. Chem. Inf. Comput. Sci.最新文献

{"title":"AES Encryption Algorithm Parallelization in Order to Use Big Data Cloud Naser Attar, Hossein Deldari, Marzie Kalantari","authors":"Naser Attar, H. Deldari, M. Kalantari","doi":"10.5539/CIS.V10N3P23","DOIUrl":"https://doi.org/10.5539/CIS.V10N3P23","url":null,"abstract":"Currently, standard encryption algorithms, such as AES, are used for encryption of data in cloud. As AES algorithm is a low-speed for serial, in addition to solving its low-speed, a Parallel Algorithms is introduced. Regarding the extent of cloud network, the most important feature of the proposed algorithm is its High speed and resistivity against the attacks. The algorithm is designed and implemented in java script in cloudsim environment. The results obtained from implementation of this algorithm in cloud simulating environment, are compared and evaluated relative to the other algorithms. Similar input was fed to the proposed and other algorithms. The proposed algorithm processed the data in 82 ms which is faster than the other algorithm.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"135 1","pages":"23-28"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75056707","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}

{"title":"A Holistic Decision Framework to Avoid Vendor Lock-in for Cloud SaaS Migration","authors":"Justice Opara-Martins, R. Sahandi, Feng Tian","doi":"10.5539/cis.v10n3p29","DOIUrl":"https://doi.org/10.5539/cis.v10n3p29","url":null,"abstract":"Cloud computing offers an innovative business model to enterprise for IT services consumption and delivery. Software as a Service (SaaS) is one of the cloud offerings that attract organisations as a potential solution in reducing their IT cost. However, the vast diversity among the available cloud SaaS services makes it difficult for customers to decide whose vendor services to use or even to determine a valid basis for their selections. Moreover, this variety of cloud SaaS services has led to proprietary architectures and technologies being used by cloud vendors, increasing the risk of vendor lock-in for customers. Therefore, when enterprises interact with SaaS providers within the purview of the current cloud marketplace, they often encounter significant lock-in challenges to migrating and interconnecting cloud. Hence, the complexity and variety of cloud SaaS service offerings makes it imperative for businesses to use a clear and well understood decision process to procure, migrate and/or discontinue cloud services. To date, the expertise and technological solutions to simplify such transition and facilitate good decision making to avoid lock-in risks in the cloud are limited. Besides, little investigation has been carried out to provide a comprehensive decision framework to support enterprises on how to avoid lock-in risks when selecting and implementing cloud-based SaaS solutions within existing environments. Such decision framework is important to reduce complexity and variations in implementation patterns on the cloud provider side, while at the same time minimising potential switching cost for enterprises by resolving integration issues with existing IT infrastructures. This paper proposes a holistic 6-step decision framework that enables an enterprise to assess its current IT landscape for potential SaaS replacement, and provides effective strategies to mitigate vendor lock-in risks in cloud (SaaS) migration. The framework follows research findings and addresses the core requirements for choosing vendor-neutral interoperable and portable cloud services without the fear of vendor lock-in, and architectural decisions for secure SaaS migration. Therefore, the results of this research can help IT managers have a safe and effective migration to cloud computing SaaS environment.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"14 1","pages":"29-53"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79261791","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}

{"title":"The Application of Possibility Distribution for Solving Standard Quadratic Optimization Problems","authors":"Lunshan Gao","doi":"10.5539/cis.v10n3p60","DOIUrl":"https://doi.org/10.5539/cis.v10n3p60","url":null,"abstract":"A standard quadratic optimization problem (StQP) is to find optimal values of a quadratic form over the standard simplex. The concept of possibility distribution was proposed by L. A. Zadeh. This paper applies the concept of possibility distribution function to solving StQP. The application of possibility distribution function establishes that it encapsulates the constrained conditions of the standard simplex into the possibility distribution function, and the derivative of the StQP formula becomes a linear function. As a result, the computational complexity of StQP problems is reduced, and the solutions of the proposed algorithm are always over the standard simplex. This paper proves that NP-hard StQP problems are in P. Numerical examples demonstrate that StQP problems can be solved by solving a set of linear equations. Comparing with Lagrangian function method, the solutions of the new algorithm are reliable when the symmetric matrix is indefinite.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"27 1","pages":"60-78"},"PeriodicalIF":0.0,"publicationDate":"2017-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78040174","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}

{"title":"A Successful Advertising Strategy over Twitter","authors":"Kyota Okubo, K. Oida","doi":"10.5539/cis.v10n3p10","DOIUrl":"https://doi.org/10.5539/cis.v10n3p10","url":null,"abstract":"Large information cascades over online social networks have attracted a great deal of attention. The life times of most cascades are quite short, whereas recent advertising campaigns sometimes generate long-lived ones by employing effective dissemination strategies (instant-win, reminders, etc.). This paper reports one such campaign, YOGUR STAND, on the Twitter network in Japan. The data analysis shows that the campaign popularity has two interesting features. (1) It shows elastic behavior in that the impact of the destructive earthquake on the popularity was quite temporary. (2) It exhibits stationary behavior in that the campaign account gained approximately 2,000 new followers every day.The analysis also demonstrates that there were communities in the campaign participants. The campaign was successful because about 2.4 million Twitter users received the campaign retweets every day and 10-15% of them received the retweets for the first time.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"75 2 1","pages":"10-22"},"PeriodicalIF":0.0,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86448412","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}

{"title":"Using Improved d-HMAC for Password Storage","authors":"Mohannad Najjar","doi":"10.5539/cis.v10n3p1","DOIUrl":"https://doi.org/10.5539/cis.v10n3p1","url":null,"abstract":"Password storage is one of the most important cryptographic topics through the time. Different systems use distinct ways of password storage. In this paper, we developed a new algorithm of password storage using dynamic Key-Hashed Message Authentication Code function (d-HMAC). The developed improved algorithm is resistant to the dictionary attack and brute-force attack, as well as to the rainbow table attack. This objective is achieved by using dynamic values of dynamic inner padding d-ipad, dynamic outer padding d-opad and user’s public key as a seed.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"12 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88720975","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}

{"title":"Factors Affecting the Adoption of Cloud Computing in Saudi Arabian Universities","authors":"Faten Karim, G. Rampersad","doi":"10.5539/cis.v10n2p109","DOIUrl":"https://doi.org/10.5539/cis.v10n2p109","url":null,"abstract":"Cloud computing is a novel trend in the sphere of information technology. This research sought to identify the factors that could influence the adoption of cloud computing in Saudi Arabian universities, and to comprehend the theories of technology adoption that apply to the uptake of cloud computing in organisations or for individuals, and how they pertained to the study reported here. Four categories of possible influencers were investigated: technological, organisational, environmental, and cultural. This mixed-methods study was based in extended TOE theory (technology, organisation, and environment) and the Hofstede model, which includes cultural factors. To accomplish the goals of the research, an exploratory study consisting of two phases, including qualitative (interviews) and quantitative (survey) was initiated to determine the importance of each of these influencers and the degree of influence. The results revealed that the factors of relative advantage, compatibility, top management support, readiness, competitive pressure, regulatory support, high masculinity, and high individualism have positive impacts on the adoption of cloud computing in this particular context. They also showed that security concerns, high uncertainty avoidance, and high power distance have negative impacts on cloud computing adoption. Unexpectedly, the results indicated that complexity, language and religion do not influence the adoption process.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"107 1","pages":"109-123"},"PeriodicalIF":0.0,"publicationDate":"2017-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77093188","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}

{"title":"Cloud Computing in Education in Developing Countries","authors":"Faten Karim, G. Rampersad","doi":"10.5539/cis.v10n2p87","DOIUrl":"https://doi.org/10.5539/cis.v10n2p87","url":null,"abstract":"The main advantage of cloud computing is to reduce the IT cost. By using cloud computing, organisations do not have to set up an IT infrastructure, and instead are able to rent resources and give payment only for the using services. Even with the appealing of cloud computing benefits, it is still in infancy in developing countries due to many reasons. Technology adoption has been explored to a limited degree in developing countries, particularly in relation to cloud computing in the tertiary education sector. Existing studies have examined technology adoption in developed countries and to a lesser extent in developing countries in non-education contexts such as e-government. This paper contributes to the cloud computing adoption literature in developing countries, and specifically in Saudi Arabian universities.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"59 1","pages":"87-96"},"PeriodicalIF":0.0,"publicationDate":"2017-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91231496","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}

{"title":"On The Improvement of Combinatorial Mathematics Teaching From Generating Function","authors":"C. Ji","doi":"10.5539/cis.v10n2p104","DOIUrl":"https://doi.org/10.5539/cis.v10n2p104","url":null,"abstract":"Generating function is an effective method to solve combinatorial counting problem, but it most likely to be neglected in combinatorial mathematics teaching. In this paper, we provides a demonstration for combinatorial mathematics teaching improvement by using the generating function solving combination number and the sum of preceding  terms among sequence of numbers.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"10 1","pages":"104-108"},"PeriodicalIF":0.0,"publicationDate":"2017-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78481192","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}

{"title":"Type Safe Metadata Combining","authors":"M. Vanags, Rudite Cevere","doi":"10.5539/cis.v10n2p97","DOIUrl":"https://doi.org/10.5539/cis.v10n2p97","url":null,"abstract":"Type safety is an important property of any type system. Modern programming languages support different mechanisms to work in type safe manner, e.g., properties, methods, events, attributes (annotations) and other structures. Some programming languages allow access to metadata: type information, type member information and information about applied attributes. But none of the existing mainstream programming languages which support reflection provides fully type safe metadata combining mechanism built in the programming language. Combining of metadata means a class member metadata combining with data, type metadata and constraints. Existing solutions provide no or limited type safe metadata combining mechanism; they are complex and processed at runtime, which by definition is not built-in type-safe metadata combining. Problem can be solved by introducing syntax and methods for type safe metadata combining so that, metadata could be processed at compile time in a fully type safe way. Common metadata combining use cases are data abstraction layer creation and database querying.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"23 1","pages":"97-103"},"PeriodicalIF":0.0,"publicationDate":"2017-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88552986","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}

{"title":"A Binary Search Algorithm for Correlation Study of Decay Centrality vs. Degree Centrality and Closeness Centrality","authors":"N. Meghanathan","doi":"10.5539/cis.v10n2p52","DOIUrl":"https://doi.org/10.5539/cis.v10n2p52","url":null,"abstract":"Results of correlation study (using Pearson's correlation coefficient, PCC) between decay centrality (DEC) vs. degree centrality (DEG) and closeness centrality (CLC) for a suite of 48 real-world networks indicate an interesting trend: PCC(DEC, DEG) decreases with increase in the decay parameter δ (0 < δ < 1) and PCC(DEC, CLC) decreases with decrease in δ . We make use of this trend of monotonic decrease in the PCC values (from both sides of the δ -search space) and propose a binary search algorithm that (given a threshold value r for the PCC) could be used to identify a value of δ (if one exists, we say there exists a positive δ - space r ) for a real-world network such that PCC(DEC, DEG) ≥ r as well as PCC(DEC, CLC) ≥ r . We show the use of the binary search algorithm to find the maximum Threshold PCC value r max (such that δ - space r max is positive) for a real-world network. We observe a very strong correlation between r max and PCC(DEG, CLC) as well as observe real-world networks with a larger variation in node degree to more likely have a lower r max value and vice-versa.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"1 1","pages":"52-75"},"PeriodicalIF":0.0,"publicationDate":"2017-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87769548","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}