NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION

Size: px
Start display at page:

Download "NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION"

Transcription

1 NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION Hsiao-Chang Chen Dept. of Systems Engineering University of Pennsyvania Phiadephia, PA , U.S.A. Chun-Hung Chen Dept. of Systems Engineering University of Pennsyvania Phiadephia, PA , U.S.A. Liyi Dai Enver Y ucesan Dept. of Systems Science and Mathematics Washington University St. Louis, MO 6330, U.S.A. ABSTRACT This paper deas with ranking and seection probem via simuation. We present an optima computing budget aocation technique which can seect the best of k simuated designs. This approach can inteigenty determine the best simuation engths for a simuation experiments and significanty reduce the tota computation cost to obtain the same confidence eve. Numerica testing resuts are incuded. Aso we provide the resuts of anaysis for some parameters which affect the performance of our approach. Besides, we compare our method with traditiona two-stage procedures. Numerica resuts show that our approach is much faster than the traditiona two-stage procedures. INTRODUCTION In order to design and efficienty manage arge man-made systems such as communication networks, traffic systems, and automated manufacturing faciities, it is often necessary to appy extensive simuation to study their performance since no cosed-form anaytica soutions exist for such probems. Unfortunatey, simuation can be both expensive and time consuming. Suppose we want to compare k different system designs. We conduct N simuation repications for each of the k designs. Therefore, we need kn simuation repications. The simuation resuts become more accurate as ncreases. If the accuracy requirement is high (s not sma), and if the tota number of designs in a decision probem is not sma (k is arge), then kn can be very arge, which may easiy make tota simuation cost extremey high and precude the feasibiity of simuation approach. The effective reduction of computation costs whie obtaining a good decision is crucia in simuation. INSEAD Technoogy Management Area Fontainebeau, FRANCE Dudewicz and Daa (975) deveop a two-stage procedure for seecting the best design or a design which is very cose to the best design. In the first stage, a designs are simuated with n 0 repications. Based on the resuts obtained from the first stage, the number of additiona simuation repications is determined for each design in the second stage to achieve the desired confidence eve. Rinott (978) presents aternative way to estimate the number of required simuation repications in the second stage. Many researchers have extended this idea to more genera ranking and seection probem in conjunction with new deveopments (Charnes, 99, Matejcik and Neson, 993, Bechhofer, Santner, and Godsman, 995, and Hsu, 996). To further reduce the overa computation cost, Chen (995) formuates the procedures of seecting the best design as another optimization probem. The ideas are as foows. Intuitivey, some inferior designs can be discarded at an eary stage of simuation. As the simuation proceeds, some designs can be further ignored when higher simuation accuracy for the remaining designs is obtained. This procedure is repeated unti a desired confidence eve is achieved. Proceeding in this fashion, itte effort is wasted on simuating inferior designs; the overa simuation time is hence reduced. Then the question is how to systematicay do this? When? And which designs? Ideay, we want to optimay choose the number of simuation repications for a designs to minimize the tota simuation cost, whie obtaining the desired confidence eve. In fact, this question is equivaent to optimay decide which designs wi receive additiona computing budget for continuing simuation or to find an optima way to reach an optima design. Chen et a. (996) provide an approach to sove such an optimization probem. They use Chernoff bounds to estimate the gradient information and then appy steepest

2 Optima Computing Budget Aocation for Discrete Event Simuation 335 descent method to sove this optimization probem. Whie this approach can effectivey sove the optima computing budget aocation probem, the compexity of In this paper, we present another simpe way of estimating gradient information. From numerica resuts we observe that the performance of this new approach is even better than that in Chen et a. (996). Additionay, we compare our approach with the traditiona two-stage procedures by conducting a numerica experiment. Numerica resuts show that our approach is more than ten times faster than the two-stage procedures. Since our approach is based on the Bayesian mode presented in Chen (995), we wi give an overview of that mode for seecting the best design in the next Section. In Section 3, we define the optima computing budget aocation probem and propose a sequentia approach. We aso demonstrate the numerica testing in a simpe exampe. Section 4 discusses two crucia factors, initia simuation ength and one-time incrementa computing budget. Section 5 gives a brief review of traditiona two-stage procedure and compares our method with the two-stage procedure. Section 6 concudes this paper. PROBLEM FORMULATION AND CON- FIDENCE LEVEL QUANTIFICATION Suppose that our goa is to seect a design associated with the smaest mean performance measure among k designs with unknown variances that are not necessariy equa. Further assume that the computing budget is imited and the number of designs is arge. Denote k : the tota number of designs, X ij : the j th i.i.d. sampe of the performance measure from design i, : the number of simuation repications for design i, µ i : the sampe mean for design i, µ i = X ij, N j= i µ i : the mean performance measure; µ i = E(X ij ), σ : the variance for design i. When N s are arge, µ i can be a good approximation for µ i, since, according to the aw of arge numbers, P{µ i µ i }, as. Batch means method (Schmeiser 98) can be used if the simuation sampes from any design are not independent. Given the fact that we can conduct ony a finite number of simuation repications, µ i is simpy an approximation to µ i. Using the approximation resuts to seect the best design we have to access the probabiity of correct seection (without oss of generaity, we consider minimization probems in this paper; thus, the best design means the design with the smaest µ i ). Correct seection can be Chernoff bounds becomes a major obstace to incude some second-order optimization techniques, such as Newton s method, to achieve a faster convergence rate. defined as a design with the smaest sampe performance measure which is actuay the best design. In the remainder of this paper, et CS denote correct seection There exists a arge iterature on seecting the best design. Godsman and Neson (994) provide an exceent survey on current approaches (e.g., Godsman, Neson, and Schmeiser, 99, Gupta and Panchapakesan, 979, and Law and Keton, 99) to estimating simuation confidence eve. In addition, Bechhofer, Santner, and Godsman (995) give a systematic and more detaied discussion on this issue. These approaches are mainy suitabe for probems having a sma number of designs (e.g. Godsman and Neson (994) suggest to 0 designs). However, for rea-ife probems, the number of designs can easiy grow extremey arge. Chen (996) provides an effective way to quantify confidence eve when the number of designs is arge. From Chen (996) we have P{CS} =P{ a design with the smaest sampe mean performance is reay the best design} k = P{ ˆµ b < ˆµ i }= APCS () i= i b where index b designates the design having the smaest sampe mean performance and µ i is the posterior distribution which consists of information from both prior distribution and the sampes {X ij, j =,,..., }. Under the assumption of normaity, ˆµ i ~N( X ij, σ i ) for i =,,...,k. j= We refer to this ower bound of the correct seection probabiity as the Approximate Probabiity of Correct Seection (APCS) Whie P{CS} is very difficut to obtain, APCS can be computed easiy. We wi use APCS to approximate P{CS}. Numerica testing in Chen (996) shows that it can provide reasonaby good approximation. Furthermore, the sensitivity information of the confidence eve with respect to simuation repications can be easiy obtained when the approach in Chen (996) is appied, which provide the basis to determine the aocation of the computing budget in this paper.

