• Korean Journal of Veterinary Research
• /
• v.44 no.2
• /
• pp.311-315
• /
• 2004

The detection of lymph node metastasis is an important step in tumor staging and is significant for therapy planning. It has been challenged to yield an appropriate image with diagnostic methods such as Magnetic Resonance (MR) and Computed Tomography (CT). Though CT has been used widely and accessed easily to show internal organs, it can hardly provide difference between lymph node and adjacent vessel or fat tissue. It has been well established that MR can reveal the subtle discrepancy within soft tissue. This study investigated the suitability of MR lymph node imaging without contrast enhancement by comparison of T1-weighted image (T1WI) and T2- weighted image (T2WI) in ten normal rabbits. According to the pulse sequence optimized from preliminary study, T1-weighted spin-echo (repetition time/echo time=400/12 ms) and T-2 weighted fast spin-echo (repetition time/echo time=3500/84 ms) images covering the hind limbs and pelvic region were acquired at 1.5 T. Two radiologists scrupulously evaluated the MR images in consensus. And signal intensity of lymph nodes was compared with that of adjacent fat. Statistical analysis showed that T1-weighted coronal image visualized the lymph nodes (iliac, superficial inguinal and popliteal lymph nodes) quickly and consistently rather than T2-weighted one. Conclusively, T1WI for evaluation of lymph nodes is moderately better than T2WI and appears to have potential for quick and sufficient mapping of the lymph nodes. In addition, this normal MR image of lymph nodes could be applied to further study for the evaluation of lymphatic system in abscess and tumor bearing animal model.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.1219-1219
• /
• 1991

This paper proposes the model order reduction with pass band error reduction in the frequency domain of discrete time linear systems. The algorithm is the new method of reduced order model which reduces passband error by changing controllability and observability gramian used with weighted functions. A numerical example shows that this algorithm has lower passband error than balanced w&l and weighted function characteristics in frequency domain.

• Journal of the Korea Safety Management & Science
• /
• v.4 no.2
• /
• pp.11-22
• /
• 2002

In this study, an asymmetric lifting posture prediction model was developed, which was a three-dimensional model with 12 links and 23 degrees of freedom open kinematic chains. Although previous researchers have proposed biomechanical, psychophysical, or physiological measures as cost functions, for solving redundancy, they lack in accuracy in predicting actual lifting postures and most of them are confined to the two-dimensional model. To develop an asymmetric lifting posture prediction model, we used the resolved motion method for accurately simulating the lifting motion in a reasonable time. Furthermore, in solving the redundant problem of the human posture prediction, a moment weighted Joint Range Availability (JRA) was used as a cost function in order to consider dynamic lifting. However, it is known that the moment weighted JRA as a cost function predicted the lower extremity and L5/S1 joint motions better than the upper extremities, while the constant weighted JRA as a cost function predicted the latter better than the former. To compensate for this, we proposed a hybrid moment weighted JRA as a new cost function with moment weighted for only the lower extremity. In order to validate the proposed cost function, the predicted and real lifting postures for various lifting conditions were compared by using the root mean square(RMS) error. This hybrid JRA reduced RMS more than the previous cost functions. Therefore, it is concluded that the cost function of a hybrid moment weighted JRA can be used to predict three-dimensional lifting postures. To compare with the predicted trajectories and the real lifting movements, graphical validations were performed. The results also showed that the hybrid moment weighted cost function model was found to have generated the postures more similar to the real movements.

• Journal of Environmental Health Sciences
• /
• v.26 no.4
• /
• pp.58-64
• /
• 2000

Indoor air quality tends to be the dominant contributor to personal exposure, because most people spend over 80% of their time indoors. In this study, indoor and outdoor NO$_2$ concentrations were measured and compared with simultaneously personal exposures of 21 university students in weekday and weekend. House characteristics and activity pattern were used to determine the impacts of these factors on personal exposure. Since university students spent most of their times in indoor, their NO$_2$ exposure was associated with indoor NO$_2$ level rather than outdoor NO$_2$ level both weekday and weekend in spite of different time activity. Using time-weighted average model, NO$_2$ exposures of university students were estimated by NO$_2$ measurements in indoor home, indoor school, and outdoor home levels. Estimated NO$_2$ personal exposures were significantly correlated with measured NO$_2$ personal exposures($r^2$=0.87). However, estimated personal NO$_2$ exposures by time-weighted average model were underestimated, comparing with the measured personal NO$_2$ exposure. Using multiple regression analysis, effect of personal NO$_2$ exposure for transportation was confirmed.

