There are two point overarching point. One is Algorithm, and another is Viewpoint of system modeling in Service-oriented. The reason why modeling is important is that the simply it can be able to do modeling, the more the system efficiency is raised. It depends whether modeling can be simply done whether to capture the object with which point. The example of the introduction this time simply makes to modeling by how to catch the above-mentioned aspect now. This paper present an example and suggest that modeling is important while it can contribute to the system higher efficiency. Subject to way the modeling reflects whether to capture the object at what point. This paper presents a proposal for the architecture with a fixed cost and a specific cost.
{"title":"A Chaos Algorithm from Service-Oriented Business System Modeling","authors":"Tomonobu Sato","doi":"10.1109/UKSim.2012.67","DOIUrl":"https://doi.org/10.1109/UKSim.2012.67","url":null,"abstract":"There are two point overarching point. One is Algorithm, and another is Viewpoint of system modeling in Service-oriented. The reason why modeling is important is that the simply it can be able to do modeling, the more the system efficiency is raised. It depends whether modeling can be simply done whether to capture the object with which point. The example of the introduction this time simply makes to modeling by how to catch the above-mentioned aspect now. This paper present an example and suggest that modeling is important while it can contribute to the system higher efficiency. Subject to way the modeling reflects whether to capture the object at what point. This paper presents a proposal for the architecture with a fixed cost and a specific cost.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128950644","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}
We describe the depth of field A buffer, a new method for generating depth of field effects in synthesised images. The method avoids the use of multiple discrete samples but still has the capability to produce the effect of a sharp object viewed through a de-focussed one. Initial rendering can be done via a system producing pixel contributions together with depth information as required by conventional Z buffering. We present sample images illustrating the advantages of the technique compared to multi-sampling. We discuss the options for hardware-accelerated implementation and possible applications.
{"title":"Creating Depth of Field Effects without Multiple Samples","authors":"R. Cant, C. Langensiepen","doi":"10.1109/UKSim.2012.30","DOIUrl":"https://doi.org/10.1109/UKSim.2012.30","url":null,"abstract":"We describe the depth of field A buffer, a new method for generating depth of field effects in synthesised images. The method avoids the use of multiple discrete samples but still has the capability to produce the effect of a sharp object viewed through a de-focussed one. Initial rendering can be done via a system producing pixel contributions together with depth information as required by conventional Z buffering. We present sample images illustrating the advantages of the technique compared to multi-sampling. We discuss the options for hardware-accelerated implementation and possible applications.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125026228","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 design and implementation of signed-unsigned Modified Booth Encoding (SUMBE) multiplier. The present Modified Booth Encoding (MBE) multiplier and the Baugh-Wooley multiplier perform multiplication operation on signed numbers only. The array multiplier and Braun array multipliers perform multiplication operation on unsigned numbers only. Thus, the requirement of the modern computer system is a dedicated and very high speed unique multiplier unit for signed and unsigned numbers. Therefore, this paper presents the design and implementation of SUMBE multiplier. The modified Booth Encoder circuit generates half the partial products in parallel. By extending sign bit of the operands and generating an additional partial product the SUMBE multiplier is obtained. The Carry Save Adderr (CSA) tree and the final Carry Look ahead (CLA) adder used to speed up the multiplier operation. Since signed and unsigned multiplication operation is performed by the same multiplier unit the required hardware and the chip area reduces and this in turn reduces power dissipation and cost of a system.
{"title":"High Speed Modified Booth Encoder Multiplier for Signed and Unsigned Numbers","authors":"Ravindra P. Rajput, M. Swamy","doi":"10.1109/UKSim.2012.99","DOIUrl":"https://doi.org/10.1109/UKSim.2012.99","url":null,"abstract":"This paper presents the design and implementation of signed-unsigned Modified Booth Encoding (SUMBE) multiplier. The present Modified Booth Encoding (MBE) multiplier and the Baugh-Wooley multiplier perform multiplication operation on signed numbers only. The array multiplier and Braun array multipliers perform multiplication operation on unsigned numbers only. Thus, the requirement of the modern computer system is a dedicated and very high speed unique multiplier unit for signed and unsigned numbers. Therefore, this paper presents the design and implementation of SUMBE multiplier. The modified Booth Encoder circuit generates half the partial products in parallel. By extending sign bit of the operands and generating an additional partial product the SUMBE multiplier is obtained. The Carry Save Adderr (CSA) tree and the final Carry Look ahead (CLA) adder used to speed up the multiplier operation. Since signed and unsigned multiplication operation is performed by the same multiplier unit the required hardware and the chip area reduces and this in turn reduces power dissipation and cost of a system.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123007640","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 introduces a new boundary detection technique, named rotating line scanning, which can be considered as a boundary growing methodology. Some image enhancement techniques are also introduced which were used to make it possible to work correctly. Image enhancement techniques used in this method do not include any kind of smoothing and as a result the preprocessed image remains as sharp as the original. This technique has a number of parameters that can be tuned to achieve the desired result according to the situation. Using these parameters the algorithm can detect individual objects or a system of objects at once. All the algorithms used in the research consume very less computing power by nature.
{"title":"A New Approach for Object Boundary Detection and Identification","authors":"Lochana Prematunge, A. Dharmarathne","doi":"10.1109/UKSim.2012.106","DOIUrl":"https://doi.org/10.1109/UKSim.2012.106","url":null,"abstract":"This paper introduces a new boundary detection technique, named rotating line scanning, which can be considered as a boundary growing methodology. Some image enhancement techniques are also introduced which were used to make it possible to work correctly. Image enhancement techniques used in this method do not include any kind of smoothing and as a result the preprocessed image remains as sharp as the original. This technique has a number of parameters that can be tuned to achieve the desired result according to the situation. Using these parameters the algorithm can detect individual objects or a system of objects at once. All the algorithms used in the research consume very less computing power by nature.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123078225","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}
Virtual Reality (VR) is one of the technologies that provides new opportunity to improve productivity and enhances quality of manufacturing. Automotive industry is considered as initial group to use and utilise VR technologies. This research investigates benefits and barriers regarding the use of VR. Six automotive companies in Malaysia were selected as case studies. A total number of 240 questionnaires were distributed between these six automotive industry and 153 people responded to the questionnaires. Based on the questionnaires, this research analyses, and identifies the opportunities of VR in the industry and its constraints. From the statistical analysis, it was found that 'reducing reworks' and 'improving quality of manufacturing' are the two most common advantages of using VR technology. 'Lack of knowledge', 'lack of trained people' and 'time to get proficient' are three major barriers of adopting with new technology such as VR.
{"title":"Opportunities and Constraints of Virtual Reality Application in International and Domestic Car Companies of Malaysia","authors":"Maryam Mousavi, F. Aziz, N. Ismail","doi":"10.1109/UKSim.2012.46","DOIUrl":"https://doi.org/10.1109/UKSim.2012.46","url":null,"abstract":"Virtual Reality (VR) is one of the technologies that provides new opportunity to improve productivity and enhances quality of manufacturing. Automotive industry is considered as initial group to use and utilise VR technologies. This research investigates benefits and barriers regarding the use of VR. Six automotive companies in Malaysia were selected as case studies. A total number of 240 questionnaires were distributed between these six automotive industry and 153 people responded to the questionnaires. Based on the questionnaires, this research analyses, and identifies the opportunities of VR in the industry and its constraints. From the statistical analysis, it was found that 'reducing reworks' and 'improving quality of manufacturing' are the two most common advantages of using VR technology. 'Lack of knowledge', 'lack of trained people' and 'time to get proficient' are three major barriers of adopting with new technology such as VR.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123144798","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 present the modeling of seawater acoustic channel to yield the optimum carry frequency for autonomous underwater vehicle (AUV) wireless communication system. Many underwater acoustic wireless communications had been explore whereby the exploration is mainly done for a specific distance. However, the wireless communication distance of an AUV with its control vessel varies due to the task at certain depth. This current AUV is design with an operation depth of 0 to 2000m. Therefore, the existing model had limitation when the operation depth varies base on the task assignment. This is because the optimum frequency to noise ration varies with respect to the distance of the transmission. To surmount the existing modeling method, this paper presents an improved method to identify the optimum carry frequency for AUV wireless communication system. Mathematical model with the relation of frequency, distance and noise is formulated and simulation is carried out to tabulate the optimum frequencies at various distances. From the frequency band, the average frequency is identified as the optimum transmission carries frequency. The identified frequency will be used for further hardware development.
{"title":"Modeling of Acoustic Channel for Underwater Wireless Communication System in AUV Application","authors":"H. Yoong, K. Yeo, K. Teo, Wong L. Wong","doi":"10.1109/UKSim.2012.92","DOIUrl":"https://doi.org/10.1109/UKSim.2012.92","url":null,"abstract":"This paper present the modeling of seawater acoustic channel to yield the optimum carry frequency for autonomous underwater vehicle (AUV) wireless communication system. Many underwater acoustic wireless communications had been explore whereby the exploration is mainly done for a specific distance. However, the wireless communication distance of an AUV with its control vessel varies due to the task at certain depth. This current AUV is design with an operation depth of 0 to 2000m. Therefore, the existing model had limitation when the operation depth varies base on the task assignment. This is because the optimum frequency to noise ration varies with respect to the distance of the transmission. To surmount the existing modeling method, this paper presents an improved method to identify the optimum carry frequency for AUV wireless communication system. Mathematical model with the relation of frequency, distance and noise is formulated and simulation is carried out to tabulate the optimum frequencies at various distances. From the frequency band, the average frequency is identified as the optimum transmission carries frequency. The identified frequency will be used for further hardware development.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117019419","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}
Credit risk, deriving from borrowers defaulting on their debts, represents an ever growing source of concern for financial operators. An established model to describe the associated risk scenario, where correlation among defaults is present, is the t-copula, whose use allows us to evaluate the probability of losses exceeding a given threshold. However, the typically large number of variables involved calls for a simulation approach. A simulation method, based on the use of the Cross-Entropy (CE) technique, is here proposed as an alternative to non-adaptive Importance Sampling (IS) techniques so far presented in the literature, the main advantage of CE being that it allows to deal easily with a wider range of probability models than ad hoc IS. A full description of the method is provided along with the results obtained for an extended set of model instances. The proposed Cross-Entropy technique is shown to provide accurate results even when the sample size is several orders of magnitude smaller than the inverse of the probability to be estimated.
{"title":"Simulation of Correlated Financial Defaults through Smoothed Cross-Entropy","authors":"G. D'Acquisto, L. Mastroeni, M. Naldi","doi":"10.1109/UKSim.2012.27","DOIUrl":"https://doi.org/10.1109/UKSim.2012.27","url":null,"abstract":"Credit risk, deriving from borrowers defaulting on their debts, represents an ever growing source of concern for financial operators. An established model to describe the associated risk scenario, where correlation among defaults is present, is the t-copula, whose use allows us to evaluate the probability of losses exceeding a given threshold. However, the typically large number of variables involved calls for a simulation approach. A simulation method, based on the use of the Cross-Entropy (CE) technique, is here proposed as an alternative to non-adaptive Importance Sampling (IS) techniques so far presented in the literature, the main advantage of CE being that it allows to deal easily with a wider range of probability models than ad hoc IS. A full description of the method is provided along with the results obtained for an extended set of model instances. The proposed Cross-Entropy technique is shown to provide accurate results even when the sample size is several orders of magnitude smaller than the inverse of the probability to be estimated.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124123663","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}
Most of earlier grid scheduling algorithms were based on centralized scheduler. Relying on central scheduler yields not only central point of failure, also, it is not possible because of scalability and political issues in present day gigantic grid systems. Hence, meta-schedulers came into limelight. However many authors recognizes limitations of hierarchical grid scheduling and proposed peer-to-peer (P2P) techniques, which have potential for grid scheduling. In this paper, new decentralized scheduling algorithm is proposed for P2P grid systems. In this method, an independent task sovereignly selects a most suitable grid node based on local information of immediate neighbors. A vital feature of this method is that it can schedule both computation intensive and communication intensive tasks to make grid system's workload balanced.
{"title":"Decentralized Computation and Communication Intensive Task Scheduling Algorithm for P2P Grid","authors":"P. Chauhan, Nitin","doi":"10.1109/UKSim.2012.78","DOIUrl":"https://doi.org/10.1109/UKSim.2012.78","url":null,"abstract":"Most of earlier grid scheduling algorithms were based on centralized scheduler. Relying on central scheduler yields not only central point of failure, also, it is not possible because of scalability and political issues in present day gigantic grid systems. Hence, meta-schedulers came into limelight. However many authors recognizes limitations of hierarchical grid scheduling and proposed peer-to-peer (P2P) techniques, which have potential for grid scheduling. In this paper, new decentralized scheduling algorithm is proposed for P2P grid systems. In this method, an independent task sovereignly selects a most suitable grid node based on local information of immediate neighbors. A vital feature of this method is that it can schedule both computation intensive and communication intensive tasks to make grid system's workload balanced.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128078563","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. A. Ajibesin, N. Ventura, H. Chan, A. Murgu, Olubola K. Egunsola
Multicast can be described as the process of routing information from a source node s to a set of receivers r1, r2⋯⋯rn. In this paper, we present the performance of multicast algorithms in wireless networks. A network coding (NC) algorithm, which is the proposed optimised model, and efficient for multicast networks is considered. This model is implemented for wireless networks and the simulation results are compared with the Multicast Incremental Power (MIP) algorithm. MIP algorithm is one of the existing approaches for finding minimum cost on multicast wireless networks. Simulation results show that optimisation using network coding method lead to substantial improvement in the cost associated with multicast wireless network. This is because network resources are shared in an innovative manner that is more efficient than traditional method of processing data transmissions, which are generally sub-optimal.
{"title":"Performance of Multicast Algorithms over Coded Packet Wireless Networks","authors":"A. A. Ajibesin, N. Ventura, H. Chan, A. Murgu, Olubola K. Egunsola","doi":"10.1109/UKSim.2012.91","DOIUrl":"https://doi.org/10.1109/UKSim.2012.91","url":null,"abstract":"Multicast can be described as the process of routing information from a source node s to a set of receivers r1, r2⋯⋯rn. In this paper, we present the performance of multicast algorithms in wireless networks. A network coding (NC) algorithm, which is the proposed optimised model, and efficient for multicast networks is considered. This model is implemented for wireless networks and the simulation results are compared with the Multicast Incremental Power (MIP) algorithm. MIP algorithm is one of the existing approaches for finding minimum cost on multicast wireless networks. Simulation results show that optimisation using network coding method lead to substantial improvement in the cost associated with multicast wireless network. This is because network resources are shared in an innovative manner that is more efficient than traditional method of processing data transmissions, which are generally sub-optimal.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130475559","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. Sanz, P. J. Piñero-Escuer, D. Montoro-Mouzo, J.I. Garcia-Nicolas
The smart grid technology, that intends to provide intelligence to the energy distribution infrastructure, is one of the more promising technological advances in the near future. One of the main components of this smart grid is an advanced metering infrastructure (AMI), which replaces the analog meters with computerized systems that report usage over digital communication interfaces. Among the different technologies that can be employed to deploy a smart metering infrastructure, PRIME standard has recently attracted a lot of interest. However, PRIME networks planning and standard code development is still a very hard task as it is very expensive to emulate a real network in a laboratory. In this paper it is presented a precise and powerful tool for simulating real PRIME networks in a very accurate manner. This tool permits high accuracy real code testing and real networks planning.
{"title":"Distributed Event-Driven Simulation Environment for PRIME Based Metering Networks Planning","authors":"A. Sanz, P. J. Piñero-Escuer, D. Montoro-Mouzo, J.I. Garcia-Nicolas","doi":"10.1109/UKSim.2012.72","DOIUrl":"https://doi.org/10.1109/UKSim.2012.72","url":null,"abstract":"The smart grid technology, that intends to provide intelligence to the energy distribution infrastructure, is one of the more promising technological advances in the near future. One of the main components of this smart grid is an advanced metering infrastructure (AMI), which replaces the analog meters with computerized systems that report usage over digital communication interfaces. Among the different technologies that can be employed to deploy a smart metering infrastructure, PRIME standard has recently attracted a lot of interest. However, PRIME networks planning and standard code development is still a very hard task as it is very expensive to emulate a real network in a laboratory. In this paper it is presented a precise and powerful tool for simulating real PRIME networks in a very accurate manner. This tool permits high accuracy real code testing and real networks planning.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124730858","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
扫码关注我们
求助内容：
应助结果提醒方式：