• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.11-14
• /
• 2000

We present an image retrieval method that improves retrieval rate by using the fusion of histogram and wavelet moment features. The key idea is that images similar to a query image are selected in DB by using the wavelet moment features. Then the result images are retrieved from the selected images by using histogram method. In order to evaluate the performance of the proposed method, we use Brodatz texture database, MPEG-7 T1 database and Corel Draw photo. Experimental result shows that the proposed method is better than each of histogram method and wavelet moment method.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.211-214
• /
• 2000

In this paper, we propose a regular-texture image retrieval approach relating In curvature. Maximum curvature and minimum curvature are computed from the query and each regular-texture image in the database. Seven features are computed from curvature characterizing statistical properties of the corresponding image. Each regular-texture image in the database is then represented as the seven CM (curvature measurement)-features. Query comparison and matching can be done using the corresponding CM-features. Experimental results on Brodatz texture show that the proposed approach is effective.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2005.12a
• /
• pp.443-454
• /
• 2005

The purpose of this study is to show the operations and implementations of ASP web database which uses open-source web site packages called bighitonline video shop. Some literature reviews have been done to reveal robust theoretical background for this research And also, some basic experiments as Preparatory Processes have also been made by using some softwares such as Windows XP professional, IIS, MS SQL Server and others. The main purpose of these experiments is to show strong theoretical and practical backgrounds. These experimental results in the micro-level showed to be successful to understand the Interrelations of web components and web-site architectures.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.3
• /
• pp.89-94
• /
• 2011

The image identification methodology associates an image with a unique identifiable representation. Whenever the methodology regenerates an identifier for the same image, moreover, the newly created identifier needs to be consistent in terms of representation value. In this paper, we discuss a methodology for image identifier generation utilizing luminance correlation. We furthermore propose a method for performance enhancement of the image identifier generation. We also demonstrate the experimental evaluations for uniqueness and similarity analysis and performance improvement that have shown favorable results.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.1
• /
• pp.125-134
• /
• 2016

MySQL database is currently used by many users and It has gained a big market share in the database market. Even though MyISAM storage engine was used as a default storage engine before, but records recovery method does not existed. Deleted records have a high possibility for important evidence and it is almost impossible to determine that investigators manually examine large amounts of database directly. This paper suggests the universal recovery method for deleted records and presents the experimental results.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.627-630
• /
• 2006

Sequential Pattern Mining is the mining approach which addresses the problem of discovering the existent maximal frequent sequences in a given databases. In the daily and scientific life, sequential data are available and used everywhere based on their representative forms as text, weather data, satellite data streams, business transactions, telecommunications records, experimental runs, DNA sequences, histories of medical records, etc. Discovering sequential patterns can assist user or scientist on predicting coming activities, interpreting recurring phenomena or extracting similarities. For the sake of that purpose, the core of sequential pattern mining is finding the frequent sequence which is contained frequently in all data sequences. Beside the discovery of frequent itemsets, sequential pattern mining requires the arrangement of those itemsets in sequences and the discovery of which of those are frequent. So before mining sequences, the main task is checking if one sequence is a subsequence of another sequence in the database. In this paper, we implement the subsequence matching method as the preprocessing step for sequential pattern mining. Matched sequences in our implementation are the normalized sequences as the form of number chain. The result which is given by this method is the review of matching information between input mapped sequences.

• Korean Journal of Remote Sensing
• /
• v.22 no.5
• /
• pp.457-462
• /
• 2006

Sequential Pattern Mining is the mining approach which addresses the problem of discovering the existent maximal frequent sequences in a given databases. In the daily and scientific life, sequential data are available and used everywhere based on their representative forms as text, weather data, satellite data streams, business transactions, telecommunications records, experimental runs, DNA sequences, histories of medical records, etc. Discovering sequential patterns can assist user or scientist on predicting coming activities, interpreting recurring phenomena or extracting similarities. For the sake of that purpose, the core of sequential pattern mining is finding the frequent sequence which is contained frequently in all data sequences. Beside the discovery of frequent itemsets, sequential pattern mining requires the arrangement of those itemsets in sequences and the discovery of which of those are frequent. So before mining sequences, the main task is checking if one sequence is a subsequence of another sequence in the database. In this paper, we implement the subsequence matching method as the preprocessing step for sequential pattern mining. Matched sequences in our implementation are the normalized sequences as the form of number chain. The result which is given by this method is the review of matching information between input mapped sequences.

• Computers and Concrete
• /
• v.28 no.5
• /
• pp.441-450
• /
• 2021

This study presents the first analysis system and fast-access cloud database for shrinkage and creep of concrete in the world, named "shrinkage and creep database in Taiwan", SCDT. SCDT not only has the most comprehensive experimental data, including NU, JSCE, Europe, and TW databases, but provides a design tool for researchers and engineers. It can further facilitate the development of prediction models for localized concrete. Users can obtain the shrinkage and creep curves based on their selected prediction models in SCDT. Comparisons of the predicted results of selected models and test results in the chosen database can be generated in seconds. One example of the development of basic creep prediction model in Taiwan based on model B4 by using SCDT to reflect concrete characteristics in Taiwan is also presented in this study. Users anywhere in the world can easily access SCDT to browse and upload data, receive predictive results, or develop predictive models.

• The KIPS Transactions:PartD
• /
• v.8D no.1
• /
• pp.24-31
• /
• 2001

In this paper, we present an advanced transaction scheduling protocol to improve the degree of concurrency and satisfy the security requirements for multilevel secure database. We adapted two-phase locking protocol, namely traditional syntax-oriented serializability notions, to multilevel secure database. Altruistic locking, as an advanced protocol, has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed for extended altruistic locking OffiLl. This is in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. We also adapted XAL to multilevel secure database and we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature for multilevel secure database. Our protocol is based on extended altruistic locking for multilevel secure database (XAL/MLS), but a new method, namely two-way donation locking for multilevel secure database (2DL!/-MLS), is additionally used in order to satisfy security requirements and concurrency. The efficiency of the proposed protocol was verified by experimental results.

• Journal of Information Management
• /
• v.23 no.1
• /
• pp.1-21
• /
• 1992

The importance of factual database is becoming larger and larger as the application of computer in design and processing is increasing. To follow up and support this demand and tendency, construction of factual database is necessary. The goal of this research project is to construct a factual database about the creep properties of high temperature materials. A factual database on the creep properties of 25 kinds of high temperature materials was constructed. Domestically produced data which were appeared in journals, theses, reports, etc., were collected and used as a input data source. Evaluation on these collected data will be done during the 2nd year of this project. In addition to this database construction, an experimental facility to produce creep crack propagation data was set up.