Abstract parsing: static analysis of dynamically generated string output using LR-parsing technology
|
|
- Kristian Fleming
- 8 years ago
- Views:
Transcription
1 Abtract paring: tatic analyi of dynamically generated tring output uing LR-paring technology Kyung-Goo Doh 1, Hyunha Kim 1, David A. Schmidt 2 1 Hanyang Univerity, Anan, South Korea 2 Kana State Univerity, Manhattan, Kana, USA Abtract. We combine LR(k)-paring technology and data-flow analyi to analyze, in advance of execution, the document generated dynamically by a program. Baed on the document language context-free reference grammar and the program control tructure, the analyi predict how the document will be generated and pare the predicted document. Our trategy remember context-free tructure by computing abtract LR-pare tack. The technique i implemented in Objective Caml and ha tatically validated a uite of PHP program that dynamically generate HTML document. 1 Introduction Scripting language like PHP, Perl, Ruby, and Python ue tring a a univeral data tructure to communicate value, command, and program. For example, one might write a PHP cript that aemble within a tring variable an SQL query or an HTML page or an XML document. Typically, the well-formedne of the aembled tring i verified when the tring i upplied a input to it intended proceor (databae, web brower, or interpreter), and an incorrectly aembled tring might caue proceor failure. Wore till, a maliciou uer might deliberately upply mileading input that generate a document that attempt a cro-ite-cripting or injection attack. A a firt tep toward preventing failure and attack, the well-formedne of a dynamically generated, grammatically tructured tring (document) hould be checked with repect to the document context-free reference grammar (for SQL or HTML or XML) before the document i upplied to it proceor. Better till, the document generator program itelf hould be analyzed to validate that all it generated document are well formed with repect to the reference grammar, like an application program i type checked in advance of execution. In thi paper, we employ LR(k)-paring technology and data-flow analyi to analyze tatically a program that dynamically generate document a tring, and at the ame time, pare the dynamically generated tring with the context-free reference grammar for the document language. We compute abtract pare tack that remember the context-free tructure of the tring.
2 x = a r = ] while... x = [. x. r print x X0 = a R = ] X1 = X0 X2 X2 = [ X1 R X3 = X1 (Read. a an infix tring-append operation.) Fig.1. Sample program and it data-flow equation 2 Motivating example Say that a cript mut generate an output tring that conform to thi grammar, S a [S] where S i the only nonterminal. (HTML, XML, and SQL are uch bracket language.) The grammar i LR(0), but it can be difficult to enforce even for imple program, like the one in Figure 1, left column. Perhap we require thi program to print only well-formed S-phrae the occurrence of x at print x i a hot pot and we mut analyze x poible value. An analyi baed on type checking aign type (reference-grammar nonterminal) to the program variable. The occurrence of x can indeed be data-typed a S, but r ha no data type that correpond to a nonterminal. An analyi baed on regular expreion (Chritenen [2], Minamide [6], Waerman [8]) olve flow equation hown in Figure 1 right column in the domain of regular expreion, determining that the hot pot (X3 ) value conform to the regular expreion, [ a ], but thi doe not validate the aertion. A grammar-baed analyi (Thiemann [7]) treat the flow equation a a et of grammar rule. The type of x at the hot pot i X3. Next, a language-incluion check trie to prove that all X3-generated tring are S-generable. Our approach olve the flow equation in the domain of pare tack X3 meaning i the et of LR-pare of the tring that might be denoted by x.
3 . S [ 0 1 S [. S] S. [S ] S. a S. a S [ S. S [S ] 5 S. 2 S a. a a 3 4 S [S. ] ] S [S]. pare tack (top lie at right) input equence (front lie at left) 0 [[a]] 0 :: 1 [a]] (becaue goto( 0,[) = 1) 0 :: 1 :: 1 a]] 0 :: 1 :: 1 :: 2 ]] (reduce:s a) 0 :: 1 :: 1 S ]] 0 :: 1 :: 1 :: 3 ]] (becaue goto( 1, S) = 3) 0 :: 1 :: 1 :: 3 :: 4 ] (reduce:s [S]) 0 :: 1 S ] 0 :: 1 :: 3 ] 0 :: 1 :: 3 :: 4 (reduce:s [S]) 0 S 0 :: 5 (finihed) Fig.2. goto controller for S [S] a and an example pare of [[a]] Aume that the reference grammar i LR(k); we firt calculate it LR-item and build it pare ( goto ) controller. We interpret the flow equation in Figure 1 a function that map an input pare tate to (a et of) output pare tack.
4 x = a r = ] while... x = [. x. r print x X0 = a R = ] X1 = X0 X2 X2 = [ X1 R X3 = X1. S 0 1 S [. S] S. [S ] S. a S. a S [ S. S [S ] 5 S. 2 S a. a a [ 3 4 S [S. ] ] S [S]. To analyze the hot pot at X3, we generate the function call, X3( 0 ), where 0 i the tart tate for paring an S-phrae. The flow equation, X3 = X1, generate X3( 0 ) = X1( 0 ) which itelf demand a pare of the tring generated at point X1 from tate 0 : X1( 0 ) = X0( 0 ) X2( 0 ) The union of the pare from X0 and X2 mut be computed. 3 Conider X0( 0 ): X0( 0 ) = goto( 0,a) = 2 (reduce:s a) goto( 0, S) = 5 A pare of tring a from 0 generate 2, a final tate, that reduce to nonterminal S, which generate 5 an S-phrae ha been pared. (The ignifie a reduce tep to a nonterminal.) The completed tack i therefore 0 :: 5. The remaining call, X2( 0 ), goe X2( 0 ) = ([ X1 R)( 0 ) = goto( 0,[) (X1 R) = 1 (X1 R) = 1 :: (X1( 1 ) R) The operator equence the pare tep: for pare tack, t, and function, E, t E = t :: E(top(t)), that i, the tack made by appending t to the tack returned by E(top(t)). Then, X1( 1 ) = X0( 1 ) X2( 1 ) compute to 3, and X2( 0 ) = 1 :: (X1( 1 ) R) = 1 :: ( 3 R) = 1 :: 3 :: R( 3 ) = 1 :: 3 :: 4 (reduce:s [S]) goto( 0, S) = 5 That i, X2( 0 ) built the tack, 1 :: 3 :: 4, denoting a pare of [S], which reduced to S, giving 5. 3 In general, the function compute et of pare tack. In thi example, all the et are ingleton.
5 x = a r = ] while... x = [. x. r print x X0 = a R = ] X1 = X0 X2 X2 = [ X1 R X3 = X1 Here i the complete lit of olved function call: X3( 0 ) = X1( 0 ) X1( 0 ) = X0( 0 ) X2( 0 ) = = 5 5 = 5 X0( 0 ) = goto( 0,a) = 2 goto( 0, S) = 5 X2( 0 ) = goto( 0,[) (X1 R) = 1 :: X1( 1 ) R = = 1 :: 3 :: R( 3 ) = 1 :: 3 :: 4 goto( 0, S) = 5 R( 3 ) = goto( 3,]) = 4 X1( 1 ) = X0( 1 ) X2( 1 ) = = 3 3 = 3 (ee comment below) X0( 1 ) = goto( 1,a) = 2 goto( 1, S) = 3 X2( 1 ) = goto( 1,[) (X1 R) = 1 :: (X1( 1 ) R) = = 1 :: 3 :: R( 3 ) (ee comment below) = 1 :: 3 :: 4 goto( 1, S) = 3 The olution i X3( 0 ) = 5, validating that the tring printed at the hot pot mut be S-phrae. Each equation intance, X i ( j ) = E ij, i a firt-order data-flow equation. In the example, X1( 1 ) and X2( 1 ) are mutually recurively defined, and their olution are obtained by iteration-untilconvergence. The flow-equation et i generated dynamically while the equation are being olved. Thi i a demand-driven analyi [1, 3, 4], called minimal function-graph emantic [5], computed by a worklit algorithm.
6 Worklit, added and proceed from top to bottom: X3( 0) X1( 0) X0( 0) X2( 0) X1( 0) X1( 1) X3( 0) X0( 1) X2( 1) X1( 1) X2( 0) X2( 1) R( 3) X2( 0) X2( 1) X1( 0) X1( 1) Cache update, inerted from top to bottom, where X() P abbreviate Cache[X()] := P X3( 0) X1( 0) X0( 0) X2( 0) X0( 0) reduce( 0, goto( 0,a)) = reduce( 0, 2) = reduce( 0, goto( 0, S)) = reduce( 0, 5) = { 5} X1( 1) X1( 0) { 5} X0( 1) X2( 1) X3( 0) { 5} X0( 1) reduce( 1, goto( 1,a)) = { 3} X1( 1) { 3} R( 3) R( 3) reduce( 3, goto( 3,])) = { 4} X2( 0) ([ :: X1 :: R)( 0) = 1 (X1 :: R) = ( 1 :: X1( 1)) R = 1 :: 3 :: R( 3) = reduce( 0, 1 :: 3 :: 4) = reduce( 0, goto( 0, S)) = { 5} X2( 1) ([ :: X1 :: R)( 1) = { 3} Generated call graph: X3 ( ) 0 X1 ( 0 ) X0 ( 0 ) X2 ( 0 ) X1 ( 1 ) R ( 3 ) X0 ( 1 ) X2 ( 1 ) Fig.3. Worklit-algorithm calculation of call, X3( 0), in Figure 1 The initialization tep place initial call, X0( 0 ), into the worklit and into the call graph and aign to the cache the partial olution, Cache[X0( 0 )]. The iteration tep repeat the following until the worklit i empty: 1. Extract a call, X(), from the worklit, and for the correponding flow equation, X = E, compute E(), folding abtract tack a neceary. 2. While computing E(), if a call, X ( ) i encountered, (i) add the dependency, X ( ) X(), to the call graph (if it i not already preent); (ii) if there i no entry for X ( ) in the cache, then aign Cache[X ( )] and place X ( ) on the worklit. 3. When E() compute to an anwer et, P, and P contain an abtract pare tack not already lited in Cache[X()], then aign Cache[X()] (Cache[X()] P) and add to the worklit all X ( ) uch that the dependency, X() X ( ), appear in the flowgraph.
7 Concrete emantic: A ource program compute a tore that map variable to tring. The concrete collecting emantic compute a et of tore for each program point; the collecting emantic i then abtracted o that it compute, for each program point, a ingle tore that map each variable to a et of tring. The collecting emantic i overapproximated by the data-flow emantic, which ue flow equation to compute the et of tring denoted by each variable at each program point. In Figure 1, the data-flow emantic compute thee value of variable x at the program point: X0 = {a} X2 = {[ 1] 1 X1} R = {]} X1 = X0 X2 = X3 Let Σ name the tate in the parer goto-controller. A pare tack, t Σ +, model thoe tring that pare to t. Function γ : P(Σ + ) P(String) concretize a et of pare tack into a et of tring: γ(s) = {t String 0 :: 1 :: :: k S and pare( 0, t) = 0 :: 1 :: :: k } The abtract collecting interpretation, X, compute the et of pare tack denoted by a program variable. For flow equation, Xi = E i, the function, X i : Σ P(Σ ), i defined a X i() = [E i ](), where Σ and [t] = {reduce(, goto(, t))}, where t i a terminal ymbol [E 1 E 2 ] = [E 1 ] [E 2 ] [Xj ] = [E j ], where Xj = E j i the flow equation for Xj [E 1 E 2 ] = {reduce(, p ) p ([E 1 ]) [E 2 ]}, where S g = {p :: g(top(p)) p S} where reduce(,p) reduce the final tate within pare tack, :: p. reduce(, p) = t := top(p) if t = m, the final tate for item, T U 1U 2 U m, then p := pop(m,p) // pop m tate, correponding to U 1U 2 U m p := p :: goto(top( :: p ), T) return reduce(,p ) // repeat till finihed ele return p // t wa not a final tate, o nothing to reduce Fig.4. Abtract collecting interpretation: X i() = [E i ] denote the et of pare tack generated by paring the tring denoted by E i, tarting from pare tate.
8 3 Abtract pare tack In the previou example, the reult for each X i ( j ) wa a ingle tack. In general, a et of pare tack can reult, e.g., for x = [ while... x = x. [ x = x. a. ] X0 = [ X1 = X0 X2 X2 = X1 [ X3 = X1 a ] at concluion, x hold zero or more left bracket and an S-phrae; X3( 0 ) i the infinite et, { 5, 1 :: 3, 1 :: 1 :: 3, 1 :: 1 :: 1 :: 3, }. To bound the et, we abtract it by folding it tack o that no pare tate repeat in a tack. Since Σ, the et of pare-tate name, i finite, folding produce a finite et of finite-ized tack (that contain cycle). A tack egment like p = 1 :: 1 i a linked lit, a graph, 1 1, where the tack top and bottom are marked by pointer; when we puh a tate, e.g., p :: 2, we get The folded tack i formed by merging ame-tate object and retaining all link: 1 2. (Thi can be written a the regular expreion, + 1 :: 2.) Folding can apply to multiple tate, e.g., fold to 6 For the above example, X3( 0 ) = { 5, + 1 :: 3}. 7 8.
9 Flow equation et generated from demand, X3( 0): X0( 0) = [( 0) X1( 0) = X0( 0) X2( 0) X2( 0) = X1( 0) [ X3( 0) = X1( 0) (a.]) Leat fixed-point olution expreed with abtract pare tack: X0( 0) = [( 0) = { 1} Becaue X1 and X2 are mutually defined, we iterate to a olution, where Xi value at iteration j i denoted Xi j: X1 1( 0) = { 1} = { 1} X2 1( 0) = X1 1( 0) [ = fold{ 1 :: 1} = { + 1 } X1 2( 0) = { 1} { + 1 } = {1, + 1 } = { + 1 }. (We can merge the two tack egment ince the firt i a prefix of the econd and ha the ame bottom and top tate.) X2 2( 0) = X1 2( 0) [ = { + 1 :: [(1)} = fold{+ 1 :: 1} = {+ 1 } X1 3( 0) = { 1} { + 1 } = {1, + 1 } = {+ 1 } = X12(0) X2 3( 0) = { + 1 } = X22(0) X3( 0) = { + 1 :: a(1) ]} Firt, + 1 :: a(1) = + 1 :: :: goto(1, S) = + 1 :: 3. = { + 1 :: 3 :: ](3)} = {+ 1 :: 3 :: 4} The reduction, S [S], plit the tack into two cae: (i) there are multiple 1 within + 1 ; (ii) there i only one 1: = (i){ + 1 :: goto(1, S)} (ii){goto(0, S)} = { + 1 :: 3, 5} Fig.5. Iterative olution with folded pare tack, depicted a regular expreion The reult, X3( 0 ) = { 5, + 1 :: 3}, aert that the tring at X3 might be a well-formed S phrae or it might contain a urplu of unmatched left bracket. At the end of the calculation in Figure 5, the reduction of S [S] i done on the folded tack egment, + 1 :: 3 :: 4, that i, the complete tack i , meaning that three tate mut be popped: we travere 4, 3, and 1, and follow the link from the lat tate, 1, to ee what the remaining tack might be. There are two poibilitie: 0 1 reult for each cae, a hown in the Figure. and 0. We compute the
10 Thi tag not to be removed under penalty of law.
11 A et of pare tack can be oundly approximated by a ingle, abtract tack: For label et Σ, a Σ-labelled graph, g, i a tuple, node g,edge g,label g, where node g i a et of node, edge g node g node g i a et of directed edge (at mot one per ource, target node pair), and label g : node g Σ aign a label to each node. Let Graph Σ be the et of Σ-labelled graph. An abtract tack i a triple, (g,bot, top), uch that g Graph Σ and bot, top node g mark the bottom and top node of the tack. Let AbStack Σ be the et of abtract tack labelled with Σ-value. Example: the tack, 1 :: 1 :: 3, i modeled a ( {a, b, c}, {(c, b),(b, a)}, [a 1, b 1, c 3], a, c). An abtract tack, (g,bot, top) AbStack Σ, concretize to a et of pare tack: γ(g,bot, top) = {t P(Σ + ) t i a finite path through g from top to bot} Two abtract tack, G 1 = (g 1, bot 1, top 1) and G 2 = (g 2, bot 2, top 2), are compoed by :: into the dijoint union of g 1 and g 2 plu one new edge from bot 2 to top 1: G 1 :: G 2 = ( node g1 node g2, edge g1 edge g2 {(bot 2, top 1)}, label g1 + label g2, bot 1, top 2) An abtract tack i folded (widened) by merging all node that hare the ame label, in effect, equating the node with the label: fold(g,bot, top) = ( { Σ n node g,label g(n) = }, {(, ) (n, n ) edge g,label g(n) =,label g(n ) = }, λ., label g(bot), label g(top)) The abtract interpretation of flow equation, Xi = E i, i the function, X i : Σ P fin (AbStack Σ), defined a X i() = {fold(p) p [E i ]()}. Thi interpretation i ound for the abtract collecting emantic in Figure 4. A et of abtract tack can be further abtracted into a ingle tack of form, Graph Σ P(Σ) P(Σ), by unioning the tack node et, edge et, bot-value and top-value. The reulting tack i a ubgraph of the parer goto-controller. Fig.6. Abtract interpretation defined in term of abtract, folded, pare tack
12 hot pot reference grammar ocamlyacc LALR(1) table PHP program PHP String flow Analyzer data flow equation Abtract Parer pared OK paring ERR Fig. 7. Implementation 4 Implementation and experiment The implementation i in Objective Caml. The front end of Minamide analyzer for PHP [6] wa modified to accept a PHP program with a hot-pot location and to return data-flow equation with tring operation for the hot pot. ocamlyacc produce an LALR(1) paring table, and the abtract parer ue the data-flow equation and the paring table to pare tatically the tring generated by the PHP program. Abtract paring work directly on character (not token), o the reference grammar i written for cannerle paring. (Performance wa good enough for practical ue.) We applied our tool to a uite of PHP program that dynamically generate HTML document, the ame one tudied by Minamide [6], uing a MacOSX with an Intel Core 2 Duo Proceor (2.56GHz) and 4 GByte memory: webche faqforge phpwim timeclock choolmate file line no. of hot pot no. of paring pared OK pared ERR no. of alarm true poitive fale poitive time(ec) We manually identified the hot pot and ran our abtract parer for each hot pot. Since we do not yet have pare-error recovery, each time a pare error wa identified by our analyzer, we located the ource of the error, fixed it, and tried again until no pare error were detected. All the fale-poitive alarm were caued by ignoring the tet within conditional command. The paring time hown in the table i the um of all execution time needed to find all paring error for all hot pot. The reference grammar pare table took econd to contruct; thi i not included in the analyi time.
13 The alarm are claified below: webche faqforge phpwim timeclock choolmate file line no. of hot pot no. of paring pared OK pared ERR no. of alarm true poitive fale poitive time(ec) claification occurrence open/cloe tag yntax error 11 open/cloe tag miing 45 uperfluou tag 5 improperly neted 14 miplaced tag 5 ecaped character yntax error 2 All in all, our abtract parer work without limiting the neting depth of tag, validate the yntax reaonably fat, and i guaranteed to find all paring error reducing inevitable fale alarm to a minimum.
14 Minamide excluded one PHP application, named tagit, from hi experiment [6], ince tagit generate an arbitrary neting depth of tag. In principle, our abtract parer hould be able to validate tagit, but we alo excluded tagit from our tudie becaue the current verion of our abtract parer check that tring-update operation atify an update-invariance property (a tring update mut preerve the exiting pare). Unexpectedly (to u!), o many tring update in tagit violated update invariance that our abtract parer generated too many fale-poitive to be helpful. We can eliminate thee fale poitive with ome eay finite-machine theory: every tring update, e.g., x =... replace(pattern, target, x) define a f..a.-tranducer (pattern i an f..a.; target i the f..a. output; x i the input). For each uch tranducer that appear in flow-equation generation, we compoe the tranducer with the LR-pare controller, itelf a tranducer. The compound tranducer direct the abtract pare. We are implementing thi technique, which can alo be ued for input validation and harpening the reult of tet in conditional command. We are alo implementing reference grammar for application that generate XML tructure.
15 5 Concluion Injection and cro-ite-cripting attack can be reduced by analyzing the program that dynamically generate document [9]. In thi paper, we have improved the preciion of uch analye by employing LR-paring technology to validate the context-free grammatical tructure of generated document. A pare tree i but the firt tage in calculating a tring meaning. The pared tring ha a emantic (a enforced by it interpreter), and one can encode thi emantic with emanticproceing function, like thoe written for ue with a parer-generator. (Tainting analyi tracking unanitized data i a implitic emantic property that i encoded thi way.) The emantic can then be approximated by the tatic analyi o that abtract paring and abtract emantic proceing proceed imultaneouly.
16 Thi talk i aved at chmidt/paper/hometalk.html The paper wa publihed at the 2009 Static Analyi Sympoium (Springer LNCS 5673). The paper i aved locally at chmidt/paper Reference 1. G. Agrawal. Simultaneou demand-driven data-flow and call graph analyi. In Proc. Int l. Conf. Software Maintenance, Oxford, A.S. Chritenen, A. Møller, and M.I. Schwartzbach. Static analyi for dynamic XML. In Proc. PLAN- X-02, E. Dueterwald, R. Gupta, and M.L. Soffa. A practical framework for demand-driven interprocedural data flow analyi. ACM TOPLAS, 19: , S. Horwitz, T. Rep, and M. Sagiv. Demand interprocedural dataflow analyi. In Proc. 3rd ACM SIGSOFT Symp. Foundation of Software Engg., N.D. Jone and A. Mycroft. Data flow analyi of applicative program uing minimal function graph. In Proc. 13th Symp. POPL, page ACM Pre, Y. Minamide. Static approximation of dynamically generated web page. In Proc. 14th ACM Int l Conf. on the World Wide Web, page , P. Thiemann. Grammar-baed analyi of tring expreion. In Proc. ACM workhop Type in language deign and implementation, page 59 70, G. Waermann, C. Gould, Z. Su, and P. Devanbu. Static checking of dymanically generated querie in databae application. ACM Tran. Software Engineering and Methodology, 16(4):14:1 27, G. Waermann and Z. Su. Sound and precie analyi of web application for injection vulnerabilitie. In Proc. ACM PLDI, page 32 41, 2007.
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 informationDISTRIBUTED 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 informationPartial 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 informationA 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 informationPerformance 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 informationOptical 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 informationUnit 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 informationReport 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 informationA 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 informationGroup 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 informationTwo 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 informationMSc 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 informationScheduling 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 informationCASE 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 informationProject 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 informationDUE 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 informationA 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 informationMECH 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 informationName: 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 informationQueueing 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 informationSupport 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 informationCluster-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 informationSCM- 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 information6. 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 informationv = 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 informationAvailability of WDM Multi Ring Networks
Paper Availability of WDM Multi Ring Network Ivan Rado and Katarina Rado H d.o.o. Motar, Motar, Bonia and Herzegovina Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, Univerity
More informationTRADING 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 informationMixed 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 informationHealth 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 informationChapter 10 Stocks and Their Valuation ANSWERS TO END-OF-CHAPTER QUESTIONS
Chapter Stoc and Their Valuation ANSWERS TO EN-OF-CHAPTER QUESTIONS - a. A proxy i a document giving one peron the authority to act for another, typically the power to vote hare of common toc. If earning
More informationBi-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 informationBidding 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 informationProfitability 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 information2. 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 informationSolution of the Heat Equation for transient conduction by LaPlace Transform
Solution of the Heat Equation for tranient conduction by LaPlace Tranform Thi notebook ha been written in Mathematica by Mark J. McCready Profeor and Chair of Chemical Engineering Univerity of Notre Dame
More informationAssigning 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 informationTesting Documentation for CCIH Database Management System By: John Reeves, Derek King, and Robert Watts
Teting Documentation for CCIH Databae Management Sytem By: John Reeve, Derek King, and Robert Watt The teting proce for our project i divided into three part of Unit teting, one part of Integration/Function
More informationBio-Plex Analysis Software
Multiplex Supenion Array Bio-Plex Analyi Software The Leader in Multiplex Immunoaay Analyi Bio-Plex Analyi Software If making ene of your multiplex data i your challenge, then Bio-Plex data analyi oftware
More information12.4 Problems. Excerpt from "Introduction to Geometry" 2014 AoPS Inc. Copyrighted Material CHAPTER 12. CIRCLES AND ANGLES
HTER 1. IRLES N NGLES Excerpt from "Introduction to Geometry" 014 os Inc. onider the circle with diameter O. all thi circle. Why mut hit O in at leat two di erent point? (b) Why i it impoible for to hit
More informationMobile 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 informationPekka 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 informationSenior 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 informationCHARACTERISTICS 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 informationA 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 informationOnline 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 informationAssessing 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 informationINFORMATION 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 informationCASE 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 informationFEDERATION 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 informationLinear energy-preserving integrators for Poisson systems
BIT manucript No. (will be inerted by the editor Linear energy-preerving integrator for Poion ytem David Cohen Ernt Hairer Received: date / Accepted: date Abtract For Hamiltonian ytem with non-canonical
More informationAN 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 informationTIME SERIES ANALYSIS AND TRENDS BY USING SPSS PROGRAMME
TIME SERIES ANALYSIS AND TRENDS BY USING SPSS PROGRAMME RADMILA KOCURKOVÁ Sileian Univerity in Opava School of Buine Adminitration in Karviná Department of Mathematical Method in Economic Czech Republic
More informationTowards 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 informationPerformance 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 informationBenchmarking Bottom-Up and Top-Down Strategies for SPARQL-to-SQL Query Translation
Benchmarking Bottom-Up and Top-Down Strategie for SPARQL-to-SQL Query Tranlation Kahlev a, Chebotko b,c, John Abraham b, Pearl Brazier b, and Shiyong Lu a a Department of Computer Science, Wayne State
More informationA 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 informationA 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 informationControl 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 informationTap 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 informationSRA SOLOMON : MUC-4 TEST RESULTS AND ANALYSI S
SRA SOLOMON : MUC-4 TEST RESULTS AND ANALYSI S Chinatu Aone, Doug McKee, Sandy Shinn, Hatte Bleje r Sytem Reearch and Application (SRA ) 2000 15th Street North Arlington, VA 2220 1 aonec@ra.com INTRODUCTION
More informationAlgorithms 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 informationINTERACTIVE 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 informationIncline and Friction Examples
Incline and riction Eample Phic 6A Prepared b Vince Zaccone riction i a force that oppoe the motion of urface that are in contact with each other. We will conider 2 tpe of friction in thi cla: KINETIC
More informationSolutions to Sample Problems for Test 3
22 Differential Equation Intructor: Petronela Radu November 8 25 Solution to Sample Problem for Tet 3 For each of the linear ytem below find an interval in which the general olution i defined (a) x = x
More informationResearch 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 informationOhm s Law. Ohmic relationship V=IR. Electric Power. Non Ohmic devises. Schematic representation. Electric Power
Ohm Law Ohmic relationhip V=IR Ohm law tate that current through the conductor i directly proportional to the voltage acro it if temperature and other phyical condition do not change. In many material,
More informationUser Behavior Analysis Using Alignment Based Grammatical Inference from Web Server Access Log
Uer Behavior Analyi Uing Alignment Baed Grammatical Inference from Web Server Acce Log Rameh Thakur, Sureh Jain, and Narendra S. Chaudhari Abtract Application of data mining technique to the World Wide
More informationModule 8. Three-phase Induction Motor. Version 2 EE IIT, Kharagpur
Module 8 Three-phae Induction Motor Verion EE IIT, Kharagpur Leon 33 Different Type of Starter for Induction Motor (IM Verion EE IIT, Kharagpur Inructional Objective Need of uing arter for Induction motor
More informationRisk 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 informationJanuary 21, 2015. Abstract
T S U I I E P : T R M -C S J. R January 21, 2015 Abtract Thi paper evaluate the trategic behavior of a monopolit to influence environmental policy, either with taxe or with tandard, comparing two alternative
More informationNETWORK 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 informationMimicry Attacks on Host-Based Intrusion Detection Systems
Mimicry Attack on Hot-Baed Intruion Detection Sytem David Wagner Univerity of California, Berkeley daw@c.berkeley.edu Paolo Soto Univerity of California, Berkeley paolo@xcf.berkeley.edu ABSTRACT We examine
More informationWarehouse 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 informationQueueing 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 information1) Assume that the sample is an SRS. The problem state that the subjects were randomly selected.
12.1 Homework for t Hypothei Tet 1) Below are the etimate of the daily intake of calcium in milligram for 38 randomly elected women between the age of 18 and 24 year who agreed to participate in a tudy
More informationHow Enterprises Can Build Integrated Digital Marketing Experiences Using Drupal
How Enterprie Can Build Integrated Digital Marketing Experience Uing Drupal acquia.com 888.922.7842 1.781.238.8600 25 Corporate Drive, Burlington, MA 01803 How Enterprie Can Build Integrated Digital Marketing
More informationApigee 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 informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science
aachuett Intitute of Technology Department of Electrical Engineering and Computer Science 6.685 Electric achinery Cla Note 10: Induction achine Control and Simulation c 2003 Jame L. Kirtley Jr. 1 Introduction
More informationHow To Understand The Hort Term Power Market
Short-term allocation of ga network and ga-electricity input forecloure Miguel Vazquez a,, Michelle Hallack b a Economic Intitute (IE), Federal Univerity of Rio de Janeiro (UFRJ) b Economic Department,
More informationMorningstar 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 information1 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 informationCOMPANY BALANCE MODELS AND THEIR USE FOR PROCESS MANAGEMENT
COMPANY BALANCE MODELS AND THEIR USE FOR PROCESS MANAGEMENT Mária Mišanková INTRODUCTION Balance model i in general tem of equation motl linear and the goal i to find value of required quantit from pecified
More informationQUANTIFYING 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 informationMANAGING 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 informationParallel Adaptive Multigrid Methods in Plane Linear Elasticity Problems
Numerical Linear Algebra with Application, Vol. 1(1), 1 1 (1996) Parallel Adaptive Multigrid Method in Plane Linear Elaticity Problem Peter Batian, Stefan Lang Intitut für Computeranwendungen III, Univerität
More informationREDUCTION 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σ m using Equation 8.1 given that σ
8. Etimate the theoretical fracture trength of a brittle material if it i known that fracture occur by the propagation of an elliptically haped urface crack of length 0.8 mm and having a tip radiu of curvature
More informationA 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 informationTurbulent 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 informationRedesigning 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 informationMulti-Objective Optimization for Sponsored Search
Multi-Objective Optimization for Sponored Search Yilei Wang 1,*, Bingzheng Wei 2, Jun Yan 2, Zheng Chen 2, Qiao Du 2,3 1 Yuanpei College Peking Univerity Beijing, China, 100871 (+86)15120078719 wangyileipku@gmail.com
More informationGrowing 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 informationHUMAN 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 informationSolution to Problem Set 1
CSE 5: Introduction to the Theory o Computtion, Winter A. Hevi nd J. Mo Solution to Prolem Set Jnury, Solution to Prolem Set.4 ). L = {w w egin with nd end with }. q q q q, d). L = {w w h length t let
More information1. Introduction. C. Camisullis 1, V. Giard 2, G. Mendy-Bilek 3
Proceeding of the 3 rd International Conference on Information Sytem, Logitic and Supply Chain Creating value through green upply chain ILS 2010 Caablanca (Morocco), April 14-16 The right information to
More informationTrusted 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 informationAchieving Quality Through Problem Solving and Process Improvement
Quality Aurance Methodology Refinement Serie Achieving Quality Through Problem Solving and Proce Improvement Second Edition By Lynne Miller Franco Jeanne Newman Gaël Murphy Elizabeth Mariani Quality Aurance
More informationSPECIFICATIONS FOR PERIMETER FIREWALL. APPENDIX-24 Complied (Yes / No) Remark s. S.No Functional Requirements :
S.No Functional Requirement : 1 The propoed olution mut allow ingle policy rule creation for application control, uer baed control, hot profile, threat prevention, Anti-viru, file filtering, content filtering,
More informationRISK 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 informationSELF-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