A multiplier rule on a metric space

A multiplier rule is proved for constrained minimization problems defined on a metric spaces. The proof requires a generalization of the values of a derivative in the classical case that the metric space is a normed space.     

A Probabilistic Framework Towards the Parameterization of Association Rule Interestingness Measures

In this paper, we first present an original and synthetic overview of the most commonly used association rule interestingness measures. These measures usually relate the confidence of a rule to an independence reference situation. Yet, some relate it to indetermination, or impose a minimum confidence threshold. We propose a systematic generalization of these measures, taking into account a reference point chosen by an expert in order to appreciate the confidence of a rule. This generalization introduces new connections between measures, and leads to the enhancement of some of them. Finally we propose new parameterized possibilities.      

Toroidal李代数上的Poisson代数结构

非交换的Poisson代数同时具有结合代数和李代数两种代数结构,而结合代数和李代数之间满足所谓的Leibniz法则．文中确定了Toroidal李代数上所有的Poisson代数结构,推广了仿射Kac-Moody代数上相应的结论．     

THE CONVERSE OF HARTWICK'S RULE AND UNIQUENESS OF THE SUSTAINABLE PATH

ABSTRACT. We provide a constructive proof of the converse of Hartwick's rule for a generalization of Solow's model with one capital good and one exhaustible resource. We also show that the sustainable path is unique.     

Single-peaked orders on a tree

Inada (1969) and Sen and Pattanaik (1969) have characterized the sets of preference orders which ensure the transitivity of the strict majority rule, no matter how each voter selects his own order in the set. But a problem remains untouched: which domains of orders guarantee the existence of a majority winner without necessarily ensuring the transitivity of the strict majority rule. We provide in this paper domains, called sets of single-peaked linear orders on a tree, which enjoy such a property. They appear as a generalization of the well-known sets of single-peaked linear orders.     

A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems

The problem of scheduling n jobs with known process times on m identical parallel machines with an objective of minimizing weighted flow time is NP-hard. However, when job weights are identical, it is well known that the problem is easily solved using the shortest processing time rule. In this paper, we show that a generalization of the shortest processing time rule minimizes weighted flow time in a class of problems where job weights are not identical.     

线性矩阵方程的行列式求解法

本文讨论了线性矩阵方程AXB= C (A,B可逆)的用行列式表示的求解公式,并附带指出它是Cram er法则的重要推广.     

A chain rule formula for higher derivations and inverses of polynomial maps

The multidimensional chain rule formula for analytic functions and its generalization to higher derivatives perfectly work in the algebraic setting in characteristic zero. In positive characteristic one runs into problems due to denominators in these formulas. In this article we show a direct analog of these formulas using higher derivations which are defined in any characteristic. We also use these formulas to show how higher derivations to different coordinate systems are related to each other. Finally, we apply this to polynomial automorphisms in arbitrary characteristic and obtain a formula for the inverse of such a polynomial automorphism.     

Infinite dimensional generalized Jacobian: Properties and calculus rules

The extension to infinite dimensional domains of Clarke's generalized Jacobian is the focus of this paper. First, a generalization of a Fabian-Preiss theorem to the infinite dimensional setting is obtained. As a consequence, a new formula relating the Clarke's generalized Jacobians corresponding to finite dimensional spaces K, L with K⊆L is established. Furthermore, in the infinite dimensional case, basic properties pertaining the generalized Jacobian are developed and then an identification of this set-valued map is produced. Applications of these results in the form of chain rules including sum and product rules, and a computational formula for continuous selections are derived.     

Growth diagrams for the Schubert multiplication

We present a partial generalization of the classical Littlewood-Richardson rule (in its version based on Schützenberger's jeu de taquin) to Schubert calculus on flag varieties. More precisely, we describe certain structure constants expressing the product of a Schubert and a Schur polynomial. We use a generalization of Fomin's growth diagrams (for chains in Young's lattice of partitions) to chains of permutations in the so-called k-Bruhat order. Our work is based on the recent thesis of Beligan, in which he generalizes the classical plactic structure on words to chains in certain intervals in k-Bruhat order. Potential applications of our work include the generalization of the S₃-symmetric Littlewood-Richardson rule due to Thomas and Yong, which is based on Fomin's growth diagrams.     

超网络中心性度量的υ-Position值方法

利用合作博弈理论的分配规则如Shapley值、Banzhaf值等来度量政治、经济和社会网络中节点的中心性或者重要性是识别网络中关键节点的一类重要方法。考虑到在超网络中代表各类组织的超边在网络中发挥的作用不同,本文研究了超网络博弈上一类广义Position值的分配规则,被称为υ-position值。它可以作为网络中度值测度的一类推广,以此来度量网络中参与者的中心性和相对重要性。其次,证明了超网络结构上类Shapley-position值可由分支超边指数和局部平衡超边贡献两个性质所唯一刻画。最后, 举例分析了υ-position值在超网络中心性测度中的应用。     

Local structure-preserving algorithms for partial differential equations

In this paper, we discuss the concept of local structure-preserving algorithms (SPAs) for partial differential equations, which are the natural generalization of the corresponding global SPAs. Local SPAs for the problems with proper boundary conditions are global SPAs, but the inverse is not necessarily valid. The concept of the local SPAs can explain the difference between different SPAs and provide a basic theory for analyzing and constructing high performance SPAs. Furthermore, it enlarges the applicable scopes of SPAs. We also discuss the application and the construction of local SPAs and derive several new SPAs for the nonlinear Klein-Gordon equation. This work was supported by the National Basic Research Program (Grant No. 2005CB321703). The first author was supported by the National Natural Science Foundation of China (Grant Nos. 40405019, 10471067) and the Major Research Projects of Jiangsu Province (Grant No. BK2006725); the second author was supported by the National Natural Science Foundation of China (Innovation Group) (Grant No. 40221503) and the third author was supported by the National Natural Science Foundation of China (Grant No. 10471145)     

Pluriassociative algebras I: The pluriassociative operad

Diassociative algebras form a category of algebras recently introduced by Loday. A diassociative algebra is a vector space endowed with two associative binary operations satisfying some very natural relations. Any diassociative algebra is an algebra over the diassociative operad, and, among its most notable properties, this operad is the Koszul dual of the dendriform operad. We introduce here, by adopting the point of view and the tools offered by the theory of operads, a generalization on a nonnegative integer parameter γ of diassociative algebras, called γ-pluriassociative algebras, so that 1-pluriassociative algebras are diassociative algebras. Pluriassociative algebras are vector spaces endowed with 2γ associative binary operations satisfying some relations. We provide a complete study of the γ-pluriassociative operads, the underlying operads of the category of γ-pluriassociative algebras. We exhibit a realization of these operads, establish several presentations by generators and relations, compute their Hilbert series, show that they are Koszul, and construct the free objects in the corresponding categories. We also study several notions of units in γ-pluriassociative algebras and propose a general way to construct such algebras. This paper ends with the introduction of an analogous generalization of the triassociative operad of Loday and Ronco.     

Development of generalized Iwan model to simulate frictional contacts with variable normal loads

Most friction models are originally proposed to predict restoring forces in mechanical contacts with constant normal load. In practice the contact interface kinematics may involve normal motion in addition to the tangential displacements, leading to variation of the contact normal load. This phenomenon is observed most strongly in contacts with high lateral vibration amplitudes and is known as slap. The current study establishes a general friction model to account for variation in the normal load and enables one to predict the behavior of a contact more precisely. Iwan model (1966) [5] is a suitable candidate for contact interface modeling and is able to represent the stick-micro/macro slip behavior involved in a friction contact. This physical based model is employed in the current work and its physical parameters are generalized to include the normal load variation effects. The model is characterized by a slippage distribution density function and a linear stiffness at stick state. Both these parameters, defined in presence of constant normal load in the original model, are derived considering normal load variation leading to generalization of the contact model. Conventional models with constant normal loads produce symmetric contact interface hysteresis loops, but the developed generalized Iwan model is capable of generating asymmetric hysteresis loops similar to those frequently seen in experiments. The generalized contact model is employed to simulate the measured behavior of a beam with frictional support observed in an experimental test set-up. The contact slippage distribution function is first identified in a constant normal load condition. Next in low levels of contact preloads where variation of the normal load is significant, the identified distribution function in generalized form is employed to predict the experimental observations.     

Dempster's rule of combination

The theory of belief functions is a generalization of probability theory; a belief function is a set function more general than a probability measure but whose values can still be interpreted as degrees of belief. Dempster's rule of combination is a rule for combining two or more belief functions; when the belief functions combined are based on distinct or “independent” sources of evidence, the rule corresponds intuitively to the pooling of evidence. As a special case, the rule yields a rule of conditioning which generalizes the usual rule for conditioning probability measures. The rule of combination was studied extensively, but only in the case of finite sets of possibilities, in the author's monograph A Mathematical Theory of Evidence. The present paper describes the rule for general, possibly infinite, sets of possibilities. We show that the rule preserves the regularity conditions of continuity and condensability, and we investigate the two distinct generalizations of probabilistic independence which the rule suggests.     

Slices of Essentially Algebraic Categories

This paper is a contribution to the theory of functor slices of J. Sichler and V. Trnková. For every ordinal α we introduce a basket , prove that every essentially algebraic category of height α is a slice of , characterize small slices of and give a common generalization of known results about slices of the algebraic basket .      

“Rising to the challenge”: using generalization in pattern problems to unearth the algebraic skills of talented pre-algebra students

This study focuses on the generalization methods used by talented pre-algebra students in solving linear and non-linear pattern problems. A qualitative analysis of the solutions of three problems revealed two approaches to generalization: recursive–local and functional–global. The students showed mental flexibility, shifting smoothly between pictorial, verbal and numerical representations and abandoning additive solution approaches in favor of more effective multiplicative strategies. Three forms of reflection aided generalization: reflection on commonalities in the pattern sequence’s structure, reflection on the generalization method, and reflection on the “tentative generalization” through verification of the pattern sequence. The latter indicates an intuitive grasp of the mathematical power of generalization. The students’ generalizations evinced algebraic thinking in the discovery of variables, constants and their mutual relations, and in the communication of these discoveries using invented algebraic notation. This study confirms the centrality of generalizations in mathematics and their potential as gateways to the world of algebra.     

Automatic Smoothing With Wavelets for a Wide Class of Distributions

Wavelet-based denoising techniques are well suited to estimate spatially inhomogeneous signals. Waveshrink (Donoho and Johnstone) assumes independent Gaussian errors and equispaced sampling of the signal. Various articles have relaxed some of these assumptions, but a systematic generalization to distributions such as Poisson, binomial, or Bernoulli is missing. We consider a unifying l₁-penalized likelihood approach to regularize the maximum likelihood estimation by adding an l₁ penalty of the wavelet coefficients. Our approach works for all types of wavelets and for a range of noise distributions. We develop both an algorithm to solve the estimation problem and rules to select the smoothing parameter automatically. In particular, using results from Poisson processes, we give an explicit formula for the universal smoothing parameter to denoise Poisson measurements. Simulations show that the procedure is an improvement over other methods. An astronomy example is given.     

Chrystal不等式的一个推广及其应用

利用均值不等式给出Chrystal不等式的一个推广,并利用该推广证明一个猜想.