• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.81-85
• /
• 2008

The INMARSAT is able to long range maritime communications that can not use for expensive charge in small ship. Additional an opinion of unuseful NBDP that is international discussion for replacement methods for the effective data communications by using HF band. A feature of HF band communication is ionospheric propagation that have not the distance question as A2, A3 and A4 sea areas. Therefore all navigation ship should has supplied service such as MSI, VMS, E-mail beside of distress and public communication that is demanded a design of communication sequence for using SSB transceiver. This paper has designed the new packet and communication sequence of truly and automatically radio link for maritime data communications by SSB in HF band.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.195-208
• /
• 2005

Recently, amount of the data such as sequences is being increased rapidly due to deploying computational technique and advance of experiment tools in the biological areas. In bioinformatics, it is very significant to extract the knowledge from such huge biological data. Sequence comparisons are most frequently used to predict the function of the genes or proteins. However it takes so much time to process the persistently increasing data In this paper, we propose hardware-based grid, CGRID(Chungbuk National University GRID), to improve performance and complement existing middleware-only approach and apply it in the sequence comparison. Hardware-based approach is easy to construct, maintain, and manage the grid as not requiring the software installation individually for every node. We reduce orthologous database construction time from 33 weeks to just a week. Furthermore, CGRID guarantees that the performance increases proportionally as adding the nodes.

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.408-417
• /
• 2004

Genome analysis process requires several steps of various software analysis tools. We propose WGAT(Web-based Genome Analysis Tool), which combines several tools for gene analysis and provides a graphic user interface for users. Software tools related to gene analysis are based on Linux or Unix oriented program, which is difficult to install and use for biologists. Furthermore, files generated from gene analysis frequently require manual transformation for next step input file. Web-based tools which are recently developed process orily one sequence at a time. So it needs many repetitive processes to analyze large size data file. WGAT is developed to support Web-based genome analysis for easy use as well as fast service for users. Whole genome data analysis can be done by running WGAT on Linux server and giving sequence data files with various options. Therefore many steps of the analysis can be done automatically by the system. Simulation shows that WGAT method gives 20 times faster analysis when sequence segment is one thousand.

• Korean Journal of Plant Taxonomy
• /
• v.32 no.4
• /
• pp.449-465
• /
• 2002

A systematic review for Korean Liliopsida was carried out with rbcL and atpB sequence data. Congruent phylogenetic trees were obtained from two different data sets. Korean Liliopsida consists of the three orders, Asparagales, Liliales, and Dioscoreales sensu Dahlgren et al. Members of Dioscoreales were used as an outgroup for inferring relationships among Asparagales and Liliales in the molecular studies. Iridaceae showed close relationship to Asparagales both in the rbcL and atpB sequence trees rather than to Liliales. Family Nartheciaceae (previously included within Melanthiaceae s. lat.) appeared as a paraphyletic assemblage basal within Liliales, but did not show relationships to other orders. Genera of Ruscaceae (previously Convallariaceae) like Disporum, Clintonia, and Streptopus had to be transferred to Colchicaceae, Liliaceae, and Calochortaceae, respectively. A revised list of families for Korean members of Liliopsida is suggested.

• Archives of Pharmacal Research
• /
• v.25 no.1
• /
• pp.11-24
• /
• 2002

The antitumor antibiotic (+)-CC-1065 can alkylate N3 of guanine in certain sequences. A previous high-field $^1H$ NMR study on the$(+)-CC-1065d[GCGCAATTG*CGC]_2$ adduct ($^*$ indicates the drug alkylation site) showed that drag modification on N3 of guanine results in protonation of the cross-strand cytosine [Park, H-J.; Hurley, L. H. J. Am. Chem. Soc.1997, 119,629]. In this contribution we describe a further analysis of the NMR data sets together with restrained molecular dynamics. This study provides not only a solution structure of the (+)-CC-1065(N3- guanine) DNA duplex adduct but also new insight into the molecular basis for the sequence- specific interaction between (+)-CC-1065 and N3-guanine in the DNA duplex. On the basis of NOESY data, we propose that the narrow minor groove at the 7T8T step and conformational kinks at the junctions of 16C17A and 18A19T are both related to DNA bending in the drugDNA adduct. Analysis of the one-dimensional $^1H$ NMR (in $H_2O$) data and rMD trajectories strongly suggests that hydrogen bonding linkages between the 8-OH group of the (+)-CC-1065 A-sub-unit and the 9G10C phosphate via a water molecule are present. All the phenomena observed here in the (+)-CC-1065(N3-guanine) adduct at 5'$-AATTG^*$are reminiscent of those obtained from the studies on the (+)-CC-1065(N3-adenine) adduct at $5'-AGTTA^*$, suggesting that (+)-CC-1065 takes advantage of the conformational flexibility of the 5'-TPu step to entrap the bent structure required for the covalent bonding reaction. This study reveals a common molecular basis for (+)-CC-1065 alkylation at both $5'-TTG^*$ and $5'-TTA^*$, which involves a trapping out of sequence-dependent DNA conformational flexibility as well as sequence-dependent general acid and general base catalysis by duplex DNA.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1565-1570
• /
• 2014

