• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.207-214
• /
• 2000

For last 20 years, a number of researches and developments on finite element mesh generation has been carried out and most of them are comported of node generation part and node generation part. However these algorithms are inefficient in mesh veneration process and difficult to control the shape of elements when comparing with the generation of nodes and elements concurrently. In this study, therefore, an algorithm it proposed to generate nodes and elements concurrently for various two-dimensional objects having multiple holes. Inner node generation is performed by choosing three consecutive boundary nodes and comparing them with other close boundary nodes. As soon as inner nodes are determined, element generation is conducted based on the comparison of the distances among the generated inner nodes, three consecutive boundary nodes and other close boundary nodes. the generated element nodes become new boundary nodes for further repeated process. The processes are repeated through out each region until three consecutive boundary nodes finally form a tirangular element.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2764-2782
• /
• 2021

Existing city-level boundary nodes identification methods need to locate all IP addresses on the path to differentiate which IP is the boundary node. However, these methods are susceptible to time-delay, the accuracy of location information and other factors, and the resource consumption of locating all IPes is tremendous. To improve the recognition rate and reduce the locating cost, this paper proposes an algorithm for city-level boundary node identification based on bidirectional approaching. Different from the existing methods based on time-delay information and location results, the proposed algorithm uses topological analysis to construct a set of candidate boundary nodes and then identifies the boundary nodes. The proposed algorithm can identify the boundary of the target city network without high-precision location information and dramatically reduces resource consumption compared with the traditional algorithm. Meanwhile, it can label some errors in the existing IP address database. Based on 45,182,326 measurement results from Zhengzhou, Chengdu and Hangzhou in China and New York, Los Angeles and Dallas in the United States, the experimental results show that: The algorithm can accurately identify the city boundary nodes using only 20.33% location resources, and more than 80.29% of the boundary nodes can be mined with a precision of more than 70.73%.

• Journal of computational fluids engineering
• /
• v.12 no.1
• /
• pp.1-8
• /
• 2007

A code is developed using the hybrid Cartesian/immersed boundary method and it is applied to simulate flows around a three-dimensional deforming body. A new criterion is suggested to distribute the immersed boundary nodes based on edges crossing a body boundary. Velocities are reconstructed at the immersed boundary nodes using the interpolation along a local normal line to the boundary. Reconstruction of the pressure at the immersed boundary node is avoided using the hybrid staggered/non-staggered grid method. The developed code is validated through comparisons with other experimental and numerical results for the velocity profiles around a circular cylinder under the forced in-line oscillation and the pressure coefficient distribution on a sphere. The code is applied to simulate the flow fields around a plate whose tail is periodically flapping under a translation. The effects of the velocity and acceleration due to the deformation on the periodic shedding of pairs of tip vortices are investigated.

• Journal of the Society of Naval Architects of Korea
• /
• v.43 no.5 s.149
• /
• pp.538-549
• /
• 2006

A code is developed to simulate a viscous flow field around a deformable body using the hybrid Cartesian/immersed boundary method. In this method, the immersed boundary(IB) nodes are defined near the body boundary then velocities at the IB nodes are reconstructed based on the interpolation along the normal direction to the body surface. A new method is suggested to define the IB nodes so that a closed fluid domain is guaranteed by a set of IB nodes and the method is applicable to a zero-thickness body such as a sail. To validate the developed code, the vorticity fields are compared with other recent calculations where a cylinder orbits and moves into its own wake. It is shown the code can handle a sharp trailing edge at Reynolds number of $10^5$ under moderate requirements on girds. Finally the developed code is applied to simulate the vortex shedding behind a deforming foil with flapping tail like a fish. It is shown that the acceleration of fluids near the flapping tail contributes to the generation of the thrust for propulsion.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2004.03a
• /
• pp.15-25
• /
• 2004

This paper outlines a new convergence acceleration de-signed to solve scramjet flowfields with zones of re-circulation. Named the “marching-window”, the algorithm consists of performing pseudo-time iterations on a minimal width subdomain composed of a sequence of cross-stream planes of nodes. The upstream boundary of the subdomain is positioned such that all nodes upstream exhibit a residual smaller than the user-specified convergence threshold. The advancement of the downstream boundary follows the advancement of the upstream boundary, except in zones of significant streamwise ellipticity where a streamwise ellipticity sensor ensures its continuous progress. Compared to the standard pseudo-time marching approach, the march-ing-window is here seen to decrease the work required for convergence by up to 24 times for supersonic flows with little streamwise ellipticity and by up to 8 times for supersonic flows with large streamwise separated regions. The memory requirements are observed to be reduced sixfold by not allocating memory to the nodes not included in the computational subdomain. The marching-window satisfies the same convergence criterion as the standard pseudo-time stepping methods, hence resulting in the same converged solution within the tolerance of the user-specified convergence threshold. The extension of the marching-window to the weakly-ionized Navier-Stokes equations is also discussed.

• Proceedings of the KSME Conference
• /
• 2007.05b
• /
• pp.2797-2802
• /
• 2007

It has been confirmed that implementation of the no-slip boundary conditions for the lattice-Boltzmann method play an important role in the overall accuracy of the numerical solutions as well as the stability of the solution procedure. We in this paper propose a new algorithm, i.e. the method of the dynamic boundary condition for no-slip boundary condition. The distribution functions on the wall along each of the links across the physical boundary are assumed to be composed of equilibrium and nonequilibrium parts which inherit the idea of Guo's extrapolation method. In the proposed algorithm, we apply a dynamic equation to reflect the computational slip velocity error occurred on the actual wall boundary to the correction; the calculated slip velocity error dynamically corrects the fictitious velocity on the wall nodes which are subsequently employed to the computation of equilibrium distribution functions on the wall nodes. Along with the dynamic selfcorrecting process, the calculation efficiently approaches the steady state. Numerical results show that the dynamic boundary method is featured with high accuracy and simplicity.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.11
• /
• pp.2705-2712
• /
• 2000

In meshless methods some techniques to impose essential boundary conditions have been developed since the approximations do not satisfy Kronecker delta properties at nodal points. In this study, new scheme for imposing essential boundary conditions is developed. Weight functions are modified by multiplying with auxiliary weight functions and the resulting shape functions satisfy Kronecker delta property on the bound ary nodes. In addition, the resulting shape functions possess and interpolation features on the boundary segments where essential boundary conditions are prescribed. Therefore the essential boundary conditions can be exactly satisfied with the new method. More importantly, the impositions of essential boundary conditions using the present method is relatively easy as in finite element method. Numerical examples show that the method also retains high convergence rate comparable to Lagrange multiplier method.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.18 no.6
• /
• pp.674-680
• /
• 2008

A new meshless method for obtaining natural frequencies of arbitrarily shaped plates with the free boundary condition is introduced in the paper. In order to improve the characteristics of convergence and accuracy of the method, a special local polar coordinates system is devised and located for each of nodes distributed along the boundary of the plate of interest. In addition, a new way of decreasing the size of the system matrix that gives natural frequencies of the plate is employed to reduce the amount of numerical calculations, which is needed for computing the determinant of the system matrix. Finally the excellence of the characteristics of convergence and accuracy of the method is shown in several case studies, which indicate that natural frequencies by the proposed method are very accurate and converged swiftly to exact values as the number of boundary nodes increases.

• Computers and Concrete
• /
• v.11 no.5
• /
• pp.441-462
• /
• 2013

When using the conventional finite element method, a great number of grid nodes are necessary to describe the large and uneven temperature gradients in the concrete around cooling pipes when calculating the temperature field of mass concrete with cooling pipes. In this paper, the temperature gradient properties of the concrete around a pipe were studied. A new calculation method was developed based on these properties and an explicit iterative algorithm. With a small number of grid nodes, both the temperature distribution along the cooling pipe and the temperature field of the concrete around the water pipe can be correctly calculated with this new method. In conventional computing models, the cooling pipes are regarded as the third boundary condition when solving a model of concrete with plastic pipes, which is an approximate way. At the same time, the corresponding parameters have to be got by expensive experiments and inversion. But in the proposed method, the boundary condition is described strictly, and thus is more reliable and economical. And numerical examples were used to illustrate that this method is accurate, efficient and applicable to the actual engineering.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2804-2823
• /
• 2013

Wireless sensor network (WSN) is a promising technology for monitoring physical phenomena at fine-grained spatial and temporal resolution. However, the typical approach of sending each sensed measurement out of the network for detailed spatial analysis of transient physical phenomena may not be an efficient or scalable solution. This paper focuses on in-network physical phenomena detection schemes, particularly the distributed computation of the boundary of physical phenomena (i.e. event), to support energy efficient spatial analysis in wireless sensor networks. In-network processing approach reduces the amount of network traffic and thus achieves network scalability and lifetime longevity. This study investigates the recent advances in distributed event detection based on in-network processing and includes a concise comparison of various existing schemes. These boundary detection schemes identify not only those sensor nodes that lie on the boundary of the physical phenomena but also the interior nodes. This constitutes an event geometry which is a basic building block of many spatial queries. In this paper, we introduce the challenges and opportunities for research in the field of in-network distributed event geometry boundary detection as well as illustrate the current status of research in this field. We also present new areas where the event geometry boundary detection can be of significant importance.