• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.73
• /
• pp.21-42
• /
• 2017

A BPO is an irrevocable undertaking given by an Obligor Bank acting on behalf of the buyer to a Recipient Bank acting on behalf of the seller to pay on satisfaction of certain specified conditions. There have been a Trade Service Utility(TSU), a Transaction Matching Application(TMA) and ISO 20022 TSMT messages that core electronic technical systems linked to the BPO. As a key usefulness of the BPO, it brings to market an alternative means of satisfying the risk mitigation, financing and information management needs of banks and businesses engaged in trade. That is, corporates can spread the risk among multiple Obligor Banks by requesting multiple BPOs for the same trade transaction not to exceed the value of the initial transaction. Since the BPO replaces the manual document checking process with the electronic matching of data, buyers and sellers will benefit from significantly increased accuracy and objectivity. By using BPO, buyers and sellers can become trusted counterparties by demonstrating reliability and giving sellers the assurance of being paid on time as per the payment terms and conditions agreed. When compared to L/C, the BPO requires submission of data only. This requires a change of practice of those accustomed to dealing with physical documentation. The beneficiary of a BPO is the Recipient Bank which is always the Seller's Bank. In the meantime, banks will need to agree between themselves that the URBPO 750 will be applied, modified or excluded. However, customers of banks will face low transactional costs due to a fully automated process and standardized data formats used in international trade documentation. There is no amendment and cancellation rules in the URBPO 750s, but only have Assignment of Proceeds rules. As a result, the BPO is likely to enable new business opportunities, lower costs, fast transaction process and strengthen key customer relationships.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.3068-3085
• /
• 2021

The economics of big data knowledge, especially cloud computing and statistical data of consumer preferences, has attracted increasing academic and industry practitioners' attention. Firms nowadays require purchasing not only external private patent knowledge from other firms, but also proprietary big data knowledge to support their new product development. Extant research investigates pricing strategies of external private patent knowledge and proprietary big data knowledge separately. Yet, a comprehensive investigation of pricing strategies of these two types of knowledge is in pressing need. This research constructs an overarching pricing model of external private patent knowledge and proprietary big data knowledge through the lens of firm profitability as a knowledge transaction recipient. The proposed model can help those firms who purchase external knowledge choose the optimal knowledge structure and pricing strategies of two types of knowledge, and provide theoretical and methodological guidance for knowledge transaction recipient firms to negotiate with knowledge providers.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.783-798
• /
• 2004

An e-business client application in ubiquitous mobile computing environment may become disconnected from the enterprise server due to broken communication connections caused by the limitation of mobile computing environments(limited battery life of the mobile device, low bandwidth communication, incomplete wireless communication infrastructure, etc). It Is even Possible that mobile client application Intentionally operates in disconnected mode to reduce communication cost and the power consumption of the mobile device. We use “data hoarding” as a means of providing local autonomy to allow transactions to be processed and committed on the mobile host despite of disconnection. The key problem to this approach is the synchronization problem that serialize potentially conflicting updates from disconnected clients on master objects of the server database. In this paper, we present a new transaction synchronizing method that splits a transaction into a set of independent component transactions and give the synchronization priority on each component taking the possibility of use and conflicts in the server into consideration. Synchronization is performed component by component based un synchronization priority. After the Preferred component of a no bile transaction succeeds in synchronization with the server, the mobile transaction can pre-commit at server. A pre-committed transaction's updated value is made visible at server before the final commit of the transaction. The synchronization of the component with low synchronization priority can be delayed in adaption to wireless bandwidth and computing resources. As a result, the availability of important data updated by mobile client is increased and it can maximize the utilization of the limited wireless bandwidth and computing resources.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.11-18
• /
• 2000

In this paper we present a new extensible model based upon the concept of subtransactions in real-time transaction systems. The nested transaction model originally proposed by J. Moss is extended for real-time uniprocessor transaction systems by adding explicit timing constraints. Based upon the model, an integrated concurrency control and scheduling algorithm is developed, that not only guarantees timing constraints of a set of real-time transactions but also maintains consistency of the database. The algorithm is based on the priority ceiling protocol of Sha et al. We prove that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of real-time transactions. We use the upper bound on the duration that a transaction can be blocked to show that it is possible to analyze the schedulability of a transaction set using rate-monotonic priority assignment. This work is viewed as a step toward multiprocessor and distributed real-time nested transaction systems. Also, it is possible to be extended to include the real-time multimedia transactions in the emerging web-based database application areas.

