两个DEA的逆问题的解法的探讨

文[1]提出了两个DEA的逆问题，并用搜索法来解．而本文根据所证的定理，对每个问题一般只要解二、三个线性规划问题就能得到答案．     

使用非单调技术的不精确预条件牛顿类方法解非线性方程组

本文提供了预条件不精确牛顿型方法结合非单调技术解光滑的非线性方程组．在合理的条件下证明了算法的整体收敛性．进一步，基于预条件收敛的性质，获得了算法的局部收敛速率，并指出如何选择势序列保证预条件不精确牛顿型的算法局部超线性收敛速率．     

Multiple Polarization Encoding for Gray Image Encryption Based on Liquid Crystal Exclusive OR Logic

This work proposes and demonstrates the feasibility of gray image encryption using multiple polarization encoding, in which the cascaded twisted nematic liquid crystal devices sandwiched between a crossed polarizer pair are used to implement exclusive OR (XOR) logical encryption and decryption. The polarization encoding scheme provides a multichannel XOR logic operation to secure bit-plane images derived from a gray image, according to the adiabatic following properties of twisted nematic liquid crystal devices. Experimental data reveal that the multiple polarization encoding schemes for gray image encryption and decryption are performed with acceptable image quality by selecting appropriate polarization orientation and modulation conditions. Both analytic and experimental results are presented and discussed.     

带有单模糊映射的一般变分不等式解的存在性

众所周知，在各种变分不等式问题中，解的存在性是最基础也是最重要的问题之一．本文的目的是在Hilbert空间中研究带有单模糊映射的一般变分不等式解的存在性．此外，还讨论了几种特殊情况．     

最大2-正则诱导子图的长度

设G是2-连通图，c(G)是图G的最长诱导圈的长度，c′(G)是图G的最长诱导2-正则子图的长度。本文我们用图的特征值给出了c(G)和c′(G)的几个上界。     

共轭下降法的全局收敛性

本文提出了一种Armijo型的线搜索，并在这种线搜索下讨论了共轭下降法的全局收敛性，且可得方法在每次迭代均产生一个下降搜索方向．     

关于图的直径和平均距离

图的直径和平均距离是度量网络有效性的两个重要参数．Ore通过图的顶点数和直径给出无向图的最大边数．Entringer，Jakson，Slater和Ng，Teh通过图的顶点数和边数分别给出无向图和有向图平均距离的下界．该文提供这两个结果的简单证明，给出有向图类似Ore的结果，并通过图的直径改进Entringer等人的结果到更一般的情形．结合本文和Ore的结果，可以得到一个无向图和有向图平均距离的下界，它比Plesnik得到的下界更好．     

具有位相型修理的离散时间可修排队系统

本文研究了具有一般独立输入，位相型修理的离散时间可修排队系统，假定服务台对顾客的服务时间和服务台寿命服从几何分布，运用矩阵解析方法我们给出系统嵌入在到达时刻的稳态队长分布和等待时间分布，并证明这些分布均为离散位相型分布．我们也得到在广义服务时间内服务台发生故障次数的分布，证明它服从一个修正的几何分布．我们对离散时间可修排队与连续时间可修排队进行了比较，说明这两种排队系统在一些性能指标方面的区别之处．最后我们通过一些数值例子说明在这类系统中顾客的到达过程、服务时间和服务台的故障率之间的关系．     

Decentralized operation strategies for an integrated building energy system using a memetic algorithm

The emerging technology in net-zero building and smart grids drives research moving from centralized operation decisions on a single building to decentralized decisions on a group of buildings, termed a building cluster which shares energy resources locally and globally. However, current research has focused on developing an accurate simulation of single building energy usage which limits its application to building clusters as scenarios such as energy sharing and competition cannot be modeled and studied. We hypothesize that the study of energy usage for a group of buildings instead of one single building will result in a cost effective building system which in turn will be resilient to power disruption. To this end, this paper develops a decision model based on a building cluster simulator with each building modeled by energy consumption, storage and generation sub modules. Assuming each building is interested in minimizing its energy cost, a bi-level operation decision framework based on a memetic algorithm is proposed to study the tradeoff in energy usage among the group of buildings. Two additional metrics, measuring the comfort level and the degree of dependencies on the power grid are introduced for the analysis. The experimental result demonstrates that the proposed framework is capable of deriving the Pareto solutions for the building cluster in a decentralized manner. The Pareto solutions not only enable multiple dimensional tradeoff analysis, but also provide valuable insight for determining pricing mechanisms and power grid capacity.     

How do we know who to include in collaborative research? Toward a method for the identification of experts

Collaborative research, defined as research involving actors participating in the problem situation under study, has an important role in operational research, strategic management and systems thinking. In a recent study, we found that a strong organizational focus incorporated into many soft operational research (OR) approaches is inadequate for studying societal problem situations, which are fragmented and have no clear boundary. Specifically, we failed to find a process of identifying individuals that is capable of representing the perspectives of actors and sufficient for research into societal problem situations. We found no clear terminology accounting for ontological differences between actors, individuals representing them and conceptual representations of acting entities. In response to this gap in the literature, we propose terminology that differentiates among actors (individuals or collective entities in the real world), experts (individuals capable of representing the perspective of an actor) and agents (ideal-typical representations of actors). Based on this terminology, we propose an iterative method to guide the assembly of an expert group to undertake collaborative research into societal problem situations. To demonstrate the application of our method, we present selected insights from our study in an electronic supplement.