强流射频四极加速器输入耦合环的物理设计研究

 详细讨论了强流射频四极加速器高频输入耦合环的一些基本问题，完成了高频输入耦合环的初步物理设计. 利用二维程序Superfish 的一些结果，确定了耦合环的大小，计算了耦合环的功耗，并对构成耦合环导线的粗细进行了估算。该耦合环的物理设计可作为耦合环试验的基础，同时，也可作为三维程序HFSS 模拟计算的起点。     

多对一双方匹配市场中的最优化

在双方市场中定义的博弈概念，可以使市场同方参与者的收益同时达到最大．这种最优化存在的理论依据是选择匹配的稳定性．用博弈论的分析与证明方法研宄多对一双方匹配市场中的最优化．在替代偏好和LAD（Law of Aggregate Demend）偏好下，证明由企业作选择的选择函数一定是个稳定匹配，由工人做选择的选择函数也是一个稳定匹配．     

Erdős matching conjecture for almost perfect matchings

In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size $s+1$? In this note, we improve upon a recent result of Frankl and resolve this problem for $s>101k^3$ and $(s+1)k?n<(s+1)(k+\frac{1}{100k})$.     

运用CAFP教学提升学生化学意志素质的教学案例

鉴于当前学生化学意志素质缺乏的问题，探讨以认知、情绪唤醒、情感、意志为主控目标，在预习、尝试学习、交错搭配合作学习中，开展CAFP教学研究，以促成情意因素对认知的调动、动力、强化等功能。     

Generalized matching theorems for closed coverings of convex sets

In this paper we use fixed point and coincidence theorems due to Park [8] to give matching theorems concerning closed coverings of nonempty convex sets in a real topological vector space. Our new results extend previously given ones due to Ky Fan [2], [3], Shih [10], Shih and Tan [11], and Park [7].     

Gray codes extending quadratic matchings

Is it true that every matching in the n-dimensional hypercube can be extended to a Gray code? More than two decades have passed since Ruskey and Savage asked this question and the problem still remains open. A solution is known only in some special cases, including perfect matchings or matchings of linear size. This article shows that the answer to the Ruskey–Savage problem is affirmative for every matching of size at most . The proof is based on an inductive construction that extends balanced matchings in the completion of the hypercube by edges of into a Hamilton cycle of . On the other hand, we show that for every there is a balanced matching in of size that cannot be extended in this way.     

The minimum forcing number of perfect matchings in the hypercube

Let $M$ be a perfect matching in a graph. A subset $S$ of $M$ is said to be a forcing set of $M$, if $M$ is the only perfect matching in the graph that contains $S$. The minimum size of a forcing set of $M$ is called the forcing number of $M$. Pachter and Kim (1998) conjectured that the forcing number of every perfect matching in the $n$-dimensional hypercube is $2^{n?2}$, for all $n\ge 2$. This was revised by Riddle (2002), who conjectured that it is at least $2^{n?2}$, and proved it for all even $n$. We show that the revised conjecture holds for all $n\ge 2$. The proof is based on simple linear algebra.     

Perfect matchings extend to two or more hamiltonian cycles in hypercubes

Kreweras conjectured that every perfect matching of a hypercube $Q_n$ for $n\ge 2$ can be extended to a hamiltonian cycle of $Q_n$. Fink confirmed the conjecture to be true. It is more general to ask whether every perfect matching of $Q_n$ for $n\ge 2$ can be extended to two or more hamiltonian cycles of $Q_n$. In this paper, we prove that every perfect matching of $Q_n$ for $n\ge 4$ can be extended to at least $2^{2^{n?4}}$ different hamiltonian cycles of $Q_n$.     

Edge proximity and matching extension in projective planar graphs

A graph $G$ with at least $2m+2$ vertices is said to be distance $d$ $m$-extendable if, for any matching $M$ of $G$ with $m$ edges in which the edges lie at distance at least $d$ pairwise, there exists a perfect matching of $G$ containing $M$. In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 $m$-extendable for any $m$.