{"title":"Spectral Angle Based Kernels for the Classification of Hyperspectral Images Using Support Vector Machines","authors":"M. Sap, Mojtaba Kohram","doi":"10.1109/AMS.2008.152","DOIUrl":"https://doi.org/10.1109/AMS.2008.152","url":null,"abstract":"Support vector machines (SVM) have been extensively used for classification purposes in a broad range of applications. These learning machines base their classification on the Euclidean distance of the data vectors or their dot products. These measures do not account for the spectral signature information that can be achieved from remote sensing images. Given the high value of this information, integrating it into the SVM algorithm is a reasonable suggestion. This paper utilizes the spectral angle (SA) function as a measure for classification of a hyperspectral image. The SA function is joined together with the radial basis function (RBF) to form a spectral angle based RBF function. Experimentation results are promising and confirm that this approach can compete with existing classification methods.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129751107","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}
{"title":"Modified Stream Control Transmission Protocol over Broadband High Latency Networks","authors":"G. Tomar, B. Chaurasia","doi":"10.1109/AMS.2008.195","DOIUrl":"https://doi.org/10.1109/AMS.2008.195","url":null,"abstract":"Stream Control Transmission Protocol (SCTP) is newly emerged protocol, which is combination of good qualities of TCP and UDP. It is a reliable message oriented protocol providing multistreaming and multihoming. In this paper, a modified algorithm is proposed for dealing multiple packet losses which improves congestion control mechanism in network. Proposed SCTP is a simple sender side alteration to the SCTP congestion window update algorithm with same traditional SCTP receiver. The results are compared with traditional SCTP and Scalable SCTP traffic using Network Simulator-2 and result is better than the other schemes.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129612738","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}
{"title":"Simulation Study of Real-Time Load Distribution Routing in Wireless Sensor Networks","authors":"A. A. Ahmed, L. Latiff, N. Fisal","doi":"10.1109/AMS.2008.134","DOIUrl":"https://doi.org/10.1109/AMS.2008.134","url":null,"abstract":"In Wireless Sensor Networks (WSNs), sensors gather information about the physical world and base station makes appropriate decision upon the environment. This technology enables users to effectively sense and monitor from a distance. WSN are slated to become very popular in the near future. It allows video/audio streaming to be transferred between sensor nodes in real-time. WSN can use realtime forwarding which means messages in the network are delivered according to their end-to-end deadlines (packet lifetime). This paper proposes a novel realtime routing protocol based on link quality, packet velocity over one-hop and remaining power in the sensor devices. The simulation results in this paper show that the proposed routing protocol has efficient power consumption, high packet delivery ratio, and minimum control packet overhead in WSNs.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124569874","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}
{"title":"Shared Variable Management in SOAr-DSGrid","authors":"Xinjun Chen, Wentong Cai, S. Turner, Yong Wang","doi":"10.1109/AMS.2008.161","DOIUrl":"https://doi.org/10.1109/AMS.2008.161","url":null,"abstract":"Simulation is a low cost alternative to experimentation on real-world physical systems. In light of the prevalence of web services, issues relating to distributed simulation using web services have come to the fore in recent years. We have proposed a service-oriented architecture for distributed simulations on the Grid (SOAr-DSGrid). SOAr-DSGrid facilitates the development and execution of distributed simulations in different views (i.e., a component-based view for development and a service-oriented view for execution). At run time, one component may require information from another component for execution or decision-making. In SOAr-DSGrid, this shared information from one component to another component is implemented through shared variables. Since two components may execute out of phase, without proper shared variable management, the value provided by one component may be invalid for another component due to the time difference. Since SOAr-DSGrid provides a service-oriented view for component execution, the development of shared variable support also follows the service-oriented methodology. Three different approaches, namely Pull without FutureList, Pull with FutureList, and Push, have been implemented as the internal mechanism to solve the shared variable issue. Experimental results of the performance of these three approaches are also presented in this paper.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124995303","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}
T. Kurniawan, Noor Khafifah Khalid, Z. Ibrahim, M. Khalid, M. Middendorf
{"title":"Evaluation of Ordering Methods for DNA Sequence Design Based on Ant Colony System","authors":"T. Kurniawan, Noor Khafifah Khalid, Z. Ibrahim, M. Khalid, M. Middendorf","doi":"10.1109/AMS.2008.37","DOIUrl":"https://doi.org/10.1109/AMS.2008.37","url":null,"abstract":"Hybridization between a DNA sequence and its base-pairing complement is crucial in DNA computing to retrieve the information stored in DNA sequences and operate a computation processes. Therefore, much works have focused on designing the DNA sequences for a reliable molecular computation. In this paper, Ant Colony System (ACS) is proposed to solve the DNA sequence design problem. ACS, which is based on Ant Colony Optimization (ACO) is an improvement of Ant System (AS) that uses some agents to obtain the solutions based on the pheromone in their colony. The DNA sequence design problem is modeled by four nodes, representing four DNA bases (A, T, C, and G) using the nearest-neighbor thermodynamic parameter's Watson-Crick base-pair DeltaGdeg37 as distances between one node to other nodes. Seven ordering methods for ACS are presented in this study in order to obtain the best set solution. The performance of each of those methods are compared and evaluated to decide the best ordering method for this application.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124409016","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}
{"title":"A High Performance Parallel IP Lookup Technique Based on Multiprocessor Organization and CREW PRAM","authors":"M. Hasanloo, A. Amiri, M. Fathy","doi":"10.1109/AMS.2008.78","DOIUrl":"https://doi.org/10.1109/AMS.2008.78","url":null,"abstract":"The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traffic and migration to IPv6 addresses. The IP routing lookup involves computation of the Longest Prefix Matching for which existing solutions, such as BSD Radix Tries, scale poorly when traffic in the router increases or when employed for IPv6 address lookups. In this paper, we describe a CREW PRAM multiprocessor organization lookup that uses P processor for solving LPM problem. By this technique P-l IP addresses can be looked up simultaneously thus the performance of processors increase in linear manner. First we categorize all prefixes in some groups based on their first two bytes and sort them into their groups. By assuming M prefixes exist in a group then time complexity of insertion algorithm in worst case reduces to 0(Log M + M/2) and the time complexity of search, update and deletion algorithms reduce to log(M) for each prefix.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128986180","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}
{"title":"Net-Centric Supply Chain Management Based on Interoperable Simulation","authors":"A. Bruzzone","doi":"10.1109/AMS.2008.148","DOIUrl":"https://doi.org/10.1109/AMS.2008.148","url":null,"abstract":"Netcentric Management is an interesting concept, born in military environment, that today is very promising in supply chain management for its contribution in term of robustness and risk management; in this context it is possible to develop a real distributed control system and to share available resources and information of logistics networks; however the effective development of these concepts is strictly related to the creation of interoperable simulators dynamically integrated in the Supply Chain. In this context M&S (Modelling & Simulation) is the real technology enabler for moving these interesting concepts to real competitiveness advantage. This paper presents the use of simulation as tool for policy re-engineer and decision support system in the netcentric supply chain management by proposing advanced solutions under experimentation in this area.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130694498","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}
{"title":"An Improved Median Filter Based on Efficient Noise Detection for High Quality Image Restoration","authors":"J. Mohammed","doi":"10.1109/AMS.2008.96","DOIUrl":"https://doi.org/10.1109/AMS.2008.96","url":null,"abstract":"To restore images corrupted by impulse noise, various image filtering strategies have been proposed. However, a common drawback of these methods is that the details and edges can not recovered satisfactorily when the noise level is high. A novel method based on efficient noise detection algorithm is proposed in this paper for effectively denoising extremely corrupted images and better details and edges preservation. The proposed method replaces only noisy pixel by either the median value or by a noise-free pixel value inside the selected filtering window. While uncorrupted pixels are remain unchanged. The key feature of the proposed method is very high noise detection accuracy, yielding zero miss-detection rate. Comparative studies of the proposed method and other methods for different images are made and the advantages of the proposed method are fully demonstrated.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131198469","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}
{"title":"Modeling and Simulation of 6-Pulse and 12-Pulse Rectifiers under Balanced and Unbalanced Conditions with Impacts to Input Current Harmonics","authors":"A. Hernadi, Taufik, M. Anwari","doi":"10.1109/AMS.2008.88","DOIUrl":"https://doi.org/10.1109/AMS.2008.88","url":null,"abstract":"This paper discusses the impact of using 6-pulse and 12-pulse rectifier circuit commonly found in Adjustable Speed Drives. The 12-pulse topology is known to be more expensive, but produce the least input current harmonics. However, the latter statement is completely true under balanced line conditions. In practice, the lines are inherently unbalanced. Hence, the question of whether the 12-pulse rectifier will indeed perform better in terms of the harmonics injected to the line is still under on-going discussions. This paper presents the modeling and simulation of both rectifier topologies to compare their input current harmonics. The rectifiers are modeled using OrCAD Pspice and several common cases of line conditions will be simulated to compare their harmonic levels. Results of the simulations pertaining to their Total Harmonic Distortions for each case will be explored.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132542664","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}
{"title":"A Bee Colony Optimization Algorithm for Traveling Salesman Problem","authors":"L. Wong, M. Low, C. Chong","doi":"10.1109/AMS.2008.27","DOIUrl":"https://doi.org/10.1109/AMS.2008.27","url":null,"abstract":"A bee colony optimization (BCO) algorithm for traveling salesman problem (TSP) is presented in this paper. The BCO model is constructed algorithmically based on the collective intelligence shown in bee foraging behaviour. Experimental results comparing the proposed BCO model with some existing approaches on a set of benchmark problems are presented.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131930166","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}