This paper is focused on modeling and simulation of an active vibration control (AVC) system for a rectangular flexible thin plate with all clamped edge through the use of position feedback. The plate system was first modeled using Finite Difference (FD) approach. Then, the validity of the obtained model was investigated through comparative studies between the plate natural frequencies predicted by the model and the exact values of resonance modes. The control algorithm was then implemented within the FD simulation platform. Different types of disturbances were applied to excite the plate system at excitation point and the performance of the controller in reducing the unwanted vibration was evaluated. Results of the study demonstrate the effectiveness of the proposed control strategy to attenuate the unwanted vibrations of the flexible thin plate system.
{"title":"Modeling and Simulation of an Active Vibration Control System for a Flexible Structure Using Finite Difference Method","authors":"A. Tavakolpour, I. Darus, M. Mailah","doi":"10.1109/AMS.2009.136","DOIUrl":"https://doi.org/10.1109/AMS.2009.136","url":null,"abstract":"This paper is focused on modeling and simulation of an active vibration control (AVC) system for a rectangular flexible thin plate with all clamped edge through the use of position feedback. The plate system was first modeled using Finite Difference (FD) approach. Then, the validity of the obtained model was investigated through comparative studies between the plate natural frequencies predicted by the model and the exact values of resonance modes. The control algorithm was then implemented within the FD simulation platform. Different types of disturbances were applied to excite the plate system at excitation point and the performance of the controller in reducing the unwanted vibration was evaluated. Results of the study demonstrate the effectiveness of the proposed control strategy to attenuate the unwanted vibrations of the flexible thin plate system.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"18 1","pages":"448-453"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87119542","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}
Pervasive grids are service-oriented architecture,allowing sharing of resources through a flexible infrastructure, stable infrastructure providing computing power and secondly mobile devices allowing access to that power. They are characterized by their large scale in terms of number of resources, many users and geographical extent, heterogeneity and dynamism of their resources. The complexity of pervasive grids in regard to the study and evaluation of issues relating to the latter makes use of simulation that will allow study of more realistic scenarios and observe other performance criteria. In the absence of simulation tools for these platforms, the contribution of this paper is therefore to achieve a simulation tool capable of simulating any pervasive grid; we developed the library of simulation PGS "Pervasive Grid Simulator". This library is built on the basis of Java. PGS is composed of three main packages (PGS.pervasif, PGS.grille and PGS.GP).
{"title":"PGS: Pervasive Grid Simulator Library","authors":"M. Rebbah, M. Chakir, Souane Naima, Ghezal Kheira","doi":"10.1109/AMS.2009.40","DOIUrl":"https://doi.org/10.1109/AMS.2009.40","url":null,"abstract":"Pervasive grids are service-oriented architecture,allowing sharing of resources through a flexible infrastructure, stable infrastructure providing computing power and secondly mobile devices allowing access to that power. They are characterized by their large scale in terms of number of resources, many users and geographical extent, heterogeneity and dynamism of their resources. The complexity of pervasive grids in regard to the study and evaluation of issues relating to the latter makes use of simulation that will allow study of more realistic scenarios and observe other performance criteria. In the absence of simulation tools for these platforms, the contribution of this paper is therefore to achieve a simulation tool capable of simulating any pervasive grid; we developed the library of simulation PGS \"Pervasive Grid Simulator\". This library is built on the basis of Java. PGS is composed of three main packages (PGS.pervasif, PGS.grille and PGS.GP).","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"41 1","pages":"584-589"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86678047","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 beyond 3G networks, the adequate design of the transmission network that diverts the data traffic of the NodeBs to the core network is an important challenge. Due to the deployment of new radio access technologies, and the dramatic traffic increase, the network operators tend to apply traffic aggregation techniques within their transmission network to reach higher utilization. This paper presents a method for the design of microwave transmission network topology and optimal link capacity assignment. The method considers the traffic conditions of the NodeBs; the number, lengths and capacities of the available microwave links; the available number of pylons/buildings with given upper-bound on the number of antennas; the traffic aggregation factor at the NodeBs; the costs of the transmission capacities; and topology constraints. The method finds the network topology and a capacity planning with the less cost within the set of candidate topologies.
{"title":"A Novel Transmission Network Design Method for Beyond 3G Networks","authors":"Z. Faigl, T. Radvanszki, Tamas Orvos","doi":"10.1109/AMS.2009.22","DOIUrl":"https://doi.org/10.1109/AMS.2009.22","url":null,"abstract":"In beyond 3G networks, the adequate design of the transmission network that diverts the data traffic of the NodeBs to the core network is an important challenge. Due to the deployment of new radio access technologies, and the dramatic traffic increase, the network operators tend to apply traffic aggregation techniques within their transmission network to reach higher utilization. This paper presents a method for the design of microwave transmission network topology and optimal link capacity assignment. The method considers the traffic conditions of the NodeBs; the number, lengths and capacities of the available microwave links; the available number of pylons/buildings with given upper-bound on the number of antennas; the traffic aggregation factor at the NodeBs; the costs of the transmission capacities; and topology constraints. The method finds the network topology and a capacity planning with the less cost within the set of candidate topologies.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"38 1","pages":"704-709"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86263983","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}
Development of mathematical models to predict the values of performance measure is important in order to have a better understanding of the machining process. Surface roughness is one of the most common performance measures in machining process and an effective parameter in representing the quality of machined surface. The minimization of the machining performance measures such as surface roughness must be formulated in the standard mathematical model. To predict the minimum values of surface roughness, the process of modeling is taken in this study. The developed model deals with real experimental data of the surface roughness performance measure in the end milling machining process. Two modeling approaches, Regression and Artificial Neural Network techniques are applied to predict the minimum value of surface roughness. The result of the modeling process indicated that Artificial Neural Network technique gave a better prediction of surface roughness compared to the result of Regression technique.
{"title":"Application of Regression and ANN Techniques for Modeling of the Surface Roughness in End Milling Machining Process","authors":"A. Zain, H. Haron, S. Sharif","doi":"10.1109/AMS.2009.76","DOIUrl":"https://doi.org/10.1109/AMS.2009.76","url":null,"abstract":"Development of mathematical models to predict the values of performance measure is important in order to have a better understanding of the machining process. Surface roughness is one of the most common performance measures in machining process and an effective parameter in representing the quality of machined surface. The minimization of the machining performance measures such as surface roughness must be formulated in the standard mathematical model. To predict the minimum values of surface roughness, the process of modeling is taken in this study. The developed model deals with real experimental data of the surface roughness performance measure in the end milling machining process. Two modeling approaches, Regression and Artificial Neural Network techniques are applied to predict the minimum value of surface roughness. The result of the modeling process indicated that Artificial Neural Network technique gave a better prediction of surface roughness compared to the result of Regression technique.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"15 1","pages":"188-193"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80413114","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}
A. Hajipour, Yasaman Heydarzadeh, A. Haghighat, A. Bastanfard
In the real world, teams use a set of primitive strategies to achieve goal that in fact consists of consecutions of the passes and the movements’ manner of the players for achieving goal. By using case based reasoning, it is possible, along with using primitive strategies, to register a successful succession to achieve goal, or a shot on goal, in the case base; and in the similar cases these strategies can be used. This paper proposes a new approach for registering learned strategies during games and retrieving them and also a general model for using case based reasoning which uses linked list to save key points. Efficiency of our approach has been verified by comparing two teams of which one uses the mentioned method for attacking and defending and the other lacks such capability or uses simple form of case based reasoning.
{"title":"An Efficient Method for Logging Strategy Using Case Based Reasoning in Soccer Simulation","authors":"A. Hajipour, Yasaman Heydarzadeh, A. Haghighat, A. Bastanfard","doi":"10.1109/AMS.2009.19","DOIUrl":"https://doi.org/10.1109/AMS.2009.19","url":null,"abstract":"In the real world, teams use a set of primitive strategies to achieve goal that in fact consists of consecutions of the passes and the movements’ manner of the players for achieving goal. By using case based reasoning, it is possible, along with using primitive strategies, to register a successful succession to achieve goal, or a shot on goal, in the case base; and in the similar cases these strategies can be used. This paper proposes a new approach for registering learned strategies during games and retrieving them and also a general model for using case based reasoning which uses linked list to save key points. Efficiency of our approach has been verified by comparing two teams of which one uses the mentioned method for attacking and defending and the other lacks such capability or uses simple form of case based reasoning.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"52 1","pages":"67-72"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82157207","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}
Users and resources in a system are defined subjects and objects separately and abstractly by a mandatory access control mechanism. Both subjects and objects are endowed with security levels. The computer′s security on basis of the operating system, and the operating system is the basic software of a computer. We present a model of security operating system. As we know the operating system has many security disables. But after the research on current security of Linux OS, this paper using access controlling, auditing and LPT designs a generalized security operating system. The design principles of security architecture and three basic security models: confidentiality, integrity, and privilege control models are discussed, respectively. Three novel security models and new security architecture are proposed. And this model was able to satisfy the standard of security operating system.
{"title":"Design for Security Operating System","authors":"Wenzheng Zhu, Changhoon Lee","doi":"10.1109/AMS.2009.109","DOIUrl":"https://doi.org/10.1109/AMS.2009.109","url":null,"abstract":"Users and resources in a system are defined subjects and objects separately and abstractly by a mandatory access control mechanism. Both subjects and objects are endowed with security levels. The computer′s security on basis of the operating system, and the operating system is the basic software of a computer. We present a model of security operating system. As we know the operating system has many security disables. But after the research on current security of Linux OS, this paper using access controlling, auditing and LPT designs a generalized security operating system. The design principles of security architecture and three basic security models: confidentiality, integrity, and privilege control models are discussed, respectively. Three novel security models and new security architecture are proposed. And this model was able to satisfy the standard of security operating system.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"1 1","pages":"667-670"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82384205","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 explosive growth in medical imaging technologies has been matched by a tremendous increase in the number of investigations centred on the structural and functional organisation of the human body. Therefore working with neuroscientific data has faced experts with two major problems; one is the large amount of data and the other is complexity of it. Many scientists and physicians are working on Brain Projects in different aspects. Capturing and processing human brain images are not easy tasks. The fact that the Talairach brain fails to match individual scans motivate us to use other type of approaches and algorithms. With using brain anatomy as a source for integrating different types of images, researchers try to segment the human brain in different aspects. By taking advantage of hierarchical clustering algorithm we try to present an effective and more accurate approach for human brain image processing.
{"title":"A Proposed Method for Brain Medical Image Registration by Hierarchical Clustering Algorithm","authors":"Hamidreza Pooshfam, R. Abdullah","doi":"10.1109/AMS.2009.102","DOIUrl":"https://doi.org/10.1109/AMS.2009.102","url":null,"abstract":"The explosive growth in medical imaging technologies has been matched by a tremendous increase in the number of investigations centred on the structural and functional organisation of the human body. Therefore working with neuroscientific data has faced experts with two major problems; one is the large amount of data and the other is complexity of it. Many scientists and physicians are working on Brain Projects in different aspects. Capturing and processing human brain images are not easy tasks. The fact that the Talairach brain fails to match individual scans motivate us to use other type of approaches and algorithms. With using brain anatomy as a source for integrating different types of images, researchers try to segment the human brain in different aspects. By taking advantage of hierarchical clustering algorithm we try to present an effective and more accurate approach for human brain image processing.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"26 1","pages":"315-319"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82614292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As the widespread modus operandi in real applications, Backpropagation(BP) in Recurrent Neural Networks (RNN) is computationally more powerful than standard feedforward neural networks. In principle, RNN can implement almost any arbitrary sequential behavior. However, there are many drawbacks in BP network, for instance, confinement in finding local minimum and may get stuck at regions of a search space or trap in local minima. To solve these problems, various optimization techniques such as Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) have been executed to improve ANN performance. In this study, we exploit errors optimization of Elman Recurrent Network with Particle Swarm Optimization (ERNPSO) to probe the performance of both networks with bounded Vmax function. Main characteristics of Vmax function are to control the global exploration of particles in PSO. The results show that ERNPSO with bounded Vmax of hyperbolic tangent furnishes promising outcomes in terms of classification accuracy and convergence rate compared to bounded Vmax sigmoid function and standard Vmax function.
{"title":"Enhancement of Particle Swarm Optimization in Elman Recurrent Network with Bounded Vmax Function","authors":"Mohamad Firdaus Ab Aziz, S. Shamsuddin, R. Alwee","doi":"10.1109/AMS.2009.90","DOIUrl":"https://doi.org/10.1109/AMS.2009.90","url":null,"abstract":"As the widespread modus operandi in real applications, Backpropagation(BP) in Recurrent Neural Networks (RNN) is computationally more powerful than standard feedforward neural networks. In principle, RNN can implement almost any arbitrary sequential behavior. However, there are many drawbacks in BP network, for instance, confinement in finding local minimum and may get stuck at regions of a search space or trap in local minima. To solve these problems, various optimization techniques such as Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) have been executed to improve ANN performance. In this study, we exploit errors optimization of Elman Recurrent Network with Particle Swarm Optimization (ERNPSO) to probe the performance of both networks with bounded Vmax function. Main characteristics of Vmax function are to control the global exploration of particles in PSO. The results show that ERNPSO with bounded Vmax of hyperbolic tangent furnishes promising outcomes in terms of classification accuracy and convergence rate compared to bounded Vmax sigmoid function and standard Vmax function.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"52 1","pages":"125-130"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75432926","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}
Chang Choi, Miyoung Cho, J-U Choi, Myunggwon Hwang, Jong-An Park, Pankoo Kim
Nowadays, travel information is increasing to appeal the tourists on the web. Although there are numerous information provided on the web, the user gets puzzled in finding accurate information. In order to solve these web problems, the concept of semantic web comes into existence to have communication between human and computer.In this paper, we propose intelligent recommendation system based on Jeju travel ontology. The proposed system can recommend the tourist more intelligent information using properties, relationships of travel ontology. Next, the system is responsible for finding personalized attractions and plotting location of traveler on the AlMap.
{"title":"Travel Ontology for Intelligent Recommendation System","authors":"Chang Choi, Miyoung Cho, J-U Choi, Myunggwon Hwang, Jong-An Park, Pankoo Kim","doi":"10.1109/AMS.2009.75","DOIUrl":"https://doi.org/10.1109/AMS.2009.75","url":null,"abstract":"Nowadays, travel information is increasing to appeal the tourists on the web. Although there are numerous information provided on the web, the user gets puzzled in finding accurate information. In order to solve these web problems, the concept of semantic web comes into existence to have communication between human and computer.In this paper, we propose intelligent recommendation system based on Jeju travel ontology. The proposed system can recommend the tourist more intelligent information using properties, relationships of travel ontology. Next, the system is responsible for finding personalized attractions and plotting location of traveler on the AlMap.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"29 1","pages":"637-642"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75573773","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, Z. Ibrahim, Noor Khafifah Khalid, M. Khalid
DNA computing is a new computing paradigm which uses bio-molecular as information storage media and biochemical tools as information processing operators. It has shows many successful and promising results for various applications. Since DNA reactions are probabilistic reactions, it can cause the different results for the same situations, which can be regarded as errors in the computation. To overcome the drawbacks, much works have focused to design the error-minimized DNA sequences to improve the reliability of DNA computing. In this research, Population-based ACO (P-ACO) is proposed to solve the DNA sequence optimization. P-ACO approach is a meta-heuristic algorithm that uses some ants to obtain the solutions based on the pheromone in their colony. The DNA sequence design problem is modelled by four nodes, representing four DNA bases (A, T, C, and G). The results from the proposed algorithm are compared with other sequence design methods, which are Genetic Algorithm (GA), and Multi-Objective Evolutionary Algorithm (MOEA) methods. The DNA sequences optimized by the proposed approach have better result in some objective functions than the other methods.
{"title":"A Population-Based Ant Colony Optimization Approach for DNA Sequence Optimization","authors":"T. Kurniawan, Z. Ibrahim, Noor Khafifah Khalid, M. Khalid","doi":"10.1109/AMS.2009.79","DOIUrl":"https://doi.org/10.1109/AMS.2009.79","url":null,"abstract":"DNA computing is a new computing paradigm which uses bio-molecular as information storage media and biochemical tools as information processing operators. It has shows many successful and promising results for various applications. Since DNA reactions are probabilistic reactions, it can cause the different results for the same situations, which can be regarded as errors in the computation. To overcome the drawbacks, much works have focused to design the error-minimized DNA sequences to improve the reliability of DNA computing. In this research, Population-based ACO (P-ACO) is proposed to solve the DNA sequence optimization. P-ACO approach is a meta-heuristic algorithm that uses some ants to obtain the solutions based on the pheromone in their colony. The DNA sequence design problem is modelled by four nodes, representing four DNA bases (A, T, C, and G). The results from the proposed algorithm are compared with other sequence design methods, which are Genetic Algorithm (GA), and Multi-Objective Evolutionary Algorithm (MOEA) methods. The DNA sequences optimized by the proposed approach have better result in some objective functions than the other methods.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"9 1","pages":"246-251"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76167079","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
扫码关注我们
求助内容：
应助结果提醒方式：