Maximum principle and numerical method for the multi-term time–space Riesz–Caputo fractional differential equations

The maximum principle for the space and time–space fractional partial differential equations is still an open problem. In this paper, we consider a multi-term time–space Riesz–Caputo fractional differential equations over an open bounded domain. A maximum principle for the equation is proved. The uniqueness and continuous dependence of the solution are derived. Using a fractional predictor–corrector method combining the L1 and L2 discrete schemes, we present a numerical method for the specified equation. Two examples are given to illustrate the obtained results.

Optimal simultaneous maximum a posterioriestimation of states, noise statistics and parameters I. Algorithm

The simultaneous state and parameter estimation problem for a linear discrete-time system with unknown noise statistics is treated as a large-scale optimization problem. The a posterioriprobability density function is maximized directly with respect to the states and parameters subject to the constraint of the system dynamics. The resulting optimization problem is too large for any of the standard non-linear programming techniques and hence an hierarchical optimization approach is proposed. It turns out that the states can be computed at the first levelfor given noise and system parameters. These, in turn, are to be modified at the second level.The states are to be computed from a large system of linear equations and two solution methods are considered for solving these equations, limiting the horizon to a suitable length. The resulting algorithm is a filter-smoother, suitable for off-line as well as on-line state estimation for given noise and system parameters. The second level problem is split up into two, one for modifying the noise statistics and the other for modifying the system parameters. An adaptive relaxation technique is proposed for modifying the noise statistics and a modified Gauss-Newton technique is used to adjust the system parameters.

Simultaneous material selection and geometry design of statically determinate trusses using continuous optimization

In this work, we explore simultaneous geometry design and material selection for statically determinate trusses by posing it as a continuous optimization problem. The underlying principles of our approach are structural optimization and Ashby’s procedure for material selection from a database. For simplicity and ease of initial implementation, only static loads are considered in this work with the intent of maximum stiffness, minimum weight/cost, and safety against failure. Safety of tensile and compression members in the truss is treated differently to prevent yield and buckling failures, respectively. Geometry variables such as lengths and orientations of members are taken to be the design variables in an assumed layout. Areas of cross-section of the members are determined to satisfy the failure constraints in each member. Along the lines of Ashby’s material indices, a new design index is derived for trusses. The design index helps in choosing the most suitable material for any geometry of the truss. Using the design index, both the design space and the material database are searched simultaneously using gradient-based optimization algorithms. The important feature of our approach is that the formulated optimization problem is continuous, although the material selection from a database is an inherently discrete problem. A few illustrative examples are included. It is observed that the method is capable of determining the optimal topology in addition to optimal geometry when the assumed layout contains more links than are necessary for optimality.

Rendering stiffer walls: a hybrid haptic system using continuous and discrete time feedback

Instability in conventional haptic rendering destroys the perception of rigid objects in virtual environments. Inherent limitations in the conventional haptic loop restrict the maximum stiffness that can be rendered. In this paper we present a method to render virtual walls that are much stiffer than those achieved by conventional techniques. By removing the conventional digital haptic loop and replacing it with a part-continuous and part-discrete time hybrid haptic loop, we were able to render stiffer walls. The control loop is implemented as a combinational logic circuit on an field-programmable gate array. We compared the performance of the conventional haptic loop and our hybrid haptic loop on the same haptic device, and present mathematical analysis to show the limit of stability of our device. Our hybrid method removes the computer-intensive haptic loop from the CPU-this can free a significant amount of resources that can be used for other purposes such as graphical rendering and physics modeling. It is our hope that, in the future, similar designs will lead to a haptics processing unit (HPU).

Variational principles in evolution

For a one-locus selection model, Svirezhev introduced an integral variational principle by defining a Lagrangian which remained stationary on the trajectory followed by the population undergoing selection. It is shown here (i) that this principle can be extended to multiple loci in some simple cases and (ii) that the Lagrangian is defined by a straightforward generalization of the one-locus case, but (iii) that in two-locus or more general models there is no straightforward extension of this principle if linkage and epistasis are present. The population trajectories can be constructed as trajectories of steepest ascent in a Riemannian metric space. A general method is formulated to find the metric tensor and the surface-in the metric space on which the trajectories, which characterize the variations in the gene structure of the population, lie. The local optimality principle holds good in such a space. In the special case when all possible linkage disequilibria are zero, the phase point of the n-locus genetic system moves on the surface of the product space of n higher dimensional unit spheres in a certain Riemannian metric space of gene frequencies so that the rate of change of mean fitness is maximum along the trajectory. In the two-locus case the corresponding surface is a hyper-torus.

A Nash Bargaining Approach to Retention Enhancing Bid Optimization in Sponsored Search Auctions with Discrete Bids

Bid optimization is now becoming quite popular in sponsored search auctions on the Web. Given a keyword and the maximum willingness to pay of each advertiser interested in the keyword, the bid optimizer generates a profile of bids for the advertisers with the objective of maximizing customer retention without compromising the revenue of the search engine. In this paper, we present a bid optimization algorithm that is based on a Nash bargaining model where the first player is the search engine and the second player is a virtual agent representing all the bidders. We make the realistic assumption that each bidder specifies a maximum willingness to pay values and a discrete, finite set of bid values. We show that the Nash bargaining solution for this problem always lies on a certain edge of the convex hull such that one end point of the edge is the vector of maximum willingness to pay of all the bidders. We show that the other endpoint of this edge can be computed as a solution of a linear programming problem. We also show how the solution can be transformed to a bid profile of the advertisers.

Simultaneous Geometry Optimization and Material Selection for Truss Structures

In this work, we explore simultaneous design and material selection by posing it as an optimization problem. The underlying principles for our approach are Ashby's material selection procedure and structural optimization. For the simplicity and ease of initial implementation of the general procedure, truss structures under static load are considered in this work in view of maximum stiffness, minimum weight/cost and safety against failure. Along the lines of Ashby's material indices, a new design index is derived for trusses. This helps in choosing the most suitable material for any design of a truss. Using this, both the design space and material database are searched simultaneously using optimization algorithms. The important feature of our approach is that the formulated optimization problem is continuous even though the material selection is an inherently discrete problem.

Maximum weight independent sets in hole- and dart-free graphs

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for hole-free graphs is unknown. In this paper, we first prove that the MWIS problem for (hole, dart, gem)-free graphs can be solved in O(n(3))-time. By using this result, we prove that the MWIS problem for (hole, dart)-free graphs can be solved in O(n(4))-time. Though the MWIS problem for (hole, dart, gem)-free graphs is used as a subroutine, we also give the best known time bound for the solvability of the MWIS problem in (hole, dart, gem)-free graphs. (C) 2012 Elsevier B.V. All rights reserved.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

First-principles DFT plus GW study of oxygen vacancies in rutile TiO2

We perform first-principles calculations of the quasiparticle defect states, charge transition levels, and formation energies of oxygen vacancies in rutile titanium dioxide. The calculations are done within the recently developed combined DFT + GW formalism, including the necessary electrostatic corrections for the supercells with charged defects. We find the oxygen vacancy to be a negative U defect, where U is the defect electron addition energy. For Fermi level values below similar to 2.8 eV (relative to the valence-band maximum), we find the +2 charge state of the vacancy to be the most stable, while above 2.8 eV we find that the neutral charge state is the most stable.

Three-Dimensional Study of Natural Convection in a Horizontal Channel With Discrete Heaters on One of Its Vertical Walls

Three-dimensional natural convection in a horizontal channel with an array of discrete flush-mounted heaters on one of its vertical walls is numerically studied. Effects of thermal conductivities of substrate and heaters and convection on outer sides of the channel walls on heat transfer are examined. The substrate affects heat transfer in a wider range of thermal conductivities than do the heaters. At lower heater thermal conductivities a higher heat portion is transferred by direct convection from the heaters to the adjacent coolant. However, higher substrate conductivity is associated with higher heat portion transferred through the substrate. The innermost heater column is found to become the hottest heater column due to the lower coolant accessibility. The heat transfer in the channel is strongly influenced by convection on the outer sides of the channel walls. Correlations are presented for dimensionless temperature maximum and average Nusselt number.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.

