Wei-Cheng Chen mento0513@gmail.com http://myweb.ncku.edu.tw/~f74002060/Course5.rar Department of Computer Science and Information Engineering National.

Slides:

Advertisements

Similar presentations

Deep Packet Inspection with DFA-trees and Parametrized Language Overapproximation Author: Daniel Luchaup, Lorenzo De Carli, Somesh Jha, Eric Bach Publisher:

Advertisements

Scalable Packet Classification Using Hybrid and Dynamic Cuttings Authors : Wenjun Li,Xianfeng Li Publisher : Engineering Lab on Intelligent Perception.

Optimizing Regular Expression Matching with SR-NFA on Multi-Core Systems Authors : Yang, Y.E., Prasanna, V.K. Yang, Y.E. Prasanna, V.K. Publisher : Parallel.

A Novel Cell Placement Algorithm For Flexible TFT Circuit With Mechanical Strain And Temperature Consideration Jiun-Li Lin, Po-Hsun Wu, and Tsung-Yi Ho.

Recursive Algorithms Nelson Padua-Perez Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.

HybridCuts: A Scheme Combining Decomposition and Cutting for Packet Classification Authors : Wenjun Li, Xianfeng Li Publisher : 2013 IEEE 21st Annual Symposium.

Thopson NFA Presenter: Yuen-Shuo Li Date: 2014/5/7 Department of Computer Science and Information Engineering National Cheng Kung University, Taiwan R.O.C.

Packet Classification using Rule Caching Author: Nitesh B. Guinde, Roberto Rojas-Cessa, Sotirios G. Ziavras Publisher: IISA, 2013 Fourth International.

Software Engineering Laboratory, Department of Computer Science, Graduate School of Information Science and Technology, Osaka University What Do Practitioners.

