21 |
Static Conflict Analysis of Transaction ProgramsZhang, Connie January 2000 (has links)
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.
|
22 |
Trust and Governance in Hybrid Relationships: An Investigation of Logistics AlliancesOrr, John Patrick, 1950- 12 1900 (has links)
Transaction cost economics (TCE) theorists traditionally have classified transactions between firms as governed by either market or hierarchy. By assessing characteristics of the transaction - asset specificity, uncertainty, and frequency - firms choose the governance form which minimizes transaction costs, the costs of administering the business deal. During the 1980s, however, TCE has found itself unable to explain the proliferation of strategic alliances. These hybrid relationships seek the benefits of both markets and hierarchies, including quasi-integration, the control of assets without actual ownership. Further, hybrids tend to prefer trust-based relational contracting. TCE's acknowledgment of hybrids, however, raises other questions surrounding the behavioral assumptions which supposedly influence the transaction characteristic governance linkage. Various dissenting researchers have theorized that (1) trust is more dominant in business than opportunism (2) the behavioral assumptions actually function as variables in different contexts, and (3) trust offers an integration mechanism for behavioral variables.
|
23 |
An Agent Based Transaction Manager for Multidatabase SystemsMadiraju, Sugandhi 05 December 2006 (has links)
A multidatabase system (MDBMS) is a facility that allows users to access data located in multiple autonomous database management systems (DBMSs) at different sites. To ensure global atomicity for multidatabase transactions, a reliable global atomic commitment protocol is a possible solution. In this protocol a centralized transaction manager (TM) receives global transactions, submits subtransactions to the appropriate sites via AGENTS. An AGENT is a component of MDBS that runs on each site; AGENTS after receiving subtransactions from the transaction manager perform the transaction and send the results back to TM. We have presented a unique proof-of-concept, a JAVA application for an Agent Based Transaction Manager that preserves global atomicity. It provides a user friendly interface through which reliable atomic commitment protocol for global transaction execution in multidatabase environment can be visualized. We demonstrated with three different test case scenarios how the protocol works. This is useful in further research in this area where atomicity of transactions can be verified for protocol correctness.
|
24 |
Évaluation du processus d'amélioration de prix de la bourse de BostonPagé, Julie January 2006 (has links) (PDF)
La technologie est de plus en plus omniprésente et nombreuses sont les industries qui doivent demeurer à l'affût de cette dernière afin d'être en mesure de rivaliser sur la scène internationale. L'automatisation est aujourd'hui devenue la norme notamment dans les systèmes de négociation des marchés boursiers. Malgré l'abondante littérature financière qui porte sur le virage électronique dans les systèmes de négociation, une récente innovation découlant des systèmes électroniques a fait ses débuts à la bourse de Boston et demeure jusqu'ici inexplorée. Avec pour principal bénéfice la réduction des coûts de transaction, ce système novateur veut gagner la ferveur du public par le transfert de ces bénéfices vers les investisseurs. Dans ce mémoire, nous proposons d'apporter une contribution à la compréhension des répercussions de ce nouveau système connu sous le nom de Price Improvement Process, ou « PIP ». Ainsi, nous mesurons l'impact de ce système qui se veut comme un processus d'amélioration de prix qui se manifeste au niveau de l'écart bid-ask. Nous trouvons qu'en l'absence du processus d'amélioration de prix « PIP », la transaction médiane est exécutée à l'intérieur de l'intervalle du prix moyen ± 50% de l'écart bid-ask affiché. En d'autres mots, la transaction sera exécutée soit au BidPrice ou au AskPrice. Cependant, les résultats obtenus nous montrent qu'avec le processus d'amélioration de prix « PIP », la transaction médiane est exécutée dans l'intervalle du prix moyen ±30% de l'écart bid-ask. Ce résultat nous indique une amélioration significative de la qualité d'exécution des transactions lorsqu'un « PIP » est lancé. La stratification de la variable volume nous a permis d'identifier avec plus de précision dans quelle situation l'amélioration était la plus significative. Dans un premier temps, les résultats de la stratification du volume par transaction montrent que l'amélioration de prix que procure le « PIP » augmente avec le volume de la transaction. L'amélioration est de l'ordre de 23.8% lorsque les transactions comprennent de 1 à 5 contrats et peut atteindre tout près 56.47% d'amélioration pour les transactions dont le volume est de 51 contrats ou plus. Dans un second temps, nous avons étudié la liquidité journalière. Malgré le fait que les résultats étaient beaucoup moins précis quant à l'influence de chacune des variables, nous avons été en mesure de déterminer que l'amélioration que procure le processus « PIP » est à son maximum les journées de très forte liquidité, soit plus de 500 contrats transigés par jour.
|
25 |
Static Conflict Analysis of Transaction ProgramsZhang, Connie January 2000 (has links)
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.
|
26 |
Portfolio Optimization Problems with Transaction CostsGustavsson, Stina, Gyllberg, Linnéa January 2023 (has links)
Portfolio theory is a cornerstone of modern finance, and it is based on the idea that an investor can reduce risk by diversifying their investments across various assets. In practice, Harry Markowitz mean-variance optimization theory is expanded upon by taking into account variable and fixed transaction cost, making the model slightly more reliable. Estimation of parameters is done using historical data and the portfolios considered are those that would be of interest to Generation Z. Using transaction costs from some of Sweden's biggest and most popular banks, the impact of the transaction costs can be seen in the presented graphs. Though many more aspects could be considered to make the model even more realistic, the presented results give insight into how one might want to invest in the stock market to increase their chances of a good expected return given a minimal variance (risk).
|
27 |
Multi-period mean-variance option portfolio strategiesLim, Jeffrey Cheong Kee January 1994 (has links)
No description available.
|
28 |
Implications of agricultural commercialisation for land and labour institutions on the Rajasthan Canal ProjectSinha, Saurabh January 1999 (has links)
No description available.
|
29 |
The theory of the contract of agency (Al Wakalah) in Islamic lawMohd Napiah, Mohammad Deen January 1995 (has links)
No description available.
|
30 |
Trust and Transaction Costs in Industrial DistrictsCai, Rong 01 June 2004 (has links)
Social capital is becoming a core concept in economics, political science, sociology and public policy. Trust, norms and social networks, constitute the three major components of social capital. These three factors interact together and play a significant role in transactions between people and organizations. However, there is no consensus about the influence of social capital on transaction costs. Some researchers have stated that social capital could reduce transaction costs associated with adapting, monitoring and enforcing transactions; some have analyzed the negative impacts of social capital on transaction costs; and still some have focused on transaction costs in the formation of social capital.
Using organizations as the unit of analysis and concentrating on trust, this paper analyzes how trust, the central concept of social capital, impacts transaction costs in inter-organizational transactions. At the same time, it is argued that trust building is costly, and some activities that constitute transaction costs help to form a mutual-trust between organizations. Further, the paper points out that transaction costs and trust differ depending on the characters of transactions.
The paper also studies the lock-in effects of trust on inter-organizational relationships and the role of intermediaries to mitigate the negative impacts. Finally, the paper intends to find policy and strategy implications for organizations and government to build a healthy and vigorous transaction environment. / Master of Urban and Regional Planning
|
Page generated in 0.1022 seconds