Relevant bibliographies by topics / Optimistic concurrency control / Journal articles
To see the other types of publications on this topic, follow the link: Optimistic concurrency control.

Journal articles on the topic 'Optimistic concurrency control'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 February 2022

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Optimistic concurrency control.'

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 journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Lee, Juhnyoung. "Precise serialization for optimistic concurrency control." Data & Knowledge Engineering 29, no. 2 (1999): 163–78. http://dx.doi.org/10.1016/s0169-023x(98)00033-0.

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

Bernstein, Philip A., Colin W. Reid, Ming Wu, and Xinhao Yuan. "Optimistic concurrency control by melding trees." Proceedings of the VLDB Endowment 4, no. 11 (2011): 944–55. http://dx.doi.org/10.14778/3402707.3402732.

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

Thomasian, A. "Checkpointing for optimistic concurrency control methods." IEEE Transactions on Knowledge and Data Engineering 7, no. 2 (1995): 332–39. http://dx.doi.org/10.1109/69.382303.

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

Guo, Jinwei, Peng Cai, Jiahao Wang, Weining Qian, and Aoying Zhou. "Adaptive optimistic concurrency control for heterogeneous workloads." Proceedings of the VLDB Endowment 12, no. 5 (2019): 584–96. http://dx.doi.org/10.14778/3303753.3303763.

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

Herlihy, Maurice. "Optimistic concurrency control for abstract data types." ACM SIGOPS Operating Systems Review 21, no. 2 (1987): 33–44. http://dx.doi.org/10.1145/24601.24604.

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

Agrawal, Divyakant, Arthur J. Bernstein, Pankaj Gupta, and Soumitra Sengupta. "Distributed optimistic concurrency control with reduced rollback." Distributed Computing 2, no. 1 (1987): 45–59. http://dx.doi.org/10.1007/bf01786254.

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

Lam, Kwok-wa, Kam-yiu Lam, and Sheung-lun Hung. "Optimistic concurrency control protocol for real-time databases." Journal of Systems and Software 38, no. 2 (1997): 119–31. http://dx.doi.org/10.1016/s0164-1212(96)00115-x.

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

Adya, Atul, Robert Gruber, Barbara Liskov, and Umesh Maheshwari. "Efficient optimistic concurrency control using loosely synchronized clocks." ACM SIGMOD Record 24, no. 2 (1995): 23–34. http://dx.doi.org/10.1145/568271.223787.

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

Shan, Weifeng, and Husheng Liao. "FOCCX: An Optimistic Concurrency Control Protocol over XML." International Journal of Database Theory and Application 8, no. 2 (2015): 215–22. http://dx.doi.org/10.14257/ijdta.2015.8.2.20.

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

Xiaohui Song and J. W. S. Liu. "Maintaining temporal consistency: pessimistic vs. optimistic concurrency control." IEEE Transactions on Knowledge and Data Engineering 7, no. 5 (1995): 786–96. http://dx.doi.org/10.1109/69.469820.

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

Tasmere, Dardina, and Md Nazmus Salehin. "Concurrency Control in Database Systems." Bangladesh Journal of Multidisciplinary Scientific Research 1, no. 2 (2019): 26–40. http://dx.doi.org/10.46281/bjmsr.v1i2.365.

Full text
Abstract:
Concurrency control mechanisms including the wait, time-stamp and rollback mechanisms have been briefly discussed. The concepts of validation in optimistic approach are summarized in a detailed view. Various algorithms have been discussed regarding the degree of concurrency and classes of serializability. Practical questions relating arrival rate of transactions have been presented. Performance evaluation of concurrency control algorithms including degree of concurrency and system behavior have been briefly conceptualized. At last, ideas like multidimensional timestamps, relaxation of two-phase locking, system defined prewrites, flexible transactions and adaptability for increasing concurrency have been summarized.
APA, Harvard, Vancouver, ISO, and other styles
12

Abu Ali, Amer. "On Optimistic Concurrency Control for Real-Time Database Systems." American Journal of Applied Sciences 3, no. 2 (2006): 1706–10. http://dx.doi.org/10.3844/ajassp.2006.1706.1710.

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

Mullender, Sape J., and Andrew S. Tanenbaum. "A distributed file service based on optimistic concurrency control." ACM SIGOPS Operating Systems Review 19, no. 5 (1985): 51–62. http://dx.doi.org/10.1145/323627.323634.

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

Bassiouni, M. A. "Single-site and distributed optimistic protocols for concurrency control." IEEE Transactions on Software Engineering 14, no. 8 (1988): 1071–80. http://dx.doi.org/10.1109/32.7617.

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

Zhou, Jianqiang, Li Xie, Zhongxiu Sun, and Genjiang Zhu. "An adaptive strategy integrating locking with optimistic concurrency control." Journal of Computer Science and Technology 8, no. 4 (1993): 347–55. http://dx.doi.org/10.1007/bf02939542.

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

Morris, R. J. T., and W. S. Wong. "Performance analysis of locking and optimistic concurrency control algorithms." Performance Evaluation 5, no. 2 (1985): 105–18. http://dx.doi.org/10.1016/0166-5316(85)90043-4.

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

Ryu, In Kyung, and Alexander Thomasian. "Performance analysis of centralized databases with optimistic concurrency control." Performance Evaluation 7, no. 3 (1987): 195–211. http://dx.doi.org/10.1016/0166-5316(87)90040-x.

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

Liu, Zhi Cheng, Dong Sheng Lin, and Yun Zhi Ning. "Embedded Real-Time Database System Concurrency Control Protocol AC-Based OCC-FV." Applied Mechanics and Materials 263-266 (December 2012): 1402–6. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.1402.

Full text
Abstract:
Alternative and compensation are not only two basic characteristics of the real-time transaction but also the body of the concurrency control. At the same time, new problems are brought. AC-Based OCC-FV protocol associates alternative and compensation with optimistic concurrency control protocol OCC-FV. For each transaction in accepted queue, an alternative which causes no conflict can be chosen to join the ready queue as soon as possible. This is just a kind of ideal circumstance. If the conflict is inevitable, it is necessary to choose a suitable alternative to join the concurrency control, but also ensures the system to be in a safe state when conflicts take place. In conflict resolution, the optimistic concurrency control protocol OCC-FV is extended in combination with the compensation characteristic, when the transaction failed, immediate dispatch of corresponding compensation transactions is taken to prevent the system from disaster.
APA, Harvard, Vancouver, ISO, and other styles
19

Chen, Yi Rui, and Yi Zhuang. "An Adaptive Decision Concurrency Control Algorithm." Advanced Materials Research 1046 (October 2014): 512–15. http://dx.doi.org/10.4028/www.scientific.net/amr.1046.512.

Full text
Abstract:
For the lack of adaptability about the existing concurrency control algorithms, adaptive decision concurrency control algorithm is proposed. ADCC algorithm divides concurrency control process into two phases in: execution authorizing phase and strategy selecting phase. In execution authorizing phase, algorithm compares statistics and effectiveness of transactions to determine the execution order of conflict transactions. In strategy selecting phase, according to transactions’ read/write status and current conflict rate, algorithm selects optimistic/pessimistic conflict resolution strategy adaptively. Such selection mechanism makes ADCC algorithm have high efficiency no matter database system is busy or idle. Simulation experiment proves that ADCC algorithm this paper proposed is superior to classical strict two phases locking algorithm and hybrid concurrency control. So ADCC algorithm performs well in the period of concurrency control.
APA, Harvard, Vancouver, ISO, and other styles
20

Qilong, Han, and Hao Zhongxiao. "Real-time Optimistic Concurrency Control based on Transaction Finish Degree." Journal of Computer Science 1, no. 4 (2005): 471–76. http://dx.doi.org/10.3844/jcssp.2005.471.476.

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

Kwon, Hyeokmin, and Songchun Moon. "Reverse serializability as a correctness criterion for optimistic concurrency control." Microprocessing and Microprogramming 40, no. 10-12 (1994): 759–62. http://dx.doi.org/10.1016/0165-6074(94)90035-3.

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

Sassen, S. A. E., and J. van der Wal. "The M/G/oo Queueing Model for Optimistic Concurrency Control." Statistica Neerlandica 54, no. 2 (2000): 190–201. http://dx.doi.org/10.1111/1467-9574.00136.

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

