• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.498-508
• /
• 2001

In this paper, we propose an efficient coding algorithm for the zoom images to find the optimal depth and texture information. The proposed algorithm is the area-based method consisting of two consecutive steps, i) the depth extraction step and ii) the texture extraction step. The X-Y plane of the object space is divided into triangular patches and the depth value of the node is determined in the first step and then the texture of the each patch is extracted in the second step. In the depth extraction step, the depth of the node is determined by applying the block-based disparity compensation method to the windowed area centered at the node. In the second step, the texture of the triangular patches is extracted from the zoom images by applying the affine transformation based disparity compensation method to the triangular patches with the depth value extracted from the first step. To improve the quality of image, the interpolation is peformed on the object space instead of the interpolation on the image plane.

• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1478-1485
• /
• 2009

A sensor network which is composed of a large number of sensors that perform various sensing is applied in a variety of fields. The sensor networks can be widely used for various application area like as home automation, fire detection and security area. Development of new sensor to have appropriate functions and deployment of networks for suitable application are served actively. In this paper, we design and implement a system that monitors various factory facilities by deploying sensor network at a working place which threatens the worker's safety. A sensor node reports its sensing data like as temperature and humidity to monitor facilities to a sink node. And the server which is connect to the sink node gathers and provides information by user interface. In addition, digital data which are generated at a work place can be transferred via the sensor network to increase the efficiency of works. The proposed sensor network provides the convenience of working, since it is deployed at a garbage collection company to monitor a temperature and humidity of garbage and to transmit data about the weight of trucks which enters the company.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.1999-2007
• /
• 2010

Proxy Mobile IPv6(PMIPv6) is a network-based mobility management protocol and it does not require mobile node's involving in mobility management. In PMIPv6, the Mobile Access Gateway (MAG) incurs a high signaling cost to update the location of a mobile node to the remote Local Mobility Anchor (LMA) if it moves frequently. It may cause excessive signaling traffic and increase a high traffic load on LMA. Therefore, we propose a new mobility management scheme in proxy mobile IPv6 networks with dynamic paging support. To minimize signaling overhead, in our proposal, the size of the paging area is determined dynamically according the changes of mobility and traffic patterns of the mobile node. An analytic model is applied to determine the optimal size of the paging area. The cost analysis using fluid flow model presented in this paper shows that our proposal can achieve performance superior that of PMIPv6 scheme.

• Convergence Security Journal
• /
• v.19 no.5
• /
• pp.19-24
• /
• 2019

It is impossible to apply the routing protocol in the wired environment because MANET consists of only mobile nodes. Therefore, routing protocols considered these characteristics are required. In particular, if malicious nodes are not excluded in the routing phase, network performance will be greatly reduced. In this paper, we propose intrusion detection technique based on region to improve routing performance. In the proposed technique, the whole network is divided into certain areas, and then attack detection within the area using area management node is performed. It is a proposed method that can detect attack nodes in the path through cooperation with each other by using completion message received from member nodes. It also applied a method that all nodes participating in the network can share the attack node information by storing the detected attack node and sharing. The performance evaluation of the proposed technique was compared with the existing security routing techniques through the experiments and the superior performance of the proposed technique was confirmed.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.117-126
• /
• 2011

Recently, AR applications provide location-based spatial information by GPS. Also, the spatial information is displayed by the angle of the camera. So far, traditional spatial indexes in spatial database field retrieve and filter spatial information by the minimum bounding rectangle (MBR) algorithm.(ex. R-tree) MBR strategy is a useful technique in the geographic information systems and location based services. But MBR technique doesn't reflect the characteristics of spatial queries in AR. Spatial queries of AR applications have high possibility of the dead space area between MBRs of non-leaf node and query area. We propose triangle node filtering algorithm that improved efficiency of spatial retrieval used the triangle node filtering techniques by exclusion the dead space. In this paper, the proposed algorithm has been implemented on PostgreSQL/PostGIS. Experimental results show the spatial retrieval that using the proposed algorithm better performance than the spatial retrieval that of the minimum bounding rectangle algorithm.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.3
• /
• pp.1-8
• /
• 2015

