A practical assessment of risk-averse approaches in production lot-sizing problems

ABSTRACT

This paper presents an empirical assessment of four state-of-the-art risk-averse approaches to deal with the capacitated lot-sizing problem under stochastic demand. We analyse two mean-risk models based on the semideviation and on the conditional value-at-risk risk measures, and alternate first and second-order stochastic dominance approaches. The extensive computational experiments based on different instances characteristics and on a case-study suggest that CVaR exhibits a good trade-off between risk and performance, followed by the semideviation and first-order stochastic dominance approach. For all approaches, enforcing risk-aversion helps to reduce the cost-standard deviation substantially, which is usually accomplished via increasing production rates. Overall, we can say that very risk-averse decision-makers would be willing to pay an increased price to have a much less risky solution given by CVaR. In less risk-averse settings, though, semideviation and first-order stochastic dominance can be appealing alternatives to provide significantly more stable production planning costs with a marginal increase of the expected costs.     

教师修正性反馈对高职理科学生写作中冠词使用的影响

本研究检测了直接和间接两种修正性反馈与国内高职理科学生写作水平的关系。本实验持续五周,将150名学习者分为直接反馈组、间接反馈组及控制组,共安排了一次预先测试,,一次即时后测和一次延时后测,并分别对各组进行考察,结果显示两个实验组进步显著,且直接反馈效果最明显。     

Inverted pendulum stabilization: Characterization of codimension-three triple zero bifurcation via multiple delayed proportional gains

The paper considers the problem of stabilization of systems possessing a multiple zero eigenvalue at the origin. The controller that we propose, uses multiple delayed measurements instead of derivative terms. Doing so, we increase the performances of the closed loop in presence of system uncertainties and/or noisy measurements. The problem formulation and the analysis is presented through a classical engineering problem which is the stabilization of an inverted pendulum on a cart moving horizontally. On one hand, we perform a nonlinear analysis of the center dynamics described by a three dimensional system of ordinary differential equations with a codimension-three triple zero bifurcation. On the other hand, we present the complementary stability analysis of the corresponding linear time invariant system with two delays describing the behavior around the equilibrium. The aim of this analysis is to characterize the possible local bifurcations. Finally, the proposed control scheme is numerically illustrated and discussed.     

基于查询的新闻多文档自动摘要技术研究

针对新闻文本领域,该文提出一种基于查询的自动文本摘要技术,更加有针对性地满足用户信息需求。根据句子的TF-IDF、与查询句的相似度等要素,计算句子权重,并根据句子指示的时间给定不同的时序权重系数,使得最近发生的新闻内容具有更高的权重,最后使用最大边界相关的方法选择摘要句。通过与基于TF-IDF、Text-Rank、LDA等六种方法的对比,该摘要方法ROUGE评测指标上优于其他方法。从结合评测结果及摘要示例可以看出,该文提出的方法可以有效地从新闻文档集中摘取核心信息,满足用户查询内容的信息需求。     

某面板堆石坝沉降观测资料反馈分析

根据某面板堆石坝施工期、蓄水初期以及几年来的沉降观测资料，对坝体填筑材料计算参数进行反馈分析，得出了能够反映坝体实际变形的弹塑性应力变形计算参数，有利于今后建立大坝变形预报模型，更准确地把握大坝实时运行状态。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

Fast Positive Feedback Between the Adrenocortical Stress Response and a Brain Mechanism Involved in Aggressive Behavior.

Aggressive behavior induces an adrenocortical stress response, and sudden stressors often precipitate violent behavior. Experiments in rats revealed a fast, mutual, positive feedback between the adrenocortical stress response and a brain mechanism controlling aggression. Stimulation of the aggressive area in the hypothalamus rapidly activated the adrenocortical response, even in the absence of an opponent and fighting. Hypothalamic aggression, in turn, was rapidly facilitated by a corticosterone injection in rats in which the natural adrenocortical stress response was prevented by adrenalectomy. The rapidity of both effects points to a fast, mutual, positive feedback of the controlling mechanisms within the time frame of a single conflict. Such a mutual facilitation may contribute to the precipitation and escalation of violent behavior under stressful conditions. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

生存能力技术及其实现案例研究

生存能力技术谋求增强系统在面临攻击、失效等灾难情况下仍能继续提供服务的能力。本文提出了以多样化分布式动态备份技术和主动漂移机制为手段，以被保护目标的机动性和隐蔽性为目的的生存能力技术模型。提出了多样化体系理论及其实现案例，基于该理论设计并实现了自适应TOM方法。最后通过模拟和测试探讨了生存能力的评价方法，并验证了本文的结果。     

分布式无线传感器网络通信协议研究

在归纳分布式无线传感器网络研究进展的基础上，给出了综合分布式无线传感器网络技术各个方面的协议体系结构，并在新的体系结构下，系统地阐述了分布式无线传感器网络通信协议研究的进展，介绍了典型的应用案例和国外相关计划的研究情况。最后，指明了这一处于发展初期的研究领域的未来发展方向。     

Implementation of RNS-Based Distributed Arithmetic Discrete Wavelet Transform Architectures Using Field-Programmable Logic

Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength).