نتایج جستجو برای: minimal authorized subsets
تعداد نتایج: 199025 فیلتر نتایج به سال:
Rare cell populations play a pivotal role in the initiation and progression of diseases such as cancer. However, the identification of such subpopulations remains a difficult task. This work describes CellCnn, a representation learning approach to detect rare cell subsets associated with disease using high-dimensional single-cell measurements. Using CellCnn, we identify paracrine signalling-, A...
In a proxy signature scheme, a potential signer delegates his signing capability to a proxy entity, who signs a message on behalf of the original signer. All the proposals of proxy signature schemes made until now have been based on Schnorr's signature scheme. Threshold versions of these schemes have also been proposed, in which the power of the proxy signer is distributed among a group of play...
The purpose of this paper is to study the relationship between columnar aerosol optical thickness and ground-level aerosol mass. A set of Sun photometer, elastic backscattering lidar and TEOM measurements were acquired during April 2007 in Lille, France. The PM2.5 in the mixed boundary layer is estimated using the lidar signal, aerosol optical thickness, or columnar integrated Sun photometer si...
Agronomical applications of cloned livestock produced by somatic cell nuclear transfer (SCNT) have been authorized in the United States and the European Food Safety Authority published that there was no evidence of risks associated with the use of cloned animal in the breeding industry. Both assessments, however, underlined that complementary data are needed to update their conclusions. SCNT is...
A subset C of an abelian group G is said to be a minimal additive complement W⊆G if C+W=G and C′+W≠G for any proper C′⊂C. In this paper, we study certain subsets the integers that arise or do not as complements. Following suggestion Kwon, show bounded-below sets with arbitrarily large gaps Moreover, our construction shows such set belongs co-minimal pair, strengthening result Biswas Saha lacuna...
Secret sharing allows distributing a secret among several parties such that only authorized subsets, specified by an access structure, can reconstruct the secret. Sehrawat and Desmedt (COCOON 2020) introduced hidden structures, remain until some subset of collaborate. However, their scheme assumes semi-honest supports restricted structures. We address these shortcomings constructing structure h...
Secret sharing is that a dealer distributes a piece of information (called a share) about a secret to each participant such that authorized subsets of participants can reconstruct the secret but unauthorized subsets of participants cannot determine the secret. If any unauthorized subset of participants can not obtain any more information regarding the secret, then the scheme is called perfect. ...
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence. We consider the problems of enumerating such subsets with and without order, and show hardness results that already hold for the propositional Horn fragment, or for the Description Logic EL. We show complexity results...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید