• The Magazine of the Society of Air-Conditioning and Refrigerating Engineers of Korea
• /
• v.15 no.1
• /
• pp.87-96
• /
• 1986

An experiment on the devices that enchance the stratification of storage tanks in a solar heat ins system has been carried out. The benefits of thermal stratification in sensible heat storage are to increase the system performance such as the collector efficiency or the fraction of the total load supplied by solar energy. Using the diffuser and the distributor as the stratification enchancement device, the expeliments were perfomed in the different condition of diameter and material of the distributor. As a result of experiments, there exists the diameter of distributor in which the stratification is made maximum under certain design and operation condition. Also it was identified that the kind of distributor material influenced the degree of stratification. Comparing the experimental result to the computational results calculated under the same conditions, the node number N(stratification index) was determined. The results of computer simulation that was performed about the actual solar heating system in Seoul for 24 hours show the relative advantage of stratified over well-mixed storage and the significant improvements in system performance.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.5
• /
• pp.385-392
• /
• 2013

The finite element method has become the most widely used method of structural analysis and recently, the method has often been applied to complex dynamic and nonlinear structural analyses problems. Even for these complex problems, where the responses are hard to predict, finite element analyses yield reliable results if appropriate element types and meshes are used. However, the dynamic and nonlinear behaviors of a structure often include large deformations in various portions of the structure and if the same mesh is used throughout the analysis, some elements may deform to shapes beyond the reliable limits; thus dynamically adapting finite element meshes are needed in order for the finite element analyses to be accurate. In addition, to satisfy the users requirement of quick real run time of finite element programs, the algorithms must be computationally efficient. This paper presents an adaptive finite element mesh generation scheme for dynamic analyses of structures that may adapt at each time step. Representative strain values are used for error estimates and combinations of the h-method(node movement) and the r-method(element division) are used for mesh refinements. A coefficient that depends on the shape of an element is used to limit overly distorted elements. A simple frame example shows the accuracy and computational efficiency of the scheme. The aim of the study is to outline the adaptive scheme and to demonstrate the potential use in general finite element analyses of dynamic and nonlinear structural problems commonly encountered.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.37 no.1
• /
• pp.49-56
• /
• 2024

An automated dynamic structural analysis module stands as a crucial element within a structural integrated mitigation system. This module must deliver prompt real-time responses to enable timely actions, such as evacuation or warnings, in response to the severity posed by the structural system. The finite element method, a widely adopted approximate structural analysis approach globally, owes its popularity in part to its user-friendly nature. However, the computational efficiency and accuracy of results depend on the user-provided finite element mesh, with the number of elements and their quality playing pivotal roles. This paper introduces a computationally efficient adaptive mesh generation scheme that optimally combines the h-method of node movement and the r-method of element division for mesh refinement. Adaptive mesh generation schemes automatically create finite element meshes, and in this case, representative strain values for a given mesh are employed for error estimates. When applied to dynamic problems analyzed in the time domain, meshes need to be modified at each time step, considering a few hundred or thousand steps. The algorithm's specifics are demonstrated through a standard cantilever beam example subjected to a concentrated load at the free end. Additionally, a portal frame example showcases the generation of various robust meshes. These examples illustrate the adaptive algorithm's capability to produce robust meshes, ensuring reasonable accuracy and efficient computing time. Moreover, the study highlights the potential for the scheme's effective application in complex structural dynamic problems, such as those subjected to seismic or erratic wind loads. It also emphasizes its suitability for general nonlinear analysis problems, establishing the versatility and reliability of the proposed adaptive mesh generation scheme.

• Journal of Korea Water Resources Association
• /
• v.40 no.4
• /
• pp.325-334
• /
• 2007

In this study, a long-term unsteady simulation model has been developed using rigid water column theory which is more accurate than Extended-period model and more efficient comparing with water-hammer simulation model. The developed model is applied to 24-hours unsteady simulation considering daily water-demand and water-hammer analysis caused by closing a valve. For the case of 24-hours daily simulation, the pressure of each node decreases as the water demand increase, and when the water demand decrease, the pressure increases. During the simulation, the amplitudes of flow and pressure variation are different in each node and the pattern of flow variation as well as water demand is quite different than that of KYPIPE2. Such discrepancy necessitates the development of unsteady flow analysis model in water distribution network system. When the model is applied to water-hammer analysis, the pressure and flow variation occurred simultaneously through the entire network system by neglecting the compressibility of water. Although water-hammer model shows the lag of travel time due to fluid elasticity, in the aspect of pressure and flow fluctuation, the trend of overall variation and quantity of the result are similar to that of water-hammer model. This model is expected for the analysis of gradual long-term unsteady flow variations providing computational accuracy and efficiency as well as identifying pollutant dispersion, pressure control, leakage reduction corresponding to flow-demand pattern, and management of long-term pipeline net work systems related with flowrate and pressure variation in pipeline network systems

• Journal of Broadcast Engineering
• /
• v.14 no.3
• /
• pp.322-331
• /
• 2009