3 336 Chen, Chen, Dai, and Yucesan 3 GRADIENT APPROACH FOR OPTIMAL COMPUTING BUDGET ALLOCATION We wish to minimize the tota computation cost whie obtaining a desired confidence eve in seecting the best system out of k competing designs. If simuations are performed on a sequentia computer, the computation cost can be approximated by N +N +L+N k. Ideay we want min( N +N +L+N k ) () s.t. APCS P* where P* is a user-defined confidence eve requirement. Note that N, N,,..., N k are integers and APCS(N, N,..., N k ) can be computed ony after exhausting the tota simuation budget, N +N +L+N k. Soving this probem can be difficut, especiay when k is extremey arge. Since the purpose of soving () is to reduce computation cost with a desired confidence eve, we shoud not spend too much effort soving () during simuation. Otherwise, the additiona cost of soving () wi overwhem the benefits of the computing budget aocation. Hence, we need to sove () very efficienty, even if this means obtaining a sub-optima soution. Efficiency is more crucia than optimaity in this setting. We now present a sequentia approach to determine the number of simuation repications. Before conducting the simuation, there is neither knowedge about APCS nor an idea about how to aocate budget, therefore a designs are simuated with n 0 repications, and the posterior distribution for design i is n 0 N( X ij, σ i ) n j= 0 n 0 We use this statistica information to decide on further aocation. In other words, after running n 0 repications for each design, we have a basic idea about each design and can decide which designs are worthy of being aocated more of the computing budget. Furthermore, et i be the additiona computing budget aocated to design i in each step ( i is a non-negative integer). In order to effectivey aocate the computing budget for further simuation, it is necessary to know how APCS woud be affected if further repication i is added independenty to each design i. Under a Bayesian mode, it is convenient to use the statistica information at to estimate APCS at + i by using an approximated posterior distribution σ i N( X ij, ) for design i N j= i + i We refer this approximation to EAPCS (Estimated Approximate Probabiity of Correct Seection). We assume that i is not arge and is cose to + i ; otherwise EAPCS is not a good estimator for APCS. Note that can be repaced by n 0 for each design when posterior distribution is approximated at n 0 + i. We hope that APCS becomes arger as simuation proceeds; we sequentiay add computing budget by each time unti that APCS achieves a satisfactory eve P *. In order to minimize the tota computation cost, this budget shoud be aocated among designs so as to maximize the EAPCS. Thus, at step, =,,..., max,, k k s.t. i= EAPCS(N i = and +,N N k i + k ) 0 for a i. (3) We assume the system parameter are continuous so that the gradient method (Luenberger 984) is appied to approximatey sove (3). A major issue for using the gradient method is the estimation of gradient information. Chen et a. (996) appy Chernoff bounds to estimate the gradient information and provide an effective soution to (3). However, the compexity of Chernoff bounds becomes a major obstace for appying some second-order optimization techniques, such as Newton s method, to achieve a faster convergence rate. In this paper, finite differencing, we approximate the gradient using a straightforward formua: EAPCS = APCS(N,N,L, + τ,l N k ) APCS(N,N,L, L,N k ) τ where τ is a sma number. To avoid spending too much time in iterativey finding the soution for (3), we ony execute a sma number of iterations (e.g. times) when appying the gradient method. In summary, we have the foowing agorithm: A Sequentia Agorithm for Optima Computing Budget Aocation (OCBA) Step 0. PERFORM SIMULATION with n 0 repication for a designs, 0, N =N =L =N k = n 0. Step. If APCS( N,N,K,N k ) P, stop, otherwise, go to Step.

4 Optima Computing Budget Aocation for Discrete Event Simuation 337 Step. Sove (3), + = + i, for i =,...,k. +. Step 3. PERFORM SIMULATION unti ( N,N,K,N k ); go to Step. Numerica Testing To compare the method provided in this paper with our previous approach (Chen et a. 996), we test a simpe G/G/ queue (k = 0). There is one server with uniformy distributed service times and customer interarriva times are aso distributed uniformy. In this singe-node exampe, a designs have the same arriva time uniformy distributed over [0.,.9], and service time in design i is uniform[0., i], i =,,..., 0. We want to find a design with minimum average system time for customers served in the first 0 time units (terminating simuation). Obviousy, higher service rate resuts in shorter system time in this exampe, therefore, design is the true best design. In the numerica experiment, we compare the computation costs and the actua convergence probabiities P{CS} for different approaches. We set = and n 0 = 0 in this exampe. To avoid spending too much time in soving (3), we ony do two iterations in the gradient method. 0,000 independent experiments are performed so that the average computation cost and P{CS} can be estimated. Different confidence eve requirements are aso tested. Tabe contains the test resuts using a Chernoff bound approach (Chen et a. 996). Tabe shows the resuts using the approach presented in this paper. Tabe. Average tota number of simuation repications and P{CS} by using Chernoff bounds (n 0 = 0 and = ). P* With Chernoff P(CS) Bounds 60% % % % Tabe. Average tota number of simuation repications and P{CS} for OCBA appication (n 0 = 0 and = ). P* With OCBA P(CS) 60% % % % From Tabe and Tabe, we observe that the performances of the two approaches are not much different for sma P * (e.g., 80%). whie the new approach is faster when the confidence eve requirement P * is high (e.g., > 90%). 4 SELECTION FOR n 0 AND To appy our approach, we need to seect the initia simuation repication n 0 and one-time increment of computing budget. These two parameters may affect the performance of our approach. In this section we give recommendations for seecting these two parameters, athough a good choice can be probem-specific. Initia Simuation Repication Number n 0 We test the exampe presented in Section 3 for different vaues of n 0. Figure shows the numerica resuts with respect to different confidence eve requirements P. It is we understood that n 0 can not be too sma; otherwise, the estimates of mean and variance may be very poor, resuting in poor computing budget aocationtion. On the other hand, if n 0 is too arge, we may waste our computation time to reach a confidence eve which is much higher than the desired eve. Intuitivey such an effect is ess significant when P is arge. The computation cost vs. n 0 for different confidence eve requirements is shown in Figure. From Figure, we observe that the computation cost is not sensitive to n 0 when P is greater than 90%. For the cases that P is ess than 80%, which is not common in rea-ife appications, a good choice for n 0 is a number between 0 and 0 based on our empirica experiences. One-time Incrementa Computing Budget Again, the seection of is probem-specific. Generay speaking, arge may resut in wasting computation time to obtain an unnecessariy high confidence eve. On the other hand, if is too sma, we need to sove the budget aocation probem many times, diuting the benefit of this approach. We test the same exampe for different seections of. To have a fair comparison, instead of comparing the simuation repication numbers, we compare tota CPU time, which consists of simuation time (the CPU time for simuation ony) and optimization time (the CPU time to sove budget aocation by appying the gradient method). Figure shows the numerica resuts with respect to P = 80%. The optimization time for arge is much smaer than that for sma. Conversey, the simuation time for arge is arger than that for sma. We observe that a good seection of for a 0-designs probem is a number between 5 and 30 based on our empirica experiences.

