Note on theK0 of rings with Zariskian filtration

For a noncommutative Zariski ringR with associated graded ringG(R) of finite global dimension there is an injectionK _o(R) K _o (G(R)). The result applies to certain rings of differential operators, in particular to the ring of germs of microlocal differential operators that also provides an example of a nonpositively filtered Zariski ring.Research fellow at UIA, supported by a grant from the Province of Antwerp.Supported by an NFWO grant.     

Formal and Tempered Solutions of Regular D-Modules

A new family of sheaves has been recently studied by M. Kashiwara and P. Schapira generalizing to constructible sheaves the notion of moderate and formal cohomology. We prove comparison theorems when we regard these sheaves as solutions of a D-module. These results are natural generalizations of those of Y. Laurent and the author.     

Constructions for Octonion and Exceptional Jordan Algebras

In this note we reverse theusual process of constructing the Lie algebras of types G ₂and F ₄ as algebras of derivations of the splitoctonions or the exceptional Jordan algebra and instead beginwith their Dynkin diagrams and then construct the algebras togetherwith an action of the Lie algebras and associated Chevalley groups.This is shown to be a variation on a general construction ofall standard modules for simple Lie algebras and it is well suitedfor use in computational algebra systems. All the structure constantswhich occur are integral and hence the construction specialisesto all fields, without restriction on the characteristic, avoidingthe usual problems with characteristics 2 and 3.     

Duality for Knizhnik–Zamolodchikov and Dynamical Equations

We consider the Knizhnik–Zamolodchikov (KZ) and dynamical equations, both differential and difference, in the context of (gl _k ,gl _n ) duality. We show that the KZ and dynamical equations naturally exchange under the duality.     

Properties of Distortion Risk Measures

The current literature does not reach a consensus on which risk measures should be used in practice. Our objective is to give at least a partial solution to this problem. We study properties that a risk measure must satisfy to avoid inadequate portfolio selections. The properties that we propose for risk measures can help avoid the problems observed with popular measures, like Value at Risk (VaR _α ) or Conditional VaR _α (CVaR _α ). This leads to the definition of two new families: complete and adapted risk measures. Our focus is on risk measures generated by distortion functions. Two new properties are put forward for these: completeness, ensuring that the distortion risk measure uses all the information of the loss distribution, and adaptability, forcing the measure to use this information adequately. This research was partially funded by ^1,3 Welzia Management, SGIIC SA, RD Sistemas SA, Comunidad Autónoma de Madrid Grant s-0505/tic/000230, and MEyC Grant BEC2000-1388-C04-03 and by ² the Natural Sciences and Engineering Research Council of Canada (NSERC) Grant 36860-06.     

Analysis of Fractional Covering of Some Supply Management Problems

We study a supply management problem with a linear cost function and its mixed integer program. A parametric family of such problems, possessing exponential L _k -coverings, is constructed. Besides, the NP-hard expansion of the family, which has the same property, is formulated.     

Simulation input data modeling

Input data modeling is a critical component of a successful simulation application. A perspective of the area is given with an emphasis on available probability distributions as models, estimation methods, model selection and discrimination, and goodness of fit. Three specific distribution classes (lambda,S _B , TES processes) are discussed in some detail to illustrate characteristics that favor input models. Regarding estimation, we argue for maximum likelihood estimation over method of moments and other matching schemes due to intrinsic superior properties (presuming a specific model) and the capability of accommodating messy data types. We conclude with a list of specific research problems and areas warranting additional attention.     

Exact L 2-norm plane separation

We consider the problem of separating two sets of points in an n-dimensional real space with a (hyper)plane that minimizes the sum of L _p -norm distances to the plane of points lying on the wrong side of it. Despite recent progress, practical techniques for the exact solution of cases other than the L ₁ and L _∞-norm were unavailable. We propose and implement a new approach, based on non-convex quadratic programming, for the exact solution of the L ₂-norm case. We solve in reasonable computing times artificial problems of up to 20000 points (in 6 dimensions) and 13 dimensions (with 2000 points). We also observe that, for difficult real-life instances from the UCI Repository, computation times are substantially reduced by incorporating heuristic results in the exact solution process. Finally, we compare the classification performance of the planes obtained for the L ₁, L ₂ and L _∞ formulations. It appears that, despite the fact that L ₂ formulation is computationally more expensive, it does not give significantly better results than the L ₁ and L _∞ formulations.     

