• Steel and Composite Structures
• /
• v.52 no.4
• /
• pp.475-485
• /
• 2024

The mechanical behavior of the steel tube encased high-strength concrete (STHC) composite walls under constant axial load and cyclically increasing lateral load was studied. Conclusions are drawn based on experimental observations, grey evolutionary algorithm and finite element (FE) simulations. The use of steel tube wall panels improved the load capacity and ductility of the specimens. STHC composite walls withstand more load cycles and show more stable hysteresis performance than conventional high strength concrete (HSC) walls. After the maximum load, the bearing capacity of the STHC composite wall was gradually reduced, and the wall did not collapse under the influence of the steel pipe. For analysis of the bending capacity of STHC composite walls based on artificial intelligence tools, an analysis model is proposed that takes into account the limiting effect of steel pipes. The results of this model agree well with the test results, indicating that the model can be used to predict the bearing capacity of STHC composite walls. Based on a reasonable material constitutive model and the limiting effect of steel pipes, a finite element model of the STHC composite wall was created. The finite elements agree well with the experimental results in terms of hysteresis curve, load-deformation curve and peak load.

• Journal of the Optical Society of Korea
• /
• v.19 no.1
• /
• pp.84-87
• /
• 2015

For large optical elements which are tested by many sub-apertures, it takes too much time for a sub-aperture stitching algorithm to get the stitching result. To solve this problem, we propose a fast sub-aperture stitching algorithm to quickly compensate for piston, tilt, and defocus errors. Moreover, the new algorithm is easy to understand and program. We use partial derivatives of measurement data to separately solve piston, tilt, and defocus errors. First, we show that the new algorithm has a lower time complexity than the currently used algorithm. Although simulation results indicate that the accuracy of the new algorithm is lower than the current algorithm in all 20 simulations, our experimental results validate the algorithm and show it is sufficiently accurate for general use.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.897-913
• /
• 2016

Threshold signature is very important in identity authentication and some other applications. In December 2010, Chinese Encryption Administration released the SM2 elliptic curve digital signature algorithm as the first standard of the digital signature algorithm in China. At present, the papers on the threshold signature scheme based on this algorithm are few. A SM2 elliptic curve threshold signature scheme without a trusted center is proposed according to the Joint-Shamir-RSS algorithm, the Joint-Shamir-ZSS algorithm, the sum or diff-SS algorithm, the Mul-SS algorithm, the Inv-SS algorithm and the PM-SS algorithm. The proposed scheme is analyzed from correctness, security and efficiency. The correctness analysis shows that the proposed scheme can realize the effective threshold signature. The security analysis shows that the proposed scheme can resist some kinds of common attacks. The efficiency analysis shows that if the same secret sharing algorithms are used to design the threshold signature schemes, the SM2 elliptic curve threshold signature scheme will be more efficient than the threshold signature scheme based on ECDSA.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.10
• /
• pp.1111-1116
• /
• 2014

In this paper, in order to improve performance of LDPC codes, we propose an effective algorithm with lowering error floor of LDPC codes. This method is done by breaking trapping sets, mostly caused by an undesirable structure. This algorithm is not need to observe all the errors, only need to break the trapping sets, to effect the effectiveness. Simulation results show that its performance can be significantly improved with this decoding algorithm.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.429-437
• /
• 2005

Sensor localization has become an essential requirement for realistic applications over wireless sensor networks (WSN). In this paper we propose an ad hoc localization algorithm that is infrastructure-free, anchor-free, and computationally efficient with reduced communication. A novel combination of distance and direction estimation technique is introduced to detect and estimate ranges between neighbors. Using this information we construct unidirectional coordinate systems to avoid the reflection ambiguity. We then compute node positions using a transformation matrix [T], which reduces the computational complexity of the localization algorithm while computing positions relative to the fixed coordinate system. Simulation results have shown that at a node degree of 9 we get $90\%$ localization with $20\%$ average localization error without using any error refining schemes.

• Journal of the Optical Society of Korea
• /
• v.20 no.1
• /
• pp.204-211
• /
• 2016

Oil pollution seriously endangers the biological environment and human health. Due to the diversity of oils and the complexity of oil composition, it is of great significance to identify the oil contaminants. The 3-D fluorescence spectrum combined with a second order correction algorithm was adopted to measure an oil mixture with overlapped fluorescence spectra. The self-weighted alternating trilinear decomposition (SWATLD) is a kind of second order correction, which has developed rapidly in recent years. Micellar solutions of #0 diesel, #93 gasoline and ordinary kerosene in different concentrations were made up. The 3-D fluorescence spectra of the mixed oil solutions were measured by a FLS920 fluorescence spectrometer. The SWATLD algorithm was applied to decompose the spectrum data. The predict concentration and recovery rate obtained by the experiment show that the SWATLD algorithm has advantages of insensitivity to component number and high resolution for mixed oils.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1091-1110
• /
• 2016

Hybrid deployment under current cloud data centers is a combination of online and offline services, which improves the utilization of the cluster resources. However, the performance of the cluster is often affected by the online services in the hybrid deployment environment. To improve the response time of online service (e.g. search engine), an effective scheduling algorithm based on Storm is proposed. At the component level, the algorithm dispatches the component with more influence to the optimal performance node. Inside the component, a reasonable resource allocation strategy is used. By searching the compressed index first and then filtering the complete index, the execution speed of the component is improved with similar accuracy. Experiments show that our algorithm can guarantee search accuracy of 95.94%, while increasing the response speed by 68.03%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1287-1300
• /
• 2018

Target-tracking algorithm based on ad hoc camera sensor networks (ACSNs) utilizes the distributed observation capability of nodes to achieve accurate target tracking. A compressed sensing-based multiple-target tracking algorithm (CSMTTA) for ACSNs is proposed in this work based on the study of camera node observation projection model and compressed sensing model. The proposed algorithm includes reconfiguration of observed signals and evaluation of target locations. It reconfigures observed signals by solving the convex optimization of L1-norm least and forecasts node group to evaluate a target location by the motion features of the target. Simulation results show that CSMTTA can recover the subtracted observation information accurately under the condition of sparse sampling to a high target-tracking accuracy and accomplish the distributed tracking task of multiple mobile targets.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.199-202
• /
• 2009

This paper proposes a novel adaptive algorithm for deinterlacing. In the proposed algorithm, the previously developed Enhanced ELA [6], Chen [9] and Li [10] algorithms were used as a basis. The fundamental mechanism was the selection and application of the appropriate algorithm according to the correlation with the previous and next field using temporal information. Extensive simulations were conducted for video sequences and showed good performance in terms of peak signal-to-ratio (PSNR) and subjective quality.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.204-208
• /
• 2011

This paper proposes a novel deinterlacing algorithm using neighboring deinterlacing pixels directions weight, which can obtain the true deinterlacing direction of the interpolated pixel. The proposed algorithm determines the direction of the current interpolated pixel using MELA direction determination method. To obtain more accurate deinterlacing direction and increase interpolation direction correlation, the directions of neighboring pixels around the current interpolated pixel are considered. The current direction and the neighboring majority direction are compared to decide an interpolated method. But it cost slightly CPU time increasing since neighboring pixels directions determination and statistics. Experimental results demonstrate that the proposed algorithm outperforms the conventional deinterlacing methods.