Relevant bibliographies by topics / Transaction

Academic literature on the topic 'Transaction'

Author: Grafiati
Published: 4 June 2021
Last updated: 21 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Transaction.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Transaction"

1

Frolov, D. P. "From transaction costs to transaction value: Overcoming the frictional paradigm." Voprosy Ekonomiki, no. 8 (August 3, 2020): 51–81. http://dx.doi.org/10.32609/0042-8736-2020-8-51-81.

Full text
Abstract:
The transaction cost economics has accumulated a mass of dogmatic concepts and assertions that have acquired high stability under the influence of path dependence. These include the dogma about transaction costs as frictions, the dogma about the unproductiveness of transactions as a generator of losses, “Stigler—Coase” theorem and the logic of transaction cost minimization, and also the dogma about the priority of institutions providing low-cost transactions. The listed dogmas underlie the prevailing tradition of transactional analysis the frictional paradigm — which, in turn, is the foundation of neo-institutional theory. Therefore, the community of new institutionalists implicitly blocks attempts of a serious revision of this dogmatics. The purpose of the article is to substantiate a post-institutional (alternative to the dominant neo-institutional discourse) value-oriented perspective for the development of transactional studies based on rethinking and combining forgotten theoretical alternatives. Those are Commons’s theory of transactions, Wallis—North’s theory of transaction sector, theory of transaction benefits (T. Sandler, N. Komesar, T. Eggertsson) and Zajac—Olsen’s theory of transaction value. The article provides arguments and examples in favor of broader explanatory possibilities of value-oriented transactional analysis.
APA, Harvard, Vancouver, ISO, and other styles
2

Derlytsia, Andrii. "THE CONCEPTUAL FOUNDATIONS OF TRANSACTIONAL ANALYSIS OF PUBLIC FINANCE." Economic Analysis, no. 30(3) (2020): 72–80. http://dx.doi.org/10.35774/econa2020.03.072.

Full text
Abstract:
Introduction. One of the least developed areas of the theory of economic institutionalism is transactional analysis of public finance. Its component – the theory of transaction costs, is mainly applied to the sphere of functioning of economic entities and the financial market. This necessitates the study of transactions in public finance as an economic phenomenon that requires an integrated approach and goes beyond purely transaction costs. The purpose of the article. The aim is to study the conceptual foundations, method and key areas of transactional analysis of public finance as a scientific field of institutional research. Method. To achieve this goal, the following general scientific methods were used: scientific abstraction, in highlighting the essential features of transactional analysis of public finance; comparative analysis, when assessing the differences in transaction costs in the public and market sectors; a systematic approach in identifying the components of transactional analysis of public finance. Results. Transactional analysis of public finance as a component of institutional research of public finance is considered. The role of transaction costs in the public sphere is shown and their ability to positively influence the efficiency of public finance due to the optimization of resource allocation in the public sector is substantiated. It is indicated that transaction costs in the public sphere are a necessary element to ensure compliance with supply and demand of public goods and other state services, which leads to increased utility of participants in collective interaction. The characteristic of the method of transactional analysis of public finance and its features is given. The main directions of transactional analysis of public finance from the standpoint of comparison of transaction costs, transaction losses and transaction benefits are outlined. The dualistic nature of transaction costs in relation to transformation costs is shown.
APA, Harvard, Vancouver, ISO, and other styles
3

Kaur, Harpreet, Mritunjay Kumar, and Gulshan Kumar. "Performance evaluation of conflict serializability against 2PL in Homogenous Distributed Database." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 7, no. 1 (April 21, 2013): 510–17. http://dx.doi.org/10.24297/ijct.v7i1.3481.

Full text
Abstract:
There are many techniques in the recent years that provide the synchronization among the transactions using shared data like 2 phase locking protocol and time stamping in distributed database system. These techniques are efficient and provide fast transactional operations and serializable execution of the transactions. But these existing techniques like 2PL abort the transaction when a conflict occurs in transaction actions that result in degradation in the performance. In this dissertation we analyse the purposed techniques that provide the serial execution of the concurrent transactions. To achieve the serializability among the transactions in the distributed database Conflict serializability model is used that will provide serial execution of the transactions with in conflict actions of the transactions. The objectives of the scheme are achieved that provide the better performance than the existing 2PL schemes and achieve the consistency among the concurrent transaction execution. Performance is evaluated of CS model against the 2PL model in distributed database to sustain the synchronization in the transactions. Results illustrate that the proposed new scheme increase the performance by decreasing the abort rate in distributed environment.
APA, Harvard, Vancouver, ISO, and other styles
4

Suardana, Ida Bagus Raka, Luh Kadek Budi Martini, Nyoman Sri Subawa, and Made Setini. "Quality factors in technology system capability decision interest in transactions using mobile banking." International Journal of Data and Network Science 6, no. 1 (2022): 1–8. http://dx.doi.org/10.5267/j.ijdns.2021.11.003.

Full text
Abstract:
The purpose of this study was to determine the effect of ease of use, transaction success rate, and technological system capability on trust and to determine the effect of ease of use, transaction success rate, technology system capability and interest in transaction using mobile banking. This research was conducted at PT Bank NIAGA which is located in Denpasar. The data collection technique used a questionnaire to 160 PT Bank NIAGA customers who were selected as samples. Data were analyzed by Structural Equation Modeling (SEM) with AMOS program. Ease of use, transaction success rate, and technology system capability have a positive and significant influence on trust and interest in transacting using mobile banking. This means that the better the ease of use, the success rate of transactions, and the capability of the technology system, the higher the customer trust and interest in transactions using mobile banking.
APA, Harvard, Vancouver, ISO, and other styles
5