Feature selection for high-dimensional data

This paper focuses on feature selection for problems dealing with high-dimensional data. We discuss the benefits of adopting a regularized approach with L ₁ or L ₁–L ₂ penalties in two different applications—microarray data analysis in computational biology and object detection in computer vision. We describe general algorithmic aspects as well as architecture issues specific to the two domains. The very promising results obtained show how the proposed approach can be useful in quite different fields of application.     

Cut elimination for S4n and K4n with the central agent axiom

We analyze the multimodal logic S4 _n with the central agent axiom. We present a Hilbert-type calculus, then derive a Gentzen-type calculus with cut, and prove a cut-elimination theorem. The work shows that it is possible to construct a cut-free Gentzen-type calculus for this logic. Moreover, it also provides analogous results for the multimodal logic K4 _n with the central agent axiom.     

态R_0代数

本文研究了R_0代数上有关态算子的问题.利用MV-代数上内态的引入方法引入了态算子,定义了态R_0代数,它是R_0代数的一般化.给出了一些非平凡态R_0代数的例子并讨论了态R_0代数的一些基本性质.在此基础上给出了态滤子和态局部R_0代数的概念,并利用态滤子刻画了态局部R_0代数.推广了局部R_0代数的相关理论.     

Multivariate approximation in the worst case setting over reproducing kernel Hilbert spaces

We study the worst case setting for approximation of d variate functions from a general reproducing kernel Hilbert space with the error measured in the L_∞ norm. We mainly consider algorithms that use n arbitrary continuous linear functionals. We look for algorithms with the minimal worst case errors and for their rates of convergence as n goes to infinity. Algorithms using n function values will be analyzed in a forthcoming paper.We show that the L_∞ approximation problem in the worst case setting is related to the weighted L₂ approximation problem in the average case setting with respect to a zero-mean Gaussian stochastic process whose covariance function is the same as the reproducing kernel of the Hilbert space. This relation enables us to find optimal algorithms and their rates of convergence for the weighted Korobov space with an arbitrary smoothness parameter α>1, and for the weighted Sobolev space whose reproducing kernel corresponds to the Wiener sheet measure. The optimal convergence rates are n^-(α-1)/2 and n^-1/2, respectively.We also study tractability of L_∞ approximation for the absolute and normalized error criteria, i.e., how the minimal worst case errors depend on the number of variables, d, especially when d is arbitrarily large. We provide necessary and sufficient conditions on tractability of L_∞ approximation in terms of tractability conditions of the weighted L₂ approximation in the average case setting. In particular, tractability holds in weighted Korobov and Sobolev spaces only for weights tending sufficiently fast to zero and does not hold for the classical unweighted spaces.     

On Some Extremal Properties of Lagrange Interpolatory Polynomials

In this paper, we will show that Lagrange interpolatory polynomials are optimal for solving some approximation theory problems concerning the finding of linear widths.In particular, we will show that

Full-size image

, where _n is a set of the linear operators with finite rank n+1 defined on −1,1], and where _n+1 denotes the set of polynomials p=∑_i=0ⁿ⁺¹a_ixⁱ of degreen+1 such that a_n+11. The infimum is achieved for Lagrange interpolatory polynomial for nodes .     

Quaternionic and para-quaternionic <Emphasis Type="Italic">CR</Emphasis> structure on (4n+3)-dimensional manifolds

We define notion of a quaternionic and para-quaternionic CR structure on a (4n+3)-dimensional manifold M as a triple (ω₁,ω₂,ω₃) of 1-forms such that the corresponding 2-forms satisfy some algebraic relations. We associate with such a structure an Einstein metric on M and establish relations between quaternionic CR structures, contact pseudo-metric 3-structures and pseudo-Sasakian 3-structures. Homogeneous examples of (para)-quaternionic CR manifolds are given and a reduction construction of non homogeneous (para)-quaternionic CR manifolds is described.     

On solving three classes of nonlinear programming problems via simple differentiable penalty functions

We consider the following classes of nonlinear programming problems: the minimization of smooth functions subject to general constraints and simple bounds on the variables; the nonlinearl ₁-problem; and the minimax problem. Numerically reliable methods for solving problems in each of these classes, based upon exploiting the structure of the problem in constructing simple differentiable penalty functions, are presented.This research was made possible by NSERC Grant No. A8442.The author would like to thank Mrs. J. Selwood of the Department of Combinatories and Optimization, University of Waterloo, Ontario, Canada for her excellent typesetting.This work was carried out in the Department of Combinatories and Optimization, University of Waterloo, Waterloo, Ontario, Canada.     

Predictor-corrector algorithm for solvingP *(κ)-matrix LCP from arbitrary positive starting points

A new predictor-corrector algorithm is proposed for solvingP _*(κ)-matrix linear complementarity problems. If the problem is solvable, then the algorithm converges from an arbitrary positive starting point (x ⁰,s ⁰). The computational complexity of the algorithm depends on the quality of the starting point. If the starting point is feasible or close to being feasible, it has -iteration complexity, whereρ ₀ is the ratio of the smallest and average coordinate ofX ⁰ s ⁰. With appropriate initialization, a modified version of the algorithm terminates in O((1+κ)²(n/ρ ₀)L) steps either by finding a solution or by determining that the problem has no solution in a predetermined, arbitrarily large, region. The algorithm is quadratically convergent for problems having a strictly complementary solution. We also propose an extension of a recent algorithm of Mizuno toP _*(κ)-matrix linear complementarity problems such that it can start from arbitrary positive points and has superlinear convergence without a strictly complementary condition. The work of this author was supported in part by NSF, Grant DMS 9305760 and by an Oberman fellowship from the University of Iowa Center for Advanced Studies.     

Long vectors for quasi-Newton updates

This work concerns the derivation of formulae for updating quasi-Newton matrices used in algorithms for computing approximate minima of smooth unconstrained functions. The paper concentrates strictly on the techniques used to derive update formulae. It demonstrates a technique in which problems of finding matrices in ℝ ^{n ×n} of minimum Frobenius norm are converted to equivalent problems, using vector representations in ℝ ⁿ² and ℝ ^n(n+1)/2 of these matrices, and then solvingl ₂-minimization problems. These problems are more directly dealt with, and indeed, the paper demonstrates how this technique may be used to handle weighted sparse updates.     

A process variability control chart

In this study a Shewhart type control chart namely the V _t chart, is proposed for improved monitoring of the process variability of a quality characteristic of interest Y. The proposed control chart is based on the ratio type estimator of the variance using a single auxiliary variable X. It is assumed that (Y, X) follows a bivariate normal distribution. The design structure of the V _t chart is developed for Phase-I quality control and its comparison is made with those of the S ² chart (a well-known Shewhart control chart) and the V _r chart (a Shewhart type control chart proposed by Riaz (Comput Stat, 2008a) used for the same purpose. It is observed that the proposed V _t chart outperforms the S ² and V _r charts, in terms of discriminatory power, for detecting moderate to large shifts in the process variability. It is observed that the performance of the V _t chart keeps improving with an increase in |ρ _yx | , where ρ _yx is the correlation between Y and X.     

Two lower order nonconforming quadrilateral elements for the Reissner-Mindlin plate

This paper generalizes two nonconforming rectangular elements of the Reissner-Mindlin plate to the quadrilateral mesh. The first quadrilateral element uses the usual conforming bilinear element to approximate both components of the rotation, and the modified nonconforming rotated Q ₁ element enriched with the intersected term on each element to approximate the displacement, whereas the second one uses the enriched modified nonconforming rotated Q ₁ element to approximate both the rotation and the displacement. Both elements employ a more complicated shear force space to overcome the shear force locking, which will be described in detail in the introduction. We prove that both methods converge at optimal rates uniformly in the plate thickness t and the mesh distortion parameter in both the H ¹-and the L ²-norms, and consequently they are locking free. This work was supported by the National Natural Science Foundation of China (Grant No. 10601003) and National Excellent Doctoral Dissertation of China (Grant No. 200718)     

关于L_p球的几个新不等式和性质(英文)

本文研究了L_p球的相关问题.利用对偶混合体积、球面Radon变换和Fourier变换的方法,获得了关于L_p球的几个新不等式和性质,其中一个不等式与著名的最大切片猜想有关.