Real-Time Detection of Invisible Spreaders
|
|
- Matilda Ami Lane
- 5 years ago
- Views:
Transcription
1 Real-Tie Detection of Invisible Spreaders MyungKeun Yoon Shigang Chen Departent of Coputer & Inforation Science & Engineering University of Florida, Gainesville, FL 3, USA {yoon, Abstract Detecting spreaders can help an intrusion detection syste identify potential attackers. The existing work can only detect aggressive spreaders that scan a large nuber of distinct addresses in a short period of tie. However, stealthy spreaders ay perfor scanning deliberately at a low rate. We observe that these spreaders can easily evade the detection because their sall traffic footprint will be covered by the large aount of background noral traffic that frequently flushes any spreader inforation out of the intrusion detection syste s eory. We propose a new streaing schee to detect stealthy spreaders that are invisible to the current systes. The new schee stores inforation about noral traffic within a liited portion of the allocated eory, so that it will not interfere with spreaders inforation stored elsewhere in the eory. The proposed schee is light weight; it can detect invisible spreaders in highspeed networks while residing in SRAM. Through experients using real Internet traffic traces, we deonstrate that our new schee detects invisible spreaders efficiently while keeping both false-positives (noral sources isclassified as spreaders) and false-negatives (spreaders isclassified as noral sources) to low level. Index Ters stealthy spreader, network security, intrusion detection, streaing algorith. I. INTRODUCTION Monitoring and analyzing network logs is at the heart of identifying attackers in the early stage []. These logs can be low-level packet trace generated fro routers or high-level audit records fro network/host intrusion detection systes. In high-speed networks, such logs can coe in large volue. To process the in real tie, a fast and lightweight streaing algorith is required, which should be able to work with liited eory and contiguously process incoing logs. This paper studies the proble of detecting spreaders based on incoing logs that are tuples of source/destination addresses. We call an external source address a spreader if it connects to ore than a threshold nuber of distinct internal destination addresses during a period of tie (such as a day). We define the cardinality of a source to be the nuber of distinct destinations that the source have contacted. Siilarly, we define the destination cardinality to be the nuber of distinct sources that have contacted the destination. The reason for detecting spreaders is that attackers often begin with a reconnaissance phase of finding vulnerable systes before launching the actual attack. Suppose an attacker knows how to coproise a specific type of web servers. Its first step is to locate such web servers on the Internet. The attacker ay probe TCP port on all addresses in a target network by using Nap []. To obtain ore specific inforation, they ay run an application-level vulnerability scanner such as Nessus [3] or Paros []. An intrusion detection syste can inspect the incoing traffic and catch the reconnaissance packets, fro which the spreaders are identified as potential attackers that deand extra attention. It is not possible for a network security adinistrator to anually analyze the huge volue of logs produced by routers and intrusion detection systes in order to find spreaders. An autoatic log-analyzing syste is required. In fact, soe intrusion detection systes have already ipleented functions for identifying spreaders. For exaple, Snort [5] keeps track of the distinct destinations each source contacts in a recent period, and the length of the period is constrained by the aount of eory allocated to this function. The proble is that the existing systes are designed to catch elephants aggressive spreaders whose cardinalities are so large that they easily stand out fro the background of noral traffic. In response, a wily attacker will slow down the rate of its reconnaissance packets and let the noral traffic dilute the footprint of its activity. In the Snort case, the past records ust be deleted to free eory once the allocated space is filled up by logs. If the attacker contacts a lessthan-threshold nuber of destinations in each period during which logs of noral traffic will fill up the allocated space, it will stay undetected. We note that even state-of-the-art intrusion detection systes can not detect stealthy spreaders if they send their packets at a low rate. These spreaders are called invisible spreaders. To catch the, we ust ake the detection syste ore sensitive. It is a cat-and-ouse gae between attackers and defenders. As we build ore and ore sensitive detectors, the attackers will be forced to continuously reduce their reconnaissance rate in order to stay undetected. This will give ore tie for the network adinistrators to take action (such as patching systes) against the outbreak of new attacks. The attacks will becoe less effective if it will take the an exceedingly long tie (e.g., onths) to coplete the reconnaissance phase over the Internet. To design our new real-tie detector for invisible spreaders, we observe (based on real Internet traffic traces) that noral traffic has strong skewness especially in an enterprise (or university capus) network. In particular, ost inbound traffic is headed to a sall nuber of servers for web, DNS, eail, and business application services. Utilizing such skewness, we propose a new spreader detection schee that is able to largely segregate the space used to store noral-traffic logs fro the space used to store logs of potential spreaders. Due to such segregation, a large volue //$5. IEEE. This full text paper was peer reviewed at the direction of IEEE Counications Society subject atter experts for publication in the IEEE "GLOBECOM" proceedings.
2 of noral-traffic logs will not cause the logs of spreaders to be flushed out of the eory. Furtherore, with a copact two-diensional bit array based on Bloo filters, the new schee can store a uch larger aount of inforation about the spreaders, allowing previously invisible spreaders to be detected. We perfor experients based on real Internet traffic traces, and the results show that the proposed schee is able to detect spreaders that are invisible to the existing detection systes and, at the ean tie, keep both false positives (noral sources isclassified as spreader sources) and false negatives (spreader sources isclassified as noral sources) to low level. The rest of the paper is organized as follows. Section II presents the design of our spreader detection schee. Section III evaluates the proposed schee via experients using real Internet traffic traces. Section IV discusses the related work. Section V draws the conclusion. II. INVISIBLE-SPREADER DETECTION In this section, we propose a new schee for detecting invisible spreaders. Our ain technique is a novel streaing algorith based on an invisible-spreader detection filter. A. Invisible-Spreader Detection Filter (ISD) Consider an intrusion detection syste that is deployed to catch all external spreaders whose cardinality exceeds a threshold θ. In order to detect stealthy spreaders, one ust set the value of θ sall. However, as θ becoes saller, the spreaders to be detected will have a saller traffic footprint, and it is increasingly harder for the intrusion detection syste to catch these spreaders without causing significant falsepositive and false-negative ratios. When the sall footprint of the stealthy spreaders is sufficiently diluted by noral traffic, the spreaders ay even becoe invisible to the current detection syste. To catch these invisible spreaders, ore sensitive detection systes ust be designed. Below we propose a new detector that can catch spreaders invisible to today s detectors (such as []). Our invisible-spreader detection filter (ISD) uses an n bit array as its ain data structure, which is initialized to be all zeros. Each bit B(x, y) in the array is referenced by a row index x and a colun index y. Bits will be set to ones to record the incoing connections ade fro external sources to internal destinations. A row is epty (or non-epty) ifit has zero bit (or at least one bit) that is set to be one. There is a row counter c(x) for each row x, storing the nuber of bits in the row that are set as one. The fullness ratio R of c(x) the filter is defined as n, the percentage of bits in the array that are set to one. Siilarly, the fullness ratio of row x is defined as c(x), the percentage of bits in the row that are set to one. We define a syste paraeter α, specifying the desirable fullness. If R>α, we reset the bit array to zeros. Next we describe the operations of ISD. When receiving an input source/destination tuple (a, b), the filter coputes k row indexes, x = h (a),..., x k = h k (a), and one colun index, y = h k+ (b), where h,..., h k are hash functions whose ranges are [..n ] and h k+ is a hash function whose range is [.. ]. The filter sets k bits, B(x,y),..., B(x k,y), to be one. Note that each colun is actually a Bloo filter [7] []. The colun index y selects a Bloo filter and the row indices specify the bits that together represent the tuple (a, b). For each i [..k], if B(x i,y) was set fro zero to one, the filter increases the row counter c(x) by one. Rows indexed by x through x k are called the representative rows of source a in the filter. Bits B(x,y) through B(x k,y) are called the representative bits of a. If the fullness of every representative row of source a is above a threshold β (whose value will be deterined in the next subsection), ISD executes the following procedure to deterine if a is a spreader. ) For the jth colun, let I j be one if B(x i,j)=for all the representative rows of a. Otherwise, I j =.We define a r = I j j= ) The cardinality of a, denoted as â c, can be estiated based on the following forula given in [9]. â c = ln( ) () a r 3) If â c is above θ, we consider source a to be a spreader. Our colun index, y = h k+ (b), is different fro [], which uses y = h k+ (a b). This subtle yet critical difference helps ISD iniize the diluting effect of noral traffic over the sall traffic footprint of invisible spreaders. Suppose a destination address b represents a busy webserver in an enterprise network, and illions of client users connect to b. Ify = h k+ (a b) is used, these clients will fill up the whole bit array with ones since the source addresses a randoizes the colun index y. To the contrary, only one colun of the bit array will be set to ones if y = h k+ (b) is used. Our Internet trace shows that the vast ajority of noral traffic is directed to a sall nuber of servers. Our schee concentrates such noral traffic to a sall nuber of coluns in the bit array, leaving the rest of the array for detecting spreaders. Hash collisions ay cause false positives. By tuning the syste paraeters, we can control the level of false positive, as well as the level of false negative. B. Paraeter Configuration The goal of ISD is to identify spreaders whose cardinality values are larger than θ, which is given as a user requireent. Let M (= n ) be the size of the allocated eory. The perforance of ISD is affected by the selection of the following syste paraeters: α, β,, and n. Belowwe discuss how to set these paraeters. ) We first set the values for β and. According to the previous subsection, a spreader will be detected when the following condition is satisfied. ln( ) θ. () ar //$5. IEEE. This full text paper was peer reviewed at the direction of IEEE Counications Society subject atter experts for publication in the IEEE "GLOBECOM" proceedings.
3 TABLE I: Paraeter Configuration Exaples (c =) θ β α Based on their definitions, we can approxiate β as ar. Applying this approxiation to (), we have the following forula for setting the value of β and. β = e θ. (3) Recall that the paraeter β is used to trigger the procedure for deterining a possible spreader. When the value of β is set by the above forula, once triggered the procedure is likely to find a spreader. The proble is that there are two undecided paraeters in the forula. We observe that sall is desirable for ISD. This is because sall allows large n, which reduces hash collisions aong row indices. Consequently, large β is preferable. However, if β is very close to one, ISD ay suffer fro hash collisions aong colun indices. In this paper, we choose β to be below.95, but it can be adjusted according to any specific application or deployent environent. Once β is chosen, can be set based on (). Alternatively, we ay also set first and then calculate β fro (). For exaple, it is natural to choose as a ultiple of words, which akes it easy to fit the bit array in eory. For each (= 3,,...), we copute β and choose the largest β below.95. Table I shows soe exaples for paraeter configuration. It shows how β and are deterined for θ fro to 9. After is deterined, n is calculated as M. ) We now deterine the value of α. First we exaine how α affects the detection of spreaders. When α is too larger, the bit array of ISD will be overly populated with ones, causing frequent hash collisions and resulting in false positives a non-spreader is claied as a spreader because its representative rows are populated with ones by tuples of other sources (due to hash collisions). If α is too sall, false positives ay hardly happen, but the filter will be frequently reset to zeros, losing the already-recorded inforation about spreaders and resulting in false negatives failure in detecting spreaders. Next we will use soe statistical properties to deterine the value of α. Suppose ISD only receives noral traffic for a period of tie and its bit array is ostly set by the noral traffic. Let Y be a rando variable that represents c(x) for row x in the bit array. The expectation and the variance of Y are given below. We oit the derivation process due to page liit. E(Y ) = α () V (Y ) = α ( α) (5) Fro E(Y ) and V (Y ), we can define a statistical upperbound for Y as follows: U(Y ) = E(Y )+c V (Y ) () where statistical error will be sall if the constant c is large. Eq. () eans that there is a high probability that c(x) is below U(Y ) if x is a representative row for only noral traffic. On the contrary, if x is a representative row for any spreader, c(x) should be larger than U(Y ). Hence, based on the above equations, we can set the value of α as follows. α = β + c ( + c ) β + c ( ( + c ) ) β + c. (7) Table I shows α as a result of the proposed heuristic ethod to configure β, and α when c =. III. EXPERIMENT We evaluate ISD using real-world Internet traffic traces. We ipleented not only ISD but also the advanced schee fro [], which we call online streaing odule (OSM). We copare their false positives and false negatives. The experiental results confir that ISD detects invisible spreaders while iniizing the negative ipact of noral traffic. A. Traffic Trace and Ipleentation Details In these experients, we set k to 3. Large k is helpful to differentiate sources, but it increases processing tie and fills up quickly the bit table. A good arguent for k =3can be found in []. We use packet header traces gathered at the gateway routers of the University of Florida in the U.S. The trace was collected for hours and we take only the inbound session fro the Internet. It contains 75, distinct source IP addresses,,9 distinct destination IP addresses and,7,37 distinct source/destination tuples. Note that we denote the source IP address of a packet as a and the destination IP address as b in our notation of packet (a, b). In this sense, the goal of the experient is to find heavy spreaders of horizontal network scans []. Figure () illustrates the traffic pattern with respect to source(destination) cardinality. The x-axis is the nuber of sources(destinations) whose cardinality lies between x and x. Each figure has two graphs of cuulative ratios for the nuber of distinct sources(destinations) and the nuber of distinct source/destination tuples. In figure, we see that % of the total sources contact less than distinct destinations and 99% of the contact less than 3 distinct destinations. Figure shows that the nuber of source/destination tuples increases just as the nuber of sources does. Therefore, we can not see any skewness in the figure. However, we can see a different pattern in figure. Two curves see different. The figure shows that only soe of the destinations occupy ost of the source/destination tuples. For exaple, at x =, the accuulated nuber of destinations is above 97%, but their aggregated source/destination tuples are below 7%. It eans that less than top 3% servers occupy ore than 73% of the total source/destination tuples. Exploiting //$5. IEEE. 3 This full text paper was peer reviewed at the direction of IEEE Counications Society subject atter experts for publication in the IEEE "GLOBECOM" proceedings.
4 Ratio.... sources src/dst tuples Source Cardinality Fig. : Cuulative ratios of the nubers of distinct sources and distinct source/destination tuples with respect to source cardinality Ratio.... destinations src/dst tuples Destination Cardinality Fig. : Cuulative ratios of the nubers of distinct destinations and distinct source/destination tuples with respect to destination cardinality No. of False Negatives OSM (total) OSM (slow scans) ISD (total) ISD (slow scans) Fig. 3: Nuber of false negatives when M=5KB this skewness, ISD has the edge on other intrusion detection systes. For all the experients, we set θ to be 5. It eans that we take any source of cardinality above 5 as a spreader or scan source. With θ = 5, the original traffic trace already includes 75 spreaders. We also generate soe artificial scan packets to siulate invisible spreaders. For each experient, we add artificial slow scan sources to the original traffic trace. These source addresses are carefully chosen so that the original traffic trace does not include any sae source address as the artificial scan sources. Each artificial scan source will send a total of λ distinct scan packets. It generates a scan packet every other μ noral source/destination tuples. The default paraeters for the experients are as follows: M = 5KB, = 5,n =, 9,α =.57,α O =.,θ = 5,λ =,μ =,,k =3. Note that β and α are deterined by equations 3 and 7. For coparison purpose, we also ipleented OSM fro []. For a fair coparison, both bit tables of OSM and ISD have the sae eory size M. To optiize OSM, the axiu nuber of one-bits for OSM is set to α O, which is different fro α. Through the experients, we observe that OSM degrades if α O is set too large or too sall. The default value of α O is.. Once the ratio of one-bits is above α O, the decoding process runs and OSM restarts in a clean state. For each experient, we copare false negative(positive) sets of OSM and ISD. We use FN O (FN R ) to denote the false negative set of OSM(ISD). Siilarly, we use FP O (FP R ) to denote false positive sets. Let RS be a set of real spreaders, which has 95 sources (75 spreaders fro the original traffic trace and artificial scan sources). Let D O (D R ) be a set of detected sources by OSM(ISD). We define FN O, FN R, FP O and FP R as follows: FN O = RS D O, FN R = RS D R, FP O = D O RS, FP R = D R RS. B. Experiental Results Figures 3 copare the nubers of false negatives(positives) between ISD and OSM. Thex-axis of each figure is μ, the nuber of noral source/destination tuples between two slow scan packets. A large value of μ iplies that the attacker further slows down in sending the scan packets. In figure 3, we have four curves. OSM(total) is the nuber of false negatives of OSM, so it equals FN O with μ fro to,3. OSM(slow scans) is the nuber of false negatives, but we only count the artificial slow scan sources that are not detected. Therefore, its axiu value is as we have artificial slow scan sources. The sae notations are used for ISD such as ISD(total) and ISD(slow scans). Note that ISD(total) plots FN R. Figure 3 shows that ISD catches ost spreaders until μ becoes,9. Even when μ =, 3, ISD catches 7 artificial spreaders out of. To the contrary, OSM isses uch ore spreaders than OSM. Even when μ =, it isses 7 non-artificial spreaders. It starts issing artificial scan sources at μ = 5. Atμ =, 9, OSM can not detect any slow scan sources while ISD detects out of. Note that we trade false positives with false negatives when designing ISD, but false positives should be controlled by setting α to be tight. Figure shows it. Even at μ =, 3, ISD only triggers 9 false positives. Considering that the nuber of source/destination tuples is above two illions, this false positives ay be accepted in ost applications. We repeat the sae experient with different n. Figures 5 and show the result with n = 3, 7, which eans M = MB. In this experient, ISD does not iss any spreaders including slow scan sources except one at μ =, 3. Note that both ISD(total) and ISD(slow scans) reain zero until μ =, 9. To the contrary, OSM still isses soe spreaders as shown in the figure. It can not detect out of slow scan sources at μ =, 3 even though the eory size has quadrupled. It is encouraging that ISD accoplishes better detection accuracy even when M is as sall as 5KB. Figure shows that ISD triggers only sall false positives. IV. RELATED WORK Snort is a world faous network-based intrusion detection syste. To detect scan sources, it siply keeps track of each source and the set of distinct destinations it contacts within a specified tie-window. Thus, the eory require //$5. IEEE. This full text paper was peer reviewed at the direction of IEEE Counications Society subject atter experts for publication in the IEEE "GLOBECOM" proceedings.
5 No. of False Positives OSM ISD Fig. : Nuber of false positives when M=5KB No. of False Negatives OSM (total) OSM (slow scans) ISD (total) ISD (slow scans) Fig. 5: Nuber of false negatives when M=MB No. of False Positives OSM ISD Fig. : Nuber of false positives when M=MB ent should be at least the total nuber of distinct sourcedestination pairs within the onitoring period, which is not feasible for detecting invisible spreaders [5], []. Venkataraan et al. define a heavy distinct-hitters proble [] as follows: given a strea of (x, y) pairs, find all the x s that are paired with a large nuber of distinct y s. The heavy distinct-hitters proble can be used to define the scan detection proble. The authors also define a ore specific proble, superspreaders, and propose two techniques to detect superspreaders. Superspreaders are heavy distinct-hitters, but they scan victis quickly. In other words, the onitoring period is short. Therefore, the proposed techniques can detect network scans only if they finish attacks within the short onitoring period. Recently, an efficient streaing algorith was proposed by Zhao et al. [], which we call Online Streaing Module (OSM) in this paper. They approached the issue by devising a traffic easureent tool, which approxiately estiates the cardinality of a source. It uses a two-diensional bit table, which utilizes the eory space copactly. However, it suffers fro the noral traffic volue as other IDSes do. Our proposed schee uses a two-diensional bit table as the basic data structure to save eory space, but we use a new indexing to overcoe the proble of huge noral traffic. It was not achieved by any previous work. Recently, Gao et al. propose to detect stealthy spreaders by using online outdegree histogras in the context of change detection []. Their schee is also based on two alternating tie-windows. We ephasize that they use the definition of stealthy spreaders different fro ours. In their definition, stealthy spreaders are a group of sources who send scanning packets at a constant rate together. Actually, they ai to detect scans fro botnets. To the contrary, we focus on detecting heavy spreaders who ay see invisible in that they can evade detection thanks to the large aount of noral traffic. V. CONCLUSION We defined the invisible spreader detection proble and showed the negative effects of noral traffic. To the best of our knowledge, none of the current IDSes are free fro these probles. We proposed a novel streaing algorith to detect invisible spreaders and to itigate the negative effects of noral traffic. By experients on real-world Internet traffic traces, we confired the advantages of the proposed schee. It is expected to help network/security anageent people in practice to detect general slow attacks, including invisible spreaders, which have been believed a difficult proble in network security. REFERENCES [] B. Schneier, SIMS: Solution, or Part of the Proble? IEEE Security and Privacy, vol., no. 5, October. [] nap, [3] nessus, [] paros, [5] Snort, [] Q. Zhao, J. Xu, and A. Kuar, Detection of Super Sources and Destinations in High-Speed Networks: Algoriths, Analysis and Evaluation, IEEE JSAC, vol., no., October. [7] B. H. Bloo, Space/Tie Trade-offs in Hash Coding with Allowable Errors, Counications of the ACM, vol. 3, no. 7, pp., 97. [] A. Broder and M. Mitzenacher, Network Applications of Bloo Filters: A Survey, Internet Matheatics, vol., no., June. [9] K. Hwang, B. Vander-Zanden, and H. Taylor, A linear-tie probabilistic counting algorith for database applications, ACM Transactions on Database Systes, vol. 5, no., June 99. [] S. Staniford, J. Hoagland, and J. McAlerney, Practical Autoated Detection of Stealthy Portscans, Journal of Coputer Security, vol., pp. 5 3,. [] S. Venkatataan, D. Song, P. Gibbons, and A. Blu, New Streaing Algoriths for Fast Detection of Superspreaders, Proc. of NDSS 5, Feb. 5. [] Y. Gao, Y. Zhao, R. Schweller, S. Venkataraan, Y. Chen, D. Song, and M. Kao, Detecting Stealthy Spreaders Using Online Outdegree Histogras, Proc. of IEEE International Workshop on Quality of Service 7, pp. 5 53, June 7. All of the above techniques work fine for a short onitoring period. However, none of the detect invisible spreaders if the alicious sources send scanning packets slowly and steadily //$5. IEEE. 5 This full text paper was peer reviewed at the direction of IEEE Counications Society subject atter experts for publication in the IEEE "GLOBECOM" proceedings.
Data & Knowledge Engineering
Data & Knowledge Engineering 7 (211) 17 187 Contents lists available at ScienceDirect Data & Knowledge Engineering journal hoepage: www.elsevier.co/locate/datak An approxiate duplicate eliination in RFID
More informationComputer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13
Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical
More informationUtility-Based Resource Allocation for Mixed Traffic in Wireless Networks
IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng
More informationGeo-activity Recommendations by using Improved Feature Combination
Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,
More informationEE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011
EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction
More informationAn Efficient Approach for Content Delivery in Overlay Networks
An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr
More informationEnergy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks
Energy-Efficient Disk Replaceent and File Placeent Techniques for Mobile Systes with Hard Disks Young-Jin Ki School of Coputer Science & Engineering Seoul National University Seoul 151-742, KOREA youngjk@davinci.snu.ac.kr
More informationShortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm
International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University
More informationMapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues
Mapping Data in Peer-to-Peer Systes: Seantics and Algorithic Issues Anastasios Keentsietsidis Marcelo Arenas Renée J. Miller Departent of Coputer Science University of Toronto {tasos,arenas,iller}@cs.toronto.edu
More informationInvestigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks
Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,
More informationPlanet Scale Software Updates
Planet Scale Software Updates Christos Gkantsidis 1, Thoas Karagiannis 2, Pablo Rodriguez 1, and Milan Vojnović 1 1 Microsoft Research 2 UC Riverside Cabridge, UK Riverside, CA, USA {chrisgk,pablo,ilanv}@icrosoft.co
More informationEnhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue
Enhancing Real-Tie CAN Counications by the Prioritization of Urgent Messages at the Outgoing Queue ANTÓNIO J. PIRES (1), JOÃO P. SOUSA (), FRANCISCO VASQUES (3) 1,,3 Faculdade de Engenharia da Universidade
More informationA Hybrid Network Architecture for File Transfers
JOURNAL OF IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 6, NO., JANUARY 9 A Hybrid Network Architecture for File Transfers Xiuduan Fang, Meber, IEEE, Malathi Veeraraghavan, Senior Meber,
More informationCollaborative Web Caching Based on Proxy Affinities
Collaborative Web Caching Based on Proxy Affinities Jiong Yang T J Watson Research Center IBM jiyang@usibco Wei Wang T J Watson Research Center IBM ww1@usibco Richard Muntz Coputer Science Departent UCLA
More informationClustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering
Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into
More informationDesigning High Performance Web-Based Computing Services to Promote Telemedicine Database Management System
Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,
More informationA Measurement-Based Model for Parallel Real-Time Tasks
A Measureent-Based Model for Parallel Real-Tie Tasks Kunal Agrawal 1 Washington University in St. Louis St. Louis, MO, USA kunal@wustl.edu https://orcid.org/0000-0001-5882-6647 Sanjoy Baruah 2 Washington
More informationRelocation of Gateway for Enhanced Timeliness in Wireless Sensor Networks Abstract 1. Introduction
Relocation of ateway for Enhanced Tieliness in Wireless Sensor Networks Keal Akkaya and Mohaed Younis Departent of oputer Science and Electrical Engineering University of Maryland, altiore ounty altiore,
More informationDerivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router
Derivation of an Analytical Model for Evaluating the Perforance of a Multi- Queue Nodes Network Router 1 Hussein Al-Bahadili, 1 Jafar Ababneh, and 2 Fadi Thabtah 1 Coputer Inforation Systes Faculty of
More informationSolving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification
Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural
More informationThe optimization design of microphone array layout for wideband noise sources
PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun
More informationAn Ad Hoc Adaptive Hashing Technique for Non-Uniformly Distributed IP Address Lookup in Computer Networks
An Ad Hoc Adaptive Hashing Technique for Non-Uniforly Distributed IP Address Lookup in Coputer Networks Christopher Martinez Departent of Electrical and Coputer Engineering The University of Texas at San
More informationTHE rapid growth and continuous change of the real
IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa
More informationReal Time Displacement Measurement of an image in a 2D Plane
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882 Volue 5, Issue 3, March 2016 176 Real Tie Displaceent Measureent of an iage in a 2D Plane Abstract Prashant
More informationAdaptive Parameter Estimation Based Congestion Avoidance Strategy for DTN
Proceedings of the nd International onference on oputer Science and Electronics Engineering (ISEE 3) Adaptive Paraeter Estiation Based ongestion Avoidance Strategy for DTN Qicai Yang, Futong Qin, Jianquan
More informationA CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER
A CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER VIOLETA TOMAŠEVIĆ, SLOBODAN BOJANIĆ 2 and OCTAVIO NIETO-TALADRIZ 2 The Mihajlo Pupin Institute, Volgina 5, 000 Belgrade, SERBIA AND MONTENEGRO 2 Technical University
More informationControl Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols
Control Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols Navodaya Garepalli Kartik Gopalan Ping Yang Coputer Science, Binghaton University (State University of New York) Contact:
More informationOblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands
Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu
More informationACNS: Adaptive Complementary Neighbor Selection in BitTorrent-like Applications
ACNS: Adaptive Copleentary Neighbor Selection in BitTorrent-like Applications Zhenbao Zhou 1, 2, Zhenyu Li 1, 2, Gaogang Xie 1 1 Institute of Coputing Technology, Chinese Acadey of Sciences, Beijing 100190,
More informationMULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES. Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou
MULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou Departent of Coputer Science and Inforation Engineering, National Chiayi
More informationA Trajectory Splitting Model for Efficient Spatio-Temporal Indexing
A Trajectory Splitting Model for Efficient Spatio-Teporal Indexing Slobodan Rasetic Jörg Sander Jaes Elding Mario A. Nasciento Departent of Coputing Science University of Alberta Edonton, Alberta, Canada
More informationA Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction
MATEC Web of Conferences 73, 03073(08) https://doi.org/0.05/atecconf/087303073 SMIMA 08 A roadband Spectru Sensing Algorith in TDCS ased on I Reconstruction Liu Yang, Ren Qinghua, Xu ingzheng and Li Xiazhao
More informationEstimating Persistent Spread in High-speed Networks Qingjun Xiao, Yan Qiao, Zhen Mo, Shigang Chen
Estimating Persistent Spread in High-speed Networks Qingjun Xiao, Yan Qiao, Zhen Mo, Shigang Chen Southeast University of China University of Florida Motivation for Persistent Stealthy Spreaders Imagine
More informationA Novel Fast Constructive Algorithm for Neural Classifier
A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore
More informationDifferent criteria of dynamic routing
Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich
More informationThe Internal Conflict of a Belief Function
The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of
More informationVision Based Mobile Robot Navigation System
International Journal of Control Science and Engineering 2012, 2(4): 83-87 DOI: 10.5923/j.control.20120204.05 Vision Based Mobile Robot Navigation Syste M. Saifizi *, D. Hazry, Rudzuan M.Nor School of
More informationMultipath Selection and Channel Assignment in Wireless Mesh Networks
Multipath Selection and Channel Assignent in Wireless Mesh Networs Soo-young Jang and Chae Y. Lee Dept. of Industrial and Systes Engineering, KAIST, 373-1 Kusung-dong, Taejon, Korea Tel: +82-42-350-5916,
More informationThe Boundary Between Privacy and Utility in Data Publishing
The Boundary Between Privacy and Utility in Data Publishing Vibhor Rastogi Dan Suciu Sungho Hong ABSTRACT We consider the privacy proble in data publishing: given a database instance containing sensitive
More informationAdaptive Holistic Scheduling for In-Network Sensor Query Processing
Adaptive Holistic Scheduling for In-Network Sensor Query Processing Hejun Wu and Qiong Luo Departent of Coputer Science and Engineering Hong Kong University of Science & Technology Clear Water Bay, Kowloon,
More informationIdentifying Converging Pairs of Nodes on a Budget
Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering
More informationImage Filter Using with Gaussian Curvature and Total Variation Model
IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.
More informationRavine Streams: Persistent Data Streams in Disruptive Sensor Networks
Ravine Streas: Persistent Data Streas in Disruptive Sensor Networks Mingsen Xu, Wen-Zhan Song Departent of Coputer Science, Georgia State University Atlanta, Georgia 333, USA Eail: {xu4@student.gsu.edu,
More informationDetection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm
Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,
More informationUsing Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses
International Journal of Industrial Engineering & Production Research Septeber 03, Volue 4, Nuber 3 pp. 9-35 ISSN: 008-4889 http://ijiepr.iust.ac.ir/ Using Iperialist Copetitive Algorith in Optiization
More informationOPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS
Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented
More informationQoS and Sensible Routing Decisions
QoS and Sensible Routing Decisions Erol Gelenbe Dept. of Electrical & Electronic Engineering Iperial College London SW7 2BT e.gelenbe@iperial.ac.uk Abstract Network Quality of Service (QoS) criteria of
More informationScheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL., NO., NOV 27 Scheduling Parallel Real-Tie Recurrent Tasks on Multicore Platfors Risat Pathan, Petros Voudouris, and Per Stenströ Abstract We
More informationPERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/m QUEUEING MODEL
IJRET: International Journal of Research in Engineering and Technology ISSN: 239-63 PERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/ QUEUEING MODEL Raghunath Y. T. N. V, A. S. Sravani 2 Assistant
More informationHIGH PERFORMANCE PRE-SEGMENTATION ALGORITHM FOR SONAR IMAGES
HIGH PERFORMANCE PRE-SEGMENTATION ALGORITHM FOR SONAR IMAGES Benjain Lehann*, Konstantinos Siantidis*, Dieter Kraus** *ATLAS ELEKTRONIK GbH Sebaldsbrücker Heerstraße 235 D-28309 Breen, GERMANY Eail: benjain.lehann@atlas-elektronik.co
More informationImprove Peer Cooperation using Social Networks
Iprove Peer Cooperation using Social Networks Victor Ponce, Jie Wu, and Xiuqi Li Departent of Coputer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Noveber 5, 2007 Corresponding
More informationBP-MAC: A High Reliable Backoff Preamble MAC Protocol for Wireless Sensor Networks
BP-MAC: A High Reliable Backoff Preable MAC Protocol for Wireless Sensor Networks Alexander Klein* Jirka Klaue Josef Schalk EADS Innovation Works, Gerany *Eail: klein@inforatik.uni-wuerzburg.de ABSTRACT:
More informationA Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University
More informationSurvivability Function A Measure of Disaster-Based Routing Performance
Survivability Function A Measure of Disaster-Based Routing Perforance Journal Club Presentation on W. Molisz. Survivability function-a easure of disaster-based routing perforance. IEEE Journal on Selected
More informationAn Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints
519 An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured fro Different Viewpoints Yousuke Kawauchi 1, Shin Usuki, Kenjiro T. Miura 3, Hiroshi Masuda 4 and Ichiro Tanaka 5 1 Shizuoka
More informationA Network-based Seamless Handover Scheme for Multi-homed Devices
A Network-based Sealess Handover Schee for Multi-hoed Devices Md. Shohrab Hossain and Mohaed Atiquzzaan School of Coputer Science, University of Oklahoa, Noran, OK 7319 Eail: {shohrab, atiq}@ou.edu Abstract
More informationDeterministic Voting in Distributed Systems Using Error-Correcting Codes
IEEE TRASACTIOS O PARALLEL AD DISTRIBUTED SYSTEMS, VOL. 9, O. 8, AUGUST 1998 813 Deterinistic Voting in Distributed Systes Using Error-Correcting Codes Lihao Xu and Jehoshua Bruck, Senior Meber, IEEE Abstract
More informationFeature Selection to Relate Words and Images
The Open Inforation Systes Journal, 2009, 3, 9-13 9 Feature Selection to Relate Words and Iages Wei-Chao Lin 1 and Chih-Fong Tsai*,2 Open Access 1 Departent of Coputing, Engineering and Technology, University
More informationI ve Seen Enough : Incrementally Improving Visualizations to Support Rapid Decision Making
I ve Seen Enough : Increentally Iproving Visualizations to Support Rapid Decision Making Sajjadur Rahan Marya Aliakbarpour 2 Ha Kyung Kong Eric Blais 3 Karrie Karahalios,4 Aditya Paraeswaran Ronitt Rubinfield
More informationMAC schemes - Fixed-assignment schemes
MAC schees - Fixed-assignent schees M. Veeraraghavan, April 6, 04 Mediu Access Control (MAC) schees are echaniss for sharing a single link. MAC schees are essentially ultiplexing schees. For exaple, on
More informationAscending order sort Descending order sort
Scalable Binary Sorting Architecture Based on Rank Ordering With Linear Area-Tie Coplexity. Hatrnaz and Y. Leblebici Departent of Electrical and Coputer Engineering Worcester Polytechnic Institute Abstract
More informationAn Adaptive Low-latency Power Management Protocol for Wireless Sensor Networks
An Adaptive Low-latency Power Manageent Protocol for Wireless Sensor Networks Giuseppe Anastasi, Marco Conti*, Mario Di Francesco, Andrea Passarella* Pervasive Coputing & Networking Lab. (PerLab) Departent
More informationEfficient Constraint Evaluation Algorithms for Hierarchical Next-Best-View Planning
Efficient Constraint Evaluation Algoriths for Hierarchical Next-Best-View Planning Ko-Li Low National University of Singapore lowl@cop.nus.edu.sg Anselo Lastra University of North Carolina at Chapel Hill
More informationEfficient Estimation of Inclusion Coefficient using HyperLogLog Sketches
Efficient Estiation of Inclusion Coefficient using HyperLogLog Sketches Azade Nazi, Bolin Ding, Vivek Narasayya, Surajit Chaudhuri Microsoft Research {aznazi, bolind, viveknar, surajitc}@icrosoft.co ABSTRACT
More informationDefining and Surveying Wireless Link Virtualization and Wireless Network Virtualization
1 Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization Jonathan van de Belt, Haed Ahadi, and Linda E. Doyle The Centre for Future Networks and Counications - CONNECT,
More informationAnalysing Real-Time Communications: Controller Area Network (CAN) *
Analysing Real-Tie Counications: Controller Area Network (CAN) * Abstract The increasing use of counication networks in tie critical applications presents engineers with fundaental probles with the deterination
More informationModeling Parallel Applications Performance on Heterogeneous Systems
Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln
More informationAutomatic Graph Drawing Algorithms
Autoatic Graph Drawing Algoriths Susan Si sisuz@turing.utoronto.ca Deceber 7, 996. Ebeddings of graphs have been of interest to theoreticians for soe tie, in particular those of planar graphs and graphs
More informationJoint Measurement- and Traffic Descriptor-based Admission Control at Real-Time Traffic Aggregation Points
Joint Measureent- and Traffic Descriptor-based Adission Control at Real-Tie Traffic Aggregation Points Stylianos Georgoulas, Panos Triintzios and George Pavlou Centre for Counication Systes Research, University
More informationA Distributed Multi-service Resource Allocation Algorithm in Heterogeneous Wireless Access Medium
1 A Distributed Multi-service Resource Allocation Algorith in Heterogeneous Wireless Access Mediu Muhaad Isail, Student Meber, IEEE, and Weihua Zhuang, Fellow, IEEE Abstract In this paper, radio resource
More informationFair Energy-Efficient Sensing Task Allocation in Participatory Sensing with Smartphones
Advance Access publication on 24 February 2017 The British Coputer Society 2017. All rights reserved. For Perissions, please eail: journals.perissions@oup.co doi:10.1093/cojnl/bxx015 Fair Energy-Efficient
More informationFit a Compact Spread Estimator in Small High-Speed Memory MyungKeun Yoon, Tao Li, Shigang Chen, and Jih-Kwon Peir
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 19, NO. 5, OCTOBER 2011 1253 Fit a Compact Spread Estimator in Small High-Speed Memory MyungKeun Yoon, Tao Li, Shigang Chen, and Jih-Kwon Peir Abstract The spread
More informationA Low-cost Memory Architecture with NAND XIP for Mobile Embedded Systems
A Low-cost Meory Architecture with XIP for Mobile Ebedded Systes Chanik Park, Jaeyu Seo, Sunghwan Bae, Hyojun Ki, Shinhan Ki and Busoo Ki Software Center, SAMSUNG Electronics, Co., Ltd. Seoul 135-893,
More informationELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH
ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH Kulapraote Prathuchai Geoinforatics Center, Asian Institute of Technology, 58 Moo9, Klong Luang, Pathuthani, Thailand.
More informationMulti Packet Reception and Network Coding
The 2010 Military Counications Conference - Unclassified Progra - etworking Protocols and Perforance Track Multi Packet Reception and etwork Coding Aran Rezaee Research Laboratory of Electronics Massachusetts
More informationAn Adaptive and Low-latency Power Management Protocol for Wireless Sensor Networks
An Adaptive and Low-latency Power Manageent Protocol for Wireless Sensor Networks Giuseppe Anastasi, Marco Conti*, Mario Di Francesco, Andrea Passarella* Pervasive Coputing & Networking Lab. (PerLab) Departent
More informationThe Flaw Attack to the RTS/CTS Handshake Mechanism in Cluster-based Battlefield Self-organizing Network
The Flaw Attack to the RTS/CTS Handshake Mechanis in Cluster-based Battlefield Self-organizing Network Zeao Zhao College of Counication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China National
More informationIntegrating fast mobility in the OLSR routing protocol
Integrating fast obility in the OLSR routing protocol Mounir BENZAID 1,2, Pascale MINET 1 and Khaldoun AL AGHA 1,2 1 INRIA, Doaine de Voluceau - B.P.105, 78153 Le Chesnay Cedex, FRANCE ounir.benzaid, pascale.inet@inria.fr
More informationPerformance Analysis of RAID in Different Workload
Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,
More informationTensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3
2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition
More informationBoosted Detection of Objects and Attributes
L M M Boosted Detection of Objects and Attributes Abstract We present a new fraework for detection of object and attributes in iages based on boosted cobination of priitive classifiers. The fraework directly
More informationReconstruction of Time Series using Optimal Ordering of ICA Components
Reconstruction of Tie Series using Optial Ordering of ICA Coponents Ar Goneid and Abear Kael Departent of Coputer Science & Engineering, The Aerican University in Cairo, Cairo, Egypt e-ail: goneid@aucegypt.edu
More informationEfficiently Supporting Multiple Similarity Queries for Mining in Metric Databases
Efficiently Supporting Multiple Siilarity Queries for Mining in Metric Databases Bernhard Braunüller, Martin Ester, Hans-Peter Kriegel, Jörg Sander Institute for Coputer Science, University of Munich Oettingenstr.
More informationComparative Evaluation of Color-Based Video Signatures in the Presence of Various Distortion Types
Coparative Evaluation of Color-Based Video Signatures in the Presence of Various Distortion Types Aritz Sánchez de la Fuente, Patrick Ndjiki-Nya, Karsten Sühring, Tobias Hinz, Karsten üller, and Thoas
More informationQUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS
QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS Guofei Jiang and George Cybenko Institute for Security Technology Studies and Thayer School of Engineering Dartouth College, Hanover NH 03755
More informationResearch Article A Novel Data Classification and Scheduling Scheme in the Virtualization of Wireless Sensor Networks
International Journal of Distributed Sensor Networks Volue 2013, Article ID 546708, 14 pages http://dx.doi.org/10.1155/2013/546708 Research Article A Novel Data Classification and Scheduling Schee in the
More informationIN many interactive multimedia streaming applications, such
840 IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 8, NO. 5, MAY 06 A Geoetric Approach to Server Selection for Interactive Video Streaing Yaochen Hu, Student Meber, IEEE, DiNiu, Meber, IEEE, and Zongpeng Li, Senior
More informationEFFICIENT VIDEO SEARCH USING IMAGE QUERIES A. Araujo1, M. Makar2, V. Chandrasekhar3, D. Chen1, S. Tsai1, H. Chen1, R. Angst1 and B.
EFFICIENT VIDEO SEARCH USING IMAGE QUERIES A. Araujo1, M. Makar2, V. Chandrasekhar3, D. Chen1, S. Tsai1, H. Chen1, R. Angst1 and B. Girod1 1 Stanford University, USA 2 Qualco Inc., USA ABSTRACT We study
More informationHKBU Institutional Repository
Hong Kong Baptist University HKBU Institutional Repository HKBU Staff Publication 18 Towards why-not spatial keyword top-k ueries: A direction-aware approach Lei Chen Hong Kong Baptist University, psuanle@gail.co
More informationInverted Index Compression via Online Document Routing
Inverted Index Copression via Online Docuent Routing Gal Lavee, Ronny Lepel, Edo Liberty, and Oren Soekh Yahoo! Labs., Haifa, Israel Eail: {gallavee, rlepel, edo, orens}@yahoo-inc.co ABSTRACT Modern search
More informationA Periodic Dynamic Load Balancing Method
2016 3 rd International Conference on Engineering Technology and Application (ICETA 2016) ISBN: 978-1-60595-383-0 A Periodic Dynaic Load Balancing Method Taotao Fan* State Key Laboratory of Inforation
More informationCOLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL
COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute
More informationImplementation of fast motion estimation algorithms and comparison with full search method in H.264
IJCSNS International Journal of Coputer Science and Network Security, VOL.8 No.3, March 2008 139 Ipleentation of fast otion estiation algoriths and coparison with full search ethod in H.264 A.Ahadi, M.M.Azadfar
More informationPOSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang
IEEE International Conference on ultiedia and Expo POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION Junjun Jiang, Ruiin Hu, Zhen Han, Tao Lu, and Kebin Huang National Engineering
More informationEquation Based Congestion Control for Video Transmission over WCDMA Networks
Equation Based Congestion Control for Video Transission over WCDMA Networks Antonios Alexiou, Diitrios Antonellis and Christos Bouras Research Acadeic Coputer Technology Institute, Greece and Coputer Engineering
More informationA Low-Cost Multi-Failure Resilient Replication Scheme for High Data Availability in Cloud Storage
216 IEEE 23rd International Conference on High Perforance Coputing A Low-Cost Multi-Failure Resilient Replication Schee for High Data Availability in Cloud Storage Jinwei Liu* and Haiying Shen *Departent
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN
International Journal of Scientific & Engineering Research, Volue 4, Issue 0, October-203 483 Design an Encoding Technique Using Forbidden Transition free Algorith to Reduce Cross-Talk for On-Chip VLSI
More informationA Fast Multi-Objective Genetic Algorithm for Hardware-Software Partitioning In Embedded System Design
A Fast Multi-Obective Genetic Algorith for Hardware-Software Partitioning In Ebedded Syste Design 1 M.Jagadeeswari, 2 M.C.Bhuvaneswari 1 Research Scholar, P.S.G College of Technology, Coibatore, India
More informationA Spectral Framework for Detecting Inconsistency across Multi-Source Object Relationships
A Spectral Fraework for Detecting Inconsistency across Multi-Source Object Relationships Jing Gao, Wei Fan, Deepak Turaga, Srinivasan Parthasarathy, and Jiawei Han University of Illinois at Urbana-Chapaign,
More informationApproximate String Matching with Reduced Alphabet
Approxiate String Matching with Reduced Alphabet Leena Salela 1 and Jora Tarhio 2 1 University of Helsinki, Departent of Coputer Science leena.salela@cs.helsinki.fi 2 Aalto University Deptartent of Coputer
More information