New Project Knowledge Management: Lessons Learned from temporary structures of Public Sector R&D Organisations

R&D Organisations are key players in the knowledge economy and make major contributions to Australia’s efforts to achieve and maintain competitive advantage. The explicit purpose of R&D organisations is to develop new knowledge and apply existing knowledge in new ways. Much of the R&D is carried out in temporary structures or project teams. Drawing upon theory and grounded in case based evidence, this paper explores how new forms of project management affect knowledge generating and application processes in R&D organisations. It appears that much of the knowledge generation and application occurs through taking advantage of almost naturally occurring oscillations between open and closed system practices over the course of projects. Theoretical and practical lessons and implications for further research are advanced

On minors of maximal determinant matrices

By an old result of Cohn (1965), a Hadamard matrix of order n has no proper Hadamard submatrices of order m > n/2. We generalise this result to maximal determinant submatrices of Hadamard matrices, and show that an interval of length asymptotically equal to n/2 is excluded from the allowable orders. We make a conjecture regarding a lower bound for sums of squares of minors of maximal determinant matrices, and give evidence in support of the conjecture. We give tables of the values taken by the minors of all maximal determinant matrices of orders up to and including 21 and make some observations on the data. Finally, we describe the algorithms that were used to compute the tables.Comment: 35 pages, 43 tables, added reference to Cohn in v

Cardiovascular changes associated with intravenous administration of E. coli endotoxin in conscious ponies

Call number: LD2668 .T4 1984 C68Master of Scienc

Probabilistic lower bounds on maximal determinants of binary matrices

Let ${\mathcal D}(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and $\mathcal R(n) = {\mathcal D}(n)/n^{n/2}$ be the ratio of ${\mathcal D}(n)$ to the Hadamard upper bound. Using the probabilistic method, we prove new lower bounds on ${\mathcal D}(n)$ and $\mathcal R(n)$ in terms of $d = n-h$, where $h$ is the order of a Hadamard matrix and $h$ is maximal subject to $h \le n$. For example, $\mathcal R(n) > (\pi e/2)^{-d/2}$ if $1 \le d \le 3$, and $\mathcal R(n) > (\pi e/2)^{-d/2}(1 - d^2(\pi/(2h))^{1/2})$ if $d > 3$. By a recent result of Livinskyi, $d^2/h^{1/2} \to 0$ as $n \to \infty$, so the second bound is close to $(\pi e/2)^{-d/2}$ for large $n$. Previous lower bounds tended to zero as $n \to \infty$ with $d$ fixed, except in the cases $d \in \{0,1\}$. For $d \ge 2$, our bounds are better for all sufficiently large $n$. If the Hadamard conjecture is true, then $d \le 3$, so the first bound above shows that $\mathcal R(n)$ is bounded below by a positive constant $(\pi e/2)^{-3/2} > 0.1133$.Comment: 17 pages, 2 tables, 24 references. Shorter version of arXiv:1402.6817v4. Typos corrected in v2 and v3, new Lemma 7 in v4, updated references in v5, added Remark 2.8 and a reference in v6, updated references in v

Some binomial sums involving absolute values

We consider several families of binomial sum identities whose definition involves the absolute value function. In particular, we consider centered double sums of the form $$S_{\alpha,\beta}(n) := \sum_{k,\;\ell}\binom{2n}{n+k}\binom{2n}{n+\ell} |k^\alpha-\ell^\alpha|^\beta,$$ obtaining new results in the cases $\alpha = 1, 2$. We show that there is a close connection between these double sums in the case $\alpha=1$ and the single centered binomial sums considered by Tuenter.Comment: 15 pages, 19 reference

Social Impact: Anything but Ordinary: A New View of Federal Service

Presidential Management Fellows program offers solution to federal workforce challenge