• Journal of the Earthquake Engineering Society of Korea
• /
• v.27 no.2
• /
• pp.77-82
• /
• 2023

The structural analysis module is an essential part of any integrated structural system. Diverse integrated systems today require, from the analysis module, efficient real-time responses to real-time input such as earthquake signals, extreme weather-related forces, and man-made accidents. An integrated system may also be for the entire life span of a civil structure conceived during the initial conception, developed throughout various design stages, effectively used in construction, and utilized during usage and maintenance. All these integrated systems' essential part is the structural analysis module, which must be automated and computationally efficient so that responses may be almost immediate. The finite element method is often used for structural analysis, and for automation, many effective finite element meshes must be automatically generated for a given analysis. A computationally efficient finite element mesh generation scheme based on the r-h method of mesh refinement using strain deviations from the values at the Gauss points as error estimates from the previous mesh is described. Shape factors are used to sort out overly distorted elements. A standard cantilever beam analyzed by four-node plane stress elements is used as an example to show the effectiveness of the automated algorithm for a time-domain dynamic analysis. Although recent developments in computer hardware and software have made many new applications in integrated structural systems possible, structural analysis still needs to be executed efficiently in real-time. The algorithm applies to diverse integrated systems, including nonlinear analyses and general dynamic problems in earthquake engineering.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.19-26
• /
• 2006

In these days, multimedia data is transmitted and processed in compressed format. Due to the decoding procedure and filtering for edge detection, the feature extraction process of MPEG-7 Edge Histogram Descriptor (EHD) is time consuming as well as computationally expensive. To improve efficiency of compressed image retrieval, we propose a new edge histogram generation algorithm in DCT domain in this paper. Using the edge information provided by the only two AC coefficients of DCT coefficients, we can get edge directions and strengths directly in DCT domain. The experimental results demonstrate that our system has good performance in terms of retrieval efficiency and effectiveness.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.1
• /
• pp.21-28
• /
• 2009

DFT-spread OFDM(Discrete Fourier Transform-Spread Orthogonal Frequency Division Multiplexing) is very effective for solving the PAPR(Peak-to-Average Power Ratio) problem. Therefore, the SC-FDMA(Single Carrier-Frequency Division Multiple Access) which is basically same to the DFT spread OFDM was adopted as the uplink standard of the 3GPP LTE ($3^{rd}$ Generation Partnership Project Long Term Evolution). Unlike the ordinary OFDM system, the SC-FDMA using DFT spreading method is vulnerable to the ICI(Inter-Carrier Interference) problem caused by the phase noise and IQ(In-phase/Quadrature) imbalance and effected FDE(Frequency Domain Equalizer). In this paper, the ICI effects from the phase noise and IQ imbalance which can be problems in uplink transmission are analyzed according the back-off level of HPA. Next, we propose the equalizer algorithm to remove the ICI effects. This proposed equalizer based on the FDE can be considered as up-graded and improved version of PNS(Phase Noise Suppression) algorithm. This proposed equalizer effectively compensates the ICI resulting from the phase noise and IQ imbalance. Finally, through the computer simulation, it can be shown that about SNR=14 dB is required for the $BER=10^{-4}$ after ICI compensation when the back-off is 4.5 dB, $\varepsilon=0.005$, $\phi=5^{\circ}$, and $pn=0.06\;rad^2$.

• Journal of Internet Computing and Services
• /
• v.24 no.5
• /
• pp.17-27
• /
• 2023

Today, as AI (Artificial Intelligence) technology develops and its practicality increases, it is widely used in various application fields in real life. At this time, the AI model is basically learned based on various statistical properties of the learning data and then distributed to the system, but unexpected changes in the data in a rapidly changing data situation cause a decrease in the model's performance. In particular, as it becomes important to find drift signals of deployed models in order to respond to new and unknown attacks that are constantly created in the security field, the need for lifecycle management of the entire model is gradually emerging. In general, it can be detected through performance changes in the model's accuracy and error rate (loss), but there are limitations in the usage environment in that an actual label for the model prediction result is required, and the detection of the point where the actual drift occurs is uncertain. there is. This is because the model's error rate is greatly influenced by various external environmental factors, model selection and parameter settings, and new input data, so it is necessary to precisely determine when actual drift in the data occurs based only on the corresponding value. There are limits to this. Therefore, this paper proposes a method to detect when actual drift occurs through an Anomaly analysis technique based on XAI (eXplainable Artificial Intelligence). As a result of testing a classification model that detects DGA (Domain Generation Algorithm), anomaly scores were extracted through the SHAP(Shapley Additive exPlanations) Value of the data after distribution, and as a result, it was confirmed that efficient drift point detection was possible.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.10 s.101
• /
• pp.965-972
• /
• 2005

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 for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, 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 computational complexity of early detected method is about $50\%$ offs in case of check node update, $99\%$ offs in case of check node update compared to conventional scheme.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.227-235
• /
• 2005

In the embedded system domain, both memory requirement and energy consumption are great concerns. To save memory and energy, the 32 bit ARM processor supports the 16 bit Thumb instruction set. For a given program, the Thumb code is typically smaller than the ARM code. However, the limitations of the Thumb instruction set can often lead to generation of poorer quality code. To generate codes with smaller size but a little slower execution speed, Krishnaswarmy suggests a profiling guided selection algorithm at module level for generating mixed ARM and Thumb codes for application programs. The resulting codes of the algorithm give significant code size reductions with a little loss in performance. When the instruction set is selected at module level, some functions, which should be compiled in Thumb mode to reduce code size, are compiled to ARM code. It means we have additional code size reduction chance. In this paper, we propose a profile guided selection algorithm at function level for generating mixed ARM and Thumb codes for application programs so that the resulting codes give additional code size reductions without loss in performance compared to the module level algorithm. We can reduce 2.7％ code size additionally with no performance penalty

• 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.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1033-1043
• /
• 1998

In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).

• Journal of the Korean GEO-environmental Society
• /
• v.12 no.4
• /
• pp.53-63
• /
• 2011

Selection or generation of appropriate input ground motion is very important in performing a dynamic analysis. In Korea, it is a common practice to use recorded strong ground motions or artificial motions. The recorded motions show non-stationary characteristics, which is a distinct property of all earthquake motions, but have the problem of not matching the design response spectrum. The artificial motions match the design spectrum, but show stationary characteristics. This study generated ground motions that preserve the non-stationary characteristics of a real earthquake motion, but also matches the design spectrum. In the process, an impulse function-based algorithm that adjusts a given time series in time domain such that it matches the target response spectrum is used. Application of the algorithm showed that it can successfully adjust any recorded motions to match the target spectrum and also preserve the non-stationary characteristics. The modified motions are used to perform a series of nonlinear site response analyses. It is shown that the results using the adjusted motions result in more reliable estimates of ground vibration. It is thus recommended that the newly adjusted motions be used in practice instead of original recorded motions.

• Journal of KIISE:Software and Applications
• /
• v.33 no.12
• /
• pp.1052-1061
• /
• 2006

This paper presents a method of using virtual examples to improve the classification accuracy for data with nominal attributes. Most of the previous researches on virtual examples focused on data with numeric attributes, and they used domain-specific knowledge to generate useful virtual examples for a particularly targeted learning algorithm. Instead of using domain-specific knowledge, our method samples virtual examples from a naive Bayesian network constructed from the given training set. A sampled example is considered useful if it contributes to the increment of the network's conditional likelihood when added to the training set. A set of useful virtual examples can be collected by repeating this process of sampling followed by evaluation. Experiments have shown that the virtual examples collected this way.can help various learning algorithms to derive classifiers of improved accuracy.