• 한국전산유체공학회지
• /
• 제15권2호
• /
• pp.21-27
• /
• 2010

Immersed boundary lattice Boltzmann method (IBLBM) has been applied to simulate a turbulent flow over circular cylinder in a flow field effectively. Although IBLBM is very effective method to simulate the flow over a complex shape of obstacle in the flow field regardless of the constructed grids in the calculation domain, the results, however, become numerically unstable in high reynolds number flow. The most effective suggestion to archive the numerical stability in high Reynolds number flow is applying the multiple relaxation time (MRT) model instead of single relaxation time(SRT) model in the collision term of lattice Boltzmann equation. In the research MRT model for IBLBM was introduced and comparing the numerical results obtained by applying SRT and MRT. The hydraulic characteristic of cylinder in a flow field between two parallel plate at the range of $Re{\leqq}2000$represented and it is also compared the drag and lifting coefficients of the cylinder calculated by IBLBM with SRT and MRT model.

• 한국통신학회논문지
• /
• 제33권12C호
• /
• pp.1082-1087
• /
• 2008

MIMO 시스템에서 ML 검출 기법은 많은 다른 검출기들보다 우수한 성능을 보인다. 그러나 ML 검출기법은 NP-hard 문제로 인해 실제 시스템에서 사용하기 어려운 단점을 가지고 있다. 이것은 polynomial-time 안에 최적의 해 (optimal solution)를 찾을 수 없음을 의미한다. 본 논문에서는 ML problem을 적용한 SDR (Semi-Definite Relaxation)에 궤환기법을 통한 검출 알고리즘을 제안한다. 이는 SDR에 의해 구한 최적의 해를 spectral decomposition을 이용해 우세한 eigenvector를 찾아 송신 신호의 확률 분포를 구하고, 이를 수신 신호에 궤환 시킨다. 이는 또 다른 ML problem으로써 다시 SDR를 통해 최적의 해를 구하고 우세한 eigenvector에 해당하는 송신 신호 확률을 구한다. 이 확률은 ML problem에 해당하는 최적의 값으로 추정 송신 신호를 검출할 수 있다. 이러한 기법을 통해 최적 성능을 갖는 ML 검출 기법의 성능에 보다 더 가깝게 접근하였다.

• Bulletin of the Korean Chemical Society
• /
• 제14권1호
• /
• pp.21-29
• /
• 1993

For the study of relaxation processes in complex spin system, a general master equation, which can be used to simulate a vast range of pulse experiments, has been formulated using the Liouville representation of quantum mechanics. The state of a nonequilibrium spin system in magnetic field is described by a density vector in Liouville space and the time evolution of the system is followed by the application of a linear master operator to the density vector in this Liouville space. In this master equation the nuclear spin relaxation due to intramolecular dipolar interaction or randomly fluctuating field interaction is explicitly implemented as a relaxation supermatrix for a strong coupled two-spin (1/2) system. The whole dynamic information inherent in the spin system is thus contained in the density vector and the master operator. The radiofrequency pulses are applied in the same space by corresponding unitary rotational supertransformations of the density vector. If the resulting FID is analytically Fourier transformed, it is possible to represent the final nonstationary spectrum using a frequency dependent spectral vector and intensity determining shape vector. The overall algorithm including relaxation interactions is then translated into an ANSIFORTRAN computer program, which can simulate a variety of two dimensional spectra. Furthermore a new strategy is tested by simulation of multiple quantum signals to differentiate the two relaxation interaction types.

• 한국가시화정보학회지
• /
• 제18권3호
• /
• pp.42-51
• /
• 2020

This study performs a numerical simulation of lid driven rectangular cavity flow with different aspect ratios of k = 0.5 to 4 under Reynolds 100, 1,000, 10,000 by using multi-relaxation time (MRT) Lattice Boltzmann Method (LBM). In order to achieve better convergence, well-posed boundary conditions in the domain should be defined such as no-slip condition on side and bottom solid wall surfaces and uniform horizontal velocity on the top of the cavity. This study focuses on the flow inside different shape of rectangular cavity with the aim to observe the effect of the Reynolds number and aspect ratio on the flow characteristics and primary/secondary vortex formation. In order to validate the study, the results have been compared with existing works. The result shows that the Reynolds number and the aspect ratio both has substantial effects on the flow inside the lid-driven rectangular cavity.

• Journal of Ginseng Research
• /
• 제22권2호
• /
• pp.96-101
• /
• 1998

