MultiRobot Task Scheduling


 Charla Davis
 2 years ago
 Views:
Transcription
1 Proc of IEEE Internationa Conference on Robotics and Automation, Karsruhe, Germany, 013 MutiRobot Tas Scheduing Yu Zhang and Lynne E Parer Abstract The scheduing probem has been studied extensivey in the iterature Many agorithms have been deveoped to operate with different types of processors and tass In the robotics domain, when considering each robot as a processor, some of these agorithms can be directy adapted However, most of the existing agorithms can ony hande singerobot tass, or mutirobot tass that can be divided into singerobot tass As the tas requirements may ony be partiay nown, and the avaiabe (heterogeneous) robots can dynamicay change, robots may be required to cooperate tighty to share different capabiities (ie, sensors and motors) In such cases, considering scheduing for individua robots is no onger sufficient, since the robots need to wor at the coaition eve Athough there exist a few agorithms that aso support these more compex cases, they do not represent efficient soutions that can be adapted by various mutirobot systems in a convenient manner In this paper, we propose heuristics to address the mutirobot tas scheduing probem at the coaition eve, which hides the detais of robot specifications, thus aowing these heuristics to be incorporated straightforwardy These heuristics are easy to impement and efficient enough to run in rea time We provide forma anayses and simuation resuts to demonstrate and compare their performances I INTRODUCTION The genera scheduing probem is often formuated as the probem of arranging a set of tass on a set of processors Here, processor represents a generic term that can assume any form, such as a CPU, an airpane, or a robot Aong with the objective function, a scheduing probem is often specified as three components separated by These three components, written together as P T func, can be used to specify the type of processors, tass, and the objective function For more detaied discussions of the different scheduing probems that have been studied, refer to [1], [3] To study the scheduing probems in robotic systems, one must first reaize that these probems represent specia cases of the genera scheduing probem In particuar, the scheduing probems in robotic systems are often characterized by the foowing restrictions: 1) Execution is assumed to be nonpreemptive; ) Robots (and capabiities) are assumed to be nondivisibe, such that the same robot can ony wor on a singe tas at any time point (thus restricting the robots to be singetas robots [4]) The first restriction hods especiay in mutirobot tass, since it is often costy to regroup robots and bring them into new coaitions [15]; the second restriction is often due to geographica distances between different tas execution ocations [13] Consequenty, This materia is based upon wor supported by the Nationa Science Foundation under Grant No Yu Zhang and Lynne Parer are with the Distributed Inteigence Laboratory in the Department of Eectrica Engineering and Computer Science, University of Tennessee, Knoxvie, TN 37996, USA, agorithms in this paper are deveoped under these two restrictions, athough preemptive tas execution and mutitas robots can sometimes be beneficia Furthermore, tas dependencies (eg, precedence orders) are not considered However, note that the agorithms proposed in this paper can be extended when tas dependencies are present, for exampe, using simiar approaches as in [10], [16] The soution bounds in these situations need to be reestabished Foowing the above discussion, a simpe approach to sove the scheduing probems in robotic systems is to use existing agorithms for the restricted probem instances There are two cases to consider The simper case is scheduing with singerobot tass, which can be specified as R func This probem with the objective function e, can be soved in poynomia time using a soution for the assignment probem [1] Here, R represents unreated machines, since the times required for robots to accompish the same tas can be unreated (or independent of their capabiities); is the index for tass and e denotes the finishing time of tas t The more compex case is with mutirobot tass Sometimes, when the mutirobot tass can be divided into singerobot tass, the scheduing probem reduces to R e For situations in which this is infeasibe, the probem becomes the MPM MPT e probem (mutipurpose machine with mutiprocessor tas) As a specia case of MPM MPT e, the MPT probem is shown in [6] to be N Phard, even with ony two machines, ie, MPT e Unfortunatey, very few agorithms are provided to address this very difficut probem As mutirobot systems deveop, we need efficient agorithms to generate acceptabe soutions fast in dynamic environments In this paper, we propose four heuristics to address the MPM MPT e probem To the best of our nowedge, this is the first wor that provides efficient heuristics for this probem with provabe soution bounds Furthermore, since these heuristics directy operate at the coaition eve, they can be easiy incorporated in a centraized or distributed manner using a ayering technique [1] The coaition information is provided by the underying ayer, in which robots search for coaitions and compute their costs based on the tas requirements and robot capabiities (see [14] for an exampe) This information is then submitted to the upper ayer (eg, our heuristics) for tas scheduing This paper is organized as foows After a brief discussion of the reated wor in Section II, we formuate the probem in Section III We introduce and anayze two simpe heuristics in Section IV, and two more compex ones in Section V The compexity anayses are provided in Section VI Finay, we present resuts in Section VII and concude in Section VIII
2 II RELATED WORK It is first noted in [4] that the mutirobot tas scheduing probem is equivaent to the MPM MPT e probem, athough [4] does not assume singetas robots This probem is often addressed by considering it as composed of two probems: an assignment probem and a MPT scheduing probem The assignment probem determines the assignment of tass to coaitions; the MPT scheduing probem then determines the tas execution schedues Whie the assignment probem can be soved optimay using the Hungarian agorithm [7], as we have discussed, the MPT probem is N P hard To reduce the compexity, simpifying assumptions are often made, such as requiring the same processing times for tass, restricting the number of processors, or aowing preemptive scheduing However, the soution quaity is often difficut to anayze after combining soutions of the assignment and the MPT probems On the other hand, the MPT probem is often formuated more generay as the RCPSP (resourceconstrained project scheduing probem) probem [3] The RCPSP probem reduces to the MPT probem when each robot is considered as one unique resource, such that neither the robots nor their capabiities are divisibe (ie, singetas robots) The corresponding MPM MPT e probem is then referred to as the mutimode RCPSP probem Many agorithms have been provided to address the RCPSP probem Reviews of different methods can be found in [], [5] For exampe, mixed integer inear programming [8], as we as branch and bound agorithms [9], have been appied Some of these agorithms have been extended to the mutimode case [11] However, none of these extensions represent efficient soutions with provabe soution bounds Athough the number of coaitions can be exponentia in the number of robots, in mutirobot systems, the number of executabe coaitions [15] is often imited These coaitions are associated with assignments that do not have any unsatisfied preconditions Consequenty, the number of coaitions that need to be considered for any given tas is aso imited This observation motivates the design of some of the heuristics in this paper Furthermore, a desirabe heuristics must be convenient to be incorporated One soution is to use a ayering technique [1], which requires the agorithms to directy operate at the coaition eve III PROBLEM FORMULATION We now present the formuation of the mutirobot tas scheduing probem, or MPM MPT e Given: A set of tass T = {t 1, t, }, and a set of robots R; A set of distinct coaitions C = {c 1, c, }, c j R; A function f : C T R +, which returns the time, p j, required for a coaition c j to accompish a tas t ; The scheduing probem we consider in this paper is: Minimize: e (1) subject to the foowing restrictions: 1) Nonpreemptive scheduing; ) Nondivisibe robot resources and capabiities; Note that in this formuation, a coaition may be abe to accompish mutipe tass and a tas may be accompished by mutipe coaitions Again, e denotes the finishing time of tas t The reason that we are interested in e is because we often want to reduce the overa system operating time, incuding robot waiting or ide times, as they too consume resources The second restriction adds interference between different coaitions, which prohibits coaitions sharing the same robots to wor on different tass at the same time A MinProcTime IV SIMPLE HEURISTICS MinProcTime chooses at every step the assignment (ie, coaitiontas pair) that has the shortest processing time This process creates an ordering of tas assignments; we assume that ties are broen in a deterministic manner For scheduing assignments, MinProcTime aways assigns the eariest starting times The intuition behind MinProcTime is to process tass with shorter processing times earier Theorem 41: The MinProcTime heuristic yieds a soution quaity bounded by Proof: MinProcTime chooses an assignment for one remaining tas in T at each step unti a tass are assigned Given the greedy choice, when choosing a tas t, the heuristic necessariy chooses the coaition that can accompish t in the shortest time Denote this processing time as We further suppose that tass are ordered nondecreasingy based on, which is aso the order for MinProcTime to choose tass Then, the soution produced by MinProcTime must satisfy: S g (C, T ) ( T + 1) () in which S g is used throughout to represent the soutions of our heuristics (g stands for greedy, since there are aways some greedy criteria invoved) This inequaity hods because, in the worst case, tass woud be accompished in a sequentia manner by their respective coaitions On the other hand, the soution of the optima soution ceary satisfies: S (C, T ) (3) which happens ony when a tass are processed in parae Given the nondecreasing ordering, we now that when Combining Equations () and (3) yieds: S g (C, T ) T + 1 ( T + 1) T + 1 S (C, T ) (4) Hence, the concusion hods Athough the reaxations in the proof seem to be pessimistic, the bound is actuay tight; it is not difficut to create probem instances with the worst case soution quaity
3 B MinStepSum Simiar to MinProcTime, MinStepSum aways assigns the eariest starting time when considering an assignment It then chooses at every step the assignment that contributes the east to the objective function We again assume that ties are broen in a deterministic manner Note that whie the chosen assignments and their ordering are predetermined in MinProcTime given the probem instance, they are determined incrementay (ie, one assignment at each greedy step) in MinStepSum Athough the two greedy heuristics operate differenty, interestingy, they share the same soution bound We introduce the foowing emma before proving this resut, in which we sti assume that the tass are ordered nondecreasingy based on Lemma 4: Denoting the finishing time of the th tas chosen by MinStepSum as e, we have that: max e (5) =1 =1 Proof: We prove this resut by an induction on Suppose that the inequaity hods up to At step + 1, MinStepSum chooses an assignment that contributes the east to the objective function There are two cases Case 1, when a tass in {t 1,, t } are aready assigned: since t is not assigned in this case, the east we can do is to have it accompished by the coaition with processing time In such a case, we have: max e max e + =1 =1 pmin =1 (6) Case, when not a tass in {t 1,, t } are assigned: since tass are ordered nondecreasingy based on, the east we can do is to have any unassigned tas t h (h ) accompished In such a case, we have: max e max e + =1 =1 pmin h max e + =1 pmin (7) Finay, since the induction ceary hods for = 1, we have that the concusion hods Theorem 43: The MinStepSum heuristic yieds a soution quaity bounded by Proof: Since we now that S g (C, T ) = e, the resut foows directy from Lemma 4 and Equation (4) Simiary, it can be shown that the bound in Theorem 43 is aso tight Athough the number of tass can be arge, as we see in the simuation resuts section, both MinProcTime and MinStepSum produce soutions with quaity much better than this bound on average =1 V COMPLEX HEURISTICS One imitation of MinProcTime and MinStepSum is that they do not consider the interference between coaitions Hence, they cannot mae an informed decision when two assignments have simiar processing times but different infuences on other coaitions However, a coaition can directy or indirecty infuence other coaitions in compex ways The heuristics in this section, nevertheess, assume that a coaition can ony infuence a imited number of coaitions, given the observations in [13], [15] A InterfereAssign The idea that motivates InterfereAssign is the fact that the scheduing probem with singerobot tass can be recast as an assignment probem, and hence can be soved optimay To add in the effects of the interference, we first define the notion of interference: Definition 51: Coaition Interference For any two coaitions c j and c j (j j ), c j interferes (or conficts) with c j if and ony if c j c j This definition appies simiary to assignments Given this definition, we denote F j as the set of coaitions that interfere with c j Observe that an assignment c j t can increase the objective function by the foowing three factors: 1) The assignment s processing time p j ; ) The tass that are schedued on c j after t ; 3) The tass that are schedued on any coaitions in F j 1 Denoting the scheduing position for t on c j as I j, the first and second factors above together contribute I j p j The third factor can be estimated by the number of tass that are schedued on F j Athough this number is not nown a priori, we now that for each coaition c, the number of tass that are schedued on c must be no greater than N c, in which N c represents the set of tass that c can accompish Hence, the third factor must be no greater than c Fj N c Then, we can formuate the new assignment probem: Create a tas node for each tas t ; Create a coaitionposition node for each coaition c j and position pair, with positions ranging from 1 to N cj for coaition c j ; If a coaition c j can accompish a tas t, connect t with a coaitionposition nodes for c j, and set the weights to be ( c Fj N c + I j ) p j, respectivey, based on I j The above assignment probem can be soved optimay, which gives the positions of tass to be executed on the coaitions This soution satisfies the foowing property: Lemma 51: There exists a schedue that is no worse than the soution of the assignment probem Proof: We prove this resut by constructing a schedue from the soution of the assignment probem This soution specifies the coaitions to execute the tass and the sequences of these executions The basic idea for the construction is to move from the beginning to the end of the entire execution and resove any conficts aong the path The resoution ordering guarantees that the process does not introduce new conficts before where the current confict 1 Athough these tass (and the corresponding assignments) can recursivey infuence the objective function, such infuences are too compicated to mode and hence are not considered Scheduing positions are numbered from the atest to the eariest tas, such that the ast tas to be executed on a coaition is at position 1
4 occurs This process ends when no conficts exist and the resuting schedue is vaid A we need to show now is how to resove a confict When there are conficts with an assignment c j t, given the resoution ordering, we now that no conficts exist before the starting of its execution Since conficts can ony occur when a coaition conficts with c j, we ony need to adjust tas executions schedued on F j In the worst case, the number of assignments that we need to move to start time p j ater is c Fj N c In such a way, the confict is resoved and the process can move forward to the next assignment in the entire execution Theorem 5: The schedue that is constructed in Lemma 51 from the soution of the assignment probem yieds a soution quaity bounded by max j c Fj N c + 1 Proof: In the assignment probem, setting the connection weight to be I j p j ceary estabishes a ower bound on the objective function for the scheduing probem, since it assumes that there are no conficts between the coaitions Based on this observation and Lemma 51, the soution for the schedue that is constructed in Lemma 51 satisfies: S g (C, T ) S assign (T, {C, I}) c Fj N c + I j max S (C, T ) j I j (max c Fj N c + 1) S (C, T ) (8) j Hence, the concusion hods Breaing Ties: Note that from the construction in Lemma 51, we now that when there are ties in resoving the conficts (ie, when mutipe conficting assignments are schedued to start at the same time), we can choose any one of these assignments to perform the resoution process In InterfereAssign, we choose the one that minimizes its contribution to e with consideration of the interference (ie, computed as e in addition to the necessary moves for resoving the conficts) Note that the soution quaity of InterfereAssign is dependent on the probem instance For cases when the number and size of coaitions are imited (eg, due to communication and coordination costs, or restrictions from ocation constraints), such that the coaitions interfere with ony a imited number of other coaitions, InterfereAssign is iey to produce good quaity soutions In particuar, when ony singerobot coaitions are aowed, the probem reduces to an assignment probem and InterfereAssign produces the optima soution B MinInterfere In InterfereAssign, c Fj N c is often too much of an overestimate of the number of tass that are schedued on F j However, one cannot mae a more precise estimation before some assignments are made MinInterfere is a greedy heuristic introduced to address this issue The idea is to find an upper bound on the number of tass schedued on F j that is as tight as possibe, so that the estimation of the interference becomes more accurate At step during the greedy process, MinInterfere has aready made 1 assignments Then, for every remaining tas t, for any coaition c j that can execute t, MinInterfere schedues the assignment at the eariest time possibe, ie, the eariest time foowing the ast chosen assignment on c j that incurs no conficts MinInterfere computes the foowing vaue as the greedy criterion to minimize: β j = e j + c Fj N c \ M j p j (9) in which M j incudes t, and the set of tass that are schedued before c j t in the greedy process MinInterfere then schedues an assignment according to arg min j, β j The forma anaysis of MinInterfere is eft as future wor To provide an exampe of how these heuristics wor, we provide the agorithm for MinInterfere as foows Agorithm 1 MinInterfere for mutirobot tas scheduing 1: whie there are tass remaining do : for a t tass remaining do 3: for a c j that can accompish t do 4: Compute the eariest starting time s j 5: Compute e j = s j + p j 6: Compute β j in Equation (9) 7: end for 8: end for 9: Seect j, according to arg min j, β j 10: Assign tas t to c j 11: end whie VI COMPLEXITY ANALYSIS To sove the MPM MPT e probem optimay, one needs to search a orderings of tass For each ordering, we must iterate through a possibe coaition assignments for each tas Since finding the eariest starting time taes O( T ), the compexity is O(( C T ) T T!) 3 Ceary, computing the optima soution is intractabe MinProcTime requires us to first sort the tass based on their minimum processing times This process taes O( C T + T og T ) using a set structure For scheduing each tas, since finding the starting time taes O( T ), the compexity of MinProcTime is O( C T + T ) At every greedy step, MinStepTime checs every assignment s contribution to the objective function This process taes O( C T ) Hence, the computationa compexity of MinStepTime is O( C T 3 ) InterfereAssign is a direct appication of the Hungarian agorithm Hence, the compexity is O( C 3 T 3 ), given that the number of coaitionposition pairs is O( C T ) The compexity for breaing ties is absorbed Simiary, from Agorithm 1, it can be inferred that the computationa compexity of MinInterfere is O( C T 3 ) Tabe I provides a summary of the discussed heuristics, incuding soution bounds, and computationa compexities 3 Athough C can be exponentia in R, the number of coaitions that need to be considered is often much smaer in practice [10], [13], [15], and thus the probem can be soved quicy
5 TABLE I SUMMARY OF DISCUSSED HEURISTICS Name Soution Bound Compexity Optima 1 O(( C T ) T T!) MinProcTime O( C T 3 ) MinStepTime O( C T 3 ) InterfereAssign max j c Fj N c + 1 O( C 3 T 3 ) MinInterfere Not Determined O( C T 3 ) TABLE II TASKS FOR THE SCENARIO IN FIGURE 1 Tas Robots Required Process Time 1) Object 1 One gripper, one ocaizer 6 ) Object One gripper, one ocaizer 6 3) Large Object Two grippers 5 Fig Schedues created by the heuristics for the scenario in Tabe II Fig 1 A simpe scenario of the scheduing probem VII SIMULATION RESULTS Simuations are run on a 4GHz aptop with GB memory; wacoc times are reported Statistics are coected over 100 runs; probem instances are randomy generated A An Object Coection Scenario We start with an object coection scenario, as shown in Figure 1, to demonstrate interference between assignments There are two types of robot, and two robots for each type The first type has a gripper but cannot ocaize; the second type can ocaize but does not have a gripper The goa is to move a three objects to the home area Whie the smaer objects can be moved by one gripper robot, they are reativey far from the home area so that a ocaization capabiity is required The arger object can ony be moved by two gripper robots cooperativey but is coser to the home area Note that athough the tas execution times are ony dependent on the distances between the home area and the objects in this scenario, they can aso be dependent on the current robot ocations and other dynamic factors This is reated to the issue of tas dependency and is not specificay considered in this wor See [16] for some discussions on this issue Tabe II shows the robots required for each object and the time required to accompish the move Figure iustrates the schedues created by the four proposed heuristics We can see that ony the heuristics that consider the interference between the assignments (ie, InterfereAssign and MinInterfere) produce the optima soution Whie this simuation presents ony a sma exampe, the impact can be arge as the probem size increases, which is shown next B Performance Comparison First, the parameters used in the foowing simuations are isted in Tabe III In the first simuation, we vary n c from 3 to 6 whie eeping the other parameters fixed Due to the compexity for computing the optima soution, we set n t = 9 Other parameters are: n f = (09 18) (based on n c ), n e = 7, n min = 5, and n max = 10 The resut is shown in Figure 3 We can see that the performance generay decreases as n c increases for a heuristics This may seem to be counterintuitive However, note that as n c increases, n f aso increases, which compicates the scheduing We can aso see that MinStepSum, InterfereAssign and MinInterfere perform simiary whie InterfereAssign is sighty better (at the 5% significance eve) than MinStepSum and MinInterfere for smaer n c (ie, 3 4) Another observation is that the average soution quaity is better than the proven bounds In the next simuation, we vary n t from 8 to 11 The other parameters are: n c = 4, n f = 1, n e = (4 33) (based on n t ), n min = 5, and n max = 10 The resut is shown in Figure 4 We can see simiar concusions as in the previous simuation (ie, InterfereAssign performs significanty better than MinStepSum and MinInterfere when n t = (8 9)) Since n f stays as a constant this time, we can see that the curve formed by the soution quaity is smoother Next, we show how the performance changes whie we vary n f from 05 to 5 Other parameters are: n c = 5, n t = 10, n e = 3, n min = 5, and n max = 10 Figure 5 gives the resut Again, we can see that the performance decreases as the interference becomes more compex (or as n f increases) We are aso interested in how n max infuences the soution In this simuation, we vary n max from 5 to 10 Other Parameter n c n t n f n e n min, n max TABLE III PARAMETERS USED IN THE SIMULATIONS Description No of coaitions No of tass Average no of conficting coaitions per coaition Average no of executabe tass per coaition Minimum and maximum processing time
6 Fig 3 Scheduing with varying n c Top: Average soution quaity (the ower the better) Bottom: Separate detaied resuts with standard deviations The green data points in each subgraph represent the worst soution quaity Fig 5 Scheduing with varying n f Top: Average soution quaity Bottom: Separate and more detaied resuts with standard deviations Fig 4 Scheduing with varying n t Top: Average soution quaity Bottom: Separate and more detaied resuts with standard deviations Fig 6 Scheduing with varying n max Top: Average soution quaity Bottom: Separate and more detaied resuts with standard deviations parameters are: n c = 5, n t = 10, n f = 15, n e = 3, and n min = 5 The resut is shown in Figure 6 We can see from the figure that the performance decreases as n max increases, which is different from the previous simuations This is understandabe because it is more difficut to schedue assignments when their processing times are simiar but their interferences on other assignments differ Now, we want to see how the heuristics perform with arge
7 Fig 8 Time anaysis Left: Varying n c Right: Varying n t soution bounds can be further improved It is aso usefu to estabish bounds on the approximation ratios that any poynomiatime agorithms can achieve Finay, we aso oo forward to impementing these heuristics on mutirobot systems to address reaword scheduing probems Fig 7 Scheduing with varying n max, with arge n c and n t Top: Average soution quaity Bottom: Separate detaied resuts with standard deviations n c and n t Due to the compexity for computing the optima soutions, we use MinInterfere as the standard to compare against This time, we vary n max from 5 to 160 We set: n c = 5, n t = 50, n f = 15, n e = 3, and n min = 5 Figure 7 shows the resut We can see the same trend in the soution quaity as in Figure 6 Another observation is that the change of n max does not seem to have a significant infuence on the comparative performances of these heuristics Finay, we perform time anayses on these heuristics For the first resut, we vary n c from 15 to 30; for the second, we vary n t from 40 to 55 Other parameters remain the same as in the previous simuation Figure 8 shows the resut, which aigns with Tabe I A simuations together show that: when the coaitions interfere with ony a imited number of other coaitions (ie, 0 1), InterfereAssign can be used to produce better soutions (eg, see Figure 4, or Figure 3 when n c = (3 4)), since they expicity consider this interference in their formuations; otherwise, when the interference becomes difficut to be modeed accuratey by our approach, InterfereAssign, MinInterfere, and MinStep Sum perform simiary In such cases, we can run these three heuristics and choose the best schedue produced VIII CONCLUSIONS AND FUTURE WORK In this paper, we have introduced four efficient heuristics to address the MPM MPT e probem We have formay anayzed them and provided simuations to demonstrate and compare their performances Furthermore, it is convenient to incorporate them using a ayering technique For future wor, it is interesting to study the soution quaity of MinInterfere and other heuristics, to see if the REFERENCES [1] P Brucer Scheduing Agorithms SpringerVerag New Yor, Inc, Secaucus, NJ, USA, 001 [] P Brucer, A Drex, RH Mohring, K Neumann, and E Pesch Resourceconstrained project scheduing: Notation, cassification, modes, and methods European Journa of Operationa Research, 11(1):3 41, 1999 [3] P Brucer and S Knust Compex Scheduing GorPubications Springer, 006 [4] BP Gerey and MJ Mataric A forma anaysis and taxonomy of tas aocation in mutirobot systems The Internationa Journa of Robotics Research, 3(9): , September 004 [5] S Hartmann and R Koisch Experimenta evauation of stateoftheart heuristics for the resourcconstrained project scheduing probem European Journa of Operationa Research, 17: , 1998 [6] JA Hoogeveen, SL van de Vede, and B Vetman Compexity of scheduing mutiprocessor tass with prespecified processor aocations Discrete Appied Mathematics, 55(3):59 7, 1994 [7] H W Kuhn The Hungarian method for the assignment probem Nava Research Logistic Quartery, :83 97, 1955 [8] E Neron, C Artigues, P Baptiste, J Carier, J Damay, S Demassey, and P Laborie Lower bounds for resource constrained project scheduing probem In Perspectives in Modern Project Scheduing, voume 9, pages Springer US, 006 [9] JH Patterson, F Brian Tabot, R Sowinsi, and J Wegarz Computationa experience with a bactracing agorithm for soving a genera cass of precedence and resourceconstrained scheduing probems European Journa of Operationa Research, 49(1):68 79, Nov 1990 [10] O Shehory and S Kraus Methods for tas aocation via agent coaition formation Artificia Inteigence, 101(1):165 00, 1998 [11] A Sprecher and A Drex Mutimode resourceconstrained project scheduing by a simpe, genera and powerfu sequencing agorithm European Journa of Operationa Research, 107(): , 1998 [1] F Tang and LE Parer A compete methodoogy for generating mutirobot tas soutions using ASyMTReD and maretbased tas aocation In Proceedings of the IEEE Internationa Conference on Robotics and Automation, pages , Apr 007 [13] L Vig and JA Adams Mutirobot coaition formation IEEE Transactions on Robotics, (4): , 006 [14] Y Zhang and LE Parer IQASyMTRe: Forming executabe coaitions for tighty couped mutirobot tass IEEE Transactions on Robotics, PP(99):1 17, 01 [15] Y Zhang and LE Parer Tas aocation with executabe coaitions in mutirobot tass In Proceedings of the IEEE Internationa Conference on Robotics and Automation, pages , May 01 [16] Y Zhang and LE Parer Considering intertas resource constraints in tas aocation Autonomous Agents and MutiAgent Systems, 6(3): , 013
MultiRobot Task Scheduling
MultiRobot Task Scheduling Yu ("Tony") Zhang Lynne E. Parker Distributed Intelligence Laboratory Electrical Engineering and Computer Science Department University of Tennessee, Knoxville TN, USA IEEE
More informationSorting, Merge Sort and the DivideandConquer Technique
Inf2B gorithms and Data Structures Note 7 Sorting, Merge Sort and the DivideandConquer Technique This and a subsequent next ecture wi mainy be concerned with sorting agorithms. Sorting is an extremey
More informationTeamwork. Abstract. 2.1 Overview
2 Teamwork Abstract This chapter presents one of the basic eements of software projects teamwork. It addresses how to buid teams in a way that promotes team members accountabiity and responsibiity, and
More informationSecure Network Coding with a Cost Criterion
Secure Network Coding with a Cost Criterion Jianong Tan, Murie Médard Laboratory for Information and Decision Systems Massachusetts Institute of Technoogy Cambridge, MA 0239, USA Emai: {jianong, medard}@mit.edu
More informationFace Hallucination and Recognition
Face Haucination and Recognition Xiaogang Wang and Xiaoou Tang Department of Information Engineering, The Chinese University of Hong Kong {xgwang1, xtang}@ie.cuhk.edu.hk http://mmab.ie.cuhk.edu.hk Abstract.
More informationMath: Fundamentals 100
Math: Fundamentas 100 Wecome to the Tooing University. This course is designed to be used in conjunction with the onine version of this cass. The onine version can be found at http://www.tooingu.com. We
More informationVendor Performance Measurement Using Fuzzy Logic Controller
The Journa of Mathematics and Computer Science Avaiabe onine at http://www.tjmcs.com The Journa of Mathematics and Computer Science Vo.2 No.2 (2011) 311318 Performance Measurement Using Fuzzy Logic Controer
More informationBetting Strategies, Market Selection, and the Wisdom of Crowds
Betting Strategies, Market Seection, and the Wisdom of Crowds Wiemien Kets Northwestern University wkets@keogg.northwestern.edu David M. Pennock Microsoft Research New York City dpennock@microsoft.com
More informationSimultaneous Routing and Power Allocation in CDMA Wireless Data Networks
Simutaneous Routing and Power Aocation in CDMA Wireess Data Networks Mikae Johansson *,LinXiao and Stephen Boyd * Department of Signas, Sensors and Systems Roya Institute of Technoogy, SE 00 Stockhom,
More informationWith the arrival of Java 2 Micro Edition (J2ME) and its industry
Knowedgebased Autonomous Agents for Pervasive Computing Using AgentLight Fernando L. Koch and JohnJues C. Meyer Utrecht University Project AgentLight is a mutiagent systembuiding framework targeting
More informationSELECTING THE SUITABLE ERP SYSTEM: A FUZZY AHP APPROACH. Ufuk Cebeci
SELECTING THE SUITABLE ERP SYSTEM: A FUZZY AHP APPROACH Ufuk Cebeci Department of Industria Engineering, Istanbu Technica University, Macka, Istanbu, Turkey  ufuk_cebeci@yahoo.com Abstract An Enterprise
More informationAustralian Bureau of Statistics Management of Business Providers
Purpose Austraian Bureau of Statistics Management of Business Providers 1 The principa objective of the Austraian Bureau of Statistics (ABS) in respect of business providers is to impose the owest oad
More informationMaintenance activities planning and grouping for complex structure systems
Maintenance activities panning and grouping for compex structure systems Hai Canh u, Phuc Do an, Anne Barros, Christophe Berenguer To cite this version: Hai Canh u, Phuc Do an, Anne Barros, Christophe
More informationRicoh Healthcare. Process Optimized. Healthcare Simplified.
Ricoh Heathcare Process Optimized. Heathcare Simpified. Rather than a destination that concudes with the eimination of a paper, the Paperess Maturity Roadmap is a continuous journey to strategicay remove
More informationArtificial neural networks and deep learning
February 20, 2015 1 Introduction Artificia Neura Networks (ANNs) are a set of statistica modeing toos originay inspired by studies of bioogica neura networks in animas, for exampe the brain and the centra
More informationMinimum Support Size of the Defender s Strong Stackelberg Equilibrium Strategies in Security Games
Minimum Support Size o the Deender s Strong Stackeberg Equiibrium Strategies in Security Games Jiarui Gan University o Chinese Academy o Sciences The Key Lab o Inteigent Inormation Processing, ICT, CAS
More informationHYBRID FUZZY LOGIC PID CONTROLLER. Abstract
HYBRID FUZZY LOGIC PID CONTROLLER Thomas Brehm and Kudip S. Rattan Department of Eectrica Engineering Wright State University Dayton, OH 45435 Abstract This paper investigates two fuzzy ogic PID controers
More informationApplicationAware Data Collection in Wireless Sensor Networks
AppicationAware Data Coection in Wireess Sensor Networks Xiaoin Fang *, Hong Gao *, Jianzhong Li *, and Yingshu Li +* * Schoo of Computer Science and Technoogy, Harbin Institute of Technoogy, Harbin,
More informationA BranchandPrice Algorithm for Parallel Machine Scheduling with Time Windows and Job Priorities
A BranchandPrice Agorithm for Parae Machine Scheduing with Time Windows and Job Priorities Jonathan F. Bard, 1 Siwate Rojanasoonthon 2 1 Graduate Program in Operations Research and Industria Engineering,
More informationCONTRIBUTION OF INTERNAL AUDITING IN THE VALUE OF A NURSING UNIT WITHIN THREE YEARS
Dehi Business Review X Vo. 4, No. 2, Juy  December 2003 CONTRIBUTION OF INTERNAL AUDITING IN THE VALUE OF A NURSING UNIT WITHIN THREE YEARS John N.. Var arvatsouakis atsouakis DURING the present time,
More informationLoad Balancing in Distributed Web Server Systems with Partial Document Replication *
Load Baancing in Distributed Web Server Systems with Partia Document Repication * Ling Zhuo ChoLi Wang Francis C. M. Lau Department of Computer Science and Information Systems The University of Hong Kong
More informationPERFORMANCE ANALYSIS OF GANG SCHEDULING IN A PARTITIONABLE PARALLEL SYSTEM
PERFORMANCE ANALYSIS OF GANG SCHEDULING IN A PARTITIONABLE PARALLEL SYSTEM Heen D. Karatza Department of Informatics Aristote University of Thessaoniki 54124 Thessaoniki, Greece Emai: karatza@csd.auth.gr
More informationFast Robust Hashing. ) [7] will be remapped (and therefore discarded), due to the loadbalancing property of hashing.
Fast Robust Hashing Manue Urueña, David Larrabeiti and Pabo Serrano Universidad Caros III de Madrid E89 Leganés (Madrid), Spain Emai: {muruenya,darra,pabo}@it.uc3m.es Abstract As statefu fowaware services
More informationA Latent Variable Pairwise Classification Model of a Clustering Ensemble
A atent Variabe Pairwise Cassification Mode of a Custering Ensembe Vadimir Berikov Soboev Institute of mathematics, Novosibirsk State University, Russia berikov@math.nsc.ru http://www.math.nsc.ru Abstract.
More informationTest Adequacy Assessment using Control Flow and Data Flow
CSE592 Advanced Topics in Computer Science Software Engineering Test Adequacy Assessment using Contro Fow and Data Fow Lecture 14 Conditions Any expression that evauates to true or fase constitutes a condition.
More informationNetwork/Communicational Vulnerability
Automated teer machines (ATMs) are a part of most of our ives. The major appea of these machines is convenience The ATM environment is changing and that change has serious ramifications for the security
More informationWHITE PAPER BEsT PRAcTIcEs: PusHIng ExcEl BEyond ITs limits WITH InfoRmATIon optimization
Best Practices: Pushing Exce Beyond Its Limits with Information Optimization WHITE Best Practices: Pushing Exce Beyond Its Limits with Information Optimization Executive Overview Microsoft Exce is the
More informationChapter 3: ebusiness Integration Patterns
Chapter 3: ebusiness Integration Patterns Page 1 of 9 Chapter 3: ebusiness Integration Patterns "Consistency is the ast refuge of the unimaginative." Oscar Wide In This Chapter What Are Integration Patterns?
More informationArt of Java Web Development By Neal Ford 624 pages US$44.95 Manning Publications, 2004 ISBN: 1932394060
IEEE DISTRIBUTED SYSTEMS ONLINE 15414922 2005 Pubished by the IEEE Computer Society Vo. 6, No. 5; May 2005 Editor: Marcin Paprzycki, http://www.cs.okstate.edu/%7emarcin/ Book Reviews: Java Toos and Frameworks
More informationLeakage detection in water pipe networks using a Bayesian probabilistic framework
Probabiistic Engineering Mechanics 18 (2003) 315 327 www.esevier.com/ocate/probengmech Leakage detection in water pipe networks using a Bayesian probabiistic framework Z. Pouakis, D. Vaougeorgis, C. Papadimitriou*
More informationThis paper considers an inventory system with an assembly structure. In addition to uncertain customer
MANAGEMENT SCIENCE Vo. 51, No. 8, August 2005, pp. 1250 1265 issn 00251909 eissn 15265501 05 5108 1250 informs doi 10.1287/mnsc.1050.0394 2005 INFORMS Inventory Management for an Assemby System wh Product
More informationPricing and Revenue Sharing Strategies for Internet Service Providers
Pricing and Revenue Sharing Strategies for Internet Service Providers Linhai He and Jean Warand Department of Eectrica Engineering and Computer Sciences University of Caifornia at Berkeey {inhai,wr}@eecs.berkeey.edu
More informationLoad Balance vs Energy Efficiency in Traffic Engineering: A Game Theoretical Perspective
Load Baance vs Energy Efficiency in Traffic Engineering: A Game Theoretica Perspective Yangming Zhao, Sheng Wang, Shizhong Xu and Xiong Wang Schoo of Communication and Information Engineering University
More informationFixed income managers: evolution or revolution
Fixed income managers: evoution or revoution Traditiona approaches to managing fixed interest funds rey on benchmarks that may not represent optima risk and return outcomes. New techniques based on separate
More informationMinimizing the Total Weighted Completion Time of Coflows in Datacenter Networks
Minimizing the Tota Weighted Competion Time of Cofows in Datacenter Networks Zhen Qiu Ciff Stein and Yuan Zhong ABSTRACT Communications in datacenter jobs (such as the shuffe operations in MapReduce appications
More informationVirtual trunk simulation
Virtua trunk simuation Samui Aato * Laboratory of Teecommunications Technoogy Hesinki University of Technoogy Sivia Giordano Laboratoire de Reseaux de Communication Ecoe Poytechnique Federae de Lausanne
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 12, DECEMBER 2013 1
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 12, DECEMBER 2013 1 Scaabe MutiCass Traffic Management in Data Center Backbone Networks Amitabha Ghosh, Sangtae Ha, Edward Crabbe, and Jennifer
More informationA Supplier Evaluation System for Automotive Industry According To Iso/Ts 16949 Requirements
A Suppier Evauation System for Automotive Industry According To Iso/Ts 16949 Requirements DILEK PINAR ÖZTOP 1, ASLI AKSOY 2,*, NURSEL ÖZTÜRK 2 1 HONDA TR Purchasing Department, 41480, Çayırova  Gebze,
More informationScheduling in MultiChannel Wireless Networks
Scheduing in MutiChanne Wireess Networks Vartika Bhandari and Nitin H. Vaidya University of Iinois at UrbanaChampaign, USA vartikab@acm.org, nhv@iinois.edu Abstract. The avaiabiity of mutipe orthogona
More informationOligopoly in Insurance Markets
Oigopoy in Insurance Markets June 3, 2008 Abstract We consider an oigopoistic insurance market with individuas who differ in their degrees of accident probabiities. Insurers compete in coverage and premium.
More informationChapter 2 Traditional Software Development
Chapter 2 Traditiona Software Deveopment 2.1 History of Project Management Large projects from the past must aready have had some sort of project management, such the Pyramid of Giza or Pyramid of Cheops,
More informationA New Statistical Approach to Network Anomaly Detection
A New Statistica Approach to Network Anomay Detection Christian Caegari, Sandrine Vaton 2, and Michee Pagano Dept of Information Engineering, University of Pisa, ITALY Emai: {christiancaegari,mpagano}@ietunipiit
More informationBetting on the Real Line
Betting on the Rea Line Xi Gao 1, Yiing Chen 1,, and David M. Pennock 2 1 Harvard University, {xagao,yiing}@eecs.harvard.edu 2 Yahoo! Research, pennockd@yahooinc.com Abstract. We study the probem of designing
More informationThe eg Suite Enabing ReaTime Monitoring and Proactive Infrastructure Triage White Paper Restricted Rights Legend The information contained in this document is confidentia and subject to change without
More informationOrdertoCash Processes
TMI170 ING info pat 2:Info pat.qxt 01/12/2008 09:25 Page 1 Section Two: OrdertoCash Processes Gregory Cronie, Head Saes, Payments and Cash Management, ING O rdertocash and purchasetopay processes
More informationPricing Internet Services With Multiple Providers
Pricing Internet Services With Mutipe Providers Linhai He and Jean Warand Dept. of Eectrica Engineering and Computer Science University of Caifornia at Berkeey Berkeey, CA 94709 inhai, wr@eecs.berkeey.edu
More informationOnline Supplement for The Robust Network Loading Problem under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
Onine Suppement for The Robust Network Loading Probem under Hose Demand Uncertaint: Formuation, Pohedra Anasis, and Computations Aşegü Atın Department of Industria Engineering, TOBB Universit of Economics
More informationThe Radix4 and the Class of Radix2 s FFTs
Chapter 11 The Radix and the Cass of Radix s FFTs The divideandconuer paradigm introduced in Chapter 3 is not restricted to dividing a probem into two subprobems. In fact, as expained in Section. and
More information3.3 SOFTWARE RISK MANAGEMENT (SRM)
93 3.3 SOFTWARE RISK MANAGEMENT (SRM) Fig. 3.2 SRM is a process buit in five steps. The steps are: Identify Anayse Pan Track Resove The process is continuous in nature and handed dynamicay throughout ifecyce
More informationAn Idiot s guide to Support vector machines (SVMs)
An Idiot s guide to Support vector machines (SVMs) R. Berwick, Viage Idiot SVMs: A New Generation of Learning Agorithms Pre 1980: Amost a earning methods earned inear decision surfaces. Linear earning
More informationWe focus on systems composed of entities operating with autonomous control, such
Middeware Architecture for Federated Contro Systems Girish Baiga and P.R. Kumar University of Iinois at UrbanaChampaign A federated contro system (FCS) is composed of autonomous entities, such as cars,
More informationPREFACE. Comptroller General of the United States. Page i
 I PREFACE T he (+nera Accounting Office (GAO) has ong beieved that the federa government urgenty needs to improve the financia information on which it bases many important decisions. To run our compex
More informationEarly access to FAS payments for members in poor health
Financia Assistance Scheme Eary access to FAS payments for members in poor heath Pension Protection Fund Protecting Peope s Futures The Financia Assistance Scheme is administered by the Pension Protection
More informationCLOUD service providers manage an enterpriseclass
IEEE TRANSACTIONS ON XXXXXX, VOL X, NO X, XXXX 201X 1 Oruta: PrivacyPreserving Pubic Auditing for Shared Data in the Coud Boyang Wang, Baochun Li, Member, IEEE, and Hui Li, Member, IEEE Abstract With
More informationGREEN: An Active Queue Management Algorithm for a Self Managed Internet
: An Active Queue Management Agorithm for a Sef Managed Internet Bartek Wydrowski and Moshe Zukerman ARC Specia Research Centre for UtraBroadband Information Networks, EEE Department, The University of
More informationDEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We show that if H is an effectivey competey decomposabe computabe torsionfree abeian group, then
More informationComputing the depth of an arrangement of axisaligned rectangles in parallel
Computing the depth of an arrangement of axisaigned rectanges in parae Hemut At Ludmia Scharf Abstract We consider the probem of computing the depth of the arrangement of n axisaigned rectanges in the
More informationDynamic Pricing Trade Market for Shared Resources in IIU Federated Cloud
Dynamic Pricing Trade Market or Shared Resources in IIU Federated Coud Tongrang Fan 1, Jian Liu 1, Feng Gao 1 1Schoo o Inormation Science and Technoogy, Shiiazhuang Tiedao University, Shiiazhuang, 543,
More informationDetermining the User Intent of ChineseEnglish Mixed Language Queries Based On Search Logs
Determining the User Intent of ChineseEngish Mixed Language Queries Based On Search Logs Hengyi Fu, Forida State University, City University of New York Abstract With the increasing number of mutiingua
More informationApplying graph theory to automatic vehicle tracking by remote sensing
0 0 Appying graph theory to automatic vehice tracking by remote sensing *Caros Lima Azevedo Nationa Laboratory for Civi Engineering Department of Transportation Av. Do Brasi, Lisbon, 000 Portuga Phone:
More informationAdvanced ColdFusion 4.0 Application Development  3  Server Clustering Using Bright Tiger
Advanced CodFusion 4.0 Appication Deveopment  CH 3  Server Custering Using Bri.. Page 1 of 7 [Figures are not incuded in this sampe chapter] Advanced CodFusion 4.0 Appication Deveopment  3  Server
More informationA train dispatching model based on fuzzy passenger demand forecasting during holidays
Journa of Industria Engineering and Management JIEM, 2013 6(1):320335 Onine ISSN: 20130953 Print ISSN: 20138423 http://dx.doi.org/10.3926/jiem.699 A train dispatching mode based on fuzzy passenger demand
More informationLeadership & Management Certificate Programs
MANAGEMENT CONCEPTS Leadership & Management Certificate Programs Programs to deveop expertise in: Anaytics // Leadership // Professiona Skis // Supervision ENROLL TODAY! Contract oder Contract GS02F0010J
More informationMarket Design & Analysis for a P2P Backup System
Market Design & Anaysis for a P2P Backup System Sven Seuken Schoo of Engineering & Appied Sciences Harvard University, Cambridge, MA seuken@eecs.harvard.edu Denis Chares, Max Chickering, Sidd Puri Microsoft
More informationCERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY. Course Offered By: Indian Environmental Society
CERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY Course Offered By: Indian Environmenta Society INTRODUCTION The Indian Environmenta Society (IES) a dynamic and fexibe organization with a goba vision
More informationDEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS
1 DEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS 2 ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We show that if H is an effectivey competey decomposabe computabe torsionfree abeian group,
More informationLecture 5: Solution Method for Beam Deflections
Structura Mechanics.080 Lecture 5 Semester Yr Lecture 5: Soution Method for Beam Defections 5.1 Governing Equations So far we have estabished three groups of equations fuy characterizing the response of
More informationOn Distributed Computation Rate Optimization for Deploying Cloud Computing Programming Frameworks
On Distributed omputation ate Optimization for Depoying oud omputing Programming Framewors Jia Liu athy H. Xia Ness B. Shroff Xiaodong Zhang Dept. of Eectrica and omputer Engineering Dept. of Integrated
More informationThe Computation of the Inverse of a Square Polynomial Matrix
The Computation of the Inverse of a Square Poynomia Matrix Ky M. Vu, PhD. AuLac Technoogies Inc. c 2008 Emai: kymvu@auactechnoogies.com Abstract An approach to cacuate the inverse of a square poynomia
More informationFRAME BASED TEXTURE CLASSIFICATION BY CONSIDERING VARIOUS SPATIAL NEIGHBORHOODS. Karl Skretting and John Håkon Husøy
FRAME BASED TEXTURE CLASSIFICATION BY CONSIDERING VARIOUS SPATIAL NEIGHBORHOODS Kar Skretting and John Håkon Husøy University of Stavanger, Department of Eectrica and Computer Engineering N4036 Stavanger,
More informationA Similarity Search Scheme over Encrypted Cloud Images based on Secure Transformation
A Simiarity Search Scheme over Encrypted Coud Images based on Secure Transormation Zhihua Xia, Yi Zhu, Xingming Sun, and Jin Wang Jiangsu Engineering Center o Network Monitoring, Nanjing University o Inormation
More informationEducation sector: Working conditions and job quality
European Foundation for the Improvement of Living and Working Conditions sector: Working conditions and job quaity Work pays a significant roe in peope s ives, in the functioning of companies and in society
More informationHybrid Process Algebra
Hybrid Process Agebra P.J.L. Cuijpers M.A. Reniers Eindhoven University of Technoogy (TU/e) Den Doech 2 5600 MB Eindhoven, The Netherands Abstract We deveop an agebraic theory, caed hybrid process agebra
More informationEE 178/278A Probabilistic Systems Analysis. Spring 2014 Tse/Hussami Lecture 11. A Brief Introduction to Continuous Probability
EE 178/278A Probabiistic Systems Anaysis Spring 2014 Tse/Hussami Lecture 11 A Brief Introduction to Continuous Probabiity Up to now we have focused excusivey on discrete probabiity spaces Ω, where the
More informationOptimizing QoSAware Semantic Web Service Composition
Optimizing QoSAware Semantic Web Service Composition Freddy Lécué The University of Manchester Booth Street East, Manchester, UK {(firstname.astname)@manchester.ac.uk} Abstract. Ranking and optimization
More informationELEVATING YOUR GAME FROM TRADE SPEND TO TRADE INVESTMENT
Initiatives Strategic Mapping Success in The Food System: Discover. Anayze. Strategize. Impement. Measure. ELEVATING YOUR GAME FROM TRADE SPEND TO TRADE INVESTMENT Foodservice manufacturers aocate, in
More informationDesign of FollowUp Experiments for Improving Model Discrimination and Parameter Estimation
Design of FoowUp Experiments for Improving Mode Discrimination and Parameter Estimation Szu Hui Ng 1 Stephen E. Chick 2 Nationa University of Singapore, 10 Kent Ridge Crescent, Singapore 119260. Technoogy
More informationComparison of Traditional and OpenAccess Appointment Scheduling for Exponentially Distributed Service Time
Journa of Heathcare Engineering Vo. 6 No. 3 Page 34 376 34 Comparison of Traditiona and OpenAccess Appointment Scheduing for Exponentiay Distributed Service Chongjun Yan, PhD; Jiafu Tang *, PhD; Bowen
More informationLearning framework for NNs. Introduction to Neural Networks. Learning goal: Inputs/outputs. x 1 x 2. y 1 y 2
Introduction to Neura Networks Learning framework for NNs What are neura networks? Noninear function approimators How do they reate to pattern recognition/cassification? Noninear discriminant functions
More informationIntegrating Risk into your Plant Lifecycle A next generation software architecture for risk based
Integrating Risk into your Pant Lifecyce A next generation software architecture for risk based operations Dr Nic Cavanagh 1, Dr Jeremy Linn 2 and Coin Hickey 3 1 Head of Safeti Product Management, DNV
More informationRicoh Legal. ediscovery and Document Solutions. Powerful document services provide your best defense.
Ricoh Lega ediscovery and Document Soutions Powerfu document services provide your best defense. Our peope have aways been at the heart of our vaue proposition: our experience in your industry, commitment
More informationMeasuring operational risk in financial institutions
Measuring operationa risk in financia institutions Operationa risk is now seen as a major risk for financia institutions. This paper considers the various methods avaiabe to measure operationa risk, and
More informationWideArea Traffic Management for. Cloud Services
WideArea Traffic Management for Coud Services Joe Wenjie Jiang A Dissertation Presented to the Facuty of Princeton University in Candidacy for the Degree of Doctor of Phiosophy Recommended for Acceptance
More informationConsidering Dynamic, NonTextual Content when Migrating Digital Asset Management Systems
Considering Dynamic, NonTextua Content when Migrating Digita Asset Management Systems Aya Stein; University of Iinois at UrbanaChampaign; Urbana, Iinois USA Santi Thompson; University of Houston; Houston,
More informationQuery Optimization Concepts in Distributed Database
Internationa Journa of Engineering Technoogy Science and Research Voume 2 Issue 7 Juy 2015 Query Optimization Concepts in Distributed Database Rudrani sharma, Er. Pushpnee Verma, Er. Sachin Chaudhary Department
More informationLearning from evaluations Processes and instruments used by GIZ as a learning organisation and their contribution to interorganisational learning
Monitoring and Evauation Unit Learning from evauations Processes and instruments used by GIZ as a earning organisation and their contribution to interorganisationa earning Contents 1.3Learning from evauations
More information3.5 Pendulum period. 20090210 19:40:05 UTC / rev 4d4a39156f1e. g = 4π2 l T 2. g = 4π2 x1 m 4 s 2 = π 2 m s 2. 3.5 Pendulum period 68
68 68 3.5 Penduum period 68 3.5 Penduum period Is it coincidence that g, in units of meters per second squared, is 9.8, very cose to 2 9.87? Their proximity suggests a connection. Indeed, they are connected
More informationDriving Accountability Through Disciplined Planning with Hyperion Planning and Essbase
THE OFFICIAL PUBLICATION OF THE Orace Appications USERS GROUP summer 2012 Driving Accountabiity Through Discipined Panning with Hyperion Panning and Essbase Introduction to Master Data and Master Data
More informationHuman Capital & Human Resources Certificate Programs
MANAGEMENT CONCEPTS Human Capita & Human Resources Certificate Programs Programs to deveop functiona and strategic skis in: Human Capita // Human Resources ENROLL TODAY! Contract Hoder Contract GS02F0010J
More informationONE of the most challenging problems addressed by the
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, VOL. 44, NO. 9, SEPTEMBER 2006 2587 A Mutieve ContextBased System for Cassification of Very High Spatia Resoution Images Lorenzo Bruzzone, Senior Member,
More information1.3 The Real Numbers.
24 CHAPTER. NUMBERS.3 The Rea Numbers. The rea numbers: R = {numbers on the numberine} require some rea anaysis for a proper definition. We sidestep the anaysis, reying instead on our ess precise notions
More informationPracticing Reference... Learning from Library Science *
Practicing Reference... Learning from Library Science * Mary Whisner ** Ms. Whisner describes the method and some of the resuts reported in a recenty pubished book about the reference interview written
More informationDesign and Analysis of a Hidden Peertopeer Backup Market
Design and Anaysis of a Hidden Peertopeer Backup Market Sven Seuken, Denis Chares, Max Chickering, Mary Czerwinski Kama Jain, David C. Parkes, Sidd Puri, and Desney Tan December, 2015 Abstract We present
More informationAUSTRALIA S GAMBLING INDUSTRIES  INQUIRY
Mr Gary Banks Chairman Productivity Commission PO Box 80 BELCONNEN ACT 2616 Dear Mr Banks AUSTRALIA S GAMBLING INDUSTRIES  INQUIRY I refer to the Issues Paper issued September 1998 seeking submissions
More informationAutomatic Structure Discovery for Large Source Code
Automatic Structure Discovery for Large Source Code By Sarge Rogatch Master Thesis Universiteit van Amsterdam, Artificia Inteigence, 2010 Automatic Structure Discovery for Large Source Code Page 1 of 130
More informationNormalization of Database Tables. Functional Dependency. Examples of Functional Dependencies: So Now what is Normalization? Transitive Dependencies
ISM 602 Dr. Hamid Nemati Objectives The idea Dependencies Attributes and Design Understand concepts normaization (HigherLeve Norma Forms) Learn how to normaize tabes Understand normaization and database
More informationREADING A CREDIT REPORT
Name Date CHAPTER 6 STUDENT ACTIVITY SHEET READING A CREDIT REPORT Review the sampe credit report. Then search for a sampe credit report onine, print it off, and answer the questions beow. This activity
More informationFast bmatching via Sufficient Selection Belief Propagation
Fast bmatching via Sufficient Seection Beief Propagation Bert Huang Computer Science Department Coumbia University New York, NY 127 bert@cs.coumbia.edu Tony Jebara Computer Science Department Coumbia
More informationTHE IMPACT OF AN EXECUTIVE LEADERSHIP DEVELOPMENT PROGRAM
Leadership THE IMPACT OF AN EXECUTIVE LEADERSHIP DEVELOPMENT PROGRAM n Jay S. Grider, DO, PhD, Richard Lofgren, MD and Raph Weicke In this artice A eadership deveopment program at an academic medica center
More informationTake me to your leader! Online Optimization of Distributed Storage Configurations
Take me to your eader! Onine Optimization of Distributed Storage Configurations Artyom Sharov Aexander Shraer Arif Merchant Murray Stokey sharov@cs.technion.ac.i, {shraex, aamerchant, mstokey}@googe.com
More information