離散專題 (I) (Topics in Discrete Mathematics) Hung-Lin Fu ( 傅恆霖 ) Department of Applied Mathematics National Chiao Tung University Hsin Chu, Taiwan 30010.

Slides:



Advertisements
Similar presentations
HOW MATHS CAN CHANGE YOUR LIFE Chris Budd Degree opportunities in Mathematics and Statistics.
Advertisements

Advanced Algebra/Pre-calculus Advanced Functions and Modeling Math Analysis AP Statistics Statistics and Probability/Discrete Math.
Recursively Defined Functions
3.5 Paradox  1.Russell’s paradox  A  A, A  A 。  Russell’s paradox: Let S={A|A  A}. The question is, does S  S?  i.e. S  S or S  S?  If S  S,
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
GRE Mathematics Subject Test Workshop MSRI-UP 2013.
Recursion. n! (n factorial)  The number of ways n objects can be permuted (arranged).  For example, consider 3 things, A, B, and C.  3! = 6 1.ABC 2.ACB.
A Workshop on Subject GRE / AGRE Maths in 9 Classes, II Hours each Day & Three mock tests for AGRE By: Satyadhar Joshi
Math 308 Discrete Mathematics Discrete Mathematics deals with “Separated” or discrete sets of objects (rather than continuous sets) Processes with a sequence.
About the Course Lecture 0: Sep 2 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
From Discrete Mathematics to AI applications: A progression path for an undergraduate program in math Abdul Huq Middle East College of Information Technology,
CS 1 – Introduction to Computer Science Introduction to the wonderful world of Dr. T Dr. Daniel Tauritz.
 Linear Programming and Smoothed Complexity Richard Kelley.
