نتایج جستجو برای: large blocks
تعداد نتایج: 1097471 فیلتر نتایج به سال:
Discrete time crystals (DTCs) are nonequilibrium phases of matter with exotic observable dynamics. Among their remarkable features is response to a periodic drive at fraction its frequency. Current successful experiments are, however, only limited realizing DTCs period-doubling and period-tripling dynamics, forming very small subset DTC phases. Creating larger in the laboratory remains longstan...
Here I present the third space as a methodology for contesting essentialist large-culture distortion and colonising of both researching engaging with intercultural. This is deep in structure intercultural studies everyday narratives that surround us major source prejudice false certainty. A third-space therefore requires constant uncomfortable deCentred questioning thinking-as-usual. The subseq...
An important architectural design decision aaecting the performance of coherent caches in shared-memory multiprocessors is the choice of block size. There are two primary factors that innuence this choice: the reference behavior of application programs and the remote access band-width and latency of the machine. Several studies have shown that increasing the block size can lower the miss rate a...
This report presents new four-round integral properties against the Rijndael cipher with block sizes larger than 128 bits. Using higher-order multiset distinguishers and other well-known extensions of those properties, the deduced attacks reach up to 7 and 8 rounds of Rijndael variants with 160 up to 256-bit blocks. For example, a 7-rounds attack against Rijndael-224 has a time complexity equal...
In this paper, we present some improved integral attacks on Rijndael whose block sizes are larger than 128 bits. We will introduce some 4-round distinguishers for Rijndael with large blocks proposed by Marine Minier (AFRICACRYPT 2009), and propose a new 4th-order 4-round distinguisher for Rijndael-192. Basing on these distinguishers, together with the partial sum technique proposed by Niels Fer...
Large scale ontology matching is a labour-intensive and timeconsuming process. To alleviate the problem, many automated solutions have been proposed. In order to avoid the drawbacks of the existing solutions, this paper proposes to cut down the number of concept pairs for which a similarity measure must be computed during ontology matching. More important, the main contribution is to deal subse...
Modulation of high-conductance chloride channels by eicosanoids, stilbene derivatives and Zn2+ ions was studied in cultured myoblasts (L6 rat muscle cell line) in excised and cell-attached membrane patches using a conventional patch clamp method. Arachidonic acid (AA) blocked the channel at concentrations 1-50 mumol/l from the internal side of the membrane in excised (inside out) patches with a...
A t − (n, k, ) design is a k-uniform hypergraph with the property that every set of t vertices is contained in exactly of the edges (blocks). A partial t − (n, k, ) design is a k-uniform hypergraph with the property that every set of t vertices is contained in at most edges; or equivalently the intersection of every set of + 1 blocks contains fewer than t elements. Let us denote by f (n, k, t) ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید