Heuristic Approach to Dynamic Data Allocation in Distributed Database Systems

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Heuristic Approach to Dynamic Data Allocation in Distributed Database Systems"

Transcription

1 Pakitan Journal of Information and Technology 2 (3): , 2003 ISSN Aian Network for Scientific Information Heuritic Approach to Dynamic Data Allocation in Ditributed Databae Sytem 1 2 Tolga Ulu and Mithat Uyal 1 Management Information Sytem Department, Boaziçi Univerity, Bebek tanbul, Turkey 2 Computer Engineering Department, Dou Univerity, Kad köy tanbul, Turkey Abtract: In thi paper, a new dynamic data allocation algorithm for non-replicated ditributed databae ytem (DDS), namely the threhold algorithm, i propoed. The threhold algorithm reallocate data with repect to changing data acce pattern. The algorithm i analyzed for a fragment uing imulation. The threhold algorithm i epecially uitable for a DDS where data acce pattern change dynamically. Key word: Ditributed databae, fragmentation, data allocation, imulation Introduction Development in databae and networking technologie in the pat few decade led to advance in ditributed databae ytem. A DDS i a collection of ite connected by a communication network, in which each ite i a databae ytem in it own right, but the ite have agreed to work together, o that a uer at any ite can acce data anywhere in the network exactly a if the data were all tored at the uer own ite (Özu and Valduriez, 1991). The primary concern of a DDS i to deign the fragmentation and allocation of the underlying databae. Fragmentation unit can be a file where allocation iue become the file allocation problem. File allocation problem i tudied extenively in the literature, tarted by Chu (Chu, 1969) and continued for non-replicated and replicated model (Morgan and Levin, 1977; Azoulay- Schwartz and Krau, 2002). Some tudie conidered dynamic file allocation (Wah, 1979; Smith, 1981). Data allocation problem wa introduced when Ewaran (Ewaran, 1974) firt propoed the data fragmentation. Studie on vertical fragmentation (Navathe et al., 1984; Ceri et al., 1989); horizontal fragmentation (Ceri et al., 1983) and mixed fragmentation (Sacco, 1986; Zhang and Orlowka, 1994; Cheng et al., 2002) were conducted. The allocation of the fragment i alo tudied extenively (So et al., 1999; Bakker, 2000; Ahmad et al., 2002 and Chang, 2002). In thee tudie, data allocation ha been propoed prior to the deign of a databae depending on ome tatic data acce pattern and/or tatic query pattern. In a tatic environment where the acce probabilitie of node to the fragment never change, a tatic allocation of fragment provide the bet olution. However, in a dynamic environment where thee probabilitie change over time, the tatic allocation olution would degrade the databae performance. Initial tudie on dynamic data allocation give a framework for data reditribution (Wilon and Navathe, 1986) and demontrate how to perform the reditribution proce in 231

2 minimum poible time (Rivera-Vega et al., 1990). In (Bruntorm et al., 1995); a dynamic data allocation algorithm for non-replicated databae ytem i propoed, but no modeling i done to analyze the algorithm. Intead, the paper focued on load balancing iue. Thi paper propoe a new dynamic data allocation algorithm for non-replicated ditributed databae and analyze the algorithm uing imulation. In our tudy, horizontal, vertical or mixed fragmentation can be ued. Allocation unit can even be a mall a a record or an attribute. The ret of thi paper i organized a follow. Firtly, the optimal dynamic data allocation algorithm given in (Bruntorm et al., 1995) i reviited and it diadvantage are dicued. After that, a new algorithm (namely the threhold algorithm), which overcome the diadvantage of the optimal algorithm, i propoed for dynamic data allocation in ditributed databae. Next, the behavior of a fragment, in reaction to a change in acce probabilitie or to a change in threhold value, i invetigated uing imulation. Finally, concluding remark are given. Optimal algorithm In ditributed databae ytem, the performance increae when the fragment are tored at the node from which they are mot frequently acceed. The problem i to find thi particular node for each fragment. Counting the accee of each node to a fragment offer a practical olution. Having the highet acce value for a particular fragment, a node could be the primary candidate to tore the fragment. An m by n acce counter matrix S, where m denote the number of fragment and n denote the number of node, i hown below n n S > > >> > m 1 m2.. mn + Every element of S, where 0Z c{0} (i.e. non-negative integer), how the number of ij ij accee to fragment I by node j. A row of S how the acce count of all node to a particular fragment, wherea a column of S how the acce count of all fragment for a particular node. S i updated after each acce to the fragment. To atify the minimum repone time contraint, each fragment hould be tored in the node with the highet acce count in it correponding row. In other word, if ix > iy for all y = 1,..,n, then the fragment I hould be tore in node x. For example let the following matrix be the acce counter matrix, S, of a DDS with three node and three fragment. A B C x y z

