Bio-inspired mechanics of reversible adhesion: Orientation-dependent adhesion strength for non-slipping adhesive contact with transversely isotropic elastic materials

Geckos and many insects have evolved elastically anisotropic adhesive tissues with hierarchical structures that allow these animals not only to adhere robustly to rough surfaces but also to detach easily upon movement. In order to improve Our understanding of the role of elastic anisotropy in reversible adhesion, here we extend the classical JKR model of adhesive contact mechanics to anisotropic materials. In particular, we consider the plane strain problem of a rigid cylinder in non-slipping adhesive contact with a transversely isotropic elastic half space with the axis of symmetry oriented at an angle inclined to the surface. The cylinder is then subjected to an arbitrarily oriented pulling force. The critical force and contact width at pull-off are calculated as a function of the pulling angle. The analysis shows that elastic anisotropy leads to an orientation-dependent adhesion strength which can vary strongly with the direction of pulling. This study may suggest possible mechanisms by which reversible adhesion devices can be designed for engineering applications. (C) 2006 Elsevier Ltd. All rights reserved.

生物黏附与仿生黏附力学的进展

介绍了动物及昆虫黏附能力及黏附系统的实验研究,重点介绍了力学仿生动物及昆虫的黏附能力及黏附系统的研究工作.还简单介绍实验室仿生制备及仿生黏附潜在的用途,并对仿生黏附力学新的研究方向提出建议.

On the contact width in generalized plain strain JKR model for isotropic solids

Adhesive contact model between an elastic cylinder and an elastic half space is studied in the present paper, in which an external pulling force is acted on the above cylinder with an arbitrary direction and the contact width is assumed to be asymmetric with respect to the structure. Solutions to the asymmetric model are obtained and the effect of the asymmetric contact width on the whole pulling process is mainly discussed. It is found that the smaller the absolute value of Dundurs' parameter beta or the larger the pulling angle theta, the more reasonable the symmetric model would be to approximate the asymmetric one.

A Cancer Recognition Method Based on DNA Microarray

The accurate cancer classification is of great importance in clinical treatment. Recently, the DNA microarray technology provides a promising approach to the diagnosis and prognosis of cancer types. However, it has no perfect method for the multiclass classification problem. The difficulty lies in the fact that the data are of high dimensionality with small sample size. This paper proposed an automatic classification method of multiclass cancers based on Biomimetic pattern recognition (BPR). To the public GCM data set, the average correct classification rate reaches 80% under the condition that the correct rejection rate is 81%.

Double synaptic weight neuron theory and its application

In this paper, a novel mathematical model of neuron-Double Synaptic Weight Neuron (DSWN)(l) is presented. The DSWN can simulate many kinds of neuron architectures, including Radial-Basis-Function (RBF), Hyper Sausage and Hyper Ellipsoid models, etc. Moreover, this new model has been implemented in the new CASSANN-II neurocomputer that can be used to form various types of neural networks with multiple mathematical models of neurons. The flexibility of the DSWN has also been described in constructing neural networks. Based on the theory of Biomimetic Pattern Recognition (BPR) and high-dimensional space covering, a recognition system of omni directionally oriented rigid objects on the horizontal surface and a face recognition system had been implemented on CASSANN-II neurocomputer. In these two special cases, the result showed DSWN neural network had great potential in pattern recognition.

High dimensional imagery geometry and it's applications

Because of information digitalization and the correspondence of digits and the coordinates, Information Science and high-dimensional space have consanguineous relations. With the transforming from the information issues to the point analysis in high-dimensional space, we proposed a novel computational theory, named High dimensional imagery geometry (HDIG). Some computational algorithms of HDIG have been realized using software, and how to combine with groups of simple operators in some 2D planes to implement the geometrical computations in high-dimensional space is demonstrated in this paper. As the applications, two kinds of experiments of HDIG, which are blurred image restoration and pattern recognition ones, are given, and the results are satisfying.

A novel face recognition method based on hypersausage neural networks

In this paper, we firstly give the nature of 'hypersausages', study its structure and training of the network, then discuss the nature of it by way of experimenting with ORL face database, and finally, verify its unsurpassable advantages compared with other means.

Phylogeny of SARS-CoV based on high-dimensional information geometry

