Pub Date : 2016-10-01DOI: 10.1109/ISPACS.2016.7824716
Y. Minami, Kazuma Igarashi, T. Sugiura, N. Nakano
In this paper, an area-efficient cross-coupled charge pump for standalone chip using on-chip solar cell is proposed. The proposed cross-coupled charge pump outputs higher voltage than conventional cross-coupled charge pump on the same area by adding capacitors to drive MOS transistors. The proposed circuit is fabricated in 0.18um standard CMOS process, and outputs 80mV higher than the conventional circuit with 500mV input and 100kHz clock frequency.
{"title":"Area-efficient cross-coupled charge pump for on-chip solar cell","authors":"Y. Minami, Kazuma Igarashi, T. Sugiura, N. Nakano","doi":"10.1109/ISPACS.2016.7824716","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824716","url":null,"abstract":"In this paper, an area-efficient cross-coupled charge pump for standalone chip using on-chip solar cell is proposed. The proposed cross-coupled charge pump outputs higher voltage than conventional cross-coupled charge pump on the same area by adding capacitors to drive MOS transistors. The proposed circuit is fabricated in 0.18um standard CMOS process, and outputs 80mV higher than the conventional circuit with 500mV input and 100kHz clock frequency.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123895398","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824768
Khin Yadanar Win, S. Choomchuay
Diabetic retinopathy is one of the serious vision-threating diabetes complications which can even lead to blindness if not diagnosed and cured at the early stage. Exudate is one of the early sign of diabetic retinopathy. Hence, proper method for exudates detection is very useful step in the screening of computer-aided diabetic retinopathy systems. This paper proposes an automatic algorithm to localize the optic disc and detect exudates from fundus retinal images. The algorithm uses histogram information. Optic disc occurs as the bright yellowish region in the retina image, which resembles exudates. It must be eliminated before exudates detection. Therefore, it is necessary to localize the center of the optic disc before it can be eliminated. Without the presence of the optic disc, exudates can be detected easily by using the histogram based thresholding technique. The DRIVE, DIARECTDB1, STARE, and 325 retinal fundus images from local dataset are examined for evaluating the proposed algorithm. The proposed method achieved the accuracy of 100%, 96%, 93%, and 97% respectively for optic disc detection. For exudates detection, the accurate rate is 99%, 90%, and 89% for DRIVE, DIARECTDB1 and local dataset respectively.
{"title":"Automated detection of exudates using histogram analysis for Digital Retinal Images","authors":"Khin Yadanar Win, S. Choomchuay","doi":"10.1109/ISPACS.2016.7824768","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824768","url":null,"abstract":"Diabetic retinopathy is one of the serious vision-threating diabetes complications which can even lead to blindness if not diagnosed and cured at the early stage. Exudate is one of the early sign of diabetic retinopathy. Hence, proper method for exudates detection is very useful step in the screening of computer-aided diabetic retinopathy systems. This paper proposes an automatic algorithm to localize the optic disc and detect exudates from fundus retinal images. The algorithm uses histogram information. Optic disc occurs as the bright yellowish region in the retina image, which resembles exudates. It must be eliminated before exudates detection. Therefore, it is necessary to localize the center of the optic disc before it can be eliminated. Without the presence of the optic disc, exudates can be detected easily by using the histogram based thresholding technique. The DRIVE, DIARECTDB1, STARE, and 325 retinal fundus images from local dataset are examined for evaluating the proposed algorithm. The proposed method achieved the accuracy of 100%, 96%, 93%, and 97% respectively for optic disc detection. For exudates detection, the accurate rate is 99%, 90%, and 89% for DRIVE, DIARECTDB1 and local dataset respectively.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"277 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120854432","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824744
Khairunisa Ahmad Denney, M. Hamada, Y. Nagao, M. Kurosaki, H. Ochi
In this paper, we propose an alternative positioning system using time-synchronized wireless network that can achieve high positioning accuracy without being dependent to any global positioning system (GPS) devices with cm-level accuracy as the main goal and objective. The proposed system utilizes time of arrival (ToA) method in order to estimate the target's position. Based on the results, we can achieve time synchronization with less than 1ns (average offset error of 0.05ns) accuracy and cm-level (position error of 1.23cm) positioning accuracy through our simulation. Furthermore, increasing the number or measuring device in positioning system will increase the accuracy of positioning a target. High accuracy time synchronization is achievable by deploying proposed PTP with high number of iteration in synchronization period. In this research, we aim to deploy the proposed system in industrial wireless LAN. It is applicable by embedding the system into customized wireless LAN chip with positioning ability.
{"title":"ToA-based positioning system for industrial wireless LAN","authors":"Khairunisa Ahmad Denney, M. Hamada, Y. Nagao, M. Kurosaki, H. Ochi","doi":"10.1109/ISPACS.2016.7824744","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824744","url":null,"abstract":"In this paper, we propose an alternative positioning system using time-synchronized wireless network that can achieve high positioning accuracy without being dependent to any global positioning system (GPS) devices with cm-level accuracy as the main goal and objective. The proposed system utilizes time of arrival (ToA) method in order to estimate the target's position. Based on the results, we can achieve time synchronization with less than 1ns (average offset error of 0.05ns) accuracy and cm-level (position error of 1.23cm) positioning accuracy through our simulation. Furthermore, increasing the number or measuring device in positioning system will increase the accuracy of positioning a target. High accuracy time synchronization is achievable by deploying proposed PTP with high number of iteration in synchronization period. In this research, we aim to deploy the proposed system in industrial wireless LAN. It is applicable by embedding the system into customized wireless LAN chip with positioning ability.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123706766","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824720
Janani Purushothaman, Minako Kamiyama, A. Taguchi
Histogram equalization (HE) is one of the simplest and effective methods for contrast enhancement. The contrast of an image is increased by HE. But HE fails to produce satisfactory results for wide range of low contrast images, because HE does not use a spatial feature that is included in an original image. In order to overcome this disorder the differential gray-levels histogram equalization (DHE) has been proposed. In this paper, we extend the DHE to color image processing. Then, hue and intensity information are taken into account for color image enhancement. Hue component is used for intensity processing. Even by keeping the intensity constant we can capture the edge by changing the hue. First the processing is done with intensity component and then with hue component. Finally intensity and hue component results are combined to produce better results. The proposed method has one parameter which controls the enhancement property of the color image. The guideline for the decision of the parameter which is agreed by the human sense is also described.
{"title":"Color image enhancement based on Hue differential histogram equalization","authors":"Janani Purushothaman, Minako Kamiyama, A. Taguchi","doi":"10.1109/ISPACS.2016.7824720","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824720","url":null,"abstract":"Histogram equalization (HE) is one of the simplest and effective methods for contrast enhancement. The contrast of an image is increased by HE. But HE fails to produce satisfactory results for wide range of low contrast images, because HE does not use a spatial feature that is included in an original image. In order to overcome this disorder the differential gray-levels histogram equalization (DHE) has been proposed. In this paper, we extend the DHE to color image processing. Then, hue and intensity information are taken into account for color image enhancement. Hue component is used for intensity processing. Even by keeping the intensity constant we can capture the edge by changing the hue. First the processing is done with intensity component and then with hue component. Finally intensity and hue component results are combined to produce better results. The proposed method has one parameter which controls the enhancement property of the color image. The guideline for the decision of the parameter which is agreed by the human sense is also described.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122437152","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824766
M. Phothisonothai, S. Tantisatirapong, A. Aurasopon
Watermelons are popularly grown and consumed in most tropical areas of agricultural countries especially in the Asian countries. Quality control is important to standardize the production especially the procedure of automatic system based on computer vision. In this paper, therefore, we objectively investigated the ripeness of watermelon based on color segmentation using k-means clustering and rind texture analysis using Laplacian of Gaussian (LoG) filter. We captured each image of 20 watermelons (Kinnaree variety), which are divided into ten ripe and unripe groups by an experienced farmer. Different experimental conditions were compared to achieve the optimal outcome. The experimental results showed that the proposed features could extract different ripeness levels statistically with p < 0.001.
{"title":"Automated determination of watermelon ripeness based on image color segmentation and rind texture analysis","authors":"M. Phothisonothai, S. Tantisatirapong, A. Aurasopon","doi":"10.1109/ISPACS.2016.7824766","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824766","url":null,"abstract":"Watermelons are popularly grown and consumed in most tropical areas of agricultural countries especially in the Asian countries. Quality control is important to standardize the production especially the procedure of automatic system based on computer vision. In this paper, therefore, we objectively investigated the ripeness of watermelon based on color segmentation using k-means clustering and rind texture analysis using Laplacian of Gaussian (LoG) filter. We captured each image of 20 watermelons (Kinnaree variety), which are divided into ten ripe and unripe groups by an experienced farmer. Different experimental conditions were compared to achieve the optimal outcome. The experimental results showed that the proposed features could extract different ripeness levels statistically with p < 0.001.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127227628","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824728
Tze-Wei Yeoh, H. Aguirre, Kiyoshi Tanaka
Gait recognition is recognizing human through the style in which they walk. However, the recognition task can become complicated due to the existence of covariate factors (e.g. clothing, camera viewpoint, carrying condition, elapsed time, walking surface, etc). Amongst all the covariate factors, clothing is the most challenging one. This is because it may obscure a significant amount of discriminative human gait features and makes it much more challenging for human recognition task. In recent, there has been significant research on this problem. However, conventional state-of-the-art methods have mostly use hand-crafted features for representing the human gait. In this work, we explore and study the use of convolutional neural networks (CNN) to automatically learn gait features or representations directly from low-level input raw data (i.e. Gait Energy Image (GEI)). Evaluations on the challenging clothing-invariant gait recognition of OU-ISIR Treadmill dataset B, the experiment results shows that our method can achieve far better performance as compared to hand-crafted feature in conventional state-of-the-art methods with minimal preprocessing knowledge of the problem are required.
{"title":"Clothing-invariant gait recognition using convolutional neural network","authors":"Tze-Wei Yeoh, H. Aguirre, Kiyoshi Tanaka","doi":"10.1109/ISPACS.2016.7824728","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824728","url":null,"abstract":"Gait recognition is recognizing human through the style in which they walk. However, the recognition task can become complicated due to the existence of covariate factors (e.g. clothing, camera viewpoint, carrying condition, elapsed time, walking surface, etc). Amongst all the covariate factors, clothing is the most challenging one. This is because it may obscure a significant amount of discriminative human gait features and makes it much more challenging for human recognition task. In recent, there has been significant research on this problem. However, conventional state-of-the-art methods have mostly use hand-crafted features for representing the human gait. In this work, we explore and study the use of convolutional neural networks (CNN) to automatically learn gait features or representations directly from low-level input raw data (i.e. Gait Energy Image (GEI)). Evaluations on the challenging clothing-invariant gait recognition of OU-ISIR Treadmill dataset B, the experiment results shows that our method can achieve far better performance as compared to hand-crafted feature in conventional state-of-the-art methods with minimal preprocessing knowledge of the problem are required.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131438754","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824711
N. Retdian, T. Shima
Power line noise is one of critical problems in biosensing. Various approaches utilizing both analog and digital techniques has been proposed. However, these approaches need active circuits with wide dynamic range. This paper proposes the use of N-path notch filter as a power line noise filter. However, the notch depth in a conventional N-path notch filter is limited by the number of path. A new N-path notch filter with additional sample-and-hold (S/H) circuit is proposed. Simulation results using 0.18um CMOS process parameter show a more than a 40-dB suppression is achieved using the proposed circuit. Negative resistance is applied to reduce the total capacitance by approximately 90%.
{"title":"Power line noise suppression using N-path notch filter for EEG","authors":"N. Retdian, T. Shima","doi":"10.1109/ISPACS.2016.7824711","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824711","url":null,"abstract":"Power line noise is one of critical problems in biosensing. Various approaches utilizing both analog and digital techniques has been proposed. However, these approaches need active circuits with wide dynamic range. This paper proposes the use of N-path notch filter as a power line noise filter. However, the notch depth in a conventional N-path notch filter is limited by the number of path. A new N-path notch filter with additional sample-and-hold (S/H) circuit is proposed. Simulation results using 0.18um CMOS process parameter show a more than a 40-dB suppression is achieved using the proposed circuit. Negative resistance is applied to reduce the total capacitance by approximately 90%.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129663561","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824713
Kashyap Patel, N. Kurian, N. George
S transform, which is a powerful time frequency analysis method, has found applications in diverse areas of science and technology. The computational load offered by the S transform increases with increase in the length of the time series which is analysed. In an endeavour to reduce the computational load for time series which is sparse in the frequency domain, a new method for S transform computation is proposed in this paper. The new method uses an efficient search method to identify significant frequency indices and computes the S transform only at the selected frequency indices, thus reducing the computational burden. A simulation study has been carried out to test the efficiency of the proposed method for analytic and real-life signals. The proposed scheme has been shown to provide good signal reconstruction accuracy at a reduced computational load.
{"title":"Time frequency analysis: A sparse S transform approach","authors":"Kashyap Patel, N. Kurian, N. George","doi":"10.1109/ISPACS.2016.7824713","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824713","url":null,"abstract":"S transform, which is a powerful time frequency analysis method, has found applications in diverse areas of science and technology. The computational load offered by the S transform increases with increase in the length of the time series which is analysed. In an endeavour to reduce the computational load for time series which is sparse in the frequency domain, a new method for S transform computation is proposed in this paper. The new method uses an efficient search method to identify significant frequency indices and computes the S transform only at the selected frequency indices, thus reducing the computational burden. A simulation study has been carried out to test the efficiency of the proposed method for analytic and real-life signals. The proposed scheme has been shown to provide good signal reconstruction accuracy at a reduced computational load.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114111045","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824709
S. Tachikawa, Hiroki Sanada
This paper presents a novel design method of digital-digital sequence (DDS) for code-diversity systems in direct sequence / code division multiple access (DS/CDMA). In the DDS, both the branch sequences and the composite sequence can be constructed from digital signal, then, the code-diversity can be realized easily. To suppress interference effectively, the design method of arrangement in element sequences is needed for DDS. Sequential rearrangement is operated by evaluation for weight coefficients of diversity branches in training time. Desirable sequence design can be achieved shortly in this method. As a result, considerable improvements of bit error rate(BER) performances are shown by computer simulations.
{"title":"A novel design method of digital-digital sequences in DS/CDMA code-diversity systems","authors":"S. Tachikawa, Hiroki Sanada","doi":"10.1109/ISPACS.2016.7824709","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824709","url":null,"abstract":"This paper presents a novel design method of digital-digital sequence (DDS) for code-diversity systems in direct sequence / code division multiple access (DS/CDMA). In the DDS, both the branch sequences and the composite sequence can be constructed from digital signal, then, the code-diversity can be realized easily. To suppress interference effectively, the design method of arrangement in element sequences is needed for DDS. Sequential rearrangement is operated by evaluation for weight coefficients of diversity branches in training time. Desirable sequence design can be achieved shortly in this method. As a result, considerable improvements of bit error rate(BER) performances are shown by computer simulations.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121300327","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824770
Waralak Chongdarakul
Enhancing heterogeneous distributed computing systems requires effective scheduling approach to achieve high performance and satisfy the clients request. Many scheduling algorithms have been proposed to map and order clients requests running on a suitable processor at the minimum makespan and maximum resource utilization. However, they do not take into account the task scheduling under bounded number of I/O port constraint which is a realistic communications model between client and server. Based on the I/O port constraint, this paper proposes a one I/O port task scheduling using a hybrid heuristicgenetic algorithm to achieve minimum completion time. For practical scenario, web service workflow represented by the Directed Acyclic Graph (DAG) of tasks is implemented as an input task set. The proposed algorithm focuses on sending the clients request of web services and receiving results having minimum makespan and delay. Unlike Genetic Algorithm (GA) providing near optimal results but high time complexity, the proposed approach named Critical Path with Genetic Algorithm (CPGA) incorporates GA to produce the good quality schedule with lower processing time. Preliminary result of fair comparisons with existing scheduling methods shows that the proposed approach outperforms them in terms of minimum makespan and delay.
{"title":"A heuristic-genetic algorithm for client web service scheduling constrained by one I/O port","authors":"Waralak Chongdarakul","doi":"10.1109/ISPACS.2016.7824770","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824770","url":null,"abstract":"Enhancing heterogeneous distributed computing systems requires effective scheduling approach to achieve high performance and satisfy the clients request. Many scheduling algorithms have been proposed to map and order clients requests running on a suitable processor at the minimum makespan and maximum resource utilization. However, they do not take into account the task scheduling under bounded number of I/O port constraint which is a realistic communications model between client and server. Based on the I/O port constraint, this paper proposes a one I/O port task scheduling using a hybrid heuristicgenetic algorithm to achieve minimum completion time. For practical scenario, web service workflow represented by the Directed Acyclic Graph (DAG) of tasks is implemented as an input task set. The proposed algorithm focuses on sending the clients request of web services and receiving results having minimum makespan and delay. Unlike Genetic Algorithm (GA) providing near optimal results but high time complexity, the proposed approach named Critical Path with Genetic Algorithm (CPGA) incorporates GA to produce the good quality schedule with lower processing time. Preliminary result of fair comparisons with existing scheduling methods shows that the proposed approach outperforms them in terms of minimum makespan and delay.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115320293","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
扫码关注我们
求助内容：
应助结果提醒方式：