3 In the example, A, B, C denote fragment and x, y, z denote node. Fragment A i acceed 3, 6 and 2 time by node x, y and z, repectively. For fragment B and C, the acce count are 5, 3, 1 and 1, 4, 2, repectively. According to S, fragment A and C hould be tored in node y; and fragment B hould be tored in node x. The torage node of S i an iue of the algorithm. To tore it in a central node create an extra network traffic overhead. It alo lead to a reliability problem in cae of central node failure. The bet olution would be to decompoe the matrix into row and tore each row together with it aociated fragment in the ame node. In thi way, whenever the fragment migrate, it aociated counter migrate a well. Fig. 1 how fragment I with it aociated counter, through. 0 n Fragment... i n Fig. 1: Any fragment I in optimal algorithm Initially, all fragment are ditributed to the node according to any method. Afterward, any node j, run the optimal algorithm given in Fig. 2 for every fragment I, that it tore. Step 1. For each (locally) tored fragment, initialize the acce counter row to zero. (S = 0 ik were k = 1,..,n) Step 2. Proce an acce requet for the tored fragment Step 3. Increae the correponding acce counter of the acceing node for the tored fragment. (If node x accee fragment I, et ix = ix +1) Step 4. If the acceing node i the current owner, go to tep 2. (i.e.. Local acce, otherwie it i a remote acce) Step 5. If the counter of a remote node i greater than the counter of the current owner node, tranfer the ownerhip of the fragment together with the acce counter array to the remote node. (i.e. fragment migrate) (if node x accee fragment I and ix > ij, end fragment I to node x) Step 6. Go to tep 2. Fig. 2: Optimal algorithm There are two inherent propertie introduced by the optimal algorithm. Firt one i the ownerhip property, that i, for each fragment; the node with highet acce counter value i the current owner node of the fragment, in which cae the fragment i tored in thi node. The econd one, namely migration property, dictate that for any fragment the ownerhip i tranferred to a new node, if the acce counter value of the new node exceed the acce counter value of current owner node. In thi cae, thi particular fragment migrate and i tored in thi new owner node. In other word, the owner node of the fragment change. 233

4 An advantage of the optimal algorithm i the central node independence. That i, ince each node run the algorithm autonomouly, there i no central node dependence. Every node i of equal importance. Whenever one node crahe, the algorithm may continue it operation without the fragment tored in the crahed node. There are two drawback aociated with the optimal algorithm. Firt one i the potential torage problem. A the fragment ize decreae and/or the number of node increae, the ize of acce counter matrix increae, which in turn reult in extra torage pace need for the acce counter matrix. For intance, if the fragment ize i one record and the number of node i 500, then for each record an array of 500 acce counter value hould be tored. In ome cae, thi acce counter array ize may exceed the record ize. The econd drawback i the caling problem for the data type that tore the acce counter value. Since acce counter value are continuouly increaing, thi problem may reult in anomalie. For example, if one byte i choen to tore the counter value, then a value greater than 255 cannot be tored in thi data type. A potential timing problem, which may caue back and forth migration of a fragment, deerve explanation. Think of a cae where there are two node denoted by Y and Z. Suppoe at an intant, Y ha the highet acce counter for a fragment wherea Z counter i one le than Y'. Conider Z perform two ucceive accee to the fragment, cauing a tranfer of the fragment from Y to Z. Later on, Y perform two ucceive accee to the fragment, cauing again the tranfer of the fragment from Z to Y. If thee ucceive two accee of Y and Z continue in turn, the fragment will migrate back and forth between Y and Z after every two accee. Thi can alo be generalized to multiple node where fragment migrate in a circular fahion. The threhold algorithm In ome cae, due to extra torage pace need, it could be very cotly to ue the optimal algorithm in it original form. For a le cotly algorithm, the olution i to decreae the need for extra torage pace. The heuritic threhold algorithm in thi paper erve thi purpoe. Let the number of node be n and let x denote the acce probability of a node to a particular fragment. Suppoe the fragment i tored in thi particular node (i.e. it i the owner node). For the ake of implicity, let x denote the acce probability of all the other node to d thi particular fragment. The owner doe local acce, wherea the remaining node do remote acce to the fragment. The probability that the owner node doe not acce the fragment i (n - 1)x d. The 2 probability that the owner node doe not perform two ucceive accee i [(n - 1)x d]. Similarly, the probability that the owner node doe not perform m ucceive accee i [(n - m 1)x d]. Therefore; the probability that the owner node perform at leat one acce of m m ucceive accee i 1-[(n - 1)x d]. Table 1 how the probabilitie that the owner node perform at leat one acce out of m ucceive accee, where x range from 0.1 through 0.9 and where m i 5, 10, 25, 50 and 100. The value in the table are truncated to five decimal digit. 234

