Using Graph Analysis to Study Networks of Adaptive Agent

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Using Graph Analysis to Study Networks of Adaptive Agent"

Transcription

1 Uing Graph Analyi to Study Network of Adaptive Agent Sherief Abdallah Britih Univerity in Dubai, United Arab Emirate Univerity of Edinburgh, United Kingdom ABSTRACT Experimental analyi of network of cooperative learning agent (to verify certain propertie uch a the ytem tability) ha been commonly ued due to the complexity of theoretical analyi in uch cae. Due to the large number of parameter to analyze, reearcher ued metric that ummarize the ytem in few parameter. Since in cooperative ytem the ultimate goal i to optimize ome global metric, reearcher typically analyzed the evolution of the global performance metric over time to verify ytem propertie. For example, if the global metric improve and eventually tabilize, it i conidered a reaonable verification of the ytem tability. The global performance metric, however, overlook an important apect of the ytem: the network tructure. We how an experimental cae tudy where the convergence of the global performance metric i deceiving, hiding an underlying intability in the ytem that later lead to a ignificant drop in performance. To expoe uch intability, we propoe the ue of the graph analyi methodology, where the network tructure i ummarized uing ome network meaure. We develop a new network meaure that ummarize an agent interaction with it neighbor and take the diparity of thee interaction into account. The new meaure i applied to our cae tudy, clearly expoing the intability that wa previouly hidden by the global performance metric. Categorie and Subject Decriptor I.2.6 [Artificial Intelligence]: Learning; I.2.11 [Artificial Intelligence]: Ditributed Artificial Intelligence General Term Experimentation Keyword Simulation and Experimental Verification, Agent Network, Multi-agent Learning, Network Analyi 1. INTRODUCTION Cite a: Proc. of 9th Int. Conf. on Autonomou Agent and Multiagent Sytem (AAMAS 2010) c Organizing agent in a network i a common approach to achieve calability in multi-agent ytem [1]. Retricting an agent to interact only with it neighbor implifie the agent deciion making problem (the problem become independent of the overall ytem ize). To cope with an environment that keep changing or that i not known a prior, learning algorithm have been ued to optimize performance in agent network [2, 3, 1]. Multi-agent learning algorithm allow agent to optimize their deciion baed on their interaction with both the environment and their neighbor in the network. Analyzing the dynamic of uch a ytem (coniting of networked adaptive agent) over time i a nontrivial tak, due to the large number of ytem parameter (each agent maintain a et of local parameter controlling it behavior), the concurrency by which thee parameter change (agent acting independently), and the delay in the effect/conequence of parameter change (becaue of communication delay between agent and the time it take for learning algorithm to adapt). A reearcher tudying a large-cale ytem of adaptive agent needed ome metric to ummarize thi ytem (with it large number of parameter) into a few number that are more manageable. In cooperative MAS, the natural choice wa the global performance metric() the ytem i trying to optimize (e.g. payoff). Reearcher inpected the evolution of ome global performance metric a a rough approximation to the internal dynamic of the adaptive agent network. [2, 3, 1]. For example, if the global metric improved over time and eventually appeared to tabilize, it wa uually conidered a reaonable verification of convergence. Example of global performance metric include the percentage of total number of delivered packet in routing problem [4], the average turn around time of tak in tak allocation problem [5], or the average reward (received by agent) in general [6]. The global performance metric, however, overlook an important apect of the ytem: the network tructure. We preent in thi paper an experimental cae tudy where the tability of the global performance metric can hide an underlying intability in the ytem. The hidden intability later lead to a ignificant drop in the global performance metric itelf, but after ome period of (fake) tability. We propoe the ue of graph analyi to tudy the dynamic of networked adaptive agent. Graph analyi i an interdiciplinary reearch field that tudie intereting graph propertie in real-world network. In recent year graph analyi received ignificant attention due to the exploive growth of ocial network and the dicovery of common pattern that govern a wide-range of real world network [7, 8]. 517

2 Figure 1: Example howing the evolution of a node interaction with it neighbor over time (top) and the correponding continuou degree of that node over time. The core of graph analyi i network meaure: function that ummarize a graph to impler numeric value which are then more manageable to analyze. One can abtract a networked MAS at any point in time a a weighted graph, where an edge weight reflect the amount of interaction over that edge (e.g. the number of meage exchanged). Figure 4(a) how an example network of 4 agent. We can then apply ome network meaure that were developed in graph analyi to ummarize thee weighted graph into meaningful more manageable parameter. However, the bulk of the meaure previouly developed in graph analyi focued on unweighted graph [9]. The lack of weighted network meaure i due, at leat in part, to the difficulty of quantifying uch weight in real-world network (e.g. ocial network). Even if quantified, the accuracy of uch weight are at bet debatable. In our cae here network are artificial and weight can be quantified preciely. In fact, weight can not be ignored, becaue they provide crucial inight into the learning proce going on inide the network of agent. We propoe a new network meaure, which we call the continuou degree. The new meaure take weight into account to determine how many neighbor are effectively being ued by an agent in the network. Figure 1 illutrate how our new meaure ummarize the evolution of a node interaction over time. When initially the agent interact uniformly with all it neighbor, the continuou degree equal 4, the number of neighbor. At the other extreme when the agent interact motly with one neighbor, the continuou degree equal 1. We prove intereting propertie of our propoed meaure, including it connection to the traditional node degree and it ability to capture the diparity of interaction among neighbor. We ue our meaure to expoe and explain the intability reported in the cae tudy we mentioned earlier. In ummary, thi paper make the following contribution: preent a cae tudy illutrating the rik of relying on global performance metric to analyze network of adaptive agent. propoe the ue of graph analyi to analyze network of adaptive agent, and develop a new network meaure that take the diparity of interaction among agent into account illutrate how graph analyi can be ued to explain the oberved behavior in our cae tudy. The paper i organized a follow. Section 2 decribe the cae tudy we will be uing throughout the paper. Section 3 preent our propoed meaure, the continuou degree. Section 4 reviit the cae tudy, illutrating how the continuou degree expoe the intability in the ytem. Section 5 analyze our propoed meaure and prove ome of it propertie. Section 6 dicue the related work. We conclude in Section CASE STUDY: DISTRIBUTED TASK AL- LOCATION PROBLEM (DTAP) We ue a implified verion of the ditributed tak allocation domain (DTAP) [5], where the goal of the ytem i to aign tak to agent uch that the ervice time of each tak i minimized. For illutration, conider the example cenario depicted in Figure 2. Agent A0 receive tak T1, which can be executed by any of the agent A0, A1, A2, A3, and A4. All agent other than agent A4 are overloaded, and therefore the bet option for agent A0 i to forward tak T1 to agent A2 which in turn forward the tak to it left neighbor (A5) until tak T1 reache agent A4. Although agent A0 doe not know that A4 i under-loaded (becaue agent A0 interact only with it immediate neighbor), agent A0 hould eventually learn (through experience and interaction with it neighbor) that ending tak T1 to agent A2 i the bet action without even knowing that agent A4 exit. Figure 2: Tak allocation uing a network of agent. Each time unit, agent make deciion regarding all tak requet received during thi time unit. For each tak, the agent can either execute the tak locally or end the tak to a neighboring agent. If an agent decide to execute the tak locally, the agent add the tak to it local queue, where tak are executed on a firt come firt erve bai, with unlimited queue length. The main goal of DTAP i to reduce the total ervice time, averaged over tak, AT ST = T T τ TST(T ) T τ, where T τ i the et of tak requet received during a time period τ and TST(T ) i the total time a tak T pend in the ytem. The TST(T ) time conit of the time for routing a tak requet through the network, the time the tak requet pend in the local queue, and the time of actually executing the tak. Agent interact via two type of meage. A REQUEST meage i, j, T indicate a requet ent from agent i to agent j requeting the execution of tak T. An UPDATE 518

