基于ADSP21XXC运行环境下FFT的实现

介绍了数字信号处理器ADSP21XX芯片的特点以及实现FFT(快速离散付里叶变换)的方法，给出了ADSP21XX的C和汇编混合编程的特点及技巧。     

Flood Inundation Modelling for Mid‐Lower Brisbane Estuary

This study utilizes a two‐dimensional hydrodynamic model to calibrate and validate an inundation model for the Brisbane River estuary in Queensland, Australia. The bathymetry data used in the hydraulic model are derived from one arc second (1 s) shuttle radar topography mission digital elevation model, and the two‐dimensional hydraulic model is parameterized using the generated bathymetry with four open boundaries with water level observations and roughness coefficients. The calibration performance is evaluated by comparing the simulated results with the digitized records during the January 2013 flood event (a low magnitude event) at three gauging stations. The calibrated model is validated with water level data and available discharge data during the January 2011 flood (a large magnitude event) at four gauging stations located along the Brisbane River. Different performance indices are applied to demonstrate that the developed model performs well during calibration and validation. A sensitivity analysis is presented to assess the influence of riverbed elevation changes on the model because the main uncertainty of the model is the bathymetry data. The proposed model with the shuttle radar topography mission digital elevation model‐derived riverbed elevation for the Brisbane estuary is able to predict the flood inundation extent at an accuracy of 66.9% which is higher than or comparable with the accuracies of the existing studies. However, it is expected that the accuracy will increase if some improved bathymetry data become available in the future. Copyright © 2016 John Wiley & Sons, Ltd.     

西控工程对望虞河西岸地区防洪的影响

为了评估西控工程对望虞河西岸地区造成的防洪影响,以望虞河西岸为研究区域并结合其水文特性,构建了适合于模拟平原河网地区产汇流过程的MIKE11水文水力模型并利用当地降雨、水位等实测资料进行了率定。通过模拟50年一遇设计暴雨情况下的不同工况,得到研究区域内水系各节点的水位等要素变化情况,并依此分析了西控工程对望虞河西岸地区造成的防洪影响。结果表明:西控工程运行后,研究区域内重要节点的最高水位抬升明显,部分地区有遭受洪水淹没的风险;MIKE11水文水力模型对于分析平原河网地区河流沿线闸控影响具有较高的应用价值。     

新型TC21钛合金热处理工艺参数与显微组织演变的关系研究

TC21钛合金是新型的高强韧损伤容限型钛合金，其模锻件为网篮组织，锻后热处理工艺采用双重退火工艺。本研究采用金相法、SEM等方法系统研究了TC21钛合金模锻件的锻后热处理工艺和显微组织演变规律。试验分析了TC21钛合金模锻件锻后第1次退火加热温度、第2次退火加热温度和保温时间等工艺参数条件下的初生α相数量、形状以及网篮组织形貌特征的变化规律，为TC21钛合金模锻件获得高强、高韧和损伤容限优良综合性能奠定基础。     

茜坑水库溃坝洪水数值模拟研究

研究应用M IKE21模块建立茜坑水库溃坝洪水演进数学模型,模拟洪水演进过程。从最不利因素考虑,确定坝址处溃坝最大流量、洪水下游演进过程和下游淹没水深,为制定水库大坝安全管理应急预案提供技术支撑。     

A bilevel mixed-integer program for critical infrastructure protection planning

Vulnerability to sudden service disruptions due to deliberate sabotage and terrorist attacks is one of the major threats of today. In this paper, we present a bilevel formulation of the r-interdiction median problem with fortification (RIMF). RIMF identifies the most cost-effective way of allocating protective resources among the facilities of an existing but vulnerable system so that the impact of the most disruptive attack to r unprotected facilities is minimized. The model is based upon the classical p-median location model and assumes that the efficiency of the system is measured in terms of accessibility or service provision costs. In the bilevel formulation, the top level problem involves the decisions about which facilities to fortify in order to minimize the worst-case efficiency reduction due to the loss of unprotected facilities. Worst-case scenario losses are modeled in the lower-level interdiction problem. We solve the bilevel problem through an implicit enumeration (IE) algorithm, which relies on the efficient solution of the lower-level interdiction problem. Extensive computational results are reported, including comparisons with earlier results obtained by a single-level approach to the problem.     

Controller synthesis with guaranteed closed-loop phase constraints

In this paper, we present an analysis and synthesis approach for guaranteeing that the phase of a single-input, single-output closed-loop transfer function is contained in the interval [−α,α] for a given α>0 at all frequencies. Specifically, we first derive a sufficient condition involving a frequency domain inequality for guaranteeing a given phase constraint. Next, we use the Kalman–Yakubovich–Popov theorem to derive an equivalent time domain condition. In the case where , we show that frequency and time domain sufficient conditions specialize to the positivity theorem. Furthermore, using linear matrix inequalities, we develop a controller synthesis approach for guaranteeing a phase constraint on the closed-loop transfer function. Finally, we extend this synthesis approach to address mixed gain and phase constraints on the closed-loop transfer function.     

Isochoric p-ρ-T Measurements on 1,1-Difluoroethane (R152a) from 158 to 400 K and 1,1,1-Trifluoroethane (R143a) from 166 to 400 K at Pressures to 35 MPa

The p--T relationships have been measured for 1,1-difluoroethane (R152a) and 1,1,1-trifluoroethane (R143a) by an isochoric method with gravimetric determinations of the amount of substance. Temperatures ranged from 158 to 400 K for R152a and from 166 to 400 K for R143a, while pressures were up to 35 MPa. Measurements were conducted on compressed liquid samples. Determinations of saturated liquid densities were made by extrapolating each isochore to the vapor pressure, and determining the temperature and density at the intersection. Published p--T data are in good agreement with this study. For the p--T apparatus, the uncertainty of the temperature is ±0.03 K, and for pressure it is ±0.01% at p>3 MPa and ±0.05% at p<3 MPa. The principal source of uncertainty is the cell volume (28.5 cm³), which has a standard uncertainty of ±0.003 cm³. When all components of experimental uncertainty are considered, the expanded relative uncertainty (with a coverage factor k=2 and thus a two-standard deviation estimate) of the density measurements is estimated to be ±0.05%.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

Input-output properties of the Page-Hinkley detector

We consider the stochastic input-output properties of a simple non-linear dynamical system, the so-called Page-Hinkley detector, playing a key role in change detection, and also in queuing theory. We show that for L-mixing inputs with negative expectation the output process of this system is L-mixing. The result is applied to get an upper bound for the false alarm rate. The proof is then adapted to get a similar result for the case of random i.i.d. inputs. Possible extensions and open problems are given in the discussion.