5 Table 1: The probability that at leat one local acce occur in m accee x m=5 m=10 m=25 m=50 m=100 0,1 0, , , , , ,2 0, , , , , ,3 0, , , , , ,4 0, , , , , ,5 0, , , , , ,6 0, , , , , ,7 0, , , , , ,8 0, , , , , ,9 0, , , , ,00000 Fragment i Fig. 3: Any fragment I in threhold algorithm According to the table, the probability that the owner node with the acce probability of 0.1 perform at leat one acce of ten ucceive accee i It i trivial from the table that a the acce probability of owner node increae, o a the probability that at leat one local acce occur in m accee. Applying the ame idea, a new threhold baed algorithm (or threhold algorithm) can be propoed. In threhold algorithm, only one counter per fragment i tored. Fig. 3 how fragment I together with it counter. Comparing it to the optimal algorithm, thi radically decreae the extra amount of torage pace to jut one value compared to an array of value in the optimal algorithm. In the threhold algorithm, the initial value of the counter i zero. The counter value i increaed by one for each remote acce to the fragment. It i reet to zero for a local acce. In other word, the counter alway how the number of ucceive remote accee. Whenever the counter exceed a predetermined threhold value, the ownerhip of the fragment i tranferred to another node. At thi point, the critical quetion i which node will be the fragment' new owner. The algorithm give very little information about the pat accee to the fragment. In fact, throughout the entire acce hitory only the lat node that acceed the fragment i known. So, there are two trategie to elect the new owner. Either it i choen randomly, or the lat acceing node i choen. In the former, the randomly choen node could be one that ha never acceed the fragment before. So picking the latter trategy i heuritically more reaonable. Initially, all fragment are ditributed to the node according to any method. A threhold value t i choen. Afterward, any node j, run the threhold algorithm given in Fig. 4 for every fragment I, that it tore. Threhold algorithm overcome the volley of a fragment between two node provided that a threhold value greater than one i choen. The algorithm guarantee the tay of the fragment for at leat (t+1) accee in the new node after a migration. In other word, it delay the migration of the fragment from any node for at leat (t+1) accee. 235

6 Step 1. For each (locally) tored fragment, initialize the counter value to zero. (Set = 0 for i every tored fragment I) Step 2. Proce an acce requet for the tored fragment. Step 3. If it i a local acce, reet the counter of the correponding fragment to 0 (If node j accee fragment I, et = 0). Go to tep 2. i Step 4. If it i a remote acce, increae the counter of the correponding fragment by one. (If fragment I i acceed remotely, et i = i + 1) Step 5. If the counter of the fragment i greater than the threhold value, reet it counter to zero and tranfer the fragment to the remote node. (If, i > t, et i = 0 and end the fragment to remote node) Step 6. Go to tep 2. Fig. 4: Threhold algorithm An important point in the algorithm i the choice of threhold value. Thi value will directly affect the mobility of the fragment. It i trivial that a the threhold value increae, the fragment will tend to tay more at a node; and a the threhold value decreae, the fragment will tend to viit more node. Another point in the algorithm i the ditribution of the acce probabilitie. If the acce probabilitie of all node for a particular fragment are equal, the fragment will viit all the node. The ame applie for two node when there are two highet equal acce probabilitie. Simulation reult In the imulation, it i aumed that there are n node; x i the acce probability of the owner node; x d i the acce probability of the other node; O i the probability that the fragment i in owner node and O d i the total probability that the fragment i in the other node. Since, O + O d = 1, invetigating only O i ufficient. The following formula how the relation between n, x and x d. x + (n-1) x d = 1 Now, let u find how a change in the acce probabilitie and the threhold value effect the probability that the fragment i in any node. Change in acce probability When n i held contant, x and x d are inverely proportional. So, it i ufficient to invetigate only the change in x of O. Fig. 5 how the behaviour of O a a function of x in a five-node ytem. Fig. 5 i drawn for three different threhold value, 0, 3 and 10. For the threhold of 0, O i a linear function of x with a lope of 1. Thi mean that when the threhold i 0, the acce probability of a node directly give the probability that the fragment i in the correponding node. 236

