• The Journal of Society for e-Business Studies
• /
• v.6 no.2
• /
• pp.87-99
• /
• 2001

Along with the rapid emergence of the Internet and e-commerce, online auctions are hitting the spotlights. The inconveniences found in off-line auctions, such as time and place restriction and limited number of items, are solved in the online auction. However, not so many auction sites have integrated auction information systems, which monitor the present status of auctions, resulting in greater inconvenience for the online auction users. Moreover, there is no auction site that suggests the appropriate starting or closing price that is useful for users when they make, their bids, What the online auction users need is an auction system that can solve such problems. This study is purported for solving the problems by designing and implementing a real time auction system that applies the comparison search functions and the agent functions. In other words, an integrated database system using a bidder-oriented agent for providing information is built so that the users can search and compare the information on the item they are interested in and make a faster and more accurate purchase. Also the appropriate starting and closing prices are offered to the sellers and bidders through the integrated system for a closer and more accurate comparison and analysis of the prices. For future work, the product recommendation service, which accurately reflects the bidding patterns, and the methods for studying the multi bidding pattern will be applied to the suggested system to realize a real time auction information system that supports CRM(Customer Relationship Management) .

• The Journal of Society for e-Business Studies
• /
• v.8 no.2
• /
• pp.49-62
• /
• 2003

Along with the national and international movements to realize the electronic commerce, large amount of architectural information has been converted into digital format and stored in database systems. However the access and utilization of the information is not effective enough. It is because different terminologies are often used for describing the same object in architectural engineering. Furthermore the relationship among related objects is not captured effectively in the databases. In this paper, we utilize the relationship among architectural terminologies in order to search architectural drawings effectively. The relationship is saved in a ontology database and a prototype of search system that utilizes the relationship is presented in this paper.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.10
• /
• pp.1044-1049
• /
• 2006

Multiple sequence alignment is a method to compare two or more DNA or protein sequences. Most of multiple sequence alignment tools rely on pairwise alignment and Smith-Waterman algorithm to generate an alignment hierarchy. Therefore, in the existing multiple alignment method as the number of sequences increases, the runtime increases exponentially. In order to remedy this problem, we adopted a parallel processing suffix tree algorithm that is able to search for common subsequences at one time without pairwise alignment. Also, the cross-matching subsequences triggering inexact-matching among the searched common subsequences might be produced. So, the cross-matching masking process was suggested in this paper. To identify the function of the clusters generated by suffix tree clustering, BLAST and CDD (Conserved Domain Database)search were combined with a clustering tool. Our clustering and annotating tool consists of constructing suffix tree, overlapping common subsequences, clustering gene sequences and annotating gene clusters by BLAST and CDD search. The system was successfully evaluated with 36 gene sequences in the pentose phosphate pathway, clustering 10 clusters, finding out representative common subsequences, and finally identifying functional domains by searching CDD database.

• Journal of Intelligence and Information Systems
• /
• v.10 no.3
• /
• pp.27-37
• /
• 2004

XML has been proposed as a document standard for the representation and exchange of data on the WWW, and also becoming a standard for the search and reuse of scattered documents. When implementing a XML contents management system, special consideration should be imposed on how to model data and how to store the modelled data for effective and efficient management of the semi-structured data. In this paper, we proposed a new data model for the storage and search of XML document data. This proposed data model could represent both of data and structure views of XML documents, and be applied to the new data system for XML documents as well as the existing data systems.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.65-74
• /
• 2021

Digital image processing and retrieving have increasingly become very popular on the Internet and getting more attention from various multimedia fields. That results in additional privacy requirements placed on efficient image matching techniques in various applications. Hence, several searching methods have been developed when confidential images are used in image matching between pairs of security agencies, most of these search methods either limited by its cost or precision. This study proposes a secure and efficient method that preserves image privacy and confidentially between two communicating parties. To retrieve an image, feature vector is extracted from the given query image, and then the similarities with the stored database images features vector are calculated to retrieve the matched images based on an indexing scheme and matching strategy. We used a secure content-based image retrieval features detector algorithm called Speeded-Up Robust Features (SURF) algorithm over public cloud to extract the features and the Honey Encryption algorithm. The purpose of using the encrypted images database is to provide an accurate searching through encrypted documents without needing decryption. Progress in this area helps protect the privacy of sensitive data stored on the cloud. The experimental results (conducted on a well-known image-set) show that the performance of the proposed methodology achieved a noticeable enhancement level in terms of precision, recall, F-Measure, and execution time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.848-854
• /
• 2015

There are a lot of encryption methods to secure database proposed recently. Those encryption methods can protect the sensitive data of users effectively, but it deteriorates the search performance of database query. In this paper, we proposed the selective element encryption method in order to complement those drawbacks. In addition, we compared the performance of the proposed method with that of tuple level encryption method using the various queries. As a result, we found that the proposed method, which use the selective element encryption with bloom filter as a index, has better performance than the other encryption method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.5
• /
• pp.1929-1943
• /
• 2021

