Dissertations / Theses on the topic 'Transaction'
To see the other types of publications on this topic, follow the link: Transaction.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research 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.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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&rsquos 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.
5
AlSobeh, Anas Ahmad. "Improving Reuse of Distributed Transaction Software with Transaction-Aware Aspects." DigitalCommons@USU, 2015. https://digitalcommons.usu.edu/etd/4590.
Full textAbstract:
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.
6
Manifavas, Charalampos. "Micropayment transaction costs." Thesis, University of Cambridge, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620643.
Full text
7
Ponsard, Anne-Laure. "La transaction administrative." Thesis, Paris 10, 2015. http://www.theses.fr/2015PA100200/document.
Full textAbstract:
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 honourableLa 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
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
11
Ponsford, Brenda Jeanette. "Marketing channels and transaction cost analysis : the role of transaction specific investment /." Diss., This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-02022007-133643/.
Full text
12
Lindqvist, Sylwia. "Transaction cost and transparency on the owner-occupied housing market : An international comparison." Doctoral thesis, KTH, Bygg- och fastighetsekonomi, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-48747.
Full textAbstract:
This dissertation consists of four essays with specific objectives. The overall objective is, however, to seek a further understanding of the issue of cross-border residential transaction markets. While the first two essays focus specifically on transaction processes and costs in a number of selected countries, the two subsequent essays shift their attention towards the EU’s Internal Market and the impact of differences between the countries, with relation to the transparency of transaction markets. The research is primary based on studies of written sources, subject-specific literature and legislation. The main message is that organization of the transaction process affects transaction costs in different ways. It can be argued that efficiency is associated with a lowering of transaction costs. The efficiency of different structures depends on our perspective. Transparency is associated with the organisation of transactions and their needs, though the term is somewhat unclear. Generally, the term may refer to the ability of transaction participants to observe information concerning the transacting process, thereby increasing their knowledge to make informed decisions. Thus it can be argued that a better basis for the decision-making process presupposes information disclosure, more standardized transaction practices, synchronized legal systems, and both legible and transparent regulations. This leads to the design of a transparency system, which is based on an understanding of the need for the system and its goal. Although reaching transparency will be both complex and time-consuming, this study draws attention to certain key aspect of the need to encourage transparency. The first two essays focus on how residential transactions are organized in selected countries and on the costs for carrying out these transactions. Essay II works with two hypotheses concerning the relation between the organizational structure and the transaction costs. The study shows that transaction processes and costs differ considerably between the countries and as a result it is difficult to arrange the countries in a clear way according to their rules. Moreover, there is no clear connection between a broker’s education level and how large a part in the process s/he plays. The total transaction costs excluding taxes vary from approximately 3 up to 8.5 percent. The costs are lower when the recording system is well arranged, when a broker has a bigger part in the process and when a conveyancer is impartial. In the countries where a broker has a higher education level and plays bigger part in the process, the broker’s commission is not any higher when compared to other countries in the study. The study shows also that transaction costs are lower in the countries where the broker has a more neutral role and where fewer parties are involved in the process. Thus in order to avoid high transaction costs, it is important to avoid situations where both buyer and seller have their own agents. Furthermore, the availability of standardized information about properties may increase the efficiency of the market even though it increases the short run transaction cost. Essay III provides a theoretical framework for an analysis of the concept of transparency in residential property transactions within the EU’s internal market and tries to identify the essential factors that need to be addressed with respect to transparency of procedural, regulative and economic features. Essay IV seeks a further understanding of the issue of transparency in the residential property transaction market and attempts to define the state of transparency on the basis of selected EU-countries, in accord with five specific dimensions. The essential points are that an increase in cross-border transactions increases demand for easy access to information in other countries, and that the studied literature focuses on the coordination of legal systems, which produces systems that are more uniform and legally secured, and on broadening the mortgage market. Some of the aspects analysed in the study are far from transparent while others may be considered relatively transparent. The degree of transparency in the EU’s internal market is determined by how transparency is defined, since something may be transparent based on a certain criteria but not on others, especially when the concept is a relative one and subject to changes. The study raises some key aspect as a basis for discussion about the encouragement of transparency.QC 20111123
13
Parry, Rebecca Anderson Hamish. "Transaction avoidance in insolvencies." Oxford [England] ; New York : Oxford University Press, 2001. http://www.loc.gov/catdir/toc/fy033/2002265042.html.
Full text
14
Elfarra, Mohamed Reyad. "The strategic importance of transaction costs : transaction costs as a barrier to entry." Thesis, University of Sheffield, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.440934.
Full text
15
Björk, Mårten, and Sofia Max. "ARTSY : A Reproduction Transaction System." Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1611.
Full textAbstract:
A Transaction Reproduction System (ARTSY) is a distributed system that enables secure transactions and reproductions of digital content over an insecure network. A field of application is reproductions of visual arts: A print workshop could for example use ARTSY to print a digital image that is located at a remote museum. The purpose of this master thesis project was to propose a specification for ARTSY and to show that it is technically feasible to implement it.
An analysis of the security threats in the ARTSY context was performed and a security model was developed. The security model was approved by a leading computer security expert. The security mechanisms that were chosen for the model were: Asymmetric cryptology, digital signatures, symmetric cryptology and a public key registry. A Software Requirements Specification was developed. It contains extra directives for image reproduction systems but it is possible to use it for an arbitrary type of reproduction system. A prototype of ARTSY was implemented using the Java programming language. The prototype uses XML to manage information and Java RMI to enable remote communication between its components. It was built as a platform independent system and it has been tested and proven to be operational on the Sun Solaris platform as well as the Win32 platform.
16
Nisol, Gilles. "Option pricing with transaction costs." Thesis, KTH, Matematik (Inst.), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-102780.
Full textAbstract:
Portfolio optimization is an important field of research within financial engineering. The aim of the optimization is to fins what is the best strategy for an investor when choosing how to allocate their money between a bank account and a constant number of risky assets. In our problem, the investor must pay transaction costs, meaning that every time he transfers money, he loses a certain percentage of the money transferred. Thus, we have made the assumption of proportional transaction costs. In a frictionless market, Merton has proven that the optimal policy consists of a constant proportion of wealth in the risky asset. This means that one must constantly rehedge the portfolio to keep this ratio constant regardless of the evolution of the risky asset´s value. When transaction costs are imposed, repeated rehedging becomes too expensive and the optimal policy of investment is different. The so-called transaction cost region will appear; the investor should buy, sell or stay idle depending on whether his position at current time is above, below or within this region. One can show that we can transform the portfolio optimization problem into a double obstacle problems. Using this latter form of the problem, we have created and algorithm unveiling the different transaction cost regions. The algorithm and results of this algorithm will be presented.
17
Panas, Vassilios Gerassimos. "Option pricing with transaction costs." Thesis, Imperial College London, 1993. http://hdl.handle.net/10044/1/7362.
Full text
18
Ehikioya, Sylvanus Agbonifoh. "Specification of transaction systems protocols." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/nq23597.pdf.
Full text
19
Poulet, Laurent. "Transaction et protection des parties /." Paris : L.G.D.J, 2005. http://www.gbv.de/dms/spk/sbb/recht/toc/506829855.pdf.
Full text
20
Whalley, A. E. "Option pricing with transaction costs." Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.298265.
Full text
21
Muir, C. Douglas R. "Design : the quintessential business transaction." Thesis, University of Glasgow, 1999. http://theses.gla.ac.uk/1613/.
Full textAbstract:
The fundamental structures that underpin business activities must evolve and change in order to equip companies to thrive in a market whose characteristics are increasing competition and instability. The incremental advances in applied computing technology and business methodologies which focus on improving one aspect of company operations ignore the need for an underlying structure and model through which to engage any and all functions in a consistent and integrated fashion. Indeed, many exacerbate the problem through closed architectures, isolationist views of entity data storage and rigid methodologies imposed on the company that employs them. The Product Model proposed fulfils that role. It is a model of the processes and entities that a company uses to conduct its business, at all levels and across all departments. Two other concepts are exposed: product model data and the design history record. Product model data are the values of instances of product model entities and relations, created to represent a particular design, artefact or object. The design history record captures the data and functions used in a transaction and the order and context in which they are used. To exercise these concepts, a software suite was written, the Glasgow Utility for Integrated Design, Guide. It supports the definition of a proud model and its subsequent use in the creation of product model data. Each interaction with the system is recorded, thus capturing the design history record, which can subsequently be processes to various advantageous ends. The major such uses are for re-use of part information in other designs and the extraction of design best practice with which to augment the company's design methodology. It is a comprehensive record, since all business processes are supported by, and can be transacted through Guide. Guide has been used to validate the adequacy of the product model and has established many benefits through its use. Applications in many spheres are possible; engineering has been the primary focus for exemplars and case studies. The development was carried out under the scrutiny of constant validation and testing in live situations with several industrial partners. Guide is built on industry standard tools and uses relational database technology to store frame-based representations of entities, methods and relationships. The design of project plans is carried out on the same platform used to support the project itself; the design data are not dissociated from the project controlling mechanism. Resources, including staff, are engaged according to requirements and audit mechanisms allow for constant re-evaluation of the project development. Control and communication mechanisms support applications in an extended enterprise environment and the distribution of resources that this entails.
22
Norman, Andrew R. "Portfolio selection with transaction costs." Thesis, Imperial College London, 1988. http://hdl.handle.net/10044/1/11848.
Full text
23
Woodside-Oriakhi, Maria. "Portfolio optimisation with transaction cost." Thesis, Brunel University, 2011. http://bura.brunel.ac.uk/handle/2438/5839.
Full textAbstract:
Portfolio selection is an example of decision making under conditions of uncertainty. In the face of an unknown future, fund managers make complex financial choices based on the investors perceptions and preferences towards risk and return. Since the seminal work of Markowitz, many studies have been published using his mean-variance (MV) model as a basis. These mathematical models of investor attitudes and asset return dynamics aid in the portfolio selection process. In this thesis we extend the MV model to include the cardinality constraints which limit the number of assets held in the portfolio and bounds on the proportion of an asset held (if any is held). We present our formulation based on the Markowitz MV model for rebalancing an existing portfolio subject to both fixed and variable transaction cost (the fee associated with trading). We determine and demonstrate the differences that arise in the shape of the trading portfolio and efficient frontiers when subject to non-cardinality and cardinality constrained transaction cost models. We apply our flexible heuristic algorithms of genetic algorithm, tabu search and simulated annealing to both the cardinality constrained and transaction cost models to solve problems using data from seven real world market indices. We show that by incorporating optimization into the generation of valid portfolios leads to good quality solutions in acceptable computational time. We illustrate this on problems from literature as well as on our own larger data sets.
24
Cowling, James (James Alexander). "Low-overhead distributed transaction coordination." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/75706.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 167-173).
This thesis presents Granola, a transaction coordination infrastructure for building reliable distributed storage applications. Granola provides a strong consistency model, while significantly reducing transaction coordination overhead. Granola supports general atomic operations, enabling it to be used as a platform on which to build various storage systems, e.g., databases or object stores. We introduce specific support for independent transactions, a new type of distributed transaction, that we can serialize with no locking overhead and no aborts due to write conflicts. Granola uses a novel timestamp-based coordination mechanism to serialize distributed transactions, offering lower latency and higher throughput than previous systems that offer strong consistency. Our experiments show that Granola has low overhead, is scalable and has high throughput. We used Granola to deploy an existing single-node database application, creating a distributed database application with minimal code modifications. We run the TPC-C benchmark on this platform, and achieve 3 x the throughput of existing lock-based approaches.
by James Cowling.
Ph.D.
25
Lombardi, John J. "Securing Web Based Transaction Services." NSUWorks, 2003. http://nsuworks.nova.edu/gscis_etd/682.
Full textAbstract:
The challenge of securing of Web based transaction services continues to influence the development and evolution of ecommerce and Web Services. This problem had driven the computer industry and standards organizations to introduce a number of security measures in an attempt to compensate for the growing security concerns of enterprises and the software development community. These efforts have not yielded a standardized architectural framework to securing Web based transaction services. The research that was conducted provided a solution to this problem by using a unique combination of technologies and architectural design techniques that provided a security framework for these transactions. The research model defined an architectural framework that incorporated infrastructure technologies, including Public Key Infrastructure (PKI), Secure Socket Layer (SSL) and Lightweight Directory Protocol (LDAP), along with XML security and a set of SOAP specification extensions that when used in conjunction with custom Java components provided an environment for secure web based transaction services. This framework used a centralized operational model that represented behavioral, security and resource location parameters in an LDAP repository. The custom Java components of the framework provided client driven capabilities that allowed a client and service provider to establish a secure transaction relationship by using a predetermined negotiation protocol that captured these parameters in the LDAP repository. The parameters defined the trust relationship in the LDAP repository and were communicated in SOAP messages using Directory Service Markup Language (DSML). These DSML SOAP messages were used with custom SOAP extensions that applied a set of operational design patterns that communicated transaction behavior between client and service provider to ensure security of the Web based transactions. The research model used this extended SOAP model and XML security to provide message level confidentiality, authentication, authorization, content integrity and non-repudiation. The framework provided these security characteristics within a SOAP messaging environment that provided end-to-end message security, application independence, transport protocol independence, intermediary soap server processing capabilities, message protection during transmission and storage and notary service capabilities.
26
Boillot, Christine. "La transaction et le juge." Paris 1, 2001. http://www.theses.fr/2001PA010321.
Full textAbstract:
La recherche de ce qui fonde la légitimité de la transaction, qui exclurait l'intervention du juge sur le litige dont elle est issue, passe par une réflexion sur l'origine de l'autorité et de la stabilité de ce contrat, et par sa confrontation à la valeur reconnue au droit d'accès au juge. La référence à l'autorité de chose jugée permet alors, au-delà de la seule force obligatoire du contrat, d'expliquer que la transaction engendre une fin de non recevoir calquée sur celle du jugement; elle implique de surcroît une délimitation des voies de droit admissibles contre ce contrat et traduit la nécessité de circonscrire les pouvoirs du juge. L'importance actuelle du droit au juge impose de garantir la liberté de la renonciation à la voie judiciaire et le respect des droits fondamentaux des individus. Pour cela, il importe de délimiter le domaine de l'acte à l'aide du critère de la libre disponibilité des droits en cause. Ces exigences transparaissent à travers le contentieux dérivé des transactions. Au-delà de ce que prévoit le Code civil, l'étude de la jurisprudence fait apparaître l'existence d'un contentieux en amont de sa conclusion; le juge intervient sur le processus de passation prévenant ainsi certains abus. Le contentieux de la validité de la transaction, en aval, est en plein essor. Il tend à garantir la liberté du consentement des cotransigeants, mais, se traduit également par un contrôle des éléments de qualification de cet acte. Aujourd'hui il passe aussi par un contrôle du juge sur ce qui est disponible et qui peut faire l'objet de transaction, dans les matières où l'ordre public est en jeu: il prend le relais des précédents et permet de tenir compte des effets concrets de cet acte. Enfin, le juge garantit l'efficacité de la transaction entre les parties, au besoin en lui conférant force exécutoire par la procédure sur requête de l'article 1441-4 du cpc. Il protège les droits des tiers qui ne sauraient être atteints par la conclusion d'un tel acte.
27
Brunet-Richou, Sonia. "La transaction en droit social." Montpellier 1, 1997. http://www.theses.fr/1997MON10025.
Full textAbstract:
La transaction est une convention qui met un terme à un litige ou prévient le litige à naître. Elle est dotée d'un effet particulier dans la mesure ou elle est revêtue de l'autorité de la chose jugée. Son utilisation est croissante en droit social. En raison des règles particulières qui gouvernent cette matière, différentes adaptations de cette convention par essence civile, se sont imposées. En effet, les litiges qui surviennent dans le domaine des relations de travail sont des litiges, où en raison du lien de subordination l'employeur et le salarié ne luttent pas à armes égales. La situation litigieuse à l'origine de la transaction est en conséquence déséquilibrée, l'acte de transaction de par sa nature même et de par les exigences posées par la jurisprudence procède à un rétablissement de l'équilibre contractuel au profit du salarié. Cependant l'abondance de contrôle des juges et d'exigences nouvelles risquent de ruiner cette convention car bon nombre de parties à un acte de ce type se voient assigner en justice alors que le but de la transaction était de l'éviter
28
Rayssac, Rodolphe. "La transaction en matière administrative." Tours, 1999. http://www.theses.fr/1999TOUR1006.
Full textAbstract:
Longtemps ignores par la doctrine et par le droit positif, les modes non juridictionnels de reglement des litiges suscitent ces dernieres annees un interet particulier en droit administratif, et font l'objet d'une politique visant a developper leur pratique dans le contentieux administratif. Parmi les differents modes alternatifs de reglement des litiges administratifs, la transaction occupe une place privilegiee, comme en temoigne la circulaire ministerielle <
29
Poulet, Laurent. "Transaction et protection des parties." Paris 2, 2004. http://www.theses.fr/2004PA020020.
Full text
30
Perrier, Jean-Baptiste. "La transaction en matière pénale." Thesis, Aix-Marseille, 2012. http://www.theses.fr/2012AIXM1021.
Full textAbstract:
Contrat par lequel les parties terminent une contestation née ou préviennent une contestation à naître, la transaction présente a priori une utilité remarquable pour la matière pénale. L'identification de la logique transactionnelle suppose toutefois que de tels procédés répressifs mettent un terme définitif au litige et ce au moyen de concessions de la part de l'auteur des faits et des autorités ou administrations chargées des poursuites. Seules la transaction pénale et la composition pénale revêtent ces qualités. Une telle transposition implique que la matière en cause puisse connaître d'un règlement des suites de l'infraction déterminé par les parties, hors du juge, mais aussi d'un règlement définitif. Les caractéristiques des alternatives aux poursuites témoignent alors de la réception de la technique transactionnelle dans la matière pénale. Ce constat ne peut pour autant suffire, la transposition de la transaction suppose également l'insertion d'un contrat dans le processus répressif. La mise à l'épreuve de la transaction à la matière pénale conduit à relever certains obstacles, tenant au consentement de l'auteur des faits ou encore à l'indisponibilité de l'action publique. Cette opposition conduit à une adaptation de la transaction à la matière pénale. Les alternatives aux poursuites révèlent l'existence de mesures à caractère répressif, proposées à l'auteur des faits et acceptées par lui dans un cadre déjudiciarisé : les sanctions transactionnelles. La reconnaissance de cette catégorie spécifique de sanctions permet d'entrevoir un certain nombre d'améliorations, afin que ces sanctions transactionnelles soient le fruit d'un accord équitableContract with which parties settle or prevent a complaint, the compromise seems to be an outstanding and useful tool in criminal process. However, the identification of the settlement approach presupposes that repressive processes permit to settle the dispute definitively, with concessions from the perpetrators and the Authorities. Only two mechanisms of criminal settlement take on these qualities. Such adaptation implies that the parties could settle the consequences of an offence, without any involvement of a magistrate, but also definitively. The characteristics of the alternative prosecution measures attest the use of the settlement technique in criminal law. However, this aknowledgment is not enough since the transposition of the compromise settlement requires also to introduce a contract in the prosecution process. The comparison of the compromise contract with criminal matter reveals an opposition, some difficulties due to the consent of the perpetrators or Public prosecution. These difficulties necessary lead the settlement to be adapted to this matter. Without the contractual side, the alternative prosecution measures are considered as repressive measures, proposed to the perpetrator and accepted by him outside the formal judicial frame : settlement sanctions. Recognition of this specific sanctions category allowed improvements in order to achieve the settlement sanctions are the result of a fair agreement
31
Boillot, Christine. "La transaction et le juge /." Clermont-Ferrand : [Paris] : Presses universitaires de la Faculté de droit de Clermont-Ferrand ; diff. LGDJ, 2003. http://catalogue.bnf.fr/ark:/12148/cb39203697j.
Full text
32
Fang, Ying 1965. "Marriage transaction in contemporary China." Thesis, The University of Arizona, 1990. http://hdl.handle.net/10150/291940.
Full textAbstract:
This thesis challenges the notion that China was a dowry society. The majority of the population before 1949 practiced indirect dowry, which is the goods originated from the groom's family as brideprice and terminated in the new conjugal household as dowry, after a possible deduction by the bride's father. In post-revolutionary China the brideprice component of indirect dowry was elaborated as a result of change in social and economic structures. In post-revolutionary China, brideprice prevails in rural areas and "thoussaou" dominates in urban areas. Household structure, unit of production, patrilocality in addition to women's labor value contribute to the different practices. Household structure may determine the form of marriage transaction in spite of the existence of other factors. The strong correlation between women's high labor value and brideprice does not hold true every time. Neolocal residence and nuclear family should be advocated if brideprice is to be eliminated.
33
Xie, Wanxia. "Supporting Distributed Transaction Processing Over Mobile and Heterogeneous Platforms." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/14073.
Full textAbstract:
Recent advances in pervasive computing and peer-to-peer computing have opened up vast opportunities for developing collaborative applications. To benefit from these emerging technologies, there is a need for investigating techniques and tools that will allow development and deployment of these applications on mobile and heterogeneous platforms. To meet these challenging tasks, we need to address the typical characteristics of mobile peer-to-peer systems such as frequent disconnections, frequent network partitions, and peer heterogeneity. This research focuses on developing the necessary models, techniques and algorithms that will enable us to build and deploy collaborative applications in the Internet enabled, mobile peer-to-peer environments. This dissertation proposes a multi-state transaction model and develops a quality aware transaction processing framework to incorporate quality of service with transaction processing. It proposes adaptive ACID properties and develops a quality specification language to associate a quality level with transactions. In addition, this research develops a probabilistic concurrency control mechanism and a group based transaction commit protocol for mobile peer-to-peer systems that greatly reduces blockings in transactions and improves the transaction commit ratio. To the best of our knowledge, this is the first attempt to systematically support disconnection-tolerant and partition-tolerant transaction processing. This dissertation also develops a scalable directory service called PeerDS to support the above framework. It addresses the scalability and dynamism of the directory service from two aspects: peer-to-peer and push-pull hybrid interfaces. It also addresses peer heterogeneity and develops a new technique for load balancing in the peer-to-peer system. This technique comprises an improved routing algorithm for virtualized P2P overlay networks and a generalized Top-K server selection algorithm for load balancing, which could be optimized based on multiple factors such as proximity and cost. The proposed push-pull hybrid interfaces greatly reduce the overhead of directory servers caused by frequent queries from directory clients. In order to further improve the scalability of the push interface, this dissertation also studies and evaluates different filter indexing schemes through which the interests of each update could be calculated very efficiently. This dissertation was developed in conjunction with the middleware called System on Mobile Devices (SyD).
34
Dias, Ricardo Jorge Freire. "Cooperative memory and database transactions." Master's thesis, Faculdade de Ciências e Tecnologia, 2008. http://hdl.handle.net/10362/4192.
Full textAbstract:
Dissertação apresentada na Faculdade de
Ciências e Tecnologia da Universidade Nova
de Lisboa para a obtenção do Grau de Mestre
em Engenharia InformáticaSince the introduction of Software Transactional Memory (STM), this topic has received a strong interest by the scientific community, as it has the potential of greatly facilitating concurrent programming by hiding many of the concurrency issues under the transactional layer, being in this way a potential alternative to the lock based constructs, such as mutexes and semaphores. The current practice of STM is based on keeping track of changes made to the memory and, if needed, restoring previous states in case of transaction rollbacks. The operations in a program that can be reversible,by restoring the memory state, are called transactional operations. The way that this reversibility necessary to transactional operations is achieved is implementation dependent on the STM libraries being used. Operations that cannot be reversed,such as I/O to external data repositories (e.g., disks) or to the console, are called nontransactional operations. Non-transactional operations are usually disallowed inside a memory transaction, because if the transaction aborts their effects cannot be undone. In transactional databases, operations like inserting, removing or transforming data in the database can be undone if executed in the context of a transaction. Since database I/O operations can be reversed, it should be possible to execute those operations in the context of a memory transaction. To achieve such purpose, a new transactional model unifying memory and database transactions into a single one was defined, implemented, and evaluated. This new transactional model satisfies the properties from both the memory and database transactional models. Programmers can now execute memory and database operations in the same transaction and in case of a transaction rollback, the transaction effects in both the memory and the database are reverted.
35
Vogel, Daniel. "Merger Waves and Post-Transaction Performance." St. Gallen, 2006. http://www.biblio.unisg.ch/org/biblio/edoc.nsf/wwwDisplayIdentifier/00635532001/$FILE/00635532001.pdf.
Full text
36
Wichert, Carl-Alexander. "ULTRA - a logic transaction programming language." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=96114856X.
Full text
37
Zhang, Connie. "Static Conflict Analysis of Transaction Programs." Thesis, University of Waterloo, 2000. http://hdl.handle.net/10012/1052.
Full textAbstract:
Transaction programs are comprised of read and write operations issued against the database. In a shared database system, one transaction program conflicts with another if it reads or writes data that another transaction program has written. This thesis presents a semi-automatic technique for pairwise static conflict analysis of embedded transaction programs. The analysis predicts whether a given pair of programs will conflict when executed against the database. There are several potential applications of this technique, the most obvious being transaction concurrency control in systems where it is not necessary to support arbitrary, dynamic queries and updates. By analyzing transactions in such systems before the transactions are run, it is possible to reduce or eliminate the need for locking or other dynamic concurrency control schemes.
38
Nam, Kyung Tae. "The transaction-cost politics for privatization." 京都大学 (Kyoto University), 2008. http://hdl.handle.net/2433/135609.
Full text
39
Chen, Jian. "Mobility information and mobile transaction processing." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ32075.pdf.
Full text
40
Prabhu, Nitin Kumar Vijay. "Transaction processing in Mobile Database System." Diss., UMK access, 2006.
Find full textAbstract:
Thesis (Ph. D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2006."A dissertation in computer science and informatics and telecommunications and computer networking." Advisor: Vijay Kumar. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Nov. 9, 2007. Includes bibliographical references (leaves 152-157). Online version of the print edition.
41
Gillard, François. "La transaction judiciaire en procédure civile /." Zurich [u.a.] : Schulthess, 2003. http://www.gbv.de/dms/spk/sbb/recht/toc/372381642.pdf.
Full text
42
Corson, Lewis A. "Private Equity Transaction Bankruptcy Risk Prediction." Scholarship @ Claremont, 2010. http://scholarship.claremont.edu/cmc_theses/29.
Full textAbstract:
This study utilizes a sample of private equity backed acquisitions to test whether certain factors, evaluated and quantified on the date of transaction completion, serve as indicators of future transaction bankruptcy. The results of this paper suggest that the effective federal funds rate is significantly and positively correlated with the bankruptcy of private equity backed transactions. Other measured factors specific to the private equity sponsor, the target firm in the acquisition and the characteristics of the transaction are found to be insignificant. Analysis on the influence of these factors is performed using two types of binary-response models, which predict the likelihood of the occurrence of bankruptcy, and a matched sample model that tests for the difference of means between a non-bankrupt transaction group and a bankrupt transaction group. Limitations in the availability of data derived from the private nature of the industry resulted in a limited sample size of 259 transactions completed from 1989 to 2008. General insignificance in the results of this study merits further analysis on the contributing factors to private equity transaction failure.
43
Anderson, Samantha Bryce. "Appropriate housing : an architecture of transaction." Thesis, Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/23437.
Full text
44
McCue, Daniel Lawrence. "Selective transparency in distributed transaction processing." Thesis, University of Newcastle Upon Tyne, 1992. http://hdl.handle.net/10443/2020.
Full textAbstract:
Object-oriented programming languages provide a powerful interface for programmers to access the mechanisms necessary for reliable distributed computing. Using inheritance and polymorphism provided by the object model, it is possible to develop a hierarchy of classes to capture the semantics and inter-relationships of various levels of functionality required for distributed transaction processing. Using multiple inheritance, application developers can selectively apply transaction properties to suit the requirements of the application objects. In addition to the specific problems of (distributed) transaction processing in an environment of persistent objects, there is a need for a unified framework, or architecture in which to place this system. To be truly effective, not only the transaction manager, but the entire transaction support environment must be described, designed and implemented in terms of objects. This thesis presents an architecture for reliable distributed processing in which the management of persistence, provision of transaction properties (e.g., concurrency control), and organisation of support services (e.g., RPC) are all gathered into a unified design based on the object model.
45
Younas, Muhammad. "Web transaction management for multidatabase applications." Thesis, University of Sheffield, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.369859.
Full text
46
Song, Shiyun. "Three essays in transaction cost analysis." Thesis, University of Warwick, 2018. http://wrap.warwick.ac.uk/111211/.
Full textAbstract:
This thesis studies the impact of transaction costs on stocks prices and examine the impact of institutional investors and high frequency traders (HFTs) on market quality and transaction costs. It is comprised of three chapters. Chapter 2 uses a clean and novel field experiment to study how stock prices of publicly listed companies respond to changes in transaction costs. Using the SEC's pilot program that increased the tick size for approximately 1,200 randomly chosen stocks, we find a decrease in market capitalization of $7 billion for stocks affected by the larger tick size relative to a control group. We find that the increase in the present value of transaction costs accounts for a small percentage of the price decrease. We study channels of price variation due to changes in expected returns: investor horizon, liquidity risk, and information risk. The evidence suggests that trading frictions affect the cost of capital. Chapter 3 examines the effects of multimarket high-frequency trading (HFT) activity on liquidity co-movements across different markets. Multimarket trading by HFTs connects individual markets in a single network, which should induce stronger network-wide liquidity co-movements. We use the staggered introduction of an alternative trading platform, Chi-X, in European equity markets as our instrument for an exogenous increase in multimarket HFT activity. Consistent with our predictions, we find that liquidity co-movements within the aggregate network of European markets significantly increase after the introduction of Chi-X and even exceed liquidity co-movements within the home market. They are especially strong in down markets and for stocks with a higher intensity of HFT trading in the post-Chi-X period. Chapter 4 studies optimality of trade execution by institutional trading desks. We document the presence of negative autocorrelation in intraday stock return and show that the temporary price pressure is larger at the beginning and the end of the day. Institutional trading volume exhibits similar intraday pattern. We relate the periodity of price pressure to trading desks' performance using a proprietary database of institutional investor trades. We find that execution quality is the worst at the end of the day yet institutional trading volume is also surprisingly high. Poorer performing brokers in terms of execution shortfall trade more in the last hour of the day, have a higher execution cost at the end of the day, and carry out less order splitting at the end of the day. Our findings suggest that intraday price pressure stems from end of the day clustering of under-performing trading desks strategies results in higher trading costs and poorer execution quality. A trading strategy exploiting this intraday predictability yields a monthly return of 16.11%. Our results have implications on the impact of broker selection and execution strategy on trading costs.
47
Wong, Koon-Po Paul 1976. "Transaction management on collaborative application services." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/81543.
Full text
48
Neugebauer, R. T. "Customisable transaction support for web services." Thesis, Coventry University, 2012. http://curve.coventry.ac.uk/open/items/0f577e76-0d01-4fab-986b-47a72d9c959e/1.
Full textAbstract:
Web services transactions have some unique characteristics. A Web transaction may be composed of a number of individual Web services, executed across multiple loosely coupled autonomous systems. Each Web service may be executed on an independent system belonging to an independent provider. There raises the question whether Web transactions can and should be maintained as a single business unit in a similar way to how transactions are maintained in classical database systems. In classical database systems, the transaction management protocol and mechanism are constrained by the primary properties of atomicity, consistency, isolation and durability (ACID). These ACID properties are the cornerstone of maintaining data integrity in transaction management. However, ACID properties were meant for centralised systems and are better suited for short transactions. Unlike short transactions, Web services transactions may be long-running; they can take hours or even days depending on the application. Composing certain actions from loosely coupled distributed business processes across multiple distributed applications is one of the essentials of Web services transactions. The classic ACID model, which is tightly coupled, is therefore seen as too rigid to support all the requirements of the new Web transactions model. The research proposes a system that increases throughput while maintaining the consistency and correctness required by the particular applications that are using the model; the system is known as AuTrA (Adaptable user-defined Transaction relaxed Approach). AuTrA allows relaxation of each ACID property. The model is adaptable to meet different situations with different characteristics. For instance, in some cases it will be appropriate to relax atomicity, whereas in others it may be appropriate to relax isolation and atomicity while maintaining consistency. The research explores how transaction support for Web services can be customised to suit the needs of varying applications and result in improved service. The AuTrA prototype has been implemented. The experimental results show that the AuTrA application is able to support the basic features of Web services transaction management, allowing users to specify their correctness requirements, and it can increase throughput of transactions in models in a flexible and reliable manner. Additional facilities allow users to specify application-specific, non-ACID criteria that can increase throughput. Safeguards have also been implemented to prevent execution of inappropriate user specifications, such as relaxation of properties that may damage data integrity. AuTrA can be used as a tool by software developers who need to compose applications from independent Web services and who wish to build applications which result in improved performance while maintaining application-required consistency.
49
Memon, Neelam. "Anonymizing large transaction data using MapReduce." Thesis, Cardiff University, 2016. http://orca.cf.ac.uk/97342/.
Full textAbstract:
Publishing transaction data is important to applications such as marketing research and biomedical studies. Privacy is a concern when publishing such data since they often contain person-specific sensitive information. To address this problem, different data anonymization methods have been proposed. These methods have focused on protecting the associated individuals from different types of privacy leaks as well as preserving utility of the original data. But all these methods are sequential and are designed to process data on a single machine, hence not scalable to large datasets. Recently, MapReduce has emerged as a highly scalable platform for data-intensive applications. In this work, we consider how MapReduce may be used to provide scalability in large transaction data anonymization. More specifically, we consider how setbased generalization methods such as RBAT (Rule-Based Anonymization of Transaction data) may be parallelized using MapReduce. Set-based generalization methods have some desirable features for transaction anonymization, but their highly iterative nature makes parallelization challenging. RBAT is a good representative of such methods. We propose a method for transaction data partitioning and representation. We also present two MapReduce-based parallelizations of RBAT. Our methods ensure scalability when the number of transaction records and domain of items are large. Our preliminary results show that a direct parallelization of RBAT by partitioning data alone can result in significant overhead, which can offset the gains from parallel processing. We propose MR-RBAT that generalizes our direct parallel method and allows to control parallelization overhead. Our experimental results show that MR-RBAT can scale linearly to large datasets and to the available resources while retaining good data utility.
50
Tavanti, Jean-Christophe. "Principe d'arbitrage et coûts de transaction." Paris, EHESS, 1994. http://www.theses.fr/1994EHES0087.
Full textAbstract:
L'objet de cette these concerne les problemes d'extention des theories classiques d'evaluation d'actifs financiers au cas de marches ou sont pris en compte des couts de transaction. Sur des marches parfaits, sans frictions, l'evaluation d'actifs financiers repose sur une condition necessaire d'equilibre, le principe d'arbitrage. L'essentiel de notre propos consiste a montrer comment la condition usuelle d'absence d'opportunite d'arbitrage ne saurait etre naivement transposee au cas des marches imparfaits. Aussi, sommes-nous conduit a completer cette condition d'equilibre par l'adjonction d'une condition de rationalite des comportements d'investissement des lors que des couts de transaction viennent freiner la fluidite des echanges. Nous pouvons par suite demontrer l'existence d'un operateur d'evaluation adapte a chaque portefeuille d'actifs negocies sur un marche soumis a des couts de transaction proportionnels. L'argumentation du premier chapitre s'organise autour du rappel de la notion d'arbitrage et des principes d'evaluation sur une marche sans couts de transaction. Nous y redemontrons en particulier l'ensemble des rrelations qui unissent les differentes formes de la condition d'absence d'opportunites d'arbitrage et y proposons une introduction a la problematique des couts de transaction. Le second chapitre traite plus en detail du cas des couts de transaction proportionnels au travers du modele de reference de garman et ohlson (1981). Nous montrons notamment comment la definition d'absence d'arbitrage adoptee par ce modele ne suffit pas a exclure l'ensemble des oppotunites d'arbitrage creees par la presence de frictions et proposons une nouvelle definition adaptee au couts de transaction proportionnels qui nous conduit a demontrer l'existence d'une formule d'evaluation pour chaque structure de portefeuilleThis thesis deals with the problem of extending the classical theory of valuation of financial assets when transaction costs are taken in account. On perfect markets, without frictions, valuation of assets is based on a necessary condtion of equilibrium, the arbitrage principle. The main goal of our purpose is to show why the usual condition of no-arbitrage opportunities can't be innocently transposed to the case of imperfect markets. Therfore, for a market where transaction costs prevail, we can demonstrate the existence of a valuatuion operator adapted to any kind of portfolio of marketed assets. The first chapter cames back to the notion of no-arbitrage. We characterise a set of relatiuonships beetween the differents forms of the no-arbitrage condition, and propose an introduction to the problem of transaction costs. The second chapter deals with the case of proportional transaction costs. We show that the no-arbitrage condition proposed by the model of garman and ohlson (1981) is not able to catch some new kinds of arbitrage opportunities created by the introduction of costs. Then we propose a "well-defined" no-arbitrage condition for markets with transaction costs and show that valuation operators consistent with no-arbitrage depend on the agent's postion in the market. The third chapter developes these valuation formulae: we start by a comparison with the usual results found for perfect markets and follow by an application to the case of options pricing