geometric graph 中文意思是什麼
geometric graph
解釋
幾何圖-
Topics covered include : randomized computation ; data structures ( hash tables, skip lists ) ; graph algorithms ( minimum spanning trees, shortest paths, minimum cuts ) ; geometric algorithms ( convex hulls, linear programming in fixed or arbitrary dimension ) ; approximate counting ; parallel algorithms ; online algorithms ; derandomization techniques ; and tools for probabilistic analysis of algorithms
主題包括?隨機計算、資料結構（雜湊表、省略串列） 、圖論演演算法（最小擴張樹，最短路徑，最少切割） 、幾何演演算法（凸殼、在固定或任意維度的線性規劃） 、近似計數、平行演演算法、線上演演算法、消去隨機技術，以及演演算法的機率分析工具。 -
A new approach to parametric design is presented, which is child - graph based, and which design a 2d sketch in sequence. in this approach, the sketch is designed with simple elements such as points, segments, circles or child - graphs which is combination of above simple elements ; geometric elements is designed in sequence can implement the function of unwell defined ( less - constrain ) parametric design. 2dand 3d constrains is treated consistently
設計並實現了該特徵表示模型的數據結構。該特徵表示模型是系統各種演算法的基礎。不同於常見的用底層圖元（點、線、弧）進行設計的二維全約束求解方法，提出並實現了一種基於子圖的序列化草圖設計方法。 -
What we do at this aspect are : firstly, we describe the permutation symmetry of the structure of some special networks and the corresponding attractor sets with some geometric graphs in euclidean space, which are called attractors graph and geometrized structure graph of the networks respectively ; the geometrizing conditions are also given ; we study the dynamical behavior of the networks using the geometrized structure graph and attractors graph of the network ; moreover, we propose an approach to construct a big - size network with some small - size network with symmetry by the method of direct - sum, direct - produce and semidirect - produce. we also study the dynamical properties " relation between the big - size network and the small - size networks. all those results will provide some theoretical basis for designing a special large - scale network
本文在這方面所做的工作如下：首次將一些特殊網路的結構和吸引子集的置換對稱性用三維歐氏空間中的一些幾何圖來表示，分別稱之為幾何結構圖和吸引子圖；給出了網路對稱性的幾何化條州即相應的對稱性群為可遷群） ：並惜助網路的幾何結構圖和吸弓吁圖分析網路的動力學性質；此外，我們提出了用簡單的具有一定對稱性的小網路按照群的直和、半直積和直積的方式組合成較大的網路的方法，探討了這些小網路和所組成的大網路的一些動力學性質的關系，如穩定態的個數、各穩定態的回憶性質等，為較大網路的設計提供一些理論依據。 -
Four approaches to geometric constraint solving, namely graph - based, rule - based, numerical computation - based and symbolic computation - based are described in detail
對常見的4類求解方法：數值計算的方法、符號計算的方法、基於規則的方法、基於圖論的方法做了詳細的介紹。 -
The graph - based geometric constraint solving method proposed by c. m. hoffmann is introduced and analyzed detailedly
詳細分析了hoffmann等提出的基於圖構造方法的約束求解方法。 -
Because the data and graph are kept respectively, it is very difficult to find the geometric topology and dimension - restrain information between the components. then, the direct result is that even a specific modification would lead to a large - scale change
由於圖形與數據被分割保存，在修改時構件間的約束關系無法找尋；所以即使是細微的修改也會導致大規模的改動。 -
Linear algebra is mainly a subject which studies the linear structure of finite dimensional linear space and its linear transformation while linear concept is in itself from the old euclid g eometry. the concept of " linear space " is a kind of algebraic abstract. in many fields of modern engineering project and technology, because of the influence of computer and graph showing, the algebraic disposal of geometric questions, the visual disposal of algebraic questions, algebra and geometry are tightly combined
線性代數主要是研究有限維線性空間及其線性變換這一代數結構的學科，而線性概念究其根源則是來自古老的euclid幾何，線性空間概念是幾何空間的一種代數抽象，在現代工程技術的許多領域里，由於計算機及圖形顯示的強大威力，幾何問題的代數化處理，代數問題的可視化處理，把代數與幾何更加緊密地結合在一起。 -
As shown in the graph, rainfall in 2005 was around twice that of 2004, yet the annual geometric mean of
一如下圖所示， 2005年的雨量約比2004年多近一倍，但銀線灣的大腸桿菌全年幾何平均值仍繼續下降。 -
The emitter location methods commonly include : angle of arrival ( aoa ) measurement, time - difference - of - arrival ( tdoa ) measurement and aoa together with tdoa measurement. this paper derive some important techniques and theories bearing upon passive location in this field. three kinds of passive location algorithm in three - dimensional ( 3 - d ) space are deduced based on that of 2 - d space. at the same time each performance is analyzed, each graph of geometric dilution of precession ( gdop ) is emulated for different station position, different measurement error, and different target height. accordingly some valuable academic and emulational results are obtained by myself, which will provide researches in this field with definite technical refrence. at the end of this paper, the passive location method of jtids ( joint tactical distribution systems ) is discussed, which is expected to enforce the tactical performance of jtids in the intending development
本文汲取了該領域有關被動定位的重要技術和理論，在二維平面無源定位演算法的基礎上推導出了三維空間內的三種無源定位演算法，並對各自的定位性能進行了理論分析和計算機模擬，模擬出不同的布站、不同的測量誤差以及不同輻射源高度的情況下，三種定位方法各自對應的定位精度（ gdop ）分布圖，同時對各自的定位性能進行了改進處理，得出了一些有價值的理論和模擬實驗結果，這些結論可為今後在此領域的研究提供一定的技術參考。
分享友人