3 meage i, j, T, R indicate a feedback (reward ignal) from agent i to agent j that tak T took R time tep to complete (the time tep are computed from the time agent i received T requet). Communication delay i an important property of our verion of DTAP. Each agent ha a phyical location and the communication delay between two agent i proportional to the Euclidean ditance between them (one time unit per ditance unit). Due to communication delay, the effect of an action doe not appear immediately becaue it i communicated via meage and meage take time to route. Not only i the reward delayed but o i any change in the ytem tate. A conequence of communication delay i partial obervability: an agent can not oberve the full ytem tate (the queue at every other agent, meage on link and in queue, etc.). Although the underlying imulator ha different underlying tate (tak at local agent queue, meage in tranit over communication link, etc.), we made agent obliviou to thee tate. The only feedback an agent get i it own reward. Thi implifie the agent deciion problem and reemphaize partial obervability: agent collectively learn a joint policy that make a good compromie over the different unoberved tate. The following ection give a brief overview of the multi-agent learning (MAL) algorithm that we evaluate in our cae tudy and dicue the iue of convergence with repect to MAL. 2.1 Multiagent Learning A large number of multi-agent learning algorithm were propoed that vary in their underlying aumption and target domain [10]. The experimental reult and the analyi we report here focu on two (gradient-acent) multi-agent learning algorithm: GIGA-WoLF [11] and WPL [5], but our methodology can be ued with other algorithm a well. Thee two learning algorithm allow agent to learn tochatic policie, which are better uited for partially-obervable domain [1]. The pecific of WPL and GIGA-WoLF (uch a their update equation, the underlying intuition, their difference and imilaritie) are neither relevant to the purpoe of thi paper nor needed to follow our analyi in Section 4. Neverthele, and for completene, we mention below (very briefly) the equation for updating the policy for the two algorithm. Further detail regarding the two algorithm can be found elewhere [11, 5]. The term convergence, in the reinforcement learning context, refer to the tability of the learning proce (and the underlying model) over time. Similar to ingle agent reinforcement learning algorithm (uch a Q-learning [12]), the convergence of a multi-agent reinforcement learning (MARL) algorithm i an important property that received coniderable attention [13, 11, 14, 15, 16, 5]. However, proving the convergence of a MARL algorithm via theoretical analyi i ignificantly more challenging than proving the convergence in the ingle agent cae. The preence of other agent that are alo learning deem the environment non-tationary, therefore violating a foundational aumption in ingle agent learning. In fact, proving the convergence of a MARL algorithm even in 2-player-2-action ingle-tage game (arguably the implet cla of multi-agent ytem domain) ha been challenging [13, 14, 5]. An agent i uing WPL update it policy π i according to the following equation: j neighbor(i) :Δπ t+1 i (j) { Vi t (π) πi t(j) η πi(j) t if V i t (π) < 0 π i t(j) 1 πi(j) t otherwie π t+1 i projection(πi t +Δπ t+1 i ) where η i a mall learning contant and V i(π) itheexpected reward agent i would get if all agent (including agent i) follow the joint policy π (agent i part of π i it own policy π i). The projection function enure that after adding the gradient Δπ i to the policy, the reulting policy i till valid. An agent i uing GIGA-WoLF update it policy π i according to the following equation: ˆπ t+1 i z t+1 i = projection(π t i + ηv t i (π) t ) = projection(πi t + ηvi t (π)/3) δ t+1 i = min (1, zt+1 i zi t ) z t+1 i ˆπ i t π t+1 i =ˆπ t+1 i + δ t+1 i (z t+1 i ˆπ t+1 i ) The following ection evaluate both WPL and GIGA- WoLF in DTAP uing ATST a the metric of evaluation. 2.2 Stability Under the Global Metric Reult We have evaluated the performance of WPL and GIGA WoLF uing the following etting.100 agent are organized in a 10x10 grid. Communication delay between two adjacent agent i two time unit. Tak arrive at the 4x4 ub-grid (i.e. the 16 agent at the center) at the center at rate 0.5 tak per agent per time unit. All agent can execute a tak with a rate of 0.1 tak/time unit (both tak arrival and ervice duration follow an exponential ditribution). Figure 3 plot the global performance (meaured in term of ATST) of the two multi-agent learning algorithm in the DTAP domain. Jut by looking at the ATST plot, it i relatively afe to conclude that WPL converge quickly while GIGA-WoLF converge after about 75,000 time tep. Thi i conitent with previouly reported reult that were conducted on a much impler verion of DTAP (only 5 agent with no communication delay) [17]. The following ection preent a new network meaure that we later ue to dicover that the apparent tability of GIGA-WoLF i actually mileading WPL GIGA WoLF Figure 3: Comparing the average total ervice time for 200,000 time tep of the DTAP problem for WPL and GIGA-WoLF. 519

4 3. THE CONTINUOUS DEGREE (C-DEGREE) A key meaurement that ha been ued extenively in analyzing network i the degree of a node. A node degree i the number of edge incident to that node. Intuitively, a node degree reflect how connected the node i. Thi imple meaure (along with other network meaure) allowed the dicovery of pattern common in many real world network, uch a the power law of the degree ditribution [18]. To put it more formally, a network (graph) i defined a N = V,E, where V i the et of network node (vertice) and E i the et of edge (link) connecting thee node. The degree of a node v V i k(v) = E(v), where E(v) i the et of edge incident to node v. For a weighted network, we define the function which return the weight of edge e E. Alo for convenience, we define the function W (v) = {W (e) : e E(v)}, i.e. the multiet of weight incident to node v. The degree ditribution P (k) meaure the frequency of a particular degree k in a network (P (k = u) = {v : v V k(v) =u} ) and erve a a common method for ummarizing and characterizing network. One of the limitation of the degree meaure i that it ignore any diparity in the interaction between a node and it neighbor. In other word, the degree meaure aume uniform interaction acro each node neighbor. Thi can reult in giving an incorrect perception of the effective node degree. For example, an agent may have 10 or more neighbor but mainly interact with only two of them. Should that agent be conidered 2 time more connected than an agent with only 5 neighbor but alo interacting primarily with two of them? We introduce in thi paper a new meaure for analyzing weighted network: the continuou degree, orthec-degree. Definition 1. The C-degree of a node v in a network i r(v), where { 0 if v i diconnected r(v) = e E(v) 2( (v) log 2 (v) ) otherwie Where (v) = w W (v) w i called the trength of node v. Intuitively, the quantity repreent the probability of (v) { } an interaction over an edge e. The et (e, ):e E(v) (v) i the interaction probability ditribution for node v. The quantity H(v) = [ ] e E(v) log (v) (v) 2 i then the en- tropy of the interaction probability ditribution, or how many bit are needed to encode the interaction probability ditribution. The entropy quantifie the diparity in the interaction ditribution: the more uniform the interaction ditribution i, the higher the entropy and vice vera. 1 The purpoe of the power 2 i to convert the entropy back to the number of neighbor that are effectively being ued. Figure 4 compare the continuou degree ditribution to the (dicrete) degree ditribution in a imple weighted network of four node. A node on the boundary ha an out degree of 1, while an internal node ha an out degree of 2. Intuitively, however, only one of the internal node i fully utilizing it degree of 2 (the one to the left), while the other 1 Thi i in contrat to the Y meaure, which decreae if the interaction ditribution become more uniform. A brief dicuion of the Y-meaure i given in Section 6 Figure 4: Continuou v dicrete degree ditribution. node (to the right) i motly uing one neighbor only. The C-degree meaure capture thi and how that only one internal node ha a C-degree of 2 while the other internal node ha a C-degree of What et our meaure apart from previou work in graph analyi i that it i a continuou generalization of the degree meaure that capture the diparity of interaction (the difference in weight) among the neighbor of a node. In particular, if every node interact with all it neighbor equally, then the C-degree become identical to traditional (dicrete) degree meaure of the ame node. However, if there i a diparity in a node interaction with it neighbor, then the C-degree will capture uch diparity, unlike the traditional degree meaure. We prove thee propertie of the C-degree in Section 5, but before doing o, let u illutrate how the C-degree can help in verifying the tability of a network of adaptive agent. 4. VERIFYING STABILITY USING C-DEGREE Returning to our cae tudy (refer to Section 2), Figure 5 plot the average C-degree over the 100 agent againt time. When agent are uing WPL, the C-degree do tabilize. When agent ue GIGA-WoLF, however, the C-degree doe not converge and continue to decreae. Thi obervation ugget that we need to run the imulation for a longer time period in order to verify GIGA-WoLF tability. Figure 5: The average C-degree of WPL and GIGA- WoLF for 200,000 time tep. When the imulator i allowed to run for 600,000 time 520

5 tep, the global performance metric (the ATST in the cae of DTAP) of GIGA-WoLF tart lowly to diverge after 250,000 time tep and the correponding C-degree continue to decreae. WPL C-degree remain table, conitent with WPL the global performance metric WPL GIGA WoLF Figure 6: Comparing the ATST for 600,000 time tep of the DTAP problem for WPL and GIGA-WoLF. 5. PROPERTIES OF THE C-DEGREE The C-degree atifie three propertie that etablih it connection to the original degree metric (firt two propertie) and it ability to capture the diparity of interaction among the neighbor of a node (the third property). 1. Preerving maximum degree: v V : r(v) k(v). Furthermore, r(v) =k(v) iff e E(v) : = C, where C i ome contant. In other word, the C-degree i maximum and equal the original degree when there i no diparity between weight. 2. Preerving minimum degree: v V : r(v) =0 iff v i diconnected. Furthermore, r(v) =1iff e E(v) : > 0 and e E(v) e e : w(e ) = 0. In other word, the C-degree equal one when all edge, except one edge, have zero weight. 3. Conitent partial order over node: The C-degree impoe a imple partial order that i conitent with the above two propertie. If the two node have the ame number of neighbor, the ame ummation of weight (trength), and the individual edge weight are the ame except for two edge, then the node with more uniform weight ha higher C-degree. A formal definition of thi property i given in Lemma 4. The intuition of the three propertie can be clarified through the following numeric example. Let v1,v2,v3, and v4 be four node where W (v1) = {5, 5, 5, 5},W(v2) = {9, 5, 5, 1},W(v3) = {9, 8, 2, 1} and W (v4) = {20, 0, 0, 0}. The third property then guarantee that the C-degree impoe the ordering: r(v1) >r(v2) >r(v3). All three propertie guarantee that k(v1) = r(v1) >r(v2) >r(v3) >r(v4) = 1. Below we prove the three propertie. Figure 7: The average C-degree of WPL and GIGA- WoLF for 600,000 time tep. The plot of the C-degree tell u that GIGA-WoLF learn a a lower pace than WPL. Furthermore, while agent uing WPL continue to effectively ue (at leat) two neighbor, agent uing GIGA-WoLF almot learn a determinitic policy (interacting primarily with only one neighbor). It i intereting to note that the average payoff for GIGA-WoLF tart to diverge when the average C-degree of GIGA-WoLF fall below the average C-degree of WPL. GIGA-WoLF divergence in thi cae tudy i not urpriing in itelf, ince GIGA-WoLF convergence wa proved only for 2-player-2- action game and GIGA-WoLF wa reported to diverge in ome game with larger number of either player or action [11, 19]. A more in-depth analyi that take the pecific of GIGA-WoLF into account i needed to fully explain the root of GIGA-WoLF divergence in the DTAP domain. Such an analyi i beyond the cope of thi paper and hould not ditract from the main point we are trying to make: the common practice of uing a global performance metric to verify the tability of an adaptive MAS i not reliable and can hide threatening intability. Graph analyi can provide ueful inight in that repect when equipped with informative network meaure, uch a the meaure we have preented. Lemma 2. The C-degree atifie the minimum degree axiom. Proof. When all weight are zero except only one weight that i greater than zero, then the entropy (the exponent of the C-degree) i zero, and therefore the C-degree i 1. Lemma 3. The C-degree atifie the maximum degree axiom. Proof. Under uniform interaction, all the weight incident to a node v are equal to a contant W v. Therefore v V,e E(v) : (v) = W v e E(v) Wv = 1 We then have e E(v) v : r(v) =2 (v) log 2 (v) =2 1 k(v) k(v) log 2 (k(v)) =2 log 2 (k(v)) = k(v) k(v) In other word, both the degree and the C-degree of a node become equivalent under uniform interaction. The C-degree i alo maximum in thi cae, becaue the exponent i the entropy of the interaction ditribution, which i maximum when the interaction i uniform over edge. 521

6 Lemma 4. The C-degree atifie the conitent partial order property. Proof. Let i, j be two node uch that k(i) = k(j) = n, (i) = (j) =, W (i) W (j) = n 2, {w i1,w i2} = W (i) W (j), {w j1,w j2} = W (j) W (i), and w i1 w i2 < w j1 w j2. Without lo of generality, we can aume that w i1 w i2 and w j1 w j2, therefore w i1 w i2 <w j1 w j2. We alo have w i1 + w i2, therefore w j1 =1 > wi1 w W (i) W (j) w c 2 c wi1 Then from Lemma 5 we have h(c, w i1 wi1 wj1 = wj1 + wj2 wj1 >c = c ) >h(c, w j1 ), or log 2( wi1 wi1 ) (c )log 2(c wi1 ) > log 2( wj1 wj1 ) (c )log 2(c wj1 ) Therefore H(i) > H(j), becaue the ret of the entropy term (correponding to W (i) W (j)) are equal, and conequently r(i) >r(j). Lemma 5. The quantity h(c, x) = x log 2 (x) (C x)log 2 (C x) i ymmetric around and maximized at x = C 2 for C x 0. Proof. h(c, C 2 + δ) = ( C 2 + δ)log 2( C 2 + δ) ( C 2 δ)log 2( C 2 δ) = h(c, C 2 δ) Therefore h(c, x) i ymmetric around c/2. Furthermore, h(c, x) i maximized when h(c, x) =0= 1 log x 2 x +1+log 2 (C x) or log 2 x =log 2 (C x) Therefore h(c, x) i maximized at x = C x = C. 2 The following ection dicue the imilaritie and difference between the C-degree and previouly developed network meaure in the field of graph analyi. 6. RELATED WORK Some reearcher analyzed how individual agent policie co-evolved over time, either theoretically [13, 20, 5] or experimentally [6], a the number of agent increae, but inpecting individual agent policie doe not cale well with the ize of the network. A recent work ued data mining technique to extract pattern from log file of communicated meage between agent [21]. Inpecting individual meage exchanged between the agent become le practical and le ueful a the network get larger. Some of the previou work provided generic framework for analyzing multi-agent ytem, but thee framework limited analyi to a few agent and ignored the underlying network tructure, unlike the work preented here [22, 23]. Mot of the work in analyzing (communication) network and ditributed ytem relied on imple heuritic that are intuitive, eay to undertand, and experimentally verified to work adequately. Large-cale and in-depth analyi of the network behavior received attention recently, auming the underlying node are relatively imple with fixed behavior [24]. Here we are intereted in analyzing network of learning agent, where the dynamic of the network change over time even if the outide world remain unchanged. Surveying all network meaure that were propoed to analyze weighted graph i beyond the cope of thi paper. Intead, we focu on a ample of thee meaure that are motly related to our propoed meaure (the intereted reader may refer to urvey paper on the ubject uch a [9]). The trength of a node (the ummation of weight incident to the node) become identical to the node degree if all weight are equal to 1. The trength meaure, however, fail to capture the diparity of interaction between an individual node and it neighbor (the conitent partial order property). For example, uppoe that a node v 1 ha multiet of incident weight {1, 9}, while another node v 2 ha a multiet of incident weight {5, 5}. Both node will have the ame trength, depite the fact that node v 2 i interacting with it neighbor more uniformly than node v 1. A more recent work [25] analyzed a graph total weight, e E, againt the graph total number of edge, E, over time. That work alo analyzed the degree of a node, k(v), againt the node trength, (v). Thee meaure again fail to capture the diparity in interaction between a node and it neighbor. The network meaure Y (v) = ( ) 2 e E(v) (v) uccefully capture the diparity of interaction within a node v [26]. However, the Y meaure i not a generalization of the degree meaure a it fail to atify the firt two propertie of the C-degree, therefore the Y-meaure i le intuitive than the C-degree. An intereting method for generalizing the node degree i generating an enemble of unweighted network that are ampled from the original weighted network [27] (the weight of an edge reflect the probability of generating the edge in a ample network). The effective node degree i then the average over the ample. While the enemble approach atifie the firt two propertie of the C-degree, it till fail to atify the third property, the conitency in handling diparity. 7. CONCLUSION AND FUTURE WORK In thi paper we preented a cae tudy of 100 networked adaptive agent where the global performance metric can hide an underlying intability in the ytem, and how that thi intability lead to a ignificant drop in performance later on. We propoed the ue of graph analyi to analyze agent interaction over time. We alo developed a new network meaure, the C-degree, that generalized the degree of a node to take weight into account. Our methodology uccefully expoed the hidden intability in the cae tudy. We finally proved that the C-degree of a node reduce to the original (dicrete) degree when the node interact with it neighbor uniformly. Otherwie the C-degree capture the diparity in a node interaction with it neighbor. The analyi preented here, a mentioned earlier, i a preliminary tep that we hope to trigger more reearch that applie network analyi and mining technique to multi-agent 522

7 ytem. The C-degree, which we propoed here, focue on capturing the diparity of interaction between a node and it neighbor. In domain where the (abolute) quantity of interaction i crucial in undertanding the dynamic, alternative to the C-degree may be more effective. 8. REFERENCES [1] S. Abdallah, V. Leer, Multiagent reinforcement learning and elf-organization in a network of agent, in: Proceeding of the International Joint Conference on Autonomou Agent and Multiagent Sytem, 2007, pp [2] J. A. Boyan, M. L. Littman, Packet routing in dynamically changing network: A reinforcement learning approach, in: Proceeding of the Annual Conference on Advance in Neural Information Proceing Sytem, 1994, pp [3] L. Pehkin, V. Savova, Reinforcement learning for adaptive routing, in: Proceeding of the International Joint Conference on Neural Network, 2002, pp [4] Y.-H. Chang, T. Ho, Mobilized ad-hoc network: A reinforcement learning approach, in: Proceeding of the Firt International Conference on Autonomic Computing, 2004, pp [5] S. Abdallah, V. Leer, A multiagent reinforcement learning algorithm with non-linear dynamic, Journal of Artificial Intelligence Reearch 33 (2008) [6] M. Ghavamzadeh, S. Mahadevan, R. Makar, Hierarchical multi-agent reinforcement learning, Autonomou Agent and Multi-Agent Sytem 13 (2) (2006) [7] M. E. J. Newman, Finding community tructure in network uing the eigenvector of matrice, Phyical Review E 74 (2006) [8] J. Park, A.-L. Barabai, Ditribution of node characteritic in complex network, Proceeding of the National Academy of Science 104 (2007) [9] S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, D.-U. Hwang, Complex network: Structure and dynamic, Phyic Report 424 (2006) [10] L. Panait, S. Luke, Cooperative multi-agent learning: The tate of the art, Autonomou Agent and Multi-Agent Sytem 11 (3) (2005) [11] M. Bowling, Convergence and no-regret in multiagent learning, in: Proceeding of the Annual Conference on Advance in Neural Information Proceing Sytem, 2005, pp [12] R. Sutton, A. Barto, Reinforcement Learning: An Introduction, MIT Pre, [13] M. Bowling, M. Veloo, Multiagent learning uing a variable learning rate, Artificial Intelligence 136 (2) (2002) [14] V. Conitzer, T. Sandholm, AWESOME: A general multiagent learning algorithm that converge in elf-play and learn a bet repone againt tationary opponent, Machine Learning 67 (1-2) (2007) [15] Y. Shoham, R. Power, T. Grenager, If multi-agent learning i the anwer, what i the quetion?, Artificial Intelligence 171 (7) (2007) [16] B. Banerjee, J. Peng, Generalized multiagent learning with performance bound, Autonomou Agent and Multiagent Sytem 15 (3) (2007) [17] S. Abdallah, V. Leer, Learning the tak allocation game, in: Proceeding of the International Joint Conference on Autonomou Agent and Multiagent Sytem, 2006, pp [18] A. Clauet, C. Rohilla Shalizi, M. E. J. Newman, Power-law ditribution in empirical data, ArXiv e-printarxiv: [19] M. Bowling, Convergence and no-regret in multiagent learning, Technical Report TR04-11, Univerity of Alberta (2004). [20] P. Vrancx, K. Tuyl, R. Wetra, Switching dynamic of multi-agent learning, in: Proceeding of the 7th International Joint conference on Autonomou Agent and Multiagent Sytem, 2008, pp [21] E. Serrano, J. J. Gómez-Sanz, J. A. Botía, J. Pavón, Intelligent data analyi applied to debug complex oftware ytem, Neurocomputing 72 (13-15) (2009) [22] J. Jin, R. T. Mahewaran, R. Sanchez, P. Szekely, Vizcript: viualizing complex interaction in multi-agent ytem, in: Proceeding of the 12th international conference on Intelligent uer interface, 2007, pp [23] T. Boe, D. N. Lam, K. S. Barber, Tool for analyzing intelligent agent ytem, Web Intelligence and Agent Sytem 6 (4) (2008) [24] V. Paxon, End-to-end routing behavior in the internet, SIGCOMM Computer Communication Review 36 (5) (2006) [25] M. McGlohon, L. Akoglu, C. Falouto, Weighted graph and diconnected component: pattern and a generator, in: ACM SIGKDD Conference on Knowledge Dicovery and Data Mining, 2008, pp [26] E. Almaa, B. Kovac, T. Vicek, Z. N. Oltvai, A. L. Barabai, Global organization of metabolic fluxe in the bacterium, echerichia coli, Nature 427 (2004) 839. [27] S. E. Ahnert, D. Garlachelli, T. M. A. Fink, G. Caldarelli, Enemble approach to the analyi of weighted network, Phyic Review E 76 (1) (2007)

8 524

Queueing systems with scheduled arrivals, i.e., appointment systems, are typical for frontal service systems,

Queueing systems with scheduled arrivals, i.e., appointment systems, are typical for frontal service systems, MANAGEMENT SCIENCE Vol. 54, No. 3, March 28, pp. 565 572 in 25-199 ein 1526-551 8 543 565 inform doi 1.1287/mnc.17.82 28 INFORMS Scheduling Arrival to Queue: A Single-Server Model with No-Show INFORMS

More information

DISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENT-MATCHING INTRUSION DETECTION SYSTEMS. G. Chapman J. Cleese E. Idle

DISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENT-MATCHING INTRUSION DETECTION SYSTEMS. G. Chapman J. Cleese E. Idle DISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENT-MATCHING INTRUSION DETECTION SYSTEMS G. Chapman J. Cleee E. Idle ABSTRACT Content matching i a neceary component of any ignature-baed network Intruion Detection

More information

Unit 11 Using Linear Regression to Describe Relationships

Unit 11 Using Linear Regression to Describe Relationships Unit 11 Uing Linear Regreion to Decribe Relationhip Objective: To obtain and interpret the lope and intercept of the leat quare line for predicting a quantitative repone variable from a quantitative explanatory

More information

DISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENT-MATCHING INTRUSION DETECTION SYSTEMS

DISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENT-MATCHING INTRUSION DETECTION SYSTEMS DISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENT-MATCHING INTRUSION DETECTION SYSTEMS Chritopher V. Kopek Department of Computer Science Wake Foret Univerity Winton-Salem, NC, 2709 Email: kopekcv@gmail.com

More information

A note on profit maximization and monotonicity for inbound call centers

A note on profit maximization and monotonicity for inbound call centers A note on profit maximization and monotonicity for inbound call center Ger Koole & Aue Pot Department of Mathematic, Vrije Univeriteit Amterdam, The Netherland 23rd December 2005 Abtract We conider an

More information

A Spam Message Filtering Method: focus on run time

A Spam Message Filtering Method: focus on run time , pp.29-33 http://dx.doi.org/10.14257/atl.2014.76.08 A Spam Meage Filtering Method: focu on run time Sin-Eon Kim 1, Jung-Tae Jo 2, Sang-Hyun Choi 3 1 Department of Information Security Management 2 Department

More information

Redesigning Ratings: Assessing the Discriminatory Power of Credit Scores under Censoring

Redesigning Ratings: Assessing the Discriminatory Power of Credit Scores under Censoring Redeigning Rating: Aeing the Dicriminatory Power of Credit Score under Cenoring Holger Kraft, Gerald Kroiandt, Marlene Müller Fraunhofer Intitut für Techno- und Wirtchaftmathematik (ITWM) Thi verion: June

More information

Assessing the Discriminatory Power of Credit Scores

Assessing the Discriminatory Power of Credit Scores Aeing the Dicriminatory Power of Credit Score Holger Kraft 1, Gerald Kroiandt 1, Marlene Müller 1,2 1 Fraunhofer Intitut für Techno- und Wirtchaftmathematik (ITWM) Gottlieb-Daimler-Str. 49, 67663 Kaierlautern,

More information

1 Introduction. Reza Shokri* Privacy Games: Optimal User-Centric Data Obfuscation

1 Introduction. Reza Shokri* Privacy Games: Optimal User-Centric Data Obfuscation Proceeding on Privacy Enhancing Technologie 2015; 2015 (2):1 17 Reza Shokri* Privacy Game: Optimal Uer-Centric Data Obfucation Abtract: Conider uer who hare their data (e.g., location) with an untruted

More information

SCM- integration: organiational, managerial and technological iue M. Caridi 1 and A. Sianei 2 Dipartimento di Economia e Produzione, Politecnico di Milano, Italy E-mail: maria.caridi@polimi.it Itituto

More information

A Note on Profit Maximization and Monotonicity for Inbound Call Centers

A Note on Profit Maximization and Monotonicity for Inbound Call Centers OPERATIONS RESEARCH Vol. 59, No. 5, September October 2011, pp. 1304 1308 in 0030-364X ein 1526-5463 11 5905 1304 http://dx.doi.org/10.1287/opre.1110.0990 2011 INFORMS TECHNICAL NOTE INFORMS hold copyright

More information

Project Management Basics

Project Management Basics Project Management Baic A Guide to undertanding the baic component of effective project management and the key to ucce 1 Content 1.0 Who hould read thi Guide... 3 1.1 Overview... 3 1.2 Project Management

More information

Profitability of Loyalty Programs in the Presence of Uncertainty in Customers Valuations

Profitability of Loyalty Programs in the Presence of Uncertainty in Customers Valuations Proceeding of the 0 Indutrial Engineering Reearch Conference T. Doolen and E. Van Aken, ed. Profitability of Loyalty Program in the Preence of Uncertainty in Cutomer Valuation Amir Gandomi and Saeed Zolfaghari

More information

Two Dimensional FEM Simulation of Ultrasonic Wave Propagation in Isotropic Solid Media using COMSOL

Two Dimensional FEM Simulation of Ultrasonic Wave Propagation in Isotropic Solid Media using COMSOL Excerpt from the Proceeding of the COMSO Conference 0 India Two Dimenional FEM Simulation of Ultraonic Wave Propagation in Iotropic Solid Media uing COMSO Bikah Ghoe *, Krihnan Balaubramaniam *, C V Krihnamurthy

More information

FEDERATION OF ARAB SCIENTIFIC RESEARCH COUNCILS

FEDERATION OF ARAB SCIENTIFIC RESEARCH COUNCILS Aignment Report RP/98-983/5/0./03 Etablihment of cientific and technological information ervice for economic and ocial development FOR INTERNAL UE NOT FOR GENERAL DITRIBUTION FEDERATION OF ARAB CIENTIFIC

More information

Control of Wireless Networks with Flow Level Dynamics under Constant Time Scheduling

Control of Wireless Networks with Flow Level Dynamics under Constant Time Scheduling Control of Wirele Network with Flow Level Dynamic under Contant Time Scheduling Long Le and Ravi R. Mazumdar Department of Electrical and Computer Engineering Univerity of Waterloo,Waterloo, ON, Canada

More information

Name: SID: Instructions

Name: SID: Instructions CS168 Fall 2014 Homework 1 Aigned: Wedneday, 10 September 2014 Due: Monday, 22 September 2014 Name: SID: Dicuion Section (Day/Time): Intruction - Submit thi homework uing Pandagrader/GradeScope(http://www.gradecope.com/

More information

Performance of Multiple TFRC in Heterogeneous Wireless Networks

Performance of Multiple TFRC in Heterogeneous Wireless Networks Performance of Multiple TFRC in Heterogeneou Wirele Network 1 Hyeon-Jin Jeong, 2 Seong-Sik Choi 1, Firt Author Computer Engineering Department, Incheon National Univerity, oaihjj@incheon.ac.kr *2,Correponding

More information

State-space analysis of control systems: Part I

State-space analysis of control systems: Part I Why a different approach? State-pace analyi of control ytem: Part I Uing a tate-variable approach give u a traightforward way to analyze MIM multiple-input, multiple output ytem. A tate variable model

More information

Mobility Improves Coverage of Sensor Networks

Mobility Improves Coverage of Sensor Networks Mobility Improve Coverage of Senor Networ Benyuan Liu Dept. of Computer Science Univerity of Maachuett-Lowell Lowell, MA 1854 Peter Bra Dept. of Computer Science City College of New Yor New Yor, NY 131

More information

Partial optimal labeling search for a NP-hard subclass of (max,+) problems

Partial optimal labeling search for a NP-hard subclass of (max,+) problems Partial optimal labeling earch for a NP-hard ubcla of (max,+) problem Ivan Kovtun International Reearch and Training Center of Information Technologie and Sytem, Kiev, Uraine, ovtun@image.iev.ua Dreden

More information

Queueing Models for Multiclass Call Centers with Real-Time Anticipated Delays

Queueing Models for Multiclass Call Centers with Real-Time Anticipated Delays Queueing Model for Multicla Call Center with Real-Time Anticipated Delay Oualid Jouini Yve Dallery Zeynep Akşin Ecole Centrale Pari Koç Univerity Laboratoire Génie Indutriel College of Adminitrative Science

More information

Research Article An (s, S) Production Inventory Controlled Self-Service Queuing System

Research Article An (s, S) Production Inventory Controlled Self-Service Queuing System Probability and Statitic Volume 5, Article ID 558, 8 page http://dxdoiorg/55/5/558 Reearch Article An (, S) Production Inventory Controlled Self-Service Queuing Sytem Anoop N Nair and M J Jacob Department

More information

Acceleration-Displacement Crash Pulse Optimisation A New Methodology to Optimise Vehicle Response for Multiple Impact Speeds

Acceleration-Displacement Crash Pulse Optimisation A New Methodology to Optimise Vehicle Response for Multiple Impact Speeds Acceleration-Diplacement Crah Pule Optimiation A New Methodology to Optimie Vehicle Repone for Multiple Impact Speed D. Gildfind 1 and D. Ree 2 1 RMIT Univerity, Department of Aeropace Engineering 2 Holden

More information

REDUCTION OF TOTAL SUPPLY CHAIN CYCLE TIME IN INTERNAL BUSINESS PROCESS OF REAMER USING DOE AND TAGUCHI METHODOLOGY. Abstract. 1.

REDUCTION OF TOTAL SUPPLY CHAIN CYCLE TIME IN INTERNAL BUSINESS PROCESS OF REAMER USING DOE AND TAGUCHI METHODOLOGY. Abstract. 1. International Journal of Advanced Technology & Engineering Reearch (IJATER) REDUCTION OF TOTAL SUPPLY CHAIN CYCLE TIME IN INTERNAL BUSINESS PROCESS OF REAMER USING DOE AND Abtract TAGUCHI METHODOLOGY Mr.

More information

Maximizing Acceptance Probability for Active Friending in Online Social Networks

Maximizing Acceptance Probability for Active Friending in Online Social Networks Maximizing for Active Friending in Online Social Network De-Nian Yang, Hui-Ju Hung, Wang-Chien Lee, Wei Chen Academia Sinica, Taipei, Taiwan The Pennylvania State Univerity, State College, Pennylvania,

More information

Optical Illusion. Sara Bolouki, Roger Grosse, Honglak Lee, Andrew Ng

Optical Illusion. Sara Bolouki, Roger Grosse, Honglak Lee, Andrew Ng Optical Illuion Sara Bolouki, Roger Groe, Honglak Lee, Andrew Ng. Introduction The goal of thi proect i to explain ome of the illuory phenomena uing pare coding and whitening model. Intead of the pare

More information

published in Statistics and Probability Letters, 78, , 2008 Michael Lechner * SIAW

published in Statistics and Probability Letters, 78, , 2008 Michael Lechner * SIAW publihed in Statitic and Probability Letter, 78, 9-95, 28 A NOTE ON ENDOGENOUS CONTROL VARIABLES IN CAUSAL STUDIES Michael Lechner * SIAW Thi verion: March, 27 Date thi verion ha been printed: 8 May 27

More information

Mixed Method of Model Reduction for Uncertain Systems

Mixed Method of Model Reduction for Uncertain Systems SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol 4 No June Mixed Method of Model Reduction for Uncertain Sytem N Selvaganean Abtract: A mixed method for reducing a higher order uncertain ytem to a table reduced

More information

NETWORK TRAFFIC ENGINEERING WITH VARIED LEVELS OF PROTECTION IN THE NEXT GENERATION INTERNET

NETWORK TRAFFIC ENGINEERING WITH VARIED LEVELS OF PROTECTION IN THE NEXT GENERATION INTERNET Chapter 1 NETWORK TRAFFIC ENGINEERING WITH VARIED LEVELS OF PROTECTION IN THE NEXT GENERATION INTERNET S. Srivatava Univerity of Miouri Kana City, USA hekhar@conrel.ice.umkc.edu S. R. Thirumalaetty now

More information

A technical guide to 2014 key stage 2 to key stage 4 value added measures

A technical guide to 2014 key stage 2 to key stage 4 value added measures A technical guide to 2014 key tage 2 to key tage 4 value added meaure CONTENTS Introduction: PAGE NO. What i value added? 2 Change to value added methodology in 2014 4 Interpretation: Interpreting chool

More information

A Resolution Approach to a Hierarchical Multiobjective Routing Model for MPLS Networks

A Resolution Approach to a Hierarchical Multiobjective Routing Model for MPLS Networks A Reolution Approach to a Hierarchical Multiobjective Routing Model for MPLS Networ Joé Craveirinha a,c, Rita Girão-Silva a,c, João Clímaco b,c, Lúcia Martin a,c a b c DEEC-FCTUC FEUC INESC-Coimbra International

More information

Laureate Network Products & Services Copyright 2013 Laureate Education, Inc.

Laureate Network Products & Services Copyright 2013 Laureate Education, Inc. Laureate Network Product & Service Copyright 2013 Laureate Education, Inc. KEY Coure Name Laureate Faculty Development...3 Laureate Englih Program...9 Language Laureate Signature Product...12 Length Laureate

More information

Group Mutual Exclusion Based on Priorities

Group Mutual Exclusion Based on Priorities Group Mutual Excluion Baed on Prioritie Karina M. Cenci Laboratorio de Invetigación en Sitema Ditribuido Univeridad Nacional del Sur Bahía Blanca, Argentina kmc@c.un.edu.ar and Jorge R. Ardenghi Laboratorio

More information

Bi-Objective Optimization for the Clinical Trial Supply Chain Management

Bi-Objective Optimization for the Clinical Trial Supply Chain Management Ian David Lockhart Bogle and Michael Fairweather (Editor), Proceeding of the 22nd European Sympoium on Computer Aided Proce Engineering, 17-20 June 2012, London. 2012 Elevier B.V. All right reerved. Bi-Objective

More information

Optimization Model of Higher Education Resources Allocation Based on Genetic Algorithm

Optimization Model of Higher Education Resources Allocation Based on Genetic Algorithm Management cience and ngineering Vol. 7, No. 3, 203, pp. 76-80 DOI:0.3968/j.me.93035X2030703.2622 IN 93-034 [Print] IN 93-035X [Online] www.ccanada.net www.ccanada.org Optimization Model of Higher ducation

More information

Socially Optimal Pricing of Cloud Computing Resources

Socially Optimal Pricing of Cloud Computing Resources Socially Optimal Pricing of Cloud Computing Reource Ihai Menache Microoft Reearch New England Cambridge, MA 02142 t-imena@microoft.com Auman Ozdaglar Laboratory for Information and Deciion Sytem Maachuett

More information

QUANTIFYING THE BULLWHIP EFFECT IN THE SUPPLY CHAIN OF SMALL-SIZED COMPANIES

QUANTIFYING THE BULLWHIP EFFECT IN THE SUPPLY CHAIN OF SMALL-SIZED COMPANIES Sixth LACCEI International Latin American and Caribbean Conference for Engineering and Technology (LACCEI 2008) Partnering to Succe: Engineering, Education, Reearch and Development June 4 June 6 2008,

More information

Return on Investment and Effort Expenditure in the Software Development Environment

Return on Investment and Effort Expenditure in the Software Development Environment International Journal of Applied Information ytem (IJAI) IN : 2249-0868 Return on Invetment and Effort Expenditure in the oftware Development Environment Dineh Kumar aini Faculty of Computing and IT, ohar

More information

CHARACTERISTICS OF WAITING LINE MODELS THE INDICATORS OF THE CUSTOMER FLOW MANAGEMENT SYSTEMS EFFICIENCY

CHARACTERISTICS OF WAITING LINE MODELS THE INDICATORS OF THE CUSTOMER FLOW MANAGEMENT SYSTEMS EFFICIENCY Annale Univeritati Apuleni Serie Oeconomica, 2(2), 200 CHARACTERISTICS OF WAITING LINE MODELS THE INDICATORS OF THE CUSTOMER FLOW MANAGEMENT SYSTEMS EFFICIENCY Sidonia Otilia Cernea Mihaela Jaradat 2 Mohammad

More information

Cluster-Aware Cache for Network Attached Storage *

Cluster-Aware Cache for Network Attached Storage * Cluter-Aware Cache for Network Attached Storage * Bin Cai, Changheng Xie, and Qiang Cao National Storage Sytem Laboratory, Department of Computer Science, Huazhong Univerity of Science and Technology,

More information

Algorithms for Advance Bandwidth Reservation in Media Production Networks

Algorithms for Advance Bandwidth Reservation in Media Production Networks Algorithm for Advance Bandwidth Reervation in Media Production Network Maryam Barhan 1, Hendrik Moen 1, Jeroen Famaey 2, Filip De Turck 1 1 Department of Information Technology, Ghent Univerity imind Gaton

More information

2. METHOD DATA COLLECTION

2. METHOD DATA COLLECTION Key to learning in pecific ubject area of engineering education an example from electrical engineering Anna-Karin Cartenen,, and Jonte Bernhard, School of Engineering, Jönköping Univerity, S- Jönköping,

More information

TRADING rules are widely used in financial market as

TRADING rules are widely used in financial market as Complex Stock Trading Strategy Baed on Particle Swarm Optimization Fei Wang, Philip L.H. Yu and David W. Cheung Abtract Trading rule have been utilized in the tock market to make profit for more than a

More information

INFORMATION Technology (IT) infrastructure management

INFORMATION Technology (IT) infrastructure management IEEE TRANSACTIONS ON CLOUD COMPUTING, VOL. 2, NO. 1, MAY 214 1 Buine-Driven Long-term Capacity Planning for SaaS Application David Candeia, Ricardo Araújo Santo and Raquel Lope Abtract Capacity Planning

More information

CASE STUDY BRIDGE. www.future-processing.com

CASE STUDY BRIDGE. www.future-processing.com CASE STUDY BRIDGE TABLE OF CONTENTS #1 ABOUT THE CLIENT 3 #2 ABOUT THE PROJECT 4 #3 OUR ROLE 5 #4 RESULT OF OUR COLLABORATION 6-7 #5 THE BUSINESS PROBLEM THAT WE SOLVED 8 #6 CHALLENGES 9 #7 VISUAL IDENTIFICATION

More information

Towards Control-Relevant Forecasting in Supply Chain Management

Towards Control-Relevant Forecasting in Supply Chain Management 25 American Control Conference June 8-1, 25. Portland, OR, USA WeA7.1 Toward Control-Relevant Forecating in Supply Chain Management Jay D. Schwartz, Daniel E. Rivera 1, and Karl G. Kempf Control Sytem

More information

POSSIBILITIES OF INDIVIDUAL CLAIM RESERVE RISK MODELING

POSSIBILITIES OF INDIVIDUAL CLAIM RESERVE RISK MODELING POSSIBILITIES OF INDIVIDUAL CLAIM RESERVE RISK MODELING Pavel Zimmermann * 1. Introduction A ignificant increae in demand for inurance and financial rik quantification ha occurred recently due to the fact

More information

Finite Automata. a) Reading a symbol, b) Transferring to a new instruction, and c) Advancing the tape head one square to the right.

