Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

Fonctions analytiques Cliffordiennes

We define analytic functions within Clifford Algebras CL, and study their trigonometric properties. We write the addition formulas when their arguments, A and B in CL, commute, this generalizes ordinary trigonometry. We examine in particular the case A² = 1.      

Isometric Isomorphisms Between Banach Algebras Related to a Certain Class of Clifford Topological Semigroups

In the present paper it is shown that if S₁ and S₂ are two Clifford topological semigroups satisfying certain conditions and T is an isometric isomorphism of LUC(S₁*) onto LUC(S₂*), then T maps S₁ topologically isomorphically onto S₂. Furthermore, T maps M ^l _n(S₁) (M(S₁), respectively) isometrically isomorphically onto M ^l _n(S₂) (M(S₂), respectively). Indeed, we have obtained a generalization of a well-known result of Ghahramani, Lau and Losert for locally compact groups to a more general setting of Clifford topological semigroups.     

Experiences in Expert Systems

This paper describes some work carried out in the Scientific Research and Development Branch (SRDB) of the Home Office, intended to contribute to an overall aim of building up internal expertise in the field of expert systems. This was done by carrying out a number of pilot and demonstrator projects, two of which are described in some detail. The plan, which proved successful, was to build as far as possible on the relevant skills already possessed by an OR group in the branch. The lessons learned from these are summarized in the hope that they will be of use to other groups who wish to become involved in this important area.     

“神龙一号”注入器研制

“神龙一号”注入器是直线感应加速器的束流源，它采用了感应叠加的高压加载方式，包括脉冲功率系统、感应腔、阴阳极杆、绝缘支撑、二极管和束流传输系统等子系统. 在研制中采用了径向绝缘支撑、对中支撑调节系统、类Pierce阴极等先进技术，以及二极管线圈内置和外径为800mm的铁氧体大环等创新. 参数测试显示，3.5MeV注入器达到了世界先进水平.     

MATLAB/SIMULINK在电力系统仿真中的应用

介绍了Matlab／Simulink仿真工具在电力系统仿真中的应用方法．     

When should you sack a football manager? Results from a simple model applied to the English Premiership

What strategy should a football (soccer, in American parlance) club adopt when deciding whether to sack its manager? This paper introduces a simple model assuming that a club's objective is to maximize the number of league points that it scores per season. The club's strategy consists of three choices: the length of the honeymoon period during which it will not consider sacking a new manager, the level of the performance trapdoor below which the manager get the sack, and the weight that it will give to more recent games compared to earlier ones. Some data from the last six seasons of the English Premiership are used to calibrate the model. At this early stage of the research, the best strategy appears to have only a short honeymoon period of eight games (much less than the actual shortest period of 12 games), to set the trapdoor at 0.74 points per game, and to put 47% of the weight on the last five games. A club adopting this strategy would obtain on average 56.8 points per season, compared to a Premiership average of 51.8 points.