• ETRI Journal
• /
• v.30 no.3
• /
• pp.432-440
• /
• 2008

In this paper, a user-friendly mobile photo album system and albuming functions to support it are introduced. Stand-alone implementation in a mobile device is considered. The main idea of user-friendly photo browsing for albuming functions is to enable users to organize and browse their photos along semantically meaningful axes of events, personal identities, and categories. Experimental results demonstrate that the proposed method would be sufficiently useful and efficient for browsing personal photos in mobile environment.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.653-668
• /
• 2011

This paper presents a new hybrid method for solving nonlinear complementarity problems with $P_0$-functions. It can be regarded as a combination of smoothing trust region method with ODE-based method and line search technique. A feature of the proposed method is that at each iteration, a linear system is only solved once to obtain a trial step, thus avoiding solving a trust region subproblem. Another is that when a trial step is not accepted, the method does not resolve the linear system but generates an iterative point whose step-length is defined by a line search. Under some conditions, the method is proven to be globally and superlinearly convergent. Preliminary numerical results indicate that the proposed method is promising.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1328-1342
• /
• 2013

Searchable encryption is a cryptographic protocol for searching a document in encrypted databases. A simple searchable encryption protocol, which is capable of using only one keyword at one time, is very limited and cannot satisfy demands of various applications. Thus, designing a searchable encryption with useful additional functions, for example, conjunctive keyword search, is one of the most important goals. There have been many attempts to construct a searchable encryption with conjunctive keyword search. However, most of the previously proposed protocols are based on public-key cryptosystems which require a large amount of computational cost. Moreover, the amount of computation in search procedure depends on the number of documents stored in the database. These previously proposed protocols are not suitable for extremely large data sets. In this paper, we propose a new searchable encryption protocol with a conjunctive keyword search based on a linked tree structure instead of public-key based techniques. The protocol requires a remarkably small computational cost, particularly when applied to extremely large databases. Actually, the amount of computation in search procedure depends on the number of documents matched to the query, instead of the size of the entire database.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3699-3719
• /
• 2017

Conjunctive keyword search encryption is an important technique for protecting sensitive personal health records that are outsourced to cloud servers. It has been extensively employed for cloud storage, which is a convenient storage option that saves bandwidth and economizes computing resources. However, the process of searching outsourced data may facilitate the leakage of sensitive personal information. Thus, an efficient data search approach with high security is critical. The multi-user search function is critical for personal health records (PHRs). To solve these problems, this paper proposes a novel multi-user conjunctive keyword search scheme (mNCKS) without a secure channel against keyword guessing attacks for personal health records, which is referred to as a secure channel-free mNCKS (SCF-mNCKS). The security of this scheme is demonstrated using the Decisional Bilinear Diffie-Hellman (DBDH) and Decision Linear (D-Linear) assumptions in the standard model. Comparisons are performed to demonstrate the security advantages of the SCF-mNCKS scheme and show that it has more functions than other schemes in the case of analogous efficiency.

• Journal of the Korea Society for Simulation
• /
• v.25 no.1
• /
• pp.11-20
• /
• 2016

Recently in the field of defense Modeling and Simulation (M&S), Component-Based Development technology is widely applying to save the cost and increase the reusability of weapon system development. Related with this, researches for rapid reconfiguration and simulation of the component-standardized weapon system is actively carrying out. To rapidly reconfigure the new weapon system, complex and various functions of component information has to be effectively searched. So, it requires differentiated search technique unlike existing Keyword-based Search method. Semantic Search System provides semantically related information among the extensive information. In this research, metadata of weapon system components and their representative functional words are built as an ontology. And it provides an ontology-based semantic search system.

• Journal of the Korean Society for Library and Information Science
• /
• v.31 no.3
• /
• pp.75-108
• /
• 1997

