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.      

Analysis of queueing policies in QoS switches

It is widely accepted that next-generation networks will provide guaranteed services, in contrast to the “best effort” approach today. We study and analyze queueing policies for network switches that support the QoS (Quality of Service) feature. One realization of the QoS feature is that packets are not necessarily all equal, with some having higher priorities than the others. We model this situation by assigning an intrinsic value to each packet. In this paper we are concerned with three different queueing policies: the nonpreemptive model, the FIFO preemptive model, and the bounded delay model. We concentrate on the situation where the incoming traffic overloads the queue, resulting in packet loss. The objective is to maximize the total value of packets transmitted by the queueing policy. The difficulty lies in the unpredictable nature of the future packet arrivals. We analyze the performance of the online queueing policies via competitive analysis, providing upper and lower bounds for the competitive ratios. We develop practical yet sophisticated online algorithms (queueing policies) for the three queueing models. The algorithms in many cases have provably optimal worst-case bounds. For the nonpreemptive model, we devise an optimal online algorithm for the common 2-value model. We provide a tight logarithmic bound for the general nonpreemptive model. For the FIFO preemptive model, we improve the general lower bound to 1.414, while showing a tight bound of 1.434 for the special case of queue size 2. We prove that the bounded delay model with uniform delay 2 is equivalent to a modified FIFO preemptive model with queue size 2. We then give improved upper and lower bounds on the 2-uniform bounded delay model. We also show an improved lower bound of 1.618 for the 2-variable bounded delay model, matching the previously known upper bound.     

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.     

Vacuum System for HL-2A Tokamak

The vacuum system of today＇s tokamak devices is designed to meet the operational requirements of the experiments. The operation can be divided into five modes, （1） pumping down and leak detecting of the vacuum vessel, （2） baking, （3） plasma-facing component （PFC） conditioning, （4）evacuating and controlling of the particles at plasma edge, （5） plasma discharge experiments.     

A theoretical study of the ion pair SN2 reaction between lithium isocyanates with methyl fluoride with inversion and retention mechanism

This paper is devoted to a detailed theoretical study of an ion pair S_N2 reaction LiNCO+CH₃F in the gas phase and in solution at the level of MP2(full)/6-31+G**//HF/6-31+G**. Two possible reaction mechanisms, inversion and retention, are discussed. There are eight possible reaction pathways. The inversion mechanism is more favorable no matter in the gas phase or in solution based on analyses of the transition structures. Methyl isocyanate should form preferentially in the gas phase and more stable methyl cyanate is the main product in solution. The retardation of the reaction in solvents was attributed to the difference in solvation in the separated reactants and in the transition state.     

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.     

Program explanations and causal relevance

Frank Jackson and Philip Pettit have defended a non-reductive account of causal relevance known as the ‘program explanation account’. Allegedly, irreducible mental properties can be causally relevant in virtue of figuring in non-redundant program explanations which convey information not conveyed by explanations in terms of the physical properties that actually do the ‘causal work’. I argue that none of the possible ways to spell out the intuitively plausible idea of a program explanation serves its purpose, viz., defends non-reductive physicalism against Jaegwon Kim’s Causal Exclusion Argument according to which non-reductive physicalism is committed to epiphenomenalism because irreducible mental properties are ‘screened off’ from causal relevance by their physical realizers. Jackson and Pettit’s most promising explication of a program explanation appeals to the idea of invariance of effect under variation of realization, but I show that invariance of effect under variation of realization is neither necessary nor sufficient for causal relevance.     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005     

Order restricted randomized designs for control versus treatment comparison

We develop a method of randomizing units to treatments that relies on subjective judgement or on possible coarse modeling to produce restrictions on the randomization. The procedure thus fits within the general framework of ranked set sampling. However, instead of selecting a single unit from each set for full measurement, all units within a set are used. The units within a set are assigned to different treatments. Such an assignment translates the positive dependence among units within a set into a reduction in variation of contrasting features of the treatments. A test for treatment versus control comparison, with controlled familywise error rate, is developed along with the associated confidence intervals. The new procedure is shown to be superior to corresponding procedures based on completely randomized or ranked set sample designs. The superiority appears both in asymptotic relative efficiency and in power for finite sample sizes. Importantly, this test does not rely on perfect rankings; rather, the information in the data on the quality of rankings is exploited to maintain the level of the test when rankings are imperfect. The asymptotic relative efficiency of the test is not affected by estimation of the quality of rankings, and the finite sample performance is only mildly affected.