排序方式： 共有51条查询结果，搜索用时 15 毫秒
1.
以太无源光网络(EPON)技术研究 总被引：1，自引：0，他引：1
首先介绍了以太无源光网络(EPON),分析了EPON技术及其实现,探讨了EPON的几种网络拓扑结构并提出了改进方法。 相似文献
2.
田建勇 《安顺师范高等专科学校学报》2011,13(1):90-93
文章介绍了星型拓扑结构的组网,讨论星型拓扑结构设计组建校园的解决方案,为师生提供教育教学,实现资源共享和信息交流了,并能通过广域网实现校园内外和国内外的教育资源共享与交流。 相似文献
3.
Brian Griffiths (1927–2008) was a British mathematician and educator who served as a member of the founding editorial board
of Educational Studies in Mathematics. As a mathematician, Griffiths is remembered through his work on what continue to be known as ‘Griffiths-type’ topological
spaces. As a mathematics educator, his most profound contribution was, with Geoffrey Howson, in offering a conceptualisation
of the relationship between mathematics, society and curricula. 相似文献
4.
INTRODUCTIONTheOSSI(OffsetSurface/SurfaceIntersection)problemisasub-problemofgeneralSSI.AlthoughtheOSSIproblemcanberesolvedbyapplyinggeneralSSIalgorithm,itiscomputationallyexpensiveandexhaustive.Inrecentdecades,effortshavebeenfocusedoncomputingSSIexactly,efficiently,androbustlyinageneralsetting(Abdel-MalekandYeh,1997;Changetal.,1994;BurkeandSabharwal,1996;Mullenheim,1991).Thesetechniquescanbeclassifiedmainlyintofivecategories:algebraic,latticeevaluation,marching(tracing)method,… 相似文献
5.
We introduce a new algebraic approach dealing with the problem of computing the topology of an arrangement of a finite set of real algebraic plane curves presented implicitly. The main achievement of the presented method is a complete avoidance of irrational numbers that appear when using the sweeping method in the classical way for solving the problem at hand. Therefore, it is worth mentioning that the efficiency of the proposed method is only assured for low-degree curves. 相似文献
6.
Conventional methods for solving intersections between two offset parametric surfaces often include iteratively using computationally
expensive SSI (surface/surface intersections) algorithm. In addition, these methods ignore the relations between the intersection
curves of parametric surfaces with different offset distances. The algorithm presented in this paper, makes full use of the
topological relations between different intersection loops and calculates intersection loops with the help of previously calculated
intersection loops. It first pre-processes two parametric surfaces to obtain the characteristic points, called topology transition
points (TTPs), which can help in the subsequent finding of the topologies of the intersection curves. Then these points are
categorized into several distinct groups, and we can determine the calculation strategy for searching initial points by analyzing
the properties of these TTPs on the surfaces. Hence, all intersection curves can be marched from initial points by the tracing
algorithm. The proposed algorithm could calculate intersection curves robustly and effectively, and has been tested to be
capable of overcoming the degenerate conditions such as loop and singularities leaking that occur frequently in conventional
algorithms.
Project supported by the National Research Foundation for the Doctoral Program (No. 2000033554) of Higher Education of China
and the Natural Science Foundation of Zhejiang Province, China (No. 6001107) 相似文献
7.
8.
M. S. Raghunathan 《Resonance》2002,7(9):56-68
I will now embark on explaining as best as I can to the nonmathematician what the Poincaré conjecture is all about. 相似文献
9.
本文给出了加号拓扑空间的一些基本性质 ,并应用加号拓扑空间所具有的纲性质以及纲分析的技术得到了关于函数连续性和可微性的一些有趣结果 相似文献
10.
应用层多播(ALM)作为IP多播的替代在互联网中得到广泛的应用。提出一个新的基于优先级的动态分层应用层多播模型CDMP(The Classified Dynamic Model Based on the Priority in Application-Level Multicast),模型通过对不同性质的结点的分层来搭建整个架构,通过分域将性质接近的结点放在一起以保证数据传输的效率和数据共享的公正性,并且减少了结点寻找路由的代价,加快了当结点失败时的路由修复速度。通过分析和仿真实验证明,CDMP协议具有良好的上述性质。 相似文献