• Computers and Concrete
• /
• v.32 no.3
• /
• pp.233-246
• /
• 2023

Accurate prediction of concrete compressive strength can minimize the need for extensive, time-consuming, and costly mixture optimization testing and analysis. This study attempts to enhance the prediction accuracy of compressive strength using stacking ensemble machine learning (ML) with feature engineering techniques. Seven alternative ML models of increasing complexity were implemented and compared, including linear regression, SVM, decision tree, multiple layer perceptron, random forest, Xgboost and Adaboost. To further improve the prediction accuracy, a ML pipeline was proposed in which the feature engineering technique was implemented, and a two-layer stacked model was developed. The k-fold cross-validation approach was employed to optimize model parameters and train the stacked model. The stacked model showed superior performance in predicting concrete compressive strength with a correlation of determination (R²) of 0.985. Feature (i.e., variable) importance was determined to demonstrate how useful the synthetic features are in prediction and provide better interpretability of the data and the model. The methodology in this study promotes a more thorough assessment of alternative ML algorithms and rather than focusing on any single ML model type for concrete compressive strength prediction.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.1
• /
• pp.165-184
• /
• 2023

The ARX-based lightweight block cipher is widely used in resource-constrained IoT devices due to fast and simple operation of software and hardware platforms. However, there are three weaknesses to ARX-based lightweight block ciphers. Firstly, only half of the data can be changed in one round. Secondly, traditional ARX-based lightweight block ciphers are static structures, which provide limited security. Thirdly, it has poor diffusion when the initial plaintext and key are all 0 or all 1. This paper proposes a new dynamic ARX-based lightweight block cipher to overcome these weaknesses, called DABC. DABC can change all data in one round, which overcomes the first weakness. This paper combines the key and the generalized two-dimensional cat map to construct a dynamic permutation layer P1, which improves the uncertainty between different rounds of DABC. The non-linear component of the round function alternately uses NAND gate and AND gate to increase the complexity of the attack, which overcomes the third weakness. Meanwhile, this paper proposes the round-based architecture of DABC and conducted ASIC and FPGA implementation. The hardware results show that DABC has less hardware resource and high throughput. Finally, the safety evaluation results show that DABC has a good avalanche effect and security.

• Molecules and Cells
• /
• v.45 no.3
• /
• pp.158-167
• /
• 2022

Ubiquitin (Ub) is post-translationally modified by Ub itself or Ub-like proteins, phosphorylation, and acetylation, among others, which elicits a variety of Ub topologies and cellular functions. However, N-terminal (Nt) modifications of Ub remain unknown, except the linear head-to-tail ubiquitylation via Nt-Met. Here, using the yeast Saccharomyces cerevisiae and an Nt-arginylated Ub-specific antibody, we found that the detectable level of Ub undergoes Nt-Met excision, Nt-deamination, and Nt-arginylation. The resulting Nt-arginylated Ub and its conjugated proteins are upregulated in the stationary-growth phase or by oxidative stress. We further proved the existence of Nt-arginylated Ub in vivo and identified Nt-arginylated Ub-protein conjugates using stable isotope labeling by amino acids in cell culture (SILAC)-based tandem mass spectrometry. In silico structural modeling of Nt-arginylated Ub predicted that Nt-Arg flexibly protrudes from the surface of the Ub, thereby most likely providing a docking site for the factors that recognize it. Collectively, these results reveal unprecedented Nt-arginylated Ub and the pathway by which it is produced, which greatly expands the known complexity of the Ub code.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2021.05a
• /
• pp.151-152
• /
• 2021

The sale price of apartment buildings is a key factor in the success or failure of apartment projects, and the factors that affect the sale price of apartments vary widely, including location, environmental factors, and economic conditions. Existing methods of predicting the sale price do not reflect the nonlinear characteristics of apartment prices, which are determined by the complex impact factors of reality, because statistical analysis is conducted under the assumption of a linear model. To improve these problems, a new analysis technique is needed to predict apartment sales prices by complex nonlinear influencing factors. Using machine learning techniques that have recently attracted attention in the field of engineering, it is possible to predict the sale price reflecting the complexity of various factors. Therefore, this study aims to conduct a basic study for the development of a machine learning-based prediction model for apartment sale prices.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.3
• /
• pp.720-737
• /
• 2024

Private set intersection cardinality (PSI-CA) is a typical problem in the field of secure multi-party computation, which enables two parties calculate the cardinality of intersection securely without revealing any information about their sets. And it is suitable for private data protection scenarios where only the cardinality of the set intersection needs to be calculated. However, most of the currently available PSI-CA protocols only meet the security under the semi-honest model and can't resist the malicious behaviors of participants. To solve the problems above, by the application of the variant of Elgamal cryptography and Bloom filter, we propose an efficient PSI-CA protocol with high security. We also present two new operations on Bloom filter called IBF and BIBF, which could further enhance the safety of private data. Using zero-knowledge proof to ensure the safety under malicious adversary model. Moreover, in order to minimize the error in the results caused by the false positive problem, we use Garbled Bloom Filter and key-value pair packing creatively and present an improved PSI-CA protocol. Through experimental comparison with several existing representative protocols, our protocol runs with linear time complexity and more excellent characters, which is more suitable for practical application scenarios.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.10
• /
• pp.1840-1848
• /
• 2017

