Query prioritization for index tuning leads to improvement of performance in databases. We propose an analytical model which centers around managing index objects that are aligned to the queries submitted by the users through an Online Transaction Processing (OLTP) system. We first define a strategy to prioritize queries based on certain configurable parameters and call them as short listed queries. The next step is to analyze the existing index objects that were created by the DBA during the initial database setup and to check if these index objects are aligned to the short listed queries. Eventually, the system generates a recommendation report to the DBA which lists new indexes to be created that are aligned to short listed queries and list of obsolete indexes that are potential candidates to be dropped due to low utilization rates. This approach introduces a new facet for adoption towards performance analysis and improvements in software systems. We present an experimental analysis that validates the ideas of feeding domain knowledge indirectly in to the system through configurable parameters that help in prioritizing queries for Index tuning.
{"title":"Index Tuning through Query Evaluation Mechanism Based on Indirect Domain Knowledge","authors":"Sreekumar Vobugari, D. Somayajulu, B. M. Subraya","doi":"10.1109/UKSim.2012.97","DOIUrl":"https://doi.org/10.1109/UKSim.2012.97","url":null,"abstract":"Query prioritization for index tuning leads to improvement of performance in databases. We propose an analytical model which centers around managing index objects that are aligned to the queries submitted by the users through an Online Transaction Processing (OLTP) system. We first define a strategy to prioritize queries based on certain configurable parameters and call them as short listed queries. The next step is to analyze the existing index objects that were created by the DBA during the initial database setup and to check if these index objects are aligned to the short listed queries. Eventually, the system generates a recommendation report to the DBA which lists new indexes to be created that are aligned to short listed queries and list of obsolete indexes that are potential candidates to be dropped due to low utilization rates. This approach introduces a new facet for adoption towards performance analysis and improvements in software systems. We present an experimental analysis that validates the ideas of feeding domain knowledge indirectly in to the system through configurable parameters that help in prioritizing queries for Index tuning.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127688040","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 recent times Massive Multiplayer Online Game has appeared as a computer game that enables hundreds of players from all parts of the world to interact in a game world (common platform) at the same time instance. Current architecture used for MMOGs based on the classic tightly coupled distributed system. While, MMOGs are getting more interactive same time number of interacting users is increasing, classic implementation architecture may raise scalability and interdependence issues. This requires a loosely coupled service oriented architecture to support evolution in MMOG application. Data flow architecture, Event driven architecture and client server architecture are basic date orchestration approaches used by any service oriented architecture. Real time service is hottest issue for service oriented architecture. The basic requirement of any real time service oriented architecture is to ensure the quality of service. In this paper we have proposed a service oriented architecture for massive multiplayer online game and a specific middleware (based on open source DDS) in MMOG's for fulfilling real time constraints.
{"title":"Towards Service Oriented Architecture (SOA) for Massive Multiplayer Online Games (MMOG)","authors":"Farrukh Arslan","doi":"10.1109/UKSim.2012.82","DOIUrl":"https://doi.org/10.1109/UKSim.2012.82","url":null,"abstract":"In recent times Massive Multiplayer Online Game has appeared as a computer game that enables hundreds of players from all parts of the world to interact in a game world (common platform) at the same time instance. Current architecture used for MMOGs based on the classic tightly coupled distributed system. While, MMOGs are getting more interactive same time number of interacting users is increasing, classic implementation architecture may raise scalability and interdependence issues. This requires a loosely coupled service oriented architecture to support evolution in MMOG application. Data flow architecture, Event driven architecture and client server architecture are basic date orchestration approaches used by any service oriented architecture. Real time service is hottest issue for service oriented architecture. The basic requirement of any real time service oriented architecture is to ensure the quality of service. In this paper we have proposed a service oriented architecture for massive multiplayer online game and a specific middleware (based on open source DDS) in MMOG's for fulfilling real time constraints.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121023278","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As the number of embedded systems increases, so do the demands placed upon them. Current algorithms are capable of creating adequate schedules under ideal conditions, but can be considered inadequate when many variables must be regarded. End users are demanding ever greater performance while minimizing failures and power consumption, meaning advanced power management must be incorporated into circuit designs, especially in multi-core environments. This paper summarizes the initial investigation into the simulation of an energy harvesting system to identify key parameters. This is done by initial multi-vary analysis to determine primary contributors, which are then refined through Design of Experiments (DoE). Finally, the reduced model is subject to control through Statistical Process Control (SPC) to confirm whether monitoring causes a statistical difference to the output reliability and if so, what parameter has the greatest effect.
随着嵌入式系统数量的增加，对它们的需求也在增加。目前的算法能够在理想条件下创建足够的调度，但当必须考虑许多变量时，可能被认为是不够的。终端用户要求更高的性能，同时最大限度地减少故障和功耗，这意味着必须将先进的电源管理集成到电路设计中，特别是在多核环境中。本文总结了能量收集系统仿真的初步研究，确定了关键参数。这是通过最初的多变量分析来确定主要贡献者，然后通过实验设计(DoE)对其进行改进。最后，通过统计过程控制(Statistical Process control, SPC)对简化后的模型进行控制，以确定监控是否会对输出可靠性产生统计差异，如果会，哪个参数的影响最大。
{"title":"Identification of Key Energy Harvesting Parameters through Monte Carlo Simulations","authors":"James Docherty, A. Bystrov, A. Yakovlev","doi":"10.1109/UKSim.2012.73","DOIUrl":"https://doi.org/10.1109/UKSim.2012.73","url":null,"abstract":"As the number of embedded systems increases, so do the demands placed upon them. Current algorithms are capable of creating adequate schedules under ideal conditions, but can be considered inadequate when many variables must be regarded. End users are demanding ever greater performance while minimizing failures and power consumption, meaning advanced power management must be incorporated into circuit designs, especially in multi-core environments. This paper summarizes the initial investigation into the simulation of an energy harvesting system to identify key parameters. This is done by initial multi-vary analysis to determine primary contributors, which are then refined through Design of Experiments (DoE). Finally, the reduced model is subject to control through Statistical Process Control (SPC) to confirm whether monitoring causes a statistical difference to the output reliability and if so, what parameter has the greatest effect.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129224880","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":"186 1","pages":"0"},"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}
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":"1 1","pages":"0"},"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}
We present a new method for constructing and decomposing square matrices. This method, based on the computed parameterisation of their implied determinants and minors, operates on the product of factors of a new form of matrix decomposition. This method may be employed to build new matrices with fixed determinant(s). We demonstrate that this new approach is fundamentally well-connected to the Cholesky decomposition if applied on symmetric matrices. We also demonstrate that it is related to the LU decomposition method via a diagonal matrix multiplier. Also through this new method a direct relation between Cholesky decomposition and LU factorisation is shown. This method, presented for the first time, is useful for (re)constructing matrices with a predefined determinant and simulating inverse problems. The inference method introduced here also is based on new matrix manipulation techniques that we have developed for the identification of systems from reproducible time series data.
{"title":"Matrix Operations for the Simulation and Immediate Reverse-Engineering of Time Series Data","authors":"M. Idowu, J. Bown","doi":"10.1109/UKSim.2012.24","DOIUrl":"https://doi.org/10.1109/UKSim.2012.24","url":null,"abstract":"We present a new method for constructing and decomposing square matrices. This method, based on the computed parameterisation of their implied determinants and minors, operates on the product of factors of a new form of matrix decomposition. This method may be employed to build new matrices with fixed determinant(s). We demonstrate that this new approach is fundamentally well-connected to the Cholesky decomposition if applied on symmetric matrices. We also demonstrate that it is related to the LU decomposition method via a diagonal matrix multiplier. Also through this new method a direct relation between Cholesky decomposition and LU factorisation is shown. This method, presented for the first time, is useful for (re)constructing matrices with a predefined determinant and simulating inverse problems. The inference method introduced here also is based on new matrix manipulation techniques that we have developed for the identification of systems from reproducible time series data.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128646040","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}
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":"38 1","pages":"0"},"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}
This paper presents a highly efficient AES algorithm resistant to differential power analysis (DPA). This paper conducts a simulation based correlation power analysis (CPA) attack on AES implementation with different structures. The proposed idea does not affect the working frequency and does not alter the algorithm core architecture. A minimal overhead hardware is used to manage the dataflow of plaintext and noise.
{"title":"Efficient Implementation of AES Algorithm Immune to DPA Attack","authors":"A. Amaar, I. Ashour, M. Shiple","doi":"10.1109/UKSim.2012.110","DOIUrl":"https://doi.org/10.1109/UKSim.2012.110","url":null,"abstract":"This paper presents a highly efficient AES algorithm resistant to differential power analysis (DPA). This paper conducts a simulation based correlation power analysis (CPA) attack on AES implementation with different structures. The proposed idea does not affect the working frequency and does not alter the algorithm core architecture. A minimal overhead hardware is used to manage the dataflow of plaintext and noise.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121932350","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":"71 1","pages":"0"},"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}
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":"30 1","pages":"0"},"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：