In networking communication, nodes and base station send data to each nodes and destination nodes. In this perspective, it is very important to determine the direction in which data sent to each nodes or destination nodes. Ad-hoc routing protocol is a standard routing protocol that determines how the packets sent to destination. Ad-hoc routing protocol includes protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). In our efficient proposed protocol based on small end-to-end sequence numbers, route direction can be changed properly with the assistance of helper nodes. In this paper, we focus on the simulation analysis of proposed protocol and comparison with other routing protocol models such as AODV and DSR. We simulated using Network Simulator (NS-2) by parameters such as simulation time, number of nodes and packet size based on our metrics (packet delivery fraction, routing load, data throughput). Our proposed protocol based on small end-to-end sequence numbers shows better performance and superior to other two protocols.

• Journal of Convergence for Information Technology
• /
• v.12 no.2
• /
• pp.47-53
• /
• 2022

Recently, with the change of the intelligent security paradigm, study to apply various information generated from various information security systems to AI-based anomaly detection is increasing. Therefore, in this study, in order to convert log-like time series data into a vector, which is a numerical feature, the CBOW and Skip-gram inference methods of deep learning-based Word2Vec model and statistical method based on the coincidence frequency were used to transform the published ADFA system call data. In relation to this, an experiment was carried out through conversion into various embedding vectors considering the dimension of vector, the length of sequence, and the window size. In addition, the performance of the embedding methods used as well as the detection performance were compared and evaluated through GRU-based anomaly detection model using vectors generated by the embedding model as an input. Compared to the statistical model, it was confirmed that the Skip-gram maintains more stable performance without biasing a specific window size or sequence length, and is more effective in making each event of sequence data into an embedding vector.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.137-144
• /
• 2013

A sequential pattern mining is finding out frequent patterns from the data set in time order. In this field, a dynamic weighted sequential pattern mining is applied to a computing environment that changes depending on the time and it can be utilized in a variety of environments applying changes of dynamic weight. In this paper, we propose a new sequence data mining method to explore the stream data by applying the dynamic weight. This method reduces the candidate patterns that must be navigated by using the dynamic weight according to the relative time sequence, and it can find out frequent sequence patterns quickly as the data input and output using a hash structure. Using this method reduces the memory usage and processing time more than applying the existing methods. We show the importance of dynamic weighted mining through the comparison of different weighting sequential pattern mining techniques.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.2
• /
• pp.97-110
• /
• 2012

High performance sensors and modern data logging technology with real-time telemetry facilitate system fault diagnosis in a very precise manner. Fault detection, isolation and identification in fault diagnosis systems are typical steps to analyze the root cause of failures. This systematic failure analysis provides not only useful clues to rectify the abnormal behaviors of a system, but also key information to redesign the current system for retrofit. The main barriers to effective failure analysis are: (i) the gathered data (event) logs are too large in general, and further (ii) they usually contain noise and redundant data that make precise analysis difficult. This paper therefore applies suitable pre-processing techniques to data reduction and feature extraction, and then converts the reduced data log into a new format of event sequence information. Finally the event sequence information is decoded to investigate the correlation between specific event patterns and various system faults. The efficiency of the developed pre-filtering procedure is examined with a terminal box data log of a marine diesel engine.

• Journal of IKEEE
• /
• v.21 no.2
• /
• pp.142-145
• /
• 2017

Currently, a trend in image processing is high-quality and high-resolution. The size and amount of image data are increasing exponentially because of the development of information and communication technology. Thus, license plate recognition with a single processor cannot handle the increasing data. This paper proposes a number plate recognition system using a distributed processing framework, Hadoop. Using SequenceFile format in Hadoop, each mapper performs a license plate recognition with a number of image data in a data block Experimental results show that license plate recognition performance with 16 data nodes accomplishes speedup of maximum 14.7 times comparing with one data node. In large dataset, the recognition performance is robust even if the number of data nodes increases gradually.