Modeling Parallel Applications Performance on Heterogeneous Systems
|
|
- Alan Gray
- 5 years ago
- Views:
Transcription
1 Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln Lincoln, NE [alaroo, nohaed, iang, Abstract The current technologies have ade it possible to execute parallel applications across heterogeneous platfors. However, the perforance odels available do not provide adequate ethods to calculate, copare and predict the applications perforance on these platfors. In this paper, we discuss an enhanced perforance evaluation odel for parallel applications on heterogeneous systes. In our analysis, we include achines of different architectures, specifications and operating environents. We also discuss the enabling technologies that facilitate such heterogeneous applications. The odel is then validated through experiental easureents using an agent-based parallel Java syste, which facilitates siultaneous utilization of heterogeneous systes for parallel applications. The odel provides good evaluation etrics that allow developers to assess and copare the parallel heterogeneous applications perforances. Key Words Parallel applications, heterogeneous systes, cluster, and perforance odel. 1. Introduction High perforance, parallel and distributed applications are becoing increasingly resource-intensive, requiring high speed processors, large eory capacity, huge and fast storage systes, and fast, reliable interconnections. However, ost applications are confined within a single architecture due to the achine dependant nature of the developent environents. Recently soe effort has been invested in providing parallel prograing capabilities that can siultaneously span ultiple heterogeneous platfors. Such environents could provide efficient parallel executions by allowing heterogeneous applications to be atched to suitable heterogeneous platfors. One strong direction in developing these environents is using Java, thus enabling the utilization of heterogeneous systes in executing parallel applications. The success of such efforts has also led to the need for soe foral analytical odels to evaluate and copare the perforance of applications utilizing these systes. The heterogeneity of a syste can be defined in different ways depending on the varying characteristics. In one scenario, for exaple, a network of workstations (NOW) ay be considered heterogeneous due to the varying load on each achine, thus the available resources on each workstation are not always the sae. In a second scenario, a heterogeneous syste is a collection of different achines with varying architectures, different nuber of processors and operating environents. In this paper, heterogeneity refers to the second scenario. Execution of parallel applications on heterogeneous systes can benefit fro a suitable odel that easures and evaluates their to anage and schedule resources ore effectively. The existing perforance odels addressing this issue are ostly restricted to heterogeneous systes that contain siilar (hoogeneous) coponents, but with varying loads on each coponent. In addition, alost all odels assue single-thread achines that execute exactly one task of the application at any given tie (see Section 3). This paper presents an enhanced odel for easureents that accoodates heterogeneous systes with varying achine configurations and different nubers of processors per achine. To enable heterogeneous parallel applications, portable and achine independent systes and developent tools are needed. Java is considered a very suitable prograing language for such applications because Java is achine independent. Therefore, Java code can be copiled once and the resulting bytecode can be executed on any achine with any operating syste without any changes. Therefore, uch effort has been put into providing Java-based parallel systes [1]. In this paper, we introduce an exaple agent-based syste for parallel Java applications [2]. This syste uses a Java obect-passing interface (JOPI) [9] and allows siultaneous execution of the application parallel processes on heterogeneous achines. We will use JOPI 1
2 for our experients to evaluate and validate the enhanced perforance odel. This paper will first discuss the enabling technology including the agent-based run-tie environent and JOPI in section 2. Section 3 describes soe of the easureent etrics for parallel applications and the enhanceents added to accoodate heterogeneous applications perforance evaluation. In section 4, we will present the experiental evaluations using soe benchark applications. Finally, Section 5 concludes the paper with soe rearks about current and future work. 2. Heterogeneous Systes In the context of this paper, we define a heterogeneous syste (HS) as a collection of achines of varying architectures, nuber of processors and operating environents that are connected via a local area network (LAN). However, the prototype syste and analysis introduced later in the paper apply to heterogeneous systes connected via other types of networks. An exaple heterogeneous syste is a collection of a ultinode Linux-based cluster connected to an IRIX-based ulti-processor achine (e.g. SGI origin 2000) and a collection of Windows-based servers. Soe research has been conducted to study and analyze heterogeneous applications perforance, but ost of it is based on theoretical analysis and considering heterogeneity in ters of varying loads on siilar achines [15, 5, 10, 14]. This ay be attributed to the fact that, at the tie, the available technology did not provide an easy way to deploy and execute applications on varying platfors siultaneously. However, soe research has been done proposing odels and techniques to ipleent parallel applications for heterogeneous networks such as in [3]. Although any developent tools and languages can be used for such parallel applications and environents, currently, Java s achine independence provides the perfect developent tool for parallel and distributed applications that span heterogeneous platfors. Standard Java technologies such as Java virtual achine (JVM) [13] and JINI [7] provide a variety of features to develop and ipleent distributed Java applications. However, there are soe key features lacking in JVM when directly applied as an underlying infrastructure for constructing and executing parallel Java applications on heterogeneous systes. These issing features, needed by different parallel Java prograing odels, include: Loading user progras onto the reote JVMs of the heterogeneous syste nodes, Managing the heterogeneous syste resources, Scheduling user obs, Security, Job and thread naing, and User coands and collective operations A nuber of research groups have worked on providing parallel capabilities in Java [1], which is portable by nature. However, there is little work done on the utilization of heterogeneous platfors to execute parallel applications and analyze their perforance. This section discusses an exaple Java-based environent that facilitates executing parallel Java applications on heterogeneous systes. The ain advantages of utilizing heterogeneous systes are: 1. Achieving high perforance results at a relatively low cost copared to ultiprocessor parallel achines. 2. Easier expandability and upgrade of the hardware by adding ore achines that are not necessarily the sae as the existing ones or replacing existing achines by newer ones. 3. Allowing for better utilization of the different architectures by scheduling application coponents on the achines ost suitable for the. For exaple, if soe sections of the application are tightly coupled and require frequent counications, these sections can be scheduled on an MPP or SMP achine, while other sections that are relatively independent can be scheduled on a cluster of workstations in the syste. We ipleented an exaple parallel Java syste that supports these requireents. The syste utilizes obects for inforation (data and code) exchange and can siultaneously span ultiple heterogeneous platfors. The next sub-sections will discuss this syste and Section 4 will show the experients done using it. 2.1 An Agent-Based Infrastructure The agent-based syste prototype syste, discussed in details in [2], is designed to satisfy the requireents for heterogeneous parallel applications support. The syste provides a pure Java infrastructure based on a distributed eory odel. This akes the syste portable, secure and capable of handling different prograing odels on heterogeneous systes. The syste also supports ultithreaded execution on ulti-processor achines. The syste also has a nuber of coponents that collectively provide iddleware services for a high perforance Java environent on clusters and heterogeneous networked systes such as the software agents and client services. The ain functions of the syste are to deploy, schedule, and support the execution of the Java code, in addition to anaging, controlling, onitoring, and scheduling the available resources on clusters or on a collection of heterogeneous networked systes. Java serializable obects [13] were used as a counication unit aong the syste s coponents where each obect represents a specific type of request or reply. The client services and environent APIs provide coands for users to interact with the environent. The syste also provides features for reote deployent, ob onitoring and control, ob and thread naing and security. 2
3 2.2 The Java Obect-Passing Interface The agent-based infrastructure is capable of supporting different parallel and distributed prograing odels. For exaple, ipleenting distributed shared obect API s for Java (work in progress) and Java obect-passing interface (JOPI), which is discussed in ore details in [9]. In addition, distributed applications can utilize this infrastructure to facilitate their operation. JOPI was ipleented on top of the services provided by this infrastructure. JOPI is an obect-passing interface with priitives siilar to those in MPI, where inforation is exchanged by eans of obects instead of essages. Using JOPI, users can initiate point-to-point counications in synchronous and asynchronous odes, group counications and synchronization, in addition to a other supporting functions and attributes. JOPI utilizes ost of the features provided by the agent-based infrastructure, including scheduling echaniss, deployent and execution of user classes, control of user threads and available resources, and the security echaniss. Writing parallel progras using JOPI is generally sipler than using C and MPI, ainly due to the obect-oriented nature of Java, thus the user can define a class for solving the sequential version first and test it, then use it as the ain obect in the parallel version. A few additional ethods and classes can be added to the original classes to facilitate the decoposition and distribution of the proble, exchange of interediate results, and reconstruction of the solution. Finally, the ain class will ipleent the parallelization policy such as deciding on the size of sub-proble, load balancing, etc. Passing obects in JOPI preserves the obect-oriented advantages in Java and siplifies the parallelization process and the inforation exchange echaniss. 3. The Perforance Model With the technology available to develop and execute heterogeneous parallel applications on heterogeneous systes, it is necessary to provide a odel that will provide a better understanding of the perforance of such applications. There has been a long debate on what is the best ethod to represent the perforance of a parallel application. Generally, the speedup and efficiency etrics are considered adequate given the appropriate description of how exactly they are easured and reported. In soe cases, however, speedup can be isleading because it ay give a distorted picture. The one etrics that alost all agree on is the elapsed tie (response tie) [4]. Elapsed tie is directly easured for the application and it encapsulates all affecting attributes such as syste tie and counication tie. In addition, it represents what the user can relate to as a perforance easure. However, it is not useful when trying to predict the perforance of the application with different settings such as larger input sets or ore processors. In addition, Most easureents and analyses are done at the application level rather than the lower level to provide a practical view of how parallel applications will perfor on a heterogeneous syste and what the user can expect to achieve with different syste configurations or algoriths. The other issue that needs to be considered is the type of environent used to execute the parallel application. Most of the odels and etrics, developed earlier, are based on the hoogeneous environent, thus, not accounting for the possible differences between the participating achines. For exaple, speedup is easured as the elapsed tie at one processor T 1 divided by the tie at p processors T p. In this case, if soe of the processors are slower than others, the effect will not be evident. Soe research has been conducted to consider the heterogeneity of parallel applications and soe basic etrics were defined in [15, 5, 10, 14]. In [15], the authors introduced a odel to easure and evaluate parallel applications perforance on heterogeneous networks. However, the heterogeneity was defined based on the different loads on the participating achines. Therefore, the odel assued a cluster of siilar achines connected by a unifor network and each achine can execute exactly one task (process) at any given point of tie. However, current technology and developent tools allow for utilizing heterogeneous systes, which these odels do not consider. The reainder of this section briefly discusses the odel introduced in [15] and extends it analytically to accoodate for heterogeneous systes, where participating achines have ultiple processors, different architectures and varying CPU/Meory/IO perforances. In addition, the enhanced odel incorporates achines that execute ultiple tasks siultaneously. The power of a achine M i is defined by the aount of work the achine can coplete in unit tie. The power weight W i (A) of achine M i with application A is given as the aount of work M i can coplete relative to the fastest available achine in the syste. Thus, the power weight of a achine can be calculated by either equation (1) or (2) as follows Si ( A) Wi ( A) ax { S ( 1 A in 1{ T( A, M Wi ( A) T( A, M ) i...(1) )} )}...(2) where S i (A) is the speed of the achine (MIPS or FLOPS) executing application A. T(A, M i ) is the elapsed execution tie for application A on achine M i. 3
4 is the total nuber of achines in the heterogeneous syste HS. Using the Power weight of the achines provides a ore accurate easure of the effect each achine will have on the syste, thus giving a clear view of how the syste perfors. Using this definition [15] derives the speedup SP, efficiency E, and the syste heterogeneity H definitions such that in 1 { T ( A, M )} SP...(3) T ( A, HS) SP E...(4) W ( ) H 1 A 1 (1 W ( A))...(5) Based on the above odel, we introduce a nuber of assuptions to extend the odel for a truly heterogeneous syste. The aor difference is that any achine can execute ultiple parallel tasks siultaneously. The original odel assues that each achine in the syste executes a single task at any point of tie; therefore, the power weight can be calculated using the achine s speed. However, in the current situation, each achine can have one or ore processors and can siultaneously execute ultiple tasks of the application. 1. The power factor calculations reain the sae using the elapsed tie of the application on a single processor of that achine. However, it is also possible to consider the total nuber of processors used on that achine as one, thus, taking the power factor based on the execution tie using all the processors. Nevertheless, this will lead to having to recalculate the power weight of all achines every tie the nuber of processors used changes. 2. Machines are dedicated, thus no owner copute tie is involved. However, other effects on tie such as syste and idle tie and counication costs are considered in the odel as part of total elapsed tie. 3. The easureents are application dependant to a liited extent. In any cases the effect of the application reain negligible as long as the application and its data fit in ain eory during execution, thus no page swapping is involved. Without the overhead of eory paging, applications will behave siilarly. 4. To calculate the power weights of achines we rely on the execution tie of the application, not the speed of the achine. The tie gives a ore accurate easure of the achine s overall perforance because it accounts for all affecting attributes such as actual CPU tie, idle tie and I/O tie. 5. The odel is applied at the application level to reflect the user s perception of the application perforance. In addition, this siplifies the odel by incorporating all tie considerations within a single easureent. This for provides a easure of the relative achine powers with respect to the parallel application used. When ultiple processes execute on the achine, the elapsed tie will include processing tie and additional overhead iposed by both the syste and counication. Thus, the efficiency calculations need to be adusted to accoodate for the varying nuber of processors on each achine. Siilarly, calculating the heterogeneity of the syste requires accounting for the nuber of processor used on each achine. E 1 H 1 SP W * n ( n...(6) *(1 W ( A)))...(7) where n is the nuber of processors (or tasks) used in achine M. By ultiplying the nuber of processors n by the power weight W of the achine M, we can represent the expected power weight of that achine using the n processors rather than a single processor. Based on equation (6), the power weight of a achine M is its weight using a single processor. The product n *W gives an estiate of the power weight when n processors are used to execute n tasks of the application. Therefore, this estiate does not account for the counication overhead iposed between the n processors within the achine M. However, the overhead is relatively very sall because the processors reside in a single achine and within close proxiity of each other. Equation (7) represents the true effect of having achines with different configurations and coputing power, hence providing a representative evaluation etric for applications perforance. Using equation (7), it is also possible to reverse the calculations to predict the execution tie of the application if part of the configurations has changed. Given the efficiency and power weights of the current configuration, the speedup can be calculated fro equation (6). Using the speedup deterined and equation (3), T(A, HS) for the new configuration can be calculated. This value is an approxiate value of the expected perforance with the new configuration. The efficiency value used can either be the sae as the current configuration efficiency or be an estiated value of the next possible efficiency using the available easureents. The efficiency can be estiated by extrapolating the efficiency graph against the nuber of processors used. This is achievable by calculating the efficiency values for a nuber of easureents, plotting the results and eploying a curve fitting technique on the plot. A sipler linear extrapolation can also be used, but this will give a less accurate estiate. 4
5 Siilarly, the expected elapsed tie for the application with a different input size can be estiated. The odel provides a unifor ethod to easure and evaluate parallel application perforance on a heterogeneous syste. The odel relies on the easured elapsed tie to calculate the power weight of the achines. Using the power weights and elapsed tie of the parallel application, speedup, efficiency and heterogeneity can be calculated. Moreover, the calculations can be reversed to estiate the elapsed tie for other proble settings such as larger data sets or different syste configurations. However, one shortcoing is that it ay require recalculating all the power weights of the achines if the fastest achine was reoved or replaced by a faster one. 4. Model Validation Soe benchark applications were written to evaluate the perforance of the heterogeneous syste using JOPI. All experients used standard JVM sdk and were executed on hoogeneous and heterogeneous clusters. The platfors used are listed in table 1. Nae Platfor Description CSNT 3 CPUs, Intel x86 700MHz, 1.5GB RAM. OS: Windows 2000 advanced server RCF Origin 2000, 32 processors, 250 MHz, 4MB cache, 8GB RAM. OS: IRIX SH Cluster, 24 nodes, dual 1.2 MHz AthlonMP, 256KB cache, 1GB RAM per node. OS:Linux Table 1: A list of Machines used in the experients 4.1 Traveling Salesan Proble (TSP) The algorith is based on branch-and-bound search [8]. This proble required using any of the JOPI priitives to ipleent an efficient load-balanced solution. Broadcast was used to distribute the original proble obect to processes and used by processes to broadcast the iniu tour value found. This allows other processes to update their iniu value to speedup their search. In addition, asynchronous counication is used by the processes to report their results to the aster process, while continuing to process other parts. The results obtained (Figure 1) show good speedup easures with growing nuber of processors and fixed proble size (22 cities). The TSP was also executed on a heterogeneous cluster consisting of nodes fro SH and CSNT. In this case the initial calculations of the power weight shows that SH is the fastest achine and CSNT has around.94 power relative to SH. TSP was executed using different Speedup TSP on Sandhills configurations of heterogeneous processors fro SH and CSNT (see table 2). The results show that the efficiency at four processors is 64%, which is low because of the counication overhead, but when ore of SH (the faster achine) processors are added, the efficiency increases. Using the inforation in table 2, we can estiate the elapsed tie for the application if the configurations change. For exaple, assue we need to estiate the tie for the 6-2 cobination, then we first estiate the expected efficiency. This is done either by using the efficiency fro the 4-2 cobination (77.8%) or by estiating the value by ethods like curve fitting. For illustration, we will use the available value, thus equation (7) gives the speedup for the new configuration to be Using equation (3), T(A, HS) is calculated to be s. Copared to the experiental result, the percentage error is only 3.1 percent. No. of Processors Efficiency Total SH CSNT Tie (sec) Speedup (%) PW Table 2. Perforance easureent for TSP on a heterogeneous syste. 4.2 Matrix Multiplication TSP IDEAL No. of Processors Figure 1. Speedup results for TSP (22 cities) on a hoogeneous cluster. A dense atrix ultiplication (MM) algorith [6] is used with load balancing echanis and synchronous 5
6 point-to-point counication. The first atrix is divided into blocks of rows and the second is divided into blocks of coluns. Each process gets a block of rows and a block of coluns and when work is done, the process sends its results to the aster process and takes new blocks to copute. Here, a atrix of size 1800x1800 floating nubers was used, with a stripe size of 300 rows or coluns. The initial results, on Sandhills (SH), RCF and CSNT are illustrated in Figure 2. The second part of the experient was conducted using the MM on a heterogeneous cluster consisting of processors for RCF, SH, and CSNT (see Table 3). the efficiency calculated by dividing the speedup by the total nuber of processors used (regardless of their contribution) we find that it becoes lower for systes containing ore slow achines than fast ones. For exaple, for the sae configuration entioned above, the direct efficiency (speedup / No. of processors) is 51%, which is lower than the one calculated by equation (7). Moreover, if we consider a configuration with achines of siilar power weights, the efficiency is siilar in both cases. As shown in this experient, the easureent etrics provided by the odel for heterogeneous parallel applications resulted in a better understanding and ore accurate representation of the results. Speedup MM on Sandhills (SH), RCF, and CSNT SH CSNT RCF IDEAL Nuber of Procesors Figure 2: Speedup for the MM on hoogeneous clusters. The results reported were derived fro the tie easureents of the application (see Figure 3) using the odel introduced in Section 3. The power weight PW of the achines show that SH has the best response tie thus is taken as the reference for PW calculations using equation (2) for RCF and CSNT. In addition, the speedup was calculated using equation (3); however, fro the results it is evident that speedup alone does not provide an accurate representation of the heterogeneity of the syste. The efficiency, on the other hand, was calculated using equation (7) and it takes into account the differences in achine perforances and gives a better representation of the perforance. By coparing with the experient on SH alone, the efficiency results show how the different speeds of achines in the heterogeneous cluster affected the outcoe. For exaple, at six processors on SH we get 86% efficiency, while using three processors in SH and three fro CSNT, which has siilar speed as SH, we achieved 81%. However, at 12 processors in SH we achieved 74% efficiency as opposed to 63% using six processors fro SH, three fro CSNT and 3 fro RCF, which is uch slower than the other two achines. In addition, if we copare the efficiency calculated here with No. Processors Elapsed Total SH RCF CSNT Tie (sec) Relative Speedup Efficiency (%) PW Table 3 Perforance easureent for MM on a heterogeneous syste. Tie (illiseconds) Figure 3. Elapsed tie for MM on hoogeneous clusters and heterogeneous systes. 4.3 Discussion MM on SH, CSNT, RCF and All SH CSNT ALL RCF No. of Processors As shown by the experients above, the proposed odel gives a better representation and understanding of the heterogeneous parallel applications. The efficiency 6
7 and heterogeneity of the syste can be calculated in a way that reflects the true configurations of the syste. In addition, the experients show how the odel fits with the experientally easured values. Finally, the odel can also be used to estiate the possible elapsed tie for an application with different data sets or different syste configurations. This inforation would be essential in helping decide what achines and how any need to be used to achieve the desired levels of efficiency and response tie. Moreover, the existence of the agent-based parallel Java enabled these experients and provided a valuable opportunity to validate the proposed odel. 5. Conclusion The odel introduced in this paper extends soe available etrics to evaluate the perforance of heterogeneous parallel applications. The extensions ainly accoodate the varying platfors and operating environents used and the possibility of having ultiple tasks of the parallel application on each achine. Using the enhanced etrics, it is possible to calculate the speedup and efficiency of the application and further estiate the perforance for a different proble size or different heterogeneous syste configurations. Generally, this odel is essential because current technology allows for the siultaneous utilization of heterogeneous systes to execute parallel applications. In this paper, we discussed an exaple for such a syste, the agent-based infrastructure and JOPI, which were used to develop the experients and evaluate the introduced odel. The results show that heterogeneous systes can provide aple coputing power without the need to upgrade or change the available systes. In addition, the perforance odel provides a eans of evaluating these applications and representing the results in a way representative of the heterogeneous nature of the environent. However, soe autoated easureent and profiling tools ay be helpful in deterining perforance values. This is left for future investigation. 6. Acknowledgeent This proect was partially supported by a National Science Foundation grant (EPS ) and a Nebraska University Foundation grant ( ), for which we are grateful. We would also like to thank other ebers of the secure distributed inforation (SDI) group [12] and the research coputing facility (RCF) [11] at the University of Nebraska-Lincoln for their continuous help and support. References [1] Al-Jaroodi, J., Mohaed, N., Jiang, H. and Swanson, D., A Coparative Study of Parallel and Distributed Java Proects for Heterogeneous Systes, in Workshop on Java for Parallel and Distributed Coputing at IPDPS 2002, Ft Lauderdale, Florida, [2] Al-Jaroodi, J., Mohaed, N., Jiang, H. and Swanson, D., An Agent-Based Infrastructure for Parallel Java on Heterogeneous Clusters, in proceedings of IEEE International Conference on Cluster Coputing (CLUSTER 02), Chicago, Illinois, Septeber 23 26, [3] A. A. Aly, A. S. Elaghraby, and K. A. Kael, Parallel Prograing on top of Networks of Heterogeneous Workstations (NHW), Proceedings of The International Society for Coputers and Their Applications, International Conference on Coputer Applications in Industry and Engineering (CAINE- 98), Las Vegas, Nevada., W. Perrizo (editor), pp: [4] Crowl, L., How to Measure, Present, and Copare Parallel Perforance, IEEE Parallel and Distributed Technology, Spring 1994, pp [5] Donaldson, V., Beran, F. and Paturi, R., Progra Speedup in Heterogeneous Coputing Network, Journal of Parallel and Distributed Coputing 21, , [6] Gunnels, J., Lin, C., Morrow, G. and Gein, R., Analysis of a Class of Parallel Matrix Multiplication Algoriths, Technical paper, 1998, utexas.edu/users/plapack/papers/ipps98/ipps98.htl [7] The Jini Counity [8] Karp, R. and Zhang, Y., Randoized Parallel Algoriths for Backtrack Search and Branch-and-Bound Coputation, Journal of the ACM, V. 40, 3, July [9] Mohaed, N., Al-Jaroodi, J., Jiang, H. and Swanson, D., "JOPI: A Java Obect-Passing Interface", in proceedings of the Joint ACM Java Grande-ISCOPE (International Syposiu on Coputing in Obect-Oriented Parallel Environents) Conference (JGI2002), Seattle, Washington, Noveber [10] Post, E. and Goosen, H., Evaluating the Parallel Perforance of a Heterogeneous Syste, in proceedings of HPC Asia 2001, Australia, Septeber [11] Research Coputing Facility at UNL hoe page. [12] Secure Distributed Inforation Group at UNL. [13] Sun Java web page [14] Xiao, L., Zhang X. and Qu, Y., Effective Load sharing on Heterogeneous Networks of Workstations, in proceedings of IPDPS 2000, Mexico, May [15] Zhang, X. and Yan, Y., Modeling and Characterizing Parallel Coputing Perforance on Heterogeneous Networks of Workstations, in proceedings of the 7 th IEEE Syposiu on Parallel and Distributed Processing (SPDPS 95),
Geo-activity Recommendations by using Improved Feature Combination
Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,
More informationAn Efficient Approach for Content Delivery in Overlay Networks
An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr
More informationEE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011
EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction
More informationAnalysing Real-Time Communications: Controller Area Network (CAN) *
Analysing Real-Tie Counications: Controller Area Network (CAN) * Abstract The increasing use of counication networks in tie critical applications presents engineers with fundaental probles with the deterination
More informationEnergy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks
Energy-Efficient Disk Replaceent and File Placeent Techniques for Mobile Systes with Hard Disks Young-Jin Ki School of Coputer Science & Engineering Seoul National University Seoul 151-742, KOREA youngjk@davinci.snu.ac.kr
More informationDerivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router
Derivation of an Analytical Model for Evaluating the Perforance of a Multi- Queue Nodes Network Router 1 Hussein Al-Bahadili, 1 Jafar Ababneh, and 2 Fadi Thabtah 1 Coputer Inforation Systes Faculty of
More informationDesigning High Performance Web-Based Computing Services to Promote Telemedicine Database Management System
Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,
More informationCollaborative Web Caching Based on Proxy Affinities
Collaborative Web Caching Based on Proxy Affinities Jiong Yang T J Watson Research Center IBM jiyang@usibco Wei Wang T J Watson Research Center IBM ww1@usibco Richard Muntz Coputer Science Departent UCLA
More informationQUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS
QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS Guofei Jiang and George Cybenko Institute for Security Technology Studies and Thayer School of Engineering Dartouth College, Hanover NH 03755
More informationPerformance Analysis of RAID in Different Workload
Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,
More informationOPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS
Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented
More informationTHE rapid growth and continuous change of the real
IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa
More informationClustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering
Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into
More informationEvaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds
Evaluation of a ulti-frae blind deconvolution algorith using Craér-Rao bounds Charles C. Beckner, Jr. Air Force Research Laboratory, 3550 Aberdeen Ave SE, Kirtland AFB, New Mexico, USA 87117-5776 Charles
More informationMAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer
MAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer Departent of Coputer Science and Engineering University of South Florida Tapa, FL 33620 Abstract -- The
More informationDetection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm
Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,
More informationMapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues
Mapping Data in Peer-to-Peer Systes: Seantics and Algorithic Issues Anastasios Keentsietsidis Marcelo Arenas Renée J. Miller Departent of Coputer Science University of Toronto {tasos,arenas,iller}@cs.toronto.edu
More informationSolving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification
Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural
More informationSurvivability Function A Measure of Disaster-Based Routing Performance
Survivability Function A Measure of Disaster-Based Routing Perforance Journal Club Presentation on W. Molisz. Survivability function-a easure of disaster-based routing perforance. IEEE Journal on Selected
More informationRedundancy Level Impact of the Mean Time to Failure on Wireless Sensor Network
(IJACSA) International Journal of Advanced Coputer Science and Applications Vol. 8, No. 1, 217 Redundancy Level Ipact of the Mean Tie to Failure on Wireless Sensor Network Alaa E. S. Ahed 1 College of
More informationShortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm
International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University
More informationRECONFIGURABLE AND MODULAR BASED SYNTHESIS OF CYCLIC DSP DATA FLOW GRAPHS
RECONFIGURABLE AND MODULAR BASED SYNTHESIS OF CYCLIC DSP DATA FLOW GRAPHS AWNI ITRADAT Assistant Professor, Departent of Coputer Engineering, Faculty of Engineering, Hasheite University, P.O. Box 15459,
More informationA Measurement-Based Model for Parallel Real-Time Tasks
A Measureent-Based Model for Parallel Real-Tie Tasks Kunal Agrawal 1 Washington University in St. Louis St. Louis, MO, USA kunal@wustl.edu https://orcid.org/0000-0001-5882-6647 Sanjoy Baruah 2 Washington
More informationMulti Packet Reception and Network Coding
The 2010 Military Counications Conference - Unclassified Progra - etworking Protocols and Perforance Track Multi Packet Reception and etwork Coding Aran Rezaee Research Laboratory of Electronics Massachusetts
More informationEnhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue
Enhancing Real-Tie CAN Counications by the Prioritization of Urgent Messages at the Outgoing Queue ANTÓNIO J. PIRES (1), JOÃO P. SOUSA (), FRANCISCO VASQUES (3) 1,,3 Faculdade de Engenharia da Universidade
More informationDefining and Surveying Wireless Link Virtualization and Wireless Network Virtualization
1 Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization Jonathan van de Belt, Haed Ahadi, and Linda E. Doyle The Centre for Future Networks and Counications - CONNECT,
More informationA Hybrid Network Architecture for File Transfers
JOURNAL OF IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 6, NO., JANUARY 9 A Hybrid Network Architecture for File Transfers Xiuduan Fang, Meber, IEEE, Malathi Veeraraghavan, Senior Meber,
More informationDesign Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems
Design Optiization of Mixed Tie/Event-Triggered Distributed Ebedded Systes Traian Pop, Petru Eles, Zebo Peng Dept. of Coputer and Inforation Science, Linköping University {trapo, petel, zebpe}@ida.liu.se
More informationAdaptive Holistic Scheduling for In-Network Sensor Query Processing
Adaptive Holistic Scheduling for In-Network Sensor Query Processing Hejun Wu and Qiong Luo Departent of Coputer Science and Engineering Hong Kong University of Science & Technology Clear Water Bay, Kowloon,
More informationA Distributed Multi-service Resource Allocation Algorithm in Heterogeneous Wireless Access Medium
1 A Distributed Multi-service Resource Allocation Algorith in Heterogeneous Wireless Access Mediu Muhaad Isail, Student Meber, IEEE, and Weihua Zhuang, Fellow, IEEE Abstract In this paper, radio resource
More informationIdentifying Converging Pairs of Nodes on a Budget
Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering
More informationA Novel Fast Constructive Algorithm for Neural Classifier
A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore
More informationOblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands
Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu
More informationTheoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem
Theoretical Analysis of Local Search and Siple Evolutionary Algoriths for the Generalized Travelling Salesperson Proble Mojgan Pourhassan ojgan.pourhassan@adelaide.edu.au Optiisation and Logistics, The
More informationClosing The Performance Gap between Causal Consistency and Eventual Consistency
Closing The Perforance Gap between Causal Consistency and Eventual Consistency Jiaqing Du Călin Iorgulescu Aitabha Roy Willy Zwaenepoel EPFL ABSTRACT It is well known that causal consistency is ore expensive
More informationA High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Membership Functions *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 21, 607-626 (2005) A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Mebership Functions * SHIH-HSU HUANG AND JIAN-YUAN LAI + Departent of
More informationScheduling Parallel Task Graphs on (Almost) Homogeneous Multi-cluster Platforms
1 Scheduling Parallel Task Graphs on (Alost) Hoogeneous Multi-cluster Platfors Pierre-François Dutot, Tchiou N Takpé, Frédéric Suter and Henri Casanova Abstract Applications structured as parallel task
More informationPrivacy-preserving String-Matching With PRAM Algorithms
Privacy-preserving String-Matching With PRAM Algoriths Report in MTAT.07.022 Research Seinar in Cryptography, Fall 2014 Author: Sander Sii Supervisor: Peeter Laud Deceber 14, 2014 Abstract In this report,
More informationCarving Differential Unit Test Cases from System Test Cases
Carving Differential Unit Test Cases fro Syste Test Cases Sebastian Elbau, Hui Nee Chin, Matthew B. Dwyer, Jonathan Dokulil Departent of Coputer Science and Engineering University of Nebraska - Lincoln
More informationGrading Results Total 100
University of California, Berkeley College of Engineering Departent of Electrical Engineering and Coputer Sciences Fall 2003 Instructor: Dave Patterson 2003-11-19 v1.9 CS 152 Exa #2 Solutions Personal
More informationA Periodic Dynamic Load Balancing Method
2016 3 rd International Conference on Engineering Technology and Application (ICETA 2016) ISBN: 978-1-60595-383-0 A Periodic Dynaic Load Balancing Method Taotao Fan* State Key Laboratory of Inforation
More informationDifferent criteria of dynamic routing
Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich
More informationA Fast Multi-Objective Genetic Algorithm for Hardware-Software Partitioning In Embedded System Design
A Fast Multi-Obective Genetic Algorith for Hardware-Software Partitioning In Ebedded Syste Design 1 M.Jagadeeswari, 2 M.C.Bhuvaneswari 1 Research Scholar, P.S.G College of Technology, Coibatore, India
More informationThe Internal Conflict of a Belief Function
The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of
More informationEvaluation of the Timing Properties of Two Control Networks: CAN and PROFIBUS
Evaluation of the Tiing Properties of Two Control Networs: CAN and PROFIBUS Max Mauro Dias Santos 1, Marcelo Ricardo Steer 2 and Francisco Vasques 3 1 UnilesteMG, CEP 35170-056, Coronel Fabriciano MG Brasil.
More informationBP-MAC: A High Reliable Backoff Preamble MAC Protocol for Wireless Sensor Networks
BP-MAC: A High Reliable Backoff Preable MAC Protocol for Wireless Sensor Networks Alexander Klein* Jirka Klaue Josef Schalk EADS Innovation Works, Gerany *Eail: klein@inforatik.uni-wuerzburg.de ABSTRACT:
More informationComputer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13
Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical
More informationPlanet Scale Software Updates
Planet Scale Software Updates Christos Gkantsidis 1, Thoas Karagiannis 2, Pablo Rodriguez 1, and Milan Vojnović 1 1 Microsoft Research 2 UC Riverside Cabridge, UK Riverside, CA, USA {chrisgk,pablo,ilanv}@icrosoft.co
More informationTensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3
2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition
More informationSecure Wireless Multihop Transmissions by Intentional Collisions with Noise Wireless Signals
Int'l Conf. Wireless etworks ICW'16 51 Secure Wireless Multihop Transissions by Intentional Collisions with oise Wireless Signals Isau Shiada 1 and Hiroaki Higaki 1 1 Tokyo Denki University, Japan Abstract
More informationA Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction
MATEC Web of Conferences 73, 03073(08) https://doi.org/0.05/atecconf/087303073 SMIMA 08 A roadband Spectru Sensing Algorith in TDCS ased on I Reconstruction Liu Yang, Ren Qinghua, Xu ingzheng and Li Xiazhao
More informationAdaptive Parameter Estimation Based Congestion Avoidance Strategy for DTN
Proceedings of the nd International onference on oputer Science and Electronics Engineering (ISEE 3) Adaptive Paraeter Estiation Based ongestion Avoidance Strategy for DTN Qicai Yang, Futong Qin, Jianquan
More informationImage Filter Using with Gaussian Curvature and Total Variation Model
IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.
More informationA wireless sensor network for visual detection and classification of intrusions
A wireless sensor network for visual detection and classification of intrusions ANDRZEJ SLUZEK 1,3, PALANIAPPAN ANNAMALAI 2, MD SAIFUL ISLAM 1 1 School of Coputer Engineering, 2 IntelliSys Centre Nanyang
More informationNews Events Clustering Method Based on Staging Incremental Single-Pass Technique
News Events Clustering Method Based on Staging Increental Single-Pass Technique LI Yongyi 1,a *, Gao Yin 2 1 School of Electronics and Inforation Engineering QinZhou University 535099 Guangxi, China 2
More informationA Comparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Problem
IE Vol. 7, No. 2, pp. 84-92, Septeber 2008. A Coparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Proble Ji Ung Sun School of Industrial and Managent Engineering Hankuk University
More informationEfficient Estimation of Inclusion Coefficient using HyperLogLog Sketches
Efficient Estiation of Inclusion Coefficient using HyperLogLog Sketches Azade Nazi, Bolin Ding, Vivek Narasayya, Surajit Chaudhuri Microsoft Research {aznazi, bolind, viveknar, surajitc}@icrosoft.co ABSTRACT
More informationA CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER
A CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER VIOLETA TOMAŠEVIĆ, SLOBODAN BOJANIĆ 2 and OCTAVIO NIETO-TALADRIZ 2 The Mihajlo Pupin Institute, Volgina 5, 000 Belgrade, SERBIA AND MONTENEGRO 2 Technical University
More informationA Low-Cost Multi-Failure Resilient Replication Scheme for High Data Availability in Cloud Storage
216 IEEE 23rd International Conference on High Perforance Coputing A Low-Cost Multi-Failure Resilient Replication Schee for High Data Availability in Cloud Storage Jinwei Liu* and Haiying Shen *Departent
More informationData & Knowledge Engineering
Data & Knowledge Engineering 7 (211) 17 187 Contents lists available at ScienceDirect Data & Knowledge Engineering journal hoepage: www.elsevier.co/locate/datak An approxiate duplicate eliination in RFID
More informationCOLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL
COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute
More informationI-0 Introduction. I-1 Introduction. Objectives: Quote:
I-0 Introduction Objectives: Explain necessity of parallel/ultithreaded algoriths Describe different fors of parallel processing Present coonly used architectures Introduce a few basic ters Coents: Try
More informationMULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES. Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou
MULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou Departent of Coputer Science and Inforation Engineering, National Chiayi
More informationAn Adaptive Low-latency Power Management Protocol for Wireless Sensor Networks
An Adaptive Low-latency Power Manageent Protocol for Wireless Sensor Networks Giuseppe Anastasi, Marco Conti*, Mario Di Francesco, Andrea Passarella* Pervasive Coputing & Networking Lab. (PerLab) Departent
More informationA New Generic Model for Vision Based Tracking in Robotics Systems
A New Generic Model for Vision Based Tracking in Robotics Systes Yanfei Liu, Ada Hoover, Ian Walker, Ben Judy, Mathew Joseph and Charly Heranson lectrical and Coputer ngineering Departent Cleson University
More informationInvestigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks
Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,
More informationRecursion-Driven Parallel Code Generation for Multi-Core Platforms
Recursion-Driven Parallel Generation for Multi- Platfors Rebecca L. Collins, Bharadwaj Vellore, and Luca P. Carloni Departent of Coputer Science, Colubia University, New York, NY 10027 Eail: {rlc2119,vrb2102,luca}@cs.colubia.edu
More informationELEN : Project Progress Report. Second Order Delay Computation for RC networks with Non-Tree Topology
ELEN 689-603: Project Progress eport Second Order Delay Coputation for C networks wi Non-Tree Topology ajeshwary Tayade 000 07 573 //003 PDF created wi pdffactory trial version www.pdffactory.co : Introduction
More informationHeterogeneous Radial Basis Function Networks
Proceedings of the International Conference on Neural Networks (ICNN ), vol. 2, pp. 23-2, June. Heterogeneous Radial Basis Function Networks D. Randall Wilson, Tony R. Martinez e-ail: randy@axon.cs.byu.edu,
More informationDevelopment of an Integrated Cost Estimation and Cost Control System for Construction Projects
ABSTRACT Developent of an Integrated Estiation and Control Syste for Construction s by Salan Azhar, Syed M. Ahed and Aaury A. Caballero Florida International University 0555 W. Flagler Street, Miai, Florida
More informationMiddleware Infrastructure for Parallel and Distributed Programming Models in Heterogeneous Systems
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln CSE Journal Articles Computer Science and Engineering, Department of 11-2003 Middleware Infrastructure for Parallel and
More informationA Soft Real-time Scheduling Server on the Windows NT
A Soft Real-tie Scheduling Server on the Windows NT Chih-han Lin, Hao-hua Chu, Klara Nahrstedt Departent of Coputer Science University of Illinois at Urbana Chapaign clin2, h-chu3, klara@cs.uiuc.edu Abstract
More informationDatabase Design on Mechanical Equipment Operation Management System Zheng Qiu1, Wu kaiyuan1, Wu Chengyan1, Liu Lei2
2nd International Conference on Advances in Mechanical Engineering and Industrial Inforatics (AMEII 206) Database Design on Mechanical Equipent Manageent Syste Zheng Qiu, Wu kaiyuan, Wu Chengyan, Liu Lei2
More informationImprove Peer Cooperation using Social Networks
Iprove Peer Cooperation using Social Networks Victor Ponce, Jie Wu, and Xiuqi Li Departent of Coputer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Noveber 5, 2007 Corresponding
More informationIntegrating fast mobility in the OLSR routing protocol
Integrating fast obility in the OLSR routing protocol Mounir BENZAID 1,2, Pascale MINET 1 and Khaldoun AL AGHA 1,2 1 INRIA, Doaine de Voluceau - B.P.105, 78153 Le Chesnay Cedex, FRANCE ounir.benzaid, pascale.inet@inria.fr
More informationExperiences with complex user profiles for approximate P2P community matching
Experiences with coplex user profiles for approxiate PP counity atching Patrizio Dazzi ISTI-CNR Pisa, Italy p.dazzi@isti.cnr.it Matteo Mordacchini IIT-CNR Pisa, Italy.ordacchini@iit.cnr.it Fabio Baglini
More informationReal-Time Detection of Invisible Spreaders
Real-Tie Detection of Invisible Spreaders MyungKeun Yoon Shigang Chen Departent of Coputer & Inforation Science & Engineering University of Florida, Gainesville, FL 3, USA {yoon, sgchen}@cise.ufl.edu Abstract
More informationNON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH
NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH V. Atienza; J.M. Valiente and G. Andreu Departaento de Ingeniería de Sisteas, Coputadores y Autoática Universidad Politécnica de Valencia.
More informationCS 361 Meeting 8 9/24/18
CS 36 Meeting 8 9/4/8 Announceents. Hoework 3 due Friday. Review. The closure properties of regular languages provide a way to describe regular languages by building the out of sipler regular languages
More informationDistributed Multi-robot Work Load Partition In Manufacturing Automation
th IEEE Conference on Autoation Science and Engineering Key Bridge Marriott, Washington DC, USA August 3-, Distributed Multi-robot Work Load Partition In Manufacturing Autoation Gira S Tewolde, Changhua
More informationAn Adaptive and Low-latency Power Management Protocol for Wireless Sensor Networks
An Adaptive and Low-latency Power Manageent Protocol for Wireless Sensor Networks Giuseppe Anastasi, Marco Conti*, Mario Di Francesco, Andrea Passarella* Pervasive Coputing & Networking Lab. (PerLab) Departent
More informationDepth Estimation of 2-D Magnetic Anomalous Sources by Using Euler Deconvolution Method
Aerican Journal of Applied Sciences 1 (3): 209-214, 2004 ISSN 1546-9239 Science Publications, 2004 Depth Estiation of 2-D Magnetic Anoalous Sources by Using Euler Deconvolution Method 1,3 M.G. El Dawi,
More informationAn Ad Hoc Adaptive Hashing Technique for Non-Uniformly Distributed IP Address Lookup in Computer Networks
An Ad Hoc Adaptive Hashing Technique for Non-Uniforly Distributed IP Address Lookup in Coputer Networks Christopher Martinez Departent of Electrical and Coputer Engineering The University of Texas at San
More informationA Trajectory Splitting Model for Efficient Spatio-Temporal Indexing
A Trajectory Splitting Model for Efficient Spatio-Teporal Indexing Slobodan Rasetic Jörg Sander Jaes Elding Mario A. Nasciento Departent of Coputing Science University of Alberta Edonton, Alberta, Canada
More informationFeature Based Registration for Panoramic Image Generation
IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh
More informationA Network-based Seamless Handover Scheme for Multi-homed Devices
A Network-based Sealess Handover Schee for Multi-hoed Devices Md. Shohrab Hossain and Mohaed Atiquzzaan School of Coputer Science, University of Oklahoa, Noran, OK 7319 Eail: {shohrab, atiq}@ou.edu Abstract
More informationA simplified approach to merging partial plane images
A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D
More informationAsynchronous Distributed Data Parallelism for Machine Learning
Asynchronous Distributed Data Parallelis for Machine Learning Zheng Yan, Yunfeng Shao Shannon Lab, Huawei Technologies Co., Ltd. Beijing, China, 100085 {yanzheng, shaoyunfeng}@huawei.co Abstract Distributed
More informationData Caching for Enhancing Anonymity
Data Caching for Enhancing Anonyity Rajiv Bagai and Bin Tang Departent of Electrical Engineering and Coputer Science Wichita State University Wichita, Kansas 67260 0083, USA Eail: {rajiv.bagai, bin.tang}@wichita.edu
More informationGeometry. The Method of the Center of Mass (mass points): Solving problems using the Law of Lever (mass points). Menelaus theorem. Pappus theorem.
Noveber 13, 2016 Geoetry. The Method of the enter of Mass (ass points): Solving probles using the Law of Lever (ass points). Menelaus theore. Pappus theore. M d Theore (Law of Lever). Masses (weights)
More informationFINITE STATE DESCRIPTION OF COMMUNICATION PROTOCOLS*
irnper neuvork protocols. A. Danthine. editor, 'iniversite de liege. I'->7X. F3 FINITE STATE DESCRIPTION OF COMMUNICATION PROTOCOLS* Gregor V. Bochann Departeent de Matheatiques Ecole Polytechnique Federals
More informationMassive amounts of high-dimensional data are pervasive in multiple domains,
Challenges of Feature Selection for Big Data Analytics Jundong Li and Huan Liu, Arizona State University Massive aounts of high-diensional data are pervasive in ultiple doains, ranging fro social edia,
More informationRelocation of Gateway for Enhanced Timeliness in Wireless Sensor Networks Abstract 1. Introduction
Relocation of ateway for Enhanced Tieliness in Wireless Sensor Networks Keal Akkaya and Mohaed Younis Departent of oputer Science and Electrical Engineering University of Maryland, altiore ounty altiore,
More informationOptimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model
1746 J. Opt. Soc. A. A/ Vol. 22, No. 9/ Septeber 2005 Y. J. Xiao and Y. F. Li Optiized stereo reconstruction of free-for space curves based on a nonunifor rational B-spline odel Yi Jun Xiao Departent of
More information1 Extended Boolean Model
1 EXTENDED BOOLEAN MODEL It has been well-known that the Boolean odel is too inflexible, requiring skilful use of Boolean operators to obtain good results. On the other hand, the vector space odel is flexible
More informationAutomatic Graph Drawing Algorithms
Autoatic Graph Drawing Algoriths Susan Si sisuz@turing.utoronto.ca Deceber 7, 996. Ebeddings of graphs have been of interest to theoreticians for soe tie, in particular those of planar graphs and graphs
More informationUtility-Based Resource Allocation for Mixed Traffic in Wireless Networks
IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng
More informationEffects of Interleaving on RTP Header Compression
Effects of Interleaving on RTP Header Copression Colin Perkins Jon Crowcroft Departent of Coputer Science University College London Gower Street London WCE 6BT Abstract We discuss the use of interleaving
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN
International Journal of Scientific & Engineering Research, Volue 4, Issue 0, October-203 483 Design an Encoding Technique Using Forbidden Transition free Algorith to Reduce Cross-Talk for On-Chip VLSI
More informationIMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco
IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE Rafael García, Xevi Cufí and Lluís Pacheco Coputer Vision and Robotics Group Institute of Inforatics and Applications, University of
More information