David, Shibin, Jaspher W. Kathrine, K. Martin Sagayam, and Krit Salahddine. "Augmenting integrity and scalability in mobile payment applications using blockchain." E3S Web of Conferences 297 (2021): 01063. http://dx.doi.org/10.1051/e3sconf/202129701063.

Full text
Abstract:
The transactional information from the mobile wallets is offloaded from the mobile device to the mobile transaction server. The transaction involves various communication standards, confidential transaction information to ensure flawless transaction of data. There exist several encryption techniques to preserve confidentiality, hashing schemes to prove the integrity, signature schemes to prove the identity in the mobile transaction using mobile wallet applications. Even though mobile wallet possesses secure algorithms, the transactions are facing security issues such as double spending, lack of dispute redressal issue, lack of forward secrecy, lack of anonymity in the transaction and security. Therefore, Blockchain based Mobile transaction Scheme is proposed to solve the security issues including integrity, double spending and improve scalability. This paper presents a strategy which implements blockchain framework by using irreversible keys for mobile wallet applications. The proposed scheme proves to be secure against the security attacks and enhances integrity and scalability compared to the existing schemes.
APA, Harvard, Vancouver, ISO, and other styles
6

CABALLERO, GONZALO, and DAVID SOTO-OÑATE. "Why transaction costs are so relevant in political governance? a new institutional survey." Revista de Economia Política 36, no. 2 (June 2016): 330–52. http://dx.doi.org/10.1590/0101-31572016v36n02a05.

Full text
Abstract:
ABSTRACT The New Institutional Economics, led by four Nobel laureates (Ronald Coase, Douglass North, Oliver Williamson and Elinor Ostrom), has showed that institutions and organizations are a medium for reducing transaction costs and obtaining a higher efficiency in economic performance. This paper goes into the research program of the New Institutional Economics to explain the relevance of transaction costs in political exchange and organization and show that transactions costs are even higher in political markets than in economic markets. The paper reviews the main contributions on institutions, transaction costs and political governance, and provides some lessons on political transacting and governance. The survey includes the most detailed catalogue of political transaction costs that has ever been published.
APA, Harvard, Vancouver, ISO, and other styles
7

Sytnyk, Ye А. "Is there a general equivalent of transaction costs?" Management of Economy: Theory and Practice. Chumachenko’s Annals, no. 2021 (December 23, 2021): 226–39. http://dx.doi.org/10.37405/2221-1187.2021.226-239.

Full text
Abstract:
The article raises the question of the existence of a general equivalent of transaction costs other than money. A distinction was made between the concepts of transaction costs and transaction actions. The definition of transaction costs is given as a cost (in the sense of costs of value and time) trace of transactional actions. The concept of a continuum of transactional actions was introduced. the composition of the continuum of transactional actions is outlined and the main reasons for its increase in the modern economy are identified. among these reasons are specific to the economy, which is transitioning from a Soviet-type command-administrative system to a market one. The mechanism of displacement of market transactions by the firm has been specified. Transactional substitution is a process (processes) of the firm’s performance of a certain set of transactional actions that accompany transformational processes from their beginning to their end. Transaction substitution is related to the transaction capacity of the institute. Correspondence between subsets of the continuum of transactional actions and transformational (production) processes is established. The concept of an agerative system is introduced as one of the two large systems that support symmetry in the economy, and which exists in parallel with the market or commodity-money system. Agerative system is built on the basis of management actions and is a complex of management, transactional actions of all types and types. A table was created in which the main correspondences between transformational and transactional types of processes and the economic phenomena generated by them are placed. Transformational and transactional processes generate different types of economic phenomena. If in transformational processes goods are created, more precisely, natural-material bodies of goods as carriers of value, then institutions are created in transactional processes. If as a result of the development of transformational (production) processes there is an accumulation of capital (which, in fact, is the goal of capitalist production), then as a result of the development of transactional processes there is an accumulation of managerial power. The goal of bureaucracy is to increase and concentrate managerial power. Keywords continuum of transactional actions, transactional actions, transactional costs, transformational processes, the transaction envelope of the production process, the total equivalent of transaction costs, physical goods, carriers of value, agerative system, levels of hierarchy, unit of hierarchical complexity, transactional capacity of institutions, institutional (institutional) competition.
APA, Harvard, Vancouver, ISO, and other styles
8

Khattri, Vipin, and Sandeep Kumar Nayak. "Identification and Mitigation of Fraudulent Transaction using Deep Autoencoder." Journal of University of Shanghai for Science and Technology 23, no. 11 (November 28, 2021): 769–75. http://dx.doi.org/10.51201/jusst/21/11956.

Full text
Abstract:
In an ancient era, physical resources used to apply for transacting messages, treaty content, monarchy schemes, and policies and associated national or territorial currency which consumes time duration in the heavy count with negligible security. But as time passes, technological advancement has tendered its valuable and qualitative inputs to make the conventional transaction more better at its highest level of the extent, and as a qualitative and progressive resultant, the world is breathing in the current era of the digital environment with high-security priority. The responsibility of researchers and concerned authorities is to protect the online digital transaction under the safe digital environment. Therefore continuous enhancement is required in the upgrade of the security of the transaction system to handle digital transaction fraud. This research study suggests an approach of deep autoencoder for identifying fraudulent payment card transactions. To assess the outcome and validity of the projected approach of deep autoencoder for identifying fraudulent payment card transactions, testing was executed with the help of two datasets. The first dataset is a real credit card fraud dataset that is public available in world and the second dataset are generated by collecting the data using payment card transaction including genuine transaction and fraudulent transactions. A comparative analysis performed which is based on a comparison with different method and used first dataset. The proposed integration approach performed exceptionally with the different method and accomplished the maximum performance with respect to area under receiver operating characteristic curve (AUC) (95.66%).
APA, Harvard, Vancouver, ISO, and other styles
9

