Singular Sturm-Liouville problems whose coefficients depend rationally on the eigenvalue parameter

Let −Dω(·,z)D+q be a differential operator in L²(0,∞) whose leading coefficient contains the eigenvalue parameter z. For the case that ω(·,z) has the particular form

     

四阶非线性特征值问题的正解

本文考虑了四阶非线性特征值问题d4u/dt4=λg(t)f(u,u″),0＜t＜1,u(0)=u(1)=0,au″(0)-bu″′(0)=0,cu″(1)+du″′(1)=0.其中g(t)∈C((0,1),[0,∞)),f(u,v)∈C([0,∞)×(-∞,0],[0,∞)),a≥0,b≥0,c ≥0,d ≥ 0,且△=ac+ad+bc＞0.利用锥压缩与拉伸不动点定理,获得了上述问题正解的存在性结果.     

Positive solutions for three-point boundary value problems with dependence on the first order derivative

A new fixed point theorem in a cone is applied to obtain the existence of at least one positive solution for the second order three-point boundary value problem

     

Semistrictly quasiconvex mappings and non-convex vector optimization

This paper introduces a new class of non-convex vector functions strictly larger than that of P-quasiconvexity, with P ^m being the underlying ordering cone, called semistrictly ( ^m\ –int P)-quasiconvex functions. This notion allows us to unify various results on existence of weakly efficient (weakly Pareto) optima. By imposing a coercivity condition we establish also the compactness of the set of weakly Pareto solutions. In addition, we provide various characterizations for the non-emptiness, convexity and compactness of the solution set for a subclass of quasiconvex vector optimization problems on the real-line. Finally, it is also introduced the notion of explicit ( ^m\ –int P)-quasiconvexity (equivalently explicit (int P)-quasiconvexity) which plays the role of explicit quasiconvexity (quasiconvexity and semistrict quasiconvexity) of real-valued functions.Acknowldegements.The author wishes to thank both referees for their careful reading of the paper, their comments, remarks, helped to improve the presentation of some results. One of the referee provided the references [5, 6] and indirectly [20].     

Iterated monoidal categories

We develop a notion of an n-fold monoidal category and show that it corresponds in a precise way to the notion of an n-fold loop space. Specifically, the group completion of the nerve of such a category is an n-fold loop space, and free n-fold monoidal categories give rise to a finite simplicial operad of the same homotopy type as the classical little cubes operad used to parametrize the higher H-space structure of an n-fold loop space. We also show directly that this operad has the same homotopy type as the n-th Smith filtration of the Barratt-Eccles operad and the n-th filtration of Berger's complete graph operad. Moreover, this operad contains an equivalent preoperad which gives rise to Milgram's small model for when n=2 and is very closely related to Milgram's model of for n>2.     

Existence of positive solutions of nonlinear fractional differential equations

Existence of positive solutions for the nonlinear fractional differential equation D^su(x)=f(x,u(x)), 0<s<1, has been studied (S. Zhang, J. Math. Anal. Appl. 252 (2000) 804-812), where D^s denotes Riemann-Liouville fractional derivative. In the present work we study existence of positive solutions in case of the nonlinear fractional differential equation:

L(D)u=f(x,u),u(0)=0,0<x<1,     

Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems

We study a processing system comprised of parallel queues, whose individual service rates are specified by a global service mode (configuration). The issue is how to switch the system between various possible service modes, so as to maximize its throughput and maintain stability under the most workload-intensive input traffic traces (arrival processes). Stability preserves the job inflow–outflow balance at each queue on the traffic traces. Two key families of service policies are shown to maximize throughput, under the mild condition that traffic traces have long-term average workload rates. In the first family of cone policies, the service mode is chosen based on the system backlog state belonging to a corresponding cone. Two distinct policy classes of that nature are investigated, MaxProduct and FastEmpty. In the second family of batch policies (BatchAdapt), jobs are collectively scheduled over adaptively chosen horizons, according to an asymptotically optimal, robust schedule. The issues of nonpreemptive job processing and non-negligible switching times between service modes are addressed. The analysis is extended to cover feed-forward networks of such processing systems/nodes. The approach taken unifies and generalizes prior studies, by developing a general trace-based modeling framework (sample-path approach) for addressing the queueing stability problem. It treats the queueing structure as a deterministic dynamical system and analyzes directly its evolution trajectories. It does not require any probabilistic superstructure, which is typically used in previous approaches. Probability can be superposed later to address finer performance questions (e.g., delay). The throughput maximization problem is seen to be primarily of structural nature. The developed methodology appears to have broader applicability to other queueing systems.     

Additive stable solutions on perfect cones of cooperative games

Closed kernel systems of the coalition matrix turn out to correspond to cones of games on which the core correspondence is additive and on which the related barycentric solution is additive, stable and continuous. Different perfect cones corresponding to closed kernel systems are described. Received: December 2001/Revised: July 2002 RID="*" ID="*"  This note contains the new results, which were presented by the first author in an invited lecture at the XIV Italian Meeting on Game Theory and Applications in Ischia, July 2001. The lecture was dedicated to Irinel Dragan on the occasion of his seventieth birthday.     

Vector Equilibrium Problems Under Asymptotic Analysis

Given a closed convex set K in Rⁿ; a vector function F:K×K R^m; a closed convex (not necessarily pointed) cone P(x) in ^m with non-empty interior, PP(x) Ø, various existence results to the problemfind xK such that F(x,y)- int P(x) y K under P(x)-convexity/lower semicontinuity of F(x,) and pseudomonotonicity on F, are established. Moreover, under a stronger pseudomonotonicity assumption on F (which reduces to the previous one in case m=1), some characterizations of the non-emptiness of the solution set are given. Also, several alternative necessary and/or sufficient conditions for the solution set to be non-empty and compact are presented. However, the solution set fails to be convex in general. A sufficient condition to the solution set to be a singleton is also stated. The classical case P(x)=^m ₊ is specially discussed by assuming semi-strict quasiconvexity. The results are then applied to vector variational inequalities and minimization problems. Our approach is based upon the computing of certain cones containing particular recession directions of K and F.