Parameterized Complexity of Connected Even/Odd Subgraph Problems
|
|
- Edward Norman
- 6 years ago
- Views:
Transcription
1 Paameteized Complexity of Connected Even/Odd Subgaph Poblems Fedo V. Fomin 1 and Pet A. Golovach 2 1 Depatment of Infomatics, Univesity of Begen PB 7803, 5020 Begen, Noway fedo.fomin@ii.uib.no 2 School of Engineeing and Computing Sciences, Duham Univesity Science Laboatoies, South Road, Duham DH1 3LE, UK pet.golovach@duham.ac.uk Abstact Cai and Yang initiated the systematic paameteized complexity study of the following set of poblems aound Euleian gaphs. Fo a given gaph G and intege k, the task is to decide if G contains a (connected) subgaph with k vetices (edges) with all vetices of even (odd) degees. They succeed to establish the paameteized complexity of all cases except two, when we ask about a connected k-edge subgaph with all vetices of odd degees, the poblem known as k-edge Connected Odd Subgaph; and a connected k- vetex induced subgaph with all vetices of even degees, the poblem known as k-vetex Euleian Subgaph. We esolve both open poblems and thus complete the chaacteization of even/odd subgaph poblems fom paameteized complexity pespective. We show that k-edge Connected Odd Subgaph is FPT and that k-vetex Euleian Subgaph is W[1]-had. Ou FPT algoithm is based on a novel combinatoial esult on the teewidth of minimal connected odd gaphs with even amount of edges ACM Subject Classification F.2.2 Nonnumeical Algoithms and Poblems, G.2.1 Combinatoics, G.2.2 Gaph Theoy Keywods and phases Paameteized complexity, Eule gaph, even gaph, odd gaph, teewidth Digital Object Identifie /LIPIcs.STACS Intoduction An even gaph (espectively, odd gaph) is a gaph whee each vetex has an even (odd) degee. Recall that an Euleian gaph is a connected even gaph. Let Π be one of the following fou gaph classes: Euleian gaphs, even gaphs, odd gaphs, and connected odd gaphs. In [4], Cai and Yang initiated the study of paameteized complexity of subgaph poblems motivated by Euleian gaphs. Fo each Π, they defined the following paameteized subgaph and induced subgaph poblems: This wok is suppoted by EPSRC (EP/G043434/1), Royal Society (JP100692), and the Euopean Reseach Council (ERC) via gant Rigoous Theoy of Pepocessing, efeence Fedo V. Fomin and Pet A. Golovach; licensed unde Ceative Commons License NC-ND 29th Symposium on Theoetical Aspects of Compute Science (STACS 12). Editos: Chistoph Dü, Thomas Wilke; pp Leibniz Intenational Poceedings in Infomatics Schloss Dagstuhl Leibniz-Zentum fü Infomatik, Dagstuhl Publishing, Gemany
2 F.V. Fomin and P.A. Golovach 433 k-edge Π Subgaph (esp. k-vetex Π Subgaph) Instance: A gaph G and non-negative intege k. Paamete: k. Question: Does G contain a subgaph with k edges fom Π (esp. an induced subgaph on k vetices fom Π)? Cai and Yang established the paameteized complexity of all vaiants of the poblem except k-edge Connected Odd Subgaph and k-vetex Euleian Subgaph, see Table 1. It was conjectued that k-edge Connected Odd Subgaph is FPT and k- Vetex Euleian Subgaph is W[1]-had. We esolve these open poblems and confim both conjectues. Euleian Even Odd Connected Odd k-edge FPT [4] FPT [4] FPT [4] FPT Thm. 3 k-vetex W[1]-had Thm. 4 FPT [4] FPT [4] FPT [4] Table 1 Paameteized complexity of k-edge Π Subgaph and k-vetex Π Subgaph. The emaining pat of the pape is oganized as follows. In Section 2, we povide definitions and give peliminay esults. In Section 3, we show that k-edge Connected Odd Subgaph is FPT. Ou algoithmic esult is based on an uppe bound fo the teewidth of a minimal connected odd gaphs with an even numbe of edges. We show that the teewidth of such gaphs is always at most 3. The poof of this combinatoial esult, which we find inteesting in its own, is non-tivial and is given in Section 4. The bound on the teewidth is tight complete gaph on fou vetices K 4 is a minimal connected odd gaph with an even numbe of edges and its teewidth is 3. In Section 5, we pove that k-vetex Euleian Subgaph is W[1]-had and obseve that the poblem emains W[1]-had if we ask about (not necessay induced) Euleian subgaph on k vetices. We conclude the pape in Section 6 with some open poblems. 2 Definitions and Peliminay Results Gaphs. We conside finite undiected gaphs without loops o multiple edges. The vetex set of a gaph G is denoted by V (G) and its edge set by E(G). A set S V (G) of paiwise adjacent vetices is called a clique. Fo a vetex v, we denote by N G (v) its (open) neighbohood, that is, the set of vetices which ae adjacent to v. Distance between two vetices u, v V (G) (i.e., the length of the shotest (u, v)-path in the gaph) is denoted by dist G (u, v). Fo a vetex v and a positive intege k, N (k) G [v] = {u V (G) dist G(u, v) k}. The degee of a vetex v is denoted by d G (v), and (G) is the maximum degee of G. Fo a set of vetices S V (G), G[S] denotes the subgaph of G induced by S, and by G S we denote the gaph obtained fom G by the emoval of all the vetices of S, i.e. the subgaph of G induced by V (G) \ S. Paameteized Complexity. Paameteized complexity is a two dimensional famewok fo studying the computational complexity of a poblem. One dimension is the input size n and anothe one is a paamete k. It is said that a poblem is fixed paamete tactable (o FPT), if it can be solved in time f(k) n O(1) fo some function f. One of basic assumptions of the Paameteized Complexity theoy is the conjectue that the complexity class W[1] FPT, S TAC S 1 2
3 434 Paameteized Complexity of Connected Even/Odd Subgaph Poblem and it is unlikely that a W[1]-had poblem could be solved in FPT-time. We efe to the books of Downey and Fellows [6], Flum and Gohe [7], and Niedemeie [8] fo detailed intoductions to paameteized complexity. Teewidth. A tee decomposition of a gaph G is a pai (X, T ) whee T is a tee and X = {X i i V (T )} is a collection of subsets (called bags) of V (G) such that: 1. i V (T ) X i = V (G), 2. fo each edge {x, y} E(G), x, y X i fo some i V (T ), and 3. fo each x V (G) the set {i x X i } induces a connected subtee of T. The width of a tee decomposition ({X i i V (T )}, T ) is max i V (T ) { X i 1}. The teewidth of a gaph G (denoted as tw(g)) is the minimum width ove all tee decompositions of G. Minimal odd gaphs with even numbe of edges. We say that a gaph G is odd if all vetices of G ae of odd degee. Let be a vetex of G. We assume that G is ooted in. Let G be a connected odd gaph with an even numbe of edges. We say that G is a minimal if G has no pope connected odd subgaphs with an even numbe of edges containing. The impotance of minimal odd subgaphs with even numbes of edges is cucial fo ou algoithm because of the following combinatoial esult. Theoem 1. Let G be a minimal connected odd gaph with an even numbe of edges with a oot. Then tw(g) 3. Fo non-ooted gaphs, we also have the following coollay. Coollay 2. Fo any minimal connected odd gaph G with an even numbe of edges, tw(g) 3. Let us emak that the bound in Theoem 1 is tight complete gaph K 4 with a oot vetex is a minimal odd gaph with even numbe of edges and of teewidth 3. The poof of Theoem 1 is given in Section 4. This poof is non-tivial and technical, and we find the combinatoial esult of Theoem 1 to be inteesting in its own. Fom algoithmic pespective, Theoem 1 is a conestone of ou algoithm; combined with colo coding technique of Alon, Yuste and Zwick in [1] it implies that k-edge Connected Odd Subgaph is FPT. We give this algoithm in the next section. 3 Algoithm fo k-edge Connected Odd Subgaph To give an algoithm fo k-edge Connected Odd Subgaph, in addition to Theoem 1, we also need the following esult of Alon, Yuste and Zwick fom [1] obtained by a poweful colo-coding technique. Poposition 1 ([1]). Let H be a gaph on k vetices with teewidth t. Let G be a n-vetex gaph. A subgaph of G isomophic to H, if one exists, can be found in O(2 O(k) n t+1 ) expected time and in O(2 O(k) n t+1 log n) wost-case time. We ae eady to pove the main algoithmic esult of this pape. Theoem 3. k-edge Connected Odd Subgaph can be solved in time O(2 O(k log k) n 4 log n) fo n-vetex gaphs. Poof. Let (G, k) be an instance of the poblem. We apply the following algoithm. Step 1. If k is odd and (G) k, then etun Yes. Else if k is odd but (G) < k, then go to Step 3.
4 F.V. Fomin and P.A. Golovach 435 Step 2. If k is even and (G) k, then we enumeate all odd connected gaphs H with k edges of teewidth at most 3. Fo each odd gaph H of teewidth at most 3 and with k edges, we use Poposition 1 to check whethe G has a subgaph isomophic to H. The algoithm etuns Yes if such a gaph H exists. Othewise, we constuct a new gaph G by emoving fom the old gaph G all vetices of degee at least k. Step 3. Fo each vetex v, check whethe thee is a connected odd subgaph H with k edges that contains v. To do it, we enumeate all connected subgaphs with p = 0,..., k edges that include v using the following obsevation. Fo evey connected subgaph H of G with p 1 edges such that v V (H), thee is a connected subgaph H with p 1 edges such that v V (H ) and H is a subgaph of H. Hence, given all connected subgaphs with p 1 edges, we can enumeate all subgaphs with p edges by a bute-foce algoithm. The algoithm etuns Yes if a connected odd subgaph H with k edges exists fo some vetex v, and it etuns No othewise. 1 In what follows we discuss the coectness of the algoithm and evaluate its unning time. If k is odd and (G) k, then the sta K 1,k is a subgaph of G. Hence, G has a connected odd subgaph with k edges. Let k be even and let V (G) be a vetex with d G () k. If G has a connected odd subgaph with k edges containing, then G has a minimal connected odd subgaph H with even numbe of edges ooted in. Let l = E(H). Gaph H contains at most l vetices in N G (). It follows that thee ae k l vetices v 1,..., v k l N G () \ V (H). Denote by H the subgaph of G with the vetex set V (H) {v 1,..., v k l } and the edge set E(H) {v 1,..., v k l }. Since k and l ae even, we have that H is an odd gaph. By Theoem 1, tw(h) 3. Gaph H is obtained fom H by adding some vetices of degee 1, and, theefoe, tw(h ) 3. This means that when G has a connected odd subgaph H with k edges containing, then thee is a connected odd subgaph H with k edges containing and of teewidth at most thee. But then in Step 2, we find such a gaph H with k edges. If no connected odd subgaph with k edges was found in Step 2, then if such a gaph exist, it contains no vetex of degee (in G) at least k. Theefoe all such vetices can be emoved fom G without changing the solution. Finally, in Step 3, tying all possible connected subgaphs with k edges in the obtained gaph of maximum degee at most k 1, we can deduce if G contains an odd subgaph with k edges. Concening the unning time of the algoithm. Thee ae at most ( ) k(k 1)/2 k nonisomophic gaphs with k edges, and we can find all connected odd gaphs with k edges in time 2 O(k log k) and to check in time O(k) if the teewidth of each of the gaphs is at most thee by making use of Bodlaende s algoithm [3]. The unning time of this pat can be educed to 2 O(k), see e.g. [2]. Then fo each gaph H of this type, to check whethe H is a subgaph of G, takes time O(2 O(k) n 4 log n) by Poposition 1. When we aive at Step 3, we have that (G) k 1. We show by induction that fo any p 1, thee ae at most p!k p connected subgaphs with p edges that contain a given vetex v. Clealy, the claim holds fo p = 1. Let p > 1. Any connected subgaph of G with p 1 edges has at most p vetices. Since thee ae at most pk possibilities to add an edge to this subgaph to obtain a connected subgaph with p edges, the claim follows. Theefoe, fo each vetex v, we can enumeate all connected subgaphs H with k edges that include v in 1 The idea of Step 3 is due to anonymous STACS efeee. This allows us to impove the unning time O(2 O(k2 log k) n 4 log n) of the algoithm fom the oiginal vesion. S TAC S 1 2
5 436 Paameteized Complexity of Connected Even/Odd Subgaph Poblem time O(k!k k ). Hence, Step 3 can be done in time O(2 O(k log k) n). We conclude that the total unning time of the algoithm is O(2 O(k log k) n 4 log n). 4 Minimal connected odd gaphs with even numbe of edges In this section we give a high level desciption of the poof of Theoem 1, the main combinatoial esult of this pape. The poof is inductive, and fo the inductive step we identify specific stuctues in a minimal connected odd gaph with an even numbe of edges. To poceed with the inductive step, we need a stonge vesion of Theoem 1. Let G be a gaph and let x V (G). We say that a gaph G is obtained fom G by splitting x into x 1, x 2, if G is constucted as follows: fo a patition X 1, X 2 of N G (x), we eplace x by two vetices x 1, x 2, and join x 1, x 2 with the vetices of X 1, X 2 espectively. The following claim implies Theoem 1. Claim 1. Let G be a minimal connected odd gaph with an even numbe of edges with a oot. Then tw(g) 3. Moeove, if d G () = 1 and z is the unique neighbo of, then at least one of the following holds: i) thee is a tee decomposition (X, T ) of G of width at most thee such that fo any bag X i X with z X i, X i 3; o ii) fo any gaph G obtained fom G by splitting z into z 1, z 2, tw(g ) 3 and thee is a tee decomposition (X, T ) of G of width at most thee such that thee is a bag X i X containing both z 1 and z 2. To descibe the stuctues in the gaph, we need a notion of a subgaph with teminals. Roughly speaking, a subgaph with teminals is connected to the emaining pat of the gaph only via teminals. Moe fomally, let H be a subgaph of gaph G, and let,..., s V (H). We say that H is a subgaph of G with teminals,..., s if thee is a subgaph F of G such that G = F H; V (F ) V (H) = {,..., s }; and E(F ) E(H) =. Thus evey edge of G having at least one endpoint in a non-teminal vetex of H, should be an edge of H. In paticula, teminal vetices of H sepaate non-teminal vetices of H fom othe vetices of G. We also say that a subgaph H with a given set of teminals is sepaating if the gaph obtained fom G by the emoval of all non-teminal vetices of H and all the edges of H (denoted G H) is not connected. The specific stuctues we ae looking fo in the inductive step ae the subgaphs isomophic to gaphs with teminals fom the set H = {H 1, H 2, H 3, H 4, H 5, H 6 } shown in Fig. 1. We often say that H i H is contained in gaph G (o G has H i ) if G has a subgaph isomophic to H i with the teminals shown in Fig. 1. Notice that H 6 is a subgaph of H 4 and H 5, and we ae looking fo H 6 only if we cannot find H 4 o H 5. The poof of Claim 1 is by induction on the numbe of edges. The basis case is a gaph with 6 edges. Evey connected odd gaph with an even numbe of edges has at least 6 edges, and thee ae only two gaphs with 6 edges that have these popeties, these gaphs ae shown in Fig. 2. Tivially, Claim 1 holds fo these gaphs fo any choice of the oot. Then we assume that a minimal connected odd gaph G with an even numbe of edges has at least 8 edges.
6 F.V. Fomin and P.A. Golovach 437 s 3 s 4 s 5 H 2 s 3 s 3 s 4 s 3 s 3 s 6 H 1 H 3 H 4 H 5 H 6 Figue 1 The set H. Figue 2 The base of the induction: Minimal gaphs with six edges. If G contains a subgaph R with teminals, shown in Fig. 3 such that / V (R) \ {, } and / E(G), then we eplace R by edge. It is possible to show that the esulting gaph G is a minimal connected odd gaph with an even numbe of edges. Since G has less edges than G, we can use the inductive assumption. Futhemoe we assume that G has no R. R G G Figue 3 Replacement of R. Next step is to pove that if G has no subgaph fom H, then G is one of the gaphs G 1, G 2, G 3 shown in Fig. 4. Fo each of these gaphs the theoem tivially holds. Actually, we will need a stonge esult, saying that if G has no subgaph fom H 2,..., H 6 and evey subgaph of G isomophic to H 1 is of specific fom, namely, this subgaph is not sepaating and is not a non-teminal vetex of H 1, then even in this case, G is one of the gaphs G 1, G 2, G 3 shown in Fig. 4. The poof of this claim is not staightfowad. With this claim we can poceed futhe with an assumption that G contains at least one gaph fom H. Fo the case when is a non-teminal vetex of a subgaph H H, we pove that H = H 1. We emove non-teminal vetices of H, identify teminals,, and add a new oot vetex adjacent to the vetex obtained fom,. Then we pove that this gaph is a minimal connected odd gaph with an even numbe of edges, and then we can apply the induction assumption on this gaph, and deive ou claim fo G. The difficulty hee is to ensue that the teewidth of the gaph G does not incease when we make the inductive step. This equies the assumptions i) and ii) in Claim 1 on the stuctue of tee decompositions. Fom this point, it can be assumed that is not a non-teminal vetex of a subgaph fom H with the coesponding set of teminals. All gaphs H 2,..., H 6 have even numbe of edges and evey teminal vetex of such a gaph is of even degee. This means, that G cannot contain a non-sepaating gaph H fom {H 2,..., H 6 }, because emoving edges and non-teminal vetices of H, would esult in a S TAC S 1 2
7 438 Paameteized Complexity of Connected Even/Odd Subgaph Poblem G 1 G 2 G 3 Figue 4 Gaphs G 1, G 2, G 3. connected odd subgaph of G with even numbe of edges, which is a contadiction to the minimality of G. Hence, if G contains subgaphs fom H but they ae non-sepaating, G can contain only H 1. Then as we aleady have shown, G is one of the gaphs G 1, G 2, G 3 shown in Fig. 4. = s 3 s 3 x 2 y 2 x 2 y 2 x 1 y 1 x 1 y 1 x 1 s 4 F (1) 1 s 4 F (2) 1 x 2 y 1 s 4 F (3) 1 s 3 y 2 x 1 s 3 x 2 y 1 s 4 F (4) 1 y 2 Figue 5 The case H = H 4, the tees F (1) 1,..., F (4) 1 ae fomed by bold" edges. Thus we can assume that G contains a sepaating subgaph H fom H. Among all such sepaating subgaphs, we select H such that the numbe of edges of the component F 1 of the gaph G = G H containing is minimum. We pove that G has exactly two components F 1,, whee F 1 is a tee. We consequently conside the cases H = H 1,..., H 6 and ague as follows. If H = H 1, then F 1 = K 2 and we apply induction fo ooted in one of the teminals of H. If H = H 2, then we pove that F 1 = K 2. If = K 2, then the poof follows diectly. Othewise, we identify teminals, s 3, and add a new oot adjacent to the vetex obtained fom, s 3. It is possible to show that the constucted gaph is a minimal connected odd gaph with an even numbe of edges, and we can use the induction assumption fo this gaph. The aguments fo the case H = H 3 ae simila. If H = H 4, then we pove that F 1 is one of the tees F (1) 1,..., F (4) 1 shown in Fig. 5. Fo, we pove that tw( ) 2, and use this fact to constuct a tee decomposition of G of width thee. The case H = H 5 is simila. Finally, fo H = H 6, we pove that it can be assumed that,, s 4, s 5 V (F 1 ), s 3, s 6 V ( ), and F 1 is the tee shown in Fig. 6. Then we apply fo the same aguments as in the case H = H 4. In each of the cases, we succeed to educe G to a smalle minimal connected odd gaph G with even numbe of edges and show that tw(g) tw(g ), which completes the induction step. s 4 s 5 s 3 s 6 Figue 6 The case H = H 6, the tee F 1 is induced by bold" edges.
8 F.V. Fomin and P.A. Golovach Complexity of k-vetex Euleian Subgaph In this section we pove that k-vetex Euleian Subgaph is W[1]-had. Theoem 4. The k-vetex Euleian Subgaph is W[1]-had. Poof. We educe fom the well-known W[1]-complete k-clique poblem (see e.g. [6]): k-clique Instance: A gaph G and non-negative intege k. Paamete: k. Question: Does G contain a clique with k vetices? Notice that the poblem emains W[1]-complete when the paamete k is esticted to be odd. It follows immediately fom the obsevation that the existence of a clique with k vetices in a gaph G is equivalent to the existence of a clique with k + 1 vetices in the gaph obtained fom G by the addition of a univesal vetex adjacent to all the vetices of G. Fom now it is assumed that k > 1 is an odd intege. Let G be a gaph. We constuct the gaph G by subdividing edges of G by k 2 vetices, i.e. each edge xy is eplaced by an (x, y)-path of length k We say that u V (G ) is a banch vetex if u V (G), and u is a subdivision vetex othewise. We also say that u is a subdivision vetex fo an edge xy E(G) if u is a subdivision vetex of the path obtained fom xy. We claim that G has a clique of size k if and only if G has an induced Euleian subgaph on k = 1 2 (k 1)k3 + k vetices. Suppose that G has a clique K with k vetices. Let H be the subgaph of G induced by K and the subdivision vetices fo all edges xy with x, y K. It is easy to see that H is a connected Euleian gaph on k = 1 2 (k 1)k3 + k vetices. Let now H be an induced Euleian subgaph of G on k = 1 2 (k 1)k3 + k vetices. Denote by U the set of banch vetices of H, and let p = U. Let A = {xy E(G) x, y U, and H has a subdivision vetex fo xy} and let F = (U, A). Let also q = A. Since H is connected, the gaph F is connected as well. Obseve that if u V (H) is a subdivision vetex fo an edge xy E(G), then all subdivision vetices fo xy ae vetices of H and x, y V (H). It follows that H has p + q k 2 = k vetices, and we have p k = ( 1 2 (k 1)k q)k2. Since k 2 is a diviso of p k, p k. Suppose that p > k. Then since k 2 is a diviso of p k, p k 2 + k. Any connected gaph with p vetices has at least p 1 edges, and it means that q k 2 + k 1 > 1 2 (k 1)k. We get that 0 < p k = ( 1 2 (k 1)k q)k2 < 0; a contadiction. We conclude that p = k. Then q = 1 2 (k 1)k and U is a clique with k vetices. Recall that k-vetex Euleian Subgaph asks about an induced Euleian subgaph on k vetices. Fo the gaph G in the poof of Theoem 4, any Euleian subgaph is induced. It gives us the following coollay. Coollay 5. The following poblem: Instance: A gaph G and non-negative intege k. Paamete: k. Question: Does G contain an Euleian subgaph with k vetices? is W[1]-had. S TAC S 1 2
9 440 Paameteized Complexity of Connected Even/Odd Subgaph Poblem 6 Conclusion We poved that k-edge Connected Odd Subgaph is FPT and k-vetex Euleian Subgaph is W[1]-had. This completes the chaacteization of even/odd subgaph poblems with exactly k edges o vetices fom paameteized complexity pespective. While it is tivial to decide whethe a gaph G has a (connected) even o odd subgaph with at most k edges o vetices, the question about a subgaph with at least k edges o vetices seems to be much moe complicated. Fo At Least k-edge Odd Subgaph and At Least k-vetex Odd Subgaph, following the lines of the poofs fom [4] fo k-edge Odd Subgaph and k-vetex Odd Subgaph, it is possible to show that these poblems ae in FPT. Fo othe cases, the appoaches used in [4] and in ou pape, do not seem to wok. Cai and Yang in [4] also consideed dual poblems whee the aim is to find an even o odd subgaph of a gaph G with V (G) k vetices o E(G) k edges espectively. Recently, these esults wee complemented by Cygan et al. [5]. Howeve, the complexity of the dual poblem to k-edge Connected Odd Subgaph, namely, obtaining connected odd subgaph with E(G) k edges, emains open. Acknowledgments. The authos ae gateful to the anonymous efeees fo thei constuctive suggestions and emaks. Refeences 1 Noga Alon, Raphael Yuste, and Ui Zwick. Colo-coding. J. ACM, 42(4): , Omid Amini, Fedo V. Fomin, and Saket Sauabh. Counting subgaphs via homomophisms. In Poceedings of the 36th Intenational Colloquium on Automata, Languages and Pogamming (ICALP 2009), volume 5555 of Lectue Notes Comp. Sci., pages Spinge, Hans L. Bodlaende. A linea-time algoithm fo finding tee-decompositions of small teewidth. SIAM J. Comput., 25(6): , Leizhen Cai and Boting Yang. Paameteized complexity of even/odd subgaph poblems. J. Discete Algoithms, 9(3): , Maek Cygan, Dániel Max, Macin Pilipczuk, MichałPilipczuk, and Ildikó Schlotte. Paameteized complexity of euleian deletion poblems. In Poceedings of the 37th Intenational Wokshop on Gaph-Theoetic Concepts in Compute Science (WG 2011), volume 6986 of Lectue Notes Comp. Sci., page Spinge, Rodney G. Downey and Michael R. Fellows. Paameteized complexity. Monogaphs in Compute Science. Spinge-Velag, New Yok, Jög Flum and Matin Gohe. Paameteized complexity theoy. Texts in Theoetical Compute Science. An EATCS Seies. Spinge-Velag, Belin, Rolf Niedemeie. Invitation to fixed-paamete algoithms, volume 31 of Oxfod Lectue Seies in Mathematics and its Applications. Oxfod Univesity Pess, Oxfod, 2006.
Steve Alpern, Thomas Lidbetter, Alec Morton, and Katerina Papadaki Patrolling a pipeline
Steve Alpen, Thomas Lidbette, Alec Moton, and Kateina Papadaki Patolling a pipeline Book section Oiginal citation: Oiginally published in Alpen, Steven, Lidbette, Thomas, Moton, Alec and Papadaki, Kateina
More informationTiling Layouts with Dominoes
+, 16th Canadian Confeence on Computational Geomety, 2004 Tiling Layouts with Dominoes Mak Watson Chis Woman c 1 We exploe the complexity of tiling finite subsets of the plane, which we call layouts, with
More informationAnalysis of Occurrence of Digit 0 in Natural Numbers Less Than 10 n
meican Intenational Jounal of Reseach in Fomal, pplied & Natual Sciences vailable online at http://www.iasi.net ISSN (Pint): 2328-3777, ISSN (Online): 2328-3785, ISSN (CD-ROM): 2328-3793 IJRFNS is a efeeed,
More informationwhere and are polynomials with real coefficients and of degrees m and n, respectively. Assume that and have no zero on axis.
function whee is an unknown constant epesents fo the un-modeled dynamics The pape investigates the position contol of electical moto dives that can be configued as stuctue of Fig 1 This poblem is fomulated
More informationN2-1. The Voltage Source. V = ε ri. The Current Source
DC Cicuit nalysis The simplest cicuits to undestand and analyze ae those that cay diect cuent (DC). n this note we continue ou study of DC cicuits with the topics of DC voltage and cuent souces, the idea
More informationThe mathematical structure known as a graph has the valuable feature of
Copyight, Pinceton Univesity Pess No pat of this book may be means without pio witten pemission of the publishe 1 Intoducing Gaphs The mathematical stuctue known as a gaph has the valuable featue of helping
More informationDesign of FIR Filter using Filter Response Masking Technique
Design of FIR Filte using Filte Response Masking Technique Sandeep Shivastava, Alok Jain, Ram Kuma Soni Abstact- In this pape autho is tying to implement Fequency esponse masking (FRM) technique. In this
More informationRobust position-based routing in wireless ad hoc networks with irregular transmission ranges
WIELESS COMMUNICATIONS AND MOBILE COMPUTING Wiel. Commun. Mob. Comput. 2003; 3:141 153 (DOI: 10.1002/wcm.108) obust position-based outing in wieless ad hoc netwoks with iegula tansmission anges Lali Baièe
More informationThe Mean and Variance of the Numbers of r-pronged Nodes and r-caterpillars in Yule-Generated Genealogical
Annals of Combinatoics 10 (2006 129-146 0218-0006/06/010129-18 DOI 10.1007/s00026-006-0278-6 c Bikhäuse Velag, Basel, 2006 Annals of Combinatoics The Mean and Vaiance of the Numbes of -Ponged Nodes and
More informationEfficient Power Control for Broadcast in Wireless Communication Systems
Efficient Powe Contol fo Boadcast in Wieless Communication Systems A. T. Chonopoulos Compute Science Depatment Univesity of Texas at San Antonio San Antonio, TX Email:atc@cs.utsa.edu P. Cotae Depatment
More information1 Performance and Cost
Pefomance and Cost Analysis and Reseach of Ai-Cooled Using Small Diamete Coppe Tubes Wu Yang, Li Changsheng and Deng Bin Abstact Replacing coppe tubes with aluminum tubes and using coppe tubes with smalle
More informationSpectrum Sharing between Public Safety and Commercial Users in 4G-LTE
1 Spectum Shaing between Public Safety and Commecial Uses in 4G-LTE Haya Shajaiah, Ahmed Abdel-Hadi and Chales Clancy Badley Depatment of Electical and Compute Engineeing Viginia Tech, Alington, VA, 22203,
More informationFeasibility of a triple mode, low SAR material coated antenna for mobile handsets
Loughboough Univesity Institutional Repositoy Feasibility of a tiple mode, low SAR mateial coated antenna fo mobile handsets This item was submitted to Loughboough Univesity's Institutional Repositoy by
More informationOptimal Design of Smart Mobile Terminal Antennas for Wireless Communication and Computing Systems
Optimal Design of Smat Mobile Teminal Antennas fo Wieless Communication and Computing Systems Autho Lu, Junwei, Yang, Shiyou Published 2007 Confeence Title 2007 4th Intenational Symposium on Electomagnetic
More information4 Trigonometric and Inverse Trigonometric Functions
MATH983/954 Mathematics 0C/C. Geneal infomation fo the academic yea 0-03: Lectue: D Theodoe Voonov, Room.09, School of Mathematics, Alan Tuing Building, email: theodoe.voonov@mancheste.ac.uk. Lectues:
More informationDESIGN AND PARAMETRIC EVALUATION OF RECTANGULAR MICROSTRIP PATCH ANTENNA FOR GSM APPLICATION
DESIGN AND PARAMETRIC EVALUATION OF RECTANGULAR MICROSTRIP PATCH ANTENNA FOR GSM APPLICATION RAHUL T. DAHATONDE, SHANKAR B. DEOSARKAR Dept. of E & TC, D. Babasaheb Ambedka Technological Univesity, Lonee,
More informationVLSI Implementation of Low Complexity MIMO Detection Algorithms
, Impact Facto :.643 eissn : 349-000 & pissn : 394-4544 Intenational Jounal of Reseach and Applications (Ap-Jun 015 Tansactions) (6): 309-313 Intenational Confeence on Emeging Tends in Electonics & Telecommunications
More informationAvailable online at ScienceDirect. Procedia Engineering 100 (2015 )
Available online at www.sciencediect.com ScienceDiect Pocedia Engineeing 1 (215 ) 1 14 25th DAAAM Intenational Symposium on Intelligent Manufactuing and Automation DAAAM 214 Measuement of Complex Pemittivity
More informationSmall Loop Antenna and Duality Theorem
Small Loop Antenna and Duality Theoem Page 1 Small Loop Antenna and Duality Theoem Having studied the ideal electic dipole we now tun ou attention to an inteesting antenna closely elated to the electic
More information10! !. 3. Find the probability that a five-card poker hand (i.e. 5 cards out of a 52-card deck) will be:
MATH 0(001 Fall 2018 Homewok 2 Solutions Please infom you instucto if you find any eos in the solutions 1 Suppose that thee ae duck huntes, each with a pefect shot A flock of ducks fly ove, and each hunte
More informationMinimizing Ringing and Crosstalk
Minimizing Ringing and Cosstalk By Glen Dash, Ampyx LLC, GlenDash at alum.mit.edu Copyight 1998, 26 Ampyx LLC When viewed on a schematic, a wie is just a wie. Howeve, when isetimes shink to a few nanoseconds
More informationThe Periodic Ambiguity Function Its Validity and Value
The Peiodic Ambiguity Function Its Validity and Value Nadav Levanon Dept. of Electical Engineeing Systems Tel Aviv Univesity Tel Aviv, Isael nadav@eng.tau.ac.il Abstact The peiodic ambiguity function (PAF)
More informationDistributed Spectrum Allocation via Local Bargaining
Distibuted Spectum Allocation via Local Bagaining Lili Cao Shanghai Jiaotong Univesity, Shanghai, P.R. China Email: cao li li@yahoo.com Haitao Zheng Micosoft Reseach Asia, Beijing, P.R. China Email: htzheng@ieee.og
More informationKey Laboratory of Earthquake Engineering and Engineering Vibration, China Earthquake Administration, China
Shake Table Test fo Lage Indiect-Ai-Cooling Towe Stuctue of Fie Powe Plant Pat I Junwu DAI, Yongqiang YANG & Xuan WNG Key Laboatoy of athquake ngineeing and ngineeing Vibation, China athquake Administation,
More informationDiscrepancies Between Euclidean and Spherical Trigonometry. David Eigen
Discepancies Between Euclidean and Spheical Tigonomety David Eigen 1 Non-Euclidean geomety is geomety that is not based on the postulates of Euclidean geomety. The five postulates of Euclidean geomety
More informationGAMMA SHAPED MONOPOLE PATCH ANTENNA FOR TABLET PC
GAMMA SHAPED MONOPOLE PATCH ANTENNA FOR TABLET PC Islam Md. Rafiqul, Mohammad Shawkat Habib and Khaizuan Abdullah Depatment of Electical and Compute Engineeing, Intenational Islamic Univesity Malaysia,
More informationExperimental Investigation of Influence on Non-destructive Testing by Form of Eddy Current Sensor Probe
Expeimental Investigation of Influence on Non-destuctive Testing by Fom of Eddy Cuent Senso Pobe Fengyun Xie * and Jihui Zhou School of Mechanical and Electonical Engineeing, East China Jiaotong Univesity,
More informationWIRELESS SENSORS EMBEDDED IN CONCRETE
7th Euopean Wokshop on Stuctual Health Monitoing July 8-11, 2014. La Cité, Nantes, Fance Moe Info at Open Access Database www.ndt.net/?id=17296 WIRELESS SENSORS EMBEDDED IN CONCRETE Amal Abbadi 1 Phd Student,
More informationTECHNICAL REPORT: CVEL Maximum Radiated Emission Calculator: Power Bus EMI Algorithm. Chentian Zhu and Dr. Todd Hubing. Clemson University
TECHNICAL REPORT: CVEL-13-053 Maximum Radiated Emission Calculato: Powe Bus EMI Algoithm Chentian Zhu and D. Todd Hubing Clemson Univesity Octobe 12, 2013 Abstact The Maximum Radiated Electomagnetic Emissions
More informationRandomized Self-Assembly for Exact Shapes
Randomized Self-Assembly fo Exact Shapes David Doty Depatment of Compute Science Iowa State Univesity Ames, IA 500, USA ddoty@iastate.edu Abstact Woking in Winfee s abstact tile assembly model, we show
More informationSliding Mode Control for Half-Wave Zero Current Switching Quasi-Resonant Buck Converter
Sliding Mode Contol fo Half-Wave Zeo Cuent Switching Quasi-Resonant Buck Convete M. Ahmed, Student membe, IEEE, M. Kuisma, P. Silventoinen Abstact This pape focuses on the pactical implementation of sliding
More informationDesign and Characterization of Conformal Microstrip Antennas Integrated into 3D Orthogonal Woven Fabrics
Design and Chaacteization of Confomal Micostip Antennas Integated into 3D Othogonal Woven Fabics Xin Wang 1, Lan Yao 1, Fujun Xu 2, Dongchun Zhou 1, Yiping Qiu 1 1 College of Textiles, Donghua Univesity,
More informationIMAGE QUALITY ASSESSMENT USING THE MOTIF SCAN
Signal & Image Pocessing : An Intenational Jounal (SIPIJ) Vol., No.5, Octobe 0 IMAGE QUALITY ASSESSMENT USING THE MOTIF SCAN Z. Cui, D.-O Kim, and R.-H. Pak Depatment of Electonic Engineeing, Sogang Univesity,
More informationCCSDS Coding&Synchronization Working Group March Washington DC, USA SLS-C&S_08-CNES02
CCSDS Coding&Synchonization Woking Goup Mach 2008 1 Washington DC, USA DVB-S2 like fame constuction and LDPC codes ate o/and size extension fo use of Vaiable Coding & Modulation suitable fo X and Ka bands
More informationABSTRACTT FFT FFT-' Proc. of SPIE Vol U-1
Phase econstuction stategies in phase-locking system based on multi-apetue wave font sensos P.A. Semenov, S.D. Pol skikh Shvabe-Reseach, Moscow, Russian Fedeation; e-mail: pite@bk.u ABSTRACTT System of
More informationTheoretical Analysis of the Multi-agent Patrolling Problem
Theoetical Analysis of the Multi-agent Patolling Poblem Yann Chevaleye Lamsade - univesity pais 9, place du Machal de Latte de Tassigny 75775 PARIS CEDEX 16 yann.chevaleye@lamsade.dauphine.f Abstact A
More informationThe reliability of wireless backhaul mesh networks
The eliability of wieless backhaul mesh netwoks Gei Egeland 1, Paal E. Engelstad 2 1 Depatment of Electical and Compute Engineeing, Univesity of Stavange, 4036 Stavange Noway 1 gei.egeland@gmail.com 2
More informationNoise Attenuation Due to Vegetation
Noise Attenuation Due to Vegetation Vasile BACRIA Politehnica Univesity of Timisoaa, Bd. M.Viteazu,1, 300222 Timisoaa, bacia@mec.upt.o Nicolae HERISANU Politehnica Univesity of Timisoaa, Bd. M. Viteazu,
More informationSchool of Electrical and Computer Engineering, Cornell University. ECE 303: Electromagnetic Fields and Waves. Fall 2007
School of Electical and Compute Engineeing, Conell Univesity ECE 303: Electomagnetic Fields and Waves Fall 007 Homewok 1 Due on Nov. 8, 007 by 5:00 PM Reading Assignments: i) Review the lectue notes. ii)
More informationDesign of A Circularly Polarized E-shaped Patch Antenna with Enhanced Bandwidth for 2.4 GHz WLAN Applications
VNU Jounal of Science: Comp. Science & Com. Eng., Vol. 31, No. 2 (2015) 1-7 Design of A Ciculaly Polaized E-shaped Patch Antenna with Enhanced Bandwidth fo 2.4 GHz WLAN Applications Hong Van Tam 1, Luong
More informationFigure Geometry for Computing the Antenna Parameters.
Spheical Coodinate Systems Definitions Figue 1.2.1 Geomety fo Computing the Antenna Paametes. Antenna Radiation Patten: The distibution of adiated enegy fom an antenna ove a suface of constant adius centeed
More information6.1 Reciprocal, Quotient, and Pythagorean Identities
Chapte 6 Tigonometic Identities 1 6.1 Recipocal, Quotient, and Pthagoean Identities Wam-up Wite each epession with a common denominato. Detemine the estictions. a c a a) b d b) b c d c) a 1 c b c b a Definition
More informationAn Efficient Control Approach for DC-DC Buck-Boost Converter
2016 Published in 4th Intenational Symposium on Innovative Technologies in Engineeing and Science 3-5 Novembe 2016 (ISITES2016 Alanya/Antalya - Tukey) An Efficient Contol Appoach fo DC-DC Buck-Boost Convete
More informationRealistic Simulation of a Wireless Signal Propagation in an Urban Environment
Realistic Simulation of a Wieless Signal Popagation in an Uban Envionment Keyukuma J. Patel Univesity of Southen Queensland Toowoomba, Austalia e-mail: keyupatel@ieee.og Andew Y. J. Lee Nanyang Technological
More informationOptic Cable Tracking and Positioning Method Based on Distributed Optical Fiber Vibration Sensing
08 5th Intenational Confeence on Electical & Electonics Engineeing and Compute Science (ICEEECS 08) Optic Cable Tacking and Positioning Method Based on Distibuted Optical Fibe Vibation Sensing Zhang Chao,
More informationParameters of spinning AM reticles
Paametes of spinning AM eticles onald G. Digges, Cal E. Halfod, and Glenn D. Boeman A new method of obtaining amplitude modulation (AM) fo detemining taget location with spinning eticles is pesented. The
More informationMultiagent Reinforcement Learning Dynamic Spectrum Access in Cognitive Radios
Sensos & Tansduces 204 by IFSA Publishing, S L http://wwwsensospotalcom Multiagent Reinfocement Leaning Dynamic Spectum Access in Cognitive Radios Wu Chun, 2 Yin Mingyong, 2 Ma Shaoliang, Jiang Hong School
More informationInvestigation. Name: a About how long would the threaded rod need to be if the jack is to be stored with
Think Unit bout 6 This Lesson Situation 1 Investigation 1 Name: Think about the design and function of this automobile jack. Use the uto Jack custom tool to test ou ideas. a bout how long would the theaded
More informationPPP-RTK PLATFORM PERFORMANCE BASED ON SINGLE-FREQUENCY GPS DATA
PPP-RTK PLATFORM PERFORMANCE BASED ON SINGLE-FREQUENCY GPS DATA Dennis Odik *, Pete J.G. Teunissen, and Baocheng Zhang Reseach Fellow, GNSS Reseach Cente, Depatment of Spatial Sciences, Cutin Univesity,
More informationProceedings of Meetings on Acoustics
Poceedings of Meetings on Acoustics Volume 4, 2 http://acousticalsociety.og/ 62nd Meeting Acoustical Society of Ameica San Diego, Califonia 3 Octobe - 4 Novembe 2 Session 4pEA: Engineeing Acoustics 4pEA8.
More informationHISTORY AND PROGRESS OF THE TOW THOMAS BI-QUADRATIC FILTER. PART I. GENERATION AND OP AMP REALIZATIONS
Jounal of icuits, Systems, and omputes Vol. 7, No. (2008) 33 54 c Wold Scientific Publishing ompany HISTOY ND POGESS OF THE TOW THOMS BIQUDTI FILTE. PT I. GENETION ND OP MP ELIZTIONS HMED M. SOLIMN Electonics
More informationA Simple Improvement to the Viterbi and Viterbi Monomial-Based Phase Estimators
Univesity of New Oleans ScholaWoks@UNO Electical Engineeing Faculty Publications Depatment of Electical Engineeing 006 A Simple Impovement to the Vitebi and Vitebi Monomial-Based Phase Estimatos Kenneth
More informationExercise 1 (MC Question)
D J Tani -9- Contol Systems II (Sping 8 Solution Execise Set 9 Linea Quadatic Regulato Gioele Zadini, gzadini@ethzch, 7th May 8 Execise (MC Question (I-D, (II-A, (III-C, (IV-B (I-C, (II-A, (III-D, (IV-B
More informationHYBRID FUZZY PD CONTROL OF TEMPERATURE OF COLD STORAGE WITH PLC
Jounal of Theoetical and Applied Infomation Technology 28 th Febuay 2013. Vol. 48 No.3 2005-2013 JATIT & LLS. All ights eseved. ISSN: 1992-8645 www.jatit.og E-ISSN: 1817-3195 HYBRID FUZZY PD CONTROL OF
More informationNear-field Computation and. Uncertainty Estimation using Basic. Cylindrical-Spherical Formulae
Nea-field Computation and Uncetainty Estimation using Basic Cylindical-Spheical Fomulae Poject... IEC 63 Subject... Basic Nea-Field Computation Document numbe... N/A Revision... 3 Autho... F.D. du Plessis
More informationNear-field emission prediction of CESAME
Nea-field emission pediction of CESAME E. Sicad, S. Ben Dhia, E. Lamoueux INSA-GEI, 135 Av de Rangueil 31077 Toulouse Fance B. Vignon, L. Couau ST Micoelectonics, Cental R&D Colles, Fance Contact : etienne.sicad@insa-toulouse.f
More informationOn Reducing Blocking Probability in Cooperative Ad-hoc Networks
On educing Blocking Pobability in Coopeative Ad-hoc Netwoks Ayda Basyouni, Walaa Hamouda ept of Electical and Compute Engineeing Concodia Univesity, Monteal, Canada Email: {a basy,hamouda}@ececoncodiaca
More informationAnalysis of a Fractal Microstrip Patch Antenna
124 Analysis of a Factal Micostip Patch Antenna Vibha Rani Gupta and Nisha Gupta* Bila Institute of Technology, Mesa, Ranchi-835215, Jhakhand, India. vgupta@bitmesa.ac.in, ngupta@bitmesa.ac.in Abstact-
More informationDetermination of The Winding Inductances Of A Two-Phase Machine.
IOSR Jounal of Engineeing (IOSRJEN) ISSN (e): 5-31, ISSN (p): 78-8719 Vol. 5, Issue 4 (Apil. 15), V1 PP 16- www.iosjen.og Detemination of The Winding Inductances Of A Two-Phase Machine. * I.K. Onwuka,
More informationIAS 2.4. Year 12 Mathematics. Contents. Trigonometric Relationships. ulake Ltd. Robert Lakeland & Carl Nugent
Yea 12 Mathematics IS 2.4 Tigonometic Relationships Robet Lakeland & al Nugent ontents chievement Standad.................................................. 2 icula Measue.......................................................
More informationGeneralized Release Planning for Product-Line Architectures
Genealized Release Planning fo Poduct-Line Achitectues Louis J. M. Taboda Macquaie Gaduate School of Management, Macquaie Univesity, NSW 2109, Austalia Louis.Taboda@poCentic.com Abstact. This pape elaboates
More informationHeuristic Algorithm for Location-Allocation Problem Based on Wavelet Analysis in Integrated Logistics Distribution
Heuistic Algoithm fo Location-Allocation Poblem Based on Wavelet Analysis in Integated Logistics Distibution Qian Zhang Business School, HuaQiao Univesity Quanzhou, FuJian, 36202, P.R. China E-mail: stu_zyl@yahoo.com.cn
More informationChapter 5: Trigonometric Functions of Angles
Chapte 5: Tigonometic Functions of Angles In the pevious chaptes we have exploed a vaiety of functions which could be combined to fom a vaiety of shapes. In this discussion, one common shape has been missing:
More informationStudy and Design of Dual Frequency High Gain and Conformal Microstrip Patch Antenna
, pp.236-243 http://dx.doi.og/10.14257/astl.2017.147.33 Study and Design of Dual Fequency High Gain and Confomal Micostip Patch Antenna S. Auna 1, K. Sinivasa Naik 2, J. Ramesh 2 and D. Madhu 2 1 Andha
More informationDesign of Microstrip Antenna for Wireless Local Area Network
Available Online at www.ijcsmc.com Intenational Jounal of Compute Science and Mobile Computing A Monthly Jounal of Compute Science and Infomation Technology IJCSMC, Vol. 4, Issue. 4, Apil 205, pg.36 365
More informationTHE UNIVERSITY OF NEW SOUTH WALES. School of Electrical Engineering & Telecommunications
THE UNIESITY OF NEW SOUTH WAES School of Electical Engineeing & Telecommunications EE97 POWE EETONIS FO ENEWABE AND DISTIBUTED GENEATION EXAMINATION Session (Supplementay Exam) TIME AOWED: 3 hous TOTA
More informationLow-Complexity Time-Domain SNR Estimation for OFDM Systems
Low-Complexity Time-Domain SR Estimation fo OFDM Systems A. jaz, A.B. Awoseyila and B.G. Evans A low-complexity SR estimation algoithm fo OFDM systems in fequency-selective fading channels is poposed.
More informationInternational Journal of Engineering Research-Online A Peer Reviewed International Journal Articles available online
A Pee Reviewed Intenational Jounal Aticles available online http://www.ijoe.in REVIEW ARTICLE ISSN: 2321-7758 GAIN ENHANCEMENT OF MICROSTRIP ANTENNA USING SQUARE ARRAY RAHUL GUPTA 1, BRIJESH DHAKKAR 2,GARIMA
More informationJournal of Applied Science and Agriculture
Jounal of Applied Science and Agicultue, 9(16) Octobe 214, Pages: 1-15 AENSI Jounals Jounal of Applied Science and Agicultue ISSN 1816-9112 Jounal home page: www.aensiweb.com/jasa A Design of New Bluetooth
More informationHexagonal Shaped Microstrip Patch Antenna for Satellite and Military Applications
Intenational Jounal of Engineeing and Advanced Technology (IJEAT) ISSN: 49 8958, Volume-7 Issue-5, June 08 Hexagonal Shaped Micostip Patch Antenna fo Satellite and Militay Applications Jayaenjini N, Unni
More informationScienceDirect. Simplified Generation of Electromagnetic Field within EMC Immunity Test Area
Available online at www.sciencediect.com ScienceDiect Pocedia Engineeing 69 ( 014 ) 7 34 4th DAAAM Intenational Symposium on Intelligent Manufactuing and Automation, 013 Simplified Geneation of Electomagnetic
More informationPublished in: International Journal of Material Forming. Document Version: Peer reviewed version
A Vitual Inspection Technique fo Assessing the Dimensional Accuacy of Foged Compesso Blades Using FE Modeling and CMM Inspection Makem, J., Ou, H., Amstong, C., Rennie, A., & Nikov, S. (2008). A Vitual
More informationAnalysis of the optimized low-nonlinearity lateral effect sensing detector
Jounal of hysics: Confeence Seies Analysis of the optimized low-nonlineaity lateal effect sensing detecto To cite this aticle: Saeed Olyaee et al J. hys.: Conf. Se. 76 4 Related content - Neual netwok
More informationPERFORMANCE OF TOA ESTIMATION TECHNIQUES IN INDOOR MULTIPATH CHANNELS
PERFORMANCE OF TOA ESTIMATION TECHNIQUES IN INDOOR MULTIPATH CHANNELS Xinong Li, Kaveh Pahlavan, and Jacques Beneat Cente fo Wiele Infomation Netwo Studies Electical and Compute Engineeing Depatment, Woceste
More informationDerangements. Brian Conrey and Tom Davis and March 23, 2000
Deangements Bian Coney and Tom Davis coney@aimath.og and tomdavis@eathlink.net http://www.geomete.og/mathcicles Mach 23, 2000 Seating Mixup Imagine that Yankee Stadium is completely sold out, but when
More informationImpact of bilateral filter parameters on medical image noise reduction and edge preservation
The Univesity of Toledo The Univesity of Toledo Digital Repositoy Theses and Dissetations 2009 Impact of bilateal filte paametes on medical image noise eduction and edge pesevation Michael D. Lekan Medical
More informationFuzzy ogic Impoved Static Synchonous Compensato to Contol Voltage of a Gid-connected Squiel Cage Induction Geneato Reza Shaifian Dastjedi 1, Ehsan Jafai 2, Fashad Kabii 3, ayam Ghaebi anah 4 1,2,3,4 Depatment
More informationAssignment 0/0 2 /0 8 /0 16 Version: 3.2a Last Updated: 9/20/ :29 PM Binary Ones Comp Twos Comp
* Dynamic Memoy *Big O Notation*Stacks *Exteme Pogamming*Selection Sot*Insetion Sot*Watefall Model Sting*Aays*AayList*Client Seve*Atificial Intelligence*Inheitance*Files*Video Games*Shot cicuit evaluation*
More informationProposal of Circuit Breaker Type Disconnector for Surge Protective Device
Poposal of Cicuit Beake Type Disconnecto fo Suge Potective Device MASAO SHIBAYAMA, HITOSHI KIJIMA Polytechnic Univesity 2-32-1 Ogawanishi, Kodaia, Tokyo, 187-0035 JAPAN hkijima@uitec.ac.jp Abstact: - A
More informationINVESTIGATION OF CLOSE-TO-WALL WIRELESS SENSOR DEPLOYMENT USING 2D FINITE-DIFFERENCE TIME-DOMAIN MODELLING. Y. Wu and I. J.
2 nd Intenational Confeence on Wieless Communications in Undegound and Confined Aeas August 25-27, 2008 Val-d O - Québec - Canada INVESTIGATION OF CLOSE-TO-WALL WIRELESS SENSOR DEPLOYMENT USING 2D FINITE-DIFFERENCE
More informationComparison Between Known Propagation Models Using Least Squares Tuning Algorithm on 5.8 GHz in Amazon Region Cities
106 Compaison Between Known Popagation Models Using Least Squaes Tuning Algoithm on 5.8 GHz in Amazon Region Cities Buno S. L. Casto, Mácio R. Pinheio, Gevásio P. S. Cavalcante Fedeal Univesity of Paá
More informationAnalysis of the Radiation Resistance and Gain of Full-Wave Dipole Antenna for Different Feeding Design
Jounal of lectomagnetic Analysis and Applications, 01, 4, 35-4 http://dx.doi.og/10.436/jemaa.01.46033 Published Online June 01 (http://www.scirp.og/jounal/jemaa) 35 Analysis of the Radiation Resistance
More informationOptimal Strategies in Jamming Resistant Uncoordinated Frequency Hopping Systems. Bingwen Zhang
Optimal Stategies in Jamming Resistant Uncoodinated Fequency Hopping Systems by Bingwen Zhang A Thesis Submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in patial fulfillment of the equiements
More informationUNCERTAINTY ESTIMATION OF SIZE-OF-SOURCE EFFECT MEASUREMENT FOR 650 NM RADIATION THERMOMETERS
XIX IMEKO Wold Congess Fundamental and Applied Metology Septembe 6 11, 29, Lisbon, Potugal UNCERTAINTY ESTIMATION OF SIZE-OF-SOURCE EFFECT MEASUREMENT FOR 65 NM RADIATION THERMOMETERS Fumihio Sakuma, Laina
More informationA New Method of VHF Antenna Gain Measurement Based on the Two-ray Interference Loss
7 nd Intenational Confeence on Atificial Intelligence and Engineeing Applications (AIEA 7) ISBN: 978--6595-485- A New Method of VH Antenna Gain Measuement Based on the Two-ay Intefeence Loss ZHIEI YANG,
More informationSynopsis of Technical Report: Designing and Specifying Aspheres for Manufacturability By Jay Kumler
OPTI 51 Synopsis (Gad Requiement #1) G. Desoches Synopsis of Technical Repot: Designing and Specifying Asphees fo Manufactuability By Jay Kumle Novembe 1, 007 Reviewed by: Gead Desoches Abstact Since asphees
More informationA Transmission Scheme for Continuous ARQ Protocols over Underwater Acoustic Channels
A Tansmission Scheme fo Continuous ARQ Potocols ove Undewate Acoustic Channels Mingsheng Gao 1, Wee-Seng Soh 1 and Meixia Tao 2 1 Dept. of Electical & Compute Engineeing, National Univesity of Singapoe,
More informationVariance? which variance? R squared effect size measures in simple mediation models
Vaiance? which vaiance? squaed effect size measues in simple mediation models M This is it? med di X de Heus, P. (01). squaed effect size measues and ovelap between diect and indiect effect in mediation
More informationStudy on Arc Envelope Grinding Process of Revolving Curved Surface Lingye Kong1, a,qiusheng Yan2,b,Yongliang Qiu1,c and Tengxiong Qiu1,d
nd Intenational Confeence on Machiney, Mateials Engineeing, Chemical Engineeing and iotechnology (MMECE 015 Study on Ac Envelope Ginding Pocess of Revolving Cuved Suface Lingye Kong1, a,qiusheng Yan,b,Yongliang
More informationIEEE Broadband Wireless Access Working Group < Modifications to the Feedback Methodologies in UL Sounding
Poject Title Date Submitted IEEE 802.16 Boadband Wieless Access Woking Goup Modifications to the Feedback Methodologies in UL Sounding 2008-01-14 Souce(s) Fed Vook, Jeff Zhuang,
More informationAnalyze Power Supply Rejection Ratio of LDO Regulator Based on Accurate Small Signal Model
Poceedings of the Intenational Confeence on Electonics and Softwae Science, Takaatsu, Japan, 05 Analyze Powe Supply ejection atio of LDO egulato Based on Accuate Sall Signal Model Po-Yu Kuo*, Gang-Zhi
More informationE /11/2018 AA
B-3 CU 1 CU 2 CU 3 EVISIONS BY GFI,WP GFI AHU 1 AHU 2 AHU 3 GFI,WP MECH. WOMEN'S 6 MEN'S 7 OFFICE 3 8 TEACE 14 OFFICE 4 9 TC 10 PNL 'A' PNL 'B' A-31 GFI A-33 F A-30 A-28 OFFICE 5 11 GFI A-35 OFFICE 2 5
More informationChannel Frequency Optimization of a Future AMSU-B-Like Millimeter-Wave Radiometer for Integrated Water Vapor Retrieval in polar regions
Poceedings of the 4th WSEAS Intenational Confeence on REMOTE SENSING (REMOTE'8) Channel Fequency Optimization of a Futue AMSU-B-Like Millimete-Wave Radiomete fo Integated Wate Vapo Retieval in pola egions
More informationRandomized self-assembly
Title: Randomized self-assembly Name: David Doty Affil./Add. Califonia Institute of Technology, Pasadena, CA, USA. Suoted by NSF gants CCF-974, CCF- 6589, and 7694. Keywods: andomized; tile comlexity;
More informationExperiments with the HoloEye LCD spatial light modulator
Expeiments with the HoloEye LCD spatial light modulato HoloEye model LC00 spatial light modulato The HoloEye (http://www.holoeye.com/spatial_light_modulato_lc_00.html) LC 00 Spatial Light Modulato (SLM)
More informationA Gain Measurement in the Liquid Based on Friis Transmission Formula in the Near-Field Region
A Gain Measuement in the Liquid Based on Fiis Tansmission Fomula in the Nea-Field Region # Takuhei Akagawa 1, Nozomu Ishii 2,3, Ken-ichi Sato 4, Lia Hamada 3 and Soichi Watanabe 3 1 Gaduate School of Science
More information51. IWK Internationales Wissenschaftliches Kolloquium International Scientific Colloquium
51. IWK Intenationales Wissenschaftliches Kolloquium Intenational Scientific Colloquium PROCEEDINGS 11-15 Septembe 26 FACULTY OF ELECTRICAL ENGINEERING AND INFORMATION SCIENCE INFORMATION TECHNOLOGY AND
More informationCyclic Constellation Mapping Method for PAPR Reduction in OFDM system
2013 8th Intenational Confeence on Communications and Netwoking in China (CHINACOM) Cyclic Constellation Mapping Method fo PAPR Reduction in OFDM system Yong Cheng, Jianhua Ge, Jun Hou, and Fengkui Gong
More informationDemosaicking using Adaptive Bilateral Filters
Demosaicking using Adaptive Bilateal Filtes Ekine Akuiyibo Timothy Atobatele EE 362, Winte 2006 0. Abstact Digital cameas sample the continuous spectum using an aay of colo filtes such that each pixel
More informationBinary Systematic Network Coding for Progressive Packet Decoding
Binay Systematic etwok Coding fo Pogessive Packet Decoding Andew L. Jones, Ioannis Chatzigeogiou and Andea Tassi School of Computing and Communications, Lancaste Univesity, United Kingdom Email: {a.jones2,
More information