Hypersurfaces of prescribed mean curvature enclosing a given body

Given a smooth domain Ω in ℝ ^m+1 with compact closure and a smooth integrable functionh: ℝ ^m+1→ℝ satisfyingh(x)≥H _∂Ω (x) on ∂Ω whereH _∂ω denotes the mean curvature of ∂Ω calculated w.r.t. the interior unit normal we show that there is a setA⊂ℝ ^m+1 with the properties andH _∂A=h on ∂A.     

Meir-Keeler Type Contractions for Tripled Fixed Points

In 2011, Berinde and Borcut [6] introduced the notion of tripled fixed point in partially ordered metric spaces. In our paper, we give some new tripled fixed point theorems by using a generalization of Meir-Keeler contraction.     

A mathematical model for identifying an optimal waste management policy under uncertainty

In the municipal solid waste (MSW) management system, there are many uncertainties associated with the coefficients and their impact factors. Uncertainties can be normally presented as both membership functions and probabilistic distributions. This study develops a scenario-based fuzzy-stochastic quadratic programming (SFQP) model for identifying an optimal MSW management policy and for allowing dual uncertainties presented as probability distributions and fuzzy sets being communicated into the optimization process. It can also reflect the dynamics of uncertainties and decision processes under a complete set of scenarios. The developed method is applied to a case study of long-term MSW management and planning. The results indicate that reasonable solutions have been generated. They are useful for identifying desired waste-flow-allocation plans and making compromises among system cost, satisfaction degree, and constraint-violation risk.     

E-Convex Sets, E-Convex Functions, and E-Convex Programming

A class of sets and a class of functions called E-convex sets and E-convex functions are introduced by relaxing the definitions of convex sets and convex functions. This kind of generalized convexity is based on the effect of an operator E on the sets and domain of definition of the functions. The optimality results for E-convex programming problems are established.     

两类四角系统的匹配数与点独立集数

给出了两类四角系统的完美匹配数、匹配数和点独立集数的计算公式     

Maximally Nonlinear Functions and Bent Functions

We give a construction of bent functions in 2n variables, here n is odd, by using maximally nonlinear functions on GF(2 ⁿ ).     

An Isotonic Regression Problem for Infinite-Dimensional Parameters

We consider an infinite-dimensional isotonic regression problem which is an extension of the suitably revised classical isotonic regression problem. Given p-summable data, for p finite and at least one, there exists an optimal estimator to our problem. For p greater than one, this estimator is unique and is the limit in the p-norm of the sequence of unique estimators in canonical finite-dimensional truncations of our problem. However, for p equal to one, our problem, as well as the finite-dimensional truncations, admit multiple optimal estimators in general. In this case, the sequence of optimal estimator sets to the truncations converges to the optimal estimator set of the infinite problem in the sense of Kuratowski. Moreover, the selection of natural best optimal estimators to the truncations converges in the 1-norm to an optimal estimator of the infinite problem.     

Analytical Linear Inequality Systems and Optimization

In many interesting semi-infinite programming problems, all the constraints are linear inequalities whose coefficients are analytical functions of a one-dimensional parameter. This paper shows that significant geometrical information on the feasible set of these problems can be obtained directly from the given coefficient functions. One of these geometrical properties gives rise to a general purification scheme for linear semi-infinite programs equipped with so-called analytical constraint systems. It is also shown that the solution sets of such kind of consistent systems form a transition class between polyhedral convex sets and closed convex sets in the Euclidean space of the unknowns.     

THE EXISTENCE OF CONNECTING ORBITS

In this paper,using the notion of an isolating block and Conley's attractor theory,an existence criterion of trajectories connecting a pair of invariant sets of ordinary differential equations is given.     

Algorithm for determining pure pointedness of self-affine tilings

Overlap coincidence in a self-affine tiling in Rd is equivalent to pure point dynamical spectrum of the tiling dynamical system. We interpret the overlap coincidence in the setting of substitution Delone set in Rd and find an efficient algorithm to check the pure point dynamical spectrum. This algorithm is easy to implement into a computer program. We give the program and apply it to several examples. In the course of the proof of the algorithm, we show a variant of the conjecture of Urbański (Solomyak (2006) [40]) on the Hausdorff dimension of the boundaries of fractal tiles.