Differential properties of solutions of evolution variational inequalities in the theory of plasticity

We study the differential properties of weak solutions of evolution variational inequalities in the theory of flow of elastoplastic media with hardening. We consider the two most popular models of hardening—isotropic and kinematic. The differential properties studied depend on the nature of the hardening. In the case of isotropic hardening great smoothness of the distributed load is required, and in this situation the result is the same for the stress tensor—it belongs to the class L (0,T;W _2,loc ¹ ).Bibliography: 10 titles. Translated fromProblemy Matematicheskogo Analiza, No. 12, 1992, pp. 153–173.     

Multi-utilitarianism in two-agent quasilinear social choice

We introduce a new class of rules for resolving quasilinear social choice problems. These rules extend those of Green [9]. We call such rules multi-utilitarian rules. Each multi-utilitarian rule is associated with a probability measure over the set of weighted utilitarian rules, and is derived as the expectation of this probability. These rules are characterized by the axioms efficiency, translation invariance, transfer monotonicity, continuity, and additivity. By adding recursive invariance, we obtain a class of asymmetric rules generalizing those Green characterizes. A multi-utilitarian rule satisfying strict monotonicity has an associated probability measure with full support.I would like to thank Youngsub Chun, Federico Echenique, Jerry Green, Biung-Ghi Ju, William Thomson, and Walter Trockel for comments and discussions. Two anonymous referees also provided comments that proved very useful. All errors are my own.     

Construction of the Equivalent Plastic Strain Increment

Strain hardening plastic deformation of a material possessing a yield locus (f(σ_ij)) which may be written as a homogeneous function of the stress components (σ_ij), and which obeys the classical associated flow rule for metals (e.g. Bishop and Hill, 1951) is considered. The material may be anisotropic and may display plastic dilatation. A method is given for constructing the equivalent plastic strain increment in such a way that the increment of plastic work is always equal to the product of the equivalent plastic strain increment and the equivalent yield stress. Construction of the equivalent plastic strain at a corner in the yield locus is given. The method given here is implied in classical treatments of hardening (e.g. Hill, 1950) but seems not to have been given explicitly heretofore.     

Geometric Models for Quasicrystals II. Local Rules Under Isometries

The atomic structures of quasicrystalline materials exhibit long range order under translations. It is believed that such materials have atomic structures which approximately obey local rules restricting the location of nearby atoms. These local constraints are typically invariant under rotations, and it is of interest to establish conditions under which such local rules can nevertheless enforce order under translations in any structure that satisfies them. A set of local rules in is a finite collection of discrete sets {Y _i } containing 0, each of which is contained in the ball of radius ρ around 0 in . A set X satisfies the local rules under isometries if the ρ -neighborhood of each is isometric to an element of . This paper gives sufficient conditions on a set of local rules such that if X satisfies under isometries, then X has a weak long-range order under translations, in the sense that X is a Delone set of finite type. A set X is a Delone set of finite type if it is a Delone set whose interpoint distance set X-X is a discrete closed set. We show for each minimal Delone set of finite type X that there exists a set of local rules such that X satisfies under isometries and all other Y that satisfy under isometries are Delone sets of finite type. A set of perfect local rules (under isometries or under translations, respectively) is a set of local rules such that all structures X that satisfy are in the same local isomorphism class (under isometries or under translations, respectively). If a Delone set of finite type has a set of perfect local rules under translations, then it has a set of perfect local rules under isometries, and conversely. Received February 14, 1997, and in revised form February 14, 1998, February 19, 1998, and March 5, 1998.     

Evolution of fuzzy classifiers using genetic programming

