• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2000.04a
• /
• pp.179-183
• /
• 2000

By spread of Internet, we become to use several of communication such as email, ICQ, VoIP etc. But as become convenient to use, user must be aware of variety of information regarding the media and partner user. The forecast is that this problem grows larger and larger as new media are brought in the expanding communications network. In this research, we suggest an agent MIA (Media Integration Agent) that manages the information instead of user. The MIA is an agent that obtains situation of user, and dynamically exchanged addresses and tendency of using medias in form of vCard. By use of this, user can choose better communication media. Accordingly seamless communication environment that user doesn't have to be aware of various information is formed.

• Journal of KIISE:Software and Applications
• /
• v.32 no.6
• /
• pp.542-553
• /
• 2005

Recommendation systems analyze user preferences and recommend items to a user by predicting the user's preference for those items. Among various kinds of recommendation methods, collaborative filtering(CF) has been widely used and successfully applied to practical applications. However, collaborative filtering has two inherent problems: data sparseness and the cold-start problems. If there are few known preferences for a user, it is difficult to find many similar users, and therefore the performance of recommendation is degraded. This problem is more serious when a new user is first using the system. In this paper we propose a method of integrating additional feature information of users and items into CF to overcome the difficulties caused by sparseness and improve the accuracy of recommendation. In our method, we first fill in unknown preference values by using the probability distribution of feature values, then generate the top-N recommendations by applying collaborative filtering on the modified data. We call this method of filling unknown preference values as data blurring. Several experimental results that show the effectiveness of the proposed method are also presented.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.6
• /
• pp.2406-2412
• /
• 2015

Multi-user multi-input multi-output (MU-MIMO) system has attracted the 4^th generation wireless network as one of core technique for performance enrichment. In this system rate control is a challenging problem and another problem is optimization. Proper scheduling can resolve these problems by deciding which set of user and at which rate the users send their data. This paper proposes a new multi-parameter based scheduling (MPS) for downlink multi-user multiple-input multiple-output (MU-MIMO) system under space-time block coding (STBC) transmissions. Goal of this MPS scheme is to offer improved link level performance in terms of a low average bit error rate (BER), high packet delivery ratio (PDR) with improved resource utilization and service fairness among the user. This scheme allows the set of users to send data based on their channel quality and their demand rates. Simulation compares the MPS performance with other scheduling scheme such as fair scheduling (FS), normalized priority scheduling (NPS) and threshold based fair scheduling (TFS). The results obtained prove that MPS has significant improvement in average BER performance with improved resource utilization and fairness as compared to the other scheduling scheme.

• International Journal of Contents
• /
• v.2 no.4
• /
• pp.12-18
• /
• 2006

The number of wireless public network user is increasing rapidly. Security problem for user authentication has been increased on existing wireless network such as IEEE802.11 based Wireless LAN. As a solution, IEEE802.1x (EAP-MD5, EAP-TLS, EAP-TTLS), X.509, protocol or security system was suggested as a new disposal plan on this problem. In this study, we overview main problem on existing EAP-MD5 authentication mechanism on Wireless LAN and propose a SMS(Short Message Service) based secure authentication and accounting mechanism for providing security enhanced wireless network transactions.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.4
• /
• pp.1301-1306
• /
• 2010

The protocol based on password have very important qualifications that not only satisfy against attacks cause of restricting that have, but also efficiency of reducing users' workload. It has a problem of speculative attacks for the user authentication protocol based on password with most case, because users use password that can remember easily. Song and Etc. have proposed new mechanism that improved the problem of S/KEY system. The protocol proposed by Song has a problem in registration process, and user information can be abused by the malevolent server. We propose a new authentication protocol based on efficient OPT, that improved above problems.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.1
• /
• pp.53-59
• /
• 2012

Recently, LEE et al. proposed an attribute-based authenticated key agreement protocol over home network, which aimed to support authentication and key agreement between user and home server. However, if the home server is attacked in the protocol, the effects are influenced to the overall home network components severly. Thereby, this paper proposes a new ticket-based authentication protocol using user attributes between user and home devices to solve the problem. The proposed protocol supports the various levels of security to user by diversifying the network accessibility depending on user attribute. Thereby, the protocol could support more secure home network services.

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

AS EC is expanded and activated, many message standards, EDI, XML, UDF, etc are defined and is used at various business part. But the existed translator supports only one mapping translation, for example, EDI-to-UDF, UDF-to-EDI. So many user must be introduced a new translation when new business(message standard) is beginning, To solve this problem, we propose XConverter System as registering mapping information which is able to transform to user requested format using same translator even though it is transferred any formatted message in this paper. Also, We design and implement this system which is capable to integrate with existed legacy system, including DB transformation functionality. The .XConverter System supports changing the business message format to the common user used message format. And this system easily migrates with existed legacy system because DB transform module is component. Therefore, The proposed System is more various and flexible than the other translation system that provide just one mapping transformation.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.1
• /
• pp.31-39
• /
• 2011

VoIP service uses packet network of ip-based because that has eavesdropping, interception, illegal user as vulnerable elements. In addition, PSTN of existing telephone network is subordinate line but VoIP service using the ip packet provide mobility. so The user authentication and VoIP user's account service using VoIP has emerged as a problem. To solve the vulnerability of SIP, when you use VoIP services with SIP, this paper has made it possible to authenticate user's terminal by using proxy server and proxy server by using authentication server. In conclusion, sender and receiver are mutually authenticated. In the mutual authentication process, the new session key is distributed after exchanging for the key between sender and receiver. It is proposed to minimize of service delay while the additional authentication. The new session key is able to authenticate about abnormal messages on the phone. This paper has made it possible to solve the vulnerability of existing SIP authentication by using mutual authentication between user and proxy server and suggest efficient VoIP service which simplify authentication procedures through key distribution after authentication.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.1 s.6
• /
• pp.81-88
• /
• 2005

Cooperation among network users would be possible in a near future, as real time communication between them can be available by telematics. This implies that non-cooperative assumption like Wardrop's principle, which has been widely used so far in network modelling may not be appropriate for route choice problem. So a new principle requires for describing such cooperative case. This paper presents a criterion, which represents cooperative route choice behaviour among network users. With some examples, we compare the non-cooperative principle and the cooperative one presented in this paper. Numerical results from the examples show that the new principle would be better than the existing one.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5344-5356
• /
• 2018

Nowadays with the help of Location-Based Social Networks (LBSNs), users of Point-of-Interest (POI) recommendation service in LBSNs are able to publish their geo-tagged information and physical locations in the form of sign-ups and share their experiences with friends on POI, which can help users to explore new areas and discover new points-of-interest, and promote advertisers to push mobile ads to target users. POI recommendation service in LBSNs is attracting more and more attention from all over the world. Due to the sparsity of users' activity history data set and the aggregation characteristics of sign-in area, conventional recommendation algorithms usually suffer from low accuracy. To address this problem, this paper proposes a new recommendation algorithm based on a novel Preference-Content-Region Model (PCRM). In this new algorithm, three kinds of information, that is, user's preferences, content of the Point-of-Interest and region of the user's activity are considered, helping users obtain ideal recommendation service everywhere. We demonstrate that our algorithm is more effective than existing algorithms through extensive experiments based on an open Eventbrite data set.