Propriétés statistiques des entiers friables

Let Ψ(x,y) (resp. Ψ_m(x,y)) denote the number of integers not exceeding x that are y-friable, i.e. have no prime factor exceeding y (resp. and are coprime to m). Evaluating the ratio Ψ_m(x/d,y)/Ψ(x,y) for 1≤slantd≤slantx, m≥slant 1, x≥slant y≥slant 2, turns out to be a crucial step for estimating arithmetic sums over friable integers. Here, it is crucial to obtain formulae with a very wide range of validity. In this paper, several uniform estimates are provided for the aforementioned ratio, which supersede all previously known results. Applications are given to averages of various arithmetic functions over friable integers which in turn improve corresponding results from the literature. The technique employed rests mainly on the saddle-point method, which is an efficient and specific tool for the required design.2000 Mathematics Subject Classification: Primary—11N25; Secondary—11K65, 11N37     

A note on strong β-I-sets and strongly β-I-continuous functions

Summary In [6], we introduced and investigated the notions of strong β-I-open sets and strong β-I-continuous functions in ideal topological spaces. In this paper, we investigate further their important properties.     

A Generalization of the Mean Size Formula of Wavelet Packets in Lp

The purpose of this paper is to investigate the mean size formula of wavelet packets in Lp for 0 〈 p ≤ ∞. We generalize a mean size formula of wavelet packets given in terms of the p-norm joint spectral radius and we also give some asymptotic formulas for the Lp-norm or quasi-norm on the subdivision trees. All results will be given in the general setting,     

Local Feasible QP-Free Algorithms for the Constrained Minimization of SC1 Functions

We consider the problem of minimizing an SC¹ function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm.     

一种小波域音频信息隐藏方法

提出了一种基于量化的小波域音频隐藏算法，将保密语音隐藏到载体音频中．为提高隐藏重和保密语音传输的安全性，对保密语音进行了小波域压缩编码和m序列的扩频调制，生成待隐藏的比特序列；通过量化方法，将编码和调制后的保密语音隐藏到载体音频的小波系数中；保密语音的恢复过程不需要使用原始音频、仿真结果表明，隐藏有保密语音的载体音频听觉质量没有明显下降，提取的保密语音感知质量较好；该算法对重量化、加噪、低通滤波等攻击均有良好的鲁棒性．     

On the spectral norm of algebraic numbers

In this paper we continue to study the spectral norms and their completions ([4]) in the case of the algebraic closure $ \overline {\mathbb Q} $ of ? in ?. Let $ \widetilde{\overline{\mathbb{Q}}} $ be the completion of $ \overline {\mathbb Q} $ relative to the spectral norm. We prove that $ \widetilde{\overline{\mathbb{Q}}} $ can be identified with the R‐subalgebra of all symmetric functions of C(G), where C(G) denotes the ?‐Banach algebra of all continuous functions defined on the absolute Galois group G = Gal$ {\overline {\mathbb Q}} / {\mathbb Q} $. We prove that any compact, closed to conjugation subset of ? is the pseudo‐orbit of a suitable element of $ \widetilde{\overline{\mathbb{Q}}} $. We also prove that the topological closure of any algebraic number field in $ \widetilde{\overline{\mathbb{Q}}} $ is of the form $\widetilde{\mathbb{Q}[x]}$ with x in $ \widetilde{\overline{\mathbb{Q}}} $.     

Resolution of Some Open Problems Concerning Multiple Zeta Evaluations of Arbitrary Depth

We prove some new evaluations for multiple polylogarithms of arbitrary depth. The simplest of our results is a multiple zeta evaluation one order of complexity beyond the well-known Broadhurst–Zagier formula. Other results we provide settle three of the remaining outstanding conjectures of Borwein, Bradley, and Broadhurst. A complete treatment of a certain arbitrary depth class of periodic alternating unit Euler sums is also given.     

Fixed points in the family of convex representations of a maximal monotone operator

Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exists a convex representation of the operator which is a fixed point of this conjugation.

     

基于成像机理的小波包变换多聚焦图像融合

由于可见光成像系统的聚焦范围有限,因而在成像过程中,除聚焦良好的物体能生成清晰的图像外,该物体前后一定距离外的所有物体都将呈现不同程度的模糊.为了获得场景内所有物体均清晰的图像,在分析了多聚焦图像成像机理的基础上,提出了一种基于小波包变换的融合方法.它是将成像系统先聚焦在一部分对象上,得到其清晰的图像;然后再将其聚焦在另一部分对象上,得到另一清晰的图像;最后把这两幅实验图像加以融合,从而获得场景内所有物体均清晰的图像.实验结果表明,基于小波包变换的融合方法能够将信号的频带进行多层次划分,对高频成分也能进一步地分解,可有效综合多聚焦图像.     

Cyclic Hypomonotonicity,Cyclic Submonotonicity,and Integration

Rockafellar has shown that the subdifferentials of convex functions are always cyclically monotone operators. Moreover, maximal cyclically monotone operators are necessarily operators of this type, since one can construct explicitly a convex function, which turns out to be unique up to a constant, whose subdifferential gives back the operator. This result is a cornerstone in convex analysis and relates tightly convexity and monotonicity. In this paper, we establish analogous robust results that relate weak convexity notions to corresponding notions of weak monotonicity, provided one deals with locally Lipschitz functions and locally bounded operators. In particular, the subdifferentials of locally Lipschitz functions that are directionally hypomonotone [respectively, directionally submonotone] enjoy also an additional cyclic strengthening of this notion and in fact are maximal under this new property. Moreover, every maximal cyclically hypomonotone [respectively, maximal cyclically submonotone] operator is always the Clarke subdifferential of some directionally weakly convex [respectively, directionally approximately convex] locally Lipschitz function, unique up to a constant, which in finite dimentions is a lower C² function [respectively, a lower C¹ function].