Finite Automata. a) Reading a symbol, b) Transferring to a new instruction, and c) Advancing the tape head one square to the right. Finite Automata Let u begin by removing almot all of the Turing machine' power! Maybe then we hall have olvable deciion problem and till be able to accomplih ome computational tak. Alo, we might be able

More information

A model for the relationship between tropical precipitation and column water vapor

A model for the relationship between tropical precipitation and column water vapor Click Here for Full Article GEOPHYSICAL RESEARCH LETTERS, VOL. 36, L16804, doi:10.1029/2009gl039667, 2009 A model for the relationhip between tropical precipitation and column water vapor Caroline J. Muller,

More information

Control Theory based Approach for the Improvement of Integrated Business Process Interoperability

Control Theory based Approach for the Improvement of Integrated Business Process Interoperability www.ijcsi.org 201 Control Theory baed Approach for the Improvement of Integrated Buine Proce Interoperability Abderrahim Taoudi 1, Bouchaib Bounabat 2 and Badr Elmir 3 1 Al-Qualadi Reearch & Development

More information

BUILT-IN DUAL FREQUENCY ANTENNA WITH AN EMBEDDED CAMERA AND A VERTICAL GROUND PLANE

BUILT-IN DUAL FREQUENCY ANTENNA WITH AN EMBEDDED CAMERA AND A VERTICAL GROUND PLANE Progre In Electromagnetic Reearch Letter, Vol. 3, 51, 08 BUILT-IN DUAL FREQUENCY ANTENNA WITH AN EMBEDDED CAMERA AND A VERTICAL GROUND PLANE S. H. Zainud-Deen Faculty of Electronic Engineering Menoufia

