EECS Divisional Presentation Computing, Algorithms and Applications

1
EECS Divisional PresentationComputing,
Algorithms and Applications

• May 25, 2006

2
Current CAA Faculty

• Primary Members
• Ming-Yang Kao theoretical computer science
• Jorge Nocedal continuous optimization
• Secondary Members
• Yan Chen networking and security
• Peter Scheuermann databases
• Hai Zhou CAD algorithms and formal methods
• Tertiary Members
• Alan Toflove computational  electrodynamics

3
A Framework to Understand CAA Research
Algorithms
Models of Computation
Externals (applications of computation to other
fields, and vice versa)
Complexity (resources used by computation)
4
Strategic BiddingJ. Nocedal and R. Waltz

• Your company sells electric power (internet
  resources, wireless bandwidth).
• You and other producers submit competitive bids
  to generate power.
• An Independent Operator purchases at a single
  spot price.
• Your strategic guidance
• submit low bids ? spot price
• submit high bids to drive up the spot price
• Demands, etc, uncertain

5
120 000
300
110 000
100 000
Powernext Day-Ahead daily volume and baseload
price
250
90 000
80 000
200
70 000
En /MWh
MWh
60 000
150
50 000
40 000
100
30 000
20 000
50
10 000
0
-

Independent operator solves an (easy)
optimization problem -- given the bids,
determines amount gj to buy from you.

Spot price is
Lagrange multiplier.
27/11/01
10/02/02
26/04/02
10/07/02
23/09/02
07/12/02
20/02/03
06/05/03
20/07/03
03/10/03
17/12/03
01/03/04
15/05/04
29/07/04
12/10/04
26/12/04
11/03/05
25/05/05
08/08/05
22/10/05
05/01/06
21/03/06
Daily volume
Baseload price
bj bid of company j cj gener cost
for company gj gener sold by plant j
6
Your problem (j1)
Optimization Problem!!

• Bi-level Optimization Problem
• What about bids from competitors? Use stochastic
  optimization.
• Very large and nonlinear problem
• Mathematically deficient --- need new theory

7
Northwestern Lab for Internet and Security
Technology (LIST)
Yan Chen High-performance Network
Anomaly/Intrusion Detection and Mitigation
(HPNAIDM) Systems

• Data streaming computation 10s Gigabit-link
  network traffic recording and analysis (with P.
  Dinda and G. Memik)
• Combinatorial statistics first online
  network-based polymorphic worm signature
  generation with provable attack resilience (with
  M. Kao)
• Formal verification vulnerability analysis of
  802.16 protocols using formal methods (with H.
  Zhou, J. Fu (Motorola) )
• Information theory network anomaly intrusion
  detection (with D. Guo)

8
The Spread of Sapphire/Slammer Worms
9
Northwestern Lab for Internet and Security
Technology (LIST)
Yan Chen Internet Measurement, Diagnosis
Inference

• Linear Algebra Scalable and deterministic
  network monitoring, diagnosis, and link-level
  properties (e.g., loss rate) inference
• Statistics Network router configuration (e.g.,
  QoS) inference (with F. Bustamante and G. Lu
  (Tsinghua))

ATT
CW
UUNet
Sprint
AOL
Qwest
Earthlink
10

• Applied Computational GeometryPeter Scheuermann

SENSOR RELOCATION
Critical Region R
Problem How to optimize the guidance of
mobile sensors which need to be brought
into a critical region, to ensure a
desired level of coverage for that
region?
Variants use convex hull of critical region 1.
fastest arrival time for the desired number of
sensors 2. largest number of sensors to ensure
desired quantity inside the region 3. optimal
time to ensure fair coverage under the
constraint that a minimum number of sensors
are inside the region
r
Publication Mission-Critical Management of
Mobile Sensors (or, How to Guide a Flock of
Sensors) in DMSN 2004
11
DYNAMIC TOPOLOGICAL PREDICATES FOR MOVING OBJECTS
F
Problem Notify me when an object is
continuously_moving_towards the landmark
LM, for more than 5 min., based on
periodic (location,time) updates
(primitive events)
A
LM
E
B
To Send or Not To Send? (have the previous
simple events been consumed)
C
D
To Send
Solution Use Voronoi diagram (for the LM) and
monitoring of only two consecutive updates -
Issue consumption of primitive events?
Send update!
Publication Dynamic Topological Predicates and
Notifications in Moving Object Databases
in MDM 2005
12
Optimal and Efficient Algorithms for Circuit
RetimingHai Zhou

• Retiming is an effective technique for circuit
  optimization by relocating registers without
  changing functionality
• We developed the most efficient algorithm for
  clock period minimization considering both long
  and short paths (in O(n2m) time)
• Our algorithm is correct no matter what order is
  used for selecting nodes

13
Gate Sizing for Coupling Noise Control as
Distributed OptimizationHai Zhou

• Our algorithm
• Each gate starts at lower bound
• Repeat
• Each signal with violation
• up-size its gate to the
• smallest with tolerable noise
• Correct no matter what order is taken
• Will converge to the optimal solution if there
  is one
• Very efficient practically
• May be used in wireless networks

• Noise on a signal is proportional to attacker
  gate sizes and inversely proportional to its own
  gate size
• Given the coupling relations and the noise upper
  bound for each signal
• Need to find minimal gate sizes such that all
  noises are under constraints

14
DNA Algorithmic Self-Assembly
15
DNA Algorithmic Self-Assembly
Program Tiles Lab Steps
Output
16
DNA Algorithmic Self-Assembly

• Input the description of a shape
• Output a set of tiles and a sequence of lab
  steps to produce the shape
• Computational Objectives
• minimize the of tile types
• minimize the range of temperatures
• minimize the of lab steps
• minimize errors

17
Sequencing Bio-molecules

• Input information about small pieces of a target
  molecule
• Output the character sequence of the target
  molecule
• Examples
• Peptide Sequencing linear structure (with a
  group at Harvard Medical School)
• Glycan Sequencing tree structure (with a group
  at Kyoto University)

18
Sequencing Bio-molecules

• Given a target bio-molecule B
• Steps
• Make many copies of B.
• Cut each copy of B into pieces.
• Sequence each piece (recursively).
• Assemble the character sequences of the pieces
  into the character sequence of B.

19
Protein Analysis HPLC-MS-MS
Proteins
Peptides
One Peptide
B-ions / Y-ions
Mass/Charge
Mass/Charge
Tandem Mass Spectrum
20
Synergies with Other Divisions
Signals Systems
Cognitive Systems Graphics Interactive Media
Musical Retrieval
Computational Economics Network Optimization DNA
Computing
CAA
Bioinformatics Computer Worm Detection Design
Optimization DNA Computing
Solid State Photonics
Computer Engineering Systems
Quantum Computing Cryptography
21
CAAs Mission To Understand the Nature, Power,
Limit of Computation and to Apply Such
Understanding to Benefit the Society.

• Basic Understanding about Computation
• Computation is an intellectual tool as powerful
  and universal as mathematics.
• Computation can be used not only to solve
  mathematical problems, but also to understand and
  design complex systems.
• Examples of Computation
• How many bits of information does a black hole
  compute?
• How do we make web search efficiently provide the
  information that we want?
• How do we create a biological computer that
  uses DNA/RNA-like materials to produce medicines?

22
The End

• Thank You!