• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2811-2830
• /
• 2017

In this paper, we study the problem of mobile data offloading for a network that contains multiple mobile network operators (MNOs), multiple WiFi or femtocell access points (APs) and multiple mobile users (MUs). MNOs offload their subscribed MUs' data traffic by leasing the unused Internet connection bandwidth of third party APs. We propose a combinatorial auction-based two-stage matching mechanism comprised of MU-AP matching and AP-MNO matching. The MU-AP matching is designed to match the MUs to APs in order to maximize the total offloading data traffic and achieve better MU satisfaction. Conversely, for AP-MNO matching, MNOs compete for APs' service using the Nash bargaining solution (NBS) and the Vickrey auction theories and, in turn, APs will receive monetary compensation. We demonstrated that the proposed mechanism converges to a distributed stable matching result. Numerical results demonstrate that the proposed algorithm well capture the tradeoff among the total data traffic, social welfare and the QoS of MUs compared to other schemes. Moreover, the proposed mechanism can considerably offload the total data traffic and improve the network social welfare with less computation complexity and communication overhead.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.79-90
• /
• 2008

In the ubiquitous environment sensor network technologies have advanced for collecting information of the environment. With the rapid growth of sensor network technology, it is necessary and important to share the collected sensor data with a large base of diverse users. In order to provide dissemination of sensor data, we design an information dissemination system using an independent disseminator between provider and consumer. This paper describes how we designed the information dissemination system using one of the possible dissemination patterns for sensor networks, and an efficient matching algorithm called CGIM (Classed Grouping Index Matching) which employs a dynamic re-grouping scheme.

• The Journal of Information Systems
• /
• v.15 no.3
• /
• pp.159-174
• /
• 2006

Employment rate of graduating students has been one of the most important issues at universities. Recently interest on internship abroad has been increased significantly due to globalization of the society In particular, central and local governments have developed policies and encouraged university students to participate in internships abroad. However, activities and resources for internships abroad are very limited to a few organizations. This paper investigated the current status of internship in the U.S. and Korea. Then, this paper analyzed differences in demand and supply of the internship and matching mechanism of the internship between the U.S. and Korea. From the results of those analyses, this paper developed an international network model which can help effective and efficient increase in the demand and supply of the internship as well as the internship matching mechanism in Korea. This network model utilizes international NGOs in order to develop internationally cooperative environment. This model provides mechanism for (1) effectively identifying intern applicants who like to work abroad and evaluating thent (2) effectively identifying new internship positions and evaluating companies which plan to hire interns, (3) efficiently matching demand for and supply of internship by identifying appropriate candidates, (4) monitoring companies for their quality of working conditions and interns for their qualities of work This model for internship has been applied for a NGO which is International CBMC (Christian Businessman Committee International)

• Journal of Information Processing Systems
• /
• v.12 no.2
• /
• pp.183-195
• /
• 2016

This paper presents a complete method for vehicle detection and tracking in a fixed setting based on computer vision. Vehicle detection is performed based on Scale Invariant Feature Transform (SIFT) feature matching. With SIFT feature detection and matching, the geometrical relations between the two images is estimated. Then, the previous image is aligned with the current image so that moving vehicles can be detected by analyzing the difference image of the two aligned images. Vehicle tracking is also performed based on SIFT feature matching. For the decreasing of time consumption and maintaining higher tracking accuracy, the detected candidate vehicle in the current image is matched with the vehicle sample in the tracking sample set, which contains all of the detected vehicles in previous images. Most remarkably, the management of vehicle entries and exits is realized based on SIFT feature matching with an efficient update mechanism of the tracking sample set. This entire method is proposed for highway traffic environment where there are no non-automotive vehicles or pedestrians, as these would interfere with the results.

• 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.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.5
• /
• pp.338-344
• /
• 2014

As the role of information collection becomes increasingly important in the enormous data environment, there is growing demand for more intelligent information technologies for managing complex data. On the other hand, it is difficult to find a solution because of the data complexity and big scaled amount. Accordingly, there is a need for a special intelligent knowledge base frame that can be operated by itself flexibly. In this paper, by adopting switching function for signal transmission in the synapse of the human brain, I/E selective activation based knowledge reconfiguring mechanism is proposed for building more intelligent information management system. In particular, knowledge network design, a special knowledge node structure, Type definition, I/E gauge definition and I/E matching scheme are provided. Using these concepts, the proposed system makes the functions of activation by I/E Gauge, selection and reconfiguration. In a more efficient manner, the routing and reasoning process was performed based on the knowledge reconfiguration network. In the experiments, the process of selection by I/E matching, knowledge reconfiguration and routing & reasoning results are described.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.4
• /
• pp.369-375
• /
• 2008

The kinematics and control problem of a visual alignment system is investigated, which plays a crucial role in the fabrication process of flat panel displays. The first solution is the inverse kinematics of a 4PPR parallel alignment mechanism. It determines the driving distance of each joint to compensate the misalignment between mask and panel. Second, an efficient vision algorithm for fast alignment mark recognition is suggested, where by extracting essential feature points to represent the geometry of a mark, the geometric template matching enables much faster object recognition comparing with the general template matching. Finally, the overall visual alignment process including the kinematic solution, vision algorithm, and joint control is implemented and experimental results are given.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.364-367
• /
• 1995

In this paper, a design method of learning flight control system via input matching is proposed. The proposed learning control system is a simple structure which has an artificial neural network and feedback mechanism, and it is a useful method to control nonlinear systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.736-744
• /
• 2006

For the handhold devices, minimizing repetitive CPU operations such as multiplications is a major factor for their performances. In this paper, we propose efficient algorithms for finding similar sequences from streaming time-series data such as stock prices, network traffic data, and sensor network data. First, we formally define the problem of similar subsequence matching from streaming time-series data, which is called the stream sequence matching in this paper. Second, based on the window construction mechanism adopted by the previous subsequence matching algorithms, we present an efficient window-based approach that minimizes CPU operations required for stream sequence matching. Third, we propose a notion of window MBR and present two stream sequence matching algorithms based on the notion. Fourth, we formally prove correctness of the proposed algorithms. Finally, through a series of analyses and experiments, we show that our algorithms significantly outperform the naive algorithm. We believe that our window-based algorithms are excellent choices for embedded stream sequence matching in handhold devices.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.2
• /
• pp.888-894
• /
• 2011

Blackboard architecture was designed as a means for dealing with ill-defined and complex problems. In order to improve the efficiency of the systems using blackboard architecture, this paper proposes a mechanism for fast detection of knowledge source activations which can contribute potentially to the problem solving of blackboard systems, whenever the state of blackboard is changed. The proposed mechanism uses a Rete network generated from the activation conditions subscribed by all knowledge sources to process the pattern matching between blackboard data and the activation conditions efficiently.