Determination of minimum factor of safety using a genetic algorithm and limit equilibrium analysis
|
|
- Baldric Fowler
- 5 years ago
- Views:
Transcription
1 Deterination of iniu factor of safety using a genetic algorith an liit equilibriu analysis Branon Karchewski, Dieter Stolle & Peijun Guo Departent of Civil Engineering McMaster University, Hailton, Canaa ABSTACT This paper presents the continuous paraeter genetic algorith cobine with the rigi finite eleent etho to ientify iniu factors of safety for slopes. Whereas for hoogeneous slopes, Bishop s an FEM analyses lea to siilar preictions for global iniu factor of safety an location of critical slip surface, it is shown that preictions iffer for layere systes. It is iportant that layer rigiity is inclue for layere systes. ÉSUMÉ Cet article présente le paraètre continue e l algorithe génétique cobiné avec la éthoe es éléents finis rigies pour ientifier les facteurs iniales e sécurité es pentes. Alors que pour les pentes hoogènes, la éthoe e Bishop et celle es Éléents Finis igies conuisent à es préictions siilaires pour le facteur e sécurité globale et e la position e la surface e glisseent critique; il est ontré que les préictions sont ifférentes pour un systèe hétérogène avec plusieurs couches. C est iportant que la rigiité es couches soit prise en copte pour un systèe hétérogène à plusieurs couches. 1 INTODUCTION With the availability of nuerical tools such as the finite eleent etho, the geotechnical engineer is capable of realistically solving coplex probles. Owing to the uncertainty surrouning the initial conitions, bounary conitions an istribution, as well as history-epenent properties, the quality of the preictions are ost often unerine. Siple ethos often provie solutions that are aequate for practice given that the engineer is often intereste in answering only two questions: (1) Is the structure stable?; an (2) Assuing a sufficient factor of safety, what oveents are to be expecte? These questions ay be answere by uncoupling the failure an eforation analyses. Liit equilibriu analysis presents a long-staning siple fraework for slope stability analysis. Many ethos exist an the selection of the best ay not be a trivial task. For a etaile iscussion of the relative erits of various ethos, the reaer is referre to Frelun & Krahn (1977). Iplicit in the ethoology is the use of a search algorith to ientify the surface that iniizes the factor of safety. The presence of any local inia can easily islea traitional root fining ethos. To help overcoe this proble, various algoriths have been evelope, such as: gri an raius ethos (Chen an Shao 1983); Monte Carlo rano search technique (Malkawi et al. 2001); an genetic algorith search proceures (McCobie & Wilkinson 2002; Sengupta & Upahyay 2005; Zolfaghari et. al., 2005). The objective of this paper is to present a continuous paraeter genetic algorith with ephasis on cobining it with the rigi finite eleent etho (FEM) to ientify iniu factors of safety of slopes. We begin by proviing a short overview of the FEM an then escribe a continuous genetic algorith, followe by exaples that copare FEM preictions with those obtaine by Bishop s siplifie etho. 2 BACKGOUND 2.1 igi Finite Eleent Metho Siilar to traitional liit equilibriu analyses a potential failure surface is assue, a priori. The oain is subivie into a series of rigi vertical slices as shown in Figure 1 for an assue circular slip surface that is characterize by the center of the circle ( c, c) an its raius. Figure 1. Geoetry of slope stability proble The slices are assue to be rigi, with relations efine for the interaction of eleents; i.e., between inter-slice forces an the relative oveent of ajacent slices. Siilar relations exist between the slip surface an the rigi base using non-linear springs as shown in Figure 2. The oveent of each eleent is constant an is efine in ters of horizontal an vertical isplaceent coponents. Following a finite eleent ethoology, a syste of equations is asseble consistent with virtual work for a specific slip surface. Since the interactions of
2 slices are non-linear, an iterative schee ust be use to solve the atrix equation. This proceure satisfies both local an global force equilibriu. Siilar to traitional approaches, a coparison is ae between resisting an obilize oents to eterine the global factor of safety. An avantage of the FEM proceure is that relative oveents are eterine as part of the solution, which allow local factors of safety to be reaily eterine. The reaer is referre to Stolle & Guo (2008) for etails. The binary nuber genetic algorith search etho has receive the ost attention; see previous references. This paper escribes an alternative genetic algorith presente by Haupt an Haupt (1998) that siply stores the cobination of paraeters as a vector in ecial (continuous) for rather than in binary for. The avantages of this approach inclue: anipulation of the paraeters in crossover an utation routines are ore transparent an intuitive; an less coputation tie is spent on bookkeeping to convert the paraeters back an forth between binary an ecial notation. The general algorith involves stages: initialization, evaluation, sorting, reprouction (crossover) an utation. One perfors the last three steps iteratively for a specifie nuber of generations. The processes of crossover an utation allow the oel to ientify the global iniu even while converging on a local iniu through rano utations in the paraeters. It is iportant to use a set nuber of iterations as a stopping criterion, since a relative-error-base criterion ay cause the algorith to coplete preaturely at a local iniu Initial Population an Evaluation Figure 2. Scheatic of inter-slice an basal springs. 2.2 Genetic Algorith A genetic algorith begins with a rano saple of failure surfaces within a suitable oain, characterize by ( c, c, ); see Table 1. The selection of the oain is an iportant step as too sall of a search region ay exclue the cobination that efines the global iniu. On the other han, too large of a search region ay take too long to converge (ue to the larger nuber of possible cobinations) or lea to an unreasonable slip surface epening on the type of analysis use. Using the principle of natural selection, the critical factor of safety is eterine by systeatically ajusting the failure surface paraeters of previously generate results. At the sae tie, it allows for an appropriate level of rano searching in orer to prevent converging too quickly on local inia. This approach strikes a balance between the systeatic, resource intensive gri an raius etho an the highly ranoize Monte Carlo etho. Table 1. Paraeter ranges use for genetic algorith Paraeter 1 Miniu Maxiu c -0.25H H/ H c 1.25H 2.5H 0.2H 2.5H 1 See Figure 1: H = height of slope, = grae of slope (rise/run). After the search oain is efine, the first step in the genetic algorith is to generate an initial population of caniates for iniu global factor of safety. Chroosoes ( c, c, ) containing ranoly selecte values for each of the paraeters within their respective ranges copose this initial population. The size of the initial population is an iportant paraeter in the genetic algorith. The factor of safety F s is then evaluate for each chroosoe using FEM Sorting Once the factors of safety have been evaluate for the current population, they are sorte fro lowest to highest global factor of safety. This is in preparation for the reprouction an utation processes, where only the ost optial configurations carry their genes through to the next generation eprouction (Crossover) It is through crossover that the genetic algorith is able to converge on a particular value through the process of natural selection. The reprouction process begins by selecting a specifie upper portion of the population (typically 50%) to enter the ating pool. This represents survival of the fittest as only the ost optial proportion of the population is able to pass traits on to the next generation. The ost optial solution(s) (typically ~10-15%, but roune up to the nearest integer) are copie irectly into the next generation. This eans that the search routine always keeps the ost optial solution so that the iniu global factor of safety never increases. This is akin to the fittest ebers of the population having greater longevity an surviving for an extra
3 ating season (in aition to passing their genes on to the next generation). The algorith then assigns appropriate weights to the ebers of the ating pool accoring to the corresponing global factor of safety by the following operations: 1. Subtract the iniu factor of safety of the chroosoes not selecte for reprouction fro the factors of safety of all chroosoes selecte for reprouction. This reverses the weighting schee, as this is a iniization proble. 2. Divie each of the (reverse) factors of safety in the ating pool by the su of the (reverse) factors of safety to obtain the iniviual weight of each. 3. A the su of the weights for lower factors of safety to obtain the cuulative weight for each iniviual chroosoe. Next, the algorith selects pairs of parent configurations in orer to fill the reaining slots in the next generation s population. If there are an o nuber of slots reaining, the progra oves the next ost optial solution after those alreay eee fittest irectly into the next generation. It then carries out the selection process by generating rano nubers between 0 an 1 an selects the first parent in the ating pool that has a cuulative weight greater than or equal to this value. This selection process, cobine with the weighting schee escribe previously, ensures that chroosoes with significantly lower factors of safety will have a greater relative probability of being selecte, while a population consisting of chroosoes with nearly equal factors of safety will have a unifor probability of being selecte The next step is to carry out the process of crossover in orer to fill the population for the next generation, which begins by generating a rano nuber between 0 an 1. If this nuber is less than a specifie probability (typically 70~90%), crossover occurs. Otherwise, the progra copies the two parents irectly into the next generation. If crossover is to occur, the progra perfors a for of interpolation on one paraeter an crossover on the reaining paraeters. Figure 3 shows a scheatic of the process. The figure uses the ter as an exaple. Since the nuber β is a ranoly generate between 0 an 1, the axiu change that the process applies to the paraeters is the ifference between the. Thus, if the paraeters are siilar then two siilar offspring will be generate an vice versa if the two paraeters are far apart. It shoul be note that there are a nuber of ways in which crossover can occur, besies what is shown in Figure 3. If were selecte for interpolation, either or woul have been ranoly selecte to be crosse; if were interpolate, or woul have been crosse; thirly, as in Figure 3, if is interpolate, either or is crosse. This reoves bias towar crossing one paraeter or the other in all cases. Finally, the progra places the two offspring into the population for the next generation. This process repeats until the population for the next generation is fille. parent parent... new1 new offspring offspring 1 2 ( ( ) ) new1 new2 Figure 3. Deterination of chroosoes via crossover Mutation The process of utation allows the genetic algorith to survey the search region for alternative inia. It prevents the algorith fro converging too quickly on a local iniu an allows the algorith an exit fro the region of a local iniu if it fins a lower value; i.e., the global iniu. If a lower iniu exists, it ay take a nuber of generations for the algorith to fin it; in fact, the closer the current iniu is to the global iniu without being in the region of the global iniu, the less probable it is to locate the global iniu. This is the ain reason why setting the nuber of generations is preferable to a convergence criterion for the genetic algorith. The nuber of utations on a given generation is n ut =3 p ut (n pop-n fit ) with n ut = total nuber of utations; p ut = probability of utation; n pop = nuber of chroosoes in population; an n fit = fittest proportion of population. Table 2 lists values use here. Table 2. Paraeters use for optiization Population (n pop) 15 Fittest Population (p fit = n fit / n pop) 0.10 Mating Pool Proportion (p at = n at / n pop) 0.50 Crossover Probability (p cross) 0.90 Mutation Probability (p ut) 0.25 Nuber of Generations (n gen) 100 Following the crossover process of each generation, a vector of (chroosoe, paraeter) aresses are selecte (excluing the fittest proportion). For each location selecte for utation, the progra selects a rano value within that paraeter s corresponing range to replace the current value. 3 NUMEICAL EAMPLES This stuy consiere various scenarios. The essence of the genetic algorith together with the FEM (an its avantages) ay be illustrate by consiering the results of two particular cases. The paraeters E, v, φ an c
4 enote elastic oulus, Poisson s ratio, friction angle an cohesion, respectively. 3.1 Case 1 Layere Ebankent Case 1 is an ebankent consisting of three strata, plus a botto layer for berock. The upper an lower strata are ientical layers of san with φ = 40, E = 1.0x10 5 kpa, an ν = The ile stratu is a layer of ixe soil with φ = 10, c = 30 kpa, E = 5x10 4 kpa, an ν = The geoetry of the slope is efine by = 5/6, H = 25 (see Figure 1), layer thicknesses of 12.5 for the san an 5 for the ixe soil an γ = 18.5 kn/ 3 for all soils. The berock lies 5 below the base of the slope. Miniu factors of safety using FEM an Bishop s etho together with the genetic algorith were obtaine for several runs, each one being a full analysis. Table 3 suarizes the statistics fro the runs, with Figure 4 presenting the iniu F s. Originally 5 runs were carrie out to confir that the algorith woul converge to a consistent iniu F s. One observes fro the figure that F s is relatively constant when using Bishop s etho for slope stability, but the FEM preictions show sensitivity to the (rano) see value. Aitional runs were therefore coplete to further investigate sensitivities. The sensitivity that was originally note was confire. More iportant is the observation that the iniu value was achievable only after 65 runs. In other wors, there is no guarantee that a genetic algorith will converge quickly. It epens on the sensitivity of the evaluation function to input. Table 3 clearly shows that there is consierable variation in critical failure surface copare to changes in iniu F s for this particular proble. The FEM stability proceure preicte a lower global iniu. Table 3. Case 1: Genetic algorith statistics for 85 runs. c () c () () F s Bishop Average SD Min Max FEM Average SD Min Max Figure 4. Miniu factor of safety as function of run. The critical surface for run 5 (iniu F s 0.84) is shown in Figure 5, along with the variation of local F s along the failure surface as eterine fro the sliing law; see Stolle an Guo (2008). An exaination of the local factors of safety along the slip surface reveals that F s is highest near the base of the failure surface an steaily ecreases as one oves up the surface. This is expecte as the level of confineent also ecreases as one oves up the surface. Although the ixe soil is the key for the failure oe given that the F s is slightly greater than 1 in the san, the transfer in loa ue to the instability of the ixe soil causes the local factors of safety to further ecrease in the san when loa is reistribute. Bishop s proceure was not capable of transferring loa an therefore the search for the iniu tene to focus on echaniss that were restricte to the san. This siple exaple eonstrates the iportance of accooating loa reistribution in stability analysis. y() 0.85 F s 0.75 x() Figure 5. Preicte failure surface (FEM) for run 5. The iniu factor of safety corresponing to the FEM analysis was foun to be approxiately 0.61.
5 y () Figure 6 shows the critical surface an copares it with that preicte when using the Bishop algorith (soli line for FEM, ashe line for Bishop s etho). The surface in Figure 6 is not uch ifferent fro that of Figure 5. proceures, for FEM, greater relative oveent between slices is observe at the crest, which is consistent with the local F s, being saller; i.e., large oveents being consistent with greater yieling F s = 1.02 San F s = 0.61 Mixe San x () -5 Figure 6. Failure surface for global iniu, Case Case 2 Narrow, Weak Layer Case 2 correspons to a slope siilar to that use by Frelun & Krahn (1977) for stuying the various classical ethos of slope stability analysis. The slope consists of a ense, ixe soil lying over a berock base. At the interface of these two layers, there is a very thin layer of weak frictional san. The upper layer is characterize by γ = kn/ 3, φ = 20, c = 29 kpa, E = 7.5x10 4 kpa, ν = 0.4, an has a thickness of The thin ile layer is weak frictional san having γ = kn/ 3, φ = 10, E = 5.0x10 4 kpa, ν = 0.45, an is 0.5 thick. The slope has a grae = 0.5 with H = 12. Since their paper only consiers classical ethos of analysis, it oes not provie values for elastic oulus or Poisson s ratio, so these values were assue. The ephasis with this exaple is the effect of the nuber of slices use on the global factor of safety. Figure 7 copares the preictions fro the Bishop s an FEM siulations. It is clear that the iniu factor of safety for each etho levels off above 10 slices. There is a slight increase for Bishop s etho, but this ay be ue to slight increase nuerical errors when the slices becoe thinner. One observes that Bishop s etho preicts lower F s, which ay inicate that the etho is conservative ue to the siplifying assuptions. One ust, however, be careful with aking conclusions an generalizing as there are there are special cases (such as Case 1) where FEM preicts lower values as it is capable of accooating failure oes resulting fro stiffness-epenent loa transfer, which Bishop s etho ignores. Figure 8 copares the critical surfaces preicte by each stability analysis proceure for the 10 slice analyses. The corresponing local safety factors (FEM) are also shown. Both preict siilar critical surfaces, although the iniu factor of safety for each is ifferent. With the FEM one gets a better picture of the way the slope oves. While there is a rotation for both Figure 7. Coparison of factors of safety fro Bishop s an FEM analyses. Figure 8. Coparison of failure surfaces fro Bishop s an FEM analyses.
6 4 CONCLUDING EMAKS Only a few results have been shown in this paper. Nevertheless, observations presente in this section take into account the experiences fro the entire stuy. This stuy akes the following conclusions: For hoogeneous slopes, Bishop s etho an FEM analysis prouce coparable results both in ters of the nuerical value of the global iniu factor of safety an the location of the critical slip surface. For slopes with ultiple strata, it is iportant to consier whether the ifferent layers have significantly ifferent values for the stiffness ters, E an ν. If the values iffer significantly, classical approaches such as Bishop s etho ay not give accurate nuerical estiates of the global iniu factor of safety. This is likely ue to how the soil ass transits lateral stresses, inucing shear flow along the interface between two strata. For slopes with ultiple strata, Bishop s etho an FEM analysis prouce coparable results for the location of the critical slip surface. It ay be ost coputationally efficient to use Bishop s etho analysis to arrive at the critical slip surface, but finally evaluate the actual factor of safety using FEM. Nevertheless, converging to a global iniu requires ore generations for a ultilayer slope. For cohesionless an ixe aterial slopes, the ( c, c, ) paraeters that efine the critical surface ay vary consierably for a given F s. This iplies that such slopes ay be less sensitive to variations in the acrostructure of the slope (e.g. inclusions such as boulers) as there is a wie range of equally critical failure surfaces. For slopes of cohesive aterial with φ = 0, the critical surface tens to be ore unique, with inial variation in the ( c, c, ) paraeters. This eans that if there is a region of localize strength along the critical surface (e.g. a shear key), stability increases significantly. The reverse is true for regions of localize weakness along the critical failure surface. The nuber of slices use in the analysis has an ipact on preictions. With too few (< 10), the analysis overestiates the iniu factor of safety as an accurate representation of the failure surface geoetry is lacking. On the other han, too any slices ay prove coputationally inefficient an introuce an unesirable level of nuerical error into the coputation. It is therefore optial to use a balance nuber of slices in the range [20, 30] to get an accurate solution while keeping the coputational expense in a satisfactory range. The following was observe when coparing preictions by binary nuber an continuous paraeter algoriths at the beginning of the stuy: The binary nuber etho tens to be ore powerful at rano searching for a given set of genetic algorith paraeters. This gives the binary nuber etho an avantage in situations where there are any local inia because it is ore likely to iscover the region of the global iniu. The binary nuber etho is therefore best suite to situations where a iniu nuber of runs are necessary ue to either tie or coputational constraints since it is ore likely to fin the global iniu in fewer runs. The continuous paraeter etho, while slightly less effective at conucting a rano search of the iniu F s, it oes ten to run faster ue to less bookkeeping require in converting to an fro binary nubers uring each iteration. In ost situations, the ability to o ore runs in less tie is avantageous because having ore output provies a better iea of how unique the critical surface is an how uch influence it has on overall slope stability. Although the proceure has been teste on various slopes, aitional testing is require to check robustness of the ethoology an influence of interlayer stiffness on the iniu factor of safety, as well as fully explore the liitations of the rigi finite eleent proceure. ACKNOWLEDGEMENTS The authors acknowlege the contribution of NSEC for funing this research. EFEENCES Chen, Z. an Shao, C Evaluation of iniu factor of safety in slope stability analysis, Canaian Geotechnical Journal 25: Frelun, D. an Krahn, J Coparison of slope stability ethos of analysis, Canaian Geotechnical Journal 14: Haupt,. an Haupt, S Practical Genetic Algoriths, John Wiley an Sons, Inc., Toronto. Malkawi, A. H., Hassan, W. an Sara, S An efficient search etho for fining the critical circular slip surface using the Monte Carlo technique, Canaian Geotechnical Journal, 38: McCobie, P. an Wilkinson, P The use of the siple genetic algorith in fining the critical factor of safety in slope stability analysis. Coputers an Geotechnics, 29: Sengupta, A. an Upahyay, A An evolutionary algorith for locating the critical failure surface in a soil slope, The Electronic Journal of Geotechnical Engineering, 10 (F). Stolle, D. an Guo, P Liit equilibriu slope stability analysis using rigi finite eleents, Canaian Geotechnical Journal, 45: Zolfaghari, A., Heath, A. an McCobie, P Siple genetic algorith search for critical non-circular failure surface in slope stability analysis. Coputers an Geotechnics, 32:
L Destructive interference:
SPH3UW/SPH4UI Unit 9.3 Interference of Light in Two Diensions Page 1 of 11 Notes Physics Tool box A pair of ientical point sources operating in phase prouces a syetrical pattern of constructive an estructive
More informationWAVE OPTICS. Conceptual Questions Because ym
WAVE OPTICS Conceptual Questions.. The initial light pattern is a ouble-slit interference pattern. It is centere behin the ipoint of the slits. The slight ecrease in intensity going outwar fro the ile
More informationThe optimization design of microphone array layout for wideband noise sources
PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun
More informationAN ATTRIBUTE DRIVEN APPROACH FOR IMAGE REGISTRATION USING ROAD NETWORKS
AN ATTRIBUTE DRIVEN APPROACH FOR IMAGE REGISTRATION USING ROAD NETWORKS Caixia Wang, Peggy Agouris, Anthony Stefaniis Center for Earth Observing an Space Research Departent of Earth Systes an Geoinforation
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 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 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 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 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 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 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 informationOn the Computation and Application of Prototype Point Patterns
On the Coputation and Application of Prototype Point Patterns Katherine E. Tranbarger Freier 1 and Frederic Paik Schoenberg 2 Abstract This work addresses coputational probles related to the ipleentation
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 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 informationStructural Balance in Networks. An Optimizational Approach. Andrej Mrvar. Faculty of Social Sciences. University of Ljubljana. Kardeljeva pl.
Structural Balance in Networks An Optiizational Approach Andrej Mrvar Faculty of Social Sciences University of Ljubljana Kardeljeva pl. 5 61109 Ljubljana March 23 1994 Contents 1 Balanced and clusterable
More informationArtifacts Reduction in Image Rendering of the Focused Plenoptic Camera Peng Liu 1, Rumin Zhang 2
International Conference on Intelligent Systes Research an Mechatronics Engineering (ISRME 2015) Artifacts Reuction in Iage Renering of the Focuse Plenoptic Caera Peng Liu 1, Ruin Zhang 2 School of Electronic
More informationarxiv: v1 [math.co] 10 Aug 2016
LOWER BOUNDS FOR ON-LINE INTERVAL COLORING WITH VECTOR AND CARDINALITY CONSTRAINTS GRZEGORZ GUTOWSKI AND PATRYK MIKOS arxiv:1608.03078v1 [ath.co] 10 Aug 2016 Abstract. We propose two strategies for Presenter
More informationProblem Solving of graph correspondence using Genetics Algorithm and ACO Algorithm
Proble Solving of graph correspondence using Genetics Algorith and ACO Algorith Alireza Rezaee, 1, Azizeh Ajalli 2 Assistant professor,departent of Mechatronics Engineering, Faculty of New Sciences and
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 informationFair Energy-Efficient Sensing Task Allocation in Participatory Sensing with Smartphones
Advance Access publication on 24 February 2017 The British Coputer Society 2017. All rights reserved. For Perissions, please eail: journals.perissions@oup.co doi:10.1093/cojnl/bxx015 Fair Energy-Efficient
More 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 informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationMedical Biophysics 302E/335G/ st1-07 page 1
Medical Biophysics 302E/335G/500 20070109 st1-07 page 1 STEREOLOGICAL METHODS - CONCEPTS Upon copletion of this lesson, the student should be able to: -define the ter stereology -distinguish between quantitative
More informationAscending order sort Descending order sort
Scalable Binary Sorting Architecture Based on Rank Ordering With Linear Area-Tie Coplexity. Hatrnaz and Y. Leblebici Departent of Electrical and Coputer Engineering Worcester Polytechnic Institute Abstract
More informationSummary. Reconstruction of data from non-uniformly spaced samples
Is there always extra bandwidth in non-unifor spatial sapling? Ralf Ferber* and Massiiliano Vassallo, WesternGeco London Technology Center; Jon-Fredrik Hopperstad and Ali Özbek, Schluberger Cabridge Research
More informationEffects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed
Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed Yonghwan Ki* & Dick K.P. Yue** Massachusetts Institute of Technology, Departent of Ocean Engineering, Cabridge,
More informationAGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM
International Journal of Software Engineering & Applications (IJSEA), Vol.6, No.5, Septeber 205 AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM Xie Yang and Cheng Wushan College of Mechanical Engineering,
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 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 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 informationMinimax Sensor Location to Monitor a Piecewise Linear Curve
NSF GRANT #040040 NSF PROGRAM NAME: Operations Research Miniax Sensor Location to Monitor a Piecewise Linear Curve To M. Cavalier The Pennsylvania State University University Par, PA 680 Whitney A. Conner
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 informationVisual Analysis of Vehicle Voice Navigation with Parallel Coordinates
Visual Analysis of Vehicle Voice Navigation with Parallel Coorinates Miao Wang Nanyang Institute of Technology. Henan. China Corresponing E-ail:Wang@126.co Abstract - In the fiel of vehicle voice navigation,
More informationTALLINN UNIVERSITY OF TECHNOLOGY, INSTITUTE OF PHYSICS 17. FRESNEL DIFFRACTION ON A ROUND APERTURE
7. FRESNEL DIFFRACTION ON A ROUND APERTURE. Objective Exaining diffraction pattern on a round aperture, deterining wavelength of light source.. Equipent needed Optical workbench, light source, color filters,
More informationA Novel 2D Texture Classifier For Gray Level Images
2012, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.co A Novel 2D Texture Classifier For Gray Level Iages B.S. Mousavi 1 Young Researchers Club, Zahedan
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 informationGeo-activity Recommendations by using Improved Feature Combination
Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,
More 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 informationResearch on a Kind of QoS-Sensitive Semantic Web Services Composition Method Based on Genetic Algorithm
roceedings of the 7th International Conference on Innovation & Manageent 893 Research on a Kind of QoS-Sensitive Seantic Web Services Coposition Method Based on Genetic Algorith Cao Hongjiang, Nie Guihua,
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 informationA Generic Architecture for Programmable Trac. Shaper for High Speed Networks. Krishnan K. Kailas y Ashok K. Agrawala z. fkrish,
A Generic Architecture for Prograable Trac Shaper for High Speed Networks Krishnan K. Kailas y Ashok K. Agrawala z fkrish, agrawalag@cs.ud.edu y Departent of Electrical Engineering z Departent of Coputer
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 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 informationFuzzy Logic Support System for Predicting Building Damage Due to the Association of Three Parameters of Pipeline Failure
Journal of Aerican Science, 2012;8(1) Fuzzy Logic Support Syste for Predicting Building Daage Due to the Association of Three Paraeters of Pipeline Failure Dina A. Earah 1 ; Manar, M. Hussein 1* ; Hady
More informationGenetic-Based EM Algorithm for Learning Gaussian Mixture Models
1344 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 27, NO. 8, AUGUST 2005 Genetic-Based EM Algorith for Learning Gaussian Mixture Models Franz Pernkopf, Meber, IEEE, and Djael Bouchaffra,
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 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 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 informationA Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University
More 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 informationCOMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, August 23, 2004, 12:38 PM) PART III: CHAPTER ONE DIFFUSERS FOR CGH S
COPUTER GEERATED HOLOGRAS Optical Sciences 67 W.J. Dallas (onday, August 3, 004, 1:38 P) PART III: CHAPTER OE DIFFUSERS FOR CGH S Part III: Chapter One Page 1 of 8 Introduction Hologras for display purposes
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 informationELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH
ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH Kulapraote Prathuchai Geoinforatics Center, Asian Institute of Technology, 58 Moo9, Klong Luang, Pathuthani, Thailand.
More informationResearch Article Inviscid Uniform Shear Flow past a Smooth Concave Body
International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of
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 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 informationJoint Measurement- and Traffic Descriptor-based Admission Control at Real-Time Traffic Aggregation Points
Joint Measureent- and Traffic Descriptor-based Adission Control at Real-Tie Traffic Aggregation Points Stylianos Georgoulas, Panos Triintzios and George Pavlou Centre for Counication Systes Research, University
More informationFair Resource Allocation for Heterogeneous Tasks
Fair Resource Allocation for Heterogeneous Tasks Koyel Mukherjee, Partha utta, Gurulingesh Raravi, Thangaraj Balasubraania, Koustuv asgupta, Atul Singh Xerox Research Center India, Bangalore, India 560105
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 informationFlucs: Artificial Lighting & Daylighting. IES Virtual Environment
Flucs: Artificial Lighting & Daylighting IES Virtual Environent Contents 1. General Description of the FLUCS Interface... 6 1.1. Coon Controls... 6 1.2. Main Application Window... 6 1.3. Other Windows...
More informationGenerating Mechanisms for Evolving Software Mirror Graph
Journal of Modern Physics, 2012, 3, 1050-1059 http://dx.doi.org/10.4236/jp.2012.39139 Published Online Septeber 2012 (http://www.scirp.org/journal/jp) Generating Mechaniss for Evolving Software Mirror
More informationIN many interactive multimedia streaming applications, such
840 IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 8, NO. 5, MAY 06 A Geoetric Approach to Server Selection for Interactive Video Streaing Yaochen Hu, Student Meber, IEEE, DiNiu, Meber, IEEE, and Zongpeng Li, Senior
More informationScheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL., NO., NOV 27 Scheduling Parallel Real-Tie Recurrent Tasks on Multicore Platfors Risat Pathan, Petros Voudouris, and Per Stenströ Abstract We
More informationColorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.
Professor Willia Hoff Dept of Electrical Engineering &Coputer Science http://inside.ines.edu/~whoff/ 1 Caera Calibration 2 Caera Calibration Needed for ost achine vision and photograetry tasks (object
More informationModal Masses Estimation in OMA by a Consecutive Mass Change Method.
Modal Masses Estiation in OMA by a Consecutive Mass Change Method. F. Pelayo University of Oviedo, Departent of Construction and Manufacturing Engineering, Gijón, Spain M. López-Aenlle University of Oviedo,
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 informationReconstruction of Time Series using Optimal Ordering of ICA Components
Reconstruction of Tie Series using Optial Ordering of ICA Coponents Ar Goneid and Abear Kael Departent of Coputer Science & Engineering, The Aerican University in Cairo, Cairo, Egypt e-ail: goneid@aucegypt.edu
More 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 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 informationOptimal Route Queries with Arbitrary Order Constraints
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL.?, NO.?,? 20?? 1 Optial Route Queries with Arbitrary Order Constraints Jing Li, Yin Yang, Nikos Maoulis Abstract Given a set of spatial points DS,
More informationDeterministic Voting in Distributed Systems Using Error-Correcting Codes
IEEE TRASACTIOS O PARALLEL AD DISTRIBUTED SYSTEMS, VOL. 9, O. 8, AUGUST 1998 813 Deterinistic Voting in Distributed Systes Using Error-Correcting Codes Lihao Xu and Jehoshua Bruck, Senior Meber, IEEE Abstract
More 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 informationAdaptive Contrast Adjustment for Postprocessing of Tone Mapped High Dynamic Range Images
Aaptive Contrast Ajustent for Postprocessing of Tone Mappe High Dnaic Range Iages Manish Narwaria, Matthieu Perreira a Silva, Patrick Le Callet, Roual Pepion To cite this version: Manish Narwaria, Matthieu
More informationResource Optimization for Web Service Composition
Resource Optiization for Web Coposition Xia Gao, Ravi Jain, Zulfikar Razan, Ulas Kozat Abstract coposition recently eerged as a costeffective way to quickly create new services within a network. Soe research
More informationMultipath Selection and Channel Assignment in Wireless Mesh Networks
Multipath Selection and Channel Assignent in Wireless Mesh Networs Soo-young Jang and Chae Y. Lee Dept. of Industrial and Systes Engineering, KAIST, 373-1 Kusung-dong, Taejon, Korea Tel: +82-42-350-5916,
More 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 informationPOSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang
IEEE International Conference on ultiedia and Expo POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION Junjun Jiang, Ruiin Hu, Zhen Han, Tao Lu, and Kebin Huang National Engineering
More informationDistributed Multicast Tree Construction in Wireless Sensor Networks
Distributed Multicast Tree Construction in Wireless Sensor Networks Hongyu Gong, Luoyi Fu, Xinzhe Fu, Lutian Zhao 3, Kainan Wang, and Xinbing Wang Dept. of Electronic Engineering, Shanghai Jiao Tong University,
More informationQoS and Sensible Routing Decisions
QoS and Sensible Routing Decisions Erol Gelenbe Dept. of Electrical & Electronic Engineering Iperial College London SW7 2BT e.gelenbe@iperial.ac.uk Abstract Network Quality of Service (QoS) criteria of
More informationVideo summarization based on shot boundary detection with penalized contrasts
Video suarization based on shot boundary detection with penalized contrasts Paschalina Medentzidou and Constantine Kotropoulos Departent of Inforatics Aristotle University of Thessaloniki Thessaloniki
More informationGromov-Hausdorff Distance Between Metric Graphs
Groov-Hausdorff Distance Between Metric Graphs Jiwon Choi St Mark s School January, 019 Abstract In this paper we study the Groov-Hausdorff distance between two etric graphs We copute the precise value
More informationEFFICIENT VIDEO SEARCH USING IMAGE QUERIES A. Araujo1, M. Makar2, V. Chandrasekhar3, D. Chen1, S. Tsai1, H. Chen1, R. Angst1 and B.
EFFICIENT VIDEO SEARCH USING IMAGE QUERIES A. Araujo1, M. Makar2, V. Chandrasekhar3, D. Chen1, S. Tsai1, H. Chen1, R. Angst1 and B. Girod1 1 Stanford University, USA 2 Qualco Inc., USA ABSTRACT We study
More informationSimulated Sensor Reading. Heading. Y [m] local minimum ; m. local maximum ; M. discontinuity ; D. connection ; c X [m]
Localization based on Visibility Sectors using Range Sensors Sooyong Lee y Nancy. Aato Jaes Fellers Departent of Coputer Science Texas A& University College Station, TX 7784 fsooyong,aato,jpf938g@cs.tau.edu
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 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 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 informationThe Boundary Between Privacy and Utility in Data Publishing
The Boundary Between Privacy and Utility in Data Publishing Vibhor Rastogi Dan Suciu Sungho Hong ABSTRACT We consider the privacy proble in data publishing: given a database instance containing sensitive
More informationFPL Implementation of a SIMD RISC RNS-Enabled DSP
FPL Ipleentation of a SIMD RISC RNS-Enabled DSP J. RAMÍREZ (1), A. GARCÍA (1), P. G. FERNÁNDEZ (2), A. LLORIS (1) (1) Dpt. of Electronics and Coputer Technology (2) Dpt. of Electrical Engineering University
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 informationDETC2002/DAC DECOMPOSITION-BASED ASSEMBLY SYNTHESIS FOR IN-PROCESS DIMENSIONAL ADJUSTABILITY. Proceedings of DETC 02
Proceedings of DETC 0 ASME 00 Design Engineering Technical Conferences and Coputer and Inforation in Engineering Conference Montreal, Canada, Septeber 9-October, 00 DETC00/DAC-08 DECOMPOSITION-BASED ASSEMBLY
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 informationMinimum Delay Stream Routing and Content Caching in Hybrid Coalition Networks
Miniu Delay Strea Routing and Content Caching in Hybrid Coalition Networks Mostafa Dehghan, Anand Seethara, Ting He, Theodoros Salonidis Ji Kurose, Don Towsley, Bo Jiang, Raesh Sitaraan University of Massachussetts
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 informationHomework 1. An Introduction to Neural Networks
Hoework An Introduction to Neural Networks -785: Introduction to Deep Learning Spring 09 OUT: January 4, 09 DUE: February 6, 09, :59 PM Start Here Collaboration policy: You are expected to coply with the
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 informationOn the Complexity of Optimal Routing and Content Caching in Heterogeneous Networks
On the Coplexity of Optial Routing and Content Caching in Heterogeneous Networks Mostafa Dehghan 1, Anand Seethara 2, Bo Jiang 1, Ting He 3, Theodoros Salonidis 3, Ji Kurose 1, Don Towsley 1, and Raesh
More informationA Discrete Spring Model to Generate Fair Curves and Surfaces
A Discrete Spring Model to Generate Fair Curves and Surfaces Atsushi Yaada Kenji Shiada 2 Tootake Furuhata and Ko-Hsiu Hou 2 Tokyo Research Laboratory IBM Japan Ltd. LAB-S73 623-4 Shiotsurua Yaato Kanagawa
More informationVision Based Mobile Robot Navigation System
International Journal of Control Science and Engineering 2012, 2(4): 83-87 DOI: 10.5923/j.control.20120204.05 Vision Based Mobile Robot Navigation Syste M. Saifizi *, D. Hazry, Rudzuan M.Nor School of
More 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 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 information