Pub Date : 2015-06-13DOI: 10.14419/JACST.V4I2.4749
O. Kettani, F. Ramdani, B. Tadili
In data mining, K-means is a simple and fast algorithm for solving clustering problems, but it requires that the user provides in advance the exact number of clusters (k), which is often not obvious. Thus, this paper intends to overcome this problem by proposing a parameter-free algorithm for automatic clustering. It is based on successive adequate restarting of K-means algorithm. Experiments conducted on several standard data sets demonstrate that the proposed approach is effective and outperforms the related well known algorithm G-means, in terms of clustering accuracy and estimation of the correct number of clusters.
{"title":"AK-means: an automatic clustering algorithm based on K-means","authors":"O. Kettani, F. Ramdani, B. Tadili","doi":"10.14419/JACST.V4I2.4749","DOIUrl":"https://doi.org/10.14419/JACST.V4I2.4749","url":null,"abstract":"In data mining, K-means is a simple and fast algorithm for solving clustering problems, but it requires that the user provides in advance the exact number of clusters (k), which is often not obvious. Thus, this paper intends to overcome this problem by proposing a parameter-free algorithm for automatic clustering. It is based on successive adequate restarting of K-means algorithm. Experiments conducted on several standard data sets demonstrate that the proposed approach is effective and outperforms the related well known algorithm G-means, in terms of clustering accuracy and estimation of the correct number of clusters.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129817727","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}
Pub Date : 2015-06-09DOI: 10.14419/JACST.V4I2.4173
V. Rodríguez-Hernández, M. C. Espino-Gudiño, J. L. González-Pérez, J. Gudiño-Bazaldúa, V. Castaño
A novel methodology, result of 10 years of in-field testing, which makes possible the convergence of different types of models and quality standards for Engineering and Computer Science Faculties, is presented. Since most software-developing companies are small and medium sized, the projects developed must focuson SCRUM and Extreme Programming (XP), opposed to a RUP, which is quite heavy, as well as on Personal Software Process (PSP) and Team Software Process (TSP), which provide students with competences and a structured framework. ISO 90003:2004 norm is employed to define the processes by means of a quality system without new requirements or changing the existing ones. Also, the model is based on ISO/IEC 25000 (ISO (IEC 9126 – ISO/IEC 14598)) to allow comparing software built by different metrics.
本文提出了一种新的方法，这是10年现场测试的结果，它使工程和计算机科学学院不同类型的模型和质量标准的融合成为可能。由于大多数软件开发公司都是中小型的，开发的项目必须集中在SCRUM和极限编程(XP)上，而不是RUP，这是相当沉重的，以及个人软件过程(PSP)和团队软件过程(TSP)，这为学生提供了能力和结构化的框架。采用ISO 90003:2004标准，在没有新的要求或改变现有要求的情况下，通过质量体系来定义过程。此外，该模型基于ISO/IEC 25000 (ISO (IEC 9126 - ISO/IEC 14598))，允许比较由不同度量标准构建的软件。
{"title":"Assessing quality in software development: An agile methodology approach","authors":"V. Rodríguez-Hernández, M. C. Espino-Gudiño, J. L. González-Pérez, J. Gudiño-Bazaldúa, V. Castaño","doi":"10.14419/JACST.V4I2.4173","DOIUrl":"https://doi.org/10.14419/JACST.V4I2.4173","url":null,"abstract":"A novel methodology, result of 10 years of in-field testing, which makes possible the convergence of different types of models and quality standards for Engineering and Computer Science Faculties, is presented. Since most software-developing companies are small and medium sized, the projects developed must focuson SCRUM and Extreme Programming (XP), opposed to a RUP, which is quite heavy, as well as on Personal Software Process (PSP) and Team Software Process (TSP), which provide students with competences and a structured framework. ISO 90003:2004 norm is employed to define the processes by means of a quality system without new requirements or changing the existing ones. Also, the model is based on ISO/IEC 25000 (ISO (IEC 9126 – ISO/IEC 14598)) to allow comparing software built by different metrics.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124543168","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}
Pub Date : 2015-05-31DOI: 10.14419/JACST.V4I2.4343
A. Castañeda-Miranda, R. Castañeda-Miranda, V. Castaño
A pc-based automatic system for fingerprints recording and classification is described, based on the vector analysis of bifurcations. The system consists of a six-step process: a) acquisition, b) preprocessing, c) fragmentation, d) representation, e) description, and f) recognition. Details of each stage, along with actual examples of fingerprints recognition are provided.
{"title":"Fingerprint pattern recognition from bifurcations: An alternative approach.","authors":"A. Castañeda-Miranda, R. Castañeda-Miranda, V. Castaño","doi":"10.14419/JACST.V4I2.4343","DOIUrl":"https://doi.org/10.14419/JACST.V4I2.4343","url":null,"abstract":"A pc-based automatic system for fingerprints recording and classification is described, based on the vector analysis of bifurcations. The system consists of a six-step process: a) acquisition, b) preprocessing, c) fragmentation, d) representation, e) description, and f) recognition. Details of each stage, along with actual examples of fingerprints recognition are provided.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134443356","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}
Pub Date : 2015-05-27DOI: 10.14419/JACST.V4I1.4656
T. Niculescu, M. Marcu, F. Popescu
This paper presents a new and a modern method for study the inductive-capacitive circuits which are connected to an AC power source, using modern methods based on digital technology and software used in engineering applications. The capacitive circuits which are switched on an AC power source at the initial moment are presented below. We can determine the capacitor current variation forms, the capacitor voltage in a transient regime by using virtual mediums, in two different regimes: the oscillating regime and the-periodic regime. Each presented case contains an analytical presentation of the phenomenon, but it also contains the diagrams of current and voltage capacitors. The diagrams were obtained by two methods, which use MATLAB package. These diagrams are compared with experimental measurements obtained with a data-acquisition system produced by National Instruments using LABVIEW software.
{"title":"Study of transitory phenomena at connecting the capacitive loads to an AC power source","authors":"T. Niculescu, M. Marcu, F. Popescu","doi":"10.14419/JACST.V4I1.4656","DOIUrl":"https://doi.org/10.14419/JACST.V4I1.4656","url":null,"abstract":"This paper presents a new and a modern method for study the inductive-capacitive circuits which are connected to an AC power source, using modern methods based on digital technology and software used in engineering applications. The capacitive circuits which are switched on an AC power source at the initial moment are presented below. We can determine the capacitor current variation forms, the capacitor voltage in a transient regime by using virtual mediums, in two different regimes: the oscillating regime and the-periodic regime. Each presented case contains an analytical presentation of the phenomenon, but it also contains the diagrams of current and voltage capacitors. The diagrams were obtained by two methods, which use MATLAB package. These diagrams are compared with experimental measurements obtained with a data-acquisition system produced by National Instruments using LABVIEW software.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122388729","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}
Pub Date : 2015-05-01DOI: 10.14419/JACST.V4I1.4564
A. Yassin, Ban Kassim Alnidawy
The manufacturing industry is undergoing a major transformation enabled by IT and related smart technologies. The main thrust of Cloud computing is to provide on-demand computing services with high reliability, scalability and availability in a distributed environment. This paper summarizes our taxonomy of the CC review direction. The goals of this taxonomy were (i) clarify the needs and the directions of the use of the CC, (ii) define the academic and practical issues involved in CC , (iii) learn the state of the directions on methodologies of the CC , (iv) identify future research directions, which benefit the short and long terms. The taxonomy has concluded that (i) CC is advantageous in dealing with changes and uncertainties in the every-changing environment. (ii)It has been found that few existing CC can achieve the objective of security. (iii) The obstacles of the development of CC include the difficulties to identify and generalize the requirement of CC security, the lake of effective technologies that can be used to support the clouding use, and no international origination that serves for standardizing the modular components for cloud computing processes. In this paper, we use the IVSL(The Iraq Virtual Science Library) to select the free, full-text access to papers from major publishers as well as a large collection of on-line educational materials.
{"title":"A taxonomy of : The reviews on Cloud Computing Direction (CCD)","authors":"A. Yassin, Ban Kassim Alnidawy","doi":"10.14419/JACST.V4I1.4564","DOIUrl":"https://doi.org/10.14419/JACST.V4I1.4564","url":null,"abstract":"The manufacturing industry is undergoing a major transformation enabled by IT and related smart technologies. The main thrust of Cloud computing is to provide on-demand computing services with high reliability, scalability and availability in a distributed environment. This paper summarizes our taxonomy of the CC review direction. The goals of this taxonomy were (i) clarify the needs and the directions of the use of the CC, (ii) define the academic and practical issues involved in CC , (iii) learn the state of the directions on methodologies of the CC , (iv) identify future research directions, which benefit the short and long terms. The taxonomy has concluded that (i) CC is advantageous in dealing with changes and uncertainties in the every-changing environment. (ii)It has been found that few existing CC can achieve the objective of security. (iii) The obstacles of the development of CC include the difficulties to identify and generalize the requirement of CC security, the lake of effective technologies that can be used to support the clouding use, and no international origination that serves for standardizing the modular components for cloud computing processes. In this paper, we use the IVSL(The Iraq Virtual Science Library) to select the free, full-text access to papers from major publishers as well as a large collection of on-line educational materials.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127918721","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}
In this article a new combination of image segmentation techniques including K-means clustering, watershed transform, region merging and growing algorithm was proposed to segment computed tomography(CT) and magnetic resonance(MR) medical images. The first stage in the proposed system is "preprocessing" for required image enhancement, cropped, and convert the images into .mat or png ...etc image file formats then the image will be segmented using combination methods (clustering , region growing, and watershed, thresholding). Some initial over-segmentation appears due to the high sensitivity of the watershed algorithm to the gradient image intensity variations. Here, K- means and region growing with correct thresholding value are used to overcome that over segmentations. in our system the number of pixels of segmented area is calculated which is very important for medical image analysis for diseases or medicine effects on affected area of human body. also displaying the edge map. The results show that using clustering method output to region growing as input image, gives accurate and very good results compare with watershed technique which depends on gradient of input image, the mean and the threshold values which are chosen manually. Also the results show that the manual selection of the threshold value for the watershed is not as good as automatically selecting, where data misses may be happen.
{"title":"Medical Image Segmentation Based on Edge Detection Techniques","authors":"N. Salman, Bnar M Ghafour, Gullanar M. Hadi","doi":"10.14738/AIVP.32.1006","DOIUrl":"https://doi.org/10.14738/AIVP.32.1006","url":null,"abstract":"In this article a new combination of image segmentation techniques including K-means clustering, watershed transform, region merging and growing algorithm was proposed to segment computed tomography(CT) and magnetic resonance(MR) medical images. The first stage in the proposed system is \"preprocessing\" for required image enhancement, cropped, and convert the images into .mat or png ...etc image file formats then the image will be segmented using combination methods (clustering , region growing, and watershed, thresholding). Some initial over-segmentation appears due to the high sensitivity of the watershed algorithm to the gradient image intensity variations. Here, K- means and region growing with correct thresholding value are used to overcome that over segmentations. in our system the number of pixels of segmented area is calculated which is very important for medical image analysis for diseases or medicine effects on affected area of human body. also displaying the edge map. The results show that using clustering method output to region growing as input image, gives accurate and very good results compare with watershed technique which depends on gradient of input image, the mean and the threshold values which are chosen manually. Also the results show that the manual selection of the threshold value for the watershed is not as good as automatically selecting, where data misses may be happen.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127540188","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}
Pub Date : 2015-04-24DOI: 10.14419/JACST.V4I1.4518
Niculescu Titu
The paper presents a new and modern method for study the transient phenomena appeared to connect the capacitive charges to an AC power source, using the MATLAB-SIMULINK software package. It is known that NI-USB data-acquisition systems manufactured by National Instruments are not seen by Simulink software package in 64-bit systems. For this is obligatory for use a 32-bit system. From this point of view, the article presents a method by which this disadvantage is eliminated, making possible the data acquisition process in Simulink software package.
{"title":"Study of transient phenomena using NI-USB data acquisition systems in Matlab-Simulink medium on 64 bit operating systems","authors":"Niculescu Titu","doi":"10.14419/JACST.V4I1.4518","DOIUrl":"https://doi.org/10.14419/JACST.V4I1.4518","url":null,"abstract":"The paper presents a new and modern method for study the transient phenomena appeared to connect the capacitive charges to an AC power source, using the MATLAB-SIMULINK software package. It is known that NI-USB data-acquisition systems manufactured by National Instruments are not seen by Simulink software package in 64-bit systems. For this is obligatory for use a 32-bit system. From this point of view, the article presents a method by which this disadvantage is eliminated, making possible the data acquisition process in Simulink software package.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115103591","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}
Pub Date : 2015-04-15DOI: 10.14419/JACST.V4I1.4348
Mohammad Sadegh Arefi, H. Rezaei
This article presents a solution to the container loading problem. Container loading problem deals with how to put the cube boxes with different sizes in a container. Our proposed method is based on a particular kind of genetic algorithm based on biased random keys. In the proposed algorithm, we will face generations' extinction. Population decreases with time and with the staircase changes in the rate of elitism, the algorithm is guided towards the global optimum. Biased random keys in the proposed method are provided as discrete. The algorithm also provides the chromosomes that store more than one ability. In order to solve container loading using a placement strategy, due to the size of the boxes and containers, the containers are classified as small units and equal unites in size. Finally the algorithm presented in this paper was compared with three other methods that are based on evolutionary algorithms. The results show that the proposed algorithm has better performance in terms of results and performance time in relation to other methods.
{"title":"Problem solving of container loading using genetic algorithm based on modified random keys","authors":"Mohammad Sadegh Arefi, H. Rezaei","doi":"10.14419/JACST.V4I1.4348","DOIUrl":"https://doi.org/10.14419/JACST.V4I1.4348","url":null,"abstract":"This article presents a solution to the container loading problem. Container loading problem deals with how to put the cube boxes with different sizes in a container. Our proposed method is based on a particular kind of genetic algorithm based on biased random keys. In the proposed algorithm, we will face generations' extinction. Population decreases with time and with the staircase changes in the rate of elitism, the algorithm is guided towards the global optimum. Biased random keys in the proposed method are provided as discrete. The algorithm also provides the chromosomes that store more than one ability. In order to solve container loading using a placement strategy, due to the size of the boxes and containers, the containers are classified as small units and equal unites in size. Finally the algorithm presented in this paper was compared with three other methods that are based on evolutionary algorithms. The results show that the proposed algorithm has better performance in terms of results and performance time in relation to other methods.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131462231","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}
Pub Date : 2015-04-12DOI: 10.14419/JACST.V4I1.4365
M. Dehghanpour, A. Rahati, E. Dehghanian
The world's common rules (Quantum Physics, Electronics, Computational Chemistry and Astronomy) find their normal mathematical explanation in language of differential equations, so finding optimum numerical solution methods for these equations are very important. In this paper, using an artificial neural network (ANN) a numerical approach is designed to solve a specific system of differential equations such that the training process of the ANN calculates the optimal values for the coefficients of third order Runge Kutta method. To validate our approach, we performed some experiments by solving two body problem using coefficients obtained by ANN and also two other well-known coefficients namely Classical and Heun. The results show that the ANN approach has a better performance in compare with two other approaches.
{"title":"ANN-based modeling of third order runge kutta method","authors":"M. Dehghanpour, A. Rahati, E. Dehghanian","doi":"10.14419/JACST.V4I1.4365","DOIUrl":"https://doi.org/10.14419/JACST.V4I1.4365","url":null,"abstract":"The world's common rules (Quantum Physics, Electronics, Computational Chemistry and Astronomy) find their normal mathematical explanation in language of differential equations, so finding optimum numerical solution methods for these equations are very important. In this paper, using an artificial neural network (ANN) a numerical approach is designed to solve a specific system of differential equations such that the training process of the ANN calculates the optimal values for the coefficients of third order Runge Kutta method. To validate our approach, we performed some experiments by solving two body problem using coefficients obtained by ANN and also two other well-known coefficients namely Classical and Heun. The results show that the ANN approach has a better performance in compare with two other approaches.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132380936","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}
Pub Date : 2015-04-12DOI: 10.14419/JACST.V4I1.4283
Amin Mubark Alamin Ibrahim, M. Mustafa
The subject of matching text or search the texts is important topics in the field of computer science and is used in many programs such as Microsoft word program in correct spelling mistakes and search &replace, and other uses. The aim of this study was to learn how to trade-off texts matching algorithms, which are very much where we have the application on Horspool's and Brute Force algorithms. According to the standard number of comparisons and time of execution. The study pointed on preference Horspool's algorithm.
{"title":"Comparison criteria between matching algorithms texts application on (horspool's and brute force algorithms)","authors":"Amin Mubark Alamin Ibrahim, M. Mustafa","doi":"10.14419/JACST.V4I1.4283","DOIUrl":"https://doi.org/10.14419/JACST.V4I1.4283","url":null,"abstract":"The subject of matching text or search the texts is important topics in the field of computer science and is used in many programs such as Microsoft word program in correct spelling mistakes and search &replace, and other uses. The aim of this study was to learn how to trade-off texts matching algorithms, which are very much where we have the application on Horspool's and Brute Force algorithms. According to the standard number of comparisons and time of execution. The study pointed on preference Horspool's algorithm.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121575149","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：