Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
30,385
result(s) for
"MATHEMATICS AND COMPUTING"
Sort by:
Cloud computing and digital media : fundamentals, techniques, and applications
\"While some related books cover separate aspects of digital media and cloud computing, none integrate both of these areas together. Bridging the gap between digital media and cloud computing, this book brings together technologies for media/data communication, elastic media/data storage, security, authentication, cross-network media/data fusion, inter-device media interaction/reaction, data centers, platform as a service (PaaS), and software as a service (SaaS). The book also covers interesting applications involving digital media in the cloud. \"-- Provided by publisher.
Book
Exact values for three domination-like problems in circular and infinite grid graphs of small height
In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of given height. We provide an alternate proof for already known results, as well as new results. These were obtained by a computer search based on a generic framework, that we developed earlier, for the search of a minimum labeling satisfying a pseudo-d-local property in rotagraphs.
Journal Article
Liquid–liquid phase transition in hydrogen by coupled electron–ion Monte Carlo simulations
The phase diagram of high-pressure hydrogen is of great interest for fundamental research, planetary physics, and energy applications. A first-order phase transition in the fluid phase between a molecular insulating fluid and a monoatomic metallic fluid has been predicted. The existence and precise location of the transition line is relevant for planetary models. Recent experiments reported contrasting results about the location of the transition. Theoretical results based on density functional theory are also very scattered. We report highly accurate coupled electron–ion Monte Carlo calculations of this transition, finding results that lie between the two experimental predictions, close to that measured in diamond anvil cell experiments but at 25–30 GPa higher pressure. The transition along an isotherm is signaled by a discontinuity in the specific volume, a sudden dissociation of the molecules, a jump in electrical conductivity, and loss of electron localization.
Journal Article
Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
We present a method for computing lower bounds in the progressive hedging algorithm (PHA) for two-stage and multi-stage stochastic mixed-integer programs. Computing lower bounds in the PHA allows one to assess the quality of the solutions generated by the algorithm contemporaneously. The lower bounds can be computed in any iteration of the algorithm by using dual prices that are calculated during execution of the standard PHA. We report computational results on stochastic unit commitment and stochastic server location problem instances, and explore the relationship between key PHA parameters and the quality of the resulting lower bounds.
Journal Article
Introduction to biostatistical applications in health research with Microsoft Office Excel and R
Focusing on a basic understanding of the methods and analyses in health research, Introduction to Biostatistical Applications in Health Research with Microsoft® Office Excel®, 2e provides statistical concepts for interpreting results using Excel. The book emphasizes the application of methods and presents the most common methodological procedures in health research, which includes multiple regression, ANOVA, ANCOVA, logistic regression, Cox regression, stratified analysis, life table analysis, and nonparametric parallels.Some updates for this new edition:The flowcharts from the first edition will be expanded to include indicators of the assumptions of each procedure. This will be added to facilitate selection of a statistical approach to analyze a particular set of data. The existing twelve chapters describing statistical principals and statistical methods will be maintained. They have been proven to provide students with a clear and useful approach to the subject in use as a textbook and workbook in a graduate statistics course. An additional chapter will be added to the book that discusses the assumptions of statistical procedures. This chapter will describe each assumption, tell how to determine if the assumption is appropriate for a particular set of data, and provide solutions to situations in which the assumptions are not me by the data set. This chapter will provide students and researchers with the information they need to select an appropriate method of analysis and to apply that method to a set of data. The workbook will include a corresponding chapter that will provide students with practice identifying assumptions, testing for their satisfaction, and applying solutions to violation of assumptions.R will also be included to broaden the appeal and audience for the book.
eBook
Benchmarking optimization software with performance profiles
We propose performance profiles -- distribution functions for a performance metric -- as a tool for benchmarking and comparing optimization software. We show that performance profiles combine the best features of other tools for performance evaluation.
Journal Article
Distributionally robust polynomial chance-constraints under mixture ambiguity sets
Given X⊂Rn, ε∈(0,1), a parametrized family of probability distributions (μa)a∈A on Ω⊂Rp, we consider the feasible set Xε∗⊂X associated with the distributionally robust chance-constraint Xε∗={x∈X:Probμ[f(x,ω)>0]>1-ε,∀μ∈Ma},where Ma is the set of all possibles mixtures of distributions μa, a∈A. For instance and typically, the family Ma is the set of all mixtures of Gaussian distributions on R with mean and standard deviation a=(a,σ) in some compact set A⊂R2. We provide a sequence of inner approximations Xεd={x∈X:wd(x)<ε}, d∈N, where wd is a polynomial of degree d whose vector of coefficients is an optimal solution of a semidefinite program. The size of the latter increases with the degree d. We also obtain the strong and highly desirable asymptotic guarantee that λ(Xε∗\\Xεd)→0 as d increases, where λ is the Lebesgue measure on X. Same results are also obtained for the more intricated case of distributionally robust “joint” chance-constraints. There is a price to pay for this strong asymptotic guarantee which is the scalability of such a numerical scheme, and so far this important drawback makes it limited to problems of modest dimension.
Journal Article
Numerical optimization for symmetric tensor decomposition
We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued vectors. Algebraic methods exist for computing complex-valued decompositions of symmetric tensors, but here we focus on real-valued decompositions, both unconstrained and nonnegative, for problems with low-rank structure. We discuss when solutions exist and how to formulate the mathematical program. Numerical results show the properties of the proposed formulations (including one that ignores symmetry) on a set of test problems and illustrate that these straightforward formulations can be effective even though the problem is nonconvex.
Journal Article