Research communication security in the 90s: A view from the UK

This paper develops a methodology for measuring the capital value of military assets in monetary terms. We distinguish between two military capital measures. One measure, called the value of military capital (services) summarizes the value of military defense assets during a particular year. A comparison of the capital‐services value of U.S. and Soviet tactical combat aircraft is provided for the period 1970–1984.

One feature of the capital‐services measure that makes it particularly interesting is that its size can be compared with such military expenditures as operating and support. While these latter expenditures reflect the readiness of a defense establishment, the relevant capital‐services measure reflects force structure and modernization.

A second measure, called the value of military capital (wealth), summarizes the military benefits obtained from defense assets over the remainder of their service lives. This measure depreciates the capital as it ages, and is useful for comparing military wealth with other types of wealth in the economy. We provide this measure for the U.S. military capital stock for 1925–1984.     

minimax问题的广义共轭向量法

本文按照共轭向量法的理论,针对非奇异对称矩阵提出了广义共轭向量的概念,并论述了它的三个重要性质(线性独立性、可寻驻点和可扩展性)。在此基础上,构造了极小极大(minimax)问题的广义共轭向量法。理论分析表明,该算法具有二次终止性质,且在每一维搜索时具有确定的寻优特征(求极小或求极大)。该算法为用拉格朗日乘子法求解数学规划提供了一个可能的途径。计算实例表明该算法是有效的。     

中国当代社会转型探析

中国当代的社会转型 ,决不是笼统地从“传统社会”转向“现代社会” ,而是从初级阶段的社会主义向发达社会主义的转型。这样定位 ,有着充分的理论根据 ,其中最重要的就是我国在转型目标和价值取向、转型道路、途径和方法以及转型所处时代背景和国际环境等方面 ,都有自己的特殊性。只有这样认识我国的社会转型 ,才能与“西化”划清界限     

浅析经济原则在网络语言中的应用

随着网络技术的发展,网络语言作为一种新的语言媒体和社会方言,越来越得到人们的重视。在不同的学术领域,专家对网络语言作出不同的诠释和研究。主要从构词、句法、非语言符号三个角度来分析经济原则在网络语言中的普遍使用,并从聊天室中收集、归纳、分析相关语料来证明经济原则的存在,及在网络空间中普遍使用的原因。对网络语言的深入研究,将更有助于人们了解语言在以高科技为背景条件下发展趋势。当网络语言冲击传统语言时,要树立正确的态度面对语言的发展。     

舰船成本预测系统中的自变量约简方法

针对舰船成本预测系统中自变量众多且相互关系错综复杂的特点,提出了用模糊粗糙集方法对舰船成本预测系统中的自变量进行约简。在模糊粗糙集方法的框架下,给出了模糊不可分辨关系和相对约简的定义,构建了基于模糊粗糙集的舰船成本预测系统自变量约简模型,并且针对实际的舰船成本预测系统一般是混合数据系统的问题,对广义差别矩阵的定义进行了改进,设计了相应的启发式约简算法。实例分析结果表明:文中所提的方法不仅能使约简的自变量大为减少,而且约简的效果较传统方法更好,且计算过程也更简单。     

通用军械装备维修备件合同商保障方式研究

提出了备件合同商保障的概念,给出了备件合同商保障内容和维度,分析了备件合同商保障的特征,着重从备件的存储方式和供应方式两个方面进行了定性分析,为实施备件合同商保障奠定了理论基础．     

基于本体的上下文建模与应用研究

为了在开放、动态的环境中建立上下文感知系统,首先需要定义一个适合于知识共享的上下文描述,即上下文建模．提出了一种基于本体的通用上下文模型,由顶层上下文本体和6种特定本体构成．结合2008年汶川地震救援应用本体,描述了应用本体与通用上下文模型之间的关系．最后结合Web服务技术,提出了上下文感知的Web服务发现方法,对上下文感知计算的应用作了初步探索．     

当代社会剩余价值分配理论探析

传统的剩余价值分配理论认为,雇佣劳动者创造的全部剩余价值被资产阶级所独占,这符合资本主义发展初期的客观实际。伴随社会生产力的不断发展,当代社会剩余价值的分配发生了新的变化。雇佣劳动者创造的剩余价值不再被资本所有者所独占,而是以不同的方式被投入各种要素的不同所有者以不同的方式所拥有。     

构建和谐社会与青少年犯罪预防

当前我国正处于改革开放的关键时期。由于社会转型,社会矛盾突出,各种不良现象滋生,犯罪问题日益严重,尤其是青少年犯罪已达到令人堪忧的地步,与构建社会主义和谐社会极不相称。就社会转型时期青少年犯罪的特点、原因进行深入分析,并提出了在构建和谐社会重要理论指导下青少年犯罪的预防对策。     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004