Pub Date : 2009-09-25DOI: 10.1109/ICICT.2009.5267201
M. Owais
In this paper, we present and compare two-stage type-2 fuzzy logic advisor (FLA) for subjective decision making in the domain of students' performance evaluation. We test our proposed model for evaluating students' performance in our Computer Science and Engineering Department at HBCC/KFUPM in two domains namely cooperating training and capstone/senior project assessment where we find these FLAs very useful and promising. In our proposed model, the assessment criteria for different components of cooperative training and senior project are transformed into linguistic labels and evaluation information is extracted into the form of IF-THEN rules from the experts. These rules are modeled using FLS, which then is used as a fuzzy logic advisor (FLA) to make decisions about students' grades. The evaluator's input for the system can be either singleton or non-singleton. Both type-1 and type-2 fuzzy logic based models are implemented and compared with individual expert's evaluation.
{"title":"Subjective decision making using type-2 fuzzy logic advisor","authors":"M. Owais","doi":"10.1109/ICICT.2009.5267201","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267201","url":null,"abstract":"In this paper, we present and compare two-stage type-2 fuzzy logic advisor (FLA) for subjective decision making in the domain of students' performance evaluation. We test our proposed model for evaluating students' performance in our Computer Science and Engineering Department at HBCC/KFUPM in two domains namely cooperating training and capstone/senior project assessment where we find these FLAs very useful and promising. In our proposed model, the assessment criteria for different components of cooperative training and senior project are transformed into linguistic labels and evaluation information is extracted into the form of IF-THEN rules from the experts. These rules are modeled using FLS, which then is used as a fuzzy logic advisor (FLA) to make decisions about students' grades. The evaluator's input for the system can be either singleton or non-singleton. Both type-1 and type-2 fuzzy logic based models are implemented and compared with individual expert's evaluation.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133083504","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 : 2009-09-25DOI: 10.1109/ICICT.2009.5267220
M. Akram, A. Tariq
The effective cooperation and coordination of nodes is necessary for performance improvement in the P2P network. In this paper, we focus on the problem of maintaining considerable amount of cooperation and friendship in P2P networks of selfish peers. For this purpose we will analyze the performance of SLAC. It is a simple algorithm that maintains excessive levels of cooperation and friendship in a network while performing tasks. A simulation model “Prisoners' Dilemma” is presented that puts this algorithm to work in a Peersim environment. For providing random sampling, an existing protocol called “NEWSCAST” has been used. The extensive computer simulations show that the technique is scalable, robust and decentralized.
{"title":"Cooperative friendship networks through SLAC with Newscast","authors":"M. Akram, A. Tariq","doi":"10.1109/ICICT.2009.5267220","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267220","url":null,"abstract":"The effective cooperation and coordination of nodes is necessary for performance improvement in the P2P network. In this paper, we focus on the problem of maintaining considerable amount of cooperation and friendship in P2P networks of selfish peers. For this purpose we will analyze the performance of SLAC. It is a simple algorithm that maintains excessive levels of cooperation and friendship in a network while performing tasks. A simulation model “Prisoners' Dilemma” is presented that puts this algorithm to work in a Peersim environment. For providing random sampling, an existing protocol called “NEWSCAST” has been used. The extensive computer simulations show that the technique is scalable, robust and decentralized.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122007533","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 : 2009-09-25DOI: 10.1109/ICICT.2009.5267221
Michael Gkion, Muhammad Zeeshan Patoli, A. Al-Barakati, Wei Zhang, Paul F. Newbury, M. White
The increase in ease of the production of computer simulated graphics has opened new opportunities in the 3D industry. There are unlimited applications for the delivery of 3D Graphics especially concerning 3D multimedia presentation of digital content. Apart from aesthetic and entertaining reasons, experts apply computer simulations to visualize environments and to identify early errors or costs in order to limit the need of making real prototypes. Thus, 3D Graphics also minimize the time required for developing the final product. Existing 3D applications give partial support to users to engage in collaborative contribution for the production of a 3D model. However, when 3D artists are required to collaboratively produce a high quality 3D model based on thousands of polygons, they have to integrate the different parts of the model when the modelling process has been completed, which is a slow tedious process. This paper investigates how to dynamically and simultaneously apply changes to the same 3D model based on a collaborative network exploiting a Grid infrastructure.
{"title":"Collaborative 3D digital content creation exploiting a Grid network","authors":"Michael Gkion, Muhammad Zeeshan Patoli, A. Al-Barakati, Wei Zhang, Paul F. Newbury, M. White","doi":"10.1109/ICICT.2009.5267221","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267221","url":null,"abstract":"The increase in ease of the production of computer simulated graphics has opened new opportunities in the 3D industry. There are unlimited applications for the delivery of 3D Graphics especially concerning 3D multimedia presentation of digital content. Apart from aesthetic and entertaining reasons, experts apply computer simulations to visualize environments and to identify early errors or costs in order to limit the need of making real prototypes. Thus, 3D Graphics also minimize the time required for developing the final product. Existing 3D applications give partial support to users to engage in collaborative contribution for the production of a 3D model. However, when 3D artists are required to collaboratively produce a high quality 3D model based on thousands of polygons, they have to integrate the different parts of the model when the modelling process has been completed, which is a slow tedious process. This paper investigates how to dynamically and simultaneously apply changes to the same 3D model based on a collaborative network exploiting a Grid infrastructure.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126939025","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 : 2009-09-25DOI: 10.1109/ICICT.2009.5267204
Sohail Jabbar, A. A. Minhas, Raja Adeel Akhtar
Putting constraints on performance of a system in the temporal domain, some times turns right into wrong and update into outdate. These are the scenarios where apposite value of time inveterate in the reality. But such timing precision not only requires tightly scheduled performance constraints but also requires optimal design and operation of all system components. Any malfunctioning at any relevant aspect may causes a serious disaster and even loss of human lives. Managing and interacting with such real-time system becomes much intricate when the resources are limited as in wireless sensor nodes. A wireless sensor node is typically comprises of sensing unit, processing unit and transmission unit. Intercommunication of these energy, memory and processing constraint devices form wireless sensor network. In this paper, SPERT: a mechanism of approaching the sink from multi-sources in the fast and ef?cient manner, is proposed. It simply relies on in-network processed information which appreciatory decreases too much beacons among neighboring nodes resulting in increasing the network lifetime. More-over, every node is aware of its time to get its message to destination. Thus delay in processing and decision making also decreases leading in favor to real-time communication.
{"title":"SPERT: A stateless protocol for energy-sensitive real-time routing for wireless sensor network","authors":"Sohail Jabbar, A. A. Minhas, Raja Adeel Akhtar","doi":"10.1109/ICICT.2009.5267204","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267204","url":null,"abstract":"Putting constraints on performance of a system in the temporal domain, some times turns right into wrong and update into outdate. These are the scenarios where apposite value of time inveterate in the reality. But such timing precision not only requires tightly scheduled performance constraints but also requires optimal design and operation of all system components. Any malfunctioning at any relevant aspect may causes a serious disaster and even loss of human lives. Managing and interacting with such real-time system becomes much intricate when the resources are limited as in wireless sensor nodes. A wireless sensor node is typically comprises of sensing unit, processing unit and transmission unit. Intercommunication of these energy, memory and processing constraint devices form wireless sensor network. In this paper, SPERT: a mechanism of approaching the sink from multi-sources in the fast and ef?cient manner, is proposed. It simply relies on in-network processed information which appreciatory decreases too much beacons among neighboring nodes resulting in increasing the network lifetime. More-over, every node is aware of its time to get its message to destination. Thus delay in processing and decision making also decreases leading in favor to real-time communication.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126682465","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 : 2009-09-25DOI: 10.1109/ICICT.2009.5267174
Noman Khan, A. Ashraf, B. S. Chowdhry, M. Hashmani
the hybrid optical-wireless broadband network (HOW-B) is shows potential future for healthcare communication systems and networks. The marvel innovations in free space optics (FSO) based wireless communication, medical sensors and mobile network technologies have associated with emerging biological fields of telemedicine and bioinformatics. On the other hand, the progressive developments in optical based wireless technology have opened up a window for life-saving network services. The wireless network along with advance modeling technique of patient-care facilitates in monitoring of the physiological data, the treatment optimization, and continuous patient-care. This provides an improvement of care and quality of patient's life without interrupt circulation in everyday life activity. In this paper, the FSO and RF networks viable connectivity and low-cost optical wireless tele-monitoring network system has been introduced. In addition, it provides review of the interoperability and QoS assurance issue, also compare various feature of optical wireless with (RF) wireless network.
{"title":"Survey of challenges in hybrid optical wireless broadband network (HOW-B) for e-health systems","authors":"Noman Khan, A. Ashraf, B. S. Chowdhry, M. Hashmani","doi":"10.1109/ICICT.2009.5267174","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267174","url":null,"abstract":"the hybrid optical-wireless broadband network (HOW-B) is shows potential future for healthcare communication systems and networks. The marvel innovations in free space optics (FSO) based wireless communication, medical sensors and mobile network technologies have associated with emerging biological fields of telemedicine and bioinformatics. On the other hand, the progressive developments in optical based wireless technology have opened up a window for life-saving network services. The wireless network along with advance modeling technique of patient-care facilitates in monitoring of the physiological data, the treatment optimization, and continuous patient-care. This provides an improvement of care and quality of patient's life without interrupt circulation in everyday life activity. In this paper, the FSO and RF networks viable connectivity and low-cost optical wireless tele-monitoring network system has been introduced. In addition, it provides review of the interoperability and QoS assurance issue, also compare various feature of optical wireless with (RF) wireless network.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122224480","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 : 2009-09-25DOI: 10.1109/ICICT.2009.5267182
M. Iqbal, U. S. Awan
Reconfigurable Instruction Set Processors are the next generation processors which can adapt their instruction sets through a reconfiguration process in their hardware according to the demand of the application being under execution on them. In this way the processors adapt the hardware which is the most suitable solution for the running application and hence it accelerates the performance gain. The reconfigurable instruction set processors are programmable processors that contain the reconfigurable logic in one or more of their functional units. Among the most important design parameters are: the granularity of the reconfigurable logic, the structure of the configuration memory, the instructions encoding formats and the types of instructions supported. In this research paper a reconfigurable instruction set processor design has been introduced by using the tightly coupled reconfigurable cores. The proposed design is capable of loading partial configurations at run-time without disturbing the execution of running application. The proposed processor supports the demand driven modification of its instruction set. Implemented with partially reconfigurable field programmable gate array cores like those provided by Xilinx corporation, the processor treats the instructions as removable modules that are paged in and paged out through the partial reconfiguration as is demanded by the running application.
{"title":"RISP design using tightly coupled reconfigurable FPGA cores","authors":"M. Iqbal, U. S. Awan","doi":"10.1109/ICICT.2009.5267182","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267182","url":null,"abstract":"Reconfigurable Instruction Set Processors are the next generation processors which can adapt their instruction sets through a reconfiguration process in their hardware according to the demand of the application being under execution on them. In this way the processors adapt the hardware which is the most suitable solution for the running application and hence it accelerates the performance gain. The reconfigurable instruction set processors are programmable processors that contain the reconfigurable logic in one or more of their functional units. Among the most important design parameters are: the granularity of the reconfigurable logic, the structure of the configuration memory, the instructions encoding formats and the types of instructions supported. In this research paper a reconfigurable instruction set processor design has been introduced by using the tightly coupled reconfigurable cores. The proposed design is capable of loading partial configurations at run-time without disturbing the execution of running application. The proposed processor supports the demand driven modification of its instruction set. Implemented with partially reconfigurable field programmable gate array cores like those provided by Xilinx corporation, the processor treats the instructions as removable modules that are paged in and paged out through the partial reconfiguration as is demanded by the running application.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130119727","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 : 2009-09-25DOI: 10.1109/ICICT.2009.5267212
M. A. Azam, Zaka-Ul-Mustafa, Usman Tahir, S. Ahsan, Muhammad Naseem, Imran Rashid, M. Adeel
Authentication, access Control, encryption and auditing make up the essential elements of network security. Researchers have dedicated a large amount of efforts to implement security features that fully incorporate the use of all these elements. Currently, data networks mainly provide authentication and confidentiality services. Confidentiality alone is not able to protect the system, thus, suitable security measures must be taken. However, this security is itself an overhead which must be accounted for. A trade-off must exist between performance and security. This trade-off must be carefully managed so as not to deteriorate the systems being secured. This calls for the true cost of security to be accurately measured. This research work measures the overheads involved in implementation of security using IPSec in different wired/wireless data network protocols.
{"title":"Overhead analysis of security implementation using IPSec","authors":"M. A. Azam, Zaka-Ul-Mustafa, Usman Tahir, S. Ahsan, Muhammad Naseem, Imran Rashid, M. Adeel","doi":"10.1109/ICICT.2009.5267212","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267212","url":null,"abstract":"Authentication, access Control, encryption and auditing make up the essential elements of network security. Researchers have dedicated a large amount of efforts to implement security features that fully incorporate the use of all these elements. Currently, data networks mainly provide authentication and confidentiality services. Confidentiality alone is not able to protect the system, thus, suitable security measures must be taken. However, this security is itself an overhead which must be accounted for. A trade-off must exist between performance and security. This trade-off must be carefully managed so as not to deteriorate the systems being secured. This calls for the true cost of security to be accurately measured. This research work measures the overheads involved in implementation of security using IPSec in different wired/wireless data network protocols.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127643199","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 : 2009-09-25DOI: 10.1109/ICICT.2009.5267192
Z. Riaz, M. Beetz, B. Radig
This paper describes an image segmentation and normalization technique using 3D point distribution model and its counterpart in 2D space. This segmentation is efficient to work for holistic image recognition algorithm. The results have been tested with face recognition application using Cohn Kanade Facial Expressions Database (CKFED). The approach follows by fitting a model to face image and registering it to a standard template. The models consist of distribution of points in 2D and 3D. We extract a set of feature vectors from normalized images using principal components analysis and using them for a binary decision tree for classification. A promising recognition rate of up to 98.75% has been achieved using 3D model and 92.93% using 2D model emphasizing the goodness of our normalization. The experiments have been performed on more than 3500 face images of the database. This algorithm is capable to work in real time in the presence of facial expressions.
{"title":"Image normalization for face recognition using 3D model","authors":"Z. Riaz, M. Beetz, B. Radig","doi":"10.1109/ICICT.2009.5267192","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267192","url":null,"abstract":"This paper describes an image segmentation and normalization technique using 3D point distribution model and its counterpart in 2D space. This segmentation is efficient to work for holistic image recognition algorithm. The results have been tested with face recognition application using Cohn Kanade Facial Expressions Database (CKFED). The approach follows by fitting a model to face image and registering it to a standard template. The models consist of distribution of points in 2D and 3D. We extract a set of feature vectors from normalized images using principal components analysis and using them for a binary decision tree for classification. A promising recognition rate of up to 98.75% has been achieved using 3D model and 92.93% using 2D model emphasizing the goodness of our normalization. The experiments have been performed on more than 3500 face images of the database. This algorithm is capable to work in real time in the presence of facial expressions.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128125028","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 : 2009-09-25DOI: 10.1109/ICICT.2009.5267175
S. Khalid, A. Basharat, A. A. Shahid, Syed Ali Hassan
To address the ever increasing need and challenges associated with improving the state of web-based education, a synergistic view of E-Learning and intelligent and adaptive tutoring is adapted which is the basic essence of the learner centered Adaptive E-learning Framework presented in this paper. This framework aims to provide a complete environment of online learning. The conceptual architecture of the framework presented in this paper is centered around the following core features: (1) Domain Specific Learning Services (2) Student Capability Analysis (3) Adaptive Lecture Authoring Tool and Notification Manager (4) Intelligent Assessment Engine (5) User Friendly E-Learning Portal. Altogether, this framework is truly aimed to be an integrated platform consistent with the emerging needs of E-learning and Distance Education.
{"title":"An adaptive E-learning Framework to supporting new ways of teaching and learning","authors":"S. Khalid, A. Basharat, A. A. Shahid, Syed Ali Hassan","doi":"10.1109/ICICT.2009.5267175","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267175","url":null,"abstract":"To address the ever increasing need and challenges associated with improving the state of web-based education, a synergistic view of E-Learning and intelligent and adaptive tutoring is adapted which is the basic essence of the learner centered Adaptive E-learning Framework presented in this paper. This framework aims to provide a complete environment of online learning. The conceptual architecture of the framework presented in this paper is centered around the following core features: (1) Domain Specific Learning Services (2) Student Capability Analysis (3) Adaptive Lecture Authoring Tool and Notification Manager (4) Intelligent Assessment Engine (5) User Friendly E-Learning Portal. Altogether, this framework is truly aimed to be an integrated platform consistent with the emerging needs of E-learning and Distance Education.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"220 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121462754","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 : 2009-09-25DOI: 10.1109/ICICT.2009.5267209
Asgarali Bouyer, M. N. MD SAP, A. Abdullah
Since the Grid is a dynamic environment, the prediction and detection of available resources in near future is important for resource scheduling. Economic-based grid management has been viewed as a feasible approach to carry out fair, efficient and reliable scheduling. One key issue in Economic-based grid strategy is to inform about available resources. In this paper, we present a novel predictable method to specify available resource in economic-based grid. This method use a rough set analysis by scheduler to divide resources in groups and then grant a priority to each group based on cost price and efficiency of nodes. The result show that our proposed method has an acceptable performance and it try to use cheaper and suitable resources for each job to decrease cost price of computation.
{"title":"A new rough set based approach for optimized detection of available resources in Grid computing","authors":"Asgarali Bouyer, M. N. MD SAP, A. Abdullah","doi":"10.1109/ICICT.2009.5267209","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267209","url":null,"abstract":"Since the Grid is a dynamic environment, the prediction and detection of available resources in near future is important for resource scheduling. Economic-based grid management has been viewed as a feasible approach to carry out fair, efficient and reliable scheduling. One key issue in Economic-based grid strategy is to inform about available resources. In this paper, we present a novel predictable method to specify available resource in economic-based grid. This method use a rough set analysis by scheduler to divide resources in groups and then grant a priority to each group based on cost price and efficiency of nodes. The result show that our proposed method has an acceptable performance and it try to use cheaper and suitable resources for each job to decrease cost price of computation.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125792921","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
扫码关注我们
求助内容：
应助结果提醒方式：