Flexure of beams with certain curvilinear cross sections

Special complex variables techniques are used to obtain the six flexure functions (one of which is the torsion function) of a certain isotropic cylinder under flexure. The cross section is bounded by the closed curver=a sin⁴(θ/4) (?π<θ?π). The torsional rigidity, moment integrals, and the associated twist are also evaluated for this beam. It is worthy to mention that these techniques work successfully when they are applied to any of the cross sections bounded byr=a∥sin(θ/n)∥ ⁿ ·(?π<θ?π), wheren is a positive integer (n>1).     

Analysis of budget for interdiction on multicommodity network flows

In this paper, we concentrate on computing several critical budgets for interdiction of the multicommodity network flows, and studying the interdiction effects of the changes on budget. More specifically, we first propose general interdiction models of the multicommodity flow problem, with consideration of both node and arc removals and decrease of their capacities. Then, to perform the vulnerability analysis of networks, we define the function F(R) as the minimum amount of unsatisfied demands in the resulted network after worst-case interdiction with budget R. Specifically, we study the properties of function F(R), and find the critical budget values, such as \(R_a\), the largest value under which all demands can still be satisfied in the resulted network even under the worst-case interdiction, and \(R_b\), the least value under which the worst-case interdiction can make none of the demands be satisfied. We prove that the critical budget \(R_b\) for completely destroying the network is not related to arc or node capacities, and supply or demand amounts, but it is related to the network topology, the sets of source and destination nodes, and interdiction costs on each node and arc. We also observe that the critical budget \(R_a\) is related to all of these parameters of the network. Additionally, we present formulations to estimate both \(R_a\) and \(R_b\). For the effects of budget increasing, we present the conditions under which there would be extra capabilities to interdict more arcs or nodes with increased budget, and also under which the increased budget has no effects for the interdictor. To verify these results and conclusions, numerical experiments on 12 networks with different numbers of commodities are performed.     

Ring structures on groups of arithmetic functions

Using the theory of Witt vectors, we define ring structures on several well-known groups of arithmetic functions, which in another guise are formal Dirichlet series. The set of multiplicative arithmetic functions over a commutative ring R is shown to have a unique functorial ring structure for which the operation of addition is Dirichlet convolution and the operation of multiplication restricted to the completely multiplicative functions coincides with point-wise multiplication. The group of additive arithmetic functions over R also has a functorial ring structure. In analogy with the ghost homomorphism of Witt vectors, there is a functorial ring homomorphism from the ring of multiplicative functions to the ring of additive functions that is an isomorphism if R is a Q-algebra. The group of rational arithmetic functions, that is, the group generated by the completely multiplicative functions, forms a subring of the ring of multiplicative functions. The latter ring has the structure of a Bin(R)-algebra, where Bin(R) is the universal binomial ring equipped with a ring homomorphism to R. We use this algebra structure to study the order of a rational arithmetic function, as well the powersfα for α∈Bin(R) of a multiplicative arithmetic function f. For example, we prove new results about the powers of a given multiplicative arithmetic function that are rational. Finally, we apply our theory to the study of the zeta function of a scheme of finite type over Z.     

Multistage multiproduct advertising budgeting

We propose and analyze an effective model for the Multistage Multiproduct Advertising Budgeting problem. This model optimizes the advertising investment for several products, by considering cross elasticities, different sales drivers and the whole planning horizon. We derive a simple procedure to compute the optimal advertising budget and its optimal allocation. The model was tested to plan a realistic advertising campaign. We observed that the multistage approach may significantly increase the advertising profit, compared to the successive application of the single stage approach.     

Robust combinatorial optimization with variable cost uncertainty

