Multi-Approximate-Keyword Routing Query
|
|
- Simon Douglas
- 6 years ago
- Views:
Transcription
1 Bin Yao 1, Mingwang Tang 2, Feifei Li 2 1 Department of Computer Science and Engineering Shanghai Jiao Tong University, P. R. China 2 School of Computing University of Utah, USA
2 Outline 1 Introduction and Motivation 2 Preliminary 3 Exact solutions 4 Approximate solutions 5 Experiments 6 Related Work and Concluding Remarks
3 Introduction and motivation Approximate keyword search is important: GIS data has errors and uncertainty with it. GIS data is keeping evolving, routinely data cleaning and data integration is expensive People may make mistakes in query input (typos)
4 Introduction and motivation Approximate keyword search is important: GIS data has errors and uncertainty with it. GIS data is keeping evolving, routinely data cleaning and data integration is expensive People may make mistakes in query input (typos) Shortest path search has many applications: map service. strategic planning of resources
5 Introduction and motivation Approximate keyword search is important: GIS data has errors and uncertainty with it. GIS data is keeping evolving, routinely data cleaning and data integration is expensive People may make mistakes in query input (typos) Shortest path search has many applications: map service. strategic planning of resources Our work: Multi-Approximate-Keyword Routing (MAKR) query. A combination of shortest path search and approximate keyword search Given a source and destination pair (s, t) and a query keyword set ψ on a road network, the goal is to find the shortest path that passes through at least one matching object per keyword.
6 Multi-Approximate-Keyword Routing (MAKR) query v 1 p 1 : gym p 4 : Moe s Club p 2 : Bob s market p 3 : theate v 2 s p 5 : Museum p 6 : Spielburg t p 9 : theater v 3 v 4 p 7 : theatre p 8 : grocery v 8 v 7 Vertex Point Edge p 10 : Spielberg v 5 v 6
7 Multi-Approximate-Keyword Routing (MAKR) query v 1 p 1 : gym p 4 : Moe s Club p 2 : Bob s market p 3 : theate v 2 s p 5 : Museum p 6 : Spielburg t p 9 : theater v 3 v 4 p 7 : theatre p 8 : grocery v 8 Approximate string similarity: edit distance ɛ(δ 1, δ 2 ) = τ. v 7 Vertex Point Edge p 10 : Spielberg v 5 v 6
8 Multi-Approximate-Keyword Routing (MAKR) query v 1 p 1 : gym p 4 : Moe s Club p 2 : Bob s market p 3 : theate v 2 s p 5 : Museum p 6 : Spielburg t p 9 : theater v 3 v 4 p 7 : theatre p 8 : grocery v 8 v 7 Vertex Point Edge p 10 : Spielberg v 5 v 6 Example: s, t, ψ = {(δ 1 = theater, τ 1 = 2), (δ 2 = Spielberg, τ 2 = 1)}.
9 Multi-Approximate-Keyword Routing (MAKR) query v 1 p 1 : gym p 4 : Moe s Club p 2 : Bob s market p 3 : theate v 2 s p 5 : Museum p 6 : Spielburg t p 9 : theater Vertex Point Edge p 10 : Spielberg v 5 v 6 v 3 v 4 p 7 : theatre p 8 : grocery ɛ(δ 1, p 7.δ) = 2 ɛ(δ 2, p 10.δ) = 0 Example: s, t, ψ = {(δ 1 = theater, τ 1 = 2), (δ 2 = Spielberg, τ 2 = 1)}. v 8 c 1 v 7
10 Multi-Approximate-Keyword Routing (MAKR) query v 1 p 1 : gym p 4 : Moe s Club p 2 : Bob s market p 3 : theate v 2 s p 5 : Museum p 6 : Spielburg t c 2 p 9 : theater Vertex Point Edge p 10 : Spielberg v 5 v 6 v 3 v 4 p 7 : theatre p 8 : grocery ɛ(δ 1, p 9.δ) = 0 ɛ(δ 2, p 6.δ) = 1 Example: s, t, ψ = {(δ 1 = theater, τ 1 = 2), (δ 2 = Spielberg, τ 2 = 1)}. path length: d(c 2 ) < d(c 1 ) v 8 v 7
11 Multi-Approximate-Keyword Routing (MAKR) query v 1 p 1 : gym p 2 : Bob s market v 2 p 4 : Moe s Club c: candidate path p 3 : theate s p 5 : Museum p 6 : Spielburg t p 9 : theater v 3 v 4 p 7 : theatre p 8 : grocery v 8 v 7 Vertex Point Edge p 10 : Spielberg v 5 v 6 Example: s, t, ψ = {(δ 1 = theater, τ 1 = 2), (δ 2 = Spielberg, τ 2 = 1)}. ψ(c) = {δ 1 = theater}
12 Multi-Approximate-Keyword Routing (MAKR) query v 1 p 1 : gym p 2 : Bob s market v 2 p 4 : Moe s Club c: candidate path p 3 : theate s p 5 : Museum p 6 : Spielburg t p 9 : theater v 3 v 4 p 7 : theatre p 8 : grocery v 8 v 7 Vertex Point Edge p 10 : Spielberg v 5 v 6 Example: s, t, ψ = {(δ 1 = theater, τ 1 = 2), (δ 2 = Spielberg, τ 2 = 1)}. ψ(c) = {δ 1 = theater} ψ = κ, when ψ(c) = ψ, c becomes a qualified path
13 Outline 1 Introduction and Motivation 2 Preliminary 3 Exact solutions 4 Approximate solutions 5 Experiments 6 Related Work and Concluding Remarks
14 Data structure: Disk-based storage of the road network v 1 p 1 gym p 2 Bob s market p 3 theate v 2 v 8 v 7 v 5 v 6 v 3 v 4 d(v 1, v 2 ) = 6 d(v 1, v 8 ) = 8 d(v 1, p 1 ) = 1 d(v 1, p 2 ) = 3 d(v 1, p 3 ) = 5 v i : network vertex.
15 Data structure: Disk-based storage of the road network v 1 p 1 gym p 2 Bob s market p 3 theate v 2 v 8 v 7 v 5 v 6 v 3 v 4 d(v 1, v 2 ) = 6 d(v 1, v 8 ) = 8 d(v 1, p 1 ) = 1 d(v 1, p 2 ) = 3 d(v 1, p 3 ) = 5 Adjacency list B+-tree Adjacency list file v 1, Rdist 1, 2 v 2 6 v 8 8 v 2, Rdist 2, 3 v 1 6 v v 5. v i : network vertex. RDIST i : distances to the landmarks.
16 Data structure: Disk-based storage of the road network v 1 p 1 gym p 2 Bob s market p 3 theate v 2 v 8 v 7 v 5 v 6 v 3 v 4 d(v 1, v 2 ) = 6 d(v 1, v 8 ) = 8 d(v 1, p 1 ) = 1 d(v 1, p 2 ) = 3 d(v 1, p 3 ) = 5 Adjacency list B+-tree Adjacency list file v 1, Rdist 1, 2 v 2 6 v 8 8 v 2, Rdist 2, 3 v 1 6 v 3 2 v 5. v i : network vertex. RDIST i : distances to the landmarks. Points file (v 1, v 2), gym 2 3 Bob s market 3 5 theate (v 1, v 8), Moe s Club Museum Points file B+-tree [sl97]: CCAM: A connectivity-clustered access method for networks and network computations. In IEEE TKDE, 1997.
17 Data structure: Disk-based storage of the road network v 1 p 1 gym p 2 Bob s market p 3 theate v 2 v 8 v 7 v 5 v 6 v 3 v 4 d(v 1, v 2 ) = 6 d(v 1, v 8 ) = 8 d(v 1, p 1 ) = 1 d(v 1, p 2 ) = 3 d(v 1, p 3 ) = 5 Adjacency list B+-tree Adjacency list file v 1, Rdist 1, 2 v 2 6 v 8 8 v 2, Rdist 2, 3 v 1 6 v 3 2 v 5. v i : network vertex. RDIST i : distances to the landmarks. Points file (v 1, v 2), gym 2 3 Bob s market 3 5 theate (v 1, v 8), Moe s Club Museum Points file B+-tree [sl97]: CCAM: A connectivity-clustered access method for networks and network computations. In IEEE TKDE, [gh05]: Computing the shortest path: A search meets graph theory. In SODA, 2005.
18 Data structure: FilterTree for Approximate Keywords-Matching 1 aa jo root 3 2 n zz Length filter Prefix filter Position filter An inverted list (point ids whose associated strings have length of 3 and the gram jo at position 2) [lll08]: Efficient merging and filtering algorithms for approximate string searches. In ICDE, 2008.
19 Outline 1 Introduction and Motivation 2 Preliminary 3 Exact solutions 4 Approximate solutions 5 Experiments 6 Related Work and Concluding Remarks
20 Exact solution overview Intuition: PER Path Expansion and Refinement.
21 Exact solution overview Intuition: PER Path Expansion and Refinement. Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each keyword w ψ ψ(c), add a point p from P(w) into current shortest candidate path, s.t. p P(w), ɛ(p.δ, w) τ w, to minimize the impact to d(c)
22 Exact solution overview Intuition: PER Path Expansion and Refinement. Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each keyword w ψ ψ(c), add a point p from P(w) into current shortest candidate path, s.t. p P(w), ɛ(p.δ, w) τ w, to minimize the impact to d(c) L p 2 : ch {s, p 1, t} p 1 : ee s t {s, p 3, t} p 3 : yb p 4 : zb {s, p 2, t} IO efficient priority queue of candidate paths: initialized with c s tha each covers a dinstinct, single w ψ
23 Exact solution overview Intuition: PER Path Expansion and Refinement. Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each keyword w ψ ψ(c), add a point p from P(w) into current shortest candidate path, s.t. p P(w), ɛ(p.δ, w) τ w, to minimize the impact to d(c) s p 1 : ee p 2 : ch t ψ(c) = {ef } p 3 : yb ψ ψ(c) = {ab, cd} p 4 : zb
24 Exact solution overview Intuition: PER Path Expansion and Refinement. Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each keyword w ψ ψ(c), add a point p from P(w) into current shortest candidate path, s.t. p P(w), ɛ(p.δ, w) τ w, to minimize the impact to d(c) s p 1 : ee p 2 : ch t insert sp 1 p 3 t to L ψ(c) = {ef } p 3 : yb ψ ψ(c) = {ab, cd} p 4 : zb
25 Exact solution overview Intuition: PER Path Expansion and Refinement. Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each keyword w ψ ψ(c), add a point p from P(w) into current shortest candidate path, s.t. p P(w), ɛ(p.δ, w) τ w, to minimize the impact to d(c) p 2 : ch insert sp 1 p 2 t to L p 1 : ee s t ψ(c) = {ef } p 3 : yb ψ ψ(c) = {ab, cd} p 4 : zb
26 Exact solution overview Improvement. use Landmarks to estimate distances when finding points; modify and then combine with FilterTree to find p P(w) incrementally; refine d(c) when c becomes a qualified path. two methods to refine d(c): PER-full and PER-partial
27 Outline 1 Introduction and Motivation 2 Preliminary 3 Exact solutions 4 Approximate solutions 5 Experiments 6 Related Work and Concluding Remarks
28 Approximate solutions for MAKR query Problem with the exact solution: Theorem 1: The MAKR problem is NP-hard.
29 Approximate solutions for MAKR query Problem with the exact solution: Theorem 1: The MAKR problem is NP-hard. Approximate solutions: The local minimum path algorithms: A LMP1 and A LMP2. The global minimum path algorithm: A GMP.
30 The local minimum distance algorithms: A LMP1 and A LMP2 Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} s t
31 The local minimum distance algorithms: A LMP1 and A LMP2 Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each segment (p i, p j ), find a point p, p.δ similar to keywords in ψ ψ(c), to minimize sum of d(p i, p) and d(p, p j ). s p 1 : ee t
32 The local minimum distance algorithms: A LMP1 and A LMP2 Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each segment (p i, p j ), find a point p, p.δ similar to keywords in ψ ψ(c), to minimize sum of d(p i, p) and d(p, p j ). s p 1 : ee t p 2 : ch
33 The local minimum distance algorithms: A LMP1 and A LMP2 Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each segment (p i, p j ), find a point p, p.δ similar to keywords in ψ ψ(c), to minimize sum of d(p i, p) and d(p, p j ). s p 1 : ee p 3 : yb t p 2 : ch
34 The local minimum distance algorithms: A LMP1 and A LMP2 Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} s t
35 The local minimum distance algorithms: A LMP1 and A LMP2 Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each keyword w ψ ψ(c), we iterate through the segments in c and add the point p P(w), which minimizes d(c), to one segment (p i, p j ) of c. p 1 : yb s t
36 The local minimum distance algorithms: A LMP1 and A LMP2 Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each keyword w ψ ψ(c), we iterate through the segments in c and add the point p P(w), which minimizes d(c), to one segment (p i, p j ) of c. p 1 : yb s t p 2 : ch
37 The local minimum distance algorithms: A LMP1 and A LMP2 Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each keyword w ψ ψ(c), we iterate through the segments in c and add the point p P(w), which minimizes d(c), to one segment (p i, p j ) of c. s p 3 : ee p 1 : yb t p 2 : ch
38 The minimum distance algorithm: A GMP Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} s t
39 The minimum distance algorithm: A GMP Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each keyword w ψ ψ(c), find a point p P(w) to minimize sum of d(s, p) and d(p, t). p 1 : yb s t
40 The minimum distance algorithm: A GMP Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} For each keyword w ψ ψ(c), find a point p P(w) to minimize sum of d(s, p) and d(p, t). p 1 : yb s p 3 : ch p 2 : ee t
41 The minimum distance algorithm: A GMP Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} p 1 : yb s p 3 : ch p 2 : ee t
42 The minimum distance algorithm: A GMP Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} p 1 : yb s p 3 : ch p 2 : ee t
43 The minimum distance algorithm: A GMP Q : s, t, ψ = {(ab, 1), (cd, 1), (ef, 1)} p 1 : yb s p 3 : ch p 2 : ee t Theorem 2: The A GMP algorithm gives a κ-approximate path. This bound is tight.
44 Challenges in approximate solutions Challenges in all approximate methods: how to find p P(w) incrementally for each type of objective function (instead of finding P(w) all at once and iterate through points in P(w) one by one)? how to avoid exact distance computation as much as possible?
45 Improvement on approximate solutions by network partitioning Voronoi-diagram-like partition (by Erwig and Hagen s algorithm). : Vetex
46 Improvement on approximate solutions by network partitioning Voronoi-diagram-like partition (by Erwig and Hagen s algorithm). : Vetex G 3 G 1 G 2
47 Improvement on approximate solutions by network partitioning Voronoi-diagram-like partition (by Erwig and Hagen s algorithm). : Vetex
48 Improvement on approximate solutions by network partitioning Voronoi-diagram-like partition (by Erwig and Hagen s algorithm). : Vetex
49 Improvement on approximate solutions by network partitioning Voronoi-diagram-like partition (by Erwig and Hagen s algorithm). : Vetex G 3 G 1 G 2
50 Improvement on approximate solutions by network partitioning Voronoi-diagram-like partition (by Erwig and Hagen s algorithm). : Vetex G 3 G 1 G 2 d (p, G i ): lower bound distance from p to the boundary of G i, computed using the landmarks. d (s, G i ) + d (G i, t) d (s, p) + d (p, t), p G i.
51 Extensions Top-k MAKR query: Exact methods. Approximate methods.
52 Extensions Top-k MAKR query: Exact methods. Approximate methods. Multiple strings.
53 Extensions Top-k MAKR query: Exact methods. Approximate methods. Multiple strings. Updates.
54 Outline 1 Introduction and Motivation 2 Preliminary 3 Exact solutions 4 Approximate solutions 5 Experiments 6 Related Work and Concluding Remarks
55 Experiment setup All experiments were executed on a Linux machine with an Intel Xeon CPU at 2.13GHz and 6GB of memory.
56 Experiment setup All experiments were executed on a Linux machine with an Intel Xeon CPU at 2.13GHz and 6GB of memory. Data sets: road networks from the Digital Chart of the World Server: City of Oldenburg (OL,6105 vertices, 7029 edges) California(CA,21048 vertices, edges) North America (NA, vertices, edges) building locations in OL, CA and NA from the OpenStreetMap project.
57 Experiment setup All experiments were executed on a Linux machine with an Intel Xeon CPU at 2.13GHz and 6GB of memory. Data sets: road networks from the Digital Chart of the World Server: City of Oldenburg (OL,6105 vertices, 7029 edges) California(CA,21048 vertices, edges) North America (NA, vertices, edges) building locations in OL, CA and NA from the OpenStreetMap project. The default experimental parameters: Symbol Definition Default Value P number of points for exact solution 10, 000 P number of points for approximate solution 1, 000, 000 κ number of query strings 6 τ edit distance threshold 2 road network CA
58 Query time: Running Time (secs) PER partial PER full A GMP A LMP1 A LMP2 P = 10, κ
59 Query time: Running Time (secs) PER partial PER full A GMP A LMP1 A LMP2 P = 10, P
60 Query time: Running Time (secs) PER partial PER full A GMP A LMP1 A LMP2 P = 10, OL CA NA
61 Query time: 10 3 PER partial PER full Running Time (secs) A GMP A LMP1 A LMP2 P = 10, τ
62 Scalability of approximate solutions: 15 A GMP A LMP1 A LMP2 Running Time (secs) P = 1, 000, κ
63 Scalability of approximate solutions: Running Time (secs) 8 A GMP A LMP1 A LMP P = 1, 000, P : X10 6
64 Scalability of approximate solutions: 10 2 A GMP A LMP1 A LMP2 Running Time (secs) P = 1, 000, 000 OL CA NA
65 Scalability of approximate solutions: 15 A GMP A LMP1 A LMP2 Running Time (secs) P = 1, 000, τ
66 Approximation quality: r: Approximation Ratio 2.5 A GMP A LMP1 A LMP κ
67 Approximation quality: r: Approximation Ratio 2.5 A GMP A LMP1 A LMP P
68 Approximation quality: r: Approximation Ratio 2.2 A GMP A LMP1 A LMP OL CA NA
69 Approximation quality: r: Approximation Ratio 2.5 A GMP A LMP1 A LMP τ
70 Outline 1 Introduction and Motivation 2 Preliminary 3 Exact solutions 4 Approximate solutions 5 Experiments 6 Related Work and Concluding Remarks
71 Related work The optimal sequenced route (OSR) query [sks07]. : different keywords. [sks07]: The Optimal Sequenced Route Query. In VLDBJ, 2007.
72 Related work The optimal sequenced route (OSR) query [sks07]. Q = s, t, ( ) s t : different keywords. [sks07]: The Optimal Sequenced Route Query. In VLDBJ, 2007.
73 Related work The optimal sequenced route (OSR) query [sks07]. Q = s, t, ( ) s c t : different keywords. [sks07]: The Optimal Sequenced Route Query. In VLDBJ, 2007.
74 Related work The optimal sequenced route (OSR) query [sks07]. Exact keyword query and only handles the query keywords sequentially. Q = s, t, ( ) s c t : different keywords. [sks07]: The Optimal Sequenced Route Query. In VLDBJ, 2007.
75 Related work The optimal sequenced route (OSR) query [sks07]. Exact keyword query and only handles the query keywords sequentially. In MAKR queries, categories are dynamically decided only at the query time. Q = s, t, ( ) s c t : different keywords. [sks07]: The Optimal Sequenced Route Query. In VLDBJ, 2007.
76 The end Thank You Q and A
A Survey on Spatial-Keyword Search
A Survey on Spatial-Keyword Search (COMP 6311C Advanced Data Management) Nikolaos Armenatzoglou 06/03/2012 Outline Problem Definition and Motivation Query Types Query Processing Techniques Indices Algorithms
More informationUsing R for Iterative and Incremental Processing
Using R for Iterative and Incremental Processing Shivaram Venkataraman, Indrajit Roy, Alvin AuYoung, Robert Schreiber UC Berkeley and HP Labs UC BERKELEY Big Data, Complex Algorithms PageRank (Dominant
More informationParallel PIPS-SBB Multi-level parallelism for 2-stage SMIPS. Lluís-Miquel Munguia, Geoffrey M. Oxberry, Deepak Rajan, Yuji Shinano
Parallel PIPS-SBB Multi-level parallelism for 2-stage SMIPS Lluís-Miquel Munguia, Geoffrey M. Oxberry, Deepak Rajan, Yuji Shinano ... Our contribution PIPS-PSBB*: Multi-level parallelism for Stochastic
More informationMinimizing Clock Latency Range in Robust Clock Tree Synthesis
Minimizing Clock Latency Range in Robust Clock Tree Synthesis Wen-Hao Liu Yih-Lang Li Hui-Chi Chen You have to enlarge your font. Many pages are hard to view. I think the position of Page topic is too
More informationDifferential Analaysis of Block Ciphers SIMON and SPECK
1 / 36 Differential Analaysis of Block Ciphers SIMON and SPECK Alex Biryukov, Arnab Roy, Vesselin Velichkov 2 / 36 Outline Introduction Light-Weight Block Ciphers: SIMON and SPECK Differential Anlaysis
More informationEfficient Parallel Partition based Algorithms for Similarity Search and Join with Edit Distance Constraints
Efficient Partition based Algorithms for Similarity Search and Join with Edit Distance Constraints Yu Jiang,, Jiannan Wang, Guoliang Li, and Jianhua Feng Tsinghua University Similarity Search&Join Competition
More informationOne Optimized I/O Configuration per HPC Application
One Optimized I/O Configuration per HPC Application Leveraging I/O Configurability of Amazon EC2 Cloud Mingliang Liu, Jidong Zhai, Yan Zhai Tsinghua University Xiaosong Ma North Carolina State University
More informationImprovements to Core-Guided Binary Search for MaxSAT
Improvements to Core-Guided Binary Search for MaxSAT A.Morgado F.Heras J.Marques-Silva CASL/CSI, University College Dublin Dublin, Ireland SAT, June 2012 Outline Motivation Previous Algorithms - Overview
More informationTASM: Top-k Approximate Subtree Matching
TASM: Top-k Approximate Subtree Matching Nikolaus Augsten 1 Denilson Barbosa 2 Michael Böhlen 3 Themis Palpanas 4 1 Free University of Bozen-Bolzano, Italy augsten@inf.unibz.it 2 University of Alberta,
More informationCSE 4502/5717 Big Data Analytics Spring 2018; Homework 1 Solutions
CSE 502/5717 Big Data Analytics Spring 2018; Homework 1 Solutions 1. Consider the following algorithm: for i := 1 to α n log e n do Pick a random j [1, n]; If a[j] = a[j + 1] or a[j] = a[j 1] then output:
More informationDisconnecting Networks via Node Deletions
1 / 27 Disconnecting Networks via Node Deletions Exact Interdiction Models and Algorithms Siqian Shen 1 J. Cole Smith 2 R. Goli 2 1 IOE, University of Michigan 2 ISE, University of Florida 2012 INFORMS
More informationBehavioral Simulations in MapReduce
Behavioral Simulations in MapReduce Guozhang Wang, Marcos Vaz Salles, Benjamin Sowell, Xun Wang, Tuan Cao, Alan Demers, Johannes Gehrke, Walker White Cornell University 1 What are Behavioral Simulations?
More informationA Tight Lower Bound for Dynamic Membership in the External Memory Model
A Tight Lower Bound for Dynamic Membership in the External Memory Model Elad Verbin ITCS, Tsinghua University Qin Zhang Hong Kong University of Science & Technology April 2010 1-1 The computational model
More informationWRF performance tuning for the Intel Woodcrest Processor
WRF performance tuning for the Intel Woodcrest Processor A. Semenov, T. Kashevarova, P. Mankevich, D. Shkurko, K. Arturov, N. Panov Intel Corp., pr. ak. Lavrentieva 6/1, Novosibirsk, Russia, 630090 {alexander.l.semenov,tamara.p.kashevarova,pavel.v.mankevich,
More informationTime Dependent Contraction Hierarchies Basic Algorithmic Ideas
Time Dependent Contraction Hierarchies Basic Algorithmic Ideas arxiv:0804.3947v1 [cs.ds] 24 Apr 2008 Veit Batz, Robert Geisberger and Peter Sanders Universität Karlsruhe (TH), 76128 Karlsruhe, Germany
More informationEfficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks Ugur Demiryurek, Farnoush Banaei-Kashani, and Cyrus Shahabi University of Southern California Department of Computer Science Los Angeles,
More informationSpatial Database. Ahmad Alhilal, Dimitris Tsaras
Spatial Database Ahmad Alhilal, Dimitris Tsaras Content What is Spatial DB Modeling Spatial DB Spatial Queries The R-tree Range Query NN Query Aggregation Query RNN Query NN Queries with Validity Information
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationComparing whole genomes
BioNumerics Tutorial: Comparing whole genomes 1 Aim The Chromosome Comparison window in BioNumerics has been designed for large-scale comparison of sequences of unlimited length. In this tutorial you will
More informationCS 253: Algorithms. Chapter 24. Shortest Paths. Credit: Dr. George Bebis
CS : Algorithms Chapter 4 Shortest Paths Credit: Dr. George Bebis Shortest Path Problems How can we find the shortest route between two points on a road map? Model the problem as a graph problem: Road
More informationQUALITY AND EFFICIENCY IN KERNEL DENSITY ESTIMATES FOR LARGE DATA
QUALITY AND EFFICIENCY IN KERNEL DENSITY ESTIMATES FOR LARGE DATA Yan Zheng Jeffrey Jestes Jeff M. Philips Feifei Li University of Utah Salt Lake City Sigmod 2014 Snowbird Kernel Density Estimates Let
More informationExperience in Factoring Large Integers Using Quadratic Sieve
Experience in Factoring Large Integers Using Quadratic Sieve D. J. Guan Department of Computer Science, National Sun Yat-Sen University, Kaohsiung, Taiwan 80424 guan@cse.nsysu.edu.tw April 19, 2005 Abstract
More informationProgressive & Algorithms & Systems
University of California Merced Lawrence Berkeley National Laboratory Progressive Computation for Data Exploration Progressive Computation Online Aggregation (OLA) in DB Query Result Estimate Result ε
More informationJ.I. Aliaga 1 M. Bollhöfer 2 A.F. Martín 1 E.S. Quintana-Ortí 1. March, 2009
Parallel Preconditioning of Linear Systems based on ILUPACK for Multithreaded Architectures J.I. Aliaga M. Bollhöfer 2 A.F. Martín E.S. Quintana-Ortí Deparment of Computer Science and Engineering, Univ.
More informationS0214 : GPU Based Stacking Sequence Generation For Composite Skins Using GA
S0214 : GPU Based Stacking Sequence Generation For Composite Skins Using GA Date: 16th May 2012 Wed, 3pm to 3.25pm(Adv. Session) Sathyanarayana K., Manish Banga, and Ravi Kumar G. V. V. Engineering Services,
More informationThe File Geodatabase API. Craig Gillgrass Lance Shipman
The File Geodatabase API Craig Gillgrass Lance Shipman Schedule Cell phones and pagers Please complete the session survey we take your feedback very seriously! Overview File Geodatabase API - Introduction
More informationParallel Transposition of Sparse Data Structures
Parallel Transposition of Sparse Data Structures Hao Wang, Weifeng Liu, Kaixi Hou, Wu-chun Feng Department of Computer Science, Virginia Tech Niels Bohr Institute, University of Copenhagen Scientific Computing
More informationCS533 Fall 2017 HW5 Solutions. CS533 Information Retrieval Fall HW5 Solutions
CS533 Information Retrieval Fall 2017 HW5 Solutions Q1 a) For λ = 1, we select documents based on similarity Thus, d 1> d 2> d 4> d 3 Start with d 1, S = {d1} R\S = { d 2, d 4, d 3} MMR(d 2) = 0.7 Maximum.
More informationAn Optimized Interestingness Hotspot Discovery Framework for Large Gridded Spatio-temporal Datasets
IEEE Big Data 2015 Big Data in Geosciences Workshop An Optimized Interestingness Hotspot Discovery Framework for Large Gridded Spatio-temporal Datasets Fatih Akdag and Christoph F. Eick Department of Computer
More informationOn Approximating Minimum 3-connected m-dominating Set Problem in Unit Disk Graph
1 On Approximating Minimum 3-connected m-dominating Set Problem in Unit Disk Graph Bei Liu, Wei Wang, Donghyun Kim, Senior Member, IEEE, Deying Li, Jingyi Wang, Alade O. Tokuta, Member, IEEE, Yaolin Jiang
More informationAdjoint-Based Uncertainty Quantification and Sensitivity Analysis for Reactor Depletion Calculations
Adjoint-Based Uncertainty Quantification and Sensitivity Analysis for Reactor Depletion Calculations Hayes F. Stripling 1 Marvin L. Adams 1 Mihai Anitescu 2 1 Department of Nuclear Engineering, Texas A&M
More informationChe-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University
Che-Wei Chang chewei@mail.cgu.edu.tw Department of Computer Science and Information Engineering, Chang Gung University } 2017/11/15 Midterm } 2017/11/22 Final Project Announcement 2 1. Introduction 2.
More informationMultiple-Site Distributed Spatial Query Optimization using Spatial Semijoins
11 Multiple-Site Distributed Spatial Query Optimization using Spatial Semijoins Wendy OSBORN a, 1 and Saad ZAAMOUT a a Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge,
More informationVisualizing Big Data on Maps: Emerging Tools and Techniques. Ilir Bejleri, Sanjay Ranka
Visualizing Big Data on Maps: Emerging Tools and Techniques Ilir Bejleri, Sanjay Ranka Topics Web GIS Visualization Big Data GIS Performance Maps in Data Visualization Platforms Next: Web GIS Visualization
More informationScalable Processing of Snapshot and Continuous Nearest-Neighbor Queries over One-Dimensional Uncertain Data
VLDB Journal manuscript No. (will be inserted by the editor) Scalable Processing of Snapshot and Continuous Nearest-Neighbor Queries over One-Dimensional Uncertain Data Jinchuan Chen Reynold Cheng Mohamed
More informationCS3719 Theory of Computation and Algorithms
CS3719 Theory of Computation and Algorithms Any mechanically (automatically) discretely computation of problem solving contains at least three components: - problem description - computational tool - analysis
More informationUtility Maximizing Routing to Data Centers
0-0 Utility Maximizing Routing to Data Centers M. Sarwat, J. Shin and S. Kapoor (Presented by J. Shin) Sep 26, 2011 Sep 26, 2011 1 Outline 1. Problem Definition - Data Center Allocation 2. How to construct
More informationEnergy-efficient Mapping of Big Data Workflows under Deadline Constraints
Energy-efficient Mapping of Big Data Workflows under Deadline Constraints Presenter: Tong Shu Authors: Tong Shu and Prof. Chase Q. Wu Big Data Center Department of Computer Science New Jersey Institute
More informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CSE 5311 Lecture 21 Single-Source Shortest Paths Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 Single-Source
More informationDevelopment of a GIS Interface for WEPP Model Application to Great Lakes Forested Watersheds
Development of a GIS Interface for WEPP Model Application to Great Lakes Forested Watersheds J.R. Frankenberger 1, S. Dun 2, D.C. Flanagan 1, J.Q. Wu 2, W.J. Elliot 3 1 USDA-ARS, West Lafayette, IN 2 Washington
More informationLinear Referencing in Boulder County, CO. Getting Started
Linear Referencing in Boulder County, CO Getting Started 1 Authors Janie Pierre GIS Technician, Boulder County Road centerline and storm sewer geodatabases & maps John Mosher GIS Specialist, Boulder County
More informationManaging bathymetric data in a hydrographic survey company
Managing bathymetric data in a hydrographic survey company Overview Brief Introduction to MMT How MMT use GIS Why we need to manage bathy data The BIS Inputting Data to the BIS Using the BIS GIS Product
More informationCPU Scheduling. CPU Scheduler
CPU Scheduling These slides are created by Dr. Huang of George Mason University. Students registered in Dr. Huang s courses at GMU can make a single machine readable copy and print a single copy of each
More informationWolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig
Multimedia Databases Wolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 13 Indexes for Multimedia Data 13 Indexes for Multimedia
More informationCS 4407 Algorithms Lecture: Shortest Path Algorithms
CS 440 Algorithms Lecture: Shortest Path Algorithms Prof. Gregory Provan Department of Computer Science University College Cork 1 Outline Shortest Path Problem General Lemmas and Theorems. Algorithms Bellman-Ford
More informationCache-Oblivious Computations: Algorithms and Experimental Evaluation
Cache-Oblivious Computations: Algorithms and Experimental Evaluation Vijaya Ramachandran Department of Computer Sciences University of Texas at Austin Dissertation work of former PhD student Dr. Rezaul
More informationCS/IT OPERATING SYSTEMS
CS/IT 5 (CR) Total No. of Questions :09] [Total No. of Pages : 0 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 06 CS/IT OPERATING SYSTEMS. a) System Boot Answer Question No. Compulsory. Answer One Question
More informationINTRODUCTION TO GEOGRAPHIC INFORMATION SYSTEM By Reshma H. Patil
INTRODUCTION TO GEOGRAPHIC INFORMATION SYSTEM By Reshma H. Patil ABSTRACT:- The geographical information system (GIS) is Computer system for capturing, storing, querying analyzing, and displaying geospatial
More informationVoronoi Diagrams with a Transportation Network on the Euclidean Plane
Voronoi Diagrams with a Transportation Network on the Euclidean Plane Sang Won Bae Kyung-Yong Chwa Division of Computer Science, Department of EECS, Korea Advanced Institute of Science and Technology,
More informationUnit 1A: Computational Complexity
Unit 1A: Computational Complexity Course contents: Computational complexity NP-completeness Algorithmic Paradigms Readings Chapters 3, 4, and 5 Unit 1A 1 O: Upper Bounding Function Def: f(n)= O(g(n)) if
More informationArcGIS GeoAnalytics Server: An Introduction. Sarah Ambrose and Ravi Narayanan
ArcGIS GeoAnalytics Server: An Introduction Sarah Ambrose and Ravi Narayanan Overview Introduction Demos Analysis Concepts using GeoAnalytics Server GeoAnalytics Data Sources GeoAnalytics Server Administration
More informationSpatial Decision Tree: A Novel Approach to Land-Cover Classification
Spatial Decision Tree: A Novel Approach to Land-Cover Classification Zhe Jiang 1, Shashi Shekhar 1, Xun Zhou 1, Joseph Knight 2, Jennifer Corcoran 2 1 Department of Computer Science & Engineering 2 Department
More informationAn Integrated Column Generation and Lagrangian Relaxation for Flowshop Scheduling Problems
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 An Integrated Column Generation and Lagrangian Relaxation for Flowshop Scheduling
More informationParallelization of the Molecular Orbital Program MOS-F
Parallelization of the Molecular Orbital Program MOS-F Akira Asato, Satoshi Onodera, Yoshie Inada, Elena Akhmatskaya, Ross Nobes, Azuma Matsuura, Atsuya Takahashi November 2003 Fujitsu Laboratories of
More informationBlock Iterative Eigensolvers for Sequences of Dense Correlated Eigenvalue Problems
Mitglied der Helmholtz-Gemeinschaft Block Iterative Eigensolvers for Sequences of Dense Correlated Eigenvalue Problems Birkbeck University, London, June the 29th 2012 Edoardo Di Napoli Motivation and Goals
More informationIntroduction to Computer Science
Introduction to Computer Science CSCI 109 China Tianhe-2 Andrew Goodney Fall 2017 Lecture 11: Abstract Machines and Theory Nov. 13th, 2017 Schedule 1 Abstract machines and theory uwhat is theoretical computer
More informationCS6901: review of Theory of Computation and Algorithms
CS6901: review of Theory of Computation and Algorithms Any mechanically (automatically) discretely computation of problem solving contains at least three components: - problem description - computational
More informationAlgorithms for Calculating Statistical Properties on Moving Points
Algorithms for Calculating Statistical Properties on Moving Points Dissertation Proposal Sorelle Friedler Committee: David Mount (Chair), William Gasarch Samir Khuller, Amitabh Varshney January 14, 2009
More informationReorganized and Compact DFA for Efficient Regular Expression Matching
Reorganized and Compact DFA for Efficient Regular Expression Matching Kai Wang 1,2, Yaxuan Qi 1,2, Yibo Xue 2,3, Jun Li 2,3 1 Department of Automation, Tsinghua University, Beijing, China 2 Research Institute
More informationScalable 3D Spatial Queries for Analytical Pathology Imaging with MapReduce
Scalable 3D Spatial Queries for Analytical Pathology Imaging with MapReduce Yanhui Liang, Stony Brook University Hoang Vo, Stony Brook University Ablimit Aji, Hewlett Packard Labs Jun Kong, Emory University
More informationRevenue Maximization in a Cloud Federation
Revenue Maximization in a Cloud Federation Makhlouf Hadji and Djamal Zeghlache September 14th, 2015 IRT SystemX/ Telecom SudParis Makhlouf Hadji Outline of the presentation 01 Introduction 02 03 04 05
More informationAn Experimental Evaluation of Passage-Based Process Discovery
An Experimental Evaluation of Passage-Based Process Discovery H.M.W. Verbeek and W.M.P. van der Aalst Technische Universiteit Eindhoven Department of Mathematics and Computer Science P.O. Box 513, 5600
More informationLarge-Scale Behavioral Targeting
Large-Scale Behavioral Targeting Ye Chen, Dmitry Pavlov, John Canny ebay, Yandex, UC Berkeley (This work was conducted at Yahoo! Labs.) June 30, 2009 Chen et al. (KDD 09) Large-Scale Behavioral Targeting
More informationMultimedia Databases 1/29/ Indexes for Multimedia Data Indexes for Multimedia Data Indexes for Multimedia Data
1/29/2010 13 Indexes for Multimedia Data 13 Indexes for Multimedia Data 13.1 R-Trees Multimedia Databases Wolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig
More informationSP-CNN: A Scalable and Programmable CNN-based Accelerator. Dilan Manatunga Dr. Hyesoon Kim Dr. Saibal Mukhopadhyay
SP-CNN: A Scalable and Programmable CNN-based Accelerator Dilan Manatunga Dr. Hyesoon Kim Dr. Saibal Mukhopadhyay Motivation Power is a first-order design constraint, especially for embedded devices. Certain
More informationCPU SCHEDULING RONG ZHENG
CPU SCHEDULING RONG ZHENG OVERVIEW Why scheduling? Non-preemptive vs Preemptive policies FCFS, SJF, Round robin, multilevel queues with feedback, guaranteed scheduling 2 SHORT-TERM, MID-TERM, LONG- TERM
More informationTheoretical aspects of ERa, the fastest practical suffix tree construction algorithm
Theoretical aspects of ERa, the fastest practical suffix tree construction algorithm Matevž Jekovec University of Ljubljana Faculty of Computer and Information Science Oct 10, 2013 Text indexing problem
More informationIntelligent GIS: Automatic generation of qualitative spatial information
Intelligent GIS: Automatic generation of qualitative spatial information Jimmy A. Lee 1 and Jane Brennan 1 1 University of Technology, Sydney, FIT, P.O. Box 123, Broadway NSW 2007, Australia janeb@it.uts.edu.au
More informationExample: Fib(N) = Fib(N-1) + Fib(N-2), Fib(1) = 0, Fib(2) = 1
Algorithm Analysis Readings: Chapter 1.6-1.7. How can we determine if we have an efficient algorithm? Criteria: Does it meet specification/work correctly? Is it understandable/maintainable/simple? How
More informationLaserMOD Tutorial EE232 Erwin K. Lau 9/26/2006 Integrated Photonics Laboratory, UC Berkeley
LaserMOD Tutorial EE232 Erwin K. Lau 9/26/2006 Erwin Lau 1 Outline Introduction to LaserMOD Walk-through of basic laser structure simulation Notes to look out for when using the program Simulation verification
More informationCSE 591 Foundations of Algorithms Homework 4 Sample Solution Outlines. Problem 1
CSE 591 Foundations of Algorithms Homework 4 Sample Solution Outlines Problem 1 (a) Consider the situation in the figure, every edge has the same weight and V = n = 2k + 2. Easy to check, every simple
More information6.830 Lecture 11. Recap 10/15/2018
6.830 Lecture 11 Recap 10/15/2018 Celebration of Knowledge 1.5h No phones, No laptops Bring your Student-ID The 5 things allowed on your desk Calculator allowed 4 pages (2 pages double sided) of your liking
More informationEnvironment (Parallelizing Query Optimization)
Advanced d Query Optimization i i Techniques in a Parallel Computing Environment (Parallelizing Query Optimization) Wook-Shin Han*, Wooseong Kwak, Jinsoo Lee Guy M. Lohman, Volker Markl Kyungpook National
More informationAdvances in processor, memory, and communication technologies
Discrete and continuous min-energy schedules for variable voltage processors Minming Li, Andrew C. Yao, and Frances F. Yao Department of Computer Sciences and Technology and Center for Advanced Study,
More informationRoad Ahead: Linear Referencing and UPDM
Road Ahead: Linear Referencing and UPDM Esri European Petroleum GIS Conference November 7, 2014 Congress Centre, London Your Work Making a Difference ArcGIS Is Evolving Your GIS Is Becoming Part of an
More informationProgressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes
Progressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes Li Chen ( 陈立 ), PhD, MIEEE Associate Professor, School of Information Science and Technology Sun Yat-sen University, China Joint work
More informationWeather Research and Forecasting (WRF) Performance Benchmark and Profiling. July 2012
Weather Research and Forecasting (WRF) Performance Benchmark and Profiling July 2012 Note The following research was performed under the HPC Advisory Council activities Participating vendors: Intel, Dell,
More informationA CPU-GPU Hybrid Implementation and Model-Driven Scheduling of the Fast Multipole Method
A CPU-GPU Hybrid Implementation and Model-Driven Scheduling of the Fast Multipole Method Jee Choi 1, Aparna Chandramowlishwaran 3, Kamesh Madduri 4, and Richard Vuduc 2 1 ECE, Georgia Tech 2 CSE, Georgia
More informationOECD QSAR Toolbox v.4.1. Tutorial illustrating new options for grouping with metabolism
OECD QSAR Toolbox v.4.1 Tutorial illustrating new options for grouping with metabolism Outlook Background Objectives Specific Aims The exercise Workflow 2 Background Grouping with metabolism is a procedure
More informationReal-Time Workload Models with Efficient Analysis
Real-Time Workload Models with Efficient Analysis Advanced Course, 3 Lectures, September 2014 Martin Stigge Uppsala University, Sweden Fahrplan 1 DRT Tasks in the Model Hierarchy Liu and Layland and Sporadic
More informationQuery Processing in Spatial Network Databases
Temporal and Spatial Data Management Fall 0 Query Processing in Spatial Network Databases SL06 Spatial network databases Shortest Path Incremental Euclidean Restriction Incremental Network Expansion Spatial
More informationSupplementary Technical Details and Results
Supplementary Technical Details and Results April 6, 2016 1 Introduction This document provides additional details to augment the paper Efficient Calibration Techniques for Large-scale Traffic Simulators.
More informationAlgorithms: Lecture 12. Chalmers University of Technology
Algorithms: Lecture 1 Chalmers University of Technology Today s Topics Shortest Paths Network Flow Algorithms Shortest Path in a Graph Shortest Path Problem Shortest path network. Directed graph G = (V,
More informationEf#icient Processing of Large Graphs via Input Reduction
Ef#icient Processing of Large Graphs via Input Reduction Amlan Kusum, Keval Vora, Rajiv Gupta, Iulian Neamtiu HPDC Kyoto, Japan 04 June, 0 Graph Processing Iterative graph algorithms Vertices are processed
More informationThe Green Index (TGI): A Metric for Evalua:ng Energy Efficiency in HPC Systems
The Green Index (TGI): A Metric for Evalua:ng Energy Efficiency in HPC Systems Wu Feng and Balaji Subramaniam Metrics for Energy Efficiency Energy- Delay Product (EDP) Used primarily in circuit design
More informationSpectral Clustering on Handwritten Digits Database
University of Maryland-College Park Advance Scientific Computing I,II Spectral Clustering on Handwritten Digits Database Author: Danielle Middlebrooks Dmiddle1@math.umd.edu Second year AMSC Student Advisor:
More informationIMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata
ICTAC 09 IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata Étienne ANDRÉ Laboratoire Spécification et Vérification LSV, ENS de Cachan & CNRS Étienne ANDRÉ (LSV) ICTAC 09
More informationStatistical Machine Translation. Part III: Search Problem. Complexity issues. DP beam-search: with single and multi-stacks
Statistical Machine Translation Marcello Federico FBK-irst Trento, Italy Galileo Galilei PhD School - University of Pisa Pisa, 7-19 May 008 Part III: Search Problem 1 Complexity issues A search: with single
More informationECS 120 Lesson 24 The Class N P, N P-complete Problems
ECS 120 Lesson 24 The Class N P, N P-complete Problems Oliver Kreylos Friday, May 25th, 2001 Last time, we defined the class P as the class of all problems that can be decided by deterministic Turing Machines
More informationSingle Source Shortest Paths
CMPS 00 Fall 015 Single Source Shortest Paths Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk 1 Paths in graphs Consider a digraph G = (V, E) with an edge-weight
More informationA practical introduction to active automata learning
A practical introduction to active automata learning Bernhard Steffen, Falk Howar, Maik Merten TU Dortmund SFM2011 Maik Merten, learning technology 1 Overview Motivation Introduction to active automata
More informationChaotic Motion of a Double Pendulum
Chaotic Motion of a Double Pendulum Matthew Beckler Lab Partners: Kevin Klutzke, Ryne Lehman, Mike Minehart December 7, 004 Introduction When studying systems of motion in the real world, a common catchphrase
More informationArticle An Improved Hybrid Method for Enhanced Road Feature Selection in Map Generalization
Article An Improved Hybrid Method for Enhanced Road Feature Selection in Map Generalization Jianchen Zhang 1,2,3, Yanhui Wang 1,2,3, *, and Wenji Zhao 1,2,3 1 College of Resources Environment and Tourism,
More informationCSE 380 Computer Operating Systems
CSE 380 Computer Operating Systems Instructor: Insup Lee & Dianna Xu University of Pennsylvania, Fall 2003 Lecture Note 3: CPU Scheduling 1 CPU SCHEDULING q How can OS schedule the allocation of CPU cycles
More informationEsri UC2013. Technical Workshop.
Esri International User Conference San Diego, California Technical Workshops July 9, 2013 CAD: Introduction to using CAD Data in ArcGIS Jeff Reinhart & Phil Sanchez Agenda Overview of ArcGIS CAD Support
More informationAlgorithms: COMP3121/3821/9101/9801
NEW SOUTH WALES Algorithms: COMP3121/3821/9101/9801 Aleks Ignjatović School of Computer Science and Engineering University of New South Wales TOPIC 4: THE GREEDY METHOD COMP3121/3821/9101/9801 1 / 23 The
More informationCOMP9334: Capacity Planning of Computer Systems and Networks
COMP9334: Capacity Planning of Computer Systems and Networks Week 2: Operational analysis Lecturer: Prof. Sanjay Jha NETWORKS RESEARCH GROUP, CSE, UNSW Operational analysis Operational: Collect performance
More informationECM at Work. Joppe W. Bos 1 and Thorsten Kleinjung 2. 1 Microsoft Research, Redmond, USA
ECM at Work Joppe W. Bos 1 and Thorsten Kleinjung 2 1 Microsoft Research, Redmond, USA 2 Laboratory for Cryptologic Algorithms, EPFL, Lausanne, Switzerland 1 / 18 Security assessment of public-key cryptography
More informationApplications of GIS in Electrical Power System. Dr. Baqer AL-Ramadan Abdulrahman Al-Sakkaf
Applications of GIS in Electrical Power System Dr. Baqer AL-Ramadan Abdulrahman Al-Sakkaf OUTLINES: Objective Importance of GIS GIS data development Application of GIS Findings Conclusions and Recommendations
More information