This paper describes the determination of bulk density and the discrimination of internal structure of red ginseng by nuclear magnetic resonance (NMR). The 102 red ginseng roots were tested for bulk density. The NMR properties measured by NMR parameters such as spin-lattice relaxation time ($T_1$) and spin-spin relaxation time ($T_2$) were determined using the low field proton NMR analyzer. Bulk density of red ginseng root showed a highly negative significant correlation (r=-0.8934) with the value of $T_1$, but a highly positive significant correlation (r=0.7672 and 0.5909) with the value of T21 (short T2) and T22 (long T2), respectively. Multiple regression equation, Y=-0.0069.$T_1$+0.3044.$T_{21}$-0.0156.$T_{22}$-0.6368, using the MNR parameter values of 80 red ginseng roots can effectively predict the bulk density of 22 red ginseng roots with the correlation coefficient of 0.9396 and the standard error of 0.086. The differences in the internal structure of normal and inside white part of red ginseng were easily found by the signal intensity of NMR image based on magnetic properties of proton nucleus.

• Journal of Mechanical Science and Technology
• /
• 제15권9호
• /
• pp.1281-1291
• /
• 2001

The hereditary integral form of a quasi-linear viscoelastic law has been employed. Four new concepts have been employed: 1. a reduced relaxation function with a non-linear exponential function of time, 2. an inverse method to determine the scale factor of the elastic response, 3. an instant elastic recovery strain during unloading, and 4. the results of a constitutive model for cyclic tests may be a function of the Heavyside class. These concepts have been supported by agreement between measured and predicted responses of soft connective tissue to three types of multiple cyclic tests which include rest periods of no extension and alternations between different strain levels. Such agreement has not been attained in the previous studies. Chun and Hubbard (2001) is our companion experimental analysis paper.

• Journal of Communications and Networks
• /
• 제13권6호
• /
• pp.633-638
• /
• 2011

In this paper, we consider resource allocation with proportional fairness in the downlink orthogonal frequency division multiple access relay networks, in which relay nodes operate in decode-and-forward mode. A joint optimization problem is formulated for relay selection, subcarrier assignment and power allocation. Since the formulated primal problem is nondeterministic polynomial time-complete, we make continuous relaxation and solve the dual problem by Lagrangian dual decomposition method. A near-optimal solution is obtained using Karush-Kuhn-Tucker conditions. Simulation results show that the proposed algorithm provides superior system throughput and much better fairness among users comparing with a heuristic algorithm.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 가을 학술발표논문집 Vol.31 No.2 (1)
• /
• pp.697-699
• /
• 2004

Despite many successful spectral clustering algorithm (based on the spectral decomposition of Laplacian(1) or stochastic matrix(2) ) there are several unsolved problems. Most spectral clustering Problems are based on the normalized of algorithm(3) . are close to the classical graph paritioning problem which is NP-hard problem. To get good solution in polynomial time. it needs to establish its convex form by using relaxation. In this paper, we apply a novel optimization technique. semidefinite programming(SDP). to the unsupervised clustering Problem. and present a new multiple Partitioning method. Experimental results confirm that the Proposed method improves the clustering performance. especially in the Problem of being mixed with non-compact clusters compared to the previous multiple spectral clustering methods.

• 대한교통학회:학술대회논문집
• /
• 대한교통학회 2000년도 제37회 학술발표회논문집
• /
• pp.25-47
• /
• 2000

In route guidance systems fastest-path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this study is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e. Pareto optimal) paths for real-time vehicle routing which reflect the drivers' preferences and route choice behaviors. We propose two pruning algorithms that reduce the search area based on a context-dependent linear utility function and thus reduce the computation time. The basic notion of the proposed approach is that ⅰ) enumerating all nondominated paths is computationally too expensive, ⅱ) obtaining a stable mathematical representation of the drivers' utility function is theoretically difficult and impractical, and ⅲ) obtaining optimal path given a nonlinear utility function is a NP-hard problem. Consequently, a heuristic two-stage strategy which identifies multiple routes and then select the near-optimal path may be effective and practical. As the first stage, we utilize the relaxation based pruning technique based on an entropy model to recognize and discard most of the nondominated paths that do not reflect the drivers' preference and/or the context-dependency of the preference. In addition, to make sure that paths identified are dissimilar in terms of links used, the number of shared links between routes is limited. We test the proposed algorithms in a large real-life traffic network and show that the algorithms reduce CPU time significantly compared with conventional multi-criteria shortest path algorithms while the attributes of the routes identified reflect drivers' preferences and generic route choice behaviors well.

• 한국경영과학회지
• /
• 제31권1호
• /
• pp.117-129
• /
• 2006

In this paper, we consider broadband satellite networks using MF-TDMA (Multi-Frequency Time Division Multiple Access) scheme. We analyze the number of expected lost packets in each terminal, and mathematically formulate optimal buffer and timeslot allocation model to minimize the weighted sum of the numbers of expected lost packets. We also suggest optimal buffer and timeslot allocation scheme based on Lagrangean relaxation technique to solve the proposed model in a fast time. Extensive experiments show that the proposed scheme provides encouraging results.