WANG, CHENG, and YOUFENG WU. "FROM LOCKS TO CORRECT AND EFFICIENT TRANSACTIONAL MEMORY." Journal of Circuits, Systems and Computers 21, no. 02 (April 2012): 1240005. http://dx.doi.org/10.1142/s0218126612400051.

Full text
Abstract:
Transactional memory addresses a number of important issues in lock-based parallel programs. Unfortunately, the semantics of transactions are different from those of critical sections defined by locks. The semantic differences make it difficult to correctly port existing lock-based programs to transaction-based programs. Experienced programmers accustomed to lock-based programming can easily make mistakes in transaction-based programming as parallel programs running correctly using locks can run incorrectly when critical sections are converted to using transactions. This problem becomes even more severe in porting lock-based programs to use the efficient software transactional memory. In this paper, we first identify three necessary properties in a program for the program execution using transactions to be equivalent to the program execution using locks. Assuming that the input lock-based program satisfies the necessary properties (i.e., a well-behaved parallel program), we next present a correctness condition to verify the transactional memory implementation in order for the program execution using transactions to be equivalent to the program execution using locks. Finally, we develop a correct and efficient software transactional memory implementation that satisfies the correctness condition so that locks in the well-behaved parallel programs can be converted to use the efficient software transactional memory easily and correctly.
APA, Harvard, Vancouver, ISO, and other styles
10

Qiu, Leiju, Yang Zhao, Qian Liu, Baowen Sun, and Xiaolin Wu. "Intelligent transaction: definition, modes, and research directions." International Journal of Crowd Science 3, no. 1 (May 10, 2019): 36–48. http://dx.doi.org/10.1108/ijcs-08-2018-0017.

Full text
Abstract:
Purpose In the crowd intelligence networking era, the smart connections of human, machines and things enable point-to-point trustable transactions and distributed efficient collaboration; the smart connections among government, enterprises, organizations and the public would enable active participation of the public in society management and decision-making and improve the efficiency of government management and services. All interactions among various agents can be viewed as the transaction activity. The social division of labor system drives the evolution of transaction. The transaction mode also differentiated into different patterns with the development of human society. What will be the intelligent transaction in the crowd intelligence networking era? What will be the transactions modes and rules in the crowd intelligence networking era? The answers to these questions are of great importance to the future development of transactions. Design/methodology/approach The authors review the evolution of traditional transaction and transaction modes and analyze the driving forces of it. They attempt to give the definitions of intelligent transaction and intelligent transaction mode. They also review the traditional transaction modes and rules, analyze the characteristics of the intelligent transaction and classify the intelligent transaction modes. Findings The authors find the intelligent transaction is mainly reflected in the intellectualization of transaction subject, transaction object and transaction process. They summarize the characteristics of intelligent transaction and develop four modes for the intelligent transactions based on the modularization level of the transaction objects and the quantity of transaction subjects, including the demand side and the supply side. The authors also show representative examples to further illustrate rules and features of these transaction modes and point out the potential research directions. Originality/value This study is among the first to analyze the characteristics of the intelligent transaction, and the proposed division framework of the intelligent transaction modes could not only add value to the future research of intelligent transaction modes and rules but also help to guide the transactions in the crowd intelligence network.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Transaction"

1

Yoo, Richard M. "Adaptive transaction scheduling for transactional memory systems." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/22587.