In this paper, we propose a genetic programming (GP) based approach to evolve fuzzy rule based classifiers. For a c-class problem, a classifier consists of c trees. Each tree, T _i , of the multi-tree classifier represents a set of rules for class i. During the evolutionary process, the inaccurate/inactive rules of the initial set of rules are removed by a cleaning scheme. This allows good rules to sustain and that eventually determines the number of rules. In the beginning, our GP scheme uses a randomly selected subset of features and then evolves the features to be used in each rule. The initial rules are constructed using prototypes, which are generated randomly as well as by the fuzzy k-means (FKM) algorithm. Besides, experiments are conducted in three different ways: Using only randomly generated rules, using a mixture of randomly generated rules and FKM prototype based rules, and with exclusively FKM prototype based rules. The performance of the classifiers is comparable irrespective of the type of initial rules. This emphasizes the novelty of the proposed evolutionary scheme. In this context, we propose a new mutation operation to alter the rule parameters. The GP scheme optimizes the structure of rules as well as the parameters involved. The method is validated on six benchmark data sets and the performance of the proposed scheme is found to be satisfactory.     

Onp-generator fully symmetric quadrature rules

Summary We consider fully symmetric quadrature rules for fully symmetricn-dimensional integration regions. When the region is a product region it is well known that product Gaussian rules exist. These obtain an approximation of polynomial degree 4p+1 based on (2p+1) ⁿ function values arranged on a rectangular grid. We term rules using such a grid,p-generator rules. In this paper we determine the necessary conditions on the region of integration forp-generator rules of degree 4p+1 to exist. Regions with this property are termed PropertyQ regions and besides product spaces, this class includes the hypersphere and other related regions.Work performed under the auspices of the U.S. Energy Research and Development Administration     

An average discrepancy for optimal vertex‐modified number‐theoretic rules

Number‐theoretic rules are particularly suited for the approximation of multidimensional integrals in which the integrands are periodic. When the integrands are not periodic, then a vertex‐modified variant has been proposed. Error bounds for such vertex‐modified rules may be obtained in terms of the L ₂ discrepancy. In s dimensions these vertex‐modified rules contain 2^s weights which may be chosen optimally so that the discrepancy is minimized. We obtain an expression for the squared L ₂ discrepancy of optimal vertex‐modified rules. This expression is used to derive an expression for the average of the squared L ₂ discrepancy for optimal vertex‐modified number‐theoretic rules. Values of this average are then compared with the corresponding average for normal number‐theoretic rules and the expected value for Monte Carlo rules. This revised version was published online in June 2006 with corrections to the Cover Date.     

Global existence in rate-independent infinitesimal strain gradient plasticity

We propose a model of infinitesimal strain gradient plasticity including phenomenological Prager type linear kinematical hardening and nonlocal kinematical hardening due to dislocation interaction. The model is a thermodynamically admissible model of infinitesimal plasticity involving only the Curl of the non-symmetric plastic distortion p. Linearized spatial and material covariance under constant infinitesimal rotations is satisfied. Uniqueness of strong solutions of the infinitesimal model is obtained if two non-classical boundary conditions on the plastic distortion p are introduced: ṗ.τ = 0 on the microscopically hard boundary Γ_D ⊂ ∂Ω and [Curl p ].τ = 0 on the microscopically free boundary ∂Ω\Γ_D, where τ are the tangential vectors at the boundary ∂Ω. Moreover, a weak reformulation of the infinitesimal model allows for a global in-time solution of the corresponding rate-independent initial boundary value problem. The method of choice are a formulation as a quasi-variational inequality with symmetric and coercive bilinear form. Use is made of new Hilbert-space suitable for dislocation density dependent plasticity. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Distributive-Lattice Semantics of Sequent Calculi with Structural Rules

The goal of the paper is to develop a universal semantic approach to derivable rules of propositional multiple-conclusion sequent calculi with structural rules, which explicitly involve not only atomic formulas, treated as metavariables for formulas, but also formula set variables (viz., metavariables for finite sets of formulas), upon the basis of the conception of model introduced in (Fuzzy Sets Syst 121(3):27–37, 2001). One of the main results of the paper is that any regular sequent calculus with structural rules has such class of sequent models (called its semantics) that a rule is derivable in the calculus iff it is sound with respect to each model of the semantics. We then show how semantics of admissible rules of such calculi can be found with using a method of free models. Next, our universal approach is applied to sequent calculi for many-valued logics with equality determinant. Finally, we exemplify this application by studying sequent calculi for some of such logics.      

