Sigmoidal cosine series on the interval

We construct a set of functions, say, psi([r])(n) composed of a cosine function and a sigmoidal transformation gamma(r) of order r > 0. The present functions are orthonormal with respect to a proper weight function on the interval [-1, 1]. It is proven that if a function f is continuous and piecewise smooth on [-1, 1] then its series expansion based on psi([r])(n) converges uniformly to f so long as the order of the sigmoidal transformation employed is 0 < r

Exploration of the cell-cycle genes found within the RIKEN FANTOM2 data set

The cell cycle is one of the most fundamental processes within a cell. Phase-dependent expression and cell-cycle checkpoints require a high level of control. A large number of genes with varying functions and modes of action are responsible for this biology. In a targeted exploration of the FANTOM2-Variable Protein Set, a number of mouse homologs to known cell-cycle regulators as well as novel members of cell-cycle families were identified. Focusing on two prototype cell-cycle families, the cyclins and the NIMA-related kinases (NEKs), we believe we have identified all of the mouse members of these families, 24 cyclins and 10 NEKs, and mapped them to ENSEMBL transcripts. To attempt to globally identify all potential cell cycle-related genes within mouse, the MGI (Mouse Genome Database) assignments for the RIKEN Representative Set (RPS) and the results from two homology-based queries were merged. We identified 1415 genes with possible cell-cycle roles, and 1758 potential paralogs. We comment on the genes identified in this screen and evaluate the merits of each approach.

Extremal circular permutations with concave functions

Let {a(1), a(2), ..., a(n)} be a set of n distinct real numbers and let alpha(1), alpha(2), ..., alpha(n) an be a permutation of the numbers. We construct the permutation to maximise L-f = Sigma(i=1)(n) f(\alpha(i+1) - alpha(i)\), for any increasing concave function f, where we denote alpha(n+1) equivalent to alpha(1). The optimal permutation depends on the particular numbers {a(1), a(2), ..., a(n)} and the function f, contrary to a postulate by Chao and Liang (European J. Combin. 13 (1992) 325). (C) 2004 Elsevier Ltd. All rights reserved.

'Hybrids' and the gendering of computing jobs in Australia

This paper presents recent Australian evidence on the extent to which women are entering “hybrid” computing jobs combining technical and communication or “people management” skills, and the way these skill combinations are valued at organisational level. We draw on a survey of detailed occupational roles in large IT firms to examine the representation of women in a range of jobs consistent with the notion of “hybrid”, and analyse the discourse around these sorts of skills in a set of organisational case studies. Our research shows a traditional picture of labour market segmentation, with limited representation of women in high status jobs, and their relatively greater prevalence in more routine areas of the industry. While our case studies highlight perceptions of the need for hybrid roles and assumptions about the suitability of women for such jobs, the ongoing masculinity of core development functions appears untouched by this discourse.