19 research outputs found
Improvement of Spreadsheet Quality through Reduction of End-User Overconfidence: Case Study
This paper is prompted by and based on earlier research into developers' overconfidence as one of the main causes of spreadsheet errors. Similar to related research, the aim of the paper was to ascertain the existence of overconfidence, and then examine the possibility of its reduction by means of experimental treatment designed for the needs of the research. A quasi-experiment was conducted to this end, in which 62 students of the Faculty of Economics of the University of Novi Sad participated, divided into the experimental and control group. Participants of both groups developed domain free spreadsheets in two iterations each. After the first iterations, students in the experimental group were subjected to experimental treatment: they attended lectures on spreadsheet errors taxonomies supported by real-life examples, and about spreadsheet best practices in the area of spreadsheet error prevention. Results showed that spreadsheet developers who were informed about spreadsheet error taxonomies and spreadsheet best practices create more accurate spreadsheets and are less self-confident in terms of accuracy of their spreadsheets
Review on computational methods for Lyapunov functions
Lyapunov functions are an essential tool in the stability analysis of dynamical systems, both in theory and applications. They provide sufficient conditions for the stability of equilibria or more general invariant sets, as well as for their basin of attraction. The necessity, i.e. the existence of Lyapunov functions, has been studied in converse theorems, however, they do not provide a general method to compute them. Because of their importance in stability analysis, numerous computational construction methods have been developed within the Engineering, Informatics, and Mathematics community. They cover different types of systems such as ordinary differential equations, switched systems, non-smooth systems, discrete-time systems etc., and employ di_erent methods such as series expansion, linear programming, linear matrix inequalities, collocation methods, algebraic methods, set-theoretic methods, and many others. This review brings these different methods together. First, the different types of systems, where Lyapunov functions are used, are briefly discussed. In the main part, the computational methods are presented, ordered by the type of method used to construct a Lyapunov function
What about the Chief Digital Officer? A Literature Review
Digital transformation is becoming more ingrained into everyday life and is a talking point among researchers today. It has been evident from the growing number of publications that have focused on various aspects of digital transformation in the last few years. Based on the number of papers published, one of them is of much less interest to researchers: the managerial role of Chief Digital Officer (CDO) inherent in digital transformation. Having this in mind, a systematic literature review was conducted to elucidate the CDO’s role, duties, and required competencies. In this paper, the results and conclusions of 22 papers are presented based on the search criteria outlined by the Web of Science and Scopus index databases. It is obvious that managing digital transformation is becoming more important as digital transformation affects almost every sector of business. The purpose of this study is to examine the position of Chief Digital Officer in terms of its position, role, and responsibilities as well as its necessary competencies. The results of this study could serve as the basis for future research in this area, which judging by the relevance of the topic, will certainly be more intensive
Corrigendum to “the Minkowski–Lyapunov equation for linear dynamics: theoretical foundations” (The Minkowski–Lyapunov equation for linear dynamics: theoretical foundations (2014) 50(8) (2015–2024)
Theorem 1 of Raković and Lazar (2014) accidentally misquotes Theorem 1.7.1 of Schneider (1993). This corrigendum rectifies this misquotation, and it points out that the results developed in Raković and Lazar (2014) are not affected by this misquotation. Since Theorem 1.7.1 of Schneider (1993) is utilized in two places in Raković and Lazar (2014), the corrigendum also clarifies its utilization so as to avoid any ambiguity
Corrigendum to “the Minkowski–Lyapunov equation for linear dynamics:theoretical foundations” (The Minkowski–Lyapunov equation for linear dynamics: theoretical foundations (2014) 50(8) (2015–2024)
\u3cp\u3eTheorem 1 of Raković and Lazar (2014) accidentally misquotes Theorem 1.7.1 of Schneider (1993). This corrigendum rectifies this misquotation, and it points out that the results developed in Raković and Lazar (2014) are not affected by this misquotation. Since Theorem 1.7.1 of Schneider (1993) is utilized in two places in Raković and Lazar (2014), the corrigendum also clarifies its utilization so as to avoid any ambiguity.\u3c/p\u3
A New Dual-Mode Hybrid MPC Algorithm with a Robust Stability Guarantee
This paper employs the Input-to-State Stability (ISS) framework to investigate the robustness of discrete-time Piece-Wise Affine (PWA) systems in closed-loop with Model Predictive Controllers (MPC), or hybrid MPC for short. We show via an example taken from literature that stabilizing hybrid MPC can generate MPC values functions that are not ISS Lyapunov functions for arbitrarily small additive disturbances. As a consequence, it is not easy to prove that nominally stabilizing hybrid MPC schemes are robust. This motivates the need to design MPC schemes for hybrid systems with an a priori robust stability guarantee. A possible solution to this problem was recently developed by the authors for a particular class of PWA systems, i.e. when the origin lies in the interior of one of the regions in the partition. The main contribution of this paper is a novel dual-mode MPC algorithm for hybrid systems with an a priori ISS guarantee. This MPC scheme is applicable to general PWA systems, i.e. when the origin may lie on the boundaries of multiple regions in the partition.</p