7 Fig. 5: O a a function of x in a five-node ytem for threhold 0, 3 and 10 For threhold value of 3 and 10, notice the change in teepne of the curve. Change in threhold value Threhold t can take only non-negative integer value. Fig. 6 how the behaviour of O a a function of t in a five-node ytem. Fig. 6 i drawn for five different acce probabilitie x of 0.28, 0.24, 0.2, 0.16 and For 0.28 and 0.24, O converge to one. Thi i becaue x > x. Noticing the change in d teepne of two curve, it converge fater for greater acce probabilitie. For 0.2, O i contant at 0.2. Thi i becaue x = x. In thi cae, the acce probability of d a node directly give the teady-tate probability that the fragment i in the correponding node. Fig. 6: O a a function of t in a five-node ytem for x value of 0.28, 0.24, 0.2, 0.16 and

8 For 0.16 and 0.12, O converge to zero. Thi i becaue x < x. Noticing the change in d teepne of two curve, it converge fater for maller acce probabilitie. In thi paper, a new dynamic data allocation algorithm, namely threhold algorithm, for nonreplicated DSS i introduced. In the threhold algorithm, the fragment, previouly ditributed over a DDS, are continuouly reallocated according to the changing data acce pattern. The behavior of a fragment, in reaction to a change in acce probabilitie or to a change in threhold value, i invetigated uing imulation. It i hown that the fragment tend to tay at the node with higher acce probability. A the acce probability of the node increae, the tendency to remain at thi node alo increae. It i alo hown that a the threhold value increae, the fragment will tend to tay more at the node with higher acce probability. Threhold algorithm can be ued for dynamic data allocation to enhance the performance of non-replicated DDS. For further reearch, the algorithm can be extended to ue on the replicated DSS a in (Wolfon and Jajodia, 1997; Sitla et al., 1998). Reference Ahmad, I., K. Karlapalem, Y. K. Kwok and S. K. So., Evolutionary Algorithm for Allocating Data in Ditributed Databae Sytem, Ditributed and Parallel Databae, 11: Azoulay-Schwartz, R. and S. Krau, Negotiation on Data Allocation in Multi-Agent Environment, Autonomou Agent and Multi-Agent Sytem, 5: Bakker, J.A., Semantic Partitioning a a Bai for Parallel I/O in Databae Management Sytem, Parallel Computing, 26: Bruntrom, A., S.T. Leutenegger and R. Simha, Experimental Evaluation of Dynamic Data Allocation Strategie in a Ditributed Databae With Changing Workload, in Proceeding of the 1995 International Conference on Information and Knowledge Management, Baltimore, MD, USA, pp: Ceri, S., S.B. Navathe and G. Wiederhold, Ditribution Deign of Logical Databae Schema, IEEE Tranaction on Software Engineering, 9: Ceri, S., B. Pernici and G. Wiederhold, Optimization Problem and Solution Method in the Deign of Data Ditribution, Information Sytem, 14: Chang, C.T., Optimization Approach for Data Allocation in Multidik Databae, European J. Operational Re., 143: Cheng, C.H., W.K. Lee and K.F. Wong, A Genetic Algorithm-Baed Clutering Approach for Databae Partitioning, IEEE Tranaction on Sytem Man and Cybernetic Part C-Application and Review, 32: Chu, W.W., Optimal File Allocation in a Multiple Computer Sytem, IEEE Tranaction on Computer, C-18: Ewaran, K.P., Placement of Record in a File and File Allocation in a Computer Network, in Proceeding of IFIP Congre on Information Proceing, Stockholm, Sweden, pp: Morgan, H.L. and K.D. Levin, Optimal Program and Data Location in Computer Network, Communication of ACM., 20: Navathe, S.B., S. Ceri, G. Wiederhold and J. Dou, Vertical Partitioning Algorithm for Databae Deign, ACM Tranaction on Databae Sytem, 9:

