Algorithm of Basis reduction 張圻毓. Outline Algorithm Example.

Slides:



Advertisements
Similar presentations
This algorithm is used for dimension reduction. Input: a set of vectors {Xn є }, and dimension d,d
Advertisements

Numerical Linear Algebra in the Streaming Model Ken Clarkson - IBM David Woodruff - IBM.
Algorithms Algorithm: what is it ?. Algorithms Algorithm: what is it ? Some representative problems : - Interval Scheduling.
1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Example: Given a matrix defining a linear mapping Find a basis for the null space and a basis for the range Pamela Leutwyler.
Ch. Eick: More on Machine Learning & Neural Networks Different Forms of Learning: –Learning agent receives feedback with respect to its actions (e.g. using.
Finding Reduced Basis for Lattices Ido Heskia Math/Csc 870.
Appendix B Solving Recurrence Equations : With Applications to Analysis of Recursive Algorithms.
Refining Edits and Alignments Υλικό βασισμένο στο κεφάλαιο 12 του βιβλίου: Dan Gusfield, Algorithms on Strings, Trees and Sequences, Cambridge University.
1 2 Dimensional Parameterized Matching Carmit Hazay Moshe Lewenstein Dekel Tsur.
1 The Accelerated Integer GCD Algorithm KENNETH WEBER Kent State University ACM Transactions on Mathematical Software 張圻毓.
Maths for Computer Graphics
Linear Transformations
CIS 101: Computer Programming and Problem Solving Lecture 6 Usman Roshan Department of Computer Science NJIT.
Lowest common ancestors. Write an Euler tour of the tree LCA(1,5) = 3 Shallowest node.
Introduction to Neural Networks John Paxton Montana State University Summer 2003.
Lecture 15 Recursive and Iterative Formula for Determinants Shang-Hua Teng.
A More Efficient Algorithm for Lattice Basis Reduction C.P.SCHNORR Journal of algorithm 9,47-62(1988) 報告者 張圻毓.
Recursion. Idea: Some problems can be broken down into smaller versions of the same problem Example: n! 1*2*3*…*(n-1)*n n*factorial of (n-1)
Linear Learning Machines  Simplest case: the decision function is a hyperplane in input space.  The Perceptron Algorithm: Rosenblatt, 1956  An on-line.
LLL 演算法 張圻毓. Outline Algorithm Example Algorithm Input : Linearly independent column vector f 1 ……f n Z n Output : A reduced basis (b 1 ……b n ) of the.
6 1 Linear Transformations. 6 2 Hopfield Network Questions.
ECE Synthesis & Verification 1 ECE 667 ECE 667 Synthesis and Verification of Digital Systems Exact Two-level Minimization Quine-McCluskey Procedure.
Subspaces, Basis, Dimension, Rank
Improvements on the accelerated integer GCD algorithm Mohamed S. Sedjelmaci, Christian Lavault Information Processing Letters 61(1997) Speaker: 張圻毓.
Recursion. Sum a list of numbers Iterative def sum(L): total = 0 for i in L: total += i return total Recursive def sum(L): if len(L) == 0: return 0 else:
Fibonacci numbers Fibonacci numbers:Fibonacci numbers 0, 1, 1, 2, 3, 5, 8, 13, 21, 34,... where each number is the sum of the preceding two. Recursive.
Face Recognition Using Neural Networks Presented By: Hadis Mohseni Leila Taghavi Atefeh Mirsafian.
Quantum Algorithms for Neural Networks Daniel Shumow.
1 Object-Oriented Programming Using C++ CLASS 2. 2 Linear Recursion Summing the Elements of an Array Recursively Algorithm LinearSum(A, n): Input: An.
6 1 Linear Transformations. 6 2 Hopfield Network Questions The network output is repeatedly multiplied by the weight matrix W. What is the effect of this.
computer
The Use of Linear Systems in Economics: The Use of Linear Systems in Economics: Math 214 Presentation Jenn Pope and Reni Paunova Professor Buckmire Leontief.
 6.2 Pivoting Strategies 1/17 Chapter 6 Direct Methods for Solving Linear Systems -- Pivoting Strategies Example: Solve the linear system using 4-digit.
Weikang Qian. Outline Intersection Pattern and the Problem Motivation Solution 2.
Chapter 5 – Functions II Outline Recursion Examples Using Recursion: The Fibonacci Series.
Discrete Mathematics 1 Kemal Akkaya DISCRETE MATHEMATICS Lecture 16 Dr. Kemal Akkaya Department of Computer Science.
K2 Algorithm Presentation KDD Lab, CIS Department, KSU
Solve a system of linear equations By reducing a matrix Pamela Leutwyler.
Introduction to Bioinformatics Algorithms Divide & Conquer Algorithms.
KEY THEOREMS KEY IDEASKEY ALGORITHMS LINKED TO EXAMPLES next.
Forrelation: A Problem that Optimally Separates Quantum from Classical Computing.
1.7 Linear Independence. in R n is said to be linearly independent if has only the trivial solution. in R n is said to be linearly dependent if there.
Intelligent Numerical Computation1 Center:Width:.
Lesson 7 Controllability & Observability Linear system 1. Analysis.
Quiz 7 The way I expected it.. How to do it! 1. Let P(n) be the statement that n 2 = n(n + 1)(2n + 1)/6 for the positive integer n. Be.
Section 2.1 Determinants by Cofactor Expansion. THE DETERMINANT Recall from algebra, that the function f (x) = x 2 is a function from the real numbers.
4 Vector Spaces 4.1 Vector Spaces and Subspaces 4.2 Null Spaces, Column Spaces, and Linear Transformations 4.3 Linearly Independent Sets; Bases 4.4 Coordinate.
= the matrix for T relative to the standard basis is a basis for R 2. B is the matrix for T relative to To find B, complete:
Nonlinear Dimension Reduction: Semi-Definite Embedding vs. Local Linear Embedding Li Zhang and Lin Liao.
Reduced echelon form Matrix equations Null space Range Determinant Invertibility Similar matrices Eigenvalues Eigenvectors Diagonabilty Power.
基 督 再 來 (一). 經文: 1 你們心裡不要憂愁;你們信神,也當信我。 2 在我父的家裡有許多住處;若是沒有,我就早 已告訴你們了。我去原是為你們預備地去 。 3 我 若去為你們預備了地方,就必再來接你們到我那 裡去,我在 那裡,叫你們也在那裡, ] ( 約 14 : 1-3)
Digital Signal Processing Lecture 3 LTI System
$200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200.
Презентацию подготовила Хайруллина Ч.А. Муслюмовская гимназия Подготовка к части С ЕГЭ.
1 Numerical Methods Solution of Systems of Linear Equations.
Basic Algorithms Christina Gallner
Chapter 7 Network Flow Slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved.
Linear Transformations
CHAPTER 1 Introduction.
State Space Analysis and Controller Design
ROTATION ROTATION ROTATION ROTATION ROTATION Pamela Leutwyler.
Online Learning Kernels
Слайд-дәріс Қарағанды мемлекеттік техникалық университеті
.. -"""--..J '. / /I/I =---=-- -, _ --, _ = :;:.
Function Notation “f of x” Input = x Output = f(x) = y.
II //II // \ Others Q.
I1I1 a 1·1,.,.,,I.,,I · I 1··n I J,-·
CS148 Introduction to Programming II
. '. '. I;.,, - - "!' - -·-·,Ii '.....,,......, -,
Presentation transcript:

Algorithm of Basis reduction 張圻毓

Outline Algorithm Example

Algorithm Input : Linearly independent column vector f 1 ……f n Z n Output : A reduced basis (g 1 ……g n ) of the lattice L=Σ 1 ≦ i ≦ n Zf i Z n

Algorithm 1. for i =1,…,n do g i  f i compute the GSO G*,M Q n*n, i  2 2.while i ≦ n do 3. for j= i-1,i-2,…,1 do 4. g i  g i - 「 μ ij 」 g j update the GSO {replacement step}

Algorithm 5. if i>1 and then exchange g i-1 and g i and update the GSO, i  i-1 else i  i+1 6. return g 1,…,g n

Example