Ding, Bailu, Lucja Kot, and Johannes Gehrke. "Improving optimistic concurrency control through transaction batching and operation reordering." Proceedings of the VLDB Endowment 12, no. 2 (2018): 169–82. http://dx.doi.org/10.14778/3282495.3282502.

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

Halici, U., and A. Dogac. "An optimistic locking technique for concurrency control in distributed databases." IEEE Transactions on Software Engineering 17, no. 7 (1991): 712–24. http://dx.doi.org/10.1109/32.83907.

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

Thomasian, Alexander, and In Kyung Ryu. "Analysis of some optimistic concurrency control schemes based on certification." ACM SIGMETRICS Performance Evaluation Review 13, no. 2 (1985): 192–203. http://dx.doi.org/10.1145/317786.317824.

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

Thomasian, A. "Distributed optimistic concurrency control methods for high-performance transaction processing." IEEE Transactions on Knowledge and Data Engineering 10, no. 1 (1998): 173–89. http://dx.doi.org/10.1109/69.667102.

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

Herlihy, M. "Apologizing versus asking permission: optimistic concurrency control for abstract data types." ACM Transactions on Database Systems 15, no. 1 (1990): 96–124. http://dx.doi.org/10.1145/77643.77647.

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

Lam, K. Y., V. C. S. Lee, S. L. Hung, and B. C. M. Kao. "Priority assignment in distributed real-time databases using optimistic concurrency control." IEE Proceedings - Computers and Digital Techniques 144, no. 5 (1997): 324. http://dx.doi.org/10.1049/ip-cdt:19971496.

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

Lee, Uk-Hyeon, and Bu-Hyeon Hwang. "Optimistic Concurrency Control with Update Transaction First for Broadcast Environment : OCC/UTF." KIPS Transactions:PartD 9D, no. 2 (2002): 185–94. http://dx.doi.org/10.3745/kipstd.2002.9d.2.185.

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

Jun Tie, Xiaorong Wang, Zhongshuang Feng, and Lu Zheng. "An New Research for Optimistic Concurrency Control Protocol in Mobile Computing Environment." INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences 5, no. 2 (2013): 107–16. http://dx.doi.org/10.4156/aiss.vol5.issue2.13.

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

Kim, Jinhwan, and Heonshik Shin. "Optimistic priority-based concurrency control protocol for firm real-time database systems." Information and Software Technology 36, no. 12 (1994): 707–15. http://dx.doi.org/10.1016/0950-5849(94)90042-6.

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

Wang, Tianzheng, and Hideaki Kimura. "Mostly-optimistic concurrency control for highly contended dynamic workloads on a thousand cores." Proceedings of the VLDB Endowment 10, no. 2 (2016): 49–60. http://dx.doi.org/10.14778/3015274.3015276.

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

Carey, M. J. "Improving the Performance of an Optimistic Concurrency Control Algorithm Through Timestamps and Versions." IEEE Transactions on Software Engineering SE-13, no. 6 (1987): 746–51. http://dx.doi.org/10.1109/tse.1987.233479.

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

Qin, Biao, and Yunsheng Liu. "A hybrid distributed optimistic concurrency control method for high-performance real-time transaction processing." Journal of Computer Science and Technology 18, no. 1 (2003): 77–83. http://dx.doi.org/10.1007/bf02946653.

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

Chiu, Anthony, Ben Kao, and Kam-yiu Lam. "An analysis of lock-based and optimistic concurrency control protocols in multiprocessor real-time databases." Journal of Systems and Software 42, no. 3 (1998): 273–86. http://dx.doi.org/10.1016/s0164-1212(98)10015-8.

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

Siek, Konrad, and Paweł T. Wojciechowski. "Proving Opacity of Transactional Memory with Early Release." Foundations of Computing and Decision Sciences 40, no. 4 (2015): 317–35. http://dx.doi.org/10.1515/fcds-2015-0018.