9 Özu, T. and P. Valduriez, Principle of Ditributed Databae Sytem. Prentice-Hall Book Co., Englewood Cliff, USA. Rivera-Vega, P.I., R. Varadarajan and S.B. Navathe, Scheduling Data Reditribution in Ditributed Databae, in IEEE Proceeding of the Sixth International Conference on Data Engineering, pp: Sacco, G., Fragmentation: A Technique for Efficient Query Proceing, ACM Tranaction on Databae Sytem, 11: Sitla, A.P., O. Wolfon and Y. Huang, Minimization of Communication Cot Through Caching in Mobile Environment, IEEE Tranaction on Parallel Ditributed Sytem, 9: Smith, A.J., Long-term File Migration: Development and Evaluation of Algorithm, Communication of ACM., 24: So, S.K., I. Ahmad and K. Karlapalem, Repone Time Driven Multimedia Data Object Allocation for Browing Document in Ditributed Environment, IEEE Tranaction on Knowledge and Data Engineering, 11: Wah, B.W., Data Management in Ditributed Sytem and Ditributed Data Bae. Ph.D. Diertation, Univerity of California, Berkeley, CA, USA. Wilon, B. and S.B. Navathe, An Analytical Framework for the Redeign of Ditributed Databae, in Proceeding of the 6th Advanced Databae Sympoium, Tokyo, Japan, pp: Wolfon, O. and S. Jajodia, An Adaptive Data Replication Algorithm, ACM Tranaction on Databae Sytem., 22: Zhang, Y. and M.E. Orlowka, On Fragmentation Approache for Ditributed Databae Deign, Information Sci., 1:

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

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

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

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

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

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

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

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

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

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

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

INTERACTIVE TOOL FOR ANALYSIS OF TIME-DELAY SYSTEMS WITH DEAD-TIME COMPENSATORS

INTERACTIVE TOOL FOR ANALYSIS OF TIME-DELAY SYSTEMS WITH DEAD-TIME COMPENSATORS INTERACTIVE TOOL FOR ANALYSIS OF TIMEDELAY SYSTEMS WITH DEADTIME COMPENSATORS Joé Lui Guzmán, Pedro García, Tore Hägglund, Sebatián Dormido, Pedro Alberto, Manuel Berenguel Dep. de Lenguaje y Computación,

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

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

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

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

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

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

Scheduling of Jobs and Maintenance Activities on Parallel Machines

Scheduling of Jobs and Maintenance Activities on Parallel Machines Scheduling of Job and Maintenance Activitie on Parallel Machine Chung-Yee Lee* Department of Indutrial Engineering Texa A&M Univerity College Station, TX 77843-3131 cylee@ac.tamu.edu Zhi-Long Chen** Department

More information

MATLAB/Simulink Based Modelling of Solar Photovoltaic Cell

MATLAB/Simulink Based Modelling of Solar Photovoltaic Cell MATLAB/Simulink Baed Modelling of Solar Photovoltaic Cell Tarak Salmi *, Mounir Bouzguenda **, Adel Gatli **, Ahmed Mamoudi * *Reearch Unit on Renewable Energie and Electric Vehicle, National Engineering

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 April 30, 01 01 Morningtar, Inc. All right reerved. The information in thi document i the property of Morningtar, Inc. Reproduction

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

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

Apigee Edge: Apigee Cloud vs. Private Cloud. Evaluating deployment models for API management

Apigee Edge: Apigee Cloud vs. Private Cloud. Evaluating deployment models for API management Apigee Edge: Apigee Cloud v. Private Cloud Evaluating deployment model for API management Table of Content Introduction 1 Time to ucce 2 Total cot of ownerhip 2 Performance 3 Security 4 Data privacy 4

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

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

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

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

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

License & SW Asset Management at CES Design Services

License & SW Asset Management at CES Design Services Licene & SW Aet Management at CES Deign Service johann.poechl@iemen.com www.ces-deignservice.com 2003 Siemen AG Öterreich Overview 1. Introduction CES Deign Service 2. Objective and Motivation 3. What

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

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

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

Turbulent Mixing and Chemical Reaction in Stirred Tanks

Turbulent Mixing and Chemical Reaction in Stirred Tanks Turbulent Mixing and Chemical Reaction in Stirred Tank André Bakker Julian B. Faano Blend time and chemical product ditribution in turbulent agitated veel can be predicted with the aid of Computational

More information

SELF-MANAGING PERFORMANCE IN APPLICATION SERVERS MODELLING AND DATA ARCHITECTURE

SELF-MANAGING PERFORMANCE IN APPLICATION SERVERS MODELLING AND DATA ARCHITECTURE SELF-MANAGING PERFORMANCE IN APPLICATION SERVERS MODELLING AND DATA ARCHITECTURE RAVI KUMAR G 1, C.MUTHUSAMY 2 & A.VINAYA BABU 3 1 HP Bangalore, Reearch Scholar JNTUH, Hyderabad, India, 2 Yahoo, Bangalore,

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

DUE to the small size and low cost of a sensor node, a

