On the Ulam stability of Jensen and Jensen type mappings on restricted domains

In 1941 Hyers solved the well-known Ulam stability problem for linear mappings. In 1951 Bourgin was the second author to treat this problem for additive mappings. In 1982-1998 Rassias established the Hyers-Ulam stability of linear and nonlinear mappings. In 1983 Skof was the first author to solve the same problem on a restricted domain. In 1998 Jung investigated the Hyers-Ulam stability of more general mappings on restricted domains. In this paper we introduce additive mappings of two forms: of “Jensen” and “Jensen type,” and achieve the Ulam stability of these mappings on restricted domains. Finally, we apply our results to the asymptotic behavior of the functional equations of these types.     

On the Ulam stability of mixed type mappings on restricted domains

In 1941 D.H. Hyers solved the well-known Ulam stability problem for linear mappings. In 1951 D.G. Bourgin was the second author to treat the Ulam problem for additive mappings. In 1982-1998 we established the Hyers-Ulam stability for the Ulam problem of linear and nonlinear mappings. In 1983 F. Skof was the first author to solve the Ulam problem for additive mappings on a restricted domain. In 1998 S.M. Jung investigated the Hyers-Ulam stability of additive and quadratic mappings on restricted domains. In this paper we improve the bounds and thus the results obtained by S.M. Jung, in 1998. Besides we establish the Ulam stability of mixed type mappings on restricted domains. Finally, we apply our recent results to the asymptotic behavior of functional equations of different types.     

Capacitated emergency facility siting with multiple levels of backup

In many service systems, the primary objective is to provide continuous service and/or service within a prespecified time interval. In the public sector, emergency service systems fit into this category. In the private sector, systems providing repair service to critical production facilities and computers constitute another example. In these systems, the concept of multiple service facilities providing backup to each other becomes an important element in the design process. In this paper, we study the capacitated facility siting problem with multiple levels of backup coverage. The problem is formulated as a mathematical program; an efficient solution procedure is developed and computational experiments are reported.     

The Dattoli-Srivastava conjectures concerning generating functions involving the harmonic numbers

In a recent paper Dattoli and Srivastava [3], by resorting to umbral calculus, conjectured several generating functions involving harmonic numbers. In this sequel to their work our aim is to rigorously demonstrate the truth of the Dattoli-Srivastava conjectures by making use of simple analytical arguments. In addition, one of these conjectures is stated and proved in more general form.     

Existence and asymptotic properties of aerotaxis model with the Fokker–Planck type diffusion

In this paper, we consider Fokker–Planck type diffusion aerotaxis equations which resemble the usual aerotaxis equations. In view of well-posedness, its own special diffusion structure enables us to take advantage. In two dimensions, we show the existence of global classical solutions under some appropriate conditions. In addition, the stabilization property of the solution is studied, as time approaches infinity. In three dimensions, we prove the existence of global weak solutions.     

Patching theorems for projective modules

In the first section of this paper, we prove several ‘Milnor-Mayer-Vietoris’-type patching theorems for projective modules. In the second section we apply these theorems to projective modules over polynomial rings and give some criteria for such modules to be extended. In the third section, the theorems are applied to the study of vector bundles over curves.     

The Andrews–Sellers family of partition congruences

In 1994, James Sellers conjectured an infinite family of Ramanujan type congruences for 2-colored Frobenius partitions introduced by George E. Andrews. These congruences arise modulo powers of 5. In 2002 Dennis Eichhorn and Sellers were able to settle the conjecture for powers up to 4. In this article, we prove Sellers’ conjecture for all powers of 5. In addition, we discuss why the Andrews–Sellers family is significantly different from classical congruences modulo powers of primes.     

Calculation of degree and global bifurcation for variational inequalities with nonsymmetric operators in Banach spaces

In order to prove global bifurcation for variational inequalities, it is useful to know local mapping degrees for certain maps associated to the inequalities. Some methods are provided to calculate these degrees. In contrast to existing results, no symmetry on the derivatives needs to be assumed to apply these methods. In fact, it is also shown that the whole approach is possible even in the setting of Banach spaces and for noncompact operators with only positively homogeneous “derivatives”.     

Optimal use of components of a dyadic wavelet representation

In practice, one may encounter linear transforms whose result is important for a certain set of vector components only. In particular this relates to vector components restored from its dyadic wavelet representation. In this paper we study optimization of the index set of the dyadic wavelet representation which can be used to restore required original vector components.     

KKM in an arbitrary product of simplices