More information

THE IMPACT OF MULTIFACTORIAL GENETIC DISORDERS ON CRITICAL ILLNESS INSURANCE: A SIMULATION STUDY BASED ON UK BIOBANK ABSTRACT KEYWORDS

THE IMPACT OF MULTIFACTORIAL GENETIC DISORDERS ON CRITICAL ILLNESS INSURANCE: A SIMULATION STUDY BASED ON UK BIOBANK ABSTRACT KEYWORDS THE IMPACT OF MULTIFACTORIAL GENETIC DISORDERS ON CRITICAL ILLNESS INSURANCE: A SIMULATION STUDY BASED ON UK BIOBANK BY ANGUS MACDONALD, DELME PRITCHARD AND PRADIP TAPADAR ABSTRACT The UK Biobank project

More information

Exposure Metering Relating Subject Lighting to Film Exposure

Exposure Metering Relating Subject Lighting to Film Exposure Expoure Metering Relating Subject Lighting to Film Expoure By Jeff Conrad A photographic expoure meter meaure ubject lighting and indicate camera etting that nominally reult in the bet expoure of the film.

More information

Risk Management for a Global Supply Chain Planning under Uncertainty: Models and Algorithms

Risk Management for a Global Supply Chain Planning under Uncertainty: Models and Algorithms Rik Management for a Global Supply Chain Planning under Uncertainty: Model and Algorithm Fengqi You 1, John M. Waick 2, Ignacio E. Gromann 1* 1 Dept. of Chemical Engineering, Carnegie Mellon Univerity,

