Linux虚拟文件系统层的路径检索加速

为解决 Linux 内核传统路径检索日益凸显的开销问题,提出Staged Lookup以加速路径检索,通过动态缓存热目录来减少文件访问的时延。Staged Lookup的核心在于缓存频繁使用的目录项,从而避免从根节点重复遍历路径。不同于从根结点开始的检索操作, Staged Lookup扩展了搜索策略,允许从最近缓存的目录项向后或向前进行路径检索。在Linux内核版本3.14和5.4上部署Staged Lookup的原型,并开展实际系统测试。实验数据显示,相比于传统的路径检索方式,Staged Lookup能实现高达46.9%的性能提升。     

当代大学生责任意识现状及其培育路径研究——基于北方民族大学的调查分析

责任意识不仅是内化的思想,也是外化的行为。其丰富内涵包括个人责任意识、家庭责任意识、社会责任意识和国家责任意识四个方面。在中国特色社会主义新时代,青年大学生生逢其时,又肩担重任。其责任意识强弱对于促进大学生成人成才、构建和谐文明家庭、达成社会主义教育目标、实现中华民族伟大复兴意义重大。根据对北方民族大学学生责任意识现状的实证调查,我们发现当前大学生责任意识状况总体上符合时代要求,但由于教育主体在大学生责任意识培育过程中不同程度、不同方面上的缺失和弱化,从而使得部分大学生责任意识状况令人忧心。因而,从系统论的角度出发,把大学生责任意识培育看作是一个长期的系统工程,从个人、家庭、学校和社会四个维度思考大学生责任意识培育的优化路径,就显得尤为必要。     

Signature based analysis of m‐Consecutive‐k‐out‐of‐n: F systems with exchangeable components

In this article, we study reliability properties of m‐consecutive‐k‐out‐of‐n: F systems with exchangeable components. We deduce exact formulae and recurrence relations for the signature of the system. Closed form expressions for the survival function and the lifetime distribution as a mixture of the distribution of order statistics are established as well. These representations facilitate the computation of several reliability characteristics of the system for a given exchangeable joint distribution or survival function. Finally, we provide signature‐based stochastic ordering results for the system's lifetime and investigate the IFR preservation property under the formulation of m‐consecutive‐k‐out‐of‐n: F systems. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Improving series and parallel systems through mixtures of duplicated dependent components

We discuss suitable conditions such that the lifetime of a series or of a parallel system formed by two components having nonindependent lifetimes may be stochastically improved by replacing the lifetimes of each of the components by an independent mixture of the individual components' lifetimes. We also characterize the classes of bivariate distributions where this phenomenon arises through a new weak dependence notion. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

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     

Annealing adaptive search,cross‐entropy,and stochastic approximation in global optimization

The Annealing Adaptive Search (AAS) algorithm for global optimization searches the solution space by sampling from a sequence of Boltzmann distributions. For a class of optimization problems, it has been shown that the complexity of AAS increases at most linearly in the problem dimension. However, despite its desirable property, sampling from a Boltzmann distribution at each iteration of the algorithm remains a practical challenge. Prior work to address this issue has focused on embedding Markov chain‐based sampling techniques within the AAS framework. In this article, based on ideas from the recent Cross‐Entropy method and Model Reference Adaptive Search, we propose an algorithm, called Model‐based Annealing Random Search (MARS), that complements prior work by sampling solutions from a sequence of surrogate distributions that iteratively approximate the target Boltzmann distributions. We establish a novel connection between MARS and the well‐known Stochastic Approximation method. By exploiting this connection, we prove the global convergence of MARS and characterize its asymptotic convergence rate behavior. Our empirical results indicate promising performance of the algorithm in comparison with some of the existing methods. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

多波长主动式相干合成中光程差对合成效果的影响

为了对多波长激光主动式相干合成做出初步的理论描述,揭示影响合成效果的关键因素,根据相干合成的基本原理,建立了计算模型.并以9波长7路相干合成系统为实例,仿真计算了光程差取不同值的情况下,各频率成分的合成效果和总体合成效果.当各路间存在较大的光程差时,只有中心频率成分实现了相干相长,其他频率成分处于"混乱"状态,总体合成...     

公安现役院校研究生管理路径刍议

公安现役院校研究生的管理工作与普通高校研究生和公安现役院校本科生的管理工作相比存在显著差异,准确定位公安现役院校研究生的特点,深入分析影响研究生有效管理的主要因素,积极探索研究生管理工作的有效路径,成为公安现役院校研究生管理工作科学化、正规化的重要突破口,对研究生培养质量和层次的提升有重要的现实意义。     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Impact of transfer pricing methods for tax purposes on supply chain performance under demand uncertainty

Transfer pricing refers to the pricing of an intermediate product or service within a firm. This product or service is transferred between two divisions of the firm. Thus, transfer pricing is closely related to the allocation of profits in a supply chain. Motivated by the significant impact of transfer pricing methods for tax purposes on operational decisions and the corresponding profits of a supply chain, in this article, we study a decentralized supply chain of a multinational firm consisting of two divisions: a manufacturing division and a retail division. These two divisions are located in different countries under demand uncertainty. The retail division orders an intermediate product from the upstream manufacturing division and sets the retail price under random customer demand. The manufacturing division accepts or rejects the retail division's order. We specifically consider two commonly used transfer pricing methods for tax purposes: the cost‐plus method and the resale‐price method. We compare the supply chain profits under these two methods. Based on the newsvendor framework, our analysis shows that the cost‐plus method tends to allocate a higher percentage of profit to the retail division, whereas the resale‐price method tends to achieve a higher firm‐wide profit. However, as the variability of demand increases, our numerical study suggests that the firm‐wide and divisional profits tend to be higher under the cost‐plus method than they are under the resale‐price method. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013