A relaxed extragradient-like method for a generalized mixed equilibrium problem,a general system of generalized equilibria and a fixed point problem

Very recently, Takahashi and Takahashi [S. Takahashi, W. Takahashi, Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space, Nonlinear Anal. 69 (2008) 1025–1033] suggested and analyzed an iterative method for finding a common solution of a generalized equilibrium problem and a fixed point problem of a nonexpansive mapping in a Hilbert space. In this paper, based on Takahashi–Takahashi’s iterative method and well-known extragradient method we introduce a relaxed extragradient-like method for finding a common solution of a generalized mixed equilibrium problem, a general system of generalized equilibria and a fixed point problem of a strictly pseudocontractive mapping in a Hilbert space and then obtain a strong convergence theorem. Utilizing this theorem, we establish some new strong convergence results in fixed point problems, variational inequalities, mixed equilibrium problems and systems of generalized equilibria.     

A Priori and A Posteriori: A Bootstrapping Relationship

The distinction between a priori and a posteriori knowledge has been the subject of an enormous amount of discussion, but the literature is biased against recognizing the intimate relationship between these forms of knowledge. For instance, it seems to be almost impossible to find a sample of pure a priori or a posteriori knowledge. In this paper, it will be suggested that distinguishing between a priori and a posteriori is more problematic than is often suggested, and that a priori and a posteriori resources are in fact used in parallel. We will define this relationship between a priori and a posteriori knowledge as the bootstrapping relationship. As we will see, this relationship gives us reasons to seek for an altogether novel definition of a priori and a posteriori knowledge. Specifically, we will have to analyse the relationship between a priori knowledge and a priori reasoning, and it will be suggested that the latter serves as a more promising starting point for the analysis of aprioricity. We will also analyse a number of examples from the natural sciences and consider the role of a priori reasoning in these examples. The focus of this paper is the analysis of the concepts of a priori and a posteriori knowledge rather than the epistemic domain of a posteriori and a priori justification.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

若干笛卡尔积图的邻点可区别关联染色

An adjacent vertex distinguishing incidence coloring of graph G is an incidence coloring of G such that no pair of adjacent vertices meets the same set of colors.We obtain the adjacent vertex distinguishing incidence chromatic number of the Cartesian product of a path and a path,a path and a wheel,a path and a fan,and a path and a star.     

On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems

This paper discusses simple local search approaches for approximating the efficient set of multiobjective combinatorial optimization problems. We focus on algorithms defined by a neighborhood structure and a dominance relation that iteratively improve an archive of nondominated solutions. Such methods are referred to as dominance-based multiobjective local search. We first provide a concise overview of existing algorithms, and we propose a model trying to unify them through a fine-grained decomposition. The main problem-independent search components of dominance relation, solution selection, neighborhood exploration and archiving are largely discussed. Then, a number of state-of-the-art and original strategies are experimented on solving a permutation flowshop scheduling problem and a traveling salesman problem, both on a two- and a three-objective formulation. Experimental results and a statistical comparison are reported in the paper, and some directions for future research are highlighted.     

Partnership formation based on multiple traits

A model of partnership formation based on two traits, called beauty and character, is presented. There are two classes of individual and partners must be of different classes. Individuals prefer prospective partners with a high beauty measure and of a similar character. This problem may be interpreted as e.g. a job search problem in which the classes are employer and employee, or a mate choice problem in which the classes are male and female. Beauty can be observed instantly. However, a costly date (or interview) is required to observe the character of a prospective partner. On observing the beauty of a prospective partner, an individual decides whether he/she wishes to date. During a date, the participants observe each other’s character and then decide whether to form a pair. Mutual acceptance is required both for a date to occur and pair formation. On finding a partner, an individual stops searching. Beauty has a continuous distribution on a finite interval, while character ‘forms a circle’ and has a uniform distribution. Criteria based on the concept of a subgame perfect Nash equilibrium are used to define a symmetric equilibrium of this game. It is argued that this equilibrium is unique. When dating costs are high, this equilibrium is a block separating equilibrium as in more classical formulations of two-sided job search problems. However, for sufficiently small dating costs the form of this equilibrium is essentially different.     

Natural Isomorphism Classes of Cycle Permutation Graphs Over a Graph

 A permutation graph over a graph was introduced by Lee and Sohn in [8] as a generalization of both a graph bundle over a graph and a standard permutation graph, and they gave a characterization of a natural isomorphism and an automorphism of a given permutation graph over a graph. In this paper, we enumerate the natural isomorphism classes of cycle permutation graphs over a graph. Received: October 21, 1996 Revised: August 25, 1997     

