首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2篇
  免费   0篇
无线电   1篇
冶金工业   1篇
  2009年   1篇
  1998年   1篇
排序方式: 共有2条查询结果,搜索用时 0 毫秒
1
1.
Gastric leiomyoblastoma is a rare entity. In this report, we describe the magnetic resonance (MR) appearance of a recurrent gastric leiomyoblastoma 14 years after initial presentation. This tumor was heterogeneous and moderately low signal intensity on T1-weighted images and heterogeneous and moderately high signal intensity on T2-weighted images. The tumor also contained foci of low signal intensity on the post gadolinium images, consistent with areas of necrosis. The mass enhanced mildly and increased in enhancement on the delayed images, consistent with a hypovascular mass. Multiple liver metastases were noted. Magnetic resonance findings were confirmed with surgical specimens.  相似文献   
2.
With fully directional communications, nodes must track the positions of their neighbors so that communication with these neighbors is feasible when needed. Tracking process introduces an overhead, which increases with the number of discovered neighbors. The overhead can be reduced if nodes maintain only a subset of their neighbors; however, this may increase the length of paths between node pairs in the network. In this work, we study the tradeoffs between node degree and path stretch. We first design a topology control algorithm to optimize this tradeoff. Assuming that nodes communicate with their directional neighbors using circular directional transmissions, we model the original graph as a unit disk graph (UDG). Given a UDG G, our algorithm finds a sparse subgraph G' with a maximum degree of 6, and connecting each node pair u,v by a path of length hops_{G'}(u,v)=O(hops_G(u,v)+logDelta), where Delta is the maximum degree in G, hops_{G}(u,v) denotes length of the shortest path between u, v in G. We show that this result is near-optimal. Based on the insights gained from this design, we next construct a simpler, more practical scheme that integrates fully-directional neighbor discovery and maintenance with topology control strategy. We simulate both algorithms and compare their performances.  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号