• 디지털산업정보학회논문지
• /
• 제10권2호
• /
• pp.47-59
• /
• 2014

In this paper, I propose a new energy efficient clustering scheme to prolong the network lifetime by reducing energy consumption at the sensor node. It is possible that a node determines whether to participate in clustering with certain probability based on local density. This scheme is useful under the environment that sensor nodes are deployed unevenly within the sensing area. By adjusting the probability of participating in clustering dynamically with local density of nodes, the energy consumption of the network is reduced. So, the lifetime of the network is extended. In the region where nodes are densely deployed, it is possible to reduce the energy consumption of the network by limiting the number of node which is participated in clustering with probability which can be adjusted dynamically based on local density of the node. Through computer simulation, it is verified that the proposed scheme is more energy efficient than LEACH protocol under the environment where node are densely located in a specific area.

• 정보학연구
• /
• 제5권2호
• /
• pp.55-67
• /
• 2002

본 논문에서는 학습계수를 발생한 오차에 따라서 적응적으로 갱신할 수 있는 학습알고리즘에 은닉 노드의 수를 다양하게 변화시킬 수 있는 적응 역 전파(Back Propagation) 알고리즘을 제안하였다. 제안한 알고리즘은 국소점을 벗어날 수 있는 것으로 기대되고, 수렴환경에 알맞은 은닉 노드의 수를 설정할 수 있다. 모의실험에서는 두 가지의 학습패턴을 가지고 실험하였다. 하나는 X-OR 문제에 대한 학습과 또 다른 하나는 $7{\times}5$ 도트 영문자 폰트에 에 대한 학습이다. 두 모의실험에서 국소 점으로 안주할 확률은 감소하였다. 또한, 영문자 폰트 학습에서의 신경회로망은 기존의 역 전파 알고리즘과 HNAD 알고리즘에 비하여 약 41.56%~58.28%정도 학습효율이 향상됨을 고찰하였다.

• Journal of Communications and Networks
• /
• 제5권3호
• /
• pp.249-257
• /
• 2003

Ring networks are very commonly exploited among local area and metropolitan area networks (LAN/MAN), whereas cells or small fixed-size packets are widely used in synchronized ring networks. In this paper, we present an analytical method for evaluating the delay-throughput performance of a MAC protocol with multiple self-tokens in a slotted ring network under uniform traffic. In our analysis, we introduce the stationary probability, which indicates the number of packets in a node. Also, it is assumed that each node has a sufficiently large amount of self-tokens, and a slotted ring has the symmetry. The analytical results with respect to delay-throughput performance have similar values to computer simulated ones. Furthermore, in order to achieve fair access under non-uniform traffic, we propose an adaptive MAC protocol, where the number of self-tokens in a node dynamically varies, based on the number of packets transmitted within a specified period. In the proposed protocol, when the number of packets transmitted by a node within a specified period is larger than a specified threshold, the node decreases the number of self-tokens in a per-node distributed method. That results in creating free slots in the ring, thus all nodes can obtain an equal opportunity to transmit into the ring. Performance results obtained by computer simulation show that our proposed protocol can maintain throughput fairness under non-uniform traffic.

• 한국전산구조공학회논문집
• /
• 제20권3호
• /
• pp.293-301
• /
• 2007

본 연구에서는 이동최소제곱 다절점 유한요소를 이용한 새로운 전역-국부해석기법을 제시하였다. 다절점 유한요소는 요소의 변에 임의의 수 절점을 가질 수 있으므로, 여러 개의 유한요소를 요소망의 재구성 없이 동시적으로 결합시킬 수 있다. 이는 응력구배가 집중되는 곳에 유한요소망을 구성하는 데에 있어 큰 편의를 제공한다. 또한 기존의 전역-국부해석기법처럼 중첩된 요소망을 사용하거나, 지배방정식을 두 번 해석할 필요가 없기 때문에 매우 간편하고 정확하다. 제시된 방법론의 성능을 검증하기 위해 응력 집중과 관련된 다양한 다중스케일 문제를 해석하였다.

• Asian Pacific Journal of Cancer Prevention
• /
• 제14권6호
• /
• pp.3769-3772
• /
• 2013

