• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.422-430
• /
• 2002

For a time-multiplexed FPGA, a circuit is partitioned into several subcircuits, so that they temporally share the same physical FPGA device by hardware reconfiguration. In these architectures, all the hardware reconfiguration information called contexts are generated and downloaded into the chip, and then the pre-scheduled context switches occur properly and timely. Since the maximum number of the LUT's required in the same time determines the size of the chip used in the synthesis, it needs to be minimized, if possible. Many previous work use their own approaches, which are very similar to either scheduling method in high level synthesis or multi-way circuit partitioning method, to solve the problem. In this paper, we propose a method which estimates the lower bound on the number of LUT's without performing any actual synthesis. The estimated lower bounds help to evaluate the results of the previous work. If the estimated lower bound on the number of LUT's exactly matches the number of LUT's of the result from the previous work, the result must be optimal. In contrast, if they do not match, the following two cases are expected : the more exact lower bound may exist, or we might find the new synthesis result better than the result from the previous work. Experimental results show that our lower bound estimation method is very accurate. In almost al] cases experimented, the estimated lower bounds on the number of LUT's exactly match those of the previous synthesis results respectively, implying that the best results from the previous work are optimal as well as our method predicted the exact lower bound for those examples.

• Journal of Korea Foresty Energy
• /
• v.22 no.1
• /
• pp.1-7
• /
• 2003

The purpose of this study was to investigate variabilities in green moisture content, specific gravity and shrinkage in the stems of a Larch(Larix leptolepis) to provide fundamental information for technical processes. There were significant differences in green moisture contents, specific gravity and shrinkage between heratwood and sapwood. The green moisture content was correlated negatively with the height in the sapwood. On the other hands, in the heratwood, there was a positive correlation between moisture content and the height. There were no significant differences in specific gravity between south-bound and north-bound directions in both heartwood and sapwood. There were no significant differences in specific gravity due to the height in sapwood, but significant differences were foundin heartwood. There were no significant differences in shrinkage between south-bound and north-bound directions, and due to the height in most of heartwood and sapwood. However, shrinkage in north-bound direction was higher than that of in the south-bound direction in some sapwoods.

• Journal of Internet Computing and Services
• /
• v.23 no.2
• /
• pp.97-105
• /
• 2022

Web services show a rapid evolution and integration to meet the increased users' requirements. Thus, web services undergo updates and may have performance degradation due to undetected faults in the updated versions. Due to these faults, many performances and regression anomalies in web services may occur in real-world scenarios. This paper proposed applying the deep learning model and innovative explainable framework to detect performance and regression anomalies in web services. This study indicated that upper bound and lower bound values in performance metrics provide us with the simple means to detect the performance and regression anomalies in updated versions of web services. The explainable deep learning method enabled us to decide the precise use of deep learning to detect performance and anomalies in web services. The evaluation results of the proposed approach showed us the detection of unusual behavior of web service. The proposed approach is efficient and straightforward in detecting regression anomalies in web services compared with the existing approaches.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.366-370
• /
• 2003

This paper is on weighted model reduction using structurally balanced truncation. For a given weighted(single or double-sided) transfer function, a state space realization with the linear fractional transformation form is obtained. Then we prove that two block diagonal LMI(linear matrix inequality) solutions always exist, and it is possible to get a reduced order model with guaranteed stability and a priori error bound. Finally, two examples are used to show the validity of proposed weighted reduction method, and the method is compared with other existing methods.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.161-164
• /
• 2000

Given the frame size and constituent encoders, interleaver plays a central role in a turbo code performance. Interleaver should be designed to generate a heavy weight codeword in the second encoder if the first encoder generates a low weight codeword. In this paper we present a search procedure for high performace interleaver whose performance is measured by computing union bound using the weight spectrum of all the weight 2, 3

• Communications of the Korean Mathematical Society
• /
• v.31 no.1
• /
• pp.95-100
• /
• 2016

In this paper, we establish a new refinement of the arithmetic-geometric mean inequality. Applying this result in information theory, we obtain a more precise upper bound for Shannon's entropy.

• Bulletin of the Korean Chemical Society
• /
• v.24 no.6
• /
• pp.802-804
• /
• 2003

The relative stabilities of weak binding clusters are sensitive to temperature due to the entropy effect. Thus, here we report significant changes in relative stabilities between two low-energy electron-water trimer structures and those between three low-energy electron-water pentamer structures, as the temperature increases. The trimer and pentamer show structural changes around 200 K.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.8
• /
• pp.19-26
• /
• 1993

The bit error probability of Reed-Solomon/convolutional concatenated codes can be more exactly calculated by using a more approximate bound of the symbol error probability of the convolutional codes. This paper obtains the unequal symbol error bound of the convolutional codes, and applies to the calculation of the bit error probability of the concatenated codes. Our results are tighter than the earlier studied other bounds.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.226-234
• /
• 2004

This work presents a deterministic channel that rules according to inverse a power propagation law. The proposed channel model allows us to derive the lower bound and upper bound of packet's capture probability in Rayleigh fading and shadowing cellular mobile system. According to these capture probabilities, we analyze the system performance in the case of finite stations and finite communicated coverage of a base station. We also adopted a dynamic backoff window size to discuss the robustness of IEEE 802.11 draft standard. Some suggestions and conclusions from numerical results are given to establish the more strong CSMA/CA protocol.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.