• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.698-701
• /
• 2013

Mobile social networking applications are getting increasingly popular among today's mobile applications. Mobile users find their old or new friends anywhere or anytime through mobile social network (MSN) services. MSN uses matchmaking mechanisms to discover mutual interests among different people. To discover friends in MSN, a user must share his/her private information which can be a risk for his/her personal privacy as this information can be learned by a malicious or semi honest user. In this paper we give a brief survey on MSN that includes MSN categories, components, architecture and applications. In the rest of the paper we discuss the matchmaking protocols. Finally we give some suggestions to improve the previous protocols.

• The Journal of Society for e-Business Studies
• /
• v.14 no.4
• /
• pp.149-166
• /
• 2009

With the rapid development of Web Service technology, the number of Web Service providers which provide same Web Services are increasing. As a result, the QoS elements become more and more important factors for Web Service matchmaking. But, most of previous research efforts do not consider various QoS elements including Service-specific QoS elements during the matchmaking process. In this paper, we propose a Web Service matchmaking scheme which allow dynamic QoS adaptation using the RSS technique. We first classify various QoS elements and describe an extensible QoS model. We then explain a matchmaking scheme, which can utilize the proposed QoS elements. We also show how to dynamically add user-specific QoS elements using the RSS mechanism, thus improving the correctness of web service matchmaking process. Finally, we implemented the proposed schemes and showed the usefulness of our methods through some experiments.

• Information Systems Review
• /
• v.14 no.3
• /
• pp.115-129
• /
• 2012

A matchmaking system is a type of recommender systems that provides a set of dating partners suitable for the user by online. Many matchmaking systems, which are widely used these days, require users to specify their preferences with regards to ideal dating partners based on criteria such as age, job and salary. However, some users are not aware of their exact preferences, or are reluctant to reveal this information even if they do know. Also, users' selection standards are not fixed and can change according to circumstances. This paper suggests a new matchmaking system called Decision Tree based Matchmaking System (DTMS) that automatically adjusts the stated standards of a user by analyzing the characteristics of the people the user chose to contact. AMMS provides recommendations for new users on the basis of their explicit preferences. However, as a user's behavioral records are accumulated, it begins to analyze their hidden implicit preferences using a decision tree technique. Subsequently, DTMS reflects these implicit preferences in proportion to their predictive accuracy. The DTMS is regularly updated when a user's data size increases by a set amount. This paper suggests an architecture for the DTMS and presents the results of the implementation of a prototype.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2003.05a
• /
• pp.233-238
• /
• 2003

인터넷의 급속한 성장과 함께 분산 네트워크 환경 하에서의 정보 검색 문제는 중요한 이슈가 되고 있다. 기하급수적으로 증가하는 정보의 홍수 속에서 사용자가 원하는 정보나 서비스를 효율적으로 찾아주는 방법은 꾸준히 연구되고 있다. 이러한 문제를 해결하기 위해서 멀티에이전트(Multi-agent)환경 하에서 원하는 서비스를 제공하는 에이전트들을 효율적으로 탐색해 주는 에이전트간의 매치메이킹(Matchmaking) 시스템은 좋은 해결방안이 될 수 있다. 본 논문에서 제안한 확장 매치메이킹 알고리즘은 중개 에이전트가 특정 도메이 지식을 효과적으로 이용할 수 있도록 문제에 대한 표현과 추론 과정이 명확한 CSP로 모델링 함으로써 불필요한 탐색 공간을 효율적으로 제거하도록 하였으며, 서비스 요청 에이전트의 요구사항을 만족시키면서 가능한 한 중복되는 에이전트 쌍이 최소화 되도록 일반적인 유사도(Similarity)와 함께 새로운 경쟁도(Competition)를 고려하였다. 본 논문에서 제안한 알고리즘이 기존의 매치메이킹 알고리즘보다 더 효율적인 것을 보이기 위해 온라인 인력 채용박람회를 모델로 하여 중개 에이전트가 직업을 구하는 서비스 요청 에이전트와 인재를 모집하는 서비스 공급 에이전트간의 매치메이킹 문제에 대해 실험 평가하였다.

• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.1-15
• /
• 2007

