• Journal of Digital Contents Society
• /
• v.11 no.3
• /
• pp.291-298
• /
• 2010

Although searching service is popularized in the PC-based internet environment, it is not (or rarely) supported on TV, which is the major multimedia equipment in the living room. Several trials are made to port established PC-based searching systems onto TV-set but failed to get popularity among viewers as they did not consider the viewers' modality. Operating the searching system should not disturb viewers in watching TV (for example, TV screen should not be (even partially) covered by the searching system's graphics) and the number of pushing the remote controller's buttons should be minimized so that viewers can keep watching TV without glancing at the searching system's graphics. In this paper, the author introduces a new searching system running on TV-set, which is designed to reflect properly the viewers' modality. The searching system is also compatible with the data service standard adopted by the domestic broadcasting networks so that it can be easily implemented by them.

• Asia pacific journal of information systems
• /
• v.12 no.1
• /
• pp.1-16
• /
• 2002

Most of searching systems used by shopping-mall provide too much information for user requirements or fail to provide appropriate items reflecting customer's preference. This paper aims to design and implement the product searching systems based on customer preference which will enable efficient product selection in the internet shopping-mall. The proposed system consists of user/provider interface, searching and model agent, data management system, and model management system. Especially, we construct the searching pattern database to support fast search using association mining method. And this system includes the customer-oriented decision model which shows the highly preferred products. Input weight value per attribute and preference level should be needed to compute priority grade of preference.

• The Journal of Information Systems
• /
• v.8 no.2
• /
• pp.91-110
• /
• 1999

Recently, searching agent systems to help purchase of products between business and customer have been actively studied in Electronic Commerce(EC). However, the most of comparative searching agent systems are only provided customers with searching results by the keyword-based search, and is not support the efficient decision models to be selected products considering the customer's requirements. This paper proposes the decision agent system applied decision model as well as searching functions based on the keyword-input to be selected useful products in EC. The proposed decision agent system is consist of the user interface, provider interface, decision model. Especially, as the example of the decision model, this paper is designed and implemented the prototype of decision agent system which is normalized the searching data and value of customer's preference weight as to each attribute, and orderly provided customers with computed results. This agent system is also carried out sensitive analysis according to the reflection ratio of the each attribute.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.12 no.4
• /
• pp.146-157
• /
• 2009

In order to implement ontology data searching system, this paper uses some methods that effectively analyse searching options/key words with event process model and design pattern. I will propose some techniques on object-oriented process model that should improve reusability of system and reusability of ontology data which users can obtain more precise searching results. This paper shows that ontology-based data searching can assure users of the precision of searching results. Therefore, ontology-based data searching system on object-oriented design pattern is expected to show high stability and reliability, enhance reusability and scalability of modules and softwares and provide reliable data searching results to users.

• International Journal of Computer Science & Network Security
• /
• v.22 no.6
• /
• pp.212-222
• /
• 2022

There has been a rapid increase in the use of cloud email services. As a result, email encryption has become more commonplace as concerns about cloud privacy and security grow. Nevertheless, this increase in usage is creating the challenge of how to effectively be searching and filtering the encrypted emails. They are popular technologies of solving the issue of the encrypted emails searching through searchable public key encryption. However, the problem of encrypted email filtering remains to be solved. As a new approach to finding and filtering encrypted emails in the cloud, we propose a ciphertext-based encrypted policy attribute-based encryption scheme and keyword search procedure based on hidden policy ciphertext. This feature allows the user of searching using some encrypted emails keywords in the cloud as well as allowing the emails filter-based server toward filter the content of the encrypted emails, similar to the traditional email keyword filtering service. By utilizing composite order bilinear groups, a hidden policy system has been successfully demonstrated to be secure by our dual system encryption process. Proposed system can be used with other scenarios such as searching and filtering files as an applicable method.

• Journal of the Semiconductor & Display Technology
• /
• v.13 no.1
• /
• pp.113-116
• /
• 2014

This paper has been forged to suggest 'Medical Information Searching System'. This system sets itself to conduct searching of medical information stored in a wide variety of medical institutions. This system aims to suggest a flexible, compatible and effective standard on medical information searching through this. So, In this paper, we present a framework to help medical institutions search the requiring medical information in conjunction with analysis on 'medical information request'.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.112-115
• /
• 2009

PI code searching method of RDS(Radio Data System) are unique method of maintain desired channel on moving machine like vehicle. Efficient and fast PI code search method are researching on the all of RDS related systems for both find more better channel before Original channel signal go to bad and find desired good signal quickly when get out of Weak signal Area. But Embedded system has limited environment like memory size, so It is very difficult to apply many well known PI code searching method. This thesis suggests simple and effective method of searching PI code, considering a Embedded System Environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1486-1492
• /
• 2007

Searching distributed resources efficiently is very important in distributed computing environments like P2P. But distributed resource searching may have system overheads and take a lot of time in proportion to the searching number, because distributed resource searching has to circuit many peers for searching information. In this paper, we design a proxy peer algorithm based on DHT(Distributed Hash Table) for efficient distributed resource searching in JXTA network environments. By containing the rendezvous information in proxy peer and searching a rendezvous peer firstly which has higher hit ratio, we can reduce the searching number and minimize system overheads.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.5
• /
• pp.824-830
• /
• 2010

It is not easy job to find a underwater target using sonar system in the ASW operations. Many researchers have tried to solve anti-submarine search problem aiming to maximize the probability of detection under limited searching conditions. The classical 'Search Theory' deals with search allocation problem and search path problem. In both problems, the main issue is to prioritize the searching cells in a searching area. The number of possible searching path that is combination of the consecutive searching cells increases rapidly by exponential function in the case that the number of searching cells or searchers increases. The more searching path we consider, the longer time we calculate. In this study, an effective algorithm that can maximize the probability of detection in shorter computation time is presented. We show the presented algorithm is quicker method than previous algorithms to solve search problem through the comparison of the CPU computation time.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.151-156
• /
• 2002

Recently, as the geographic information system (GIS) which searches, manages geographic information is used more widely, there is more requests for some systems which can search and display more actual and realistic information. As a response to these requests, the video geographic information system which connects video data obtained by using cameras and geographic information as it is by displaying the obtained video data is being more popular. However, because most existing video geographic information systems consider video data as an attribute of geographic information or use simple one-way links from geographic information to video data to connect video data with geographic information, they support only displaying video data through searching geographic information. In this paper, we design and implement a video geographic information system which connects video data with geographic information and supports hi-directional search; searching geographic information through searching video data and searching video data through searching geographic information. To do this, we 1) propose an ER data model to represent connection information related to video data, geographic information, 2) propose a process to extract and to construct connection information from video data and geographic information, 3) show a component based system architecture to organize the video geographic information system.