System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications
|
|
- Barrie Arnold
- 5 years ago
- Views:
Transcription
1 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 1 1 he George Washington University, 2 George Mason University, 3 SRC Computers {esam, mtaher}@gwu.edu, kgaj@gmu.edu,{tarek, alexan}@gwu.edu, aliga@sromp.om Abstrat Reonfigurable Computers (RCs) an leverage the synergism between onventional proessors and FPGAs to provide low-level hardware funtionality at the same level of programmability as general-purpose omputers. In a large lass of appliations, the total I/O time is omparable or even greater than the omputations time. As a result, the rate of the DMA transfer between the miroproessor memory and the on-board memory of the FPGA-based proessor beomes the performane bottlenek. In this paper, we perform a theoretial and experimental study of this speifi performane limitation. he mathematial formulation of the problem has been experimentally verified on the state-of-the art reonfigurable platform, SRC-6E. We demonstrate and quantify the possible solution to this problem that exploits the system-level parallelism within reonfigurable mahines. 1. Introdution Reonfigurable Computers ombine the flexibility of traditional miroproessors with the power of Field Programmable Gate Arrays (FPGAs). he programming model is aimed at separating programmers from the details of the hardware desription, and allowing them to fous on an implemented funtion. his approah allows the use of software programmers and mathematiians in the development of the ode, and substantially dereases the time to the solution. he SRC-6E Reonfigurable Computer is one example of this ategory of hybrid omputers [1]. In this paper we will disuss the existing limitations on the performane of reonfigurable omputers, and propose an optimization tehnique that improves this performane. Our experimental results onfirm the effiieny of the proposed solution. 2. SRC-6E Reonfigurable Computer 2.1. Hardware Arhiteture SRC-6E platform onsists of two general-purpose miroproessor boards and one MAP reonfigurable proessor board. Eah miroproessor board is based on two 1 GHz Pentium 3 miroproessors. he SRC MAP board onsists of two MAP reonfigurable proessors. Overall, the SRC-6E system provides a 1:1 miroproessor to FPGA ratio. Miroproessor boards are onneted to the MAP board through the SNAP interonnet. SNAP ard plugs into the DIMM slot on the miroproessor motherboard [1]. Hardware arhiteture of the SRC MAP proessor is shown in Fig. 1. his proessor onsists of two programmable User FPGAs, six 4 MB banks of the onboard memory (OBM), and a single Control FPGA. In the typial mode of operation, input data is first transferred through the Control FPGA from the miroproessor memory to OBM. his transfer is followed by omputations performed by the User FPGA, whih fethes input data from OBM and transfers results bak to OBM. Finally, the results are transmitted bak from OBM to miroproessor memory. Figure 1. Hardware Arhiteture of SRC-6E 2.2. Programming Model he SRC-6E has a similar ompilation proess as a onventional miroproessor-based omputing system, but needs to support additional tasks in order to produe
2 logi for the MAP reonfigurable proessor, as shown in Fig. 2. here are two types of appliation soure files to be ompiled. Soure files of the first type are ompiled targeting exeution on the Intel platform. Soure files of the seond type are ompiled targeting exeution on the MAP reonfigurable proessor. A file that ontains a program to be exeuted on the Intel proessor is ompiled using the miroproessor ompiler. All files ontaining funtions that all hardware maros and thus exeute on the MAP are ompiled by the MAP ompiler. MAP soure files ontain MAP funtions omposed of maro alls. Here, maro is defined as a piee of hardware logi designed to implement a ertain funtion. Sine users often wish to extend the built-in set of operators, the ompiler allows users to integrate their own VHDL/Verilog maros. Objet files Appliation soures μp Compiler Linker MAP Compiler.o files.o files Appliation exeutable.v files Maro soures. or.f files.vhd or.v files HDL soures Netlists Logi synthesis.ngo files Plae & Re.bin files Configuration bitstreams Figure 2. SRC Compilation Proess 3. Current Performane Limitations he total exeution time for any appliation on a reonfigurable mahine onsists of the omputations time and the total I/O time as shown in Fig. 3. In a large lass of appliations, the total I/O time is omparable or even greater than the omputations time. As a result, the rate of the DMA transfer between the miroproessor memory and the on-board memory beomes the performane bottlenek. One possible solution is the redesign of the system hardware in suh a way that it supports a higher data transfer rate. aking into aount the ost of the hardware system upgrade, this solution may not be pratial. Additionally, even with the higher data transfer rate, there might be still appliations in whih the DMA time is omparable or even longer than the omputations time. herefore, our goal has been to find a general solution to speed-up a large lass of appliations running on a reonfigurable omputer with any hanges to the system hardware. Our solution exploits the system-level parallelism within the SRC mahine, and requires only small hanges in the appliation ode. Figure 3. Exeution time with overlapping 4. he Proposed Optimization ehnique 4.1. Model Formulation he objetive of our optimization tehnique is to overlap omputations with the data transfer whih substantially redues the total exeution time. his tehnique is onstrained by both the mahine and the nature of the appliation. he mahine onstraints an be in terms of the I/O bandwidth, total number of onurrent DMA hannels, the apability of overlapping the input with the put DMA hannels, and the asymmetry between the input and put DMA hannels bandwidths. In our model, we assume a generi hypothetial mahine that has all the above mentioned onstraints (see Fig. 4). In other words, we assume asymmetri I/O transfers, non-equal number of onurrent input and put DMA hannels, and varying overlapping ability among the DMA hannels. On the other hand, the appliation fores some onstraints, depending on its nature, whih makes it diffiult to model all the possible variations. wo essential variations in this ontext are the nature of data aeptane and data proessing by the appliation. For the data aeptane, our model assumes that the appliation is periodi, i.e. data are fed into the appliation sequentially in fixed-size bloks. Periodiity, in general, aommodates for the speial nature of pipelined appliations as a subset of the range of appliations it overs. For the nature of proessing, we assume onurrent proessing of multiple bloks of data as well as linear dependeny between the omputations time and the amount of data being proessed. hese assumptions are met by a large lass of appliations, inluding enryption [2, 3, 4], ompression, and seleted image and data proessing algorithms [5, 6, 7]. he details of the presented tehnique are illustrated in Fig. 5. Both the DMA-IN and DMA-OU transfers are divided into a sequene of n data transfers eah. Eah of these transfer parels is further divided into a number of onurrent transfer parels equal to the number of the DMA hannels available in eah diretion. he omputation period has been divided into a number of partial omputation periods spanning the time interval between the end of the first DMA-IN transfer and the beginning of the last DMA-OU transfer. he first and the last data parels are speial, as no omputations an be performed in parallel with these data transfers.
3 Figure 4. Model arhiteture a) Non-overlapped DMA hannels (V=0) b) Overlapped DMA hannels (V=1) Figure 5. Overlapping Computations with Data ransfers 4.2. Analysis he following notation will be used in our mathematial model: n DMA-IN is the number of input data parels n COMP is the number of partial omputations n DMA-OU is the number of put data parels K DMA-IN is the input transfer onurreny (multipliity) fator, i.e. the number of onurrent input hannels K DMA-OU is the put transfer onurreny (multipliity) fator, i.e. the number of onurrent put hannels K DMA is the total DMA onurreny (multipliity) fator K DMA = K DMA-IN K DMA-OU (1) K C is the omputations onurreny (multipliity) fator, i.e. the number of onurrent proessing units, it is also the number of independent data hannels between the OBM and the omputations on the FPGA in either diretion (e.g. number of OBM memory banks) B DMA-IN is the bandwidth for the input data transfer from the miroproessor memory to the OBM per single DMA hannel B COMP-IN is the bandwidth for the input data transfer between the OBM and a single omputational unit B COMP-OU is the bandwidth for the put data transfer from a single omputational unit to the OBM B DMA-OU is the bandwidth for the put data transfer from the OBM to the miroproessor memory per single DMA hannel D BLOCK-IN is the data blok size for eah of the onurrent input parels D BLOCK-COMP is the data blok size for eah of the onurrent omputations D BLOCK-OU is the data blok size for eah of the onurrent put parels D DMA-IN is the total data size for the input transfer D DMA IN = ndma IN D BLOCK IN K (2) DMA IN
4 D COMP-IN is the total input data size for the omputations and it is equal to the total data transferred in by the DMA DCOMP IN = ncomp D BLOCK COMP K (3) C DCOMP IN = D (4) DMA IN D COMP-OU is the total put data size from the omputations and it is equal to the total data to be transferred by the DMA DCOMP OU = β D (5) COMP IN DCOMP OU = D (6) DMA OU β is the data prodution-onsumption fator; i.e. β>1 for data-produing appliations, and β<1 for data-onsuming appliations D DMA-OU is the total data size for the put transfer DDMA OU = ndma OU DBLOCK OU K (7) DMA OU DMA-IN is the single-hannel DMA transfer time from the miroproessor memory to the on-board memory DDMA IN DMA IN = (8) B DMA IN DMA-OU is the single-hannel DMA transfer time from the on-board memory to the miroproessor memory DDMA OU DMA OU = (9) B DMA OU DMA is the single-hannel total DMA transfer time DMA = DMA-IN DMA-OU (10) COMP is the total omputations time for the ase of no-overlapping NoOverlap is the total exeution time for the ase of no-overlapping Overlap is the total exeution time for the ase of overlapping V is the DMA hannel-overlapping fator; i.e. V=0 for no overlapping between input and put DMA transfers, V=1 for maximum overlapping between input and put DMA transfers (see Fig. 5) We also introdue the following notation for the ratios of respetive times. DMA IN in =, DMA OU =, COMP = (11) DMA DMA DMA Equations (1) to (9) show the soures of asymmetry in DMA transfer times. Asymmetry an be aused by differene in the number of hannels, K DMA-IN, K DMA-OU, and in bandwidths, B DMA-IN, B DMA-OU, between the transfers, whih are mahine onstraints. It an also be aused by transferring different data sizes in eah diretion depending on whether the appliation being either data-produing (D DMA-OU >D DMA-IN ; i.e. β>1) or data-onsuming (D DMA-OU <D DMA-IN ; i.e. β<1). In addition to these fators, asymmetry an be aused by differene in the number of input parels, n DMA-IN, and the number of put parels, n DMA-OU. o limit the asymmetry onditions to those fators whih are only fored by the mahine and/or appliation onstraints, not by the proposed tehnique itself, we an deliberately selet the number of transfer parels in both diretions to be equal; i.e. n DMA-IN =n DMA-OU = n. In general, asymmetry an be aused by either one or all of the above three onstraints. he resultant effets of all these asymmetry onstraints are olletively modeled in equations (2), (7), (8), (9), (10), and (11). As a oneptual representation [8] of the model, Fig. 5 suggests some bounds on the number of input hannels, K DMA-IN, and the number of put hannels, K DMA-OU, when related to the number of onurrent proessing units, K C. he existene of OBM, whih is very ommon in almost all types of RCs, serves as a buffering mehanism whih relaxes any bounding limits on the relation between K DMA-OU and K C. In other words, these two fators an boundlessly be hanged independently. On the other hand, there an be a lower bound for the relation between K DMA-IN and K C. his lower bound is fored by the fat that the first blok of transferred data should be at least the minimum amount of data neessary to start the proessing; i.e. (K DMA-IN * D BLOCK-IN ) (K C *D BLOCK-COMP ). Equations derived to assess the effetiveness of the proposed overlapping tehnique are grouped together in able 1. Based on Figs. 3 and 5, equations (12) and (13) have been derived to desribe the total exeution time for both ases of no-overlapping and overlapping. o evaluate the effetiveness of the tehnique, the speedup in the total exeution time, S, is defined by equation (14). Based on equations (12), (13), and (14), equation (15) gives a simplified formula for S for the different values of the ratio. he upper limit on the speedup, and the asymptoti behavior of this limit, for both ases of nonoverlapped DMA hannels, V=0, and maximally overlapped DMA hannels, V=1, are given in equation (16) under the onditions of symmetri DMA transfers. In Fig. 6, the asymptoti dependene between the speedup, S, and, is plotted for different values of the system parameters, K DMA-IN, K DMA-OU, K C, and V. Based on equation (15) and Fig. 6, our tehnique, for a given K C, gives the best results for the ase of in =, K DMA-IN =
5 K DMA-OU, i.e., symmetri data transfer where data transfer-in and data transfer- take the same amount of time. If this is not the ase, the speedup, S, shifts downward, shaded areas in Fig. 6, from the peak values when varies between Cmin and Cmax, where Cmin and Cmax are defined in able 1, equation (15). In other words, when the DMA transfer-in time differs from the DMA transfer- time, the maximum performane degrades from the peak value, i.e. the DMA asymmetry introdues some speedup losses. An asymmetry between the DMA-IN throughput and DMA-OU throughput exists in the urrent version of the SRC-6E system. he ase of min = in =0.4 and max = =0.6, shown in Fig. 6, orresponds to the experimentally measured differene between the DMA- IN and DMA-OU times for the SRC system. From Fig. 6 and equation (16), it an be seen that the hange in the asymptoti maximum in speedup, S max, is in diret proportion to the hange in the number of hannels, K DMA, while the relative hange in its loation shifts left to less (faster omputations), i.e. the omputation for whih this maximum is ahieved, is in inverse proportion to the hange in the number of hannels. It an also be seen that as the level of DMA hannel-overlapping, V, inreases, the effet of the number of hannels on the speedup inreases, and the speedup loss, the shaded areas in Fig. 6, inreases. In addition to this, the hange in the asymptoti maximum in able 1. Equations desribing the performane of the proposed tehnique = = (1 ) NoOverlap DMA IN COMP DMA OU DMA Overlap [ n 1 V ( n 2)] Max(, ) Max(, ) V ( n 2) Max(,, ) nk K[2( n 1) V( n 2)] K[2( n 1) V( n 2)] nkdma OU nkdma IN K[2( n 1) V( n 2)] nk DMA IN nk DMA IN DMA OU DMA IN DMA IN DMA OU DMA IN DMA OU DMA OU = nk DMA OU (12) (13) S = NoOverlap Overlap (14) S n(1 ) n [ n V ( n 2)] kmin kmax K...0 kmax kmin n(1 ) =... min nn [ 1 V( n 2)] n kmin kmax K[2( n 1) V( n 2)] n(1 )... max n ( ) S max max min where 1 K KDMA... V = 0 2 = lim S = n = max K KDMA... V = 1 K[2( n 1) V( n 2)] K[2( n 1) V( n 2)] in min = k = Min(, n min n KDMA IN KDMA ) OU K[2( n 1) V( n 2)] K[2( n 1) V( n 2)] in max = k = Max(, n max n KDMA IN KDMA ) OU and max min 2K... V = 0 KDMA = = K... V = 1 KDMA (15) (16) where 1 K DMA IN = KDMA OU = KDMA 2 1 min = Min( in, ) = max = Max( in, ) = 2 Symmetri DMA ransfers Figure 6. heoretial asymptoti speedup (n )
6 Figure 7. heoretial asymptoti speedup for different K (SRC-6E ase) speedup, S max, is in diret proportion to the hange in the number of onurrent proessing units, K C, and the shift in its loation, right shift to larger (slower omputations), is also diretly proportional to the hange in K C SRC-6E Case Study Model Parameters SRC-6E reonfigurable omputer has been used as our testbed to verify our model. o apply our model to SRC-6E system we set the model parameters with some experimentally measured values, and others from the mahine speifiations. he mahine parameters are set to the following values: in =0.4, =0.6 (asymmetri DMA) K DMA-IN = K DMA-OU =1 (single-hannel DMA) V=0 (non-overlapped DMA hannels) Fig. 7 shows a plot of the asymptoti speedup against C for different K C. his figure shows the effet on speedup of the DMA asymmetry, as well as the effet of omputations onurreny, i.e. the number of onurrent proessing units and/or the number of independent data hannels between the OBM and the FPGA (see Fig. 4). he peak speedup, S max, an be alulated from the following equation: 1 1 S = K = K = K 0.83 (17) max 2 2 max In the experimental verifiation of this model we investigated only appliations with the parameter K C set to he Design Problem he design problem an be stated as follows: given the mahine onstraints and the appliation onstraints, what is the minimum number of transfer parels that ahieves a speedup as lose as possible to the asymptoti maximum for that appliation? In other words, given in,, K DMA- IN, K DMA-OU,V, and K C, we are trying to find the minimum n, n min, that gives speedup S very lose to S with an a) b) Figure 8. he design regions for different n (SRC-6E ase)
7 able 2. Design values for the minimum number of transfer parels, n min effiieny E near to 1, where S is the asymptoti value of S for this speifi appliation, and E is the ratio between S and S. From Fig. 8 the design problem an be broken down into two ases, namely when 2 min > max and when 2 min < max. able 2 serves as a guideline to finding the required n min. 5. Experimental Results he experimental work has been performed, as mentioned earlier, on the SRC-6E. In our experiments, we seleted a ertain value of, and then repeated the experiment multiple number of times with the different number of transfer parels, n. We started with n=1 (no overlap, speedup = 1), then n = 2, 4, 8, 16, 32. hen, we repeated the experiments for different values of. he results of experiments are summarized in Fig. 9. All urves, for any value of, start with the unity speedup when n = 1 (no overlap ase), then as n inreases the speedup inreases. After the speifi number of stages the speedup starts to saturate. In our experiments, we have obtained the maximum speedup when was equal to one and n was equal to 16. he speedup obtained for these parameters was equal to 1.78, and was onsistent with our theoretial preditions as in equation (17) for the ase of min = 0.4, max = 0.6 and K C = 1. We also onfirmed experimentally that the maximum performane ould be aomplished when was lose to one. When was larger or lower than one, the speedup deteriorated. Figue 9. Experimental values of speedup
8 For the ase of larger than one, the only gain in speedup is to hide the DMA time within the omputations time. When the DMA transfer is very short relative to the omputations time, the gain will also be very small. Similarly, when is smaller than one, the gain is to hide the omputations time within the DMA time. So, the idea is always to hide the shorter time within the longer time, and when both times are lose to eah other, we an obtain a speedup lose to Conlusions In this paper, a tehnique for optimizing the performane of a reonfigurable omputer is introdued. A mathematial model for this tehnique has been derived for a generi reonfigurable mahine, taking into aount the onstraints imposed by both the system and the appliation. his tehnique depends on overlapping the omputations on the User FPGAs with the I/O transfer. his overlapping requires dividing data transfers into multiple transfer parels that an be overlapped with partial omputations. he presented tehnique has been implemented and experimentally verified on the SRC-6E reonfigurable omputer. Both theoretial analysis and experimental results proved that this tehnique is effiient in speeding up the exeution time. he maximum theoretial speedup was shown to be 2 for an appliation with one proessing unit and a system with a single DMA hannel perfetly balaned for DMA-IN and DMA-OU transfers. For the urrent generation of the SRC system, the theoretial maximum speedup was shown to be 1.83, and the orresponding experimental maximum speed-up was Referenes [1] SRC-6E C-Programming Environment Guide, SRC Computers, In [2] Fidani O. D., Diab H., El-Ghazawi., Gaj K., and Alexandridis N., Implementation rade-offs of riple DES in the SRC-6e Reonfigurable Computing Environment, Pro. MAPLD [3] Fidani O.D., Poznanovi D., Gaj K., El-Ghazawi., and Alexandridis N., Performane and Overhead in a Hybrid Reonfigurable Computer, Reonfigurable Arhitetures Workshop, RAW 2002, Pro. International Parallel and Distributed Proessing Symposium (IPDPS) Workshops 2003, Nie, Frane, April 22-26, 2003, pp [4] Mihalski A., Gaj K., El-Ghazawi., An Implementation Comparison of an IDEA Enryption Cryptosystem on wo General-Purpose Reonfigurable Computers, Pro. FPL 2003, Lisbon, Sept. 2003, pp [5] Parhi K.K., VLSI Digital Signal Proessing Systems: Design and Implementation, John Wiley & Sons, NY, [6] El-Ghazawi. and Le Moigne J., Multiresolution Wavelet Deomposition on the MasPar Massively Parallel System, International Journal of Computers and heir Appliations, September [7] Mallat S.G., A heory for Multiresolution Signal Deomposition: he Wavelet Representation, IEEE ransations on Pattern Analysis and Mahine Intelligene, Vol. 11, No. 7, July [8] Hwang K. and u Z., Salable Parallel Computing: ehnology, Arhiteture, Programming, MGrawHill, 1998.
Exploring the Commonality in Feature Modeling Notations
Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More 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 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 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 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 informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More 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 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 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 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 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 informationBoosted Random Forest
Boosted Random Forest Yohei Mishina, Masamitsu suhiya and Hironobu Fujiyoshi Department of Computer Siene, Chubu University, 1200 Matsumoto-ho, Kasugai, Aihi, Japan {mishi, mtdoll}@vision.s.hubu.a.jp,
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 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 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 informationThis fact makes it difficult to evaluate the cost function to be minimized
RSOURC LLOCTION N SSINMNT In the resoure alloation step the amount of resoures required to exeute the different types of proesses is determined. We will refer to the time interval during whih a proess
More 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 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 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 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 informationPlot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar
Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation
More information13.1 Numerical Evaluation of Integrals Over One Dimension
13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied
More 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 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 informationZippy - A coarse-grained reconfigurable array with support for hardware virtualization
Zippy - A oarse-grained reonfigurable array with support for hardware virtualization Christian Plessl Computer Engineering and Networks Lab ETH Zürih, Switzerland plessl@tik.ee.ethz.h Maro Platzner Department
More informationMethods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems
Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Arne Hamann, Razvan Rau, Rolf Ernst Institute of Computer and Communiation Network Engineering Tehnial University of Braunshweig,
More informationUnsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks
Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens
More 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 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 informationCalculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem
Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion
More 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 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 informationAnd, the (low-pass) Butterworth filter of order m is given in the frequency domain by
Problem Set no.3.a) The ideal low-pass filter is given in the frequeny domain by B ideal ( f ), f f; =, f > f. () And, the (low-pass) Butterworth filter of order m is given in the frequeny domain by B
More informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
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 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 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 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 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 informationCOSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems
COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems Andreas Brokalakis Synelixis Solutions Ltd, Greee brokalakis@synelixis.om Nikolaos Tampouratzis Teleommuniation
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 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 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 informationFuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis
Journal of Computer Siene 4 (): 9-97, 008 ISSN 549-3636 008 Siene Publiations Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis Deepti Gaur, Aditya Shastri and Ranjit Biswas Department of Computer
More 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 informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
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 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 Unified Subdivision Scheme for Polygonal Modeling
EUROGRAPHICS 2 / A. Chalmers and T.-M. Rhyne (Guest Editors) Volume 2 (2), Number 3 A Unified Subdivision Sheme for Polygonal Modeling Jérôme Maillot Jos Stam Alias Wavefront Alias Wavefront 2 King St.
More informationSmooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints
Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of
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 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 informationAlgorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking
Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient
More 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 informationParticle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating
Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur
More informationInterconnection Styles
Interonnetion tyles oftware Design Following the Export (erver) tyle 2 M1 M4 M5 4 M3 M6 1 3 oftware Design Following the Export (Client) tyle e 2 e M1 M4 M5 4 M3 M6 1 e 3 oftware Design Following the Export
More 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 informationSAND Unlimited Release Printed November 1995 Updated November 29, :26 PM EXODUS II: A Finite Element Data Model
SAND92-2137 Unlimited Release Printed November 1995 Updated November 29, 2006 12:26 PM EXODUS II: A Finite Element Data Model Gregory D. Sjaardema (updated version) Larry A. Shoof, Vitor R. Yarberry Computational
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 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 informationArchitecture and Performance of the Hitachi SR2201 Massively Parallel Processor System
Arhiteture and Performane of the Hitahi SR221 Massively Parallel Proessor System Hiroaki Fujii, Yoshiko Yasuda, Hideya Akashi, Yasuhiro Inagami, Makoto Koga*, Osamu Ishihara*, Masamori Kashiyama*, Hideo
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 informationAn Evaluation of Automatic and Interactive Parallel Programming Tools
An Evaluation of Automati and Interative Parallel Programming Tools Doreen Y Cheng Computer Siene Co NASA Ames Researh Center MS 258-6 Moffett Field, CA 9435 Douglas M Pase Formerly at NASA (CSC) Cray
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 informationA Dictionary based Efficient Text Compression Technique using Replacement Strategy
A based Effiient Text Compression Tehnique using Replaement Strategy Debashis Chakraborty Assistant Professor, Department of CSE, St. Thomas College of Engineering and Tehnology, Kolkata, 700023, India
More 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 informationTorpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control
orpedo rajetory Visual Simulation Based on Nonlinear Bakstepping Control Peng Hai-jun 1, Li Hui-zhou Chen Ye 1, 1. Depart. of Weaponry Eng, Naval Univ. of Engineering, Wuhan 400, China. Depart. of Aeronautial
More information1. Introduction. 2. The Probable Stope Algorithm
1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground
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 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 informationMulti-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality
INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of
More informationarxiv: v1 [cs.db] 13 Sep 2017
An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution
More informationCONSIDERING the high computational load of synthetic
IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, VOL. 5, NO. 4, OCTOBER 2008 573 Doppler Keystone Transform: An Approah Suitable for Parallel Implementation of SAR Moving Target Imaging Gang Li, Member, IEEE,
More informationThe recursive decoupling method for solving tridiagonal linear systems
Loughborough University Institutional Repository The reursive deoupling method for solving tridiagonal linear systems This item was submitted to Loughborough University's Institutional Repository by the/an
More informationPerformance and Overhead in a Hybrid Reconfigurable Computer
Performance and Overhead in a Hybrid Reconfigurable Computer Osman Devrim Fidanci 1, Dan Poznanovic 2, Kris Gaj 3, Tarek El-Ghazawi 1, Nikitas Alexandridis 1 1 George Washington University, 2 SRC Computers
More informationSeries/1 GA File No i=:: IBM Series/ Battery Backup Unit Description :::5 ~ ~ >-- ffi B~88 ~0 (] II IIIIII
Series/1 I. (.. GA34-0032-0 File No. 51-10 a i=:: 5 Q 1 IBM Series/1 4999 Battery Bakup Unit Desription B88 0 (] o. :::5 >-- ffi "- I II1111111111IIIIII1111111 ---- - - - - ----- --_.- Series/1 «h: ",
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 informationEXODUS II: A Finite Element Data Model
SAND92-2137 Unlimited Release Printed November 1995 Distribution Category UC-705 EXODUS II: A Finite Element Data Model Larry A. Shoof, Vitor R. Yarberry Computational Mehanis and Visualization Department
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 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 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 informationSparse Certificates for 2-Connectivity in Directed Graphs
Sparse Certifiates for 2-Connetivity in Direted Graphs Loukas Georgiadis Giuseppe F. Italiano Aikaterini Karanasiou Charis Papadopoulos Nikos Parotsidis Abstrat Motivated by the emergene of large-sale
More informationDesign of High Speed Mac Unit
Design of High Speed Ma Unit 1 Harish Babu N, 2 Rajeev Pankaj N 1 PG Student, 2 Assistant professor Shools of Eletronis Engineering, VIT University, Vellore -632014, TamilNadu, India. 1 harishharsha72@gmail.om,
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 information8 Instruction Selection
8 Instrution Seletion The IR ode instrutions were designed to do exatly one operation: load/store, add, subtrat, jump, et. The mahine instrutions of a real CPU often perform several of these primitive
More 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 informationCleanUp: Improving Quadrilateral Finite Element Meshes
CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)
More informationSimulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects
Raabe, Roters, Wang Simulation of Crystallographi Texture and Anisotropie of Polyrystals during Metal Forming with Respet to Saling Aspets D. Raabe, F. Roters, Y. Wang Max-Plank-Institut für Eisenforshung,
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 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 informationThe Implementation of RRTs for a Remote-Controlled Mobile Robot
ICCAS5 June -5, KINEX, Gyeonggi-Do, Korea he Implementation of RRs for a Remote-Controlled Mobile Robot Chi-Won Roh*, Woo-Sub Lee **, Sung-Chul Kang *** and Kwang-Won Lee **** * Intelligent Robotis Researh
More informationtimestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else
3rd International Conferene on Multimedia Tehnolog(ICMT 013) An Effiient Moving Target Traking Strateg Based on OpenCV and CAMShift Theor Dongu Li 1 Abstrat Image movement involved bakground movement and
More informationTest Case Generation from UML State Machines
Test Case Generation from UML State Mahines Dirk Seifert To ite this version: Dirk Seifert. Test Case Generation from UML State Mahines. [Researh Report] 2008. HAL Id: inria-00268864
More informationParametric Abstract Domains for Shape Analysis
Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University
More 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 informationC 2 C 3 C 1 M S. f e. e f (3,0) (0,1) (2,0) (-1,1) (1,0) (-1,0) (1,-1) (0,-1) (-2,0) (-3,0) (0,-2)
SPECIAL ISSUE OF IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION: MULTI-ROBOT SSTEMS, 00 Distributed reonfiguration of hexagonal metamorphi robots Jennifer E. Walter, Jennifer L. Welh, and Nany M. Amato Abstrat
More informationThe Mathematics of Simple Ultrasonic 2-Dimensional Sensing
The Mathematis of Simple Ultrasoni -Dimensional Sensing President, Bitstream Tehnology The Mathematis of Simple Ultrasoni -Dimensional Sensing Introdution Our ompany, Bitstream Tehnology, has been developing
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 informationBSPLND, A B-Spline N-Dimensional Package for Scattered Data Interpolation
BSPLND, A B-Spline N-Dimensional Pakage for Sattered Data Interpolation Mihael P. Weis Traker Business Systems 85 Terminal Drive, Suite Rihland, WA 995-59-946-544 mike@vidian.net Robert R. Lewis Washington
More information