In transportation networks, searching speed and result accuracy are becoming more critical on searching minimum path algorithm. Current $A^*$ algorithm has a big advantage of high searching speed. However, it has disadvantage of complicated searching network and low accuracy rate of finding the minimum path algorithm. Therefore, this study developed $A^*$ algorithm's heuristic function and focused on improving it's disadvantages. Newly developed function in this study contains the area concept, not the line concept. During the progress, this study adopts the idea of a heavier node that remains lighter to the target node is better that the lighter node that becomes heavier when it is connected to the other. Lastly, newly developed algorithm has the feedback function, which allows the larger accuracy value of heuristic than before. This developed algorithm tested on real network, and proved that developed algorithm is useful.

• Korean Journal of Clinical Oncology
• /
• v.14 no.2
• /
• pp.120-127
• /
• 2018

Purpose: The purpose of this study was to determine the immunologic role of lymph node (LN) and stage migration by assessing LN count and metastatic LN count. Methods: A total of 2,117 patients with gastric adenocarcinoma located in the body and antrum who underwent distal/subtotal gastrectomy with D2 LN dissection between January 1, 1998 and December 31, 2008 were enrolled. LN count and number of metastases were determined in the N1 tier (area of D1 dissection) and N2 tier (area of D2 dissection). The lower and upper quartiles of LN counts in the same pN stage were grouped to compare the prognosis and LN positivity according to the LN tier. Results: Stage migration from N1 tier to N2 tier occurred in 3.2% of cases. The 5-year disease-specific survival rates of the upper and lower LN count groups within the N1 tier were 91.0% and 86.7% (P=0.01), respectively. LN positivity in the N2 tier of the lower LN count group was higher than that of the upper LN count group (14.1% vs. 8.2%, P<0.01). Stage migration in the N2 tier of the lower LN count group was also higher than that of the upper LN count group (4.6% vs. 1.8%, P<0.01). Conclusion: The lower LN count group had a decreased survival rate compared to that of the upper LN count group, suggesting that perigastric LN has an immunological defense role in weakening the disseminating power of metastatic tumor cells, as indicated by the LN count.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.69-74
• /
• 2010

Now the CAN(controller Area Network) is using electronic modules as a serial communication which is very robust to noise. Especially the CAN is using for automotive part that very popular in which automotive electronic control module, engine controller unit, sensor modules, etc. but the CAN has the order of priority to linking node and also has fault confinement so using in these features that is applied to in factory automation product line. The CAN communication is basically very robust to electric noise so varied applying to others part. In this paper, we suggest to CAN interface for embedded system that is possible for error detection using two CAN nodes on Hi-speed, full-CAN.

• IE interfaces
• /
• v.23 no.2
• /
• pp.108-117
• /
• 2010

Wireless sensor network may be installed where it is hard to access or where one has to constantly gather data without any human's monitoring. Sensors which compose a sensor network are usually small with poor battery capacities and thus energy-efficient usage is very important because of difficulties in replacing or recharging the batteries to make the lifetime of the whole sensor network longer. LEACH protocol, a well-known hierarchical routing protocol, may resolve this problem by distributing the role of cluster header evenly to the sensor nodes in the whole area of network at each round. In this thesis, we introduce a variant of LEACH protocol which considers the distance between base station and sensors in the way that if a node is far from the base station then the probability that this node becomes a cluster header is low. Experiments to evaluate the energy efficiency and the ability to collect the information show that the proposed method in this paper has maintained much wider sensing area while keeping the energy efficiency same as LEACH.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.13-29
• /
• 1997

This paper considers a new routing problem, successive max-min connection ratio problem (SMCRP), arised in circuit telecommunication networks such as SONET and WDM optical transport network. An optimization model for SMCRP is established based on link-flow formulation. It's first optimization process is an integral version of maximum concurrent flow problem. Integer condition does not give the same connection-ratio of each node-pair at an optimal solution any more. It is also an integral multi-commodity flow problem with fairness restriction. In order to guarantee fairness to every node-pair the minimum of connection ratios to demand is maximized. NP- hardness of SMCRP is proved and a heuristic algorithm with polynomial-time bound is developed for the problem. Augmenting path and rerouting flow are used for the algorithm. The heuristic algorithm is implemented and tested for networks of different sizes. The results are compared with those given by GAMS/OSL, a popular commercial solver for integer programming problem.n among ferrite-pearlite matrix, the increase in spheroidal ratio with increasing fatigue limitation, 90% had the highest, 14.3% increasing more then 70%, distribution range of fatigue.
ife was small in same stress level. (2) $\sqrt{area}_{max}$ of graphite can be used to predict fatigue limit of Ductile Cast Iron. The Statistical distribution of extreme values of $\sqrt{area}_{max}$ may be used as a guideline for the control of inclusion size in the steelmaking.