A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks
|
|
- Bryce Lloyd
- 6 years ago
- Views:
Transcription
1 A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne Amiens Frane Jean Frédéri Myoupo Department of Computer Siene University of Piardie Jules Verne Amiens Frane Abstrat The partial sorting problem is to sort the k smallest elements of a given set of n integers suh that 1 <k <n in desending order. The algorithms that exist in the literature for the partial sorting in wireless networking solutions are based on single-hop model. In this paper we onsider a multi_hop sensor network. Initially we partition the network into several levels by using the method of Gerla and Tsai. We onsider that eah node has a data item and two linked lists. One the network is partitioned with multiple levels eah luster runs the algorithm MaxCluster seeking the maximum element in that luster. Then the algorithm Partial_Sorting finds separators (separators are identified by the algorithm MaxCluster) and helps to identify the remaining elements of the list to be sorted. We give the upper bound of our algorithm in terms of broadast rounds. We also extend our approah to the ase where eah node has multiple data items instead of a single datum. Finally Experimental results highlight our approah Keywords- Sensor Networks; Cluster head; Clustering; Partial Sort; Wireless ommuniation. I. INTRODUCTION The sorting problem has been extensively studied for deades. They proposed different tehniques to solve this problem. Most of these tehniques fous on how to sort a set of n elements as quikly as possible. Hoare suggested in the early 60's quiksort. Until reently Martinz Shiau and Yang have studied how to sort the k smallest elements of a given set of n elements as 1 <k <n. MARTINZ showed that this problem is known as a partial ordering. Today due to development of personal networks the wireless ommuniation (WN) has beome more interesting and attrative. Single-hop model is a omplete graph and onsists of n stations where eah station listens to all the others. Eah station in this model an ommuniate with eah other via a ommon hannel only. If two or more stations want to send messages simultaneously sending a onflit ours. In this model we assume that eah station has the ability to detet the onflit. When a onflit is deteted the pattern of resolution being put in plae. A. Related work Quiksort is one of the most influening algorithms in sorting. It has been studied and hosen to appear among the best ten algorithms in the 20 th entury [7]. The average number of omparisons for the quik sorting is O(nlogn+ O(n))[7]. One of the variants of quik sorting alled median-of-three runs in (12/7nlogn+ O(n)) [ ]. The amelioration of 2n to 12/7n is proved by Chern and Hwang [3] who disussed the generalized quiksort. Martinez [9] has reently introdued partial sorting. The problem is not the sorting of n elements but rather seleting the smallest k elements among n elements 1 < k < n. Martinez [9]. Now the question is how to resolve the partial sorting problem when 1 < k <n. Martinez [9] has proposed an algorithm alled partial quiksort to solve the partial sorting. Shiau and Yang [11] also proposed another algorithm generalization of partial sorting for resolving the same problem. Both two algorithms were based on Quiksort and some of their results are almost the same. The main differene between the two papers is the original funtion and the methods of analysis they use. The method in [7] onsists of seleting the j -th element of a file ontaining n elements. Prondinger [11] derives an algorithm to selet the k elements j 1 -th j 2 - th j k -th. It may also resolve the partial sorting problem if we let k seleted elements be the k smaller elements. Martinez [9] mentioned that his algorithm an resolve the partial sorting problem but with two onstraints. The first onstraint is that k must be large enough. The author does not mention what value of k is large enough. The seond onstraint is that the n elements must be treated offline. Furthermore Sedgewik and Flajolet [13] show that the standard deviation the
2 number of omparisons used by Quiksort is 0.6n. This means that the auray of performane predition is not very good and need to be further disussed. The first onstraint means that some algorithm better results than the algorithm of Martinez [9] when k is not big enough. The extreme ase is when k = 1. Of Clearly resolution of this ase the smallest element seleted by the algorithm is the best and it will take (n- 1) omparisons. The algorithm of Martinez [9] needs 2H n 2n omparisons where H n is harmoni number. The two algorithms have less seletion good results of the algorithm when k = 1. How quikly an we sort the two smaller elements of set n elements? A simple method is by exeuting the algorithm that allows the smallest elements fall twie. The seond iteration will hoose the seond smaller element starting from (n-1) of remaining elements. The time of exeution of the method of seletion is n to selet the smallest n elements in a set of n elements. Generally this method for researhing the k smaller elements among n elements needs 1 [( n 1) + ( n k )] k 2 omparisons. It proves that partial sorting loses its effiieny with respet to Partial Quiksort when k>=3. One an think that the algorithm of Martinez [7] and the algorithm of Shiau and Yang [11] may take leadership position for k>=3 on the traditional model. It is not the ase: Shyau-Horng Shiau has proposed an algorithm for resolving the partial sorting problem online. The algorithm outperforms both algorithms and assumes the position of leader k =1 with 3 k = n omparisons. The algorithm is an 5 adaptation of sorting insertion and an be treated online. Some sorting algorithms for single hop wireless networks appeared in the literature [ ]. In [10] a wireless network on p station is onsidered to sort n data items using k hannels k<p. Their algorithm runs in n p O ( n ) broadast rounds provided that k k p k. 2 Shiau et al [14] proposed an algorithm for partial sorting in single up network with the number of slot time bounded by 23 6 where k is the number of hannels. k + 5 ln( n ( k 1 )) B. Main ontribution This paper proposes an algorithm for solving the partial sorting problem (sorting k the smallest elements in a set of n elements) in wireless multi-hop sensor networks. Initially we onsider that eah node in the network has one and only one data. One we sueed in solving the 7 6 problem we proposed a generalization of our approah to solve the partial sorting problem in the ase where a node an have one or more data items. Our approah does not need to have omplex nodes: eah node is apable of turning a sorting algorithm in order to loally selet the largest value in the list it holds. More preisely we show the number of broadast rounds for a partial sorting problem annot exeed O( n) + S * Pr * max * max log( max min where n is the number of sensors in the network S is the st of separators Pr is the number of layers obtained after the lustering proess C max is the luster of maximum size among all lusters of the different layers. C min the luster of minimum size among all lusters of the different layers The rest of paper is organized as follows: the following Setion presents our approah in the ase where eah node has a single data. Setion 3 is a detailed desription for the generalization for our approah for the ase when one node has multiple data s. Setion 4 presents a simulation for our approahes and finally a onlusion to our paper. II. PARTIAL SORITNG ALGORITHM ON THE MODEL MULTI-HOP After the network lustering the method onsists for eah station to send the value it ontains to the lusterhead whih is its leader. One the lusterhead reeives all messages it seeks the maximum among all the reeived elements. We will use the notation < x 0 x 1 xt > to denote a linked list where x t is the head of the list. Let us suppose L 1 = < x 0 x 1 xt > and L 2 = < y 0 y 1 y t > the notation < L 1 L 2 > represents onatenation of L 1 and L 2 whih is < x 0...x t y 0 y t >. In the desription of our algorithm we also use the term data elements that represents the data given by the station. A. Clustering algorithm We use the algorithm Gerla &Tsai [5] for the hierarhial lustering of our network. This algorithm onsists in finding a set of interonneted lusters. More preisely the topology of the system is separated into sattered partitions. One the network is partitioned we repeat the proess until we find a single luster that is named the Super Clusterhead. The deision is based on data held by the nodes: we onsider that the node holds
3 the smallest value and prioritize the most adapted for this task to be lusterhead. An interesting point in this algorithm is that the luster head nodes and the ordinary nodes all do the same task when working in the onstrution of luster. Thus they spend as muh energy as eah other. The omplexity of this algorithm is O( V whih V all nodes of the graph represent the network. B. Assumptions Let M be a set of data items assoiated with a network whih onsist of a group of sensors that an ommuniate with eah other via a ommuniation hannel. M is also assoiated with a graph where verties are the sensors. In this direted graph there is an ar from u to v if u an send a message toward v. We assume also that the n nodes are deployed; eah nod has a data and two linked lists. We onsider the following notations: - M: set of data assoiated with a sensor network; - UC ij : The tree partitioning of the network M using the algorithm of Gerla and Tsai; - P r : The depth of tree lustering; - Node v: Eah node in progressive L' g and L g with L' g ontains the values hold by their neighbors in their luster L g list that ontains the most great value in the luster - C ij : The luster j in layer i; - C ij : The size of the luster j in layer i (number of nodes); - x ij k : Evaluate the hold by the node k in luster j layer i; - x ij : Evaluate the hold by the lusterhead of the luster j in layer i; - k : Represents respetively lusterheads and ordinary nodes; - L : The hained list that detains the largest values of the lusterhead of node luster j in layer i; - L g = k: Chained list named list of separators whih ontains the largest values of eah luster that is part of the tree portioning. - L m : Chained list named list of separators whih ontains the largest values of eah luster that is part of the tree partitioning. III. DESCRIPTION OF OUR ALGORITHM A. Algorithm MaxCluster i.- Step 1: Multi-level lustering We use Gerla & Tsai lustering algorithm to yield a multi-layer luster organization: UC ij with C ij in the luster j in layer i. As mentioned above it is obvious that eah luster has a leader named lusterhead. ii.- Step 2: Finding the greatest data item of eah luster. The algorithm MaxCluster is a method of finding the maximum: it onsists for an ordinary node in a luster to send its value to its luster head. One it reeives all data items finds the greatest data item among all those it reeived. The luster heads work in parallel in this step. Step 3: Conatenation method of the data in the hained list of luster head of the luster using the algorithm MaxCluster that is presented in algorithm 1 below. Algorithm 1: MaxCluster 1. Input: C ij where C ij is luster j in layer i. 2. Output: Chained list L g the list of separators 3. L k ij hained list of node k of luster j in layer i x max =NULL L g = L p =NULL P r the depth of the tree 4. For i=1 Until P r { 6. For j=1 Until q i where q i is the number of luster in layer i. 7. { 8. For l=1 Until C ij 9. { 10. eah sensor in C ij sends its value to its luster head l 11. L =< L x ij > 12. If x l ij > xmax 13. l x max : = x ij 14. } 15. L : = Quiksort( L ) 16. ' ' L g : =< ( L g xmax > 17. } 18. } 19. ' L g : = Quiksort( L g ) 20. Return L ' g
4 B. Partial soritng algorithm For distint n elements the partial sort problem is to find the first k k 1 the most k greatest elements in the non-inreasing order. Our partial sorting algorithm may be represented as a funtion of reursive researh: ( L g )= Sort-partial (M k) where L g is the hained list that stores the sorting sequene. is the number of elements in L g and M represents a set of data items (sensors network). In our algorithm eah sensor has exatly one data item and maintains two hained lists as mention above. Finally we will get a hained sorting list L g ontaining the first greater k elements. For any set of data items there exists at least one sensor network that is its representation For our partial sorting algorithm we use the algorithm MaxCluster that is a method of researhing the maximum. A set of elements are onsidered as separators to bring the data items remaining in the layers properly. Then the lists of separators will be deomposed in the form of intervals. The reursive funtion is based on these intervals in order to identify the remaining elements whih will be in the sorted list. The algorithm an be represented as a reursive funtion of researh framed through interval. Our algorithm of partial sort is depited in the algorithm 2 Algorithm 2: Partial Sort (L g )=Partial-Sort(M K) 1: Input: M the set of items to sort (sensor network) 2: Output: hained list L g that ontains the k greatest Values 3: Step 1: Hierarhial lustering of the network 4: Step 2: Algorithm MaxCluster 5: Step 5: L m =MaxCluster L m =<x 1 x 2 x t-1 xt > with x i-1 x i 1 i t. 6: Set L g =NULL 7: For i=0 Until L g1( 1) 8: { 9: L g =< xt Lg > 10: L g 11: Return 12: Else 13: { 14: If ( x < L [ i] < x ) pr t 1 g1( p 1) t r 15: L =< L [ i] L > m g1 ( pr 1) 16: } 17: } 18: Return ( L g ) m Theorem: The number of broadast rounds required by our partial sorting algorithm in a multi hop Wireless sensors networks annot exeed O( n) + S * Pr * max * max log( max min Where n is the number of sensors in the network S is the set of separators Pr is the number of layers obtained after the lustering proess. C max is the luster of maximum size among all lusters of the different layers. C min is the luster of minimum size among all lusters of the different layers. Proof: It is well known that the omplexity Gerla and Tsai [5] lustering algorithm in terms of broadast rounds is O (V ) V is the set of sensors of the original network. Sine we set n as the number of sensors in the network we have learly O ( V ) = n (1) In our partial sorting algorithm we have the following symbols: Pr :The number of layer in the lustering proess ; C : The size of luster i in layer j ; ij Also note that our partial sorting algorithm uses the quik sort tehnique in the algorithm MAxCluster to identify the greatest element in eah luster. The lusters in all layers run MaxCluster in parallel. Thus the omplexity of this algorithm is a funtion of luster size and is given by the following formula: ij log( ) max ij max for the lusters in layer j. Note C max the luster of maximum size among all lusters of the different layers. Thus the omplexity of MaxCluster is dominated by max log( max We use the following strategy to derive the number of broadast rounds of our partial sorting algorithm : ij max : The size of the luster that ontains the largest number of elements from all the lusters in layer j ; : The size of the luster that ontains the ij min smallest number of elements from all the lusters in layer j; : The largest number of lusters in layer j ; ij min One an easily dedue that the largest number of rounds in the layer j is: ij max * ij max log( ij max ) ij min
5 Note C min the luster of minimum size among all lusters of the different layers. Thus the largest number of broadast rounds in any layer is dominated by max * max log( max min Sine P r is the number of layers after lustering we an easily dedue that the total number of broadast rounds after lustering annot exeed P r max * max log( max (2) min Our partial sorting approah uses a list of separator for the onstrution of intervals of searh: let S be the set of separators and S the number elements in this set. Aording to (1) and (2) we an onlude that the number of rounds of our sorting partial algorithm annot exeed: O( v) + S * Pr * max * max log( max min C. An example The input file ontains 20 elements whih are { }. Let us suppose we want to sort the largest first 9 elements. Let us also onsider the example of topology shown in Figure 1 for a good understanding of the onstrution method. Subsequent to partitioning to several level we obtain Figure 2 where we find a tree omposed of a set of lustering that are: {1 0 2} { } { } { } { } { } { } { } {1 2 5} the index represents the layer in the tree partition. From here it is easy to set up that any node at the end of the algorithm finally got to take but single luster. Indeed the identifier of the luster to whih the node is reattahed is either holds the value of the node itself or the greatest value holds by its neighbors. It is also important to note that with this algorithm even in a luster two nodes are at most at a distane of 2 hops from eah other. For this it is enough to onsider several nodes of the same luster. Eah node must be able to diretly reah the Clusterhead of his luster. Thus two nodes of the same luster must be at distane of at most 2 from one of the other. Fig. 1. Network that represent the data set. As already mentioned above our algorithm proeeds through the hierarhial partitioning of the network whih orresponds to the whole data elements. The following figure shows the results of the hierarhial lustering applied to the network whih represents the whole data s. Fig. 2. The hierarhial tree orresponds to the data set. For example the input file ontains 20 elements whih are { }. Let us suppose we want to sort the first 9 greatest elements. The whole proess is shown in Fig. 3. After the exeution of the algorithm MaxCluster we find the greater elements whih are 20 and the list separator omposed is as follows: (( ). One have the separator list we an easily onstrut intervals for the rest of elements to be sorted. These intervals are: [17 20] [13 17] [11 13] [9 11] and [2 9]. The algorithm of partial sorting is alled in a reursive manner with eah of these preedent intervals. For the first interval we find the two elements that will be injeted into the set ontaining the sorted sequene. The partial sorting algorithm stops one the size of the whole stuff L g = k.
6 Fig. 3. An example of partial sorting algorithm with 20 elements. IV. GENERALIZATION OF OUR PARTIAL SORTING ALGORITHM ON THE MODEL MULTI-HOP In this setion we genralize our algorithm the general soritng problem on the multi-hop. For this we onsider that the sensors the network an ontain multiple data items. These data items must be sorted in a linked list. So we end up with a system whih is omposed of p sensors in whih the a entire sequene of n elements suh that p < n is stored. For this generalization we model our network sensors suh that eah node ontains three-linked list of data items. These lists are L L' g and L g. L is the list of data items ontained in their lusters and L g is the list that ontains the greatest data items in the lusters. V. SIMULATION RESULTS To evaluate the auray of our algorithms ompared to the results of the theoretial analysis that exists in the literature for sort partial we perform simulations of our approah. Our algorithm has been exeuted on the platform OMNET with a network of sensors. The sensors are distributed in a uniform manner. Fig. 4 show the simulation of our approah to sort partial a set ontaining 1000 data eah sensor has one and only data item. For the generalized approah for sort partial we have a variable p that represents the number of data items held by a sensor. Fig 5 show the results for p=10 p=20 and p=40. The algorithm of generalization ( L gg ) is based on our algorithm for the lassial sorting problem part. It assumes that eah node in the network ontains one and only one data item. The algorithm for generalized sorting problem uses the partial searh method developed earlier in MaxCluster. We an desribe the stages of our algorithm as follows: STEP 1: Hierarhial Clustering the networks by using algorithm Gerla & Tsai; STEP 2: The partial sorting algorithm ( L gg ) = ( L g )= Partial-sorting (M k). Fig. 4. Simulation performane of our sort partial approah with 1000 elements.
7 RE FE R E NC E S Fig. 5. Simulation performane of our generalized sort partial approah with 1000 elements and p=10 p=20 and p=40. The simulation results show that our algorithms math the theoretial bound. The simulations also show that when we need to sort the first k largest elements not all elements of the set our approahes an be good hoies. VI. CONCLUSION The main motivation of this work is to give a solution of the partial sorting problem in multi-hop sensor networks. Our algorithms are the based on multi-layer lustering of the sensor network based on the algorithm of Gerla & Tsai. The first approah resolves the problem of partial sorting with a number of broadast rounds not exeeding O( n) + S * Pr * max * max log( max min where n is the number of sensors in the network S is the st of separators Pr is the number of layers obtained after the lustering proess C max is the luster of maximum size among all lusters of the different layers. C min the luster of minimum size among all lusters of the different layers The seond algorithm provides a generalization of first approah to the lassial sorting problem. This generalization for the partial sorting problem onsists in assuming that eah node that is part of the network may ontain several data items. [1] J. L. Bordim Koji Nakano and Hong Shen Sorting on Single-Channel Wireless Sensor Networks. Proeedings of the International Symposium on Parallel Arhitetures Algorithms and Networks (ISPAN.02). P [2] H. H. Chern and H. K. Hwang Phase hanges in random m-ary searh trees and generalized quiksortin Phase hanges in random m-ary searh trees and generalized quiksort Random Strutures and Algorithms Vol. 19 pp [3] H. H. Chern and H. K. Hwang Transitional behaviors of the average ost of quiksort with median-of-(2t+1) In Algorithmia Vol. 29 pp [4] R. Dehter and L. Kleinrok. Broaast ommuniation and distributed algorithms IEEE Transations on Computers C [5] M. Gerla and J T.C. Tsai. A Multiluster Mobile Multimedia Radio Network Wireless Networks vol. 1 no.3 p [6] C. A.. Hoare Find (algorithm 65). In Communiations of the ACM Vol. 4 pp [7] J. JaJa A perspetive on quiksortin Computing in Siene and Engineering2000. [8] J. M. Marberg and E. Gafni. Sorting and seletion in multi-hannel broadast neworks ICPP pp [9] C. Martinez Partial quiksortin Pro. of the 6th ACM- SIAM Workshop on Algorithm Engineering and Experiments and the 1st ACM-SIAM Workshop on Analyti Algorithmis and Combinatoris pp [10] K. Nakano S. Olariu and J. L. Shwing Broadast- Effiient protools for Mobile Radio Networks. IEEE T.P.DS. vol.10 pp [11] H. Prondinger Multiple quikselet - hoares nd algorithm for several elements In Information Proessing Letters Vol. 56 No. 3 pp [12] R. Sedgewik Algorithms In C. USA : Addison-Wesley Publishing Company 3 ed [13] R. Sedgewik and P. Flajolet An Introdution to the Analysis of Algorithms. In USA : Addison-Wesley Publishing Company1996. [14] Shyue-Horng Shiau and Chang-Biau Yang. Generalization of Sorting in Single HopWireless Networks. IEICE Trans. Inf. annd Syst. Vol. E89 D no.4 p [15] C. B. Yang R. C. T. Lee and W..-T. Chen. Conflit-free sorting algorithms under single and multi-hannel broadast ommuniation models. ICCI LNCS 497 P
A Novel Validity Index for Determination of the Optimal Number of Clusters
IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers
More informationA Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks
A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,
More informationA Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks
International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationFlow Demands Oriented Node Placement in Multi-Hop Wireless Networks
Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless
More informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationAlgorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking
Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationCalculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem
Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion
More informationOutline: Software Design
Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More informationThis fact makes it difficult to evaluate the cost function to be minimized
RSOURC LLOCTION N SSINMNT In the resoure alloation step the amount of resoures required to exeute the different types of proesses is determined. We will refer to the time interval during whih a proess
More informationFacility Location: Distributed Approximation
Faility Loation: Distributed Approximation Thomas Mosibroda Roger Wattenhofer Distributed Computing Group PODC 2005 Where to plae ahes in the Internet? A distributed appliation that has to dynamially plae
More informationFuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis
Journal of Computer Siene 4 (): 9-97, 008 ISSN 549-3636 008 Siene Publiations Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis Deepti Gaur, Aditya Shastri and Ranjit Biswas Department of Computer
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationCluster-Based Cumulative Ensembles
Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,
More informationmahines. HBSP enhanes the appliability of the BSP model by inorporating parameters that reet the relative speeds of the heterogeneous omputing omponen
The Heterogeneous Bulk Synhronous Parallel Model Tiani L. Williams and Rebea J. Parsons Shool of Computer Siene University of Central Florida Orlando, FL 32816-2362 fwilliams,rebeag@s.uf.edu Abstrat. Trends
More informationSequential Incremental-Value Auctions
Sequential Inremental-Value Autions Xiaoming Zheng and Sven Koenig Department of Computer Siene University of Southern California Los Angeles, CA 90089-0781 {xiaominz,skoenig}@us.edu Abstrat We study the
More informationCross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer
Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based
More informationDETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT
DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT 1 ZHANGGUO TANG, 2 HUANZHOU LI, 3 MINGQUAN ZHONG, 4 JIAN ZHANG 1 Institute of Computer Network and Communiation Tehnology,
More informationImplementing Load-Balanced Switches With Fat-Tree Networks
Implementing Load-Balaned Swithes With Fat-Tree Networks Hung-Shih Chueh, Ching-Min Lien, Cheng-Shang Chang, Jay Cheng, and Duan-Shin Lee Department of Eletrial Engineering & Institute of Communiations
More informationPartial Character Decoding for Improved Regular Expression Matching in FPGAs
Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia
More informationDetection and Recognition of Non-Occluded Objects using Signature Map
6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,
More informationAbstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.
Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,
More informationAutomatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)
Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University
More informationOne Against One or One Against All : Which One is Better for Handwriting Recognition with SVMs?
One Against One or One Against All : Whih One is Better for Handwriting Reognition with SVMs? Jonathan Milgram, Mohamed Cheriet, Robert Sabourin To ite this version: Jonathan Milgram, Mohamed Cheriet,
More information1 The Knuth-Morris-Pratt Algorithm
5-45/65: Design & Analysis of Algorithms September 26, 26 Leture #9: String Mathing last hanged: September 26, 27 There s an entire field dediated to solving problems on strings. The book Algorithms on
More informationThe Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines
The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer
More informationExploring the Commonality in Feature Modeling Notations
Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om
More informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
More informationarxiv: v1 [cs.db] 13 Sep 2017
An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution
More informationSystem-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications
System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis
More informationMultiple-Criteria Decision Analysis: A Novel Rank Aggregation Method
3537 Multiple-Criteria Deision Analysis: A Novel Rank Aggregation Method Derya Yiltas-Kaplan Department of Computer Engineering, Istanbul University, 34320, Avilar, Istanbul, Turkey Email: dyiltas@ istanbul.edu.tr
More informationImproved flooding of broadcast messages using extended multipoint relaying
Improved flooding of broadast messages using extended multipoint relaying Pere Montolio Aranda a, Joaquin Garia-Alfaro a,b, David Megías a a Universitat Oberta de Catalunya, Estudis d Informàtia, Mulimèdia
More informationAn Alternative Approach to the Fuzzifier in Fuzzy Clustering to Obtain Better Clustering Results
An Alternative Approah to the Fuzziier in Fuzzy Clustering to Obtain Better Clustering Results Frank Klawonn Department o Computer Siene University o Applied Sienes BS/WF Salzdahlumer Str. 46/48 D-38302
More informationNew Fuzzy Object Segmentation Algorithm for Video Sequences *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 521-537 (2008) New Fuzzy Obet Segmentation Algorithm for Video Sequenes * KUO-LIANG CHUNG, SHIH-WEI YU, HSUEH-JU YEH, YONG-HUAI HUANG AND TA-JEN YAO Department
More informationAnalysis of input and output configurations for use in four-valued CCD programmable logic arrays
nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,
More informationImproved Circuit-to-CNF Transformation for SAT-based ATPG
Improved Ciruit-to-CNF Transformation for SAT-based ATPG Daniel Tille 1 René Krenz-Bååth 2 Juergen Shloeffel 2 Rolf Drehsler 1 1 Institute of Computer Siene, University of Bremen, 28359 Bremen, Germany
More informationHigh-level synthesis under I/O Timing and Memory constraints
Highlevel synthesis under I/O Timing and Memory onstraints Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn, Eri Martin To ite this version: Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn,
More informationEstablishing Secure Ethernet LANs Using Intelligent Switching Hubs in Internet Environments
Establishing Seure Ethernet LANs Using Intelligent Swithing Hubs in Internet Environments WOEIJIUNN TSAUR AND SHIJINN HORNG Department of Eletrial Engineering, National Taiwan University of Siene and Tehnology,
More informationUsing Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks
Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Ho Wireless Networks Giorgio Quer, Federio Librino, Lua Canzian, Leonardo Badia, Mihele Zorzi, University of California San Diego La
More informationAn Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index
IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive
More informationWhat are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study
What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The
More informationDr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq
Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using
More informationLearning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract
CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and
More informationLayout Compliance for Triple Patterning Lithography: An Iterative Approach
Layout Compliane for Triple Patterning Lithography: An Iterative Approah Bei Yu, Gilda Garreton, David Z. Pan ECE Dept. University of Texas at Austin, Austin, TX, USA Orale Las, Orale Corporation, Redwood
More informationThe Implementation of RRTs for a Remote-Controlled Mobile Robot
ICCAS5 June -5, KINEX, Gyeonggi-Do, Korea he Implementation of RRs for a Remote-Controlled Mobile Robot Chi-Won Roh*, Woo-Sub Lee **, Sung-Chul Kang *** and Kwang-Won Lee **** * Intelligent Robotis Researh
More informationDynamic Algorithms Multiple Choice Test
3226 Dynami Algorithms Multiple Choie Test Sample test: only 8 questions 32 minutes (Real test has 30 questions 120 minutes) Årskort Name Eah of the following 8 questions has 4 possible answers of whih
More informationVideo Data and Sonar Data: Real World Data Fusion Example
14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu
More informationAn Efficient and Scalable Approach to CNN Queries in a Road Network
An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,
More informationCluster-based Cooperative Communication with Network Coding in Wireless Networks
Cluster-based Cooperative Communiation with Network Coding in Wireless Networks Zygmunt J. Haas Shool of Eletrial and Computer Engineering Cornell University Ithaa, NY 4850, U.S.A. Email: haas@ee.ornell.edu
More informationParametric Abstract Domains for Shape Analysis
Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University
More informationGraph-Based vs Depth-Based Data Representation for Multiview Images
Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:
More informationManipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday
Eletroni Communiations of the EASST Volume 26 (2010) Manipulation of Graphs, Algebras and Pitures Essays Dediated to Hans-Jörg Kreowski on the Oasion of His 60th Birthday Autonomous Units for Solving the
More informationCluster Centric Fuzzy Modeling
10.1109/TFUZZ.014.300134, IEEE Transations on Fuzzy Systems TFS-013-0379.R1 1 Cluster Centri Fuzzy Modeling Witold Pedryz, Fellow, IEEE, and Hesam Izakian, Student Member, IEEE Abstrat In this study, we
More informationSemi-Supervised Affinity Propagation with Instance-Level Constraints
Semi-Supervised Affinity Propagation with Instane-Level Constraints Inmar E. Givoni, Brendan J. Frey Probabilisti and Statistial Inferene Group University of Toronto 10 King s College Road, Toronto, Ontario,
More informationCooperative Coverage Extension for Relay-Union Networks
1.119/TPDS.214.23821, IEEE Transations on Parallel and Distributed Systems IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1 Cooperative Coverage Extension for Relay-Union Networks Yong Cui, Xiao
More informationBatch Auditing for Multiclient Data in Multicloud Storage
Advaned Siene and Tehnology Letters, pp.67-73 http://dx.doi.org/0.4257/astl.204.50. Bath Auditing for Multilient Data in Multiloud Storage Zhihua Xia, Xinhui Wang, Xingming Sun, Yafeng Zhu, Peng Ji and
More informationA Multi-Head Clustering Algorithm in Vehicular Ad Hoc Networks
International Journal of Computer Theory and Engineering, Vol. 5, No. 2, April 213 A Multi-Head Clustering Algorithm in Vehiular Ad Ho Networks Shou-Chih Lo, Yi-Jen Lin, and Jhih-Siao Gao Abstrat Clustering
More information1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0.
C HPTER 1 SETS I. DEFINITION OF SET We begin our study of probability with the disussion of the basi onept of set. We assume that there is a ommon understanding of what is meant by the notion of a olletion
More informationPath Sharing and Predicate Evaluation for High-Performance XML Filtering*
Path Sharing and Prediate Evaluation for High-Performane XML Filtering Yanlei Diao, Mihael J. Franklin, Hao Zhang, Peter Fisher EECS, University of California, Berkeley {diaoyl, franklin, nhz, fisherp}@s.erkeley.edu
More information2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media,
2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any urrent or future media, inluding reprinting/republishing this material for advertising
More informationDirected Rectangle-Visibility Graphs have. Abstract. Visibility representations of graphs map vertices to sets in Euclidean space and
Direted Retangle-Visibility Graphs have Unbounded Dimension Kathleen Romanik DIMACS Center for Disrete Mathematis and Theoretial Computer Siene Rutgers, The State University of New Jersey P.O. Box 1179,
More informationTest Case Generation from UML State Machines
Test Case Generation from UML State Mahines Dirk Seifert To ite this version: Dirk Seifert. Test Case Generation from UML State Mahines. [Researh Report] 2008. HAL Id: inria-00268864
More informationSparse Certificates for 2-Connectivity in Directed Graphs
Sparse Certifiates for 2-Connetivity in Direted Graphs Loukas Georgiadis Giuseppe F. Italiano Aikaterini Karanasiou Charis Papadopoulos Nikos Parotsidis Abstrat Motivated by the emergene of large-sale
More informationInterconnection Styles
Interonnetion tyles oftware Design Following the Export (erver) tyle 2 M1 M4 M5 4 M3 M6 1 3 oftware Design Following the Export (Client) tyle e 2 e M1 M4 M5 4 M3 M6 1 e 3 oftware Design Following the Export
More informationMulti-Channel Wireless Networks: Capacity and Protocols
Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:
More informationChapter 2: Introduction to Maple V
Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard
More informationApproximate logic synthesis for error tolerant applications
Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu
More information13.1 Numerical Evaluation of Integrals Over One Dimension
13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied
More information3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?
3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg
More informationAlgorithmica 2002 Springer-Verlag New York Inc.
Algorithmia (2002) 33: 183 200 DOI: 10.1007/s00453-001-0109-4 Algorithmia 2002 Springer-Verlag New York In. Effiient Parallel Graph Algorithms for Coarse-Grained Multiomputers and BSP 1 F. Dehne, 2 A.
More informationSelf-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization
Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in
More informationAdapting K-Medians to Generate Normalized Cluster Centers
Adapting -Medians to Generate Normalized Cluster Centers Benamin J. Anderson, Deborah S. Gross, David R. Musiant Anna M. Ritz, Thomas G. Smith, Leah E. Steinberg Carleton College andersbe@gmail.om, {dgross,
More informationTMIX: Temporal Model for Indexing XML Documents
TMIX: Temporal Model for Indexing XML Douments Rasha Bin-Thalab Department of Information System Faulty of omputers and Information Cairo University, Egypt azi_z30@yahoo.om Neamat El-Tazi Department of
More informationTaming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
Taming Deentralized PMDPs: Towards ffiient Poliy omputation for Multiagent Settings. Nair and M. Tambe omputer Siene Dept. University of Southern alifornia Los Angeles A 90089 nair,tambe @us.edu M. Yokoo
More informationColouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G.
Colouring ontat graphs of squares and retilinear polygons de Berg, M.T.; Markovi, A.; Woeginger, G. Published in: nd European Workshop on Computational Geometry (EuroCG 06), 0 Marh - April, Lugano, Switzerland
More informationthe data. Structured Principal Component Analysis (SPCA)
Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving
More informationAcoustic Links. Maximizing Channel Utilization for Underwater
Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it
More informationTime delay estimation of reverberant meeting speech: on the use of multichannel linear prediction
University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel
More informationRANGE DOPPLER ALGORITHM FOR BISTATIC SAR PROCESSING BASED ON THE IMPROVED LOFFELD S BISTATIC FORMULA
Progress In Eletromagnetis Researh Letters, Vol. 27, 161 169, 2011 RANGE DOPPLER ALGORITHM FOR ISTATIC SAR PROCESSING ASED ON THE IMPROVED LOFFELD S ISTATIC FORMULA X. Wang 1, * and D. Y. Zhu 2 1 Nanjing
More information8 Instruction Selection
8 Instrution Seletion The IR ode instrutions were designed to do exatly one operation: load/store, add, subtrat, jump, et. The mahine instrutions of a real CPU often perform several of these primitive
More informationHIGHER ORDER full-wave three-dimensional (3-D) large-domain techniques in
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 21, no. 2, August 2008, 209-220 Comparison of Higher Order FEM and MoM/SIE Approahes in Analyses of Closed- and Open-Region Eletromagneti Problems Milan
More informationCapturing Large Intra-class Variations of Biometric Data by Template Co-updating
Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University
More informationRAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments
21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,
More informationOn Optimal Total Cost and Optimal Order Quantity for Fuzzy Inventory Model without Shortage
International Journal of Fuzzy Mathemat and Systems. ISSN 48-9940 Volume 4, Numer (014, pp. 193-01 Researh India Puliations http://www.ripuliation.om On Optimal Total Cost and Optimal Order Quantity for
More informationMulti-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks
Multi-hop Fast Conflit Resolution Algorithm for Ad Ho Networks Shengwei Wang 1, Jun Liu 2,*, Wei Cai 2, Minghao Yin 2, Lingyun Zhou 2, and Hui Hao 3 1 Power Emergeny Center, Sihuan Eletri Power Corporation,
More informationImproved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules
Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu
More informationPlot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar
Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation
More informationA Coarse-to-Fine Classification Scheme for Facial Expression Recognition
A Coarse-to-Fine Classifiation Sheme for Faial Expression Reognition Xiaoyi Feng 1,, Abdenour Hadid 1 and Matti Pietikäinen 1 1 Mahine Vision Group Infoteh Oulu and Dept. of Eletrial and Information Engineering
More informationDivide-and-conquer algorithms 1
* 1 Multipliation Divide-and-onquer algorithms 1 The mathematiian Gauss one notied that although the produt of two omplex numbers seems to! involve four real-number multipliations it an in fat be done
More informationExploiting Enriched Contextual Information for Mobile App Classification
Exploiting Enrihed Contextual Information for Mobile App Classifiation Hengshu Zhu 1 Huanhuan Cao 2 Enhong Chen 1 Hui Xiong 3 Jilei Tian 2 1 University of Siene and Tehnology of China 2 Nokia Researh Center
More informationMulti-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality
INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of
More informationA Dictionary based Efficient Text Compression Technique using Replacement Strategy
A based Effiient Text Compression Tehnique using Replaement Strategy Debashis Chakraborty Assistant Professor, Department of CSE, St. Thomas College of Engineering and Tehnology, Kolkata, 700023, India
More informationUnsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks
Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens
More informationC 2 C 3 C 1 M S. f e. e f (3,0) (0,1) (2,0) (-1,1) (1,0) (-1,0) (1,-1) (0,-1) (-2,0) (-3,0) (0,-2)
SPECIAL ISSUE OF IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION: MULTI-ROBOT SSTEMS, 00 Distributed reonfiguration of hexagonal metamorphi robots Jennifer E. Walter, Jennifer L. Welh, and Nany M. Amato Abstrat
More informationParallelizing Frequent Web Access Pattern Mining with Partial Enumeration for High Speedup
Parallelizing Frequent Web Aess Pattern Mining with Partial Enumeration for High Peiyi Tang Markus P. Turkia Department of Computer Siene Department of Computer Siene University of Arkansas at Little Rok
More informationAlgorithms, Mechanisms and Procedures for the Computer-aided Project Generation System
Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department
More informationOn the Generation of Multiplexer Circuits for Pass Transistor Logic
Preprint from Proeedings of DATE 2, Paris, rane, Marh 2 On the Generation of Multiplexer Ciruits for Pass Transistor Logi Christoph Sholl Bernd Beker Institute of Computer Siene Albert Ludwigs University
More information