查询词典 lattice cell

Based on the outcome of Xu Yang and Qin Keyun about lattice implication algebra and lattice-valued prepositional logic LP with truth-value in a lattice implication algebra, the author studied the properties of lattice implication algebra and the α-automated reasoning method based on α-resolution principle of LP. The specific contents are as follows: The Study of Lattice Implication Algebra On the basis of previous results of lattice implication algebra, this part consists of the following three points: 1. Some properties of lattice implication algebra L were discussed, and some important results were given if L was a complete lattice implication algebra. 2. The properties of left idempotent elements of lattice implication algebras were discussed, and the conclusion that lattice implication algebra L was equals of the directed sum of the range and dual kernel of a left map constructed by a left idempotent element was proved. 3. The properties of the filters of lattice implication algebra were discussed, the theorem was shown that they satisfy the hypothetical syllogism and substitute theorem of the propositional logic. 4. The concept of weak niters of lattice implication algebras and their properties and structures are discussed. It is proved that all weak filters of a lattice implication algebra form a topology and the the implication isomorphism betweem two lattice implication algebras is a topological mapping between their topological spaces. The Study of α-automated reasoning method based on the lattice-valued propositional logic LP In this part, the author given an a-automated reasoning method based on the lattice-valued propositional logic LP.

本文基于徐扬和秦克云的关于格蕴涵代数和以格蕴涵代数为真值域的格值命题逻辑系统LP的研究工作，对格蕴涵代数以及格值命题逻辑系统LP中基于α-归结原理的自动推理方法进行了系统深入的研究，主要有以下两方面的研究成果：一、关于格蕴涵代数的研究 1、对格蕴涵代数的格论性质进行了研究，得到了当L为完备格蕴涵代数时，关于∨，∧，→运算的一些结果； 2、对格蕴涵代数的左幂等元进行了研究，证明了格蕴涵代数L可以分解为任何一个左幂等元所对应的左映射的像集合与其对偶核的直和； 3、对格蕴涵代数的滤子的性质进行了研究，证明了滤子的结构相似于逻辑学中的Hypothetical syllogism规则和替换定理； 4、给出了格蕴涵代数中弱滤子的概念，对弱滤子的性质个结构进行了研究，证明了格蕴涵代数的全体弱滤子构成一个拓扑结构，格蕴涵代数之间的蕴涵同构是相应的拓扑空间之间的拓扑映射。

Based on the traits of dyadic wavelet decomposition of signal and that of the distribution of wavelet image coefficients, PLVQ and ZR are conjoined by making use of D\-4 lattice. Firstly, Pyramidal lattice vector quantization is adopted to quantize wavelet image coefficients. Nonzero lattice vectors and zero lattice vectors are formed. Secondly, nonzero lattice vectors are dealt with by adopting complex entropy coding. Finally, in order to fix on the position of nonzero lattice vector effectively, that is, to deal with zero lattice vectors effectively, the concept of significant map is introduced into. The significant map is scanned two times from down to up and from up to down.

根据信号的二进小波分解特点和小波图象系数的分布特点，利用D\-4格将PLVQ和零树结合起来，提出了一种基于零树和金字塔格型矢量量化的小波图象编码方法，该方法首先采用金字塔格型矢量方法来量化小波图象系数，以得到非零格点和零格点；然后采用复合熵编码来处理非零格点；最后为了有效确定非零格点的位置，也就是为了有效地处理零格点，又引进了重要图的概念。

The concepts of weight lattice structure, sphere lattice structure and lienor lattice structure are introduced to describe it, some properties of the k-error lattice structure are given, and a relationship between the k-error lattice structure and the k-error linear complexity is presented. These create a elementary frame of the stability theory of the lattice structure.

提出了伪随机序列格结构的稳定性问题，引入重量格结构、球体格结构、k-错格结构等概念来描述之，给出了k-错格结构的一些基本性质，并研究了k-错格结构与k-错线性复杂度的关系。

Secondly, in a more generalized framestructrue--lattice-ordered monoids,the notion of lattice-valued Mealy-type automata is introduced,we traverse some algebraic properties of this automata and investigate the congruences and homomorphisms of this type automata.Our main results indicate that the algebraic properties of lattice-valued Mealy-type automata have Close links to the algebraic properties of lattice-ordered monoids which automata take values in.Futhermore we study the minimization of lattice-valued Mealy-type automata and provide an algorithm to achieve the minimal lattice-valued Mealy-type automata within finite steps.

