Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
31,425
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
Compressing branch-and-bound trees
A branch-and-bound (BB) tree certifies a dual bound on the value of an integer program. In this work, we introduce the tree compression problem (TCP):
Given a BB tree
T
that certifies a dual bound, can we obtain a smaller tree with the same (or stronger) bound by either (1) applying a different disjunction at some node in
T
or (2) removing leaves from
T
? We believe such post-hoc analysis of BB trees may assist in identifying helpful general disjunctions in BB algorithms. We initiate our study by considering computational complexity and limitations of TCP. We then conduct experiments to evaluate the compressibility of realistic branch-and-bound trees generated by commonly-used branching strategies, using both an exact and a heuristic compression algorithm.
Journal Article
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
Introduction to biostatistical applications in health research with Microsoft Office Excel and R
The second edition of Introduction to Biostatistical Applications in Health Research delivers a thorough examination of the basic techniques and most commonly used statistical methods in health research.
eBook
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