Search results for " Complexity"
showing 10 items of 623 documents
Mediating role of job satisfaction, affective well-being and health in the relationship between indoor environment and absenteeism: work patterns mat…
2018
BACKGROUND: Office workers spend long hours in their workplace, and these environments impact their well-being and performance. This relationship can involve different mediation chains. The degree of complexity of this relationship can vary depending on different types of office work (work patterns) employees carry out. OBJECTIVE: To analyze the relationship between indoor environment and absenteeism, and the mediating role of job satisfaction, affective well-being, and health, in different work patterns. METHOD: 1306 office workers from different European countries were classified into work patterns depending on: task complexity and interactivity. RESULTS: Job satisfaction, affective well-…
Comorbidity does not mean clinical complexity: evidence from the RePoSI register
2019
In the last 2–3 decades internists have confronted dramatic changes in the pattern of patients acutely admitted to hospital wards. Internists observed a shift from younger subjects affected by a single organ disease to more complex patients, usually older, with multiple chronic conditions, attended by different specialists, with poor integration and treated with multiple drugs. In this regard, the concept of complex patients is addressed daily in clinical practice even if there is no agreed definition of patient complexity. To try to evaluate clinical complexity different instruments have been proposed. Among these, the number of comorbidities (NoC) was considered a marker of clinical compl…
The effect of choice complexity on perception of time spent choosing: When choice takes longer but feels shorter
2009
Two studies examine the effect of the complexity of the choice environment on the perceived duration of the time spent choosing. The experiments demonstrate that the estimation of the time spent making a decision is affected by the number of options available in the choice set. In Experiment 1, participants having to choose 1 of 24 mobile phones tended to underestimate the time spent whereas participants confronted with the choice of 6 mobile phones tended to overestimate the actual time spent. Experiment 2 corroborates this finding, in the presence of varying degrees of attribute correlation. We conclude with theoretical and practical implications for marketers. © 2009 Wiley Periodicals, I…
Real Time Stereo Matching Using Two Step Zero-Mean SAD and Dynamic Programing
2018
Dense depth map extraction is a dynamic research field in a computer vision that tries to recover three-dimensional information from a stereo image pair. A large variety of algorithms has been developed. The local methods based on block matching that are prevalent due to the linear computational complexity and easy implementation. This local cost is used on global methods as graph cut and dynamic programming in order to reduce sensitivity to local to occlusion and uniform texture. This paper proposes a new method for matching images based on a two-stage of block matching as local cost function and dynamic programming as energy optimization approach. In our work introduce the two stage of th…
Exploiting Reaction-Diffusion Conditions to Trigger Pathway Complexity in the Growth of a MOF.
2021
Coordination polymers (CPs), including metal–organic frameworks (MOFs), are crystalline materials with promising applications in electronics, magnetism, catalysis, and gas storage/separation. However, the mechanisms and pathways underlying their formation remain largely undisclosed. Herein, we demonstrate that diffusion-controlled mixing of reagents at the very early stages of the crystallization process (i.e., within ≈40 ms), achieved by using continuous-flow microfluidic devices, can be used to enable novel crystallization pathways of a prototypical spin-crossover MOF towards its thermodynamic product. In particular, two distinct and unprecedented nucleation-growth pathways were experimen…
The guarded fragment with transitive guards
2004
The guarded fragment with transitive guards, (GF+TG), is an extension of the guarded frag- ment of 9rst-order logic, GF, in which certain predicates are required to be transitive, transitive predicate letters appear only in guards of the quanti9ers and the equality symbol may appear everywhere. We prove that the decision problem for (GF+TG) is decidable. Moreover, we show that the problem is in 2EXPTIME. This result is optimal since the satis9ability problem for GF is 2EXPTIME-complete (J. Symbolic Logic 64 (1999) 1719-1742). We also show that the satis- 9ability problem for two-variable (GF+TG) is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satis9ability …
Resource allocation for OFDMA systems with multi-cell joint transmission
2012
This paper considers the downlink resource allocation of a coordinated multi-cell cluster in OFDMA systems with universal frequency reuse. Multi-cell joint transmission is considered via zero-forcing precoding. Furthermore, joint optimization of the user selection and power allocation across multiple subchannels and multiple cells is studied. The objective is to maximize the weighted sum rate under per-base-station power constraints. Based on general duality theory, two iterative resource allocation algorithms are proposed and compared with the optimal solution, which requires an exhaustive search of all possible combinations of users over all subchannels. Simulation results show that the t…
Data-Driven Pump Scheduling for Cost Minimization in Water Networks
2021
Pumps consume a significant amount of energy in a water distribution network (WDN). With the emergence of dynamic energy cost, the pump scheduling as per user demand is a computationally challenging task. Computing the decision variables of pump scheduling relies over mixed integer optimization (MIO) formulations. However, MIO formulations are NP-hard in general and solving such problems is inefficient in terms of computation time and memory. Moreover, the computational complexity of solving such MIO formulations increases exponentially with the size of the WDN. As an alternative, we propose a data-driven approach to estimate the decision variables of pump scheduling using deep neural netwo…
Combined K-Best sphere decoder based on the channel matrix condition number
2008
It is known that sphere decoding (SD) methods can provide maximum-likelihood (ML) detection over Gaussian MIMO channels with lower complexity than the exhaustive search. Channel matrix condition number represents an important influence on the performance of usual detectors. Throughout this paper, two particular cases of a SD method called K-Best carry out a combined detection in order to reduce the computational complexity with predictable performance degradation. Algorithm selection is based on channel matrix condition number thresholding. K-Best is a suboptimal SD algorithm for finding the ML solution of a detection problem. It is based on a fixed complexity tree search, set by a paramete…
A challenging family of automata for classical minimization algorithms
2010
In this paper a particular family of deterministic automata that was built to reach the worst case complexity of Hopcroft's state minimization algorithm is considered. This family is also challenging for the two other classical minimization algorithms: it achieves the worst case for Moore's algorithm, as a consequence of a result by Berstel et al., and is of at least quadratic complexity for Brzozowski's solution, which is our main contribution. It therefore constitutes an interesting family, which can be useful to measure the efficiency of implementations of well-known or new minimization algorithms.