{"title":"False Peaks Occurring via Planar Antenna Arrays DOA Estimation","authors":"Y. Nechaev, Y. O. A. Atheer, I. Peshkov","doi":"10.1145/3069593.3069596","DOIUrl":"https://doi.org/10.1145/3069593.3069596","url":null,"abstract":"Direction-of-arrival (DOA) of radio signals takes a great science interest for radar, sonar and wireless communication tasks. In this paper the problem of DOA estimation methods for planar antenna arrays is considered. The super-resolution method MUSIC is researched. The performances are estimated in various noise environments and for various geometries of antenna arrays. Additionally, problem of false peaks occurring in spatial spectrum is closely considered. The number of false peaks occurring is presented after computer simulations.","PeriodicalId":383937,"journal":{"name":"Proceedings of the International Conference on High Performance Compilation, Computing and Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126627248","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}
S. Abujayyab, M. Sanusi, A. S. Yahya, Tamer M. Alslaibi
{"title":"GIS Modeling for Landfill Site Selection via Multi-Criteria Decision Analysis: A Systematic Review","authors":"S. Abujayyab, M. Sanusi, A. S. Yahya, Tamer M. Alslaibi","doi":"10.1145/3069593.3069594","DOIUrl":"https://doi.org/10.1145/3069593.3069594","url":null,"abstract":"Utilizing multi-criteria decision analysis as an alternative to traditional screening processes for GIS modeling for landfill site selection (LSS) has attracted significant interest in recent years because of its time and cost savings and its ability to achieve better validation and accuracy. This paper surveys the developments in the modeling of LSS using geographic information systems (GIS) on the basis of multi-criteria decision analysis (MCDA) in the past two decades from 1997 to 2014. Emphasis is placed on the third and fifth stages of the overall applied methodology (selection of weights and decision rules), as well as on the efficiency of the LSS models. From the review, the strengths and limitations of using MCDA for LSS modeling via GIS are identified. Moreover, artificial neural networks instead of MCDA can be used as a new approach in the third and fifth stages of LSS models to enhance validation and accuracy.","PeriodicalId":383937,"journal":{"name":"Proceedings of the International Conference on High Performance Compilation, Computing and Communications","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115214781","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}
{"title":"Exploiting Multi-Block Atomic Write in SQLite Transaction","authors":"Seungyong Cheon, Y. Won","doi":"10.1145/3069593.3069616","DOIUrl":"https://doi.org/10.1145/3069593.3069616","url":null,"abstract":"This work is dedicated to resolve the journaling overhead of widely used DBMS, SQLite. Database journaling and EXT4 filesystem journaling cause enormous write operations because of the frequent fdatasync() call and Journaling of Journal anomaly between SQLite and EXT4 filesystem. While Write-Ahead-Logging reduces the number of fdatasync() call and write volume, JOJ and database journaling overhead is still remained. In this work, we develop a new SQLite journal mode, MAW mode. We exploit the F2FS filesystem and its Multi-block Atomic Write feature to write updated database pages atomically. MAW mode completely eliminated database journaling and keeps database consistency from unexpected system failure. MAW mode only writes the actually updated database pages, thereby generates smaller write volume. We implement MAW mode at SQLite with most recent version of F2FS. With MAW mode, database insert transaction performance is increased by 487% and write volume is decreased by 67% than stock SQLite PERSIST mode in EXT4 filesystem.","PeriodicalId":383937,"journal":{"name":"Proceedings of the International Conference on High Performance Compilation, Computing and Communications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114658685","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}
{"title":"Application of SOR Iteration for Poisson Image Blending","authors":"E. Hong, A. Saudi, J. Sulaiman","doi":"10.1145/3069593.3069608","DOIUrl":"https://doi.org/10.1145/3069593.3069608","url":null,"abstract":"Image blending is one of the important techniques in image processing. In this paper, a method based on solving the Poisson equation using Jacobi, Gauss-Seidel and SOR iterative methods is proposed. The aim is to compare and analyze the effectiveness of the three iterative methods in solving Poisson image blending problem. The evaluation criteria are based on the number of iterations and computational time to solve the Poisson equation. It is shown that SOR iterative method is more effective than the other two methods with a fewer number of iterations and requiring lesser computational time.","PeriodicalId":383937,"journal":{"name":"Proceedings of the International Conference on High Performance Compilation, Computing and Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131682044","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}
{"title":"Preconditioners for Parallel Reservoir Simulation","authors":"Zhuo Tian, Bei Wang, Yifeng Chen","doi":"10.1145/3069593.3069618","DOIUrl":"https://doi.org/10.1145/3069593.3069618","url":null,"abstract":"One of the standard preconditioners on reservoir simulation is incomplete LU (ILU, 'LU' stands for 'lower upper') decomposition. The matrix is factored by the product of a lower triangular matrix and an upper triangular matrix. Unfortunately, in parallel environments, ILU decomposition is serial for the solving process is Gaussian elimination which computes by rows. To enhance parallelism, we introduce an asynchronous parallel method. Asynchronous means that it is not need to wait other processes to finish, one process can begin to compute. In this way, ILU decomposition has a high degree of parallelism. Our test is based on reservoir simulation, in which the iterative algorithm is GMRES with ILU preconditioner. Experiment shows that the asynchronous parallel method can increase the parallelism of ILU decomposition and reduce the number of data exchanges.","PeriodicalId":383937,"journal":{"name":"Proceedings of the International Conference on High Performance Compilation, Computing and Communications","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115860456","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}
{"title":"The Spectrum Optimizing of Nonsinusoidal Orthogonal Modulation in Time and Domain System Based on PSWF Filter","authors":"M. Zhongyang, Liu Xiao, Liu Chuanhui","doi":"10.1145/3069593.3069603","DOIUrl":"https://doi.org/10.1145/3069593.3069603","url":null,"abstract":"Prolate Spheroidal Wave Function (PSWF) filter is designed and utilized to improve the spectral characteristic of Nonsinusoidal Orthogonal Modulation in Time and Domain (NOMTD) system. Before spectrum optimizing, comparison among PSWF filter, Blackman filter as well as Kaiser filter is conducted to design a filter with the best comprehensive performance. Parameters such as spectrum, orthogonalization between PSWFs as well as BER performance are investigated and compared to verify the effect of filtering. The main result is to demonstrate that PSWF filter is the best filter compared with conventional filters and filtering is a effective method to improve the spectral characteristic of system. Simulation result shows that the spectrum of modulation signal is distinctly improved by PSWF filter. The promotion of sidelobe of spectrum is approximately 75dB. In addition, system processed by PSWF filter has more advantages over system processed by Kaiser filter.","PeriodicalId":383937,"journal":{"name":"Proceedings of the International Conference on High Performance Compilation, Computing and Communications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124892249","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}
{"title":"Energy-Aware Resource Selection for Asynchronous Replicated System in Utility-based Computing Environments","authors":"W. Nik, B. Zhou","doi":"10.1145/3069593.3069611","DOIUrl":"https://doi.org/10.1145/3069593.3069611","url":null,"abstract":"This paper addresses the problem of energy-aware resource selection for applications that update data in utility-based computing systems. The problem is complex to be solved, especially in asynchronous replicated system, since one should first provide a good prediction scheme on the performance evaluation of resource selection model in the presence of job that update data before the energy-efficiency issue can be addressed. With this in mind and by observing that simplicity implies efficiency and scalability, two approaches of energy-aware resource selection are proposed and developed. The main objective is to minimize the energy consumption while still preserves a minimum system performance degradation trade-offs. The proposed approaches exploit both the presence and the absence of knowledge on resource energy usage to select the best resources to run the job. Also, they take advantage on the nature of high performance of job execution in asynchronous replicated system in its resource selection decision making process. The experimental results proved that the proposed approaches are able to minimize resource energy usage while preserving minimum performance degradation trade-offs.","PeriodicalId":383937,"journal":{"name":"Proceedings of the International Conference on High Performance Compilation, Computing and Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132812777","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}
Sami Ul Haq, F. Azam, Muhammad Waseem Anwar, Anam Amjad
{"title":"A Novel Approach for Modeling Security Aspects of Physical Infrastructures","authors":"Sami Ul Haq, F. Azam, Muhammad Waseem Anwar, Anam Amjad","doi":"10.1145/3069593.3069612","DOIUrl":"https://doi.org/10.1145/3069593.3069612","url":null,"abstract":"The infrastructures like water, power, school, transportation and communication systems are essentials for daily life activities and their protection is very important especially in the context of rapidly growing international terrorism. Protection of physical infrastructure requires the deep understanding of the infrastructure building blocks, identification of threats, vulnerabilities and risks. Implementations of effective and efficient techniques for the protection of physical infrastructure are subject to the knowledge of multiple domains. Model Driven Engineering (MDE) approach addresses the problem of complexity and effectively represents the application structure and behavior within a particular domain. Existing techniques seems to be lacking in providing a common approach for modeling different types of infrastructure. In this context, we study the characteristics of physical infrastructure's protection and proposed Unified Modeling Language (UML) based meta-models. The proposed meta-models aid in defining the different aspects of infrastructure and understand its organization and behavior. On the basis of given meta-models, UML models can be derived to represent the infrastructure protection systems, threats, vulnerabilities, assets and relationships among them.","PeriodicalId":383937,"journal":{"name":"Proceedings of the International Conference on High Performance Compilation, Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129397372","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}
{"title":"Hot Row Identification of DRAM Memory in a Multicore System","authors":"Xi Tao, Qi Zeng, J. Peir","doi":"10.1145/3069593.3069614","DOIUrl":"https://doi.org/10.1145/3069593.3069614","url":null,"abstract":"Access locality in single-core system is not easily observed in multicore system due to interleaved requests from different cores. Requests that come to DRAM-based main memory is mapped to a specific bank in DRAM and accessed through row buffer in the bank. DRAM row-buffer conflicts occur when a sequence of requests on different rows goes to the same memory bank, causing much higher memory access latency than requests to the same row or to different banks. In this paper, we first show that strong locality exists in memory requests of multicore systems. For many workloads, the accesses to some rows are more frequent than others, which we call them hot rows. Based on the observation, we propose a simple hot row buffer (HRB) scheme that is able to detect and capture these hot rows in DRAM. Results have shown that the proposed scheme is able to provide average 56% hit ratio over all row accesses in a bank for 10 selected workloads from SPEC CPU2006. A simple stream prefetcher prefetching in the hot row is implemented and results show an average of 9.1% IPC improvement over no prefetcher design.","PeriodicalId":383937,"journal":{"name":"Proceedings of the International Conference on High Performance Compilation, Computing and Communications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126276370","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}
Nik Zulkarnaen Bin Khidzir, Wan Abdul Ghani, T. T. Guan
{"title":"Cloud-Based Mobile-Retail Application for Textile Cyberpreneurs: Task-Technology Fit Perspective Analysis","authors":"Nik Zulkarnaen Bin Khidzir, Wan Abdul Ghani, T. T. Guan","doi":"10.1145/3069593.3069609","DOIUrl":"https://doi.org/10.1145/3069593.3069609","url":null,"abstract":"Cloud computing and mobile computing paradigms have enhanced the usage of current technology among people from various sectors to perform certain required tasks. The combination of these two paradigms have also created the existence of cloud-based mobile applications that are designed to be useful in business environments, such as to be used by textile cyberpreneurs for m-retail transaction. As cloud adoption was previously low among Malaysian entrepreneurs, the usage intention factors of related cloud technology and services should be determined for better clarification and future technology enhancements. Besides, studies on m-retail or m-shopping adoption in Malaysia were merely focused on customer's perspectives rather than retailer's perspectives. In measuring the suitability of Cloud-based M-Retail (CBMR) application with the task requirements of textile cyberpreneurs, Task-Technology Fit (TTF) model is used as the basis of this research. Results from a pilot study, through a survey of selected group of textile cyberpreneurs shows instrument's reliability and positive feedbacks to support the intention to use the technology. The future direction of the study in which to apply the instruments to a larger group of respondents is also discussed along with its potential contribution.","PeriodicalId":383937,"journal":{"name":"Proceedings of the International Conference on High Performance Compilation, Computing and Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116864556","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}