• Journal of the Korean Society of Propulsion Engineers
• /
• v.25 no.6
• /
• pp.1-11
• /
• 2021

To develop an efficient procedure related to the flamelet library, the machine learning process based on artificial neural network(ANN) is applied for the gaseous hydrogen/liquid oxygen combustor under a supercritical pressure condition. For hidden layers, 25 combinations based on Rectified Linear Unit(ReLU) and hyperbolic tangent are adopted to find an optimum architecture in terms of the computational efficiency and the training performance. For activation functions, the hyperbolic tangent is proper to get the high learning performance for accurate properties. A transformation learning data is proposed to improve the training performance. When the optimal node is arranged for the 4 hidden layers, it is found to be the most efficient in terms of training performance and computational cost. Compared to the interpolation procedure, the ANN procedure reduces computational time and system memory by 37% and 99.98%, respectively.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.34-36
• /
• 2022

In the existing text sentiment analysis models, the entire text is usually directly modeled as a whole, and the hierarchical relationship between text contents is less considered. However, in the practice of sentiment analysis, many texts are mixed with multiple emotions. If the semantic modeling of the whole is directly performed, it may increase the difficulty of the sentiment analysis model to judge the sentiment, making the model difficult to apply to the classification of mixed-sentiment sentences. Therefore, this paper proposes a sentiment analysis model BHGCN that considers the text hierarchy. In this model, the output of hidden states of each layer of BERT is used as a node, and a directed connection is made between the upper and lower layers to construct a graph network with a semantic hierarchy. The model not only pays attention to layer-by-layer semantics, but also pays attention to hierarchical relationships. Suitable for handling mixed sentiment classification tasks. The comparative experimental results show that the BHGCN model exhibits obvious competitive advantages.

• Journal of Korea Water Resources Association
• /
• v.33 no.2
• /
• pp.247-262
• /
• 2000

In this paper, the WSANN(Water Stage Analysis with Neural Network) model was presented so as to predict flood water stage at Jindong which has been the major stream gauging station in Nakdong river basin. The WSANN model used the improved backpropagation training algorithm which was complemented by the momentum method, improvement of initial condition and adaptive-learning rate and the data which were used for this study were classified into training and testing data sets. An empirical equation was derived to determine optimal hidden layer node between the hidden layer node and threshold iteration number. And, the calibration of the WSANN model was performed by the four training data sets. As a result of calibration, the WSANN22 and WSANN32 model were selected for the optimal models which would be used for model verification. The model verification was carried out so as to evaluate model fitness with the two-untrained testing data sets. And, flood water stages were reasonably predicted through the results of statistical analysis. As results of this study, further research activities are needed for the construction of a real-time warning of the impending flood and for the control of flood water stage with neural network method in river basin. basin.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.6
• /
• pp.511-516
• /
• 2002

The neural networks may have problem such that the amount of calculation for the network learning goes too big according to the dimension of the dimension. To overcome this problem, the wavelet neural networks(WNN) which use the orthogonal basis function in the hidden node are proposed. One can compose wavelet functions as activation functions in the WNN by determining the scale and center of wavelet function. In this paper, when we compose the WNN using wavelet functions, we set a single scale function as a node function together. We intend that one scale function approximates the target function roughly, the other wavelet functions approximate it finely During the determination of the parameters, the wavelet functions can be determined by the global search for solutions suitable for the suggested problem using the genetic algorithm and finally, we use the back-propagation algorithm in the learning of the weights.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2285-2301
• /
• 2012

Peer-to-Peer (P2P) networks are becoming more and more popular in video content delivery services, such as Video on Demand (VoD). Scalability feature of P2P allows a higher number of simultaneous users at a given server load and bandwidth to use stream service. However, the quality of service (QoS) in these networks is difficult to be guaranteed because of the free-riding problem that nodes download the recourses while never uploading recourses, which degrades the performance of P2P VoD networks. In this paper, a distributed trust model is designed to reduce node's free-riding phenomenon in P2P VoD networks. In this model, the P2P network is abstracted to be a super node hierarchical structure to monitor the reputation of nodes. In order to calculate the reputation of nodes, the Hidden Markov Model (HMM) is introduced in this paper. Besides, a distinction algorithm is proposed to distinguish the free-riders and malicious nodes. The free-riders are the nodes which have a low frequency to free-ride. And the malicious nodes have a high frequency to free-ride. The distinction algorithm takes different measures to response to the request of these two kinds of free-riders. The simulation results demonstrate that this proposed trust model can improve QoS effectively in P2P VoD networks.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.8
• /
• pp.39-47
• /
• 2011

