A positive integer n is called a CLT number if every group of order n satisfies the converse of Lagrange’s Theorem. In this note, we find all CLT and supersolvable numbers up to 1000. We also formulate some questions about the distribution of these numbers. RÉSUMÉ: Un nombre entier naturel n est appelé nombre CLT si tout groupe d’ordre n satisfait la réciproque du Théorme de Lagrange. Nous déte...

In recent work Cheon, Han, Lee, Ryu, and Stehlé presented an attack on the multilinear map of Coron, Lepoint, and Tibouchi (CLT). They show that given many low-level encodings of zero, the CLT multilinear map can be completely broken, recovering the secret factorization of the CLT modulus. The attack is a generalization of the “zeroizing” attack of Garg, Gentry, and Halevi. We first strengthen ...

Computer-supported collaborative learning (CSCL) environments, in particular environments where students share external representations, are discussed as an interesting area to applications of cognitive load theory (CLT). CSCL environments share a number of characteristics that will induce considerable cognitive load. This article reflects on characteristics of CSCL environments and external re...

Computer-supported collaborative learning (CSCL) environments, particularly environments where students share external representations, are discussed as an interesting area for the application of cognitive load theory (CLT). CSCL environments share a number of characteristics that will induce considerable cognitive load. This article reflects on the characteristics of CSCL environments and exte...

For Young systems, i. e. for hyperbolic systems without/with singularities satisfying Young’s axioms [You 98] (which imply exponential decay of correlation and the CLT) a local CLT is proven. In fact, a unified version of the local CLT is found, covering among others the absolutely contionuous and the arithmetic cases. For the planar Lorentz process with a finite horizon this result implies a.)...

– We provide numerical indications of the q-generalised central limit theorem that has been conjectured (Tsallis 2004) in nonextensive statistical mechanics. We focus on N binary random variables correlated in a scale-invariant way. The correlations are introduced by imposing the Leibnitz rule on a probability set based on the so-called q-product with q ≤ 1. We show that, in the large N limit (...

Abstract We establish a central-limit-theorem (CLT) version of the periodic Little’s law (PLL), which complements the sample-path and stationary versions of the PLL which we recently established in order to explain the remarkable accuracy in comparisons of data-generated model simulations to direct estimates from the data for the aggregate occupancy level in a hospital emergency department. Our...

For finite groups, we investigate both converse Lagrange theorem (CLT) orders and supersolvable (SS) orders, and see that the latter form a proper subset of the former. We focus on the difference between these two sets of orders, reformulate the work of earlier authors algorithmically, and construct a computer program to enumerate such NSS-CLT orders. We establish several results relating to NS...

INTRODUCTION Recently, we demonstrated that digestive tract cancer (DTC) is associated with reduced fibrin clot permeability and impaired fibrinolysis. AIM We investigated determinants of fibrinolysis in DTC patients. MATERIAL AND METHODS In 44 consecutive patients with DTC and 47 controls matched for age, sex, and cardiovascular risk, we evaluated fibrinolysis proteins, platelet activation...

BACKGROUND AND OBJECTIVES Weaning patients from mechanical ventilation is a challenge in the intensive care unit (ICU) practice and is related to some complications. One of these is the pos-extubation laryngospasm, an event that can be anticipated for the cuff leak test (CLT). The objective was demonstrate that the CLT is a simple, reliable and low costs method to available the presence of obst...