Convergence and smoothness analysis of subdivision rules in Riemannian and symmetric spaces

After a discussion on definability of invariant subdivision rules we discuss rules for sequential data living in Riemannian manifolds and in symmetric spaces, having in mind the space of positive definite matrices as a major example. We show that subdivision rules defined with intrinsic means in Cartan-Hadamard manifolds converge for all input data, which is a much stronger result than those usually available for manifold subdivision rules. We also show weaker convergence results which are true in general but apply only to dense enough input data. Finally we discuss C ¹ and C ² smoothness of limit curves.     

Numerical integration with polynomial exactness over a spherical cap

This paper presents rules for numerical integration over spherical caps and discusses their properties. For a spherical cap on the unit sphere \mathbbS²\mathbb{S}^2, we discuss tensor product rules with n ²/2 + O(n) nodes in the cap, positive weights, which are exact for all spherical polynomials of degree ≤ n, and can be easily and inexpensively implemented. Numerical tests illustrate the performance of these rules. A similar derivation establishes the existence of equal weight rules with degree of polynomial exactness n and O(n ³) nodes for numerical integration over spherical caps on \mathbbS²\mathbb{S}^2. For arbitrary d ≥ 2, this strategy is extended to provide rules for numerical integration over spherical caps on \mathbbS^d\mathbb{S}^d that have O(n ^d ) nodes in the cap, positive weights, and are exact for all spherical polynomials of degree ≤ n. We also show that positive weight rules for numerical integration over spherical caps on \mathbbS^d\mathbb{S}^d that are exact for all spherical polynomials of degree ≤ n have at least O(n ^d ) nodes and possess a certain regularity property.     

Convergence and Smoothness of Nonlinear Lane–Riesenfeld Algorithms in the Functional Setting

We investigate the Lane–Riesenfeld subdivision algorithm for uniform B-splines, when the arithmetic mean in the various steps of the algorithm is replaced by nonlinear, symmetric, binary averaging rules. The averaging rules may be different in different steps of the algorithm. We review the notion of a symmetric binary averaging rule, and we derive some of its relevant properties. We then provide sufficient conditions on the nonlinear binary averaging rules used in the Lane–Riesenfeld algorithm that ensure the convergence of the algorithm to a continuous function. We also show that, when the averaging rules are C ² with uniformly bounded second derivatives, then the limit is a C ¹ function. A canonical family of nonlinear, symmetric averaging rules, the p-averages, is presented, and the Lane–Riesenfeld algorithm with these averages is investigated.     

A construction of polynomial lattice rules with small gain coefficients

In this paper we construct polynomial lattice rules which have, in some sense, small gain coefficients using a component-by-component approach. The gain coefficients, as introduced by Owen, indicate to what degree the method improves upon Monte Carlo. We show that the variance of an estimator based on a scrambled polynomial lattice rule constructed component-by-component decays at a rate of N ^{−(2α+1)+δ} , for all δ > 0, assuming that the function under consideration has bounded variation of order α for some 0 < α ≤ 1, and where N denotes the number of quadrature points. An analogous result is obtained for Korobov polynomial lattice rules. It is also established that these rules are almost optimal for the function space considered in this paper. Furthermore, we discuss the implementation of the component-by-component approach and show how to reduce the computational cost associated with it. Finally, we present numerical results comparing scrambled polynomial lattice rules and scrambled digital nets.     

Estimation of a mean in the presence of an extreme observation

