Pub Date : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429863
U. Premaratne, C. Ling, J. Samarabandu, T. Sidhu
This paper details the use of possibilistic decision trees for a lightweight Intrusion Detection System (IDS) to be used in Intelligent Electronic Devices (IEDs) of IEC61850 automated electric substations. Traffic data is captured by performing simulated attacks on IEDs. Data is obtained for two types of genuine user activity and two types of common malicious attacks on IEDs. The genuine user activity includes, casual browsing of IED data and downloading of IED data while a Ping flood Denial of Service (DoS) and password crack attack are performed for malicious attacks. Classification is done using possibilistic decision trees for the logarithmic histogram of the time difference between the arrival of two consecutive packets. The main contribution of this paper is the use of non-specificity for obtaining a continuous valued possibilistic decision tree and its cut points. It also includes the use of mean distance metrics to obtain the possibility distribution for the real attack data.
{"title":"Possibilistic decision trees for Intrusion Detection in IEC61850 automated substations","authors":"U. Premaratne, C. Ling, J. Samarabandu, T. Sidhu","doi":"10.1109/ICIINFS.2009.5429863","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429863","url":null,"abstract":"This paper details the use of possibilistic decision trees for a lightweight Intrusion Detection System (IDS) to be used in Intelligent Electronic Devices (IEDs) of IEC61850 automated electric substations. Traffic data is captured by performing simulated attacks on IEDs. Data is obtained for two types of genuine user activity and two types of common malicious attacks on IEDs. The genuine user activity includes, casual browsing of IED data and downloading of IED data while a Ping flood Denial of Service (DoS) and password crack attack are performed for malicious attacks. Classification is done using possibilistic decision trees for the logarithmic histogram of the time difference between the arrival of two consecutive packets. The main contribution of this paper is the use of non-specificity for obtaining a continuous valued possibilistic decision tree and its cut points. It also includes the use of mean distance metrics to obtain the possibility distribution for the real attack data.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128929234","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-12-01DOI: 10.1109/ICIINFS.2009.5429890
Kelum Vithana, S. Fernando, D. Dias
The development and expansion of broadband technologies has stimulated the multimedia streaming market for the delivery of live streaming services which can be used for a variety of applications. The design of a generic audio and video streaming platform that can be employed for a wide range of applications is presented in this paper. A key feature of the platform is the ‘subscription framework’ which enables the service users to subscribe to a set of live feeds with their application specific requirements. The platform is capable of adjusting its service functionalities and the extent to which the media streams are secured for a particular user based on the requirements given at the service subscription. The platform is designed based on a layered architecture and a prototype implementation is carried out within the University network.
{"title":"A service platform for subscription-based live video streaming","authors":"Kelum Vithana, S. Fernando, D. Dias","doi":"10.1109/ICIINFS.2009.5429890","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429890","url":null,"abstract":"The development and expansion of broadband technologies has stimulated the multimedia streaming market for the delivery of live streaming services which can be used for a variety of applications. The design of a generic audio and video streaming platform that can be employed for a wide range of applications is presented in this paper. A key feature of the platform is the ‘subscription framework’ which enables the service users to subscribe to a set of live feeds with their application specific requirements. The platform is capable of adjusting its service functionalities and the extent to which the media streams are secured for a particular user based on the requirements given at the service subscription. The platform is designed based on a layered architecture and a prototype implementation is carried out within the University network.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129354267","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-12-01DOI: 10.1109/ICIINFS.2009.5429837
N. Nanayakkara, B. Chiu, A. Fenster
In medical image registration, the quantification of registration errors is important in deciding the capabilities of a registration technique for a given problem, and/or for a given pair of images. The most common approach is the geometrical registration error called Target Registration Error (TRE) that measures the distance between corresponding landmarks in the target and registered images. However, finding sufficient number of corresponding landmarks is not always possible in medical images, and therefore, other measures such as, image similarity measures and surface-based error metrics have been used in quantification of registration errors. Surface-based error quantification is more appropriate than intensity-based methods, but the widely used surface-based Closest Point Registration Error (CPRE) is known for under-estimating registration errors. In this paper, we present a surface-based method for quantification of registration errors using Matched Points Registration Error (MPRE) by computing distances between “matched-points” on segmented object surfaces in target and registered images. We compared small rigid registration errors of tube-shaped and closed surface objects quantified using MPRE with TRE and CPRE, and showed that MPRE did not show a significant difference from TRE and that CPRE was significantly lower than both MPRE and TRE.
{"title":"A surface-based metric for registration error quantification","authors":"N. Nanayakkara, B. Chiu, A. Fenster","doi":"10.1109/ICIINFS.2009.5429837","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429837","url":null,"abstract":"In medical image registration, the quantification of registration errors is important in deciding the capabilities of a registration technique for a given problem, and/or for a given pair of images. The most common approach is the geometrical registration error called Target Registration Error (TRE) that measures the distance between corresponding landmarks in the target and registered images. However, finding sufficient number of corresponding landmarks is not always possible in medical images, and therefore, other measures such as, image similarity measures and surface-based error metrics have been used in quantification of registration errors. Surface-based error quantification is more appropriate than intensity-based methods, but the widely used surface-based Closest Point Registration Error (CPRE) is known for under-estimating registration errors. In this paper, we present a surface-based method for quantification of registration errors using Matched Points Registration Error (MPRE) by computing distances between “matched-points” on segmented object surfaces in target and registered images. We compared small rigid registration errors of tube-shaped and closed surface objects quantified using MPRE with TRE and CPRE, and showed that MPRE did not show a significant difference from TRE and that CPRE was significantly lower than both MPRE and TRE.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132613744","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-12-01DOI: 10.1109/ICIINFS.2009.5429902
P. Rajkumar, Saswati Ghosh, P. Dasgupta
Usage control is a comprehensive access control model developed to cater the security needs of the wide range of application domains. Safety property of the usage control model ensures only the design level safety whereas the correctness of usage control in software application depends on the correctness of implementation as well. Most of the research in access control left the correctness of implementation as a general software verification problem. Software verification in general requires an extensive exploration of the complete state space, whereas access control of an application evolves over few repeated protection states. This paper presents a method to verify the correctness of usage control implementation by capturing and analyzing only the protection states. We use this method in the end to end correctness verification approach, which ensures the design as well as implementation correctness of usage control and we also provide an illustrative case study.
{"title":"An end to end correctness verification approach for application specific usage control","authors":"P. Rajkumar, Saswati Ghosh, P. Dasgupta","doi":"10.1109/ICIINFS.2009.5429902","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429902","url":null,"abstract":"Usage control is a comprehensive access control model developed to cater the security needs of the wide range of application domains. Safety property of the usage control model ensures only the design level safety whereas the correctness of usage control in software application depends on the correctness of implementation as well. Most of the research in access control left the correctness of implementation as a general software verification problem. Software verification in general requires an extensive exploration of the complete state space, whereas access control of an application evolves over few repeated protection states. This paper presents a method to verify the correctness of usage control implementation by capturing and analyzing only the protection states. We use this method in the end to end correctness verification approach, which ensures the design as well as implementation correctness of usage control and we also provide an illustrative case study.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114134052","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-12-01DOI: 10.1109/ICIINFS.2009.5429848
G. Gajanayake, R. Yapa, B. Hewawithana
In the analysis of medical images for computer-aided diagnosis and therapy, segmentation is often required as a preliminary step. Medical image segmentation is a complex and challenging task due to the complex nature of the images. The brain has a particularly complicated structure and its precise segmentation is very important for detecting tumors, edema, and necrotic tissues in order to prescribe appropriate therapy. Magnetic Resonance Imaging is an important diagnostic imaging technique utilized for early detection of abnormal changes in tissues and organs. It possesses good contrast resolution for different tissues and is, thus, preferred over Computerized Tomography for brain study. Therefore, the majority of research in medical image segmentation concerns MR images. As the core juncture of this research a set of MR images have been segmented using standard image segmentation techniques to isolate a brain tumor from the other regions of the brain. Subsequently the resultant images from the different segmentation techniques were compared with each other and analyzed by professional radiologists to find the segmentation technique which is the most accurate. Experimental results show that the Otsu's thresholding method is the most suitable image segmentation method to segment a brain tumor from a Magnetic Resonance Image.
{"title":"Comparison of standard image segmentation methods for segmentation of brain tumors from 2D MR images","authors":"G. Gajanayake, R. Yapa, B. Hewawithana","doi":"10.1109/ICIINFS.2009.5429848","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429848","url":null,"abstract":"In the analysis of medical images for computer-aided diagnosis and therapy, segmentation is often required as a preliminary step. Medical image segmentation is a complex and challenging task due to the complex nature of the images. The brain has a particularly complicated structure and its precise segmentation is very important for detecting tumors, edema, and necrotic tissues in order to prescribe appropriate therapy. Magnetic Resonance Imaging is an important diagnostic imaging technique utilized for early detection of abnormal changes in tissues and organs. It possesses good contrast resolution for different tissues and is, thus, preferred over Computerized Tomography for brain study. Therefore, the majority of research in medical image segmentation concerns MR images. As the core juncture of this research a set of MR images have been segmented using standard image segmentation techniques to isolate a brain tumor from the other regions of the brain. Subsequently the resultant images from the different segmentation techniques were compared with each other and analyzed by professional radiologists to find the segmentation technique which is the most accurate. Experimental results show that the Otsu's thresholding method is the most suitable image segmentation method to segment a brain tumor from a Magnetic Resonance Image.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124939080","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-12-01DOI: 10.1109/ICIINFS.2009.5429797
D. Dissanayake, S. Senanayake, H.K.D.W.M.M.R Divarathne, B. Samaranayake
The main objective of this study is to design and implement a suitable algorithm and its simulation for vehicle detection to control road traffic. The system developed is able to detect moving metal objects (vehicles) and then to calculate the appropriate duration for the traffic signals at an intersection to operate. By employing mathematical functions to calculate the appropriate timing for the green signal to illuminate, the system can help to solve the problem of traffic congestion. The sensing element used to detect vehicles was a Magneto-Resistive sensor. The simulation of the algorithm of the traffic signal system was done using software. First stage of the hardware simulation tests were successfully performed on the algorithm implemented into a controller. Using the Graphical User Interface (GUI) developed, the operation of the traffic lights according to the new, calculated time can be observed. The new timing scheme that was implemented promises an improvement in the current traffic light system in terms of time save and track utilization and this system is feasible, affordable and more than that it is ready to be implemented with minimum changes to the current traffic system in Sri Lanka.
{"title":"Real-time dynamic traffic light timing adaptation algorithm and simulation software","authors":"D. Dissanayake, S. Senanayake, H.K.D.W.M.M.R Divarathne, B. Samaranayake","doi":"10.1109/ICIINFS.2009.5429797","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429797","url":null,"abstract":"The main objective of this study is to design and implement a suitable algorithm and its simulation for vehicle detection to control road traffic. The system developed is able to detect moving metal objects (vehicles) and then to calculate the appropriate duration for the traffic signals at an intersection to operate. By employing mathematical functions to calculate the appropriate timing for the green signal to illuminate, the system can help to solve the problem of traffic congestion. The sensing element used to detect vehicles was a Magneto-Resistive sensor. The simulation of the algorithm of the traffic signal system was done using software. First stage of the hardware simulation tests were successfully performed on the algorithm implemented into a controller. Using the Graphical User Interface (GUI) developed, the operation of the traffic lights according to the new, calculated time can be observed. The new timing scheme that was implemented promises an improvement in the current traffic light system in terms of time save and track utilization and this system is feasible, affordable and more than that it is ready to be implemented with minimum changes to the current traffic system in Sri Lanka.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125217188","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-12-01DOI: 10.1109/ICIINFS.2009.5429841
Kini M. Ramesh, D. S. Sumam
Computational efficiency of Signal Processing Algorithm implemented in hardware depends on efficiency of datapath, memory speed, and generation of addresses for data access. In case of signal processing applications, pattern of data access is complex in comparison with other applications. If implemented in a general purpose processor, address generation for signal processing applications will require execution of a series of instructions and use of datapath elements like adders, shifters etc. In general, considerable processor resources and time are utilized. It is desirable to execute one loop of a kernel per clock. This demands generation of typically three addresses per clock: two addresses for data sample/coefficient and one for storage of processed data. A set of dedicated, efficient Address Generator Units (AGU) will definitely enhance the performance. This paper focuses on design and implementation of Address Generators for complex addressing modes required by Multimedia Signal Processing algorithms. Among other addressing modes, a novel algorithm is developed for accessing data in a Bit-Reversed order for Fast Fourier Transforms (FFT), and Zig-zag order for Discrete Cosine Transforms (DCT). When mapped to hardware, this scales linearly in gate complexity with increase in the size and uses less components.
{"title":"Comprehensive address generator for digital Signal Processing","authors":"Kini M. Ramesh, D. S. Sumam","doi":"10.1109/ICIINFS.2009.5429841","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429841","url":null,"abstract":"Computational efficiency of Signal Processing Algorithm implemented in hardware depends on efficiency of datapath, memory speed, and generation of addresses for data access. In case of signal processing applications, pattern of data access is complex in comparison with other applications. If implemented in a general purpose processor, address generation for signal processing applications will require execution of a series of instructions and use of datapath elements like adders, shifters etc. In general, considerable processor resources and time are utilized. It is desirable to execute one loop of a kernel per clock. This demands generation of typically three addresses per clock: two addresses for data sample/coefficient and one for storage of processed data. A set of dedicated, efficient Address Generator Units (AGU) will definitely enhance the performance. This paper focuses on design and implementation of Address Generators for complex addressing modes required by Multimedia Signal Processing algorithms. Among other addressing modes, a novel algorithm is developed for accessing data in a Bit-Reversed order for Fast Fourier Transforms (FFT), and Zig-zag order for Discrete Cosine Transforms (DCT). When mapped to hardware, this scales linearly in gate complexity with increase in the size and uses less components.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"657 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121985709","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-12-01DOI: 10.1109/ICIINFS.2009.5429888
S. Hoffmann, V. Herath, M. El-Darawy, T. Pfau, C. Wordehoff, R. Peveling, U. Ruckert, R. Noé
A multiplier-free phase estimation algorithm based on the barycentre approach for coherent QPSK detection is presented. A selectivity mechanism was developed that significantly improved its performance. In addition to recently published measurement results, theoretical background and new simulation results are presented.
{"title":"Multiplier-free realtime phase tracking in digital synchronous QPSK receiver for coherent optical detection","authors":"S. Hoffmann, V. Herath, M. El-Darawy, T. Pfau, C. Wordehoff, R. Peveling, U. Ruckert, R. Noé","doi":"10.1109/ICIINFS.2009.5429888","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429888","url":null,"abstract":"A multiplier-free phase estimation algorithm based on the barycentre approach for coherent QPSK detection is presented. A selectivity mechanism was developed that significantly improved its performance. In addition to recently published measurement results, theoretical background and new simulation results are presented.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127192554","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-12-01DOI: 10.1109/ICIINFS.2009.5429884
P. Hoole, S. Hoole
This paper traces the discipline of electromagnetic field computation from the early days of network models to finite differences, integral equation solutions and now the all encompassing finite element method. The discipline enjoyed phenomenal growth under the sponsorship of the IEEE Magnetics Society. The pioneers took a broad view of this subspecialty of electrical engineering as a discipline intersecting with mathematical physics, numerical mathematics and computer science. This liberal non-confining view has spawned further sub-disciplines leading to CAD techniques, and inverse problems, matrix solution methods and parallel processing. The paper then focuses on what is currently the most active area of research, inverse problem solution and optimization where much of the new work lies.
{"title":"Electromagnetic field computation: The beginnings and current directions in optimization","authors":"P. Hoole, S. Hoole","doi":"10.1109/ICIINFS.2009.5429884","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429884","url":null,"abstract":"This paper traces the discipline of electromagnetic field computation from the early days of network models to finite differences, integral equation solutions and now the all encompassing finite element method. The discipline enjoyed phenomenal growth under the sponsorship of the IEEE Magnetics Society. The pioneers took a broad view of this subspecialty of electrical engineering as a discipline intersecting with mathematical physics, numerical mathematics and computer science. This liberal non-confining view has spawned further sub-disciplines leading to CAD techniques, and inverse problems, matrix solution methods and parallel processing. The paper then focuses on what is currently the most active area of research, inverse problem solution and optimization where much of the new work lies.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130243744","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-12-01DOI: 10.1109/ICIINFS.2009.5429831
R. Rupasinghe, S. Ratnayake, A. Karunananda
Supply chain management involves planning and management of suppliers and retailers that are engaged in a business process. These entities operate in a distributed and interconnected complex world that manifests in ever-changing dynamic systems with lots of uncertainty. Those systems cannot be modeled by traditional techniques that assume the stability of a system during execution. In addressing the above issue, we have postulated a multi agent system to emulate process in supply chain management. The system is able to create multiple Agents upon the dynamic requests and enables passing messages to establish negotiations among agents to achieve the best deals to satisfy requirements of both suppliers and the retailers. The agents execute successfully or they could not compete, kill themselves and come up with better strategies again only when necessary, thereby saving the computing resources to execute the agent system. The system has been tested for various possible cases and found to be successful for modeling the complex domain of supply chain management.
{"title":"Priority driven agent based retail supply chain management system","authors":"R. Rupasinghe, S. Ratnayake, A. Karunananda","doi":"10.1109/ICIINFS.2009.5429831","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429831","url":null,"abstract":"Supply chain management involves planning and management of suppliers and retailers that are engaged in a business process. These entities operate in a distributed and interconnected complex world that manifests in ever-changing dynamic systems with lots of uncertainty. Those systems cannot be modeled by traditional techniques that assume the stability of a system during execution. In addressing the above issue, we have postulated a multi agent system to emulate process in supply chain management. The system is able to create multiple Agents upon the dynamic requests and enables passing messages to establish negotiations among agents to achieve the best deals to satisfy requirements of both suppliers and the retailers. The agents execute successfully or they could not compete, kill themselves and come up with better strategies again only when necessary, thereby saving the computing resources to execute the agent system. The system has been tested for various possible cases and found to be successful for modeling the complex domain of supply chain management.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126008779","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
扫码关注我们
求助内容：
应助结果提醒方式：