• Journal of Mechanical Science and Technology
• /
• v.19 no.5
• /
• pp.1158-1168
• /
• 2005

A shunt from the left ventricle to the left anterior descending artery is being developed for coronary artery occlusive disease, in which the shunt or conduit connects the the left ventricle (LV) with the diseased artery directly at a point distal to the obstruction. To aid in assessing and optimizing its benefit, a computational model of the cardiovascular system was developed and used to explore various design conditions. Computational fluid dynamic analysis for the shunt hemodynamics was also done using a commercial finite element package. Simulation results indicate that in complete left anterior descending artery (LAD) occlusion, flow can be returned to approximately 65% of normal, if the conduit resistance is equal for forward and reverse flow. The net coronary flow can increase to 80% when the backflow resistance is infinite. The increases in flow rate produced by asymmetric flow resistance are enhanced considerably for a partial LAD obstruction, since the primary effect of resistance asymmetry is to prevent leakage back into the ventricle during diastole. Increased arterial compliance has little effect on net flow with a symmetric shunt, but considerably augments it when the resistance is asymmetric. The computational results suggest that an LV-LAD conduit will be beneficial when the resistance due to artery stenosis exceeds 27 PRU, if the resistance is symmetric. Fluid dynamic simulations for the shunt flow show that a recirculating region generated near the junction of the coronary artery with the bypass shunt. The secondary flow is induced at the cutting plane perpendicular to the axis direction and it is in the attenuated of coronary artery.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3080-3086
• /
• 2009

We have analyzed the output characteristics of a LGP with pyramid shaped pattern by using a 3-D simulation tool. The influences on the LGP output of various parameters such as the pattern shape, pattern occupation ratio, pattern size, and etching angle were investigated. Comparing the pyramid shaped pattern with hemispherical patterns, little difference was observed. And, it was proved that the pattern occupation ratio and etching angle have relatively large effects on LGP output characteristics, while the pattern size has no effect. Therefore, we can improve the LGP characteristics by optimizing pattern structure and distribution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1567-1587
• /
• 2014

Virtual Machine (VM) resource management is crucial to satisfy the Quality of Service (QoS) demands of various multimedia services in a media cloud platform. To this end, this paper presents a VM resource allocation model that dynamically and optimally utilizes VM resources to satisfy QoS requirements of media-rich cloud services or applications. It additionally maintains high system utilization by avoiding the over-provisioning of VM resources to services or applications. The objective is to 1) minimize the number of physical machines for cost reduction and energy saving; 2) control the processing delay of media services to improve response time; and 3) achieve load balancing or overall utilization of physical resources. The proposed VM allocation is mapped into the multidimensional bin-packing problem, which is NP-complete. To solve this problem, we have designed a Mixed Integer Linear Programming (MILP) model, as well as heuristics for quantitatively optimizing the VM allocation. The simulation results show that our scheme outperforms the existing VM allocation schemes in a media cloud environment, in terms of cost reduction, response time reduction and QoS guarantee.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1754-1769
• /
• 2013

For the purpose of enhancing the spectrum efficiency, cognitive radio (CR) technology has been recently proposed as a promising dynamic spectrum allocation paradigm. In CR, spectrum sensing is the key capability of secondary users in a cognitive radio network that aims for reducing the probability of harmful interference with primary users. However, the individual CRs might not be able to carry out reliable detection of the presence of a primary radio due to the impact of channel fading or shadowing. This paper studies the cooperative spectrum sensing scheme as means of optimizing the sensing performance in AWGN and Rayleigh channels. Results generated from simulation provide evidence of the impact of channel condition on the complementary receiver operating characteristic (ROC). Based on the results, it was found that with constant local SNRs at the secondary users, the probability of missed detection ($P_m$) of cooperative spectrum sensing in a cognitive radio network, calculated using a closed form expression, can be significantly minimized. Thus, the paper illustrates that improvement of the detection performance of the CR network can be achieved by establishing a centralized cooperation among neighboring cognitive radio users. Finally, verification of the validity of the fusion schemes utilized for combining the individual CR decisions is provided.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.322-331
• /
• 2010

