Almost Fixed Points and Fixed Points of Upper [Lower] Semicontinuous Multimap on Locally G-convex Spaces

In this paper, we use the well known KKM type theorem for generalized convex spaces due to Park （Elements of the KKM theory for generalized convex spaces, Korean J. Comp. Appl. Math., 7（2000）, 1-28） to obtain an almost fixed point theorem for upper [resp., lower] semicontinuous multimaps in locally G-convex spaces, and then give a fixed point theorem for upper semicontinuous multimap with closed Γ-convex values.

An improved local radial point interpolation method for transient heat conduction analysis

The smoothing thin plate spline （STPS） interpolation using the penalty function method according to the optimization theory is presented to deal with transient heat conduction problems. The smooth conditions of the shape functions and derivatives can be satisfied so that the distortions hardly occur. Local weak forms are developed using the weighted residual method locally from the partial differential equations of the transient heat conduction. Here the Heaviside step function is used as the test function in each sub-domain to avoid the need for a domain integral. Essential boundary conditions can be implemented like the finite element method （FEM） as the shape functions possess the Kronecker delta property. The traditional two-point difference method is selected for the time discretization scheme. Three selected numerical examples are presented in this paper to demonstrate the availability and accuracy of the present approach comparing with the traditional thin plate spline （TPS） radial basis functions.

MONOTONE POINTS IN ORLICZ-BOCHNER SEQUENCE SPACES

In Orlicz-Bochner sequence spaces endowed with Orlicz norm and Luxemburg norm, points of lower monotonicity, upper monotonicity, lower local uniform monotonicity and upper local uniform monotonicity are characterized.

Contrast Enhancement Based Image Detection Using Edge Preserved Key Pixel Point Filtering

In existing methods for segmented images,either edge point extraction or preservation of edges,compromising contrast images is so sensitive to noise.The Degeneration Threshold Image Detection(DTID)framework has been proposed to improve the contrast of edge filtered images.Initially,DTID uses a Rapid Bilateral Filtering process for filtering edges of contrast images.This filter decomposes input images into base layers in the DTID framework.With minimal filtering time,Rapid Bilateral Filtering handles high dynamic contrast images for smoothening edge preservation.In the DTID framework,Rapid Bilateral Filtering with Shift-Invariant Base Pass Domain Filter is insensitive to noise.This Shift-Invariant Filtering estimates value across edges for removing outliers(i.e.,noise preserving base layers of the contrast image).The intensity values are calculated in the base layer of the contrast image for accurately detecting nearby spatial locations using Shift-Invariant base Pass Domain Filter(SIDF).At last,Affine Planar Transformation is applied to detect edge filtered contrast images in the DTID framework for attaining a high quality of the image.It normalizes the translation and rotation of images.With this,Degeneration Threshold Image Detection maximizes average contrast enhancement quality and performs an experimental evaluation of factors such as detection accuracy,rate,and filtering time on contrast images.Experimental analysis shows that the DTID framework reduces the filtering time taken on contrast images by 54%and improves average contrast enhancement quality by 27%compared to GUMA,HMRF,SWT,and EHS.It provides better performance on the enhancement of average contrast enhancement quality by 28%,detection accuracy rate by 26%,and reduction in filtering time taken on contrast images by 30%compared to state-of-art methods.

An invariant interest point detector under image affine transformation

For vision-based mobile robot navigation, images of the same scene may undergo a general affine transformation in the case of significant viewpoint changes. So, a novel method for detecting affine invariant interest points is proposed to obtain the invariant local features, which is coined polynomial local orientation tensor(PLOT). The new detector is based on image local orientation tensor that is constructed from the polynomial expansion of image signal. Firstly, the properties of local orientation tensor of PLOT are analyzed, and a suitable tuning parameter of local orientation tensor is chosen so as to extract invariant features. The initial interest points are detected by local maxima search for the smaller eigenvalues of the orientation tensor. Then, an iterative procedure is used to allow the initial interest points to converge to affine invariant interest points and regions. The performances of this detector are evaluated on the repeatability criteria and recall versus 1-precision graphs, and then are compared with other existing approaches. Experimental results for PLOT show strong performance under affine transformation in the real-world conditions.

ELASTIC DYNAMIC ANALYSIS OF MODERATELY THICK PLATE USING MESHLESS LRPIM

A meshless local radial point interpolation method （LRPIM） for solving elastic dy-namic problems of moderately thick plates is presented in this paper. The discretized system equation of the plate is obtained using a locally weighted residual method. It uses a radial basis function （RBF） coupled with a polynomial basis function as a trial function,and uses the quartic spline function as a test function of the weighted residual method. The shape function has the properties of the Kronecker delta function,and no additional treatment is done to impose essen-tial boundary conditions. The Newmark method for solving the dynamic problem is adopted in computation. Effects of sizes of the quadrature sub-domain and influence domain on the dynamic properties are investigated. The numerical results show that the presented method can give quite accurate results for the elastic dynamic problem of the moderately thick plate.

MONOTONICITY IN ORLICZ-LORENTZ SEQUENCE SPACES EQUIPPED WITH THE ORLICZ NORM

In Orlicz-Lorentz sequence space Aψ,w with the Orlicz norm, uniform monotonic- ity, points of upper local uniform monotonicity and lower local uniform monotonicity are characterized. Moreover, the monotonicity coefficient in Aψ,w are discussed.

The Generalized Regular Points and Narrow Spectrum Points of Bounded Linear Operators on Hilbert Spaces

In this paper, we introduce the concepts of generalized regular points and narrow spectrum points of bounded linear operators on Hilbert spaces. The concept of generalized regular points is an extension of the concept regular points, and so, the set of all spectrum points is reduced to the narrow spectrum. We present not only the same and different properties of spectrum and of narrow spectrum but also show the relationship between them. Finally, the well known problem about the invariant subspaces of bounded linear operators on separable Hilbert spaces is simplified to the problem of the operator with narrow spectrum only.

Realization of Fixed Point Sets

Let f: X→X be a selfmap of a compact connected polyhedron, and A a nonempty closed subset of X. In this paper, we shall deal with the question whether or not there is a map g: X→X homotopic to f such that the fixed point set Fixg of g equals A. We introduce a necessary condition for the existence of such a map g. It is shown that this condition is easy to check, and hence some sufficient conditions are obtained.

Upper(Lower) Monotone Coefficient of a Point in Orlicz Function Spaces

The calculation expressions of upper （lower） monotone coefficient of a point in Orlicz function spaces are given.

Simulation research for mobile robot path planning based on improved artificial potential field method recommended by the AsiaSim

Mobile robot path planning is an important research branch in the field of mobile robots.The main disadvantage of the traditional artificial potential field(APF)method is prone to local minima problems.Improved artificial potential field(IAPF)method is presented in this paper to solve the problem in the traditional APF method for robot path planning in different conditions.We introduce the distance between the robot and the target point to the function of the original repulsive force field and change the original direction of the repulsive force to avoid the trap problem caused by the local minimum point.The IAPF method is suitable for mobile robot path planning in the complicated environment.Simulation and experiment results at the robot platform illustrated the superiority of the modified IAPF method.

The Application of ODE Method in Constrained Optimization

in this paper,a new method to solve the general constrained optimization problem is proposed,theproblem of finding the local optimal points of the nonlinear programming problem with equality and inequality constraints is considered by solving the ODE d.e.Ordinary oprential Equation)with aPPropriatenumerical procedure.Moreover,the rate of conveyance to optimal points is quadratic.Some numerical resultis given to show the efficiency of the method proposed in this poper.