Full text
Abstract:
Abstract Transactional Memory (TM) is an alternative way of synchronizing concurrent accesses to shared memory by adopting the abstraction of transactions in place of low-level mechanisms like locks and barriers. TMs usually apply optimistic concurrency control to provide a universal and easy-to-use method of maintaining correctness. However, this approach performs a high number of aborts in high contention workloads, which can adversely affect performance. Optimistic TMs can cause problems when transactions contain irrevocable operations. Hence, pessimistic TMs were proposed to solve some of these problems. However, an important way of achieving efficiency in pessimistic TMs is to use early release. On the other hand, early release is seemingly at odds with opacity, the gold standard of TM safety properties, which does not allow transactions to make their state visible until they commit. In this paper we propose a proof technique that makes it possible to demonstrate that a TM with early release can be opaque as long as it prevents inconsistent views.
APA, Harvard, Vancouver, ISO, and other styles
37

Abdul Moiz, Salman, and Lakshmi Rajamani. "A Real Time Optimistic Strategy to achieve Concurrency Control in Mobile Environments Using On-demand Multicasting." International Journal of Wireless & Mobile Networks 2, no. 2 (2010): 172–85. http://dx.doi.org/10.5121/ijwmn.2010.2212.

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

Ramesh, Dharavath, Chiranjeev Kumar, and Kumar Bitthal. "An incremental hash-based optimistic concurrency control scenario for failure management in HDDBs - an application approach." International Journal of Intelligent Information and Database Systems 9, no. 1 (2015): 79. http://dx.doi.org/10.1504/ijiids.2015.070826.

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

A., Jaypalsinh, and Prashant M. "Graphical Representation of Optimistic Locking and Concurrency Control for Temporal Database using Oracle 12c Enterprise Manager." International Journal of Computer Applications 148, no. 7 (2016): 29–36. http://dx.doi.org/10.5120/ijca2016911214.

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

Kang, Sukhoon, and Songchun Moon. "Read-down conflict-preserving serializability as a correctness criterion for multilevel-secure optimistic concurrency control: CSR/RD." Journal of Systems Architecture 46, no. 10 (2000): 889–902. http://dx.doi.org/10.1016/s1383-7621(99)00045-4.

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

Konana, Prabhudev, Juhnyoung Lee, and Sudha Ram. "Updating timestamp interval for dynamic adjustment of serialization order in Optimistic Concurrency Control-Time Interval (OCCTI) protocol." Information Processing Letters 63, no. 4 (1997): 189–93. http://dx.doi.org/10.1016/s0020-0190(97)00121-x.

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

Sheikhan, Mansour, and Saeed Ahmadluei. "An intelligent hybrid optimistic/pessimistic concurrency control algorithm for centralized database systems using modified GSA-optimized ART neural model." Neural Computing and Applications 23, no. 6 (2012): 1815–29. http://dx.doi.org/10.1007/s00521-012-1147-3.

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

Lu, Yi, Xiangyao Yu, Lei Cao, and Samuel Madden. "Epoch-based commit and replication in distributed OLTP databases." Proceedings of the VLDB Endowment 14, no. 5 (2021): 743–56. http://dx.doi.org/10.14778/3446095.3446098.

Full text
Abstract:
Many modern data-oriented applications are built on top of distributed OLTP databases for both scalability and high availability. Such distributed databases enforce atomicity, durability, and consistency through two-phase commit (2PC) and synchronous replication at the granularity of every single transaction. In this paper, we present COCO, a new distributed OLTP database that supports epoch-based commit and replication. The key idea behind COCO is that it separates transactions into epochs and treats a whole epoch of transactions as the commit unit. In this way, the overhead of 2PC and synchronous replication is significantly reduced. We support two variants of optimistic concurrency control (OCC) using physical time and logical time with various optimizations, which are enabled by the epoch-based execution. Our evaluation on two popular benchmarks (YCSB and TPC-C) show that COCO outperforms systems with fine-grained 2PC and synchronous replication by up to a factor of four.
APA, Harvard, Vancouver, ISO, and other styles
44

He, Libo, Zhenping Qiang, Wei Zhou, and Shaowen Yao. "Multi Attribute D-S Evidence Theory Based OCC for Shared-State Scheduling in Large Scale Cluster." International Journal of Online Engineering (iJOE) 12, no. 12 (2016): 43. http://dx.doi.org/10.3991/ijoe.v12i12.6457.

