藏区地基换填戈壁土处理的经济适用性评价

藏区地基处理中如果能采用戈壁土作为换填材料,可以较好的解决该地区地基加固费用高的问题。结合某新建工程,对换填戈壁土方法进行经济适用性评价,结果表明该方法经济合理,可以推广应用。     

新疆生产建设兵团哈汉民族关系解读

新疆生产建设兵团在促进边疆社会发展和维护稳定方面发挥了十分重要的作用。兵团和谐的民族关系是兵团进一步发挥屯垦戍边历史作用的保证,通过对农八师哈萨克族与汉族杂居区的民族关系现状和传统风俗习惯的变迁对民族关系的影响的解读,进而进行经济学角度的分析,有利于我们把握兵团民族关系发展的规律。     

建设社会主义核心价值体系大力弘扬时代精神

社会主义核心价值体系是社会主义意识形态的本质体现。马克思主义指导思想是社会主义核心价值体系的旗帜与灵魂。社会主义核心价值体系是中国共产党领导人民建设中国特色社会主义的共同价值追求;以爱国主义为核心的民族精神和以改革创新为核心的时代精神是社会主义核心价值体系的精髓;弘扬以改革创新为核心的时代精神是建设社会主义核心价值体系的根本途径;大力弘扬以改革创新为核心的时代精神是实现中华民族伟大复兴的强大动力。     

Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines

We study the assignment of flexible servers to stations in tandem lines with service times that are not necessarily exponentially distributed. Our goal is to achieve optimal or near‐optimal throughput. For systems with infinite buffers, it is already known that the effective assignment of flexible servers is robust to the service time distributions. We provide analytical results for small systems and numerical results for larger systems that support the same conclusion for tandem lines with finite buffers. In the process, we propose server assignment heuristics that perform well for systems with different service time distributions. Our research suggests that policies known to be optimal or near‐optimal for Markovian systems are also likely to be effective when used to assign servers to tasks in non‐Markovian systems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Analytic solution for the nucleolus of a three‐player cooperative game

The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Supply chain coordination with shelf‐space and retail price dependent demand and heterogeneous retailers

We consider supply chain coordination in which a manufacturer supplies some product to multiple heterogeneous retailers and wishes to coordinate the supply chain via wholesale price and holding cost subsidy. The retail price is either exogenous or endogenous. The market demand is described by the market share attraction model based on all retailers'shelf‐spaces and retail prices. We obtain optimal solutions for the centralized supply chain, where the optimal retail pricing is a modified version of the well‐known cost plus pricing strategy. We further get feasible contracts for the manufacturer to coordinate the hybrid and decentralized supply chains. The manufacturer can allocate the total profit free to himself and the retail market via the wholesale price when the retail price is exogenous, but otherwise he cannot. Finally, we point out that different characteristics of the retail market are due to different powers of the manufacturer, and the more power the manufacturer has, the simpler the contract to coordinate the chain will be. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

FMEA与粗糙集相结合的故障预测方法

基于FMEA和粗糙集决策系统基本理论,对飞机中分系统故障预测问题进行了研究。首先定义故障预测所需的征兆并对系统进行FMEA,按照FMEA分析结果分次向系统模型注入引起特定故障的事件,采集含有故障趋势的系统模型的信息用于构建适用于故障预测的粗糙集决策表,对该表进行了处理,最终发现用于故障预测的知识(即决策规则和算法);最后运用所发现的知识进行故障预测。     

基于LVDS的高速远程实时测控系统的设计

分析了LVDS在远程测控系统应用中的关键技术,介绍了基于LVDS的高速远程传输方式的设计方案。针对设计中的关键性问题,如电磁干扰、阻抗匹配、直流平衡以及信号驱动等问题提出了具体的解决方案,并给出了电路设计中阻抗匹配设计的线宽计算公式。最后结合实验分析了具体设计对于信号质量的影响。     

一种时频混叠的欠定混合通信信号盲分离算法

针对衰减-延迟欠定混合通信信号的盲分离问题,提出了一种基于子空间最小距离的源信号估计算法,通过计算观测信号到混合矩阵列矢量张成子空间的距离,估计任意时频点同时存在的源信号数目以及当前源信号对应的混合矩阵列矢量,把欠定混合问题转化为超定问题,然后通过计算Moore-Penrose逆矩阵求解源信号,理论分析和仿真结果验证了算法的有效性。