Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
17,196
result(s) for
"Programming Techniques"
Sort by:
Developing professional iPhone photography : using Photoshop, Lightroom, and other iOS and desktop apps to create and edit photos
\"Leverage the photo taking power of your iPhone with desktop and iOS apps to capture, retouch, manipulate, organize, and sell your photography. This book shows you how to edit photos using Adobe mobile apps and other apps, integrate Adobe mobile apps with desktop applications, such as Adobe Photoshop and Lightroom, and finally sell those photos online. Developing Professional iPhone Photography provides a practical guide to creating a professional photography portfolio with your iPhone and features iPhonoegraphy examples from professional photographers to showcase what can be done. You can then share your workflow with your desktop programs, such as Adobe Photoshop Mix, Photoshop Fix, and Lightroom appsiPhone camera and photography capabilities have dramatically improved to a professional level and mobile and desktop software have come right along with them. Now it's not only possible to take worthwhile photos on your phone but also to edit and develop them to a professional level.\"-- Provided by publisher.
Book
On the effectiveness of the test-first approach to programming
Test-driven development (TDD) is based on formalizing a piece of functionality as a test, implementing the functionality such that the test passes, and iterating the process. This paper describes a controlled experiment for evaluating an important aspect of TDD: in TDD, programmers write functional tests before the corresponding implementation code. The experiment was conducted with undergraduate students. While the experiment group applied a test-first strategy, the control group applied a more conventional development technique, writing tests after the implementation. Both groups followed an incremental process, adding new features one at a time and regression testing them. We found that test-first students on average wrote more tests and, in turn, students who wrote more tests tended to be more productive. We also observed that the minimum quality increased linearly with the number of programmer tests, independent of the development strategy employed.
Journal Article
Strong SOCP Relaxations for the Optimal Power Flow Problem
This paper proposes three strong second order cone programming (SOCP) relaxations for the AC optimal power flow (OPF) problem. These three relaxations are incomparable to each other and two of them are incomparable to the standard SDP relaxation of OPF. Extensive computational experiments show that these relaxations have numerous advantages over existing convex relaxations in the literature: (i) their solution quality is extremely close to that of the standard SDP relaxation (the best one is within 99.96% of the SDP relaxation on average for all the IEEE test cases) and consistently outperforms previously proposed convex quadratic relaxations of the OPF problem, (ii) the solutions from the strong SOCP relaxations can be directly used as a warm start in a local solver such as IPOPT to obtain a high quality feasible OPF solution, and (iii) in terms of computation times, the strong SOCP relaxations can be solved an order of magnitude faster than the standard SDP relaxation. For example, one of the proposed SOCP relaxations together with IPOPT produces a feasible solution for the largest instance in the IEEE test cases (the 3375-bus system) and also certifies that this solution is within 0.13% of global optimality, all this computed within 157.20 seconds on a modest personal computer. Overall, the proposed strong SOCP relaxations provide a practical approach to obtain feasible OPF solutions with extremely good quality within a time framework that is compatible with the real-time operation in the current industry practice.
Journal Article
Measuring Time Preferences
We review research that measures time preferences—i.e., preferences over intertemporal trade-offs. We distinguish between studies using financial flows, which we call “money earlier or later” (MEL) decisions, and studies that use time-dated consumption/effort. Under different structural models, we show how to translate what MEL experiments directly measure (required rates of return for financial flows) into a discount function over utils. We summarize empirical regularities found in MEL studies and the predictive power of those studies. We explain why MEL choices are driven in part by some factors that are distinct from underlying time preferences.
Journal Article
Adaptive Distributionally Robust Optimization
We develop a modular and tractable framework for solving an adaptive distributionally robust linear optimization problem, where we minimize the worst-case expected cost over an
ambiguity set
of probability distributions. The adaptive distributionally robust optimization framework caters for dynamic decision making, where decisions adapt to the uncertain outcomes as they unfold in stages. For tractability considerations, we focus on a class of second-order conic (SOC) representable ambiguity set, though our results can easily be extended to more general conic representations. We show that the adaptive distributionally robust linear optimization problem can be formulated as a classical robust optimization problem. To obtain a tractable formulation, we approximate the adaptive distributionally robust optimization problem using linear decision rule (LDR) techniques. More interestingly, by incorporating the primary and auxiliary random variables of the lifted ambiguity set in the LDR approximation, we can significantly improve the solutions, and for a class of adaptive distributionally robust optimization problems, exact solutions can also be obtained. Using the new LDR approximation, we can transform the distributionally adaptive robust optimization problem to a classical robust optimization problem with an SOC representable uncertainty set. Finally, to demonstrate the potential for solving management decision problems, we develop an algebraic modeling package and illustrate how it can be used to facilitate modeling and obtain high-quality solutions for medical appointment scheduling and inventory management problems.
The electronic companion is available at
https://doi.org/10.1287/mnsc.2017.2952
.
This paper was accepted by Noah Gans, optimization.
Journal Article
On the assessment of generative AI in modeling tasks: an experience report with ChatGPT and UML
Most experts agree that large language models (LLMs), such as those used by Copilot and ChatGPT, are expected to revolutionize the way in which software is developed. Many papers are currently devoted to analyzing the potential advantages and limitations of these generative AI models for writing code. However, the analysis of the current state of LLMs with respect to software modeling has received little attention. In this paper, we investigate the current capabilities of ChatGPT to perform modeling tasks and to assist modelers, while also trying to identify its main shortcomings. Our findings show that, in contrast to code generation, the performance of the current version of ChatGPT for software modeling is limited, with various syntactic and semantic deficiencies, lack of consistency in responses and scalability issues. We also outline our views on how we perceive the role that LLMs can play in the software modeling discipline in the short term, and how the modeling community can help to improve the current capabilities of ChatGPT and the coming LLMs for software modeling.
Journal Article