切实提高基层党员培训质量

解决当前基层党员队伍中存在的三个突出问题,必须切实提高基层党员培训质量。各级党委、支部要站在党对军队绝对领导、履行职责使命、建设现代化武警的高度,坚持以锤炼坚强党性为根本,永葆基层党员的先进性;以提高党务能力为重点,增强党员培训的针对性;以发挥模范作用为目标,调动履职尽责的积极性。     

对特殊类型Feistel密码的Square攻击

对轮函数为SP结构的两类特殊类型Feistel密码抗Square攻击的能力进行了研究。通过改变轮函数中P置换的位置从而给出了此类Feistel密码的等价结构,以SNAKE(2)和CLEFIA为例,给出了基于等价结构Square攻击的具体过程,将6轮SNAKE(2)的Square攻击的时间复杂度由224降为213.4;将6轮CLEFIA的Square攻击的时间复杂度由234.4降为212.4。结果表明,在设计轮函数为SP结构的Feistel密码时,必须充分考虑等价结构对算法抗Square攻击的影响。     

基于任务和角色的工作流系统权限控制

工作流系统权限管理的权限控制是工作流的重要因素.对传统的访问控制权限进行改进,在基于角色和任务的工作流权限管理系统中将任务与组织、时间进行关联,并使用Petri网来对工作流进行建模,在工作流推进的不同时段,采用不同的存取权限表来实现权限控制,为工作流的权限管理提出一种新的思路.     

Supply chain coordination with product line design and a revenue sharing scheme

Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it.     

Optimal allocation of minimal repairs in parallel and series systems

In reliability engineering, the concept of minimal repair describes that the repair brings the failed unit (eg, system or component) to the situation which is same as it was just before the failure. With the help of the well‐known Gamma‐Poisson relationship, this paper investigates optimal allocation strategies of minimal repairs for parallel and series systems through implementing stochastic comparisons of various allocation policies in terms of the hazard rate, the reversed hazard rate, and the likelihood ratio orderings. Numerical examples are presented to illustrate these findings as well. These results not only strengthen and generalize some known ones in the seminal work of Shaked and Shanthikumar, but also solve the open problems proposed by Chahkandi et al.'s study and Arriaza et al.'s study.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

感应式磁性天线设计及干扰抑制算法研究

当期望信号和干扰同方向时,为了有效改善超低频频段的通信质量,提出了一种基于模拟电路预处理和改进广义旁瓣抵消的干扰抑制算法,设计了磁性天线、低噪声前置放大电路,制作了灵敏度较高的磁传感器,有效地抑制了工频及其谐波干扰。鉴于超低频频段的信号十分微弱,在广义旁瓣抵消算法的基础上做了几点改进,为主通道提供较多的参考信息,从而提高了算法的性能,有效地解决了传统算法失效的问题。为了验证所提算法的有效性,在实验室环境下搭建实验平台,设计了多组对照实验,实验结果表明:无论期望信号与干扰是否同方向,改进后的广义旁瓣抵消算法相比原来的算法,在信噪比的提升和噪声底限的降低等方面均有较大程度的改善。     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

一种改进的事件驱动系统框架

在给出事件驱动系统安全漏洞的基础上,指出了产生漏洞的根本原因是:系统忽视了输入系统的事件序列之间存在的相关性;系统无条件信任任何事件源产生的事件.针对这两个原因,相应提出了事件序列形式安全分析模型及基于事件源的可信度评估模型,依据这两个模型,构建了一种改进的事件驱动系统框架.