We present in this paper a new model for robust combinatorial optimization with cost uncertainty that generalizes the classical budgeted uncertainty set. We suppose here that the budget of uncertainty is given by a function of the problem variables, yielding an uncertainty multifunction. The new model is less conservative than the classical model and approximates better Value-at-Risk objective functions, especially for vectors with few non-zero components. An example of budget function is constructed from the probabilistic bounds computed by Bertsimas and Sim. We provide an asymptotically tight bound for the cost reduction obtained with the new model. We turn then to the tractability of the resulting optimization problems. We show that when the budget function is affine, the resulting optimization problems can be solved by solving n+1$n+1$ deterministic problems. We propose combinatorial algorithms to handle problems with more general budget functions. We also adapt existing dynamic programming algorithms to solve faster the robust counterparts of optimization problems, which can be applied both to the traditional budgeted uncertainty model and to our new model. We evaluate numerically the reduction in the price of robustness obtained with the new model on the shortest path problem and on a survivable network design problem.     

An analysis of neighborhood functions on generic solution spaces

The effectiveness of local search algorithms on discrete optimization problems is influenced by the choice of the neighborhood function. A neighborhood function that results in all local minima being global minima is said to have zero L-locals. A polynomially sized neighborhood function with zero L-locals would ensure that at each iteration, a local search algorithm would be able to find an improving solution or conclude that the current solution is a global minimum. This paper presents a recursive relationship for computing the number of neighborhood functions over a generic solution space that results in zero L-locals. Expressions are also given for the number of tree neighborhood functions with zero L-locals. These results provide a first step towards developing expressions that are applicable to discrete optimization problems, as well as providing results that add to the collection of solved graphical enumeration problems.     

Log-convexity and log-concavity of hypergeometric-like functions

We find sufficient conditions for log-convexity and log-concavity for the functions of the forms a?∑fkk(a)xk, a?∑fkΓ(a+k)xk and a?∑fkxk/k(a). The most useful examples of such functions are generalized hypergeometric functions. In particular, we generalize the Turán inequality for the confluent hypergeometric function recently proved by Barnard, Gordy and Richards and log-convexity results for the same function recently proved by Baricz. Besides, we establish a reverse inequality which complements naturally the inequality of Barnard, Gordy and Richards. Similar results are established for the Gauss and the generalized hypergeometric functions. A conjecture about monotonicity of a quotient of products of confluent hypergeometric functions is made.     

Optimization of a Multiperiod Resource Allocation Model

In this paper we examine multiperiod resource allocation problems, such as allocating a given marketing budget among T periods. The return functions of each period are assumed to be concave functions of the effective effort variable, which is composed of the expenditures in all previous periods and the present one. Assuming that the effect of an amount spent in period t is decreasing by a fixed rate in successive periods, necessary and sufficient conditions for a non-boundary optimal policy are derived. Under these conditions the optimal policy which maximizes total returns is obtained.     

Dimensions of prevalent continuous functions

Let K be a compact subset of ${\mathbb{R}^{d}}$ and write C(K) for the family of continuous functions on K. In this paper we study different fractal and multifractal dimensions of functions in C(K) that are generic in the sense of prevalence. We first prove a number of general results, namely, for arbitrary ??dimension?? functions ${\Delta:C(K) \to \mathbb{R}}$ satisfying various natural scaling conditions, we obtain formulas for the ??dimension?? ??(f) of a prevalent function f in C(K); this is the contents of Theorems 1.1?C1.3. By applying Theorems 1.1?C1.3 to appropriate choices of ?? we obtain the following results: we compute the (lower and upper) local dimension of a prevalent function f in C(K); we compute the (lower or upper) H?lder exponent at a point x of a prevalent function f in C(K); finally, we compute the (lower or upper) Renyi dimensions of a prevalent function f in C(K). Perhaps surprisingly, in many cases our results are very different from the corresponding results for continuous functions that are generic in the sense of Baire category.     

On fractional integration formulae for Aleph functions

This paper is devoted to the study of a new special function, which is called, according to the symbol used to represent this function, as an Aleph function. This function is an extension of the I-function, which itself is a generalization of the well-known and familiar G- and H-functions in one variable. In this paper, a notation and complete definition of the Aleph function will be presented. Fractional integration of the Aleph functions, in which the argument of the Aleph function contains a factor t^λ(1 − t)^μ, λ, μ > 0, will be investigated. The results derived are of most general character and include many results given earlier by various authors including Kilbas [10], Kilbas and Saigo [11] and Galué [6] and others. The results obtained form the key formulae for the results on various potentially useful special functions of physical and biological sciences and technology available in the literature.     