The performance of Anscombe, semi-Winsorization and Winsorization (A, S and W) rules for dealing with extreme observations are investigated for observations from N(μ, σ²) and the simple case where it is assumed that at most one observation in the sample may be biased, arising from N(μ + aσ, σ²) and the primary objective is to estimate μ when σ is unknown. Each of these rules is separately treated in terms of the estimated standard deviation, range and interquartile range. A Monte Carlo method is used to evaluate certain expectation integrals that arise in the computations. We give the results for sample sizes n = 6, 8, 10, 12, 14, 16, 20, 30, 40, 50, 60, 80, 100 of determining the constants necessary to give ‘premiums’ of 0.01 and 0.05 for each of the rules. The performance of the rules is measured in terms of ‘protection’. Features of the resulting tables are discussed.     

The Existence of Good Extensible Polynomial Lattice Rules

Extensible (polynomial) lattice rules have been introduced recently and they are convenient tools for quasi-Monte Carlo integration. It is shown in this paper that for suitable infinite families of polynomial moduli there exist generating parameters for extensible rank-1 polynomial lattice rules such that for all these infinitely many moduli and all dimensions s the quantity R ^(s) and the star discrepancy are small. The case of Korobov-type polynomial lattice rules is also considered.     

The Existence of Good Extensible Polynomial Lattice Rules

Extensible (polynomial) lattice rules have been introduced recently and they are convenient tools for quasi-Monte Carlo integration. It is shown in this paper that for suitable infinite families of polynomial moduli there exist generating parameters for extensible rank-1 polynomial lattice rules such that for all these infinitely many moduli and all dimensions s the quantity R ^(s) and the star discrepancy are small. The case of Korobov-type polynomial lattice rules is also considered.Received April 30, 2002; in revised form August 21, 2002 Published online April 4, 2003     

Fully discrete T‐ψ finite element method to solve a nonlinear induction hardening problem

We study an induction hardening model described by Maxwell's equations coupled with a heat equation. The magnetic induction field is assumed a nonlinear constitutional relation and the electric conductivity is temperature‐dependent. The T ‐ψ method is to transform Maxwell's equations to the vector–scalar potential formulations and to solve the potentials by means of the finite element method. In this article, we present a fully discrete T ‐ψ finite element scheme for this nonlinear coupled problem and discuss its solvability. We prove that the discrete solution converges to a weak solution of the continuous problem. Finally, we conclude with two numerical experiments for the coupled system.     

New decision rules for exact search in N-Queens

This paper presents a set of new decision rules for exact search in N-Queens. Apart from new tiebreaking strategies for value and variable ordering, we introduce the notion of ‘free diagonal’ for decision taking at each step of the search. With the proposed new decision heuristic the number of subproblems needed to enumerate the first K solutions (typically K = 1, 10 and 100) is greatly reduced w.r.t. other algorithms and constitutes empirical evidence that the average solution density (or its inverse, the number of subproblems per solution) remains constant independent of N. Specifically finding a valid configuration was backtrack free in 994 cases out of 1,000, an almost perfect decision ratio. This research is part of a bigger project which aims at deriving new decision rules for CSP domains by evaluating, at each step, a constraint value graph G _c . N-Queens has adapted well to this strategy: domain independent rules are inferred directly from G _c whereas domain dependent knowledge is represented by an induced hypergraph over G _c and computed by similar domain independent techniques. Prior work on the Number Place problem also yielded similar encouraging results.     

Component-by-Component Construction of Good Lattice Rules with a Composite Number of Points

We develop algorithms to construct rank-1 lattice rules in weighted Korobov spaces of periodic functions and shifted rank-1 lattice rules in weighted Sobolev spaces of non-periodic functions. Analyses are given which show that the rules so constructed achieve strong QMC tractability error bounds. Unlike earlier analyses, there is no assumption that n, the number of quadrature points, be a prime number. However, we do assume that there is an upper bound on the number of distinct prime factors of n. The generating vectors and shifts characterizing the rules are constructed ‘component-by-component,’ that is, the (d+1)th components of the generating vectors and shifts are obtained using one-dimensional searches, with the previous d components kept unchanged.