• Journal of Biomedical Engineering Research
• /
• v.15 no.2
• /
• pp.129-134
• /
• 1994

In this paper, computerized BEAM was implemented for the space domain analysis of EEG. Transformation from temporal summation to two-dimensional mappings is formed by 4 nearest point interpolaton method. Methods of representation of BEAM are two. One is dot density method which classify brain electrical potential 9 levels by dot density of gray levels and the other is colour method which classify brain electrical 12 levels by red-green colours. In this BEAM, instantaneous change and average energy distribution over any arbitrary time interval of brain electrical activity could be observed and analyzed easily. In the frequency domain, the distribution of energy spectrum of a special band can easily be distinguished normality and abnormality.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.18 no.1
• /
• pp.15-22
• /
• 1985

The study on computation time, accuracy, and convergency characteristic of the implicit finite difference method is presented with the variation of the space increment and time step in a two-dimensional transient heat conduction problem with a dirichlet boundary condition. Numerical analysis were conducted by the model having the conditions of the solution domain from 0 to 3m, thermal diffusivity of 1.26 $m^2/h$, initial condition of 272 K, and boundary condition of 255.4 K. The results obtained are summarized as follows : 1) The degree of influence with respect to the accuracy of the time step and space increment in the alternating-direction implicit method and Crank-Nicholson implicit method were relatively small, but in case of the fully implicit method showed opposite tendency. 2) To prescribe near the zero for the space increment and tine step in a two dimensional transient problem were good in a accuracy aspect but unreasonable in a computational time aspect. 3) The reasonable condition of the space increment and the time step considering accuracy and computation time could be generalized with the Fourier modulus increment, F, ana dimensionless space increment, X, irrespective of the solution domain.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.45 no.8
• /
• pp.627-638
• /
• 2017

Expecting fatigue life of mounted radar in aircraft is very important when designing, because the mounted radar in aircraft is exposed to long-term external random vibration. Among the methods of predicting the fatigue life, Fatigue analysis method in frequency domain has continuously been proposed in this field. In this paper, four fatigue analysis methods in frequency domain, which are widely used, have been selected and compared with the results for Specimen fatigue test. As a result, Dirlik and Benascicutti-Tovo methods have been matched better with fatigue analysis in time domain than the method in frequency method through the comparison between the fatigue analysis method in time domain and the method in frequency domain by conducting the specimen fatigue test with strain gage. Based on the results of the specimen fatigue test, We have conducted fatigue analysis of mounted radar in aircraft with Dirlik and Benasciutti-Tovo methods in the finite element model, and confirmed that the required life was satisfying.

• Convergence Security Journal
• /
• v.22 no.4
• /
• pp.169-178
• /
• 2022

In general, organizations operating multi-domain networks find it difficult to represent and manage multiple domain net works on a single screen space. Instead, most of them are managed with multiple screens visualizing network topology by domain or partitioning one screen area into multiple domains. We propose an efficient method to visualize the topology using only minimal connection information between domain-agnostic nodes in this work. This method visualizes the topology by utilizing centrality indices representing the influence of nodes in the network. Furthermore, the method dynamically segments the entire node's display area using virtual Root nodes to auto-separate domains and weights of child nodes and placing nodes in 3D space. Thus, although it is a straightforward method, the multi-domain network topology can be visualized with only minimal connection information between nodes.

• Journal of Communications and Networks
• /
• v.9 no.1
• /
• pp.75-83
• /
• 2007

Orthogonal frequency division multiplexing (OFDM) systems with multiple transmit antennas can exploit space-time block coding on each subchannel for reliable data transmission. Spacetime coded OFDM systems, however, are very sensitive to time variant channels because the channels need to be static over multiple OFDM symbol periods. In this paper, we propose to mitigate the channel variations in the frequency domain using a linear filter in the frequency domain that exploits the sparse structure of the system matrix in the frequency domain. Our approach has reduced complexity compared with alternative approaches based on time domain block-linear filters. Simulation results demonstrate that our proposed frequency domain block-linear filter reduces computational complexity by more than a factor of ten at the cost of small performance degradation, compared with a time domain block-linear filter.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 1999.10a
• /
• pp.107-112
• /
• 1999

This paper presents a time domain method for soil-structure interaction analysis for seismic loadings. It is based on the finite element formulation incorporating analytical frequency-dependent infinite elements for the far-field soil. The dynamic stiffness matrices of the far-field region formulated in frequency domain using the present method can be easily transformed into the corresponding matrices in time domain. Hence the response can be analytical computed in time domain. Example analysis has been carried out to verify the present method for an embedded block in a multi-layered half-space. The present methods can be easily extended to the nonlinear analysis since the response analysis is carried out in time domain.

• Journal of the Korean Mathematical Society
• /
• v.51 no.6
• /
• pp.1209-1220
• /
• 2014

We prove global gradient estimates in weighted Orlicz spaces for weak solutions of nonlinear elliptic equations in divergence form over a bounded non-smooth domain as a generalization of Calder$\acute{o}$n-Zygmund theory. For each point and each small scale, the main assumptions are that nonlinearity is assumed to have a uniformly small mean oscillation and that the boundary of the domain is sufficiently flat.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.4
• /
• pp.323-332
• /
• 2022

This paper presents a numerical study on multigrid algorithms of V-cycle type for problems posed in the Hilbert space H(curl) in three dimensions. The multigrid methods are designed for discrete problems originated from the discretization using the hexahedral Nédélec edge element of the lowest-order. Our suggested methods are associated with smoothers constructed by substructuring based on domain decomposition methods of nonoverlapping type. Numerical experiments to demonstrate the robustness and the effectiveness of the suggested algorithms are also provided.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.5
• /
• pp.404-411
• /
• 2007

new domain/boundary decomposition method is suggested to perform efficient finite element analyses of contact problems. A penalty method is used for connecting an interface or contact interfaces with neighboring subdomains that satisfy continuity conditions. As a result, the derived effective stiffness matrices are always positive definite, and computational efficiency can be improved to a considerable degree. Moreover, any complex-shaped domain can be divided into independently modeled subdomains without considering the conformity of meshes along the interface. Using a computer code based on the present method, these advantageous features are confirmed through a set of numerical examples.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.9
• /
• pp.41-48
• /
• 2004

In this work, a domain-wise hash structure is developed for efficient data handling, and by using the developed domain-wise hash structure, an automatic triangular mesh generation algorithm is proposed. To generate the optimal nodal points and triangles efficiently, the advancing layer method and Delaunay triangulation method are utilized. To investigate the performance of the proposed algorithm, benchmarking tests are carried out for various models including convex, concave and complicated shapes through the developed object oriented C++ mesh generation code.