Boundary knot method for 2D and 3D Helmholtz and convection-diffusion problems under complicated geometry

The boundary knot method (BKM) of very recent origin is an inherently meshless, integration-free, boundary-type, radial basis function collocation technique for the numerical discretization of general partial differential equation systems. Unlike the method of fundamental solutions, the use of non-singular general solution in the BKM avoids the unnecessary requirement of constructing a controversial artificial boundary outside the physical domain. The purpose of this paper is to extend the BKM to solve 2D Helmholtz and convection-diffusion problems under rather complicated irregular geometry. The method is also first applied to 3D problems. Numerical experiments validate that the BKM can produce highly accurate solutions using a relatively small number of knots. For inhomogeneous cases, some inner knots are found necessary to guarantee accuracy and stability. The stability and convergence of the BKM are numerically illustrated and the completeness issue is also discussed.

A Numerical Study of Indentation Using Indenters of Different Geometry

Finite element simulation of the Berkovich, Vickers, Knoop, and cone indenters was carried out for the indentation of elastic-plastic material. To fix the semiapex angle of the cone, several rules of equivalence were used and examined. Despite the asymmetry and differences in the stress and strain fields, it was established that for the Berkovich and Vickers indenters, the load-displacement relation can closely be simulated by a single cone indenter having a semiapex angle equal to 70.3degrees in accordance with the rule of the volume equivalence. On the other hand, none of the rules is applicable to the Knoop indenter owing to its great asymmetry. The finite element method developed here is also applicable to layered or gradient materials with slight modifications.

A geometry model for tortuosity of flow path in porous media

A simple geometry model for tortuosity of flow path in porous media is proposed based on the assumption that some particles in a porous medium are unrestrictedly overlapped and the others are not. The proposed model is expressed as a function of porosity and there is no empirical constant in this model. The model predictions are compared with those from available correlations obtained numerically and experimentally, both of which are in agreement with each other. The present model can also give the tortuosity with a good approximation near the percolation threshold. The validity of the present tortuosity model is thus verified.

Fractal geometry model for effective thermal conductivity of three-phase porous media

An approximate model, a fractal geometry model, for the effective thermal conductivity of three-phase/unsaturated porous media is proposed based on the thermal-electrical analogy technique and on statistical self-similarity of porous media. The proposed thermal conductivity model is expressed as a function of porosity (related to stage n of Sierpinski carpet), ratio of areas, ratio of component thermal conductivities, and saturation. The recursive algorithm for the thermal conductivity by the proposed model is presented and found to be quite simple. The model predictions are compared with the existing measurements. Good agreement is found between the present model predictions and the existing experimental data. This verifies the validity of the proposed model. (C) 2004 American Institute of Physics.

Effect of absorption on the diffraction efficiency in Fe : LiNbO3 crystal with 90 degrees recording geometry

In this paper the saturated diffraction efficiency has been optimized by considering the effect of the absorption of the recording light on a crossed-beam grating with 90 degrees recording geometry in Fe:LiNbO3 crystals. The dependence of saturated diffraction efficiency on the doping levels with a known oxidation-reduction state, as well as the dependence of saturated diffraction efficiency on oxidation-reduction state with known doping levels, has been investigated. Two competing effects on the saturated diffraction efficiency were discussed, and the intensity profile of the diffracted beam at the output boundary has also been investigated. The results show that the maximal saturated diffraction efficiency can be obtained in crystals with moderate doping levels and modest oxidation state. An experimental verification is performed and the results are consistent with those of the theoretical calculation.

The multi-weight neuron with geometry algorithm and its application

A novel approach for multi-dimension signals processing, that is multi-weight neural network based on high dimensional geometry theory, is proposed. With this theory, the geometry algorithm for building the multi-weight neuron is mentioned. To illustrate the advantage of the novel approach, a Chinese speech emotion recognition experiment has been done. From this experiment, the human emotions are classified into 6 archetypal classes: fear, anger, happiness, sadness, surprise and disgust. And the amplitude, pitch frequency and formant are used as the feature parameters for speech emotion recognition. Compared with traditional GSVM model, the new method has its superiority. It is noted that this method has significant values for researches and applications henceforth.

