• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.24 no.2
• /
• pp.168-179
• /
• 2013

The critical point analysis(CA) and impedance matching analysis(IA) are performed and compared for a 4-coil magnetic resonance wireless power transfer system. Because the operating frequency splits at short distance while the efficiency drops drastically at long distance in this system, the optimization technique is needed for either a specific distance or efficiency at the fixed frequency. CA uses the critical point where shows maximum efficiency in the entire range and IA uses the impedance matching technique to achieve maximum efficiency at the specific distance. Comparison result shows that IA is more efficient than CA. Also, it shows one side matching has a tradeoff relationship comparing to both side matching. By using four spiral resonant coils, the analysis was experimentally verified. The measured data agreed well with the calculated data.

• KIISE Transactions on Computing Practices
• /
• v.22 no.12
• /
• pp.675-680
• /
• 2016

The development of various mobile devices and mobile platform technology has led to a steady increase in the number of online social network (OSN) users. OSN users are free to communicate and share information through activities such as social networking, but this causes a new, user privacy issue. Various distributed OSN architectures are introduced to address the user privacy concern, however, users do not obtain technically perfect control over their data. In this study, the control rights of OSN user are maintained by using personal data storage (PDS). We propose a technique to improve data privacy protection that involves making a group with the user's friend by generating and providing fake text data based on user's real text data. Fake text data is generated based on the user's word sensitivity value, so that the user's friends can receive the user's differential data. As a result, we propose a system architecture that solves possible problems in the tradeoff between service utility and user privacy in OSN.

• Investigative Magnetic Resonance Imaging
• /
• v.12 no.1
• /
• pp.27-32
• /
• 2008

Purpose : We developed a 3D CSI (chemical shift imaging) sequence that uses the PRESS (point resolved spectroscopy) excitation scheme and spiral-based readout gradients. Materials and Methods : We implemented constant-density spirals ($32{\times}32$ matrix, $24{\times}24\;cm$ FOV) which use analytic equations to enable real-time prescription on the scanner. In-vivo data from the brain were collected and reconstructed using the gridding algorithm. Results : Data illustrate that with our imaging sequence, the benefits of the PRESS technique, which include elimination of lipid artifacts, remain intact while flexible scan time versus resolution tradeoffs can be achieved using the constant-density spirals. Volumetric high resolution 3D CSI covering 5760 cm3 could be obtained in 12.5 minutes. Conclusion : Spiral-based readout gradients offer a flexible tradeoff between scan time versus resolution. By combining this feature with PRESS based excitation, efficient methods of volumetric spectroscopic imaging can be accomplished by obtaining whole brain coverage while eliminating lipid contamination.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.4
• /
• pp.413-423
• /
• 2016

Worldview-3 satellite sensor provides panchromatic image with high-spatial resolution and 8-band multispectral images. Therefore, an image-sharpening technique, which sharpens the spatial resolution of multispectral images by using high-spatial resolution panchromatic images, is essential for various applications of Worldview-3 images based on image interpretation and processing. The existing pansharpening algorithms tend to tradeoff between spectral distortion and spatial enhancement. In this study, we applied six pansharpening algorithms to Worldview-3 satellite imagery and assessed the quality of pansharpened images qualitatively and quantitatively. We also analyzed the effects of time lag for each multispectral band during the pansharpening process. Quantitative assessment of pansharpened images was performed by comparing ERGAS (Erreur Relative Globale Adimensionnelle de Synthèse), SAM (Spectral Angle Mapper), Q-index and sCC (spatial Correlation Coefficient) based on real data set. In experiment, quantitative results obtained by MRA (Multi-Resolution Analysis)-based algorithm were better than those by the CS (Component Substitution)-based algorithm. Nevertheless, qualitative quality of spectral information was similar to each other. In addition, images obtained by the CS-based algorithm and by division of two multispectral sensors were shaper in terms of spatial quality than those obtained by the other pansharpening algorithm. Therefore, there is a need to determine a pansharpening method for Worldview-3 images for application to remote sensing data, such as spectral and spatial information-based applications.

• Journal of Korean Society of Transportation
• /
• v.24 no.2 s.88
• /
• pp.157-168
• /
• 2006

