• Bulletin of the Korean Chemical Society
• /
• v.33 no.3
• /
• pp.975-979
• /
• 2012

Structure and Dynamics of dilute two-dimensional (2D) ring polymer solutions are investigated by using discontinuous molecular dynamics simulations. A ring polymer and solvent molecules are modeled as a tangent-hard disc chain and hard discs, respectively. Some of solvent molecules are confined inside the 2D ring polymer unlike in 2D linear polymer solutions or three-dimensional polymer solutions. The structure and the dynamics of the 2D ring polymers change significantly with the number ($N_{in}$) of such solvent molecules inside the 2D ring polymers. The mean-squared radius of gyration ($R^2$) increases with $N_{in}$ and scales as $R{\sim}N^{\nu}$ with the scaling exponent $\nu$ that depends on $N_{in}$. When $N_{in}$ is large enough, ${\nu}{\approx}1$, which is consistent with experiments. Meanwhile, for a small $N_{in}{\approx}0.66$ and the 2D ring polymers show unexpected structure. The diffusion coefficient (D) and the rotational relaxation time ($\tau_{rot}$) are also sensitive to $N_{in}$: D decreases and $\tau$ increases sharply with $N_{in}$. D of 2D ring polymers shows a strong size-dependency, i.e., D ~ ln(L), where L is the simulation cell dimension. But the rotational diffusion and its relaxation time ($\tau_{rot}$) are not-size dependent. More interestingly, the scaling behavior of $\tau_{rot}$ also changes with $N_{in}$; for a large $N_{in}$ $\tau_{rot}{\sim}N^{2.46}$ but for a small $N_{in}$ $\tau_{rot}{\sim}N^{1.43}$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2893-2912
• /
• 2013

The design of geometrically invariant watermarking is one of the most challenging work in digital image watermarking research area. To achieve the robustness to geometrical attacks, the inherent characteristic of an image is usually used. In this paper, a geometrically invariant image watermarking scheme using connected objects and gravity center is proposed. First, the gray-scale image is converted into the binary one, and the connected objects according to the connectedness of binary image are obtained, then the coordinates of these connected objects are mapped to the gray-scale image, and the gravity centers of those bigger objects are chosen as the feature points for watermark embedding. After that, the line between each gravity center and the center of the whole image is rotated an angle to form a sector, and finally the same version of watermark is embedded into these sectors. Because the image connectedness is topologically invariant to geometrical attacks such as scaling and rotation, and the gravity center of the connected object as feature points is very stable, the watermark synchronization is realized successfully under the geometrical distortion. The proposed scheme can extract the watermark information without using the original image or template. The simulation results show the proposed scheme has a good invisibility for watermarking application, and stronger robustness than previous feature-based watermarking schemes against geometrical attacks such as rotation, scaling and cropping, and can also resist common image processing operations including JPEG compression, adding noise, median filtering, and histogram equalization, etc.

• Journal of KIISE
• /
• v.43 no.3
• /
• pp.296-303
• /
• 2016

Mobile real-time systems with limited system resources and a limited power source need to fully utilize the system resources when the workload is heavy and reduce energy consumption when the workload is light. EDZL (Earliest Deadline until Zero Laxity), a multiprocessor real-time scheduling algorithm, can provide high system utilization, but little work has been done aimed at reducing its energy consumption. This paper tackles the problem of DVFS (Dynamic Voltage/Frequency Scaling) in EDZL scheduling. It proposes a technique to compute a uniform speed on full-chip DVFS platforms and individual speeds of tasks on per-core DVFS platforms. This technique, which is based on the EDZL schedulability test, is a simple but effective one for determining the speeds of tasks offline. We also show through simulation that the proposed technique is useful in reducing energy consumption.

• The Korean Journal of Physiology and Pharmacology
• /
• v.15 no.6
• /
• pp.371-382
• /
• 2011

We performed experiments using Aplysia neurons to identify the mechanism underlying the changes in the firing patterns in response to temperature changes. When the temperature was gradually increased from $11^{\circ}C$ to $31^{\circ}C$ the firing patterns changed sequentially from the silent state to beating, doublets, beating-chaos, bursting-chaos, square-wave bursting, and bursting-oscillation patterns. When the temperature was decreased over the same temperature range, these sequential changes in the firing patterns reappeared in reverse order. To simulate this entire range of spiking patterns we modified nonlinear differential equations that Chay and Lee made using temperature-dependent scaling factors. To refine the equations, we also analyzed the spike pattern changes in the presence of potassium channel blockers. Based on the solutions of these equations and potassium channel blocker experiments, we found that, as temperature increases, the maximum value of the potassium channel relaxation time constant, ${\tau}_n(t)$ increases, but the maximum value of the probabilities of openings for activation of the potassium channels, n(t) decreases. Accordingly, the voltage-dependent potassium current is likely to play a leading role in the temperature-dependent changes in the firing patterns in Aplysia neurons.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.832-844
• /
• 2008

