{"title":"Adaptive Iterative Receiver for CDMA Systems in Rayleigh Fading Channels","authors":"T. Keovkolyan, C. Teekapakvisit","doi":"10.1109/RIVF.2009.5174616","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174616","url":null,"abstract":"An adaptive iterative receiver for a Layered Space-Time Coded CDMA (LSTC-CDMA) system has been proposed in this paper. The LSTC-CDMA system, based on a joint adaptive iterative detection and decoding algorithm, adaptively cancels Co-Channel Interference (CCI) and mitigates Multiple Access Interference (MAI). The Least Means Square (LMS) algorithm is used for both feed-forward filter and feedback filter in the adaptive detection. A Partially Filtered Gradient LMS (PFGLMS) algorithm is also proposed to improve the convergence speed of the adaptive detector. The performance results show that the receiver, based on PFGLMS algorithm, yields much faster convergence speed and tracking ability with a slightly increase in complexity. The proposed receiver is analyzed in the slow and fast Rayleigh fading channels.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131345606","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 Fast Algorithm for Constructing Constrained Delaunay Triangulation","authors":"N. M. Nam, H. Kiem, Nguyen Vinh Nam","doi":"10.1109/RIVF.2009.5174607","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174607","url":null,"abstract":"This paper presents a fast incremental insertion algorithm for constructing constrained Delaunay triangulation. Constraints are considered any kind of polygonal lines. The bottleneck of incremental Delaunay triangulation algorithm is the search for a triangle containing current integrating point. The advantage of our algorithm over the others is that we used an efficient Skvortsov's algorithm, dynamic uniform grid. It is used to insert point into an existing triangulation. A topology model is used to represent a triangle network so that we can easily and fast locate a point in a triangulation. The rest of algorithm presents a method for constrained edges, already proposed by Anglada. The algorithm is fast and easy to implement.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128243306","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":"Design and Optimization of Reconfigurable Inset-Fed Microstrip Patch Antennas with High Gain for Wireless Sensor Networks","authors":"D. Phan, G. Chung","doi":"10.1109/RIVF.2009.5174635","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174635","url":null,"abstract":"In this paper, a tunable microstrip patch antenna designed using RF MEMS switches is reported. The design and simulation antenna were performed using high frequency structure simulator (HFSS). The antenna was designed in ISM band and operates simultaneously at 2.4 Ghz and 5.7 Ghz with a -10 dB return-loss bandwidth of 20 Mhz and 180 Mhz, respect- tively. To obtain high efficiency and improve integrated ability, the high resistivity silicon (HRS) wafer was used for the antenna. The antenna achieved high gain with 8 dB at 5.7 Ghz and 1.5 dB at 2.4 Ghz. The RF MEMS DC contact switches was simulated and analysis by ANSYS software.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132885731","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":"Temporal 3D Graphical Data Management from a Database Perspective","authors":"Vo Thi Ngoc Chau, S. Chittayasothorn","doi":"10.1109/RIVF.2009.5174660","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174660","url":null,"abstract":"According to recent advances in computer science and engineering, three dimensional (3D) graphical data is of growing interest in many application areas. In this paper, a data management technique is proposed to handle 3D graphical data with the time dimension from a database perspective. Different from the existing works, our technique deals with 3D graphical data in all of the three various aspects: the visual aspect for the 3D graphical data part, the semantic aspect for the metadata part, and especially the temporal aspect for changes over the time. As a result, 3D graphical data can be managed properly with semantics and time. Therefore, many front-end applications can conveniently have access to them at both graphical and semantic data levels for sharability and reusability.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130039156","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":"Eye Gaze Tracking","authors":"B. L. Nguyen","doi":"10.1109/RIVF.2009.5174639","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174639","url":null,"abstract":"The problem of eye gaze tracking has been researched and developed for a long time. Most of them use intrusive techniques to estimate the gaze of a person. This paper presents a non-intrusive approach for eye gaze tracker in real time with a simple camera. To track the eye gaze we have to deal with three principle problems: detecting the eye, tracking the eye and detecting the gaze of the eye on the screen where a user is looking at. In this paper we introduce the methods existed to solve these problems in the simple way and achieving high detection rate.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133463011","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}
H. Quan, Tobias Åström, M. Jern, Johan Moe, F. Gunnarsson, Harald Kallin
{"title":"Visualization of Self-Organizing Networks Operated by the ANR Algorithm","authors":"H. Quan, Tobias Åström, M. Jern, Johan Moe, F. Gunnarsson, Harald Kallin","doi":"10.1109/RIVF.2009.5174664","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174664","url":null,"abstract":"Cellular radio networks are continually growing in both node count and complexity. It therefore becomes more and more difficult to manage the networks and necessary to use time and cost effective automatic computer algorithms to organize the network's neighbor cell relations. Ericsson has developed such an algorithm, called automatic neighbor relations (ANR), which solves a part of this problem by automatically creating and updating neighbor cell relation (NCR) lists, based on measured network data. Network operators need to have an understanding of the algorithm and of its reliability and performance, which is not easily perceived. This paper presents a visualization tool that visualizes the performance of ANR and gives the user a possibility to control it via policies. The tool allows the operators to follow the evolution of the network and to find problems occurring over time. In addition, it also supports finding potential problems that can occur in the future. The tool was evaluated by a group of relevant domain users and the results from the evaluation were highly positive.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"307 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129352374","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":"Interfering Job Set Scheduling on Two-Operation Three-Machine Flowshop","authors":"N. H. Tuong, A. Soukhal","doi":"10.1109/RIVF.2009.5174646","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174646","url":null,"abstract":"This paper considers three machine flowshop scheduling problem with two agents. The jobs of first agent have two operations executed in the same order, on M 1 and then on M 2 respectively. According to the second agent, the jobs should be executed on M 2 and then on M 3 . Thus, the second machine M 2 has to be shared to perform all of jobs. The objective is to minimize at the same time the makespan of each job set. The epsiv-constraint approach is utilized, i.e. the maximum completion time of the one agent has to be minimized while the maximum completion time of the other is bounded. This scheduling problem was proved as binary NP-hard. In this study, a pseudo-polynomial algorithm is proposed.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121351327","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":"B-spline Surface Reconstruction by Inverse Subdivisions","authors":"Khoi Nguyen-Tan, Romain Raffin, M. Daniel, C. Le","doi":"10.1109/RIVF.2009.5174628","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174628","url":null,"abstract":"This paper presents a method to reconstruct a B-spline surface from a quadrangular mesh, using an inverse Catmull-Clark subdivision. We want to minimize the surface contraction due to the approximating subdivision scheme. We introduce geometrical operations which minimize the impact of the subdivision approximation and can be used in the parametric surface reconstruction. The quality of the method is evaluated by criteria of distances, curvatures or computing time on experimental results.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123714749","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 Robust Stereo Matching Method for Low Texture Stereo Images","authors":"Le Thanh Sach, K. Atsuta, K. Hamamoto, S. Kondo","doi":"10.1109/RIVF.2009.5174612","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174612","url":null,"abstract":"Computing disparity images for stereo pairs of low texture images is a challenging task because matching costs inside low texture areas of the stereo pairs are almost similar. This problem can not be solved straightforwardly by increasing the size of aggregation windows or by using global optimization methods, e.g. dynamic programming, because those approaches will smooth depth discontinued boundaries as well. Based on the assumption that disparities of pixels in homogeneous regions are similar, this paper proposes a new method that is able to robustly perform stereo matching for low texture stereo images. The proposed method utilizes the edge maps computed from the stereo pairs to guide the cost aggregation process in stereo matching. By using edge maps, the proposed method can achieve the effect of using different shapes and sizes of aggregation windows. Moreover, the computational complexity of the proposed method is independent from the window size, similar to the moving average aggregation method. Experimental results from both of an artificial and a real stereo image sequence demonstrate that the proposed method can produce a larger number of and a better accuracy of reliable disparities for low texture stereo images than the moving average method.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124265373","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":"Using Artificial Neural Network for Robust Voice Activity Detection Under Adverse Conditions","authors":"T. V. Pham, Chien T. Tang, M. Stadtschnitzer","doi":"10.1109/RIVF.2009.5174662","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174662","url":null,"abstract":"We present an approach to model-based voice activity detection (VAD) for harsh environments. By using mel-frequency cepstral coefficients feature extracted from clean and noisy speech samples, an artificial neural network is trained optimally in order to provide a reliable model. There are three main aspects to this study: First, in addition to the developed model, recent state-of-the-art VAD methods are analyzed extensively. Second, we present an optimization procedure of neural network training, including evaluation of trained network performance with proper measures. Third, a large assortment of empirical results on the noisy TIMIT and SNOW corpuses including different types of noise at different signal-to-noise ratios is provided. We evaluate the built VAD model on the noisy corpuses and compare against the state-of-the-art VAD methods such as the ITU-T Rec. G. 729 Annex B, the ETSI AFE ES 202 050, and recently promising VAD algorithms. Results show that: (i) the proposed neural network classifier employing MFCC feature provides robustly high scores under different noisy conditions; (ii) the invented model is superior to other VAD methods in terms of various classification measures; (iii) the robustness of the developed VAD algorithm is still hold in the case of testing it with the completely mismatched environment.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130694494","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}