最小元

B 95 BIT 位元- The smallest amount of data. One binary digit.

资料的最小单位，一个二进位位数。

In this thesis, the concept of L-graphfor a complete lattice with a largest element 1 and a smallest element 0 (0≠1)is introduced, which is generalization of fuzzy graph, and the main properties ofL-graphs are studied systematically.

在此基础上，本文就有最大元1和最小元0(0≠1)的完备格L，给出了L-图的概念，并较为系统地研究了L-图的一系列性质。

Firstly, it's proved that the base of free monoid is unique, and that the equation of a base, a generating set and a irreducible generating set in the semigroup with length; Secondly, it's given the relation of a primitive word and a word of indecomposable--Let and is indecomposable, then is primitive ;And by using the length's method and chart,some properties of primitive word have been proved and the solutions of the equation , are discussed; Lastly, on the base of some proposition in Free monoids and Languages ,the proofs of some properties are improved by instruction. For example: Let be a primitive word over X, where .Then is a code. And let then if and only if {} is a code.

首先，讨论了含幺半群中基的基本性质及基与最小生成元集的联系，并给出了含幺半群中基、生成元集、不可约生成元集三者之间的关系；证明了在有唯一长度的半群S中，不可约生成元集、基、最小生成元集三者之间的等价关系；其次，讨论了字的组合与分解性，得出了字的本原性与不可分解性之间的关系---若为不可分解的，则一定是本原的，反之，不一定真；并运用图示法证明了字的可补性理论，讨论了方程，的可解性；在此基础上，用归纳法进一步证明了本原字与码的有关命题--若是X上的一个本原字，其中，则是一个码；若则当且仅当{}是一个码。

Secondly we prove that〓can be embedded into d-r.e degrees preserving the leastand greatest element.

其次我们证明了〓能嵌入到d-r.e。度结构中，并保持最大元与最小元。

A beamforming algorithm of array with virtual based on least squares estimator is presented, and the modified algorithm is proposed further. In this thesis, we also study the beamforming algorithm of array with virtual elements based on time delay and summation.

提出了基于线性预测的虚拟阵元波束形成方法，提出了基于最小二乘估计的虚拟阵元波束形成方法，并进一步提出了基于最小二乘估计的虚拟阵元波束形成方法的改进方法，最后研究了延迟求和虚拟阵元波束形成方法。

Moreover, it is obtained that, if X is a core compact and locally connected space, then the Isbell and Scott topologies agree on functions space for all continuous L-Domain L with a least element if and only if X is an RW-space.

而且还证明了，若X是核紧的局部连通空间，则对所有有最小元的连续L-DomainL，上的Isbell拓扑和Scott拓扑相同当且仅当X是RW-空间。

In vector optimization one investigates optimal elements such as minimal, strongly minimal, properly minimal or weakly minimal elements of a nonempty subset of a partially ordered linear space.

前言在向量最优化中，人们研究偏序线性空间中非空子集的最优元，比如极小元，强极小元，真极小元或者弱极小元。

In the last of this dissertation, we give necessary and sufficient conditions for the existence of and the expressions of perpositive semidefinite solutions and bipositive semidefinite solutions to some systems of quaternion matrix equations.

给出了某些四元数矩阵方程组有广亚半正定解，双半正定解的充要条件及其表达公式；研究了矩阵方程组的最小二乘解，极小范数的最小二乘解，在某些约束条件下的最小二乘解和极小范数的最小二乘解，给出了其有这些解的充要条件及其表达公式。

Two complemented lattices L_1, L_2 are said to be of the same "type" if they have identical sets of tautologies.

一个具有最小元O及最大元I的格L，如果在其中又定义了一个单值的1元运算&′&能适合O′=I，I′'=O，则称L为一可补格，一个命题演算良构式A(设只含命题连接词A，V，～)，如果命它的变数在L中任意取值且将A，V，～分别解释为L中的运算∩，U，′时，A永远得到值I，则称A为L上的恒I式，当两个可补格L_1，L_2上的恒I式集相同时，称L_1，L_2为同型的，本文就是讨论可补格按同型关系分类的问题，所得结果如下：定理设有限可补格L_2适合条件：，存在一良构式A能使则任一可补格L_1与L_2同型的一个充分必要条件是：(A_1)。

Under Z-condition and strict pseudomonotonicity assumptions, we establish the equivalences among the equilibrium problem, the least element problem of the feasible set, and a related optimization problem.

在Z-条件及严格单调性假设下，我们得到：均衡问题、均衡问题可行集的最小元问题以及一个相关的优化问题等价。

As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.

每逢看到沃林顿那刚毅的脸，那乌黑、忧郁的眼睛，她便会相信，他一定作过不幸的爱情的受害者。

Maybe they'll disappear into a pothole.

也许他们将在壶穴里消失