• Nuclear Engineering and Technology
• /
• v.46 no.2
• /
• pp.263-272
• /
• 2014

Scattering source calculations using conventional spherical harmonic expansion may require lots of computation time to treat full-coupled three-dimensional photon-electron transport in a highly anisotropic scattering medium where their scattering cross sections should be expanded with very high order (e.g., $P_7$ or higher) Legendre expansions. In this paper, we introduce a modified scattering kernel approach to avoid the unnecessarily repeated calculations involved with the scattering source calculation, and used it with parallel computing to effectively reduce the computation time. Its computational efficiency was tested for three-dimensional full-coupled photon-electron transport problems using our computer program which solves the multi-group discrete ordinates transport equation by using the discontinuous finite element method with unstructured tetrahedral meshes for complicated geometrical problems. The numerical tests show that we can improve speed up to 17~42 times for the elapsed time per iteration using the modified scattering kernel, not only in the single CPU calculation but also in the parallel computing with several CPUs.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.346-351
• /
• 2002

We improve a new probabilistic public key cryptosystem, in which the one wav function was defined only on the discrete logarithmic functions, proposed by Okamoto and Uchiyama. The plaintexts are calculated from the modular product of two these functions, one of which has a fixed value depending on a given public key. The improvement is achieved by a well-chosen public key assuming an unit element 1 as the fixed function value. Because it is possible to reduce the number of operations at the decryption. Also the concrete method for a public key of our improved scheme is suggested.

• Steel and Composite Structures
• /
• v.50 no.4
• /
• pp.375-382
• /
• 2024

The network theory studies interconnection between discrete objects to find about the behavior of a collection of objects. Also, nanomaterials are a collection of discrete atoms interconnected together to perform a specific task of mechanical or/and electrical type. Therefore, it is reasonable to use the network theory in the study of behavior of super-molecule in nano-scale. In the current study, we aim to examine vibrational behavior of spherical nanostructured composite with different geometrical and materials properties. In this regard, a specific shear deformation displacement theory, classical elasticity theory and analytical solution to find the natural frequency of the spherical nano-composite structure. The analytical results are validated by comparison to finite element (FE). Further, a detail comprehensive results of frequency variations are presented in terms of different parameters. It is revealed that the current methodology provides accurate results in comparison to FE results. On the other hand, different geometrical and weight fraction have influential role in determining frequency of the structure.

• Tunnel and Underground Space
• /
• v.22 no.2
• /
• pp.93-105
• /
• 2012

This paper compares the two- and three-dimensional (2D and 3D) approaches for the numerical determination of the equivalent mechanical properties of fractured rock masses. Both orthogonally-fractured model and discrete fracture networks (DFN) were used for the geometry and 2D models were cut in various directions from 3D model to compare their mechanical properties. Geological data were loosely based on the data available from Sellafield, UK. Analytical method based on compliance tensor transformation was used for investigation in orthogonally fractured rock and numerical experiments were conducted on fractured rock mass with DFN geometry. It is shown that 2D approach always overestimates the elastic modulus of fractured rock masses by a factor of up to around two because fractures are assumed to be perpendicular to the model plane in 2D problems. Poisson ratios tend to have larger values in 2D analysis while there is opposite trend in some sections. The study quantitatively demonstrates the limitation of the 2D approach that uses the simplified model from true 3D geometry.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.1-1
• /
• 2003

