• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.1287-1290
• /
• 2011

Because of the rapid development of internet, there are more and more documents stored by the XML-based format. When there is a great deal of XML documents, how to get the valuable Information is an important subject. This paper proposes an effective XML document search method to search text contents and structures of XML documents. We build the keyword matrix of text contexts and structure matrixes of structures in XML documents to improve the efficiency of query time. When there is a great deal of XML documents, the search method we propose can improve much efficiency of query time.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.354-363
• /
• 1995

We propose a new search method which is based on the precedence relationship between subgoals.The prosed method reducess both the branching factor of and the depth of the search space by making use of the precedence relationship between subgoals, and further improves the efficiency of A.I.search by immediately achieving directly achievable maximal subgoals and immediately performing the directly applicable actions which must be eventually done.The efficiency of our method has been analysed theoretically.We have also implemented a robot planning system equipped with versions of DFID and IDA which are modified by applying our proposed strategies, and experimentally showed the efficiency of our strategy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2718-2731
• /
• 2019

Conjunctive keyword search encryption is an important technique for protecting sensitive data that is outsourced to cloud servers. However, the process of searching outsourced data may facilitate the leakage of sensitive data. Thus, an efficient data search approach with high security is critical. To solve this problem, an efficient conjunctive keyword search scheme based on ciphertext-policy attribute-based encryption is proposed for cloud storage environment. This paper proposes an efficient mechanism for removing the secure channel and resisting off-line keyword-guessing attacks. The storage overhead and the computational complexity are regardless of the number of keywords. This scheme is proved adaptively secure based on the decisional bilinear Diffie-Hellman assumption in the standard model. Finally, the results of theoretical analysis and experimental simulation show that the proposed scheme has advantages in security, storage overhead and efficiency, and it is more suitable for practical applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.9
• /
• pp.2436-2457
• /
• 2023

The elderly population is rapidly increasing worldwide, but many face challenges in using digital tools like the Internet due to health and incapacity issues. Existing online search user interfaces (UIs) often overlook the specific usability needs of the elderly. This study proposes an adaptable web search UI model for the elderly, based on their perspectives, to enhance search performance and usability. The proposed UI model is evaluated through comparative usability testing with 20 participants, comparing it to the Google search UI. Effectiveness, efficiency, and satisfaction are measured using task completion time, error rate, and subjective preferences. The results show significant differences (p > 0.05) between the proposed web search UI model and the Google search UI. The proposed UI model achieves higher subjective satisfaction levels, indicating better alignment with the needs and preferences of elderly users. It also reduces task completion time, indicating improved efficiency, and decreases the error rate, suggesting enhanced effectiveness. These findings emphasize the importance of considering the unique usability needs of the elderly when designing search UIs. The proposed adaptable web search UI model offers a promising approach to enhance the digital experiences of elderly users. This study lays the groundwork for further development and refinement of adaptable web search UI models that cater to the specific needs of elderly users, enabling designers to create more inclusive and user-friendly search interfaces for the growing elderly population.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.433-439
• /
• 2019

Artificial bee colony algorithm is a strong global search algorithm which exhibits excellent exploration ability. The conventional ABC algorithm adopts employed bees, onlooker bees and scouts to cooperate with each other. However, its one dimension and greedy search strategy causes slow convergence speed. To enhance its performance, in this paper, we abandon the greedy selection method and propose an artificial bee colony algorithm with special division and intellective search (ABCIS). For the purpose of higher food source research efficiency, different search strategies are adopted with different employed bees and onlooker bees. Experimental results on a series of benchmarks algorithms demonstrate its effectiveness.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4387-4404
• /
• 2015

The energy-efficient design of sensing-based spectrum sharing of a multi-input and multi-output (MIMO) cognitive radio (CR) system with imperfect multiple antenna spectrum sensing is investigated in this study. Optimal resource allocation strategies, including sensing time and power allocation schemes, are studied to maximize the energy efficiency (EE) of the secondary base station under the transmit power and interference power constraints. EE problem is formulated as a nonlinear stochastic fractional programming of a nonconvex optimal problem. The EE problem is transformed into its equivalent nonlinear parametric programming and solved by one-dimension search algorithm. To reduce searching complexity, the search range was founded by demonstration. Furthermore, simulation results confirms that an optimal sensing time exists to maximize EE, and shows that EE is affected by the spectrum detection factors and corresponding constraints.

• Archives of design research
• /
• v.15 no.2
• /
• pp.223-232
• /
• 2002

As the Internet becomes widespread as a significant tool of obtaining information, there is a growing demand for a system to efficiently organize and manage information on the Internet. Accordingly, research on the directory classification structure that directly affects the efficiency of a users information search is actively investigated in every field. The study intends to suggest an efficient classification structure by comparing and analyzing the directory classification structure of current design portal sites with the theory of literature classification structure, in order to increase the efficiency of search according to the directory classification structure of design sector.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.8-15
• /
• 2003

Recently various of information suppliers provide information via WWW so the necessary of search engine grows larger. However the efficiency of most search engines is low comparatively because of using simple pattern match technique between user's query and web document. A specialized search engine returns the specialized information depend on each user's search goal. It is trend to develop specialized search engines in many countries. However, most such engines don't satisfy the user's needs. This paper proposes the specialized search engine for ocean information that uses user's query related with ocean and the association rules in web data mining can prove relation between web documents. So this search engine improved the recall of data and the precision in existent search method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5171-5189
• /
• 2016

With the popularity of cloud computing, many data owners outsource their graph data to the cloud for cost savings. The cloud server is not fully trusted and always wants to learn the owners' contents. To protect the information hiding, the graph data have to be encrypted before outsourcing to the cloud. The adjacent vertex search is a very common operation, many other operations can be built based on the adjacent vertex search. A boolean adjacent vertex search is an important basic operation, a query user can get the boolean search results. Due to the graph data being encrypted on the cloud server, a boolean adjacent vertex search is a quite difficult task. In this paper, we propose a solution to perform the boolean adjacent vertex search over encrypted graph data in cloud computing (BASG), which maintains the query tokens and search results privacy. We use the Gram-Schmidt algorithm and achieve the boolean expression search in our paper. We formally analyze the security of our scheme, and the query user can handily get the boolean search results by this scheme. The experiment results with a real graph data set demonstrate the efficiency of our scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.7
• /
• pp.47-54
• /
• 2017

Recently, correlation filter based trackers have shown excellent tracking performance and computational efficiency. In order to enhance tracking performance in the correlation filter based tracker, search area which is image patch for finding target must include target. In this paper, two methods to discriminatively represent target in the search area are proposed. Firstly, search area location is estimated using pyramidal Lucas-Kanade algorithm. By estimating search area location before filtering, fast motion target can be included in the search area. Secondly, we investigate multi-channel Local Edge Pattern(LEP) which is insensitive to illumination and noise variation. Qualitative and quantitative experiments are performed with eight dataset, which includes ground truth. In comparison with method without search area estimation, our approach retain tracking for the fast motion target. Additionally, the proposed multi-channel LEP improves discriminative performance compare to existing features.