A cell migration device that maintains a defined surface with no cellular damage during wound edge generation

Studying the rate of cell migration provides insight into fundamental cell biology as well as a tool to assess the functionality of synthetic surfaces and soluble environments used in tissue engineering. The traditional tools used to study cell migration include the fence and wound healing assays. In this paper we describe the development of a microchannel based device for the study of cell migration on defined surfaces. We demonstrate that this device provides a superior tool, relative to the previously mentioned assays, for assessing the propagation rate of cell wave fronts. The significant advantage provided by this technology is the ability to maintain a virgin surface prior to the commencement of the cell migration assay. Here, the device is used to assess rates of mouse fibroblasts (NIH 3T3) and human osteosarcoma (SaOS2) cell migration on surfaces functionalized with various extracellular matrix proteins as a demonstration that confining cell migration within a microchannel produces consistent and robust data. The device design enables rapid and simplistic assessment of multiple repeats on a single chip, where surfaces have not been previously exposed to cells or cellular secretions.

Epithelial—mesenchymal and mesenchymal—epithelial transitions in carcinoma progression

Like a set of bookends, cellular, molecular, and genetic changes of the beginnings of life mirror those of one of the most common cause of death—metastatic cancer. Epithelial to mesenchymal transition (EMT) is an important change in cell phenotype which allows the escape of epithelial cells from the structural constraints imposed by tissue architecture, and was first recognized by Elizabeth Hay in the early to mid 1980's to be a central process in early embryonic morphogenesis. Reversals of these changes, termed mesenchymal to epithelial transitions (METs), also occur and are important in tissue construction in normal development. Over the last decade, evidence has mounted for EMT as the means through which solid tissue epithelial cancers invade and metastasize. However, demonstrating this potentially rapid and transient process in vivo has proven difficult and data connecting the relevance of this process to tumor progression is still somewhat limited and controversial. Evidence for an important role of MET in the development of clinically overt metastases is starting to accumulate, and model systems have been developed. This review details recent advances in the knowledge of EMT as it occurs in breast development and carcinoma and prostate cancer progression, and highlights the role that MET plays in cancer metastasis. Finally, perspectives from a clinical and translational viewpoint are discussed

Using Fiber Bragg Grating (FBG) sensors to measure vertical displacements of bridges : a preliminary study

In many bridges, vertical displacements are the most relevant parameter for monitoring in the both short and long term. However, it is difficult to measure vertical displacements of bridges and yet they are among the most important indicators of structural behaviour. Therefore, it prompts a need to develop a simple, inexpensive and yet more practical method to measure vertical displacements of bridges. With the development of fiber-optics technologies, fiber Bragg grating (FBG) sensors have been widely used in structural health monitoring. The advantages of these sensors over the conventional sensors include multiplexing capabilities, high sample rate, small size and electro magnetic interference (EMI) immunity. In this paper, methods of vertical displacement measurements of bridges are first reviewed. Then, FBG technology is briefly introduced including principle, sensing system, characteristics and different types of FBG sensors. Finally, the methodology of vertical displacement measurements using FBG sensors is presented and a trial test is described. It is concluded that using FBG sensors is feasible to measure vertical displacements of bridges. This method can be used to understand global behaviour of bridge‘s span and can further develop for structural health monitoring techniques such as damage detection.

Learning the kernel matrix with semidefinite programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive semidefinite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space - classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semidefinite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -using the labeled part of the data one can learn an embedding also for the unlabeled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method for learning the 2-norm soft margin parameter in support vector machines, solving an important open problem.

Matrix regularization techniques for online multitask learning

In this paper we examine the problem of prediction with expert advice in a setup where the learner is presented with a sequence of examples coming from different tasks. In order for the learner to be able to benefit from performing multiple tasks simultaneously, we make assumptions of task relatedness by constraining the comparator to use a lesser number of best experts than the number of tasks. We show how this corresponds naturally to learning under spectral or structural matrix constraints, and propose regularization techniques to enforce the constraints. The regularization techniques proposed here are interesting in their own right and multitask learning is just one application for the ideas. A theoretical analysis of one such regularizer is performed, and a regret bound that shows benefits of this setup is reported.

Learning the Kernel Matrix with Semi-Definite Programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive definite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space -- classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semi-definite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -- using the labelled part of the data one can learn an embedding also for the unlabelled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method to learn the 2-norm soft margin parameter in support vector machines, solving another important open problem. Finally, the novel approach presented in the paper is supported by positive empirical results.