• Journal of Digital Contents Society
• /
• v.10 no.2
• /
• pp.349-355
• /
• 2009

MANET is network that attach importance to not only service of large network as internet but also support of communication among each nodes because infrastructure constitution is disadvantage economically or difficult physically. The most important part in protection of systems constitute MANET is that authenticate each nodes securely and offer reliable service. Well defined routing technique is necessity to this. In this paper, in order to offer safe service, we compare capacity of present security routing protocol, analyze to solve weakness of existing on-demand routing protocol and existing routing protocol and argue with study course of hereafter security routing protocol.

• Journal of Korea Water Resources Association
• /
• v.36 no.2
• /
• pp.143-152
• /
• 2003

This paper suggests the improvement of the Sumjinkang for the estimation of areal averages of heavy rainfall events based on the optimal network and three existing networks. The problem consists of minimizing an objective function which includes both the accuracy of the areal mean estimation as expressed by the Kriging variance and the economic cost of the data collection. The wellknown geostatistical variance-reduction method is used in combination with SATS which is an algorithm of minimization. At the first stage, two kinds of optimal solutions are obtained by two trade-off coefficients. One of them is a optimal solution, the other is an alternative. At the second stage, a quasi optimal network and a quasi alternative are suggested so that the existing raingages near to the selected optimal raingages are included in the two solutions instead of gages of new gages.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.6
• /
• pp.1393-1401
• /
• 2019

Recently as voice authentication function is installed in the system, it is becoming more important to accurately authenticate speakers. Accordingly, a model for verifying speakers in various ways has been suggested. In this paper, we propose a new method for verifying speaker verification using a Short-time Fourier Transform(STFT). Unlike the existing Mel-Frequency Cepstrum Coefficients(MFCC) extraction method, we used window function with overlap parameter of around 66.1%. In this case, the speech characteristics of the speaker with the temporal characteristics are studied using a deep running model called RNN (Recurrent Neural Network) with LSTM cell. The accuracy of proposed model is around 92.8% and approximately 5.5% higher than that of the existing speaker certification model.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.529-534
• /
• 2006

New geocentric geodetic datum has recently been realized in Korea, Korean Geodetic Datum 2002- KGD2002, to overcome problems due to the existing Tokyo datum, which had been used in this country since early 20th century. This transition will support modern surveying techniques, such as Global Navigation Satellite Systems (GNSS) and ensures that spatial data is compatible with other international systems. For this realization, very long baseline interferometry (VLBI) observations were initially carried out in 1995 to determine the coordinates of the origin of KGD2002 based on the International Terrestrial Reference Frame (ITRF). Continuous GPS observations were collected from 14 reference stations across Korea to compute the coordinates of 1st order horizontal geodetic control points. During the campaign, GPS observations were also collected at about 9,000 existing geodetic control points. In 2006, network adjustment with all data obtained using GPS and EDM since 1975 has been performed under the condition of fixing the coordinates of GPS continuous observation stations to compute coordinate measurements of the 2nd and 3rd geodetic control points. This paper describes the GPS campaigns which have been undertaken since 1996 and details of the network adjustment schemes. This is followed

• IE interfaces
• /
• v.19 no.1
• /
• pp.26-33
• /
• 2006

Many Firms consider the application of a cross-docking system to reduce inventory and lead-time. However, most studies mainly concentrate on the design of a cross-docking system. This study presents the method that selects the cross-docking center under the existing logistics network. Describing the operation environment to apply the cross-docking system, the selection criteria of the cross-docking center, and the main constraints of transportation planning under the environment of multi-level logistics network, we define the selection problem of the cross-docking center applied to a logistics field. We also define the simulation model that can analyze variously the cross-docking volume and develop the selection methodology of the cross-docking center. The simulation model presents the algorithm and influence factors of the cross-docking system, the decision criteria of the system, policy parameter, and input data. In addition, this study analyzes the effect of increasing the number of simultaneous receiving and shipping docks, and the efficiency of the overnight transportation and cross-docking by evaluating each scenario after simulating the scenarios with the practical data of the logistics field.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.19-30
• /
• 2008

Recently, the query processing algorithm in the field of spatial network database(SNDB) has been attracted by many Interests. But, there is little research on route-based queries. Since the moving objects move only in spatial networks, the efficient route-based query processing algorithms, like in-route nearest neighbor(IRNN), are essential for Location-based Service(LBS) and Telematics application. However, the existing IRNN query processing algorithm has a problem that it does not consider traffic jams in the road network. In this thesis, we propose an IRNN query processing algorithm which considers space restriction. Finally, we show that space-constrained IRNN query processing algorithm is efficient compared with the existing IRNN algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.609-611
• /
• 2014

Was developed of the web service in Due to the dissemination for IT skills development and smart appliances. In particular, Social network service for should be able to communicate feel free to a user across without distinguishing between production and consumption information in contrast to the existing web service. And strengthen to the information sharing relationships between existing human relation and new human relation. In this paper, a social network service in providing a social networking from users using their communication and information sharing is used to collect and analyze in the keyword. And a design of recommended system of movies for appropriate keyword.

• Nuclear Engineering and Technology
• /
• v.51 no.2
• /
• pp.424-431
• /
• 2019

The aim of the present study was to develop model for detonation cell sizes prediction based on a deep artificial neural network of hydrogen, methane and propane mixtures with air and oxygen. The discussion about the currently available algorithms compared existing solutions and resulted in a conclusion that there is a need for a new model, free from uncertainty of the effective activation energy and the reaction length definitions. The model offers a better and more feasible alternative to the existing ones. Resulting predictions were validated against experimental data obtained during the investigation of detonation parameters, as well as with data collected from the literature. Additionally, separate models for individual mixtures were created and compared with the main model. The comparison showed no drawbacks caused by fitting one model to many mixtures. Moreover, it was demonstrated that the model may be easily extended by including more independent variables. As an example, dependency on pressure was examined. The preparation of experimental data for deep neural network training was described in detail to allow reproducing the results obtained and extending the model to different mixtures and initial conditions. The source code of ready to use models is also provided.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.17-26
• /
• 2022

Sensor Nodes play a major role to monitor and sense the variations in physical space in various real-time application scenarios. These nodes are powered by limited battery resources and replacing those resource is highly tedious task along with this it increases implementation cost. Thus, maintaining a good network lifespan is amongst the utmost important challenge in this field of WSN. Currently, energy efficient routing techniques are considered as promising solution to prolong the network lifespan where multi-hop communications are performed by identifying the most energy efficient path. However, the existing scheme suffer from performance related issues. To solve the issues of existing techniques, a novel hybrid technique by merging particle swarm optimization and game theory model is presented. The PSO helps to obtain the efficient number of cluster and Cluster Head selection whereas game theory aids in finding the best optimized path from source to destination by utilizing a path selection probability approach. This probability is obtained by using conditional probability to compute payoff for agents. When compared to current strategies, the experimental study demonstrates that the proposed GTPSO strategy outperforms them.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.5
• /
• pp.791-800
• /
• 2022

CCN, which has emerged to overcome the limitations of existing network structures, enables efficient networking by changing the IP Address-based network method to the Content-based network method. At this time, the contents are stored on each node(router) rather than on the top server, and considering the limitation of storage capacity, it is very important to determine which contents to store and release through the cache policy, and there are several cache policies that have been studied so far. In this paper, two of the existing cache policies, producer popularity-based and distance-based, were mixed. In addition, the mixing ratio was set differently to experiment, and we proved which experiement was the most efficient one.