Some characterizations of strongly preinvex functions

In this paper, a new class of generalized convex function is introduced, which is called the strongly α-preinvex function. We study some properties of strongly α-preinvex function. In particular, we establish the equivalence among the strongly α-preinvex functions, strongly α-invex functions and strongly αη-monotonicity under some suitable conditions. As special cases, one can obtain several new and previously known results for α-preinvex (invex) functions.     

Characteristics of wave propagation in piezoelectric bent rods with arbitrary curvature

The wave propagation in the piezoelectric bend rods with arbitrary curvature is studied in this paper. Basic three-dimensional equations in an orthogonal curvilinear coordinate system (r, θ, s) are established. The Bessel functions in radial co-ordinate and triangle series in the angular co-ordinate are used to describe the displacements and electrical potential. Characteristics of dispersion, distributions of displacements and electrical potential over the cross section are calculated, respectively. In the numerical examples, the effects of the ratio of the two ellipse axes on the dispersion relations of the first three modes are observed. The characteristics of the distribution of displacements and electric potential in the cross section, along the radial and s direction are investigated.     

On co-ordinated quasi-convex functions

A function f: I → ?, where I ? ? is an interval, is said to be a convex function on I if $$f(tx + (1 - t)y) \le tf(x) + (1 - t)f(y)$$ holds for all x, y ∈ I and t ∈ [0, 1]. There are several papers in the literature which discuss properties of convexity and contain integral inequalities. Furthermore, new classes of convex functions have been introduced in order to generalize the results and to obtain new estimations. We define some new classes of convex functions that we name quasi-convex, Jensenconvex, Wright-convex, Jensen-quasi-convex and Wright-quasi-convex functions on the coordinates. We also prove some inequalities of Hadamard-type as Dragomir’s results in Theorem 5, but now for Jensen-quasi-convex and Wright-quasi-convex functions. Finally, we give some inclusions which clarify the relationship between these new classes of functions.     

Hybrid function method for solving Fredholm and Volterra integral equations of the second kind

Numerical solutions of Fredholm and Volterra integral equations of the second kind via hybrid functions, are proposed in this paper. Based upon some useful properties of hybrid functions, integration of the cross product, a special product matrix and a related coefficient matrix   with optimal order, are applied to solve these integral equations. The main characteristic of this technique is to convert an integral equation into an algebraic; hence, the solution procedures are either reduced or simplified accordingly. The advantages of hybrid functions are that the values of n$n$ and m$m$ are adjustable as well as being able to yield more accurate numerical solutions than the piecewise constant orthogonal function, for the solutions of integral equations. We propose that the available optimal values of n$n$ and m$m$ can minimize the relative errors of the numerical solutions. The high accuracy and the wide applicability of the hybrid function approach will be demonstrated with numerical examples. The hybrid function method is superior to other piecewise constant orthogonal functions [W.F. Blyth, R.L. May, P. Widyaningsih, Volterra integral equations solved in Fredholm form using Walsh functions, Anziam J. 45 (E) (2004) C269–C282; M.H. Reihani, Z. Abadi, Rationalized Haar functions method for solving Fredholm and Volterra integral equations, J. Comp. Appl. Math. 200 (2007) 12–20] for these problems.     

Characterization and recognition of d.c. functions

