• International Journal of Naval Architecture and Ocean Engineering
• /
• 제13권1호
• /
• pp.617-627
• /
• 2021

Underwater Acoustic Channels (UAC) have inherent sparse characteristics. The traditional adaptive equalization techniques do not utilize this feature to improve the performance. In this paper we consider the Variable Adaptive Subgradient Projection (V-ASPM) method to derive a new sparse equalization algorithm based on the Minimum Symbol Error Rate (MSER) criterion. Compared with the original MSER algorithm, our proposed scheme adds sparse matrix to the iterative formula, which can assign independent step-sizes to the equalizer taps. How to obtain such proper sparse matrix is also analyzed. On this basis, the selection scheme of the sparse matrix is obtained by combining the variable step-sizes and equalizer sparsity measure. We call the new algorithm Sparse-Control Proportional-MSER (SC-PMSER) equalizer. Finally, the proposed SC-PMSER equalizer is embedded into a turbo receiver, which perform turbo decoding, Digital Phase-Locked Loop (DPLL), time-reversal receiving and multi-reception diversity. Simulation and real-field experimental results show that the proposed algorithm has better performance in convergence speed and Bit Error Rate (BER).

• Nuclear Engineering and Technology
• /
• 제54권7호
• /
• pp.2625-2634
• /
• 2022

Discretization errors are extremely challenging conundrums of discrete ordinates calculations for radiation transport problems with void regions. In previous work, we have presented a multi-collision source method (MCS) to overcome discretization errors, but the efficiency needs to be improved. This paper proposes a goal-oriented algorithm for the MCS method to adaptively determine the partitioning of the geometry and dynamically change the angular quadrature in remaining iterations. The importance factor based on the adjoint transport calculation obtains the response function to get a problem-dependent, goal-oriented spatial decomposition. The difference in the scalar fluxes from one high-order quadrature set to a lower one provides the error estimation as a driving force behind the dynamic quadrature. The goal-oriented algorithm allows optimizing by using ray-tracing technology or high-order quadrature sets in the first few iterations and arranging the integration order of the remaining iterations from high to low. The algorithm has been implemented in the 3D transport code ARES and was tested on the Kobayashi benchmarks. The numerical results show a reduction in computation time on these problems for the same desired level of accuracy as compared to the standard ARES code, and it has clear advantages over the traditional MCS method in solving radiation transport problems with reflective boundary conditions.

• Smart Structures and Systems
• /
• 제31권2호
• /
• pp.155-169
• /
• 2023

The quasi-static component of the moving vehicle-induced dynamic response is promising in damage detection as it is sensitive to bridge damage but insensitive to environmental changes. However, accurate extraction of quasi-static component from the dynamic response is challenging especially when the vehicle velocity is high. This paper proposes an adaptive quasi-static component extraction method based on the modified variational mode decomposition (VMD) algorithm. Firstly the analytical solutions of the frequency components caused by road surface roughness, high-frequency dynamic components controlled by bridge natural frequency and quasi-static components in the vehicle-induced bridge response are derived. Then a modified VMD algorithm based on particle swarm algorithm (PSO) and mutual information entropy (MIE) criterion is proposed to adaptively extract the quasi-static components from the vehicle-induced bridge dynamic response. Numerical simulations and real bridge tests are conducted to demonstrate the feasibility of the proposed extraction method. The results indicate that the improved VMD algorithm could extract the quasi-static component of the vehicle-induced bridge dynamic response with high accuracy in the presence of the road surface roughness and measurement noise.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권6호
• /
• pp.1674-1688
• /
• 2023

The remarkable advancement of quantum steganography offers enhanced security for quantum communications. However, there is a significant concern regarding the potential misuse of this technology. Moreover, the current research on identifying malicious quantum steganography is insufficient. To address this gap in steganalysis research, this paper proposes a specialized quantum steganalysis algorithm. This algorithm utilizes quantum machine learning techniques to detect steganography in general quantum secure communication schemes that are based on pure states. The algorithm presented in this paper consists of two main steps: data preprocessing and automatic discrimination. The data preprocessing step involves extracting and amplifying abnormal signals, followed by the automatic detection of suspicious quantum carriers through training on steganographic and non-steganographic data. The numerical results demonstrate that a larger disparity between the probability distributions of steganographic and non-steganographic data leads to a higher steganographic detection indicator, making the presence of steganography easier to detect. By selecting an appropriate threshold value, the steganography detection rate can exceed 90%.

