• Clinical Endoscopy
• /
• 제57권1호
• /
• pp.24-35
• /
• 2024

The field of artificial intelligence is rapidly evolving, and there has been an interest in its use to predict the risk of lymph node metastasis in T1 colorectal cancer. Accurately predicting lymph node invasion may result in fewer patients undergoing unnecessary surgeries; conversely, inadequate assessments will result in suboptimal oncological outcomes. This narrative review aims to summarize the current literature on deep learning for predicting the probability of lymph node metastasis in T1 colorectal cancer, highlighting areas of potential application and barriers that may limit its generalizability and clinical utility.

• 한국멀티미디어학회논문지
• /
• 제19권2호
• /
• pp.291-299
• /
• 2016

To enhance network efficiency, named-data networking (NDN) implements data caching functionality on intermediate network nodes, and then the nodes directly respond to request messages for cached data. Through the processing of request messages in intermediate node, NDN can efficiently reduce the amount of network traffic, also solve network congestion problems near data sources. Also, NDN provides a data authenticate mechanism so as to prevent various Internet accidents caused from the absence of an authentication mechanism. Hence, through applying NDN to various smart IT convergence services, it is expected to efficiently control the explosive growth of network traffic as well as to provide more secure services. Basically, it is important factors of NDN which data is cached and where nodes caching data is located in a network topology. This paper first analyzes previous works caching content based on the popularity of the content. Then ii investigates the hitting rate of caches in each node of a network topology, and then propose an improved caching scheme based on the result of the analyzation. Finally, it evaluates the performance of the proposal.

• ETRI Journal
• /
• 제27권1호
• /
• pp.1-12
• /
• 2005

We propose a heuristic buffer management scheme that uses both positive and negative acknowledgments to provide scalability and reliability. Under our scheme, most receiver nodes only send negative acknowledgments to their repair nodes to request packet retransmissions while some representative nodes also send positive acknowledgments to indicate which packets can be discarded from the repair node's buffer. Our scheme provides scalability because it significantly reduces the number of feedbacks sent by the receiver nodes. In addition, it provides fast recovery of transmission errors since the packets requested from the receiver nodes are almost always available in their buffers. Our scheme also reduces the number of additional retransmissions from the original sender node or upstream repair nodes. These features satisfy the original goal of treebased protocols since most packet retransmissions are performed within a local group.

• 디지털산업정보학회논문지
• /
• 제6권3호
• /
• pp.59-68
• /
• 2010

In the paper, we proposed the Using Correspondent Information for Route Optimization on PMIPv6 over Inter-MAG. Proxy Mobile IPv6 has the problem that a mobile node sends data packets through inefficient routing paths when communicating other mobile node. Route optimization schemes are proposed to solve the triangle routing problem that creates the shortest routing path by leaving the inefficient routing paths. We proposed Correspondent Information Route Optimization scheme to reduce signaling cost as compared with other route optimization scheme. We can reduce signaling cost of route optimization through the Correspondent Information message on basic PMIPv6 and hand-off environment.

• 한국경영과학회지
• /
• 제31권3호
• /
• pp.41-51
• /
• 2006

Clustering is to group similar objects into clusters. Until now there are a lot of approaches using Self-Organizing feature Maps (SOFMS) But they have problems with a small output-layer nodes and initial weight. For example, one of them is a one-dimension map of c output-layer nodes, if they want to make c clusters. This approach has problems to classify elaboratively. This Paper suggests one-dimensional output-layer nodes in SOFMs. The number of output-layer nodes is more than those of clusters intended to find and the order of output-layer nodes is ascending in the sum of the output-layer node's weight. We un find input data in SOFMs output node and classify input data in output nodes using Euclidean distance. The proposed algorithm was tested on well-known IRIS data and TSPLIB. The results of this computational study demonstrate the superiority of the proposed algorithm.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.93-99
• /
• 2005

물류 네트워크는 거점(Node)과 수배송(Link) 형태로 구성된다. 중장기적인 관점에서 예측된 수요를 고려하여 재고, 수배송, 납기시간을 줄일 수 있는 Node와 Link를 결정하는 것이 물류 네트워크 구축 연구의 목적이다. 건축도료를 생산하는 A사는 3개의 공장과 2개의 물류센터를 보유하고 있으며, 향후 공장 이전과 신규 물류센터를 건립할 계획이다. 이러한 물류 환경 변화 하에서 현재 대고객 서비스 수준은 유지하면서, 최소의 비용으로 적정 재고수준을 보장하는 A사의 신 물류체계를 구축하는 것이 필요하다. 이를 위해 본 연구에서는 시뮬레이션을 활용하여 최적의 물류 네트워크 구축 및 적정의 물류센터 규모를 산정하였다.

• Journal of information and communication convergence engineering
• /
• 제6권4호
• /
• pp.470-474
• /
• 2008

A well-designed computer network technology produces benefits on several fields within the organization, between the organizations(suborganizations) or among different organizations(suborganizations). Network technology streamlines business processes, decision process. Graphs are useful data structures capable of efficiently representing a variety of networks in the various fields. Metagraph is a like graph theoretic construct introduced recently by Basu and Blanning in which there is set to set mapping in place of node to node as in a conventional graph structure. Metagraph is thus a new type of data structure occupying its popularity among the computer scientists very fast. Every graph is special case of Metagraph. In this paper the authors introduce the notion of Meta-Networking as a new network technological representation, which is having all the capabilities of crisp network as well as few additional capabilities. It is expected that the notion of meta-networking will have huge applications in due course. This paper will play the role of introducing this new concept to the network technologists and scientists.

• 한국경영과학회지
• /
• 제34권3호
• /
• pp.137-153
• /
• 2009

In this paper, we present an analytic model that evaluates the performance of B-MAC protocol under contention transmission conditions of two senders in a single-hop wireless sensor network. Our model considers the impact of several important factors such as sleep cycle, the backoff mechanism and incoming traffic loads. After obtaining the service delay distribution of a sending node and expected delay of a receiving node, an iterative algorithm is presented for calculating the performance measures such as expected energy consumption usage per packet and latency. Simulation results show that the proposed analytic model can accurately estimate the performance measures under different traffic conditions.

• Management Science and Financial Engineering
• /
• 제3권1호
• /
• pp.1-14
• /
• 1997

We address the problem of determining the sequence of a vehicle with fixed capacity to visit n nodes at which a predetermined amount is picked up and/or delivered. The objective is to minimize the total travel distance of the vehicle, while satisfying the pick-up/delivery requirements and feasibility at all nodes. Existing methods for the problem allows the vehicle to visit a node twice, which is impractical in many real situations. We propose a heuristic algorithm, in which every node is visited exactly once. Computational results using random problems indicate that the proposed heuristic outperforms existing methods for practical range of the number of nodes in reasonable computation time.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.202-210
• /
• 1995

Given a tree T with a root node 0 having the capacity H and a profit $c_{v}$ and a demand $d_{v}$ on each node v of T, the capacitated subtree of a tree problem(CSTP) is to find a subtree of T containing the root that has the maximum total profit, the sum of profits over the subtree, and also satisfies the constraint of which the sum of demands over the subtree must be less than or equal to H. We first define the so-called critical item for CSTP and find an upper bound on the linear programming relaxation of CSTP. We then present our branch and bound algorithm for solving CSTP and finally report the computational results on a set of randomly generated test problems.s.s.