-
101
-
102
Bell Inequalities with One Bit of Communication
Published 2019-02-01“…We study Bell scenarios with binary outcomes supplemented by one bit of classical communication. We developed a method to find facet inequalities for such scenarios even when direct facet enumeration is not possible, or at least difficult. …”
Get full text
Article -
103
ASIC Implementation of Bit Matrix Multiplier
Published 2023-01-01“…In computer science and digital electronics, a bit matrix multiplier (BMM) is a mathematical operation that is used to quickly multiply binary matrices. …”
Get full text
Article -
104
-
105
Bit Performance in Directional Oil Wells
Published 2015-11-01Subjects: “…bit performance, directional well, drilling parameters, formation…”
Get full text
Article -
106
Hamiltonian memory: An erasable classical bit
Published 2021-03-01“…Erasing a bit of information requires probability concentration in phase space, which by Liouville's theorem is impossible in pure Hamiltonian dynamics. …”
Get full text
Article -
107
Bit Preservation: A Solved Problem?
Published 2010-06-01“…For years, discussions of digital preservation have routinely featured comments such as “bit preservation is a solved problem; the real issues are ...”. …”
Get full text
Article -
108
BİTLİS METAMORFİTLERİNDE YENİ YAŞ BULGULARI
Published 1981-12-01“…Henüz yürütülen çalışmaların bu aşamasında Bitlis Metamorfitleri'nde Devoniyen öncesi bir metamorfik temelin bulunduğu; bu temel üzerinde diskordansla yer alan şelf ortamına ait çökellerin en az ÜstTriyas'a değin uzandığı; Üst Triyas sonrası çökelme ortamına volkanotortullarm katıldığı ve tüm bu istifin içerisinde yer alan granitoyid kayaçlarla birlikte metamorfizma geçirdiği; metamorfizmasını daha önce tamamlamış okyanus kabuğu kökenli Senoniyen yaşlı kayaçların alana Üst Mestrihtiyen öncesi yerleştiği ve çalışma alanında metamorfitler üzerinde çökelmenin Üst Eosen sonrası sona erdiği saptanmıştır.…”
Get full text
Article -
109
Combined coding of bit planes of images
Published 2019-12-01“…The aim of this work is to reduce the computational complexity of lossless compression in the spatial domain due to the combined coding (arithmetic and Run-Length Encoding) of a series of bits of bit planes. Known effective compression encoders separately encode the bit planes of the image or transform coefficients, which leads to an increase in computational complexity due to multiple processing of each pixel. …”
Get full text
Article -
110
Symmetry in the Bit-Stream Converter Design
Published 2023-10-01Subjects: “…bit-stream converter…”
Get full text
Article -
111
-
112
Single-cell measurement quality in bits.
Published 2022-01-01“…Here, we show how information theory can be used to assess and compare single-cell measurement quality in bits, which provides a universally comparable metric for information content. …”
Get full text
Article -
113
Bit Preservation: A Solved Problem?
Published 2010-06-01“…This paper is in four parts: Claims, reviewing a typical claim of storage system reliability, showing that it provides no useful information for bit preservation purposes. Theory, proposing “bit half-life†as an initial, if inadequate, measure of bit preservation performance, expressing bit preservation requirements in terms of it, and showing that the requirements being placed on bit preservation systems are so onerous that the experiments required to prove that a solution exists are not feasible. …”
Get full text
Article -
114
Provably indeterminate 128-bit cipher
Published 1997-08-01“…Such functions are proposed for elaboration of the indeterminate ciphers with very large number of different modifications of the cryptalgorithm. A 128-bit undetermined cipher is described. The number of possible modifications is »1020R, where 2 Ј R Ј 7, R is the number of rounds. …”
Get full text
Article -
115
-
116
-
117
Bit Preservation: A Solved Problem?
Published 2010-06-01“…This paper is in four parts: Claims, reviewing a typical claim of storage system reliability, showing that it provides no useful information for bit preservation purposes. Theory, proposing “bit half-life†as an initial, if inadequate, measure of bit preservation performance, expressing bit preservation requirements in terms of it, and showing that the requirements being placed on bit preservation systems are so onerous that the experiments required to prove that a solution exists are not feasible. …”
Get full text
Article -
118
Lanthanide molecular nanomagnets as probabilistic bits
Published 2023-10-01“…Lanthanide-based molecular nanomagnets are bistable spin systems, generally conceptualised as classical bits, but many lanthanide complexes have also been presented as candidate quantum bits (qubits). …”
Get full text
Article -
119
Bit Preservation: A Solved Problem?
Published 2010-06-01“…This paper is in four parts: Claims, reviewing a typical claim of storage system reliability, showing that it provides no useful information for bit preservation purposes. Theory, proposing “bit half-life†as an initial, if inadequate, measure of bit preservation performance, expressing bit preservation requirements in terms of it, and showing that the requirements being placed on bit preservation systems are so onerous that the experiments required to prove that a solution exists are not feasible. …”
Get full text
Article -
120
Bit Preservation: A Solved Problem?
Published 2010-06-01“…This paper is in four parts: Claims, reviewing a typical claim of storage system reliability, showing that it provides no useful information for bit preservation purposes. Theory, proposing “bit half-life†as an initial, if inadequate, measure of bit preservation performance, expressing bit preservation requirements in terms of it, and showing that the requirements being placed on bit preservation systems are so onerous that the experiments required to prove that a solution exists are not feasible. …”
Get full text
Article