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

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

碳含量对Ti(CN)基金属陶瓷力学性能的影响

研究了Ti(CN)基金属陶瓷的碳含量对其物理力学性能的影响。结果表明 ,在一定范围内 ,随着碳含量的减少 ,Ti(CN)基金属陶瓷的矫顽磁力、钴磁和硬度降低 ;而抗弯强度则明显增高。     

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.     

The use of mindmapping software for patent search and management

Modern information technologies and in particular the internet have revolutionized the patent information professionals' work in terms of speed of access and information comprehensiveness from both company internal and external digital sources. Here, I describe how the digital mindmapping technique can be used to complement existing intellectual property management software solutions to meet the challenge of optimizing and managing patent search workflows as well as to rapidly organise and access highly dynamic, heterogeneous and scattered patent information sources. Both eye catching and highly memorable and at the same time self-explanatory mindmapping examples are presented. These were designed to include basic and advanced level digital mindmapping features tailored to significantly speed up and maintain a high work quality level of patent search professionals. A special emphasis is put on the great benefit of organising and accessing the plethora of internet-based worldwide online patent registers through mindmapping, both in terms of managing the constantly changing deep links to the actual search options for e.g., legal status information, and keeping track of the offered level of content.     

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.     

On delay-derivative-dependent stability of systems with fast-varying delays

Stability of linear systems with uncertain bounded time-varying delays is studied under the assumption that the nominal delay values are not equal to zero. An input-output approach to stability of such systems is known to be based on the bound of the L₂-norm of a certain integral operator. There exists a bound on this operator norm in two cases: in the case where the delay derivative is not greater than 1 and in the case without any constraints on the delay derivative. In the present note we fill the gap between the two cases by deriving a tight operator bound which is an increasing and continuous function of the delay derivative upper bound d?1. For d→∞ the new bound corresponds to the second case and improves the existing bound. As a result, for the first time, delay-derivative-dependent frequency domain and time domain stability criteria are derived for systems with the delay derivative greater than 1.     

Limitations of nonlinear discrete periodic control for disturbance attenuation and robust stabilization

This paper presents a performance analysis of nonlinear periodically time-varying discrete controllers acting upon a linear time-invariant discrete plant. Time-invariant controllers are distinguished from strictly periodically time-varying controllers. For a given nonlinear periodic controller, a time-invariant controller is constructed. Necessary and sufficient conditions are given under which the time-invariant controller gives strictly better control performance than the time-invariant controller from which it was obtained, for the attenuation of l_p exogenous disturbances and the robust stabilization of l_p unstructured perturbations, for all p[1,∞].