• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.16
• /
• pp.331-359
• /
• 2001

Uniform Electronic Transactions Act (1999) Drafted by the National Conference of Commissioners on Uniform State Laws. The Act allows the use of electronic records and electronic signatures in any transaction, except transactions subject to the Uniform Commercial Code. The fundamental purpose of this act is to remove perceived barriers to electronic commerce. The Act's a procedural statute. It does not mandate either electronic signatures or records, but provides a means to effectuate transactions when they are used. The primary objective is to establish the legal equivalence of electronic records and signatures with paper writings and manually-signed signatures. With regard to the general scope of the Act, the Act's coverage is inherently limited by the definition of "transaction." The Act does not apply to all writings and signatures, but only to electronic records and signatures relating to a transaction, defined as those interactions between people relating to business, commercial and governmental affairs. The exclusion of specific Articles of the Uniform Commercial Code reflects the recognition that, particularly in the case of Articles 5, 8 and revised Article 9, electronic transactions were addressed in the specific contexts of those revision processes. In the context of Articles 2 and 2A the UETA provides the vehicle for assuring that such transactions may be accomplished and effected via an electronic medium. At such time as Articles 2 and 2A are revised the extent of coverage in those Articles(Acts) may make application of this Act as a gap-filling law desirable. Similar considerations apply to the recently promulgated Uniform Computer Information Transactions Act (UCITA). Another fundamental premise of the Act is that it be minimalist and procedural. The general efficacy of existing law, in an electronic context, so long as biases and barriers to the medium are removed, confirms this approach. The Act defers to existing substantive law. Specific areas of deference to other law in this Act include: i) the meaning and effect of "sign" under existing law, ii) the method and manner of displaying, transmitting and formatting information in section 8, iii) rules of attribution in section 9, and iv) the law of mistake in section 10.

• Journal of Korean Society of Archives and Records Management
• /
• v.6 no.1
• /
• pp.43-63
• /
• 2006

This paper aims to analyze of the records schedule's transactions, identify problems of them and suggest improving requirements, especially focusing on similar institutions. The paper examines the process and principle of establishing transactions for the records schedule and analyzes the transactions on the records schedules at 59 national and public university libraries by retention, type, library size and administrative functions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.356-363
• /
• 2002

Transactions in real-time active databases have the notion of activeness where transactions are generated by external effects and another transaction. In this paper, we improve the real -time active concurrency control algorithm by applying Thomas' write rule and considering relationship between transactions fired by active rules. We also present the experimental results of our algorithm comparing other real-time active concurrency control algorithms. The experimental results show that our algorithm has superior performance with respect to the raio of transactions satisfying deadline.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.13
• /
• pp.605-630
• /
• 2000

A letter of credit plays very important roles in rational and smooth international trade. But the parties to letter of credit transactions can bring about many troubles and losses in such transactions because of ignorance and limits of their rights and responsibilities. The purpose of this study is to analyze a legal position of confirming bank and limits of responsibilities of the confirming bank on the UCP and authoritative decisions by ICC. I attempts to analyze a legal position of confirming bank and limits of responsibilities between the confirming bank and the contract parties at the documentary credit transactions on the basis of theoretical, lawful, and international transactions.

• Management & Information Systems Review
• /
• v.6
• /
• pp.1-19
• /
• 2001

Partial transactions which use computer networks are formed in the cyberspace due to rapid progress of communication and computer technology. Electronic business transactions have security problems according to the special quality of opening networks, while it can be approached easily by anyone without being tied to time and places through Internets. To revitalize the electronic business transactions, security technology which can establish its security and trust is the prior task and both safe information communication and better information security service offer are essential factors. The method to exchange information through Internets must be made after confirming one another's exact connection in the mutual identity certification to prevent a lot of threat which can occur in the use of password techniques. To satisfy these electronic business transactions, we intend to increase understanding of authentication algorithm provided with authentication function of messages and users as well to plan safety and trust of business information and contents in the electronic business transactions.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.763-766
• /
• 2011

