动态多目标决策问题的灰色分析方法

将用于固定时间截面下静态多目标决策的灰色关联理论推广到动态情形，引入局部理想最优效果和整体理想最优效果的概念，提出一种新型的动态多目标决策问题的灰色关联模型，并通过算例说明该方法的合理可行性。     

TCP/IP网络的动态模型描述

拥塞现象成为TCP/IP网络发展面临的一个重要问题。因此，拥塞控制对TCP/IP网络的鲁棒性和稳定性具有重要作用。目前，网络拥塞控制策略主要包括两类：端到端的控制机制，如TCP拥塞控制算法；网络内部的主动队列管理(AQM)策略。但由于缺乏对网络系统动态特性的了解，这些拥塞控制策略大都基于专家经验，并没有建立完整的理论分析框架。为此，本文从数据流的角度出发，通过建立网络基本单元状态方程模型来实现IP网络系统的数学解析模型，然后用混杂系统来描述TCP带有拥塞控制策略的数据传输过程，建立了TCP/IP网络的动态模型，为网络系统中动态性能的分析、拥塞控制策略的设计奠定了基础。实验结果表明，该数学模型与NS仿真实验的结果相一致。     

Evaluating dynamic performance: The influence of salient Gestalt characteristics on performance ratings.

It is well recognized that performance changes over time. However, the effect of these changes on overall assessments of performance is largely unknown. In a laboratory experiment, we examined the influence of salient Gestalt characteristics of a dynamic performance profile on supervisory ratings. We manipulated performance trend (flat, linear-improving, linear-deteriorating, U-shaped, and ∩-shaped), performance variation (small, large), and performance mean (negative, zero, positive) within subjects and display format (graphic, tabular) between subjects. Participants received and evaluated information about the weekly performance of different employees over a simulated 26-week period. Results showed strong main effects on performance ratings of both performance mean and performance trend, as well as interactions with display format. Theoretical and practical implications of the results are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Adaptive Edge Detectors for Piecewise Smooth Data Based on the minmod Limiter

We are concerned with the detection of edges—the location and amplitudes of jump discontinuities of piecewise smooth data realized in terms of its discrete grid values. We discuss the interplay between two approaches. One approach, realized in the physical space, is based on local differences and is typically limited to low-order of accuracy. An alternative approach developed in our previous work [Gelb and Tadmor, Appl. Comp. Harmonic Anal., 7, 101–135 (1999)] and realized in the dual Fourier space, is based on concentration factors; with a proper choice of concentration factors one can achieve higher-orders—in fact in [Gelb and Tadmor, SIAM J. Numer. Anal., 38, 1389–1408 (2001)] we constructed exponentially accurate edge detectors. Since the stencil of these highly-accurate detectors is global, an outside threshold parameter is required to avoid oscillations in the immediate neighborhood of discontinuities. In this paper we introduce an adaptive edge detection procedure based on a cross-breading between the local and global detectors. This is achieved by using the minmod limiter to suppress spurious oscillations near discontinuities while retaining high-order accuracy away from the jumps. The resulting method provides a family of robust, parameter-free edge-detectors for piecewise smooth data. We conclude with a series of one- and two-dimensional simulations.To David Gottlieb, on his 60th birthday, with friendship and appreciation.     

Aspects of rapid crack propagation in silicon

Fracture experiments with silicon specimens in recent years have shown the need for a new approach to the analysis of rapidly propagating cracks in single crystals. Behaviour and phenomena have been revealed that fracture in these materials is rather different from the fracture of both amorphous and polycrystalline materials. We show that continuum mechanics is insufficient for analyzing crack propagation in single crystals since it is unable to consider atomistic‐scale phenomena. Accordingly, we describe basic phenomena associated with rapid crack propagation in silicon : (i) anisotropic velocity‐dependent R‐curve behaviour, as a key phenomenon dictating atomistic scale behaviour, (ii) crack deflection from one cleavage plane to another as a mesoscopic scale phenomenon in single‐crystal fracture, (iii) the Rayleigh surface wave speed as the limiting crack tip velocity is re‐examined, (vi) the lowest crack velocity in brittle crystals is examined, and finally (v) the interaction between crack path and preferred cleavage planes in single crystals is depicted.     

基于Delphi的报童模型的实现与动态仿真

已往库存论中的决策模型,它是把现实过程用数学的方法进行分析,得到决策值,但不能看到决策的过程,不能反映出现实生活中的不确定性、动态性。运用Delphi 7.0和SQL server 2000对销售过程进行了动态仿真,利用Newsboy模型的推广(S,s)订购策略来监控库存并做出决策,这样就体现出此过程的不确定性、动态性;且举出了一个仿真商品销售的实例,对其中的一些关键技术,如何仿真、算法的实现等进行了阐述。     

EM procedures using mean field-like approximations for Markov model-based image segmentation

Image segmentation using Markov random fields involves parameter estimation in hidden Markov models for which the EM algorithm is widely used. In practice, difficulties arise due to the dependence structure in the models and approximations are required. Using ideas from the mean field approximation principle, we propose a class of EM-like algorithms in which the computation reduces to dealing with systems of independent variables. Within this class, the simulated field algorithm is a new stochastic algorithm which appears to be the most promising for its good performance and speed, on synthetic and real image experiments.     

Active set truncated-Newton algorithm for simultaneous optimization of distillation column

An active set truncated-Newton algorithm (ASTNA) is proposed to solve the large-scale bound constrained sub-problems. The global convergence of the algorithm is obtained and two groups of numerical experiments are made for the various large-scale problems of varying size. The comparison results between ASTNA and the subspace limited memory quasi-Newton algorithm and between the modified augmented Lagrange multiplier methods combined with ASTNA and the modified barrier function method show the stability and effectiveness of ASTNA for simultaneous optimization of distillation column.     

神经网络分类器的快速构造算法

使用ＢＰ算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法，先构造决策树，然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长，它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果，本文的算法比用ＢＰ算法训练多层网络要快，而其分类精度不低于用ＢＰ算法训练的多层神经网。