More information

Heuristic Approach to Dynamic Data Allocation in Distributed Database Systems

Heuristic Approach to Dynamic Data Allocation in Distributed Database Systems Pakitan Journal of Information and Technology 2 (3): 231-239, 2003 ISSN 1682-6027 2003 Aian Network for Scientific Information Heuritic Approach to Dynamic Data Allocation in Ditributed Databae Sytem 1

More information

RISK MANAGEMENT POLICY

RISK MANAGEMENT POLICY RISK MANAGEMENT POLICY The practice of foreign exchange (FX) rik management i an area thrut into the potlight due to the market volatility that ha prevailed for ome time. A a conequence, many corporation

More information

CASE STUDY ALLOCATE SOFTWARE

CASE STUDY ALLOCATE SOFTWARE CASE STUDY ALLOCATE SOFTWARE allocate caetud y TABLE OF CONTENTS #1 ABOUT THE CLIENT #2 OUR ROLE #3 EFFECTS OF OUR COOPERATION #4 BUSINESS PROBLEM THAT WE SOLVED #5 CHALLENGES #6 WORKING IN SCRUM #7 WHAT

More information

Utility-Based Flow Control for Sequential Imagery over Wireless Networks

Utility-Based Flow Control for Sequential Imagery over Wireless Networks Utility-Baed Flow Control for Sequential Imagery over Wirele Networ Tomer Kihoni, Sara Callaway, and Mar Byer Abtract Wirele enor networ provide a unique et of characteritic that mae them uitable for building