• Journal of Digital Contents Society
• /
• v.2 no.2
• /
• pp.117-127
• /
• 2001

Since the number of e-malls is increased by the rapidly Progress of internet, most e-malls are trying to increase customers' interests by providing personalized services. To Provide this service for CRM, the e-mall must use the personalized rules calculated from customer transaction database. The more filtered transaction data are, the more the e-mall services efficiently and exactly to customer's need. The filtered transaction database is necessary to obtain the food personalized rules. In this paper we propose and develope a personalized e-mall with association rules based on view history of excellent customers who have good transaction data. Association rules based on view history of excellent customers reduce the access time and computing costs. The e-mall with them can provide personalized services more efficiently and exactly.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.637-644
• /
• 2001

EJB, providing specification for development and deployment of component based application, permits distributed development as central element of J2EE environment that manages automatically transaction management, persistence, concurrency control that are the most complicated work in enterprise environment. In this paper, we wish to resolve DAO's transaction logic complexity and performance reduction of system in the EJB based legacy system. Therefore, this paper describes the design and implementation of IDAO that applies Iterator pattern. IDAO gets effect that reduces complexity of transaction logic, system overload by database connection, and reduction of performance through container managed transaction.

• The Journal of Economics, Marketing and Management
• /
• v.9 no.2
• /
• pp.1-10
• /
• 2021

Purpose: In this work, we examine several time series models to predict internet and mobile transaction amount in South Korea, whereas Jeong (2020) has obtained the optimal forecasts for online shopping transaction amount by using time series models. Additionally, optimal forecasts based on the model considered can be calculated and applied to the Corona 19 situation. Research design, data, and methodology: The data are extracted from the online shopping trend survey of the National Statistical Office, and homogeneous and comparable in size based on 46 realizations sampled from January 2007 to October 2020. To achieve the goal of this work, both multiplicative ARIMA model and Holt-Winters Multiplicative seasonality method are taken into account. In addition, goodness-of-fit measures are used as crucial tools of the appropriate construction of forecasting model. Results: All of the optimal forecasts for the next 12 months for two online shopping transactions maintain a pattern in which the slope increases linearly and steadily with a fixed seasonal change that has been subjected to seasonal fluctuations. Conclusions: It can be confirmed that the mobile shopping transactions is much larger than the internet shopping transactions for the increase in trend and seasonality in the future.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.406-408
• /
• 2004

To develop enterprise architecture based distributed application needs consideration of various factors such as division of role between web-designer and software developer, defining entity and its usage, database connection and transaction processing. This paper presents DONSL(Data Server of Non SQL-Query) architecture that provides solution to above aspects through web-tier object modeling guaranteeing efficient transaction processing and performance between web-tier and 08MS through simplified usage of query logic property.

• The Korean Journal of Applied Statistics
• /
• v.23 no.4
• /
• pp.739-745
• /
• 2010

This paper computes the repurchase index based on statistical modeling. Using the transaction record of a certain product, the repurchase index is obtained by fitting the Poisson regression model. The customers are classified into 5 groups based on the index giving the information about the propensity to repurchase.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.499-502
• /
• 1999

This paper presents a PCI (Peripheral Component Interconnect) controller embedded in a multimedia processor, called FLOVA (FLOating point VLIW Architecture), targeting for 3D graphics applications. Fast I/O interfaces are essential for multimedia processors which usually handle large amount of multimedia data. Therefore, in FLOVA, PCI bus is adopted for I/O interface due to fast burst transaction. However, there are several problems in implementation and verification to use burst transaction of PCI. It is difficult to handle data transaction between two units which have two different operating frequency. FLOVA has more higher operating frequency about 100MHz than that of PCI local bus and it makes lower utilization of FLOVA bus. Also, traditional simulation is not sufficient for verification of PCI functionality. In this paper, we propose buffering schemes to implement the PCI controller with wide bandwidth and high bus utilization. Also, this paper shows how to verify the PCI controller using real PCI bus environments before its fabrication.