Part I. On the breaking of nonlinear dispersive waves. Part II. Variational principles in continuum mechanics

A model equation for water waves has been suggested by Whitham to study, qualitatively at least, the different kinds of breaking. This is an integro-differential equation which combines a typical nonlinear convection term with an integral for the dispersive effects and is of independent mathematical interest. For an approximate kernel of the form e^(-b|x|) it is shown first that solitary waves have a maximum height with sharp crests and secondly that waves which are sufficiently asymmetric break into "bores." The second part applies to a wide class of bounded kernels, but the kernel giving the correct dispersion effects of water waves has a square root singularity and the present argument does not go through. Nevertheless the possibility of the two kinds of breaking in such integro-differential equations is demonstrated.

Difficulties arise in finding variational principles for continuum mechanics problems in the Eulerian (field) description. The reason is found to be that continuum equations in the original field variables lack a mathematical "self-adjointness" property which is necessary for Euler equations. This is a feature of the Eulerian description and occurs in non-dissipative problems which have variational principles for their Lagrangian description. To overcome this difficulty a "potential representation" approach is used which consists of transforming to new (Eulerian) variables whose equations are self-adjoint. The transformations to the velocity potential or stream function in fluids or the scaler and vector potentials in electromagnetism often lead to variational principles in this way. As yet no general procedure is available for finding suitable transformations. Existing variational principles for the inviscid fluid equations in the Eulerian description are reviewed and some ideas on the form of the appropriate transformations and Lagrangians for fluid problems are obtained. These ideas are developed in a series of examples which include finding variational principles for Rossby waves and for the internal waves of a stratified fluid.

Tenets, Principles, and Criteria for Management: The Basis for Systemic Management

This paper presents nine tenets for management as formulated in the literature in recent decades. These tenets, and the principles behind them, form the foundation for systemic management. All tenets are interrelated and far from mutually exclusive or discrete. When we consider them seriously and simultaneously, these tenets expose serious flaws of conventional resource management and define systemic management. Systemic management requires that we manage inclusively and avoid restricting management to any particular interaction between humans and other elements of nature. The management tenets presented here are considered with particular attention to the interrelationships among both the tenets and principles upon which they are based. The case is made that the tenets are inseparable and should be applied collectively. Combined consideration of the tenets clarifies the role of science, contributes to progress in defining management, and leads to the development of ways we can avoid mistakes of past management. Systemic management emerges as at least one form of management that will consistently account for and apply to the complexities of nature.

First-principles study of p-type transparent conductive oxides CuXO2 (X=Y, Sc, and Al)

Using first-principles methods we have calculated electronic structures, optical properties, and hole conductivities of CuXO2 (X=Y, Sc, and Al). We show that the direct optical band gaps of CuYO2 and CuScO2 are approximately equal to their fundamental band gaps and the conduction bands of them are localized. The direct optical band gaps of CuXO2 (X=Y, Sc, and Al) are 3.3, 3.6, and 3.2 eV, respectively, which are consistent with experimental values of 3.5, 3.7, and 3.5 eV. We find that the hole mobility along long lattice c is higher than that along other directions through calculating effective masses of the three oxides. By analyzing band offset we find that CuScO2 has the highest valence band maximum (VBM) among CuXO2 (X=Y, Sc, and Al). In addition, the approximate transitivity of band offset suggests that CuScO2 has a higher VBM than CuGaO2 and CuInO2 [Phys. Rev. Lett. 88, 066405 (2002)]. We conclude that CuScO2 has a higher p-type doping ability in terms of the doping limit rule. (C) 2008 American Institute of Physics. [DOI: 10.1063/1.2991157]