• Asian Pacific Journal of Cancer Prevention
• /
• v.14 no.6
• /
• pp.3877-3880
• /
• 2013

Objective: To explore the expression and significance of tumor specific growth factor (TSGF), carcinoembryonic antigen (CEA) and alpha fetoprotein (AFP) in cancer tissue and serum of patients with colon cancer. Materials and Methods: Radical surgery for colon cancer was performed on 43 patients with laparoscopu under conditions of general anesthesia. The Elisa method was used to detect the levels of serum TSGF, CEA and AFP before and after radical operation, and cancer tissue underwent TSGF, CEA and AFP immunohistochemistry staining after laparoscopic surgery. The decreased conditions of serum TSGF, CEA and AFP in patients with colon cancer at different levels of differentiation and clinical stagings were analyzed, and the relationships of expression rates between histological types, colon cancer morphology, lymph node metastasis and TSGF, CEA as well as AFP in cancer tissue were assessed. Results: Compared with before radical surgery, the levels of serum TSGF, CEA and AFP decreased notably in patients after operations (p<0.01). The decreased degree of TSGF and CEA was the largest in patients with poorly differentiated cancer tissue (p<0.01), while that of AFP was noted in patients with moderately differentiated cancer tissue (p<0.01). The decreased degree of TSGF and AFP was the largest in patients at phase Dukes A (p<0.01), while that of CEA in patients at phase Dukes C (p<0.01). There were no significant differences among the positive expression rates of TSGF, CEA and AFP with different histological types and colon cancer morphologies (p>0.05). The positive expression rates of TSGF and CEA in patients with lymph node metastasis were significantly higher than those without lymph node metastasis (p<0.01). Conclusions: TSGF, CEA and AFP can be used to evaluate the effect of radical operation for colon cancer, and the changed levels of different markers are associated with tumor differentiation, clinical stating and presence or absence of lymph node metastasis.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.893-900
• /
• 2007

This paper suggests an algorithm that improves the disadvantages of the Dijkstra algorithm that is commonly used in GPS navigation system, searching for the shortest path. Dijkstra algorithm, first of all, requires much memory for the performance of the algorithm. It has to carry out number of node minus 1, since it determines the shortest path from all the nodes in the graph, starting from the first node. Therefore, Dijkstra algorithm might not be able to provide the information on every second, searching for the shortest path between the roads of the congested city and the destination. In order to solve these problems, this paper chooses a method of searching a number of nodes at once by means of choosing the shortest path of all the path nodes (select of minimum weight arc in-degree and out-degree), excluding the departure and destination nodes, and of choosing all the arcs that coincide with the shortest path of the path nodes, from all the node outgoing arcs starting from the departure node. On applying the suggested algorithm to 14 various digraphs, we succeeded to search the shortest path. In addition, the result was obtained at the speed of 2 to 3 times faster than that of Dijkstra algorithm, and the memory required was less than that of Dijkstra algorithm.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.491-496
• /
• 2002

Most partitioning algorithms for hardware- software codesign do not consider scheduling. Therefore, partitioning should be performed again if time constraints art not satisfied in scheduling the partitioned results. Existing FDS-applied methods which consider scheduling in partitioning decide the control step of the node to schedule while selecting nodes for partitioning. In selecting nodes for partitioning, several aspects should be considered together such as added cost or time due to the partition of the node, or the degree of interference due to the scheduling of the node. At this time, the induced force, which means the degree of intereference of scheduling other nodes, is computed all over the control step of the corresponding node and other depending nodes. In this paper, a new FDS-applied partitioning algorithm is proposed, where partitioning is performed using the defined scheduling urgency and relative scheduling urgency of the nodes. Since the nodes are partitioned by the computation of relative scheduling urgencies only at the earliest control step and the latest control step among the assignable steps, the time complexity for the computation of induced force could be improve. Experimental result on the benchmarks show the improvement of execution time of the proposed algorithm compared to the existing FDS-applied methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4023-4043
• /
• 2016

