regular graph 中文意思是什麼

regular graph 解釋
正則圖
  • regular : adj 1 有規則的，有規律的；有秩序的，井井有條的，整齊的；正規的，正式的。2 端正的，勻稱的，調和的...
  • graph : n. 1. 【數學】曲線圖；坐標圖，圖表。2. 統計曲線。vt. 用圖表表示，把…繪入圖表。n. 膠版。vt. 用膠版印刷。n. 【語言學】1. 詞的拼法。2. 表示音素的最小字母單位。
  1. We first present a number of desiderata for an xml - based query language, and based on this criterion, we introduce the syntax of a simple core ian - guage for semistructured data and then describe four extensions that have resulted in working prototypes. second, we present the algorithm for computing the result of a regular expression on data graph with cycles, the first - order interpretation of querying language for semistructured data, and explore structural recursion and bisimulation in semistructured data and propose an efficient and systematic way to computing a bisimulation between the two graphs. we also proposed and implemented a web querying system with database features

    基於這些準則，對一個簡單的半結構數據查詢核心語言的語法提出了兩方面擴充；給出了計算數據圖中正規表達式的演算法；對半結構數據查詢語言的一階邏輯描述、結構遞歸和數據圖的雙態模擬（ bisimulation ）等問題進行了研究，提出了一種判定數據圖的bisimulation演算法；在xml數據查詢語言研究的基礎上，設計並實現了一種具有數據庫查詢特性的web查詢系統原型。
  2. In this paper, we study asec of a class r - regular partite for r - regular partite graph

    摘要研究了一類正則二部圖的鄰強邊染色，驗證了文獻[ 1 ]中猜想是正確的。
  3. In the proposed algorithm, each application is represented by a directed acyclic graph, and then all directed acyclic graphs are partitioned into several levels, during executing process, the ready application set can insert in term of a certain regular

    該演算法採用有向無環圖表示每個應用，然後，將所有這些圖進行分層，執行過程中，就緒的應用組可以按照一定的規則動態插入。
  4. Aiming at this problem, the main research issues and achievements in this paper are as follows : bi - directional data transformation between rdb and xml with semantic constraints preserved for most of existing researches on static data transformation between xml and rdb, dtd is taken as the schema description language for xml, and the semantic constraints are often lost during the transformation process. to overcome these disadvantages, the author adopts xml - schema, a standard schema description language proposed by w3c to replace dtd, as the description method owing to its more powerful functions than dtd, and of course with the syntax much more complicated. after analyzing the constraints characteristics in both xml - schema and relational schema, a semantic constraints - preserved algorithm is proposed which can realize the bi - directional schema mapping between rdb and xml through a formalized description of xml based on regular tree and a general expression for relational schema based on direct graph approach

    保留語義約束的xml與rdb雙向靜態數據轉換技術現有研究大多採用dtd （ documenttypedefinition ，文檔類型定義）作為xml的模式描述語言，並且在模式映射過程中丟失語義約束信息，本文分析了xml - schema （ xml - schema採用與dtd完全不同的語法，數據描述能力更強同時也更為復雜，已被w3c確定為替代dtd作為xml模式描述語言的標準）及關系模式的語義約束特徵，通過基於正則樹的xml形式化描述方法以及基於有向圖的一般關系模式表示方法的研究，建立保留語義約束的xml - schema與關系模式的雙向模式映射演算法，實現了xml與rdb的雙向數據轉換，較好地解決了xml與rdb在靜態數據轉換層面的數據集成問題，可有效滿足企業大量rdb數據面向xml的發布以及與日俱增的xml數據存入rdb的應用需求。
  5. 16 fernandez m f, suciu d. optimizing regular pathexpressions using graph schemas. in

    在研究中，我們首先提出了大量的等式和變換規則。
  6. 3. the graph structure of some non - invertible autonomous automata is discussed in regular space, orthogonal space, and orthonormal space respectively. some new results are derived [ theorem 3. 10 - 3. 13 ]

    （ 3 ）討論了非可逆線性內動機在正規空間、直交空間、正交空間上的圖型結構問題[定理3 . 10 3 . 13 ] 。
  7. For a given finite connected graph f, a group h of automorphisms of f and a finite group a = z, du, kawk and xu ( see [ 6 ] ) get some new matrix - theoretical characterizations to classify all the connected regular coverings of f having a as its covering transformation group, on which each automorphism in h can be lifted

    設為有限連通圖， h為它的自同構群的一個子群， a為給定一個初等交換p -群。杜少飛， kawk和徐明曜用矩陣的方法將的正則連通覆蓋圖進行了分類，其中以a作其為覆蓋變換群，並且h可提升。
  8. A graph is regular if every vertex has the same degree.

    如果一個圖的每個頂點都具有相同的度數，則稱它是正則圖。
  9. In section three, the classification of bicyclic graphs is firstly presented according to the different positons of its two bicycles, and then the general regularity of calculation to spectral moments of bicyclic graph is discussed. the final part comes to some regular conclusions of spectral moment order which based on the parameter change of bicyclic graphs

    在第三部分中，我們首先按照雙圈圖中雙圈的相對位置的不同給出了雙圈圖的一個分類，其次研究了任意雙圈圖的譜矩計算的一般規律，最後針對三類圖的參數的變化給出了譜矩排列的規律性結論。
  10. A simple undirected graph is said to be semisymmetric if it is regular and edge - transitive but not vertex - transitive. this thesis consists of two parts

    如果一個簡單的無向圖是正則的，邊傳遞但不是點傳遞的，那麼稱它是半對稱的。
  11. In this paper, three correlative results are given : 1 ) the average crossing number of graph with n vertices and q edges can be signified approximately by quadratic equation of q. 2 ) the average crossing number of graphs with bigger girth is greater than that with smaller girth within given vertices and edges. 3 ) the average crossing number of r - regular graphs greater than that of non - regular graphs within given vertices and edges where n is odd or r < n / 2

    並得出相關的規律： 1 ） n個頂點q條邊的單二連通分支圖的平均交叉數aac （ n ， q ）可近似地表示為q的二次多項式， 2 ）在給定頂點數n與邊數q的單二連通分支圖中圍長較大的圖的平均交叉數大於圍長較小的圖的平均交叉數， 3 ）在給定頂點數n與邊數q的單二連通分支圖中當n為奇數或r n / 2時， r正則圖的平均交叉數大於非r正則圖的平均交叉數。
  12. A regular and edge - transitive graph which is not vertex - transitive is said to be semisymmetric

    半對稱圖是指正則，邊傳遞，但點不傳遞的圖。
  13. A linear algorithm for automatic generation and rectilinear embeddings of four regular graph

    四正則圖的自動生成及縱橫嵌入的線性演算法
  14. We also calculate the average crossing number aac ( n ) of all of the 4 - regular graphs for n < 12 and the average crossing number arc ( n ) of some random 4 - regular graphs of degree 4 for n < 16. at the end of the paper, a conjecture that the average crossing number of regular graph of degree 4 is o ( n2 ) is given

    同時計算出n 12的所有四正則圖的平均交叉數aac （ n ） ，和n 16的隨機四正則圖的平均交叉數arc （ n ） ，並根據計算結果提出四正則圖的平均交叉數為o （ n ~ 2 ）的猜想。
  15. And some other construction methods based on finite geometry, graph theory and group theory are also depicted. an algebraic construction method for ldpc codes with 8 - girth is proposed based on complete residue system. simulation results show that these codes can achieve better performance than randomly constructed regular ldpc codes over awgn channel

    最後，在分析、研究現有構造方法的基礎上，基於代數中的完全剩餘系，作者提出了一種代數構造方法，使得ldpc碼對應因子圖上的圍長為8 ，並採用計算機對其性能進行了模擬，結果表明該碼能夠取得比較理想的譯碼性能。
  16. Regular directed graph

    正則有向圖
  17. Eigenpolynomial of the lattices in d - bounded distance - regular graph

    界距離正則圖中一類格的特徵多項式
  18. This program is designed to take a regular expression and produce a graph of the state machine that is used to parse the regular expression

    這個程序旨在接收一個正則表達式並產生一個狀態機的時序圖，狀態機用來分析正則表達式。
  19. Regular expression graphing program - this program is designed to take a regular expression and produce a graph of the state machine that is used to parse the regular expression

    這個程序旨在接收一個正則表達式並產生一個狀態機的時序圖，狀態機用來分析正則表達式。
分享友人
分享到 Line

分享到臉書