Solvability of multi-point boundary value problem at resonance--Part IV

title: Solvability of multi-point boundary value problem at resonance (III)
abstract: In this paper, we consider the following second order ordinary differential equation(1.1)x^'^'=f(t,x(t),x^'(t))+e(t),t@?(0,1),subject to one of the following boundary value conditions: (1.2)x(0)=@?"i"="1^m^-^2@a"ix(@x"i),x(1)=@?"j"="1^n^-^2@b"jx(@h"j),(1.3)x(0)=@?"i"="1^m^-^2@a"ix(@x"i),x^'(1)=@?"j"="1^n^-^2@b"jx^'(@h"j),(1.4)x^'(0)=@?"i"="1^m^-^2@a"ix^'(@x"i),x(1)=@?"j"="1^n^-^2@b"jx(@h"j),where @a"i(1=

title: A note on a nonlocal boundary value problems
abstract: A nonlocal boundary value problems for a second-order ordinary differential equation is considered in this note. An existence result is obtained by the help of the coincidence degree theory.

title: Note on third-order boundary value problem for differential equations with deviating arguments
abstract: A third-order boundary value problem for differential equations with deviating arguments is considered in this note. An existence result is obtained by the help of the well-known Leray-Schauder Alternative. Also, a uniqueness result is given.

title: Positive solutions of three-point boundary value problems for the one-dimensional p-laplacian with infinitely many singularities
abstract: We consider thesingular three-point boundary value problems 
(φp(y′))′ + a(t)f(y(t)) = 0, 0 < t < 1, y′(0) = 0, y(1) = βy(ƞ), 
where φp(s) = |s|p−2s, p ≥ 2, 0 < β < 1, 0 < η < 1, f ϵ C([0, + ∞), [0, + ∞)), a: [0,1] → [0, + ∞), andhas countably many singularities in [0, frsol|1/2). We show that there exist countably many positive solutions by using the fixed-point index theory.

title: A singular integral of the composite operator
abstract: We establish the Poincare-type inequalities for the composition of the homotopy operator and the projection operator. We also obtain some estimates for the integral of the composite operator with a singular density.

title: Cut-and-Paste Editing over 3D Meshes
abstract: A novel direct cut-and-paste editing method over 3D triangular meshes is proposed in this paper. The source feature mesh is transferred to the position where it is to be pasted through the corresponding planes. The planes are created using the least squares approximation. To decrease the distortion of pasting region, the local mesh representation is used, and the pasted region is reconstructed in the least squares sense. Then, the boundary vertices of the source feature mesh are connected with the target mesh. This method is applicable to source geometry features with non-zero genus. It can be performed at interactive rates and produces less distortion and natural results

title: Web Page Cleaning for Web Mining through Feature Weighting
abstract: Unlike conventional data or text, Web pages typically contain a large amount of information that is not part of the main contents of the pages, e.g., banner ads, navigation bars, and copyright notices. Such irrelevant information (which we call Web page noise) in Web pages can seriously harm Web mining, e.g., clustering and classification. In this paper, we propose a novel feature weighting technique to deal with Web page noise to enhance Web mining. This method first builds a compressed structure tree to capture the common structure and comparable blocks in a set of Web pages. It then uses an information based measure to evaluate the importance of each node in the compressed structure tree. Based on the tree and its node importance values, our method assigns a weight to each word feature in its content block. The resulting weights are used in Web mining. We evaluated the proposed technique with two Web mining tasks, Web page clustering and Web page classification. Experimental results show that our weighting method is able to dramatically improve the mining results.

title: Boundary Constrained Manifold Unfolding

title: Numerical Experiments with Monte Carlo Methods and SPAI Preconditioner for Solving System of Linear Equations
abstract: In this paper we present the results of experiments comparing the performance of the mixed Monte Carlo algorithms and SPAI preconditener with BICGSTAB. The experiments are carried out on a Silicon Graphics ONYX2 machine. Based on our experiments, we conclude that these techniques are comparable from the point of view of robustness and rates of convergence, with the Monte Carlo approach performing better for some general cases and SPAI approach performing better in case of very sparse matrices.

title: A refinement approach to search and constraint satisfaction problem