Background: To investigate the impact of the lymph node ratio (LNR) on the prognosis of patients with locally advanced rectal cancer undergoing pre-operative chemoradiation. Methods: Clinicopathologic and follow up data of 128 patients with stage III rectal cancer who underwent curative resection from 1996 to 2007 were reviewed. The patients were divided into two groups according to the lymph node ratio: LNR ${\leq}$ 0.2 (n=28), and >0.2 (n=100). Kaplan-Meier and the Cox proportional hazard regression models were used to evaluate the prognostic effects according to LNR. Results: Median numbers of lymph nodes examined and lymph nodes involved by tumour were 10.3 (range 2-28) and 5.8 (range 1-25), respectively, and the median LNR was 0.5 (range, 0-1.6). The 5-year survival rate significantly differed by LNR (${\leq}$ 0.2, 69%; >0.2, 19%; Log-rank p value < 0.001). LNR was also a significant prognostic factor of survival adjusted for age, sex, post-operative chemotherapy, total number of examined lymph nodes, metastasis and local recurrence (${\leq}$ 0.2, HR=1; >0.2, HR=4.8, 95%CI=2.1-11.1) and a significant predictor of local recurrence and distant metastasis during follow-up independently of total number of examined lymph node. Conclusions: Total number of examined lymph nodes and LNR were significant prognostic factors for survival in patients with stage III rectal cancer undergoing pre-operative chemoradiotherapy.

• 한국군사과학기술학회지
• /
• 제19권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.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.601-605
• /
• 1991

In this paper an approximate solution method for the large-scale Traveling Salesman Problem(TSP) is presented. The method start with the subdivision of the problem domain into a number of clusters by considering their geometries. The clusters have limited number of nodes so as to get local solutions. They are linked to give the least path which covers the whole domain and become TSPs with start- and end-node. The approximate local solutions in each cluster are obtained by using geometrical property of the cluster, and combined to give an overall-approximate solution for the large-scale TSP.

• 한국정보시스템학회지:정보시스템연구
• /
• 제6권1호
• /
• pp.159-180
• /
• 1997

Database sharing system(DBSS) refers to a system for high performance transaction processing. In DBSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory, a separate copy of operating system, and a DBMS. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. However, since multiple nodes may be simultaneously cached a page, cache consistency must be ensured so that every node can always access the latest version of pages. In this paper, we propose efficient buffer invalidation schemes in DBSS, where the database is logically partitioned using primary copy authority to reduce locking overhead. The proposed schemes can improve performance by reducing the disk access overhead and the message overhead due to maintaining cache consistency. Furthermore, they can show good performance when database workloads are varied dynamically.

• 전기전자학회논문지
• /
• 제22권3호
• /
• pp.570-577
• /
• 2018

With the increasing number of network nodes, traditional client/server node selection mechanisms are under tremendous pressure. In order to select efficient cooperative nodes in a highly dynamic P2P network topology, this article uses greedy algorithm to translate the overall optimization into multiple local optimal problems, and to quickly select service nodes. Therefore, the service node with the largest comprehensive capacity is selected to reduce the transmission delay and improve the throughput of the service node. The final simulation results show that the node selection strategy based on greedy algorithm can effectively improve the overall performance of P2P streaming media system.

• International journal of advanced smart convergence
• /
• 제5권3호
• /
• pp.32-39
• /
• 2016

With the help of a small wearable device, patients reside in an isolated village need constant monitoring which may increase access to care and decrease healthcare delivery cost. As the number of patients' requests increases in simultaneously manner, the web service gateway located in the village hall encounters limitations for performing them successfully and concurrently. The gateway based RESTful technology responsible for handling patients' requests attests an internet latency in case a large number of them submit toward the gateway increases. In this paper, we propose the design tasks of the web service gateway for handling concurrency events. In the procedure of designing tasks, concurrency is best understood by employing multiple levels of abstraction. The way that is eminently to accomplish concurrency is to build an object-oriented environment with support for messages passing between concurrent objects. We also investigate the performance of event-driven architecture for building web service gateway using node.js. The experiments results show that server-side JavaScript with Node.js and MongoDB as database is 40% faster than Apache Sling. With Node.js developers can build a high-performance, asynchronous, event-driven healthcare hub server to handle an increasing number of concurrent connections for Remote Healthcare Monitoring System in an isolated village with no access to local medical care.