• 한국융합학회논문지
• /
• 제4권4호
• /
• pp.41-48
• /
• 2013

Observer design for system with unknown input was carried out. First, Kalman filter was considered to estimate system state with White noise. With the results of Kalman filter design, state observer, controller properties, including controllability and observability, and the Kalman filter structure and algorithm were also studied. Kalman filter algorithm was applied to Position and velocity measurement based on Kalman filter with white noise, and it was constructed and achieved by programming based on Matlab programming. Finally, observer for system with unknown input was constructed with the help of Gershgorin's disc theorem. With the designed observer, system states was constructed and applied to system with unknown input. By simulation results, estimation performance was verified. In this project, state feedback control theory, observer theory and relevant design procedure, as well as Kalman filter design were understood and used in practical application.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.113-117
• /
• 1998

We propose a way to show the inherent learning complexity for the multilayer perceptron. We display the solution space and the error surfaces on the input space of a single neuron with two inputs. The evolution of its weights will follow one of the two error surfaces. We observe that when we use the back-propagation(BP) learning algorithm (1), the wight cam not jump to the lower error surface due to the implicit continuity constraint on the changes of weight. The self-relaxation approach is to explicity find out the best combination of all neurons' two error surfaces. The time complexity of training a multilayer perceptron by self-relaxationis exponential to the number of neurons.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.750-755
• /
• 1998

Due to the temporal spatial correlation of the image sequence, the motion vector of a block is highly related to the motion vectors of its adjacent blocks in the same image frame. If we can obtain useful and enough information from the adjacent motion vectors, the total number of search points used to find the motion vector of the block may be reduced significantly. Using that idea, an efficient fuzzy prediction search (FPS) algorithm for block motion estimation is proposed in this paper. Based on the fuzzy inference process, the FPS can determine the motion vectors of image blocks quickly and correctly.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2005년도 BIOINFO 2005
• /
• pp.348-353
• /
• 2005

In this paper we discuss the formulation and the analysis of a signaling pathway by Petri nets. In order to explicitly and formally describe the molecular mechanisms and pathological characteristics of signaling pathways, we propose a new modeling method to construct signaling pathways on the basis of formal representation of Petri net. Our proposed extended algorithm effectively finds basic enzymic components of signaling pathways by employing T-invariants of Petri nets with considering the origination leading to an occurrence of inhibition functions than existing methods. An application of the proposed algorithm is given with the example of Interleukin-1 and Interleukin-6 signaling pathways.

• Journal of Electrical Engineering and Technology
• /
• 제11권1호
• /
• pp.55-64
• /
• 2016

The development of high-speed rail (HSR) has had a major impact on the power supply grid. Based on the monitored waveforms of HSR, a pattern recognition approach is proposed for the first time in this paper to identify the operating conditions. To reduce the data dimensions for monitored waveforms, the principal component analysis (PCA) algorithm was used to extract the characteristics and their waveforms from the monitored waveforms data. The dynamic time wrapping (DTW) algorithm was then used to identify the operating conditions of the HSR. Cases studies show that the proposed approach is effective and feasible, and that it is possible to identify the real-time operating conditions based on the monitored waveforms.

• Industrial Engineering and Management Systems
• /
• 제10권1호
• /
• pp.15-23
• /
• 2011

This research considers scheduling problems with jobs which can be divided into sub-jobs and do not required to be processed immediately following one another. Heuristic algorithms considering how to divide jobs are proposed in an attempt to find near-optimal solutions within reasonable run time. The algorithms contain two phases which are executed recursively. Phase 1 of the algorithm determines how jobs should be divided while phase 2 solves the scheduling problem given the sub-jobs established in phase 1. Simulated annealing and genetic algorithms are applied for the two phases and four heuristic algorithms are established. Numerical experiment is conducted to determine the best parameter values for the heuristic algorithms. Examples with different sizes and levels of complexity are generated. Performance of the proposed algorithms is evaluated. It is shown that the proposed algorithms are able to efficiently and effectively solve the considered problems.