partial order造句
例句與造句
- The partial ordering of the matrices is facous on the matrix theory , many mathematicians have been engaged in studying the partial ordering of matrix such as kinds of partial ordering and its application
矩陣的偏序是當前矩陣論研究的一個熱點，國內(nèi)外許多學者從事矩陣偏序的研究，他們研究各種類型的矩陣偏序，并應用到數(shù)理統(tǒng)計等學科中。 - Strand space including a partial order describing causal structure and a analog recursion method , brought forward the boundary of the attacker ’ s capacity which does not depend on idiographic protocols
串空間方法包括了一個描述因果結構的偏序和一個類遞歸證明方法,提出了與所分析的具體協(xié)議無關的攻擊者能力邊界,是一種新型有效的形式化方法。 - The relations between heyting algebra and implication algebra with some conditions on a partial ordered set are discussed . then some conditions when a implication algebra is a boolean algebra are given . 3
系統(tǒng)地研究了偏序集上蘊涵代數(shù)與heyting代數(shù)之間的關系，得到了蘊涵代數(shù)中蘊涵算子的一個較好的條件，并給出了偏序集上蘊涵代數(shù)成為布爾代數(shù)的一些條件。 - A new set - valued caristi ' s fixed point theorem , as well as its detail proof , is presented by using partial order theory , which generalized some related results . the theory of monotone dynamical systems has given rise to great attention
我們給出了一種新的caristi不動點定理，并使用偏序理論對這個不動點定理進行了詳細的證明，所得結果推廣了文獻中的相關結論。 - By using the cone and partial ordering theory without regarding compactness conditions , it is studied the existence uniqueness of the solutions of some single operator equations , the results presented here improve and generalize some corresponding results for increasing operator equations
摘要利用錐與半序理論無需考慮緊性條件，研究了幾類一元算子方程解的存在唯一性，所得結果改進和推廣了增算子方程的某些已知相應結果。 - It's difficult to find partial order in a sentence. 用partial order造句挺難的
- In this paper , we characterized the natural partial order on the structure of regular semigroup with an inverse transversal . studying the condition about the natural partial order on it . and characterized the homomorphism between regular semigroups , discussing the conditions about the special homomorphism image
給出了有關自然偏序的的兩個重要條件刻劃，對具有逆斷面的正則半群之間的同態(tài)進行了刻劃，討論了具有逆斷面的正則半群的特殊同態(tài)像的條件。 - Spatial data model is formalized according to partial order relationship , equivalence relationship and simplicial complex theory . a formalizing two - tuple ( m , f ) multi - resolution spatial data model is presented . based on the jarno peschie algorithms , an improved algorithm of road network map generalization is developed
應用偏序關系、等價關系和單純復形理論，初步研究了多分辨率空間數(shù)據(jù)模型形式化表達方法，提出了一個二元組形式化多分辨率空間數(shù)據(jù)模型。 - Fuzzy logic is studied with algebraic tools in this paper . a kind of algebraic abstract of fuzzy logic , implication algebra on a partial ordered set , is given . the relations between implication algebra and other algebraic structures , such as mv - algebra and heyting algebra etc . , and the filter and the structure of implication algebra on a partial ordered set are studied
本文的目的是使用代數(shù)工具對模糊邏輯進行研究，給出模糊邏輯的一類代數(shù)抽象，即偏序集上的蘊涵代數(shù)，研究偏序集上蘊涵代數(shù)與其它代數(shù)結構，如mv -代數(shù)， heyting代數(shù)之間的關系，以及偏序集上蘊涵代數(shù)的濾子與其結構等。 - Inspired by typical coding schemes such as ezw , spiht , ebcot , 3d - iezw , 3d - spiht and 3d - escot , a new context model of wavelet coefficients is proposed , which make use of partial order , self - similarity between subbands of wavelet coefficients and the correlation of neighboring wavelet coefficients
受ezw 、 spiht 、 ebcot模型及3d - ezw 、 3d - spiht 、 3d - escot模型的啟發(fā)，本文綜合利用小波系數(shù)不同子帶間的自相似性、偏序性和同子帶內(nèi)相鄰系數(shù)的相關性，提出了一種新的三維小波嵌入編碼上下文模型3d - pem 。 - And to model the field - nonspecific information is to evaluate the accepted level of the new knowledge for students . " java tutorial " is taken as an example curriculum , which is disassembled into 298 knowledge items and the mastery of each knowledge item can be expressed into 4 levels . thereafter , partial order among these knowledge items is set up so as to ascertain the causality on bayesian networks
論文中以《 java教程》為例，將該門課程劃分成298個知識項，并為每個知識項定義了四個狀態(tài)來表示學生對知識項的掌握程度，然后在這些知識項之間建立偏序關系以確定貝葉斯網(wǎng)絡的因果推理關系，最后為每個知識項確定先驗概率，這樣就建立了覆蓋型的貝葉斯網(wǎng)絡學生模型。 - The representation theories of mp - filter which is created by an non - empty set of a implication algebra on a partial ordered set with condition ( c ) are obtained at first . and it ' s proved that the set which contains all mp - filters of a implication algebra x , denoted by mf ( x ) = { f x f is a filter of x } , is a distributive lattice and a complete lattice also in the view of the concept of mp - filter . then the fuzzy filter of a implication algebra is discussed , and the relations between mp - filter and fuzzy filter are obtained
借助于mp -濾子的概念，得到了偏序集上具有條件( c )的蘊涵代數(shù)中由非空集合所生成mp濾子的表示定理，證明了由其上所有mp -濾子組成的集合mf ( x )是一個完備的分配格；得到了蘊涵代數(shù)中fuzzy濾子與mp濾子的關系，給出了fuzzy濾子成為fuzzy素濾子的若干刻畫；并利用mp -濾子和fuzzy濾子，刻畫了一類偏序集上蘊涵代數(shù)的結構。 - O conceptual hierarchies organization technique concepts in databases are organized into a partial order called conceptual hierarchies . conceptual hierarchies play an important role in the knowledge discovery process because they specify backgroud or domain knowledge and may affect the discovery processing and the results . ln this paper , basic ideas about conceptual hierarchy and its manipulation are discussed . based on the conceptual hierarchies in the nms database , we present processing methods o application research of multilevel association algorithm in the nms database we emphatically discuss performance data multilevel conceptual association problems on network management background , especially , the association between performance data and geographic location . after studying encoding multilevel association algorithms and background item constraint algorithms , an efficient mining multilevel association algorithm between performance data and geographic location is presented . lt is efficient for mining useful association rules
一旁多級關聯(lián)算法在網(wǎng)絡數(shù)據(jù)庫中的應用本文重點研究了網(wǎng)絡管理背景下多級概念下性能數(shù)據(jù)關聯(lián)問題，特別是性能數(shù)據(jù)和地理位置關聯(lián)的問題。將概念結構方法應用于網(wǎng)絡管理數(shù)據(jù)庫之中。通過對編碼結構實現(xiàn)的多級關聯(lián)技術的研究，通過對網(wǎng)絡管理數(shù)據(jù)庫下背景知識約束條件實現(xiàn)研究，提出了”一種高效的，網(wǎng)絡管理性能數(shù)據(jù)與地理位置關聯(lián)的挖掘算法。 - The primary studies in this paper are the following : ( 1 ) we define a generalized alexandroff topology on an l - fuzzy quasi ordered set which is a generalization of the alexandroff topology on an ordinary quasi ordered set , prove that the generalized alexandroff topology on an l - quasi ordered set ( x , e ) can be obtained by the join of a family of the alexandroff topologies on it , a topology on any topological space can be represented as a generalized alexandroff topology on some l - quasi ordered set , and the generalized alexandroff topologies on l - fuzzy quasi ordered sets are generalizations of the generalized alexandroff topologies on generalized ultrametric spaces which are defined by j . j . m . m . rutten etc . ( 2 ) by introducing the concepts of the join of l - fuzzy set on an l - fuzzy partial ordered set with respect to the l - fuzzy partial order and l - fuzzy directed set on an l - fuzzy quasi ordered set ( with respect to the l - fuzzy quasi order ) , we define l - fuzzy directed - complete l - fuzzy partial ordered set ( or briefly , l - fuzzy dcpo or l - fuzzy domain ) and l - fuzzy scott continuous mapping , prove that they are respectively generalizations of ordinary dcpo and scott continuous mapping , when l is a completely distributive lattice with order - reversing involution , the category l - fdom of l - fuzzy domains and l - fuzzy scott continuous mappings is isomorphic to a special kind of the category of v - domains and scott continuous mappings , that is , the category l - dcqum of directed - complete l - quasi ultrametric spaces and scott continuous mappings , and when l is a completely distributive lattice in which 1 is a molecule , l - fuzzy domains and l - fuzzy scott continuous mappings are consistent to directed lim inf complete categories and lim inf co ntinuous mappings in [ 59 ]
本文主要工作是： ( 1 )在l - fuzzy擬序集上定義廣義alexandroff拓撲，證明了它是通常擬序集上alexandroff拓撲的推廣，一個l - fuzzy擬序集( x ， e )上的廣義alexandroff拓撲可以由其上一族alexandroff拓撲取并得到，任意一個拓撲空間的拓撲都可以表示為某個l - fuzzy擬序集上的廣義alexandroff拓撲，以及l(fā) - fuzzy擬序集上的廣義alexandroff拓撲是j . j . m . m . rutten等定義的廣義超度量空間上廣義alexandroff拓撲的推廣。 ( 2 )通過引入l - fuzzy偏序集上的l - fuzzy集關于l - fuzzy偏序的并以及l(fā) - fuzzy擬序集上(關于l - fuzzy擬序)的l - fuzzy定向集等概念，定義了l - fuzzy定向完備的l - fuzzy偏序集(簡稱l - fuzzydcpo ，又叫l(wèi) - fuzzydomain )和l - fuzzyscott連續(xù)映射，證明了它們分別是通常的dcpo和scott連續(xù)映射的推廣，當l是帶有逆序對合對應的完全分配格時，以l - fuzzydomain為對象， l - fuzzyscott連續(xù)映射為態(tài)射的范疇l - fdom同構于一類特殊的v - domain范疇，即以定向完備的l -值擬超度量空間為對象， scott連續(xù)映射為態(tài)射的范疇l - dcqum ，以及當l是1為分子的完全分配格時， l - fuzzydomain和l - fuzzyscott連續(xù)映射一致于k . wagner在[ 59 ]中定義的定向liminf完備的-范疇和liminf連續(xù)映射。 - We answer an open question on minus partial ordering posed by j . k . baksalary and f . pukesheim , and extend to a general case . some new properties of left - star and right - star partial ordering are given , the relation between some matrices and its squares are discussed , in the sense of left - star and right - star partial ordering . a new characterization and some properties of the sharp ordering are obtained using the core - nipotent decomposition of the matrices
在兩種情形下，利用矩陣的加權moore - penrose逆導出了兩矩陣和的加權moore - penrose逆的公式，其推導證明簡潔而直接，文中還給出兩矩陣可以同時加權奇異值分解的充要條件，指出了j . k . baksalary關于矩陣減序和星型序刻畫的一個錯誤 - The main idea of this hybrid algorithm is : at first , all candidates in task collection is lined according to a dispatching rule ( earliest due date , edd ) , then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier , many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier , the allocation of the resources over time is conducted to perform every feasible task sequence , and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed
該算法按照最早完工時間優(yōu)先( ect )分派規(guī)則,先將參加排序的工序合并成一個串行序列,然后按照同層內(nèi)不存在偏序關系的原則,將其分解為若干個時間上相互銜接的層次,在每個層次內(nèi)部,通過構造鄰域產(chǎn)生出多個可行序列,對每個可行序列進行設備配置,采用鄰域搜索算法進行方案的尋優(yōu),保留一組滿足評價要求的可行方案作為下一層設備配置的背景環(huán)境,通過層層遞進最終獲取全局的近似最優(yōu)解。