LetΓbe a Jordan curve in the complex plane and let Γ_(λ) be the constant distance boundary ofΓ.Vellis and Wu[10]introduced the notion of a(ζ,r_(0))-chordal property which guarantees that,whenλis not too large, ...LetΓbe a Jordan curve in the complex plane and let Γ_(λ) be the constant distance boundary ofΓ.Vellis and Wu[10]introduced the notion of a(ζ,r_(0))-chordal property which guarantees that,whenλis not too large, Γ_(λ) is a Jordan curve whenζ=1/2 and Γ_(λ) is a quasicircle when 0<ζ<1/2.We introduce the(ζ,r_(0),t)-chordal property,which generalizes the(ζ,r_(0))-chordal property,and we show that under the condition thatΓis(ζ,r_(0),√t)-chordal with 0<ζ<r_(0)^(1−√t)/2,there existsε>0 such that Γ_(λ) is a t-quasicircle once Γ_(λ) is a Jordan curve when 0<λ<ε.In the last part of this paper,we provide an example:Γis a kind of Koch snowflake curve which does not have the(ζ,r_(0))-chordal property for any 0<ζ<1/2,however Γ_(λ) is a Jordan curve whenλis small enough.Meanwhile,Γhas the(ζ,r_(0),√t)-chordal property with 0<ζ<r_(0)^(1−√t)/2 for any t∈(0,1/4).As a corollary of our main theorem, Γ_(λ) is a t-quasicircle for all 0<t<1/4 whenλis small enough.This means that our(ζ,r_(0),t)-chordal property is more general and applicable to more complicated curves.展开更多
Various index structures have recently been proposed to facilitate high-dimensional KNN queries, among which the techniques of approximate vector presentation and one-dimensional (1D) transformation can break the curs...Various index structures have recently been proposed to facilitate high-dimensional KNN queries, among which the techniques of approximate vector presentation and one-dimensional (1D) transformation can break the curse of dimensionality. Based on the two techniques above, a novel high-dimensional index is proposed, called Bit-code and Distance based index (BD). BD is based on a special partitioning strategy which is optimized for high-dimensional data. By the definitions of bit code and transformation function, a high-dimensional vector can be first approximately represented and then transformed into a 1D vector, the key managed by a B+-tree. A new KNN search algorithm is also proposed that exploits the bit code and distance to prune the search space more effectively. Results of extensive experiments using both synthetic and real data demonstrated that BD out- performs the existing index structures for KNN search in high-dimensional spaces.展开更多
We present the solid model edit distance(SMED),a powerful and flexible paradigm for exploiting shape similarities amongst CAD models.It is designed to measure the magnitude of distortions between two CAD models in bou...We present the solid model edit distance(SMED),a powerful and flexible paradigm for exploiting shape similarities amongst CAD models.It is designed to measure the magnitude of distortions between two CAD models in boundary representation(B-rep).We give the formal definition by analogy with graph edit distance,one of the most popular graph matching methods.To avoid the expensive computational cost potentially caused by exact computation,an approximate procedure based on the alignment of local structure sets is provided in addition.In order to verify the flexibility,we make intensive investigations on three typical applications in manufacturing industry,and describe how our method can be adapted to meet the various requirements.Furthermore,a multilevel method is proposed to make further improvements of the presented algorithm on both effectiveness and efficiency,in which the models are hierarchically segmented into the configurations of features.Experiment results show that SMED serves as a reasonable measurement of shape similarity for CAD models,and the proposed approach provides remarkable performance on a real-world CAD model database.展开更多
Detecting the boundaries of protein domains is an important and challenging task in both experimental and computational structural biology. In this paper, a promising method for detecting the domain structure of a pro...Detecting the boundaries of protein domains is an important and challenging task in both experimental and computational structural biology. In this paper, a promising method for detecting the domain structure of a protein from sequence information alone is presented. The method is based on analyzing multiple sequence alignments derived from a database search. Multiple measures are defined to quantify the domain information content of each position along the sequence. Then they are combined into a single predictor using support vector machine. What is more important, the domain detection is first taken as an imbal- anced data learning problem. A novel undersampling method is proposed on distance-based maximal entropy in the feature space of Support Vector Machine （SVM）. The overall precision is about 80%. Simulation results demonstrate that the method can help not only in predicting the complete 3D structure of a protein but also in the machine learning system on general im- balanced datasets.展开更多
The maximum distance at which an electromagnetic(EM)logging while drilling(LWD)tool detects an approaching boundary is defined as the depth of detection(DOD).Ultra-deep detection capability of the transient multicompo...The maximum distance at which an electromagnetic(EM)logging while drilling(LWD)tool detects an approaching boundary is defined as the depth of detection(DOD).Ultra-deep detection capability of the transient multicomponent EM logging measurement is investigated here.First,we adopt sine and cosine transform to calculate the transient multicomponent responses.Compared to the cosine transform,sine transform is more accurate in solving late-time responses.Then,a time-domain geosignal is introduced to sense the boundary.Results show that DOD of this transient EM measurement can be up to tens of meters,including directionally sensitivity.Additionally,by studying the decay characteristics of different components with time,cross component is confirmed to decay much faster than the coaxial/coplanar components in the formation coordinate system.A pseudo-inversion is thereby proposed to determine the dip angle of anisotropic stratified formation.Theoretical simulation results indicate that this algebraic method can determine the true dip at some particular moments.It is still stable and valid even when considering random measurement errors.Moreover,we establish the linear relationship between the time at which the half-point of geosignal curve appears and the distance to boundary(DTB),which would assist in the quick determination of DTB.展开更多
Stemming from the definition of the Cauchy principal values (CPV) integrals, a newly developed symmetrical quadrature scheme was proposed in the paper for the accurate numerical evaluation of the singular boundary int...Stemming from the definition of the Cauchy principal values (CPV) integrals, a newly developed symmetrical quadrature scheme was proposed in the paper for the accurate numerical evaluation of the singular boundary integrals in the sense of CPV encountered in the boundary element method. In the case of inner element singularities, the CPV integrals could be evaluated in a straightforward way by dividing the element into the symmetrical part and the remainder(s). And in the case of end singularities, the CPV integrals could be evaluated simply by taking a tangential distance transformation of the integrand after cutting out a symmetrical tiny zone around the singular point. In both cases, the operations are no longer necessary before the numerical implementation, which involves the dull routine work to separate out singularities from the integral kernels. Numerical examples were presented for both the two and the three dimensional boundary integrals in elasticity. Comparing the numerical results with those by other approaches demonstrates the feasibility and the effectiveness of the proposed scheme.展开更多
Based on the fact that the singular boundary integrals in the sense of Cauchy principal value can be represented approximately by the mean values of two companion nearly singular boundary integrals, a vary general app...Based on the fact that the singular boundary integrals in the sense of Cauchy principal value can be represented approximately by the mean values of two companion nearly singular boundary integrals, a vary general approach was developed in the paper. In the approach, the approximate formulation before discretization was constructed to cope with the difficulties encountered in the corner treatment in the formulations of hypersingular boundary integral equations. This makes it possible to solve the hypersingular boundary integral equation numerically in a non regularized form and in a local manner by using conforming C 0 quadratic boundary elements and standard Gaussian quadratures similar to those employed in the conventional displacement BIE formulations. The approximate formulation is very convenient to use because the corner information is comprised naturally in the representations of those approximate integrals. Numerical examples in plane elasticity show that with the present approach, the compatible or better results can be achieved in comparison with those of the conventional BIE formulations.展开更多
文摘LetΓbe a Jordan curve in the complex plane and let Γ_(λ) be the constant distance boundary ofΓ.Vellis and Wu[10]introduced the notion of a(ζ,r_(0))-chordal property which guarantees that,whenλis not too large, Γ_(λ) is a Jordan curve whenζ=1/2 and Γ_(λ) is a quasicircle when 0<ζ<1/2.We introduce the(ζ,r_(0),t)-chordal property,which generalizes the(ζ,r_(0))-chordal property,and we show that under the condition thatΓis(ζ,r_(0),√t)-chordal with 0<ζ<r_(0)^(1−√t)/2,there existsε>0 such that Γ_(λ) is a t-quasicircle once Γ_(λ) is a Jordan curve when 0<λ<ε.In the last part of this paper,we provide an example:Γis a kind of Koch snowflake curve which does not have the(ζ,r_(0))-chordal property for any 0<ζ<1/2,however Γ_(λ) is a Jordan curve whenλis small enough.Meanwhile,Γhas the(ζ,r_(0),√t)-chordal property with 0<ζ<r_(0)^(1−√t)/2 for any t∈(0,1/4).As a corollary of our main theorem, Γ_(λ) is a t-quasicircle for all 0<t<1/4 whenλis small enough.This means that our(ζ,r_(0),t)-chordal property is more general and applicable to more complicated curves.
基金Project (No. [2005]555) supported by the Hi-Tech Research and De-velopment Program (863) of China
文摘Various index structures have recently been proposed to facilitate high-dimensional KNN queries, among which the techniques of approximate vector presentation and one-dimensional (1D) transformation can break the curse of dimensionality. Based on the two techniques above, a novel high-dimensional index is proposed, called Bit-code and Distance based index (BD). BD is based on a special partitioning strategy which is optimized for high-dimensional data. By the definitions of bit code and transformation function, a high-dimensional vector can be first approximately represented and then transformed into a 1D vector, the key managed by a B+-tree. A new KNN search algorithm is also proposed that exploits the bit code and distance to prune the search space more effectively. Results of extensive experiments using both synthetic and real data demonstrated that BD out- performs the existing index structures for KNN search in high-dimensional spaces.
基金Supported by National Science Foundation of China(61373071)
文摘We present the solid model edit distance(SMED),a powerful and flexible paradigm for exploiting shape similarities amongst CAD models.It is designed to measure the magnitude of distortions between two CAD models in boundary representation(B-rep).We give the formal definition by analogy with graph edit distance,one of the most popular graph matching methods.To avoid the expensive computational cost potentially caused by exact computation,an approximate procedure based on the alignment of local structure sets is provided in addition.In order to verify the flexibility,we make intensive investigations on three typical applications in manufacturing industry,and describe how our method can be adapted to meet the various requirements.Furthermore,a multilevel method is proposed to make further improvements of the presented algorithm on both effectiveness and efficiency,in which the models are hierarchically segmented into the configurations of features.Experiment results show that SMED serves as a reasonable measurement of shape similarity for CAD models,and the proposed approach provides remarkable performance on a real-world CAD model database.
基金National Natural Science Foundation of China (Grant No. 60433020, 60673099, 60673023)"985" project of Jilin University
文摘Detecting the boundaries of protein domains is an important and challenging task in both experimental and computational structural biology. In this paper, a promising method for detecting the domain structure of a protein from sequence information alone is presented. The method is based on analyzing multiple sequence alignments derived from a database search. Multiple measures are defined to quantify the domain information content of each position along the sequence. Then they are combined into a single predictor using support vector machine. What is more important, the domain detection is first taken as an imbal- anced data learning problem. A novel undersampling method is proposed on distance-based maximal entropy in the feature space of Support Vector Machine （SVM）. The overall precision is about 80%. Simulation results demonstrate that the method can help not only in predicting the complete 3D structure of a protein but also in the machine learning system on general im- balanced datasets.
基金the financial support from the National Natural Science Foundation of China(42074134,41974146,41574118)the Scientific and Technological Research Projects of Sinopec(JP22503,P21080)+1 种基金the Major Scientific and Technological Projects of China National Petroleum Corporation(ZD2019-184-001)Shandong Provincial Natural Science Foundation(ZR2020MD050)
文摘The maximum distance at which an electromagnetic(EM)logging while drilling(LWD)tool detects an approaching boundary is defined as the depth of detection(DOD).Ultra-deep detection capability of the transient multicomponent EM logging measurement is investigated here.First,we adopt sine and cosine transform to calculate the transient multicomponent responses.Compared to the cosine transform,sine transform is more accurate in solving late-time responses.Then,a time-domain geosignal is introduced to sense the boundary.Results show that DOD of this transient EM measurement can be up to tens of meters,including directionally sensitivity.Additionally,by studying the decay characteristics of different components with time,cross component is confirmed to decay much faster than the coaxial/coplanar components in the formation coordinate system.A pseudo-inversion is thereby proposed to determine the dip angle of anisotropic stratified formation.Theoretical simulation results indicate that this algebraic method can determine the true dip at some particular moments.It is still stable and valid even when considering random measurement errors.Moreover,we establish the linear relationship between the time at which the half-point of geosignal curve appears and the distance to boundary(DTB),which would assist in the quick determination of DTB.
文摘Stemming from the definition of the Cauchy principal values (CPV) integrals, a newly developed symmetrical quadrature scheme was proposed in the paper for the accurate numerical evaluation of the singular boundary integrals in the sense of CPV encountered in the boundary element method. In the case of inner element singularities, the CPV integrals could be evaluated in a straightforward way by dividing the element into the symmetrical part and the remainder(s). And in the case of end singularities, the CPV integrals could be evaluated simply by taking a tangential distance transformation of the integrand after cutting out a symmetrical tiny zone around the singular point. In both cases, the operations are no longer necessary before the numerical implementation, which involves the dull routine work to separate out singularities from the integral kernels. Numerical examples were presented for both the two and the three dimensional boundary integrals in elasticity. Comparing the numerical results with those by other approaches demonstrates the feasibility and the effectiveness of the proposed scheme.
文摘Based on the fact that the singular boundary integrals in the sense of Cauchy principal value can be represented approximately by the mean values of two companion nearly singular boundary integrals, a vary general approach was developed in the paper. In the approach, the approximate formulation before discretization was constructed to cope with the difficulties encountered in the corner treatment in the formulations of hypersingular boundary integral equations. This makes it possible to solve the hypersingular boundary integral equation numerically in a non regularized form and in a local manner by using conforming C 0 quadratic boundary elements and standard Gaussian quadratures similar to those employed in the conventional displacement BIE formulations. The approximate formulation is very convenient to use because the corner information is comprised naturally in the representations of those approximate integrals. Numerical examples in plane elasticity show that with the present approach, the compatible or better results can be achieved in comparison with those of the conventional BIE formulations.