This paper introduces a new efficient design scheme for spatial multiplexing (SM) systems over closed loop multiple-input multiple-output (MIMO) wireless channels. Extending the orthogonalized spatial multiplexing (OSM) scheme which was developed recently for transmitting two data streams, we propose a new SM scheme where a larger number of data streams can be supported. To achieve this goal, we partition the data streams into several subblocks and execute the block-diagonalization process at the receiver. The proposed scheme still guarantees single-symbol maximum likelihood (ML) detection with small feedback information. Simulation results verify that the proposed scheme achieves a huge performance gain at a bit error rate (BER) of $10^{-4}$ over conventional closed-loop schemes based on minimum mean-square error (MSE) or bit error rate (BER) criterion. We also show that an additional 2.5dB gain can be obtained by optimizing the group selection with extra feedback information.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.321-335
• /
• 2001

The explosive growth in wireless networking increasingly urges the demand to support mobility within the Internet which is what Mobile-IP aims to provide. Because the transmission of signals through open-air s easy to be attacked, it is important to provide secure transmission for mobile users and make them responsible for what they have done in networks. Although IETF provides a secret-key based security mechanism, those mechanisms suffer from scalability, efficiency and non-repudiation service problem. The proposed mechanism uses public-key based authentication optimizing the performance. It includes non-repudiation service on the side of mobile for airtight security in wireless network. The simulation results show that the proposed authentication reduces the total registration time. It especially minimizes the computation cost on the side of the mobile node and solves the power problem. In practice, the proposed authentication is feasible with reasonable performance and security service in macro mobility that Mobile-IP is intended to solve.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.10
• /
• pp.74-79
• /
• 2010

In this paper, a high gain W-band amplifier is presented using 70 run mHEMT MMIC technology. The length of source feedback line of common-source FET is carefully determined to maximize the gain at a design frequency. Simulation shows that MAG can be increased by 0.8 dB by optimizing the length of this line. In addition, this feedback line changes the input impedance of the common-source FET in a way that the input match can be made easier. In this work, 4-stage amplifier is designed on CPW using the source feedback. The measurement shows the excellent gain performance higher than 22.0 dB across 70~103 GHz.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.113-116
• /
• 2001

In this paper, a new multicasting scheduling is proposed for WDM single-hop broadcast network. The main idea of traditional multicast scheduling algorithms is partitioning the multicast group into several subgroups to reduce the delay time after receiving previous message. Those partitioning algorithms are grouping method of receivers already tuned to transmitters wavelength. However, multicast scheduling shows better performance by considering the previous status of receivers. Thus, in this paper, a new subgrouping method is proposed to minimize delay through collecting the current status of receivers. This method is operated by using the tunable transceiver in WDM single hop broadcasting network and uses fixed control channel for collecting the status of receivers. In addition, we analyzed the performance of proposed method through the computer simulation and then compared with existing multicast scheduling algorithm.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2011.06a
• /
• pp.218-219
• /
• 2011

This paper focuses on dispatching strategy for AGVs(Automated Guided Vehicle). The goal of AGV dispatching problem is allocating jobs to AGVs to minimizing QC delay and AGV total travel distance. Due to the highly dynamic nature of container terminal environment, the effect of dispatching is hard to predict thus it leads to frequent modification of dispatching results. Given this situation, single rule-based approach is widely used due to its simplicity and small computational cost. However, single rule-based approach has a limitation that cannot guarantee a satisfactory performance for the various performance measures. In this paper, dispatching strategy based on multicriteria heuristics is proposed. Proposed strategy consists of multiple decision criteria. A muti-objective evolutionary algorithm is applied to optimize weights of those criteria. The result of simulation experiment shows that the proposed approach outperforms single rule-based dispatching approaches.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.12
• /
• pp.1911-1919
• /
• 2012

In this paper, we focus on a robotic sealing process in which three robots are used. Each robot can be considered as a 7 axis redundant robot of which the first joint is prismatic and the last 6 joints are revolute. In the factory floor, robot path planning is not a simple problem and is not automated. They need experienced operators who can operate robots by teaching and playing back fashion. However, the robotic sealing process is well organized so the relative positions and orientations of the objects in the floor and robot paths are all pre-determined. Therefore by adopting robotic theory, we can optimally plan robot pathes without using teaching. In this paper, we analyze the sealing robot by using redundant manipulator theory and propose three different methods for path planning. For sealing paths outside of a car body, we propose two methods. The first one is resolving redundancy by using pseudo-inverse of Jacobian and the second one is by using weighted pseudo-inverse of Jacobian. The former is optimal in the sense of energy and the latter is optimal in the sense of manipulability. For sealing paths inside of a car body, we must consider collision avoidance so we propose a performance index for that purpose and a method for optimizing that performance index. We show by simulation that the proposed method can avoid collision with faithfully following the given end effector path.