Hamidreza Dastmalchi, Javad Jafaryahya, Reza Najafi, A. Daneshkhah
Face recognition is a non-contact biometric identification that tries to verify individuals automatically based on their images. Computational time and accuracy rate are important aspects to be considered for Face Recognition systems. Huasdorff distance is a dissimilarity measurement between two point sets which has been increasingly used for face recognition. In this paper, we have proposed a modified criterion based on Hausdorff distance, which conspicuously decreases the excessive computational time while increases the recognition rate of conventional face recognition methods, based on Hausdorff distance.
{"title":"Averaged Segmental Partial Hausdorff Distance for Robust Face Recognition","authors":"Hamidreza Dastmalchi, Javad Jafaryahya, Reza Najafi, A. Daneshkhah","doi":"10.1109/ISMS.2011.16","DOIUrl":"https://doi.org/10.1109/ISMS.2011.16","url":null,"abstract":"Face recognition is a non-contact biometric identification that tries to verify individuals automatically based on their images. Computational time and accuracy rate are important aspects to be considered for Face Recognition systems. Huasdorff distance is a dissimilarity measurement between two point sets which has been increasingly used for face recognition. In this paper, we have proposed a modified criterion based on Hausdorff distance, which conspicuously decreases the excessive computational time while increases the recognition rate of conventional face recognition methods, based on Hausdorff distance.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"287 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115129451","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}
Md. Nazmus Sakib, S. Alam, A. Sazzad, C. Shahnaz, S. Fattah
Digital watermarking is the newfangled idea in digital media. As the replication and modification of digital media content is done frequently and without any significant obstruction, secrecy and authenticity become vulnerable to attacks. In the information hiding community digital watermarking has achieved immense popularity due to its righteous stronghold against piracy and non-repudiation. Many watermarking algorithm has been developed in recent years. From the context of the purposes, as they serve, they differ from each other. Here we propose some basic algorithms of digital watermarking technique using LSB (Least Significant Bit) and DCT (Discrete Cosine Transformation).
{"title":"A Basic Digital Watermarking Algorithm in Discrete Cosine Transformation Domain","authors":"Md. Nazmus Sakib, S. Alam, A. Sazzad, C. Shahnaz, S. Fattah","doi":"10.1109/ISMS.2011.72","DOIUrl":"https://doi.org/10.1109/ISMS.2011.72","url":null,"abstract":"Digital watermarking is the newfangled idea in digital media. As the replication and modification of digital media content is done frequently and without any significant obstruction, secrecy and authenticity become vulnerable to attacks. In the information hiding community digital watermarking has achieved immense popularity due to its righteous stronghold against piracy and non-repudiation. Many watermarking algorithm has been developed in recent years. From the context of the purposes, as they serve, they differ from each other. Here we propose some basic algorithms of digital watermarking technique using LSB (Least Significant Bit) and DCT (Discrete Cosine Transformation).","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125031414","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 paper, imperialist competitive algorithm is applied to the problem of finding the optimum value for an online PI controller. The objective is to design an adaptive controller for temperature control of non-isothermal reactor with respect to the set point variations. The gain scheduling method is employed to construct an online PI controller. The PI controller is designed in such a way that it minimizes the sum of square error. Fixed gain PI controllers are also implemented on process plant. The results among former method and non-dynamic approaches when compared indicated that the proposed model offers a remarkable performance.
{"title":"Application of Imperialist Competitive Algorithm in Online PI Controller","authors":"M. A. Movahed, A. Yazdani","doi":"10.1109/ISMS.2011.23","DOIUrl":"https://doi.org/10.1109/ISMS.2011.23","url":null,"abstract":"In this paper, imperialist competitive algorithm is applied to the problem of finding the optimum value for an online PI controller. The objective is to design an adaptive controller for temperature control of non-isothermal reactor with respect to the set point variations. The gain scheduling method is employed to construct an online PI controller. The PI controller is designed in such a way that it minimizes the sum of square error. Fixed gain PI controllers are also implemented on process plant. The results among former method and non-dynamic approaches when compared indicated that the proposed model offers a remarkable performance.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122080867","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 paper, discrete event simulation by batch-means of a M/M/∞ queuing system is utilised to simulate a cellular CDMA system. The details of the simulation model, warm-up period, and simulation run time are discussed. The warm-up period is studied because it affects the accuracy of the results in simulation of communication systems. During the warm-up period-when the simulation system has not reached the steady-state situation-, the system results (eg blocking probability) vary very rapidly from zero to 0.037 for the parameters used. In the batch-means method with 10,000 calls per batch and for 50 batches (500,000 calls), the CDMA blocking probability is 0.0192 with 99% confidence interval.
{"title":"Simulation Model, Warm-up Period, and Simulation Length of Cellular Systems","authors":"S. S. Kolahi","doi":"10.1109/ISMS.2011.63","DOIUrl":"https://doi.org/10.1109/ISMS.2011.63","url":null,"abstract":"In this paper, discrete event simulation by batch-means of a M/M/∞ queuing system is utilised to simulate a cellular CDMA system. The details of the simulation model, warm-up period, and simulation run time are discussed. The warm-up period is studied because it affects the accuracy of the results in simulation of communication systems. During the warm-up period-when the simulation system has not reached the steady-state situation-, the system results (eg blocking probability) vary very rapidly from zero to 0.037 for the parameters used. In the batch-means method with 10,000 calls per batch and for 50 batches (500,000 calls), the CDMA blocking probability is 0.0192 with 99% confidence interval.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128332844","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}
This research study stress upon the qualified or comparative analysis between commercial and non-commercial Enterprise Service Buses (ESB) for large-scale organizations. We have used Multi Criteria Decision Analysis (MCDA) method known as Analytical Hierarchy Process (AHP) based on three criteria i.e. Information Security, Interoperability & High availability. Many comparative analysis reports and papers are available having proven results of comparing non-commercial ESB(s), however, very few reports were found having performed their analysis on commercial ESB(s). We have performed this analysis on the basis of tabular and mathematical proofs by comparing commercially known ESB i.e. Oracle ESB with two non-commercial yet very famous ESB(s) i.e. Mule & Fuse. This research analysis will motivate decision makers to choose the best rated ESB on the basis of our criteria. To achieve our objective we have presented the problem as hierarchy, established the priorities, criteria and performed mathematical computing to prove our analysis.
{"title":"Qualified Analysis b/w ESB(s) Using Analytical Hierarchy Process (AHP) Method","authors":"Zeeshan Siddiqui, A. Abdullah, M. Khan","doi":"10.1109/ISMS.2011.25","DOIUrl":"https://doi.org/10.1109/ISMS.2011.25","url":null,"abstract":"This research study stress upon the qualified or comparative analysis between commercial and non-commercial Enterprise Service Buses (ESB) for large-scale organizations. We have used Multi Criteria Decision Analysis (MCDA) method known as Analytical Hierarchy Process (AHP) based on three criteria i.e. Information Security, Interoperability & High availability. Many comparative analysis reports and papers are available having proven results of comparing non-commercial ESB(s), however, very few reports were found having performed their analysis on commercial ESB(s). We have performed this analysis on the basis of tabular and mathematical proofs by comparing commercially known ESB i.e. Oracle ESB with two non-commercial yet very famous ESB(s) i.e. Mule & Fuse. This research analysis will motivate decision makers to choose the best rated ESB on the basis of our criteria. To achieve our objective we have presented the problem as hierarchy, established the priorities, criteria and performed mathematical computing to prove our analysis.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128126065","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 paper we introduced a new enterprise architecture as NSSA for the establishment of networks without any infrastructure. Enterprise architecture is the following general structure planning system using information technology to optimize IT strategies to achieve business direction leads. In this architecture we use a component in this architecture, it’s a framework of organizational architecture framework as C4ISR (Command, Control, Communications, Computer, intelligence, Surveillance and Detection) and other component it’s wireless network infrastructure as Ad-Hoc networks: in this model we can use wireless networks, using data transmission by radio wave, in the simplest case, the hardware equipment allows without of physical platforms such as cable and wire, together to communicate any data. In this enterprise architecture we introduced NSSA as a new framework to use AGC4ISR architecture by mapping of Zachman Framework.
{"title":"NSSA: A New Enterprise Architecture for Network Setup without Any Network Infrastructure","authors":"M. Bahrami, Marziyeh Shahrazadfard, Tooba Kerdkar","doi":"10.1109/ISMS.2011.71","DOIUrl":"https://doi.org/10.1109/ISMS.2011.71","url":null,"abstract":"In this paper we introduced a new enterprise architecture as NSSA for the establishment of networks without any infrastructure. Enterprise architecture is the following general structure planning system using information technology to optimize IT strategies to achieve business direction leads. In this architecture we use a component in this architecture, it’s a framework of organizational architecture framework as C4ISR (Command, Control, Communications, Computer, intelligence, Surveillance and Detection) and other component it’s wireless network infrastructure as Ad-Hoc networks: in this model we can use wireless networks, using data transmission by radio wave, in the simplest case, the hardware equipment allows without of physical platforms such as cable and wire, together to communicate any data. In this enterprise architecture we introduced NSSA as a new framework to use AGC4ISR architecture by mapping of Zachman Framework.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129377863","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}
As energy sources are going to be diminished, our future prognoses certainly run towards nuclear power as it is already weighed as a safe and clean alternative energy. As, tralatitious waste disposal system is hazardous, rumination about nuclear waste management, treatment and processing via adopting different physical and chemical technologies is of grave importance. Virility of nuclear waste needs to be controlled and mitigated for safe industrial purposes and fuel consumptions. In this paper, physical explanations and simulation of β transmutation by Decay Energetics has been given.
{"title":"Simulation of Transmutation β by Decay Energetics","authors":"S. Alam, Md. Nazmus Sakib, Md Sabbir Ahsan, Khaled Redwan, Imranul Kabir Chowdhury","doi":"10.1109/ISMS.2011.80","DOIUrl":"https://doi.org/10.1109/ISMS.2011.80","url":null,"abstract":"As energy sources are going to be diminished, our future prognoses certainly run towards nuclear power as it is already weighed as a safe and clean alternative energy. As, tralatitious waste disposal system is hazardous, rumination about nuclear waste management, treatment and processing via adopting different physical and chemical technologies is of grave importance. Virility of nuclear waste needs to be controlled and mitigated for safe industrial purposes and fuel consumptions. In this paper, physical explanations and simulation of β transmutation by Decay Energetics has been given.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116413430","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}
Yoong Hou Pin, Lin Boon Hoe, K. T. T. Kin, I. Saad
In this paper turning coefficient had been utilize for the swimming motion equation of a biometric fish robot. The swimming equation based on Carangiform Wave is cascaded with the arc equation to change the oscillating axis during turning movement (Chao Zhou). Usually turning movement is generated by defining the turning radius of the arc equation to bend the Carangiform oscillating axis. This involves the computation of turning radius power of two and infinite radius value during straight movement. Thus turning coefficient had been introduced to the arc equation to simplify the computation process and the turning coefficient can set as zero during straight movement. With the implementation of turning coefficient, the turning radius is fixed at a minimum value. This reduces the computational time of about 9% and maintaining the ability to perform smooth turning movement. Infrared sensor provides environment feedback for altering the turning coefficient linearly. The rate of change for the turning coefficient can be adjusted to define the sensitivities of the fish reacting to the environment.
{"title":"Swimming Motion Control for Biometric Fish Robot by Utilizing Turning Coefficient","authors":"Yoong Hou Pin, Lin Boon Hoe, K. T. T. Kin, I. Saad","doi":"10.1109/ISMS.2011.76","DOIUrl":"https://doi.org/10.1109/ISMS.2011.76","url":null,"abstract":"In this paper turning coefficient had been utilize for the swimming motion equation of a biometric fish robot. The swimming equation based on Carangiform Wave is cascaded with the arc equation to change the oscillating axis during turning movement (Chao Zhou). Usually turning movement is generated by defining the turning radius of the arc equation to bend the Carangiform oscillating axis. This involves the computation of turning radius power of two and infinite radius value during straight movement. Thus turning coefficient had been introduced to the arc equation to simplify the computation process and the turning coefficient can set as zero during straight movement. With the implementation of turning coefficient, the turning radius is fixed at a minimum value. This reduces the computational time of about 9% and maintaining the ability to perform smooth turning movement. Infrared sensor provides environment feedback for altering the turning coefficient linearly. The rate of change for the turning coefficient can be adjusted to define the sensitivities of the fish reacting to the environment.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125407308","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}
Pardeep Kumar Naik, N. Nitin, A. Janmeja, Sushain Puri, Kunal Chawla, Manav Bhasin, Kunal Jain
A high rate of expression of Endothelin protein in the placental cell is very much regulated by inhalation of tobacco smoke and leads to placental abnormalities subjected to birth failure. Our application developed using Image Processing [1-7], Nearest Neighbor algorithm (NN) and Genetic Algorithms (GA) [8-12], automates the study of these proteins to assist pathologists and lab technicians in achieving a more efficient and faster diagnosis. Using three distinct parameters, recognition of images with high protein expression was accurate up to 91% of the times. The tool has achieved a Matthews Correlation Coefficient (MCC) of 0.91. Other performance measures are = 91.1%, sensitivity = 0.91 and specificity = 0.82. These showed that computer aided diagnosis can be a helpful tool, especially in a field that lacks experienced specialists.
{"title":"B-MIPT: A Case Tool for Biomedical Image Processing and Their Classification Using Nearest Neighbor and Genetic Algorithm","authors":"Pardeep Kumar Naik, N. Nitin, A. Janmeja, Sushain Puri, Kunal Chawla, Manav Bhasin, Kunal Jain","doi":"10.1109/ISMS.2011.26","DOIUrl":"https://doi.org/10.1109/ISMS.2011.26","url":null,"abstract":"A high rate of expression of Endothelin protein in the placental cell is very much regulated by inhalation of tobacco smoke and leads to placental abnormalities subjected to birth failure. Our application developed using Image Processing [1-7], Nearest Neighbor algorithm (NN) and Genetic Algorithms (GA) [8-12], automates the study of these proteins to assist pathologists and lab technicians in achieving a more efficient and faster diagnosis. Using three distinct parameters, recognition of images with high protein expression was accurate up to 91% of the times. The tool has achieved a Matthews Correlation Coefficient (MCC) of 0.91. Other performance measures are = 91.1%, sensitivity = 0.91 and specificity = 0.82. These showed that computer aided diagnosis can be a helpful tool, especially in a field that lacks experienced specialists.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123468678","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}
W. A. Aziz, D. Sisalem, S. El-Ramly, M. M. Tantawy, Magdy M. Ibrahim
Over the last years the IP Multimedia Subsystem (IMS) has continuously gained in importance as the next generation communication network. The Session Initiation Protocol (SIP) was chosen the signaling protocol for session establishment and control in IMS. Losses caused by network or server overload would cause retransmissions and delays in the session establishment and would hence reduce the perceived service quality of the users. In order to be able to take counter measures network and service planers require detailed models that would allow them to predict such effects in advance. This paper presents a theoretical model of SIP that can be used for determining various parameters such the number of messages required for establishing a call in IMS networks when taking losses into account. The model also provides a method to calculate the bandwidth required for session establishment in IMS.
{"title":"A Theoretical Model to Calculate the Bandwidth of IMS Session Establishment","authors":"W. A. Aziz, D. Sisalem, S. El-Ramly, M. M. Tantawy, Magdy M. Ibrahim","doi":"10.1109/ISMS.2011.64","DOIUrl":"https://doi.org/10.1109/ISMS.2011.64","url":null,"abstract":"Over the last years the IP Multimedia Subsystem (IMS) has continuously gained in importance as the next generation communication network. The Session Initiation Protocol (SIP) was chosen the signaling protocol for session establishment and control in IMS. Losses caused by network or server overload would cause retransmissions and delays in the session establishment and would hence reduce the perceived service quality of the users. In order to be able to take counter measures network and service planers require detailed models that would allow them to predict such effects in advance. This paper presents a theoretical model of SIP that can be used for determining various parameters such the number of messages required for establishing a call in IMS networks when taking losses into account. The model also provides a method to calculate the bandwidth required for session establishment in IMS.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122979740","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
扫码关注我们
求助内容：
应助结果提醒方式：