Summary In this note we present an extension of Peleg's version of the well known KKM lemma to an arbitrary product of simplices. In the case of intending an extension to a finite or even a countably infinite product of simplices, a product topology on that set is enough to get a proof. In the general case we need to use a weak^*-topology.     

Overlap functions

In this paper we address a key issue in scenario classification, where classifying concepts show a natural overlapping. In fact, overlapping needs to be evaluated whenever classes are not crisp, in order to be able to check if a certain classification structure fits reality and still can be useful for our declared decision making purposes. In this paper we address an object recognition problem, where the best classification with respect to background is the one with less overlapping between the class object and the class background. In particular, in this paper we present the basic properties that must be fulfilled by overlap functions, associated to the degree of overlapping between two classes. In order to define these overlap functions we take as reference properties like migrativity, homogeneity of order 1 and homogeneity of order 2. Hence we define overlap functions, proposing a construction method and analyzing the conditions ensuring that t-norms are overlap functions. In addition, we present a characterization of migrative and strict overlap functions by means of automorphisms.     

Hyperbolic wavelet thresholding methods and the curse of dimensionality through the maxiset approach

In this paper we compute the maxisets of some denoising methods (estimators) for multidimensional signals based on thresholding coefficients in hyperbolic wavelet bases. That is, we determine the largest functional space over which the risk of these estimators converges at a chosen rate. In the unidimensional setting, refining the choice of the coefficients that are subject to thresholding by pooling information from geometric structures in the coefficient domain (e.g., vertical blocks) is known to provide ‘large maxisets’. In the multidimensional setting, the situation is less straightforward. In a sense these estimators are much more exposed to the curse of dimensionality. However we identify cases where information pooling has a clear benefit. In particular, we identify some general structural constraints that can be related to compound functional models and to a minimal level of anisotropy.     

Summatory Functions of Digital Sums Occurring in Cryptography

Morain and Olivos gave two algorithms that allow fast exponentiation in elliptic curve cryptosystems. These algorithms are based on representations of integers in certain redundant binary number systems. In this paper we consider the weight and the sum of digits function of these representations. In particular, we give formulas for their summatory functions. In the proofs we use the Mellin-Perron formula. In order to apply this formula, we have to compute the analytic continuation of a class of Dirichlet series.     

Robustness in operational research and decision aiding: A multi-faceted issue

In Introduction, I explain the meaning I give to the qualifier term ”robust” and justify my preference for the expression robustness concern rather than robustness analysis, which I feel is likely to be interpreted too narrowly. In Section 2, I discuss this concern in more details and I try to clarify the numerous raisons d’être of this concern. As a means of examining the multiple facets of robustness concern more comprehensively, I explore the existing research about robustness, attempting to highlight what I see as the three different territories covered by these studies (Section 3). In Section 4, I refer to these territories to illustrate how responses to robustness concern could be even more varied than they currently are. In this perspective, I propose in Section 5 three new measures of robustness. In the last section, I identify several aspects of the problem that should be examined more closely because they could lead to new avenues of research, which could in turn yield new and innovative responses.     

The impact of managerial and organizational aspects on hospital wards’ efficiency: Evidence from a case study

In spite of its acknowledged relevance, the impact of managerial and organizational aspects on hospital wards’ efficiency has been so far overlooked by the literature. In order to explore this issue, this paper presents a model of the relations between the decision making process of a hospital ward and its technical efficiency. In order to test the model, a two-step approach has been adopted. In the first step the technical efficiency of wards belonging to a large Italian Hospital Enterprise has been calculated using DEA. In the second step, efficiency scores have been regressed on a set of variables capturing managerial goals and actions internal to the ward, as well as re-organizations imposed by the hospital central management. Responses to a questionnaire administered to the heads of ward were used to build the independent variables. Results show that both decisions internal to the ward and exogenous re-organizations affect the ward’s efficiency, and suggest that these variables are more significant in explaining efficiency than environmental ones.     

A top-down hierarchical classification method

In this paper we present an original top-down hierarchical classification algorithm. In our approach we associate to each decomposition a ‘degree of separability’ which is used to evaluate the efficiency of the decomposition. In particular, it shows whether or not the classes are well separated and also whether or not they are homogeneous. This algorithm can be applied to items defined by real and bounded numbers.     

Two suggestions of how to define a stochastic stress-strength system

In this paper we suggest how to generalize a stress-strength system treated in Ebrahimi (1984) at a fixed point of time to a dynamic situation in two ways. In the first approach we assume that a stress factor starts and stops to influence the system and different stress factors add up to total system stress at any time. In the second approach we assume that a stress factors starts and stops to influence the system and stress factors do not accumulate additively.