2018 26th International Conference on Systems Engineering (ICSEng)最新文献_第7页

ICSEng 2018 Author Index ICSEng 2018作者指数

2018 26th International Conference on Systems Engineering (ICSEng) Pub Date : 2018-12-01 DOI: 10.1109/icseng.2018.8638197

引用次数: 0

Adaptive Consensus-based Aggregation for Edge Computing 基于自适应共识的边缘计算聚合

2018 26th International Conference on Systems Engineering (ICSEng) Pub Date : 2018-12-01 DOI: 10.1109/ICSENG.2018.8638200

Firas Al-Doghman, Z. Chaczko, Wayne Brookes

引用次数: 0

Parameter Estimation of Hybrid Fractional-Order Hammerstein-Wiener Box-Jenkins Models Using RIVCF Method 基于RIVCF的分数阶Hammerstein-Wiener Box-Jenkins混合模型参数估计

2018 26th International Conference on Systems Engineering (ICSEng) Pub Date : 2018-12-01 DOI: 10.1109/ICSENG.2018.8638015

W. Allafi, Cheng Zhang, D. Quang, J. Marco, K. Uddin

{"title":"Parameter Estimation of Hybrid Fractional-Order Hammerstein-Wiener Box-Jenkins Models Using RIVCF Method","authors":"W. Allafi, Cheng Zhang, D. Quang, J. Marco, K. Uddin","doi":"10.1109/ICSENG.2018.8638015","DOIUrl":"https://doi.org/10.1109/ICSENG.2018.8638015","url":null,"abstract":"This paper proposes a parameter estimation algorithm for A hybrid Box-Jenkins model where the fractional-order Hammerstein-Wiener continuous-time (HWFC) system represent the noise-free system corrupted by coloured noise generated by a discrete-time integer-order sub-model. The HWFC consist of input static nonlinear, continuous-time fractional-order linear and output static nonlinear sub-models. In this paper, the simplified refined instrumental variable algorithm is extended to estimate the system parameters with the existence of the discrete-time integer-order sub-model which described by auto-regressive moving average (ARMA) process. Measured input-output data is used for parameterizing the model with fewer conditions and assumptions, for example, the static nonlinearity of the Wiener part is not required to be invertible. The proposed approach estimates the parameters of the nonlinear and linear sub-models in an iterative manner. Monte Carlo simulation analysis shows the proposed algorithm provides accurate and fast converged estimates of the fractional-order Hammerstein-Wiener hybrid Box-Jenkins model.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134459283","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}

引用次数: 2

Non-invasive Methods in the Detection of Coronary Artery Disease 冠状动脉疾病的无创检测方法

2018 26th International Conference on Systems Engineering (ICSEng) Pub Date : 2018-12-01 DOI: 10.1109/ICSENG.2018.8638017

F. J. More, Z. Chaczko

引用次数: 2

Multi Objective Resource Optimisation for Network Function Virtualisation Requests 面向网络功能虚拟化请求的多目标资源优化

2018 26th International Conference on Systems Engineering (ICSEng) Pub Date : 2018-12-01 DOI: 10.1109/ICSENG.2018.8638192

Mahmoud Gamal, M. Abolhasan, J. Lipman, R. Liu, Wei Ni

{"title":"Multi Objective Resource Optimisation for Network Function Virtualisation Requests","authors":"Mahmoud Gamal, M. Abolhasan, J. Lipman, R. Liu, Wei Ni","doi":"10.1109/ICSENG.2018.8638192","DOIUrl":"https://doi.org/10.1109/ICSENG.2018.8638192","url":null,"abstract":"Network function vitalization (NFV) as a new research concept, for both academia and industry, faces many challenges to network operators before it can be accepted into mainstream. One challenge addressed in this paper is to find the optimal placement f or a set of incoming requests with VNF service chains to serve in suitable Virtual Machines (VMs) such that a set of conflicting objectives are met. Mainly, focus is placed on maximizing the total saving cost by increasing the total CPU utilization during the processing time and increasing the processing time for every service request in the cloud network. Moreover, we aim to maximize the admitted traffic simultaneously while considering the system constraints. We formulate the problem as a multi-objective optimization problem and use a Resource Utilization Multi-Objective Evolutionary Algorithm based on Decomposition (RU-MOEA/D) algorithm to solve the problem considering the two objectives simultaneously. Extensive simulations are carried out to evaluate the effects of the different network sizes, genetic parameters and the number of server resources on the acceptable ratio of the arrival chains to serve in the available VMs. The empirical results illustrate that the proposed algorithm can solve the problem efficiently and compute the optimal solution for two objectives together within a reasonable running time.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"576 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123128086","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}

引用次数: 1

A New Novel Improved Technique for PAPR Reduction in OFDM System OFDM系统中减小PAPR的一种新的改进技术

2018 26th International Conference on Systems Engineering (ICSEng) Pub Date : 2018-12-01 DOI: 10.1109/ICSENG.2018.8638235

Fan Gao, Ye Lu, Yao Peng, Pengfei Tan, Chuanqi Li

{"title":"A New Novel Improved Technique for PAPR Reduction in OFDM System","authors":"Fan Gao, Ye Lu, Yao Peng, Pengfei Tan, Chuanqi Li","doi":"10.1109/ICSENG.2018.8638235","DOIUrl":"https://doi.org/10.1109/ICSENG.2018.8638235","url":null,"abstract":"Orthogonal Frequency Division Multiplexing (OFDM) technology has become attractive method technology in the new generation of communication systems requiring high-speed data transmission. Big peak-to-average power ratio (PAPR) is the main problem of this modulation. By reducing the PAPR, but it will introduce noise and raise the bit error rate (BER). Partial transmit sequence (PTS) is another effective way to reduce PAPR. To solve these, a new joint technique, iterative partial transmit sequence (IPTS) and Clip method, is put forward. The simulation results show that the PAPR performance of this technique is better than that of single technology. Under the same conditions, compared with the PTS technique and the Clip algorithm, the threshold values of the IPTS Clip combined technique are optimized for 3.61dB and 1.09dB, respectively. Compared with PTS splicing technique and IPTS technique, the threshold value of IPTS Clip joint is optimized by 1.01dB and 4.09 dB, respectively. Compared with PTS and Clip algorithm, the threshold of PTS Clip is optimized to 2.60dB and 0.08dB. compared with the original signal, the threshold of IPTS Clip is 6.17dB. Theoretical analysis and simulation results show this method improves the performance and reduces the computational complexity.In addition, it also shows better PAPR performance degradation.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114624612","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}

引用次数: 2

Moving Sensitive Data Against Live Memory Dumping, Spectre and Meltdown Attacks 移动敏感数据对抗实时内存转储，幽灵和Meltdown攻击

2018 26th International Conference on Systems Engineering (ICSEng) Pub Date : 2018-12-01 DOI: 10.1109/ICSENG.2018.8638178

Johannes Sianipar, M. Sukmana, C. Meinel

{"title":"Moving Sensitive Data Against Live Memory Dumping, Spectre and Meltdown Attacks","authors":"Johannes Sianipar, M. Sukmana, C. Meinel","doi":"10.1109/ICSENG.2018.8638178","DOIUrl":"https://doi.org/10.1109/ICSENG.2018.8638178","url":null,"abstract":"The emergence of cloud computing allows users to easily host their Virtual Machines with no up-front investment and the guarantee of always available anytime anywhere. But with the Virtual Machine (VM) is hosted outside of user’s premise, the user loses the physical control of the VM as it could be running on untrusted host machines in the cloud. Malicious host administrator could launch live memory dumping, Spectre, or Meltdown attacks in order to extract sensitive information from the VM’s memory, e.g. passwords or cryptographic keys of applications running in the VM. In this paper, inspired by the moving target defense (MTD) scheme, we propose a novel approach to increase the security of application’s sensitive data in the VM by continuously moving the sensitive data among several memory allocations (blocks) in Random Access Memory (RAM). A movement function is added into the application source code in order for the function to be running concurrently with the application’s main function. Our approach could reduce the possibility of VM’s sensitive data in the memory to be leaked into memory dump file by 2 5% and secure the sensitive data from Spectre and Meltdown attacks. Our approach’s overhead depends on the number and the size of the sensitive data.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125373934","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}

引用次数: 7

Hybrid inhibition algorithm for ionospheric clutter mitigation in high frequency surface wave radar 高频表面波雷达电离层杂波抑制的混合抑制算法

2018 26th International Conference on Systems Engineering (ICSEng) Pub Date : 2018-12-01 DOI: 10.1109/ICSENG.2018.8638189

Zi-li Li, Anyun Yin

引用次数: 0

Statistical Analysis and Performance Comparison of Improved and Optimized CSC using Different Chaotic Maps under Different Fading Channels 不同衰落信道下不同混沌映射改进与优化CSC的统计分析与性能比较

2018 26th International Conference on Systems Engineering (ICSEng) Pub Date : 2018-10-01 DOI: 10.21608/ejmtc.2018.491.1021

H. Mansour, Ahmed Khamis, D. Zydek, H. Selvaraj

{"title":"Statistical Analysis and Performance Comparison of Improved and Optimized CSC using Different Chaotic Maps under Different Fading Channels","authors":"H. Mansour, Ahmed Khamis, D. Zydek, H. Selvaraj","doi":"10.21608/ejmtc.2018.491.1021","DOIUrl":"https://doi.org/10.21608/ejmtc.2018.491.1021","url":null,"abstract":"Spread spectrum technique becomes one of the most important secure communication techniques in the recent decades. One of the most important parameter in spread spectrum is the spreading sequence, especially in the direct sequence spread spectrum. Due to the huge increase in the applications and the demanded users, the traditional spreading codes become not sufficient to fulfill the development requirements. As an alternative solution, the chaotic codes appeared to solve most problems of the traditional spreading codes. Recently, many researches focused on the chaotic codes, due to its attractive security properties, in addition to its availability to generate a huge number of spreading codes, which is very useful in the multi-access applications. However, as the number of the multiple access interference is increased, the performance of the chaotic codes is degraded. One of the degradation reasons is the assigning of the initial condition of the chaotic map. This paper presents a comprehensive statistical analysis of an improved and optimized chaotic sequence code. In addition to the traditional chaotic code; the analysis is performed over improved codes such as the self-balanced, the zero mean, and the self-balanced zero mean chaotic code. The spreading chaotic codes are generated from optimized maps with optimum initial conditions. The analysis consists of the balance, orthogonality, the normalized maximum autocorrelation side lobe, and the normalized average cross correlation property. In addition, the performance of the mentioned code is evaluated and compared with the Gold code for different code lengths over different fading channel.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125532583","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}

引用次数: 0