Geometrical learning, descriptive geometry, and biomimetic pattern recognition

Studies on learning problems from geometry perspective have attracted an ever increasing attention in machine learning, leaded by achievements on information geometry. This paper proposes a different geometrical learning from the perspective of high-dimensional descriptive geometry. Geometrical properties of high-dimensional structures underlying a set of samples are learned via successive projections from the higher dimension to the lower dimension until two-dimensional Euclidean plane, under guidance of the established properties and theorems in high-dimensional descriptive geometry. Specifically, we introduce a hyper sausage like geometry shape for learning samples and provides a geometrical learning algorithm for specifying the hyper sausage shapes, which is then applied to biomimetic pattern recognition. Experimental results are presented to show that the proposed approach outperforms three types of support vector machines with either a three degree polynomial kernel or a radial basis function kernel, especially in the cases of high-dimensional samples of a finite size. (c) 2005 Elsevier B.V. All rights reserved.

Blind image restoration based on the theory of high-dimensional space geometry

In practical situations, the causes of image blurring are often undiscovered or difficult to get known. However, traditional methods usually assume the knowledge of the blur has been known prior to the restoring process, which are not practicable for blind image restoration. A new method proposed in this paper aims exactly at blind image restoration. The restoration process is transformed into a problem of point distribution analysis in high-dimensional space. Experiments have proved that the restoration could be achieved using this method without re-knowledge of the image blur. In addition, the algorithm guarantees to be convergent and has simple computation.

Geometry parameter optimization of large cross-sectional S-shaped bent rib waveguides for silicon based optical switches

地址: Chinese Acad Sci, Inst Semicond, State Key Lab Integrated Optoelect, Beijing 100083, Peoples R China

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.

Information geometry theory of high-dimension space and application for speaker independent continuous digit speech recognition

In the light of descriptive geometry and notions in set theory, this paper re-defines the basic elements in space such as curve and surface and so on, presents some fundamental notions with respect to the point cover based on the High-dimension space (HDS) point covering theory, finally takes points from mapping part of speech signals to HDS, so as to analyze distribution information of these speech points in HDS, and various geometric covering objects for speech points and their relationship. Besides, this paper also proposes a new algorithm for speaker independent continuous digit speech recognition based on the HDS point dynamic searching theory without end-points detection and segmentation. First from the different digit syllables in real continuous digit speech, we establish the covering area in feature space for continuous speech. During recognition, we make use of the point covering dynamic searching theory in HDS to do recognition, and then get the satisfying recognized results. At last, compared to HMM (Hidden Markov models)-based method, from the development trend of the comparing results, as sample amount increasing, the difference of recognition rate between two methods will decrease slowly, while sample amount approaching to be very large, two recognition rates all close to 100% little by little. As seen from the results, the recognition rate of HDS point covering method is higher than that of in HMM (Hidden Markov models) based method, because, the point covering describes the morphological distribution for speech in HDS, whereas HMM-based method is only a probability distribution, whose accuracy is certainly inferior to point covering.

An algorithm for removing facial makeup disturbances based on high dimensional imaginal geometry

In this paper, a novel algorithm for removing facial makeup disturbances as a face detection preprocess based on high dimensional imaginal geometry is proposed. After simulation and practical application experiments, the algorithm is theoretically analyzed. Its apparent effect of removing facial makeup and the advantages of face detection with this pre-process over face detection without it are discussed. Furthermore, in our experiments with color images, the proposed algorithm even gives some surprises.

Mandarin speech emotion recognition based on high dimensional geometry theory

In this paper, a novel approach for mandarin speech emotion recognition, that is mandarin speech emotion recognition based on high dimensional geometry theory, is proposed. The human emotions are classified into 6 archetypal classes: fear, anger, happiness, sadness, surprise and disgust. According to the characteristics of these emotional speech signals, the amplitude, pitch frequency and formant are used as the feature parameters for speech emotion recognition. The new method called high dimensional geometry theory is applied for recognition. Compared with traditional GSVM model, the new method has some advantages. It is noted that this method has significant values for researches and applications henceforth.