More information

MANAGING DATA REPLICATION IN MOBILE AD- HOC NETWORK DATABASES (Invited Paper) *

MANAGING DATA REPLICATION IN MOBILE AD- HOC NETWORK DATABASES (Invited Paper) * MANAGING DATA REPLICATION IN MOBILE AD- HOC NETWORK DATABASES (Invited Paper) * Praanna Padmanabhan School of Computer Science The Univerity of Oklahoma Norman OK, USA praannap@yahoo-inc.com Dr. Le Gruenwald

More information

MSc Financial Economics: International Finance. Bubbles in the Foreign Exchange Market. Anne Sibert. Revised Spring 2013. Contents

MSc Financial Economics: International Finance. Bubbles in the Foreign Exchange Market. Anne Sibert. Revised Spring 2013. Contents MSc Financial Economic: International Finance Bubble in the Foreign Exchange Market Anne Sibert Revied Spring 203 Content Introduction................................................. 2 The Mone Market.............................................

More information

OPINION PIECE. It s up to the customer to ensure security of the Cloud

OPINION PIECE. It s up to the customer to ensure security of the Cloud OPINION PIECE It up to the cutomer to enure ecurity of the Cloud Content Don t outource what you don t undertand 2 The check lit 2 Step toward control 4 Due Diligence 4 Contract 4 E-dicovery 4 Standard