Full text
Abstract:
Thesis (M. S.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2008.
Committee Chair: Lee, Hsien-Hsin; Committee Member: Blough, Douglas; Committee Member: Yalamanchili, Sudhakar.
APA, Harvard, Vancouver, ISO, and other styles
2

Burger, Albert G. "Branching transactions : a transaction model for parallel database systems." Thesis, University of Edinburgh, 1996. http://hdl.handle.net/1842/15591.

Full text
Abstract:
In order to exploit parallel computers, database management systems must achieve a high level of concurrency when executing transactions. In a high contention environment, however, concurrency is severely limited due to transaction blocking, and the utilisation of parallel hardware resources, e.g. multiple CPUs, can be low. In this dissertation, a new transaction model, Branching Transactions, is proposed. Under branching transactions, more than one possible path of execution of a transaction is followed up in parallel, which allows us to avoid unnecessary transaction blockings and restarts. This approach uses additional hardware resources, mainly CPU - which would otherwise sit idle due to data contention - to improve transaction response time and throughput. A new transaction model has implications for many transaction processing algorithms, in particular concurrency control. A family of locking algorithms, based on multi-version two-phase locking, has been developed for branching transactions, including an algorithm which can dynamically switch between branching and non-branching modes. The issues of deadlock handling and recovery are also considered. The correctness of all new concurrency control algorithms is proved by extending traditional serializability theory so that it is able to cope with the notion of a branching transaction. Architectural descriptions of branching transaction systems for shared-memory parallel data-bases and hybrid shared-disk/shared-memory systems are discussed. In particular, the problem of cache coherence is addressed. The performance of branching transactions in a shared-memory parallel database system has been investigated, using discrete-event simulation. One field which may potentially benefit greatly from branching transactions is that of so-called "real-time" database systems, in which transactions have execution deadlines. A new real-time concurrency control algorithm based on branching transactions is introduced.
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Jinle. "Model checking transaction properties for concurrent real-time transactions in UPPAAL." Thesis, Mälardalens högskola, Inbyggda system, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-31782.

Full text
Abstract:
As a technique to ensure absence of undesired interference in transactional computations, Concurrency Control (CC) guarantees logical data consistency via providing transaction isolation, thus contributing to their dependability. However, single-version CC, which requires that a transaction system always works on the current version of a data item, may introduce unpredictable delays for real-time transactions because of unbounded blocking time which may cause deadline misses. Compared to single-version CC (current value of a data item is available but the historical values are overwritten and not accessible) mechanism, multi-version Concurrency Control (MVCC, historical values of a data item are maintained in a version list and accessible) mechanisms have several advantages. The benefit of multiple versions for concurrency control is helping the scheduler avoid rejecting operations, which could improve the concurrency for real-time transaction systems. Because transactions are less likely to be blocked using MVCC, timeliness could be improved. Transaction isolation levels, out of which the serializable one is the highest, control the degree of interference-freedom of concurrent transactions. Instead of serializable isolation, some MVCC mechanisms are known to achieve a relaxed level of isolation. In order to select an appropriate MVCC mechanism that guarantees both timeliness and an acceptable level of isolation for a given transaction set, trade-off analysis between isolation and timeliness is necessary. However, even though approaches have been proposed to analyze timeliness and isolation together, they only focus on lock-based single-version concurrency control algorithms, not on MVCC. In this thesis, we focus on modeling multi-version based real-time transaction system as a network of timed automata, and verify the consistency of the tradeoff transaction timeliness and isolation in UPPAAL. We propose a modular modeling approach to model real-time multi-version transaction systems by reusing and extending set of basic blocks. The proposed approach not only reduces the modeling efforts, but also enables easy adjustment for adapting current MVCC mechanism to another. Assuming a given transaction set, we model three MVCC algorithms including multi-version Timestamp Ordering, a variant of multi-version Two-Phase locking and a Two-Version Priority Ceiling Protocol, and verify both timeliness and isolation level. The verification results show that Two-Version Priority Ceiling Protocol outperforms the other two MVCC algorithms with the given transaction set.
APA, Harvard, Vancouver, ISO, and other styles
4

Orenc, Zulfu. "A Study Of Kangaroo Transaction Model For Mobile Transaction Management." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605255/index.pdf.

Full text
Abstract:
Wireless network technology has advanced to the point that it is possible to use Internet connectivity to perform job tasks while moving in a city. We simulate and experimentally evaluate Dunham&rsquo
s Kangaroo Transaction (KT) model, and a modified version of it. Our results show that the modified-KT model does not have much communication overhead (although more than the original KT model) and it is more resilient to failures of base stations.
APA, Harvard, Vancouver, ISO, and other styles
5

AlSobeh, Anas Ahmad. "Improving Reuse of Distributed Transaction Software with Transaction-Aware Aspects." DigitalCommons@USU, 2015. https://digitalcommons.usu.edu/etd/4590.

Full text
Abstract:
Implementing crosscutting concerns for transactions is difficult, even using Aspect-Oriented Programming Languages (AOPLs) such as AspectJ. Many of these challenges arise because the context of a transaction-related crosscutting concern consists of loosely-coupled abstractions like dynamically-generated identifiers, timestamps, and tentative value sets of distributed resources. Current AOPLs do not provide joinpoints and pointcuts for weaving advice into high-level abstractions or contexts, like transaction contexts. Other challenges stem from the essential complexity in the nature of the data, operations on the data, or the volume of data, and accidental complexity comes from the way that the problem is being solved, even using common transaction frameworks. This dissertation describes an extension to AspectJ, called TransJ, with which developers can implement transaction-related crosscutting concerns in cohesive and loosely-coupled aspects. It also presents a preliminary experiment that provides evidence of improvement in reusability without sacrificing the performance of applications requiring essential transactions. This empirical study is conducted using the extended-quality model for transactional application to define measurements on the transaction software systems. This quality model defines three goals: the first relates to code quality (in terms of its reusability); the second to software performance; and the third concerns software development efficiency. Results from this study show that TransJ can improve the reusability while maintaining performance of TransJ applications requiring transaction for all eight areas addressed by the hypotheses: better encapsulation and separation of concern; loose Coupling, higher-cohesion and less tangling; improving obliviousness; preserving the software efficiency; improving extensibility; and hasten the development process.
APA, Harvard, Vancouver, ISO, and other styles
6

Manifavas, Charalampos. "Micropayment transaction costs." Thesis, University of Cambridge, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620643.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ponsard, Anne-Laure. "La transaction administrative." Thesis, Paris 10, 2015. http://www.theses.fr/2015PA100200/document.

Full text
Abstract:
This thesis offers to study “la transaction administrative” (agreement between two public agencies and a public agency and private individual in order to resolve conflict) in consideration of its legal environment: a transactional method of resolution administrative dispute can it validly grows into French law? It appears that the administrative transaction has developed where it is designated to do so. Promote this mode of dispute resolution assumed to clarify the definition and the legal regime. Here, like the transaction of private law, the administrative transaction is characterized by three elements: the existence of a dispute- under the administrative judge - an agreement and mutual concessions. Their apprehension is, however, subject to some adjustments to take account of the issues of administrative law that necessarily raise administrative disputes. This is a transaction largely inspired by the transaction of private law and slightly derogatory to common law that the Conseil d’Etat has shaped. The administrative transaction has been actually developed. However, a bigger development does not seem possible, at least in the short term, as the obstacles are significant. These are numerous, of heterogeneous nature and in some cases, hardly remediable. Neither the French legal system, nor the characteristics of the transaction allow a massive development of this dispute resolution. It is therefore likely that the administrative transaction remains in France, a secondary means of dispute resolution. But secondary does not necessarily mean minor, and if further progress is possible, the result of the administrative transaction is, essentially, very honourable
La présente thèse se propose d’étudier la transaction administrative à l’aune de son environnement juridique : un mode transactionnel de règlement des litiges administratifs peut-il valablement se développer en droit français ? Il apparaît alors que la transaction administrative s’est développée là où elle est désignée pour ce faire. Promouvoir ce mode de règlement des litiges supposait d’en clarifier la définition et le régime juridique. En l’occurrence, comme la transaction de droit privé, la transaction administrative est caractérisée par trois éléments : l’existence d’un litige ─ relevant du juge administratif ─, un accord de volontés et des concessions réciproques. Leur appréhension fait, en revanche, l’objet de quelques adaptations de façon à tenir compte des problématiques du droit administratif que soulèvent nécessairement les litiges administratifs. C’est donc une transaction largement inspirée de la transaction de droit privé et faiblement dérogatoire au droit commun que le Conseil d’Etat a façonnée. Depuis, la transaction administrative s’est effectivement développée. Toutefois, un plus grand développement encore ne semble pas envisageable, du moins à court terme, tant les entraves sont importantes. Celles-ci sont nombreuses, de nature hétéroclite et pour certaines, difficilement remédiables. Ni le système juridique français, ni les caractéristiques propres de la transaction ne se prêtent à un développement massif de ce mode de règlement des litiges. Il est donc probable que la transaction administrative demeure, en droit français, un mode secondaire de règlement des litiges. Mais secondaire ne signifie pas nécessairement mineur, et si des progrès sont encore envisageables, le bilan de la transaction administrative est, pour l’essentiel, très honorable
APA, Harvard, Vancouver, ISO, and other styles
8

Solis-Webster, Martha Julia. "Information asymmetry and transaction costs in a cross-cultural business transaction." reponame:Repositório Institucional do FGV, 2014. http://hdl.handle.net/10438/13468.

Full text
Abstract:
Submitted by Martha Julia Solis-Webster (martha.solis-webster2015@fgvmail.br) on 2015-02-20T19:39:38Z No. of bitstreams: 1 Martha Julia Solis Webster.pdf: 531477 bytes, checksum: 1760876a79e90f3709409c233275ea87 (MD5)
Approved for entry into archive by Marcia Bacha (marcia.bacha@fgv.br) on 2015-03-03T12:34:15Z (GMT) No. of bitstreams: 1 Martha Julia Solis Webster.pdf: 531477 bytes, checksum: 1760876a79e90f3709409c233275ea87 (MD5)
Approved for entry into archive by Marcia Bacha (marcia.bacha@fgv.br) on 2015-03-03T12:34:37Z (GMT) No. of bitstreams: 1 Martha Julia Solis Webster.pdf: 531477 bytes, checksum: 1760876a79e90f3709409c233275ea87 (MD5)
Made available in DSpace on 2015-03-03T12:34:54Z (GMT). No. of bitstreams: 1 Martha Julia Solis Webster.pdf: 531477 bytes, checksum: 1760876a79e90f3709409c233275ea87 (MD5) Previous issue date: 2014-11-24
The intent of this paper is to provide a practitioners insight into the present and foreseeable future of problem of transaction cost economics related to culture and business etiquette that may increase the of complexity of business communication. We will also explore whether it impacts participant's mindsets regarding opportunistic or passive aggressive behavior. We will study the role of culture, ethics, information asymmetry, and legal systems regarding their importance towards the business contracts and lack of knowledge in local environments. We will make connections to contract theory strategies and objectives and recommend business practices. Furthermore, economic theory explores the role of the impossibility of the perfect contract. Historical and present day operational factors are examined for the determination of forward-looking contract law indications worldwide. This paper is intended provide a practitioners view with a global perspective of a multinational, mid-sized and small corporations giving consideration in a non-partisan and non-nationalistic view, yet examines the individual characteristics of the operational necessities and obligations of any corporation. The study will be general, yet cite specific articles to each argument and give adequate consideration to the intricacies of the global asymmetry of information. This paper defends that corporations of any kind and size should be aware of the risk of international business etiquette and cultural barriers that might jeopardize the savings you could obtain from engaging international suppliers.
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Qinjin. "Multi Data center Transaction Chain : Achieving ACID for cross data center multi-key transactions." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-198664.

Full text
Abstract:
Transaction support for Geo-replicated storage system is one of the most popular challenges in the last few years. Some systems gave up for supporting transactions and let upper application layer to handle it. While some other systems tried with different solutions on guaranteeing the correctness of transactions and paid some efforts on performance improvements. However, there are very few systems that claim the supporting of ACID in the global scale. In this thesis, we have studied on various data consistency and transaction design theories such as Paxos, transaction chopping, transaction chain, etc. We have also analyzed several recent distributed transactional systems. As the result, a Geo-replicated transactional framework, namely Multi Data center Transaction Chain (MDTC), is designed and implemented. MDTC adopts transaction chopping approach, which brings more concurrency by chopping transactions into pieces. A two phase traversal mechanism is designed to validate and maintain dependencies. For cross data center consistency, a Paxos like majority vote protocol is designed and implemented as a state machine. Moreover, some tuning such as executing read-only transaction locally helps to improve performance of MDTC in different scenarios. MDTC only requires 1 cross data center message roundtrip for executing a distributed transaction globally. ACID properties are kept in MDTC. We have evaluated MDTC with an extended TPC-C benchmark on top of Cassandra. The results from various setups have been evaluated and the result shows that MDTC achieves a good performance on throughout and latency. Meanwhile it has very low abort rate and scales well for transactions executed in a global scale.
APA, Harvard, Vancouver, ISO, and other styles
10

Mohamedin, Mohamed Ahmed Mahmoud. "On Optimizing Transactional Memory: Transaction Splitting, Scheduling, Fine-grained Fallback, and NUMA Optimization." Diss., Virginia Tech, 2015. http://hdl.handle.net/10919/56577.

Full text
Abstract:
The industrial shift from single core processors to multi-core ones introduced many challenges. Among them, a program cannot get a free performance boost by just upgrading to a new hardware because new chips include more processing units but at the same (or comparable) clock speed as the previous generation. In order to effectively exploit the new available hardware and thus gain performance, a program should maximize parallelism. Unfortunately, parallel programming poses several challenges, especially when synchronization is involved because parallel threads need to access the same shared data. Locks are the standard synchronization mechanism but gaining performance using locks is difficult for a non-expert programmers and without deeply knowing the application logic. A new, easier, synchronization abstraction is therefore required and Transactional Memory (TM) is the concrete candidate. TM is a new programming paradigm that simplifies the implementation of synchronization. The programmer just defines atomic parts of the code and the underlying TM system handles the required synchronization, optimistically. In the past decade, TM researchers worked extensively to improve TM-based systems. Most of the work has been dedicated to Software TM (or STM) as it does not requires special transactional hardware supports. Very recently (in the past two years), those hardware supports have become commercially available as commodity processors, thus a large number of customers can finally take advantage of them. Hardware TM (or HTM) provides the potential to obtain the best performance of any TM-based systems, but current HTM systems are best-effort, thus transactions are not guaranteed to commit in any case. In fact, HTM transactions are limited in size and time as well as prone to livelock at high contention levels. Another challenge posed by the current multi-core hardware platforms is their internal architecture used for interfacing with the main memory. Specifically, when the common computer deployment changed from having a single processor to having multiple multi-core processors, the architects redesigned also the hardware subsystem that manages the memory access from the one providing a Uniform Memory Access (UMA), where the latency needed to fetch a memory location is the same independently from the specific core where the thread executes on, to the current one with a Non-Uniform Memory Access (NUMA), where such a latency differs according to the core used and the memory socket accessed. This switch in technology has an implication on the performance of concurrent applications. In fact, the building blocks commonly used for designing concurrent algorithms under the assumptions of UMA (e.g., relying on centralized meta-data) may not provide the same high performance and scalability when deployed on NUMA-based architectures. In this dissertation, we tackle the performance and scalability challenges of multi-core architectures by providing three solutions for increasing performance using HTM (i.e., Part-HTM, Octonauts, and Precise-TM), and one solution for solving the scalability issues provided by NUMA-architectures (i.e., Nemo). - Part-HTM is the first hybrid transactional memory protocol that solves the problem of transactions aborted due to the resource limitations (space/time) of current best-effort HTM. The basic idea of Part-HTM is to partition those transactions into multiple sub-transactions, which can likely be committed in hardware. Due to the eager nature of HTM, we designed a low-overhead software framework to preserve transaction's correctness (with and without opacity) and isolation. Part-HTM is efficient: our evaluation study confirms that its performance is the best in all tested cases, except for those where HTM cannot be outperformed. However, in such a workload, Part-HTM still performs better than all other software and hybrid competitors. - Octonauts tackles the live-lock problem of HTM at high contention level. HTM lacks of advanced contention management (CM) policies. Octonauts is an HTM-aware scheduler that orchestrates conflicting transactions. It uses a priori knowledge of transactions' working-set to prevent the activation of conflicting transactions, simultaneously. Octonauts also accommodates both HTM and STM with minimal overhead by exploiting adaptivity. Based on the transaction's size, time, and irrevocable calls (e.g., system call) Octonauts selects the best path among HTM, STM, or global locking. Results show a performance improvement up to 60% when Octonauts is deployed in comparison with pure HTM with falling back to global locking. - Precise-TM is a unique approach to solve the granularity of the software fallback path of best-efforts HTM. It provide an efficient and precise technique for HTM-STM communication such that HTM is not interfered by concurrent STM transactions. In addition, the added overhead is marginal in terms of space or execution time. Precise-TM uses address-embedded locks (pointers bit-stealing) for a precise communication between STM and HTM. Results show that our precise fine-grained locking pays off as it allows more concurrency between hardware and software transactions. Specifically, it gains up to 5x over the default HTM implementation with a single global lock as fallback path. - Nemo is a new STM algorithm that ensures high and scalable performance when an application workload with a data locality property is deployed. Existing STM algorithms rely on centralized shared meta-data (e.g., a global timestamp) to synchronize concurrent accesses, but in such a workload, this scheme may hamper the achievement of scalable performance given the high latency introduced by NUMA architectures for updating those centralized meta-data. Nemo overcomes these limitations by allowing only those transactions that actually conflict with each other to perform inter-socket communication. As a result, if two transactions are non-conflicting, they cannot interact with each other through any meta-data. Such a policy does not apply for application threads running in the same socket. In fact, they are allowed to share any meta-data even if they execute non-conflicting operations because, supported by our evaluation study, we found that the local processing happening inside one socket does not interfere with the work done by parallel threads executing on other sockets. Nemo's evaluation study shows improvement over state-of-the-art TM algorithms by as much as 65%.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Transaction"

1

Chorafas, Dimitris N. Transaction Management. London: Palgrave Macmillan UK, 1998. http://dx.doi.org/10.1057/9780230376533.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kipker, Ingo, and Michael Veil, eds. Transaction Banking. Wiesbaden: Gabler Verlag, 2003. http://dx.doi.org/10.1007/978-3-322-89099-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sippu, Seppo, and Eljas Soisalon-Soininen. Transaction Processing. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12292-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Blois, K. J. Transaction costs and networks. Oxford: Templeton College, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

N, Chorafas Dimitris. Transaction management: Managing complex transactions and sharing distributed databases. New York, N.Y: St. Martin's Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Krishnamurthy, E. V. Transaction processing systems. New York: Prentice Hall, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

De la transaction. Tōkyō: Shinzansha, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Williamson, Oliver E. Transaction cost economics. [Toronto, Ont.]: Law and Economics Programme, Faculty of Law, University of Toronto, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

E, Williamson Oliver, and Masten Scott E. 1955-, eds. Transaction cost economics. Aldershot, Hants, England: Edward Elgar, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Spiller, Pablo T. Transaction cost regulation. Cambridge, MA: National Bureau of Economic Research, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Transaction"

1

Vossen, Gottfried. "Transaction." In Encyclopedia of Database Systems, 1–2. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4899-7993-3_436-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vossen, Gottfried. "Transaction." In Encyclopedia of Database Systems, 3150–51. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_436.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Weik, Martin H. "transaction." In Computer Science and Communications Dictionary, 1806. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_19854.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vossen, Gottfried. "Transaction." In Encyclopedia of Database Systems, 4186–87. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_436.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Worah, Devashish, and Amit Sheth. "Transactions in Transactional Workflows." In Advanced Transaction Models and Architectures, 3–34. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6217-7_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rasheed, A., and A. Zaslavsky. "Twin-Transactions — Delayed Transaction Synchronisation Model." In Object-Oriented Technology: ECOOP’98 Workshop Reader, 311–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-49255-0_86.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bainbridge, John. "Transaction Layer." In Asynchronous System-on-Chip Interconnect, 71–81. London: Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-0189-5_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jifeng, He. "Transaction Calculus." In Applications and Theory of Petri Nets, 8. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-68746-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rudd, Anthony S. "Transaction Processing." In Implementing Practical DB2 Applications, 159–63. London: Springer London, 1996. http://dx.doi.org/10.1007/978-1-4471-1035-4_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wetherbee, Jonathan, Massimo Nardone, Chirag Rathod, and Raghu Kodali. "Transaction Management." In Beginning EJB in Java EE 8, 367–433. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3573-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Transaction"

1

Liu, Su, and Jian Wang. "DMC: Decentralized Mixer with Channel for Transaction Privacy Protection on Ethereum." In 2nd International Conference on Machine Learning Techniques and NLP (MLNLP 2021). Academy and Industry Research Collaboration Center (AIRCC), 2021. http://dx.doi.org/10.5121/csit.2021.111412.

Full text
Abstract:
Ethereum is a public blockchain platform with smart contract. However, it has transaction privacy issues due to the openness of the underlying ledger. Decentralized mixing schemes are presented to hide transaction relationship and transferred amount, but suffer from high transaction cost and long transaction latency. To overcome the two challenges, we propose the idea of batch accounting, adopting batch processing at the time of accounting. For further realization, we introduce payment channel technology into decentralized mixer. Since intermediate transactions between two parties do not need network consensus, our scheme can reduce both transaction cost and transaction latency. Moreover, we provide informal definitions and proofs of our scheme's security. Finally, our scheme is implemented based on zk-SNARKs and Ganache, and experimental results show that the higher number of transactions in batch, the better our scheme performs.
APA, Harvard, Vancouver, ISO, and other styles
2

Курин, Игорь Юрьевич, and Анна Игоревна Синельникова. "CIVIL LEGAL NATURE OF ORAL TRANSACTION." In Социально-экономические и гуманитарные науки: сборник избранных статей по материалам Международной научной конференции (Санкт-Петербург, Декабрь 2020). Crossref, 2021. http://dx.doi.org/10.37539/seh294.2020.35.23.003.

Full text
Abstract:
Сделка выступает волеизъявлением, которое может быть выражено в различных формах. В статье рассматривается проблема гражданско-правовой природы устных сделок. Изучение заключения устной сделки, а также требований, предъявляемых к ней - поможет обозначить «плюсы» и «минусы» данной сделки. A transaction is an expression of will that can be expressed in various forms. The article deals with the problem of the civil nature of oral transactions. Studying the conclusion of an oral transaction, as well as the requirements for it, will help identify the «pros» and «cons» of this transaction.
APA, Harvard, Vancouver, ISO, and other styles
3

Feng, Xiaochun, Yang Chen, Jian Zhang, Heejin Cho, and Xin Shi. "Rubik’s Cube Topology Based Particle Swarm Algorithm for Bilevel Building Energy Transaction." In ASME 2021 15th International Conference on Energy Sustainability collocated with the ASME 2021 Heat Transfer Summer Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/es2021-62982.

Full text
Abstract:
Abstract Following the rapid growth of distributed energy resources (e.g. renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as, reducing power loss, stabilizing the main power grid, etc. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. In addition, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush-Kuhn-Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubiks Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubiks Cube topology based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology based PSO and its scalability on larger scale applications.
APA, Harvard, Vancouver, ISO, and other styles
4

Popovic, Miroslav, Branislav Kordic, and Ilija Basicevic. "Transaction scheduling for Software Transactional Memory." In 2017 IEEE 2nd International Conference on Cloud Computing and Big Data Analysis (ICCCBDA). IEEE, 2017. http://dx.doi.org/10.1109/icccbda.2017.7951909.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Haerder, Theo, and Kurt Rothermel. "Concepts for transaction recovery in nested transactions." In the 1987 ACM SIGMOD international conference. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/38713.38741.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Frank, Lars. "A Transaction Model for Mobile Atomic Transactions." In 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008). IEEE, 2008. http://dx.doi.org/10.1109/waina.2008.208.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yoo, Richard M., and Hsien-Hsin S. Lee. "Adaptive transaction scheduling for transactional memory systems." In the twentieth annual symposium. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1378533.1378564.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

WANG, Cheng. "The Behavioral Sign of Account Theft: Realizing Online Payment Fraud Alert." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/636.

Full text
Abstract:
As a matter of fact, it is usually taken for granted that the occurrence of unauthorized behaviors is necessary for the fraud detection in online payment services. However, we seek to break this stereotype in this work. We strive to design an ex-ante anti-fraud method that can work before unauthorized behaviors occur. The feasibility of our solution is supported by the cooperation of a characteristic and a finding in online payment fraud scenarios: The well-recognized characteristic is that online payment frauds are mostly caused by account compromise. Our finding is that account theft is indeed predictable based on users' high-risk behaviors, without relying on the behaviors of thieves. Accordingly, we propose an account risk prediction scheme to realize the ex-ante fraud detection. It takes in an account's historical transaction sequence, and outputs its risk score. The risk score is then used as an early evidence of whether a new transaction is fraudulent or not, before the occurrence of the new transaction. We examine our method on a real-world B2C transaction dataset from a commercial bank. Experimental results show that the ex-ante detection method can prevent more than 80\% of the fraudulent transactions before they actually occur. When the proposed method is combined with an interim detection to form a real-time anti-fraud system, it can detect more than 94\% of fraudulent transactions while maintaining a very low false alarm rate (less than 0.1\%).
APA, Harvard, Vancouver, ISO, and other styles
9

Tironsakkul, Tin, Manuel Maarek, Andrea Eross, and Mike Just. "The Unique Dressing of Transactions: Wasabi CoinJoin Transaction Detection." In EICC 2022: European Interdisciplinary Cybersecurity Conference. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3528580.3528585.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rehman, Muhammad, and Charlie Obimbo. "A Proposal to Lower Transaction Fees in Blockchain Transactions." In ICITST in cooperation with WorldCIS, WCST, WCICSS-2021. Infonomics Society, 2021. http://dx.doi.org/10.20533/icitst.2021.0018.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Transaction"

1

Spiller, Pablo. Transaction Cost Regulation. Cambridge, MA: National Bureau of Economic Research, January 2011. http://dx.doi.org/10.3386/w16735.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tolan, Gil D. Transaction Design Specification Medical Exam Databases System (MED) update Transaction. Fort Belvoir, VA: Defense Technical Information Center, December 1986. http://dx.doi.org/10.21236/ada271597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

M'Raihi, D., S. Boeyen, M. Grandcolas, and S. Bajaj. Sharing Transaction Fraud Data. RFC Editor, August 2010. http://dx.doi.org/10.17487/rfc5941.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dávila, Eduardo. Optimal Financial Transaction Taxes. Cambridge, MA: National Bureau of Economic Research, September 2020. http://dx.doi.org/10.3386/w27826.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Riemenschneider, R. A. Secure Distributed Transaction Precessing. Fort Belvoir, VA: Defense Technical Information Center, July 2000. http://dx.doi.org/10.21236/ada382584.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Baker, Scott, and Lorenz Kueng. Household Financial Transaction Data. Cambridge, MA: National Bureau of Economic Research, July 2021. http://dx.doi.org/10.3386/w29027.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bossert, G., S. Cooper, and W. Drummond. Considerations for Web Transaction Security. RFC Editor, January 1997. http://dx.doi.org/10.17487/rfc2084.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lyon, J., K. Evans, and J. Klein. Transaction Internet Protocol Version 3.0. RFC Editor, July 1998. http://dx.doi.org/10.17487/rfc2371.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Nicholson, Tony. Local Purchase Transaction Data Collection. Fort Belvoir, VA: Defense Technical Information Center, June 1999. http://dx.doi.org/10.21236/ada368037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kang, Myong H., Oliver Costich, and Judith N. Froscher. A Practical Transaction Model and Untrusted Transaction Manager for a Multilevel-Secure Database System. Fort Belvoir, VA: Defense Technical Information Center, January 1992. http://dx.doi.org/10.21236/ada462360.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Transaction' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography