Validating A knowledge transfer framework in health services

The study of knowledge transfer (KT) has been proceeding in parallel but independently in health services and in business, presenting an opportunity for synergy and sharing. This paper uses a survey of 32 empirical KT studies with their 96 uniquely named determinants of KT success to identify ten unique determinants for horizontal knowledge transfer success. These determinants, the outcome measure of Knowledge Use, and separate explicit and tacit transfer flows constitute the KT Framework, extending the work of previous KT framework authors. Our Framework was validated through a case study of the transfer of clinical practice guideline knowledge between the cardiac teams of selected Ontario hospitals, using a survey of senders and receivers developed from the KT literature. The study findings were: 8 of 10 determinants were supported by the Successful Transfer Hospitals; and 4 of 10 determinants were found to a higher degree in the Successful than non-Successful transfer hospitals. Taken together, the results show substantive support for the KT Framework determinants, indicating aggregate support of 9 of these determinants, but not the 10th - Knowledge Complexity. The transfer of tacit knowledge was found to be related to the transfer of the explicit knowledge and expressed as the transfer or recreation of resource profile and internal process tacit knowledge, where this tacit transfer did not require interactions between Sender and Receiver. This study provides managers with the building blocks to assess and improve the success rates of their knowledge transfers.

Increasing the speed of parallel decoding of turbo codes

Turbo codes experience a significant decoding delay because of the iterative nature of the decoding algorithms, the high number of metric computations and the complexity added by the (de)interleaver. The extrinsic information is exchanged sequentially between two Soft-Input Soft-Output (SISO) decoders. Instead of this sequential process, a received frame can be divided into smaller windows to be processed in parallel. In this paper, a novel parallel processing methodology is proposed based on the previous parallel decoding techniques. A novel Contention-Free (CF) interleaver is proposed as part of the decoding architecture which allows using extrinsic Log-Likelihood Ratios (LLRs) immediately as a-priori LLRs to start the second half of the iterative turbo decoding. The simulation case studies performed in this paper show that our parallel decoding method can provide %80 time saving compared to the standard decoding and %30 time saving compared to the previous parallel decoding methods at the expense of 0.3 dB Bit Error Rate (BER) performance degradation.

Specifying and analysing networks of processes in CSPt (or in search of associativity)

In proposing theories of how we should design and specify networks of processes it is necessary to show that the semantics of any language we use to write down the intended behaviours of a system has several qualities. First in that the meaning of what is written on the page reflects the intention of the designer; second that there are no unexpected behaviours that might arise in a specified system that are hidden from the unsuspecting specifier; and third that the intention for the design of the behaviour of a network of processes can be communicated clearly and intuitively to others. In order to achieve this we have developed a variant of CSP, called CSPt, designed to solve the problems of termination of parallel processes present in the original formulation of CSP. In CSPt we introduced three parallel operators, each with a different kind of termination semantics, which we call synchronous, asynchronous and race. These operators provide specifiers with an expressive and flexible tool kit to define the intended behaviour of a system in such a way that unexpected or unwanted behaviours are guaranteed not to take place. In this paper we extend out analysis of CSPt and introduce the notion of an alphabet diagram that illustrates the different categories of events that can arise in the parallel composition of processes. These alphabet diagrams are then used to analyse networks of three processes in parallel with the aim of identifying sufficient constraints to ensure associativity of their parallel composition. Having achieved this we then proceed to prove associativity laws for the three parallel operators of CSPt. Next, we illustrate how to design and construct a network of three processes that satisfy the associativity law, using the associativity theorem and alphabet diagrams. Finally, we outline how this could be achieved for more general networks of processes.

Successful termination in timed CSP

In proposing theories of how we should design and specify networks of processes it is necessary to show that the semantics of any language we use to write down the intended behaviours of a system has several qualities. First in that the meaning of what is written on the page reflects the intention of the designer; second that there are no unexpected behaviours that might arise in a specified system that are hidden from the unsuspecting specifier; and third that the intention for the design of the behaviour of a network of processes can be communicated clearly and intuitively to others. In order to achieve this we have developed a variant of CSP, called CSPt, designed to solve the problems of termination of parallel processes present in the original formulation of CSP. In CSPt we introduced three parallel operators, each with a different kind of termination semantics, which we call synchronous, asynchronous and race. These operators provide specifiers with an expressive and flexible tool kit to define the intended behaviour of a system in such a way that unexpected or unwanted behaviours are guaranteed not to take place. In this paper we extend out analysis of CSPt and introduce the notion of an alphabet diagram that illustrates the different categories of events that can arise in the parallel composition of processes. These alphabet diagrams are then used to analyse networks of three processes in parallel with the aim of identifying sufficient constraints to ensure associativity of their parallel composition. Having achieved this we then proceed to prove associativity laws for the three parallel operators of CSPt. Next, we illustrate how to design and construct a network of three processes that satisfy the associativity law, using the associativity theorem and alphabet diagrams. Finally, we outline how this could be achieved for more general networks of processes.

Modulation of CYP1A1 by PKC Inhibitors and TPA Pre-Treatments in MH1C1 Rat Hepatoma Cells Exposed to 3 -Methylcholanthrene

Cytochrome P4501A1 (CYP1A1), an enzyme known to metabolize polycyclic aromatic hydrocarbons, is regulated by the aryl hydrocarbon receptor (AhR). The involvement of protein kinase C (PKC) in the regulation of AhR signal transduction pathway, has been widely studied but the role of specific PKC isoform(s) involved in this process it is not well clarified. To study which PKC isoform(s) is implicated in the regulation of CYP1A1, in the poorly tumorigenic MH1C1 rat hepatoma cells, we examined the effects of some PKC pharmacological inhibitors, Calphostin C (CAL), Staurosporine (STA) and H7, and of 12-0-tetradecanoyl phorbol 13-acetate (TPA), a PKC activator, on basal and 3- methylcholanthrene (MC)-induced CYP1A1 protein expression and mediated ethoxyresorufin O-deethylation (EROD) activity. In parallel, the activities of PKC-α, -βI, -δ and -ε isoforms, the most expressed in MH1C1 cells, were monitored. After pre-treatment with CAL, STA and H7, the MC-induced CYP1A1 protein and EROD activity were rapidly reduced with temporal profile similar to the profile of the activity of α and β1 PKC isoforms. Moreover, TPA pre-treatment induced a biphasic effect on EROD activity, and a decline of PKC -βI and -α, in first instance, and -δ and -ε activities later on. These findings clearly show that, in MH1C1 cells, PKC is involved in CYP1A1 regulation and that α and βI classic PKC isoforms play an active role in modulating this process.