5 338 Chen, Chen, Dai, and Yucesan 5 COMPARISON WITH OTHER METHODS In this section we compare our approach with two-stage procedures given by Dudewicz and Daa (975) and Rinott (977) by using the exampe presented in Section 3. Unike our Bayesian approach, these two-stage procedures are deveoped based on cassic statistica mode. It is convenient to et (),...,(k) denote the unknown indices such that µ () µ () L µ (k) The goa in two-stage procedures is the same as ours: to seect a design with the smaest mean, µ (). Based on the indifference-zone idea we may be wiing to choose design () if µ () and µ () are very cose (e.g. µ () µ () d, where d is the indifference-zone). By doing so, the procedure can avoid making a arge number of simuation repications to separate sma difference. More specificay, we intend to determine the number of simuation repications to ensure P{µ () < µ (i), i µ (i) µ () d } P The procedure is as foows. Before performing the simuation we specify three parameters: the confidence eve requirement P, the simuation repication in the first stage n 0, and indifference zone d. Let h sove Rinott's or Dudewicz s integra given P, n 0, and k (h can aso be found from the tabes in Wicox (984) for Rinott s procedure, and those in Gibbons (977) for Dudewicz s procedure). In the first stage, a designs are simuated with n 0 repications. Based on the resuting variance estimate obtained from the first stage, we determine how many additiona simuation repications for each design shoud be conducted in the second stage in order to reach the desired confidence eve: =max(n 0, (hs i /d * ) ), for i =,,, k. where is the integer round-up function. Bigger d means arger indifference zone, resuting in ower simuation cost. In our previous testing, we are interested in finding the design with smaest mean µ (). To have a fair comparison, d can not be greater than µ () µ () which is around 0.059, estimated by using simuation. Two confidence eves P = 0.9, 0.95 and initia sampe repication n 0 = 0 and n 0 = 0 have been tested. In these tests, we have iterations in each sequentia optimization step when using OCBA to sove (3) soved. For the case of OCBA we appy one-time incrementa computing budget =. When appying Rinott s and Dudewicz s procedures, we set the indifference zone d = ( µ () µ () 0.059). In both cases 0,000 independent experiments are run to evauate the computationa efficiency and to estimate the actua convergence probabiities P{CS}. The computation cost and P{CS} are given in Tabe 3 and Tabe 4 corresponding to n 0 = 0 and n 0 = 0, respectivey. From Tabe 3, significant speedup is observed for our method over both two-stage procedures, whie the actua convergence probabiities for a approaches are no ess than the desired eves. The average speedup is approximatey 3.74 times and.48 times over the Rinott s and Dudewicz s procedures, respectivey, when P = 95% and n 0 = 0. Figures 3 and 4 show the average for a i over the 0,000 experiments using our approach and Rinott s procedure respectivey (P = 90% and n 0 = 0). From these two figures, we observe that the budget aocation using our approach is quite different from that using Rinott s procedure. Two-stage procedures determine the number of simuation repications for a designs using ony the information of sampe variances. The information on their sampe means is not utiized. On the other hand, our approach expoits the information of both sampe means and variances, achieving much faster performance. Tabe 3. Average tota number of simuation runs and the probabiity of correct seection as n 0 = 0. n 0 = 0 P*=90% P(CS) P*=95% P(CS) OCBA Dudewicz's Speedup Rinott s Speedup Tabe 4. Average tota number of simuation runs and the probabiity of correct seection as n 0 = 0. n 0 = 0 P*=90% P(CS) P*=95% P (CS) OCBA Dudewicz's Speedup.5.48 Rinott s Speedup

6 Optima Computing Budget Aocation for Discrete Event Simuation CONCLUDING REMARKS In this paper we present an optima computing budget aocation technique that can seect the best of k simuated designs. We aso compare our approach with traditiona two-stage procedures by conducting a numerica experiment. Preiminary numerica testing shows that our approach is more than ten times faster than two-stage procedures. Further testing and anaysis of our approach is under way. Aso the deveopment of a more efficient budget aocation technique which utiizes methods with higher convergence rate, ike Newton s method, is one of our research topics. Average tota simuation repications The initia simuation repication number 60% 80% 90% 95% Figure. Average tota simuation repications vs. n 0 for different P as OCBA appied ( iterations). The resuts are based on an average over 0,000 repicates ( =). Seconds The one-time incrementa computing budget Tota cpu time Simuation Optimization Figure. The tota CPU time vs. for P =80% and n 0 = 0 when OCBA is appied ( iterations) based on an average over 0,000 repicates (tota CPU time = simuation time + optimization time). The resuts are

7 340 Chen, Chen, Dai, and Yucesan Designs Average simuation repications Figure 3. Computing budget aocation are determined by OCBA when P = 0.90, and n 0 =0 (system is the best design). 9 Designs Average simuaion repications Figure 4. Computing budget aocation determined by in Rinott s procedure when P =0.90, and n 0 =0 (design is the best design). ACKNOWLEDGMENTS This work was supported in part by the Nationa Science Foundation under grant No. ECS REFERENCES Bechofer R. E., Santner, T. J., and Godsman, D. M Design and Anaysis of Experiments for Statistica Seection, Screening, and Mutipe Comparisons. John Wiey & Sons, Inc.

8 Optima Computing Budget Aocation for Discrete Event Simuation 34 Charnes, J. M. 99. Mutivariate Simuation Output Anaysis. Proceedings of the 99 Winter Simuation Confidence, Chen, C. H An Effective Approach to Smarty Aocate Computing Budget for Discrete Event Simuation. Proceedings of the 34th IEEE Conference on Decision and Contro, Chen, C. H A Lower Bound for the Correct Subset-Seection Probabiity and Its Appication to Discrete Event System Simuations. IEEE Transactions on Automatic Contro., Vo. 4, No. 8, 7-3. Chen, C. H., Chen, H. C., and Dai, L A Gradient Approach for Smarty Aocating Computing Budget for Discrete Event Simuation. Proceedings of the 996 Winter Simuation Conference, Dudewicz, E. J. and Daa, S. R Aocation of Observations in Ranking and Seection with Unequa Variances. Sankhya, B37:8-78. Gibbons, J. D., Okin, I., and Sobe, M Seecting and Ordering Popuations: A New Statistica Methodoogy. John Wiey & Sons, Inc. Godsman, G., B. L. Neson, and B. Schmeiser. 99. Methods for Seecting the Best System. Proceedings of the 99 Winter Simuation Conference, Godsman, G., and B. L. Neson Ranking, Seection, and Mutipe Comparison in Computer Simuation. Proceedings of the 994 Winter Simuation Conference, Hsu, J. C Mutipe Comparisons Theory and Methods. Chapman & Ha. Gupta, S. S. and S. Panchapakesan Mutipe Decision Procedures: Theory and Methodoogy of Seecting and Ranking Popuations. John Wiey. Law, A. M. and W. D. Keton. 99. Simuation Modeing & Anaysis. McGraw-Hi, Inc. Luenberger, D. G., 984. Linear and Noninear Programming. Addison-Wesey. Matejcik, F. J. and Neson, B. L. 99. Simutaneous Ranking, Seection and Mutipe Comparisons for Simuation. Proceeding of the 993 Winter Simuation Confidence, Rinott, Y On Two-stage Seection Procedures and Reated Probabiity Inequaities. Communications in Statistics A7, Schmeiser, B. 98. Batch Size Effects in the Anaysis of Simuation Output. Operations Research, Vo. 30, No. 3,, Wicox, R. R A Tabe For Rinott s Seection Procedure. Journa of Quaity Technoogy, Vo. 6, No., AUTHOR BIOGRAPHIES HSIAO-CHANG CHEs a Ph.D. candidate at the Systems Engineering Department, University of Pennsyvania. He received a doube B.S. degree in Mathematics and Computer Science from the Eastern Michigan University in 99, and he received an M.S. degree in Systems Science and Mathematics from Washington University, St. Louis in 994. He is working on deveoping efficient approaches for discrete event simuation. CHUN-HUNG CHEs an Assistant Professor of Systems Engineering at the University of Pennsyvania, Phiadephia, PA. He received his Ph.D. degree in Simuation and Decision from Harvard University in 994. His research interests cover a wide range of areas in Monte Caro simuation, optima contro, stochastic decision processes, ordina optimization, perturbation anaysis, and their appications to manufacturing systems. Dr. Chen won the 994 Harvard University Eiahu I. Jury Award for the best thesis in the fied of contro. He is aso one of the recipients of the 99 MasPar Parae Computer Chaenge Award. LIYI DAI is an assistant professor in the Department of Systems Science and Mathematics at Washington University, MO. He received the M.S. degree from the Institute of Systems Science, Academia Sinica, Beijing, China, in 986, and the Ph.D. degree from Harvard University in 993. His research interests incude discrete event dynamic systems, simuation, stochastic optimization, communication systems, and singuar systems. He has coauthored over 30 papers in various journas and is the author of Singuar Contro Systems (Berin: Springer-Verag, 989). Dr. Dai is isted in Who's Who among Asian Americans and is a recipient of the NSF CAREER award. ENVER Y ucesas an associate Professor of Operations Research at INSEAD in Fontainebeau, FRANCE. He hods a BSIE degree from Pudue University, and an MS and a Ph.D. both in OR, from Corne University. He is currenty visiting the Department of Systems Engineering at the University of Pennsyvania.