Timely management is an important activity in long running transactions. This can be seen in many Supply Chain scenarios where insufficient time management could lead to expensive compensations. Therefore, effective strategy for timely management in long running transactions is needed. In this paper, we propose our solution to detect and avoid violating deadline based on a comparison strategy of predicted complete time and required deadline. Three approaches are used. Firstly, we build Open Nested Transaction Model (ONTM) where deadline of top-level transactions are managed through a flexible time adjustment of lower level transactions. Secondly, workflow is introduced to WSTransaction framework which supports the algorithm to predict complete time and spot delaying activities. Thirdly, a rule-based coordinator is developed to decide the confirmation or cancelation of participants' ongoing activities. We also discuss a workflow example for implementation.

• International Journal of Computer Science & Network Security
• /
• v.24 no.4
• /
• pp.1-10
• /
• 2024

In the era of big data, the growth of e-commerce transactions brings forth both opportunities and risks, including the threat of data theft and fraud. To address these challenges, an automated real-time fraud detection system leveraging machine learning was developed. Four algorithms (Decision Tree, Naïve Bayes, XGBoost, and Neural Network) underwent comparison using a dataset from a clothing website that encompassed both legitimate and fraudulent transactions. The dataset exhibited an imbalance, with 9.3% representing fraud and 90.07% legitimate transactions. Performance evaluation metrics, including Recall, Precision, F1 Score, and AUC ROC, were employed to assess the effectiveness of each algorithm. XGBoost emerged as the top-performing model, achieving an impressive accuracy score of 95.85%. The proposed system proves to be a robust defense mechanism against fraudulent activities in e-commerce, thereby enhancing security and instilling trust in online transactions.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.439-446
• /
• 2003

A crucial limitation in environments where data is broadcast to very large client populations is the low bandwidth available for clients to communicate with servers. Many advanced applications are developed in mobile computing environments, but conventional concurrency controls are not suitable because of the low bandwidth of wireless network. In this paper, we propose a new optimistic concurrency control protocol for mobile transactions. In this protocol, mobile read-only transactions can be completed locally at the clients without additional communication, only mobile update transactions are sent to the server for global validation. Our protocol reduces unnecessary aborts occurred in the previous study using only conflict information. In addition to, our algorithm can detect and resolve non-serializable execution using by data table maintained in a server.

• International Commerce and Information Review
• /
• v.11 no.2
• /
• pp.233-257
• /
• 2009

The 21st century is witnessing the explosive increase in the usage of internet and international electronic transactions. Due to the unique characteristics of the electronic information, substantial part of such transaction can and do take the form of cross-border transactions. However, there have not been settled appropriate set of rules applicable to the international electronic transactions. Currently, in respect to e-L/C transactions in international trade, there are laws such as Electronic Transaction Basic Act in our country, E-Trade Promotion Act, E-Signature Law, Act on Promotion of Information and Communication Network Utilization and Information Protection and Marine Charter 5 in the Commercial Law. Nevertheless, a complete legislation, that is a uniform rule for e L/C which could support e L/C transactions fully hasn't been established yet. Accordingly, those laws concerned need to improve to regulate e-L/C transactions. The purpose of this paper is to look into the national status for law readjustment to prepare for a new electronic environment and to use appropriately the e-L/C issued by electronic means, and to conduct a comparative analysis on the related regulations to introduce a pertinent laws and propose related regulations to contribute to the making of effective laws to regulate e-L/C.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.210-212
• /
• 2000

In this paper, we present a comcurrency control scheme over the index structure in main memory databases using multiversion mechanism, and implement it on T-tree. As a well-known idea for comcurrency control, multiversion allows multiple transactions to reat and write different versions of the same data item, each transaction sees a consistent set of versions for all the data items it accesses[1]. Logical versioning and physical versioning techniques are used to keep versions of data item and versions of index node respectively. The main features of this multiversion indexing approach are (1)update operations and rotations on T-tree can take place concurrently, (2)the number of locking and latching requirement is sharply reduced because read-only transactions do not obtain any locks or latches and update transactions obtain latches only when actually performing the update, (3)it reduces storage overhead for tracking version and reclaims storage in time, and (4)it provides complete isolation of read-only transactions from update transactions, so the read-only transactions can get response information without any block.