Abstract
Some might argue that ever so nimble and responsive innovation paradigms can rarely be managed scientifically. We propose a more inclusive perspective. Science of managing for innovation has certain characteristics which we identify through the acronym “ROTRUS”- Real-world, Observable, Testable, Replicable, Uncertain and Social. Real-world refers to the notion that innovation happens in practical settings, be bound by resources and capabilities. This real-world is the context in which the observable events occur. To progress the understanding of formative predictors and their impact on innovation, the innovation events need to be observable. This may be challenging if we are to believe that much of the innovation is driven by heuristics (see e.g. Lopez-Vega, Tell and Vanhaverbeke, 2016; Nisch and Veer, 2018). Observable evidence in our perspective does not mean it needs to be capable of being observed but includes events or phenomenon that were observed. In this sense, managerial heuristics once actioned become observed evidence, such that observable evidence is any evidence that can be or has been experienced by one or many, regardless of whether this can be observed by a third party. (...)

Abstract

Abstract
In order to enhance the scientific exploitation of adaptive optics (AO)-assisted observations, we investigate a novel hybrid concept to improve the parametric estimation of point spread function (PSF) called PSF Reconstruction and Identification for Multiple-source characterization Enhancement (PRIME). PRIME uses both focal and pupil-plane measurements to estimate jointly the model parameters related to the atmosphere [Cn2(h), seeing] and the AO system (e.g. optical gains and residual low-order errors). Photometry and astrometry are provided as by-products. The parametric model in use is flexible enough to be scaled with field location and wavelength, making it a proper choice for optimized on-axis and off-axis data-reduction across the spectrum. Here, we present the methodology and validate PRIME on engineering and binary Keck II telescope NIRC2 images. We also present applications of PSF model parameters retrieval using PRIME: (i) calibrate the PSF model for observations void of stars on the acquired images, i.e. optimize the PSF reconstruction process, (ii) update the AO error breakdown mutually constrained by the telemetry and the images in order to speculate on the origin of the missing error terms and evaluate their magnitude, and (iii) measure photometry and astrometry with an application to the triple system Gl569 images.

Abstract

Abstract
In this paper, we explore the use of reference values (predictors) for the optimal objective function value of hard combinatorial optimization problems, instead of bounds, obtained by data mining techniques, and that may be used to assess the quality of heuristic solutions for the problem. With this purpose, we resort to the rectangular two-dimensional strip-packing problem (2D-SPP), which can be found in many industrial contexts. Mostly this problem is solved by heuristic methods, which provide good solutions. However, heuristic approaches do not guarantee optimality, and lower bounds are generally used to give information on the solution quality, in particular, the area lower bound. But this bound has a severe accuracy problem. Therefore, we propose a data mining-based framework capable of assessing the quality of heuristic solutions for the 2D-SPP. A regression model was fitted by comparing the strip height solutions obtained with the bottom-left-fill heuristic and 19 predictors provided by problem characteristics. Random forest was selected as the data mining technique with the best level of generalisation for the problem, and 30,000 problem instances were generated to represent different 2D-SPP variations found in real-world applications. Height predictions for new problem instances can be found in the regression model fitted. In the computational experimentation, we demonstrate that the data mining-based framework proposed is consistent, opening the doors for its application to finding predictions for other combinatorial optimisation problems, in particular, other cutting and packing problems. However, how to use a reference value instead of a bound, has still a large room for discussion and innovative ideas. Some directions for the use of reference values as a stopping criterion in search algorithms are also provided.

Abstract