World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering最新文献

{"title":"Robust Control of a Dynamic Model of an F-16 Aircraft with Improved Damping through Linear Matrix Inequalities","authors":"J. P. P. Andrade, V. A. F. Campos","doi":"10.5281/ZENODO.1128926","DOIUrl":"https://doi.org/10.5281/ZENODO.1128926","url":null,"abstract":"This work presents an application of Linear Matrix \u0000Inequalities (LMI) for the robust control of an F-16 aircraft through \u0000an algorithm ensuring the damping factor to the closed loop system. \u0000The results show that the zero and gain settings are sufficient to ensure \u0000robust performance and stability with respect to various operating \u0000points. The technique used is the pole placement, which aims to put \u0000the system in closed loop poles in a specific region of the complex \u0000plane. Test results using a dynamic model of the F-16 aircraft are \u0000presented and discussed.","PeriodicalId":104722,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116370062","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 Secure Digital Signature Scheme with Fault Tolerance Based on the Improved RSA System","authors":"H. Elkamchouchi, Heba Gaber, F. Ahmed, Dalia H. ElKamchouchi","doi":"10.5121/csit.2016.60704","DOIUrl":"https://doi.org/10.5121/csit.2016.60704","url":null,"abstract":"","PeriodicalId":104722,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123841866","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":"Supplier Selection and Order Allocation Using a Stochastic Multi-Objective Programming Model and Genetic Algorithm","authors":"R. Bagheri, M. Mahmoudi, Hadi Moheb-Alizadeh","doi":"10.1504/IJISM.2017.10010888","DOIUrl":"https://doi.org/10.1504/IJISM.2017.10010888","url":null,"abstract":"In this paper, we develop a supplier selection and order allocation multi-objective model in stochastic environment in which purchasing cost, percentage of delivered items with delay and percentage of rejected items provided by each supplier are supposed to be stochastic parameters following any arbitrary probability density function. To do so, we use dependent chance programming (DCP) that maximises probability of the event that total purchasing cost, total delivered items with delay and total rejected items are less than or equal to pre-determined values given by decision maker. After transforming the abovementioned stochastic multi-objective programming problem into a stochastic single objective problem using minimum deviation method, we apply a genetic algorithm to solve the later single objective problem. The employed genetic algorithm performs a simulation process in order to calculate the stochastic objective function as its fitness function. A stochastic analysis reveals that incorporation of stochasticity into the supplier selection and order allocation problem will be advantageous for a purchasing firm with respect to purchasing cost, percentage of delivered items with delay and percentage of rejected items. Furthermore, we explore the impact of stochastic parameters on the given solution via a sensitivity analysis exploiting coefficient of variation. The results show that as stochastic parameters have greater coefficients of variation, the value of objective function in the stochastic single objective programming problem is worsened.","PeriodicalId":104722,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115064962","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":"Data Collection with Bounded-Sized Messages in Wireless Sensor Networks","authors":"Min Kyung An","doi":"10.5281/ZENODO.1124437","DOIUrl":"https://doi.org/10.5281/ZENODO.1124437","url":null,"abstract":"In this paper, we study the data collection problem in \u0000Wireless Sensor Networks (WSNs) adopting the two interference \u0000models: The graph model and the more realistic physical interference \u0000model known as Signal-to-Interference-Noise-Ratio (SINR). The \u0000main issue of the problem is to compute schedules with the minimum \u0000number of timeslots, that is, to compute the minimum latency \u0000schedules, such that data from every node can be collected without \u0000any collision or interference to a sink node. While existing works \u0000studied the problem with unit-sized and unbounded-sized message \u0000models, we investigate the problem with the bounded-sized message \u0000model, and introduce a constant factor approximation algorithm. \u0000To the best known of our knowledge, our result is the first result \u0000of the data collection problem with bounded-sized model in both \u0000interference models.","PeriodicalId":104722,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127107703","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":"Researching Apache Hama: A Pure BSP Computing Framework","authors":"Kamran Siddique, Z. Akhtar, Yangwoo Kim","doi":"10.1007/978-981-10-1536-6_29","DOIUrl":"https://doi.org/10.1007/978-981-10-1536-6_29","url":null,"abstract":"","PeriodicalId":104722,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114439790","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":"Numerical Solution of Integral Equations by Using Discrete GHM Multiwavelet","authors":"A. Yajnik, R. Ali","doi":"10.18831/djmaths.org/2015011003","DOIUrl":"https://doi.org/10.18831/djmaths.org/2015011003","url":null,"abstract":"","PeriodicalId":104722,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132914145","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":"Challenges over Two Semantic Repositories - OWLIM and AllegroGraph","authors":"Paria Tajabor, Azin Azarbani","doi":"10.11591/IJEECS.V2.I1.PP194-204","DOIUrl":"https://doi.org/10.11591/IJEECS.V2.I1.PP194-204","url":null,"abstract":"The purpose of this research study is exploring two kind of semantic repositories with regards to various factors to find the best approaches that an artificial manager can use to produce ontology in a system based on their interaction, association and research. To this end, as the best way to evaluate each system and comparing with others is analysis, several benchmarking over these two repositories were examined. These two semantic repositories: OWLIM and AllegroGraph will be the main core of this study.  The general objective of this study is to be able to create an efficient and cost-effective manner reports which is required to support decision making in any large enterprise.","PeriodicalId":104722,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116493492","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":"Effect of Thermal Treatment on Phenolic Content, Antioxidant, and Alpha-Amylase Inhibition Activities of Moringa stenopetala Leaves","authors":"D. Assefa, Engeda Dessalegn, C. Chauhan","doi":"10.5897/AJFS2014.1241","DOIUrl":"https://doi.org/10.5897/AJFS2014.1241","url":null,"abstract":"Moringa stenopetala is a socioeconomic valued tree that is widely available and cultivated in Southern part of Ethiopia. The leaves have been traditionally used as a food source with high nutritional and medicinal values. The present work was carried out to evaluate the effect of thermal treatment on the total phenolic content, total flavonoid content, antioxidant activities and α-amylase inhibition of aqueous leaf extracts obtained from M. stenopetala during  maceration and different decoction time interval (5, 10 and 15 min). The total phenolic and flavonoid contents were determined by the Folin-ciocalteu and aluminum chloride methods, respectively whereas antioxidant activities were determined by 2,2-diphenyl-1-picryl-hydrazyl(DPPH) radical scavenging, reducing power, phosphomolybdenum and ferrous ion chelating assays and α-amylase inhibition potential was determined using 3,5-dinitrosalicylic acid method. Total phenolic and total flavonoid contents ranged from 34.35 ± 1.06 to 39.47 ± 1.33 mgGAE/g and 10.44 ± 0.61 to 20.36 ± 0.93 mgQRE/g, respectively. Decoction for 10 min extract showed  ferrous ion chelating (92.52 ± 0.17 %), DPPH radical scavenging (91.52± 0.59 %), α-amylase inhibition (69.06 ± 0.14%), ferric reducing power (0.765 ± 0.14) and total antioxidant activity (0.329 ± 0.32), respectively. DPPH, reducing power,  total antioxidant and α-amylase inhibition activities showed positive linear correlation (R2=0.853, R2= 0.857 , R2= 0.864 and R2=0.930), respectively with total phenolic content but ferrous ion chelating activity were found to be weakly correlated (R2=0.481). Based on present investigation, it could be concluded that major lose of total phenolic content, antioxidant and α-amylase inhibition activities of the crude leaf extracts of M. stenopetala leaves were observed at decoction time for 15 min. Therefore, to maintain the total phenolic content, antioxidant and α-amylase inhibition activities of leaves, cooking practice should be at the optimum decoction time (5-10 min).  \u0000 \u0000    \u0000 \u0000 Key words: Moringa stenopetala, antioxidant, total phenolic content, α-amylase inhibition.","PeriodicalId":104722,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115931715","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 New Method to Winner Determination for Economic Resource Allocation in Cloud Computing Systems","authors":"E. B. Nejad, Rezvan Alipoor Sabzevari","doi":"10.20474/-jater2.1.3","DOIUrl":"https://doi.org/10.20474/-jater2.1.3","url":null,"abstract":"Cloud computing systems are large-scale distributed systems, so that they focus more on large scale resource sharing, cooperation of several organizations and their use in new applications. One of the main challenges in this realm is resource allocation. There are many different ways of resource allocation in cloud computing. One of the common methods of resource allocation are economic methods. Among these methods, the auctionbased method has greater prominence compared with Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. This method includes two phases: winner determination and resource allocation. In this paper a new method has been presented to determine winner in double combinatorial auction-based resource allocation using Imperialist Competitive Algorithm (ICA). The experimental results show that in our new proposed method, the number of winner users is higher than genetic algorithm. On the other hand, in proposed algorithm, the number of winner providers is higher in genetic algorithm. © 2016 TAF Publishing. All rights reserved.","PeriodicalId":104722,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115624211","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":"Comparison between Separable and Irreducible Goppa Code in McEliece Cryptosystem","authors":"Thuraya M. Qaradaghi, Newroz N. Abdulrazaq","doi":"10.13140/RG.2.1.4302.5364","DOIUrl":"https://doi.org/10.13140/RG.2.1.4302.5364","url":null,"abstract":"The McEliece cryptosystem is an asymmetric type of cryptography based on error correction code. The classical McEliece used irreducible binary Goppa code which considered unbreakable until now especially with parameter [1024, 524, and 101], but it is suffering from large public key matrix which leads to be difficult to be used practically. In this work Irreducible and Separable Goppa codes have been introduced. The Irreducible and Separable Goppa codes used are with flexible parameters and dynamic error vectors. A Comparison between Separable and Irreducible Goppa code in McEliece Cryptosystem has been done. For encryption stage, to get better result for comparison, two types of testing have been chosen; in the first one the random message is constant while the parameters of Goppa code have been changed. But for the second test, the parameters of Goppa code are constant (m=8 and t=10) while the random message have been changed. The results show that the time needed to calculate parity check matrix in separable are higher than the one for irreducible McEliece cryptosystem, which is considered expected results due to calculate extra parity check matrix in decryption process for g(z) in separable type, and the time needed to execute error locator in decryption stage in separable type is better than the time needed to calculate it in irreducible type. The proposed implementation has been done by Visual studio C#. Keywords—McEliece cryptosystem, Goppa code, separable, irreducible.","PeriodicalId":104722,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130527054","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}