A mobile ad hoc network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. Earlier research has proposed several unipath routing protocols specifically on MANET, but most studies have not focused on the limitations of battery resource. To alleviate these problems, a new routing protocol called energy-aware grid multipath routing (EAGMR) protocol is proposed. The proposed protocol can conserve energy and provide the best path to route according to probability. Simulation results indicate that this new energy-aware protocol can save energy of mobile hosts and improve data packet delivery ratio
{"title":"Energy-Aware Grid Multipath Routing Protocol in MANET","authors":"Zhengyu Wu, Hantao Song, Shaofeng Jiang, Xiaomei Xu","doi":"10.1109/AMS.2007.36","DOIUrl":"https://doi.org/10.1109/AMS.2007.36","url":null,"abstract":"A mobile ad hoc network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. Earlier research has proposed several unipath routing protocols specifically on MANET, but most studies have not focused on the limitations of battery resource. To alleviate these problems, a new routing protocol called energy-aware grid multipath routing (EAGMR) protocol is proposed. The proposed protocol can conserve energy and provide the best path to route according to probability. Simulation results indicate that this new energy-aware protocol can save energy of mobile hosts and improve data packet delivery ratio","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124855619","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}
S. Singh, Shishir Kumar, G. Tomar, Ravi Kumar, G. K. Santhalia
Image and video (multimedia) databases are very large in size. It becomes very difficult to search the images from these databases by the application of conventional exhaustive searching because it will require unreasonable amount of time. For this purpose an automatic graph based clustering algorithm is developed and proposed through this paper. It reduces the searching time for the images from large databases. The proposed algorithm works on the concept of minimum spanning tree, which removes the inconsistent edges from tree, based on the dynamic threshold provided to the algorithm. The proposed algorithm reduces the search time for the retrieval with an acceptable loss in the accuracy
{"title":"A Modified Framework of a Clustering Algorithm for Image Processing Applications","authors":"S. Singh, Shishir Kumar, G. Tomar, Ravi Kumar, G. K. Santhalia","doi":"10.1109/AMS.2007.4","DOIUrl":"https://doi.org/10.1109/AMS.2007.4","url":null,"abstract":"Image and video (multimedia) databases are very large in size. It becomes very difficult to search the images from these databases by the application of conventional exhaustive searching because it will require unreasonable amount of time. For this purpose an automatic graph based clustering algorithm is developed and proposed through this paper. It reduces the searching time for the images from large databases. The proposed algorithm works on the concept of minimum spanning tree, which removes the inconsistent edges from tree, based on the dynamic threshold provided to the algorithm. The proposed algorithm reduces the search time for the retrieval with an acceptable loss in the accuracy","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123171167","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 necklace hypercube has been recently proposed as an attractive topology for multicomputers and was shown to have many desirable properties such as well-scalability and suitability for VLSI implementation. This paper introduces a parallel algorithm for computing an N-point Lagrange interpolation on a necklace hypercube multiprocessor. This algorithm consists of 3 phases: initialization, main and final. There is no computation in the initialization phase. The main phase consists of lceilE/2rceil steps (with E being the number of edges of the network), each consisting of 4 multiplications and 4 subtractions, and an additional step including 1 division and 1 multiplication. Communication in the main phase is based on an all-to-all broadcast algorithm using some Eulerian rings embedded in the host necklace hypercube. The final phase is carried out in three sub-phases. There are lceilk/2rceil steps in the first sub-phase where k is the size of necklace. Each of sub-phases two and three contains n steps. Our study reveals that when implementation cost in taken into account, there is no speedup difference between low-dimensional and high-dimensional necklace networks
{"title":"Parallel Numerical Interpolation on Necklace Hypercubes","authors":"S. Meraji, H. Sarbazi-Azad","doi":"10.1109/AMS.2007.78","DOIUrl":"https://doi.org/10.1109/AMS.2007.78","url":null,"abstract":"The necklace hypercube has been recently proposed as an attractive topology for multicomputers and was shown to have many desirable properties such as well-scalability and suitability for VLSI implementation. This paper introduces a parallel algorithm for computing an N-point Lagrange interpolation on a necklace hypercube multiprocessor. This algorithm consists of 3 phases: initialization, main and final. There is no computation in the initialization phase. The main phase consists of lceilE/2rceil steps (with E being the number of edges of the network), each consisting of 4 multiplications and 4 subtractions, and an additional step including 1 division and 1 multiplication. Communication in the main phase is based on an all-to-all broadcast algorithm using some Eulerian rings embedded in the host necklace hypercube. The final phase is carried out in three sub-phases. There are lceilk/2rceil steps in the first sub-phase where k is the size of necklace. Each of sub-phases two and three contains n steps. Our study reveals that when implementation cost in taken into account, there is no speedup difference between low-dimensional and high-dimensional necklace networks","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131833575","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 proposes a new mathematical model for tsunami generation, propagation in real-time simulation and visualization. The model is so called SiTProS (Siam tsunami propagation simulator). We deduce the shallow water wave equation, nonlinear wave equation and the continuity equation that must be satisfied when a wave encounters a discontinuity in the sea depth by selecting a computation grid from the Etopo2. A tsunami struck the shores of southern Thailand and along the Andaman coast on the December 26, 2004. The hardest-hit area of affected provinces is given based on the shoaling, refraction, diffraction and reflection phenomenon. The SiTProS can run for any given regional or global grid with a prescribed topographic dataset as Etopo2. The finite difference method is used to solve the equation. The SiTProS provides five different computing regions, which are Asia, Europe, Arab (Iran-Kenya), Africa, and Andaman. The SiTProS is designed for interactive simulation and user friendly
{"title":"SiTProS: Fast and Real-Time Simulation of Tsunami Propagation","authors":"Somporn Chuai-Aree, Wattana Kanbua","doi":"10.1109/AMS.2007.95","DOIUrl":"https://doi.org/10.1109/AMS.2007.95","url":null,"abstract":"This paper proposes a new mathematical model for tsunami generation, propagation in real-time simulation and visualization. The model is so called SiTProS (Siam tsunami propagation simulator). We deduce the shallow water wave equation, nonlinear wave equation and the continuity equation that must be satisfied when a wave encounters a discontinuity in the sea depth by selecting a computation grid from the Etopo2. A tsunami struck the shores of southern Thailand and along the Andaman coast on the December 26, 2004. The hardest-hit area of affected provinces is given based on the shoaling, refraction, diffraction and reflection phenomenon. The SiTProS can run for any given regional or global grid with a prescribed topographic dataset as Etopo2. The finite difference method is used to solve the equation. The SiTProS provides five different computing regions, which are Asia, Europe, Arab (Iran-Kenya), Africa, and Andaman. The SiTProS is designed for interactive simulation and user friendly","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121363287","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}
Virus writers are getting smarter by the day. They are coming up with new, innovative ways to evade signature detection by anti-virus software. One such evasion technique used by polymorphic and metamorphic viruses is their ability to morph code so that signature based detection techniques fail. These viruses change form such that every new infected file has different strings, rendering string based signature detection practically useless against such viruses. Our work is based on the premise that given a variant of morphed code, we can detect any obfuscated version of this code with high probability using some simple statistical techniques. We use the cosine similarity function to compare two files based on static analysis of the portable executable (PE) format. Our results show that for certain evasion techniques, it is possible to identify polymorphic/metamorphic versions of files based on cosine similarity
{"title":"Detecting Obfuscated Viruses Using Cosine Similarity Analysis","authors":"Abhishek Karnik, Suchandra Goswami, R. Guha","doi":"10.1109/AMS.2007.31","DOIUrl":"https://doi.org/10.1109/AMS.2007.31","url":null,"abstract":"Virus writers are getting smarter by the day. They are coming up with new, innovative ways to evade signature detection by anti-virus software. One such evasion technique used by polymorphic and metamorphic viruses is their ability to morph code so that signature based detection techniques fail. These viruses change form such that every new infected file has different strings, rendering string based signature detection practically useless against such viruses. Our work is based on the premise that given a variant of morphed code, we can detect any obfuscated version of this code with high probability using some simple statistical techniques. We use the cosine similarity function to compare two files based on static analysis of the portable executable (PE) format. Our results show that for certain evasion techniques, it is possible to identify polymorphic/metamorphic versions of files based on cosine similarity","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123747990","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}
S. A. Nazeer, Nazaruddin Omar, Khairol Faisal Jumari, M. Khalid
A frontal face detection system using artificial neural network is presented. The system used integral image for image representation which allows fast computation of the features used. The system also applies the AdaBoost learning algorithm to select a small number of critical visual features from a very large set of potential features. Besides that, it also used cascade of classifiers algorithm which allows background regions of the image to be quickly discarded while spending more computation on promising face-like regions. Furthermore, a set of experiments in the domain of face detection is presented. The system yields a promising face detection performance
{"title":"Face Detecting Using Artificial Neural Network Approach","authors":"S. A. Nazeer, Nazaruddin Omar, Khairol Faisal Jumari, M. Khalid","doi":"10.1109/AMS.2007.38","DOIUrl":"https://doi.org/10.1109/AMS.2007.38","url":null,"abstract":"A frontal face detection system using artificial neural network is presented. The system used integral image for image representation which allows fast computation of the features used. The system also applies the AdaBoost learning algorithm to select a small number of critical visual features from a very large set of potential features. Besides that, it also used cascade of classifiers algorithm which allows background regions of the image to be quickly discarded while spending more computation on promising face-like regions. Furthermore, a set of experiments in the domain of face detection is presented. The system yields a promising face detection performance","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126396967","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}
Differentiated services (DiffServ) is a QoS architecture that seeks to provide service differentiation to a small number of service classes. Priority queuing (PRIQ), a scheduling mechanism that provides a fixed number of priority levels to different service classes, can be used for DiffServ provisioning. However, it has the inherent problem of starvation in the lower priority classes. A new framework, value-based utility (VBU), models the perceived knowledge of the state and degree of user satisfaction in managing router resources and functions. We propose the use of the VBU framework to improve the PRIQ mechanism. We designed and implemented an enhanced PRIQ mechanism which uses packet remarking on an ALTQ router. Our results show that our mechanism effectively improves the performance in the low priority class while maintaining the QoS guarantees of the higher priority classes
{"title":"Utility-Based Enhanced Priority Scheduler for Differentiated Services","authors":"N. Tiglao","doi":"10.1109/AMS.2007.109","DOIUrl":"https://doi.org/10.1109/AMS.2007.109","url":null,"abstract":"Differentiated services (DiffServ) is a QoS architecture that seeks to provide service differentiation to a small number of service classes. Priority queuing (PRIQ), a scheduling mechanism that provides a fixed number of priority levels to different service classes, can be used for DiffServ provisioning. However, it has the inherent problem of starvation in the lower priority classes. A new framework, value-based utility (VBU), models the perceived knowledge of the state and degree of user satisfaction in managing router resources and functions. We propose the use of the VBU framework to improve the PRIQ mechanism. We designed and implemented an enhanced PRIQ mechanism which uses packet remarking on an ALTQ router. Our results show that our mechanism effectively improves the performance in the low priority class while maintaining the QoS guarantees of the higher priority classes","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126800071","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 initially reviews the sequence of events surrounding the tsunami disaster, which occurred on December 26, 2004, and how this affected Thailand. The authors then consider the concepts of minimisation of the after effects, on local people, homes, businesses, stock, supplies and services, and tourism. In these respects, consideration is first given to the built environment and its operation. Then the possibilities for protection, using both natural and man-made methods are reviewed. This is followed by suggestions for research projects, both small and large, suitable for undergraduate, masters, and doctoral students in an international collaborative environment, is presented. Finally, some conclusions are made on the feasibility of such projects
{"title":"Affordable Strategies for the Reduction of Future Tsunami Effects on Local Populations in Phuket, Krabi and Phang Nga, Southern Thailand","authors":"R. Zobel, Pichaya Tandayya, H. Duerrast","doi":"10.1109/AMS.2007.9","DOIUrl":"https://doi.org/10.1109/AMS.2007.9","url":null,"abstract":"This paper initially reviews the sequence of events surrounding the tsunami disaster, which occurred on December 26, 2004, and how this affected Thailand. The authors then consider the concepts of minimisation of the after effects, on local people, homes, businesses, stock, supplies and services, and tourism. In these respects, consideration is first given to the built environment and its operation. Then the possibilities for protection, using both natural and man-made methods are reviewed. This is followed by suggestions for research projects, both small and large, suitable for undergraduate, masters, and doctoral students in an international collaborative environment, is presented. Finally, some conclusions are made on the feasibility of such projects","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126102905","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}
Fusion energy research has reached a state, where a transition from laboratory scale physics experiments to industrial scale reactors is necessary and possible. Current devices can routinely reach plasma conditions needed for a fusion reactor, but positive energy balance can only be achieved by increasing the machine size by about a factor of two above the currently largest device JET. Although the step seems to be straightforward it involves some qualitative differences: dominance of plasma self-heating by alpha particles, huge neutron load on all components, activation of the device, just to name a few. The paper gives an overview of the stand of fusion research, key components of a fusion reactor and simulation possibilities and needs in the hope to help modelers in other fields to contribute to the development of fusion power
{"title":"Modeling and Simulation Needs in Fusion Energy Research","authors":"S. Zoletnik","doi":"10.1109/AMS.2007.59","DOIUrl":"https://doi.org/10.1109/AMS.2007.59","url":null,"abstract":"Fusion energy research has reached a state, where a transition from laboratory scale physics experiments to industrial scale reactors is necessary and possible. Current devices can routinely reach plasma conditions needed for a fusion reactor, but positive energy balance can only be achieved by increasing the machine size by about a factor of two above the currently largest device JET. Although the step seems to be straightforward it involves some qualitative differences: dominance of plasma self-heating by alpha particles, huge neutron load on all components, activation of the device, just to name a few. The paper gives an overview of the stand of fusion research, key components of a fusion reactor and simulation possibilities and needs in the hope to help modelers in other fields to contribute to the development of fusion power","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124361765","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 adaptive thresholding technique based on gray level co-occurrence matrix (GLCM) is presented to handle images with fuzzy boundaries. As GLCM contains information on the distribution of gray level transition frequency and edge information, it is very useful for the computation of threshold value. Here the algorithm is designed to have flexibility on the edge definition so that it can handle the object's fuzzy boundaries. By manipulating information in the GLCM, a statistical feature is derived to act as the threshold value for the image segmentation process. The proposed method is tested with the starfruit defect images. To demonstrate the ability of the proposed method, experimental results are compared with three other thresholding techniques
{"title":"Adaptive Thresholding Based on Co-occurrence Matrix Edge Information","authors":"M. Mokji, S. Abu-Bakar","doi":"10.4304/jcp.2.8.44-52","DOIUrl":"https://doi.org/10.4304/jcp.2.8.44-52","url":null,"abstract":"In this paper, an adaptive thresholding technique based on gray level co-occurrence matrix (GLCM) is presented to handle images with fuzzy boundaries. As GLCM contains information on the distribution of gray level transition frequency and edge information, it is very useful for the computation of threshold value. Here the algorithm is designed to have flexibility on the edge definition so that it can handle the object's fuzzy boundaries. By manipulating information in the GLCM, a statistical feature is derived to act as the threshold value for the image segmentation process. The proposed method is tested with the starfruit defect images. To demonstrate the ability of the proposed method, experimental results are compared with three other thresholding techniques","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114657209","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
扫码关注我们
求助内容：
应助结果提醒方式：