The purpose of the article is to help users to select appropriate Korean WWW search tools and to retrieve Web documents for their information needs by using them effectively. It analyzes the characteristics, functions, and advantages and disadvatages of each search tool, while search tools are divided broadly by two categories-subject directory services (Kor-seek, DIR, ZIP, Netquest21, Simmany) and keyword search engines (Simmany, Kachine, Jungbotamjung, Anysearch, Unifinder, Webglider, Missdachanni). It provides the selection criteria of search tools for users who have information needs. In addition, the study also attempts to contribute to the improvements in designing Korean WWW search tools, as investigating their shortcomings.

• Genomics & Informatics
• /
• v.21 no.2
• /
• pp.21.1-21.14
• /
• 2023

Fusobacterium nucleatum is a gram-negative bacteria associated with diverse infections like appendicitis and colorectal cancer. It mainly attacks the epithelial cells in the oral cavity and throat of the infected individual. It has a single circular genome of 2.7 Mb. Many proteins in F. nucleatum genome are listed as "Uncharacterized." Annotation of these proteins is crucial for obtaining new facts about the pathogen and deciphering the gene regulation, functions, and pathways along with discovery of novel target proteins. In the light of new genomic information, an armoury of bioinformatic tools were used for predicting the physicochemical parameters, domain and motif search, pattern search, and localization of the uncharacterized proteins. The programs such as receiver operating characteristics determine the efficacy of the databases that have been employed for prediction of different parameters at 83.6%. Functions were successfully assigned to 46 uncharacterized proteins which included enzymes, transporter proteins, membrane proteins, binding proteins, etc. Apart from the function prediction, the proteins were also subjected to string analysis to reveal the interacting partners. The annotated proteins were also put through homology-based structure prediction and modeling using Swiss PDB and Phyre2 servers. Two probable virulent factors were also identified which could be investigated further for potential drug-related studies. The assigning of functions to uncharacterized proteins has shown that some of these proteins are important for cell survival inside the host and can act as effective drug targets.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.22 no.1
• /
• pp.90-101
• /
• 1998

This paper presents a scheduling method that uses Petri net modeling and heuristic search to handle the tool setup. In manufacturing systems, a tool is attached to a particular machine to process a particular operation. The activity to attach a tool to a particular machine and detach the tool from the machine requires time. The processing time of operations varies according to the attached tool and the machine used. The method proposed in this paper uses Petri net to model these characteristics and applies a search algorithm to the reachability graph of the Petri net model to generate an optimal or near-optimal schedule. New heuristic functions are developed for efficient search. The experimental results that show the effectiveness of the proposed method are presented.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.22 no.4
• /
• pp.811-825
• /
• 1998

An approximate line search is presented for dynamic response optimization with Augmented Lagrange Multiplier(ALM) method. This study empolys the approximate a augmented Lagrangian, which can improve the efficiency of the ALM method, while maintaining the global convergence of the ALM method. Although the approximate augmented Lagragian is composed of only the linearized cost and constraint functions, the quality of this approximation should be good since an approximate penalty term is found to have almost second-order accuracy near the optimum. Typical unconstrained optimization algorithms such as quasi-Newton and conjugate gradient methods are directly used to find exact search directions and a golden section method followed by a cubic polynomial approximation is empolyed for approximate line search since the approximate augmented Lagrangian is a nonlinear function of design variable vector. The numberical performance of the proposed approach is investigated by solving three typical dynamic response optimization problems and comparing the results with those in the literature. This comparison shows that the suggested approach is robust and efficient.

• Journal of Internet Computing and Services
• /
• v.21 no.3
• /
• pp.21-28
• /
• 2020

Fireworks Algorithm (FWA) is a relatively novel swarm-based metaheuristic algorithm for global optimization. To solve the low-efficient local searching problem and convergence of the FWA, this paper presents a Variable Amplitude Coefficient Fireworks Algorithm with Uniform Local Search Operator (namely VACUFWA). Firstly, the explosive amplitude is used to adjust improving the convergence speed dynamically. Secondly, Uniform Local Search (ULS) enhances exploitation capability of the FWA. Finally, the ULS and Variable Amplitude Coefficient operator are used in the VACUFWA. The comprehensive experiment carried out on 13 benchmark functions. Its results indicate that the performance of VACUFWA is significantly improved compared with the FWA, Differential Evolution, and Particle Swarm Optimization.