Expression of PSA-RP2, an alternatively spliced variant from the PSA gene, is increased in prostate cancer tissues but the protein is not secreted from prostate cancer cells

PSA-RP2 is a variant transcript expressed from the PSA gene that is conserved in gorillas, chimpanzees and humans suggesting a particular relevance for this transcript in these primates. We demonstrated by qRT-PCR that PSA-RP2 is upregulated in prostate cancer compared with benign prostatic hyperplasia tissues. The PSA-RP2 protein was not detected in seminal fluid and was cytoplasmically localised but not secreted from LNCaP or transfected PC3 prostate cells, despite secretion from transfected Cos-7 and HEK293 kidney cell lines. PSA-RP2-transfected PC3 cells showed slightly decreased proliferation and increased migration towards PC3-conditioned medium that could suggest a functional role in prostate cancer.

A collagen network phase improves cell seeding of open-pore structure scaffolds under perfusion

Scaffolds with open-pore morphologies offer several advantages in cell-based tissue engineering, but their use is limited by a low cell seeding efficiency. We hypothesized that inclusion of a collagen network as filling material within the open-pore architecture of polycaprolactone-tricalcium phosphate (PCL-TCP) scaffolds increases human bone marrow stromal cells (hBMSC) seeding efficiency under perfusion and in vivo osteogenic capacity of the resulting constructs. PCL-TCP scaffolds, rapid prototyped with a honeycomb-like architecture, were filled with a collagen gel and subsequently lyophilized, with or without final crosslinking. Collagen-free scaffolds were used as controls. The seeding efficiency was assessed after overnight perfusion of expanded hBMSC directly through the scaffold pores using a bioreactor system. By seeding and culturing freshly harvested hBMSC under perfusion for 3 weeks, the osteogenic capacity of generated constructs was tested by ectopic implantation in nude mice. The presence of the collagen network, independently of the crosslinking process, significantly increased the cell seeding efficiency (2.5-fold), and reduced the loss of clonogenic cells in the supernatant. Although no implant generated frank bone tissue, possibly due to the mineral distribution within the scaffold polymer phase, the presence of a non crosslinked collagen phase led to in vivo formation of scattered structures of dense osteoids. Our findings verify that the inclusion of a collagen network within open morphology porous scaffolds improves cell retention under perfusion seeding. In the context of cell-based therapies, collagen-filled porous scaffolds are expected to yield superior cell utilization, and could be combined with perfusion-based bioreactor devices to streamline graft manufacture.

Social network and aesthetic reflexivity in the creative industries

This article reviews some key critical writing about the commodification or exploitation of networked social relations in the creative industries. Through a comparative case study of networks in fashion and new media industries in the city of Manchester, UK, the article draws attention to the social, cultural and aesthetic aspects of the networks among creative practitioners. It argues that within the increasing commercialisation in the creative industries there are networked spaces within which non-instrumental values are created. The building of social networks reflects on the issue of how creatives perceive their work in these industries both economically and socially/culturally.

The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

Sample complexity results from computational learning theory, when applied to neural network learning for pattern classification problems, suggest that for good generalization performance the number of training examples should grow at least linearly with the number of adjustable parameters in the network. Results in this paper show that if a large neural network is used for a pattern classification problem and the learning algorithm finds a network with small weights that has small squared error on the training patterns, then the generalization performance depends on the size of the weights rather than the number of weights. For example, consider a two-layer feedforward network of sigmoid units, in which the sum of the magnitudes of the weights associated with each unit is bounded by A and the input dimension is n. We show that the misclassification probability is no more than a certain error estimate (that is related to squared error on the training set) plus A3 √((log n)/m) (ignoring log A and log m factors), where m is the number of training patterns. This may explain the generalization performance of neural networks, particularly when the number of training examples is considerably smaller than the number of weights. It also supports heuristics (such as weight decay and early stopping) that attempt to keep the weights small during training. The proof techniques appear to be useful for the analysis of other pattern classifiers: when the input domain is a totally bounded metric space, we use the same approach to give upper bounds on misclassification probability for classifiers with decision boundaries that are far from the training examples.

