• Journal of the Semiconductor & Display Technology
• /
• v.17 no.3
• /
• pp.113-116
• /
• 2018

This paper proposes a mobile image search system which uses a sensor information of smart phone, and enables running in a variety of environments, which is implemented on Android platform. The implemented system deals with a new image descriptor using combination of the visual feature (CEDD) with EXIF attributes in the target of JPEG image, and image matching scheme, which is optimized to the mobile platform. Experimental result shows that the proposed method exhibited a significant improved searching results of around 80% in precision in the large image database. Considering the performance such as processing time and precision, we think that the proposed method can be used in other application field.

• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.11-25
• /
• 2005

In MIPv6 environment, an important design consideration for public key based binding update protocols is to minimize asymmetric cryptographic operations in mobile nodes with constraint computational power, such as PDAs and cellular phones, For that, public key based protocols such as CAM-DH. SUCV and Deng-Zhou-Bao's approach provides an optimization to offload asymmetric cryptographic operations of a mobile node to its home agent. However, such protocols have some problems in providing the optimization. Especially, CAM-DH with this optimization does not unload all asymmetric cryptographic operations from the mobile node, while resulting in the home agent's vulnerability to denial of service attacks. In this paper, we improve the drawbacks of CAM-DH. Furthermore, we adopt Aura's two hash-based CGA scheme to increase the cost of brute-force attacks searching for hash collisions in the CGA method. The comparison of our protocol with other public key based protocols shows that our protocol can minimize the MN's computation overhead, in addition to providing better manageability and stronger security than other protocols.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.151-158
• /
• 2005

In order to use the existing map data base in the mobile phone, the dynamic creation technique of the radio map which will be able to be converted into the raster image and transmitted was proposed. We transferred the client module functions such as the coordinate conversion, data compression and decoding to server, and made driving of JAVA browser in the mobile phone which has the restricted resources possible for the dynamic creation of the radio map. We made the radio electronic map service possible without map data base for the mobile phone use only by performing the general work of the map at the sever. And we guaranteed the client waiting time less then the limit time by performing the filtering work of the map at the server also. After we input the keyword at the user interface for searching the region or facility, and verified the performance of the proposed technique by confirming that the raster electronic map usable at the mobile phone was created dynamically.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.45-54
• /
• 2008

As mobile Web technology becomes more increasingly applicable. the mobile contents market. especially the music downloading for mobile phones, has recorded remarkable growth. In spite of this rapid growth, customers experience high levels of frustration in the process of searching for desired music contents. It affects to a re-purchasing rate of customers and also. music mubile content providers experience a decrease in the benefit. Therefore, in aspects of a customer relationship management (CRM), a new way to increase a benefit by providing a convenient shopping environment to mobile customers is necessary. As an solution for this situation, we propose a new music recommender system to enhance the customers' search efficiency by combining collaborative filtering with mobile web mining and ordinal scale based customer preferences. Some experiments are also performed to verify that our proposed system is more effective than the current recommender systems in the mobile Web.

• Journal of the Korea Convergence Society
• /
• v.8 no.9
• /
• pp.249-254
• /
• 2017

The purpose of this study is to provide a way to develop the information quality of mobile real estate service and improve the false property through search filter service. I compared the cases of typical mobile real estate apps that are currently in use and analyzed the usage and service status by adopting 13 search filters that are the first priority when searching for real estate information. As a result, it has been shown that the provision of high quality search filter service is required to improve the information quality in order to provide users with quick and reliable information organically at any time and anywhere according to the definition of mobile real estate service. As a result, it is more prejudiced than the countermeasures against false fraudulent products, and it is satisfied with the needs of the users and provides the improved search filter service, so that it can be trusted with the definition of mobile real estate brokerage service, Providing quality services can be said to prevent the victims of fraudulent products.

• The KIPS Transactions:PartB
• /
• v.15B no.3
• /
• pp.219-228
• /
• 2008

For real-time social networking service, mobile interaction in a usable-unified-ubiquitous (U3) web service was studied. Both as a convenient mobile HCI for real-time social networks and as indexing keys to metadata information in ubiquitous web service, the multi-lingual single-character domain names (e.g. 김.net, 이.net, 가.net, ㄱ.net, ㄴ.net, ㅎ.net, ㅏ.net, ㅔ.net, ㄱ.com, ㅎ.com) are convenient mobile interfaces when searching for social information and registering information. We introduce the sketched design goals and experience of mobile interaction in Korea, Japan and China, with the implementation of real-time social networking service as an example of U3 Web service. We also introduce the possibility of extending the application to the metadata directory service in IP-USN (IP-based Ubiquitous Sensor Network) for a unified information management in the service of social networking and sensor networking.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1034-1041
• /
• 2014

This paper propose a fuzzy inference model for obstacle avoidance for a mobile robot with an active camera, which is intelligently searching the goal location in unknown environments using command fusion, based on situational command using an vision sensor. Instead of using "physical sensor fusion" method which generates the trajectory of a robot based upon the environment model and sensory data. In this paper, "command fusion" method is used to govern the robot motions. The navigation strategy is based on the combination of fuzzy rules tuned for both goal-approach and obstacle-avoidance. We describe experimental results obtained with the proposed method that demonstrate successful navigation using real vision data.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.119-126
• /
• 2004

Location management is very important issue in wireless communication system to trace mobile users' exact location. In this study, we propose a dynamic location area management scheme which determines the size of dynamic location area considering each user's characteristic. In determining the optimal location area size, we consider the measurement data as well as the historical data, which contains call arrival rate and average speed of each mobile user. In this mixture of data, the weight of historical data is derived by linear searching method which guarantees the minimal cost of location management. We also introduce the regularity index which can be calculated by using the autocorrelation of historical data itself. Statistical validation shows that the regularity index is the same as the weight of measurement data. As a result, the regularity index is utilized to incorporate the historical data into the measurement data. By applying the proposed scheme, the location management cost is shown to decrease. Numerical examples illustrate such an aspect of the proposed scheme.

• IE interfaces
• /
• v.18 no.4
• /
• pp.382-389
• /
• 2005

Location management is very important issue in wireless communication system to trace mobile users' exact location. In this study, we propose a dynamic location area management scheme which determines the size of dynamic location area considering each user's characteristics. In determining the optimal location area size, we consider the measurement data as well as the historical data, which contains call arrival rate and average speed of each mobile user. In this mixture of data, the weight of historical data is derived by linear searching method which guarantees the minimal cost of location management. We also introduce the regularity index which can be calculated by using the autocorrelation of historical data itself. Statistical validation shows that the regularity index is the same as the weight of measurement data. As a result, the regularity index is utilized to incorporate the historical data into the measurement data. By applying the proposed scheme, the location management cost is shown to decrease. Numerical examples illustrate such an aspect of the proposed scheme.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.165-173
• /
• 2002

In the static channel assignment scheme for cellular mobile computing environment, each cell has a fixed number of channels and supports a service for a user′s request entering to the cell. This scheme has an advantage of simplicity. However, this scheme has a disadvantage that can′t control far hot cell problem. Therefore, to solve this problem, the "channel borrowing" concept is needed. In this paper, we propose a load balancing(channel borrowing, channel reassignment) approach using genetic algorithm. The purposes of using genetic algorithm in this paper are ${\circled1}$ to find early a cell including an available channel and ${\circled2}$ to decrease a number of probings and ${\circled3}$ to migrate to the cell after searching an available channel near upon optimality. To represent effectiveness of the proposed algorithm, we simulated various experiments.