A note on traversing specified vertices in graphs embedded with large representativity

A graph G is said to have property P(2,k) if given any k+2 distinct vertices a,b,v₁,…,v_k, there is a path P in G joining a and b and passing through all of v₁,…,v_k. A graph G is said to have property C(k) if given any k distinct vertices v₁,…,v_k, there is a cycle C in G containing all of v₁,…,v_k. It is shown that if a 4-connected graph G is embedded in an orientable surface Σ (other than the sphere) of Euler genus eg(G,Σ), with sufficiently large representativity (as a function of both eg(G,Σ) and k), then G possesses both properties P(2,k) and C(k).     

Long cycles and paths in distance graphs

For n∈N and D⊆N, the distance graph has vertex set {0,1,…,n−1} and edge set {ij∣0≤i,j≤n−1,|j−i|∈D}. Note that the important and very well-studied circulant graphs coincide with the regular distance graphs.A fundamental result concerning circulant graphs is that for these graphs, a simple greatest common divisor condition, their connectivity, and the existence of a Hamiltonian cycle are all equivalent. Our main result suitably extends this equivalence to distance graphs. We prove that for a finite set D of order at least 2, there is a constant c_D such that the greatest common divisor of the integers in D is 1 if and only if for every n, has a component of order at least n−c_D if and only if for every n≥c_D+3, has a cycle of order at least n−c_D. Furthermore, we discuss some consequences and variants of this result.     

A Markov Model of Production, Trade, and Money: Theory and Artificial Life Simulation

The paper generalizes the Kiyotaki-Wright trade model by treatingthe trading period as a finite game, so Nash's theorem can be used to provethe existence of equilibrium, and by treating the economy as a Markovprocess, so an ergodic theorem can be used to show the existence ofequilibria with desirable properties (e.g., in which money exists). A Markovmodel of trade also allows us to add complexity to the economy withoutadding corresponding complexity to the analysis of the model's properties.The paper also provides artificial life simulations of the Markov economysuggesting that monetary equilibria are dynamically stable and do notrequire high levels of learning or information processing on the part ofagents.     

一类稀疏效应下捕食┐被捕食者系统极限环的存在性和唯一性

本文研究捕食者种群具有线性密度制约的一类稀疏效应下捕食－被捕食者系统ｘ＝ｘ（ａｘ－ｃｘ３－ｂｙ），ｙ＝ｙ（－α＋βｘ－γｙ）．（＊）得到：（１）当Ａ１＜Ａ１，Ａ２＜Ａ２，Ａ３＞Ａ３时，系统（＊）在第一象限内存在极限环；（２）当Ａ２＜Ａ２，Ａ３＞Ａ３时，系统（＊）在第一象限内存在唯一极限环     

排气全燃型联合循环设计点性能简明估计公式

排气全燃型联合循环设计点性能简明估计公式蔡睿贤（中国科学院工程热物理研究所北京１０Ｏ０８０）关键词：排气全燃型联合循环，热力分析主要符号表Ｈｕ燃料热值Ｌ燃料理论空气量ｌ比功Ｐ单位能量价格Ｒ燃气轮机与蒸汽轮机的功率比α过量空气系数β摩尔燃料系数△增量η...     

用联合变换相关器实现灰阶图像绝对差度量光学匹配

将绝对差度量（ＡＤＭ）引入联合变换相关器（ＪＴＣ）,实现了灰阶图像光学匹配的计算机模拟实验,利用循环编码方法,通过联合变换相关器一步绝对差度量,相关后的图像通过取高阈值的分割方法来实现对目标的准确判断,针对高斯噪声干扰情况,分析了阈值选择问题,提高了灰阶目标识别抵抗器材怕畸变干扰的能力。     

最大度大于等于7的平面图的线性荫度

图的染色问题在组合优化、计算机科学和Hessians矩阵的网络计算等方面具有非常重要的应用。其中图的染色中有一种重要的染色——线性荫度,它是一种非正常的边染色,即在简单无向图中,它的边可以分割成线性森林的最小数量。研究最大度$\bigtriangleup（G）\geq7$的平面图$G$的线性荫度,证明了对于两个固定的整数$i$,$j\in\{5,6,7\}$,如果图$G$中不存在相邻的含弦$i$,$j$-圈,则图$G$的线性荫度为$\lceil\frac\bigtriangleup2\rceil$。     

电化学体系中吸附在金电极表面吡啶的紫外拉曼光谱研究

观察到波长为325nm的紫外光激发下吸附在金电极表面的吡啶的表面增强拉曼光谱(SERS)。结合其SERS谱随电位的变化关系,分析了其中的增强机制并表明随电位的负移吡啶的吸附方式发生改变。     

污垢热阻恒定应力加速寿命试验研究

为缩短渐近污垢试验时间,本文定义了污垢寿命,利用恒定应力加速寿命试验(简称恒加试验),基于定数截尾 指数寿命统计分析方法,求得加速系数a, b近似最小二乘估计,然后由加速模型求得在正常应力水平下的平均寿命估 计。实例计算结果表明,对渐近型污垢热阻进行加速试验是可信的,也是可行的。这对污垢试验研究具有重要价值。     

150K温区混合工质采用带预冷的林德制冷机的实验研究

提出了利用带预冷的林德制冷系统获得了150K温区的制冷方案。建立了实验装置,进行了不同配比的三元混合工质(R23/R14/Ar)的制冷循环的性能实验。实验结果表明:三元混合工质(R23/R14/Ar)的最佳配比为0.46:0.39:0.15,在无热负荷时,制冷温度为150K时,降温时间为85m in。