• Journal of Internet Computing and Services
• /
• v.12 no.3
• /
• pp.69-76
• /
• 2011

Matching customers becomes the key function in on-line mediate services. There are two matching methods: one-directional matching that requires requests from one side(e,g., information searching), bi-directional matching that considers requests from both sides. Previous bi-directional matching has difficulties of getting the interests explicitly and service collapse problems when the opposite side do not put responding interests. This paper attempts to automate the inputs of interests for bi-directional matching by calculating the interests with fuzzy matching algorithm for optimization. The results of the proposed Bi-directional Fuzzy Matching(BDFM) algorithm told that the job placement accuracy of employment information matching results is over 95%. And, BDFM gives statically significant positive effect for motivating the employment activities when analyzed the effect after completing the implementation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.370-372
• /
• 2022

In an on-demand economy that provides products and services immediately in response to consumer needs, consumers have a significant influence on pricing. In the travel-related fields, service providers are also making great efforts to reflect the needs of consumers and provide better services. In this paper, unlike many travel-related service platforms where sellers unilaterally determine prices, we propose a reverse auction-based service platform method in which consumers propose travel-related services and prices. The proposed matching service platform is expected to be able to provide two-way services differentiated from existing standardized travel-related services by analyzing the needs of various consumers and reflecting the collected response data.

• Journal of Digital Contents Society
• /
• v.8 no.2
• /
• pp.107-112
• /
• 2007

With the evolution to distributed computing technology, the concept of conventional client/server function has been advanced to Service-Oriented Architecture, which can share the information between heterogeneous systems as services. To success Service-Oriented Architecture, the conjunction between business layer and application layer is one of the important techniques. In this paper, we classify services into two views, vertical and horizontal, and introduce matching technique with service classification for SOA.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.267-272
• /
• 2007

One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching fur expanding results from an exact matching engine to query the OWL MIT Process Handbook. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We perform retrieval experiments to compare the performance of the devised similarity algorithms.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.65
• /
• pp.117-139
• /
• 2015

The BPO is an irrevocable undertaking given by an obligor bank to a recipient bank to pay a specified amount under the condition of a successful electronic matching of data or acceptance of mismatches. The BPO enables the participating banks to provide sellers and buyers with enhanced financing services. Therefore, BPO gives banks the tools to provide them with guarantees and other multi-banking services. All the participating banks must use the same Transaction Matching Application(TMA) for BPO business. In order to exchange BPO-related data, banks must be subscribed to the same TMA scheme. Participation in the TMA scheme is limited to banks only. The TMA is matching and workflow application as instrument to determine whether to pay the BPO or not. Therefore, TMA will have an important role to play in the business of the BPO. So, This paper is to review the mechanism of a TMA and the major business scenarios in Banking Payment Obligation Transactions. In Particular, it has been included the exchange and matching of data messages, the disposal of discrepancies, document payment and others based on URBPO. This study will be based on documentary research including swift com and icc.org and so on.

• Journal of Digital Convergence
• /
• v.11 no.12
• /
• pp.353-359
• /
• 2013

The search method that web services offers has its limitations. The search service considers only functional factors based on the client's preferences. In order to improve the web service search - which alone only considers functional factors - our research introduces an execution phase which performs both functional and non-functional factors by utilizing WSDL and matching information. Our research studies the architecture of both the service selecting method and the selecting process to help determine the best service solution for the client. We do so, taking into consideration the client's preferences. Our research also studies selecting methods for the best overall service. This service not only considers the matching of functional factors provided by the web service's selecting process, but it is also accommodating by matching the information as defined by the client. This paper research can offer the best quality service preferred by any end-user. Again, this is done by utilizing web services that considers the user's non-functional factors identified by the web service's selecting process and also by extracting matching information.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1307-1310
• /
• 2009

Web services provide the possibility of dynamically integrating distributed service components scattered over the Internet to fulfill sophisticated business demands. However due to today's wide variety of services offered to perform a specific task, it's essential that users are supported in the eventual selection of appropriate services. An example of web services for which selection of appropriate services will be crucial is Auto Repair Services. Selecting proper service from a variety of Auto Part Shops would be result of delivering high-quality service and minimizing Auto Repair Service customer's waiting time. Therefore, in this research to assist selecting proper service, we present Functional-Level Mediator and illustrate its usage in matching customer's and web service's goals. Five matching cases have been analyzed and results from experiment have been shown. Also, taking advantage of implementing multithreaded web services which reflects concurrent activity in the real world more naturally, we have significantly minimized customer's waiting time at Auto Repair Service.

• Journal of Information Technology Services
• /
• v.2 no.2
• /
• pp.111-119
• /
• 2003

In this paper, an efficient block matching algorithm which is based on the Block Sum Pyramid Algorithm (BSPA) is presented. The cost of BSPA[1] was reduced in the proposed algorithm by using l2 norm and partial distortion elimination technique. Motion estimation accuracy of the proposed algorithm is equal to that of BSPA. The efficiency of the proposed algorithm was verified by experimental results.

• International Journal of Advanced Culture Technology
• /
• v.8 no.3
• /
• pp.241-246
• /
• 2020

In this paper, we propose a user matching app based on hybrid app and a utilization plan to promote sports tourism in line with the growing trend of sports industry scale. The proposed app categorizes sports facilities across the country into regional, sports, private and public sports facilities to support reservations and matching. The proposed app applied a matching system in which matching scores were given according to the preference of events, places, and users by user net matching algorithm. Users can enjoy sports as a team or individual through the suggestion app even if they do not have any clubs or friends to which they belong. It can be used to improve tourism content services and establish tourism industry policies by analyzing data generated while using a user matching system.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.3
• /
• pp.173-186
• /
• 2013

Web-based map services provide various geographic information that users want to get by continuous updating of data. Those map services provide different information for a geographic object respectively. It causes several problems, and most of all various information cannot be integrated and provided. To resolve the problem, this paper proposes a system which can integrate diverse geographic information and provide users rich geographic information. In this paper, a hybrid schema matching (HSM) algorithm is proposed and the algorithm is a mixture of the adapter-based semantic processing method, static semantic management-based approach, and dynamic semantic management-based approach. A comparative evaluation is described to show effectiveness of the proposed algorithm. The proposed algorithm in this paper improves the accuracy of schema matching because of registration and management of schemas of new semantic information. The proposal enables vocabulary-based schema matching using various schemas, and it thus also supports high usability. Finally, the proposed algorithm is cost-effective by providing the progressive extension of relationships between schema meanings.