A light-based device for solving the Hamiltonian path problem Mihai Oltean Babes-Bolyai University, Cluj-Napoca, Romania

Slides:



Advertisements
Similar presentations
Data Structures Through C
Advertisements

1 UNIT I (Contd..) High-Speed LANs. 2 Introduction Fast Ethernet and Gigabit Ethernet Fast Ethernet and Gigabit Ethernet Fibre Channel Fibre Channel High-speed.
Dynamic Programming 25-Mar-17.
Algorithm Design Techniques
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
Fraction IX Least Common Multiple Least Common Denominator
Factors, Primes & Composite Numbers
Analysis of Algorithms
Measurements and Their Uncertainty 3.1
Introduction to Algorithms 6.046J/18.401J/SMA5503
Measurements and Their Uncertainty 3.1
Fast optimal instruction scheduling for single-issue processors with arbitrary latencies Peter van Beek, University of Waterloo Kent Wilken, University.
The National Certificate in Adult Numeracy
Reductions Complexity ©D.Moshkovitz.
Chapter 7 Sampling and Sampling Distributions
Evaluating Window Joins over Unbounded Streams Author: Jaewoo Kang, Jeffrey F. Naughton, Stratis D. Viglas University of Wisconsin-Madison CS Dept. Presenter:
HOW TO COMPARE FRACTIONS
1 Outline relationship among topics secrets LP with upper bounds by Simplex method basic feasible solution (BFS) by Simplex method for bounded variables.
(Data and Signals - cont)
PERFORMANCE One important issue in networking is the performance of the networkhow good is it? We discuss quality of service, an overall measurement.
Stationary Time Series
Chapter 4: Informed Heuristic Search
SCSI Concepts and Configuration. 2 SCSI Transmission Methods SCSI Buses and Termination SCSI Data Path Sizes and Bus Speed SCSI Cables, Connectors.
Hash Tables.
John Ogilvie High School - CfE Physics
MAT 205 F08 Chapter 12 Complex Numbers.
4.6 Perform Operations with Complex Numbers
14 Vectors in Three-dimensional Space Case Study
Fraction XI Adding Mixed Numbers With Unlike Denominators
Fraction IX Least Common Multiple Least Common Denominator
#1UNIT C Describes a material which allows light to pass through easily.
Artificial Intelligence
Vector Algebra One Mark Questions PREPARED BY:
18-Dec-14 Pruning. 2 Exponential growth How many leaves are there in a complete binary tree of depth N? This is easy to demonstrate: Count “going left”
Chapter 11 Limitations of Algorithm Power Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Mani Srivastava UCLA - EE Department Room: 6731-H Boelter Hall Tel: WWW: Copyright 2003.
Using Lowest Common Denominator to add and subtract fractions
9. Two Functions of Two Random Variables
Limitation of Computation Power – P, NP, and NP-complete
1 State-Space representation and Production Systems Introduction: what is State-space representation? What are the important trade-offs? (E.Rich, Chapt.2)
Radio Waves and Signals Week 4. We imagine radio signals/waves travel as sine waves. The ripple of these waves are started by the vibration of an electron.
Traveling Salesperson Problem
Lecture 24 Coping with NPC and Unsolvable problems. When a problem is unsolvable, that's generally very bad news: it means there is no general algorithm.
Reducibility Class of problems A can be reduced to the class of problems B Take any instance of problem A Show how you can construct an instance of problem.
Physics 6C De Broglie Wavelength Uncertainty Principle Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB.
Physics 6C De Broglie Wavelength Uncertainty Principle Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB.
© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 Graphs.
Analysis of Algorithms CS 477/677
Backtracking.
SARAN THAMPY D SARAN THAMPY D S7 CSE S7 CSE ROLL NO 17 ROLL NO 17 Optical computing.
Fiber Optic Transmission
Algorithms  Al-Khwarizmi, arab mathematician, 8 th century  Wrote a book: al-kitab… from which the word Algebra comes  Oldest algorithm: Euclidian algorithm.
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
1 Lower Bounds Lower bound: an estimate on a minimum amount of work needed to solve a given problem Examples: b number of comparisons needed to find the.
Christopher Moh 2005 Competition Programming Analyzing and Solving problems.
Fiber Optic Transmission SL/HL – Option C.3. Reflection/Refraction Reflection – A wave encounters a boundary between two mediums and cannot pass through.
CSE373: Data Structures & Algorithms Lecture 22: The P vs. NP question, NP-Completeness Lauren Milne Summer 2015.
NP-COMPLETE PROBLEMS. Admin  Two more assignments…  No office hours on tomorrow.
Fiber Optic Transmission SL/HL – Option F Mr. Jean.
FIBER OPTIC TRANSMISSION
IB Physics Option F – Fibre Optics Mr. Jean. The plan: Video clip of the day Fibre Optics – C+-+Imaginghttps://ibphysics2016.wikispaces.com/Option+
1 P and NP. 2 Introduction The Traveling Salesperson problem and thousands of other problems are equally hard in the sense that if we had an efficient.
The NP class. NP-completeness Lecture2. The NP-class The NP class is a class that contains all the problems that can be decided by a Non-Deterministic.
Advanced Algorithms Analysis and Design
Objective of This Course
Computational Complexity
Chapter 11 Limitations of Algorithm Power
Backtracking and Branch-and-Bound
Algorithms CSCI 235, Spring 2019 Lecture 36 P vs
Presentation transcript:

A light-based device for solving the Hamiltonian path problem Mihai Oltean Babes-Bolyai University, Cluj-Napoca, Romania

Outline Related work Hamiltonian path problem The light-based device –Basic ideas –Marking / labelling system –Hardware implementation –Complexity –Drawbacks and possible solutions –Improving the device –Further work

Other light-based devices Lenslet –A very fast processor for vector-matrix multiplications. This processor can perform up to 8000 Giga Multiple- Accumulate instructions per second. Intel –Siliconized photonics. Rainbow sort –Sorts wavelengths based on physical concepts of refraction and dispersion.

Hamiltonian path HP = 0, 1, 2, 3, 4, 5, 6 We solve the YES / NO decision problem.

Useful properties of light The speed of light has a limit. The ray can be delayed by forcing it to pass through an optical fiber cable of a certain length. The ray can be easily divided into multiple rays of smaller intensity/power.

Basic ideas The device has a graph-like structure. In each node we have some cables which delay the rays and the nodes are connected by cables. Initially a light ray is sent to the start node. Two operations must be performed when a ray passes through a node : –The light ray is marked (labeled, delayed) uniquely so that we know that it has passed through that node. –The ray is divided and sent to the nodes connected to the current node. At the destination node we will search only for particular rays that have passed only once through each node.

Labelling system We need a way to mark a ray when it pass through a node. No other ray should be marked in the same way as the Hamiltonian one. WE MARK THE RAYS BY DELAYING THEM. –No other ray should arrive in the destination node in the same time with the ray which represents the Hamiltonian path !

Property of the delaying system d 1, d 2,..., d n the delays introduced by each node. A correct set of values for this system must satisfy the condition: d 1 + d d n a 1 * d 1 + a 2 * d a n * d n, where a k (1 k n) are natural numbers and cannot be all 1 in the same time. If a given value a k is strictly greater than 1 it means that the ray has passed at least twice through node 1.

Theoretical background for the labeling system 3-step process: 1.A backtracking procedure. We generate numbers such that the highest number in a system is the smallest possible. 2.Extracting the general formula. 3.Proving the correctness.

Backtracking procedure NLabels 11 22, 3 34, 6, 7 48, 12, 14, , 24, 28, 30, , 48, 56, 50, 62, 63 Complete graph – the most interesting for our purpose because any path / cycle is possible.

General formulas Node 1: Delay = 2 n -2 n-1, Node 2: Delay = 2 n -2 n-2, Node 3: Delay = 2 n -2 n-3,..., Node n: Delay = 2 n -2 0.

How the system works We work with continuous signal. At the destination there will be fluctuations when a ray that has passed through a particular path will arrive there.

Hardware implementation A source of light (laser), Several beam-splitters for dividing light rays into multiple subrays. A high speed photodiode for converting light rays into electrical power. The photodiode is placed in the destination node. A tool for detecting fluctuations in the intensity of electric power generated by the photodiode (oscilloscope). A set of optical fiber cables having certain lengths. Used for connecting nodes and for delaying the signals within nodes.

Complexity O(n) complexity – n is the number of nodes. The delay increases exponentially with the number of nodes ! –The length of the optical fibers, used for delaying the signals, increases exponentially with the number of nodes, The intensity of the signal decreases exponentially with the number of nodes that are traversed. Other paradigms for NP-complete problems: a DNA computer requires a mass equal to the Earth for solving a 200 cities problem.

Problem size Heavily depends on: –the response time of the photodiode. –the accuracy of the measurement tools (picoseconds). 33 nodes requires 1 second. –Cable length 3*10 8 meters ! Cables of 300 km can be used to solve up to 17 nodes. –Time = seconds.

Drawbacks (and possible solutions) Cannot compute the actual Hamiltonian path even in the case of YES answer. –No solution to that (yet). The intensity of the signal will decrease each time it is divided by the beam splitter. Exponential decrease in the intensity ! –Solution : use a photomultiplier which is able to amplify even from individual electrons. Finding the optimal delaying system for a particular graph. –might be NP-complete !

Improving the device Light is too fast ! We have to use too long cables to delay it. We have to reduce it because we dont have a too high precision oscilloscopes ! The speed of light traversing a cable is smaller (60%) than the speed of light in the void space. Lab experiments have reduced the speed of light by 7 orders of magnitude. By using that speed we can reduce the length of the cables by a similar order.

Technical challenges Cutting the optic fibers to an exact length with high precision. Finding a high precision oscilloscope and fast-response time photodiode. Finding cables long enough so that larger instances of the problem could be solve. –Use the internet cables (might be a problem with the correct length).

Further work Implementing the proposed hardware, Finding optimal labeling systems for particular graphs. This will reduce the length of the involved cables significantly, Finding other non-trivial problems which can be solved by using the proposed device, Finding other ways to introduce delays in the system. The current solution requires cables that are too long and too expensive,

More further work… Using other type of signals instead of light. A possible candidate would be electric power, Finding other ways to implement the system of marking the signals which pass through a particular node. The current one, based on delays, is too time consuming. –Changing other properties of light: wavelength.