In this talk, a reduced-order modeling methodology based on centroidal Voronoi tessellations (CVT's)is introduced. CVT's are special Voronoi tessellations for which the generators of the Voronoi diagram are also the centers of mass (means) of the corresponding Voronoi cells. The discrete data sets, CVT's are closely related to the h-means clustering techniques. Even with the use of good mesh generators, discretization schemes, and solution algorithms, the computational simulation of complex, turbulent, or chaotic systems still remains a formidable endeavor. For example, typical finite element codes may require many thousands of degrees of freedom for the accurate simulation of fluid flows. The situation is even worse for optimization problems for which multiple solutions of the complex state system are usually required or in feedback control problems for which real-time solutions of the complex state system are needed. There hava been many studies devoted to the development, testing, and use of reduced-order models for complex systems such as unsteady fluid flows. The types of reduced-ordered models that we study are those attempt to determine accurate approximate solutions of a complex system using very few degrees of freedom. To do so, such models have to use basis functions that are in some way intimately connected to the problem being approximated. Once a very low-dimensional reduced basis has been determined, one can employ it to solve the complex system by applying, e.g., a Galerkin method. In general, reduced bases are globally supported so that the discrete systems are dense; however, if the reduced basis is of very low dimension, one does not care about the lack of sparsity in the discrete system. A discussion of reduced-ordering modeling for complex systems such as fluid flows is given to provide a context for the application of reduced-order bases. Then, detailed descriptions of CVT-based reduced-order bases and how they can be constructed of complex systems are given. Subsequently, some concrete incompressible flow examples are used to illustrate the construction and use of CVT-based reduced-order bases. The CVT-based reduced-order modeling methodology is shown to be effective for these examples and is also shown to be inexpensive to apply compared to other reduced-order methods.

• Journal of Korean Association for Spatial Structures
• /
• v.10 no.2
• /
• pp.77-86
• /
• 2010

This paper provides background theories and numerical results of automatic finite element (FE) mesh generation for freeform discrete structures. The present method adopts the computer aided geometric design (CAGD) technique to overcome the limitation of case-sensitive traditional automatic FE mesh generator. The present technique involves two steps. The first one is to represent the shape of the structure using the geometric model based on the CAGD and the second one is to generate the discrete FE mesh of spatial structures over the geometric model. From numerical results, it is found to be that the present technique is very easy to produce the FE mesh for free-form spatial structures and it can also reuse some features of traditional automatic mesh generator in the process. Furthermore, it shows the possibility to be used for the shape optimization of large spatial structures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1959-1968
• /
• 2016

The recent automobiles, a number of ECU inside the vehicle has been used. Also, each ECU is connected to different types of networks in accordance with the characteristics. Therefore, efficient data exchange between discrete network has emerged as a very important element. The gateway is responsible for the ability to exchange data between discrete network. In this study, we propose the new gateway algorithm to provide the structure of the mapping table to improve the efficiency of data exchange between discrete network. Also it provides a structure of a new gateway algorithm with a function of adjusting the priority of the data to be transmitted to another network arbitrarily. Moreover, the proposed gateway structure may simultaneously convert the transmission data input from a particular network to multiple networks. Another advantage is easy to change the entire data structure only if we change the table structure in the gateway.

• Journal of the Korea Society for Simulation
• /
• v.29 no.3
• /
• pp.73-82
• /
• 2020

In the fourth industrial revolution, wireless sensor networks (WSNs) are an important element of collecting and analyzing data in a variety of environments without human intervention. This sensor network is greatly affected by topology and routing protocols. Routing protocols, which affect energy consumption, are executed after deploying sensor nodes. Once built, they are difficult to change. Before the WSN is deployed, a routing protocol is carefully selected in view of various environments and the performance of the protocol is evaluated. In this paper, we propose a model to simulate multiple routing protocols using a discrete event system specification (DEVS). The DEVS-based proposed model simulates various situations without changes and structures of the its model as algorithms of the routing protocols are implemented in its coordinators model. To verify normal behaviors of the proposed model, the number of report delivery and the energy consumption of the sensor network were compared using representative protocols LEACH and Dijkstra. As a result, it was confirmed that the proposed model executes normally in both routing protocols.

• Structural Engineering and Mechanics
• /
• v.83 no.2
• /
• pp.207-227
• /
• 2022

In general, the interaction conditions between the discrete stones are not taken into account by structural engineers during the modeling and analyzing of historical stone bridges. However, many structural damages in the stone bridges occur due to ignoring the interaction conditions between discrete stones. In this study, it is aimed to examine the seismic behavior of a historical stone bridge by considering the interaction stiffness parameters between stone elements. For this purpose, Tokatli historical stone arch bridge was built in 1179 in Karabük-Turkey, is chosen for three-dimensional (3D) seismic analyses. Firstly, the 3D finite-difference model of the Tokatli stone bridge is created using the FLAC3D software. During the modeling processes, the Burger-Creep material model which was not used to examine the seismic behavior of historical stone bridges in the past is utilized. Furthermore, the free-field and quiet non-reflecting boundary conditions are defined to the lateral and bottom boundaries of the bridge. Thanks to these boundary conditions, earthquake waves do not reflect in the 3D model. After each stone element is modeled separately, stiffness elements are defined between the stone elements. Three situations of the stiffness elements are considered in the seismic analyses; a) for only normal direction b) for only shear direction c) for both normal and shear directions. The earthquake analyses of the bridge are performed for these three different situations of the bridge. The far-fault and near-fault conditions of 1989 Loma Prieta earthquake are taken into account during the earthquake analyses. According to the seismic analysis results, the directions of the stiffness parameters seriously changed the earthquake behavior of the Tokatli bridge. Moreover, the most critical stiffness parameter is determined for seismic analyses of historical stone arch bridges.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.607-610
• /
• 2005

A remeshing algorithm using tetrahedral elements has been developed, which is adapted to the mesh density map constructed by a posteriori error estimation. In the finite element analyses of metal forging processes, numerical error increases as deformation proceeds due to severe distortion of elements. In order to reduce the numerical error, the desired mesh sizes in each region of the workpiece are calculated by a posteriori error estimation and the density map is constructed. Piecewise density functions are then constructed with the radial basis function in order to interpolate the discrete data of the density map. The sample mesh is constructed based on the point insertion technique which is adapted to the density function and the mesh size is controlled by moving and deleting nodes to obtain optimal distribution according to the mesh density function and the quality optimization function as well. After finishing the redistribution process of nodes, a tetrahedral mesh is constructed with the redistributed nodes, which is adapted to the density map and resulting in good mesh quality. A goodness and adaptability of the constructed mesh is verified with a testing measure. The proposed remeshing technique is applied to the finite element analyses of forging processes.