Search results for " Complexity"
showing 10 items of 623 documents
Challenge Demands and Resilience
2022
Abstract. This study investigates the relationship of challenge demands (i. e., time pressure, job complexity) on employee resilience. We provide insights into potential pathways (i. e., learning, cognitive irritation) for how challenge stressors influence employee resilience. We employed a two-wave, time-lagged design to examine the influences of challenge stressors and explanatory pathways on employee resilience 2 months later. The data from 359 participants (52.1 % male) were analyzed using a Bayesian time-lagged path model. Results indicate that time pressure and job complexity are negatively related to employee resilience via cognitive irritation. In contrast, we found a positive, ind…
Cash pooling: An organizational response to institutional complexity
2020
The paper aims to explain how new cash management practices can be used to address institutional complexity in Multinational Enterprises (MNEs) and which are the effects on the organizational form....
Effects of Kolmogorov complexity present in inductive inference as well
1997
For all complexity measures in Kolmogorov complexity the effect discovered by P. Martin-Lof holds. For every infinite binary sequence there is a wide gap between the supremum and the infimum of the complexity of initial fragments of the sequence. It is assumed that that this inevitable gap is characteristic of Kolmogorov complexity, and it is caused by the highly abstract nature of the unrestricted Kolmogorov complexity.
Inductive inference of recursive functions: Complexity bounds
2005
This survey includes principal results on complexity of inductive inference for recursively enumerable classes of total recursive functions. Inductive inference is a process to find an algorithm from sample computations. In the case when the given class of functions is recursively enumerable it is easy to define a natural complexity measure for the inductive inference, namely, the worst-case mindchange number for the first n functions in the given class. Surely, the complexity depends not only on the class, but also on the numbering, i.e. which function is the first, which one is the second, etc. It turns out that, if the result of inference is Goedel number, then complexity of inference ma…
Non-intersecting Complexity
2006
A new complexity measure for Boolean functions is introduced in this article. It has a link to the query algorithms: it stands between both polynomial degree and non-deterministic complexity on one hand and still is a lower bound for deterministic complexity. Some inequalities and counterexamples are presented and usage in symmetrisation polynomials is considered.
On the local and semilocal convergence of a parameterized multi-step Newton method
2020
Abstract This paper is devoted to a family of Newton-like methods with frozen derivatives used to approximate a locally unique solution of an equation. We perform a convergence study and an analysis of the efficiency. This analysis gives us the opportunity to select the most efficient method in the family without the necessity of their implementation. The method can be applied to many type of problems, including the discretization of ordinary differential equations, integral equations, integro-differential equations or partial differential equations. Moreover, multi-step iterative methods are computationally attractive.
Tailored retrieval of health information from the web for facilitating communication and empowerment of elderly people
2020
A patient, nowadays, acquires health information from the Web mainly through a “human-to-machine” communication process with a generic search engine. This, in turn, affects, positively or negatively, his/her empowerment level and the “human-to-human” communication process that occurs between a patient and a healthcare professional such as a doctor. A generic communication process can be modelled by considering its syntactic-technical, semantic-meaning, and pragmatic-effectiveness levels and an efficacious communication occurs when all the communication levels are fully addressed. In the case of retrieval of health information from the Web, although a generic search engine is able to work at…
System Dynamics : Theory and Applications ; Edited by Brian Dangerfield
2021
The Springer volume on “System Dynamics. Theory and Applications” (2020), edited by Brian Dangerfield, substantially contributes to strengthening the position of feedback modeling and simulation in both research and practice in various policy analysis domains. The 23 chapters, of which the book consists, cover a wide scope of fields ranging from theory and methodology (part II) to practical applications of system dynamics (SD) to solve different real-life problems (part III). In particular, the methodological chapters provide a suitable conceptual framework for the subsequent chapters which illustrate the benefits from applying SD to specific policy fields and contexts. A well-balanced mix …
WITHDRAWN: Corrigendum to “Detection of change in persistence of a linear time series”: [J. Econom. 95 (2000) 97–116]
2001
The S01 − Λ(1405) and − Λ(1670) resonances in meson-baryon unitarized coupled channel chiral perturbation theory
2003
Abstract The s-wave meson-baryon system with strangeness S = −1 and isospin I = 0 is studied using the Bethe-Salpeter coupled channel formalism incorporating Chiral Symmetry. The needed two particle irreducible potential is taken from lowest order Chiral Perturbation Theory in a relativistic formalism. The K N, πΣ, νΛ , and KΞ two-body channels have been included. Off-shell behavior is parameterized in terms of low energy constants, which outnumber those assumed in previous works and provide a better fit to the data. The masses, widths and branching ratios of the Λ(1405) and Λ(1670) resonances are determined. In our model, we find no one but two resonances in the Λ(1405) region.