We proposed a novel methodology, which firstly, extracting features from species' complete genome data, using k-tuple, followed by studying the evolutionary relationship between SARS-CoV and other coronavirus species using the method, called "High-dimensional information geometry". We also used the mothod, namely "caculating of Minimum Spanning Tree", to construct the Phyligenetic tree of the coronavirus. From construction of the unrooted phylogenetic tree, we found out that the evolution distance between SARS-CoV and other coronavirus species is comparatively far. The tree accurately rebuilt the three groups of other coronavirus. We also validated the assertion from other literatures that SARS-CoV is similar to the coronavirus species in Group I.

Discussion on the basic mathematical models of neurons - Double synaptic weight neuron in general-purpose neurocomputer, theory and application

Based on the introduction of the traditional mathematical models of neurons in general-purpose neurocomputer, a novel all-purpose mathematical model-Double synaptic weight neuron (DSWN) is presented, which can simulate all kinds of neuron architectures, including Radial-Basis-Function (RBF) and Back-propagation (BP) models, etc. At the same time, this new model is realized using hardware and implemented in the new CASSANN-II neurocomputer that can be used to form various types of neural networks with multiple mathematical models of neurons. In this paper, the flexibility of the new model has also been described in constructing neural networks and based on the theory of Biomimetic pattern recognition (BPR) and high-dimensional space covering, a recognition system of omni directionally oriented rigid objects on the horizontal surface and a face recognition system had been implemented on CASSANN-H neurocomputer. The result showed DSWN neural network has great potential in pattern recognition.

Research on multi-degree-of-freedom neurons with weighted graphs

In this paper, we redefine the sample points set in the feature space from the point of view of weighted graph and propose a new covering model - Multi-Degree-of-Freedorn Neurons (MDFN). Base on this model, we describe a geometric learning algorithm with 3-degree-of-freedom neurons. It identifies the sample points secs topological character in the feature space, which is different from the traditional "separation" method. Experiment results demonstrates the general superiority of this algorithm over the traditional PCA+NN algorithm in terms of efficiency and accuracy.

Continuous speech research based on HyperSausage Neuron

In this paper, we presents HyperSausage Neuron based on the High-Dimension Space(HDS), and proposes a new algorithm for speaker independent continuous digit speech recognition. At last, compared to HMM-based method, the recognition rate of HyperSausage Neuron method is higher than that of in HMM-based method.

Computational information geometry and its applications

Digitization is the main feature of modern Information Science. Conjoining the digits and the coordinates, the relation between Information Science and high-dimensional space is consanguineous, and the information issues are transformed to the geometry problems in some high-dimensional spaces. From this basic idea, we propose Computational Information Geometry (CIG) to make information analysis and processing. Two kinds of applications of CIG are given, which are blurred image restoration and pattern recognition. Experimental results are satisfying. And in this paper, how to combine with groups of simple operators in some 2D planes to implement the geometrical computations in high-dimensional space is also introduced. Lots of the algorithms have been realized using software.

An algorithm of analysis tools on points distribution in high dimension space: The distance of a point and an infinite sub-space

This paper discusses the algorithm on the distance from a point and an infinite sub-space in high dimensional space With the development of Information Geometry([1]), the analysis tools of points distribution in high dimension space, as a measure of calculability, draw more attention of experts of pattern recognition. By the assistance of these tools, Geometrical properties of sets of samples in high-dimensional structures are studied, under guidance of the established properties and theorems in high-dimensional geometry.

Hypersausage neural networks and its application in face recognition

In this paper, we firstly give the nature of 'hypersausages', study its structure and training of the network, then discuss the nature of it by way of experimenting with ORL face database, and finally, verify its unsurpassable advantages compared with other means.

Research on multi-degree-of-freedom neurons with weighted graphs

In this paper, we redefine the sample points set in the feature space from the point of view of weighted graph and propose a new covering model - Multi-Degree-of-Freedorn Neurons (MDFN). Base on this model, we describe a geometric learning algorithm with 3-degree-of-freedom neurons. It identifies the sample points secs topological character in the feature space, which is different from the traditional "separation" method. Experiment results demonstrates the general superiority of this algorithm over the traditional PCA+NN algorithm in terms of efficiency and accuracy.