OBJECTIVE:Mixed endometrial stromal and smooth muscle tumor (MESSMT)-a rare mesenchymal uterine tumor of the uterus with atypical clinical symptoms-is susceptible to misdiagnosis and missed diagnosis. We report a case of a disseminated MESSMT with intravenous and intracardiac extensions treated with staging surgery and review previously documented cases of such tumors with intracardiac extension.CASE REPORT:The case involves a 45-year-old woman with disseminated MESSMT that originated in the uterus and progressed through the iliac vein, inferior vena cava, right atrium, and into the right ventricle, which closely resembled intravenous leiomyomatosis (IVL) grossly and microscopically. She presented with a 1-year history of dyspnea on exertion. IVL was highly suspected preoperatively based on computed tomography and magnetic resonance imaging findings. Two-stage surgeries were performed successfully. The postoperative pathology indicated a disseminated MESSMT.CONCLUSION:This case illustrates the important role of pathology and immunohistochemistry in the differential diagnosis of a rare tumor that mimics the characteristics of IVL with intracardiac involvement and demonstrates the therapeutic strategy for this rare entity.

The periodic and dynamic topology of satellite networks poses new challenge to the design of routing protocols. Since the routing protocols of conventional networks can not be effectively applied to satellite networks, many new routing techniques for satellite networks were put forward. With an introduction to satellite network architecture and topology control strategies along with the developmental history of routing techniques on satellite networks, this paper summarizes the core mechanism, feature and major problems of some important routing techniques of satellite networks from the classification perspective. Considering application requirements, the paper also suggests the future trends towards the development of routing techniques on satellite networks.

We formalize the construction of fault blocks by a state transition model based on finite state automata. Based on the model, a boundary diffusion method is presented for the rectilinear-monotone orthogonal convex fault model such as the rectangular fault model and minimal-connected-component (MCC) faulty model, whereby an adaptive fault-tolerant routing algorithm, called X-Y boundary routing algorithm (X-YBRA), is presented for deadlock-free fault-tolerant adaptive routing outside the fault blocks. To improve the network resources utilization, we put forward a routing diffusion method in the fault block, which completely solves the routing problem in the fault block. The experiment result shows that the diffusion overhead of our method is far lower than that of the traditional routing algorithms such as distance vector and link state routing algorithms with the light loss in convergence time. For the occurrence and recovery of random faults, the expansion and shrinkage of the fault block are also discussed. Accordingly, the dynamic boundary and routing updating methods are put forward to respond to these cases. Based on these methods, we develop low earth orbit satellite networks into an adaptive fault-tolerant system in routing. Our works can be also applied to other 2D mesh networks such as the interconnect multiprocessor computer systems.

Dynamic topologies and constrained recourses are two main characters of satellite networks. These characters require a specialized and efficient routing algorithm. In this paper, a QoS routing algorithm based on PEC multi objective optimization method is proposed to find paths that satisfy all user QoS requirements efficiently. A new routing scheme is also developed to reduce the computing load in satellites. Simulation results show that our routing scheme and algorithm can achieve optimized routing and perform well in multi-layered satellite IP networks.

To satisfy the multiple QoS constraints in different services, we divide a QoS routing problem into some multicast routing problem oriented the types of QoS service callings. Every multicasting routing problem is a Steiner tree problem. In this paper, we propose a dynamic QoS routing mechanism (DQ) to support multiple Steiner trees. We also propose a protocol to distinguish between the types of services and make a load balance of the satellite networks. Our simulation results show that our mechanism consume less sources and provide more QoS guarantees than previous routing algorithms. Furthermore, our mechanism has a limited overhead and can support a large number of service callings.

Robert Sedgewick [5] lists various Gray codes for the permutations in Sn including the classical algorithm by Johnson and Trotter. Here we give an algorithm which constructs many families of Gray codes for Sn, which closely follows the construction of the Binary Reflexive Gray Code for the n-cube Qn.

Two completely new algorithms for generating permutations, shift-cursor algorithm and level algorithm, and their efficient implementations are presented in this paper. One implementation of the shift cursor algorithm gives an optimal solution of the permutation generation problem, and one implementation of the level algorithm can be used to generate random permutations.