Today, IT organizations have encountered growing challenges in the management and maintenance of large scale heterogeneous distributed computing systems because these systems have to be active and available at all hours. Therefore, it is difficult for administrators to manage such systems and handle changes occured at all hours. Moreover, current programming languages, methods, and management tools are inadequate to handle complexity, heterogeneity, scale, dynamism, and uncertainty as the most important challenges in such systems. Therefore, researchers investigate new ideas to address the problems created by IT complexity. One such idea is autonomic computing (AC). Autonomic computing systems (ACSs) are systems that manage themselves. This paper provides a thorough survey of autonomic computing systems, presenting their definitions, their characteristics and effects on quality factors, their architecture, issues and challenges
{"title":"Autonomic Computing: A New Approach","authors":"M. R. Nami, M. Sharifi","doi":"10.1109/AMS.2007.20","DOIUrl":"https://doi.org/10.1109/AMS.2007.20","url":null,"abstract":"Today, IT organizations have encountered growing challenges in the management and maintenance of large scale heterogeneous distributed computing systems because these systems have to be active and available at all hours. Therefore, it is difficult for administrators to manage such systems and handle changes occured at all hours. Moreover, current programming languages, methods, and management tools are inadequate to handle complexity, heterogeneity, scale, dynamism, and uncertainty as the most important challenges in such systems. Therefore, researchers investigate new ideas to address the problems created by IT complexity. One such idea is autonomic computing (AC). Autonomic computing systems (ACSs) are systems that manage themselves. This paper provides a thorough survey of autonomic computing systems, presenting their definitions, their characteristics and effects on quality factors, their architecture, issues and challenges","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"11 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":"127804446","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}
It is shown that redundancy may be introduced at packet level for any type of network that will allow networks themselves to self-correct information and to improve data reliability by several orders-of-magnitude. Modelling and simulation of packet error correction has used an example static Bluetooth personal area network, PAN containing mobile slave devices. A novel retransmission of selected corrupt packets was used for point-to-point communication. This resulted in three orders-of-magnitude improvement in packet error rate for frames of 16 packets and a transmission redundancy overhead of only 50%. Two different example communication routing schema are then suggested that allow all masters to be connected. Slaves or masters can communicate with all other Bluetooth devices using at least two independent paths. Redundant packet copies can then be routed. This shows a network itself can be used for the purpose of improving information reliability. This is a new idea
{"title":"Packet Error Correction in Personal Area Networks","authors":"J. Pollard","doi":"10.1109/AMS.2007.77","DOIUrl":"https://doi.org/10.1109/AMS.2007.77","url":null,"abstract":"It is shown that redundancy may be introduced at packet level for any type of network that will allow networks themselves to self-correct information and to improve data reliability by several orders-of-magnitude. Modelling and simulation of packet error correction has used an example static Bluetooth personal area network, PAN containing mobile slave devices. A novel retransmission of selected corrupt packets was used for point-to-point communication. This resulted in three orders-of-magnitude improvement in packet error rate for frames of 16 packets and a transmission redundancy overhead of only 50%. Two different example communication routing schema are then suggested that allow all masters to be connected. Slaves or masters can communicate with all other Bluetooth devices using at least two independent paths. Redundant packet copies can then be routed. This shows a network itself can be used for the purpose of improving information reliability. This is a new idea","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"46 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":"115787726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we have adopted an agent approach for traffic light control. According to this approach, our system consists of agents and their world. In the traffic context, the world consists of cars, road networks, traffic lights, etc. Each of these agents controls all traffic lights at a road junction by an observe-think-act cycle. That is, the agent repeatedly observes the current traffic condition at the junction, it then uses this information to reason with condition-action rules to determine how the agent should act in what traffic condition, and finally it performs those actions in order to efficiently manage the traffic flows. We have also developed a NetLogo-based traffic simulator to serve as the agents' world. Our approach is experimented with traffic control of a few connected junctions and the result obtained is promising; it can reduce the average delayed time of each car at each traffic-light near a junction rather substantially when compared with other approaches
{"title":"An Agent Approach for Intelligent Traffic-Light Control","authors":"Visit Hirankitti, Jaturapith Krohkaew","doi":"10.1109/AMS.2007.11","DOIUrl":"https://doi.org/10.1109/AMS.2007.11","url":null,"abstract":"In this paper we have adopted an agent approach for traffic light control. According to this approach, our system consists of agents and their world. In the traffic context, the world consists of cars, road networks, traffic lights, etc. Each of these agents controls all traffic lights at a road junction by an observe-think-act cycle. That is, the agent repeatedly observes the current traffic condition at the junction, it then uses this information to reason with condition-action rules to determine how the agent should act in what traffic condition, and finally it performs those actions in order to efficiently manage the traffic flows. We have also developed a NetLogo-based traffic simulator to serve as the agents' world. Our approach is experimented with traffic control of a few connected junctions and the result obtained is promising; it can reduce the average delayed time of each car at each traffic-light near a junction rather substantially when compared with other approaches","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"138 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":"123216513","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}
Many real world situations involve queueing systems in which customers renege (leave the queue after entering) according to a given distribution. We consider a system with a single deterministic server and FCFS scheduling discipline. Customer interarrival times are distributed exponentially. Each arriving customer is limited to a deterministically distributed patience time after which it must depart the system, and is considered lost. We present an insightful model to calculate the average number of customers in a reneging system using a related queueing system in which customers balk (refuse to join the queue) with a probability. Then, we derive expressions to calculate the probabilities of the number of customers in a balking system. Using these probabilities, we provide useful results such as calculation of jitter and average degree of multiplexing. Simulation experiments under different working conditions verify the validity of the proposed equations
{"title":"Flows with Bounded Waiting Time in Networked and Distributed Systems","authors":"Ali Rajabi, F. Hormozdiari, A. Khonsari","doi":"10.1109/AMS.2007.45","DOIUrl":"https://doi.org/10.1109/AMS.2007.45","url":null,"abstract":"Many real world situations involve queueing systems in which customers renege (leave the queue after entering) according to a given distribution. We consider a system with a single deterministic server and FCFS scheduling discipline. Customer interarrival times are distributed exponentially. Each arriving customer is limited to a deterministically distributed patience time after which it must depart the system, and is considered lost. We present an insightful model to calculate the average number of customers in a reneging system using a related queueing system in which customers balk (refuse to join the queue) with a probability. Then, we derive expressions to calculate the probabilities of the number of customers in a balking system. Using these probabilities, we provide useful results such as calculation of jitter and average degree of multiplexing. Simulation experiments under different working conditions verify the validity of the proposed equations","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"61 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":"125393323","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 different applications make performance evaluation for data-intensive large-scale systems become a very important work. General test methods pursue the peak value as the final result without paying enough attention on resource utilization. However, the recent studies have proved that the behavior of resources can reflect the latent problems. In this paper we present a new method called POPE (process-oriented performance evaluation), which analyses the systems combined workload characterization with resource utilization based on different node roles. It simplifies the complex system environment and its result contains much more information than before. This method has been applied to the real system with tens of nodes and it has found several key problems in design and equipments in time
{"title":"Study of Performance Evaluation for Data-Intensive Large-Scale Systems","authors":"Y. Liu, Huaiming Song, Limei Jiao","doi":"10.1109/AMS.2007.98","DOIUrl":"https://doi.org/10.1109/AMS.2007.98","url":null,"abstract":"The different applications make performance evaluation for data-intensive large-scale systems become a very important work. General test methods pursue the peak value as the final result without paying enough attention on resource utilization. However, the recent studies have proved that the behavior of resources can reflect the latent problems. In this paper we present a new method called POPE (process-oriented performance evaluation), which analyses the systems combined workload characterization with resource utilization based on different node roles. It simplifies the complex system environment and its result contains much more information than before. This method has been applied to the real system with tens of nodes and it has found several key problems in design and equipments in time","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"86 26 Pt 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":"126289749","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 attempts to determine conditions for `recogniseability' with application to games language processing. In its broadest sense, a biological reader of a string of characters has a `trial' internal model of the semantics of the lexical sequence being read. This internal model generates its own lexical string which is compared with the observed string. Errors between the two are fed back to the internal `semantic generator' to guide it to modify its lexical output closer to the observed string. The process continues dynamically until convergence, indicated by the observer `recognising' the meaning of the seen string. The theoretical foundations for this process are put forward and the conditions for successful `observation' using hybrid recurrent nets are reviewed. Semantic mining architectures are formulated and consist of a recurrent hybrid net hierarchy of multi-agents, extended such that the composite behavior of agents at any one level is determined by those of the level immediately above
{"title":"Semantic Mining Dynamics for Games Language Processing","authors":"D. Al-Dabass, M. Ren","doi":"10.1109/AMS.2007.89","DOIUrl":"https://doi.org/10.1109/AMS.2007.89","url":null,"abstract":"This paper attempts to determine conditions for `recogniseability' with application to games language processing. In its broadest sense, a biological reader of a string of characters has a `trial' internal model of the semantics of the lexical sequence being read. This internal model generates its own lexical string which is compared with the observed string. Errors between the two are fed back to the internal `semantic generator' to guide it to modify its lexical output closer to the observed string. The process continues dynamically until convergence, indicated by the observer `recognising' the meaning of the seen string. The theoretical foundations for this process are put forward and the conditions for successful `observation' using hybrid recurrent nets are reviewed. Semantic mining architectures are formulated and consist of a recurrent hybrid net hierarchy of multi-agents, extended such that the composite behavior of agents at any one level is determined by those of the level immediately above","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"12 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":"129768674","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}
Human decision models, often represented as rules or predicates, are key components in most military simulations. Although there exist some verification techniques for rule bases, they are not enough to assure the correctness of human decision models. Based on an analysis of the characteristics of human decision models in military simulations, this paper presents a method for verifying human decision models. A formal description method is developed to describe human decision models, which are automatically mapped to fuzzy Petri nets. A set of formal verification criteria for human decision models are developed, based on which verification is grouped into two classes: weak verification and strong verification. By searching the fuzzy Petri nets, weak verification is implemented, and by reasoning the fuzzy Petri nets, strong verification is implemented
{"title":"Verification of Human Decision Models in Military Simulations","authors":"Fei Liu, Ming Yang, Guobing Sun","doi":"10.1109/AMS.2007.110","DOIUrl":"https://doi.org/10.1109/AMS.2007.110","url":null,"abstract":"Human decision models, often represented as rules or predicates, are key components in most military simulations. Although there exist some verification techniques for rule bases, they are not enough to assure the correctness of human decision models. Based on an analysis of the characteristics of human decision models in military simulations, this paper presents a method for verifying human decision models. A formal description method is developed to describe human decision models, which are automatically mapped to fuzzy Petri nets. A set of formal verification criteria for human decision models are developed, based on which verification is grouped into two classes: weak verification and strong verification. By searching the fuzzy Petri nets, weak verification is implemented, and by reasoning the fuzzy Petri nets, strong verification is implemented","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":"129221867","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 implicit approach can be used to efficiently model realistically deformable objects for large constraints such as stiffness or time. In soft bodies with pressure forces, models are composed of mesh points connected by springs and applied with pressure forces. System parameters such as spring constant, damping constant, etc. are defined to describe the behaviors of the deformable objects. Since the simulation of soft bodies with pressure force fails when the constraints are large, this paper proposes the method to solve this problem by using the implicit integration method for soft bodies with particular force. The results show that our method can realistically simulate the soft bodies when large constraints are applied
{"title":"Simulation of Soft Bodies with Pressure Force and the Implicit Method","authors":"Jaruwan Mesit, R. Guha","doi":"10.1109/AMS.2007.93","DOIUrl":"https://doi.org/10.1109/AMS.2007.93","url":null,"abstract":"The implicit approach can be used to efficiently model realistically deformable objects for large constraints such as stiffness or time. In soft bodies with pressure forces, models are composed of mesh points connected by springs and applied with pressure forces. System parameters such as spring constant, damping constant, etc. are defined to describe the behaviors of the deformable objects. Since the simulation of soft bodies with pressure force fails when the constraints are large, this paper proposes the method to solve this problem by using the implicit integration method for soft bodies with particular force. The results show that our method can realistically simulate the soft bodies when large constraints are applied","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":"123781873","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 manufacturing industries are forced to meet the demand of the end users in many different aspects especially to reduce the number of defects. Since then, the manufacturers have adopted many strategies in order to achieve zero defect end products. Therefore, this research is an early attempt to present a proper method for manufacturers to achieve their goal starting from parameters selection and then optimization to control the belt line moulding production process. We apply regression analysis to make parameters selection and then used the best variables selected to optimize or in this case to minimize defects in belt line moulding process. The findings from this study will serve as a useful evidence and applicability of the proposed methodology
{"title":"Modelling in Manufacturing Industry: Parameters Selection Using Regression Analysis","authors":"A. T. Bon, J. Ogier, A. M. Razali","doi":"10.1109/AMS.2007.65","DOIUrl":"https://doi.org/10.1109/AMS.2007.65","url":null,"abstract":"The manufacturing industries are forced to meet the demand of the end users in many different aspects especially to reduce the number of defects. Since then, the manufacturers have adopted many strategies in order to achieve zero defect end products. Therefore, this research is an early attempt to present a proper method for manufacturers to achieve their goal starting from parameters selection and then optimization to control the belt line moulding production process. We apply regression analysis to make parameters selection and then used the best variables selected to optimize or in this case to minimize defects in belt line moulding process. The findings from this study will serve as a useful evidence and applicability of the proposed methodology","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"40 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":"125996407","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 phenomenal growth in recent years of distributed, network, and dynamic information sources remains a significant challenge. Only ontology based approach to this problem resolved heterogeneity, if all the data owners agree to use a common ontology. However, if information is sought from a subset of the participating data sources, there may be concepts common to the subset that are not included in the full common ontology, and therefore are unavailable for information sharing. Therefore, a novel ontology-based agent community approach is developed for agents, which generates the largest intersection of shared data across any selected subset of data sources. This paper proposes ontology-based agent community approach for information integration system that demonstrates a flexible and dynamic approach for the fusion of data across combinations of participating heterogeneous data sources to maximize information sharing by dynamically generating common ontology over the data sources of interest
{"title":"Ontology-Based Agent Community for Information Integration System in Semantic Web","authors":"Pa Pa Nyunt, N. Thein","doi":"10.1109/AMS.2007.76","DOIUrl":"https://doi.org/10.1109/AMS.2007.76","url":null,"abstract":"The phenomenal growth in recent years of distributed, network, and dynamic information sources remains a significant challenge. Only ontology based approach to this problem resolved heterogeneity, if all the data owners agree to use a common ontology. However, if information is sought from a subset of the participating data sources, there may be concepts common to the subset that are not included in the full common ontology, and therefore are unavailable for information sharing. Therefore, a novel ontology-based agent community approach is developed for agents, which generates the largest intersection of shared data across any selected subset of data sources. This paper proposes ontology-based agent community approach for information integration system that demonstrates a flexible and dynamic approach for the fusion of data across combinations of participating heterogeneous data sources to maximize information sharing by dynamically generating common ontology over the data sources of interest","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"23 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":"120957644","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
扫码关注我们
求助内容：
应助结果提醒方式：