Nowadays, content distribution is of high attention in peer to peer information systems. There are two main problems that could be mentioned in this context. The first problem is how to disseminate fragments of information efficiently and the next is to avoid missing same rare fragments towards end of download. For overcoming these problems, a new mechanism is presented in this paper which uses gossip algorithms on basis of social networks. Our mechanism maintains simplicity of gossip and has low overhead. This mechanism includes two phases for managing traffic and solving bottleneck problem: one for spreading rumors inside the social network and finding network of interests and the other for collecting messages in the network of interests with consideration of a threshold of independent paths.
{"title":"Towards an Efficient Method for Spreading Information in Social Network","authors":"Hamed Ahmadi, Arman Mehrbakhsh, E. Asgarian","doi":"10.1109/AMS.2009.107","DOIUrl":"https://doi.org/10.1109/AMS.2009.107","url":null,"abstract":"Nowadays, content distribution is of high attention in peer to peer information systems. There are two main problems that could be mentioned in this context. The first problem is how to disseminate fragments of information efficiently and the next is to avoid missing same rare fragments towards end of download. For overcoming these problems, a new mechanism is presented in this paper which uses gossip algorithms on basis of social networks. Our mechanism maintains simplicity of gossip and has low overhead. This mechanism includes two phases for managing traffic and solving bottleneck problem: one for spreading rumors inside the social network and finding network of interests and the other for collecting messages in the network of interests with consideration of a threshold of independent paths.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"86 1","pages":"152-157"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84374275","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}
Fusiform shape of aneurysm is a common geometry of Abdominal Aorta Aneurysm (AAA). One of the ways to detect the presence of fusiform aneurysm is by performing computer tomography scan of the body. In this study, actual output of the CT-Scan was converted to 3D model in numerical modeling. The objective of this work is to study the effect of hypertensive blood pressure and the wall shear stress (WSS) since hypertension is reported to be a risk factor in rupture of fusiform aneurysms. The numerical prediction shows that the transient behavior of the interaction under hypertensive blood pressure is significantly different from that under normal blood pressure. The peak wall stress, peak WSS and peak deformation occur shortly after systolic peak pressure. The location of maximum WSS is not where the pressure is the highest but rather where the pressure gradient is the largest.
{"title":"Numerical Modeling of Fusiform Aneurysm with High and Normal Blood Pressure","authors":"S. Giuma, K. Osman, M. R. A. Kadir","doi":"10.1109/AMS.2009.66","DOIUrl":"https://doi.org/10.1109/AMS.2009.66","url":null,"abstract":"Fusiform shape of aneurysm is a common geometry of Abdominal Aorta Aneurysm (AAA). One of the ways to detect the presence of fusiform aneurysm is by performing computer tomography scan of the body. In this study, actual output of the CT-Scan was converted to 3D model in numerical modeling. The objective of this work is to study the effect of hypertensive blood pressure and the wall shear stress (WSS) since hypertension is reported to be a risk factor in rupture of fusiform aneurysms. The numerical prediction shows that the transient behavior of the interaction under hypertensive blood pressure is significantly different from that under normal blood pressure. The peak wall stress, peak WSS and peak deformation occur shortly after systolic peak pressure. The location of maximum WSS is not where the pressure is the highest but rather where the pressure gradient is the largest.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"61 6 1","pages":"270-275"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85054795","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 call center is an organizational unit where inbound calls are received or outbound calls placed for the purposes of sales, support, advice and other business transactions. By applying knowledge management solutions, we can meet call centers’ challenges and gain benefits of reduced training costs, improved call handling and greater flexibility. This paper describes a solution to agent mediated knowledge management system in call centers and new search algorithms. We introduced two agent based search algorithms for finding the expert user in system. Searching an expert is one of the most critical features which each call center system should have. Our agent based search with agent based weighted graph works well in our prototype system. Our agent model can distribute and share knowledge in whole levels of organizations and call center.
{"title":"Agent Based Model for Call Centers Using Knowledge Management","authors":"Farzad Peyravi, Amin Keshavarzi","doi":"10.1109/AMS.2009.147","DOIUrl":"https://doi.org/10.1109/AMS.2009.147","url":null,"abstract":"A call center is an organizational unit where inbound calls are received or outbound calls placed for the purposes of sales, support, advice and other business transactions. By applying knowledge management solutions, we can meet call centers’ challenges and gain benefits of reduced training costs, improved call handling and greater flexibility. This paper describes a solution to agent mediated knowledge management system in call centers and new search algorithms. We introduced two agent based search algorithms for finding the expert user in system. Searching an expert is one of the most critical features which each call center system should have. Our agent based search with agent based weighted graph works well in our prototype system. Our agent model can distribute and share knowledge in whole levels of organizations and call center.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"99 1","pages":"51-56"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86114658","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}
Eliana Valenzuela Andrade, Manuel Rodiguez-Martinez
This paper presents a novel approach to the problem of discovering and ranking the characteristics of the data sources and query processing sites in a distributed database system. We model the network as a graph with nodes representing data sources and query processing sites, some of which might be replicated.We introduce a heuristic technique inspired in Ant Colony Theory to dynamically discover,assess and catalog each data source or query-processing site. Our goal is to find possible paths to access the computational resources or data provided by the highest quality sites and define the quality of this sites and data sources. The concept of quality could be defined in terms of performance, freshness, completeness or other metrics. We describe a simulation of the system using Java CSIM and also a preliminary performance and freshness studies designed to analyze the quality of paths found by the Ant Colony algorithm and the accurate of the freshness estimators. These experiments show that our approach is promissory and could do the job than we expect offering the information that the system needs to optimize a query request in a middleware system.
{"title":"Autonomic Ranking and Characterization of Data Sources and Query Processing Sites Using Ant Colony Theory","authors":"Eliana Valenzuela Andrade, Manuel Rodiguez-Martinez","doi":"10.1109/AMS.2009.71","DOIUrl":"https://doi.org/10.1109/AMS.2009.71","url":null,"abstract":"This paper presents a novel approach to the problem of discovering and ranking the characteristics of the data sources and query processing sites in a distributed database system. We model the network as a graph with nodes representing data sources and query processing sites, some of which might be replicated.We introduce a heuristic technique inspired in Ant Colony Theory to dynamically discover,assess and catalog each data source or query-processing site. Our goal is to find possible paths to access the computational resources or data provided by the highest quality sites and define the quality of this sites and data sources. The concept of quality could be defined in terms of performance, freshness, completeness or other metrics. We describe a simulation of the system using Java CSIM and also a preliminary performance and freshness studies designed to analyze the quality of paths found by the Ant Colony algorithm and the accurate of the freshness estimators. These experiments show that our approach is promissory and could do the job than we expect offering the information that the system needs to optimize a query request in a middleware system.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"35 1","pages":"578-583"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88527259","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 grid is an heterogeneous distributed environment, it has many new characteristics that are different with the traditional internet, for example, it have many users and resources. These characteristics have decided complexity of the grid safety mechanism. Thus security is an important element of the practical of grid computing technology. In paper, we described a hybrid model of authentication against centralized, hierarchical structure, other traditional forms of authentication features and combining grid security needs. Compare and analyzed the hybrid model authentication mechanisms, performance, and the implement methods of these models, and verified the safety and effectiveness of the hybrid mode. It described the design process of hybrid mode in detail . Given the specific systems certification flow and the performance analysis of application , it is great significance for grid security and management.
{"title":"A Status Authentication Mechanism in Grid Environment","authors":"Li Ma, Yongmei Zhang","doi":"10.1109/AMS.2009.41","DOIUrl":"https://doi.org/10.1109/AMS.2009.41","url":null,"abstract":"The grid is an heterogeneous distributed environment, it has many new characteristics that are different with the traditional internet, for example, it have many users and resources. These characteristics have decided complexity of the grid safety mechanism. Thus security is an important element of the practical of grid computing technology. In paper, we described a hybrid model of authentication against centralized, hierarchical structure, other traditional forms of authentication features and combining grid security needs. Compare and analyzed the hybrid model authentication mechanisms, performance, and the implement methods of these models, and verified the safety and effectiveness of the hybrid mode. It described the design process of hybrid mode in detail . Given the specific systems certification flow and the performance analysis of application , it is great significance for grid security and management.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"7 1","pages":"771-776"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75214756","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}
Dynamic programming-based algorithm such as Smith-Waterman algorithm, which produces the most optimal result, has been known as one of the most used algorithm for sequence alignment. Hirschberg algorithm is the space saving version of Smith-Waterman algorithm. However, both algorithms are still very computational intensive. The N-Gram-Hirschberg algorithm is introduced to further reduced the space requirement and at the same time, to speed up the sequences alignment algorithm. This research aims to enhance the N-Gram-Hirschberg algorithm by embedding the Hashing function, adopted from an exact string matching algorithm called Karp-Rabin. The hash function is used to enhance the transformation process for the algorithm. The new method improves the processing time of the N-Gram-Hirschberg without sacrificing the quality of the output. The best time enhancement we got was when word length is two for protein sequence length ranges between 100-1000.
{"title":"Enhancing N-Gram-Hirschberg Algorithm by Using Hash Function","authors":"Muhannad A. Abu-Hashem, N. Rashid","doi":"10.1109/AMS.2009.112","DOIUrl":"https://doi.org/10.1109/AMS.2009.112","url":null,"abstract":"Dynamic programming-based algorithm such as Smith-Waterman algorithm, which produces the most optimal result, has been known as one of the most used algorithm for sequence alignment. Hirschberg algorithm is the space saving version of Smith-Waterman algorithm. However, both algorithms are still very computational intensive. The N-Gram-Hirschberg algorithm is introduced to further reduced the space requirement and at the same time, to speed up the sequences alignment algorithm. This research aims to enhance the N-Gram-Hirschberg algorithm by embedding the Hashing function, adopted from an exact string matching algorithm called Karp-Rabin. The hash function is used to enhance the transformation process for the algorithm. The new method improves the processing time of the N-Gram-Hirschberg without sacrificing the quality of the output. The best time enhancement we got was when word length is two for protein sequence length ranges between 100-1000.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"45 1","pages":"282-286"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79545934","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 presents the modeling of a proposed multiple input, single output converter system for use mainly to interface several renewable energy sources into a single load connection point. More specifically, modeling of a system involving ac and dc supplied to the multiple inputs, single output DC-DC converter will be described and then verified via simulation using OrCAD Pspice to exhibit its functionality. Results of the simulation of one model show the achievement of equally supplied source currents. Details of the modeling and the accompanying computer simulation of the proposed converter will be discussed.
{"title":"Modeling and Simulation of Multiple-Input Converter System with Equally Drawn Source Power","authors":"Brian Butterfield, M. Anwari, Mohammad Taufik","doi":"10.1109/AMS.2009.84","DOIUrl":"https://doi.org/10.1109/AMS.2009.84","url":null,"abstract":"This paper presents the modeling of a proposed multiple input, single output converter system for use mainly to interface several renewable energy sources into a single load connection point. More specifically, modeling of a system involving ac and dc supplied to the multiple inputs, single output DC-DC converter will be described and then verified via simulation using OrCAD Pspice to exhibit its functionality. Results of the simulation of one model show the achievement of equally supplied source currents. Details of the modeling and the accompanying computer simulation of the proposed converter will be discussed.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"4 1","pages":"725-728"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79662617","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 purpose of this paper is devoted to revealing interconnection between rough sets and soft sets. We use the constructive and descriptive approaches of rough set theory and present a direct proof that Pawlak’s and Iwinski’s rough sets can be considered as soft sets.
{"title":"A Direct Proof of Every Rough Set is a Soft Set","authors":"T. Herawan, M. M. Deris","doi":"10.1109/AMS.2009.148","DOIUrl":"https://doi.org/10.1109/AMS.2009.148","url":null,"abstract":"The purpose of this paper is devoted to revealing interconnection between rough sets and soft sets. We use the constructive and descriptive approaches of rough set theory and present a direct proof that Pawlak’s and Iwinski’s rough sets can be considered as soft sets.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"519 1","pages":"119-124"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77197502","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}
Hossein Moeinzadeh, M. Mohammadi, Hossein Pazhoumand-dar, Arman Mehrbakhsh, Navid Kheibar, N. Mozayani
Reduced ordered binary decision diagram (ROBDD) is a memory-efficient data structure which is used in many applications such as synthesis, digital system, verification, testing and VLSI-CAD. The size of an ROBDD for a function can be increased exponentially by the number of independent variables of the function that is called “memory explosion problem”. The choice of the variable ordering largely influences the size of the OBDD especially for large input variables. Finding the optimal variable ordering is an NP-complete problem, hence, in this paper, two evolutionary methods (GA and PSO) are used to find optimal order of input variable in binary decision diagram. Some benchmarks form LGSynth91 are used to evaluate our suggestion methods. Obtained results show that evolutionary methods have the ability to find optimal order of input variable and reduce the size of ROBDD considerably.
{"title":"Evolutionary-Reduced Ordered Binary Decision Diagram","authors":"Hossein Moeinzadeh, M. Mohammadi, Hossein Pazhoumand-dar, Arman Mehrbakhsh, Navid Kheibar, N. Mozayani","doi":"10.1109/AMS.2009.130","DOIUrl":"https://doi.org/10.1109/AMS.2009.130","url":null,"abstract":"Reduced ordered binary decision diagram (ROBDD) is a memory-efficient data structure which is used in many applications such as synthesis, digital system, verification, testing and VLSI-CAD. The size of an ROBDD for a function can be increased exponentially by the number of independent variables of the function that is called “memory explosion problem”. The choice of the variable ordering largely influences the size of the OBDD especially for large input variables. Finding the optimal variable ordering is an NP-complete problem, hence, in this paper, two evolutionary methods (GA and PSO) are used to find optimal order of input variable in binary decision diagram. Some benchmarks form LGSynth91 are used to evaluate our suggestion methods. Obtained results show that evolutionary methods have the ability to find optimal order of input variable and reduce the size of ROBDD considerably.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"15 1","pages":"142-145"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80818213","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}
Critical chain project management (CCPM) has been introduced in 1997 by Goldratt which was known for its theory, theory of constraint. Since then CCPM attracted a great attention both in academic world and execution communities. One of the most controversial points of the CCPM which is a subject of critics is the way it suggests for activity duration estimation. This paper proposes a new method for duration estimation of activities by measuring the amount of uncertainty embedded in each activity duration and then taking out of safety times associated with this uncertainty. The validity of the proposed method is tested by conducting a computer simulation on some test problems. Simulation analysis shows that the proposed method yields schedules which are more reliable than the schedules produced by original CCPM method of duration estimation.
{"title":"Duration Estimation, a New Approach in Critical Chain Scheduling","authors":"K. Rezaie, B. Manouchehrabadi, S. N. Shirkouhi","doi":"10.1109/AMS.2009.67","DOIUrl":"https://doi.org/10.1109/AMS.2009.67","url":null,"abstract":"Critical chain project management (CCPM) has been introduced in 1997 by Goldratt which was known for its theory, theory of constraint. Since then CCPM attracted a great attention both in academic world and execution communities. One of the most controversial points of the CCPM which is a subject of critics is the way it suggests for activity duration estimation. This paper proposes a new method for duration estimation of activities by measuring the amount of uncertainty embedded in each activity duration and then taking out of safety times associated with this uncertainty. The validity of the proposed method is tested by conducting a computer simulation on some test problems. Simulation analysis shows that the proposed method yields schedules which are more reliable than the schedules produced by original CCPM method of duration estimation.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"116 1","pages":"481-484"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82411442","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
扫码关注我们
求助内容：
应助结果提醒方式：