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

Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in many applications. So, the management and analysis of spatio-temporal data are a hot issue in database research. Index structure and query processing of such contents are very important for these applications. This paper addressees algorithms that make index structure by using Douglas-Peucker Algorithm and process nearest neighbor search query efficiently on moving objects trajectories. We compare and analyze our algorithms by experiments. Our algorithms make small size of index structure and process the query more efficiently.

• Interdisciplinary Bio Central
• /
• v.4 no.4
• /
• pp.11.1-11.8
• /
• 2012

Genes that are indispensable for survival are referred to as essential gene. Due to the momentous significance of these genes for cellular activity they can be selected potentially as drug targets. Here in this study, an essential gene for Streptococcus suis was predicted using coherent statistical analysis and powerful genome comparison computational method. At first the whole genome protein scatter plot was generated and subsequently, on the basis of statistical significance, a reference genome was chosen. The parameters set forth for selecting the reference genome was that the genome of the query (Streptococcus suis) and subject must fall in the same genus and yet they must vary to a good degree. Streptococcus pneumoniae was found to be suitable as the reference genome. A whole genome comparison was performed for the reference (Streptococcus pneumoniae) and the query genome (Streptococcus suis) and 14 conserved proteins from them were subjected to a screen for potential essential gene property. Among those 14 only one essential gene was found to be with impressive similarity score between reference and query. The essential gene encodes for a type of 'Clp protease'. Clp proteases play major roles in degrading misfolded proteins. Results found here should help formulating a drug against Strptococcus suis which is responsible for mild to severe clinical conditions in human. However, like many other computational studies, the study has to be validated furthermore through in vitro assays for concrete proof.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.927-930
• /
• 2010

Recently, continuous k-nearest neighbor query(CkNN) which is defined as a query to find the nearest points of interest to all the points on a given path is widely used in the LBS(Location Based Service) and ITS(Intelligent Transportation System) applications. It is necessary to acquire results quickly in the above applications and be applicable to spatial network databases. This paper proposes a new method to search nearest POIs(Point Of Interest) for moving query objects on the spatial networks. The method produces a set of split points and their corresponding k-POIs as results. There is no order between the POIs. The analysis show that the proposed method outperforms the existing methods.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.4
• /
• pp.37-50
• /
• 2003

In the paper, we describe the query extension techniques for spatiotemporal query functionalities on object-relational DBMS. The spatial objects in real world change the shapes over time. Spatiotemporal databases support to manage a temporal dimension as well as a spatial dimension for history of the objects. The proposed techniques can make conventional object-relational databases to support spatiotemporal databases system by the implementation and inheritance of abstract data types. We define and implement spatial and temporal classes as superclass. And, spatiotemporal classes inherits and extends the classes. The proposed extensions make it easy that conventional database systems not only are transformed into the spatiotemporal database systems, but also do not need to be changed to support spatiotemporal applications.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.2
• /
• pp.303-311
• /
• 2015

DNS amplification is a new type of DDoS Attack and nowadays the attack occurs frequently. The previous studies showed the several detection ways such as the traffic analysis based on DNS queries and packet size. However, those methods have some limitations such as the uncertainty of packet size which depends on IP address type and vulnerabilities against distributed amplification attack. Therefore, we proposed a novel traffic analyzing algorithm using Success Rate and implemented the query analyzing system.

• The Journal of the Korea Contents Association
• /
• v.8 no.4
• /
• pp.48-54
• /
• 2008

This paper analyzes cost tradeoffs between memory usage and computation for window-based operators in data stream environments. It identifies generic operator network constructs, and sets up a cost model for the estimation of the expected memory reduction and the computation overheads when window memory relocations are applied to each operator network construct. This cost model helps to identify the utility of window memory relocations. It also helps to apply window memory relocation to improve a query execution plan to save memory usage. The proposed approach contributes to expand the scope of query processing and optimization in data stream environments. It also provides a basis to develop a cost estimation model for the query optimization using window memory relocations.

• The Journal of the Korea Contents Association
• /
• v.11 no.4
• /
• pp.67-73
• /
• 2011

The image retrieval generally shows the same or similar images to a query image as a result. In the case of rotated image, however, its performance tends to be debased significantly. We propose a method to ensure a reliable image retrieval of rotated images as follows; First, to obtain feature points of query/DB images by Harris Corner Detector; and then, utilizing the feature points, to find the object's axis and query/DB images into rotation invariant images with Principal Components Analysis algorithm. We have experimented with 6,000 natural images which are 256 pixels in diameter. They are 1,000 Wang's images and their rotated images by $30^{\circ}$, $45^{\circ}$, $90^{\circ}$, $135^{\circ}$ and $180^{\circ}$. The simulation results show that the proposed method retrieves rotated images more effectively than the conventional method.

• CRM연구
• /
• v.2 no.2
• /
• pp.53-70
• /
• 2009

Understanding consumer behavior based on the analysis of the customer data is one essential part of analytic CRM. To do this, the analytic skills for data extraction and data processing are required to users. As a user has various kinds of questions for the consumer data analysis, the user should use database language such as SQL. However, for the firm's user, to generate SQL statements is not easy because the accuracy of the query result is hugely influenced by the knowledge of work-site operation and the firm's database. This paper proposes a natural language based database search framework finding relevant database elements. Specifically, we describe how our TableRank method can understand the user's natural query language and provide proper relations and attributes of data records to the user. Through several experiments, it is supported that the TableRank provides accurate database elements related to the user's natural query. We also show that the close distance among relations in the database represents the high data connectivity which guarantees matching with a search query from a user.

• Food Science of Animal Resources
• /
• v.34 no.5
• /
• pp.656-664
• /
• 2014

The purpose of this study was to analyze myosin heavy chain (MHC) isoforms in bovine longissimus thoracis (LT) muscle by liquid chromatography (LC) and mass spectrometry (MS). LT muscles taken from Hanwoo (Korean native cattle) steer (n=3) used to separate myosin bands by sodium dodecyl sulfate-polyacrylamide gel electrophoresis. The peptide queries were obtained from the myosin bands by LC-MS/MS analysis following in-gel digestion with trypsin. A total of 33 and 43 queries were identified as common and unique peptides, respectively, of MHC isoforms (individual ions scores >43 indicate identity or extensive homology, p<0.05). MHC-1 (IIx), -2 (IIa), -4 (IIb), and -7 (slow/I) were identified based on the Mowse score (5118, 3951, 2526, and 2541 for MHC-1, -2, -4, and -7, respectively). However, more analysis is needed to confirm the expression of MHC-4 in bovine LT muscle because any query identified as a unique peptide of MHC-4 was not found. The queries that were identified as unique peptides could be used as peptide markers to confirm MHC-1 (14 queries), -2 (8 queries), and -7 (21 queries) in bovine LT muscle; no query identified as a unique peptide of MHC-4 was found. LC-MS/MS analysis is a useful approach to study MHC isoforms at the protein level.

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

RFID(Radio frequency IDentification) leader is collision of data, when recognizing the multiple tag the inside area. This collision became the cause which delays the tag recognition time of the leader. The protocol which prevents the delay of tag recognition time of the leader the place where representative it uses QT(Query Tree) algorithms, it uses a collision bit position from this paper and are improved QT-MTC(Query Tree with Multi-Tag Cognition) algorithms which it proposes. This algorithm stored the bit position which bit possibility and the collision where the collision happens occurs in the stack and goes round a tree the number of time which, it reduced could be identified two tags simultaneously in order, it was planned. A result of performance analysis, It compared in QT protocols and the this algorithm against the tag bit which is continued a tush efficiency improvement effect was visible.