An Iterated Beam Search Algorithm for Scheduling Television Commercials. Mesut Yavuz. Shenandoah University


 Debra Weaver
 2 years ago
 Views:
Transcription
1 An Iterated Beam Searh Algorithm for Sheduling Television Commerials Mesut Yavuz Shenandoah University The Harry F. Byrd, Jr. Shool of Business Winhester, Virginia, U.S.A. POMS 19 th Annual Conferene La Jolla, California, U.S.A. May 9 to May 12, 2008 Abstrat This paper is onerned with the problem of sheduling ommerial videolips for television. The literature of the problem inludes a 40instane testbed and implementations of branh and bound (B&B) and simulated annealing (SA) methods. Currently, optimal solutions of 24 out of 40 instanes are known. In this paper, we propose an iterated beam searh (IBS) method that is based on the priniples of dynami programming (DP) and B&B, and an be used for exat or heuristi solution of the problem. Our experiments on the existing testbed show that the proposed IBS method (i) finds the exat solution of one more instane, (ii) outperforms SA in a majority of the instanes, and (iii) improves the best known lower bounds and hene narrows 1
2 the optimality gap for the instanes that are not solved to optimality. The results are promising for the solution of the response time variability problem, as well. 1. Introdution Sheduling problems onstitute a signifiant portion of the operations researh literature, and there are numerous different types of sheduling problems with various appliation areas [1]. Our fous is on sheduling in the television broadasting industry. Earlier sheduling studies for television have been based on programs, see [24] and the referenes therein. A more reent line of researh fouses on sheduling ommerial videolips on television [510]. Bollapragada and Garbinas [5] are onerned with assigning ommerials to slots in a number of breaks suh that ommerials of ompeting advertisers are not aired during the same break, and eah ommerial reeives its fair share of the first and last slots in a break, sine they are more valuable than the ones in the middle. Bai and Xie [7] and Kimms and MullerBungart [9] are onerned with simultaneously aepting and sheduling ommerials to maximize revenue. Zhang [8] onsiders a broader problem whih onsists of first assigning ommerials to shows and then sheduling ommerials in eah show. Bollaparagada et al. [6] onsider a sequene of slots with no breaks. They formulate a problem in order to spae subsequent appearanes of a ommerial as evenly as possible. The authors propose a branh and bound (B&B) algorithm for the exat solution of the problem, and also several heuristis for approximate solution. They also present a 40instane testbed for the problem. Bruso [10] onsiders the same problem and uses the testbed established by Bollapragada et al. He proposes an enhaned B&B algorithm and a fast simulated annealing heuristi. His methods improve the bestknown solutions of several instanes in the testbed. 2
3 This paper is onerned with the problem proposed by Bollapragada et al. [6] and proposes a novel iterated beam searh (IBS) algorithm for its solution. The remainder of the paper is organized as follows. Setion 2 presents a mathematial model of the problem. Setion 3 briefly reviews the literature on beam searh and speifies our IBS algorithm. Setion 4 presents the results obtained by IBS on the same testbed and ompares them to those of Bollaparagada et al. [6] and Bruso [10]. Setion 5 presents a losely related problem, namely, the response time variability problem (RTVP), and disusses how IBS an be used for its solution. Finally, Setion 6 onludes the paper with a summary and disussion of future researh. 2. A mathematial model Suppose ommerial, = 1, 2,.., C, should be aired n times throughout the planning C n = 1 horizon, whih onsists of N = slots. A ommon analogy used in the literature is to onsider ommerials as balls with different olors. That is, a total of N balls to be plaed into N slots. Let X i, be the slot oupied by ball i of olor, i = 1, 2,.., n, = 1, 2,.., C. In an ideal shedule, balls of the same olor are evenly spaed. Sine there are N slots in the sequene, the ideal distane between two onseutive balls of olor is N q =. Let Y i,, k = 1 if ball i of olor n is assigned to the k th slot of the sequene, and Y 0 otherwise. The following optimization model is formulated for the problem: i,, k = 3
4 Minimize subjet to C n = 1 i= 2 X X q i, i 1, (1) X i, X i 1, 1, i = 1, 2,.., n, = 1, 2,.., C (2) N n k= 1 i= 1 Yi,, k = 1, = 1, 2,.., C (3) N X i, kyi,, k = 0, i = 1, 2,.., n, = 1, 2,.., C (4) C n = 1 i= 1 N Y i, k k = 1 i k = 1 Y, = 1, k = 1, 2,.., N (5) i, k, = 1, i = 1, 2,.., n, = 1, 2,.., C (6) X, { 1,2,.., N}, { 0,1} Y i, k, i = 1, 2,.., n, = 1, 2,.., C (7), i = 1, 2,.., n, = 1, 2,.., C, k = 1, 2,.., N (8) The objetive funtion (1) is the summation of absolute differenes between the atual and ideal distanes between subsequent balls of eah olor. Note that it does not inlude a term for the first ball of a olor. Also note that the objetive funtion formulated above is nonlinear, but ould be easily replaed by a linear equivalent [6]. Constraint (2) defines the order between balls of the same olor. Constraint (3) guarantees that all balls are plaed. Constraint (4) ties deision variables X i, and Y i, k, together. More speifially, the binary assignment variable i, k Y, is used to determine the value of the shedule variable that exatly one ball is plaed into a slot and eah ball is plaed into a slot in the sequene. Finally, onstraints (7) and (8) define the deision variables. 4 X i,. Constraints (5) and (6) jointly assure
5 3. An iterated beam searh algorithm 3.1 Beam searh Beam searh (BS) is essentially a trunated B&B method. It starts with a null solution and onstruts omplete solutions by fixing one variable per stage. In eah stage partial solutions are extended using a branhing strategy. All the newly reated partial solutions are evaluated and only the best β (i.e., beam width) of them are kept for further branhing. In other words, the searh tree is pruned at eah stage in order to keep it at a manageable size. An optimal solution may not be reahed if all the partial solutions leading to it are pruned at intermediate stages, whih makes BS a heuristi method. Strengths of the BS method are its speed and intelligene that an be inorporated into the evaluation of partial solutions. The fastest implementation of BS an be obtained by letting β = 1 and evaluating partial solutions only based on loal information. This is the wellknown greedy method. BS is a broad family of methods ranging from an extremely fast greedy heuristi to an enumerative exat method, haraterized by the beam width and the partial solution evaluation strategy. BS has been implemented on a variety of problems, and has been enrihed by adding new omponents to improve its speed and/or auray. Two most ommon implementations are filtered beams searh (FBS) and reovering beam searh (RBS). FBS uses a simple evaluations strategy to limit the number of partial solutions at eah stage, that are evaluated via a more ompliated and aurate strategy. RBS is a further improvement that uses loal searh on partial solutions in order to reover from previously made poor hoies. We refer the reader to [1114] and the referenes therein for examples of reent FBS and RBS implementations. 5
6 3.2 Our IBS approah Existing BS implementations mentioned above are all singlepass methods. That is, partial solutions reated at a stage of the tree are either further evaluated immediately, or disarded. With a single pass, some good partial solutions may be trunated due to the poor performane of the evaluation strategy employed. In this paper, we aim to improve BS by overoming this defiieny via multiple passes (iterations). In the ore of BS is a tree, whih an be searhed either partially or ompletely. An empty sequene is the root of the tree, and eah slot in the sequene adds a level to the tree. In our problem, we have C different ommerials, hene, at most C branhes emanating from any nonleaf node in the tree. The number of leaf nodes is C = 1 N! ( n!). The large number of leaf nodes, i.e., number of feasible solutions, renders expliit enumeration impratial for largersized instanes of the problem. Dynami programming (DP) is known as an impliit enumeration method exploiting the problem struture to redue the size of the searh tree. Consider a partial solution where 1 < m < n balls of olor, = 1, 2,.., C, are sheduled. Let M = C m = 1 be the length of the partial sequene. In order to extend this partial solution, we must know the objetive funtion value of the partial sequene, numbers of balls already sequened (m ) and the position of the last ball in the partial sequene (say, l ) for eah olor. Preeding balls an be sequened in ( ) ( M C)! Ψ m, l = different ways. That is, Ψ( m, l) C ( ( m 1 )! ) = 1 distint intermediate nodes an be represented by only one node in a DP network. We take advantage of this fat in our IBS method. 6
7 We onstrut a DP network of N stages with (possibly) multiple nodes in eah stage and ars pointing from stage t1 to t only, for t = 1, 2,.., N. A node at the N th stage is a leaf node, i.e., a omplete solution. Eah node is represented by m and l vetors and has a lower bound (LB) value. Nodes are explored in forward passes. When a node is explored, all the branhes from that node are onsidered, i.e., at most C nodes at the next stage are reated, and the node itself is eliminated. Note that only one value (m and l ) in eah vetor differs between the parent and a hild node. Calulation of LB is disussed later in the paper. Designing a multiplepass method requires speial attention to not reate the same node multiple times. We ahieve this by using two linked lists (of nodes) at eah stage. The first one ontains unexplored nodes and it is ordered from smallest to largest in the LB value. The seond one ontains already explored (and eliminated) nodes, and is unordered. When a new node is reated, it is first ompared to the nodes in the list of explored nodes. If it is already in the list, it is simply eliminated. Otherwise, it is ompared to the nodes in the list of unexplored nodes. If it is not in the list, it is added to the list in the order of its LB. If it is already in the list, the LB values of the two are ompared and the better one is kept in the list. The lowest lower bound in eah stage is easily found in the head node of the ordered list in that stage. Let LLB be the lowest of all lower bounds. LLB is initially equal to the lower bound of the root node, and is updated at the end of eah iteration, i.e., forward pass. A forward pass starts at the earliest stage with a nonempty set of unexplored nodes. The first β nodes in the list are explored. We inorporate an adaptive strategy at this point and explore all the nodes with an LB equal to LLB. That is, at eah stage at least β nodes are explored and no node remains with the lowest lower bound. This adaptive strategy ensures that the LLB is inreased at eah iteration. At the end of eah iteration, the objetive funtion value 7
8 of the best new omplete solution is ompared to that of the previously known best solution, and the upper bound (UB) is updated if neessary. If the UB is updated at the end of an iteration, a quik pass is made over the lists of unexplored nodes to prune out the ones that annot lead to an optimal solution. Calulation of the LB for a newly reated node is an involved proess that requires solving an assignment problem. First, let us fous on one olor,. In a partial solution, m balls th of olor are already plaed into the first M positions, with the last of them being in the l position. Minimization of the total deviation from the remaining n m balls requires keeping the distanes between them as lose to the ideal distane N/n as possible. Obtaining this lower bound does not require sheduling the remaining balls, and, hene, an be performed in O(1) time. Furthermore, if we assume sequening m +1 st ball of olor in position t > M, the total deviation from the remaining n m 1 balls an be alulated in O(1) time, as well. Let us denote that lower bound by F (m +1,t). Also let the total deviation resulting from the first m balls of olor already sequened be P (m,l ). Then, LB (m,l,t) = P (m,l ) + t  l  q + F (m +1,t) is a lower bound for all the balls of olor, if the next one is sequened in position t. Note that this lower bound an be obtained in O(1) time. Moreover, an ideal position t* for the next ball of olor an easily be obtained. Ideal positions of the next opies of different olors may overlap. Therefore, simply summing lower bounds LB (m,l,t* ) gives a loose lower bound. A better lower bound is obtained by identifying a set of andidate positions for the next balls of different olors, alulating the lower bound for eah olor and eah andidate position, and finally solving an assignment problem. The size of the andidate positions list is O(C), and the resulting assignment problem is solved in O(C 3 ) time. 8
9 In our initial study of the IBS method, we tried simpler and faster LB alulation strategies. The strategy desribed above yielded the best results, and hene, we dropped the others from further onsideration. Our node evaluation strategy is solely based on the LB. The node with smallest LB at a stage is the first one to be explored. This serves our purpose to improve the best known LB for a problem, while searhing for a good solution. We finally note that we use omputation time as the only termination ondition. That is, IBS is allowed to run until a designated amount of time passes. As we have disussed throughout this setion, our IBS method has a simple struture and it takes only two parameters, namely β and run time. 4. Results We use the 40instane testbed developed by Bollapragada et al. [6] to test the performane of our IBS method. We oded the method in Mirosoft C# and onduted the experiments on a desktop omputer with Intel Dual Core2 CPU at 1.86 GHz and 3GB of RAM. Our preliminary experiments showed that β = 10 was a good hoie. When implemented the IBS method, we fed the best UB reported in [6] as input for eah instane. This allows IBS to find good (if not optimal) solutions faster. In order to explore the performane of the method to quikly find good solutions, we allowed a maximum run time of 120 seonds. We present the results for all 40 instanes in Table 1. The first olumn shows the instane number. The next three olumns are the best known results from the literature. That is, LB is from [6], UB is from [10], and gap is the ratio of their differene to LB (gap = (UBLB) / LB). The last four olumns in the table present the performane of IBS. Time is reported in seonds. LB, UB, and gap values in bold are the ones improved over the best known values. 9
10 Table 1 Computational results Instane Best Known IBS # LB UB Gap Time LB UB Gap
11 The table shows that IBS is suessful in finding optimal solutions of all 24 instanes (#1 to 23, and 27) previously solved in [6] and [10]. In addition, #26 is solved to optimality in 107 seonds. Optimal solutions of 15 instanes (#24, 25, and 2840) remain unknown. However, we see from the table that IBS provides improved lower bounds for them. As to the upper bounds, we see that IBS yields an improved solution in nine instanes, repeats the best known solution in one, and does not reah the best known solution in the remaining five. The optimality gap is improved in 12 of the instanes and remained approximately the same (due to rounding) in the other three. Overall, the IBS method demonstrates good performane, and appears promising for future researh on this and other hard optimization problems. 5. The response time variability problem In many reallife sheduling problems, it is aimed to find a fair alloation of resoures to ompeting produts, ustomers, et. Response time is defined as the distane between two onseutive times a resoure is alloated to a produt or ustomer. In the ase of sequening ommerial videolips, response time is the number of slots between two appearanes of a ommerial. The RTVP is first formulated by Corominas et al. [15]. Their formulation is different from the problem addressed in this paper in two ways. First, the RTVP is onerned with a repetitive sequene. That is, slot N of the preeding exeution of the sequene is slot 0 of the sueeding exeution. Therefore, a distane is defined for the first ball of a olor and it is inluded in the objetive funtion. Seond, the objetive funtion that Corominas et al. use sums 11
12 the squared deviations between the ideal and atual response times, rather than the absolute values. This approah puts more emphasis on larger deviations. Using the sum of squared deviations approah in the sheduling of ommerial videolips is addressed by Bruso [10]. The author states that the branh and bound method used to solve the problem runs muh slower in that ase. In this regard, it would be interesting to use the absolute value approah in the RTVP and see if that modified problem is easier to solve. IBS an be implemented to the RTVP with relative ease. The node struture should be enhaned to inlude the first position allotted to a ommerial in a partial sequene. This is needed to alulate the distane between the last and first positions, and to ompute its objetive funtion ontribution. The onnetion between the beginning and the end of a sequene gives it a yli struture, whih an be used to fix the first position. That is, without loss of generality, a ommerial of type one an be assigned to the first position in the sequene. This makes the root node a partial sequene of length one instead of an empty sequene, and redues the searh spae. 6. Conlusions This paper presents a novel iterated beam searh method for sheduling ommerial videolips in television broadasting. The proposed method is shown to be both fast and aurate. Furthermore, the method improves the best known lower bound in all test instanes with an unknown optimal solution. The IBS method an be improved by adding a few new omponents. Loal searh is a omponent that is often used to enrih metaheuristi methods. In the ase of IBS, it an be used at the very end to improve the best solution found throughout all the iterations. Alternatively a 12
13 loal searh an be performed at the end of eah iteration, on the best solution found in that iteration. The latter would be more time onsuming, but also expeted to yield better upper bounds earlier. Partial solutions are evaluated solely based on their lower bound values in the proposed method. If a fast method an be developed to omplete a partial solution, it an provide an upper bound for eah solution. Then, those upper bounds an be used to evaluate partial solutions. These improvements are future researh diretions on IBS in solving the problem addressed in this paper. A third and final potential future researh diretion we point at is using IBS to solve the response time variability problem. Referenes [1] Leung, J. Y.T., 2004, Handbook of sheduling: algorithms, models, and performane analysis, Chapman & Hall/CRC omputer and information siene series, Boa Raton: Chapman & Hall/CRC. [2] Reddy, S. K., Aronson, J. E. and Stam, A., 1998, SPOT: Sheduling programs optimally for television, Management Siene, 44(1), [3] Danaher, P. J. and Mawhinney, D. F., 2001, Optimizing television program shedules using hoie modeling, Journal of Marketing Researh, 38(3), pp [4] Ytrenerg, E., 2002, Continuity in environments: The evolution of basi praties and dilemmas in Nordi television sheduling, European Journal of Communiation, 17(3), pp
14 [5] Bollapragada, S. and Garbinas, M., 2004, Sheduling ommerials on broadast television, Operations Researh, 52(3), [6] Bollapragada, S., Bussiek, M. R. and Mallik, S., 2004, Sheduling ommerial videotapes in broadast television, Operations Researh, 52(5), [7] Bai, R. and Xie, J., 2006, Heuristi Algorithms for Simultaneously Aepting and Sheduling Advertisements on Broadast Television, Journal of Information and Computer Siene, 1(4), pp [8] Zhang, X., 2006, Mathematial models for the television advertising alloation problem, International Journal of Operational Researh, 1(3), [9] Kimms, A. and MullerBungart, M., 2007, Revenue management for broadasting ommerials: the hannel s problem of seleting and sheduling the advertisements to be aired, International Journal of Revenue Management, 1(1), [10] Bruso, M. J., Sheduling advertising slots for television, Journal of the Operational Researh Soiety, forthoming. [11] Valente, J. M. S. and Alves, R. A. F. S., 2005, Filtered and reovering beam searh algorithms for the early/tardy sheduling problem with no idle time, Computers & Industrial Engineering, 48(2), [12] Ghirardi, M. and Potts, C. N., 2005, Makespan minimization for sheduling unrelated parallel mahines: A reovering beam searh approah, European Journal of Operational Researh, 165(2),
15 [13] Esteve, B., Aubijoux, C., Chartier, A. and T Kindt, V., 2006, A reovering beam searh algorithm for the single mahine justintime sheduling problem, European Journal of Operational Researh, 172(3), [14] Erel, E., Gogun, Y. and Sabunuoglu, I., 2007, Mixedmodel assembly line sequening using beam searh, International Journal of Prodution Researh, 45(22), [15] Corominas, A., Kubiak, W. and Palli, N. M., 2007, Response time variability, Journal of Sheduling, 10(2),
Srinivas Bollapragada GE Global Research Center. Abstract
Sheduling Commerial Videotapes in Broadast Television Srinivas Bollapragada GE Global Researh Center Mihael Bussiek GAMS Development Corporation Suman Mallik University of Illinois at Urbana Champaign
More informationChannel Assignment Strategies for Cellular Phone Systems
Channel Assignment Strategies for Cellular Phone Systems Wei Liu Yiping Han Hang Yu Zhejiang University Hangzhou, P. R. China Contat: wliu5@ie.uhk.edu.hk 000 Mathematial Contest in Modeling (MCM) Meritorious
More informationA Holistic Method for Selecting Web Services in Design of Composite Applications
A Holisti Method for Seleting Web Servies in Design of Composite Appliations Mārtiņš Bonders, Jānis Grabis Institute of Information Tehnology, Riga Tehnial University, 1 Kalu Street, Riga, LV 1658, Latvia,
More informationSebastián Bravo López
Transfinite Turing mahines Sebastián Bravo López 1 Introdution With the rise of omputers with high omputational power the idea of developing more powerful models of omputation has appeared. Suppose that
More informationComputer Networks Framing
Computer Networks Framing Saad Mneimneh Computer Siene Hunter College of CUNY New York Introdution Who framed Roger rabbit? A detetive, a woman, and a rabbit in a network of trouble We will skip the physial
More informationAn integrated optimization model of a Closed Loop Supply Chain under uncertainty
ISSN 18166075 (Print), 18180523 (Online) Journal of System and Management Sienes Vol. 2 (2012) No. 3, pp. 917 An integrated optimization model of a Closed Loop Supply Chain under unertainty Xiaoxia
More informationWeighting Methods in Survey Sampling
Setion on Survey Researh Methods JSM 01 Weighting Methods in Survey Sampling Chiaohih Chang Ferry Butar Butar Abstrat It is said that a welldesigned survey an best prevent nonresponse. However, no matter
More informationStatic Fairness Criteria in Telecommunications
Teknillinen Korkeakoulu ERIKOISTYÖ Teknillisen fysiikan koulutusohjelma 92002 Mat208 Sovelletun matematiikan erikoistyöt Stati Fairness Criteria in Teleommuniations Vesa Timonen, email: vesatimonen@hutfi
More informationChapter 1 Microeconomics of Consumer Theory
Chapter 1 Miroeonomis of Consumer Theory The two broad ategories of deisionmakers in an eonomy are onsumers and firms. Eah individual in eah of these groups makes its deisions in order to ahieve some
More informationHierarchical Clustering and Sampling Techniques for Network Monitoring
S. Sindhuja Hierarhial Clustering and Sampling Tehniques for etwork Monitoring S. Sindhuja ME ABSTRACT: etwork monitoring appliations are used to monitor network traffi flows. Clustering tehniques are
More informationExponential Maps and Symmetric Transformations in ClusterSpin. YouGang Feng
Exponential Maps and Symmetri Transformations in ClusterSpin System for Lattie Ising Models YouGang Feng Department of Basi Sienes, College of Siene, Guizhou University, Caijia Guan, Guiyang, 550003
More informationRestricted Least Squares, Hypothesis Testing, and Prediction in the Classical Linear Regression Model
Restrited Least Squares, Hypothesis Testing, and Predition in the Classial Linear Regression Model A. Introdution and assumptions The lassial linear regression model an be written as (1) or (2) where xt
More informationExploiting Relative Addressing and Virtual Overlays in Ad Hoc Networks with Bandwidth and Processing Constraints
Exploiting Relative Addressing and Virtual Overlays in Ad Ho Networks with Bandwidth and Proessing Constraints Maro Aurélio Spohn Computer Siene Department University of California at Santa Cruz Santa
More informationChapter 6 A N ovel Solution Of Linear Congruenes Proeedings NCUR IX. (1995), Vol. II, pp. 708{712 Jerey F. Gold Department of Mathematis, Department of Physis University of Utah Salt Lake City, Utah 84112
More informationA ContextAware Preference Database System
J. PERVASIVE COMPUT. & COMM. (), MARCH 005. TROUBADOR PUBLISHING LTD) A ContextAware Preferene Database System Kostas Stefanidis Department of Computer Siene, University of Ioannina,, kstef@s.uoi.gr Evaggelia
More informationTaylor s Formula G. B. Folland
Taylor s Formula G. B. Folland There s a lot more to be said about Taylor s formula than the brief disussion on pp.113 4 of Apostol. Let me begin with a few definitions. Definitions. A funtion f defined
More informationIntelligent Measurement Processes in 3D Optical Metrology: Producing More Accurate Point Clouds
Intelligent Measurement Proesses in 3D Optial Metrology: Produing More Aurate Point Clouds Charles Mony, Ph.D. 1 President Creaform in. mony@reaform3d.om Daniel Brown, Eng. 1 Produt Manager Creaform in.
More informationSLAbased Resource Allocation for Software as a Service Provider (SaaS) in Cloud Computing Environments
2 th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing SLAbased Resoure Alloation for Software as a Servie Provider (SaaS) in Cloud Computing Environments Linlin Wu, Saurabh Kumar
More informationRecovering Articulated Motion with a Hierarchical Factorization Method
Reovering Artiulated Motion with a Hierarhial Fatorization Method Hanning Zhou and Thomas S Huang University of Illinois at UrbanaChampaign, 405 North Mathews Avenue, Urbana, IL 680, USA {hzhou, huang}@ifpuiuedu
More informationWORKFLOW CONTROLFLOW PATTERNS A Revised View
WORKFLOW CONTROLFLOW PATTERNS A Revised View Nik Russell 1, Arthur H.M. ter Hofstede 1, 1 BPM Group, Queensland University of Tehnology GPO Box 2434, Brisbane QLD 4001, Australia {n.russell,a.terhofstede}@qut.edu.au
More informationPath Planning of Automated Optical Inspection Machines for PCB Assembly Systems
96 International Journal TaeHyoung of Control, Park, Automation, HwaJung Kim, and Systems, and Nam vol. Kim 4, no., pp. 9604, February 2006 Path Planning of Automated Optial Inspetion Mahines for PCB
More informationi_~f e 1 then e 2 else e 3
A PROCEDURE MECHANISM FOR BACKTRACK PROGRAMMING* David R. HANSON + Department o Computer Siene, The University of Arizona Tuson, Arizona 85721 One of the diffiulties in using nondeterministi algorithms
More informationSequences CheatSheet
Sequenes CheatSheet Intro This heatsheet ontains everything you should know about real sequenes. It s not meant to be exhaustive, but it ontains more material than the textbook. Definitions and properties
More informationOpen and Extensible Business Process Simulator
UNIVERSITY OF TARTU FACULTY OF MATHEMATICS AND COMPUTER SCIENCE Institute of Computer Siene Karl Blum Open and Extensible Business Proess Simulator Master Thesis (30 EAP) Supervisors: Luiano GaríaBañuelos,
More informationImproved SOMBased HighDimensional Data Visualization Algorithm
Computer and Information Siene; Vol. 5, No. 4; 2012 ISSN 19138989 EISSN 19138997 Published by Canadian Center of Siene and Eduation Improved SOMBased HighDimensional Data Visualization Algorithm Wang
More informationFIRE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínezde Dios, Luis Merino and Aníbal Ollero
FE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínezde Dios, Luis Merino and Aníbal Ollero Robotis, Computer Vision and Intelligent Control Group. University
More informationAn Enhanced Critical Path Method for Multiple Resource Constraints
An Enhaned Critial Path Method for Multiple Resoure Constraints ChangPin Lin, HungLin Tai, and ShihYan Hu Abstrat Traditional Critial Path Method onsiders only logial dependenies between related ativities
More informationSupply chain coordination; A Game Theory approach
aepted for publiation in the journal "Engineering Appliations of Artifiial Intelligene" 2008 upply hain oordination; A Game Theory approah JeanClaude Hennet x and Yasemin Arda xx x LI CNRUMR 668 Université
More informationSymmetric Subgame Perfect Equilibria in Resource Allocation
Proeedings of the TwentySixth AAAI Conferene on Artifiial Intelligene Symmetri Subgame Perfet Equilibria in Resoure Alloation Ludek Cigler Eole Polytehnique Fédérale de Lausanne Artifiial Intelligene
More information3 Game Theory: Basic Concepts
3 Game Theory: Basi Conepts Eah disipline of the soial sienes rules omfortably ithin its on hosen domain: : : so long as it stays largely oblivious of the others. Edard O. Wilson (1998):191 3.1 and and
More informationGranular Problem Solving and Software Engineering
Granular Problem Solving and Software Engineering Haibin Zhu, Senior Member, IEEE Department of Computer Siene and Mathematis, Nipissing University, 100 College Drive, North Bay, Ontario, P1B 8L7, Canada
More informationPattern Recognition Techniques in Microarray Data Analysis
Pattern Reognition Tehniques in Miroarray Data Analysis Miao Li, Biao Wang, Zohreh Momeni, and Faramarz Valafar Department of Computer Siene San Diego State University San Diego, California, USA faramarz@sienes.sdsu.edu
More informationOutline. Planning. Search vs. Planning. Search vs. Planning Cont d. Search vs. planning. STRIPS operators Partialorder planning.
Outline Searh vs. planning Planning STRIPS operators Partialorder planning Chapter 11 Artifiial Intelligene, lp4 2005/06, Reiner Hähnle, partly based on AIMA Slides Stuart Russell and Peter Norvig, 1998
More informationProgramming Basics  FORTRAN 77 http://www.physics.nau.edu/~bowman/phy520/f77tutor/tutorial_77.html
CWCS Workshop May 2005 Programming Basis  FORTRAN 77 http://www.physis.nau.edu/~bowman/phy520/f77tutor/tutorial_77.html Program Organization A FORTRAN program is just a sequene of lines of plain text.
More informationParametric model of IPnetworks in the form of colored Petri net
Parametri model of IPnetworks in the form of olored Petri net Shmeleva T.R. Abstrat A parametri model of IPnetworks in the form of olored Petri net was developed; it onsists of a fixed number of Petri
More informationTheory of linear elasticity. I assume you have learned the elements of linear
Physial Metallurgy Frature mehanis leture 1 In the next two letures (Ot.16, Ot.18), we will disuss some basis of frature mehanis using ontinuum theories. The method of ontinuum mehanis is to view a solid
More informationSpecial Relativity and Linear Algebra
peial Relativity and Linear Algebra Corey Adams May 7, Introdution Before Einstein s publiation in 95 of his theory of speial relativity, the mathematial manipulations that were a produt of his theory
More informationSoftware Ecosystems: From Software Product Management to Software Platform Management
Software Eosystems: From Software Produt Management to Software Platform Management Slinger Jansen, Stef Peeters, and Sjaak Brinkkemper Department of Information and Computing Sienes Utreht University,
More informationClassical Electromagnetic Doppler Effect Redefined. Copyright 2014 Joseph A. Rybczyk
Classial Eletromagneti Doppler Effet Redefined Copyright 04 Joseph A. Rybzyk Abstrat The lassial Doppler Effet formula for eletromagneti waves is redefined to agree with the fundamental sientifi priniples
More informationDeadlinebased Escalation in ProcessAware Information Systems
Deadlinebased Esalation in ProessAware Information Systems Wil M.P. van der Aalst 1,2, Mihael Rosemann 2, Marlon Dumas 2 1 Department of Tehnology Management Eindhoven University of Tehnology, The Netherlands
More informationprotection p1ann1ng report
f1re~~ protetion p1ann1ng report BUILDING CONSTRUCTION INFORMATION FROM THE CONCRETE AND MASONRY INDUSTRIES Signifiane of Fire Ratings for Building Constrution NO. 3 OF A SERIES The use of fireresistive
More informationTrigonometry & Pythagoras Theorem
Trigonometry & Pythagoras Theorem Mathematis Skills Guide This is one of a series of guides designed to help you inrease your onfidene in handling Mathematis. This guide ontains oth theory and exerises
More informationA Comparison of Service Quality between Private and Public Hospitals in Thailand
International Journal of Business and Soial Siene Vol. 4 No. 11; September 2013 A Comparison of Servie Quality between Private and Hospitals in Thailand Khanhitpol Yousapronpaiboon, D.B.A. Assistant Professor
More informationChemical Equilibrium. Chemical Equilibrium. Chemical Equilibrium. Chemical Equilibriu m. Chapter 14
Chapter 14 Chemial Equilibrium Chemial Equilibriu m Muh like water in a Ushaped tube, there is onstant mixing bak and forth through the lower portion of the tube. reatants produts It s as if the forward
More informationModeling the Constraints of Human Hand Motion
Modeling the Constraints of Human Hand Motion John Lin, Ying Wu, Thomas S. Huang Bekman Institute University of Illinois at UrbanaChampaign Urbana, IL 68 {jylin, yingwu, huang}@ifp.uiu.edu Abstrat Hand
More informationChapter 5 Single Phase Systems
Chapter 5 Single Phase Systems Chemial engineering alulations rely heavily on the availability of physial properties of materials. There are three ommon methods used to find these properties. These inlude
More informationRobust Classification and Tracking of Vehicles in Traffic Video Streams
Proeedings of the IEEE ITSC 2006 2006 IEEE Intelligent Transportation Systems Conferene Toronto, Canada, September 1720, 2006 TC1.4 Robust Classifiation and Traking of Vehiles in Traffi Video Streams
More informationHenley Business School at Univ of Reading. PreExperience Postgraduate Programmes Chartered Institute of Personnel and Development (CIPD)
MS in International Human Resoure Management For students entering in 2012/3 Awarding Institution: Teahing Institution: Relevant QAA subjet Benhmarking group(s): Faulty: Programme length: Date of speifiation:
More informationModified theoretical stagedischarge relation for circular sharpcrested weirs
Water Siene and Engineering, 2012, 5(1): 2633 doi:10.3882/j.issn.16742370.2012.01.003 http://www.waterjournal.n email: wse2008@vip.163.om Modified theoretial stagedisharge relation for irular sharprested
More informationFOOD FOR THOUGHT Topical Insights from our Subject Matter Experts
FOOD FOR THOUGHT Topial Insights from our Sujet Matter Experts DEGREE OF DIFFERENCE TESTING: AN ALTERNATIVE TO TRADITIONAL APPROACHES The NFL White Paper Series Volume 14, June 2014 Overview Differene
More informationTELECOMMUNICATION SYSTEMS AND TECHNOLOGIES Vol. I  Analog and Digital Transmission of Data  Simon Haykin ANALOG AND DIGITAL TRANSMISSION OF DATA
ANALOG AND DIGITAL TRANSMISSION OF DATA Simon MMaster University, Canada Keywords: Modulation and demodulation, Coherent detetion, Amplitude modulation, Double sidebandsuppressed arrier modulation, Single
More informationA schedulebased Transit Assignment Model addressing the Passengers Choice among competing Connections
Veröffentlihung / Publiation A shedulebased Transit Assignment Model addressing the Passengers Choie among ompeting Connetions Autoren / Authors: Markus Friedrih PTV AG, Karlsruhe Steffen Wekek PTV AG,
More informationJEFFREY ALLAN ROBBINS. Bachelor of Science. Blacksburg, Virginia
A PROGRAM FOR SOLUtiON OF LARGE SCALE VEHICLE ROUTING PROBLEMS By JEFFREY ALLAN ROBBINS Bahelor of Siene Virginia Polytehni Institute and State University Blaksburg, Virginia 1974 II Submitted to the Faulty
More informationImpact Simulation of Extreme Wind Generated Missiles on Radioactive Waste Storage Facilities
Impat Simulation of Extreme Wind Generated issiles on Radioative Waste Storage Failities G. Barbella Sogin S.p.A. Via Torino 6 00184 Rome (Italy), barbella@sogin.it Abstrat: The strutural design of temporary
More informationTHICKNESS MEASURING OF NICKEL COATINGS ON STEELS WITH VARIOUS MAGNETIC PROPERTIES
THICKNESS MEASURING OF NICKEL COATINGS ON STEELS WITH VARIOUS MAGNETIC PROPERTIES A. A. Lukhvih, O. V. Bulatov, A. L. Lukyanov, and A. A. Polonevih Institute of Applied Physis of the National Aademy of
More informationA Keyword Filters Method for Spam via Maximum Independent Sets
Vol. 7, No. 3, May, 213 A Keyword Filters Method for Spam via Maximum Independent Sets HaiLong Wang 1, FanJun Meng 1, HaiPeng Jia 2, JinHong Cheng 3 and Jiong Xie 3 1 Inner Mongolia Normal University 2
More informationRecommending Questions Using the MDLbased Tree Cut Model
WWW 2008 / Refereed Trak: Data Mining  Learning April 225, 2008 Beijing, China Reommending Questions Using the MDLbased Tree Cut Model Yunbo Cao,2, Huizhong Duan, ChinYew Lin 2, Yong Yu, and HsiaoWuen
More informationTRENDS IN EXECUTIVE EDUCATION: TOWARDS A SYSTEMS APPROACH TO EXECUTIVE DEVELOPMENT PLANNING
INTERMAN 7 TRENDS IN EXECUTIVE EDUCATION: TOWARDS A SYSTEMS APPROACH TO EXECUTIVE DEVELOPMENT PLANNING by Douglas A. Ready, Albert A. Viere and Alan F. White RECEIVED 2 7 MAY 1393 International Labour
More informationchapter > Make the Connection Factoring CHAPTER 4 OUTLINE Chapter 4 :: Pretest 374
CHAPTER hapter 4 > Make the Connetion 4 INTRODUCTION Developing seret odes is big business beause of the widespread use of omputers and the Internet. Corporations all over the world sell enryption systems
More informationPolynomials INTRODUCTION CHAPTER 3 OUTLINE. Chapter 3 :: Prerequisite Test 182. Exponents and Polynomials 183
bar92103_h03_a_181219.qxd 9/19/09 12:03 PM Page 181 C H A P T E R hapter The MGrawHill Companies. All Rights Reserved. The Streeter/Huthison Series in Mathematis Beginning Algebra 3 > Make the Connetion
More informationDynamic and Competitive Effects of Direct Mailings
Dynami and Competitive Effets of Diret Mailings Merel van Diepen, Bas Donkers and Philip Hans Franses ERIM REPORT SERIES RESEARCH IN MANAGEMENT ERIM Report Series referene number ERS2006050MKT Publiation
More informationImproved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules
Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu
More informationCapacity at Unsignalized TwoStage Priority Intersections
Capaity at Unsignalized TwoStage Priority Intersetions by Werner Brilon and Ning Wu Abstrat The subjet of this paper is the apaity of minorstreet traffi movements aross major divided fourlane roadways
More informationTrade Information, Not Spectrum: A Novel TV White Space Information Market Model
Trade Information, Not Spetrum: A Novel TV White Spae Information Market Model Yuan Luo, Lin Gao, and Jianwei Huang 1 Abstrat In this paper, we propose a novel information market for TV white spae networks,
More informationAn Efficient Network Traffic Classification Based on Unknown and Anomaly Flow Detection Mechanism
An Effiient Network Traffi Classifiation Based on Unknown and Anomaly Flow Detetion Mehanism G.Suganya.M.s.,B.Ed 1 1 Mphil.Sholar, Department of Computer Siene, KG College of Arts and Siene,Coimbatore.
More informationThe Application of Mamdani Fuzzy Model for Auto Zoom Function of a Digital Camera
(IJCSIS) International Journal of Computer Siene and Information Seurity, Vol. 6, No. 3, 2009 The Appliation of Mamdani Fuzzy Model for Auto Funtion of a Digital Camera * I. Elamvazuthi, P. Vasant Universiti
More informationNeural networkbased Load Balancing and Reactive Power Control by Static VAR Compensator
nternational Journal of Computer and Eletrial Engineering, Vol. 1, No. 1, April 2009 Neural networkbased Load Balaning and Reative Power Control by Stati VAR Compensator smail K. Said and Marouf Pirouti
More informationInterpretable Fuzzy Modeling using MultiObjective Immune Inspired Optimization Algorithms
Interpretable Fuzzy Modeling using MultiObjetive Immune Inspired Optimization Algorithms Jun Chen, Mahdi Mahfouf Abstrat In this paper, an immune inspired multiobjetive fuzzy modeling (IMOFM) mehanism
More informationFrom a strategic view to an engineering view in a digital enterprise
Digital Enterprise Design & Management 2013 February 1112, 2013 Paris From a strategi view to an engineering view in a digital enterprise The ase of a multiountry Telo Hervé Paault Orange Abstrat In
More informationBehavior AnalysisBased Learning Framework for Host Level Intrusion Detection
Behavior AnalysisBased Learning Framework for Host Level Intrusion Detetion Haiyan Qiao, Jianfeng Peng, Chuan Feng, Jerzy W. Rozenblit Eletrial and Computer Engineering Department University of Arizona
More informationGrey Critical Chain Project Scheduling Technique and Its Application
Canadian Soial Siene Vol.3 No.3 June 2007 Grey Critial Chain Projet Sheduling Tehnique and Its ppliation TECHNIQUE DE PROGRMMTION DE L CHINE CRITIQUE GRISE DU PROJET ET SON PPLICTION Gao Peng 1 Feng Junwen
More informationAgentBased Grid Load Balancing Using PerformanceDriven Task Scheduling
AgentBased Grid Load Balaning Using PerformaneDriven Task Sheduling Junwei Cao *1, Daniel P. Spooner, Stephen A. Jarvis, Subhash Saini and Graham R. Nudd * C&C Researh Laboratories, NEC Europe Ltd.,
More information5. Hypothesis Tests About the Mean of a Normal Population When σ 2 is Not Known
Statistial Inferene II: he Priniples of Interval Estimation and Hypothesis esting 5. Hypothesis ests About the Mean of a Normal Population When σ is Not Known In Setion 3 we used the tdistribution as
More information) ( )( ) ( ) ( )( ) ( ) ( ) (1)
OPEN CHANNEL FLOW Open hannel flow is haraterized by a surfae in ontat with a gas phase, allowing the fluid to take on shapes and undergo behavior that is impossible in a pipe or other filled onduit. Examples
More informationCONDITIONAL PROBABILITY (continued) ODDS RATIO ( ) P( H ) Provides nformation on how much more likely that an event A occurs than that it does not.
CONDITIONAL PROBABILITY (ontinued) ODDS RATIO Def: The odds ratio of an event A is defined by 1 Provides nformation on how muh more likely that an event A ours than that it does not. Its value an hange
More informationarxiv:astroph/0304006v2 10 Jun 2003 Theory Group, MS 50A5101 Lawrence Berkeley National Laboratory One Cyclotron Road Berkeley, CA 94720 USA
LBNL52402 Marh 2003 On the Speed of Gravity and the v/ Corretions to the Shapiro Time Delay Stuart Samuel 1 arxiv:astroph/0304006v2 10 Jun 2003 Theory Group, MS 50A5101 Lawrene Berkeley National Laboratory
More informationCustomer Efficiency, Channel Usage and Firm Performance in Retail Banking
Customer Effiieny, Channel Usage and Firm Performane in Retail Banking Mei Xue Operations and Strategi Management Department The Wallae E. Carroll Shool of Management Boston College 350 Fulton Hall, 140
More informationRole of the Reference Frame in Angular Photon Distribution at ElectronPositron Annihilation
Journal of Modern Physis,, 5, 353358 Published Online April in SiRes. http://www.sirp.org/journal/jmp http://dx.doi.org/.36/jmp..565 Role of the Referene Frame in Angular Photon Distribution at EletronPositron
More information10.1 The Lorentz force law
Sott Hughes 10 Marh 2005 Massahusetts Institute of Tehnology Department of Physis 8.022 Spring 2004 Leture 10: Magneti fore; Magneti fields; Ampere s law 10.1 The Lorentz fore law Until now, we have been
More informationLearning Curves and Stochastic Models for Pricing and Provisioning Cloud Computing Services
T Learning Curves and Stohasti Models for Priing and Provisioning Cloud Computing Servies Amit Gera, Cathy H. Xia Dept. of Integrated Systems Engineering Ohio State University, Columbus, OH 4310 {gera.,
More informationCA PPM 14.x Business Analyst Certification Exam (CAT242) Study Guide Version 1.2
CA PPM 14.x Business Analyst Certifiation Exam (CAT242) Study Guide Version 1.2 Certifiation Exam (CAT242) PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary
More informationUnit 12: Installing, Configuring and Administering Microsoft Server
Unit 12: Installing, Configuring and Administering Mirosoft Server Learning Outomes A andidate following a programme of learning leading to this unit will be able to: Selet a suitable NOS to install for
More informationpss Comparison of AlGaN/GaN MISHEMT powerbar designs solidi status physica
Phys. Status Solidi C 11, No. 3 4, 906 910 (2014) / DOI 10.1002/pss.201300490 Comparison of AlGaN/GaN MISHEMT powerbar designs physia pss www.pss.om urrent topis in solid state physis Steve Stoffels *,
More informationA Survey of Usability Evaluation in Virtual Environments: Classi cation and Comparison of Methods
Doug A. Bowman bowman@vt.edu Department of Computer Siene Virginia Teh Joseph L. Gabbard Deborah Hix [ jgabbard, hix]@vt.edu Systems Researh Center Virginia Teh A Survey of Usability Evaluation in Virtual
More informationUNIVERSITY AND WORKSTUDY EMPLOYERS WEB SITE USER S GUIDE
UNIVERSITY AND WORKSTUDY EMPLOYERS WEB SITE USER S GUIDE September 8, 2009 Table of Contents 1 Home 2 University 3 Your 4 Add 5 Managing 6 How 7 Viewing 8 Closing 9 Reposting Page 1 and WorkStudy Employers
More informationComputational Analysis of Two Arrangements of a Central GroundSource Heat Pump System for Residential Buildings
Computational Analysis of Two Arrangements of a Central GroundSoure Heat Pump System for Residential Buildings Abstrat Ehab Foda, Ala Hasan, Kai Sirén Helsinki University of Tehnology, HVAC Tehnology,
More informationBoard Building Recruiting and Developing Effective Board Members for NotforProfit Organizations
Board Development Board Building Reruiting and Developing Effetive Board Members for NotforProfit Organizations Board Development Board Building Reruiting and Developing Effetive Board Members for NotforProfit
More informationSet Theory and Logic: Fundamental Concepts (Notes by Dr. J. Santos)
A.1 Set Theory and Logi: Fundamental Conepts (Notes by Dr. J. Santos) A.1. Primitive Conepts. In mathematis, the notion of a set is a primitive notion. That is, we admit, as a starting point, the existene
More informationHenley Business School at Univ of Reading. Chartered Institute of Personnel and Development (CIPD)
MS in International Human Resoure Management (fulltime) For students entering in 2015/6 Awarding Institution: Teahing Institution: Relevant QAA subjet Benhmarking group(s): Faulty: Programme length: Date
More informationA ThreeHybrid Treatment Method of the Compressor's Characteristic Line in Performance Prediction of Power Systems
A ThreeHybrid Treatment Method of the Compressor's Charateristi Line in Performane Predition of Power Systems A ThreeHybrid Treatment Method of the Compressor's Charateristi Line in Performane Predition
More informationCooperative Search and Nogood Recording
Cooperative Searh and Nogood Reording Cyril Terrioux LSS  Equipe NCA (LM) 39 rue JoliotCurie F1343 Marseille Cedex 13 (Frane) email: terrioux@limunivmrsfr Abstrat Within the framework of onstraint
More informationOn the Characteristics of SpectrumAgile Communication Networks
1 On the Charateristis of SpetrumAgile Communiation Networks Xin Liu Wei Wang Department of Computer Siene University of California, Davis, CA 95616 Email:{liu,wangw}@s.udavis.edu Abstrat Preliminary
More informationPredictive Model Evaluation for PHM
Preditive Model Evaluation for PHM Chunsheng Yang 1, Yanni Zou 2, Jie Liu 3, Kyle R Mulligan 4 1 National Researh Counil Canada, Ottawa, Ontario K1A 0R6, Canada Chunsheng.Yang@nr.g.a 2 Jiujiang University,
More informationPerformance Analysis of IEEE 802.11 in Multihop Wireless Networks
Performane Analysis of IEEE 80.11 in Multihop Wireless Networks Lan Tien Nguyen 1, Razvan Beuran,1, Yoihi Shinoda 1, 1 Japan Advaned Institute of Siene and Tehnology, 11 Asahidai, Nomi, Ishikawa, 9319
More informationDesign of Power Dividers using Defected Microstrip Structure and an Analytically Calculated Characteristic Line Impedance
, pp.20 http://dx.doi.org/10.14257/ija.2014.7.2.02 Design of Power Dividers using Defeted Mirostrip Struture and an Analytially Calulated Charateristi Line Impedane Jongsik Lim Department of Eletrial
More informationSTRATEGIC DESIGN FOR THE SUPPLY NETWORK OF MULTISITE ENTERPRISES: A MATHEMATICAL MODEL AND SOLVING APPROACHES
STRATEGIC DESIGN FOR THE SUPPLY NETWORK OF MULTISITE ENTERPRISES: A MATHEMATICAL MODEL AND SOLVING APPROACHES Florene Pirard 1, Fouad Riane 2, Serguei Iassinovski 2, Valérie BottaGenoulaz 1 1 Laboratoire
More informationDiscovering Trends in Large Datasets Using Neural Networks
Disovering Trends in Large Datasets Using Neural Networks Khosrow Kaikhah, Ph.D. and Sandesh Doddameti Department of Computer Siene Texas State University San Maros, Texas 78666 Abstrat. A novel knowledge
More informationTECHNOLOGYENHANCED LEARNING FOR MUSIC WITH IMAESTRO FRAMEWORK AND TOOLS
TECHNOLOGYENHANCED LEARNING FOR MUSIC WITH IMAESTRO FRAMEWORK AND TOOLS ICSRiM  University of Leeds Shool of Computing & Shool of Musi Leeds LS2 9JT, UK +441133432583 kia@imaestro.org www.imaestro.org,
More information1.3 Complex Numbers; Quadratic Equations in the Complex Number System*
04 CHAPTER Equations and Inequalities Explaining Conepts: Disussion and Writing 7. Whih of the following pairs of equations are equivalent? Explain. x 2 9; x 3 (b) x 29; x 3 () x  2x  22 x  2 2 ; x
More informationTHE UNIVERSITY OF TEXAS AT ARLINGTON COLLEGE OF NURSING. NURS 6390004 Introduction to Genetics and Genomics SYLLABUS
THE UNIVERSITY OF TEXAS AT ARLINGTON COLLEGE OF NURSING NURS 6390004 Introdution to Genetis and Genomis SYLLABUS Summer Interession 2011 Classroom #: TBA and 119 (lab) The University of Texas at Arlington
More information