Absorbing new knowledge in small and medium-sized enterprises: A multiple case analysis of Six Sigma

The primary aim of this article is to critically analyse the development of Six Sigma theory and practice within small and medium-sized enterprises (SMEs) using a multiple case study approach. The article also explores the subsequent development of Lean Six Sigma as a means of addressing the perceived limitations of the efficacy of Six Sigma in this context. The overarching theoretical framework is that of absorptive capacity, where Six Sigma is conceptualized as new knowledge to be absorbed by smaller firms. The findings from a multiple case study involving repeat interviews and focus groups informed the development of an analytical model demonstrating the dynamic underlying routines for the absorptive capacity process and the development of a number of summative propositions relating the characteristics of SMEs to Six Sigma and Lean Six Sigma implementation.

Genome-wide scans of three independent sets of 90 Irish multiplex schizophrenia families and follow-up of selected regions in all families provides evidence for multiple susceptibility genes

From our linkage study of Irish families with a high density of schizophrenia, we have previously reported evidence for susceptibility genes in regions 5q21-31, 6p24-21, 8p22-21, and 10p15-p11. In this report, we describe the cumulative results from independent genome scans of three a priori random subsets of 90 families each, and from multipoint analysis of all 270 families in ten regions. Of these ten regions, three (13q32, 18p11-q11, and 18q22-23) did not generate scores above the empirical baseline pairwise scan results, and one (6q13-26) generated a weak signal. Six other regions produced more positive pairwise and multipoint results. They showed the following maximum multipoint H-LOD (heterogeneity LOD) and NPL scores: 2p14-13: 0.89 (P = 0.06) and 2.08 (P = 0.02), 4q24-32: 1.84 (P = 0.007) and 1.67 (P = 0.03), 5q21-31: 2.88 (P= 0.0007), and 2.65 (P = 0.002), 6p25-24: 2.13 (P = 0.005) and 3.59 (P = 0.0005), 6p23: 2.42 (P = 0.001) and 3.07 (P = 0.001), 8p22-21: 1.57 (P = 0.01) and 2.56 (P = 0.005), 10p15-11: 2.04 (P = 0.005) and 1.78 (P = 0.03). The degree of 'internal replication' across subsets differed, with 5q, 6p, and 8p being most consistent and 2p and 10p being least consistent. On 6p, the data suggested the presence of two susceptibility genes, in 6p25-24 and 6p23-22. Very few families were positive on more than one region, and little correlation between regions was evident, suggesting substantial locus heterogeneity. The levels of statistical significance were modest, as expected from loci contributing to complex traits. However, our internal replications, when considered along with the positive results obtained in multiple other samples, suggests that most of these six regions are likely to contain genes that influence liability to schizophrenia.

Gene Sets Net Correlations Analysis (GSNCA): a multivariate differential coexpression test for gene sets

Motivation: To date, Gene Set Analysis (GSA) approaches primarily focus on identifying differentially expressed gene sets (pathways). Methods for identifying differentially coexpressed pathways also exist but are mostly based on aggregated pairwise correlations, or other pairwise measures of coexpression. Instead, we propose Gene Sets Net Correlations Analysis (GSNCA), a multivariate differential coexpression test that accounts for the complete correlation structure between genes.

Results: In GSNCA, weight factors are assigned to genes in proportion to the genes' cross-correlations (intergene correlations). The problem of finding the weight vectors is formulated as an eigenvector problem with a unique solution. GSNCA tests the null hypothesis that for a gene set there is no difference in the weight vectors of the genes between two conditions. In simulation studies and the analyses of experimental data, we demonstrate that GSNCA, indeed, captures changes in the structure of genes' cross-correlations rather than differences in the averaged pairwise correlations. Thus, GSNCA infers differences in coexpression networks, however, bypassing method-dependent steps of network inference. As an additional result from GSNCA, we define hub genes as genes with the largest weights and show that these genes correspond frequently to major and specific pathway regulators, as well as to genes that are most affected by the biological difference between two conditions. In summary, GSNCA is a new approach for the analysis of differentially coexpressed pathways that also evaluates the importance of the genes in the pathways, thus providing unique information that may result in the generation of novel biological hypotheses.

An application of bi-directional evolutionary structural optimisation for optimising energy absorbing structures using a material damage model

The Bi-directional Evolutionary Structural Optimisation (BESO) method is a numerical topology optimisation method developed for use in finite element analysis. This paper presents a particular application of the BESO method to optimise the energy absorbing capability of metallic structures. The optimisation objective is to evolve a structural geometry of minimum mass while ensuring that the kinetic energy of an impacting projectile is reduced to a level which prevents perforation. Individual elements in a finite element mesh are deleted when a prescribed damage criterion is exceeded. An energy absorbing structure subjected to projectile impact will fail once the level of damage results in a critical perforation size. It is therefore necessary to constrain an optimisation algorithm from producing such candidate solutions. An algorithm to detect perforation was implemented within a BESO framework which incorporated a ductile material damage model.

Sets of multiplicity and closable multipliers on group algebras

We undertake a detailed study of the sets of multiplicity in a second countable locally compact group G and their operator versions. We establish a symbolic calculus for normal completely bounded maps from the space B(L-2(G)) of bounded linear operators on L-2 (G) into the von Neumann algebra VN(G) of G and use it to show that a closed subset E subset of G is a set of multiplicity if and only if the set E* = {(s,t) is an element of G x G : ts(-1) is an element of E} is a set of operator multiplicity. Analogous results are established for M-1-sets and M-0-sets. We show that the property of being a set of multiplicity is preserved under various operations, including taking direct products, and establish an Inverse Image Theorem for such sets. We characterise the sets of finite width that are also sets of operator multiplicity, and show that every compact operator supported on a set of finite width can be approximated by sums of rank one operators supported on the same set. We show that, if G satisfies a mild approximation condition, pointwise multiplication by a given measurable function psi : G -> C defines a closable multiplier on the reduced C*-algebra G(r)*(G) of G if and only if Schur multiplication by the function N(psi): G x G -> C, given by N(psi)(s, t) = psi(ts(-1)), is a closable operator when viewed as a densely defined linear map on the space of compact operators on L-2(G). Similar results are obtained for multipliers on VN(C).

Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms

Kuznetsov independence of variables X and Y means that, for any pair of bounded functions f(X) and g(Y), E[f(X)g(Y)]=E[f(X)] *times* E[g(Y)], where E[.] denotes interval-valued expectation and *times* denotes interval multiplication. We present properties of Kuznetsov independence for several variables, and connect it with other concepts of independence in the literature; in particular we show that strong extensions are always included in sets of probability distributions whose lower and upper expectations satisfy Kuznetsov independence. We introduce an algorithm that computes lower expectations subject to judgments of Kuznetsov independence by mixing column generation techniques with nonlinear programming. Finally, we define a concept of conditional Kuznetsov independence, and study its graphoid properties.