小波域非加性失真函数设计

在最小化嵌入失真隐写算法框架的基础上,提出了一种基于小波域的非加性失真函数图像隐写算法。首先在离散小波域设计了加性失真函数,主要考虑了亮度、频率和纹理掩蔽因子对载体失真的影响;然后结合模型矫正的方法对设计的加性失真函数进行了非加性矫正;最后结合网格码设计了隐写算法,将嵌入信息对载体的修改最小化,并且集中在人眼不敏感区域。实验结果显示,方案具有良好的视觉不可见性,且能抵抗空域SPAM特征隐写分析的攻击。     

A location‐inventory model with lateral transshipments

We study an infinite horizon periodic stochastic inventory system consisting of retail outlets and customers located on a homogenous line segment. In each period, the total demand, generated by the customers on the line, is normally distributed. To better match supply and demand, we incorporate lateral transshipments. We propose a compact model in which the strategic decisions—the number and locations of retail outlets—are determined simultaneously with the operational decisions—the inventory replenishment and transshipment quantities. We find the optimal balance between the risk‐pooling considerations, which drive down the optimal number of retail outlets, and lateral transshipments, which drive up the optimal number of retail outlets. We also explore the sensitivity of the optimal number of retail outlets to various problem parameters. This article presents a novel way of integrating lateral transshipments in the context of an inventory‐location model. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

带紧扰动的集值(S)_+型映射的拓扑度及其应用

本文利用 Michael 连续选择定理与 F.E Browder 次连续(S)_+型映射度理论相结合的方法,构造了带紧扰动的1.s.c.集值(S)_+型映射的拓扑度,并讨论了作为其应用的不动点与值域问题.     

模拟电路子网络级故障诊断的新方法

针对目前模拟电路子网络级故障诊断方法普遍存在的问题,提出了一种新的诊断方法,阐述了该方法的诊断原理,给出了可诊断性条件,通过仿真例子,证明了该方法具有测试量少,方法简单,实时性好,适用于非线性电路等特点     

一种面向复杂地理空间栅格数据处理算法并行化的任务调度方法

随着并行计算技术的成熟,地理空间栅格数据处理算法的并行化研究成为新的热点。聚焦于处理流程包含多个计算步骤的复杂地理空间栅格数据处理算法,基于空间计算域理论,提出了一个随着算法处理流程而动态变化的任务调度方法。实验证明,该方法在算法流程的每一个计算步都会调整任务分组方案,因此相比于传统任务调度方法,任务调度的负载均衡效果更好,并行算法程序的运行时间更短。     

自旋结网圈表象中体积算符对5价顶角的作用

根据已有文献给出的W矩阵元的一般公式,利用重耦理论深入研究了5价顶角,得出了相应的W(5)矩阵元的可直接计算的精确公式.     

模型不可知的联合相互学习

主流的联邦学习(federated learning, FL)方法需要梯度的交互和数据同分布的理想假定,这就带来了额外的通信开销、隐私泄露和数据低效性的问题。因此,提出了一种新的FL框架,称为模型不可知的联合相互学习 (model agnostic federated mutual learning, MAFML)。MAFML仅利用少量低维的信息(例如,图像分类任务中神经网络输出的软标签)共享实现跨机构间的“互学互教”,且MAFML不需要共享一个全局模型,机构用户可以自定制私有模型。同时,MAFML使用简洁的梯度冲突避免方法使每个参与者在不降低自身域数据性能的前提下,能够很好地泛化到其他域的数据。在多个跨域数据集上的实验表明,MAFML可以为面临“竞争与合作”困境的联盟企业提供一种有前景的解决方法。     

Planning gamma accelerated degradation tests with two accelerating variables

Gamma accelerated degradation tests (ADT) are widely used to assess timely lifetime information of highly reliable products with degradation paths that follow a gamma process. In the existing literature, there is interest in addressing the problem of deciding how to conduct an efficient, ADT that includes determinations of higher stress‐testing levels and their corresponding sample‐size allocations. The existing results mainly focused on the case of a single accelerating variable. However, this may not be practical when the quality characteristics of the product have slow degradation rates. To overcome this difficulty, we propose an analytical approach to address this decision‐making problem using the case of two accelerating variables. Specifically, based on the criterion of minimizing the asymptotic variance of the estimated q quantile of lifetime distribution of the product, we analytically show that the optimal stress levels and sample‐size allocations can be simultaneously obtained via a general equivalence theorem. In addition, we use a practical example to illustrate the proposed procedure.     

燃气发生器低频非稳态燃烧统计分析

针对冲压发动机地面试验需求,设计燃气发生器,通过试验统计研究其燃烧稳定性特征。结果表明:该燃气发生器发生低频非稳态燃烧的概率为32.7%,存在两种振荡形态。一种存在振荡主频,即低频不稳定燃烧;另一种没有主频,燃烧形态为粗暴燃烧。粗暴燃烧发生概率高且与余氧系数存在较强的相关性,低频不稳定燃烧发生概率低。两种形态的振荡能量分布位置不同。     

A bivariate optimal replacement policy for a cold standby repairable system with repair priority

In this article, an optimal replacement policy for a cold standby repairable system consisting of two dissimilar components with repair priority is studied. Assume that both Components 1 and 2, after repair, are not as good as new, and the main component (Component 1) has repair priority. Both the sequence of working times and that of the components'repair times are generated by geometric processes. We consider a bivariate replacement policy (T,N) in which the system is replaced when either cumulative working time of Component 1 reaches T, or the number of failures of Component 1 reaches N, whichever occurs first. The problem is to determine the optimal replacement policy (T,N)* such that the long run average loss per unit time (or simply the average loss rate) of the system is minimized. An explicit expression of this rate is derived, and then optimal policy (T,N)* can be numerically determined through a two‐dimensional‐search procedure. A numerical example is given to illustrate the model's applicability and procedure, and to illustrate some properties of the optimal solution. We also show that if replacements are made solely on the basis of the number of failures N, or solely on the basis of the cumulative working time T, the former class of policies performs better than the latter, albeit only under some mild conditions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010