A function ${f : \Omega \to \mathbb{R}}$ , where Ω is a convex subset of the linear space X, is said to be d.c. (difference of convex) if f =  g ? h with ${g, h : \Omega \to \mathbb{R}}$ convex functions. While d.c. functions find various applications, especially in optimization, the problem to characterize them is not trivial. There exist a few known characterizations involving cyclically monotone set-valued functions. However, since it is not an easy task to check that a given set-valued function is cyclically monotone, simpler characterizations are desired. The guideline characterization in this paper is relatively simple (Theorem 2.1), but useful in various applications. For example, we use it to prove that piecewise affine functions in an arbitrary linear space are d.c. Additionally, we give new proofs to the known results that C ^1,1 functions and lower-C ² functions are d.c. The main goal remains to generalize to higher dimensions a known characterization of d.c. functions in one dimension: A function ${f : \Omega \to \mathbb{R}, \Omega \subset \mathbb{R}}$ open interval, is d.c. if and only if on each compact interval in Ω the function f is absolutely continuous and has a derivative of bounded variation. We obtain a new necessary condition in this direction (Theorem 3.8). We prove an analogous sufficient condition under stronger hypotheses (Theorem 3.11). The proof is based again on the guideline characterization. Finally, we obtain results concerning the characterization of convex and d.c. functions obeying some kind of symmetry.     

Rings of real functions in pointfree topology

This paper deals with the algebra F(L) of real functions on a frame L and its subclasses LSC(L) and USC(L) of, respectively, lower and upper semicontinuous real functions. It is well known that F(L) is a lattice-ordered ring; this paper presents explicit formulas for its algebraic operations which allow to conclude about their behaviour in LSC(L) and USC(L).As applications, idempotent functions are characterized and previous pointfree results about strict insertion of functions are significantly improved: general pointfree formulations that correspond exactly to the classical strict insertion results of Dowker and Michael regarding, respectively, normal countably paracompact spaces and perfectly normal spaces are derived.The paper ends with a brief discussion concerning the frames in which every arbitrary real function on the α-dissolution of the frame is continuous.     

Explicitly B-preinvex functions

This paper introduces a new class of functions, to be referred to as explicitly B-preinvex functions. Some properties of explicitly B-preinvex functions are established, e.g., any local minimum of an explicitly B-preinvex function is also a global one and the summation of two functions, which are both B-preinvex and explicitly B-preinvex, is also a B-preinvex function and an explicitly B-preinvex function. Furthermore, it is shown that the explicit B-preinvexity, together with the intermediate-point B-preinvexity, implies B-preinvexity, while the explicit B-preinvexity, together with a lower semicontinuity, implies the B-preinvexity.     

Compact supported endographs and fuzzy sets

A metric is defined on a space of functions from a locally compact metric space X into the unit interval I in terms of the Hausdorff metric distance between their compact supported endographs in X × I. Convergence in this metric is shown to be equivalent to the conjunction of the Hausdorff metric convergence of supports in X and two conditions involving numerical values of the functions. The space of nonempty compact subsets of X with the Hausdorff metric is imbedded in the above function space by the characteristic function on subsets of X. Applications of these results to fuzzy subsets of X and fuzzy dynamical systems on X are indicated.     

Extremal functions as divisors for kernels of Toeplitz operators

In this paper, an extremal function of a Banach space of analytic functions in the unit disk (not all functions vanishing at 0) is a function solving the extremal problem for functions f of norm 1. We study extremal functions of kernels of Toeplitz operators on Hardy spaces H^p, 1<p<∞. Such kernels are special cases of so-called nearly invariant subspaces with respect to the backward shift, for which Hitt proved that when p=2, extremal functions act as isometric divisors. We show that the extremal function is still a contractive divisor when p<2 and an expansive divisor when p>2 (modulo p-dependent multiplicative constants). We give examples showing that the extremal function may fail to be a contractive divisor when p>2 and also fail to be an expansive divisor when p<2. We discuss to what extent these results characterize the Toeplitz operators via invariant subspaces for the backward shift.     

Approximation with the output of linear control systems

In this paper we give a new proof that for controllable and observable linear systems every L²[0,T] function can be approximated in the L²[0,T] sense with an output function generated by an L²[0,T] input function. We also give a new characterization of how continuous functions on [0,T] are uniformly approximated by an output generated by a continuous input function. The relative degree of the transfer function of the system determines those functions that can be approximated. We further show that if the initial data is allowed to vary then every continuous function is uniformly approximated by outputs generated by continuous functions.