M. Idris, S. A. Bakar, E. M. Tamil, Z. Razak, N. M. Noor
Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. Most of the shortest path calculation is performed on general purpose processor where instructions must be run to read the input, compute the result, and set the output which later on will slow down the overall performance. Therefore, the authors proposed a hardware approach which implements FPGA technology to find the shortest path between two nodes. The FPGA approach will demonstrate how parallelism can be used to significantly reduce calculation steps compared to sequential effort. In this paper, A-Star algorithm has been chosen for the shortest path calculation since it can achieve superior time running based on its heuristic behavior.
{"title":"High-Speed Shortest Path Co-processor Design","authors":"M. Idris, S. A. Bakar, E. M. Tamil, Z. Razak, N. M. Noor","doi":"10.1109/AMS.2009.91","DOIUrl":"https://doi.org/10.1109/AMS.2009.91","url":null,"abstract":"Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. Most of the shortest path calculation is performed on general purpose processor where instructions must be run to read the input, compute the result, and set the output which later on will slow down the overall performance. Therefore, the authors proposed a hardware approach which implements FPGA technology to find the shortest path between two nodes. The FPGA approach will demonstrate how parallelism can be used to significantly reduce calculation steps compared to sequential effort. In this paper, A-Star algorithm has been chosen for the shortest path calculation since it can achieve superior time running based on its heuristic behavior.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"19 1","pages":"626-631"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81186475","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}
Tampering of documents is monotonically growing by posing challenges to forensic scientists. There is a great need to develop alternative solutions for forensic characterization of printers. This paper analyzes documents printed by various printers and characterizes them for identification purposes. Present study focuses on developing a model Gaussian Variogram Model (GVM) for identifying the print technology which produced the given document. This method characterizes print technology based on spatial variability. Homogeneous color region of images are taken as samples for the GVM data generation. The generated GVM data is taken as input to generate Reduct based Decision Tree (RDT), which gives rules to identify the source printer for the given test data. Performance analysis of the model is also presented. Developed method assists the document examiner in finding basic print pattern of printers and it is also helpful in classifying different print technology.
{"title":"Gaussian Variogram Model for Printing Technology Identification","authors":"M. U. Devi, A. Agarwal, C. R. Rao","doi":"10.1109/AMS.2009.20","DOIUrl":"https://doi.org/10.1109/AMS.2009.20","url":null,"abstract":"Tampering of documents is monotonically growing by posing challenges to forensic scientists. There is a great need to develop alternative solutions for forensic characterization of printers. This paper analyzes documents printed by various printers and characterizes them for identification purposes. Present study focuses on developing a model Gaussian Variogram Model (GVM) for identifying the print technology which produced the given document. This method characterizes print technology based on spatial variability. Homogeneous color region of images are taken as samples for the GVM data generation. The generated GVM data is taken as input to generate Reduct based Decision Tree (RDT), which gives rules to identify the source printer for the given test data. Performance analysis of the model is also presented. Developed method assists the document examiner in finding basic print pattern of printers and it is also helpful in classifying different print technology.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"20 1","pages":"320-325"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82901165","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 paper propose an innovative simulation model based on web technologies devoted to analyze environmental impact of the whole supply chain. The authors developed a whole framework for collecting data from different users including good producers, logistics operators and retailers by a web questionnaire; this service is automatically integrated with a simulator that evaluate the green aspects of each case by self generating a model for this specific case and providing synthetic results; in addition the green log model developed allows to create interactively very complex supply chain. The paper propose the general architecture of the green log model and an example for supporting its validation and verification.
{"title":"Modeling Green Logistics","authors":"A. Bruzzone, A. Tremori, M. Massei, F. Tarone","doi":"10.1109/AMS.2009.97","DOIUrl":"https://doi.org/10.1109/AMS.2009.97","url":null,"abstract":"This paper propose an innovative simulation model based on web technologies devoted to analyze environmental impact of the whole supply chain. The authors developed a whole framework for collecting data from different users including good producers, logistics operators and retailers by a web questionnaire; this service is automatically integrated with a simulator that evaluate the green aspects of each case by self generating a model for this specific case and providing synthetic results; in addition the green log model developed allows to create interactively very complex supply chain. The paper propose the general architecture of the green log model and an example for supporting its validation and verification.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"13 1","pages":"543-548"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86789655","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 attempts to generate an automatic prediction model in a hard disk media manufacturing process. This is to be done without human visual interpretation. Our research demonstrates that it can be achieved by visualizing the historical temporal data pattern generated from the inspection machine. From there, the data pattern is transformed and mapped into machine learning algorithm for training. In this paper, we have introduced the pattern visualization technique with trinary and quinary number and compared them with our previous binary pattern visualization technique. This is to deal with multi class classification. The result implied that, the performance of the multi class classification can be improved when all class instances were made higher in quantity and balance. Quinary pattern visualization techniques performed better compared with binary and trinary patterns when the multi class instances were made balanced and were significantly at higher quantity.
{"title":"Visualizing the Yield Pattern for Multi Class Classification","authors":"M. M. Noor, S. Jusoh","doi":"10.1109/AMS.2009.52","DOIUrl":"https://doi.org/10.1109/AMS.2009.52","url":null,"abstract":"This research attempts to generate an automatic prediction model in a hard disk media manufacturing process. This is to be done without human visual interpretation. Our research demonstrates that it can be achieved by visualizing the historical temporal data pattern generated from the inspection machine. From there, the data pattern is transformed and mapped into machine learning algorithm for training. In this paper, we have introduced the pattern visualization technique with trinary and quinary number and compared them with our previous binary pattern visualization technique. This is to deal with multi class classification. The result implied that, the performance of the multi class classification can be improved when all class instances were made higher in quantity and balance. Quinary pattern visualization techniques performed better compared with binary and trinary patterns when the multi class instances were made balanced and were significantly at higher quantity.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"17 1","pages":"560-565"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91186943","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 proved that Stable Matching problems are the same problems about Stable Configurations of Multi-stage Interconnection Networks (MINs). We solved the Stability Problem of Existing Regular Chained Multipath Cross Link Network using the approaches and solutions provided by the Stable Matching Problem. Specifically we have used Stable Marriage Problem as an example of Stable Matching. For MINs to prove Stable two existing algorithms are used: the first algorithm generates the MINs Preferences List in O(n^2) time and second algorithm produces a set of most Optimal Pairs of the Switching Elements (SEs) (derived from the MINs Preferences List)in O(n) time. The stability comparison of regular and irregular MINs concludes that fault-tolerant chained regular networks are more stable than fault-tolerant chained irregular networks.
{"title":"On a Stable Matching Problem of Hybrid Multi–stage Interconnection Networks","authors":"Nitin, Ruchi Verma","doi":"10.1109/AMS.2009.137","DOIUrl":"https://doi.org/10.1109/AMS.2009.137","url":null,"abstract":"In this paper, we proved that Stable Matching problems are the same problems about Stable Configurations of Multi-stage Interconnection Networks (MINs). We solved the Stability Problem of Existing Regular Chained Multipath Cross Link Network using the approaches and solutions provided by the Stable Matching Problem. Specifically we have used Stable Marriage Problem as an example of Stable Matching. For MINs to prove Stable two existing algorithms are used: the first algorithm generates the MINs Preferences List in O(n^2) time and second algorithm produces a set of most Optimal Pairs of the Switching Elements (SEs) (derived from the MINs Preferences List)in O(n) time. The stability comparison of regular and irregular MINs concludes that fault-tolerant chained regular networks are more stable than fault-tolerant chained irregular networks.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"12 1","pages":"590-595"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74318412","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, an automation of DNA computing readout method based on real-time Polymerase Chan Reaction (PCR) is developed, which employs a hybrid in vitro-in silico approach. In the in vitro phase, TaqMan-based real-time PCR reactions are performed in parallel, to investigate the ordering of pairs of nodes in the Hamiltonian Path Problem (HPP), in terms of relative distance from the DNA sequence encoding the known start node. The real-time PCR experiment is implemented on LightCycler system. Fuzzy C-Means (FCM) clustering algorithm is used to identify automatically two different reactions in real-time PCR, followed by in silico algorithm, which in turn, enables extraction of the Hamiltonian path. A software called SILICOLIGHT is built to implement the FCM clustering and the in silico algorithm, which return the desired Hamiltonian path.
{"title":"Automation of DNA Computing Readout Method Implemented on LightCycler System","authors":"M. F. Saaid, Z. Ibrahim, M. Khalid, N. Sarmin","doi":"10.1109/AMS.2009.80","DOIUrl":"https://doi.org/10.1109/AMS.2009.80","url":null,"abstract":"In this paper, an automation of DNA computing readout method based on real-time Polymerase Chan Reaction (PCR) is developed, which employs a hybrid in vitro-in silico approach. In the in vitro phase, TaqMan-based real-time PCR reactions are performed in parallel, to investigate the ordering of pairs of nodes in the Hamiltonian Path Problem (HPP), in terms of relative distance from the DNA sequence encoding the known start node. The real-time PCR experiment is implemented on LightCycler system. Fuzzy C-Means (FCM) clustering algorithm is used to identify automatically two different reactions in real-time PCR, followed by in silico algorithm, which in turn, enables extraction of the Hamiltonian path. A software called SILICOLIGHT is built to implement the FCM clustering and the in silico algorithm, which return the desired Hamiltonian path.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"19 1","pages":"252-257"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79982646","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}
Sarina Sulaiman, S. Shamsuddin, F. Forkan, A. Abraham, S. Sulaiman
E-learning has been a common online service to support teaching and learning in education. Universiti Teknologi Malaysia (UTM) has been using such service that is known as e-Learning@UTM since 2005. The demand for e-learning content increases dramatically every semester. The performance of e-learning servers reduces when the number of users for each semester keeps growing. Hence users often experience poor performance in accessing the e-learning contents or downloading files. Such problems are due to the problem in the performance of servers, network infrastructure and majority of users tend to access the same piece of information repetitively. Web caching has been recognized as an effective scheme to reduce service bottleneck, users’ access latency and network traffic. Therefore this paper will discuss an alternative way to tackle these problems by implementing a log data detection tool. This tool is capable to automatically directing either to cache or not to cache the objects in a document based on the log data (number of object hits, script size of objects, and time to receive object) in e-Learning@UTM to enhance such Web access.
{"title":"Intelligent Web Caching for E-learning Log Data","authors":"Sarina Sulaiman, S. Shamsuddin, F. Forkan, A. Abraham, S. Sulaiman","doi":"10.1109/AMS.2009.88","DOIUrl":"https://doi.org/10.1109/AMS.2009.88","url":null,"abstract":"E-learning has been a common online service to support teaching and learning in education. Universiti Teknologi Malaysia (UTM) has been using such service that is known as e-Learning@UTM since 2005. The demand for e-learning content increases dramatically every semester. The performance of e-learning servers reduces when the number of users for each semester keeps growing. Hence users often experience poor performance in accessing the e-learning contents or downloading files. Such problems are due to the problem in the performance of servers, network infrastructure and majority of users tend to access the same piece of information repetitively. Web caching has been recognized as an effective scheme to reduce service bottleneck, users’ access latency and network traffic. Therefore this paper will discuss an alternative way to tackle these problems by implementing a log data detection tool. This tool is capable to automatically directing either to cache or not to cache the objects in a document based on the log data (number of object hits, script size of objects, and time to receive object) in e-Learning@UTM to enhance such Web access.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"10 1","pages":"136-141"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81979460","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}
Y. Merkuryev, Galina Merkuryeva, R. D. Haes, B. Desmet, A. Wispelaere, J. Hatem
ECLIPS is a European research project extending the state-of-the-art in supply chain management. The goal of the ECLIPS project is to establish a global cost reduction in the entire supply chain in an ingenious manner, while addressing the ongoing challenges within the industry. Nowadays companies are facing ever more complex supply chains, increased portfolio diversification and shortening product life-cycles. ECLIPS is exploring custom-made solutions to these issues, in terms of concept and software. During this three-year project concepts and tooling have been developed in the first two years, while during the last project year these concepts and tools will be validated through real-life application. In order to achieve this goal ECLIPS uses simulation intensively to back up the decision making and optimization on the one hand, and as a validation for the developed tools and algorithms on the other hand. In this paper the authors focus on the real-life simulation benefits, i.e. the added value of the simulation techniques on the executive business level, the educational purpose for future end users and the surplus in what-if scenarios, as well as on a very important step in simulation before real-life implementation, i.e. the investigation of the gap between the real-life situation and the As-Is simulation results.
{"title":"Supply Chain Simulation in the ECLIPS Project: Real-life Benefit","authors":"Y. Merkuryev, Galina Merkuryeva, R. D. Haes, B. Desmet, A. Wispelaere, J. Hatem","doi":"10.1109/AMS.2009.33","DOIUrl":"https://doi.org/10.1109/AMS.2009.33","url":null,"abstract":"ECLIPS is a European research project extending the state-of-the-art in supply chain management. The goal of the ECLIPS project is to establish a global cost reduction in the entire supply chain in an ingenious manner, while addressing the ongoing challenges within the industry. Nowadays companies are facing ever more complex supply chains, increased portfolio diversification and shortening product life-cycles. ECLIPS is exploring custom-made solutions to these issues, in terms of concept and software. During this three-year project concepts and tooling have been developed in the first two years, while during the last project year these concepts and tools will be validated through real-life application. In order to achieve this goal ECLIPS uses simulation intensively to back up the decision making and optimization on the one hand, and as a validation for the developed tools and algorithms on the other hand. In this paper the authors focus on the real-life simulation benefits, i.e. the added value of the simulation techniques on the executive business level, the educational purpose for future end users and the surplus in what-if scenarios, as well as on a very important step in simulation before real-life implementation, i.e. the investigation of the gap between the real-life situation and the As-Is simulation results.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"66 1","pages":"526-532"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86524570","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}
New routing algorithms are being developed to reduce power consumption, effective utilization of resources and best route to a specific destination, to name a few, in wireless mobile ad hoc network. To simulate the algorithm, interaction between the different layers of the OSI, the link available and furthermore, employing a suitable propagation model in a wireless environment, the use of network simulators do eliminate irrelevant issues pertaining to the actual work which is testing the algorithm. This paper presents the development of the simulation program to test a new routing protocol called quadrant-based directional routing protocol (Q-DIR). Q-DIR uses exact location of nodes based on Cartesian-coordinate system to restrict the broadcast region to only a quadrant where the destination node and source node are located.
{"title":"Simulation of Position-Based Routing Protocol in Wireless Mobile Ad Hoc Network","authors":"L. Latiff, N. Fisal, S. Ariffin","doi":"10.1109/AMS.2009.10","DOIUrl":"https://doi.org/10.1109/AMS.2009.10","url":null,"abstract":"New routing algorithms are being developed to reduce power consumption, effective utilization of resources and best route to a specific destination, to name a few, in wireless mobile ad hoc network. To simulate the algorithm, interaction between the different layers of the OSI, the link available and furthermore, employing a suitable propagation model in a wireless environment, the use of network simulators do eliminate irrelevant issues pertaining to the actual work which is testing the algorithm. This paper presents the development of the simulation program to test a new routing protocol called quadrant-based directional routing protocol (Q-DIR). Q-DIR uses exact location of nodes based on Cartesian-coordinate system to restrict the broadcast region to only a quadrant where the destination node and source node are located.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"3 1","pages":"292-297"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89396569","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}
The ballistic transport of the carriers is predicted when the channel length of the transistor is less than the scattering-limited mean-free path. In this paper, the saturation velocity is found to be ballistic regardless of the device dimensions. This saturation velocity is limited by the intrinsic velocity. Its does not sensitively depend on the ballistic or scattering-limited nature of the mobility. In the degenerate realm, the saturation velocity is shown to be the Fermi velocity that is independent of temperature but strongly dependent on carrier concentration. In the non-degenerate realm, the intrinsic velocity is the thermal velocity that depends only on the ambient temperature. The drain carrier velocity is revealed to be smaller than the saturation velocity due to the presence of a finite electric field. An excellent agreement of the models developed and applied to 80-nm-channel-length MOSFET validates the physics behind ballistic transport.
{"title":"Physics-Based Modelling of Ballistic Transport in Nanoscale Transistor","authors":"I. Saad, R. A. Lee, R. Ismail, V. Arora","doi":"10.1109/AMS.2009.46","DOIUrl":"https://doi.org/10.1109/AMS.2009.46","url":null,"abstract":"The ballistic transport of the carriers is predicted when the channel length of the transistor is less than the scattering-limited mean-free path. In this paper, the saturation velocity is found to be ballistic regardless of the device dimensions. This saturation velocity is limited by the intrinsic velocity. Its does not sensitively depend on the ballistic or scattering-limited nature of the mobility. In the degenerate realm, the saturation velocity is shown to be the Fermi velocity that is independent of temperature but strongly dependent on carrier concentration. In the non-degenerate realm, the intrinsic velocity is the thermal velocity that depends only on the ambient temperature. The drain carrier velocity is revealed to be smaller than the saturation velocity due to the presence of a finite electric field. An excellent agreement of the models developed and applied to 80-nm-channel-length MOSFET validates the physics behind ballistic transport.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"50 1","pages":"729-734"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90268309","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
扫码关注我们
求助内容：
应助结果提醒方式：