Connected Placement of Disaster Shelters in Modern Cities
|
|
- Shannon Spencer
- 6 years ago
- Views:
Transcription
1 Connected Placement of Diater Shelter in Modern Citie Huanyang Zheng and Jie Wu Department of Computer and Information Science Temple Univerity, USA {huanyang.zheng, ABSTRACT Thi paper i motivated by the fact that modern citie are urpriingly vulnerable to large-cale emergencie, uch a the recent terrorit attack on Pari that reulted in the death of 130 people. Diater helter are one of the mot e ective method to handle large-cale emergencie. Hence, thi paper etablihe diater helter with bounded cot. The objective i to minimize the total etablihment cot of diater helter under three contraint. The firt contraint i a ditance contraint, which require that people mut be aigned to diater helter within a certain range. The econd contraint i a capacity contraint, which require that diater helter mut have the capacity to hold incoming people. The third contraint i a connection contraint, which require that diater helter hould be connected to avoid being iolated. Two bounded algorithm are propoed to e ciently etablih diater helter. Real data-driven experiment are conducted to demontrate the e ciency and e ectivene of the propoed algorithm. CCS Concept Network! Cyber-phyical network; Keyword Diater helter; mart city; connected placement; greedy algorithm; approximation ratio; 1. INTRODUCTION Recently, France ha witneed unprecedented attack on Pari that reulted in the death of 130 people [1]. While e ective policie are neceary to reolve thi crii, we are motivated by the fact that modern citie are vulnerable to large-cale emergencie, uch a terrorit attack and refugee crie. Meanwhile, diater helter are one of the mot effective method to handle large-cale emergencie. They are defenive building with food torage and medical facilitie. Permiion to make digital or hard copie of all or part of thi work for peronal or claroom ue i granted without fee provided that copie are not made or ditributed for profit or commercial advantage and that copie bear thi notice and the full citation on the firt page. Copyright for component of thi work owned by other than ACM mut be honored. Abtracting with credit i permitted. To copy otherwie, or republih, to pot on erver or to reditribute to lit, require prior pecific permiion and/or a fee. Requet permiion from permiion@acm.org. CHANTS 16, October 03-07, 2016, New York City, NY, USA c 2016 ACM. ISBN /16/10... $15.00 DOI: Figure 1: Scenario of the diater helter placement. Hawaii ha etablihed underground diater helter to protect people from hurricane [2]. While diater helter can e ectively ave live in emergencie, few reearch e ort were made. Etablihment cot of diater helter are currently unbounded in exiting literature [3]. In contrat, thi paper explore the bounded placement of diater helter to minimize their etablihment cot. Our cenario i hown in Fig. 1, which i a three-dimenional Euclidean urface repreenting the ground of the city. People are ditributed in the Euclidean urface (known a priori). Diater helter of di erent capacitie are etablihed with di erent etablihment cot. A large-capacity diater helter ha a higher cot than a mall-capacity one. The objective of thi paper i to minimize the total etablihment cot of diater helter under three contraint. The number, location, and capacitie of diater helter erve a variable that need to be determined. The firt contraint (ditance contraint) i that people mut be aigned to diater helter within a certain range. Otherwie, people may not have enough time to reach diater helter in large-cale emergencie. The econd contraint (capacity contraint) i that diater helter mut have the capacity to hold incoming people. A crowded diater helter can lead to epidemic preading, inu cient amount of food, and evacuation pace problem. The third contraint i that diater helter hould be connected to avoid iolation (connection contraint, formally defined later in the problem formulation). Thi contraint aim to maintain the communication between di erent diater helter, uch that earche and recue can be facilitated. For example, family member eparated in di erent diater helter can be found through thoe communication. Recue team can alo be upported by nearby diater helter. The remainder of thi paper i organized a follow. Section II urvey related work. Section III decribe the model and then formulate the problem. Section IV analyze the problem. Section V propoe bounded olution. Section VI include the experiment. Section VII conclude the paper.
2 2. RELATED WORK Few reearch e ort have been made with repect to the placement of the diater helter. Park et al. [3] propoed a combinational optimization method to determine location of tunami vertical evacuation helter. Genetic algorithm were ued to olve the placement problem without a bounded performance. Gama et al. [4] tudied the helter placement for mitigating urban flood diater. A coverage model wa propoed to maximize a gradual demand coverage function, which repreent a trade-o between a full coverage objective and a ditance objective. Heßler and Hamacher [5] explored the ink location problem in evacuation planning, uch that diater helter are reachable for people. Their reult were evaluated by numerical tet including random data a well a real world data from the city of Kaierlautern, Germany. The above work are conducted by the tranportation reearch community. Few bounded reult were preented. Due to the recent development of Delay Tolerant Network (DTN), the earch and recue after diater were tudied by the wirele network community. Mae and Okada [6] deigned Unmanned Aerial Vehicle (UAV) for meage deliverie in large-cale diater environment. Meage are ent and received through wirele link between device and the UAV. DTN can be built baed on the UAV. Yang et al. [7] focued on the capacity contrained Voronoi diagram, which partition the network to minimize imbalanced tra c load among diater helter. We additionally conider the communication between diater helter. Our diater helter placement problem extend the claic et cover problem in term of the connection contraint. Given ome element and a collection of et of element, the claic et cover problem aim to elect minimum et to cover all given element [8]. Element in a et are covered if thi et i elected. In our problem, diater helter are mapped to et and people are mapped to element. Geometric et cover technique [9] are ued, while the connection contraint i poed. 3. PROBLEM FORMULATION Our cenario i baed on a three-dimenional Euclidean urface that repreent the ground of a city. Let p denote a peron that i planned for diater helter. P i the et of people, i.e., P = {p}. Location of people are known a priori. Let denote a diater helter. S i the et of the diater helter, i.e., S = {}. Then, the location, capacity and etablihment cot of are denoted by l, c, and e, repectively. We conider that the capacity of a diater helter i bounded, i.e., c min apple c apple c max. The etablihment cot of a diater helter depend on it capacity. Clearly, a large-capacity diater helter ha a higher etablihment cot than a mall-capacity one. We ue e = F (c ) to denote the pre-known etablihment cot function. Let x p, denote a boolean deciion variable. x p, = 1 mean that the peron, p, i aigned to the diater helter,. Finally, D( ) i a pre-known ditance function. Our objective i to minimize the total etablihment cot, P e, of the diater helter. The number, location, and capacitie of the diater helter (i.e., S, l, and c ) are variable. We determine the aignment plan of x p,. Three contraint are poed. The firt contraint (ditance contraint) i that people mut be aigned to diater helter within a certain range of r, i.e., P xp, = 1 and D(p, ) x p, apple r. Thi contraint guarantee that people have enough time to reach diater helter in large-cale e- mergencie. The econd contraint (capacity contraint) i that diater helter mut have the capacity to hold incoming people. We have P p xp, apple c to enure u cient reource for people in diater helter. The third contraint i that diater helter hould be connected to avoid iolation. We ay two diater helter are neighboring, if the ditance between them i no larger than a threhold that i denoted by R. The third contraint (connection contraint) mean that the induced neighboring graph of the diater helter include all diater helter and i connected. Thi aim to maintain temporary communication between di erent diater helter, ince diater may detroy wired and wirele communication infratructure. Vehicle equipped with wirele device can move around diater helter to provide temporary communication baed on DTN. A a trade-o, we need to balance the number and capacitie of the diater helter. For the ame cot, we can either etablih many mall-capacity diater helter or a few large-capacity diater helter, depending on the ditribution of the people. Thi trade-o become even more complex, when the location problem i involved. Since we require that diater helter hould be connected, the etablihment of a diater helter can be ued to hold people or erve a an intermediate relay to connect other diater helter. Hence, our problem face unique challenge. 4. PROBLEM ANALYSIS We tart with the problem hardne: Theorem 1. Our placement problem i NP-hard. Proof: The proof i done through two pecial aumption, under which our problem become equivalent to the geometry et cover problem [10]. Given ome element and a collection of et of element, the et cover problem aim to elect a minimum number of et to cover all given element. The geometry et cover problem i a pecial cae, in which element are ditributed in the Euclidean pace and et are geometric ball. An element i covered by a et, if it i geometrically included by the ball of that et. Let u conider the diater helter placement problem in the Euclidean pace. The firt aumption i that the etablihment cot of a diater helter barely depend on it capacity. A a reult, the capacity of each helter can be large enough to hold all incoming people, i.e., the econd contraint (capacity contraint) i relaxed. The econd aumption i that R i large enough, uch that we can relax the third contraint (connection contraint). When R goe to infinity, all diater helter are neighboring and connected. Then, let u reduce the geometry et cover problem to our diater helter placement problem. Thi reduction i done by mapping element and et to people and diater helter, repectively. The geometric ball of each et ha a radiu of r, i.e., the diater helter will hold all people within the range of r. Our problem can alo reduce to the geometry et cover problem in the ame manner (they become equivalent to each other). Since the geometry et cover problem i NP-hard, our problem i alo NP-hard. We apply a dicrete framework to olve the diater helter placement problem. The three-dimenional Euclidean urface, which model the ground of the city, i horizontally dicretized by a grid, i.e., the vertical projection of the dicretized urface would be a grid at the horizontal plane. An
3 dicrete tep three-dimenional Euclidean urface grid interection dicrete tep Figure 2: An illutration of the dicrete framework. example of the dicretization i hown in Fig. 2. Then, each quare in the grid ha a ize of, in which i the dicrete tep meauring the ditance between neighboring grid interection. Let L denote the et of location at grid interection on the dicretized three-dimenional Euclidean urface (the ground of the city). We aume that diater helter are only etablihed at location that belong to L. Since the lope of the ground i limited, uch a dicretization bring a limited information lo. bring a trade-o between the accuracy and the time complexity. A maller bring a higher accuracy at the cot of a higher time complexity, ince the et L become larger. In addition, the etablihment cot function, e = F (c ), i alo dicretized. Thi i becaue the helter capacity i dicretized, i.e., the number of people that it can hold i an integer. We have: Definition 1. The coverage radiu,, ofadiaterhel- ter,, ithemaximumpoibleditancethatatifie: (i) apple r, and(ii) ha a u cient capacity to hold all people within.peoplewithinthecoverageradiuof are covered by, andtheetofcoveredpeopleidenotedbyp. In Definition 1, r come from the ditance contraint, in which people mut be aigned to diater helter within a range of r. A diater helter will not cover people without the range of r. In addition, the coverage radiu i retricted by the capacity contraint, in which diater helter mut have the capacity to hold incoming people. Note that the area within the coverage radiu of a helter i not necearily a dik, ince the ground of the city may not be flat. For a diater helter at a given location, it coverage radiu can be determined once it capacity i known. 5. BOUNDED SOLUTIONS Two bounded algorithm are propoed for our problem. The firt and econd algorithm independently and cooperatively conider the connection contraint, repectively. 5.1 Two-Stage Algorithm We propoe a Two-Stage Algorithm () to place diater helter. The firt tage reolve the ditance and capacity contraint, and then, the econd tage place additional diater helter to atify the connection contraint. i preented a Algorithm 1. Line 1 to 4 correpond to the firt tage. In line 1 to 3, diater helter at all poible location with each poible capacity are mapped to a collection of et. People are mapped element, and people that are covered by a diater helter are mapped to element in the correponding et. In line 4, an exiting approximation algorithm i ued to olve the geometric et cover problem. Algorithm 1 Two-Stage Algorithm () Input: A et of people, P, and their location, An etablihment cot function, F ( ), A ditance function on Euclidean urface, D( ), A et of dicrete location, L, A range, r, and a connection threhold, R. Output: S, their location, and capacitie. 1: for each location, l 2 L do 2: for each dicrete capacity, c min apple c apple c max do 3: Calculate the et of covered people, P, for the diater helter,, withl = l and c = c. Map to a et and P to element in. Ue the etablihment cot, e = F (c ), a the et weight. 4: For the mapped et and element, ue an approximation algorithm to olve the geometric et cover problem. The reultant collection of elected et are mapped back to the diater helter, including location and capacitie. 5: Map location in L a node in a graph (node are connected if their ditance i no larger than R). Ue an approximation algorithm to olve a Steiner tree problem, which elect node to connect the terminal (diater helter in line 4). Selected node are recorded a new diater helter with minimum capacitie. 6: return the reultant diater helter in line 4 and 5. The et, which are elected by the approximation algorithm, are mapped back to diater helter at given location with given capacitie. The reultant diater helter atify the ditance and capacity contraint, but may not atify the connection contraint. To atify the connection contraint, we introduce the econd tage, which include line 5. The reultant diater helter of the firt tage are regarded a terminal in a Steiner tree problem. Through another exiting approximation algorithm, they can be connected by placing additional diater helter with minimum capacitie. i bounded: Theorem 2. Let a 1 and a 2 denote the approximation ratio of exiting algorithm for the geometric et cover problem and the Steiner tree problem, repectively. Then, the approximation ratio of i a 1 + a 2 (1 + b2r/rc a 1). Proof: Let 1 and 2 denote the cot of the diater helter placed by the firt and econd tage of, repectively. Let OPT 1 and OPT 2 denote the optimal cot of the diater helter for the firt and econd tage of T- SA, repectively. Let OPT denote the optimal cot of the diater helter in our problem. Baed on the definition of the approximation ratio, we have the following inequalitie: OPT 1 apple 1 apple a 1 OPT 1 (1) OPT 2 apple 2 apple a 2 OPT 2 (2) Since the optimal placement in our problem i alo a olution to the geometric et cover problem in the firt tage, we have: 1 apple a 1 OPT 1 apple a 1 OPT (3) Let u conider a pecial olution to the Steiner tree problem in the econd tage, baed on the optimal placement in our problem. Since people mut be aigned to diater helter within a certain range of r, the ditance between a diater helter in 1 and it cloet diater helter in OPT mut
4 be no larger than 2r. Conequently, we can ue b2r/rc diater helter with minimum capacitie (and thu minimum etablihment cot) to connect an arbitrary diater helter in 1 to diater helter in OPT. Hence, we can ue a total cot of OPT + b2r/rc OPT 1 a a pecial olution to the Steiner tree problem. The cot of thi pecial olution i no maller than OPT 2 by the definition. We have: 2 apple a 2 OPT 2 apple a 2 (OPT + b 2r c 1) (4) R If we combine Eq 3 and 4, we have: = 1 + a 2 (OPT + b 2r R c 1) apple a 1 + a 2 (1 + b 2r R c a1) OPT (5) The proof complete. Let P denote the number of people (et cardinality of P ). Since there exit approximation algorithm [10, 11] with a 1 =log P and a 2 = 3, we have the following corollary: 2 Corollary 1. The approximation ratio of can be 3 +(1+ 3 b 2r c) log P. When2r <R,iti 3 +log P. 2 2 R 2 The bound of depend on b2r/rc, which repreent the tightne of the connection contraint. When R i large enough, the connection contraint can be relaxed, and then, we can focu on the ditance and capacity contraint. The time complexity of depend on the time complexitie of approximation algorithm for the geometric et cover problem and the Steiner tree problem. olve the ditance and capacity contraint by the geometric et cover problem, and then, olve the connection contraint by the Steiner tree problem. olve contraint independently. 5.2 Tree Growth Algorithm Thi ubection preent a Tree Growth Algorithm () to place diater helter. The ditance, capacity, and connection contraint are cooperatively conidered. The idea of i to iteratively place a diater helter that can connect to an exiting diater helter, until all people are covered. We tart with the following definition: Definition 2. The adjacent location i defined baed on aetofthediaterhelter,s. l i adjacent to S, ifiti(i) in the range of R of at leat one diater helter in S, and (ii) not in the coverage radiu of a diater helter in S. The coverage radiu i in Definition 1, and R i the threhold for the connection contraint. If we place a diater helter at an adjacent location of S, then it i connected to S, and therefore atifying the connection contraint. Meanwhile, ince people in adjacent location of S are not covered by S, the placement of a diater helter at an adjacent location can alo provide e cient coverage to people (the ditance and capacity contraint are tified). To quantify the connection contraint, we lightly abue the notation, and ue D(l, S) to denote the ditance between l and it cloet diater helter in S. If l i adjacent to S, thenwe have min apple D(l, S) apple R. i preented in Algorithm 2. In line 1, it initialize S = ;, i.e., no diater helter ha been placed. In line 2, a- mong all the location, it place the firt diater helter that minimize F (c). Here, e = F (c) i the etablihment cot Algorithm 2 Tree Growth Algorithm () Input: A et of people, P, and their location, An etablihment cot function, F ( ), A ditance function on Euclidean urface, D( ), A et of dicrete location, L, A range, r, and a connection threhold, R. Output: S, their location, and capacitie. 1: Initialize S = ;. 2: Among location l 2 L, place a diater helter,, with a capacity, c that minimize F (c). 3: Add to S, and then, remove P from P. 4: while P 6= ; do 5: Find the et of location, L 0, that are adjacent to S. 6: Among location l 2 L 0, place a diater helter,, with a capacity, c, that minimize F (c) D(l,S). 7: Add to S, and then, remove P from P. 8: return S, their location, and capacitie. of a diater helter with a capacity, c, and i the number of people covered by the diater helter,. Therefore, F (c ) repreent the cot-to-benefit ratio, which hould be minimized. Note that F (c) involve the ditance and capacity contraint, but not the connection contraint. Thi i becaue line 2 only place the firt diater helter. Line 3 update the diater helter placement, and remove covered people. Line 4 to 7 iteratively place a diater helter, until all people are covered. Line 5 calculate the et of adjacent location of the exiting diater helter, S. Among all the adjacent location of S, line 6 place a diater helter that minimize F (c) D(l,S), which repreent an improved cotto-benefit ratio. Here, D(l, S) i the ditance between l and it cloet diater helter in S. It additionally incorporate the connection contraint into F (c). Line 7 update the diater helter placement, and remove covered people. The iteration terminate when all people are covered. In, the ditance and capacity contraint are atified by the definition of the coverage radiu. Meanwhile, the connection contraint i atified by the definition of the adjacent location. Let min denote the minimum coverage radiu in. Then, i bounded a follow: Theorem 3. In term of minimizing the total etablihment cot, ha an approximation ratio of R min log P to the optimal diater helter placement algorithm. Proof: A new concept of the peron weight i introduced to prove thi theorem. i an iterative algorithm, and in each iteration, a diater helter i etablihed to minimize F (c) D(l,S). Note that people, who have already been covered in previou iteration, are not included in P. The weight of each peron in P i defined a F (c) D(l,S), and i denoted by w p. To unify line 2, the weight of each peron covered by the firt diater helter i pecially defined a F (c ) R. Then, the total weight of people in i: p2p w p = min F (c ) D(l, S) w p = P p2p p2p F (c ) (6)
5 Thi i becaue P 1 p2p = 1. We have D(l, S) min baed on the definition of adjacent location. Let denote a diater helter in the optimal olution, S. We have: w p = w p (7) p2p p2p We claim that, for each diater helter in the optimal olution, the following inequality i atified: w p apple log P F (c ) R (8) p2p To prove our claim, let u conider how cover people in P. Let n k be the number of uncovered people in P, after the k-th iteration. For a people, p, who i covered by in and by in the optimal olution, we have: w p = F (c) D(l, S) apple F (c ) D(l, S ) P apple F (c ) R n k (9) The firt inequality reult from the greedine, in which minimize F (c) D(l,S) among all poible placement. The econd inequality reult from P n k and D(l, S ) apple R. A a reult, we have [11]: p2p w p apple k (n k n k+1 ) F (c ) R n k apple log P F (c ) R (10) The proof of Eq. 8 complete. Combining Eq. 6, 7, and 8, the following bound can be obtained: min F (c ) apple w p = w p p2p p2p apple log P F (c ) R (11) Eq. 11 can be rewritten a: R F (c ) apple min log P F (c ) (12) Note that P F (c) and P F (c ) are the total etablihment cot of and the optimal olution, repectively. Therefore, the proof complete. bound depend on it minimum coverage radiu, which in turn depend on the ditribution of the people and the etablihment cot function, F ( ). When F ( ) i a contant function, the etablihment cot of a diater helter i a contant, and i not related to the capacity. We have min = r, ince diater helter can have u cient and free capacitie to hold all people within r. Hence, we have: Corollary 2. The approximation ratio of i R log P, r when F ( ) i a contant etablihment cot function. The time complexity of i O( L 2 + L P c max c min ). L i the number of location, P i the number of people, and c max c min i the number of di erent capacitie. Thi time complexity can be obtained by pre-computation. O( L 2 ) come from pre-computation of the ditance between all pair of location in L, in order to determine the adjacent location. O( L P c max c min ) come from precomputation of the coverage radiu for all poible diater helter with all poible capacitie. 6. EPERIMENTS 6.1 Setting Our dataet i baed on the city of Cannon Beach, Oregon, United State [12]. The dataet information ha been illutrated in Park work [12]. It include a long and narrow area (6.1km by 1.5km). The location of 1,382 houe are collected. For implicity, we aume each houe correpond to a ingle peron in our experiment. Algorithm 1 and 2 are denoted a and, repectively. Two baeline algorithm are ued a comparion. (i) tand for a bounded clutering method in [13]. To guarantee that each peron i within in a range, r, of the diater helter, the radiu of each cluter i r. Diater helter are etablihed at the center of each cluter to atify the ditance and capacity contraint. To atify the connection contraint, a panning tree i additionally built. (ii) i a divide and conquer method. iteratively divide people into two cluter through a k-mean algorithm [14]. The center of thee two cluter are connected through placing diater helter with minimum capacitie. The iteration terminate when the ditance and capacity contraint are atified. We et = 100m to dicretize the location. Note that the dataet include a long and narrow area of 6.1km by 1.5km. Therefore, uch a dicretization could maintain the accuracy. To reveal the capacity contraint, we et c min =10 and c max = 100. Two etablihment cot function are ued: F (c p )= c and F (c )= c.coe cientof2.4 and are ued, ince F (c min) and F (c max) can be the ame for the firt and econd etablihment cot function. Therefore, fair comparion can be obtained. We do not ue hyper-linear etablihment cot function, ince the etablihment of multiple mall-capacity diater helter can be alway better than thoe of a few largecapacity diater helter. Moreover, hyper-linear etablihment cot function are alo empirically impractical. Parameter, r and R, are tuned to repreent the impact of the ditance and connection contraint, repectively. While r range from m to m, we et R to be m, 600m, and 800m. In thi etting, we have R r to guarantee that the connection contraint i not ignored or relaxed. 6.2 Evaluation Reult The evaluation reult under F (c )= p c are hown in Fig. 3. Three ubfigure of Fig. 3(a), Fig. 3(b), and Fig. 3(c) correpond to R =m,r = 600m, and R = 800m for the connection contraint, repectively. and outperform and under all the etting. outperform, ince it cooperatively conider the connection contraint. P For all algorithm, the total etablihment cot, e, decreae with repect to the, r. The ditance contraint require that people mut be aigned to diater helter within a certain range of r. A larger r mean that the ditance contraint i more relaxed, and thu, the total etablihment cot i maller. When r goe to infinity, the ditance contraint i completely relaxed. Another notable point i that, when the connection threhold, R, become larger, the total etablihment cot alo lightly decreae. Similarly, a larger R mean that the connection contraint can be more relaxed, and thu, the total etablihment cot i maller. When R goe to infinity, the connection contraint can be ignored. A hown in Fig. 3, the performance gap between and i mall when
6 total etablihment cot total etablihment cot total etablihment cot (a) R =m. (b) R =600m. (c) R =800m. Figure 3: Evaluation reult under F (c p )= c. total etablihment cot (a) R =m. (b) R =600m. (c) R =800m. Figure 4: Evaluation reult under F (c )= c. total etablihment cot total etablihment cot R = m, but i large when R = 600m and R =800m. Thi i becaue and independently and cooperatively conider the connection contraint, repectively. The evaluation reult under F (c )= c are hown in Fig. 4. Three ubfigure of Fig. 4(a), Fig. 4(b), and Fig. 4(c) correpond to R =m,r = 600m, and R = 800m for the connection contraint, repectively. The reult in Fig. 4 are imilar to reult in Fig. 3. The only di erence i that the total etablihment cot of and decreae more lowly in Fig. 4. Under F (c p )= c, we ignificantly favor the etablihment of large-capacity diater helter, ince they are cot-e cient, epecially when r i large (a diater helter can cover more people due to the ditance contraint). On the other hand, when F (c )= c, we only lightly favor the etablihment of large-capacity diater helter, ince the etablihment cot function cale linearly with repect to the diater helter capacity. 7. CONCLUSION Thi paper minimize the total etablihment cot of the diater helter under three contraint: the ditance contraint, the capacity contraint, and the connection contraint. The ditance contraint require that people mut be aigned to diater helter within a certain range. The capacity contraint require that diater helter mut have the capacity to hold incoming people. The connection contraint require that diater helter hould be connected to avoid iolation. Two bounded algorithm are propoed to etablih diater helter. Experiment demontrate the e ciency and e ectivene of the propoed algorithm. ACKNOWLEDGEMENT Thi reearch wa upported in part by NSF grant CNS , CNS , CNS , CNS , CNS , and ECCS REFERENCES [1] A. Sazonov, Pari attack and europe aŕ, repone to the refugee crii, Hu pot Politic, [2] K. Kim, P. Pant, and E. Yamahita, Evacuation planning for plauible wort cae inundation cenario in Honolulu, Hawaii. Journal of Emergency Management, [3] S. Park, J. W. Van de Lindt, R. Gupta, and D. Cox, Method to determine the location of tunami vertical evacuation helter, Natural Hazard, [4] M. Gama, M. P. Scaparra, and B. Santo, Optimal location of helter for mitigating urban flood, in European Working Group on Tranportation, [5] P. Heßler and H. W. Hamacher, Sink location to find optimal helter in evacuation planning, EURO Journal on Computational Optimization, [6] K. Mae and H. Okada, Meage communication ytem uing unmanned aerial vehicle under large-cale diater environment, in IEEE PIMRC, [7] K. Yang, A. H. Shekhar, D. Oliver, and S. Shekhar, Capacity-contrained network-voronoi diagram, IEEE Tranaction on Knowledge and Data Engineering, [8] A. Dehpande, L. Hellertein, and D. Kletenik, Approximation algorithm for tochatic boolean function evaluation and tochatic ubmodular et cover, in ACM-SIAM SODA, [9] S. Stergiou and K. Tioutioulikli, Set cover at web cale, in ACM SIGKDD, [10] K. L. Clarkon and K. Varadarajan, Improved approximation algorithm for geometric et cover, Dicrete & Computational Geometry, 7. [11] Z. Zhang,. Gao, and W. Wu, Algorithm for connected et cover problem and fault-tolerant connected et cover problem, Theoretical Computer Science, 9. [12] S. Park, Undertanding and mitigating tunami rik for coatal tructure and communitie, PhD Thei, Colorado State Univerity, 7. [13] T. F. Gonzalez, Clutering to minimize the maximum intercluter ditance, Theoretical Computer Science, [14] J. Wang, J. Wang, Q. Ke, G. Zeng, and S. Li, Fat approximate k-mean via cluter cloure, in Multimedia Data Mining and Analytic, 2015.
Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationManeuverable Relays to Improve Energy Efficiency in Sensor Networks
Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationA Practical Model for Minimizing Waiting Time in a Transit Network
A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,
More informationHow to Select Measurement Points in Access Point Localization
Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,
More informationService and Network Management Interworking in Future Wireless Systems
Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationKaren L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract
Mot Graph are Edge-Cordial Karen L. Collin Dept. of Mathematic Weleyan Univerity Middletown, CT 6457 and Mark Hovey Dept. of Mathematic MIT Cambridge, MA 239 Abtract We extend the definition of edge-cordial
More informationA Load Balancing Model based on Load-aware for Distributed Controllers. Fengjun Shang, Wenjuan Gong
4th International Conference on Machinery, Material and Computing Technology (ICMMCT 2016) A Load Balancing Model baed on Load-aware for Ditributed Controller Fengjun Shang, Wenjuan Gong College of Compute
More informationShortest Paths with Single-Point Visibility Constraint
Shortet Path with Single-Point Viibility Contraint Ramtin Khoravi Mohammad Ghodi Department of Computer Engineering Sharif Univerity of Technology Abtract Thi paper tudie the problem of finding a hortet
More informationAnalyzing Hydra Historical Statistics Part 2
Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationCENTER-POINT MODEL OF DEFORMABLE SURFACE
CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationStochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang
Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,
More informationLocalized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks
Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de
More informationA SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS
A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt
More informationCutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
Thi article appeared in a journal publihed by Elevier. The attached copy i furnihed to the author for internal non-commercial reearch and education ue, including for intruction at the author intitution
More information/06/$ IEEE 364
006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;
More informationModeling the Effect of Mobile Handoffs on TCP and TFRC Throughput
Modeling the Effect of Mobile Handoff on TCP and TFRC Throughput Antonio Argyriou and Vijay Madietti School of Electrical and Computer Engineering Georgia Intitute of Technology Atlanta, Georgia 3332 25,
More informationCompressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit
Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationApplication of Social Relation Graphs for Early Detection of Transient Spammers
Radolaw rendel and Henryk Krawczyk Application of Social Relation raph for Early Detection of Tranient Spammer RADOSLAW RENDEL and HENRYK KRAWCZYK Electronic, Telecommunication and Informatic Department
More informationEmbedding Service Function Tree with Minimum Cost for NFV Enabled Multicast
1 Embedding Service Function Tree with Minimum ot for NFV Enabled Multicat angbang Ren, Student Member, IEEE, eke Guo, Senior Member, IEEE, Yulong Shen, Member, IEEE, Guoming Tang, Member, IEEE, Xu Lin,
More informationA Fast Association Rule Algorithm Based On Bitmap and Granular Computing
A Fat Aociation Rule Algorithm Baed On Bitmap and Granular Computing T.Y.Lin Xiaohua Hu Eric Louie Dept. of Computer Science College of Information Science IBM Almaden Reearch Center San Joe State Univerity
More informationA note on degenerate and spectrally degenerate graphs
A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove
More informationmapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee
Reolving Deadlock for Pipelined Stream Application on Network-on-Chip Xiaohang Wang 1,2, Peng Liu 1 1 Department of Information Science and Electronic Engineering, Zheiang Univerity Hangzhou, Zheiang,
More informationRefining SIRAP with a Dedicated Resource Ceiling for Self-Blocking
Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationTexture-Constrained Active Shape Models
107 Texture-Contrained Active Shape Model Shuicheng Yan, Ce Liu Stan Z. Li Hongjiang Zhang Heung-Yeung Shum Qianheng Cheng Microoft Reearch Aia, Beijing Sigma Center, Beijing 100080, China Dept. of Info.
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory Univerity of Nebraka-Lincoln Email: yzheng choueiry@ce.unl.edu Abtract.
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationAnalysis of the results of analytical and simulation With the network model and dynamic priority Unchecked Buffer
International Reearch Journal of Applied and Baic Science 218 Available online at www.irjab.com ISSN 2251-838X / Vol, 12 (1): 49-53 Science Explorer Publication Analyi of the reult of analytical and imulation
More informationMotion Control (wheeled robots)
3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,
More informationAalborg Universitet. Published in: Proceedings of the Working Conference on Advanced Visual Interfaces
Aalborg Univeritet Software-Baed Adjutment of Mobile Autotereocopic Graphic Uing Static Parallax Barrier Paprocki, Martin Marko; Krog, Kim Srirat; Kritofferen, Morten Bak; Krau, Martin Publihed in: Proceeding
More informationNew DSP to measure acoustic efficiency of road barriers. Part 2: Sound Insulation Index
New DSP to meaure acoutic efficiency of road barrier. Part 2: Sound Inulation Index LAMBERTO TRONCHIN 1, KRISTIAN FABBRI 1, JELENA VASILJEVIC 2 1 DIENCA CIARM, Univerity of Bologna, Italy 2 Univerity of
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationCERIAS Tech Report EFFICIENT PARALLEL ALGORITHMS FOR PLANAR st-graphs. by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu
CERIAS Tech Report 2003-15 EFFICIENT PARALLEL ALGORITHMS FOR PLANAR t-graphs by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daecu Center for Education and Reearch in Information Aurance and Security,
More informationA Sparse Shared-Memory Multifrontal Solver in SCAD Software
Proceeding of the International Multiconference on ISBN 978-83-6080--9 Computer Science and Information echnology, pp. 77 83 ISSN 896-709 A Spare Shared-Memory Multifrontal Solver in SCAD Software Sergiy
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationOn combining Learning Vector Quantization and the Bayesian classifiers for natural textured images
On combining Learning Vector Quantization and the Bayeian claifier for natural textured image María Guiarro Dept. Ingeniería del Software e Inteligencia Artificial Facultad Informática Univeridad Complutene
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationAn Approach to a Test Oracle for XML Query Testing
An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationAN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM
RAC Univerity Journal, Vol IV, No, 7, pp 87-9 AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROLEM Mozzem Hoain Department of Mathematic Ghior Govt
More informationModeling and Analysis of Slow CW Decrease for IEEE WLAN
Modeling and Analyi of Slow CW Decreae for IEEE 82. WLAN Qiang Ni, Imad Aad 2, Chadi Barakat, and Thierry Turletti Planete Group 2 Planete Group INRIA Sophia Antipoli INRIA Rhône-Alpe Sophia Antipoli,
More informationnp vp cost = 0 cost = c np vp cost = c I replacing term cost = c+c n cost = c * Error detection Error correction pron det pron det n gi
Spoken Language Paring with Robutne and ncrementality Yohihide Kato, Shigeki Matubara, Katuhiko Toyama and Yauyohi nagaki y Graduate School of Engineering, Nagoya Univerity y Faculty of Language and Culture,
More informationContents. shortest paths. Notation. Shortest path problem. Applications. Algorithms and Networks 2010/2011. In the entire course:
Content Shortet path Algorithm and Network 21/211 The hortet path problem: Statement Verion Application Algorithm (for ingle ource p problem) Reminder: relaxation, Dijktra, Variant of Dijktra, Bellman-Ford,
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationModelling the impact of cyber attacks on the traffic control centre of an urban automobile transport system by means of enhanced cybersecurity
Modelling the impact of cyber attack on the traffic control centre of an urban automobile tranport ytem by mean of enhanced cyberecurity Yoana Ivanova 1,* 1 Bulgarian Academy of Science, Intitute of ICT,
More informationA Local Mobility Agent Selection Algorithm for Mobile Networks
A Local Mobility Agent Selection Algorithm for Mobile Network Yi Xu Henry C. J. Lee Vrizlynn L. L. Thing Intitute for Infocomm Reearch, 21 Heng Mui Keng Terrace, Singapore 119613 Email: {yxu, hlee, vriz}@i2r.a-tar.edu.g
More informationAttack-Resilient Multitree Data Distribution Topologies
Attack-Reilient Multitree Data Ditribution Topologie Sacha Grau acha.grau@tu-ilmenau.de Techniche Univerität Ilmenau, Germany Abtract. We conider a cenario of information broadcat where a ource node ditribute
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationA CLUSTERING-BASED HYBRID REPLICA CONTROL PROTOCOL FOR HIGH AVAILABILITY IN GRID ENVIRONMENT
Journal of Computer Science 10 (12): 2442-2449, 2014 ISSN: 1549-3636 2014 R. Latip et al., Thi open acce article i ditributed under a Creative Common Attribution (CC-BY) 3.0 licene doi:10.3844/jcp.2014.2442.2449
More informationarxiv: v1 [cs.ds] 27 Feb 2018
Incremental Strong Connectivity and 2-Connectivity in Directed Graph Louka Georgiadi 1, Giueppe F. Italiano 2, and Niko Parotidi 2 arxiv:1802.10189v1 [c.ds] 27 Feb 2018 1 Univerity of Ioannina, Greece.
More informationParallel Approaches for Intervals Analysis of Variable Statistics in Large and Sparse Linear Equations with RHS Ranges
American Journal of Applied Science 4 (5): 300-306, 2007 ISSN 1546-9239 2007 Science Publication Correponding Author: Parallel Approache for Interval Analyi of Variable Statitic in Large and Spare Linear
More informationTopics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X
Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term
More informationDelaunay Triangulation: Incremental Construction
Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )
More information(12) Patent Application Publication (10) Pub. No.: US 2011/ A1
(19) United State US 2011 0316690A1 (12) Patent Application Publication (10) Pub. No.: US 2011/0316690 A1 Siegman (43) Pub. Date: Dec. 29, 2011 (54) SYSTEMAND METHOD FOR IDENTIFYING ELECTRICAL EQUIPMENT
More informationImage authentication and tamper detection using fragile watermarking in spatial domain
International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking
More informationWeb Science and additionality
Admin tuff... Lecture 1: EITN01 Web Intelligence and Information Retrieval Meage, lide, handout, lab manual and link: http://www.eit.lth.e/coure/eitn01 Contact: Ander Ardö, Ander.Ardo@eit.lth.e, room:
More informationMulticast with Network Coding in Application-Layer Overlay Networks
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO. 1, JANUARY 2004 1 Multicat with Network Coding in Application-Layer Overlay Network Ying Zhu, Baochun Li, Member, IEEE, and Jiang Guo Abtract
More informationKeywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.
Send Order for Reprint to reprint@benthamcience.ae 488 The Open Automation and Control Sytem Journal, 2014, 6, 488-492 Open Acce Parameter Optimization of Linear Phaed Array Tranducer for Defect Detection
More informationelse end while End References
621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized
More informationComparison of Methods for Horizon Line Detection in Sea Images
Comparion of Method for Horizon Line Detection in Sea Image Tzvika Libe Evgeny Gerhikov and Samuel Koolapov Department of Electrical Engineering Braude Academic College of Engineering Karmiel 2982 Irael
More informationOptimizing Synchronous Systems for Multi-Dimensional. Notre Dame, IN Ames, Iowa computation is an optimization problem (b) circuit
Optimizing Synchronou Sytem for ulti-imenional pplication Nelon L. Pao and Edwin H.-. Sha Liang-Fang hao ept. of omputer Science & Eng. ept. of Electrical & omputer Eng. Univerity of Notre ame Iowa State
More informationEfficient Data Forwarding in Mobile Social Networks with Diverse Connectivity Characteristics
Efficient Data Forwarding in Mobile Social Network with Divere Connectivity Characteritic Xiaomei Zhang and Guohong Cao Department of Computer Science and Engineering The Pennylvania State Univerity, Univerity
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationBrief Announcement: Distributed 3/2-Approximation of the Diameter
Brief Announcement: Ditributed /2-Approximation of the Diameter Preliminary verion of a brief announcement to appear at DISC 14 Stephan Holzer MIT holzer@mit.edu David Peleg Weizmann Intitute david.peleg@weizmann.ac.il
More informationOptimal Peer-to-Peer Technique for Massive Content Distribution
1 Optimal Peer-to-Peer Technique for Maive Content Ditribution Xiaoying Zheng, Chunglae Cho and Ye Xia Computer and Information Science and Engineering Department Univerity of Florida Email: {xiazheng,
More informationIMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak
IMPROVED DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION Tak-Shing Wong, Charle A. Bouman, and Ilya Pollak School of Electrical and Computer Engineering Purdue Univerity ABSTRACT We propoe
More informationThe Comparison of Neighbourhood Set and Degrees of an Interval Graph G Using an Algorithm
The Comparion of Neighbourhood Set and Degree of an Interval Graph G Uing an Algorithm Dr.A.Sudhakaraiah, K.Narayana Aitant Profeor, Department of Mathematic, S.V. Univerity, Andhra Pradeh, India Reearch
More informationarxiv: v3 [cs.cg] 1 Oct 2018
Improved Time-Space Trade-off for Computing Voronoi Diagram Bahareh Banyaady Matia Korman Wolfgang Mulzer André van Renen Marcel Roeloffzen Paul Seiferth Yannik Stein arxiv:1708.00814v3 [c.cg] 1 Oct 2018
More informationAnisotropic filtering on normal field and curvature tensor field using optimal estimation theory
Aniotropic filtering on normal field and curvature tenor field uing optimal etimation theory Min Liu Yuhen Liu and Karthik Ramani Purdue Univerity, Wet Lafayette, Indiana, USA Email: {liu66 liu28 ramani}@purdue.edu
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
113 New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory, Univerity of Nebraka-Lincoln {yzheng,choueiry}@ce.unl.edu Abtract.
More informationA System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems
International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem
More informationAUTOMATIC TEST CASE GENERATION USING UML MODELS
Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering,
More informationUsing Partial Evaluation in Distributed Query Evaluation
A X x Z z R r y Y B Uing Partial Evaluation in Ditributed Query Evaluation Peter Buneman Gao Cong Univerity of Edinburgh Wenfei Fan Univerity of Edinburgh & Bell Laboratorie Anataio Kementietidi Univerity
More informationAlgorithmic Discrete Mathematics 4. Exercise Sheet
Algorithmic Dicrete Mathematic. Exercie Sheet Department of Mathematic SS 0 PD Dr. Ulf Lorenz 0. and. May 0 Dipl.-Math. David Meffert Verion of May, 0 Groupwork Exercie G (Shortet path I) (a) Calculate
More informationOptimal Multi-Robot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
Optimal Multi-Robot Path Planning on Graph: Complete Algorithm and Effective Heuritic Jingjin Yu Steven M. LaValle Abtract arxiv:507.0390v [c.ro] Jul 05 We tudy the problem of optimal multi-robot path
More informationIMPLEMENTATION OF CHORD LENGTH SAMPLING FOR TRANSPORT THROUGH A BINARY STOCHASTIC MIXTURE
Nuclear Mathematical and Computational Science: A Century in Review, A Century Anew Gatlinburg, Tenneee, April 6-, 003, on CD-ROM, American Nuclear Society, LaGrange Park, IL (003) IMPLEMENTATION OF CHORD
More informationPower Aware Location Aided Routing in Mobile Ad-hoc Networks
International Journal of Scientific and Reearch Publication, Volume, Iue 1, December 01 1 Power Aware Location Aided Routing in Mobile Ad-hoc Network Anamika Computer Science, Inderprataha Engineering
More informationMinimum Energy Reliable Paths Using Unreliable Wireless Links
Minimum Energy Reliable Path Uing Unreliable Wirele Link Qunfeng Dong Department of Computer Science Univerity of Wiconin-Madion Madion, Wiconin 53706 qunfeng@c.wic.edu Micah Adler Department of Computer
More informationBuilding a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique
202 International Conference on Frontier in Handwriting Recognition Building a Compact On-line MRF Recognizer for Large Character Set uing Structured Dictionary Repreentation and Vector Quantization Technique
More information