Neural network learning:theoretical foundations

This important work describes recent theoretical advances in the study of artificial neural networks. It explores probabilistic models of supervised learning problems, and addresses the key statistical and computational questions. Chapters survey research on pattern classification with binary-output networks, including a discussion of the relevance of the Vapnik Chervonenkis dimension, and of estimates of the dimension for several neural network models. In addition, Anthony and Bartlett develop a model of classification by real-output networks, and demonstrate the usefulness of classification with a "large margin." The authors explain the role of scale-sensitive versions of the Vapnik Chervonenkis dimension in large margin classification, and in real prediction. Key chapters also discuss the computational complexity of neural network learning, describing a variety of hardness results, and outlining two efficient, constructive learning algorithms. The book is self-contained and accessible to researchers and graduate students in computer science, engineering, and mathematics

Overcoming the complexity of diagnostic problems due to sensor network architecture

In fault detection and diagnostics, limitations coming from the sensor network architecture are one of the main challenges in evaluating a system’s health status. Usually the design of the sensor network architecture is not solely based on diagnostic purposes, other factors like controls, financial constraints, and practical limitations are also involved. As a result, it quite common to have one sensor (or one set of sensors) monitoring the behaviour of two or more components. This can significantly extend the complexity of diagnostic problems. In this paper a systematic approach is presented to deal with such complexities. It is shown how the problem can be formulated as a Bayesian network based diagnostic mechanism with latent variables. The developed approach is also applied to the problem of fault diagnosis in HVAC systems, an application area with considerable modeling and measurement constraints.

Group maintenance scheduling : a case study for a pipeline network

This paper presents a group maintenance scheduling case study for a water distributed network. This water pipeline network presents the challenge of maintaining aging pipelines with the associated increases in annual maintenance costs. The case study focuses on developing an effective maintenance plan for the water utility. Current replacement planning is difficult as it needs to balance the replacement needs under limited budgets. A Maintenance Grouping Optimization (MGO) model based on a modified genetic algorithm was utilized to develop an optimum group maintenance schedule over a 20-year cycle. The adjacent geographical distribution of pipelines was used as a grouping criterion to control the searching space of the MGO model through a Judgment Matrix. Based on the optimum group maintenance schedule, the total cost was effectively reduced compared with the schedules without grouping maintenance jobs. This optimum result can be used as a guidance to optimize the current maintenance plan for the water utility.

Common variation in the fibroblast growth factor receptor 2 gene is not associated with endometriosis risk

BACKGROUND Endometriosis is a polygenic disease with a complex and multifactorial aetiology that affects 8-10% of women of reproductive age. Epidemiological data support a link between endometriosis and cancers of the reproductive tract. Fibroblast growth factor receptor 2 (FGFR2) has recently been implicated in both endometrial and breast cancer. Our previous studies on endometriosis identified significant linkage to a novel susceptibility locus on chromosome 10q26 and the FGFR2 gene maps within this linkage region. We therefore hypothesized that variation in FGFR2 may contribute to the risk of endometriosis. METHODS We genotyped 13 single nucleotide polymorphisms (SNPs) densely covering a 27 kb region within intron 2 of FGFR2 including two SNPs (rs2981582 and rs1219648) significantly associated with breast cancer and a total 40 tagSNPs across 150 kb of the FGFR2 gene. SNPs were genotyped in 958 endometriosis cases and 959 unrelated controls. RESULTS We found no evidence for association between endometriosis and FGFR2 intron 2 SNPs or SNP haplotypes and no evidence for association between endometriosis and variation across the FGFR2 gene. CONCLUSIONS Common variation in the breast-cancer implicated intron 2 and other highly plausible causative candidate regions of FGFR2 do not appear to be a major contributor to endometriosis susceptibility in our large Australian sample.