Network virtualization has been regarded as a core attribute of the Future Internet. In a network virtualization environment (NVE), multiple heterogeneous virtual networks can coexist on a shared substrate network. Thus, a substrate network failure may affect multiple virtual networks. In this case, it is increasingly critical to provide survivability for the virtual networks against the substrate network failures. Previous research focused on mechanisms that ensure the resilience of the virtual network. However, the resource efficiency is still important to make the mapping scheme practical. In this paper, we study the survivable virtual network embedding mechanisms against substrate link and node failure from the perspective of improving the resource efficiency. For substrate link survivability, we propose a load-balancing and re-configuration strategy to improve the acceptance ratio and bandwidth utilization ratio. For substrate node survivability, we develop a minimum cost heuristic based on a divided network model and a backup resource cost model, which can both satisfy the location constraints of virtual node and increase the sharing degree of the backup resources. Simulations are conducted to evaluate the performance of the solutions. The proposed load balancing and re-configuration strategy for substrate link survivability outperforms other approaches in terms of acceptance ratio and bandwidth utilization ratio. And the proposed minimum cost heuristic for substrate node survivability gets a good performance in term of acceptance ratio.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.4
• /
• pp.508-516
• /
• 2016

When GPS signals are not available, a relative localization can be alternatively used to represent the topological relationship between mobile nodes. A relative location map of a network can be constructed by using the distance information between all the pairs of nodes in the network. If a network is large, a number of small local maps are individually constructed and are merged to obtain the whole map. However, this approach may result in a high computation and communication overhead. In this paper, we propose a reference-node selection scheme for relative localization map construction, which chooses a subset of nodes as a reference node that is supposed to construct local maps. The scheme is a greedy algorithm that iteratively chooses nodes with high degree as a reference node until the chosen local maps are successfully merged with a sufficient number of common nodes between nearby local maps. The simulation results indicate that the proposed scheme achieves higher localization accuracy with a reduced computational overhead.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.303-310
• /
• 2008

To increase the lifetime of ad-hoc networks, a ratio of energy consumption for each node should be kept constant by equally distributing network traffic loads into all of the nodes. In this paper, we propose a modified AODV routing protocol to determine a possible route by considering a remaining battery capacity of a node and the degree of its usage. In addition, to reduce the amount of energy consumption during the path rediscovery process due to the huge amount of the AODV control messages the limited number of possible routes are stored into a routing table of a source node. When some links of a route fail, another possible path can be looked up in the table before the route discovery process should be initiated. We have tested our proposed method with a conventional AODV and a MMBCR method which is one of the power-efficient energy routing protocols based on the three performance metrics, i.e., the total remaining battery capacity, network lifetime and the ratio of data packets received by the destination node to compare their performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12B
• /
• pp.1049-1057
• /
• 2006

Overlay Multicast is an effective method for efficient utilization of system resources and network bandwidth without using hardware customization. Unlike in IP multicast, multicast tree reconstruction is required when non-leaf node leaves or fails. In this paper, we propose a proactive approach to solve this defect by using a resource reservation of the out degrees. This allows children of non-leaf node to connect to its new parent node immediately when its parent node leaves or fails. In our proposal, a proactive route maintenance gives a fast recovery time and reduces a delay effect in the new route. The simulation results show that our proposal takes shorter period of time than the other algorithms to reconstruct a similar tree and that it is a more effective way to deal with a lot of nodes that have lost their parent nodes.

• 대한두경부종양학회:학술대회논문집
• /
• 2007.05a
• /
• pp.73-73
• /
• 2007

• Journal of the Korea Society for Simulation
• /
• v.4 no.2
• /
• pp.61-68
• /
• 1995

The performance of event-driven logic simulation frequently used for VLSI design verification depends on the data structures for event queues. This paper improves the existing Timing Wheel as a data structure for an event queue. In case of the use of B+ tree, an efficient node degree is also presented based on the experiment results. A new Timing Wheel index structure, which eliminates the insertion and deletion overhead of B+ tree, is proposed and analyzed.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.59-62
• /
• 2000

In this paper, We propose the new interconnection network which is designed to edge numbering method using inorder traversal a Fibonacci trees and its jump sequence is Fibonacci numbers. It has a simple (shortest path)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube on interconnection network measrtes.