Vibrational frequencies, force constants, mean amplitudes, shrinkage effects and thermodynamic functions for monohaloacetylenes

Harmonic force fields are developed for the monohaloacetylenes on the basis of recent vibrational spectra of H-CC-I and previously published spectra of H-CC-X (X = F, Cl, Br). Mean amplitudes of vibration and Bastiansen-Morino shrinkage effects are reported for monohaloacetylenes and their deuterated derivatives. Thermodynamic functions are listed for monoiodoacetylene.     

The molecular structure of selenonyl fluoride,SeO2F2, and sulfuryl fluoride,SO2F2, as determined by gas-phase electron diffraction

The molecular structure of selenonyl fluoride (SeO₂F₂) and sulfuryl fluoride (SO₂F₂) has been studied by gas-phase electron diffraction. The geometries of both molecules are consistent with predictions of VSEPR (valence-shell electron-pair repulsion) theory. The results for the more important distance (r_a), bond angle, and r.m.s. amplitude (l) parameters with estimated uncertainties estimated at 2σ are for SeO₂F₂r(Se = 0) = 1.575 Å (0.002), r(Se-F) = 1.685 Å (0.002), ∠OSeO = 126.2° (0.5), ∠FSeF = 94.1° (0.5), l(Se = 0) = 0.0440 Å (0.0046), l(Se-F) = 0.0472 Å (0.0042), and for SO₂F₂r(S = 0) = 1.397 Å (0.002), r(S-F) = 1.530 Å (0.002), ∠OSO = 122.6° (1.2), ∠FSF = 96.7° (1.1), l(S = 0) = 0.0331 Å (0.0015), l(S-F) = 0.0393 Å (0.0018).     

转台控制系统的DSP实现

从软、硬件两方面介绍了一种基于TMS320F206的数据采集及控制系统在转台控制中的应用。这种以高速SP芯片为核心的控制系统,能实现更先进的控制算法。     

Preface

This special issue of PARTICUOLOGY is devoted to the first UK-China Particle Technology Forum taking place in Leeds, UK, on 1-3 April 2007. The forum was initiated by a number of UK and Chinese leading academics and organised by the University of Leeds in collaboration with Chinese Society of Particuology, Particle Technology Subject Group （PTSG） of the Institution of Chemical Engineers （IChemE）, Particle Characterisation Interest Group （PCIG） of the Royal Society of Chemistry （RSC） and International Fine Particle Research Institute （IFPRI）. The forum was supported financially by the Engineering and Physics Sciences Research Council （EPSRC） of United Kingdom,     

哈佛大学物理专业拔尖人才培养模式探讨

探讨了哈佛大学物理专业拔尖人才的培养模式,诸如严谨与灵活并重的遴选方式、广度与深度并举的学业方案、宽松与紧致共存的评价体制、合作与竞争同在的集群建设.     

A learning trajectory for university students regarding the concept of vector

This paper presents and evaluates a hypothetical learning trajectory by which students bridge the transition from elementary to university-level instruction regarding the concept of vector. The trajectory consists of an instructional sequence of five tasks and begins with a problem in context. Each task is carried out with the support of a Virtual Interactive Didactic Scenario, accompanied by exploration and guided learning sheets, in which the problem is introduced through the simulation of the movement of a robotic arm. This proposal was implemented at the beginning of the SARS-CoV-2 pandemic using various digital media. Two teaching experiments were carried out with engineering students at a Mexican public university. We present the hypothetical learning trajectory that should be followed toward solving the task, and contrast it in each case with the students’ actual learning trajectory. The results show that more than 70 % of the students successfully transitioned from the geometrical vector representation of elementary physics to the algebraic one.     

The advantage of indices of dispersion in queueing approximations

A recent robust queueing approximation for open queueing networks exploits partial characterizations of each arrival process by its rate and index of dispersion for counts (IDC), which is a scaled version of the variance–time curve. Even though only means and variances (as functions of time) are involved, we show that the IDC provides a basis for more accurate approximations than traditional two-moment partial characterizations. For the $GI∕GI∕1$ queue, this approach applied to the arrival and service processes fully characterizes the model.     

Detecting strong cliques

A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their complexity in the classes of chordal graphs, weakly chordal graphs, line graphs and their complements, and graphs of maximum degree at most three. Our results rely on connections with matchings and relate to several graph properties studied in the literature, including well-covered graphs, localizable graphs, and general partition graphs.