Results 31 to 40 of about 403,307 (296)
Information Processing Letters, 2002 This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed computations of the form $a^n$ mod m. The main contribution of this paper is a correction to the upper bound on the number of
William M. Y. Goh +2 more
openaire +3 more sources
Discrete Mathematics & Theoretical Computer Science, 2007 Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD), we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ''unique decipherability" at the level of the classes of the partition.
BURDERI, Fabio, RESTIVO, Antonio
openaire +4 more sources
Adaptive Partitioning for Large-Scale Dynamic Graphs [PDF]
, 2013 —In the last years, large-scale graph processing has gained increasing attention, with most recent systems placing particular emphasis on latency. One possible technique to improve runtime performance in a distributed graph processing system is to reduce
Martella, Claudio +13 more
core +1 more source
Membranolytic Activity of Bile Salts: Influence of Biological Membrane Properties and Composition
Molecules, 2007 The two main steps of the membranolytic activity of detergents: 1) the partitioning of detergent molecules in the membrane and 2) the solubilisation of the membrane are systematically investigated.
Alfred Blume +3 more
doaj +1 more source
The potential of model-based recursive partitioning in the social sciences - Revisiting Ockham's Razor [PDF]
, 2010 A variety of new statistical methods from the field of machine learning have the potential to offer new impulses for research in the social, educational and behavioral sciences.
Augustin, Thomas +2 more
core +2 more sources
Probabilistic Partitive Partitioning (PPP)
CoRR, 2020 Clustering is a NP-hard problem. Thus, no optimal algorithm exists, heuristics are applied to cluster the data. Heuristics can be very resource-intensive, if not applied properly. For substantially large data sets computational efficiencies can be achieved by reducing the input space if a minimal loss of information can be achieved.
openaire +3 more sources
Remobilization of Dry Matter and Nitrogen in Maize as Affected by Hybrid Maturity Class
Italian Journal of Agronomy, 2009 The length of the growing cycle is one of the most important traits determining hybrid adaptability to the environment. The objective of this research was to compare in a field trial the pattern of dry matter and nitrogen accumulation and remobilization ...
Silvia Pampana +3 more
doaj +1 more source
Soft Error Reliability Improvement of Digital Circuits by Exploiting a Fast Gate Sizing Scheme
IEEE Access, 2019 Due to the reduction in device feature size and supply voltage, achieving soft error reliability in sub-micrometer digital circuits is becoming extremely challenging.
Mohsen Raji +2 more
doaj +1 more source
Trace metal concentration and speciation in storm water runoff on impervious surfaces
Journal of Environmental Engineering and Landscape Management, 2015 Urban storm water runoff (USWR) often transports various trace metals, affecting the quality of receiving waters. Metal concentration and speciation in USWR were investigated by analysing data collected during a storm event on 19 July 2012.
Enrico Mancinelli +5 more
doaj +1 more source
IEEE Access, 2020 In this paper, we address mixed-criticality applications characterized by their safety criticality and time-dependent performance, which are virtualized on a Fog Computing Platform (FCP).
Mohammadreza Barzegaran +2 more
doaj +1 more source