{"title":"Evaluation of authorship attribution software on a Chat bot corpus","authors":"Nawaf Ali, Musa Hindi, Roman V Yampolskiy","doi":"10.1109/ICAT.2011.6102123","DOIUrl":"https://doi.org/10.1109/ICAT.2011.6102123","url":null,"abstract":"Authorship recognition is a technique used to identify the author of an unclaimed document, or in case when more than one author claims a document. Authorship recognition has great potential for applications in Computer forensics. The intended goal of this research is to identify a Chat bot by analyzing conversation log files. This is a novel area of investigation, as artificially intelligent authors have not been profiled based on their linguistic behavior. The collected data comes from chat logs between different Chat Bots and between Chat Bots and Human users. The initial experiments utilizing collected data demonstrate the feasibility of our approach.","PeriodicalId":214435,"journal":{"name":"2011 XXIII International Symposium on Information, Communication and Automation Technologies","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129841807","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":"Automatic extraction of cortical gray matter by geodesic contours","authors":"Ali Iskurt, Y. Becerikli","doi":"10.1109/ICAT.2011.6102104","DOIUrl":"https://doi.org/10.1109/ICAT.2011.6102104","url":null,"abstract":"Automatic quantitative analysis of brain tissues has a high importance. However, lack of high precision still makes results unreliable. This paper presents a novel system which separates cortical GM from WM. It imitates human perception like edge detection algorithms but recovers their disability in segmentation. System is fully automatic and unsupervised. Fastened segments of geodesic passive contours (FSG) are utilized and the perceptive sensitivity to edges is imitated. This nature of the solution proved to treat the inhomogeneity and noise problems well. The technique is tested on both real and synthetic databases and compared with widely used software of SPM and works faster. Our technique succeeded in getting average misclassification rate of 4.8% for WM and correct GM-WM boundary rate of 77% being very close to experts' agreement.","PeriodicalId":214435,"journal":{"name":"2011 XXIII International Symposium on Information, Communication and Automation Technologies","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121563261","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}
Tarik Terzimehic, Semir Silajdzic, Vedran Vajnberger, J. Velagić, N. Osmic
{"title":"Path finding simulator for mobile robot navigation","authors":"Tarik Terzimehic, Semir Silajdzic, Vedran Vajnberger, J. Velagić, N. Osmic","doi":"10.1109/ICAT.2011.6102086","DOIUrl":"https://doi.org/10.1109/ICAT.2011.6102086","url":null,"abstract":"This work considers the whole process of making a path finding simulator for Pioneer 3DX mobile robot. This simulator needs to be provided implementation of various optimal path finding algorithms and make their comparisons. For this purpose a software solution (GUI in Matlab) has been designed and tested. The simulator allows selecting mazes, different starting and finishing nodes and algorithms. Five different algorithms were used to determine the shortest path between nodes for a mobile robot within various mazes: Breadth-first search, Depth-first search, Bellman-Ford algorithm, Dijkstra's algorithm and A∗ algorithm. The main objective of this paper was to obtain fully and precise information on routing and finding the shortest path between two nodes within a maze for the mobile robot. Validity and effectiveness of the used algorithms were verified through both simulations and experiments.","PeriodicalId":214435,"journal":{"name":"2011 XXIII International Symposium on Information, Communication and Automation Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126224308","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}
Alvin Abdagic, Adis Sinanović, J. Velagić, N. Osmic
{"title":"Reduction of low-resolution incremental encoder usage effects on control performance by using a fuzzy controller","authors":"Alvin Abdagic, Adis Sinanović, J. Velagić, N. Osmic","doi":"10.1109/ICAT.2011.6102107","DOIUrl":"https://doi.org/10.1109/ICAT.2011.6102107","url":null,"abstract":"Different methods for position control of a DC servomotor are examined. Position is measured with a low-resolution incremental encoder that is a cheap solution that allows for free movement of motor shaft. This kind of measurement affects control and degrades its performance. Entire system is first identified using Matlab System Identification Toolbox. P and PD controllers, along with cascaded and observer-based controllers are synthesised and tested. Sugeno type fuzzy controller with two inputs and constant output membership functions shows the best results of the tested controllers in both simulation and testing done on a real system. Simulation is performed with Matlab Simulink. Control system prototyping is done using DS1104 board.","PeriodicalId":214435,"journal":{"name":"2011 XXIII International Symposium on Information, Communication and Automation Technologies","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125716476","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 torque control of the Interior Permanent Magnet Synchronous Machine","authors":"S. Carpiuc, D. Patrascu, C. Lazar","doi":"10.1109/ICAT.2011.6102091","DOIUrl":"https://doi.org/10.1109/ICAT.2011.6102091","url":null,"abstract":"The basic function of any type of electric machine used in automotive powertrain is to propel the automobile in motor mode or to recharge the high-voltage battery in generator mode. The torque control of electric machine in motor and generator modes, using more efficient high-voltage battery, is a goal for automotive industry. The entire control structure must be designed so as to take into account also the limitations of the computer based implementation in an Electronic Control Unit. A good choice for Hybrid Electric Vehicles (HEVs), due to many advantages, is the Interior Permanent Magnet Synchronous Machine (IPMSM). In this paper, a model for a 35 KW IPMSM used by a future HEV is presented. Starting from the developed model a dynamic simulator was implemented in MATLAB/SIMULINK and then, an optimal field oriented control strategy is applied with aims at optimum torque control both in constant torque region and in constant power region, considering the variation of machine parameters. The model was validated against the data provided by Continental Automotive Romania from the system testbench. The simulated results obtained with the proposed control strategy are compared with the ones obtained with the classical PID approach and the results show improved performances.","PeriodicalId":214435,"journal":{"name":"2011 XXIII International Symposium on Information, Communication and Automation Technologies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133161288","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":"Exact double DCJ distance between circular genomes","authors":"Damir Hasić, H. Gavranovic","doi":"10.1109/ICAT.2011.6102134","DOIUrl":"https://doi.org/10.1109/ICAT.2011.6102134","url":null,"abstract":"The double cut-and-join (DCJ) operation, or 2-break rearrangement was introduced by Yancopoulos et al. ([1]). Finding DCJ distance between double genomes is NP-hard ([2]). To a pair of regular and all-duplicates genome, having only circular chromosomes, we assign generalized breakpoint graph (introduced by Alekseyev and Pevzner ([3]). We give an algorithm for finding the approximation and exact double DCJ distance. We do this by decomposing GBG into maximum number of alternating, closed trails, using branch-and-bound method.","PeriodicalId":214435,"journal":{"name":"2011 XXIII International Symposium on Information, Communication and Automation Technologies","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129233991","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 control engineering perspective to radio resource management challenges in emerging cellular/“noncellular” radio systems","authors":"Z. Uykan","doi":"10.1109/ICAT.2011.6102099","DOIUrl":"https://doi.org/10.1109/ICAT.2011.6102099","url":null,"abstract":"The technological evolution of the wireless cellular systems has been very rapid in last two decades. In the coming decade of “converging wireless networks/systems/ecosystems”, there is an increasing demand on achieving very high data rates ubiquitously even with high mobile speeds as if we connected to a wired ADSL! Radio Resource Management (RRM) for the emerging wireless systems will be the key mechanism for achieving such high data rates. Indeed, RRM has already been a hot research area in both academia and industry for decades. And due to the complexity of the emerging wireless systems, an interdisciplinary approach and/or methodology is needed to tackle the new RRM challenges. In this paper, we provide a control engineering view onto some of the RRM challenges in emerging wireless networks, with a special emphasis on distributed power control. For example, we establish a link between power control design and dynamic neural networks, two different areas whose scope of interest, motivations and settings are completely different. Here, we emphasize the importance and the need of interdisciplinary approach. Some subjects to be addressed within the paper shall include future-generation cellular/“noncellular” systems, radio resource management challenges, energy efficiency and distributed power control algorithms, variable-structure-systems based power control, channel/frequency allocation, spectral-clustering based channel allocation, Hopfield neural networks.","PeriodicalId":214435,"journal":{"name":"2011 XXIII International Symposium on Information, Communication and Automation Technologies","volume":"2 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130273407","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":"Reduced order dynamics and stability of a parallel manipulator through bond-graph technique","authors":"I. Yildiz, V. Ömürlü","doi":"10.1109/ICAT.2011.6102084","DOIUrl":"https://doi.org/10.1109/ICAT.2011.6102084","url":null,"abstract":"Dynamic characteristics of complex systems are very important for control system design. This paper represents the differences between full and reduced order dynamical models of a generalized Stewart Platform Mechanism. Full model includes all the dynamics, gravity effects, viscous friction at the joints and the linear motor dynamics. Reduced order dynamics includes all the dynamics of full system model except linear motor dynamics. Both full/reduced order dynamics are modeled using bond-graph technique and nonlinear state-space representations of models are obtained. Stability of both models is investigated by observing the variations of the system matrix eigenvalues which are utilized from the state-space equations. Four different trajectories are applied to the full order and to the reduced order Bond-Graph model for validation purposes. Satisfactory match between full/reduced order models is achieved.","PeriodicalId":214435,"journal":{"name":"2011 XXIII International Symposium on Information, Communication and Automation Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131045561","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":"Full Wave Analysis in 3D laser scans for vegetation detection in urban environments","authors":"J. Elseberg, D. Borrmann, A. Nüchter","doi":"10.1109/ICAT.2011.6102101","DOIUrl":"https://doi.org/10.1109/ICAT.2011.6102101","url":null,"abstract":"This paper presents a novel technique for detecting vegetation of virtually all forms in terrestrial laser scanning data of urban environments. We make use of a modern laser range finder capability to measure multiple echoes per laser pulse via Full Wave Analysis. The algorithm is able to efficiently, i.e., less than acquisition time, identify vegetation to a high degree of accuracy (more than 99 percent). We present and evaluate three alternatives to classify candidate regions as either vegetation or non-vegetation.","PeriodicalId":214435,"journal":{"name":"2011 XXIII International Symposium on Information, Communication and Automation Technologies","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122621216","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":"V-BiCoMeS: A binary content addressable memory system","authors":"Z. Uykan","doi":"10.1109/ICAT.2011.6102110","DOIUrl":"https://doi.org/10.1109/ICAT.2011.6102110","url":null,"abstract":"In this paper, we present a novel binary content addressable memory system based on a variable structure concept. The stability of the proposed system is shown by a Lyapunov or energy function. As applied to the problem of recalling of degraded patterns/images, the simulation results suggest that the proposed content addressable memory system outperforms the standard Hopfield memory model with the same weight matrices.","PeriodicalId":214435,"journal":{"name":"2011 XXIII International Symposium on Information, Communication and Automation Technologies","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126087576","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}