An element contains a name, a namespace, a MIME type, and a binary array of data.
元素包含了名称、名称空间、MIME类型和二进制数据数组。
For all formats, the document content should be passed to the server as a binary array.
对于所有格式,文档内容应该以二进制数组形式传递给服务器。
Given a binary array, find the maximum number of consecutive 1s in this array.
给定一个二进制数组,计算数组中出现的最大连续1的个数。
The relationship between differences set pairs and perfect binary array pairs is given.
研究了差集偶的性质,给出了差集偶与最佳二进阵列偶之间的关系。
Theoretical basis for using differences set pairs to research perfect binary array pairs is provided.
为应用差集偶这种区组设计的方法研究最佳二进阵列偶提供了理论依据。
Given a binary array, find the maximum number of consecutive 1s in this array if you can flip at most one 0.
给定一个二进制数组,如果允许将至多一个0翻转成1,求最大连续1的个数。
The concept of distance used in binary array representations of images is applied to a linear quadtree representation.
二元数组表示的图象使用的距离概念运用于线性四元树表示。
The uniqueness of pseudorandom binary array pairs and pseudorandom binary sequence pairs are proved as the specific cases of binary array pairs with two-level autocorrelation.
提出并证明了二值自相关二进阵列偶的唯一性问题,将伪随机二进阵列偶和伪随机二进序列偶作为其特例证明也满足唯一性。
The conception "almost perfect arrays" is proposed and it is shown that the existence of an almost perfect binary array is equivalent to the existence of a certain divisible difference set.
研究了密码中的拟完美序列和完美序列与循环差集的关系,用群表示论证明了三族循环差集的存在;进而构造出相应的拟完美序列。
The conception "almost perfect arrays" is proposed and it is shown that the existence of an almost perfect binary array is equivalent to the existence of a certain divisible difference set.
研究了密码中的拟完美序列和完美序列与循环差集的关系,用群表示论证明了三族循环差集的存在;进而构造出相应的拟完美序列。
应用推荐