DUE to the small size and low cost of a sensor node, a 1992 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 14, NO. 10, OCTOBER 2015 A Networ Coding Baed Energy Efficient Data Bacup in Survivability-Heterogeneou Senor Networ Jie Tian, Tan Yan, and Guiling Wang

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

Resource Allocation for Real-Time Tasks using Cloud Computing

Resource Allocation for Real-Time Tasks using Cloud Computing Reource Allocation for Real-Time Tak uing Cloud Computing Karthik Kumar, Jing Feng, Yamini Nimmagadda, and Yung-Hiang Lu School of Electrical and Computer Engineering, Purdue Univerity, Wet Lafayette,

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

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

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

Online story scheduling in web advertising

Online story scheduling in web advertising Online tory cheduling in web advertiing Anirban Dagupta Arpita Ghoh Hamid Nazerzadeh Prabhakar Raghavan Abtract We tudy an online job cheduling problem motivated by toryboarding in web advertiing, where

More information

STUDY ON THE EFFECT OF COOLING WATER TEMPERATURE RISE ON LOSS FACTOR AND EFFICIENCY OF A CONDENSER FOR A 210 MW THERMAL POWER UNIT

STUDY ON THE EFFECT OF COOLING WATER TEMPERATURE RISE ON LOSS FACTOR AND EFFICIENCY OF A CONDENSER FOR A 210 MW THERMAL POWER UNIT International Journal of Emerging Technology and Advanced Engineering Volume 3, Special Iue 3: ICERTSD 2013, Feb 2013, page 485-489 An ISO 9001:2008 certified Int. Journal, ISSN 2250-2459, available online

More information

Improving the Performance of Web Service Recommenders Using Semantic Similarity

Improving the Performance of Web Service Recommenders Using Semantic Similarity Improving the Performance of Web Service Recommender Uing Semantic Similarity Juan Manuel Adán-Coello, Carlo Miguel Tobar, Yang Yuming Faculdade de Engenharia de Computação, Pontifícia Univeridade Católica

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

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

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

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

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

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

Report 4668-1b 30.10.2010. Measurement report. Sylomer - field test

Report 4668-1b 30.10.2010. Measurement report. Sylomer - field test Report 4668-1b Meaurement report Sylomer - field tet Report 4668-1b 2(16) Contet 1 Introduction... 3 1.1 Cutomer... 3 1.2 The ite and purpoe of the meaurement... 3 2 Meaurement... 6 2.1 Attenuation of

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

Auction-Based Resource Allocation for Sharing Cloudlets in Mobile Cloud Computing

Auction-Based Resource Allocation for Sharing Cloudlets in Mobile Cloud Computing 1 Auction-Baed Reource Allocation for Sharing Cloudlet in Mobile Cloud Computing A-Long Jin, Wei Song, Senior Member, IEEE, and Weihua Zhuang, Fellow, IEEE Abtract Driven by pervaive mobile device and

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

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

Support Vector Machine Based Electricity Price Forecasting For Electricity Markets utilising Projected Assessment of System Adequacy Data.

