{"title":"Optimal implementation of advanced control methods on FPGA targets","authors":"C. Muresan, S. Folea, G. Mois","doi":"10.1109/RIVF.2013.6719895","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719895","url":null,"abstract":"Advanced control engineering methods have been limited up until recently to controlling complex processes, which justified the use of powerful computation devices. However, the current trend in engineering is concerned with the active management of engineering resources, by cutting down expenses and ensuring the premises for further development. Advanced control strategies offer increased robustness, high reliability and efficiency, but they require fast computation times and powerful numerical resources. Hence, the trend in control engineering should be directed towards developing and employing reliable and energy-efficient devices that support the implementation of the advanced control strategies. This would eventually lead to a more sustainable use of the available technological resources and a decrease of the energy consumption. The present paper offers a comparison between two advanced control strategies for a DC motor, both implemented on a FPGA device. The experimental results show that both control solutions are viable, robust and use very little resources.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"7 40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124612044","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}
Duyen Trung Ha, Dinh V. Ngo, Hung T. Pham, Dung V. Hoang, Luong N. Nguyen
{"title":"Performance of FSO systems employing SC-QAM over atmospheric turbulence channels and pointing errors","authors":"Duyen Trung Ha, Dinh V. Ngo, Hung T. Pham, Dung V. Hoang, Luong N. Nguyen","doi":"10.1109/RIVF.2013.6719862","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719862","url":null,"abstract":"In this paper, we theoretically analyze the performance of free-space optical (FSO) communication systems using subcarrier intensity quadrature amplitude modulation (SC-QAM) over atmospheric turbulence channels in the presence of pointing errors. Unlike previous studies, we take into account both atmospheric turbulence and the pointing error effect. In order to model atmospheric turbulence, we employ a log-normal distribution for weak-to-moderate turbulent condition and a gamma-gamma distribution for strong turbulent condition. Meanwhile, we consider the pointing error effect by using a fading model where the influence of beam width, detector size and jitter variance is considered. More critically, we use a combination of these models to analyze the combined effect of atmospheric turbulence and pointing error to SC-QAM/FSO systems. Finally, we derive analytical expressions for evaluating the average symbol error rate (ASER) performance of such systems. Numerical results present the impact of pointing error on the performance of SC-QAM/FSO systems and how we use proper values of aperture size and beam width to improve the performance of such systems.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114364926","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":"Green communication through optimal power allocation in 4G networks","authors":"A. Chakrapani, R. Malaney","doi":"10.1109/RIVF.2013.6719871","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719871","url":null,"abstract":"Green communications - the ability to obtain a given communication service at minimal energy use - is of growing importance. In addition, future releases (Release-10 and beyond) of the fourth generation (4G) wireless networks are expected to carry an ever increasing number of broadband services. As such, the optimal configuration of 4G networks in the context of minimizing energy usage is very important. In this work we investigate the use of optimal power allocations in 4G networks in the context of co-operative communications. Our system models, which are based on emerging 4G standards, consist of multiple users communicating with a base station through the use of an additional relay station. We show, through analysis and simulations, how optimal power allocation schemes at the relay can lead to significant improvement in throughput. Such increases in throughput, in turn, lead to dramatic decreases in the energy usage of the network. We highlight two main energy savings that can be achieved without impacting any communication service; the opportunity to power-down base stations, and reduced energy consumption at the relay. We show how factor of two savings in energy usage can be expected from the deployment of our techniques.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124205297","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":"Trademark image retrieval based on scale, rotation, translation invariant features","authors":"Tien Dung Nguyen, H. H. Nguyen, T. Lê","doi":"10.1109/RIVF.2013.6719908","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719908","url":null,"abstract":"Trademark registration offices or authorities have been bombarded with requests from enterprises. These authorities face a great deal of difficulties in protecting enterprises' rights such as copyright, license, or uniqueness of logo or trademark since they have only conventional clustering. Urgent and essential need for sufficient automatic trademark image retrieval system, therefore, is entirely worth thorough research. In this paper, we propose a novel trademark image retrieval method in which the input trademark image is first separated into dominant visual shape images then a feature vector for each shape image which is scale-, rotation-, and translation- invariant is created. Finally, a similarity measure between two trademarks is calculated based on these feature vectors. Given a query trademark image, retrieval procedure is carried out by taking the most five similar trademark images in a predefined trademark. Various experiments are conducted to mimic the many types of trademark copying.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121826847","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":"Improve effectiveness resolving some inter-sentential anaphoric pronouns indicating human objects in Vietnamese paragraphs using finding heuristics with priority","authors":"T. Tran, Dang Tuan Nguyen","doi":"10.1109/RIVF.2013.6719876","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719876","url":null,"abstract":"This paper presents some improved strategies for better resolving some inter-sentential anaphoric pronouns indicating human objects in Vietnamese paragraphs composing 3 to 5 simple sentences. These strategies are proposed based on the heuristics with priority when considering one anaphoric pronoun appears in the adjacent sentences or appears in the sentences which are not adjacent, and when considering several candidate antecedents which take the same grammatical role of the main verbs in the sentences. We also present the approach for integrating these strategies and propose some improvements in the computational model, which we proposed before, for implementing these strategies and the integrating approach.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126144168","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":"Noise reduction approach for LSB matching revisited","authors":"H. Tien, H. Le","doi":"10.1109/RIVF.2013.6719870","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719870","url":null,"abstract":"This paper proposes a new approach to LSB Matching Revisited (LSB-MR), a steganographic method for embedding message bits into a still image. Our method uses binary images as messages. Instead of embedding a full of message bits, the modified method just uses a half of message bits for embedding. In extracting phase, after reconstructing the embedding part, the remain bits of message (without embedding) are generated with an small error ratio. Most of error bits (missing bits) are restored by Median denoise filter. Therefore, the proposed method allows embedding the same payload as LSB-MR but with fewer changes to cover image. The experimental results, evaluated on 1338 uncompressed images, show that the new method has better performance, compared to LSB-MR, in terms of cover image quality and resistance against existing steganalysis.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132897142","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 hybrid method for forecasting trend and seasonal time series","authors":"Doan Ngoc Bao, Ngo Duy Khanh Vy, D. T. Anh","doi":"10.1109/RIVF.2013.6719894","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719894","url":null,"abstract":"Forecasting of time series that have trend and seasonal variations remains an important problem for forecasters. In this work, a hybrid method which combines Winters' exponential smoothing method and neural network is proposed for forecasting seasonal and trend time series. The proposed method aims to integrate the linear characteristics of an exponential smoothing model and nonlinear characteristics of neural network to create a more effective model for time series forecasting. Experimental results show that the hybrid method outperforms neural network model in forecasting seasonal and trend time series.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131633991","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":"Sparse spatio-temporal representation of joint shape-motion cues for human action recognition in depth sequences","authors":"Quang D. Tran, N. Ly","doi":"10.1109/RIVF.2013.6719903","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719903","url":null,"abstract":"The availability of 3D sensors has recently made it possible to capture depth maps in real time, which simplifies a variety of visual recognition tasks, including object/action classification, 3D reconstruction, etc.We address here the problems of human action recognition in depth sequences. On one hand, we present a new joint shape-motion descriptor which we call as 3D Spherical Histogram of Oriented Normal Vectors (3DS-HONV), since it is a spatio-temporal extension of the original HONV quantized in a 3D spherical coordinate. We further prove that the Optical Flow fields in depth sequences could be used in conjunction with the presented descriptor to augment the ability of capturing in-plane movements; the experiments later show that this combination is more efficient than the standalone 3DS-HONV. In addition, a discriminative dictionary learning and feature representation via Sparse Coding is applied to proposed descriptors to relieve the intrinsic effects of noise and capture high-level patterns. By learning these sparse and distinctive representations, we demonstrate large improvements over the state-of-the-art on two challenging benchmarks, which results with an overall accuracy of 91.92% on the MSRAction3D and 93.31% on the MSRGesture3D datasets, respectively.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122976955","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":"Laplacian star coordinates for visualizing multidimensional data","authors":"Tran Van Long","doi":"10.1109/RIVF.2013.6719904","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719904","url":null,"abstract":"Multidimensional data visualization is an interesting research field with many applications in ubiquitous all fields of sciences. Star coordinates are one of the most common information visualization techniques for visualizing multidimensional data. A star coordinate system is a linear transformation that maps a multidimensional data space into a two-dimensional visual space, unfortunately, involving a loss of information. In this paper, we proposed to improve standard star coordinates by developing the concept of Laplacian star coordinates for visualizing multidimensional data. The Laplacian star coordinate system is based on dimension axes placement according to their similarity, which improves the quality of data representation. We prove the efficiency and robustness of our methods by measuring the quality of the representations for several data sets.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124992821","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}
Thi Luong Nguyen, L. My, Viet Hung Nguyen, Huyen Thi Minh Nguyen, Hong Phuong Le
{"title":"Building a treebank for Vietnamese dependency parsing","authors":"Thi Luong Nguyen, L. My, Viet Hung Nguyen, Huyen Thi Minh Nguyen, Hong Phuong Le","doi":"10.1109/RIVF.2013.6719884","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719884","url":null,"abstract":"The problem of Vietnamese syntactic parsing, especially constituency parsing, has recently been tackled by several research groups. A common effort of the Vietnamese language processing community has allowed the creation of VietTreebank, a reference parsed corpus containing about 10,000 sentences for the constituency parsing task. In this paper, we present our work to build a reference treebank, based on VietTreebank, for the dependency parsing task, which has not yet been very well studied for Vietnamese. First we define a dependency label set by adapting the dependency schema developed by the NLP group at Stanford university and taking into account the particularities of Vietnamese grammar. Then we propose an algorithm to convert a constituency treebank to a dependency one. The algorithm is tested on a set of 100 sentences of VietTreebank corpus and gives very good results. Finally, we carry out an experiment on Vietnamese dependency parsing using MaltParser tool and the dependency treebank converted from VietTreebank.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122060326","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}