A Characterization of Semirings Which Are Subdirect Products of a Distributive Lattice and a Ring

E -inversive semiring and a Clifford semiring and show that a semiring S is a subdirect product of a distributive lattice and a ring if and only if S is an E-inversive strong distributive lattice of halfrings. Further a Clifford semiring which is, in fact, an inversive subdirect product of a distributive lattice and a ring, is characterized as a strong distributive lattice of rings. Finally, as a consequence of these results we extend a result of Galbiati and Veronesi [2] in the case of Boolean semirings.     

Existence and uniqueness of the solution for the bidomain model used in cardiac electrophysiology

We study the well-posedness of the bidomain model that is commonly used to simulate electrophysiological wave propagation in the heart. We base our analysis on a formulation of the bidomain model as a system of coupled parabolic and elliptic PDEs for two potentials and ODEs representing the ionic activity. We first reformulate the parabolic and elliptic PDEs into a single parabolic PDE by the introduction of a bidomain operator. We properly define and analyze this operator, basically a non-differential and non-local operator. We then present a proof of existence, uniqueness and regularity of a local solution in time through a semigroup approach, but that applies to fairly general ionic models. The bidomain model is next reformulated as a parabolic variational problem, through the introduction of a bidomain bilinear form. A proof of existence and uniqueness of a global solution in time is obtained using a compactness argument, this time for an ionic model reading as a single ODE but including polynomial nonlinearities. Finally, the hypothesis behind the existence of that global solution are verified for three commonly used ionic models, namely the FitzHugh–Nagumo, Aliev–Panfilov and MacCulloch models.     

An algebraic characterization of planar graphs

A cycle in a graph is a set of edges that covers each vertex an even number of times. A cocycle is a collection of edges that intersects each cycle in an even number of edges. A bicycle is a collection of edges that is both a cycle and a cocycle. The cycles, cocycles, and bicycles each form a vector space over the integers modulo two when addition is defined as symmetric difference of sets. In this paper we examine the relationship between the left-right paths in a planar graph and the cycle space, cocylce space, and bicycle space. We show that planar graphs are characterized by the existence of a diagonal—a double cover by tours that interacts with the cycle space, cocycle space, and bicycle space in a special manner. This generalizes a result of Rosenstiehl and Read that characterized those planar graphs with no nonempty bicycles. © 1995 John Wiley & Sons, Inc.     

Cayley hypergraphs and Cayley hypermaps

In this paper, we introduce a Cayley hypergraph which is a generalization of a Cayley graph, and a Cayley hypermap which is a generalization of a Cayley map. We investigate some properties of Cayley hypergraphs and Cayley hypermaps, describe the automorphism group of a Cayley hypermap and determine when a Cayley hypermap is regular.     

Characterizations of g-frames and g-Riesz bases in Hilbert spaces

In this paper, we introduce the pre-frame operator Q for the g-frame in a complex Hilbert space, which will play a key role in studying g-frames and g-Riesz bases etc. Using the pre-frame operator Q, we give some necessary and sufficient conditions for a g-Bessel sequence, a g-frame, and a g-Riesz basis in a complex Hilbert space, which have properties similar to those of the Bessel sequence, frame, and Riesz basis respectively. We also obtain the relation between a g-frame and a g-Riesz basis, and the relation of bounds between a g-frame and a g-Riesz basis. Lastly, we consider the stability of a g-frame or a g-Riesz basis for a Hilbert space under perturbation.     

Hybrid iterative scheme for generalized equilibrium problems and fixed point problems of finite family of nonexpansive mappings

In this paper, we introduce a new mapping and a Hybrid iterative scheme for finding a common element of the set of solutions of a generalized equilibrium problem and the set of common fixed points of a finite family of nonexpansive mappings in a Hilbert space. Then, we prove the strong convergence of the proposed iterative algorithm to a common fixed point of a finite family of nonexpansive mappings which is a solution of the generalized equilibrium problem. The results obtained in this paper extend the recent ones of Takahashi and Takahashi [S. Takahashi, W. Takahashi, Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space, Nonlinear Anal. 69 (2008) 1025–1033].     

Banach空间中非膨胀映象和α-逆强增生算子的强收敛性