More information

Assigning Tasks for Efficiency in Hadoop

Assigning Tasks for Efficiency in Hadoop Aigning Tak for Efficiency in Hadoop [Extended Abtract] Michael J. Ficher Computer Science Yale Univerity P.O. Box 208285 New Haven, CT, USA michael.ficher@yale.edu Xueyuan Su Computer Science Yale Univerity

More information

Mobile Network Configuration for Large-scale Multimedia Delivery on a Single WLAN

Mobile Network Configuration for Large-scale Multimedia Delivery on a Single WLAN Mobile Network Configuration for Large-cale Multimedia Delivery on a Single WLAN Huigwang Je, Dongwoo Kwon, Hyeonwoo Kim, and Hongtaek Ju Dept. of Computer Engineering Keimyung Univerity Daegu, Republic

More information

MODIFIED 2D FINITE-DIFFERENCE TIME-DOMAIN TECHNIQUE FOR TUNNEL PATH LOSS PREDICTION. Y. Wu, M. Lin and I.J. Wassell

MODIFIED 2D FINITE-DIFFERENCE TIME-DOMAIN TECHNIQUE FOR TUNNEL PATH LOSS PREDICTION. Y. Wu, M. Lin and I.J. Wassell 2 nd International Conference on Wirele Communication in Underground and Confined Area Augut 25-27, 2008 Val-d Or - Québec - Canada MODIFIED 2D FINITE-DIFFERENCE TIME-DOMAIN TECHNIQUE FOR TUNNEL PATH LOSS

More information

Network Architecture for Joint Failure Recovery and Traffic Engineering

Network Architecture for Joint Failure Recovery and Traffic Engineering Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara Dept. of Computer Science Princeton Univerity, NJ 08544 muchara@princeton.edu Dahai Xu AT&T Lab Reearch Florham Park,

More information

6. Friction, Experiment and Theory

6. Friction, Experiment and Theory 6. Friction, Experiment and Theory The lab thi wee invetigate the rictional orce and the phyical interpretation o the coeicient o riction. We will mae ue o the concept o the orce o gravity, the normal

More information

A New Optimum Jitter Protection for Conversational VoIP

A New Optimum Jitter Protection for Conversational VoIP Proc. Int. Conf. Wirele Commun., Signal Proceing (Nanjing, China), 5 pp., Nov. 2009 A New Optimum Jitter Protection for Converational VoIP Qipeng Gong, Peter Kabal Electrical & Computer Engineering, McGill

More information

Chapter 4: Mean-Variance Analysis

Chapter 4: Mean-Variance Analysis Chapter 4: Mean-Variance Analyi Modern portfolio theory identifie two apect of the invetment problem. Firt, an invetor will want to maximize the expected rate of return on the portfolio. Second, an invetor

More information

Bidding for Representative Allocations for Display Advertising

Bidding for Representative Allocations for Display Advertising Bidding for Repreentative Allocation for Diplay Advertiing Arpita Ghoh, Preton McAfee, Kihore Papineni, and Sergei Vailvitkii Yahoo! Reearch. {arpita, mcafee, kpapi, ergei}@yahoo-inc.com Abtract. Diplay

More information

Harmonic Oscillations / Complex Numbers

Harmonic Oscillations / Complex Numbers Harmonic Ocillation / Complex Number Overview and Motivation: Probably the ingle mot important problem in all of phyic i the imple harmonic ocillator. It can be tudied claically or uantum mechanically,

More information

A Life Contingency Approach for Physical Assets: Create Volatility to Create Value

A Life Contingency Approach for Physical Assets: Create Volatility to Create Value A Life Contingency Approach for Phyical Aet: Create Volatility to Create Value homa Emil Wendling 2011 Enterprie Rik Management Sympoium Society of Actuarie March 14-16, 2011 Copyright 2011 by the Society

More information

Performance Evaluation and Delay Modelling of VoIP Traffic over 802.11 Wireless Mesh Network

Performance Evaluation and Delay Modelling of VoIP Traffic over 802.11 Wireless Mesh Network International Journal of Computer Application (975 8887) Volume 1 No.9, May 11 Performance Evaluation and Delay Modelling of VoIP Traffic over 8.11 Wirele Meh Network Amit Chhabra Dept. of CSE SDDIET,

More information

Processor Cooling. Report for the practical course Chemieingenieurwesen I WS06/07. Zürich, January 16,

Processor Cooling. Report for the practical course Chemieingenieurwesen I WS06/07. Zürich, January 16, Proceor Cooling Report for the practical coure Chemieingenieurween I WS06/07 Zürich, January 16, 2007 Student: Francico Joé Guerra Millán fguerram@tudent.ethz.ch Andrea Michel michela@tudent.ethz.ch Aitant:

More information

THE ECONOMIC INCENTIVES OF PROVIDING NETWORK SECURITY SERVICES ON THE INTERNET INFRASTRUCTURE

THE ECONOMIC INCENTIVES OF PROVIDING NETWORK SECURITY SERVICES ON THE INTERNET INFRASTRUCTURE THE ECONOMIC INCENTIVES OF PROVIDING NETWORK SECURITY SERVICES ON THE INTERNET INFRASTRUCTURE Li-Chiou Chen Department of Information Sytem School of Computer Science and Information Sytem Pace Univerity

More information

Simulation of Sensorless Speed Control of Induction Motor Using APFO Technique

Simulation of Sensorless Speed Control of Induction Motor Using APFO Technique International Journal of Computer and Electrical Engineering, Vol. 4, No. 4, Augut 2012 Simulation of Senorle Speed Control of Induction Motor Uing APFO Technique T. Raghu, J. Sriniva Rao, and S. Chandra

More information

Unobserved Heterogeneity and Risk in Wage Variance: Does Schooling Provide Earnings Insurance?

Unobserved Heterogeneity and Risk in Wage Variance: Does Schooling Provide Earnings Insurance? TI 011-045/3 Tinbergen Intitute Dicuion Paper Unoberved Heterogeneity and Rik in Wage Variance: Doe Schooling Provide Earning Inurance? Jacopo Mazza Han van Ophem Joop Hartog * Univerity of Amterdam; *

More information

Pekka Helkiö, 58490K Antti Seppälä, 63212W Ossi Syd, 63513T