Support Vector Machine Based Electricity Price Forecasting For Electricity Markets utilising Projected Assessment of System Adequacy Data. The Sixth International Power Engineering Conference (IPEC23, 27-29 November 23, Singapore Support Vector Machine Baed Electricity Price Forecating For Electricity Maret utiliing Projected Aement of Sytem

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

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

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

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

Cost Models for Selecting Materialized Views in Public Clouds

Cost Models for Selecting Materialized Views in Public Clouds International Journal of Data Warehouing and Mining, 0(4), -25, October-December 204 Cot Model for Selecting Materialized View in ublic Cloud Romain erriot, Clermont Univerité, Univerité Blaie acal, Aubière

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

Distributed Monitoring and Aggregation in Wireless Sensor Networks

Distributed Monitoring and Aggregation in Wireless Sensor Networks Ditributed Monitoring and Aggregation in Wirele Senor Network Changlei Liu and Guohong Cao Department of Computer Science & Engineering The Pennylvania State Univerity E-mail: {chaliu, gcao}@ce.pu.edu

More information

Warehouse Security System based on Embedded System

Warehouse Security System based on Embedded System International Conference on Logitic Engineering, Management and Computer Science (LEMCS 2015) Warehoue Security Sytem baed on Embedded Sytem Gen Li Department of Electronic Engineering, Tianjin Univerity

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

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

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

Section 5.2 - Random Variables

Section 5.2 - Random Variables MAT 0 - Introduction to Statitic Section 5. - Random Variable A random variable i a variable that take on different numerical value which are determined by chance. Example 5. pg. 33 For each random experiment,

More information

In this paper, we investigate toll setting as a policy tool to regulate the use of roads for dangerous goods

In this paper, we investigate toll setting as a policy tool to regulate the use of roads for dangerous goods Vol. 43, No. 2, May 2009, pp. 228 243 in 0041-1655 ein 1526-5447 09 4302 0228 inform doi 10.1287/trc.1080.0236 2009 INFORMS Toll Policie for Mitigating Hazardou Material Tranport Rik Patrice Marcotte,

More information

Continuous-Time (CT) Analog Filters are used for : 1. Interface Applications

Continuous-Time (CT) Analog Filters are used for : 1. Interface Applications Continuou-Time CT Analog Filter are ued for :. Interface Application Anti-Aliaing or Preconditioning, and, Smoothing or Recontruction function. The real ignal proceing i performed in the Digital domain..

More information

RO-BURST: A Robust Virtualization Cost Model for Workload Consolidation over Clouds

RO-BURST: A Robust Virtualization Cost Model for Workload Consolidation over Clouds !111! 111!ttthhh IIIEEEEEEEEE///AAACCCMMM IIInnnttteeerrrnnnaaatttiiiooonnnaaalll SSSyyymmmpppoooiiiuuummm ooonnn CCCllluuuttteeerrr,,, CCClllooouuuddd aaannnddd GGGrrriiiddd CCCooommmpppuuutttiiinnnggg

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

Resource allocation, productivity and growth in Portugal 1

Resource allocation, productivity and growth in Portugal 1 Article 61 Reource allocation, productivity and growth in Portugal 1 Daniel A. Dia 2 Carlo Robalo Marque 3 Chritine Richmond 4 Abtract Allocative efficiency in the Portuguee economy trongly deteriorated

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

Newton s Laws. A force is simply a push or a pull. Forces are vectors; they have both size and direction.

Newton s Laws. A force is simply a push or a pull. Forces are vectors; they have both size and direction. Newton Law Newton firt law: An object will tay at ret or in a tate of uniform motion with contant velocity, in a traight line, unle acted upon by an external force. In other word, the bodie reit any change

More information

Tap Into Smartphone Demand: Mobile-izing Enterprise Websites by Using Flexible, Open Source Platforms

Tap Into Smartphone Demand: Mobile-izing Enterprise Websites by Using Flexible, Open Source Platforms Tap Into Smartphone Demand: Mobile-izing Enterprie Webite by Uing Flexible, Open Source Platform acquia.com 888.922.7842 1.781.238.8600 25 Corporate Drive, Burlington, MA 01803 Tap Into Smartphone Demand:

More information

Software Engineering Management: strategic choices in a new decade

Software Engineering Management: strategic choices in a new decade Software Engineering : trategic choice in a new decade Barbara Farbey & Anthony Finkeltein Univerity College London, Department of Computer Science, Gower St. London WC1E 6BT, UK {b.farbey a.finkeltein}@ucl.ac.uk

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

v = x t = x 2 x 1 t 2 t 1 The average speed of the particle is absolute value of the average velocity and is given Distance travelled t

v = x t = x 2 x 1 t 2 t 1 The average speed of the particle is absolute value of the average velocity and is given Distance travelled t Chapter 2 Motion in One Dimenion 2.1 The Important Stuff 2.1.1 Poition, Time and Diplacement We begin our tudy of motion by conidering object which are very mall in comparion to the ize of their movement

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

MECH 2110 - Statics & Dynamics

MECH 2110 - Statics & Dynamics Chapter D Problem 3 Solution 1/7/8 1:8 PM MECH 11 - Static & Dynamic Chapter D Problem 3 Solution Page 7, Engineering Mechanic - Dynamic, 4th Edition, Meriam and Kraige Given: Particle moving along a traight

More information

How to Maximize User Satisfaction Degree in Multi-service IP Networks

How to Maximize User Satisfaction Degree in Multi-service IP Networks How to Maximize Uer Satifaction Degree in Multi-ervice IP Network Huy Anh Nguyen, Tam Van Nguyen and Deokai Choi Department of Electronic and Computer Engineering Chonnam National Univerity Gwangu, KOREA

More information

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

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

More information

Despeckling Synthetic Aperture Radar Images with Cloud Computing using Graphics Processing Units

Despeckling Synthetic Aperture Radar Images with Cloud Computing using Graphics Processing Units Depeckling Synthetic Aperture Radar Image with Cloud Computing uing Graphic Proceing Unit Matej Keneman 1, Dušan Gleich, Amor Chowdhury 1 1 Margento R & D d.o.o., Gopovetka ceta 84, Maribor, Slovenia matej.keneman@gmail.com

More information

Four Ways Companies Can Use Open Source Social Publishing Tools to Enhance Their Business Operations

Four Ways Companies Can Use Open Source Social Publishing Tools to Enhance Their Business Operations Four Way Companie Can Ue Open Source Social Publihing Tool to Enhance Their Buine Operation acquia.com 888.922.7842 1.781.238.8600 25 Corporate Drive, Burlington, MA 01803 Four Way Companie Can Ue Open

More information

Original Article: TOWARDS FLUID DYNAMICS EQUATIONS

Original Article: TOWARDS FLUID DYNAMICS EQUATIONS Peer Reviewed, Open Acce, Free Online Journal Publihed monthly : ISSN: 8-8X Iue 4(5); April 15 Original Article: TOWARDS FLUID DYNAMICS EQUATIONS Citation Zaytev M.L., Akkerman V.B., Toward Fluid Dynamic

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

Trusted Document Signing based on use of biometric (Face) keys

Trusted Document Signing based on use of biometric (Face) keys Truted Document Signing baed on ue of biometric (Face) Ahmed B. Elmadani Department of Computer Science Faculty of Science Sebha Univerity Sebha Libya www.ebhau.edu.ly elmadan@yahoo.com ABSTRACT An online

More information

Auction Theory. Jonathan Levin. October 2004

Auction Theory. Jonathan Levin. October 2004 Auction Theory Jonathan Levin October 2004 Our next topic i auction. Our objective will be to cover a few of the main idea and highlight. Auction theory can be approached from different angle from the

More information

Senior Thesis. Horse Play. Optimal Wagers and the Kelly Criterion. Author: Courtney Kempton. Supervisor: Professor Jim Morrow

Senior Thesis. Horse Play. Optimal Wagers and the Kelly Criterion. Author: Courtney Kempton. Supervisor: Professor Jim Morrow Senior Thei Hore Play Optimal Wager and the Kelly Criterion Author: Courtney Kempton Supervior: Profeor Jim Morrow June 7, 20 Introduction The fundamental problem in gambling i to find betting opportunitie

More information

Requirements Engineering Databases: The Good, The Bad, and The Ugly

Requirements Engineering Databases: The Good, The Bad, and The Ugly New England Databae Day (NEDBDay08) February 4, 2008 Requirement Engineering Databae: The Good, The Bad, and The Ugly Brian Berenbach Siemen Corporate Reearch brian.berenbach@iemen.com 1 Agenda Brief Introduction

More information

IEEE Engineering in Medicine and Biology Society Conference Proceedings. Copyright IEEE.

IEEE Engineering in Medicine and Biology Society Conference Proceedings. Copyright IEEE. Title Trancription factor activity etimation baed on particle warm optimization and fat networ component analyi Author() Chen, W; Chang, C; Hung, YS Citation 00 Annual International Conference Of The Ieee

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

Computing Location from Ambient FM Radio Signals

Computing Location from Ambient FM Radio Signals Computing Location from Ambient FM Radio Signal Adel Youef Department of Computer Science Univerity of Maryland A.V. William Building College Park, MD 20742 adel@c.umd.edu John Krumm, Ed Miller, Gerry

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

Imagery Portal Workshop #2 Department of Administrative Services, Executive Building Salem, Oregon May 11, 2006

Imagery Portal Workshop #2 Department of Administrative Services, Executive Building Salem, Oregon May 11, 2006 ry Portal Workhop #2 Department of Adminitrative Service, Executive Building Salem, Oregon May 11, 2006 Workhop Purpoe: dicu the outcome of the phae 1 coping proce for development of an imagery portal

More information

Change Management Plan Blackboard Help Course 24/7

Change Management Plan Blackboard Help Course 24/7 MIT 530 Change Management Plan Help Coure 24/7 Submitted by: Sheri Anderon UNCW 4/20/2008 Introduction The Univerity of North Carolina Wilmington (UNCW) i a public comprehenive univerity, one of the ixteen

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

Auction Mechanisms Toward Efficient Resource Sharing for Cloudlets in Mobile Cloud Computing

Auction Mechanisms Toward Efficient Resource Sharing for Cloudlets in Mobile Cloud Computing 1 Auction Mechanim Toward Efficient Reource Sharing for Cloudlet in Mobile Cloud Computing A-Long Jin, Wei Song, Ping Wang, Duit Niyato, and Peijian Ju Abtract Mobile cloud computing offer an appealing

More information