Loading...
Search for: pattern-matching
0.005 seconds

    Recognition of persian online handwriting using elastic fuzzy pattern recognition

    , Article International Journal of Pattern Recognition and Artificial Intelligence ; Volume 21, Issue 3 , 2007 , Pages 491-513 ; 02180014 (ISSN) Halavati, R ; Bagheri Shouraki, S ; Sharif University of Technology
    2007
    Abstract
    Persian is a fully cursive handwriting in which each character may take different forms in different parts of the word, characters overlap and there is a wide range of possible styles. These complexities make automatic recognition of Persian a very hard task. This paper presents a novel approach on recognition of such writings systems which is based on the description of input stream by a sequence of fuzzy linguistic terms; representation of character patterns with the same descriptive language; and comparison of inputs with character patterns using a novel elastic pattern matching approach. As there is no general benchmark for recognition of Persian handwriting, the approach has been tested... 

    Approximating edit distance in truly subquadratic time: Quantum and mapreduce

    , Article 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, 7 January 2018 through 10 January 2018 ; 2018 , Pages 1170-1189 ; 9781611975031 (ISBN) Boroujeni, M ; Ehsani, S ; Ghodsi, M ; HajiAghayi, M ; Seddighin, S ; ACM Special Interest Group on Algorithms and Computation Theory (SIGACT); SIAM Activity Group on Discrete Mathematics ; Sharif University of Technology
    Association for Computing Machinery  2018
    Abstract
    The edit distance between two strings is defined as the smallest number of insertions, deletions, and substitutions that need to be made to transform one of the strings to another one. Approximating edit distance in subquadratic time is one of the biggest unsolved problems in the field of combinatorial pattern matching" [21]. Our main result is a quantum constant approximation algorithm for computing the edit distance in truly subquadratic time. More precisely, we give an O(n1:858) quantum algorithm that approximates the edit distance within a factor of 7. We further extend this result to an O(n1:781) quantum algorithm that approximates the edit distance within a larger constant factor. Our... 

    A hybrid multimode contour integral method for analysis of the H-plane waveguide discontinuities

    , Article Progress in Electromagnetics Research ; Volume 81 , 2008 , Pages 167-182 ; 10704698 (ISSN) Banai, A ; Hashemi, A ; Sharif University of Technology
    Electromagnetics Academy  2008
    Abstract
    A hybrid method is introduced for analysis of the H-plane waveguide discontinuities. It combines multimode contour integral and mode matching techniques. The process is based on dividing the circuit structure into key building blocks and finding the multimode scattering matrix of each block individually. The multimode scattering matrix of the whole structure can be found by cascading these blocks. Also contour integral method is developed for analysis of multi-media circuits. Therefore, it is possible to analyze H-plane waveguide filters with dielectric resonators using this method. The accuracy and run time of the purposed method is compared with those reported in literatures and/or Ansoft... 

    Evolution of multiple states machines for recognition of online cursive handwriting

    , Article 2006 World Automation Congress, WAC'06, Budapest, 24 June 2006 through 26 June 2006 ; 2006 ; 1889335339 (ISBN); 9781889335339 (ISBN) Halavati, R ; Shouraki, S. B ; Hassanpour, S ; Sharif University of Technology
    IEEE Computer Society  2006
    Abstract
    Recognition of cursive handwritings such as Persian script is a hard task as there is no fixed segmentation and simultaneous segmentation and recognition is required. This paper presents a novel comparison method for such tasks which is based on a Multiple States Machine to perform robust elastic comparison of small segments with high speed through generation and maintenance of a set of concurrent possible hypotheses, The approach is implemented on Persian (Farsi) language using a typical feature set and a specific tailored genetic algorithm and the recognition and computation time is compared with dynamic programming comparison approach. Copyright - World Automation Congress (WAC) 2006  

    Accelerating Network Firewalls

    , M.Sc. Thesis Sharif University of Technology Milanian, Zhaleh (Author) ; Goudarzi, Maziar (Supervisor)
    Abstract
    With the proliferation of Internet-based applications and malicious attacks, security has become one of the most influential aspects in the network and, it should be considered from the beginning steps of designing the network infrastructure. Based on the fact that pattern matching is considered as one of the most important roles of security devices or applications, it becomes an important procedure in firewalls that have been classified as security equipments which adopt a security mechanism in order to restrict the traffic exchanged between networks and particular users or certain applications. While the trend of using compressed traffic is drastically increasing, this type of traffic is... 

    An Online Portfolio Selection Algorithm Using Pattern-matching Principle

    , M.Sc. Thesis Sharif University of Technology Azin, Pejman (Author) ; Khedmati, Majid (Supervisor)
    Abstract
    According to the rise of turnover and pace of trading, accelerating of analysis and making decision is unavoidable. Humans are unable to analyze big data quickly without behavioral biases so, using machines to analyze big data seems critical. Hence, financial markets tend to apply algorithmic trading in which some techniques like data mining and machine learning are notable. OLPS which sequentially allocates capital among a set of assets aiming to maximize the final return of investment in the long run, is the core problem in algorithmic trading. This article presents an online portfolio selection algorithm. The online portfolio selection sequentially selects a portfolio over a set of assets... 

    An Online Portfolio Selection Algorithm Using Recurrent Neural Networks and Controlling the Risk of Tradings with Value at Risk Method

    , M.Sc. Thesis Sharif University of Technology Karimi, Nima (Author) ; Khedmati, Majid (Supervisor)
    Abstract
    Nowadays, capital markets play a key role in the economies of countries. Hence, this market is expanding more and more every day. In such circumstances, traditional analysis methods such as fundamental analysis and technical analysis have lost their position due to low speed and accuracy. In recent years, automated trading systems have been proposed as a solution to these problems. The online portfolio selection, which sequentially allocates capital among a set of assets aiming to maximize the final return of investment in the long run, is the core problem in algorithmic trading. In this research, we present an online portfolio selection algorithm based on pattern matching principle.... 

    A novel pattern matching algorithm for genomic patterns related to protein motifs

    , Article Journal of Bioinformatics and Computational Biology ; Volume 18, Issue 1 , 2020 Foroughmand Araabi, M. H ; Goliaei, S ; Goliaei, B ; Sharif University of Technology
    World Scientific Publishing Co. Pte Ltd  2020
    Abstract
    Patterns on proteins and genomic sequences are vastly analyzed, extracted and collected in databases. Although protein patterns originate from genomic coding regions, very few works have directly or indirectly dealt with coding region patterns induced from protein patterns. Results: In this paper, we have defined a new genomic pattern structure suitable for representing induced patterns from proteins. The provided pattern structure, which is called "Consecutive Positions Scoring Matrix (CPSSM)", is a replacement for protein patterns and profiles in the genomic context. CPSSMs can be identified, discovered, and searched in genomes. Then, we have presented a novel pattern matching algorithm... 

    An online portfolio selection algorithm using clustering approaches and considering transaction costs

    , Article Expert Systems with Applications ; Volume 159 , November , 2020 Khedmati, M ; Azin, P ; Sharif University of Technology
    Elsevier Ltd  2020
    Abstract
    This paper presents an online portfolio selection algorithm based on pattern matching principle where it makes a decision on the optimal portfolio in each period and updates the optimal portfolio at the beginning of each period. The proposed method consists of two steps: i) sample selection, ii) portfolio optimization. First, in the sample selection, clustering algorithms including k-means, k-medoids, spectral and hierarchical clustering are applied to discover time windows (TW) similar to the recent time window. Then, after finding the similar time windows and predicting the market behavior of the next day, the optimum function along with the transaction cost is used in the portfolio... 

    A two-layer attack-robust protocol for IoT healthcare security: Two-stage identification-authentication protocol for IoT

    , Article IET Communications ; Volume 15, Issue 19 , 2021 , Pages 2390-2406 ; 17518628 (ISSN) Afsaneh, S ; Sepideh, A ; Ali, M ; Al-Majeed, S ; Sharif University of Technology
    John Wiley and Sons Inc  2021
    Abstract
    The majority of studies in the field of developing identification and authentication protocols for Internet of Things (IoT) used cryptographic algorithms. Using brain signals is also a relatively new approach in this field. EEG signal-based authentication algorithms typically use feature extraction algorithms that require high processing time. On the other hand, the dynamic nature of the EEG signal makes its use for identification/authentication difficult without relying on feature extraction. This paper presents an EEG-and fingerprint-based two-stage identification-authentication protocol for remote healthcare, which is fast, robust, and multilayer-based. A modified Euclidean distance... 

    A two-layer attack-robust protocol for IoT healthcare security: Two-stage identification-authentication protocol for IoT

    , Article IET Communications ; Volume 15, Issue 19 , 2021 , Pages 2390-2406 ; 17518628 (ISSN) Afsaneh, S ; Sepideh, A ; Ali, M ; Salah, A. M ; Sharif University of Technology
    John Wiley and Sons Inc  2021
    Abstract
    The majority of studies in the field of developing identification and authentication protocols for Internet of Things (IoT) used cryptographic algorithms. Using brain signals is also a relatively new approach in this field. EEG signal-based authentication algorithms typically use feature extraction algorithms that require high processing time. On the other hand, the dynamic nature of the EEG signal makes its use for identification/authentication difficult without relying on feature extraction. This paper presents an EEG-and fingerprint-based two-stage identification-authentication protocol for remote healthcare, which is fast, robust, and multilayer-based. A modified Euclidean distance... 

    Fault diagnosis within multistage machining processes using linear discriminant analysis: a case study in automotive industry

    , Article Quality Technology and Quantitative Management ; Volume 14, Issue 2 , 2017 , Pages 129-141 ; 16843703 (ISSN) Bazdar, A ; Baradaran Kazemzadeh, R ; Akhavan Niaki, S. T ; Sharif University of Technology
    Taylor and Francis Ltd  2017
    Abstract
    Statistical process control provides useful tools to improve the quality of multistage machining processes, specifically in continuous manufacturing lines, where product characteristics are measured at the final station. In order to reduce process errors, variation source identification has been widely applied in machining processes. Although statistical estimation and pattern matching-based methods have been utilized to monitor and diagnose machining processes, most of these methods focus on stage-by-stage inspection using complex models and patterns. However, because of the existence of high rate alarms and the complexity of the machining processes, a surrogate modelling is needed to solve... 

    Mobility aware distributed topology control in mobile ad-hoc networks using mobility pattern matching

    , Article WiMob 2009 - 5th IEEE International Conference on Wireless and Mobile Computing Networking and Communication, 12 October 2009 through 14 October 2009, Marrakech ; 2009 , Pages 453-458 ; 9780769538419 (ISBN) Khaledi, MH ; Mousavi, S. M ; Rabiee, H. R ; Movaghar, A ; Khaledi, MJ ; Ardakanian, O ; Sharif University of Technology
    Abstract
    Topology control algorithms in mobile ad-hoc networks aim to reduce the power consumption while keeping the topology connected. These algorithms can preserve network resources and increase network capacity. However, few efforts have focused on the issue of topology control in presence of node mobility. One of the notable mobility aware topology control protocols is the "Mobility Aware Distributed Topology Control Protocol". The main drawback of this protocol is on its mobility prediction method. This prediction method assumes linear movements and is unable to cope with sudden changes in the mobile node movements. In this paper, we propose a pattern matching based mobility prediction method...