Millimeter wave (mmWave) communication based on the wide bandwidth of >28 GHz is one of the key technologies for cellular-connected unmanned aerial vehicles (UAVs). The selection of mmWave beams in such cellular-connected UAVs is challenging and critical, especially when downlink transmissions toward aerial user equipment (UE) suffer from poor signal-to-interference-plus-noise ratio (SINR) more often than their terrestrial counterparts. This study proposed a coordinated mmWave beam selection scheme using fingerprint for cellular-connected UAV. The scheme comprises fingerprint database configuration and coordinated beam selection. In the fingerprint database configuration, the best beam index from the serving cell and interference beam indexes from neighboring cells are stored. In the coordinated beam selection, the best and interference beams are determined using the fingerprint database information instead of performing an exhaustive search, and the coordinated beam transmission improves the SINR for aerial UEs. System-level simulations assess the UAV effect based on the third-generation partnership project-new radio mmWave and UAV channel models. Simulation results show that the proposed scheme can reduce the overhead of exhaustive search and improve the SINR and spectral efficiency.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.40-48
• /
• 2021

Content-Based Image Retrieval (CBIR) system plays a vital role to retrieve the relevant images as per the user perception from the huge database is a challenging task. Images are represented is to employ a combination of low-level features as per their visual content to form a feature vector. To reduce the search time of a large database while retrieving images, a novel image retrieval technique based on feature dimensionality reduction is being proposed with the exploit of metaheuristic optimization techniques based on Genetic Algorithm (GA), Extended Binary Cuckoo Search (EBCS) and Whale Optimization Algorithm (WOA). Each image in the database is indexed using a feature vector comprising of fuzzified based color histogram descriptor for color and Median binary pattern were derived in the color space from HSI for texture feature variants respectively. Finally, results are being compared in terms of Precision, Recall, F-measure, Accuracy, and error rate with benchmark classification algorithms (Linear discriminant analysis, CatBoost, Extra Trees, Random Forest, Naive Bayes, light gradient boosting, Extreme gradient boosting, k-NN, and Ridge) to validate the efficiency of the proposed approach. Finally, a ranking of the techniques using TOPSIS has been considered choosing the best feature selection technique based on different model parameters.

• Journal of Preventive Medicine and Public Health
• /
• v.57 no.1
• /
• pp.1-7
• /
• 2024

Objectives: Adjusting for potential confounders is crucial for producing valuable evidence in outcome studies. Although numerous studies have been published using the Korea National Health Insurance Claim Database, no study has critically reviewed the methods used to adjust for confounders. This study aimed to review these studies and suggest methods and applications to adjust for confounders. Methods: We conducted a literature search of electronic databases, including PubMed and Embase, from January 1, 2021 to December 31, 2022. In total, 278 studies were retrieved. Eligibility criteria were published in English and outcome studies. A literature search and article screening were independently performed by 2 authors and finally, 173 of 278 studies were included. Results: Thirty-nine studies used matching at the study design stage, and 171 adjusted for confounders using regression analysis or propensity scores at the analysis stage. Of these, 125 conducted regression analyses based on the study questions. Propensity score matching was the most common method involving propensity scores. A total of 171 studies included age and/or sex as confounders. Comorbidities and healthcare utilization, including medications and procedures, were used as confounders in 146 and 82 studies, respectively. Conclusions: This is the first review to address the methods and applications used to adjust for confounders in recently published studies. Our results indicate that all studies adjusted for confounders with appropriate study designs and statistical methodologies; however, a thorough understanding and careful application of confounding variables are required to avoid erroneous results.

• Journal of Information Management
• /
• v.26 no.1
• /
• pp.80-98
• /
• 1995

Search strategies is a means to make an efficient search. Among several studies of search strategy, Bates' $\ulcorner$Search Tactics$\lrcorner$ has been often cited and introduced, but their studies have been superficial. In this paper, the contents of Bates' $\ulcorner$Search Tactics$\lrcorner$ are examined in detail, and we try to represent the actual online search process based upon Bates' $\ulcorner$Search Tactics$\lrcorner$. The following three kinds of survey are made in order to clarify which and how tactics are used: (1) Interview with 7 searchers who belong to different types of organizations, and use different kinds of databases (2) Analysis of some online search records. (3) Analysis of written applications for a newspaper database during one year. In conclusion, Bates' tactics falls into categories and new several tactics which often used are added. The following five factors affect online search activities, search strategy, and search tactics. (1) the difficulty of search requests (2) the kinds of databases (3) the charging policy for each online search (4) the presence of the user during the search (5) the searcher' online experience In the limited condition, typical tactics are suggested, but in order to generalize the pattern of using tactics, further investigation is necessary.