Global Dynamics of Some Periodically Forced,Monotone Difference Equations ∗

We study a class of periodically forced, monotone difference equations motivated by applications from population dynamics. We give conditions under which there exists a globally attracting cycle and conditions under which the attracting cycle is attenuant     

Embedding long cycles in faulty k-ary 2-cubes

The class of k-ary n-cubes represents the most commonly used interconnection topology for distributed-memory parallel systems. Given an even k ? 4, let (V₁, V₂) be the bipartition of the k-ary 2-cube, f_v1, f_v2 be the numbers of faulty vertices in V₁ and V₂, respectively, and f_e be the number of faulty edges. In this paper, we prove that there exists a cycle of length k² − 2max{f_v1, f_v2} in the k-ary 2-cube with 0 ? f_v1 + f_v2 + f_e ? 2. This result is optimal with respect to the number of faults tolerated.     

Variable neighbourhood structures for cycle location problems

Variable neighbourhood search is a metaheuristic used mainly to tackle combinatorial optimization problems. Its performance depends on having a good variable neighbourhood structure: that is, a sequence of neighbourhoods that are ideally pairwise disjoint and contain feasible solutions further and further from a given feasible solution. This article defines a variable neighbourhood structure with these properties that is new for cycle location problems. It find bounds for the neighbourhood sizes and shows how to iterate over then when the cycle is a circuit. It tests the structure and iteration method using variable neighbourhood search on a range of median cycle problems and finds a neighbourhood size beyond which there is, on average, no benefit in applying local search. This neighbourhood size is found not to depend on problem size or bound on circuit length.     

The Ramsey numbers for cycles versus wheels of odd order

For two given graphs G₁ and G₂, the Ramsey number R(G₁,G₂) is the smallest integer n such that for any graph G of order n, either G contains G₁ or the complement of G contains G₂. Let C_n denote a cycle of order n and W_m a wheel of order m+1. It is conjectured by Surahmat, E.T. Baskoro and I. Tomescu that R(C_n,W_m)=2n−1 for even m≥4, n≥m and (n,m)≠(4,4). In this paper, we confirm the conjecture for n≥3m/2+1.     

A look at cycles containing specified elements of a graph

This article is intended as a brief survey of problems and results dealing with cycles containing specified elements of a graph. It is hoped that this will help researchers in the area to identify problems and areas of concentration.     

利用天然气冷量的朗肯循环发电流程的工艺模拟

高压天然气集输过程中节流会使天然气温度有明显的下降,提出了分别采用丙烷和混合工质的朗肯循环回收天然气的冷量进行发电。采用HYSYS软件对两种工艺分别进行了工艺模拟,结果表明采用混合工质时由于冷热流体间换热温差明显减小,因而循环效率提高了约40%。在夏季当天然气输量为55×104Nm2/d时,可以产生48.42kW的功率,冷能有效能的利用效率约为23.06%。     

基于小波-Contourlet变换的Cycle spinning硬阈值图像去噪方法

综合考虑小波变换的特点以及Contourlet变换对二维光滑图像有很好的近似特性和对曲线有更好的"稀疏"表示的特点,提出了一种基于小波-Contorlet变换的图像硬阈值去噪方法,并用Cycle spinning去除图像中小波-Con- tourlet变换平移变异性而产生的伪吉布斯现象。实验结果表明:该方法与采用Cycle spinning的小波和Contourlet去嗓算法相比,PSNR分别提高了0.4～1.6和0.2～1.0。与其它去噪算法相比,这种方法能有效地去除图像中的噪声,具有更高的PSNR值,能更好地保留图像的纹理和细节。     

Mass and energy flow management in the sector of surface treatment

Vehicle refinishing body shops are concerned by the environmental policy against photochemical air pollution caused by VOC emissions. For supporting these small enterprises the mass and energy flow model IMPROVE has been developed. Based on an LCA-approach, the process steps of vehicle refinishing are modelled. The model IMPROVE helps to disseminate the consequences of product substitution in comparison to so far used products and techniques in the body shop. For the dissemination of experiences practical guidelines have been developed. Moreover, a comprehensible tool for the Solvent Balance is being offered. Thus, various means are available for consulting and also for strategic production planning for the SME in the sector.     

一个群体防卫捕-食系统的定性分析

该文对一个群体防卫捕一食系统进行了较全面的定性分析．讨论了分界线的相对位置，得到了极限环的存在性、唯一性以及分界线环的存在性，首次证明了群体防卫捕一食系统可以至少存在两个或三个极限环．     

3‐colorability of 4‐regular hamiltonian graphs

On the model of the cycle‐plus‐triangles theorem, we consider the problem of 3‐colorability of those 4‐regular hamiltonian graphs for which the components of the edge‐complement of a given hamiltonian cycle are non‐selfcrossing cycles of constant length ≥ 4. We show that this problem is NP‐complete. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 125–140, 2003