Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723848
Yasmin Jahir, Mohammed Atiquzzaman, H. Refai, P. Lopresti
Mobile Ad hoc networks (MANETs) are composed of a collection of independent nodes usually connected by low bandwidth Radio Frequency (RF) links which are challenging for transmitting video and high bandwidth applications for rescue workers in emergency situations. Earlier we proposed a routing protocol, called AODVH to use for high bandwidth communication for search and rescue operations in a disaster area which consists of hybrid nodes using Free Space Optical (FSO) and RF links, with FSO being the primary link and RF as backup in the case of failure of “FSO only” paths. The objective of this paper is to evaluate the performance of AODVH using ns-2 simulations with varying network size and compare with three other Ad hoc routing protocols. We also implemented and tested AODVH in the laboratory using a testbed consisting of Linux based Ad hoc nodes. Results show that AODVH performs better in terms of packet loss, end-to-end delay, overhead, packet delivery ratio, route discovery frequency and throughput when compared to with the other three protocols.
{"title":"Performance evaluation of AODVH: An Ad hoc networking scheme for hybrid nodes","authors":"Yasmin Jahir, Mohammed Atiquzzaman, H. Refai, P. Lopresti","doi":"10.1109/ICCITECHN.2010.5723848","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723848","url":null,"abstract":"Mobile Ad hoc networks (MANETs) are composed of a collection of independent nodes usually connected by low bandwidth Radio Frequency (RF) links which are challenging for transmitting video and high bandwidth applications for rescue workers in emergency situations. Earlier we proposed a routing protocol, called AODVH to use for high bandwidth communication for search and rescue operations in a disaster area which consists of hybrid nodes using Free Space Optical (FSO) and RF links, with FSO being the primary link and RF as backup in the case of failure of “FSO only” paths. The objective of this paper is to evaluate the performance of AODVH using ns-2 simulations with varying network size and compare with three other Ad hoc routing protocols. We also implemented and tested AODVH in the laboratory using a testbed consisting of Linux based Ad hoc nodes. Results show that AODVH performs better in terms of packet loss, end-to-end delay, overhead, packet delivery ratio, route discovery frequency and throughput when compared to with the other three protocols.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122847420","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723900
Hayder Ali, Y. Ali, Eklas Hossain, S. Sultana
The objective of this project is to build a character recognition system, which is able to recognize printed and handwritten character from A to Z. the typical optical character recognition systems, regardless the character's nature, are based mainly on three stages, preprocessing, features extraction, and discrimination. Each stage has its own problems and effects on the system efficiency which is the time consuming and the recognition errors. In order to avoid these difficulties this project presents new construction of character recognition tool using the technique similar to that is used in image compression such as wavelet compression or JPEG compression. Wavelet compression is chosen as the technique implemented for this project. Wavelet compression technique extracted the important coefficient from the images. The Euclidean distance between the coefficient of the test images and training images is computed. Character is considered recognized if the Euclidean distance calculated is smaller than the Global threshold value of 258. This character recognition system also has 18.81% of false rejection rate and 21.88% for false acceptance rate.
{"title":"Character recognition using wavelet compression","authors":"Hayder Ali, Y. Ali, Eklas Hossain, S. Sultana","doi":"10.1109/ICCITECHN.2010.5723900","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723900","url":null,"abstract":"The objective of this project is to build a character recognition system, which is able to recognize printed and handwritten character from A to Z. the typical optical character recognition systems, regardless the character's nature, are based mainly on three stages, preprocessing, features extraction, and discrimination. Each stage has its own problems and effects on the system efficiency which is the time consuming and the recognition errors. In order to avoid these difficulties this project presents new construction of character recognition tool using the technique similar to that is used in image compression such as wavelet compression or JPEG compression. Wavelet compression is chosen as the technique implemented for this project. Wavelet compression technique extracted the important coefficient from the images. The Euclidean distance between the coefficient of the test images and training images is computed. Character is considered recognized if the Euclidean distance calculated is smaller than the Global threshold value of 258. This character recognition system also has 18.81% of false rejection rate and 21.88% for false acceptance rate.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123163602","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723886
G. M. M. Bashir, Md. Golam Rabiul Alam, Mahabub Sikder, Md. Milon Gazi
In this paper the authors have shown the ebb and flow of subscribers of different cell operators in Bangladesh based on their call rate, network, and other external facilities and suggests a new approach for the constituency of these operators to find out how all the operators can ensure customer satisfaction. Performance of a cellular system mainly depends on circuit merits (CM) of voice quality, service quality, special feature such as call waiting, voice stored box, automatic roaming and other opportunities. In the recent year cellular communication has been explored tremendously in Bangladesh. Existing six mobile operators plays a vital role in our social and economical life. So every operator should be careful about their call rate, network & other external facilities.
{"title":"Subscribers fluctuations of different cell operators based on different offers","authors":"G. M. M. Bashir, Md. Golam Rabiul Alam, Mahabub Sikder, Md. Milon Gazi","doi":"10.1109/ICCITECHN.2010.5723886","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723886","url":null,"abstract":"In this paper the authors have shown the ebb and flow of subscribers of different cell operators in Bangladesh based on their call rate, network, and other external facilities and suggests a new approach for the constituency of these operators to find out how all the operators can ensure customer satisfaction. Performance of a cellular system mainly depends on circuit merits (CM) of voice quality, service quality, special feature such as call waiting, voice stored box, automatic roaming and other opportunities. In the recent year cellular communication has been explored tremendously in Bangladesh. Existing six mobile operators plays a vital role in our social and economical life. So every operator should be careful about their call rate, network & other external facilities.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121568331","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723906
M. Salam, D. Mohamad, S. Salleh
Divergence algorithm is a statistical segmentation approach which finds segmentation point via detection of abrupt changes without any previous information of the acoustic signal. The approach could get high match of segmentation but also gives a lot of false segmentation points. This work introduced a property based on the usage of Zero Crossing Rate (ZCR) in enhancing segmentation by divergence algorithm. The work starts via optimizing divergence algorithm segmentation performance via parameters tuning. Then the proposed property based on ZCR is applied to divergence algorithm to reduce insertion points. The results of tuning divergence parameters achieved match rate of 99.4% at time tolerance of 0.09 seconds with 69% insertion rate occurrences in comparisons to reference points. The result in applying the introduced ZCR property to divergence algorithm shows that tuning of some ZCR property parameters could reduce insertion between 4% to 45%. However, it would also reduce the match rate. Nevertheless, the method could reduced insertion rate by 5.5% while maintaining match rate of 99.4%.
{"title":"Speech segmentation using divergence algorithm with Zero Crossing property","authors":"M. Salam, D. Mohamad, S. Salleh","doi":"10.1109/ICCITECHN.2010.5723906","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723906","url":null,"abstract":"Divergence algorithm is a statistical segmentation approach which finds segmentation point via detection of abrupt changes without any previous information of the acoustic signal. The approach could get high match of segmentation but also gives a lot of false segmentation points. This work introduced a property based on the usage of Zero Crossing Rate (ZCR) in enhancing segmentation by divergence algorithm. The work starts via optimizing divergence algorithm segmentation performance via parameters tuning. Then the proposed property based on ZCR is applied to divergence algorithm to reduce insertion points. The results of tuning divergence parameters achieved match rate of 99.4% at time tolerance of 0.09 seconds with 69% insertion rate occurrences in comparisons to reference points. The result in applying the introduced ZCR property to divergence algorithm shows that tuning of some ZCR property parameters could reduce insertion between 4% to 45%. However, it would also reduce the match rate. Nevertheless, the method could reduced insertion rate by 5.5% while maintaining match rate of 99.4%.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116348534","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723902
S. Algoul, M. Alam, M. A. Hossain, M. Majumder
This paper presents a multi-drug chemotherapy scheduling method for cancer treatment using multi-objective optimisation technique. Cancer cells, very often, grows resistance to a drug if it is administered alone for a long time and drug resistance eventually causes failure to treatment in most cases. The adaptation of multi-drug treatment in cancer increases the drug performance by reducing the drug resistance. But care must be taken to design the multi-drug scheduling so as to equilibrium the drug beneficial and adverse side effects of the treatment. Conventional clinical methods can hardly find optimum dosages of drugs that can kill maximum cancerous cells with minimum toxic side effects. This is because of the inherent conflict between the cell killing and the toxic side effects in case of cancer. This paper presents a novel method of multi-drug scheduling using multi-objective genetic algorithm (MOGA) that can trading-off between the cell killing and toxic side effects during the whole period of treatment. A close-loop control method, namely Integral-Proportional-Derivative (I-PD) is designed to control dosages of drugs to be infused to the patient's body and MOGA is used to find suitable/acceptable parameters of the controller. A cell compartments model is developed and used to describe the effects of the drugs on different type of cells, plasma drug concentration and toxic side effects. Results show that drug scheduling obtained through the proposed method can reduce the tumour size more than 99% with relatively lower toxic side effects. Moreover, the drug dosage and drug concentration remain at low level throughout the whole period.
{"title":"Multi-objective optimisation for multi-drug chemotherapy scheduling","authors":"S. Algoul, M. Alam, M. A. Hossain, M. Majumder","doi":"10.1109/ICCITECHN.2010.5723902","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723902","url":null,"abstract":"This paper presents a multi-drug chemotherapy scheduling method for cancer treatment using multi-objective optimisation technique. Cancer cells, very often, grows resistance to a drug if it is administered alone for a long time and drug resistance eventually causes failure to treatment in most cases. The adaptation of multi-drug treatment in cancer increases the drug performance by reducing the drug resistance. But care must be taken to design the multi-drug scheduling so as to equilibrium the drug beneficial and adverse side effects of the treatment. Conventional clinical methods can hardly find optimum dosages of drugs that can kill maximum cancerous cells with minimum toxic side effects. This is because of the inherent conflict between the cell killing and the toxic side effects in case of cancer. This paper presents a novel method of multi-drug scheduling using multi-objective genetic algorithm (MOGA) that can trading-off between the cell killing and toxic side effects during the whole period of treatment. A close-loop control method, namely Integral-Proportional-Derivative (I-PD) is designed to control dosages of drugs to be infused to the patient's body and MOGA is used to find suitable/acceptable parameters of the controller. A cell compartments model is developed and used to describe the effects of the drugs on different type of cells, plasma drug concentration and toxic side effects. Results show that drug scheduling obtained through the proposed method can reduce the tumour size more than 99% with relatively lower toxic side effects. Moreover, the drug dosage and drug concentration remain at low level throughout the whole period.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127652371","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723829
Kazi Shah Nawaz Ripon, K. Glette, M. Høvin, J. Tørresen
In many real-world applications, the accurate number of clusters in the data set may be unknown in advance. In addition, clustering criteria are usually high dimensional, nonlinear and multi-model functions and most existing clustering algorithms are only able to achieve a clustering solution that locally optimizes them. Therefore, a single clustering criterion sometimes fails to identify all clusters in a data set successfully. This paper presents a novel multi-objective evolutionary clustering algorithm based on adaptive local search that mitigates the above disadvantages of existing clustering algorithms. Unlike the conventional local search, the proposed adaptive local search scheme automatically determines whether local search is used in an evolutionary cycle or not. Experimental results on several artificial and real data sets demonstrate that the proposed algorithm can identify the accurate number of clusters in the data sets automatically and simultaneously achieves a high quality clustering solution. The superiority of the proposed algorithm over some single-objective clustering algorithms and existing multi-objective evolutionary clustering algorithms is also confirmed by the experimental results.
{"title":"Evolutionary multi-objective clustering with adaptive local search","authors":"Kazi Shah Nawaz Ripon, K. Glette, M. Høvin, J. Tørresen","doi":"10.1109/ICCITECHN.2010.5723829","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723829","url":null,"abstract":"In many real-world applications, the accurate number of clusters in the data set may be unknown in advance. In addition, clustering criteria are usually high dimensional, nonlinear and multi-model functions and most existing clustering algorithms are only able to achieve a clustering solution that locally optimizes them. Therefore, a single clustering criterion sometimes fails to identify all clusters in a data set successfully. This paper presents a novel multi-objective evolutionary clustering algorithm based on adaptive local search that mitigates the above disadvantages of existing clustering algorithms. Unlike the conventional local search, the proposed adaptive local search scheme automatically determines whether local search is used in an evolutionary cycle or not. Experimental results on several artificial and real data sets demonstrate that the proposed algorithm can identify the accurate number of clusters in the data sets automatically and simultaneously achieves a high quality clustering solution. The superiority of the proposed algorithm over some single-objective clustering algorithms and existing multi-objective evolutionary clustering algorithms is also confirmed by the experimental results.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128009605","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723882
Md. Kafil Uddin, M. Kamal Hossen
This paper presents a prototype implementation of an intelligent system called safe system that monitors container security in the port logistics. Logistics supports in the port require safe container status. The main focus of our contribution is to design a system that supports RFID (Radio Frequency Identification) Readers of all types (such as Reader Protocol complaint and vendor provided Readers), real time monitoring of sensing information and notify management about the status of the container in harbor logistics.
{"title":"A safe system with safe logistics support for Chittagong Port","authors":"Md. Kafil Uddin, M. Kamal Hossen","doi":"10.1109/ICCITECHN.2010.5723882","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723882","url":null,"abstract":"This paper presents a prototype implementation of an intelligent system called safe system that monitors container security in the port logistics. Logistics supports in the port require safe container status. The main focus of our contribution is to design a system that supports RFID (Radio Frequency Identification) Readers of all types (such as Reader Protocol complaint and vendor provided Readers), real time monitoring of sensing information and notify management about the status of the container in harbor logistics.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134575163","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723926
A.K.M. Nazmus Sakib, M. M. S. Kowsar
As a promising broadband wireless technology, WiMAX has many salient advantages over such as: high data rates, quality of service, scalability, security and mobility. Many sophisticated authentication and encryption techniques have been embedded into WiMAX but it still facing a lot of challenging situations. This paper shows different security vulnerabilities found in IEEE 802.16e and gives possible solutions to eliminate them. These vulnerabilities are the possibilities to forge key messages in Multi- and Broadcast operation, some unauthenticated messages which are susceptible to forgery and the unencrypted management communication which reveals important management information. We modify DH key exchange protocol to fit it into mobile WiMAX network as well as eliminate existing weakness in original DH key exchange protocol.
{"title":"Shared key vulnerability in IEEE 802.16e: Analysis & solution","authors":"A.K.M. Nazmus Sakib, M. M. S. Kowsar","doi":"10.1109/ICCITECHN.2010.5723926","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723926","url":null,"abstract":"As a promising broadband wireless technology, WiMAX has many salient advantages over such as: high data rates, quality of service, scalability, security and mobility. Many sophisticated authentication and encryption techniques have been embedded into WiMAX but it still facing a lot of challenging situations. This paper shows different security vulnerabilities found in IEEE 802.16e and gives possible solutions to eliminate them. These vulnerabilities are the possibilities to forge key messages in Multi- and Broadcast operation, some unauthenticated messages which are susceptible to forgery and the unencrypted management communication which reveals important management information. We modify DH key exchange protocol to fit it into mobile WiMAX network as well as eliminate existing weakness in original DH key exchange protocol.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114632825","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723903
M. Islam, M. Karim
The paper proposes a new technology to ensure enhanced security of personal identification information or binary images through the use of encryption and multiplexing processes. Orthogonal codes are employed to encrypt the given input images so that multiple encoded images can then be mixed together to save storage space or transmission bandwidth. The multiplexed and encoded image is further encrypted employing multiple reference-based joint transform correlation. The address code is fed into four channels after performing phase shifting on them by different amount. The input image is introduced to the channels to obtain joint power spectra (JPS) signals through Fourier transformation. The resultant signals are phase-shifted and then combined to form a modified JPS signal which is then inverse Fourier transformed to yield the final and highly secure encrypted image. At the receiver, the image is Fourier transformed and multiplied by the address code used in encryption. Inverse Fourier transformation yields the multiplexed and encoded image which is then decoded using orthogonal codes. The proposed technique enhances the security performance by implementing orthogonal coding and nonlinear encryption algorithms so that no unauthorized access to or interception of information is possible. Performance of the technique is evaluated through computer simulation.
{"title":"Optical encryption system employing orthogonal code and multiple reference-based joint transform correlation","authors":"M. Islam, M. Karim","doi":"10.1109/ICCITECHN.2010.5723903","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723903","url":null,"abstract":"The paper proposes a new technology to ensure enhanced security of personal identification information or binary images through the use of encryption and multiplexing processes. Orthogonal codes are employed to encrypt the given input images so that multiple encoded images can then be mixed together to save storage space or transmission bandwidth. The multiplexed and encoded image is further encrypted employing multiple reference-based joint transform correlation. The address code is fed into four channels after performing phase shifting on them by different amount. The input image is introduced to the channels to obtain joint power spectra (JPS) signals through Fourier transformation. The resultant signals are phase-shifted and then combined to form a modified JPS signal which is then inverse Fourier transformed to yield the final and highly secure encrypted image. At the receiver, the image is Fourier transformed and multiplied by the address code used in encryption. Inverse Fourier transformation yields the multiplexed and encoded image which is then decoded using orthogonal codes. The proposed technique enhances the security performance by implementing orthogonal coding and nonlinear encryption algorithms so that no unauthorized access to or interception of information is possible. Performance of the technique is evaluated through computer simulation.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125442187","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723887
T. Jensen, Shakil Ahmed
Over the last decade many but totally different Total Cost of Ownership reports were generated for a same system. It was even more puzzling since most of the times these reports were sponsored by the vendors themselves. There is more or less a war between Windows and Linux about which one has the best TCO. It is highly likely that the generated TCO is based on vendors' feelings for their operating system rather than the exact calculated costs. In the research a novel mathematical model as well as a tool is developed which can be used as standard for creating reliable TCO reports for server operating systems.
{"title":"TCO model for server operating system","authors":"T. Jensen, Shakil Ahmed","doi":"10.1109/ICCITECHN.2010.5723887","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723887","url":null,"abstract":"Over the last decade many but totally different Total Cost of Ownership reports were generated for a same system. It was even more puzzling since most of the times these reports were sponsored by the vendors themselves. There is more or less a war between Windows and Linux about which one has the best TCO. It is highly likely that the generated TCO is based on vendors' feelings for their operating system rather than the exact calculated costs. In the research a novel mathematical model as well as a tool is developed which can be used as standard for creating reliable TCO reports for server operating systems.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124803723","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
扫码关注我们
求助内容：
应助结果提醒方式：