{"title":"Design of linear and circular antenna arrays using biogeography based optimization","authors":"A. Sharaqa, N. Dib","doi":"10.1109/AEECT.2011.6132503","DOIUrl":"https://doi.org/10.1109/AEECT.2011.6132503","url":null,"abstract":"The design of linear and circular antenna arrays is one of the important electromagnetic optimization problems. In this paper, the problem of designing these arrays for specific radiation properties is dealt with. The biogeography based optimization (BBO) method, which represents a new evolutionary algorithm, is used in the optimization process. BBO is used to minimize the maximum side lobe level (SLL) and null control for isotropic linear antenna arrays by optimizing different array parameters (position, amplitude, and phase). Similarly, for non-uniform circular antenna arrays (CAA), BBO is used to determine an optimum set of weights and positions that provide a radiation pattern with maximum SLL reduction with the constraint of a fixed major lobe beam width. The results obtained show the effectiveness of BBO compared to other optimization methods.","PeriodicalId":408446,"journal":{"name":"2011 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122710082","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 simplified method for off-line track matching for fleet managements","authors":"Mahmoud Alnaanah, A. Aljaafreh","doi":"10.1109/AEECT.2011.6132522","DOIUrl":"https://doi.org/10.1109/AEECT.2011.6132522","url":null,"abstract":"This paper presents a method to measure the discipline in fleet management automation. This method is based on calculating the matching degree between the actual track and the desired track. The actual track is a sequence of points that is provided by the Global Positioning System (GPS) and the desired track is also a sequence of points that is provided by the Geographic Information System (GIS). This algorithm simplifies the tracks into straight segments, then determines the matched and unmatched segments. The points where the vehicle left and return to the desired track are determined, and the difference in distance between these points is determined too. The significance of this method comes from its simplicity and speed.","PeriodicalId":408446,"journal":{"name":"2011 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121272188","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":"Implementation of the CA-CFAR algorithm for pulsed-Doppler radar on a GPU architecture","authors":"C. J. Venter, H. Grobler, K. Almalki","doi":"10.1109/AEECT.2011.6132514","DOIUrl":"https://doi.org/10.1109/AEECT.2011.6132514","url":null,"abstract":"The Cell-Averaging Constant False-Alarm Rate (CA-CFAR) algorithm was implemented and optimized in software on the NVIDIA Tesla C1060 GPU architecture for application in pulsed-Doppler radar signal processors. A systematic approach was followed to gradually explore opportunities for parallel execution and optimization by implementing the algorithm first in MATLAB (CPU), followed by native C (CPU) and finally NVIDIA CUDA (GPU) environments. Three techniques for implementing the CA-CFAR in software were identified and implemented, namely a na¨ıve technique, sliding window technique and a new variant which employs the Summed-Area Table (SAT) algorithm. The na¨ıve technique performed best on the GPU architecture. The SAT technique shows potential, especially for cases where very large CFAR windows are required. However, the results do not justify using the GPU architecture instead of the CPU architecture for this application when data transfer to and from the GPU is taken into consideration.","PeriodicalId":408446,"journal":{"name":"2011 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115530142","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}
Tomasz Kajdanowicz, S. Plamowski, Przemyslaw Kazienko
{"title":"Training set selection using entropy based distance","authors":"Tomasz Kajdanowicz, S. Plamowski, Przemyslaw Kazienko","doi":"10.1109/AEECT.2011.6132530","DOIUrl":"https://doi.org/10.1109/AEECT.2011.6132530","url":null,"abstract":"Distance measures, especially between probability density functions, are essential in solving machine learning problems. Among classification and clustering, data reduction and selection are some of them. In the paper a new distance measure for comparing and selecting training datasets is described. The distance between two datasets is based on variance of entropy in groups obtained by clustering joint datasets. The proposed approach is examined in dataset selection during prediction of debt portfolio value. Finally, basic evaluation on prediction performance is conducted.","PeriodicalId":408446,"journal":{"name":"2011 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122304952","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":"Tactile web navigator device for blind and visually impaired people","authors":"Alaeldin A. Ahmed, M. A. Yasin, S. Babiker","doi":"10.1109/AEECT.2011.6132519","DOIUrl":"https://doi.org/10.1109/AEECT.2011.6132519","url":null,"abstract":"Blind or visually impaired people have limited or no access to the internet. This paper presents a low cost tactile web navigator device aimed at enabling blind people to have feasible internet accessibility. This navigator design includes a microcontroller that communicates with the browser software proxy transcoder server running on a PC to acquire the text from a web page. The text is subsequently displayed using an array of solenoids giving the required tactile sense. The visually impaired user then uses his/her tactile sense to recognize the text in Braille language. This device also provides an English character mode. Many navigation functions like loading a webpage address, clicking on links and entering data (E-mails, passwords, etc) have been provided. The navigator was tested by volunteer blind users with excellent results. The cost of the implementation is an impressive ∼12% of the commercial Braille displays.","PeriodicalId":408446,"journal":{"name":"2011 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126314964","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}
Radu-Dinel Miruta, Cornelia-Ionela Badoi, E. Borcoci
{"title":"New packet fields for content aware classification","authors":"Radu-Dinel Miruta, Cornelia-Ionela Badoi, E. Borcoci","doi":"10.1109/AEECT.2011.6132509","DOIUrl":"https://doi.org/10.1109/AEECT.2011.6132509","url":null,"abstract":"This paper presents a solution for a new multidimensional packet classifier of an edge router, based on content — related new fields embedded in the data packets. The technique is applicable to content aware networks. The classification algorithm is using three new packet fields named Virtual Content Aware Network (VCAN), Service Type (STYPE) and U (unicast/multicast) which are part of the Content Awareness Transport Information (CATI) header. A CATI header is inserted into the transmitted data packets at the Service/Content Provider server side, in accordance with the media service definition, and enables the content awareness features at a new overlay Content Aware Network layer. The functionality of the CATI header within the classification process is then analyzed. Two possibilities are considered: the adaptation of the Lucent Bit vector algorithm and, respectively, of the tuple space search, in order to respond to the suggested multi-fields classifier. The results are very promising and can be very useful in the content-aware packet classification.","PeriodicalId":408446,"journal":{"name":"2011 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT)","volume":"56 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120920251","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":"Optimal allocation of DG regarding to power system security via DE technique","authors":"M. R. Estabragh, M. Mohammadian","doi":"10.1109/AEECT.2011.6132489","DOIUrl":"https://doi.org/10.1109/AEECT.2011.6132489","url":null,"abstract":"This paper presents a novel strategy for optimizing Distributed Generation placement to improvement power system voltage stability margin and reducing losses. This method establishes a tradeoff between the security and power losses by using Differential Evolution (DE) method to reach the best performance and acceptable operation. In recent years, Differential Evolution has been successfully used for the solution of complex optimization problems. Hence, with respect to the behavior of this non-linear hierarchical optimization problem, the proposed method has been developed and examined on IEEE 14 bus test system by a developed Toolbox.","PeriodicalId":408446,"journal":{"name":"2011 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121145285","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}
M. Mohammadian, M. Khaleghi, R. Azimi, A. Gharaveisi
{"title":"Optimal tuning of OLTC and RPCE to improve power system voltage stability based on ant colony","authors":"M. Mohammadian, M. Khaleghi, R. Azimi, A. Gharaveisi","doi":"10.1109/AEECT.2011.6132495","DOIUrl":"https://doi.org/10.1109/AEECT.2011.6132495","url":null,"abstract":"This paper proposed a novel strategy based on developed Ant Colony Optimization (ACO) algorithm which attempts to improve the voltage stability of the power systems with respect to minimum real power loss and proper voltages profile. This algorithm uses optimum settings of On-Line Tap Changer transformer (OLTC) and minimum number of Reactive Power Compensation Equipment (RPCE). The proposed algorithm is programmed on MATLAB and examine on IEEE 30-bus Test System to demonstrate the validity and the convenience of ACO approach with promising results.","PeriodicalId":408446,"journal":{"name":"2011 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125290824","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":"Users' classification and usage-pattern identification in academic social networks","authors":"O. Almousa","doi":"10.1109/AEECT.2011.6132525","DOIUrl":"https://doi.org/10.1109/AEECT.2011.6132525","url":null,"abstract":"Academic social networking sites are becoming increasingly popular. Several groups of academic people at different level of their career and from different disciplines are utilizing them for their benefit. This paper aims to explore usage patterns of an academic Social Networking Site (SNS) (namely Academia.edu) by different groups of academic users. It gains its importance because of the lack of academic social networking sites studies especially those concerning different user types and usage patterns of academic social networking sites.","PeriodicalId":408446,"journal":{"name":"2011 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124687698","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 statistical approach for estimating user satisfaction in spoken human-machine interaction","authors":"Alexander Schmitt, Benjamin Schatz, W. Minker","doi":"10.1109/AEECT.2011.6132535","DOIUrl":"https://doi.org/10.1109/AEECT.2011.6132535","url":null,"abstract":"This paper addresses a new approach for statistical modeling of user satisfaction in Spoken Dialogue Systems (SDS) and thereby allows an online monitoring of spoken human-machine interaction. The presented technique relies on a large set of input variables originating from system log files that quantify the ongoing spoken human-machine interaction. The target variable, user satisfaction (US), is captured in a lab study on a 5 point scale with 46 users interacting with an SDS. The model, which is based on Support Vector Machines (SVM) yields a performance of 49.2% unweighted average recall (Cohen's κ = .442, Spearman's ρ = .668) and significantly outperforms related work in that field.","PeriodicalId":408446,"journal":{"name":"2011 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT)","volume":"67 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121002227","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}