Results 151 to 160 of about 9,046 (195)
Abstract Theories of corporate liquidity demand build on the notion that firms accumulate cash to safeguard their activities in the face of costly external finance. Monetary policy provides a clear source of exogenous variation in the external finance premium.
Benedicta Marzinotto
wiley +1 more source
Opening the Black Box of EU Digital Sovereignty: A Macro‐Level Analysis of the Concept's Development
ABSTRACT Digital sovereignty has emerged as a central organizing principle in European Union governance, yet systematic understanding of its conceptual evolution remains limited. This article provides the first macro‐level analysis of how digital sovereignty evolves across institutional and academic domains.
Aleksei Turobov +2 more
wiley +1 more source
Surgical Site Infection in Coronary Artery Bypass: Observational Study
ABSTRACT Background Preventing surgical site infections plays a crucial role in ensuring patient safety during coronary artery bypass grafting. To reduce incidence rates, it is essential to implement evidence‐based best practice measures. However, there is a noticeable lack of studies assessing healthcare professionals' adherence to these measures ...
Camila Vieira Gebhardt +5 more
wiley +1 more source
ABSTRACT Fieldwork is the cornerstone of empirical research in agrarian studies. Discussion about methodological options has, however, not kept up with the innovative conceptual developments taking place within the discipline. This is particularly evident in the study of social differentiation, a key concern in agrarian scholarship. Through a review of
Patrick Illien, Helena Pérez Niño
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Constructive complete distributivity. I
Mathematical Proceedings of the Cambridge Philosophical Society, 1990The relationships, in many cases equivalences, between lattice distributivity, adjunction and continuity have been studied by many authors, for example [1, 3–8, 12, 13, 15, 17–20, 22, 23]. Very roughly, we refer to the following circle of ideas. LetLbe an ordered set, andLa class of subsets ofL, and suppose thatLhas a supremum for each element inL.
Fawcett, Barry, Wood, R. J.
openaire +3 more sources
Constructive complete distributivity IV
Applied Categorical Structures, 1991AbstractA complete lattice, L, is constructively completely distributive, (CCD) (L), if the sup map defined on down-closed subobjects has a left adjoint. It was known that in Boolean toposes (CCD) (L) is equivalent to (CCD) (Lop). We show here that the latter property for all L (sufficiently, for Ω.) characterizes Boolean toposes.
Rosebrugh, Robert, Wood, R. J.
openaire +4 more sources
Boundedness and Complete Distributivity
Applied Categorical Structures, 2001In a previous paper [\textit{R. Rosebrugh} and \textit{R. J. Wood}, Appl. Categ. Struct. 2, No. 2, 119-144 (1994; Zbl 0804.06013)], the authors showed that there was a bi-equivalence between the 2-categories of constructively completely distributive lattices with sup-preserving arrows and that of the idempotent splitting completion of the 2-category of
Rosebrugh, R., Wood, R. J.
openaire +2 more sources
Distributed Tensor Completion Over Networks
ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2020The aim of this paper is to propose a novel distributed strategy for tensor completion, where (partial) data are collected over a network of agents with sparse, but connected, topology. The method hinges on the canonical polyadic decomposition, also known as PARAFAC, to complete the low-rank tensor in a distributed fashion.
Battiloro C., Di Lorenzo P.
openaire +2 more sources
2012 IEEE 12th International Conference on Data Mining, 2012
We discuss parallel and distributed algorithms for large-scale matrix completion on problems with millions of rows, millions of columns, and billions of revealed entries. We focus on in-memory algorithms that run on a small cluster of commodity nodes, even very large problems can be handled effectively in such a setup.
Teflioudi, C., Makari, F., Gemulla, R.
openaire +2 more sources
We discuss parallel and distributed algorithms for large-scale matrix completion on problems with millions of rows, millions of columns, and billions of revealed entries. We focus on in-memory algorithms that run on a small cluster of commodity nodes, even very large problems can be handled effectively in such a setup.
Teflioudi, C., Makari, F., Gemulla, R.
openaire +2 more sources
On defining ?completely distributive?
Algebra Universalis, 1984The author presents a simple self-dual law defining complete distributivity.
openaire +1 more source