A Brief Introduction to Markov Chains and Hidden Markov Models

A Brief Introduction to Markov Chains and Hidden Markov Models A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,

More information

A. Distribution of the test statistic

A. Distribution of the test statistic A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch

More information

Asynchronous Control for Coupled Markov Decision Systems

Asynchronous Control for Coupled Markov Decision Systems INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of

More information

CS229 Lecture notes. Andrew Ng

CS229 Lecture notes. Andrew Ng CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view

More information

SydU STAT3014 (2015) Second semester Dr. J. Chan 18

SydU STAT3014 (2015) Second semester Dr. J. Chan 18 STAT3014/3914 Appied Stat.-Samping C-Stratified rand. sampe Stratified Random Samping.1 Introduction Description The popuation of size N is divided into mutuay excusive and exhaustive subpopuations caed

More information

Explicit overall risk minimization transductive bound

Explicit overall risk minimization transductive bound 1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,

More information

Statistical Learning Theory: A Primer

Statistical Learning Theory: A Primer Internationa Journa of Computer Vision 38(), 9 3, 2000 c 2000 uwer Academic Pubishers. Manufactured in The Netherands. Statistica Learning Theory: A Primer THEODOROS EVGENIOU, MASSIMILIANO PONTIL AND TOMASO

More information

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete Uniprocessor Feasibiity of Sporadic Tasks with Constrained Deadines is Strongy conp-compete Pontus Ekberg and Wang Yi Uppsaa University, Sweden Emai: {pontus.ekberg yi}@it.uu.se Abstract Deciding the feasibiity

More information

(This is a sample cover image for this issue. The actual cover is not yet available at this time.)

(This is a sample cover image for this issue. The actual cover is not yet available at this time.) (This is a sampe cover image for this issue The actua cover is not yet avaiabe at this time) This artice appeared in a journa pubished by Esevier The attached copy is furnished to the author for interna

More information

Two-sample inference for normal mean vectors based on monotone missing data

Two-sample inference for normal mean vectors based on monotone missing data Journa of Mutivariate Anaysis 97 (006 6 76 wwweseviercom/ocate/jmva Two-sampe inference for norma mean vectors based on monotone missing data Jianqi Yu a, K Krishnamoorthy a,, Maruthy K Pannaa b a Department

More information

Stochastic Variational Inference with Gradient Linearization

Stochastic Variational Inference with Gradient Linearization Stochastic Variationa Inference with Gradient Linearization Suppementa Materia Tobias Pötz * Anne S Wannenwetsch Stefan Roth Department of Computer Science, TU Darmstadt Preface In this suppementa materia,

More information

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c)

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c) A Simpe Efficient Agorithm of 3-D Singe-Source Locaization with Uniform Cross Array Bing Xue a * Guangyou Fang b Yicai Ji c Key Laboratory of Eectromagnetic Radiation Sensing Technoogy, Institute of Eectronics,

More information

Schedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness

Schedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness 1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea-Time Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process

More information

BP neural network-based sports performance prediction model applied research