Pekka Helkiö, 58490K Antti Seppälä, 63212W Ossi Syd, 63513T Pekka Helkiö, 58490K Antti Seppälä, 63212W Oi Syd, 63513T Table of Content 1. Abtract...1 2. Introduction...2 2.1 Background... 2 2.2 Objective and Reearch Problem... 2 2.3 Methodology... 2 2.4 Scoping

More information

A Duality Model of TCP and Queue Management Algorithms

A Duality Model of TCP and Queue Management Algorithms A Duality Model of TCP and Queue Management Algorithm Steven H. Low CS and EE Department California Intitute of Technology Paadena, CA 95 low@caltech.edu May 4, Abtract We propoe a duality model of end-to-end

More information

Performance of a Browser-Based JavaScript Bandwidth Test

Performance of a Browser-Based JavaScript Bandwidth Test Performance of a Brower-Baed JavaScript Bandwidth Tet David A. Cohen II May 7, 2013 CP SC 491/H495 Abtract An exiting brower-baed bandwidth tet written in JavaScript wa modified for the purpoe of further

More information

Growing Self-Organizing Maps for Surface Reconstruction from Unstructured Point Clouds

Growing Self-Organizing Maps for Surface Reconstruction from Unstructured Point Clouds Growing Self-Organizing Map for Surface Recontruction from Untructured Point Cloud Renata L. M. E. do Rêgo, Aluizio F. R. Araújo, and Fernando B.de Lima Neto Abtract Thi work introduce a new method for

More information

THE ECONOMIC INCENTIVES OF PROVIDING NETWORK SECURITY SERVICES ON THE INTERNET INFRASTRUCTURE

THE ECONOMIC INCENTIVES OF PROVIDING NETWORK SECURITY SERVICES ON THE INTERNET INFRASTRUCTURE Journal of Information Technology Management ISSN #1042-1319 A Publication of the Aociation of Management THE ECONOMIC INCENTIVES OF PROVIDING NETWORK SECURITY SERVICES ON THE INTERNET INFRASTRUCTURE LI-CHIOU

More information

Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn

Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn Ditributed, Secure Load Balancing with Skew, Heterogeneity, and Churn Jonathan Ledlie and Margo Seltzer Diviion of Engineering and Applied Science Harvard Univerity Abtract Numerou propoal exit for load

More information

1 Looking in the wrong place for healthcare improvements: A system dynamics study of an accident and emergency department

1 Looking in the wrong place for healthcare improvements: A system dynamics study of an accident and emergency department 1 Looking in the wrong place for healthcare improvement: A ytem dynamic tudy of an accident and emergency department DC Lane, C Monefeldt and JV Roenhead - The London School of Economic and Political Science

More information

Laboratory 3 Diode Characteristics

Laboratory 3 Diode Characteristics Laboratory 3 Diode Characteritic BACKGROUND A diode i a non-linear, two terminal emiconductor device. he two terminal are the anode and the cathode. he circuit ymbol of a diode i depicted in Fig. 3-1.

More information

Growth and Sustainability of Managed Security Services Networks: An Economic Perspective

Growth and Sustainability of Managed Security Services Networks: An Economic Perspective Growth and Sutainability of Managed Security Service etwork: An Economic Perpective Alok Gupta Dmitry Zhdanov Department of Information and Deciion Science Univerity of Minneota Minneapoli, M 55455 (agupta,

More information

CHAPTER 5 BROADBAND CLASS-E AMPLIFIER

CHAPTER 5 BROADBAND CLASS-E AMPLIFIER CHAPTER 5 BROADBAND CLASS-E AMPLIFIER 5.0 Introduction Cla-E amplifier wa firt preented by Sokal in 1975. The application of cla- E amplifier were limited to the VHF band. At thi range of frequency, cla-e

More information

Automatic Generation Control of Two-Area System Considering Non-Linearities

Automatic Generation Control of Two-Area System Considering Non-Linearities International Journal of Engineering and Technical Reearch (IJETR) ISSN: 232-0869, Volume-2, Iue-5, May 204 Automatic Generation Control of Two-Area Sytem Conidering Non-Linearitie Akul Sharma, Kamleh

More information

A Review On Software Testing In SDlC And Testing Tools

A Review On Software Testing In SDlC And Testing Tools www.ijec.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume - 3 Iue -9 September, 2014 Page No. 8188-8197 A Review On Software Teting In SDlC And Teting Tool T.Amruthavalli*,

More information

Health Insurance and Social Welfare. Run Liang. China Center for Economic Research, Peking University, Beijing 100871, China,

Health Insurance and Social Welfare. Run Liang. China Center for Economic Research, Peking University, Beijing 100871, China, Health Inurance and Social Welfare Run Liang China Center for Economic Reearch, Peking Univerity, Beijing 100871, China, Email: rliang@ccer.edu.cn and Hao Wang China Center for Economic Reearch, Peking

More information

G*Power 3: A flexible statistical power analysis program for the social, behavioral, and biomedical sciences

G*Power 3: A flexible statistical power analysis program for the social, behavioral, and biomedical sciences Behavior Reearch Method 007, 39 (), 75-9 G*Power 3: A flexible tatitical power analyi program for the ocial, behavioral, and biomedical cience FRAZ FAUL Chritian-Albrecht-Univerität Kiel, Kiel, Germany

More information

HUMAN CAPITAL AND THE FUTURE OF TRANSITION ECONOMIES * Michael Spagat Royal Holloway, University of London, CEPR and Davidson Institute.

HUMAN CAPITAL AND THE FUTURE OF TRANSITION ECONOMIES * Michael Spagat Royal Holloway, University of London, CEPR and Davidson Institute. HUMAN CAPITAL AND THE FUTURE OF TRANSITION ECONOMIES * By Michael Spagat Royal Holloway, Univerity of London, CEPR and Davidon Intitute Abtract Tranition economie have an initial condition of high human

More information

Growth and Sustainability of Managed Security Services Networks: An Economic Perspective

Growth and Sustainability of Managed Security Services Networks: An Economic Perspective Growth and Sutainability of Managed Security Service etwork: An Economic Perpective Alok Gupta Dmitry Zhdanov Department of Information and Deciion Science Univerity of Minneota Minneapoli, M 55455 (agupta,

More information

Thus far. Inferences When Comparing Two Means. Testing differences between two means or proportions

Thus far. Inferences When Comparing Two Means. Testing differences between two means or proportions Inference When Comparing Two Mean Dr. Tom Ilvento FREC 48 Thu far We have made an inference from a ingle ample mean and proportion to a population, uing The ample mean (or proportion) The ample tandard

More information

Morningstar Fixed Income Style Box TM Methodology

Morningstar Fixed Income Style Box TM Methodology Morningtar Fixed Income Style Box TM Methodology Morningtar Methodology Paper Augut 3, 00 00 Morningtar, Inc. All right reerved. The information in thi document i the property of Morningtar, Inc. Reproduction

More information

Chapter 10 Velocity, Acceleration, and Calculus

Chapter 10 Velocity, Acceleration, and Calculus Chapter 10 Velocity, Acceleration, and Calculu The firt derivative of poition i velocity, and the econd derivative i acceleration. Thee derivative can be viewed in four way: phyically, numerically, ymbolically,

More information

AN OVERVIEW ON CLUSTERING METHODS

AN OVERVIEW ON CLUSTERING METHODS IOSR Journal Engineering AN OVERVIEW ON CLUSTERING METHODS T. Soni Madhulatha Aociate Preor, Alluri Intitute Management Science, Warangal. ABSTRACT Clutering i a common technique for tatitical data analyi,

More information

Managing Customer Arrivals in Service Systems with Multiple Servers

Managing Customer Arrivals in Service Systems with Multiple Servers Managing Cutomer Arrival in Service Sytem with Multiple Server Chrito Zacharia Department of Management Science, School of Buine Adminitration, Univerity of Miami, Coral Gable, FL 3346. czacharia@bu.miami.edu

More information

Progress 8 measure in 2016, 2017, and 2018. Guide for maintained secondary schools, academies and free schools

Progress 8 measure in 2016, 2017, and 2018. Guide for maintained secondary schools, academies and free schools Progre 8 meaure in 2016, 2017, and 2018 Guide for maintained econdary chool, academie and free chool July 2016 Content Table of figure 4 Summary 5 A ummary of Attainment 8 and Progre 8 5 Expiry or review

More information

Simulation of Power Systems Dynamics using Dynamic Phasor Models. Power Systems Laboratory. ETH Zürich Switzerland

Simulation of Power Systems Dynamics using Dynamic Phasor Models. Power Systems Laboratory. ETH Zürich Switzerland X SEPOPE 2 a 25 de maio de 26 May 2 rt to 25 th 26 FLORIANÓPOLIS (SC) BRASIL X SIMPÓSIO DE ESPECIALISTAS EM PLANEJAMENTO DA OPERAÇÃO E EXPANSÃO ELÉTRICA X SYMPOSIUM OF SPECIALISTS IN ELECTRIC OPERATIONAL

More information