Recently, semantic web technology, represented by ontology building, is being combined with web services technology, creating 'Semantic Web Services' as a new promising field in information retrieval research. Accordingly, many brokering and matchmaking agents are being developed and used in the field. However, literature review revealed that most models do not take QoS(Quality of Services) into consideration. In this study, a QoS-augmented matchmaking algorithm is developed based on service availability, response time, maximum transaction amount, reliability, accessibility and price as critical QoS items. A prototype for Intelligent Semantic Web Services System is developed using publicly available data. Performance test was conducted and reported at the end.

• Journal of Korea Game Society
• /
• v.22 no.1
• /
• pp.33-42
• /
• 2022

In online games, interactions with other players may threaten player satisfaction. Therefore, matching players of similar skill levels is important for players' experience. However, with the current evaluation method which is only based on the final result of the game, newbies and returning players are difficult to be matched properly. In this study, we propose a method to improve matchmaking quality. We build machine learning models to predict the MMR of players and derive the basis of the prediction. The error of the best model was 40.4% of the average MMR range, confirming that the proposed method can immediately place players in a league close to their current skill level. In addition, the basis of predictions may help players to accept the result.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.26 no.2
• /
• pp.188-196
• /
• 2023

In the future battlefield centered on the concept of mosaic warfare, the need for an unmanned combat system will increase to value human life. It is necessary for Multiple/Heterogeneous Unmanned Combat Systems to have suitable mission planning method in order to perform various mission. In this paper, we propose the MTSR model for mission planning of the unmanned combat system, and introduce a method of identifying a task by a combination of services using a request operator and a method of allocating resources to perform a task using the requested service. In order to verify the performance of the proposed task-resource matchmaking algorithm, simulation using occupation scenarios is performed and the results are analyzed.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.831-835
• /
• 2009

Volunteer computing is a computing paradigm in which the operations of a large-scale application are processed using idle resources of Internet-connected computers. The redundant-work distribution techniques used in the volunteer computing environment cause some problems like delay of the work completion time or inefficiency of the work execution due to continuous requests of the work redistribution because the techniques do not consider the characteristics of works and dynamic resources. To cope with such problems this paper suggests a P2P based regional matchmaking technique which can redistribute works in consideration of the characteristics of the works and the participant resources. The techniques consist of the profiles for works/resources, the module for monitoring the available resources spaces, the protocols for the matching request/reply, the module for match-ratio calculation, and so on.

• Korean Journal of Human Ecology
• /
• v.16 no.1
• /
• pp.61-73
• /
• 2007

This study looks into their process to wedding for Vietnamese brides and the motives of their marriage of whom are living in rural areas near an urban city, and the difficulties of their living in Korea. The mist significant motive of their marriage for the Vietnamese brides if financial reasons. They also think that Korean men are well-off and reliable and that the men's occupations or the age are any matter to be considered. As for the Korean men married to Vietnamese brides, the mist significant motive of their marriage is that Vietnamese brides are considered to be good-natured hardworking, sincere and respectful of the elderly. The wedding process usually takes place in 5-6 days through matchmaking, and the background of their Korean man gets inflated by their matchmaking agency. Some of the most significant difficulties for their life in Korea are due to the language barrier, their husbands' incompetence for a living, conceptions before the young brides get adjusted to Korean living. Most significant support networks are their husbands/families, and their neighbors, relatives and friends that can share Korean cultures and Vietnamese cultures with them. At last, the local communities should continuously offer them educational opportunities for Korean language and social/ cultural understanding.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.525-534
• /
• 2005

This paper is concerned with the query slipping and its prevention for trajectory-based matchmaking service in wireless sensor networks. The problem happens when a query propagating along a subscribe trajectory moves through a publish trajectory without obtaining desired information, even though two trajectories intersect geometrically. There follows resubmission of the query or initiation of another subscribe trajectory Thus, query slipping results in considerable time delay and in the worst, looping in the trajectory or query flooding the network. We address the problem formally and suggest a solution. First, the area where nodes are distributed is logically partitioned into smaller grids, and a grid-based multicast next-hop selection algorithm is proposed. Our algorithm not only attempts to make the trajectory straight but also considers the nodal density of recipient nodes and the seamless grid-by-grid multicast. We prove that the publishing and subscribing using the algorithm eventually eliminate the possibility of the slipping. It toms out that our algorithm dissipates significantly less power of neighbor nodes, compared to the non grid-based method, as greedy forwarding, and the fixed- sized grid approach, as GAF (Geographical Adaptive Fidelity)