BP neural network-based sports performance prediction model applied research Avaiabe onine www.jocpr.com Journa of Chemica and Pharmaceutica Research, 204, 6(7:93-936 Research Artice ISSN : 0975-7384 CODEN(USA : JCPRC5 BP neura networ-based sports performance prediction mode appied

More information

Nonlinear Gaussian Filtering via Radial Basis Function Approximation

Nonlinear Gaussian Filtering via Radial Basis Function Approximation 51st IEEE Conference on Decision and Contro December 10-13 01 Maui Hawaii USA Noninear Gaussian Fitering via Radia Basis Function Approximation Huazhen Fang Jia Wang and Raymond A de Caafon Abstract This

More information

STA 216 Project: Spline Approach to Discrete Survival Analysis

STA 216 Project: Spline Approach to Discrete Survival Analysis : Spine Approach to Discrete Surviva Anaysis November 4, 005 1 Introduction Athough continuous surviva anaysis differs much from the discrete surviva anaysis, there is certain ink between the two modeing

More information

Schedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness

Schedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness 1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea- Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process Management,

More information

A proposed nonparametric mixture density estimation using B-spline functions

A proposed nonparametric mixture density estimation using B-spline functions A proposed nonparametric mixture density estimation using B-spine functions Atizez Hadrich a,b, Mourad Zribi a, Afif Masmoudi b a Laboratoire d Informatique Signa et Image de a Côte d Opae (LISIC-EA 4491),

More information

Robust Sensitivity Analysis for Linear Programming with Ellipsoidal Perturbation

Robust Sensitivity Analysis for Linear Programming with Ellipsoidal Perturbation Robust Sensitivity Anaysis for Linear Programming with Eipsoida Perturbation Ruotian Gao and Wenxun Xing Department of Mathematica Sciences Tsinghua University, Beijing, China, 100084 September 27, 2017

More information

Formulas for Angular-Momentum Barrier Factors Version II

Formulas for Angular-Momentum Barrier Factors Version II BNL PREPRINT BNL-QGS-06-101 brfactor1.tex Formuas for Anguar-Momentum Barrier Factors Version II S. U. Chung Physics Department, Brookhaven Nationa Laboratory, Upton, NY 11973 March 19, 2015 abstract A

More information

Appendix A: MATLAB commands for neural networks

Appendix A: MATLAB commands for neural networks Appendix A: MATLAB commands for neura networks 132 Appendix A: MATLAB commands for neura networks p=importdata('pn.xs'); t=importdata('tn.xs'); [pn,meanp,stdp,tn,meant,stdt]=prestd(p,t); for m=1:10 net=newff(minmax(pn),[m,1],{'tansig','purein'},'trainm');

More information

Throughput Optimal Scheduling for Wireless Downlinks with Reconfiguration Delay

Throughput Optimal Scheduling for Wireless Downlinks with Reconfiguration Delay Throughput Optima Scheduing for Wireess Downinks with Reconfiguration Deay Vineeth Baa Sukumaran vineethbs@gmai.com Department of Avionics Indian Institute of Space Science and Technoogy. Abstract We consider

More information

Cryptanalysis of PKP: A New Approach

Cryptanalysis of PKP: A New Approach Cryptanaysis of PKP: A New Approach Éiane Jaumes and Antoine Joux DCSSI 18, rue du Dr. Zamenhoff F-92131 Issy-es-Mx Cedex France eiane.jaumes@wanadoo.fr Antoine.Joux@ens.fr Abstract. Quite recenty, in

More information

<C 2 2. λ 2 l. λ 1 l 1 < C 1

<C 2 2. λ 2 l. λ 1 l 1 < C 1 Teecommunication Network Contro and Management (EE E694) Prof. A. A. Lazar Notes for the ecture of 7/Feb/95 by Huayan Wang (this document was ast LaT E X-ed on May 9,995) Queueing Primer for Muticass Optima

More information

Energy-Efficient Task Scheduling on Multiple Heterogeneous Computers: Algorithms, Analysis, and Performance Evaluation

Energy-Efficient Task Scheduling on Multiple Heterogeneous Computers: Algorithms, Analysis, and Performance Evaluation IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING, VOL., NO., JANUARY-JUNE 206 7 Energy-Efficient Tas Scheduing on Mutipe Heterogeneous Computers: Agorithms, Anaysis, and Performance Evauation Keqin Li, Feow,

More information

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with?

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with? Bayesian Learning A powerfu and growing approach in machine earning We use it in our own decision making a the time You hear a which which coud equay be Thanks or Tanks, which woud you go with? Combine

More information

The EM Algorithm applied to determining new limit points of Mahler measures

The EM Algorithm applied to determining new limit points of Mahler measures Contro and Cybernetics vo. 39 (2010) No. 4 The EM Agorithm appied to determining new imit points of Maher measures by Souad E Otmani, Georges Rhin and Jean-Marc Sac-Épée Université Pau Veraine-Metz, LMAM,

More information

Automobile Prices in Market Equilibrium. Berry, Pakes and Levinsohn

Automobile Prices in Market Equilibrium. Berry, Pakes and Levinsohn Automobie Prices in Market Equiibrium Berry, Pakes and Levinsohn Empirica Anaysis of demand and suppy in a differentiated products market: equiibrium in the U.S. automobie market. Oigopoistic Differentiated

More information

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network An Agorithm for Pruning Redundant Modues in Min-Max Moduar Network Hui-Cheng Lian and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University 1954 Hua Shan Rd., Shanghai

More information

c 2016 Georgios Rovatsos

c 2016 Georgios Rovatsos c 2016 Georgios Rovatsos QUICKEST CHANGE DETECTION WITH APPLICATIONS TO LINE OUTAGE DETECTION BY GEORGIOS ROVATSOS THESIS Submitted in partia fufiment of the requirements for the degree of Master of Science

More information

Statistical Learning Theory: a Primer

Statistical Learning Theory: a Primer ??,??, 1 6 (??) c?? Kuwer Academic Pubishers, Boston. Manufactured in The Netherands. Statistica Learning Theory: a Primer THEODOROS EVGENIOU AND MASSIMILIANO PONTIL Center for Bioogica and Computationa

More information

Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization

Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization Scaabe Spectrum ocation for Large Networks ased on Sparse Optimization innan Zhuang Modem R&D Lab Samsung Semiconductor, Inc. San Diego, C Dongning Guo, Ermin Wei, and Michae L. Honig Department of Eectrica

More information

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After

More information

Reliability Improvement with Optimal Placement of Distributed Generation in Distribution System

Reliability Improvement with Optimal Placement of Distributed Generation in Distribution System Reiabiity Improvement with Optima Pacement of Distributed Generation in Distribution System N. Rugthaicharoencheep, T. Langtharthong Abstract This paper presents the optima pacement and sizing of distributed

More information

Testing for the Existence of Clusters

Testing for the Existence of Clusters Testing for the Existence of Custers Caudio Fuentes and George Casea University of Forida November 13, 2008 Abstract The detection and determination of custers has been of specia interest, among researchers

More information

Radar/ESM Tracking of Constant Velocity Target : Comparison of Batch (MLE) and EKF Performance

Radar/ESM Tracking of Constant Velocity Target : Comparison of Batch (MLE) and EKF Performance adar/ racing of Constant Veocity arget : Comparison of Batch (LE) and EKF Performance I. Leibowicz homson-csf Deteis/IISA La cef de Saint-Pierre 1 Bd Jean ouin 7885 Eancourt Cede France Isabee.Leibowicz

More information

Alberto Maydeu Olivares Instituto de Empresa Marketing Dept. C/Maria de Molina Madrid Spain

Alberto Maydeu Olivares Instituto de Empresa Marketing Dept. C/Maria de Molina Madrid Spain CORRECTIONS TO CLASSICAL PROCEDURES FOR ESTIMATING THURSTONE S CASE V MODEL FOR RANKING DATA Aberto Maydeu Oivares Instituto de Empresa Marketing Dept. C/Maria de Moina -5 28006 Madrid Spain Aberto.Maydeu@ie.edu

More information

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries c 26 Noninear Phenomena in Compex Systems First-Order Corrections to Gutzwier s Trace Formua for Systems with Discrete Symmetries Hoger Cartarius, Jörg Main, and Günter Wunner Institut für Theoretische

More information

Moreau-Yosida Regularization for Grouped Tree Structure Learning

Moreau-Yosida Regularization for Grouped Tree Structure Learning Moreau-Yosida Reguarization for Grouped Tree Structure Learning Jun Liu Computer Science and Engineering Arizona State University J.Liu@asu.edu Jieping Ye Computer Science and Engineering Arizona State

More information

Centralized Coded Caching of Correlated Contents

Centralized Coded Caching of Correlated Contents Centraized Coded Caching of Correated Contents Qianqian Yang and Deniz Gündüz Information Processing and Communications Lab Department of Eectrica and Eectronic Engineering Imperia Coege London arxiv:1711.03798v1

More information

Akaike Information Criterion for ANOVA Model with a Simple Order Restriction

Akaike Information Criterion for ANOVA Model with a Simple Order Restriction Akaike Information Criterion for ANOVA Mode with a Simpe Order Restriction Yu Inatsu * Department of Mathematics, Graduate Schoo of Science, Hiroshima University ABSTRACT In this paper, we consider Akaike

More information

6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7

6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7 6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17 Soution 7 Probem 1: Generating Random Variabes Each part of this probem requires impementation in MATLAB. For the

More information

New Efficiency Results for Makespan Cost Sharing

New Efficiency Results for Makespan Cost Sharing New Efficiency Resuts for Makespan Cost Sharing Yvonne Beischwitz a, Forian Schoppmann a, a University of Paderborn, Department of Computer Science Fürstenaee, 3302 Paderborn, Germany Abstract In the context

More information

Fast Blind Recognition of Channel Codes

Fast Blind Recognition of Channel Codes Fast Bind Recognition of Channe Codes Reza Moosavi and Erik G. Larsson Linköping University Post Print N.B.: When citing this work, cite the origina artice. 213 IEEE. Persona use of this materia is permitted.

More information

STABILITY OF A PARAMETRICALLY EXCITED DAMPED INVERTED PENDULUM 1. INTRODUCTION

STABILITY OF A PARAMETRICALLY EXCITED DAMPED INVERTED PENDULUM 1. INTRODUCTION Journa of Sound and Vibration (996) 98(5), 643 65 STABILITY OF A PARAMETRICALLY EXCITED DAMPED INVERTED PENDULUM G. ERDOS AND T. SINGH Department of Mechanica and Aerospace Engineering, SUNY at Buffao,

More information

FRST Multivariate Statistics. Multivariate Discriminant Analysis (MDA)

FRST Multivariate Statistics. Multivariate Discriminant Analysis (MDA) 1 FRST 531 -- Mutivariate Statistics Mutivariate Discriminant Anaysis (MDA) Purpose: 1. To predict which group (Y) an observation beongs to based on the characteristics of p predictor (X) variabes, using

More information

A Statistical Framework for Real-time Event Detection in Power Systems

A Statistical Framework for Real-time Event Detection in Power Systems 1 A Statistica Framework for Rea-time Event Detection in Power Systems Noan Uhrich, Tim Christman, Phiip Swisher, and Xichen Jiang Abstract A quickest change detection (QCD) agorithm is appied to the probem

More information

Process Capability Proposal. with Polynomial Profile

Process Capability Proposal. with Polynomial Profile Contemporary Engineering Sciences, Vo. 11, 2018, no. 85, 4227-4236 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ces.2018.88467 Process Capabiity Proposa with Poynomia Profie Roberto José Herrera

More information

Optimal Control of Assembly Systems with Multiple Stages and Multiple Demand Classes 1

Optimal Control of Assembly Systems with Multiple Stages and Multiple Demand Classes 1 Optima Contro of Assemby Systems with Mutipe Stages and Mutipe Demand Casses Saif Benjaafar Mohsen EHafsi 2 Chung-Yee Lee 3 Weihua Zhou 3 Industria & Systems Engineering, Department of Mechanica Engineering,

More information

Ensemble Online Clustering through Decentralized Observations

Ensemble Online Clustering through Decentralized Observations Ensembe Onine Custering through Decentraized Observations Dimitrios Katseis, Caroyn L. Bec and Mihaea van der Schaar Abstract We investigate the probem of onine earning for an ensembe of agents custering

More information

International Journal of Mass Spectrometry

International Journal of Mass Spectrometry Internationa Journa of Mass Spectrometry 280 (2009) 179 183 Contents ists avaiabe at ScienceDirect Internationa Journa of Mass Spectrometry journa homepage: www.esevier.com/ocate/ijms Stark mixing by ion-rydberg

More information

DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM

DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM MIKAEL NILSSON, MATTIAS DAHL AND INGVAR CLAESSON Bekinge Institute of Technoogy Department of Teecommunications and Signa Processing

More information

A Solution to the 4-bit Parity Problem with a Single Quaternary Neuron

A Solution to the 4-bit Parity Problem with a Single Quaternary Neuron Neura Information Processing - Letters and Reviews Vo. 5, No. 2, November 2004 LETTER A Soution to the 4-bit Parity Probem with a Singe Quaternary Neuron Tohru Nitta Nationa Institute of Advanced Industria

More information

AST 418/518 Instrumentation and Statistics

AST 418/518 Instrumentation and Statistics AST 418/518 Instrumentation and Statistics Cass Website: http://ircamera.as.arizona.edu/astr_518 Cass Texts: Practica Statistics for Astronomers, J.V. Wa, and C.R. Jenkins, Second Edition. Measuring the

More information

Combining reaction kinetics to the multi-phase Gibbs energy calculation

Combining reaction kinetics to the multi-phase Gibbs energy calculation 7 th European Symposium on Computer Aided Process Engineering ESCAPE7 V. Pesu and P.S. Agachi (Editors) 2007 Esevier B.V. A rights reserved. Combining reaction inetics to the muti-phase Gibbs energy cacuation

More information

Source and Relay Matrices Optimization for Multiuser Multi-Hop MIMO Relay Systems

Source and Relay Matrices Optimization for Multiuser Multi-Hop MIMO Relay Systems Source and Reay Matrices Optimization for Mutiuser Muti-Hop MIMO Reay Systems Yue Rong Department of Eectrica and Computer Engineering, Curtin University, Bentey, WA 6102, Austraia Abstract In this paper,

More information

Fitting Algorithms for MMPP ATM Traffic Models

Fitting Algorithms for MMPP ATM Traffic Models Fitting Agorithms for PP AT Traffic odes A. Nogueira, P. Savador, R. Vaadas University of Aveiro / Institute of Teecommunications, 38-93 Aveiro, Portuga; e-mai: (nogueira, savador, rv)@av.it.pt ABSTRACT

More information

Melodic contour estimation with B-spline models using a MDL criterion

Melodic contour estimation with B-spline models using a MDL criterion Meodic contour estimation with B-spine modes using a MDL criterion Damien Loive, Ney Barbot, Oivier Boeffard IRISA / University of Rennes 1 - ENSSAT 6 rue de Kerampont, B.P. 80518, F-305 Lannion Cedex

More information

Stochastic Automata Networks (SAN) - Modelling. and Evaluation. Paulo Fernandes 1. Brigitte Plateau 2. May 29, 1997

Stochastic Automata Networks (SAN) - Modelling. and Evaluation. Paulo Fernandes 1. Brigitte Plateau 2. May 29, 1997 Stochastic utomata etworks (S) - Modeing and Evauation Pauo Fernandes rigitte Pateau 2 May 29, 997 Institut ationa Poytechnique de Grenobe { IPG Ecoe ationae Superieure d'informatique et de Mathematiques

More information

Stochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract

Stochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract Stochastic Compement Anaysis of Muti-Server Threshod Queues with Hysteresis John C.S. Lui The Dept. of Computer Science & Engineering The Chinese University of Hong Kong Leana Goubchik Dept. of Computer

More information

Probabilistic Assessment of Total Transfer Capability Using SQP and Weather Effects

Probabilistic Assessment of Total Transfer Capability Using SQP and Weather Effects J Eectr Eng Techno Vo. 9, No. 5: 52-526, 24 http://dx.doi.org/.537/jeet.24.9.5.52 ISSN(Print) 975-2 ISSN(Onine) 293-7423 Probabiistic Assessment of Tota Transfer Capabiity Using SQP and Weather Effects

More information

Two Birds With One Stone: An Efficient Hierarchical Framework for Top-k and Threshold-based String Similarity Search

Two Birds With One Stone: An Efficient Hierarchical Framework for Top-k and Threshold-based String Similarity Search Two Birds With One Stone: An Efficient Hierarchica Framework for Top-k and Threshod-based String Simiarity Search Jin Wang Guoiang Li Dong Deng Yong Zhang Jianhua Feng Department of Computer Science and

More information

Inductive Bias: How to generalize on novel data. CS Inductive Bias 1

Inductive Bias: How to generalize on novel data. CS Inductive Bias 1 Inductive Bias: How to generaize on nove data CS 478 - Inductive Bias 1 Overfitting Noise vs. Exceptions CS 478 - Inductive Bias 2 Non-Linear Tasks Linear Regression wi not generaize we to the task beow

More information

Control Chart For Monitoring Nonparametric Profiles With Arbitrary Design

Control Chart For Monitoring Nonparametric Profiles With Arbitrary Design Contro Chart For Monitoring Nonparametric Profies With Arbitrary Design Peihua Qiu 1 and Changiang Zou 2 1 Schoo of Statistics, University of Minnesota, USA 2 LPMC and Department of Statistics, Nankai

More information

Tracking Control of Multiple Mobile Robots

Tracking Control of Multiple Mobile Robots Proceedings of the 2001 IEEE Internationa Conference on Robotics & Automation Seou, Korea May 21-26, 2001 Tracking Contro of Mutipe Mobie Robots A Case Study of Inter-Robot Coision-Free Probem Jurachart

More information

Statistical Inference, Econometric Analysis and Matrix Algebra

Statistical Inference, Econometric Analysis and Matrix Algebra Statistica Inference, Econometric Anaysis and Matrix Agebra Bernhard Schipp Water Krämer Editors Statistica Inference, Econometric Anaysis and Matrix Agebra Festschrift in Honour of Götz Trenker Physica-Verag

More information

II. PROBLEM. A. Description. For the space of audio signals

II. PROBLEM. A. Description. For the space of audio signals CS229 - Fina Report Speech Recording based Language Recognition (Natura Language) Leopod Cambier - cambier; Matan Leibovich - matane; Cindy Orozco Bohorquez - orozcocc ABSTRACT We construct a rea time

More information

Bayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems

Bayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems Bayesian Unscented Kaman Fiter for State Estimation of Noninear and Non-aussian Systems Zhong Liu, Shing-Chow Chan, Ho-Chun Wu and iafei Wu Department of Eectrica and Eectronic Engineering, he University

More information

Proceedings of the 2014 Winter Simulation Conference A. Tolk, S. Y. Diallo, I. O. Ryzhov, L. Yilmaz, S. Buckley, and J. A. Miller, eds.

Proceedings of the 2014 Winter Simulation Conference A. Tolk, S. Y. Diallo, I. O. Ryzhov, L. Yilmaz, S. Buckley, and J. A. Miller, eds. Proceedings of the 2014 Winter Simuation Conference A. Tok, S. Y. Diao, I. O. Ryzhov, L. Yimaz, S. Buckey, and J. A. Mier, eds. ADVANCED TUTORIAL: INPUT UNCERTAINTY QUANTIFICATION Eunhye Song Barry L.

More information

A Comparison Study of the Test for Right Censored and Grouped Data

A Comparison Study of the Test for Right Censored and Grouped Data Communications for Statistica Appications and Methods 2015, Vo. 22, No. 4, 313 320 DOI: http://dx.doi.org/10.5351/csam.2015.22.4.313 Print ISSN 2287-7843 / Onine ISSN 2383-4757 A Comparison Study of the

More information

High Spectral Resolution Infrared Radiance Modeling Using Optimal Spectral Sampling (OSS) Method

High Spectral Resolution Infrared Radiance Modeling Using Optimal Spectral Sampling (OSS) Method High Spectra Resoution Infrared Radiance Modeing Using Optima Spectra Samping (OSS) Method J.-L. Moncet and G. Uymin Background Optima Spectra Samping (OSS) method is a fast and accurate monochromatic

More information

Problem set 6 The Perron Frobenius theorem.

Problem set 6 The Perron Frobenius theorem. Probem set 6 The Perron Frobenius theorem. Math 22a4 Oct 2 204, Due Oct.28 In a future probem set I want to discuss some criteria which aow us to concude that that the ground state of a sef-adjoint operator

More information

Using Process Data for Finding Self-optimizing Controlled Variables

Using Process Data for Finding Self-optimizing Controlled Variables Using Process Data for Finding Sef-optimizing Controed Variabes Johannes Jäschke and Sigurd Skogestad Norwegian University of Science and Technoogy, NTNU, Trondheim, Norway (e-mai:jaschke@ntnuno, skoge@ntnuno)

More information

Discrete Applied Mathematics

Discrete Applied Mathematics Discrete Appied Mathematics 159 (2011) 812 825 Contents ists avaiabe at ScienceDirect Discrete Appied Mathematics journa homepage: www.esevier.com/ocate/dam A direct barter mode for course add/drop process

More information

A Novel Learning Method for Elman Neural Network Using Local Search

A Novel Learning Method for Elman Neural Network Using Local Search Neura Information Processing Letters and Reviews Vo. 11, No. 8, August 2007 LETTER A Nove Learning Method for Eman Neura Networ Using Loca Search Facuty of Engineering, Toyama University, Gofuu 3190 Toyama

More information

Lecture Note 3: Stationary Iterative Methods

Lecture Note 3: Stationary Iterative Methods MATH 5330: Computationa Methods of Linear Agebra Lecture Note 3: Stationary Iterative Methods Xianyi Zeng Department of Mathematica Sciences, UTEP Stationary Iterative Methods The Gaussian eimination (or

More information

Determining The Degree of Generalization Using An Incremental Learning Algorithm

Determining The Degree of Generalization Using An Incremental Learning Algorithm Determining The Degree of Generaization Using An Incrementa Learning Agorithm Pabo Zegers Facutad de Ingeniería, Universidad de os Andes San Caros de Apoquindo 22, Las Condes, Santiago, Chie pzegers@uandes.c

More information

arxiv: v1 [math.ca] 6 Mar 2017

arxiv: v1 [math.ca] 6 Mar 2017 Indefinite Integras of Spherica Besse Functions MIT-CTP/487 arxiv:703.0648v [math.ca] 6 Mar 07 Joyon K. Boomfied,, Stephen H. P. Face,, and Zander Moss, Center for Theoretica Physics, Laboratory for Nucear

More information

Algorithms to solve massively under-defined systems of multivariate quadratic equations

Algorithms to solve massively under-defined systems of multivariate quadratic equations Agorithms to sove massivey under-defined systems of mutivariate quadratic equations Yasufumi Hashimoto Abstract It is we known that the probem to sove a set of randomy chosen mutivariate quadratic equations

More information

Efficiently Generating Random Bits from Finite State Markov Chains

Efficiently Generating Random Bits from Finite State Markov Chains 1 Efficienty Generating Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown

More information

Componentwise Determination of the Interval Hull Solution for Linear Interval Parameter Systems

Componentwise Determination of the Interval Hull Solution for Linear Interval Parameter Systems Componentwise Determination of the Interva Hu Soution for Linear Interva Parameter Systems L. V. Koev Dept. of Theoretica Eectrotechnics, Facuty of Automatics, Technica University of Sofia, 1000 Sofia,

More information

XSAT of linear CNF formulas

XSAT of linear CNF formulas XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open

More information

Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A. M. Uhrmacher, eds.

Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A. M. Uhrmacher, eds. Proceedings of the 2012 Winter Simuation Conference C. aroque, J. Himmespach, R. Pasupathy, O. Rose, and A. M. Uhrmacher, eds. TIGHT BOUNDS FOR AMERICAN OPTIONS VIA MUTIEVE MONTE CARO Denis Beomestny Duisburg-Essen

More information

UI FORMULATION FOR CABLE STATE OF EXISTING CABLE-STAYED BRIDGE

UI FORMULATION FOR CABLE STATE OF EXISTING CABLE-STAYED BRIDGE UI FORMULATION FOR CABLE STATE OF EXISTING CABLE-STAYED BRIDGE Juan Huang, Ronghui Wang and Tao Tang Coege of Traffic and Communications, South China University of Technoogy, Guangzhou, Guangdong 51641,

More information

IN MODERN embedded systems, the ever-increasing complexity

IN MODERN embedded systems, the ever-increasing complexity IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 37, NO., JANUARY 208 2 Muticore Mixed-Criticaity Systems: Partitioned Scheduing and Utiization Bound Jian-Jun Han, Member,

More information

CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION

CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION SAHAR KARIMI AND STEPHEN VAVASIS Abstract. In this paper we present a variant of the conjugate gradient (CG) agorithm in which we invoke a subspace minimization

More information

18-660: Numerical Methods for Engineering Design and Optimization

18-660: Numerical Methods for Engineering Design and Optimization 8-660: Numerica Methods for Engineering esign and Optimization in i epartment of ECE Carnegie Meon University Pittsburgh, PA 523 Side Overview Conjugate Gradient Method (Part 4) Pre-conditioning Noninear

More information

Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels

Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channes arxiv:cs/060700v1 [cs.it] 6 Ju 006 Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department University

More information

More Scattering: the Partial Wave Expansion

More Scattering: the Partial Wave Expansion More Scattering: the Partia Wave Expansion Michae Fower /7/8 Pane Waves and Partia Waves We are considering the soution to Schrödinger s equation for scattering of an incoming pane wave in the z-direction

More information

Distribution Systems Voltage Profile Improvement with Series FACTS Devices Using Line Flow-Based Equations

Distribution Systems Voltage Profile Improvement with Series FACTS Devices Using Line Flow-Based Equations 16th NATIONAL POWER SYSTEMS CONFERENCE, 15th-17th DECEMBER, 010 386 Distribution Systems otage Profie Improvement with Series FACTS Devices Using Line Fow-Based Equations K. enkateswararao, P. K. Agarwa

More information

Paper presented at the Workshop on Space Charge Physics in High Intensity Hadron Rings, sponsored by Brookhaven National Laboratory, May 4-7,1998

Paper presented at the Workshop on Space Charge Physics in High Intensity Hadron Rings, sponsored by Brookhaven National Laboratory, May 4-7,1998 Paper presented at the Workshop on Space Charge Physics in High ntensity Hadron Rings, sponsored by Brookhaven Nationa Laboratory, May 4-7,998 Noninear Sef Consistent High Resoution Beam Hao Agorithm in

More information

Utilization of multi-dimensional sou correlation in multi-dimensional sin check codes. Izhar, Mohd Azri Mohd; Zhou, Xiaobo; Author(s) Tad

Utilization of multi-dimensional sou correlation in multi-dimensional sin check codes. Izhar, Mohd Azri Mohd; Zhou, Xiaobo; Author(s) Tad JAIST Reposi https://dspace.j Tite Utiization of muti-dimensiona sou correation in muti-dimensiona sin check codes Izhar, Mohd Azri Mohd; Zhou, Xiaobo; Author(s) Tad Citation Teecommunication Systems,

More information

[11] J.V. Uspensky, Introduction to Mathematical Probability (McGraw Hill, New

[11] J.V. Uspensky, Introduction to Mathematical Probability (McGraw Hill, New [11] J.V. Uspensky, Introduction to Mathematica Probabiity (McGraw Hi, New York, 1937) 77{84. [12] Wiiam G. Cochran, The 2 Test of Goodness of Fit (John Hopkins University, Department of Biostatistics,

More information

BDD-Based Analysis of Gapped q-gram Filters

BDD-Based Analysis of Gapped q-gram Filters BDD-Based Anaysis of Gapped q-gram Fiters Marc Fontaine, Stefan Burkhardt 2 and Juha Kärkkäinen 2 Max-Panck-Institut für Informatik Stuhsatzenhausweg 85, 6623 Saarbrücken, Germany e-mai: stburk@mpi-sb.mpg.de

More information

High-order approximations to the Mie series for electromagnetic scattering in three dimensions

High-order approximations to the Mie series for electromagnetic scattering in three dimensions Proceedings of the 9th WSEAS Internationa Conference on Appied Mathematics Istanbu Turkey May 27-29 2006 (pp199-204) High-order approximations to the Mie series for eectromagnetic scattering in three dimensions

More information

CS 331: Artificial Intelligence Propositional Logic 2. Review of Last Time

CS 331: Artificial Intelligence Propositional Logic 2. Review of Last Time CS 33 Artificia Inteigence Propositiona Logic 2 Review of Last Time = means ogicay foows - i means can be derived from If your inference agorithm derives ony things that foow ogicay from the KB, the inference

More information

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations Optimaity of Inference in Hierarchica Coding for Distributed Object-Based Representations Simon Brodeur, Jean Rouat NECOTIS, Département génie éectrique et génie informatique, Université de Sherbrooke,

More information

An explicit Jordan Decomposition of Companion matrices

An explicit Jordan Decomposition of Companion matrices An expicit Jordan Decomposition of Companion matrices Fermín S V Bazán Departamento de Matemática CFM UFSC 88040-900 Forianópois SC E-mai: fermin@mtmufscbr S Gratton CERFACS 42 Av Gaspard Coriois 31057

More information

arxiv: v1 [cs.lg] 31 Oct 2017

arxiv: v1 [cs.lg] 31 Oct 2017 ACCELERATED SPARSE SUBSPACE CLUSTERING Abofaz Hashemi and Haris Vikao Department of Eectrica and Computer Engineering, University of Texas at Austin, Austin, TX, USA arxiv:7.26v [cs.lg] 3 Oct 27 ABSTRACT

More information

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel Sequentia Decoding of Poar Codes with Arbitrary Binary Kerne Vera Miosavskaya, Peter Trifonov Saint-Petersburg State Poytechnic University Emai: veram,petert}@dcn.icc.spbstu.ru Abstract The probem of efficient

More information