• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.67-75
• /
• 2010

Network reprogramming is a technology that allows several sensor nodes deployed in sensor field to be repaired remotely. Unlike general communication in sensor network where small amount of data is transferred, network reprogramming requires reliable transfer of large amount of data. The existing network reprogramming techniques suffers high cost and large energy consumption to recover data loss in node communication. In this paper, a cluster based network reporgramming scheme is proposed for sensor network. It divides sensor field into several clusters and chooses a cluster header in charge of data relay to minimize duplicated transmission and unnecessary competition. It increases reliability by effective error recovery through status table.

• Nuclear Engineering and Technology
• /
• v.55 no.9
• /
• pp.3301-3312
• /
• 2023

This study incorporates a high-fidelity transient analysis solver based on multigroup CMFD in the MOC code STREAM. Transport modeling with heterogeneous geometries of the reactor core increases computational cost in terms of memory and time, whereas the multigroup CMFD reduces the computational cost. The reactor condition does not change at every time step, which is a vital point for the utilization of CMFD. CMFD correction factors are updated from the transport solution whenever the reactor core condition changes, and the simulation continues until the end. The transport solution is adjusted once CMFD achieves the solution. The flux-weighted method is used for rod decusping to update the partially inserted control rod cell material, which maintains the solution's stability. A smaller time-step size is needed to obtain an accurate solution, which increases the computational cost. The adaptive step-size control algorithm is robust for controlling the time step size. This algorithm is based on local errors and has the potential capability to accept or reject the solution. Several numerical problems are selected to analyze the performance and numerical accuracy of parallel computing, rod decusping, and adaptive time step control. Lastly, a typical pressurized LWR was chosen to study the rod-ejection accident.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.27 no.6
• /
• pp.265-273
• /
• 2023

This study proposes a methodology for the regional seismic risk assessment of structural damage to buildings in Korea based on evaluating individual buildings, considering inconsistency between the administrative district border and grid lines to define seismic hazard. The accuracy of seismic hazards was enhanced by subdividing the current 2km-sized grids into ones with a smaller size. Considering the enhancement of the Korean seismic design code in 2005, existing seismic fragility functions for seismically designed buildings are revised by modifying the capacity spectrum according to the changes in seismic design load. A seismic risk index in building damage is defined using the total damaged floor area considering building size differences. The proposed seismic risk index was calculated for buildings in 29 administrative districts in 'A' city in Korea to validate the proposed assessment algorithm and risk index. In the validation procedure, sensitivity analysis was performed on the grid size, quantitative building damage measure, and seismic fragility function update.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.4
• /
• pp.819-826
• /
• 2018

The generalized Hamming weight is one of the important parameters of the linear code. It determines the performance of the code when the linear codes are applied to a cryptographic system. In addition, when the block code is decoded by soft decision using the lattice diagram, it becomes a measure for evaluating the state complexity required for the implementation. In particular, a bit-parallel multiplier on finite fields based on trinomials have been studied. Cellular automata(CA) has superior randomness over LFSR due to its ability to update its state simultaneously by local interaction. In this paper, we deal with the efficient synthesis of the pseudo random number generator, which is one of the important factors in the design of effective cryptosystem. We analyze the property of the characteristic polynomial of the simple 90/150 transition rule block, and propose a synthesis algorithm of the reversible 90/150 CA corresponding to the trinomials $x^2^n+x^{2^n-1}+1$($n{\geq}2$) and the 90/150 reversible CA(RCA) corresponding to the maximum weight polynomial with $2^n$ degree by using this rule block.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.895-904
• /
• 2007

This paper proposes a robust sub-optimal smart antenna in Code Division Multiple Access (CDMA) basestation. It makes use of the property of the Least Mean Square (LMS) algorithm and the Conjugate Gradient Method (CGM) algorithm for beamforming processes. The weight update takes place at symbol level which follows the PN correlators of receiver module under the assumption that the post correlation desired signal power is far larger than the power of each of the interfering signals. The proposed algorithm is simple and has as low computational load as five times of the number of antenna elements(O(5N)) as a whole per each snapshot. The output Signal to Interference plus Noise Ratio (SINR) of the proposed smart antenna system when the weight vector reaches the steady state has been examined. It has been observed in computer simulations that proposed beamforming algorithm improves the SINR significantly compared to the single antenna case. The convergence property of the weight vector has also been investigated to show that the proposed hybrid algorithm performs better than CGM and LMS during the initial stage of the weight update iteration. The Bit Error Rate (BER) characteristics of the proposed array has also been shown as the processor input Signal to Noise Ratio (SNR) varies.

• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.2
• /
• pp.3-8
• /
• 2011

Recently, the demand for enterprise for service map providing and portal site services of a 3D virtual city model for public users has been expanding. Also, accuracy of the data, transfer rate and the update for the update for the lapse of time emerge are considered as more impertant factors, by providing 3D information with the web or mobile devices. With the latest technology, we have seen various 3D data through the web. With the VRML progressing actively, because it can provide a virtual display of the world and all aspects of interaction with web. It offers installation of simple plug-in without extra cost on the web. LiDAR system can obtain spatial data easily and accurately, as supprted by numerous researches and applications. However, in general, LiDAR data is obtained in the form of an irregular point cloud. So, in case of using data without converting, high processor is needed for presenting 2D forms from point data composed of 3D data and the data increase. This study expresses urban LiDAR data in 3D, 2D raster data that was applied by compressing algorithm that was used for solving the problems of large storage space and processing. For expressing 3D, algorithm that converts compressed LiDAR data into code Suited to VRML was made. Finally, urban area was expressed in 3D with expressing ground and feature separately.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.12
• /
• pp.2783-2790
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard, require a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithms for LDPC codes. First, sequential decoding with partial group is proposed. It has the same H/W complexity, and fewer number of iterations are required with the same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method reduces number of unnecessary iterations. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme. The LDPC decoder have been implemented in Xilinx System Generator and targeted to a Xilinx Virtx5-xc5vlx155t FPGA. When three algorithms are used, amount of device is about 45% off and the decoding speed is about two times faster than convectional scheme.

• Journal of the Korean Institute of Gas
• /
• v.22 no.6
• /
• pp.136-143
• /
• 2018

Cellular automata have been applied to simulations in many fields such as astrophysics, social phenomena, fire spread, and evacuation. Using cellular automata, this study develops a model for consequence analysis of the dispersion of hazardous chemicals, which is required for risk assessments of and emergency responses for frequent chemical accidents. Unlike in cases of detailed plant safety design, real-time accident responses require fast and iterative calculations to reduce the uncertainty of the distribution of damage within the affected area. EPA ALOHA and KORA of National Institute of Chemical Safety have been popular choices for these analyses. However, this study proposes an initiative to supplement the model and code continuously and is different in its development of free software, specialized for small and medium enterprises. Compared to the full-scale computational fluid dynamics (CFD), which requires large amounts of computation time, the relative accuracy loss is compromised, and the convenience of the general user is improved. Using Python open-source libraries as well as meteorological information linkage, it is made possible to expand and update the functions continuously. Users can easily obtain the results by simply inputting the layout of the plant and the materials used. Accuracy is verified against full-scale CFD simulations, and it will be distributed as open source software, supporting GPU-accelerated computing for fast computation.

• Journal of Dairy Science and Biotechnology
• /
• v.33 no.3
• /
• pp.197-202
• /
• 2015

While various foodborne pathogenic bacteria can be detected more rapidly via polymerase chain reaction than via conventional plating methods, it is impossible to distinguish between viable and dead cells in DNA-based assays. Hence, propidium monoazide (PMA) treatment has been introduced to detect living cells. The purpose of this study is to evaluate the applicability of the PMA treatment and real-time qPCR method for the detection of Cronobacter sakazakii and to compare it to that of plate counting. Based on our positive results, we suggest the use of PMA treatment and real-time qPCR for the detection of viable Cronobacter sakazakii in various food sources and an update of the Korean Food Code.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.6
• /
• pp.77-81
• /
• 2008

In the deeply coupled GPS/INS integrated systems, if the integration filter update period is longer than the period of GPS navigation data, the loss of correlation values occurs due to the bit transition. This problem can be resolved when data wipe off(DWO) is used. However, general DWO methods requires heavy computation or cannot be applied continuously. This paper proposes an effective DWO method using carrier phase discriminator In order to show validity of the proposed method, simulations were carried out. The simulation results show that the data bit is accurately estimated and conform that the loss of correlation values and the error of code phase is small.