Full text
Abstract:
<p class="Abstract"><span lang="EN-US">With the growth of big data problems, nowadays the size of cloud-scale computing clusters is growing rapidly to run complicated</span><span lang="EN-US"> parallel processing jobs</span><span lang="EN-US">. To full utilize cluster resources, the cluster management system is being challenged by the scaling cloud size and the often more complicated application requirements. Omega scheduling software</span><span lang="EN-US"> p</span><span lang="EN-US">rovides a flexible and scalable shared-state scheduling <a name="OLE_LINK15"></a><a name="OLE_LINK16"></a>architecture for large scale cluster scheduling. One of its key idea</span><span lang="EN-US">s</span><span lang="EN-US"> is using an optimistic <a name="OLE_LINK47"></a><a name="OLE_LINK44"></a>concurrency control (OCC) algorithm to let parallel schedulers concurrently make decisions. However, there are few studies exploring to extend OCC for a shared-state scheduling architecture. Furthermore, most of the traditional’</span><span lang="EN-US"> s</span><span lang="EN-US">hared-state scheduling architectures also use the same OCCs as Omega does. In this paper, we present a multi attribute</span><span lang="EN-US">Dempster–Shafer (D-S) </span><span lang="EN-US">e</span><span lang="EN-US">vidence theory based OCC for shared-state scheduling. This OCC ad</span><span lang="EN-US">a</span><span lang="EN-US">pts</span><span lang="EN-US">the multi attribute D-S evidence theory to help making conflict decisions for some scheduling transactions. Experiment</span><span lang="EN-US">s’</span><span lang="EN-US"> results show that our method can obtain in some respects more optimized scheduling results compared to coarse-grained conflict detection of Omega.</span></p>
APA, Harvard, Vancouver, ISO, and other styles
45

BUKHARI, F. "ALGORITMA PENGENDALI KONKURENSI TERDISTRIBUSI (DROCC)." Journal of Mathematics and Its Applications 6, no. 2 (2007): 9. http://dx.doi.org/10.29244/jmap.6.2.9-22.

Full text
Abstract:
Penelitian ini memperkenalkan algoritma pengendalian konkurensi untuk sistem basis data terdistribusi atau dikenal dengan sebutan DROCC (Distributed Read commit Order Concurrency Control), karena algoritma DROCC merupakan pengembangan algoritma ROCC (Read commit Order Concurrenct Control) yang diperkenalkan oleh Shi dan Perizzo untuk sistem basis data terpusat. Sama halnya dengan ROCC, algoritma DROCC mengurut eksekusi transaksi tanpa menggunakan mekanisme locking, tetapi menggunakan struktur Read Commit queue (RC-queue) untuk mengurut akses terhadap basis data lokal dan menggunakan struktur serial graph untuk mengurut transaksi secara global. Proses validasi pada algoritma DROCC terdiri dari proses validasi lokal dan proses validasi global. Proses validasi lokal DROCC merupakan penyempurnaan proses validasi ROCC. Sedangkan proses validasi global memanfaatkan struktur serial graph yang dibangkitkan dari RC-queue. Pada penelitian ini mekanisme penghapusan transaksi yang sudah tervalidasi juga dirancang.Algoritma DROCC memiliki feature, (i) optimistik, setiap request langsung dieksekusi tanpa penundaan yang berarti, (ii) bebas deadlock baik lokal maupun global, (iii), masing-masing situs memiliki full autonomy.
APA, Harvard, Vancouver, ISO, and other styles
46

Altmanninger, Kerstin, Wieland Schwinger, and Gabriele Kotsis. "Semantics for Accurate Conflict Detection in SMoVer." International Journal of Enterprise Information Systems 6, no. 1 (2010): 68–84. http://dx.doi.org/10.4018/jeis.2010120206.