This paper proposes an efficient data representation of stereo images using edge-based mesh optimization. Mash-based two dimensional warping for stereo images mainly depends on the performance of a node selection and a disparity estimation of selected nodes. Therefore, the proposed method first of all constructs the feature map which consists of both strong edges and boundary lines of objects for node selection and then generates a grid-based mesh structure using initial nodes. The displacement of each nodal position is iteratively estimated by minimizing the predicted errors between target image and predicted image after two dimensional warping for local area. Generally, iterative two dimensional warping for optimized nodal position required a high time complexity. To overcome this problem, we assume that input stereo images are only horizontal disparity and that optimal nodal position is located on the edge include object boundary lines. Therefore, proposed iterative warping method performs searching process to find optimal nodal position only on edge lines along the horizontal lines. In the experiments, we compare our proposed method with the other mesh-based methods with respect to the quality by using Peak Signal to Noise Ratio (PSNR) according to the number of nodes. Furthermore, computational complexity for an optimal mesh generation is also estimated. Therefore, we have the results that our proposed method provides an efficient stereo image representation not only fast optimal mesh generation but also decreasing of quality deterioration in spite of a small number of nodes through our experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2105-2112
• /
• 2009

Recently RFID system has been adopted in various fields rapidly. However, we ought to solve the problem of privacy invasion that can be occurred by obtaining information of RFID Tag without any permission for popularization of RFID system To solve the problems, it is Ohkubo et al.'s Hash-Chain Scheme which is the safest method. However, this method has a problem that requesting lots of computing process because of increasing numbers of Tag. Therefore, We suggest the way (process) satisfied with all necessary security of Privacy Protection Shreme and decreased in Tag Identification Time in this paper. First, We'll suggest the SP-Division Algorithm seperating SPs using the Performance Measurement consequence of each node after framing the program to create Hash-Chain Calculated table to get optimized performance because of character of the grid environment comprised of heterogeneous system. If we compare consequence fixed the number of nodes to 4 with a single node, equal partition, and SP partition, when the total number of SPs is 1000, 40%, 49%, when the total number of SPs is 2000, 42%, 51%, when the total number of SPs is 3000, 39%, 49%, and when the total number of SPs is 4000, 46%, 56% is improved.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.474-483
• /
• 2003

The secret sharing is the basic concept of the threshold cryptosystem and has an important position in the modern cryptography. At 1995, Jarecki proposed the proactive secret sharing to be a solution of existing the mobile adversary and also proposed the share renewal scheme for (k, n) threshold scheme. For n participants in the protocol, his method needs O($n^2$) modular exponentiation per one participant. It is very high computational cost and is not fit for the scalable cryptosystem. In this paper, we propose the efficient share renewal scheme that need only O(n) modular exponentiation per participant. And we prove our scheme is secure if less that ${\frac}\frac{1}{2}n-1$ adversaries exist and they static adversary.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.896-905
• /
• 2010

The sensor networks can be used attractively for various application areas. Time synchronization is important for any Ubiquitous Sensor Networks (USN) systems. USN makes extensive use of synchronized time in many contexts for data fusion. However existing time synchronization protocols are available only for homogeneous sensor nodes of USN. It needs to be extended or redesigned in order to apply to the USN with heterogeneous sensor nodes. Because heterogeneous sensor nodes have different clock sources with the SinkNode of USN, it is impossible to be synchronized global time. In addition, energy efficiency is one of the most significant factors to influence the design of sensor networks, as sensor nodes are limited in power, computational capacity, and memory. In this paper, we propose specific time synchronization based on master-slave topology for the global time synchronization of USN with heterogeneous sensor nodes. The time synchronization master nodes are always able to be synchronized with the SinkNode. Then time synchronization master nodes enable time synchronization slave nodes to be synchronized sleep periods. The proposed master-slave time synchronization for heterogeneous sensor nodes of USN is also helpful for power saving by maintaining maximum sleep time.

• Journal of Internet Computing and Services
• /
• v.22 no.1
• /
• pp.51-63
• /
• 2021

Identifying characters who appear in a story and analyzing their relationships is essential to understanding the story. This paper aims to identify the two actants (or character roles) as Helper and Opponent in Greimas's Actantial model by identifying Subject (i.e., protagonist) and analyzing the emotional interactions between the Subject and the two actants (Helper/Opponent). Our proposed method consists of three steps. First, we identify objects (i.e., characters) appearing in the text story. Next, we extract relational information through the interaction of the characters, and then classify emotions in the text expressed as relational information. Finally, we represent the flow of emotional relations among characters as a directed graph. The node with the highest degree is considered as the Subject because it includes the most relational information. The node that sends the most positive/negative emotions to the Subject is considered as the Helper/Oppenent, respectively. Our research contributes to the computer-based narrative understanding by providing a computational method that automatically extracts the three key character roles (Subject, Helper, and Opponent) from the text story.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.117-124
• /
• 2009

The p-convergent boundary element method has been proposed to analyze two-dimensional potential problem on the basis of high order Legendre shape functions that have different property comparing with the shape functions in conventional boundary element method. The location of nodes corresponding to high order shape function are not defined along the boundary, called by nodeless node, similar to the p-convergent finite element method. As the order of shape function increases, the collocation point method is used to solve linear simultaneous equations. The collocation patterns of p-convergent boundary element method consist of non-symmetric hierarchial or symmetric non-hierarchical. As the order of shape function increases, the number of collocation point increases. The singular integral that appears in p-convergent boundary element has been calculated by special numeric quadrature technique and semi-analytical integration technique. The L-shape domain problem including singularity in the vicinity of reentrant comer is analyzed and the numerical results show that the relative error is smaller than $10^{-2}%$ range as compared with other results in literatures. In case of same condition, the symmetric p-collocation point pattern shows high accuracy of solution.