其次，在更一般的框架—格半群意义下，提出具有输入和输出字符的自动机——格值Mealy自动机的概念，从代数角度出发较详细地研究了此类自动机具有的性质，同时研究了此类自动机的同余和同态，揭示了此类自动机的代数性质和格半群的紧密联系，最终研究了格值Mealy自动机的极小化问题，并给出了在有限步可实现此极小化的算法。

Due to the complexity of the cell jitter, the NonSynchronous Tining Recovery methods are currently not mature With the emphasis being given to the Class A CBR traffic, this paper analyzes the performance of the queueing delay and cell jitter at the source node and intermediate nodes, and discusses the Source Timing Recovery at the destination node in ATM networks Firstly, this paper presents a description of the cell jitter of CBR traffic, and gives the definitions of two kinds of cell jitter regarding the Source Timing Recovery for CBR traffic Then, by using exact mathematical models and analysis methods, this paper analyzes the impact of the factors, such as the capacity of the queueing buffer, the randomness, the deterministic nature and the correlation in cell arrivals of the background traffic sources, on the queueing delay and cell jitter performance of the CBR traffic through Statistical Multiplexitng To obtain an insight into the power spectral distribution and look for better schemes for the depression and filtering of the cell jitter, within the analyses we succeed deriving the power spectrum of the cell jitter for CBR traffic Hence, not only the power spectral distribution of the cell jitter can in the frequency domain be qualitatively understood, but also can the rms (root-meansquare) value of the cell jitter be quantitatively obtained so as to more accurately measure the amplitude of the jitter In the end-to-end performance analysis of the queueing delay and cell jitter, we propose a kind of quasi-periodic cell stream model to characterize the jittered CBR traffic, and present an initial queueing analysis of the CBR traffic following such a model at a generic intermediate node Additionally, we briefly discuss the buildout/playout and Source Timing Recovery functions of the destination node Finally, regarding the Source Timing Recovery of CBR traffic, this paper systematically discusses several important principles of the cell jitter filtering and depression reported in the literature, introduces several implementation schemes of the Source Timing Recovery e.

由于信元抖动的复杂性，非同步定时恢复方法目前还很不成熟。本文针对A类CBR业务流在ATM网络源节点和中间节点的排队时延和信元抖动性能，以及在目的节点的源定时恢复问题作了较为全面的研究。首先，文中描述了CBR业务流的信元抖动，并具体地给出了两种与CBR业务源定时恢复有关的信元抖动的定义。然后，采用了精确的数学模型和分析方法，有针对性地分析了业务背景中信元到达的纯随机性、确定性和相关性以及排队缓存器容量等因素对CBR业务流经过统计复用后的排队时延和信元抖动性能的影响。为了了解信元抖动的功率频谱分布和寻求更好的抑制和滤除抖动的方法，在性能分析中，我们成功地完成了CBR业务流信元抖动的功率谱分析，使得不但可以从频域定性地认识信元抖动的能量分布特性，而且还可以定量地求出信元抖动的均方根值(rms：root-mean-square)，以更为准确地衡量抖动的大小。在CBR业务流的多节点端-端排队时延和信元抖动性能分析中，我们提出了一种准周期性(quasi-periodic)信元流模型来描述感染了信元抖动的CBR业务流，并基于这一模型进行了CBR业务流中间节点的初步排队分析。

The study of lattice implication algebras On the basis of previous results of lattice implication algebras, we firstly studied some properties of implication filters, prime implication filters, maximal implication filters and ultrafilters. Then we laid stress on the study of two kinds of relatively general lattice implication algebras, i. e. complete and atomic lattice implication algebra and injective lattice implication algebra.

关于格蕴涵代数的研究本文在已有的格蕴涵代数研究结果基础上，首先研究了格蕴涵代数中蕴涵滤子、素蕴涵滤子、极大蕴涵滤子和超滤等的性质和相互的关系，然后重点较系统地研究了两类覆盖面较广的格蕴涵代数：完备的且原子的格蕴涵代数和内射的格蕴涵代数。

