M. Alshamrani, H. Cruickshank, Zhili Sun, B. Elmasri, V. H. Tafreshi
{"title":"SIP-based internetwork system between Future IP Networks and ZigBee based Wireless Personal Area Networks (WPAN)","authors":"M. Alshamrani, H. Cruickshank, Zhili Sun, B. Elmasri, V. H. Tafreshi","doi":"10.1109/CEEC.2012.6375406","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375406","url":null,"abstract":"The internetwork system between Future IP Networks and ZigBee Wireless Networks has two main approaches; the SIP Proxy Based approach, and the ZigBee Stack Based approach. Because of the dynamic nature of the ZigBee devices, both approaches need to be improved to support the connectivity system and the Quality of Service (QoS) for different types of sensing and actuating applications. This paper proposes an initial design for a modified version of SIP (Mod-SIP) for ZigBee Stack Based approach. In addition, the paper introduces the Combined Approach which is an enhanced internetwork system used to provide more reliable and flexible connectivity system between ZigBee WPANs, and the IP clouds. An initial design and simulation efforts on OPNET implemented to study the current approaches and compare it with the proposed approaches. It shows that the SIP Proxy Based approach is not efficient for Future IP Networks applications as it has a high rate of End-to-End delays because of the lack of flexibility between SIP signaling system and the ZigBee WPANs. The initial investigations shown that the Combined approach can provide more reliable connectivity system with the support for the QoS for different types of instantaneous applications such as VoIP and video conferencing.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127456252","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":"IMU/GPS based pedestrian localization","authors":"Ling Chen, Huosheng Hu","doi":"10.1109/CEEC.2012.6375373","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375373","url":null,"abstract":"The low cost Inertial Measurement Unit(IMU) can be used to provide accurate position information of a pedestrian when it is combined with Global Positioning System(GPS). This paper investigates how the integration of IMU anf GPS can be effectively used in pedestrian localization. The position calculation is achieved in sequence by three different strategies, namely basic double integration of IMU data, Zero-velocity Update (ZUPT) and Extended Kalman Filter(EKF) based fusion of IMU and GPS data. Experiments that are conducted in two fields show that EKF based localization outperform the double integration and ZUPT methods in terms of both positioning accuracy and robustness.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125363596","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":"Performance analysis of hybrid network for cloud datacenter","authors":"I. K. Musa, R. Nejabati, D. Simeonidou","doi":"10.1109/CEEC.2012.6375396","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375396","url":null,"abstract":"Cloud datacentres host wide variety of applications each with specific requirement. To accommodate all types of applications, hybrid networks - with optical circuit and electrical packet switching capabilities - are attracting research interest. We propose a deterministic model for analysing critical performance indicators in hybrid network for cloud computing. Analytical models for delay bounds, backlog, and flow acceptance region are presented. We implement simulation experiments and compare with our proposed performance models. Our choice of deterministic model proved suitable in creating an upper bound for selected performance indicators.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114550993","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 importance of social tie detection in socially-aware opportunistic routing","authors":"N. Vastardis, Kun Yang","doi":"10.1109/CEEC.2012.6375392","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375392","url":null,"abstract":"Opportunistic routing in distributed Mobile Social Networks has attracted a lot of attention from the research community recently. This attention mainly concentrates on the identification of effective social routing metrics. On the other hand, many approaches are also focusing on the detection of social ties from real world traces. This paper attempts to bridge this discrepancy, by suggesting a social network discovery beacon mechanism, able to accurately detect friendly mobile nodes. It has been noticed that the social network discovery, the metric calculation and the carrier selection are three independent stages in the socially-aware opportunistic routing procedure. Therefore, the proposed beacon mechanism can be employed in any real routing scheme. An ageing feature has also been included in the beacon mechanism, in order to provide adaptability in the dynamic conditions of the real social environment. The simulation results presented in the paper, demonstrate the relationship between accurate social tie detection and routing performance.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114200292","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":"Adaptive VBR video for congested wireless home networks","authors":"Ismail Amin Ali, M. Fleury, M. Ghanbari","doi":"10.1109/CEEC.2012.6375387","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375387","url":null,"abstract":"As the era of media-player applications seems to be receding, native streaming is being reconsidered in commercial environments. Ease of deployment is important to such developers and in that respect this paper proposes quality-adaptive variable bitrate (VBR) video streaming for home wireless networks. The main intention of the scheme is to adapt to congestion, taking advantage of simple buffer monitoring and transcoded bitrates. Compared to constant quality VBR and constant bitrate streaming, the paper demonstrates advantages in terms of stable delivered quality and reduced link latency.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121713759","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":"Power option pricing via Fast Fourier Transform","authors":"S. N. Ibrahim, J. O'Hara, N. Constantinou","doi":"10.1109/CEEC.2012.6375369","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375369","url":null,"abstract":"The basis of the option universe has been the European option, and much literature has been devoted to the extension of this option to create many new exotic options, including some with nonlinear payoffs. In this work, we study a European-style power option pricing, under a constant volatility dynamics, using the risk-neutral valuation within the Black-Scholes framework. Apart from applying the closed-form solution, we price the power option using the Fast Fourier Transform (FFT) technique which requires an analytical characteristic function of the power option. The resulting approximations are then compared with other numerical methods such as the Monte Carlo simulations, which show promising results and demonstrate the efficiency of the FFT technique as it can compute option prices for a whole range of strike prices. Besides, we show that there exists a relationship between the power call option and the power put option that is similar to the put-call parity relationship of vanilla options. We also find a transformation between the underlying asset and the power contract which enables us to obtain the pricing formulas of the power options from the vanilla options, as well as simplify the Greeks for power options. In addition to the Greeks derived from the closed-form solution, we present the Greeks using the pricing formula obtained from a characteristic function.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125343650","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":"Analysis of channel error upon selectively encrypted H.264 video","authors":"M. Asghar, M. Ghanbari, M. Fleury, M. Reed","doi":"10.1109/CEEC.2012.6375393","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375393","url":null,"abstract":"For real-time video streaming applications it is important to preserve both privacy and delay sensitivity. To achieve this, selective encryption exploits the entropy coding stage of hybrid codecs. As streaming applications move towards mobile networks, they become vulnerable to bit-errors in the wireless channel. This paper is a pioneering analysis of the relative impact of bit-errors on the two H.264 codec entropy coders, CAVLC and CABAC. The joint impact of compression and encryption on objective video quality is determined in experiments, when it is found that CAVLC is much more vulnerable to bit-errors compared to CABAC. This finding will guide future bit-error protection schemes for both entropy coders of H.264 video codec.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130670682","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":"Applying Gaussian mixture model on Discrete Cosine features for image segmentation and classification","authors":"Hanan Al-Jubouri, H. Du, H. Sellahewa","doi":"10.1109/CEEC.2012.6375404","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375404","url":null,"abstract":"Content-based image retrieval (CBIR) is the process of searching digital images in a large database based on features, such as colour, texture and shape (so-called visual content) of a given query image. Consequently, retrieved images are the most similar in content to the query image. One effective approach is to segment an image into regions (i.e. clusters) of similar colour and texture to capture its visual content. This paper presents a study that applies an adaptive Expectation-Maximization algorithm on Gaussian Mixture Model (EM/GMM) to segment an image according to local colour and texture features extracted from Discrete Cosine Transform coefficients (DCT). The EM algorithm determines rather than imposes the effective number of clusters from the image's content. This paper evaluates the effectiveness of our method by conducting a number of image classification experiments using the k-nearest neighbor (k-NN) classifier. The experiments have shown a clearly marked improvement in image retrieval accuracy of using EM/GMM over the k-means algorithm. The paper is intended to demonstrate the effectiveness of adaptive GMM in segmenting an image and capturing regions of similar colour and texture within an image.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115831492","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":"A novel design flow for fault-tolerant computing","authors":"J. Kimmitt, G. Wilson, D. Greaves","doi":"10.1109/CEEC.2012.6375375","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375375","url":null,"abstract":"This paper presents a new hardware synthesis flow, which generates an output verifiable in a field-programmable gate array. It demonstrates the relevance of fault-tolerant synthesis as required by demanding, sustainable, safety-critical applications. Although general-purpose in capability, the technique is particularly applicable for modern processor implementations, where the consequences for undetected errors are usually catastrophic.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132270123","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":"Autonomic cooperative communications for emergency networks","authors":"M. Wódczak","doi":"10.1109/GLOCOMW.2012.6477697","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477697","url":null,"abstract":"Emergency networks formed by First Responders are characterised by dynamic topology changes. It makes them a very relevant area of interest for the application of the concept of cooperative communications supported with the rationale behind the autonomic system design. This is so mostly due to the ad hoc like nature of such a networking environment where the deployment of Relay Nodes, represented by Chief First Responders, may be fluctuating over time. The paper discusses these aspects jointly by investigating the mapping of autonomic cooperative communications onto an indoor scenario of a Relay Enhanced Cell type, where transmission is orchestrated by the Mobile Emergency Operations Centre.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133927482","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}