The next generation intelligent transport systems: standards and applicationsWongyos Keardsri
This document summarizes Wongyos Keardsri's seminar on intelligent transportation systems and ubiquitous ITS (u-ITS). It defines ITS as applying information and communication technologies to transport infrastructure and vehicles. Next generation ITS applies ubiquitous computing. U-ITS aims to provide transportation services that are user-centric, always available, seamless, and provide transparency of transportation environment status. The document also compares ITS and u-ITS and describes examples of u-ITS projects in the USA, Europe, Japan, and Thailand.
1. The document presents Wongyos Keardsri's Ph.D. seminar on an IP address anonymization scheme based on privacy levels.
2. The scheme considers privacy levels and three anonymization factors - IP address structures, network analysis functions, and computer law - to determine how to anonymize IP addresses.
3. Privacy tree structures are used to represent IP address structures and determine appropriate anonymization levels for different parts of IP addresses based on the relationships between addresses.
This document provides an outline for a tutor session on UNIX shell script programming. It introduces shells and shell scripts, and covers topics like variables, data operations, decision statements like if-else and switch-case, and iteration statements like for loops and while loops. Examples are provided throughout to illustrate different shell script programming concepts and syntax. Links to additional online resources on shell scripting are also included at the end.
SysProg-Tutor 02 Introduction to Unix Operating SystemWongyos Keardsri
The document provides an outline for a tutor session on UNIX operating systems. It covers the history of UNIX, the structure of UNIX including the kernel, shells, and file system, getting started with logging in and exiting, and an overview of UNIX commands that will be discussed such as directory navigation, file maintenance, display commands, and text processing. The tutor session aims to introduce students to the basic concepts and usage of UNIX operating systems.
SysProg-Tutor 01 Introduction to C Programming LanguageWongyos Keardsri
This document provides an outline for a tutor session on the C programming language. It begins with an introduction that discusses C's history and compares it to Java. It then covers various C language concepts like data types, operators, expressions, input/output functions like printf and scanf, and control flow structures like if/else statements. The outline concludes with a discussion of arrays, pointers, strings, structures, and file operations to be covered in the tutor session.
This document discusses graphs and graph theory concepts. It defines terms like paths, circuits, connectivity, Euler paths and circuits, Hamilton paths and circuits. It also describes Dijkstra's algorithm for finding the shortest path between two vertices in a weighted graph. Several examples are provided to illustrate graph concepts and applying Dijkstra's algorithm to find shortest paths in weighted graphs.
This document defines and provides examples of various graph concepts from discrete mathematics including:
- Complete graphs, cycle graphs, wheel graphs, and hypercubes as special types of simple graphs
- Bipartite graphs and complete bipartite graphs
- Subgraphs and unions of graphs
- Representing graphs using adjacency lists and matrices
- Graph isomorphism
It includes over 20 examples applying these graph concepts and definitions.
1. The document defines different types of graphs including simple graphs, multigraphs, pseudographs, directed graphs, and mixed graphs. It provides examples of how graphs can model real-world networks and relationships.
2. Graph terminology is defined, including adjacent vertices, neighborhoods, degrees of vertices, and the handshaking theorem. Examples show how to calculate degrees and neighborhoods in sample graphs.
3. Directed graphs are discussed, defining in-degrees and out-degrees of vertices in directed graphs.
This document discusses trees and their applications in three sentences:
Trees are connected graphs without cycles that can be used to model hierarchical data. Common tree types include binary search trees for storing and retrieving data efficiently and decision trees for modeling sequential decision processes. Tree traversal algorithms like preorder, inorder and postorder specify ways to systematically visit all vertices in a rooted tree.
The document discusses relations and their properties. It begins by defining a relation as a subset of the Cartesian product of two sets. Relations can be represented using ordered pairs in a set or graphically using arrows. Properties of relations such as reflexive, symmetric, and transitive are introduced. Examples are provided to illustrate relations and calculating their properties. The document also discusses n-ary relations, representing relations using matrices, and operations on relations such as selection.
This document provides examples and definitions related to probability and expected value. It introduces key concepts like finite probability, conditional probability, independence, and expected value. Some examples calculate the probability of events like rolling dice, randomly selecting balls from a bag, and coin flips. Other examples determine if events are independent or calculate the expected number of heads from coin flips. The document aims to explain fundamental probability topics through illustrative examples.
This document provides examples and definitions related to counting principles, including:
1) The product rule and sum rule for counting the number of ways a task can be completed.
2) The pigeonhole principle states that if more objects are placed in fewer boxes, at least one box will contain multiple objects.
3) Permutations refer to ordered arrangements of objects, and the number of r-permutations of a set of n distinct objects is calculated as P(n,r)=n!/(n-r)!.
The document discusses rules of inference and proofs in propositional logic. It begins by defining valid arguments and argument forms. It then introduces several common rules of inference like modus ponens, modus tollens, and disjunctive syllogism. The document provides examples of using these rules of inference to determine conclusions given certain premises. It also discusses direct proofs, indirect proofs using contraposition, and proof by cases. Worked examples are provided for each type of proof.
This document discusses propositional logic and logical equivalences. It begins by defining tautologies, contradictions, and contingencies. It then discusses logical equivalence and uses truth tables to show several examples of logically equivalent propositions. The document also lists common laws of logical equivalence, such as commutative, associative, distributive, and De Morgan's laws. It provides examples of using these laws to show logical equivalence without truth tables. Finally, the document discusses predicates, universal and existential quantification, and provides several examples of determining truth values of quantified statements.
This document defines and provides examples of basic concepts in propositional logic, including:
1. Propositions are declarative sentences that are either true or false. Common propositional variables include p, q, r.
2. Logical connectives combine propositions and include negation (¬p), conjunction (p∧q), disjunction (p∨q), conditional (p→q), biconditional (p↔q). Truth tables define the truth values of connected propositions.
3. Relations between conditionals include the converse, contrapositive, and inverse. Examples show how to derive these from a given conditional statement.
1. The document discusses functions and sequences. It begins by defining a function as an assignment of exactly one element from the codomain to each element of the domain.
2. It provides examples of determining the domain, codomain, and range of various functions. It also discusses one-to-one functions, where each element of the domain is mapped to a unique element in the codomain.
3. The document discusses adding and multiplying functions by defining (f1 + f2)(x) = f1(x) + f2(x) and (f1f2)(x) = f1(x)f2(x). It provides examples of calculating the sum and product of various
1. The document defines sets and provides examples of how to write sets using set notation. It discusses the definition of a set, elements of sets, and examples of common sets like integers, rational numbers, and real numbers.
2. Set equality and the empty set are introduced. Two sets are equal if they contain the same elements. The empty set, denoted {}, is the set with no elements.
3. Venn diagrams are discussed as a way to visually represent relationships between sets using circles or regions. Subsets are defined as sets where all elements of one set are also elements of a second set.
This document discusses finite state machines and regular expressions. It provides definitions and examples of finite state machines with output and without output. It also defines regular expressions recursively and provides examples of describing regular language sets using regular expressions. The document contains several examples of constructing state diagrams and tables for finite state machines based on descriptions, and determining if strings belong to regular language sets defined by regular expressions.