The study of lattice-valued propositional logic system based on lattice implication algebra.On the bases of previous study, by using the concepts and methods of T algebras we established the lattice-valued propositional logic system LP , whose truth values domain is a lattice implication algebra, and discussed systematically the semantical and syntactical properties of LP , proved the soundness theorem 、consistency theorem、deduction theorem and the decidability of validity of the system when the truth values lattice is finite. We also discussed the relationship between the α-theorem of some premise, say A, and the closed sets that contain A.

本文在前人研究工作的基础上，利用T代数的概念与方法，建立了真值取于格蕴涵代数的格值命题逻辑系统LP，对它的语义及语法性质进行了较系统的研究，得到了它的可靠性定理、协调性定理及演绎定理等，证明了值格有限时系统"有效性"的可判定性并讨论了某一前提A下的α定理与包含A的闭集之间的关系。

A special kind of prime dual ideals are defined in a lattice implication algebra, then their structures and properties are discussed. It is proved that the implication operation on this lattice implication algebra is determined by these prime dual ideals, and all of these prime dual ideals compose a lattice implication algebra which is lattice implication isomorphic to the former lattice implication algebra.

在格蕴涵代数中定义了一类特殊的素对偶理想，讨论了它们的结构和性质，证明了该格蕴涵代数中的蕴涵运算可以由这些特殊的素对偶理想所确定，并且这些特殊的素对偶理想全体自然地构成一个格蕴涵代数，它和原格蕴涵代数具有格蕴涵代数同构关系。

The third part proposes in Luk the concept of lattice-valued truth degrees based on the second part by generalizing truth values from the MV-unit interval(a special MV-algebra) to a general MV-algebra. And the properties of lattice-valued truth degrees suggest that this generalization is natural and reasonable. Because of the equivalence between the two algebra systems, i.e. MV-algebra and lattice implication algebra, it's natural and easy to grade the truth of formulas in lattice-valued propositional logic whose basic algebra system is the lattice implication algebra.

中。 本文第三部分在第二部分的基础上，将Luk中公式的真度值推广到了一般的MV代数上，相对于第二部分的数值真度，给出公式的格值真度，并通过格值真度的性质说明格值真度是数值真度的合理推广。

1、Cur inhibits K562 cells growth and induces cell apoptosis may be correlated with the down-regulation of p210~、inhibition of protein tyrosine phosphorylation and the signaling molecules such as p-Erk1/2、c-myc which are relevant with cell growth and apoptosis; 2、Cur synergizes STI571 to inhibit K562 cell growth and induce cell apoptosis may be correlated with the down-regulation of p210~、inhibition of protein tyrosine phosphorylation and the signaling molecules such as Hsp90、PKC which are relevant with cell growth and apoptosis; 3、Cur reverses the resistance of K562/G01 cells to STI571, and synergizes STI571 to inhibit K562/G01 cell growth and induce cell apoptosis; 4、Cur inhibits human originated CML CD34~+ cell growth、induces cell apoptosis, and enhances STI571 to down-regulate the expression of p210~, finally inhibit cell growth and induce cell apoptosis.

从以上实验结果我们得出如下结论： 1、Cur抑制K562细胞增殖、诱导细胞凋亡的作用可能与其下调p210~、蛋白酪氨酸磷酸化水平以及抑制下游p-Erk1/2、c-myc等信号分子有关； 2、Cur协同STI571抑制K562细胞增殖、诱导细胞凋亡的作用可能与其下调p210~、蛋白酪氨酸磷酸化水平以及抑制Hsp90和下游PKC等信号分子有关； 3、Cur可逆转K562/G01细胞对STI571的耐药性，并与STI571协同抑制K562/G01细胞增殖和诱导凋亡，其抑制K562/G01细胞增殖、诱导细胞凋亡的作用可能与其下调p210~、蛋白酪氨酸磷酸化水平以及抑制下游Procaspase-3和NF-κB等信号分子有关； 4、Cur可抑制来源于CML患者骨髓的CD34~+细胞的增殖并诱导其凋亡，还可协同STI571下调CML CD34~+细胞p210~表达，进而协同抑制细胞增殖、诱导细胞凋亡。

Liapunov—Schmidt method is one of the most important method in the bifurcation theory.

Liapunov—Schmidt方法是分叉理论的最重要方法之一。

Be courteous -- even when people are most discourteous to you .

要有礼貌──即使当別人对你最不礼貌的时候。