在2-一致光滑的Banach空间中,引入一种新的迭代算法研究非膨胀映象的不动点集与α-逆强增生算子的变分不等式解集的公共元素,并获得了迭代算法的强收敛性定理.而且应用这些结果考虑了非膨胀映象和严格伪压缩映象公共不动点的收敛性问题.     

区域函数

为了把点函数理论、区间函数理论和方法推广到任意区域,作者建立了区域的收缩和区域的保核收缩,区域的扩张和区域的保核扩张等新理论.从这些概念出发,给出了区域函数的新定义,并将区域函数的核(即不动点)与此区域函数的定义区域的稳定中心联系起来,从而建立了区域理论,和区域与区域算法. 在应用中,为了求区域的稳定中心,作者采用了由Hartfiel和其它作者建立的矩阵测度理论;并讨论了与区域相伴的线性代数方程组系数矩阵的测度理论.     

Subgradient Projectors: Extensions,Theory, and Characterizations

Subgradient projectors play an important role in optimization and for solving convex feasibility problems. For every locally Lipschitz function, we can define a subgradient projector via generalized subgradients even if the function is not convex. The paper consists of three parts. In the first part, we study basic properties of subgradient projectors and give characterizations when a subgradient projector is a cutter, a local cutter, or a quasi-nonexpansive mapping. We present global and local convergence analyses of subgradent projectors. Many examples are provided to illustrate the theory. In the second part, we investigate the relationship between the subgradient projector of a prox-regular function and the subgradient projector of its Moreau envelope. We also characterize when a mapping is the subgradient projector of a convex function. In the third part, we focus on linearity properties of subgradient projectors. We show that, under appropriate conditions, a linear operator is a subgradient projector of a convex function if and only if it is a convex combination of the identity operator and a projection operator onto a subspace. In general, neither a convex combination nor a composition of subgradient projectors of convex functions is a subgradient projector of a convex function.     

On farthest points of sets

For a convex closed bounded set in a Banach space, we study the existence and uniqueness problem for a point of this set that is the farthest point from a given point in space. In terms of the existence and uniqueness of the farthest point, as well as the Lipschitzian dependence of this point on a point in space, we obtain necessary and su.cient conditions for the strong convexity of a set in several infinite-dimensional spaces, in particular, in a Hilbert space. A set representable as the intersection of closed balls of a fixed radius is called a strongly convex set. We show that the condition “for each point in space that is sufficiently far from a set, there exists a unique farthest point of the set” is a criterion for the strong convexity of a set in a finite-dimensional normed space, where the norm ball is a strongly convex set and a generating set.     

非结合非分配的环(Ⅲ)

本文继上二文(Ⅰ)、(Ⅱ)的理论,并把(Ⅱ)中能分解成单纯子环直和的半单纯环概念及其定理推广到能同构于单纯子环的一个子直和的半单纯两非环概念及其有关定理.然后又把后者概念扩展到§3中所定义的可分和两非环概念,并对可分和两非环给出了使Wedderbum主要定理成立的一个充分条件.     

Controlled rolling of a disc along a plane curve

The plane-parallel rolling of a disc along a fairly smooth curve under the action of perturbing and controlling forces and moments of forces is investigated. Models of the controlled motion corresponding to an explicit or implicit coordinate specification of the curve are constructed. The requirements imposed on the values of the sliding friction force and the normal pressure force, which ensure that the disc rolls without slipping and without loss of contact are determined. The problem of bringing the disc into the required state of motion in a time-optimal way by the action of the force of gravity and a limited axial moment of forces are considered. The situation when the reference curve contains a linear component (inclined upwards or downwards) and a periodic (wavy) component is investigated. Problems of optimal synthesis for a relatively large and relatively small controlling moment are considered.Investigations of the rolling of bodies of different geometrical shape on surfaces, both flat and curved (see 1, 2, 3, 4, etc.), are important for applications in modern machine construction, transport, mobile robot systems,5, 6, 7 etc. However, there are no results of systematic investigations of the problems of the dynamics and control of rolling of bodies on curved surfaces, including comparatively simple bodies (cylinders, discs and spheres). From the applied point of view, the problem of controlled rolling of a disc under gravitational forces on a curve containing a linear incline and periodic smooth changes in the slope is of interest as a model of the motion of a wheel along a path with a curvilinear profile. The solution of problems of the control of the motion of a disc along a closed curve, for example, inside or outside a circle, surmounting obstacles or “rolling out” from hollows of different shapes etc. is of fundamental importance.