Full text
Abstract:
In collaborative software development, the utilization of Version Control Systems (VCSs) is a must. For this, a multitude of pessimistic as well as optimistic VCSs for model artifacts emerged. Pessimistic approaches follow the lock-edit-unlock paradigm whereas optimistic approaches allow parallel editing of one resource, which are therefore the preferred ones. To be flexible for the ever increasing variety of modeling environments and languages such tools should be independent of the modeling environment and applicable to various modeling languages. Those VCS characteristics may implicate a lack of information for the conflict detection method by virtue of firstly receiving solely the state of an artifact without concrete editing operations and secondly due to unavailable knowledge about the semantics of a modeling language. However, in optimistic VCSs concurrent changes can result in conflicts and inconsistencies. In environment and language independent VCSs inconsistencies would even arise more often due to information losses. Hence, accurate conflict detection methods are indispensable for the realization of such VCSs. To tackle this task, the “Semantically enhanced Model Version Control System” SMoVer is presented. With SMoVer it is possible to specify the semantics of a modeling language, needed for conflict detection in order to provide more accurate conflict reports than other current environment and language independent VCSs. In this work, it is exemplified how semantics of a specific modeling language can be specified in SMoVer, how those specifications can improve the accuracy of conflict reports and finally how those can be presented to modelers.
APA, Harvard, Vancouver, ISO, and other styles
47

FOURATI, HÉDIA, and RIHAB BEN ATTITALAH. "ENTREPRENEURIAL OPTIMISM, THE NATURE OF ENTREPRENEURIAL EXPERIENCE AND DEBT DECISION FOR BUSINESS START-UP." International Journal of Innovation Management 22, no. 03 (2018): 1850024. http://dx.doi.org/10.1142/s136391961850024x.

Full text
Abstract:
This paper studies the entrepreneurial optimism and debt decisions for business start-up. By analysing a sample of 160 business start-up and by using the panel data estimation, we study entrepreneurs’ optimism and its impact on debt decision of business start-up. The measure of entrepreneurial optimism is based on the entrepreneur earnings forecasts initiated by Lin et al. (2005). Meanwhile, the nature of entrepreneurial experience (serial and portfolio entrepreneur) has an effect on entrepreneurial optimism and leads to more or less optimistic entrepreneur. The results reveal that optimistic entrepreneur prefers equity in funding the financial deficit. Serial entrepreneurs tend to use more debt funding. In the dynamic model, the entrepreneur acquiring business concurrently adjusts slowly to debt ratio. Nevertheless, the sequential entrepreneurial experience leads to more optimism and so on more debt use. Given the governance role played by banks, the high adjustment cost for start-up is a consequence of the efficiency of the quality of control exercised by banks that in spite of entrepreneurial optimism, the entrepreneur does not convince the financiers to be so confident on the prospect of the business.
APA, Harvard, Vancouver, ISO, and other styles
48

Coban, Aysel Esen, and Zeynep Hamamci. "The Comparison of the Effects of a Didactic Stress Management Program and Group Counselling on the Coping Strategies of School Counsellors." Australian Journal of Guidance and Counselling 19, no. 1 (2009): 71–87. http://dx.doi.org/10.1375/ajgc.19.1.71.

Full text
Abstract:
AbstractThe aim of this study was to compare the effects of a didactic stress management program, group counselling, and a control group on school counsellors' stress coping strategies. Thirty-four school counsellors were randomly assigned to either a didactic stress management group, group counselling, or a control group. The didactic stress management group and the group counselling for stress management group were conducted concurrently for 10 consecutive weeks. A control group received no treatment. The Ways of Coping Inventory was administered to all participants at three different stages: pre-treatment, post-treatment, and at 6-month follow-up. The results indicated that both the didactic stress management group and the group counselling for stress management group showed a significant reduction in the use of helpless coping strategies and a significant increase in the optimistic coping strategies at post-treatment. At follow-up, there were obvious group differences in the use of helpless coping strategies. Only those who were treated using group counselling exhibited a decrease in helpless coping strategies at the follow-up assessment.
APA, Harvard, Vancouver, ISO, and other styles
49

Tang, Monica, Julia Chen, David Goldstein, et al. "Correlation of phase 2 trials (Ph2t) results with outcomes of phase 3 trials (Ph3t) of investigational agents (IA) in locally advanced and metastatic pancreas cancer (LAMPC)." Journal of Clinical Oncology 35, no. 4_suppl (2017): 227. http://dx.doi.org/10.1200/jco.2017.35.4_suppl.227.

