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

Energy transfer dynamics of excited vibrational energy of OH stretching bonds in liquid water is theoretically studied. With time-dependent vibrational Hamiltonian obtained from a mixed quantum/classical calculation, we construct a master equation describing the energy transfer dynamics. Survival probability predicted by the master equation is compared with numerically exact one and we found that incoherent picture of energy transfer is reasonably valid for long-time population dynamics. Within the incoherent picture, we assess the validity of independent pair approximation (IPA) often introduced in the theoretical models utilized in the analysis of experimental data. Our results support that the IPA is almost perfectly valid as applied for the vibrational energy transfer in liquid water. However, proper incorporation of radial and orientational correlations between two OH bonds is found to be critical for a theory to be quantitatively valid. Consequently, it is suggested that the Forster model should be generalized by including the effects of the pair correlations in order to be applied for vibrational energy transfer in liquid water.

• Management Science and Financial Engineering
• /
• v.12 no.1
• /
• pp.127-142
• /
• 2006

In this paper, we present a frequency reassignment problem (FRP) that arises when we add new base stations to resolve hot-spots or to expand the coverage of a code division multiple access (CDMA) network. For this problem, we develop an integer programming (IP) model along with some valid inequalities and preprocessing rules. Also, we develop an effective heuristic procedure that solves two sub-problems induced from the original problem in repetition. Computational results show that the proposed heuristic procedure finds a feasible solution of good quality within reasonable computation time. Also, the lower bound by-produced from the heuristic procedure is quite strong.

• Animal Systematics, Evolution and Diversity
• /
• v.26 no.2
• /
• pp.141-151
• /
• 2010

Psen ussuriensis Lith is reported for the first time in Korea. Diagnostic description and digital images of this species are provided. For future researchers, a key to higher taxa and a checklist of 36 valid Korean Pemphredononae species are also given.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.6
• /
• pp.1418-1430
• /
• 1998

Temporal databases support an efficient historical management by means of valid time and transaction time. Valid time stands for the time when a data happens in the real world. And transaction time stands for the time when a data is stored in the database, Temporal Query Processing System(TQPS) should be extended so as tc process the temporal operations for the historical informations in the user query as well as the conventional relational operations. In this paper, the extended temporal query processing systems which is based on the previous temporal query processing system for TQuel(Temporal Query Language) consists of the temporal syntax analyzer, temporal semantic analyzer, temporal code generator, and temporal interpreter is to be described, The algorithm for additional functions such as transaction time management, temporal aggregates, temporal views, temporal joins and the heuristic optimization functions and their example how to be processed is shown.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.2
• /
• pp.43-49
• /
• 1992

Edge coloring problem is to find a minimum cardinality coloring of the edges of a graph so that any pair of edges incident to a common node do not have the same colors. Edge coloring problem is NP-hard, hence it is unlikely that there exists a polynomial time algorithm. We formulate the problem as a covering of the edges by matchings and find valid inequalities for the convex hull of feasible solutions. We show that adding the valid inequalities to the linear programming relaxation is enough to determine the minimum coloring number(chromatic index). We also propose a method to use the valid inequalities as cutting planes and do the branch and bound search implicitly. An example is given to show how the method works.

• Journal of KIISE:Software and Applications
• /
• v.26 no.10
• /
• pp.1167-1167
• /
• 1999

Although spatial databases support an efficient spatial management on objects in the real world, they have a characteristic that process only spatial information valid at current time, So in case of change in the spatial domain, it is very hard to support an efficient historical management for time-varying spatial information because they delete an old value and then replace with new value that is valid at current time. To solve these problems, there are rapidly increasing of interest for spatiotemporal databases, which serve historical functions for spatial information as well as spatial management functions for an object. However most of them presented in an abstract time-varying spatial phenomenon, but have not presented a concrete policy in spatiotemporal databases. In this paper, we propose a spatiotemporal data model that supports bitemporal time concepts in three dimensional architecture. In the proposed model, not only data types and their operation for object of spatiotemporal databases have been classified, but also mathematical expressions using formal semantics for them have been given. Then, the data structures and their operations based on relational database model as well as object-oriented database model are presented.

• Journal of Information Processing Systems
• /
• v.16 no.3
• /
• pp.588-598
• /
• 2020

An alternative state estimation filtering algorithm is designed for continuous time systems with noises as well as control input. Two kinds of estimation filters, which have different measurement memory structures, are operated selectively in order to use both filters effectively as needed. Firstly, the estimation filter with infinite memory structure is operated for a certain continuous time system. Secondly, the estimation filter with finite memory structure is operated for temporarily uncertain continuous time system. That is, depending on the presence of uncertainty, one of infinite memory structure and finite memory structure filtered estimates is operated selectively to obtain the valid estimate. A couple of test variables and declaration rule are developed to detect uncertainty presence or uncertainty absence, to operate the suitable one from two kinds of filtered estimates, and to obtain ultimately the valid filtered estimate. Through computer simulations for a continuous time aircraft engine system with different measurement memory lengths and temporary model uncertainties, the proposed state estimation filtering algorithm can work well in temporarily uncertain as well as certain continuous time systems. Moreover, the proposed state estimation filtering algorithm shows remarkable superiority to the infinite memory structure filtering when temporary uncertainties occur in succession.

• Journal of Navigation and Port Research
• /
• v.32 no.2
• /
• pp.141-148
• /
• 2008

This paper is structured into three main parts and a conclusion. The main section provide definitions of efficiency, effectiveness and performance in terms of the distribution channel, followed by a review of related performance measurement, before discussing difficulties of measurement. According to the theoretical approach, it appears that key theroretical issues are centered around customer service, logistics excellence, time compression, the use of IT, and a move towards integrated logistics. The empirical approach shows that in the past, various financial performance indicators were regarded as relevant management information. However, today, management needs additional performance indicators. Therefore, external assessments of effectiveness must be performed to measure customers' satisfaction with the physical flow of product through the distribution channel network. So, what is needed is to take previous normative and explorative research and progress through a framework by developing valid measures of distribution channel's effectiveness and efficiency, and identifying research methodologies suited to the data collection requirements.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.365-378
• /
• 2023

ARIA is a block cipher proposed by Kwon et al. at ICISC 2003 that is widely used as the national standard block cipher in the Republic of Korea. Herein, we identify some flaws in the quantum rebound attack on seven-round ARIA-DM proposed by Dou et al. and reveal that the limit of this attack is up to five rounds. Our revised attack applies to not only ARIA-DM but also ARIA-MMO and ARIA-MP among the PGV models, and it is valid for all ARIA key lengths. Furthermore, we present dedicated quantum rebound attacks on seven-round ARIA-Hirose and ARIA-MJH for the first time. These attacks are only valid for the 256-bit key length of ARIA because they are constructed using the degrees of freedom in the key schedule. All our attacks are faster than the generic quantum attack in the cost metric of the time-space tradeoff.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.3
• /
• pp.289-294
• /
• 2002

A valid speech-sound block can be classified to provide important information for speech recognition. The classification of the speech-sound block comes from the MRA(multi-resolution analysis) property of the DWT(discrete wavelet transform), which is used to reduce the computational time for the pre-processing of speech recognition. The merging algorithm is proposed to extract valid speech-sounds in terms of position and frequency range. It needs some numerical methods for an adaptive DWT implementation and performs unvoiced/voiced classification and denoising. Since the merging algorithm can decide the processing parameters relating to voices only and is independent of system noises, it is useful for extracting valid speech-sounds. The merging algorithm has an adaptive feature for arbitrary system noises and an excellent denoising SNR(signal-to-nolle ratio).