Almost half of those who start therapy drop out early (Thalmayer, 2018). When therapists work to improve the therapeutic alliance, clients are more likely to stay in treatment and chances of recovery improve (D'Aniello et al., 2018; Escudero & Friedlander, 2017). However, the existing research comes almost entirely from client self-reports of the alliance. Little research has examined what occurs during the session. There has been no research to determine what specific therapeutic alliance behaviors are related to early termination. The current naturalistic study sought to discover if behaviors that strengthen or diminish the therapeutic alliance are related to early termination in therapy. Master's Students coded videos from thirty couples (fifteen matched pairs) who received therapy at the Brigham Young University Comprehensive Clinic (BYUCC) using the System for Observing Family Therapy Alliances (SOFTA-o). Four dimensions of the therapeutic alliance were examined: engagement in the therapeutic process, emotional connection to the therapist, safety within the therapeutic system, and shared sense of purpose within the family. Results from a one-sided t-test showed that the emotional connection was significant for both male and female partners and the therapist, as was the male partner's sense of safety and the shared sense of purpose. Several individual behaviors were also significant. Understanding which behavioral indicators of the alliance are associated with dropout may help therapists identify couples at risk of dropout and intervene to prevent early termination. Implications and limitations will be discussed.

This thesis presents a novel VLSI design of multi-code rate Low-Density Parity-Check code (LDPC) decoder for IEEE 802.16e standard. In order to support the different code rates adopted by the standard, this thesis proposes a programmable LDPC decoder architecture based on the edge-serial approach. This edge-serial architecture can perform the sequential check-node computation according to the internal sequence update commands. Any complex and irregular parity-check matrix can all be realized in the proposed architecture if the number of bit-nodes each check node connects does not exceed a certain bound. In addition to the high flexibility, this thesis also proposes several design optimization techniques suitable for the LDPC decoder. First, the designs of the LDPC decoders in the past all put more emphasis on the realization of check node function. This thesis instead applies a novel bit-node major approach which can lead to more compact design. Secondly, a fine-grain message update method is used which allows more rapid message passing such that the decoder can converge in less cycles. In addition, almost half of the message memory can be reduced. Furthermore, based on the bit-node major decoder design, the early termination scheme can be utilized to partially terminate the function of some bit nodes to reduce the decoding cycles. The other salient features also include the rescheduling of the message update order to allow the overlap of different decoding iterations in order to reduce effect of the possible message update hazard due to the long internal pipeline latency. Based on the proposed optimization methods, our experimental results show that the hardware cost can be reduced by 23.1% while the decoding cycles can be reduced by 27.4%. The proposed LDPC decoder architecture has been realized by using 0.18 µm technology with the total gate count of 316k. Our experimental shows that the proposed LDPC decoder can run up to 235 MHz and deliver the average of 116 Mbps throughput.

Dropout is a problematic phenomenon which wastes community, clinician, client, and researcher resources. Clients who dropout from therapy end up the same, or worse than, those who did not seek out therapy at all. While there is a relatively deep and broad understanding of dropout from individual therapy, an exhaustive review of couple therapy dropout literature reveals a very inconsistent and non-conclusive body of research. This may stem from a lack of a consistently used theory to guide research endeavors in this important realm. Primarily, this seems to stem from treating dropout as a static event rather than a process occurring across time. This study seeks to remedy this and shed new light on dropout from couple therapy by using a growth mixture model analysis to tease out which trajectories of change of predictor variables across time are more likely to predict dropout from couple therapy. While the results of this study did not reveal any significant relationships between class membership and dropout (likely due to a too small sample size), the study did find that there were distinct classes (trajectories of change) among the predictor variables across time.

The topic of this thesis is to analyze leasing and credit financing with a focus on the accounting and tax implications of these forms of financing assets of enterprise in terms if force in the Czech Republic. The theoretical part focuses on the legal, accounting and taxation areas in leasing and loans. The practical sections will then analyze the effects of regular and early termination of the leasing and loan contracts in terms of accounting and taxation.

Fountain codes have demonstrated great results for the binary erasure channel and have already been incorporated into several international standards to recover lost packets at the application layer. These include multimedia broadcast/multicast sessions and digital video broadcasting on global internet-protocol. The rateless property of Fountain codes holds great promise for noisy channels. These are more sophisticated mathematical models representing errors on communications links rather than only erasures. The practical implementation of Fountain codes for these channels, however, is hampered by high decoding cost and delay. In this work we study trapping sets in Fountain codes over noisy channels and their effect on the decoding process. While trapping sets have received much attention for low-density parity-check (LDPC) codes, to our knowledge they have never been fully explored for Fountain codes. Our study takes into account the different code structure and the dynamic nature of Fountain codes. We show that 'error-free' trapping sets exist for Fountain codes. When the decoder is caught in an error-free trapping set it actually has the correct message estimate, but is unable to detect this is the case. Thus, the decoding process continues, increasing the decoding cost and delay for naught. The decoding process for rateless codes consists of one or more decoding attempts. We show that trapping sets may reappear as part of other trapping sets on subsequent decoding attempts or be defeated by the reception of more symbols. Based on our observations we propose early termination methods that use trapping set detection to obtain improvements in realized rate, latency, and decoding cost for Fountain codes. / Thesis (Master, Electrical & Computer Engineering) -- Queen's University, 2009-10-29 14:33:06.548

Text in Afrikaans / Summaries in Afrikaans and English / In Afrikaans, soos in NederJands en Duits, word saamgestelde woorde aanmekaar geskryf. Nuwe woorde word dus voortdurend geskep deur woorde aanmekaar te haak Dit bemoeilik die proses van woordafkapping tydens teksprosessering, wat deesdae deur rekenaars gedoen word, aangesien die verwysingsbron gedurig verander. Daar bestaan verskeie afkappingsalgoritmes en tegnieke, maar die resultate is onbevredigend. Afrikaanse woorde met korrekte lettergreepverdeling is net die elektroniese weergawe van die handwoordeboek van die Afrikaanse Taal (HAT) onttrek. 'n Neutrale netwerk ( vorentoevoer-terugpropagering) is met sowat. 5 000 van hierdie woorde afgerig. Die neurale netwerk is verfyn deur 'n gcskikte afrigtingsalgoritme en oorfragfunksie vir die probleem asook die optimale aantal verborge lae en aantal neurone in elke laag te bepaal. Die neurale netwerk is met 5 000 nuwe woorde getoets en dit het 97,56% van moontlike posisies korrek as of geldige of ongeldige afkappingsposisies geklassifiseer. Verder is 510 woorde uit tydskrifartikels met die neurale netwerk getoets en 98,75% van moontlike posisies is korrek geklassifiseer. / In Afrikaans, like in Dutch and German, compound words are written as one word. New words are therefore created by simply joining words. Word hyphenation during typesetting by computer is a problem, because the source of reference changes all the time. Several algorithms and techniques for hyphenation exist, but results are not satisfactory. Afrikaans words with correct syllabification were extracted from the electronic version of the Handwoordeboek van die Afrikaans Taal (HAT). A neural network (feedforward backpropagation) was trained with about 5 000 of these words. The neural network was refined by heuristically finding a suitable training algorithm and transfer function for the problem as well as determining the optimal number of layers and number of neurons in each layer. The neural network was tested with 5 000 words not the training data. It classified 97,56% of possible points in these words correctly as either valid or invalid hyphenation points. Furthermore, 510 words from articles in a magazine were tested with the neural network and 98,75% of possible positions were classified correctly. / Computing / M.Sc. (Operasionele Navorsing)

This thesis is rooted in the research tradition known as coalition politics, where governments, political parties and political institutions are the central focus. The main emphasis here is on government instability and the question of why governments in modern parliamentary democracies often come to an end before the next regular election. In five distinct but interrelated papers, the thesis explores the issue of early government termination and how it is affected by public support, economic developments and the functioning of the state apparatus. The studies included in this thesis generally take a quantitative approach and make use of a dataset that contains 640 governments in 29 European democracies. Their joint goal is to improve our understanding of when early termination happens by introducing and testing new explanatory factors as well as by improving how previously identified factors are modelled. The first paper focuses on Central and Eastern Europe. It shows that the stability of governments in that region is affected by slightly different factors than those that impact on governments in Western Europe. In particular, ideological factors and political institutions are found to be less important in Central and Eastern Europe while the formal power basis of the government and the country’s economic performance matter more. In the second paper, co-authored with Professor Torbjörn Bergman, the state is brought into government stability research. The paper shows that countries with a lower quality of governance and a less efficient public sector have less stable governments. This is mainly because government parties struggle to achieve their policy goals when the state apparatus is inefficient and corrupt. Paper 3, co-written with Associate Professor Johan Hellström, looks at how different types of governments respond to economic challenges. In particular, this paper demonstrates that the same changes in economic circumstances (e.g. increases in unemployment or inflation) have different effects on cabinet stability depending on which type of government is in charge. Single party governments are better equipped to deal with economic changes, because they are better positioned to devise new policy responses without having to compromise with other parties. Coalition governments, in contrast, become significantly more likely to terminate early when the economy takes a turn for the worse. Finally, over the course of two papers I first explore new techniques for analysing polling data and then use them to empirically test whether governments sometimes choose termination as a way to cope with bad poll numbers. Most of the existing techniques for pooling polls and forecasting elections were explicitly designed with two party systems in mind. In Paper 4, I test some of these techniques to determine their usefulness in complex, multiparty systems, and I develop some improvements that enable us to take advantage of more of the information in the data. In the final paper, I combine the two themes of polling and government stability by looking at how changes in government popularity affect the likelihood of premature dissolution. I find that governments, particularly single party governments, do, in fact, use terminations as a strategic response to changes in their popularity among the public. When support is high, governments tend to opportunistically call an early election, whereas they tend to abandon or reshuffle the government when support is low.

Text in Afrikaans / Summaries in Afrikaans and English / In Afrikaans, soos in NederJands en Duits, word saamgestelde woorde aanmekaar geskryf. Nuwe woorde word dus voortdurend geskep deur woorde aanmekaar te haak Dit bemoeilik die proses van woordafkapping tydens teksprosessering, wat deesdae deur rekenaars gedoen word, aangesien die verwysingsbron gedurig verander. Daar bestaan verskeie afkappingsalgoritmes en tegnieke, maar die resultate is onbevredigend. Afrikaanse woorde met korrekte lettergreepverdeling is net die elektroniese weergawe van die handwoordeboek van die Afrikaanse Taal (HAT) onttrek. 'n Neutrale netwerk ( vorentoevoer-terugpropagering) is met sowat. 5 000 van hierdie woorde afgerig. Die neurale netwerk is verfyn deur 'n gcskikte afrigtingsalgoritme en oorfragfunksie vir die probleem asook die optimale aantal verborge lae en aantal neurone in elke laag te bepaal. Die neurale netwerk is met 5 000 nuwe woorde getoets en dit het 97,56% van moontlike posisies korrek as of geldige of ongeldige afkappingsposisies geklassifiseer. Verder is 510 woorde uit tydskrifartikels met die neurale netwerk getoets en 98,75% van moontlike posisies is korrek geklassifiseer. / In Afrikaans, like in Dutch and German, compound words are written as one word. New words are therefore created by simply joining words. Word hyphenation during typesetting by computer is a problem, because the source of reference changes all the time. Several algorithms and techniques for hyphenation exist, but results are not satisfactory. Afrikaans words with correct syllabification were extracted from the electronic version of the Handwoordeboek van die Afrikaans Taal (HAT). A neural network (feedforward backpropagation) was trained with about 5 000 of these words. The neural network was refined by heuristically finding a suitable training algorithm and transfer function for the problem as well as determining the optimal number of layers and number of neurons in each layer. The neural network was tested with 5 000 words not the training data. It classified 97,56% of possible points in these words correctly as either valid or invalid hyphenation points. Furthermore, 510 words from articles in a magazine were tested with the neural network and 98,75% of possible positions were classified correctly. / Computing / M.Sc. (Operasionele Navorsing)

<p>Minimum cycle mean (MCM) is an important concept in directed graphs. From clock period optimization, timing analysis to layout optimization, minimum cycle mean algorithms have found widespread use in VLSI system design optimization. With transistor size scaling to 10nm and below, complexities and size of the systems have grown rapidly over the last decade. Scalability of the algorithms both in terms of their runtime and memory usage is therefore important. </p> <p><br></p> <p>Among the few classical MCM algorithms, the algorithm by Young, Tarjan, and Orlin (YTO), has been particularly popular. When implemented with a binary heap, the YTO algorithm has the best runtime performance although it has higher asymptotic time complexity than Karp's algorithm. However, as an efficient implementation of YTO relies on data redundancy, its memory usage is higher and could be a prohibitive factor in large size problems. On the other hand, a typical implementation of Karp's algorithm can also be memory hungry. An early termination technique from Hartmann and Orlin (HO) can be directly applied to Karp's algorithm to improve its runtime performance and memory usage. Although not as efficient as YTO in runtime, HO algorithm has much less memory usage than YTO. We propose several improvements to HO algorithm. The proposed algorithm has comparable runtime performance to YTO for circuit graphs and dense random graphs while being better than HO algorithm in memory usage. </p> <p><br></p> <p>Minimum balancing of a directed graph is an application of the minimum cycle mean algorithm. Minimum balance algorithms have been used to optimally distribute slack for mitigating process variation induced timing violation issues in clock network. In a conventional minimum balance algorithm, the principal subroutine is that of finding MCM in a graph. In particular, the minimum balance algorithm iteratively finds the minimum cycle mean and the corresponding minimum-mean cycle, and uses the mean and cycle to update the graph by changing edge weights and reducing the graph size. The iterations terminate when the updated graph is a single node. Studies have shown that the bottleneck of the iterative process is the graph update operation as previous approaches involved updating the entire graph. We propose an improvement to the minimum balance algorithm by performing fewer changes to the edge weights in each iteration, resulting in better efficiency.</p> <p><br></p> <p>We also apply the minimum cycle mean algorithm in latency insensitive system design. Timing violations can occur in high performance communication links in system-on-chips (SoCs) in the late stages of the physical design process. To address the issues, latency insensitive systems (LISs) employ pipelining in the communication channels through insertion of the relay stations. Although the functionality of a LIS is robust with respect to the communication latencies, such insertion can degrade system throughput performance. Earlier studies have shown that the proper sizing of buffer queues after relay station insertion could eliminate such performance loss. However, solving the problem of maximum performance buffer queue sizing requires use of mixed integer linear programming (MILP) of which runtime is not scalable. We formulate the problem as a parameterized graph optimization problem where for every communication channel there is a parameterized edge with buffer counts as the edge weight. We then use minimum cycle mean algorithm to determine from which edges buffers can be removed safely without creating negative cycles. This is done iteratively in the similar style as the minimum balance algorithm. Experimental results suggest that the proposed approach is scalable. Moreover, quality of the solution is observed to be as good as that of the MILP based approach.</p><p><br></p>