Full text
Abstract:
227 Background: There has been minimal improvement in treatment outcomes in LAMPC. We examined results of Ph2t and Ph3t to better understand potential reasons in order to improve future trial design. Methods: We conducted a systematic review of published Ph2t and Ph3t (1978-2015) of first-line treatment for LAMPC. Data for baseline characteristics and best objective response rate (ORR) were compared. Where possible, we compared outcomes for IA tested in Ph2t with corresponding Ph3t. Results: We identified 149 Ph2t with 180 treatment arms comprising 7499 participants. Ph2t were predominantly single-arm (83%) or multi-arms with different IA doses or combinations (5%). Only 12% were randomized studies with concurrent control. The median sample size was 42 (range 8-133). The pooled ORR was 13.8% (95% CI 13.0%-14.6%) but there was substantial heterogeneity (range 0-60%, Pheterogeneity < .001; I2= 75.9%). Although 56% of Ph2t concluded that IA should be considered for Ph3t, only 11% actually proceeded to Ph3t testing. Factors associated with Ph3t testing included absence of randomized design with concurrent control (12.2% vs 5.6%), higher proportion of performance status 0 patients (24.4% vs 21.7%), higher proportion of locally advanced disease only (23.4% vs 15.4%), and higher median ORR (22.0% vs 15.4%). Of 26% Ph2t that investigated novel biological IA, 92% had a potential predictive biomarker but only 1 trial was enriched for the biomarker. Only 8% of Ph2t with novel biological IA proceeded to Ph3t. ORR of IA tested in Ph2t correlated moderate poorly with ORR (r2 = 0.21) and 6 month progression-free survival rate (r2 = 0.26) in corresponding Ph3t. Only 3 IA in Ph3t demonstrated clinically meaningful improvements. Conclusions: Despite multiple Ph2t conducted over 4 decades, only 11% progressed to Ph3t, with 3 IA ultimately improving clinical outcomes. Ph2t results do not inform Phase 3 testing of IA. Potential reasons include patient heterogeneity, overly optimistic interpretation of Ph2t results, lack of concurrent control in Ph2t and ineffective agents. These issues should be addressed in order to improve success of future Ph3t in LAMPC.
APA, Harvard, Vancouver, ISO, and other styles
50

Lautenbach, Anne, Nina Riedel, Jan Wienecke, Oliver Mann, Jörg Flitsch, and Jens Aberle. "Development of Obesity-Associated Comorbidities Post Bariatric Surgery with a Special Focus on Diabetes Remission and Short-Term Relapse." Experimental and Clinical Endocrinology & Diabetes 126, no. 09 (2017): 577–83. http://dx.doi.org/10.1055/s-0043-119985.

Full text
Abstract:
Abstract Purpose The purpose of this study is to study a heterogeneous group of obese patients undergoing Bariatric surgery(BS) and its impact on glycemic control. Secondary endpoints include changes in lipid profile and albuminuria. BS has shown to effectively reduce body-weight. However, the impact on obesity-related comorbidities varies strongly between individuals. Especially postoperative short- and long-term improvement of Diabetes is an active area of investigation. Methods We conducted a retrospective analysis from baseline to 24 months post bariatric surgery in our interdisciplinary obesity outpatient-clinic. Follow-up data was collected from 215 patients who had undergone either Roux-en-Y gastric bypass or Sleeve Gastrectomy. The prevalence of and changes in the major obesity-related comorbidities and concurrent medication were assessed. Results Standard parameters of diabetic control showed a U-shaped curve with initial improvement after six months, but with a gradual worsening after the first year of follow-up. Weight loss resulted in dose reduction of oral antidiabetic medication and insulin in 85% and 100% of patients, respectively. With weight loss, a significant improvement in lipid profile one year after surgery was seen. Subgroup analysis demonstrated gender- and age-dependent differences in overall benefit. Conclusions Current data on diabetes remission might be too optimistic and close follow-up should be provided to prevent gradual worsening of glucose metabolism after BS.
APA, Harvard, Vancouver, ISO, and other styles
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