Packet Classification Using Multi-Iteration RFC Author: Chun-Hui Tsai, Hung-Mao Chu, Pi-Chung Wang Publisher: COMPSACW, 2013 IEEE 37th Annual (Computer.

3C Technologies & Information Appliances Instructors: Fu-Chiung Cheng ( 鄭福炯 ) Associate Professor Computer Science & Engineering Tatung University

Leveraging Traffic Repetitions for High- Speed Deep Packet Inspection Author: Anat Bremler-Barr, Shimrit Tzur David, Yotam Harchol, David Hay Publisher:

A Regular Expression Matching Algorithm Using Transition Merging Department of Computer Science and Information Engineering National Cheng Kung University,

Department of Computer Science 1 Recursion & Backtracking 1.The game of NIM 2.Getting out of a maze 3.The 8 Queen’s Problem 4.Sudoku.

Developing Orientation based on Current project Huy-Tien, Bui 裴輝進 Department of Mechanical Engineering National Cheng Kung University Tainan, Taiwan March.

Intelligent DataBase System Lab, NCKU, Taiwan Josh Jia-Ching Ying 1, Wang-Chien Lee 2, Tz-Chiao Weng 1 and Vincent S. Tseng 1 1 Department of Computer.

Early Detection of DDoS Attacks against SDN Controllers

Binary-tree-based high speed packet classification system on FPGA Author: Jingjiao Li*, Yong Chen*, Cholman HO**, Zhenlin Lu* Publisher: 2013 ICOIN Presenter:

Packet Classification Using Dynamically Generated Decision Trees

GFlow: Towards GPU-based High- Performance Table Matching in OpenFlow Switches Author : Kun Qiu, Zhe Chen, Yang Chen, Jin Zhao, Xin Wang Publisher : Information.

LOP_RE: Range Encoding for Low Power Packet Classification Author: Xin He, Jorgen Peddersen and Sri Parameswaran Conference : IEEE 34th Conference on Local.

Hierarchical Hybrid Search Structure for High Performance Packet Classification Authors : O˜guzhan Erdem, Hoang Le, Viktor K. Prasanna Publisher : INFOCOM,

LightFlow : Speeding Up GPU-based Flow Switching and Facilitating Maintenance of Flow Table Author : Nobutaka Matsumoto and Michiaki Hayashi Conference:

10.2 Logarithms and Logarithmic functions. Graphs of a Logarithmic function verse Exponential functions In RED y = 10 x.

JA-trie: Entropy-Based Packet Classiﬁcation Author: Gianni Antichi, Christian Callegari, Andrew W. Moore, Stefano Giordano, Enrico Anastasi Conference.

Lecture 1 Data Structures Aamir Zia. Introduction Course outline Rules and regulations Course contents Good Programming Practices Data Types and Data.

A Multi-dimensional Packet Classification Algorithm Based on Hierarchical All-match B+ Tree Author: Gang Wang, Yaping Lin*, Jinguo Li, Xin Yao Publisher:

CSG3F3/ Desain dan Analisis Algoritma

Recursion Recursion is a fundamental programming technique that can provide an elegant solution certain kinds of problems © 2004 Pearson Addison-Wesley.

Reorganized and Compact DFA for Efficient Regular Expression Matching

2018/4/23 Dynamic Load-balanced Path Optimization in SDN-based Data Center Networks Author: Yuan-Liang Lan , Kuochen Wang and Yi-Huai Hsu Presenter: Yi-Hsien.

Introduction to Chinese Medicine and Crossculture Bioethics 2017

Recursion Topic 5.

CSC 222: Computer Programming II

Why Choose Computer Science?

Computer Science 4 Mr. Gerb

A DFA with Extended Character-Set for Fast Deep Packet Inspection

2018/6/26 An Energy-efficient TCAM-based Packet Classification with Decision-tree Mapping Author: Zhao Ruan, Xianfeng Li , Wenjun Li Publisher: 2013.

CS5040: Data Structures and Algorithms

Object-Oriented Programming

Topics discussed in this section:

Depth First Search—Backtracking

Problem Solving: Brute Force Approaches

Applications of Stacks and Queues for Constraint Satisfaction Problems

CSS 342 Data Structures, Algorithms, and Discrete Mathematics I

Parallel Processing Priority Trie-based IP Lookup Approach

2018/12/29 A Novel Approach for Prefix Minimization using Ternary trie (PMTT) for Packet Classification Author: Sanchita Saha Ray, Abhishek Chatterjee,

Memory-Efficient Regular Expression Search Using State Merging

Data science online training.

A Small and Fast IP Forwarding Table Using Hashing

An Investigation of the Course-Section Assignment Problem

A New String Matching Algorithm Based on Logical Indexing

National Taiwan University

C Programming Lecture 0 : Introduction

Lecture 4 Dynamic Programming

Fundamental Structures of Computer Science II

Compact DFA Structure for Multiple Regular Expressions Matching

2019/5/5 A Flexible Wildcard-Pattern Matching Accelerator via Simultaneous Discrete Finite Automata Author: Hsiang-Jen Tsai, Chien-Chih Chen, Yin-Chi Peng,

Published in 2016 International Computer Symposium (ICS) Authors

Reference Router on NetFPGA 1G

Presenter: Yu Hao, Tseng Date: 2014/8/25

National Taiwan University

Announcements Assignment #4 is due tonight. Last lab program is going to be assigned this Wednesday. ◦ A backtracking problem.

Pattern Based Packet Filtering using NetFPGA in DETER Infrastructure

Engineering Design Process

Lightweight Security Scheme for Vehicle Tracking System Using CoAP

2019/10/9 A Weighted ECMP Load Balancing Scheme for Data Centers Using P4 Switches Presenter：Hung-Yen Wang Authors：Jin-Li Ye, Yu-Huang Chu, Chien Chen.

Packet Classification Using Binary Content Addressable Memory

Recursion 1. The computer science equivalent of mathematical induction. 2. A way of defining something in terms of itself. 3. Ex. f(n) = 1,

2019/11/12 Efficient Measurement on Programmable Switches Using Probabilistic Recirculation Presenter：Hung-Yen Wang Authors：Ran Ben Basat, Xiaoqi Chen,

Presentation transcript:

Wei-Cheng Chen mento0513@gmail.com http://myweb.ncku.edu.tw/~f74002060/Course5.rar Department of Computer Science and Information Engineering National Cheng Kung University Tainan, Taiwan made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513

Backtracking What is backtracking? A searching technique Goal Find solutions under some constraints Try to list out all kinds of possible ways Concept Enumerate ( 枚舉 ) Pruning ( 剪枝 ) made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example Goal give 5 numbers ( 1~5 ) choose 3 numbers and list out by its order possible solution – 1 2 3 、 2 3 4 、 3 4 5 … 想想怎麼用recursive實作，想通你就會一半了 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example 1 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example 1 1 2 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example 1 1 2 1 2 3 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example 1 1 2 1 2 3 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example 1 1 2 1 2 3 1 2 4 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example 1 1 2 1 2 3 1 2 4 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example 1 1 2 1 2 3 1 2 4 1 2 5 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example 1 1 2 1 2 3 1 2 4 1 2 5 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example 1 1 2 1 2 3 1 2 4 1 2 5 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example 1 1 2 1 3 1 2 3 1 2 4 1 2 5 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example 1 1 2 1 3 1 2 3 1 2 4 1 2 5 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example 1 1 2 1 3 After a while . . . 1 2 3 1 2 4 1 2 5 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Example You find all the solution 123 234 345 124 235 125 245 134 135 145 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Strategy Enumerate possible solution by DFS order Set the end point (or stack overflow) return when find out a solution Answer Array maintain possible solution during searching Prune Skip unnecessary search made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Pseudo Code made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Practice Uva 441 Uva 167 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

HOMEWORK 　Uva : 167,200,291,441,524,574,624,750,989,10305,10503,11085,11686 　POJ : 367,1094,1128,1101

made by electron & kk & rabbit125 made by mento0513 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000