Disruption of epithelial cell-matrix interactions induces apoptosis

Cell-matrix interactions have major effects upon phenotypic features such as gene regulation, cytoskeletal structure, differentiation, and aspects of cell growth control. Programmed cell death (apoptosis) is crucial for maintaining appropriate cell number and tissue organization. It was therefore of interest to determine whether cell-matrix interactions affect apoptosis. The present report demonstrates that apoptosis was induced by disruption of the interactions between normal epithelial cells and extracellular matrix. We have termed this phenomenon "anoikis." Overexpression of bcl-2 protected cells against anoikis. Cellular sensitivity to anoikis was apparently regulated: (a) anoikis did not occur in normal fibroblasts; (b) it was abrogated in epithelial cells by transformation with v-Ha-ras, v-src, or treatment with phorbol ester; (c) sensitivity to anoikis was conferred upon HT1080 cells or v-Ha-ras-transformed MDCK cells by reverse-transformation with adenovirus E1a; (d) anoikis in MDCK cells was alleviated by the motility factor, scatter factor. The results suggest that the circumvention of anoikis accompanies the acquisition of anchorage independence or cell motility.     

Model-based 3-D segmentation of multiple sclerosis lesions in magnetic resonance brain images

Human investigators instinctively segment medical images into their anatomical components, drawing upon prior knowledge of anatomy to overcome image artifacts, noise, and lack of tissue contrast. The authors describe: 1) the development and use of a brain tissue probability model for the segmentation of multiple sclerosis (MS) lesions in magnetic resonance (MR) brain images, and 2) an empirical comparison of the performance of statistical and decision tree classifiers, applied to MS lesion segmentation. Based on MR image data obtained from healthy volunteers, the model provides prior probabilities of brain tissue distribution per unit voxel in a standardized 3-D "brain space". In comparison to purely data-driven segmentation, the use of the model to guide the segmentation of MS lesions reduced the volume of false positive lesions by 50-80%     

用于烯烃复分解反应的钌茚基催化剂的合成研究进展

基于钌金属的烯烃复分解反应现今已成为一种至关重要且快速有效的催化反应类型,在聚合领域以及现代有机合成的应用方面起着改革性的推进作用。作为烯烃复分解反应催化剂的一种,钌茚基催化剂在该领域得到成功应用。结合近年来钌茚基催化剂在烯烃复分解反应中的合成研究进展,简述了其发展过程,介绍了该领域创新性的研究成果,重点论述了一些新型钌茚基催化剂的合成方法,并且探讨了辅助配体的结构对催化剂稳定性和活性的影响,最后对其发展方向以及应用前景进行了展望。     

Erratum to: Charge transfer in graphene/polymer interfaces for CO2 detection

Nano Research - The order of the authors in the original version of this article was unfortunately incorrect on the first page and the first page of the ESM. Instead of Myungwoo Son1, Yusin Pak1,...     

Periodic orbits: a new language for neuronal dynamics

A new nonlinear dynamical analysis is applied to complex behavior from neuronal systems. The conceptual foundation of this analysis is the abstraction of observed neuronal activities into a dynamical landscape characterized by a hierarchy of "unstable periodic orbits" (UPOs). UPOs are rigorously identified in data sets representative of three different levels of organization in mammalian brain. An analysis based on UPOs affords a novel alternative method of decoding, predicting, and controlling these neuronal systems.     

Modelling co-operation in the design of knowledge production systems: The Made In'Coop method

This paper presents the latest developments of the MadeIn 'Coop method for modelling the human-machine and human-human co-operation process, and an application of this method for the design of a more co-operative version of the C³I System CHEOPS. We first consider that the design of software systems for organizations is tied more and more to the perspective of compound Knowledge Production Systems that link humans and machines engaged in a co-operative problem solving process. After exposing the four principles upon which MadeIn 'Coop rests for modelling co-operation, we present an artificial problem solving dialogue between CHEOPS and its users. Consistent with the Group Cognitive Processes Theory framework, we propose a dialogue analysis according to two complimentary points of view: the Collective Problem Solving model, and the Coordination model. This analysis should help system designers to identify new system functionalities to assist problem solving.(C³I) Command Control Communication Intelligence Systems     

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R ₁×R ₂×???×R _k where R _i (for 1≤i≤k) is a closed interval of the form [a _i ,b _i ] on the real line. For a graph G, its boxicity box?(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a $\lfloor 1+\frac{1}{c}\log n\rfloor^{d-1}An axis-parallel k-dimensional box is a Cartesian product R ₁×R ₂×⋅⋅⋅×R _k where R _i (for 1≤i≤k) is a closed interval of the form [a _i ,b _i ] on the real line. For a graph G, its boxicity box (G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a ?1+\frac1clogn?^d-1\lfloor 1+\frac{1}{c}\log n\rfloor^{d-1} approximation ratio for any constant c≥1 when d≥2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard.     

A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs

In the frequency allocation problem, we are given a mobile telephone network, whose geographical coverage area is divided into cells, wherein phone calls are serviced by assigning frequencies to them so that no two calls emanating from the same or neighboring cells are assigned the same frequency. The problem is to use the frequencies efficiently, i.e., minimize the span of frequencies used. The frequency allocation problem can be regarded as a multicoloring problem on a weighted hexagonal graph. In this paper, we give a 1-local asymptotic 4/3-competitive distributed algorithm for multicoloring a triangle-free hexagonal graph, which is a special case of hexagonal graph. Based on this result, we then propose a 1-local asymptotic13/9-competitive algorithm for multicoloring the (general-case) hexagonal graph, thereby improving the previous 1-local 3/2-competitive algorithm. A preliminary version of this paper appeared in the Proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON 2007), LNCS 4598, pp. 526–536. Y. Zhang research was supported by European Regional Development Fund (ERDF). F.Y.L. Chin research was supported by Hong Kong RGC Grant HKU-7113/07E. H. Zhu research was supported by National Natural Science Fund (grant #60496321).