Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Series TitleSeries Title
-
Reading LevelReading Level
-
YearFrom:-To:
-
More FiltersMore FiltersContent TypeItem TypeDegree TypeIs Full-Text AvailableSubjectCountry Of PublicationPublisherSourceGranting InstitutionTarget AudienceDonorLanguagePlace of PublicationContributorsLocation
Done
Filters
Reset
10,394
result(s) for
"Minimization"
Sort by:
Reducing pollution and waste
by
Green, Jen
in
Waste minimization Juvenile literature.
,
Pollution prevention Juvenile literature.
,
Waste minimization.
2011
The world often seems to be drowning in garbage and waste. Presents ways to \"reduce, reuse, and recycle\" in our everyday lives.
Best Care at Lower Cost
by
Stuckhardt, Leigh
,
Saunders, Robert
,
Smith, Mark
in
Costs and Cost Analysis
,
Delivery of Health Care
,
economics
2012,2013
America's health care system has become too complex and costly to continue business as usual. Best Care at Lower Cost explains that inefficiencies, an overwhelming amount of data, and other economic and quality barriers hinder progress in improving health and threaten the nation's economic stability and global competitiveness. According to this report, the knowledge and tools exist to put the health system on the right course to achieve continuous improvement and better quality care at a lower cost.
The costs of the system's current inefficiency underscore the urgent need for a systemwide transformation. About 30 percent of health spending in 2009-roughly $750 billion-was wasted on unnecessary services, excessive administrative costs, fraud, and other problems. Moreover, inefficiencies cause needless suffering. By one estimate, roughly 75,000 deaths might have been averted in 2005 if every state had delivered care at the quality level of the best performing state. This report states that the way health care providers currently train, practice, and learn new information cannot keep pace with the flood of research discoveries and technological advances.
About 75 million Americans have more than one chronic condition, requiring coordination among multiple specialists and therapies, which can increase the potential for miscommunication, misdiagnosis, potentially conflicting interventions, and dangerous drug interactions. Best Care at Lower Cost emphasizes that a better use of data is a critical element of a continuously improving health system, such as mobile technologies and electronic health records that offer significant potential to capture and share health data better. In order for this to occur, the National Coordinator for Health Information Technology, IT developers, and standard-setting organizations should ensure that these systems are robust and interoperable. Clinicians and care organizations should fully adopt these technologies, and patients should be encouraged to use tools, such as personal health information portals, to actively engage in their care.
This book is a call to action that will guide health care providers; administrators; caregivers; policy makers; health professionals; federal, state, and local government agencies; private and public health organizations; and educational institutions.
Waste : information and projects to reduce your environmental footprint
by
Whittaker, Helen, 1965-
,
Whittaker, Helen, 1965- Living green
in
Recycling (Waste, etc.) Juvenile literature.
,
Waste minimization Juvenile literature.
,
Recycling (Waste)
2012
\"Discusses how the items we throw away impact the environment and what you can do to be more eco-conscious\"-- Provided by publisher.
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
2014
We introduce a proximal alternating linearized minimization (PALM) algorithm for solving a broad class of nonconvex and nonsmooth minimization problems. Building on the powerful Kurdyka–Łojasiewicz property, we derive a self-contained convergence analysis framework and establish that each bounded sequence generated by PALM globally converges to a critical point. Our approach allows to analyze various classes of nonconvex-nonsmooth problems and related nonconvex proximal forward–backward algorithms with semi-algebraic problem’s data, the later property being shared by many functions arising in a wide variety of fundamental applications. A by-product of our framework also shows that our results are new even in the convex setting. As an illustration of the results, we derive a new and simple globally convergent algorithm for solving the sparse nonnegative matrix factorization problem.
Journal Article
Zero waste fashion design
\"Zero Waste Fashion Design combines research and practice to introduce a crucial sustainable fashion design approach. Written by two industry leading pioneers, Timo Rissanen and Holly McQuillan, the book offers flexible strategies and easy-to-master zero waste techniques to help you develop your own cutting edge fashion designs. Sample flat patterns and more than 20 exercises will reinforce your understanding of the zero waste fashion design process. Beautifully illustrated interviews with high-profile, innovative designers, including Winifred Aldrich, Rickard Lindqvist and Yeohlee Teng, show the stunning garments produced by zero waste fashion design\"--Page 4 of cover.
Ultrasonic deterrents provide no additional benefit over curtailment in reducing bat fatalities at an Ohio wind energy facility
2025
Wind energy is important for achieving net-zero greenhouse gas emissions but also contributes to global bat mortality. Current strategies to minimize bat mortality due to collision with wind-turbine blades fall broadly into two categories: curtailment (limiting turbine operation during high-risk periods) and deterrence (discouraging bat activity near turbines). Recently, there has been interest in combining these strategies to achieve greater reductions in bat fatalities than either strategy might achieve in isolation. To investigate the effectiveness of combining curtailment with ultrasonic deterrent minimization strategies, we deployed six ultrasonic deterrents at nacelle height on 16 experimental turbines at Avangrid Renewables’ Blue Creek Wind Energy Facility. We rotated between four conditions (normal operations, curtailment only, deterrent only, curtailment and deterrent) randomly assigned to four wind turbines each night between 15 June and 3 October 2017. We found that bat mortality at wind turbines was independent of wind speed. The effectiveness of ultrasonic acoustic deterrents varied between high-frequency-calling species (eastern red bats) and low-frequency-calling species (hoary bats, silver-haired bats, and big brown bats). When deterrents were active, mortality was twice as high for eastern red bats compared to the control. Conversely, deterrents had a weak dampening effect on bat mortality for low-frequency species. We found no additive effects on mortality reduction for turbines operating both curtailment and deterrents compared to either approach in isolation. Our findings suggest that ultrasonic acoustic deterrents may not be effective for both high and low frequency echolocating bats. The increase in fatalities of eastern red bats is alarming and underscores the importance of considering site- and species-specific effects of minimization solutions.
Journal Article
Weighted Nuclear Norm Minimization and Its Applications to Low Level Vision
by
Meng, Deyu
,
Zuo, Wangmeng
,
Feng, Xiangchu
in
Artificial Intelligence
,
Computer Imaging
,
Computer Science
2017
As a convex relaxation of the rank minimization model, the nuclear norm minimization (NNM) problem has been attracting significant research interest in recent years. The standard NNM regularizes each singular value equally, composing an easily calculated convex norm. However, this restricts its capability and flexibility in dealing with many practical problems, where the singular values have clear physical meanings and should be treated differently. In this paper we study the weighted nuclear norm minimization (WNNM) problem, which adaptively assigns weights on different singular values. As the key step of solving general WNNM models, the theoretical properties of the weighted nuclear norm proximal (WNNP) operator are investigated. Albeit nonconvex, we prove that WNNP is equivalent to a standard quadratic programming problem with linear constrains, which facilitates solving the original problem with off-the-shelf convex optimization solvers. In particular, when the weights are sorted in a non-descending order, its optimal solution can be easily obtained in closed-form. With WNNP, the solving strategies for multiple extensions of WNNM, including robust PCA and matrix completion, can be readily constructed under the alternating direction method of multipliers paradigm. Furthermore, inspired by the reweighted sparse coding scheme, we present an automatic weight setting method, which greatly facilitates the practical implementation of WNNM. The proposed WNNM methods achieve state-of-the-art performance in typical low level vision tasks, including image denoising, background subtraction and image inpainting.
Journal Article
Fixed point and Bregman iterative methods for matrix rank minimization
2011
The linearly constrained matrix rank minimization problem is widely applicable in many fields such as control, signal processing and system identification. The tightest convex relaxation of this problem is the linearly constrained nuclear norm minimization. Although the latter can be cast as a semidefinite programming problem, such an approach is computationally expensive to solve when the matrices are large. In this paper, we propose fixed point and Bregman iterative algorithms for solving the nuclear norm minimization problem and prove convergence of the first of these algorithms. By using a homotopy approach together with an approximate singular value decomposition procedure, we get a very fast, robust and powerful algorithm, which we call FPCA (Fixed Point Continuation with Approximate SVD), that can solve very large matrix rank minimization problems (the code can be downloaded from
http://www.columbia.edu/~sm2756/FPCA.htm
for non-commercial use). Our numerical results on randomly generated and real matrix completion problems demonstrate that this algorithm is much faster and provides much better recoverability than semidefinite programming solvers such as SDPT3. For example, our algorithm can recover 1000 × 1000 matrices of rank 50 with a relative error of 10
−5
in about 3 min by sampling only 20% of the elements. We know of no other method that achieves as good recoverability. Numerical experiments on online recommendation, DNA microarray data set and image inpainting problems demonstrate the effectiveness of our algorithms.
Journal Article