Distributed localization algorithms are necessary for large-scale wireless sensor network applications. In this paper, we introduce an efficient node distribution based localization algorithm that emphasizes simple refinement and low system load for low-cost and low-rate wireless sensors. Each node adaptively chooses neighbor nodes for sensors, update its position estimate by minimizing a local cost function and then passes this update to the neighbor nodes. The update process considers a distribution of nodes for large-scale networks which have same density in a unit area for optimizing the system performance. Neighbor nodes are selected within a range which provides the smallest received signal strength error based on the real experiments. MATLAB simulation showed that the proposed algorithm is more accurate than trilateration and les complex than multidimensional scaling. The implementation on MicaZ using TinyOS-2.x confirmed the practicality of the proposed algorithm.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.14 no.3
• /
• pp.16-22
• /
• 2010

The gas turbine engine performance relies greatly on its component performance characteristics. Generally, engine manufacturers do not provide engine purchasers the component performance characteristics which can be obtained by lots of experimental tests at various operating conditions and big amount of expenses. In previous works the component maps have mostly been generated by scaling from a similar component map. However this scaling method has large error at off design points, specially in high altitude operation. Therefore this work proposes an inverse modeling method that can generate components maps of PT6A-67A turboprop engine using performance data provided by the engine manufacturer. In addition, evaluation can be made through comparison between performance analysis results using the performance simulation program including the generated compressor map and performance data.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.30-37
• /
• 2010

Many embedded real - lime systems have adopted processors supported with dynamic voltage scal-ing(DVS) recently. Power is one of the important metrics for Optimization in the design and operation of embedded real-time systems. We can save considerable energy by using slowdown of processor sup-ported with DVS. In this paper, we improved the previous algorithm at a point of view of time complexity to calculate task slowdown factors for an efficient energy consumption in embedded real-time systems with task synchronization. We grasped the properties of the previous algorithm having $O(n^{2})$ time complexity through mathematical analysis and s simulation. Using its properties we proposed the improved algorithms with O(nlogn) and O(n) time complexity which have the same performance as the previous algorithm has.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1142-1148
• /
• 2007

In this paper, we propose ASLM (Adaptive Selective Mapping; ASLM) scheme based on peak observation for PAPR (Peak-to-Average Power Ratio) reduction of OFDM (Orthogonal Frequency Division Multiplexing) signals. The proposed scheme is composed of three steps: peak scaling, sequence selection, and SLM procedures. In the first step, the peak signal samples in the IFFT (Inverse Fast Fourier Transform) outputs of the original input sequence are scaled down. In the second step, the sub-carrier positions where the power difference between the original input sequence and the FFT output of the scaled signal is large, are identified. Then, the phase sequences having the maximum number of phase-reversed sequence words only for these positions are selected. Finally, the generic SLM procedure is performed by using only the selected phase sequences for the original input sequence. Simulation results show that the proposed scheme significantly reduces the complexity in terms of IFFT and PAPR calculation than the conventional SLM, while maintaining the PAPR reduction performance.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.3
• /
• pp.83-89
• /
• 2010

Scalable routing is one of the key challenges in designing and operating large scale MANETs. Performance of routing protocols proposed so far is only guaranteed under various limitation, i.e., dependent of the number of nodes in the network or needs the location information of destination node. Due to the dependency to the number of nodes in the network, as the number of nodes increases the performance of previous routing protocols degrade dramatically. We propose Cluster Overlay Dynamic Source Routing (CODSR) protocol. We conduct performance analysis by means of computer simulation under various conditions - diameter scaling and density scaling. Developed algorithm outperforms the DSR algorithm, e.g., more than 90% improvement as for the normalized routing load. Operation of CODSR is very simple and we show that the message and time complexity of CODSR is independent of the number of nodes in the network which makes CODSR highly scalable.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.78-85
• /
• 2008

Most researches for power management have focused on increasing the utilization of system performance by scaling operating frequency or operating voltage. If operating frequency is changed frequently, it reduces the real system performance. To reduce power consumption, alternative approaches use the limited number of operating frequencies or set the smoothing frequencies during execution to increase the system performance, but they are not suitable for real time applications. To reduce power consumption and increase system performance for real time applications, this paper proposes a new power-aware schedule method by allocating operating frequencies and by setting smoothing frequencies. The algorithm predicts so that frequencies with continuous interval are mapped into discrete operating frequencies. The frequency smoothing reduces overheads of systems caused by changing operating frequencies frequently as well as power consumption caused by the frequency mismatch at a wide frequency interval. The simulation results show that the proposed algorithm reduces the power consumption up to 40% at maximum and 15% on average compared to the CC RT-DVS.