• Communications for Statistical Applications and Methods
• /
• v.23 no.6
• /
• pp.467-478
• /
• 2016

The accelerated failure time model or accelerated life model relates the logarithm of the failure time linearly to the covariates. The parameters in the model provides a direct interpretation. In this paper, we review some newly developed practically useful estimation and inference methods for the model in the analysis of right censored data.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.18 no.1
• /
• pp.84-92
• /
• 2015

This paper proposes a new approach to reduce the target estimation error of the measurement angle, especially applied to the medium and long range surveillance radar. If the target has no maneuver and no change in heading direction for a certain time interval, the predicted angle of interacting multiple model(IMM) from the previous track information can be used to reduce the angle estimation error. The proposed method is simulated in 2 scenarios, a scenario with a non-maneuvering target and a scenario with a maneuvering target. The result shows that the new fusion solution(weighted IMM) with the predicted azimuth and the measured azimuth is worked properly in the two scenarios.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.87-101
• /
• 2008

This paper considers an order scheduling model to minimize the total weighted tardiness of orders. Each order requires different types of products. Each type of product is manufactured on its dedicated machine specified in advance. The completion time of each order is represented by the time when all the products belonging to the order are completed. The objective of this paper is to find the optimal production schedule minimizing the total weighted tardiness of a finite number of orders. In the problem analysis, we first derive a powerful solution property to determine the sequence of two consecutive orders. Moreover, two lower bounds of objective are derived and tested along with the derived property within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.4
• /
• pp.125-135
• /
• 1993

An Unrelated Parallel Processing with Weighted jobs and Setup times scheduling prolem is studied. We consider a parallel processing in which a group of processors(machines) perform a single operation on jobs of a number of different job types. The processing time of each job depends on both the job and the machine, and each job has a weight. In addition each machine requires significant setup time between processing jobs of different job types. The performance measure is to minimize total weighted flow time in order to meet the job importance and to minimize in-process inventory. We present a 0-1 Mixed Integer Programming model as an optimizing algorithm. We also present a simple heuristic algorithm. Computational results for the optimal and the heuristic algorithm are reported and the results show that the simple heuristic is quite effective and efficient.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.4
• /
• pp.219-226
• /
• 2019

One of the most widely studied protocols for tactical ad-hoc networks is Optimized Link State Routing Protocol (OLSR). As for OLSR research, most research work focus on reducing control traffic overhead and choosing relay point. In addition, because OLSR is mostly dependent on link detection and propagation, dynamic Hello timer become research challenges. However, different timer interval causes imbalance of link validity time by affecting link lifetime. To solve this problem, we propose a weighted topology graph model for constructing a robust network topology based on the link validity time. In order to calculate the link validity time, we use control message timer, which is set for each node. The simulation results show that the proposed mechanism is able to achieve high end-to-end reliability and low end-to-end delay in small networks.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.536-543
• /
• 2011

The heterogeneous postal delivery model assumes that each intermediate node in the multicasting tree incurs a constant switching time for each message that is sent. We have proposed a new model where we assume a more generalized switching time at intermediate nodes. In our model, a child node v of a parent u has a switching delay vector, where the ith element of the vector indicates the switching delay incurred by u for sending the message to v after sending the message to i-1 other children of u. Given a multicast tree and switching delay vectors at each non-root node 5 in the tree, we provide an O(n$^{\frac{5}{2}}$) optimal algorithm that will decide the order in which the internal (non-leaf) nodes have to send the multicast message to its children in order to minimize the maximum end-to-end delay due to multicasting. We also show an important lower bound result that optimal multicast switching delay problem is as hard as min-max matching problem on weighted bipartite graphs and hence O(n$^{\frac{5}{2}}$) running time is tight.