Incorporating Domain Knowledge into Topic Modeling via Dirichlet Forest Priors


 Stephen Marsh
 3 years ago
 Views:
Transcription
1 via Dirichlet Foret Prior David ndrzeewi Xiaoin Zhu Mar raven Department of omputer Science, Department of iotatitic and Medical Informatic Univerity of WiconinMadion, Madion, WI 76 US btract Uer of topic modeling method often have nowledge about the compoition of word that hould have high or low probability in variou topic. We incorporate uch domain nowledge uing a novel Dirichlet Foret prior in a Latent Dirichlet llocation framewor. The prior i a mixture of Dirichlet tree ditribution with pecial tructure. We preent it contruction, and inference via collaped Gibb ampling. Experiment on ynthetic and real dataet demontrate our model ability to follow and generalize beyond uerpecified domain nowledge.. Introduction Topic modeling, uing approache uch a Latent Dirichlet llocation (LD (lei et al.,, ha enoyed popularity a a way to model hidden topic in data. However, in many application, a uer may have additional nowledge about the compoition of word that hould have high probability in variou topic. For example, in a biological application, one may prefer that the word termination, diaembly and releae appear with high probability in the ame topic, becaue they all decribe the ame phae of biological procee. Furthermore, a biologit could automatically extract thee preference from an exiting biomedical ontology, uch a the Gene Ontology (GO (The Gene Ontology onortium,. another example, an analyt may run topic modeling on a corpu of people wihe, inpect the reulting topic, and notice that into, college and cure, cancer all ap ppearing in Proceeding of the 6 th International onference on Machine Learning, Montreal, anada, 9. opyright 9 by the author(/owner(. pear with high probability in the ame topic. The analyt may want to interactively expre the preference that the two et of word hould not appear together, rerun topic modeling, and incorporate additional preference baed on the new reult. In both cae, we would lie thee preference to guide the recovery of latent topic. Standard LD lac a mechanim for incorporating uch domain nowledge. In thi paper, we propoe a principled approach to the incorporation of uch domain nowledge into LD. We how that many type of nowledge can be expreed with two primitive on word pair. orrowing name from the contrained clutering literature (au et al., 8, we call the two primitive MutLin and annotlin, although there are important difference. We then encode the et of MutLin and annotlin aociated with the domain nowledge uing a Dirichlet Foret prior, replacing the Dirichlet prior over the topicword multinomial p(word topic. The Dirichlet Foret prior i a mixture of Dirichlet tree ditribution with very pecific tree tructure. Our approach ha everal advantage: (i Dirichlet Foret can encode MutLin and annotlin, omething impoible with Dirichlet ditribution. (ii The uer can control the trength of the domain nowledge by etting a parameter η, allowing domain nowledge to be overridden if the data trongly ugget otherwie. (iii The Dirichlet Foret lend itelf to efficient inference via collaped Gibb ampling, a property inherited from the conugacy of Dirichlet tree. We preent experiment on everal ynthetic dataet and two real domain, demontrating that the reulting topic not only uccefully incorporate the pecified domain nowledge, but alo generalize beyond it by including/excluding other related word not explicitly mentioned in the MutLin and annotlin.
2 . Related Wor We review LD uing the notation of Griffith and Steyver (. Let there be T topic. Let w = w...w n repreent a corpu of D document, with a total of n word. We ue d i to denote the document of word w i, and z i the hidden topic from which w i i generated. Let φ (w for document d. The LD generative model i then: = p(w z =, and θ (d = p(z = θ Dirichlet(α ( z i θ (di Multinomial(θ (di ( φ Dirichlet(β ( w i z i,φ Multinomial(φ zi ( where α and β are hyperparameter for the documenttopic and topicword Dirichlet ditribution, repectively. For implicity we will aume ymmetric α and β, but aymmetric hyperparameter are alo poible. Previou wor ha modeled correlation in the LD documenttopic mixture uing the logitic Normal ditribution (lei & Lafferty, 6, DG (Pachino tructure (Li & Mcallum, 6, or the Dirichlet Tree ditribution (Tam & Schultz, 7. In addition, the concepttopic model (hemudugunta et al., 8 employ domain nowledge through pecial concept topic, in which only a particular et of word can be preent. Our wor complement the previou wor by encoding complex domain nowledge on word (epecially arbitrary annotlin into a flexible and computationally efficient prior.. Topic Modeling with Dirichlet Foret Our propoed model differ from LD in the way φ i generated. Intead of (, we have q DirichletForet(β, η φ DirichletTree(q where q pecifie a Dirichlet tree ditribution, β play a role analogou to the topicword hyperparameter in tandard LD, and η i the trength parameter of the domain nowledge. efore dicuing DirichletForet(β, η and DirichletTree(q, we firt explain how nowledge can be expreed uing Mut Lin and annotlin primitive... MutLin and annotlin MutLin and annotlin were originally propoed for contrained clutering to encourage two intance to fall into the ame cluter or into eparate cluter, repectively. We borrow the notion for topic modeling. Informally, the MutLin primitive prefer that two word tend to be generated by the ame topic, while the annotlin primitive prefer that two word tend to be generated by eparate topic. However, ince any topic φ i a multinomial over word, any two word (in general alway have ome probability of being generated by the topic. We therefore propoe the following definition: MutLin (u, v: Two word u, v have imilar probability within any topic, i.e., φ (u φ (v for =...T. It i important to note that the probabilitie can be both large or both mall, a long a they are imilar. For example, for the earlier biology example we could ay MutLin (termination, diaembly. annotlin (u, v: Two word u, v hould not both have large probability within any topic. It i permiible for one to have a large probability and the other mall, or both mall. For example, one primitive for the wih example can be annotlin (college, cure. Many type of domain nowledge can be decompoed into a et of MutLin and annotlin. We demontrate three type in our experiment: we can Split two or more et of word from a ingle topic into different topic by placing MutLin within the et and annotlin between them. We can Merge two or more et of word from different topic into one topic by placing MutLin among the et. Given a common et of word which appear in multiple topic (uch a topword in Englih, which tend to appear in all LD topic, we can Iolate them by placing MutLin within the common et, and then placing annotlin between the common et and the other highprobability word from all topic. It i important to note that our MutLin and annotlin are preference intead of hard contraint... Encoding MutLin It i wellnown that the Dirichlet ditribution i limited in that all word hare a common variance parameter, and are mutually independent except the normalization contraint (Mina, 999. However, for Mut Lin (u, v it i crucial to control the two word u, v differently than other word. The Dirichlet tree ditribution (Denni III, 99 i a generalization of the Dirichlet ditribution that allow uch control. It i a tree with the word a leaf node; ee Figure (a for an example. Let γ ( be the Dirichlet tree edge weight leading into node. Let ( be the immediate children of node in the tree, L the leave of the tree, I the internal node, and L( the
3 leave in the ubtree under. To generate a ample φ DirichletTree(γ, one firt draw a multinomial at each internal node I from Dirichlet(γ (, i.e., uing the weight from to it children a the Dirichlet parameter. One can thin of it a reditributing the probability ma reaching by thi multinomial (initially, the ma i at the root. The probability φ ( of a word L i then imply the product of the multinomial parameter on the edge from to the root, a hown in Figure (b. It can be hown (Denni III, 99 that thi procedure give DirichletTree(γ p(φ γ = ( L φ (γ( I ( ( Γ γ ( ( Γ ( γ ( L( φ ( ( where Γ( i the tandard gamma function, and the notation L mean L. The function ( γ( ( γ( i the difference between the indegree and outdegree of internal node. When thi difference ( = for all internal node I, the Dirichlet tree reduce to a Dirichlet ditribution. Lie the Dirichlet, the Dirichlet tree i conugate to the multinomial. It i poible to integrate out φ to get a ditribution over word count directly, imilar to the multivariate Pólya ditribution: p(w γ = ( ( I Γ γ ( ( Γ ( γ ( + n ( ( ( ( Γ γ ( + n ( ( Γ(γ ( Here n ( i the number of word toen in w that appear in L(. We encode MutLin uing a Dirichlet tree. Note that our definition of MutLin i tranitive: Mut Lin (u, v and MutLin (v,w imply MutLin (u, w. We thu firt compute the tranitive cloure of expreed MutLin. Our Dirichlet tree for Mut Lin ha a very imple tructure: each tranitive cloure i a ubtree, with one internal node and the word in the cloure a it leave. The weight from the internal node to it leave are ηβ. The root connect to thee internal node with weight L( β, where repreent the et ize. In addition, the root directly connect to other word not in any cloure, with weight β. For example, the tranitive cloure for a MutLin (, on vocabulary {,,} i imply {,}, correponding to the Dirichlet tree in Figure (a. To undertand thi encoding of MutLin, conider firt the cae when the domain nowledge trength parameter i at it weaet η =. Then indegree equal outdegree for any internal node (both are L( β, and the tree reduce to a Dirichlet ditribution with ymmetric prior β: the MutLin are turned off in thi cae. we increae η, the reditribution of probability ma at (governed by a Dirichlet under ha increaing concentration L( ηβ but the ame uniform baemeaure. Thi tend to reditribute the ma evenly in the tranitive cloure repreented by. Therefore, the MutLin are turned on when η >. Furthermore, the ma reaching i independent of η, and can till have a large variance. Thi properly encode the fact that we want MutLined word to have imilar, but not alway large, probabilitie. Otherwie, MutLined word would be forced to appear with large probability in all topic, which i clearly undeirable. Thi i impoible to repreent with Dirichlet ditribution. For example, the blue dot in Figure (c are φ ample from the Dirichlet tree in Figure (a, plotted on the probability implex of dimenion three. While it i alway true that p( p(, their total probability ma can be anywhere from to. The mot imilar Dirichlet ditribution i perhap the one with parameter (,,, which generate ample cloe to (.,., (Figure (d... Encoding annotlin annotlin are coniderably harder to handle. We firt tranform them into an alternative form that i amenable to Dirichlet tree. Note that annotlin are not tranitive: annotlin (, and annot Lin (, doe not entail annotlin (,. We define a annotlingraph where the node are word, and the edge correpond to the annotlin. Then the connected component of thi graph are independent of each other when encoding annotlin. We will ue thi property to factor a Dirichlettree election probability later. For example, the two annot Lin (, and (, form the graph in Figure (e with a ingle connected component {,,}. onider the ubgraph on connected component r. We define it complement graph by flipping the edge (on to off, off to on, a hown in Figure (f. Let there be Q (r maximal clique M r...m rq (r in thi complement graph. In the following, we imply call them clique, but it i important to remember that they are maximal clique of the complement graph, not the original annotlingraph. In our example, Q (r = and M r = {,}, M r = {}. Thee clique have the following interpretation: each clique (e.g., M r = {,} i the maximal ubet of word in the connected component that can occur together. When there are MutLin, all word in a MutLin tranitive cloure form a ingle node in thi graph.
4 β β.9.9 ηβ ηβ.8. φ=(..8.9 (a (b (c (d ηβ β ηβ β β β β β (e (f (g (h (i Figure. Encoding MutLin and annotlin with a Dirichlet Foret. (a Dirichlet tree encoding MutLin (, with β =, η = on vocabulary {,,}. (b ample φ from thi Dirichlet tree. (c large et of ample from the Dirichlet tree, plotted on the implex. Note p( p(, yet they remain flexible in actual value, which i deirable for a MutLin. (d In contrat, ample from a tandard Dirichlet with comparable parameter (,, force p( p(., and cannot encode a MutLin. (e The annotlingraph for annotlin (, and annotlin (,. (f The complementary graph, with two maximal clique {,} and {}. (g The Dirichlet ubtree for clique {,}. (h The Dirichlet ubtree for clique {}. (i Sample from the mixture model on (g,h, encoding both annotlin, again with β =, η =. That i, thee word are allowed to imultaneouly have large probabilitie in a given topic without violating any annotlin preference. y the maximality of thee clique, allowing any word outide the clique (e.g., to alo have a large probability will violate at leat annotlin (in thi example. We dicu the encoding for thi ingle connected component r now, deferring dicuion of the complete encoding to ection.. We create a mixture model of Q (r Dirichlet ubtree, one for each clique. Each topic elect exactly one ubtree according to probability p(q M rq, q =...Q (r. (6 onceptually, the elected ubtree indexed by q tend to reditribute nearly all probability ma to the word within M rq. Since there i no ma left for other clique, it i impoible for a word outide clique M rq to have a large probability. Therefore, no annot Lin will be violated. In reality, the ubtree are oft rather than hard, becaue annotlin are only preference. The Dirichlet ubtree for M rq i tructured a follow. The ubtree root connect to an internal node with weight η M rq β. The node connect to word in M rq, with weight β. The ubtree root alo directly connect to word not in M rq (but in the connected component r with weight β. Thi will end mot probability ma down to, and then flexibly reditribute it among word in M rq. For example, Figure (g,h how the Dirichlet ubtree for M r = {,} and M r = {} repectively. Sample from thi mixture model are hown in Figure (i, repreenting multinomial in which no annotlin i violated. Such behavior i not achievable by a Dirichlet ditribution, or a ingle Dirichlet tree. Finally, we mention that although in the wort cae the number of maximal clique Q (r in a connected component of ize r can grow exponentially a O( r / (Grigg et al., 988, in our experiment Q (r i no larger than, due in part to MutLined word collaping to ingle node in the annotlin graph... The Dirichlet Foret Prior In general, our domain nowledge i expreed by a et of MutLin and annotlin. We firt compute the tranitive cloure of MutLin. We then form a annotlingraph, where a node i either a MutLin cloure or a word not preent in any MutLin. Note that the domain nowledge mut be conitent in that no pair of word are imultaneouly annotlined and MutLined (either explicitly or implicitly through MutLin tranitive cloure. Let R be the number of connected component in the annotlingraph. Our Dirichlet Foret conit of R r= Q(r Dirichlet tree, repreented by the template in Figure. Each Dirichlet tree ha Dirichlet ditribution with very mall concentration do have ome election effect. For example, eta(.,. tend to concentrate probability ma on one of the two variable. However, uch prior are wea the peudo count in them are too mall becaue of the mall concentration. The poterior will be dominated by the data, and we would loe any encoded domain nowledge.
5 R branche beneath the root, one for each connected component. The tree differ in which ubtree they include under thee branche. For the rth branch, there are Q (r poible Dirichlet ubtree, correponding to clique M r...m rq (r. Therefore, a tree in the foret i uniquely identified by an index vector q = (q (...q (R, where q (r {...Q (r }. connected component η M q ( other w Q (... = η η or... word Mut Lin connected component R η... M Rq (R... other w Q (R Figure. Template of Dirichlet tree in the Dirichlet Foret To draw a Dirichlet tree q from the prior DirichletForet(β, η, we elect the ubtree independently becaue the R connected component are independent with repect to annotlin: p(q = R r= p(q(r. Each q (r i ampled according to (6, and correpond to chooing a olid box for the rth branch in Figure. The tructure of the ubtree within the olid box ha been defined in Section.. The blac node may be a ingle word, or a MutLin tranitive cloure having the ubtree tructure hown in the dotted box. The edge weight leading to mot node i γ ( = L( β, where L( i the et of leave under. However, for edge coming out of a MutLin internal node or going into a annotlin internal node, their weight are multiplied by the trength parameter η. Thee edge are mared by η in Figure. We now define the complete Dirichlet Foret model, integrating out ( collaping θ and φ. Let n (d be the number of word toen in document d that are aigned to topic. z i generated the ame a in LD: p(z α = ( D Γ(Tα D Γ(α T d= T = Γ(n(d + α. Γ(n (d + Tα There i one Dirichlet tree q per topic =...T, ampled from the Dirichlet Foret prior p(q = R r= p(q(r. Each Dirichlet tree q implicitly define it tree edge weight γ ( uing β, η, and it tree tructure L,I, (. Let n ( be the number of word toen in the corpu aigned to topic that appear under the node in the Dirichlet tree q. The probability of generating the corpu w, given the tree q :T q...q T and the topic aignment z, can be derived uing (: p(w q :T,z,β,η = ( ( I T Γ γ ( ( ( = Γ (γ ( + n ( ( Finally, the complete generative model i Γ(γ ( p(w,z,q :T α, β, η = p(w q :T,z,β,ηp(z α. Inference for Dirichlet Foret + n ( Γ(γ (. T p(q. = ecaue a Dirichlet Foret i a mixture of Dirichlet tree, which are conugate to multinomial, we can efficiently perform inference by Marov hain Monte arlo (MM. Specifically, we ue collaped Gibb ampling imilar to Griffith and Steyver (. However, in our cae the MM tate i defined by both the topic label z and the tree indice q :T. n MM iteration in our cae conit of a weep through both z and q :T. We preent the conditional probabilitie for collaped Gibb ampling below. (Sampling z i : Let n (d i, be the number of word toen in document d aigned to topic, excluding the word at poition i. Similarly, let n ( i, be the number of word toen in the corpu that are under node in topic Dirichlet tree, excluding the word at poition i. For candidate topic label v =...T, we have p(z i = v z i,q :T,w Iv( i (n (d i,v + α γ v (v( i v( + n (v( i i,v (, γ v ( + n ( i,v where I v ( i denote the ubet of internal node in topic v Dirichlet tree that are ancetor of leaf w i, and v ( i i the unique node that i immediate child and an ancetor of w i (including w i itelf. (Sampling q (r : Since the connected component are independent, ampling the tree q factor into ampling the clique for each connected component q (r. For candidate clique q =...Q(r, we have I,r=q p(q (r Γ = q z,q,q ( r,w Γ ( ( ( ( (γ ( γ ( + n ( ( M rq β Γ(γ ( + n ( Γ(γ ( where I,r=q denote the internal node below the rth branch of tree q, when clique M rq i elected.
6 (Etimating φ and θ: fter running MM for ufficient iteration, we follow tandard practice (e.g. (Griffith & Steyver, and ue the lat ample (z,q :T to etimate φ and θ. ecaue a Dirichlet tree i a conugate ditribution, it poterior i a Dirichlet tree with the ame tructure and updated edge weight. The poterior for the Dirichlet tree of the th topic i γ pot( = γ ( +n (, where the count n ( are collected from z,q :T,w. We etimate φ by the firt moment under thi poterior (Mina, 999: I ( w φ (w = γ pot(( w ( γ pot(. (7 The parameter θ i etimated the ame way a in tandard LD: θ = (n (d + α/(n (d + (d Tα.. Experiment Synthetic orpora: We preent reult on ynthetic dataet to how how the Dirichlet Foret (DF incorporate different type of nowledge. Recall that DF with η = i equivalent to tandard LD (verified with the code of (Griffith & Steyver,. Previou tudie often tae the lat MM ample (z and q :T, and dicu the topic φ :T derived from that ample. ecaue of the tochatic nature of MM, we argue that more inight can be gained if multiple independent MM ample are conidered. For each dataet, and each DF with a different η, we run a long MM chain with, iteration of burnin, and tae out a ample every, iteration afterward, for a total of ample. We have ome indication that our chain i wellmixed, a we oberve all expected mode, and that ample with label witching (i.e., equivalent up to label permutation occur with near equal frequency. For each ample, we derive it topic φ :T with (7 and then greedily align the φ from different ample, permuting the T topic label to remove the label witching effect. Within a dataet, we perform P on the baeline (η = φ and proect all ample into the reulting pace to obtain a common viualization (each row in Figure. Point are dithered to how overlap.. MutLin (,: The corpu conit of ix document over a vocabulary of five word. The document are:, DD, and EEEE, each repreented twice. We let T =,α =.,β =.. LD produce three ind of φ :T : roughly a third D E of the time the topic are around [ ], which i horthand for φ = (,,,, φ = (,,,, on the vocabulary DE. nother third are around ML(,, eta=.. L(,, eta= Iolate(, eta= Split(,D, eta= ML(,, eta=.. L(,, eta=.... Iolate(, eta=.... Split(,D, eta= ML(,, eta=.. L(,, eta=.... Iolate(, eta=.... Split(,D, eta= Figure. P proection of permutationaligned φ ample for the four ynthetic data experiment. [ E D D E]. ], and the final third around [ They correpond to cluter, and repectively in the upperleft panel of Figure. We add a ingle Mut Lin (,. When η =, the data till override our MutLin omewhat becaue cluter and do not diappear completely. η increae to, MutLin override the data and cluter and vanih, leaving only cluter. That i, running DF and taing the lat D ample i very liely to obtain the [ E] topic. Thi i what we want: and are preent or abent together in the topic and they alo pull, D along, even though, D are not in the nowledge we added. annotlin (,: The corpu ha four document:, DDDD, twice each; T =,α =,β =.. LD produce ix ind of φ :T evenly: [ D ], [ D], [ D ], [ D], [ D], [ D ], correponding to cluter and the line. We add a ingle annotlin (,. DF η increae, cluter [ D] diappear, becaue it involve a topic that violate the annot Lin. Other cluter become uniformly more liely. Iolate(: The corpu ha four document, all of which are ; T =,α =,β =.. LD pro
7 duce three cluter evenly: [ ], [ ], [ ]. We add Iolate(, which i compiled into annot Lin (, and annotlin (,. The DF ample concentrate to cluter : [ ], which indeed iolate into it own topic. Split(,D: The corpu ha ix document: DEEEE, DFFFF, each preent three time; α =.,β =.. LD with T = produce a large portion of topic around [ D E F] (not hown. We add Split(,D, which i compiled into Mut Lin (,, MutLin (,D, annotlin (,, and increae T =. However, DF with η = (i.e., LD with T = produce a large variety of topic: e.g., cluter i [ D 8 8 7F 8 8 E], cluter i E F], and cluter 7 i [ D E F]. [ 7D That i, imply adding one more topic doe not clearly eparate and D. On the other hand, with η increaing, DF eventually concentrate on cluter 7, which atifie the Split operation. Wih orpu: We now conider interactive topic modeling with DF. The corpu we ue i a collection of 89,7 New Year wihe ubmitted to The Time Square lliance (Goldberg et al., 9. Each wih i treated a a document, downcaed but without topword removal. For each tep in our interactive example, we et α =., β =., η =, and run MM for iteration before etimating the topic from the final ample. The domain nowledge in DF i accumulative along the tep. Step : We run LD with T =. Many of the mot probable word in the topic are conventional ( to, and or corpupecific ( wih, 8 topword, which obcure the meaning of the topic. Step : We manually create a word topword lit, and iue an Iolate preference. Thi i compiled into MutLin among thi et and annotlin between thi et and all other word in the top for all topic. T i increaed to 6. fter running DF, we end up with two topword topic. Importantly, with the topword explained by thee two topic, the top word for the other topic become much more meaningful. Step : We notice that one topic conflate two concept: enter college and cure dieae (top 8 word: go chool cancer into well free cure college. We iue Split( go,chool,into,college, cancer,free,cure,well to eparate the concept. Thi i compiled into Mut Lin within each quadruple, and a annotlin between them. T i increaed to 8. fter running DF, one of the topic clearly tae on the college concept, picing up related word which we did not explicitly encode in our prior. nother topic doe liewie for the cure concept (many wihe are lie mom tay cancer free. Other topic have minor change. Table. Wih topic from interactive topic modeling Topic Top word orted by φ = p(word topic Merge love loe weight together forever marry meet ucce health happine family good friend properity life life happy bet live time long wihe ever year  a do not what omeone o lie don much he money out mae money up houe wor able pay own lot people no people top le day every each other another iraq home afe end troop iraq bring war return oy love true peace happine dream oy everyone family happy healthy family baby afe properou vote better hope preident paul ron than peron buh Iolate and to for a the year in new all my god god ble eu everyone loved now heart chrit peace peace world earth win lottery around ave pam com call if u www viit Iolate i to wih my for and a be that the Split ob go great chool into good college hope move Split mom hope cancer free huband on well dad cure Step : We then notice that two topic correpond to romance concept. We apply Merge( love, forever, marry, together, love, meet, boyfriend, married, girlfriend, wedding, which i compiled into Mut Lin between thee word. T i decreaed to 7. fter running DF, one of the romance topic diappear, and the remaining one correpond to the merged romance topic ( loe, weight were in one of them, and remain o. Other previou topic urvive with only minor change. Table how the wih topic after thee four tep, where we place the DF operation next to the mot affected topic, and colorcode the word explicitly pecified in the domain nowledge. Yeat orpu: Wherea the previou experiment illutrate the utility of our approach in an interactive etting, we now conider a cae in which we ue bacground nowledge from an ontology to guide topic modeling. Our prior nowledge i baed on ix concept. The concept trancription, tranlation and replication characterize three important procee that are carried out at the molecular level. The concept initiation, elongation and termination decribe phae of the three aforementioned procee. ombination of concept from thee two et correpond to concept in the Gene Ontology (e.g., GO:6 i tranlational elongation, and GO:6 i trancription initiation. We guide our topic modeling uing MutLin among a mall et of word for each concept. Moreover, we ue annotlin among word to pecify that we prefer (i trancription, tranlation and replication to be repreented in eparate topic, and (ii initiation, elongation and termination to be repreented in eparate topic. We do not et any preference between the proce topic and the phae topic, however.
8 Table. Yeat topic. The left column how the eed word in the DF model. The middle column indicate the topic in which at leat eed word are among the highet probability word for LD, the o column give the number of other topic (not hared by another word. The right column how the ame topicword relationhip for the DF model. LD DF o trancription trancriptional template tranlation tranlational trn replication cycle diviion initiation tart aembly 7 elongation termination diaembly releae top The corpu that we ue for our experiment conit of 8,9 abtract elected from the MEDLINE databae for their relevance to yeat gene. We induce topic model uing DF to encode the MutLin and annotlin decribed above, and ue tandard LD a a control. We et T =,α =.,β =.,η =. For each word that we ue to eed a concept, Table how the topic that include it among their mot probable word. We mae everal obervation about the DFinduced topic. Firt, each concept i repreented by a mall number of topic and the Mut Lin word for each topic all occur a highly probable word in thee topic. Second, the annotlin preference are obeyed in the final topic. Third, the topic ue the proce and phae topic in a compoitionally. For example, DF Topic repreent trancription initiation and DF Topic 8 repreent replication initiation. Moreover, the topic that are ignificantly influenced by the prior typically include highly relevant term among their mot probable word. For example, the top word in DF Topic include TT, TFIID, promoter, and recruitment which are all pecifically germane to the compoite concept of trancription initiation. In the cae of tandard LD, the eed concept word are dipered acro a greater number of topic, and highly related word, uch a cycle and diviion often do not fall into the ame topic. Many of the topic induced by ordinary LD are emantically coherent, but the pecific concept uggeted by our prior do not naturally emerge without uing DF. cnowledgment: Thi wor wa upported by NIH/NLM grant T LM79 and R LM7, and the Wiconin lumni Reearch Foundation. Reference au, S., Davidon, I., & Wagtaff, K. (Ed.. (8. ontrained clutering: dvance in algorithm, theory, and application. hapman & Hall/R. lei, D., & Lafferty, J. (6. orrelated topic model. In dvance in neural information proceing ytem 8, 7. ambridge, M: MIT Pre. lei, D., Ng,., & Jordan, M. (. Latent Dirichlet allocation. Journal of Machine Learning Reearch,, 99. hemudugunta,., Holloway,., Smyth, P., & Steyver, M. (8. Modeling document by combining emantic concept with unupervied tatitical learning. Intl. Semantic Web onf. (pp. 9. Springer. Denni III, S. Y. (99. On the hyperdirichlet type and hyperliouville ditribution. ommunication in Statitic Theory and Method,, Goldberg,., Fillmore, N., ndrzeewi, D., Xu, Z., Gibon,., & Zhu, X. (9. May all your wihe come true: tudy of wihe and how to recognize them. Human Language Technologie: Proc. of the nnual onf. of the North merican hapter of the oc. for omputational Linguitic. L Pre. Griffith, T. L., & Steyver, M. (. Finding cientific topic. Proc. of the Nat. cademy of Science of the United State of merica,, 8. Grigg, J. R., Grintead,. M., & Guichard, D. R. (988. The number of maximal independent et in a connected graph. Dicrete Math., 68,. Li, W., & Mcallum,. (6. Pachino allocation: DGtructured mixture model of topic correlation. Proc. of the rd Intl. onf. on Machine Learning (pp M Pre. Mina, T. P. (999. The Dirichlettree ditribution (Technical Report. mina/paper/dirichlet/minadirtree.pdf. Tam, Y.., & Schultz, T. (7. orrelated latent emantic model for unupervied LM adaptation. IEEE Intl. onf. on coutic, Speech and Signal Proceing (pp.. The Gene Ontology onortium (. Gene Ontology: Tool for the unification of biology. Nature Genetic,, 9.
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 informationPartial optimal labeling search for a NPhard subclass of (max,+) problems
Partial optimal labeling earch for a NPhard ubcla of (max,+) problem Ivan Kovtun International Reearch and Training Center of Information Technologie and Sytem, Kiev, Uraine, ovtun@image.iev.ua Dreden
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 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 25199 ein 1526551 8 543 565 inform doi 1.1287/mnc.17.82 28 INFORMS Scheduling Arrival to Queue: A SingleServer Model with NoShow INFORMS
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) GottliebDaimlerStr. 49, 67663 Kaierlautern,
More informationDISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENTMATCHING INTRUSION DETECTION SYSTEMS
DISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENTMATCHING INTRUSION DETECTION SYSTEMS Chritopher V. Kopek Department of Computer Science Wake Foret Univerity WintonSalem, NC, 2709 Email: kopekcv@gmail.com
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 informationDISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENTMATCHING INTRUSION DETECTION SYSTEMS. G. Chapman J. Cleese E. Idle
DISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENTMATCHING INTRUSION DETECTION SYSTEMS G. Chapman J. Cleee E. Idle ABSTRACT Content matching i a neceary component of any ignaturebaed network Intruion Detection
More informationA Spam Message Filtering Method: focus on run time
, pp.2933 http://dx.doi.org/10.14257/atl.2014.76.08 A Spam Meage Filtering Method: focu on run time SinEon Kim 1, JungTae Jo 2, SangHyun Choi 3 1 Department of Information Security Management 2 Department
More informationMaximizing Acceptance Probability for Active Friending in Online Social Networks
Maximizing for Active Friending in Online Social Network DeNian Yang, HuiJu Hung, WangChien Lee, Wei Chen Academia Sinica, Taipei, Taiwan The Pennylvania State Univerity, State College, Pennylvania,
More information1 Introduction. Reza Shokri* Privacy Games: Optimal UserCentric Data Obfuscation
Proceeding on Privacy Enhancing Technologie 2015; 2015 (2):1 17 Reza Shokri* Privacy Game: Optimal UerCentric Data Obfucation Abtract: Conider uer who hare their data (e.g., location) with an untruted
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 informationReview of Multiple Regression Richard Williams, University of Notre Dame, http://www3.nd.edu/~rwilliam/ Last revised January 13, 2015
Review of Multiple Regreion Richard William, Univerity of Notre Dame, http://www3.nd.edu/~rwilliam/ Lat revied January 13, 015 Aumption about prior nowledge. Thi handout attempt to ummarize and yntheize
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 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 SurvivabilityHeterogeneou Senor Networ Jie Tian, Tan Yan, and Guiling Wang
More informationFEDERATION OF ARAB SCIENTIFIC RESEARCH COUNCILS
Aignment Report RP/98983/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 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 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 informationImproving the Performance of Web Service Recommenders Using Semantic Similarity
Improving the Performance of Web Service Recommender Uing Semantic Similarity Juan Manuel AdánCoello, Carlo Miguel Tobar, Yang Yuming Faculdade de Engenharia de Computação, Pontifícia Univeridade Católica
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 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 informationStatespace analysis of control systems: Part I
Why a different approach? Statepace analyi of control ytem: Part I Uing a tatevariable approach give u a traightforward way to analyze MIM multipleinput, multiple output ytem. A tate variable model
More informationUtilityBased Flow Control for Sequential Imagery over Wireless Networks
UtilityBaed 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 informationHeuristic Approach to Dynamic Data Allocation in Distributed Database Systems
Pakitan Journal of Information and Technology 2 (3): 231239, 2003 ISSN 16826027 2003 Aian Network for Scientific Information Heuritic Approach to Dynamic Data Allocation in Ditributed Databae Sytem 1
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 0030364X ein 15265463 11 5905 1304 http://dx.doi.org/10.1287/opre.1110.0990 2011 INFORMS TECHNICAL NOTE INFORMS hold copyright
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ãoSilva a,c, João Clímaco b,c, Lúcia Martin a,c a b c DEECFCTUC FEUC INESCCoimbra International
More informationCandy Phylogeny Lab. Procedure:
Candy Phylogeny Lab Material Candy Bar (2 each) o Baby Ruth o Reee Piece o rhey Cookie and Cream o Snicker Cruncher o Snicker o MM Peanut o MM Plain o rhey o rhey Almond o Skittle Picture of Candy Bar
More informationPerformance of Multiple TFRC in Heterogeneous Wireless Networks
Performance of Multiple TFRC in Heterogeneou Wirele Network 1 HyeonJin Jeong, 2 SeongSik Choi 1, Firt Author Computer Engineering Department, Incheon National Univerity, oaihjj@incheon.ac.kr *2,Correponding
More informationReport 46681b 30.10.2010. Measurement report. Sylomer  field test
Report 46681b Meaurement report Sylomer  field tet Report 46681b 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 informationHarmonic Oscillations / Complex Numbers
Harmonic Ocillation / Complex Number Overview and Motivation: Probably the ingle mot important problem in all of phyic i the imple harmonic ocillator. It can be tudied claically or uantum mechanically,
More 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 informationCASE STUDY BRIDGE. www.futureprocessing.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 67 #5 THE BUSINESS PROBLEM THAT WE SOLVED 8 #6 CHALLENGES 9 #7 VISUAL IDENTIFICATION
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 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 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 informationBiObjective 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, 1720 June 2012, London. 2012 Elevier B.V. All right reerved. BiObjective
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 informationPeriodic Symmetric Functions and Addition Related Arithmetic Operations in Single Electron Tunneling Technology
Periodic Symmetric Function and Addition Related Arithmetic Operation in Single Electron Tunneling Technology or Meenderinck Sorin otofana omputer Engineering Lab, Delft Univerity of Technology, Delft,
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 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 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 informationProgress 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 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 informationAnalysis of Mesostructure Unit Cells Comprised of Octettruss Structures
Analyi of Meotructure Unit Cell Compried of Octettru Structure Scott R. Johnton *, Marque Reed *, Hongqing V. Wang, and David W. Roen * * The George W. Woodruff School of Mechanical Engineering, Georgia
More informationSCM integration: organiational, managerial and technological iue M. Caridi 1 and A. Sianei 2 Dipartimento di Economia e Produzione, Politecnico di Milano, Italy Email: maria.caridi@polimi.it Itituto
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 informationCombining Statistics and Semantics via Ensemble Model for Document Clustering
ombining tatitic and emantic via Enemble Model or Document lutering amah Jamal Fodeh Michigan tate Univerity Eat Laning, MI, 48824 odeham@mu.edu William F Punch Michigan tate Univerity Eat Laning, MI,
More informationSoftware 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 informationIEEE 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 informationINFORMATION Technology (IT) infrastructure management
IEEE TRANSACTIONS ON CLOUD COMPUTING, VOL. 2, NO. 1, MAY 214 1 BuineDriven Longterm Capacity Planning for SaaS Application David Candeia, Ricardo Araújo Santo and Raquel Lope Abtract Capacity Planning
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, 2729 November 23, Singapore Support Vector Machine Baed Electricity Price Forecating For Electricity Maret utiliing Projected Aement of Sytem
More informationof absorption transitions (1, 2) and the mean rate of visits to state or are, respectively, J.=
Proc. Natl. Acad. Sci. USA Vol. 85, pp. 45774581, July 1988 Applied Mathematical Science Number of viit to a tate in a random walk, before aborption, and related topic (kinetic dim/multitate directional
More information2. METHOD DATA COLLECTION
Key to learning in pecific ubject area of engineering education an example from electrical engineering AnnaKarin Cartenen,, and Jonte Bernhard, School of Engineering, Jönköping Univerity, S Jönköping,
More informationAdding Domain Knowledge to Latent Topic Models
Adding Domain Knowledge to Latent Topic Models Xiaojin Zhu Department of Computer Sciences University of WisconsinMadison 2011 Zhu (Wisconsin) Knowledge LDA 1 / 42 Acknowledgments David M. Andrzejewski
More informationQueueing Models for Multiclass Call Centers with RealTime Anticipated Delays
Queueing Model for Multicla Call Center with RealTime Anticipated Delay Oualid Jouini Yve Dallery Zeynep Akşin Ecole Centrale Pari Koç Univerity Laboratoire Génie Indutriel College of Adminitrative Science
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 informationTowards ControlRelevant Forecasting in Supply Chain Management
25 American Control Conference June 81, 25. Portland, OR, USA WeA7.1 Toward ControlRelevant Forecating in Supply Chain Management Jay D. Schwartz, Daniel E. Rivera 1, and Karl G. Kempf Control Sytem
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 informationThus 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 informationDistributed 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 Email: {chaliu, gcao}@ce.pu.edu
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 informationChapter 4: MeanVariance Analysis
Chapter 4: MeanVariance Analyi Modern portfolio theory identifie two apect of the invetment problem. Firt, an invetor will want to maximize the expected rate of return on the portfolio. Second, an invetor
More informationClusterAware Cache for Network Attached Storage *
CluterAware 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 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 informationMobile Network Configuration for Largescale Multimedia Delivery on a Single WLAN
Mobile Network Configuration for Largecale Multimedia Delivery on a Single WLAN Huigwang Je, Dongwoo Kwon, Hyeonwoo Kim, and Hongtaek Ju Dept. of Computer Engineering Keimyung Univerity Daegu, Republic
More informationQUANTIFYING THE BULLWHIP EFFECT IN THE SUPPLY CHAIN OF SMALLSIZED 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 informationTtest for dependent Samples. Difference Scores. The t Test for Dependent Samples. The t Test for Dependent Samples. s D
The t Tet for ependent Sample Ttet for dependent Sample (ak.a., Paired ample ttet, Correlated Group eign, Within Subject eign, Repeated Meaure,.. RepeatedMeaure eign When you have two et of core from
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@yahooinc.com Dr. Le Gruenwald
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 informationBenchmarking BottomUp and TopDown Strategies for SPARQLtoSQL Query Translation
Benchmarking BottomUp and TopDown Strategie for SPARQLtoSQL 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 informationProgress 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 informationScheduling of Jobs and Maintenance Activities on Parallel Machines
Scheduling of Job and Maintenance Activitie on Parallel Machine ChungYee Lee* Department of Indutrial Engineering Texa A&M Univerity College Station, TX 778433131 cylee@ac.tamu.edu ZhiLong Chen** Department
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 informationECE 320 Energy Conversion and Power Electronics Dr. Tim Hogan. Chapter 7: Synchronous Machines and Drives (Textbook Chapter 5)
ECE 30 Energy Converion and Power Electronic Dr. Tim Hogan Chapter 7: ynchronou Machine and Drive (Textbook Chapter 5) Chapter Objective For induction machine, a the rotor approache ynchronou peed, the
More informationLinear energypreserving integrators for Poisson systems
BIT manucript No. (will be inerted by the editor Linear energypreerving integrator for Poion ytem David Cohen Ernt Hairer Received: date / Accepted: date Abtract For Hamiltonian ytem with noncanonical
More informationpublished in Statistics and Probability Letters, 78, , 2008 Michael Lechner * SIAW
publihed in Statitic and Probability Letter, 78, 995, 28 A NOTE ON ENDOGENOUS CONTROL VARIABLES IN CAUSAL STUDIES Michael Lechner * SIAW Thi verion: March, 27 Date thi verion ha been printed: 8 May 27
More informationFinite Automata. a) Reading a symbol, b) Transferring to a new instruction, and c) Advancing the tape head one square to the right.
Finite Automata Let u begin by removing almot all of the Turing machine' power! Maybe then we hall have olvable deciion problem and till be able to accomplih ome computational tak. Alo, we might be able
More informationPerformance of a BrowserBased JavaScript Bandwidth Test
Performance of a BrowerBaed JavaScript Bandwidth Tet David A. Cohen II May 7, 2013 CP SC 491/H495 Abtract An exiting browerbaed bandwidth tet written in JavaScript wa modified for the purpoe of further
More informationAuction Mechanisms Toward Efficient Resource Sharing for Cloudlets in Mobile Cloud Computing
1 Auction Mechanim Toward Efficient Reource Sharing for Cloudlet in Mobile Cloud Computing ALong Jin, Wei Song, Ping Wang, Duit Niyato, and Peijian Ju Abtract Mobile cloud computing offer an appealing
More informationTHE 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 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 informationParallel Polygon Scan Conversion on RMESH Multiprocessors
Parallel Polygon Scan Converion on RMESH Multiproceor John Jenq Department of Computer Science Montclair State Univerity jenq@mail.montclair.edu Wing Ning Li Department of Computer Science and Computer
More informationPlease read the information that follows before beginning. Incomplete applications will delay the review and approval process.
Certified Manager Certification Application Intruction Completing the Application Congratulation on chooing to purue the Certified Manager (CM ) certification. The application i the tarting point toward
More informationProgress 8 and Attainment 8 measure in 2016, 2017, and 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 October 2016 Content Table of figure 4 Summary 5 A ummary of Attainment 8 and Progre
More informationLinear Momentum and Collisions
Chapter 7 Linear Momentum and Colliion 7.1 The Important Stuff 7.1.1 Linear Momentum The linear momentum of a particle with ma m moving with velocity v i defined a p = mv (7.1) Linear momentum i a vector.
More informationUsing Graph Analysis to Study Networks of Adaptive Agent
Uing Graph Analyi to Study Network of Adaptive Agent Sherief Abdallah Britih Univerity in Dubai, United Arab Emirate Univerity of Edinburgh, United Kingdom hario@ieee.org ABSTRACT Experimental analyi of
More informationMultiObjective Optimization for Sponsored Search
MultiObjective 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 informationGrowth 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 informationResearch Article An (s, S) Production Inventory Controlled SelfService Queuing System
Probability and Statitic Volume 5, Article ID 558, 8 page http://dxdoiorg/55/5/558 Reearch Article An (, S) Production Inventory Controlled SelfService Queuing Sytem Anoop N Nair and M J Jacob Department
More informationAccelerationDisplacement Crash Pulse Optimisation A New Methodology to Optimise Vehicle Response for Multiple Impact Speeds
AccelerationDiplacement 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 informationProceedings of Power Tech 2007, July 15, Lausanne
Second Order Stochatic Dominance Portfolio Optimization for an Electric Energy Company M.P. Cheong, Student Member, IEEE, G. B. Sheble, Fellow, IEEE, D. Berleant, Senior Member, IEEE and C.C. Teoh, Student
More informationChapter 10 Stocks and Their Valuation ANSWERS TO ENDOFCHAPTER QUESTIONS
Chapter Stoc and Their Valuation ANSWERS TO ENOFCHAPTER 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 informationBrand Equity Net Promoter Scores Versus Mean Scores. Which Presents a Clearer Picture For Action? A NonElite Branded University Example.
Brand Equity Net Promoter Score Veru Mean Score. Which Preent a Clearer Picture For Action? A NonElite Branded Univerity Example Ann Miti, Swinburne Univerity of Technology Patrick Foley, Victoria Univerity
More informationBioterrorism. and Health System Preparedness. Addressing the Smallpox Threat: Issues, Strategies, and Tools. Issue Brief.
Iue Brief No. 1 Bioterrorim and Health Sytem Preparedne Addreing the Smallpox Threat: Iue, Strategie, and Tool www.ahrq.gov The Agency for Healthcare Reearch and Quality (AHRQ) i the lead agency charged
More informationAuction 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 informationSimulation of Sensorless Speed Control of Induction Motor Using APFO Technique
International Journal of Computer and Electrical Engineering, Vol. 4, No. 4, Augut 2012 Simulation of Senorle Speed Control of Induction Motor Uing APFO Technique T. Raghu, J. Sriniva Rao, and S. Chandra
More informationMobility Improves Coverage of Sensor Networks
Mobility Improve Coverage of Senor Networ Benyuan Liu Dept. of Computer Science Univerity of MaachuettLowell Lowell, MA 1854 Peter Bra Dept. of Computer Science City College of New Yor New Yor, NY 131
More informationReturn on Investment and Effort Expenditure in the Software Development Environment
International Journal of Applied Information ytem (IJAI) IN : 22490868 Return on Invetment and Effort Expenditure in the oftware Development Environment Dineh Kumar aini Faculty of Computing and IT, ohar
More informationStochasticity in Transcriptional Regulation: Origins, Consequences, and Mathematical Representations
36 Biophyical Journal Volume 8 December 200 36 336 Stochaticity in Trancriptional Regulation: Origin, Conequence, and Mathematical Repreentation Thoma B. Kepler* and Timothy C. Elton *Santa Fe Intitute,
More informationG*Power 3: A flexible statistical power analysis program for the social, behavioral, and biomedical sciences
Behavior Reearch Method 007, 39 (), 759 G*Power 3: A flexible tatitical power analyi program for the ocial, behavioral, and biomedical cience FRAZ FAUL ChritianAlbrechtUniverität Kiel, Kiel, Germany
More information