发布求助
文献互助 智能选刊 最新文献

2008 Second Asia International Conference on Modelling & Simulation (AMS)最新文献

筛选
英文 中文
A Simple Deterministic Model for the Spread of Hand, Foot and Mouth Disease (HFMD) in Sarawak 沙捞越手足口病传播的简单确定性模型
2008 Second Asia International Conference on Modelling & Simulation (AMS) Pub Date : 2008-05-13 DOI: 10.1109/AMS.2008.139
Felix Chuo Sing Tiing, J. Labadin
{"title":"A Simple Deterministic Model for the Spread of Hand, Foot and Mouth Disease (HFMD) in Sarawak","authors":"Felix Chuo Sing Tiing, J. Labadin","doi":"10.1109/AMS.2008.139","DOIUrl":"https://doi.org/10.1109/AMS.2008.139","url":null,"abstract":"Hand, foot and mouth disease (HFMD) is considered a common disease among children. However, HFMD recent outbreaks in Sarawak had caused many death particularly children below the age of ten. In this study we are building a simple deterministic model based on the SIR (Susceptible-Infected-Recovered) model to predict the number of infected and the duration of an outbreak when it occurs. Our findings show that the disease spread quite rapidly and the parameter that may be able to control that would be the number of susceptible persons. We hope the model will allow public health personnel to plan intervention in an effective manner in order to reduce the effect of the disease in the coming outbreak.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"13 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":"123748003","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}
引用次数: 42
Modeling Group Decision-Making for Collaborative Teams in Enterprises 企业协作团队的群体决策建模
2008 Second Asia International Conference on Modelling & Simulation (AMS) Pub Date : 2008-05-13 DOI: 10.1109/AMS.2008.149
G. Rigopoulos, N. Karadimas, A. Orsoni
{"title":"Modeling Group Decision-Making for Collaborative Teams in Enterprises","authors":"G. Rigopoulos, N. Karadimas, A. Orsoni","doi":"10.1109/AMS.2008.149","DOIUrl":"https://doi.org/10.1109/AMS.2008.149","url":null,"abstract":"Multicriteria analysis can be incorporated as a method to model preferences and facilitate decision making within a group of decision makers. In this paper we present a Group Decision Support System model, which utilizes multicriteria analysis to support decisions in a collaborative team. In brief the model is based on the synthesis of group members' preferences following an appropriate aggregation procedure. The resulting group preference is used as input for the relevant multicriteria methodology to produce the decision outcome. In this paper we present a variation focusing on classification decisions in group setting. We outline the overall methodology as well as the architecture of a prototype group decision support system and present an application in a financial classification problem.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"128 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":"128095177","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}
引用次数: 7
Dependency Analysis of Message Packet Queues in Interconnection Networks with Faults 故障互联网络中消息包队列的相关性分析
2008 Second Asia International Conference on Modelling & Simulation (AMS) Pub Date : 2008-05-13 DOI: 10.1109/AMS.2008.14
F. Safaei, A. Khonsari, M. Analoui, Aresh Dadlani
{"title":"Dependency Analysis of Message Packet Queues in Interconnection Networks with Faults","authors":"F. Safaei, A. Khonsari, M. Analoui, Aresh Dadlani","doi":"10.1109/AMS.2008.14","DOIUrl":"https://doi.org/10.1109/AMS.2008.14","url":null,"abstract":"Many contemporary communication networks carry different types of traffics, each bearing specific characteristics of their own. The arrival process of packets outsourced from every single source node is approximated to a Poisson arrival process. Mostly, in network performance models, the exponential nature of the inter-arrival time in fault-free networks is determined by the dependency between inter-arrival times. But in most of the communication environments, in addition to minimizing packet delays and maximizing the network throughput, continuous functionality in the presence of faulty components has become a major issue. On such basis, the dependency phenomenon between consecutive service times as well as between service and inter-arrival times for packet queues in interconnection networks and in the vicinity of the faulty components can be of great importance. In this paper, we analyze the effect of such dependencies in packet queues through simulation experiments. We also study the behavior of an M/G/l queue with Poisson processes in face of faults. This study can be used to justify the predicted packet delays obtained from analytical models under diverse traffic patterns and various network conditions and prove beneficial by enlightening the limitations of network analytical approaches in using approximation methods for evaluating network of queues.","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":"115687352","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}
引用次数: 0
Verification Framework for Detecting Safety Violations in UML Statecharts 在UML状态图中检测安全违规的验证框架
2008 Second Asia International Conference on Modelling & Simulation (AMS) Pub Date : 2008-05-13 DOI: 10.1109/AMS.2008.9
C. M. Prashanth, K. Shet, J. Elamkulam
{"title":"Verification Framework for Detecting Safety Violations in UML Statecharts","authors":"C. M. Prashanth, K. Shet, J. Elamkulam","doi":"10.1109/AMS.2008.9","DOIUrl":"https://doi.org/10.1109/AMS.2008.9","url":null,"abstract":"The model based development is a widely accepted phenomenon to build dependable software. This has lead to development of tools which can generate deployable code from the model. Hence, ensuring the correctness of such models becomes extremely important. Model checking technique can be applied to detect specification violations in such models at the early stage of development life cycle. In practice, such validations are done using off-the-shelf model checkers. This technique though popular has a drawback that, model should be described in the native language of the model checker. In this paper, we propose a framework for the verification of the dynamic behavior of reactive systems modeled using UML (unified modeling language) statechart diagrams. The model is translated to an intermediate representation by parsing the information embedded behind the UML statecharts, this intermediate representation is used for checking the safety violations. Verification framework proposed is scalable to complex systems.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"18 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":"116978456","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}
引用次数: 3
A Comparison of Queuing Models for Handover Strategies in Cellular Mobile Telecommunication Systems 蜂窝移动通信系统中切换策略排队模型的比较
2008 Second Asia International Conference on Modelling & Simulation (AMS) Pub Date : 2008-05-13 DOI: 10.1109/AMS.2008.22
N. Osman, M. E. Woodward
{"title":"A Comparison of Queuing Models for Handover Strategies in Cellular Mobile Telecommunication Systems","authors":"N. Osman, M. E. Woodward","doi":"10.1109/AMS.2008.22","DOIUrl":"https://doi.org/10.1109/AMS.2008.22","url":null,"abstract":"The expanding mobile market has boosted the significance of handover management techniques. As cell sizes tend to decrease, the influx of handovers on each cell increases; bringing handover management techniques into the limelight. Consequently, handovers become one of the crucial assessing factors for the performance evaluation of cellular mobile communication systems. In order to evaluate the performance of handover management techniques, two different queuing models were designed: first come first serve (FCFS) and signal strength priority (SSP) queues. In case of FCFS, the handovers are served in the sequence of their arrival, whereas in SSP they are served in accordance to their signal strength. Computer simulations were developed to analyze the behavior of the two models. In order to validate the results, Markov analytical models were designed and programmed. This paper presents an in-depth comparative study of the queuing models using different quality of service (QoS) parameters.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"36 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":"117166391","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}
引用次数: 2
Performance Modeling and Simulation of Microstrip Dipole Array Antenna for WLAN Application 无线局域网用微带偶极子阵列天线性能建模与仿真
2008 Second Asia International Conference on Modelling & Simulation (AMS) Pub Date : 2008-05-13 DOI: 10.1109/AMS.2008.57
P. Soh, R. Amir, M. M. Aiza, A. Azremi, M. A. Aziz
{"title":"Performance Modeling and Simulation of Microstrip Dipole Array Antenna for WLAN Application","authors":"P. Soh, R. Amir, M. M. Aiza, A. Azremi, M. A. Aziz","doi":"10.1109/AMS.2008.57","DOIUrl":"https://doi.org/10.1109/AMS.2008.57","url":null,"abstract":"This paper proposed a performance simulation of a two-element, microstrip dipole array antenna for WLAN application. Simulation is done using two different simulation techniques, the circuit model (CM) derived from the transmission line model (TLM), and is compared with another simulation set using the Method of Moments (MoM). Both methods are simulated using Microwave Office. The basic microstrip dipole antenna is accurately modeled and the linear array structure is done by combining two basic units. Both simulation sets of MoM and CM are evaluated to determine their level of variation in terms of return loss (Su), bandwidth and resonant frequency (fres). The MoM designed for dipole antennas achieved the best return loss (Su), bandwidth and resonant frequency fres) at the desired frequency. The equivalent circuit proposed produced good return loss and comparable with simulation using MoMs. Details of the proposed antenna design and simulation results for 2.45 GHz WLAN band are presented and deliberated.","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":"123163140","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}
引用次数: 2
An Improved In Silico Algorithm for Output Visualization of DNA Computing Based on Real-Time PCR 一种基于实时荧光定量PCR的DNA计算输出可视化改进算法
2008 Second Asia International Conference on Modelling & Simulation (AMS) Pub Date : 2008-05-13 DOI: 10.1109/AMS.2008.24
M. F. Saaid, Z. Ibrahim, N. Sarmin
{"title":"An Improved In Silico Algorithm for Output Visualization of DNA Computing Based on Real-Time PCR","authors":"M. F. Saaid, Z. Ibrahim, N. Sarmin","doi":"10.1109/AMS.2008.24","DOIUrl":"https://doi.org/10.1109/AMS.2008.24","url":null,"abstract":"In the previous paper, a readout approach for the Hamiltonian Path Problem (HPP) in DNA computing based on the real-time polymerase chain reaction (PCR) was proposed. Based on this approach, realtime amplification was performed with the TaqMan probes and the TaqMan detection mechanism was exploited for the design and development of the proposed readout approach. The readout approach consists of two steps: real-time amplification in vitro using TaqMan-based real-time PCR, followed by information processing in silico to assess the results of real-time amplification, which in turn, enables extraction of the Hamiltonian path. The in silico information processing consists an algorithm to extract the Hamiltonian path based on result of in vitro realtime PCR experiment. However, this algorithm indirectly shows the Hamitonian path by only showing the location of each node for the HPP. Thus, in this paper, we modified the previous in silico algorithm such that the Hamiltonian path can be viewed directly after the in silico information processing of the TaqMan reactions based on real-time PCR is implemented. The modified algorithm can be easily implemented in the computerized application.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"34 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":"124467235","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}
引用次数: 0
Quantum Genetic Algorithm for Multiple RNA Structural Alignment 多RNA结构比对的量子遗传算法
2008 Second Asia International Conference on Modelling & Simulation (AMS) Pub Date : 2008-05-13 DOI: 10.1109/AMS.2008.151
Abdesslem Layeb, S. Meshoul, M. Batouche
{"title":"Quantum Genetic Algorithm for Multiple RNA Structural Alignment","authors":"Abdesslem Layeb, S. Meshoul, M. Batouche","doi":"10.1109/AMS.2008.151","DOIUrl":"https://doi.org/10.1109/AMS.2008.151","url":null,"abstract":"RNA structural alignment is one of key issues in bioinformatics. It aims to elucidate conserved structural regions among a set of sequences. Finding an accurate conserved structure is still difficult and a time consuming task that involves structural alignment as a prerequisite. In this work, structural alignment is viewed as an optimization process. A quantum based genetic algorithm is proposed to carry out this process. The main features of this algorithm consist in the quantum structure used to represent alignments and the quantum operators defining the overall evolutionary dynamic of the genetic algorithm. The quantum structure relies on the concept of qubit and allows efficient encoding of individuals. Experiments on a wide range of data sets have shown the effectiveness of the proposed framework and its ability to achieve good quality solutions.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"15 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":"125262744","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}
引用次数: 13
Augmentation of Elman Recurrent Network Learning with Particle Swarm Optimization Elman循环网络学习的粒子群算法增强
2008 Second Asia International Conference on Modelling & Simulation (AMS) Pub Date : 2008-05-13 DOI: 10.1109/AMS.2008.50
Mohamad Firdaus Ab Aziz, Haza Nuzly Abdul Hamed, S. Shamsuddin
{"title":"Augmentation of Elman Recurrent Network Learning with Particle Swarm Optimization","authors":"Mohamad Firdaus Ab Aziz, Haza Nuzly Abdul Hamed, S. Shamsuddin","doi":"10.1109/AMS.2008.50","DOIUrl":"https://doi.org/10.1109/AMS.2008.50","url":null,"abstract":"Despite a variety of artificial neural network (ANN) categories, backpropagation network (BP) and Elman recurrent network (ERN) are the widespread modus operandi in real applications. 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 backpropagation (ERNBP) and Elman recurrent network with particle swarm optimization (ERNPSO) to probe the performance of both networks. The comparisons are done with PSO that is integrated with neural network (PSONN) and GA with neural network (GANN). The results show that ERNPSO furnishes promising outcomes in terms of classification accuracy and convergence rate compared to ERNBP, PSONN and GANN.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"116 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":"126381598","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}
引用次数: 3
Higher Dimensional Cost Function for Synthesis of Evolutionary Algorithms by means of Symbolic Regression 用符号回归方法综合进化算法的高维代价函数
2008 Second Asia International Conference on Modelling & Simulation (AMS) Pub Date : 2008-05-13 DOI: 10.1109/AMS.2008.67
Z. Oplatková, I. Zelinka
{"title":"Higher Dimensional Cost Function for Synthesis of Evolutionary Algorithms by means of Symbolic Regression","authors":"Z. Oplatková, I. Zelinka","doi":"10.1109/AMS.2008.67","DOIUrl":"https://doi.org/10.1109/AMS.2008.67","url":null,"abstract":"This contribution deals with a new idea of how to create evolutionary algorithms by means of symbolic regression and Analytic Programming. The motivation was not only to tune some existing algorithms to their better performance, but also to find a new robust evolutionary algorithm. In this study operators of Differential Evolution (DE), SelfOrganizing Migrating Algortithm (SOMA), Hill Climbing (HC) and Simulated Annealing (SA) were used during a process of Analytic Programming. The results showed that AP was able to find successful as well as the original DE or SOMA. The cost function includes not only success in unimodal and multimodal benchmark function but also rules concerned to cost function evaluations. Results were tested on 16 benchmark functions in 2D, 20 D and 100 dimensional versions, i.e. 192 test, each was 100 times repeated and each of 100 repetitions has around 200 000 cost function evaluations. The results are presented in tabular and graphic form.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"27 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":"126031356","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信