Ergezinger's method, one of the layer-by-layer algorithms used for multilyer perceptrons, consists of an output node and can make premature saturations in the output's weight because of using linear least squared method in the output layer. These saturations are obstacles to learning time and covergence. Therefore, this paper expands Ergezinger's method to be able to use an output vector instead of an output node and introduces a learning rate to improve learning time and convergence. The learning rate is a variable rate that reflects the correlation coefficient between new weight and previous weight while updating hidden's weight. To compare the proposed method with Ergezinger's method, we tested iris recognition and nonlinear approximation. It was found that the proposed method showed better results than Ergezinger's method in learning convergence. In the CPU time considering correlation coefficient computation, the proposed method saved about 35% time than the previous method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.6
• /
• pp.47-52
• /
• 2002

The wavelet functions are originated from scaling functions and can be used as activation function in the hidden node of the network by deciding two parameters such as scale and center. In this paper, we would like to propose the mixed structure. When we compose the WNN using wavelet functions, we propose to set a single scale function as a node function together. The properties of the proposed structure is that while one scale function approximates the target function roughly, the other wavelet functions approximate it finely. During the determination of the parameters, the wavelet functions can be determined by the global search algorithm such as genetic algorithm to be suitable for the suggested problem. Finally, we use the back-propagation algorithm in the learning of the weights.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.808-811
• /
• 2015

Cognitive radio has been proposed as a promising dynamic spectrum allocation paradigm. In cognitive radio, spectrum sensing is a fundamental procedure that enables secondary users (unlicensed) employing unused portion of spectrum of primary users (licensed) without causing harmful interference. However, the performance of single-user spectrum-sensing scheme was limited by fading, noise uncertainty shadowing and hidden node problem. Cooperative spectrum sensing was proposed to mitigate these problem. In this paper, we observe cooperative sensing scheme with energy detection using three adaptive thresholds for local decision, which can mitigate sensing failure problem and improve sensing performance at local node. In cooperative scheme we employed OR rules as decision combining at fusion center. We evaluate our scheme through computer simulation, and the results show that with OR combination rule our scheme can achieve best performance than other schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.4
• /
• pp.1293-1316
• /
• 2021

Using directional antennas in wireless Ad hoc networks has many superiorities, including reducing interference, extending transmission range, and increasing space division multiplexing. However, directional transmission introduces two problems: deafness and directional hidden terminals problems. We observe that these problems result in saturation throughput disparity among the competing flows in directional CSMA/CA based Ad hoc networks and bring challenges for modeling the saturation throughput of the flows. In this article, we concentrate on how to model and analyze the saturation throughput disparity of different flows in directional CSMA/CA based Ad hoc networks. We first divide the collisions occurring in the transmission process into directional instantaneous collisions and directional persistent collisions. Then we propose a four-dimensional Markov chain to analyze the transmission state for a specific node. Our model has three different kinds of processes, namely back-off process, transmission process and freezing process. Each process contains a certain amount of continuous time slots which is defined as the basic time unit of the directional CSMA/CA protocols and the time length of each slot is fixed. We characterize the collision probabilities of the node by the one-step transition probability matrix in our Markov chain model. Accordingly, we can finally deduce the saturation throughput for each directional data stream and evaluate saturation throughput disparity for a given network topology. Finally, we verify the accuracy of our model by comparing the deviation of analytical results and simulation results.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.289-292
• /
• 2005

IEEE802.11 DCF에서는 hidden node문제를 해결하기 위하여 RTS/CTS 교환을 사용한다. 그러나 실제로는 전송에 필요한 파워보다 간섭을 일으킬 수 있는 파워가 작다. 따라서 RTS나 CTS를 받지 않은 노드에서 전송을 시작할 경우에도 간섭에 의해 충돌이 발생할 수 있다. 멀티홉 애드혹 환경에서는 이 현상이 더 큰 성능 저하를 불러 일으킬 수 있다. 본 논문에서는 기존의 RTS/CTS 교환에서 CTS를 받은 노드들이 STS 패킷을 보내고 STS를 받은 노드가 자신이 전송을 시작할 경우 데이터를 받는 노드에서의 간섭 효과를 계산해 간섭 효과가 클 경우 전송을 지연시키는 과정을 추가하였다. 따라서 간섭에 의한 충돌이 발생하지 않도록 하였다. 또한 시뮬레이션 결과를 통하여 이 방식이 멀티홉 애드혹 환경에서 성능을 향상 시켰음을 보였다.