Search results for: uniformly convex and uniformly smooth Banach space.
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 1751

Search results for: uniformly convex and uniformly smooth Banach space.

1751 Algorithms for Computing of Optimization Problems with a Common Minimum-Norm Fixed Point with Applications

Authors: Apirak Sombat, Teerapol Saleewong, Poom Kumam, Parin Chaipunya, Wiyada Kumam, Anantachai Padcharoen, Yeol Je Cho, Thana Sutthibutpong

Abstract:

This research is aimed to study a two-step iteration process defined over a finite family of σ-asymptotically quasi-nonexpansive nonself-mappings. The strong convergence is guaranteed under the framework of Banach spaces with some additional structural properties including strict and uniform convexity, reflexivity, and smoothness assumptions. With similar projection technique for nonself-mapping in Hilbert spaces, we hereby use the generalized projection to construct a point within the corresponding domain. Moreover, we have to introduce the use of duality mapping and its inverse to overcome the unavailability of duality representation that is exploit by Hilbert space theorists. We then apply our results for σ-asymptotically quasi-nonexpansive nonself-mappings to solve for ideal efficiency of vector optimization problems composed of finitely many objective functions. We also showed that the obtained solution from our process is the closest to the origin. Moreover, we also give an illustrative numerical example to support our results.

Keywords: σ-asymptotically quasi-nonexpansive nonselfmapping, strong convergence, fixed point, uniformly convex and uniformly smooth Banach space.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1054
1750 Positive Solutions for Boundary Value Problems of Fourth-Order Nonlinear Singular Differential Equations in Banach Space

Authors: Li Xiguang

Abstract:

In this paper, by constructing a special non-empty closed convex set and utilizing M¨onch fixed point theory, we investigate the existence of solution for a class of fourth-order singular differential equation in Banach space, which improved and generalized the result of related paper.

Keywords: Banach space, cone, fixed point index, singular differential equation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1635
1749 Convergence of a One-step Iteration Scheme for Quasi-asymptotically Nonexpansive Mappings

Authors: Safeer Hussain Khan

Abstract:

In this paper, we use a one-step iteration scheme to approximate common fixed points of two quasi-asymptotically nonexpansive mappings. We prove weak and strong convergence theorems in a uniformly convex Banach space. Our results generalize the corresponding results of Yao and Chen [15] to a wider class of mappings while extend those of Khan, Abbas and Khan [4] to an improved one-step iteration scheme without any condition and improve upon many others in the literature.

Keywords: One-step iteration scheme, asymptotically quasi non expansive mapping, common fixed point, condition (a'), weak and strong convergence.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1393
1748 Two-step Iterative Process For Common Fixed Points of Two Asymptotically Quasi-nonexpansive Mappings

Authors: Safeer Hussain Khan

Abstract:

In this paper, we consider an iteration process for approximating common fixed points of two asymptotically quasinonexpansive mappings and we prove some strong and weak convergence theorems for such mappings in uniformly convex Banach spaces.

Keywords: Asypmtotically quasi-nonexpansive mappings, Commonfixed point, Strong and weak convergence, Iteration process.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1488
1747 Uniformly Persistence of a Predator-Prey Model with Holling III Type Functional Response

Authors: Yanling Zhu

Abstract:

In this paper, a predator-prey model with Holling III type functional response is studied. It is interesting that the system is always uniformly persistent, which yields the existence of at least one positive periodic solutions for the corresponding periodic system. The result improves the corresponding ones in [11]. Moreover, an example is illustrated to verify the results by simulation.

Keywords: Predator-prey model, Uniformly persistence, Comparisontheorem, Holling III type functional response.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1435
1746 Uniformly Strong Persistence for a Predator-Prey Model with Modified Leslie-Gower and Holling-Type II Schemes

Authors: Changjin Xu, Yusen Wu

Abstract:

In this paper, a asymptotically periodic predator-prey model with Modified Leslie-Gower and Holling-Type II schemes is investigated. Some sufficient conditions for the uniformly strong persistence of the system are established. Our result is an important complementarity to the earlier results.

Keywords: Predator-prey model, uniformly strong persistence, asymptotically periodic, Holling-type II.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2022
1745 Positive Solutions of Second-order Singular Differential Equations in Banach Space

Authors: Li Xiguang

Abstract:

In this paper, by constructing a special set and utilizing fixed point index theory, we study the existence of solution for the boundary value problem of second-order singular differential equations in Banach space, which improved and generalize the result of related paper.

Keywords: Banach space, cone, fixed point index, singular equation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1203
1744 An Improved Switching Median filter for Uniformly Distributed Impulse Noise Removal

Authors: Rajoo Pandey

Abstract:

The performance of an image filtering system depends on its ability to detect the presence of noisy pixels in the image. Most of the impulse detection schemes assume the presence of salt and pepper noise in the images and do not work satisfactorily in case of uniformly distributed impulse noise. In this paper, a new algorithm is presented to improve the performance of switching median filter in detection of uniformly distributed impulse noise. The performance of the proposed scheme is demonstrated by the results obtained from computer simulations on various images.

Keywords: Switching median filter, Impulse noise, Imagefiltering, Impulse detection.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1905
1743 Positive Solutions for Three-Point Boundary Value Problems of Third-Order Nonlinear Singular Differential Equations in Banach Space

Authors: Li Xiguang

Abstract:

In this paper, by constructing a special set and utilizing fixed point index theory, we study the existence of solution for singular differential equation in Banach space, which improved and generalize the result of related paper.

Keywords: Banach space, cone, fixed point index, singular differential equation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1418
1742 Derivation of Monotone Likelihood Ratio Using Two Sided Uniformly Normal Distribution Techniques

Authors: D. A. Farinde

Abstract:

In this paper, two-sided uniformly normal distribution techniques were used in the derivation of monotone likelihood ratio. The approach mainly employed the parameters of the distribution for a class of all size a. The derivation technique is fast, direct and less burdensome when compared to some existing methods.

Keywords: Neyman-Pearson Lemma, Normal distribution

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3152
1741 Constructive Proof of Tychonoff’s Fixed Point Theorem for Sequentially Locally Non-Constant Functions

Authors: Yasuhito Tanaka

Abstract:

We present a constructive proof of Tychonoff’s fixed point theorem in a locally convex space for uniformly continuous and sequentially locally non-constant functions.

Keywords: sequentially locally non-constant functions, Tychonoff’s fixed point theorem, constructive mathematics.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1460
1740 Moving Object Detection Using Histogram of Uniformly Oriented Gradient

Authors: Wei-Jong Yang, Yu-Siang Su, Pau-Choo Chung, Jar-Ferr Yang

Abstract:

Moving object detection (MOD) is an important issue in advanced driver assistance systems (ADAS). There are two important moving objects, pedestrians and scooters in ADAS. In real-world systems, there exist two important challenges for MOD, including the computational complexity and the detection accuracy. The histogram of oriented gradient (HOG) features can easily detect the edge of object without invariance to changes in illumination and shadowing. However, to reduce the execution time for real-time systems, the image size should be down sampled which would lead the outlier influence to increase. For this reason, we propose the histogram of uniformly-oriented gradient (HUG) features to get better accurate description of the contour of human body. In the testing phase, the support vector machine (SVM) with linear kernel function is involved. Experimental results show the correctness and effectiveness of the proposed method. With SVM classifiers, the real testing results show the proposed HUG features achieve better than classification performance than the HOG ones.

Keywords: Moving object detection, histogram of oriented gradient histogram of oriented gradient, histogram of uniformly-oriented gradient, linear support vector machine.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1184
1739 Sparse-View CT Reconstruction Based on Nonconvex L1 − L2 Regularizations

Authors: Ali Pour Yazdanpanah, Farideh Foroozandeh Shahraki, Emma Regentova

Abstract:

The reconstruction from sparse-view projections is one of important problems in computed tomography (CT) limited by the availability or feasibility of obtaining of a large number of projections. Traditionally, convex regularizers have been exploited to improve the reconstruction quality in sparse-view CT, and the convex constraint in those problems leads to an easy optimization process. However, convex regularizers often result in a biased approximation and inaccurate reconstruction in CT problems. Here, we present a nonconvex, Lipschitz continuous and non-smooth regularization model. The CT reconstruction is formulated as a nonconvex constrained L1 − L2 minimization problem and solved through a difference of convex algorithm and alternating direction of multiplier method which generates a better result than L0 or L1 regularizers in the CT reconstruction. We compare our method with previously reported high performance methods which use convex regularizers such as TV, wavelet, curvelet, and curvelet+TV (CTV) on the test phantom images. The results show that there are benefits in using the nonconvex regularizer in the sparse-view CT reconstruction.

Keywords: Computed tomography, sparse-view reconstruction, L1 −L2 minimization, non-convex, difference of convex functions.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1951
1738 Investigation of Heat Transfer by Natural Convection in an Open Channel

Authors: Mahmoud S. Ahmed, Hany A. Mohamed, Mohamed A. Omara, Mohamed F. Abdeen

Abstract:

Experimental study of natural convection heat transfer inside smooth and rough surfaces of vertical and inclined equilateral triangular channels of different inclination angles with a uniformly heated surface are performed. The inclination angle is changed from 15º to 90º. Smooth and rough surface of average roughness (0.02mm) are used and their effect on the heat transfer characteristics are studied. The local and average heat transfer coefficients and Nusselt number are obtained for smooth and rough channels at different heat flux values, different inclination angles and different Rayleigh numbers (Ra) 6.48 × 105 ≤ Ra ≤ 4.78 × 106. The results show that the local Nusselt number decreases with increase of axial distance from the lower end of the triangular channel to a point near the upper end of channel, and then, it slightly increases. Higher values of local Nusselt number for rough channel along the axial distance compared with the smooth channel. The average Nusselt number of rough channel is higher than that of smooth channel by about 8.1% for inclined case at θ = 45o and 10% for vertical case. The results obtained are correlated using dimensionless groups for both rough and smooth surfaces of the inclined and vertical triangular channels.

Keywords: Natural heat transfer convection, constant heat flux, open channels, heat transfer.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2315
1737 MRI Reconstruction Using Discrete Fourier Transform: A tutorial

Authors: Abiodun M. Aibinu, Momoh J. E. Salami, Amir A. Shafie, Athaur Rahman Najeeb

Abstract:

The use of Inverse Discrete Fourier Transform (IDFT) implemented in the form of Inverse Fourier Transform (IFFT) is one of the standard method of reconstructing Magnetic Resonance Imaging (MRI) from uniformly sampled K-space data. In this tutorial, three of the major problems associated with the use of IFFT in MRI reconstruction are highlighted. The tutorial also gives brief introduction to MRI physics; MRI system from instrumentation point of view; K-space signal and the process of IDFT and IFFT for One and two dimensional (1D and 2D) data.

Keywords: Discrete Fourier Transform (DFT), K-space Data, Magnetic Resonance (MR), Spin, Windows.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 5052
1736 Stress Concentration around Countersunk Hole in Isotropic Plate under Transverse Loading

Authors: Parveen K. Saini, Tarun Agarwal

Abstract:

An investigation into the effect of countersunk depth, plate thickness, countersunk angle and plate width on the stress concentration around countersunk hole is carried out with the help of finite element analysis. The variation of stress concentration with respect to these parameters is studied for three types of loading viz. uniformly distributed load, uniformly varying load and functionally distributed load. The results of the finite element analysis are interpreted and some conclusions are drawn. The distribution of stress concentration around countersunk hole in isotropic plates simply supported at all the edges is found similar and is independent of loading. The maximum stress concentration also occurs at a particular point irrespective of the loading conditions.

Keywords: Stress Concentration Factor, Countersunk hole, Finite element, ANSYS.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3268
1735 Weak Convergence of Mann Iteration for a Hybrid Pair of Mappings in a Banach Space

Authors: Alemayehu Geremew Negash

Abstract:

We prove the weak convergence of Mann iteration for a hybrid pair of maps to a common fixed point of a selfmap f and a multivalued f nonexpansive mapping T in Banach space E.  

Keywords: Common fixed point, Mann iteration, Multivalued mapping, weak convergence.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1575
1734 Stability of Property (gm) under Perturbation and Spectral Properties Type Weyl Theorems

Authors: M. H. M. Rashid

Abstract:

A Banach space operator T obeys property (gm) if the isolated points of the spectrum σ(T) of T which are eigenvalues are exactly those points λ of the spectrum for which T − λI is a left Drazin invertible. In this article, we study the stability of property (gm), for a bounded operator acting on a Banach space, under perturbation by finite rank operators, by nilpotent operators, by quasi-nilpotent operators, or more generally by algebraic operators commuting with T.

Keywords: Weyl’s theorem, Weyl spectrum, polaroid operators, property (gm), property (m).

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 703
1733 Positive Solutions of Initial Value Problem for the Systems of Second Order Integro-Differential Equations in Banach Space

Authors: Lv Yuhua

Abstract:

In this paper, by establishing a new comparison result, we investigate the existence of positive solutions for initial value problems of nonlinear systems of second order integro-differential equations in Banach space.We improve and generalize some results  (see[5,6]), and the results is new even in finite dimensional spaces.

Keywords: Systems of integro-differential equations, monotone iterative method, comparison result, cone.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1457
1732 Rational Structure of Cable Truss

Authors: V. Goremikins, K. Rocens, D. Serdjuks

Abstract:

One of the main problems of suspended cable structures is initial shape change under the action of non uniform load. The problem can be solved by increasing of weight of construction or by using of prestressing. But this methods cause increasing of materials consumption of suspended cable structure. The cable truss usage is another way how the problem of shape change under the action of non uniform load can be fixed. The cable trusses with the vertical and inclined suspensions, cross web and single cable were analyzed as the main load-bearing structures of suspension bridge. It was shown, that usage of cable truss allows to reduce the vertical displacements up to 32% in comparison with the single cable in case of non uniformly distributed load. In case of uniformly distributed load single cable is preferable.

Keywords: Cable trusses, Non uniform load, Suspension bridge, Vertical displacements.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2684
1731 Characterizations of Star-Shaped, L-Convex, and Convex Polygons

Authors: Thomas Shermer, Godfried T. Toussaint

Abstract:

A chord of a simple polygon P is a line segment [xy] that intersects the boundary of P only at both endpoints x and y. A chord of P is called an interior chord provided the interior of [xy] lies in the interior of P. P is weakly visible from [xy] if for every point v in P there exists a point w in [xy] such that [vw] lies in P. In this paper star-shaped, L-convex, and convex polygons are characterized in terms of weak visibility properties from internal chords and starshaped subsets of P. A new Krasnoselskii-type characterization of isothetic star-shaped polygons is also presented.

Keywords: Convex polygons, L-convex polygons, star-shaped polygons, chords, weak visibility, discrete and computational geometry

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2293
1730 Ultrasound-Assisted Pd Activation Process for Electroless Silver Plating

Authors: Chang-Myeon Lee, Min-Hyung Lee, Jin-Young Hur, Ho-Nyun Lee, Hong-Kee Lee

Abstract:

An ultrasound-assisted activation method for electroless silver plating is presented in this study. When the ultrasound was applied during the activation step, the amount of the Pd species adsorbed on substrate surfaces was higher than that of sample pretreated with a conventional activation process without ultrasound irradiation. With this activation method, it was also shown that the adsorbed Pd species with a size of about 5 nm were uniformly distributed on the surfaces, thus a smooth and uniform coating on the surfaces was obtained by subsequent electroless silver plating. The samples after each step were characterized by AFM, XPS, FIB, and SEM.

Keywords: Cavitation, Electroless silver, Pd activation, Ultrasonic

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2339
1729 A Constructive Proof of the General Brouwer Fixed Point Theorem and Related Computational Results in General Non-Convex sets

Authors: Menglong Su, Shaoyun Shi, Qing Xu

Abstract:

In this paper, by introducing twice continuously differentiable mappings, we develop an interior path following following method, which enables us to give a constructive proof of the general Brouwer fixed point theorem and thus to solve fixed point problems in a class of non-convex sets. Under suitable conditions, a smooth path can be proven to exist. This can lead to an implementable globally convergent algorithm. Several numerical examples are given to illustrate the results of this paper.

Keywords: interior path following method, general Brouwer fixed point theorem, non-convex sets, globally convergent algorithm

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1401
1728 Elastic Stress Analysis of Composite Cantilever Beam Loaded Uniformly

Authors: A. Kurşun, M. Tunay Çetin, E. Çetin, H. Aykul

Abstract:

In this investigation an elastic stress analysis is carried out a woven steel fiber reinforced thermoplastic cantilever beam loaded uniformly at the upper surface. The composite beam material consists of low density polyethylene as a thermoplastic (LDFE, f.2.12) and woven steel fibers. Granules of the polyethylene are put into the moulds and they are heated up to 160°C by using electrical resistance. Subsequently, the material is held for 5min under 2.5 MPa at this temperature. The temperature is decreased to 30°C under 15 MPa pressure in 3min. Closed form solution is found satisfying both the governing differential equation and boundary conditions. We investigated orientation angle effect on stress distribution of composite cantilever beams. The results show that orientation angle play an important role in determining the responses of a woven steel fiber reinforced thermoplastic cantilever beams and an optimal design of these structures.

Keywords: Cantilever beam, elastic stress analysis, orientation angle, thermoplastic.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 4212
1727 Robot Path Planning in 3D Space Using Binary Integer Programming

Authors: Ellips Masehian, Golnaz Habibi

Abstract:

This paper presents a novel algorithm for path planning of mobile robots in known 3D environments using Binary Integer Programming (BIP). In this approach the problem of path planning is formulated as a BIP with variables taken from 3D Delaunay Triangulation of the Free Configuration Space and solved to obtain an optimal channel made of connected tetrahedrons. The 3D channel is then partitioned into convex fragments which are used to build safe and short paths within from Start to Goal. The algorithm is simple, complete, does not suffer from local minima, and is applicable to different workspaces with convex and concave polyhedral obstacles. The noticeable feature of this algorithm is that it is simply extendable to n-D Configuration spaces.

Keywords: 3D C-space, Binary Integer Programming (BIP), Delaunay Tessellation, Robot Motion Planning.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2422
1726 Design of a Reduced Order Robust Convex Controller for Flight Control System

Authors: S. Swain, P. S. Khuntia

Abstract:

In this paper an optimal convex controller is designed to control the angle of attack of a FOXTROT aircraft. Then the order of the system model is reduced to a low-dimensional state space by using Balanced Truncation Model Reduction Technique and finally the robust stability of the reduced model of the system is tested graphically by using Kharitonov rectangle and Zero Exclusion Principle for a particular range of perturbation value. The same robust stability is tested theoretically by using Frequency Sweeping Function for robust stability.

Keywords: Convex Optimization, Kharitonov Stability Criterion, Model Reduction, Robust Stability.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1670
1725 Power Series Form for Solving Linear Fredholm Integral Equations of Second Order via Banach Fixed Point Theorem

Authors: Adil AL-Rammahi

Abstract:

In this paper, a new method for solution of second order linear Fredholm integral equation in power series form was studied. The result is obtained by using Banach fixed point theorem.

Keywords: Fredholm integral equation, power series, Banach fixed point theorem, Linear Systems.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2441
1724 On Constructing Approximate Convex Hull

Authors: M. Zahid Hossain, M. Ashraful Amin

Abstract:

The algorithms of convex hull have been extensively studied in literature, principally because of their wide range of applications in different areas. This article presents an efficient algorithm to construct approximate convex hull from a set of n points in the plane in O(n + k) time, where k is the approximation error control parameter. The proposed algorithm is suitable for applications preferred to reduce the computation time in exchange of accuracy level such as animation and interaction in computer graphics where rapid and real-time graphics rendering is indispensable.

Keywords: Convex hull, Approximation algorithm, Computational geometry, Linear time.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2257
1723 Ranking - Convex Risk Minimization

Authors: Wojciech Rejchel

Abstract:

The problem of ranking (rank regression) has become popular in the machine learning community. This theory relates to problems, in which one has to predict (guess) the order between objects on the basis of vectors describing their observed features. In many ranking algorithms a convex loss function is used instead of the 0-1 loss. It makes these procedures computationally efficient. Hence, convex risk minimizers and their statistical properties are investigated in this paper. Fast rates of convergence are obtained under conditions, that look similarly to the ones from the classification theory. Methods used in this paper come from the theory of U-processes as well as empirical processes.

Keywords: Convex loss function, empirical risk minimization, empirical process, U-process, boosting, euclidean family.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1370
1722 Neural Network in Fixed Time for Collision Detection between Two Convex Polyhedra

Authors: M. Khouil, N. Saber, M. Mestari

Abstract:

In this paper, a different architecture of a collision detection neural network (DCNN) is developed. This network, which has been particularly reviewed, has enabled us to solve with a new approach the problem of collision detection between two convex polyhedra in a fixed time (O (1) time). We used two types of neurons, linear and threshold logic, which simplified the actual implementation of all the networks proposed. The study of the collision detection is divided into two sections, the collision between a point and a polyhedron and then the collision between two convex polyhedra. The aim of this research is to determine through the AMAXNET network a mini maximum point in a fixed time, which allows us to detect the presence of a potential collision.

Keywords: Collision identification, fixed time, convex polyhedra, neural network, AMAXNET.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1775