• Bulletin of the Korean Chemical Society
• /
• v.30 no.2
• /
• pp.315-318
• /
• 2009

Some particular bound state energies of an electron, under Coulomb potential field, confined in a two-dimensional circle and a three-dimensional sphere are analytically derived. The derivation shows that the electron cannot be bound in a negative energy state when the circle (or sphere) is smaller than a certain critical size. The critical size dependency on the strength of Coulomb potential and the angular momentum of the electron is also analytically derived. This system mimics quantum dots. Therefore the derivation provides new information on a minimum critical size of quantum dots with hydrogenic impurity.

• Bulletin of the Korean Chemical Society
• /
• v.25 no.6
• /
• pp.865-868
• /
• 2004

Aldehydes and ketones were converted to their corresponding acetals in the presence of silica-bound sulfuric acid in n-hexane under mild and heterogeneous conditions with excellent yields.

• Korean Journal of Pharmacognosy
• /
• v.14 no.2
• /
• pp.44-50
• /
• 1983

An attempt was made to investigate free and bound lipid contents and fatty acid compositions of ginseng and its eveven kinds related crude drugs. Contents of free and bound lipids of ginseng were 1.23% and 0.47%, and those of the related crude drugs were $0.31{\sim}13.05%$ and $0.26respectively. Fourteen even-numbered and 4 odd-numbered fatty acids were identified by GLC in those lipids from ginseng, and the major fatty acids were linoleic, palmitic, oleic and linolenic acids. The crude drugs are notably different from ginseng in kinds and compositions of fatty acids of free and bound lipids. Composition ratios of unsaturated fatty acids were higher in free lipids from ginseng than those of the crude drugs except 'Won-ji' Polygalae Radix.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.28A no.12
• /
• pp.73-87
• /
• 1991

This paper presents a new approach to the scheduling problem in the high level synthesis. In this approach, iterative rescheduling processes starting with ASAP(As Soon As Possible) scheduling result are performed in a branch-and-bound manner so to arrive at the scheduling result of the lowest hardware cost under the given timing constraint. At each iteration step, only the selected nodes are considered for rescheduling, and the lower bound cost estimation is performed to avoid the unnecessary attempts to search for an optimal result. This branch-and-bound method turns out to be effective in pruning the search space, and thus reducing run time considerably in many cases.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.598-603
• /
• 2001

For metal forming analysis, upper-bound solution is practical method because the solution is overestimated. It is limited to determine stresses on tools by using upper-bound solution. In this study, new scheme to calculate stresses on tools based on upper bound solution is proposed. To verify the proposed scheme, plane strain drawing has been considered. The stresses on tools obtained by the proposed scheme are compared with results of rigid plastic FEM. And the stresses on tools have been determined by the proposed scheme in the forging within plane strain deformation.

• Transactions of Materials Processing
• /
• v.12 no.1
• /
• pp.11-17
• /
• 2003

For metal forming analysis, upper-bound solution is a practical method because the solution is overestimated. However it is not easy to determine the stresses on dies by using upper-bound solution. In this study, new scheme to calculate the stresses on dies based on upper bound solution is proposed. In the velocity fields, imaginary velocity is adapted to analyze the normal pressure on die surfaces. To verify the proposed scheme. plane strain drawing has been considered. The stresses on dies obtained by the proposed scheme are compared with the results of rigid plastic FEM and the experimental results. In the experiments, pressure film is used to measure the normal pressure on dies.

• Language and Information
• /
• v.15 no.1
• /
• pp.63-78
• /
• 2011

This study investigates the binding behavior of the Korean anaphor 'caki', which has been regarded thus far as a long-distance anaphor (LDA). Given that even local anaphors can be bound long-distance when they function as exempt anaphors in certain languages (Pollard and Sag 1992; Kim and Yoon 2009a, b), I investigated the binding behavior of LD-bound 'caki', in order to determine whether LD-bound 'caki' differs from LD-bound 'caki-casin' in the same contexts. In the experiment, subjects were required to rate the grammaticality of Korean sentences representing various types of LD binding of 'caki' and to determine whether the sloppy or the strict reading was more prominent in elliptical VPs containing the anaphor. The results are discussed with respect to the typology of LDAs proposed by Cole, Hermon and Huang (2001).

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.107-110
• /
• 2004

We present a unifying framework to establish a lower-bound on the number of semidefinite programming based, lift-and-project iterations (rank) for computing the convex hull of the feasible solutions of various combinatorial optimization problems. This framework is based on the maps which are commutative with the lift-and-project operators. Some special commutative maps were originally observed by $Lov{\acute{a}}sz$ and Schrijver, and have been used usually implicitly in the previous lowerbound analyses. In this paper, we formalize the lift-and-project commutative maps and propose a general framework for lower-bound analysis, in which we can recapture many of the previous lower-bound results on the lift-and-project ranks.

• Journal of Power System Engineering
• /
• v.4 no.3
• /
• pp.72-80
• /
• 2000

In order to design a stable robust controller, nominal model, and the upper bound about the uncertainty which is the error of the model are needed. The problem to estimate the nominal model of controlled system and the upper bound of uncertainty at the same time is called robust identification. When the nominal model of controlled system and the upper bound of uncertainty in relation to robust identification are given, the evaluation of the validity of the model and the upper bound makes it possible to distinguish whether there is a model which explains observation data including disturbance among the model set. This paper suggests a method to identity the uncertainty which removes disturbance and expounds observation data by giving a probable postulation and plural data set to disturbance. It also examines the suggested method through a numerical computation simulation and validates its effectiveness.

• Journal of Mechanical Science and Technology
• /
• v.18 no.11
• /
• pp.1916-1922
• /
• 2004

A robust position control with the bound function of neural network structure is proposed for uncertain robot manipulators. The uncertain factors come from imperfect knowledge of system parameters, payload change, friction, external disturbance, and etc. Therefore, uncertainties are often nonlinear and time-varying. The neural network structure presents the bound function and does not need the concave property of the bound function. The robust approach is to solve this problem as uncertainties are included in a model and the controller can achieve the desired properties in spite of the imperfect modeling. Simulation is performed to validate this law for four-axis SCARA type robot manipulator.