Gendered dichotomies and segregation patterns in computing jobs in Australia

Sex segregation in employment is a phenomenon that can be observed and analysed at different levels, ranging from comparisons between broad classifications by industry or occupation through to finely defined jobs within such classifications. From an aggregate perspective, the contribution of information technology (IT) employment to sex segregation is clear--it remains a highly male-dominated field apparently imbued with the ongoing masculinity of science and technology. While this situation is clearly contrary to hopes of a new industry freed from traditional distinctions between 'men's' and 'women's' work, it comes as little surprise to most feminist and labour studies analysts. An extensive literature documents the persistently masculine culture of IT employment and education (see, among many, Margolis and Fisher 2002; Wajcman 1991; Webster 1996; Wright 1996, 1997), and the idea that new occupations might escape sexism by sidestepping 'old traditions' has been effectively critiqued by writers such as Adam, who notes the fallacy of assuming a spontaneous emergence of equality in new settings (2005: 140).

Women, computing and the 'ideal worker': A comparison of professional occupations

In this paper we use recent census data supplemented with case study evidence to investigate the extent to which professional computing occupations in Australia are constructed around the notion of an ‘ideal’ worker. Census data are used to compare computer professionals with other selected professional occupational groups, illustrating different models of accommodating (or not accommodating) workers who do not fit the ideal model. The computer professionals group is shown to be distinctive in combining low but consistent levels of female representation across age groups, average rates of parenthood and minimal provisions for working-time flexibility. One strategy employed by women in this environment is selection of relatively routine technical roles over more time intensive consultancy based work.

Heuristic algorithm for computing reversal distance with multigene families via binary integer programming

Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum number of reversals required for rearranging a genome to another when gene duplication is nonexisting. In this paper, we show how to extend the Hannenhalli-Pevzner approach to genomes with multigene families. We propose a new heuristic algorithm to compute the reversal distance between two genomes with multigene families via the concept of binary integer programming without removing gene duplicates. The experimental results on simulated and real biological data demonstrate that the proposed algorithm is able to find the reversal distance accurately. ©2005 IEEE