Careers in Mathematics 24 March Careers In Mathematics What can you do with a B.Sc. degree in Mathematics ? Where do you want to work ?
Module #1 - Logic Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank. Modified By Mingwu Chen 1 Module.
4-cycle Designs Hung-Lin Fu ( 傅恆霖 ) 國立交通大學應用數學系 Motivation The study of graph decomposition has been one of the most important topics in graph theory.
1 Trends in Mathematics: How could they Change Education? László Lovász Eötvös Loránd University Budapest.
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
1 Discrete Structures ICS-252 Dr. Ahmed Youssef 1.
CSNB143 – Discrete Structure
1 9/8/2015 MATH 224 – Discrete Mathematics Basic finite probability is given by the formula, where |E| is the number of events and |S| is the total number.
Discrete Mathematics I 暨南大学 信息科学技术学院 计算机科学系 黄 战 副教授 离散数学 I (全英)
About the Course Lecture 0: Sep 10 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
Introduction to the Theory of Computation
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Structure of Study Programmes
Elements of Combinatorics 1. Permutations (Weak Definition) A permutation is usually understood to be a sequence containing each element from a finite.
DISCRETE COMPUTATIONAL STRUCTURES CSE 2353 Summer 2005.
Structure of Study Programmes Bachelor of Computer Science Bachelor of Information Technology Master of Computer Science Master of Information Technology.
Day 1: Discrete Intro, 4 cubes class activity, voting project Assigned Classwork: 4 Cubes Activity Homework (day 1): Real World Example (follow directions.
DI-FCT-UNL Departamento de Informática Faculdade de Ciências e Tecnologia Universidade Nova de Lisboa UNL’s new Bologna-style 1st-Cycle Degree (BSc) in.
Benjamin Gamble. What is Time?  Can mean many different things to a computer Dynamic Equation Variable System State 2.
© M. Winter COSC/MATH 4P61 - Theory of Computation COSC/MATH 4P61 Theory of Computation Michael Winter –office: J323 –office hours: Mon & Fri, 10:00am-noon.
University of Colorado Denver Department of Mathematical and Statistical Sciences Graduate program in Applied Mathematics Applications Continuous models:
Discrete mathematics Kwon, Taekyoung Courtesy of Dr. Michael P. Frank University of Florida.
Korea Advanced Institute of Science and Technology, Dept. of EECS, Div. of CS, Information Systems Lab. 1/10 CS204 Course Overview Prof.
Discrete Mathematics 이재원 School of Information Technology
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
1 HEINZ NIXDORF INSTITUT University of Paderborn Algorithms und Complexity Seminar Designing Peer-to-Peer- Networks Christian Schindelhauer
DISCRETE COMPUTATIONAL STRUCTURES CS Fall 2005.
Discrete Structures for Computing
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
Single Subject Credential in Mathematics Margaret Kidd (voice) (fax)
Discrete Mathematics ( 離散數學 ) Ming-Jer Tsai. Outline What is Discrete Mathematics? Why learn Discrete Mathematics? What will be taught in the class? How.
Department of Computer Science and Automation Indian Institute of Science, Bangalore, India. CSA Research Areas Theoretical Computer Science.
Random Geometric Graph Model Model for ad hoc/sensor networks n nodes placed in d-dim space Connectivity threshold r Two nodes u,v connected iff ||u-v||
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Great Theoretical Ideas in Computer Science for Some.
Final Year in Summary…. Lingering Doubts? Introductions.
Discrete mathematics Kwon, Tae-kyoung
5 Lecture in math Predicates Induction Combinatorics.
What is Discrete Math?. “Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous.” mathematicalstructuresdiscrete.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
The Goal of Science To create a set of models that describe the measurable universe. These models must – Fit previous verified measurements applicable.
Discrete Structures MT217 Lecture 01. Course Objectives Express statements with the precision of formal logic Analyze arguments to test their validity.
Discrete Mathematics Introduction.
GCD and Optimization Problem
Discrete Mathematics and Its Applications
Discrete Mathematics and its Applications
DISCRETE COMPUTATIONAL STRUCTURES
Discrete Mathematics and its Applications
離散數學 DISCRETE and COMBINATORIAL MATHEMATICS
DISCRETE COMPUTATIONAL STRUCTURES
Discrete Mathematics in the Real World
離散專題(I) (Topics in Discrete Mathematics)
Linear Algebra Berlin Chen
Essential Question: How can we determine if the model for a function should be discrete or continuous?
COURSE PLANNING IN AN OPEN ENROLLMENT ENVIRONMENT
Discrete Mathematics and Its Applications
Learning a hidden graph with adaptive algorithms
Presentation transcript:

離散專題 (I) (Topics in Discrete Mathematics) Hung-Lin Fu ( 傅恆霖 ) Department of Applied Mathematics National Chiao Tung University Hsin Chu, Taiwan 30010

Discrete? The best known definition for “discrete” is “not continuous”. We can define “continuous functions” from a set into another set. Without a suitable domain, we go nowhere in defining such a function. In mathematics, a continuous function is a function for which, intuitively, "small" changes in the input result in "small" changes in the output.mathematics function

Discrete Mathematics? Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics – such as integers, graphs, and statements in logic – do not vary smoothly in this way, but have distinct, separated values. mathematicalstructuresdiscrete continuousreal numbersintegersgraphslogic

Topics? Theoretical computer science (Applications) Theoretical computer science Information theory (Coding Theory and Cryptography Theory) Information theory Logic Set theory Combinatorial Designs (Many branches) Graph theory (Many branches) Graph theory Probability (Discrete) Probability Number theory (Integers) Number theory

More Topics Algebra and Linear Algebra (Applied) Algebra Calculus of finite differences, discrete calculus or discrete analysis Calculus of finite differences, discrete calculus or discrete analysis Geometry (Finite Geometry and Discrete Geometry) Geometry Topology (Combinatorial Topology) Topology Operations research (Combinatorial Optimization) Operations research Game theory, decision theory, utility theory, social choice theory (Combinatorial Optimization) Game theory, decision theory, utility theory, social choice theory Discretization Discrete analogues of continuous mathematics Hybrid discrete and continuous mathematics

And More Wireless Communication Small World Complex Networks Computational Molecular Biology Machine Learning Enumerative Combinatorial Theory

What to do? Clearly, there is no way that you can study all the topics mentioned above.

From the Basics! 你 ( 妳 ) 先要跑的快才決定要參加徑賽的那一 個項目。 Prepare your chips before you play the game. We are in the department of Applied Mathematics not Mathematical Applications.

Unique Place to Start 唯一的組合數學組。 Always, you have something to learn in each semester: Graph Theory, Combinatorial Designs, Graph Algorithms, Cryptography, Probability, Computational Molecular Biology, …. You also have the freedom to learn whatever you like yourself. ( 共同指導。 )

No Short Cut! Be Patient! Be Passionate! Be Positive! You have to work harder than the others in order to be better!

一分耕耘, 一分收穫。 She was a student of mine and has been the only archer in Taiwan who was in our Olympic Team three times. She has shot over a million arrows in her shooting career.

About this course ( 離散專題 ) We have classes on Sep. 17th, 24th; Oct. 1st, 8th, 15th, 22nd, 29th; Nov. 5th, 19th, 26th; Dec. 3rd, 10th, 17th, 24th; Jan. 7th. Time: 13:20 – 15:10, Monday. You have to present a scheduled talk in English and the title of your talk can be chosen from the following list but one title will be presented by at most two of you (in next page). Let me know as soon as you decide which one you choose. You may use power point but your talk can not be shorter than 40 minutes.

List of titles 1.Distance between unsigned permutations 2.Distance between signed permutations 3.Distance between arbitrary strings 4.Distance between balanced strings 5.Set systems and the syntenic distance 6.Median and Halving Problems 7.The large parsimony problem Ref. Combinatorics of Genome Rearrangements

Talks will be presented starting from the 15th of Oct. We shall have a couple of invited talks before that time. The order of presentation will follow the following the registration form 1 – 14: , , , , …. (You may come to check your order.)