SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections
|
|
- Pearl Dean
- 6 years ago
- Views:
Transcription
1 SVC-DASH-M: Salable Video Coding Dynami Adaptive Streaming Over HTTP Using Multiple Connetions Samar Ibrahim, Ahmed H. Zahran and Mahmoud H. Ismail Department of Eletronis and Eletrial Communiations, Faulty of Engineering, Cairo University, Giza, Egypt. {ahzahran, Abstrat Dynami adaptive streaming over HTTP (DASH) has gained a signifiant momentum for multimedia streaming due to its ability in rossing firewalls and availability of infrastruture. In the mean time salable video oding (SVC) is building a similar momentum as it enables effiient media storage and ahing. In this work, we identify the main omponents of adaptive SVC-DASH lient and propose an streaming heuristi over dynami multiple onnetions. The proposed algorithm is experimentally tested under different onnetion and link onfigurations. Our results show that the algorithm suessfully ahieves interruption free streaming under all the tested bandwidth and link onfigurations. Additionally, the usage of multiple onnetions results in notieable improvements in the ahieved streaming quality for large link delays. I. INTRODUCTION Dynami adaptive streaming over HTTP (DASH) [] has gained a signifiant momentum and is widely adopted by many standardization bodies suh as open IPTv and GPP. Generally, HTTP streaming has several attrative features that helped in speeding up its aeptane. Avoiding firewall and NAT traversal issues represents a major advantage for HTTP streaming over other traditional streaming tehniques (e.g., RTP/UDP). Another advantage of using HTTP is the availability of existing HTTP ahe infrastrutures on the Internet, thus relieving not only the server load but also reduing the overall uplink traffi towards the ahe. The main drawbaks of using HTTP streaming inlude higher end-toend delays in the ommuniation due to using transmission ontrol protool (TCP) and possible redued link utilization due to TCP dynamis, but this an be ompensated using the lient-buffer. Adaptive streaming tehniques are ommonly used to aommodate variations in the bandwidth to avoid annoying streaming interruptions due to buffer under-run. In HTTP streaming, the media is subdivided into short duration hunks, ommonly known as segments. The granularity of streaming adaptation depends on the segment size and the adopted enoding tehnique. If advaned video oding (AVC) based on H./MPEG- Part standard is used, the server would ontain multiple versions of eah segment enoded at different qualities (resolution, frame rates, piture quality or This work is supported by the National Teleommuniation Regulation Authority (NTRA) of Egypt ombination of them). Hene, in AVC-DASH, deisions are typially taken at the segment end. Salable video oding (SVC) [] represents an extension to AVC and it allows enoding a video segment into N layers inluding a base layer and numerous enhanement layers. The aumulation of more layers generally leads to improving the video quality. Hene, in SVC-DASH, the granularity of quality ontrol extends both horizontally over time and vertially over layers. In this paper, we propose and evaluate the performane of an SVC-DASH lient over multiple parallel onnetions (SVC-DASH-M) using a real testbed. In SVC-DASH-M, the quality of the requested layer-segment depends on the amount of buffered media and the network onditions. Additionally, it adopts a quality seletion poliy that is onservative for the frequeny of video quality shifts. Our experimental results indiate that SVC-DASH-M suessfully adapts to different operating onditions inluding various link delays and bandwidths. Our results also bring important insights regarding HTTP server onfiguration and HTTP performane. The rest of the paper is organized as follows: in Setion II, we present a brief overview for bakground and related work. The design of SVC-DASH-M is presented in Setion III followed by its performane evaluation in Setion IV. Finally, our onlusions and diretions for future work are presented in Setion V. II. BACKGROUND In HTTP streaming, the ontent is requested using the HTTP GET request/response dialog that is typially servied over TCP. Hene, HTTP streaming is onsidered a pull protool in whih the media is requested from the server aording to the streaming lient instrutions. The details of the video information based on whih the lient takes the deision are typially obtained from a media presentation desription (MPD) file that inludes web links to the media files with orresponding enoding details of eah file ontent. Many studies fous on the design and performane evaluation of streaming over HTTP. These studies onsider different types of video enoding (AVC[] and SVC [], []), different onnetion onfigurations (persistent versus non-persistent [] and single versus multiple onnetions), different streaming modes(real-time versus stored) and various segment durations.
2 Most of these studies fous on AVC-streaming over a single persistent onnetion. More reently, several studies have shown that SVC-based streaming over HTTP has several merits and it started to get more attention. In [], it is shown that SVC-DASH has several advantages inluding the possibility of serving a larger number of users with different equipment apabilities as well as having a higher ahing effiieny. In [], the authors assert that SVC-DASH not only needs less buffering requirements in omparison to AVC-DASH but it also improves the quality of experiene (QoE) for the viewer. In [], the authors ompare the performane of different AVC-based and SVCbased heuristis using NS simulations with NS radle. They also show that AVC performs better under high latenies while SVC better adapts to sudden and temporary bandwidth flutuations when a single onnetion is used. The work in [] analytially investigates the optimal seletion poliy for layer segment when SVC is used. The onduted simulations show that a vertial poliy is optimal under fixed bandwidth while a diagonal seletion poliy is optimal for variable rate. A few works onsidered using multiple onnetions in HTTP streaming. In [], the authors present a rate-adaptive algorithm for AVC-based video streaming over two parallel onnetions. Their simulations show that parallel onnetions outperforms the serial segment fething method in ahievable media bit-rates but is slightly inferior in buffer underflow frequeny. In [], a ursor-based SVC lient heuristi Live TV setting is onsidered where the lient side buffer is limited. The authors also exploit using a fixed number of parallel onnetions and pipelined downloading of segment layers to overome the high end-to-end delay issues. In our study, we investigate the usage of dynami multiple onneitons for SVC-based streaming. III. SVC-DASH-M CLIENT DESIGN Typially, the first step performed by an HTTP streaming lient is to download the MPD file and parse it to obtain the video information. For SVC-DASH, every video segment is split into multiple layers per segment depending on the enoding struture. The ontent of eah layer segment is stored as a separate file on the HTTP server. Hene, the MPD information inludes: segment ID, layer ID, layer-segment URL, layer-segment duration, and layer size. Note that the segment ID an be used to identify the timing information of the transmitted segment. One the MPD information is reeived,svc-dash-m operation is based on three interating omponents inluding a layer-segment requester, a onnetion manager, and enhanement layer seletion poliy. Our layer-segment requester initially gets the first n min base layer-segments, where n min represents the minimum number of onnetions. Upon the reeption of a omplete layer-segment on onnetion, SVC-DASH-M onsiders a level-based layer-segment requester that determines the quality of the requested layer-segment as shown in Algorithm. The details of reqlayseg() is shown in Table I. The algorithm defines two appliation buffer-level thresholds denoted as B min and B target. B min represents a low threshold for the Algorithm Level-based Layer-Segment Requester Algorithm. bl = getbufflevel(); //buffer level if bl <= B min //request base layer only reqlayseg(b,onn); elseif B min < bl <= B target //alternate base and enhanement //requests reqlayseg(a,onn); else // bl > B Target //request enhanement layers only reqlayseg(e,onn); Algorithm Connetion Management Algorithm. µ = SD SFT ; if µ > r nxt = estimatenextrate(lstype); ǫ = (r nxt /r prev ); reqnextlayseg(lstype, onn); if (n < n max && µ > ǫ) reqnextlayseg(lstype, -); elseif µ < if n > n min lose(onn); else reqnextlayseg(lstype, onn); data to be maintained in the buffer to aommodate network ondition variations while B target represents a target buffer level that the appliation should be operating around. The defined poliy in Algorithm targets improving the streaming quality at high buffer levels through downloading enhanement layers. Additionally, the layer-segment requester poliy maintains the user experiene quality at low buffer-level through avoiding streaming interruptions by fousing on the base layersegments. The onnetion manager ontrols the dynamis of the used onnetions in SVC-DASH-M. In our algorithm, the number of opened onnetions, denoted as n, is lowerbounded by n min and upper-bounded by n max. The number of used onnetions varies when a layer-segment is reeived. Let denoted the onnetion over whih the layer-segment is reeived. Tne onnetion manager operation is shown in Algorithm. The details of the used funtions are presented in Table I. The streaming performane is evaluated based on the segment duration-feth ratio µ = SD SFT, where SD represents the duration of the reeived segment and SFT represents the duration over whih that segment is fethed. Note that large values of µ indiate that the available bandwidth is large and vie verse. Hene, a new layer-segment is requested over. An additional segment may be requested over a new onnetion if n < n max and there exists suffiient bandwidth for down-
3 getbufflevel( ); reqlayseg(lstype, onn) estimatenextrate(lstype) returns the buffer level in se. requests a layer-segment from the server over onnetion onn. lstype ould be B for base layer, E for enhanement layer, or A to alternate between base and enhanement layers. given the layer-segment type, this funtion returns the data rate required for downloading the next two segments to be requested. reqnextlayseg(lstype, onn); given the layer-segment type, this funtion requests the next layer-segment to be requested over onn. If onn is set to -, then a new onnetion is opened to request the seleted layer-segment. Table I: Algorithm Funtions. Figure : Testbed Arhiteture. loading two segments. The bandwidth suffiieny ondition is satisfied if the ratio between the required bandwidth for downloadingthetwoseletedlayer-segments(denotedasr nxt ) to the estimated onnetion bandwidth (denoted as r prev ) is less than the segment duratoin-feth ratio. To this end, it is worth noting that all the deision parameters are available or are readily measured at the appliation layer and do not inur any additional overhead to the ommuniation proess. The third design omponent for SVC-DASH-M is layersegment seletion poliy. Generally, this poliy should ensure that any seleted layer-segment is expeted to be reeived before its playout time. In our lient, this poliy is implemented in reqnextlayseg(lstype, onn), whih follows a horizontal seletion poliy by whih no layer-segment from layer n is requested unless all the layer-segments of layer n have been already downloaded. This poliy aims to redue the quality shifts in the reeived video. Other possible poliies inlude vertial poliy, whih is greedy in nature as it downloads all enhanement layer-segments for segment i before downloading enhanement layer-segments for segment i +. In between the two extremes, other poliies may be developed. Irrespetive of the hosen poliy, estimating an aurate expeted reeption time for the seleted layersegment represents a hallenging design issue beause TCP performane depends on several fators inluding the link parameters (e.g., bandwidth, delay, and reliability) and TCP parameters (e.g., initial window size and ongestion ontrol algorithm). In our algorithm, we onsider that a newly opened onnetion would equally share the estimated bandwidth of onnetion. This design hoie is motivated by the wellknown friendly behavior of TCP. Investigating other seletion poliies and developing aurate SFT estimator is indeed worth investigating and is onsidered a future work. A. Testbed Setup IV. PERFORMANCE EVALUATION Our evaluation is based on experimentation over a testbed shown in Figure. In our evaluation, we used the forty-fourseond Paris.yuv obtained from Arizona State University video library []. The video is proessed using the Joint Salable Video Model (JSVM) [] as follows. First, the video is slied into two-seond segments using JSVM downsampler. Eah segment is then enoded to ten salable layers inluding spatial (original CIF and a downsampled QCIF), temporal and quality salability. The enoder produes one. file per segment. We developed additional ode to extrat different portions orresponding to different layers in eah segments using layer information that are obtained from JSVM bitstreamextrator. The orresponding MPD file is then ompiled based on the extrated layer-segment information. Finally, the MPD file together with the layer segment files are uploaded to our HTTP server, a laptop running Ubuntu.. Traffi ontrol tools [] are employed to emulate different bandwidth and delay values. Netem is used to set the delay and delay standard deviation (assumed % of the delay). Additionally, token buket filter (tbf) is used to set the link bandwidthto valuesof interest. For the propersetup of tbf, we set the limit Bw HZ and buffer(burst) = Bw HZ, where Bw represents the emulated bandwidth and HZ represents the Linux kernel timer interrupt frequeny. Additionally, one may need to reset satter-gather, tp-segmentation-offload, generisegmentation-offload and generi-reeive-offload using ethtool to avoid paket dropping. Our lient is implemented using C to onnet and feth the MPD file and video layer-segments aording to the presented algorithm. The lient assumes a playout lateny of six seonds and a target level of ten seonds. If the buffer is depleted during the streaming, the appliation re-enters a buffering mode until it seures a sixseond portion in the buffer again. Wireshark is used to trae the transmitted pakets to estimate some performane metris. Our key performane indiies (KPIs) inlude the number of interrupts (n i ), the number of opened onnetions (n ), the number of losed onnetions due to low bandwidth (n ), the appliation downloaded data (d v ), the time at whih the appliation stops downloading more layer-segments (t d ), the appliation goodput (γ), and the average quality (q). The appliation goodput here is estimated as the ratio between the total transmitted video layer-segment sizes and the time spent in transmitting this amount of data. These KPIs are evaluated for different link bandwidth and delay onfigurations. B. Performane Results Figure plots the average reeived quality for the streamed video versus different bandwidth onfigurations for different min-max onnetion onfigurations and ms link delay.
4 AVG Quality (,) (,) (,) (,) (,) (,) (,) BW-Quality Rate in Kbps Figure : Segment Quality Versus Bandwidth for HTTP.. Quality (,) (,) (,) (,) (,) (,) Segment number Figure : Segment Quality versus segment number for HTTP.. Note that the average quality is estimated over all reeived segments. Intuitively, inreasing the bandwidth improves the quality of the reeived video for all onnetion onfigurations. Additionally, one an notie that the onnetion onfiguration has no signifiant impat on the reeived quality at a speifi onfiguration. Furthermore, the figure shows that a single onnetion represents a good hoie for the tested link onfigurations espeially at low bandwidth values. Figure shows the ahieved quality for eah segment onsidering different onnetion onfigurations for an average link-delay of ms and a bandwidth of Mbps. The figure provides us with some insights on the quality dynamis versus time. The figure shows that all the onnetion onfigurations managed to download the highest quality towards the video session end. However, the main differene lies in the the starting dynamis. At the beginning of the streaming, the adopted onservative approah for layer-segment request implies requesting base layer-segments only and limits the benefit from the available bandwidth to download enhanement layersegments. Note that this onservative approah helps reduing the initial playout lateny, whih is another important QoS metri. One the minimum amount of media is seured in the buffer, the lient starts to download enhanement layers for the subsequent segments. The figure also points out that the onnetion onfiguration has a diret impat on the streaming quality of the first few segments. Clearly, using a limited number of onnetions speeds the proess of quality improvement at the beginning. This result an be interpreted by the (,) n n d v (MB) t d (se) γ (kbps) q (a) kbps Bandwidth. n n d v (MB) t d (se) γ (Mbps) q (b) Bandwidth Mbps. Table II: KPIs for Bandwidth kbps and Mbps. TCP friendly behavior that splits the bandwidth among ative onnetions. Hene, as the lient opens more onnetions at the beginning, the bandwidth splitting leads to extended download time of every layer-segment. Consequently, suh behavior prevents requesting higher quality layer-segments based on the adopted horizontal enhanement layer-segment request. Table II shows some of the several KPIs for kbps and Mbps links with ms link delay. As a general observation, the onnetion onfiguration has limited impat on all the estimated KPIs exept for n and n. For any onfiguration, the algorithm opens more onnetions as the upper-bound inreases. Typially opening these onnetions is assoiated with a signaling overhead for a onnetion-oriented protool suh as TCP. However, many of these onnetions are also losed by the algorithm as their segment feth time is larger than the segment duration, espeially at low bandwidth. As an example, approximately onnetions out of opened onnetion for (,) onfiguration are losed. This indiates that the upper bound of the onnetions should be arefully hosen to math the operating onditions. Another n max in some onfigurations espeially those with small n max and high bandwidth. For example with (,) onfiguration, three onnetions are opened instead of one onnetion. The reason for this strange behavior is that the default server onfiguration implies that no more than objets should be transferred over the same persistent onnetion. Note that the number of ommuniated objets would typially sale with the number of enoded layers and video duration for a speifi segment size. Our results also indiate that under all the tested onfigurations, the algorithm manages to adapt the streaming to different bandwidths and no interrupts are enountered. Also, as the link bandwidth inreases, the appliation goodput (γ) inreases. This inrease is due to the ability to download more enhanement layer-segments and the typial drop of the download time (t d ). Consequently, a higher average quality is observed as the bandwidth inreases. Figure plots the average video quality versus the average link delay for different onnetion onfigurations assuming interesting observation is that n gets larger than n max
5 AVG Quality Delay-Quality Delay in mse (,) (,) (,) (,) (,) (,) (,) Figure : Quality versus Link Delay for HTTP.. n n d v (MB) t d (se) γ (kbps) q (a) Link Delay ms. n n d v (MB) t d (se) γ (kbps) q (b) Link Delay ms. Table III: Key performane indiies for different link delays. a bandwidth of Mbps. It is important to note that we set the variane of the link delay to % of the average value. The results indiate that the quality signifiantly drops as the delay inreases. A signifiant drop in the quality is notied as the delay inreases beyond ms. The figure also indiates that using parallel onnetions pays off for large link delays and variane. The (,) onfiguration generally shows the best performane for different link delays. Table III shows the KPIs for ms and ms link delays. Similar to the previous results, the obtained results also show that the algorithm suessfully streams the media without interruptions for different link delays. On the ontrary, the results show notieable variations for all the estimated KPIs for the same link onfiguration under different, n max ) values. The results also indiate that the number of losed onnetions due to limited bandwidth inreases with the inrease in delay for the onfiguration with high maximum onnetion bound. The appliation goodput also signifiantly deteriorates as the link delay inreases. Additionally, the estimated goodput shows signifiant improvement when two onnetions are used in omparison to the serial download. Additional goodput gain is notied between (,) and (,) for different link delays. V. CONCLUSIONS AND FUTURE WORK SVC brings promising benefits to DASH inluding improved adaptive streaming and storage espeially for highly heterogeneous networks. In this work, we presented the different key design omponents for SVC-DASH lient onsidering multiple onnetions. Additionally, we presented SVC-DASH- M as a multiple-onnetion threshold-based lient with horizontal layer-segment seletion poliy. Our experimental results show that using multiple onnetions has limited impat on the streaming performane for low link delays. On the ontrary, it shows a notieable improvement in the streamed quality for links with large delays. As a future work, we are interested in developing aurate estimators for layer-segment feth time, investigating and developing new layer-segment seletion poliies, and developing riteria for determining the optimal onnetion onfiguration parameters. REFERENCES [] T. Stokhammer, Dynami adaptive streaming over http : Standards and design priniples, in Pro. of the Seond Annual ACM Conferene on Multimedia Systems (MMSys ). New York, NY, USA: ACM,, pp.. [] H. Shwarz, D. Marpe, and T. Wiegand, Overview of the Salable Video Coding Extension of the H./AVC Standard, IEEE Trans. on Ciruits and Systems for Video Tehnology, vol., no., pp.,. [] Xiaoling Qiu et. al., Optimizing HTTP-based Adaptive Video Streaming for wireless aess networks, in Pro. rd IEEE International Conferene on Broadband Network and Multimedia Tehnology (IC- BNMT), ot., pp.. [] J. Famaey et. al, On the merits of SVC-based HTTP Adaptive Streaming, in in Pro. IFIP/IEEE International Symposium on Integrated Network Management (IM ),, pp.. [] R.Huysegems,B.D.Vleeshauwer, T.Wu,and W.V.Leekwijk, SVC- Based HTTP Adaptive Streaming, Bell Labs Tehnial Journal, vol., no., pp.,. [] S. Lederer, C. Müller, and C. Timmerer, Dynami adaptive streaming over http dataset, in Proeedings of the rd Multimedia Systems Conferene, ser. MMSys. New York, NY, USA: ACM,, pp.. [] S. de la Fuente et. al., idash: Improved Dynami Adaptive Streaming over HTTP Using Salable Video Coding, in in Pro. of the Seond Annual ACM Conferene on Multimedia Systems, ser. MMSys. New York, NY, USA: ACM,, pp.. [] Travis Andelin et. al., Quality seletion for dynami adaptive streaming over http with salable video oding, in Proeedings of the rd Multimedia Systems Conferene, ser. MMSys. New York, NY, USA: ACM,, pp.. [] C. Liu, I. Bouazizi, M. M. Hannuksela, and M. Gabbouj, Rate adaptation for dynami adaptive streaming over http in ontent distribution network, Image Commun., vol., no., pp., Apr.. [] Niels Bouten et. al, Minimizing the impat of delay on live SVC-based HTTP adaptive streaming servies, in Pro. IFIP/IEEE International Symposium on Integrated Network Management (IM ),, pp.. [] [Online]. Available: [] H. Shwarz, M. Wien, and J. Vieron, Joint salable video model jsvm- software, Output Doument from Joint Video Team,. [] [Online]. Available:
Pipelined 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 informationAccommodations of QoS DiffServ Over IP and MPLS Networks
Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering
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 informationA 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 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 informationUser-level Fairness Delivered: Network Resource Allocation for Adaptive Video Streaming
User-level Fairness Delivered: Network Resoure Alloation for Adaptive Video Streaming Mu Mu, Steven Simpson, Arsham Farshad, Qiang Ni, Niholas Rae Shool of Computing and Communiations, Lanaster University
More informationPerformance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification
erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,
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 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 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 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 informationDisplacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks
Displaement-based Route Update Strategies for Proative Routing Protools in Mobile Ad Ho Networks Mehran Abolhasan 1 and Tadeusz Wysoki 1 1 University of Wollongong, NSW 2522, Australia E-mail: mehran@titr.uow.edu.au,
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 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 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 informationNew Channel Allocation Techniques for Power Efficient WiFi Networks
ew Channel Alloation Tehniques for Power Effiient WiFi etworks V. Miliotis, A. Apostolaras, T. Korakis, Z. Tao and L. Tassiulas Computer & Communiations Engineering Dept. University of Thessaly Centre
More informationFast Distribution of Replicated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon
ACEEE Int. J. on Information Tehnology, Vol. 3, No. 2, June 2013 Fast Distribution of Repliated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon Email: mmalli@aou.edu.lb
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 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 informationVolume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm
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 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 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 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 informationDynamic Backlight Adaptation for Low Power Handheld Devices 1
Dynami Baklight Adaptation for ow Power Handheld Devies 1 Sudeep Pasriha, Manev uthra, Shivajit Mohapatra, Nikil Dutt and Nalini Venkatasubramanian 444, Computer Siene Building, Shool of Information &
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 informationUplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks
62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering
More informationLRED: A Robust and Responsive AQM Algorithm Using Packet Loss Ratio Measurement
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, TPDS-179-5 1 LRED: A Robust and Responsive AQM Algorithm Using Paket Loss Ratio Measurement Chonggang Wang, Member, IEEE, Jianghuan Liu, Member, IEEE,
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 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 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 informationReduced-Complexity Column-Layered Decoding and. Implementation for LDPC Codes
Redued-Complexity Column-Layered Deoding and Implementation for LDPC Codes Zhiqiang Cui 1, Zhongfeng Wang 2, Senior Member, IEEE, and Xinmiao Zhang 3 1 Qualomm In., San Diego, CA 92121, USA 2 Broadom Corp.,
More informationRecommendation Subgraphs for Web Discovery
Reommation Subgraphs for Web Disovery Arda Antikaioglu Department of Mathematis Carnegie Mellon University aantika@andrew.mu.edu R. Ravi Tepper Shool of Business Carnegie Mellon University ravi@mu.edu
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 informationCOST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY
COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary
More informationDECODING OF ARRAY LDPC CODES USING ON-THE FLY COMPUTATION Kiran Gunnam, Weihuang Wang, Euncheol Kim, Gwan Choi, Mark Yeary *
DECODING OF ARRAY LDPC CODES USING ON-THE FLY COMPUTATION Kiran Gunnam, Weihuang Wang, Eunheol Kim, Gwan Choi, Mark Yeary * Dept. of Eletrial Engineering, Texas A&M University, College Station, TX-77840
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 informationCA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0
Implementation Proven Professional Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer
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 informationSINR-based Network Selection for Optimization in Heterogeneous Wireless Networks (HWNs)
48 J. ICT Res. Appl., Vol. 9, No., 5, 48-6 SINR-based Network Seletion for Optimization in Heterogeneous Wireless Networks (HWNs) Abubakar M. Miyim, Mahamod Ismail & Rosdiadee Nordin Department of Eletrial,
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 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 informationPerformance Benchmarks for an Interactive Video-on-Demand System
Performane Benhmarks for an Interative Video-on-Demand System. Guo,P.G.Taylor,E.W.M.Wong,S.Chan,M.Zukerman andk.s.tang ARC Speial Researh Centre for Ultra-Broadband Information Networks (CUBIN) Department
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 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 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 informationTrajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller
Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,
More informationDetection of RF interference to GPS using day-to-day C/No differences
1 International Symposium on GPS/GSS Otober 6-8, 1. Detetion of RF interferene to GPS using day-to-day /o differenes Ryan J. R. Thompson 1#, Jinghui Wu #, Asghar Tabatabaei Balaei 3^, and Andrew G. Dempster
More informationWe don t need no generation - a practical approach to sliding window RLNC
We don t need no generation - a pratial approah to sliding window RLNC Simon Wunderlih, Frank Gabriel, Sreekrishna Pandi, Frank H.P. Fitzek Deutshe Telekom Chair of Communiation Networks, TU Dresden, Dresden,
More informationPath Diversity for Overlay Multicast Streaming
Path Diversity for Overlay Multiast Streaming Matulya Bansal and Avideh Zakhor Department of Eletrial Engineering and Computer Siene University of California, Berkeley Berkeley, CA 9472 {matulya, avz}@ees.berkeley.edu
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 information- 1 - S 21. Directory-based Administration of Virtual Private Networks: Policy & Configuration. Charles A Kunzinger.
- 1 - S 21 Diretory-based Administration of Virtual Private Networks: Poliy & Configuration Charles A Kunzinger kunzinge@us.ibm.om - 2 - Clik here Agenda to type page title What is a VPN? What is VPN Poliy?
More informationIN structured P2P overlay networks, each node and file key
242 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 21, NO. 2, FEBRUARY 2010 Elasti Routing Table with Provable Performane for Congestion Control in DHT Networks Haiying Shen, Member, IEEE,
More informationPerformance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application
World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah
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 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 informationDistributed Resource Allocation Strategies for Achieving Quality of Service in Server Clusters
Proeedings of the 45th IEEE Conferene on Deision & Control Manhester Grand Hyatt Hotel an Diego, CA, UA, Deember 13-15, 2006 Distributed Resoure Alloation trategies for Ahieving Quality of ervie in erver
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 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 informationDesign Implications for Enterprise Storage Systems via Multi-Dimensional Trace Analysis
Design Impliations for Enterprise Storage Systems via Multi-Dimensional Trae Analysis Yanpei Chen, Kiran Srinivasan, Garth Goodson, Randy Katz University of California, Berkeley, NetApp In. {yhen2, randy}@ees.berkeley.edu,
More informationGradient based progressive probabilistic Hough transform
Gradient based progressive probabilisti Hough transform C.Galambos, J.Kittler and J.Matas Abstrat: The authors look at the benefits of exploiting gradient information to enhane the progressive probabilisti
More informationDirect-Mapped Caches
A Case for Diret-Mapped Cahes Mark D. Hill University of Wisonsin ahe is a small, fast buffer in whih a system keeps those parts, of the ontents of a larger, slower memory that are likely to be used soon.
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 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 informationThe AMDREL Project in Retrospective
The AMDREL Projet in Retrospetive K. Siozios 1, G. Koutroumpezis 1, K. Tatas 1, N. Vassiliadis 2, V. Kalenteridis 2, H. Pournara 2, I. Pappas 2, D. Soudris 1, S. Nikolaidis 2, S. Siskos 2, and A. Thanailakis
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 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 informationKERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION
KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese
More informationNONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman
NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of
More informationA Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering
A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,
More informationEpisode 12: TCP/IP & UbiComp
Episode 12: TCP/IP & UbiComp Hannes Frey and Peter Sturm University of Trier Outline Introdution Mobile IP TCP and Mobility Conlusion Referenes [1] James D. Solomon, Mobile IP: The Unplugged, Prentie Hall,
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 informationAnnouncements. Lecture Caching Issues for Multi-core Processors. Shared Vs. Private Caches for Small-scale Multi-core
Announements Your fous should be on the lass projet now Leture 17: Cahing Issues for Multi-ore Proessors This week: status update and meeting A short presentation on: projet desription (problem, importane,
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 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 informationA Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks
A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr
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 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 informationCA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1
Exam (CAT-600) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized
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 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 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 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 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 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 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 informationMake your process world
Automation platforms Modion Quantum Safety System Make your proess world a safer plae You are faing omplex hallenges... Safety is at the heart of your proess In order to maintain and inrease your ompetitiveness,
More informationCA Privileged Access Manager 3.x Proven Implementation Professional Exam (CAT-661) Study Guide Version 1.0
Exam (CAT-661) Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFMATION 2018 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized
More informationThe Tofu Interconnect D
2018 IEEE International Conferene on Cluster Computing The Tofu Interonnet D Yuihiro Ajima, Takahiro Kawashima, Takayuki Okamoto, Naoyuki Shida, Kouihi Hirai, Toshiyuki Shimizu Next Generation Tehnial
More informationA scheme for racquet sports video analysis with the combination of audio-visual information
A sheme for raquet sports video analysis with the ombination of audio-visual information Liyuan Xing a*, Qixiang Ye b, Weigang Zhang, Qingming Huang a and Hua Yu a a Graduate Shool of the Chinese Aadamy
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 informationJoint Server Selection and Routing for Geo-Replicated Services
Joint Server Seletion and Routing for Geo-Repliated Servies Srinivas Narayana, Wenjie Jiang, Jennifer Rexford, Mung Chiang Prineton University Abstrat The performane and osts of geo-repliated online servies
More informationA Hybrid Neuro-Genetic Approach to Short-Term Traffic Volume Prediction
A Hybrid Neuro-Geneti Approah to Short-Term Traffi Volume Predition 1. Introdution Shahriar Afandizadeh 1,*, Jalil Kianfar 2 Reeived: January 2003, Revised: July 2008, Aepted: January 2009 Abstrat: This
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 informationOn Dynamic Server Provisioning in Multi-channel P2P Live Streaming
On Dynami Server Provisioning in Multi-hannel P2P Live Streaming Chuan Wu Baohun Li Shuqiao Zhao Department of Computer Siene Department of Eletrial Multimedia Development Group The University of Hong
More informationChannel Splitting Network for Single MR Image Super-Resolution. Xiaole Zhao, Yulun Zhang, Tao Zhang, and Xueming Zou. PSNR(dB)
1 Channel Splitting Network for Single R Image Super-Resolution Xiaole Zhao, Yulun Zhang, Tao Zhang, and Xueming Zou arxiv:1810.06453v [s.cv] 13 De 018 Abstrat High resolution magneti resonane (R) imaging
More informationDoS-Resistant Broadcast Authentication Protocol with Low End-to-end Delay
DoS-Resistant Broadast Authentiation Protool with Low End-to-end Delay Ying Huang, Wenbo He and Klara Nahrstedt {huang, wenbohe, klara}@s.uiu.edu Department of Computer Siene University of Illinois at
More informationDetecting Outliers in High-Dimensional Datasets with Mixed Attributes
Deteting Outliers in High-Dimensional Datasets with Mixed Attributes A. Koufakou, M. Georgiopoulos, and G.C. Anagnostopoulos 2 Shool of EECS, University of Central Florida, Orlando, FL, USA 2 Dept. of
More informationTHROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC
THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC Priya N. Werahera and Anura P. Jayasumana Department of Eletrial Engineering Colorado State University
More informationTUNING INTO OTT 2.0 MAKING DIGITAL VIDEO AS GOOD AS TV. Orchestrating an effective live and OTT Video Strategy with a Platform-as-a-Service Solution
TUNING INTO OTT 2.0 MAKING DIGITAL VIDEO AS GOOD AS TV Orhestrating an effetive live and OTT Video Strategy with a Platform-as-a-Servie Solution Vidya S Nath, Researh Diretor Swetha R Krishnamoorthi, Senior
More information