Spatial detection system such as AVI, GPS, and Beacon etc. can provide spatial travel time only after a vehicle Passes through a road section. In this context, majority of the existing studies on the link travel time estimation area has focused on the arrival time-based link travel time estimation. rather than departure time-based link travel time estimation. Even if some of the researches on this area have developed departure time-based link travel time estimation algorithms, they are limited in that they are not applicable in a real-time mode. The objective of this study is to develop an departure time-based link travel time estimation algorithm which is applicable in a real-tine mode. Firstly, this study discussed the tradeoff between accuracy and timeliness of the departure time-based on-line link travel time estimates. Secondly, this study developed an departure time-based on-line link travel time estimation algorithm which utilizes the Baysian inference logic. It was found that the proposed approach could estimate departure time-based link travel times in a real-time context with an acceptable accuracy and timeliness.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.12
• /
• pp.1647-1653
• /
• 2011

The cycle time in injection moulding greatly depends on the cooling time of the plastic part that is controlled by cooling channels. Cooling channels are required to facilitate the heat transfer rate from the die to the coolant without reducing the strength of the die. Employing layered manufacturing techniques (LMT), a die embedding conformal cooling channels can be fabricated directly while conventional cooling channels are usually made of straight drilled hole. Meanwhile, H13 tool steel is widely used as the die material because of its high thermal resistance and dimensional stability. However, H13 with a low thermal conductivity is not efficient for certain part geometries. In this context, the use of functionally graded materials (FGMs) between H13 and copper may circumvent a tradeoff between the strength and the heat transfer rate. This paper presents a method for modeling of conformal cooling channels made of FGMs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2774-2796
• /
• 2015

Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1208-1222
• /
• 2014

Due to the low utilization and scarcity of frequency spectrum in current spectrum allocation methodology, cognitive radio networks (CRNs) have been proposed as a promising method to solve the problem, of which spectrum sensing is an important technology to utilize the precious spectrum resources. In order to protect the primary user from being interfered, most of the related works focus only on the restriction of the missed detection probability, which may causes over-protection of the primary user. Thus the interference probability is defined and the interference-aware sensing model is introduced in this paper. The interference-aware sensing model takes the spatial conditions into consideration, and can further improve the network performance with good spectrum reuse opportunity. Meanwhile, as so many fading factors affect the spectrum channel, errors are inevitably exist in the reporting channel in cooperative sensing, which is improper to be ignored. Motivated by the above, in this paper, we study the throughput tradeoff for interference-aware cognitive radio networks over imperfect reporting channel. For the cooperative spectrum sensing, the K-out-of-N fusion rule is used. By jointly optimizing the sensing time and the parameter K value, the maximum throughput can be achieved. Theoretical analysis is given to prove the feasibility of the optimization and computer simulations also shows that the maximum throughput can be achieved when the sensing time and the parameter of K value are both optimized.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4398-4417
• /
• 2017

Multi-user Multiple-Input and Multiple-Output (MU-MIMO) has potential for prominently enhancing the capacity of wireless network by simultaneously transmitting to multiple users. User selection is an unavoidable problem which bottlenecks the gain of MU-MIMO to a great extent. Major state-of-the-art works are focusing on improving network throughput by using Channel State Information (CSI), however, the overhead of CSI feedback becomes unacceptable when the number of users is large. Some work does well in balancing tradeoff between complexity and achievable throughput but is lack of consideration of fairness. Current works universally ignore the rational utilizing of time resources, which may lead the improvements of network throughput to a standstill. In this paper, we propose TOUSE, a scalable and fair user selection scheme for MU-MIMO. The core design is dynamic-time-warping-based user selection mechanism for downlink MU-MIMO, which could make full use of concurrent transmitting time. TOUSE also presents a novel data-rate estimation method without any CSI feedback, providing supports for user selections. Simulation result shows that TOUSE significantly outperforms traditional contention-based user selection schemes in both throughput and fairness in an indoor condition.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.232-242
• /
• 2005

This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in BFG represents a coarse grain block such as FIR and DCT and a port in a block may consume multiple data samples per invocation, which distinguishes our approach from behavioral synthesis and complicates the problem. In the presented design methodology, a dataflow graph with specified algorithm can be mapped to various hardware structures according to the resource allocation and schedule information. This simplifies the management of the area/performance tradeoff in hardware design and widens the design space of hardware implementation of a dataflow graph compared with the previous approaches. Through experiments with some examples, the usefulness of the proposed technique is demonstrated.