Linear wireless sensor networks typically construct a network topology with a high reliability through sequential 1:1 mapping among sensor nodes, so that they are used in various surveillance applications of major national infrastructures. Most existing techniques for identifying sensor nodes in those networks are using GPS, AOA, and RSSI mechanisms. However, GPS or AOA based node identification techniques affect the size or production cost of the nodes so that it is not easy to construct practical sensor networks. RSSI based techniques may have a high deviation regrading location identification according to propagation environments and equipment quality so that complexity of error correction algorithm may increase. We propose a timestamps based sequential localization algorithm that uses transmit and receive timestamps in a message between sensor nodes without using GPS, AOA, and RSSI techniques. The algorithms for distance measurement between each node are expected to measure distance within up to 1 meter in case of an crystal oscillator of 300MHz or more.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.397-406
• /
• 2007

The problem of finding an optimal alignment between sequence A and B can be solved by dynamic programming algorithm(DPA) efficiently. But, if the length of string was longer, the problem might not be solvable because it requires O(m*n) time and space complexity.(where, $m={\mid}A{\mid},\;n={\mid}B{\mid}$) For space, Hirschberg developed a linear space and quadratic time algorithm, so computer memory was no longer a limiting factor for long sequences. As computers's processor and memory become faster and larger, a method is needed to speed processing up, although which uses more space. For this purpose, we present an algorithm which will solve the problem in quadratic time and linear space. By using division method, It computes optimal alignment faster than LSA, although requires more memory. We generalized the algorithm about division problem for not being divided into integer and pruned additional space by entry/exit node concept. Through the proofness and experiment, we identified that our algorithm uses d*(m+n) space and a little more (m*n) time faster than LSA.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.36 no.2
• /
• pp.37-49
• /
• 2024

To date, numerous empirical formulas have been proposed through hydraulic model experiments to predict the wave breaker index, including wave height and depth of wave breaking, due to the inherent complexity of generation mechanisms. Unfortunately, research on the characteristics of wave breaking and the prediction of the wave breaker index for gravel beaches has been limited. This study aims to forecast the wave breaker index for gravel beaches using representative linear-based machine learning techniques known for their high predictive performance in regression or classification problems across various research fields. Initially, the applicability of existing empirical formulas for wave breaker indices to gravel seabeds was assessed. Various linear-based machine learning algorithms were then employed to build prediction models, aiming to overcome the limitations of existing empirical formulas in predicting wave breaker indices for gravel seabeds. Among the developed machine learning models, a new calculation formula for easily computable wave breaker indices based on the model was proposed, demonstrating high predictive performance for wave height and depth of wave breaking on gravel beaches. The study validated the predictive capabilities of the proposed wave breaker indices through hydraulic model experiments and compared them with existing empirical formulas. Despite its simplicity as a polynomial, the newly proposed empirical formula for wave breaking indices in this study exhibited exceptional predictive performance for gravel beaches.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.21-26
• /
• 2011

Feature ranking is useful to gain knowledge of data and identify relevant features. In this study, we proposed a use of feature ranking for classification of neuro-degeneration and vascular dementia in micro-Raman spectra of platelet. The entire region of the spectrum is divided into local region including several peaks, followed by Gaussian curve fitting method in the region to be modeled. Local minima select from the subregion and then remove the background based on the position by using interpolation method. After preprocessing steps, significant features were selected by feature ranking method to improve the classification accuracy and the computational complexity of classification system. PCA (principal component analysis) transform the selected features and the overall features that is used classification with the number of principal components. These were classified as MAP (maximum a posteriori) and it compared with classification result using overall features. In all experiments, the computational complexity of the classification system was remarkably reduced and the classification accuracy was partially increased. Particularly, the proposed method increased the classification accuracy in the experiment classifying the Parkinson's disease and normal with the average 1.7 %. From the result, it confirmed that proposed method could be efficiently used in the classification system of the neuro-degenerative disease and vascular dementia of platelet.

• Korean Journal of Biological Psychiatry
• /
• v.4 no.1
• /
• pp.67-73
• /
• 1997

The changes of electroencephalogram(EEG) in patients with dementia are most commonly studied by analyzing power or magnitude in certain traditionally defined frequency bands. However because of the absence of an identified metric which quantifies the complex amount of information, there are many limitations in using such a linear method. According to chaos theory, irregular signals of EEG can also result from low dimensional deterministic chaos. Chaotic nonlinear dynamics in the EEG can be studied by calculating the correlation dimension. The authors have analyzed EEG epochs from three patients with dementia of Alzheimer type and three matched control subjects. The multichannel correlation dimension is calculated from EEG epochs consisting of 15 channels with 16,384 data points per channel. The results showed that patients with dementia of Alzheimer type had significantly lower correlation dimension than non-demented controls on 12 channels. Topographic analysis showed that the correlation dimensions were significantly lower in patients with Alzheimer's disease on frontal, temporal, central, and occipital head regions. These results show that brains of patients with dementia of Alzheimer type have a decreased complexity of electrophysiological behavior. We conclude that the nonlinear analysis such as calculating correlation dimension can be a promising tool for detecting relative changes in the complexity of brain dynamics.