Implementation of CSP-S for description of distributed algorithms

The implementation of CSP-S (a subset of CSP)—a high level language for distributed programming—is presented in this paper. The language CSP-S features a parallel command, communication by message passing and the use of guarded command. The implementation consists of a compiler translating the CSP-S constructs into intermediate language. The execution is carried out by a scheduler which creates an illusion of concurrency. Using the CSP-S language constructs, distributed algorithms are written, executed and tested with the compiler designed.

Apparent shortening of the Csp(3)-Csp(3) bond analysed via a variable-temperature X-ray diffraction study in racemic 1,1 '-binaphthalene-2,2 '-diyl diethyl bis(carbonate)

Crystal structure determination at room temperature [292 (2) K] of racemic 1,1'-binaphthalene-2,2'-diyl diethyl bis(carbonate), C26H22O6, showed that one of the terminal carbon-carbon bond lengths is very short [Csp(3)-Csp(3) = 1.327 (6) angstrom]. The reason for such a short bond length has been analysed by collecting data sets on the same crystal at 393, 150 and 90 K. The values of the corrected bond lengths clearly suggest that the shortening is mainly due to positional disorder at two sites, with minor perturbations arising as a result of thermal vibrations. The positional disorder has been resolved in the analysis of the 90 K data following the changes in the unit-cell parameters for the data sets at 150 and 90 K, which appear to be an artifact of a near centre of symmetry relationship between the two independent molecules in the space group P (1) over bar at these temperatures. Indeed, the unit cell at low temperature (150 and 90 K) is a supercell of the room-temperature unit cell.

A functional style of programming with CSP-like communication mechanisms

This paper introduces CSP-like communication mechanisms into Backus’ Functional Programming (FP) systems extended by nondeterministic constructs. Several new functionals are used to describe nondeterminism and communication in programs. The functionals union and restriction are introduced into FP systems to develop a simple algebra of programs with nondeterminism. The behaviour of other functionals proposed in this paper are characterized by the properties of union and restriction. The axiomatic semantics of communication constructs are presented. Examples show that it is possible to reason about a communicating program by first transforming it into a non-communicating program by using the axioms of communication, and then reasoning about the resulting non-communicating version of the program. It is also shown that communicating programs can be developed from non-communicating programs given as specifications by using a transformational approach.

古生代种子：Callospermarton sinium sP·nov·及C·sp的研究

本文报道了Callospermarion在中国山西太原晚石炭世煤核中的首次发现。经过研究，确立了一个新种Callospermarion sinicum sp.nov，另一种Callospermarion sp，并与该属的另外两个种C. pusillum和C. undulatum进行比较。Callospermarion为古生代种子蕨种子，胚珠椭圆形，两侧对称，三层珠被，珠心除在合点处与珠被聚合形成薄壁区外其余部分不与珠被聚合，一般称之游离于珠被。Callospermarion种子着生于Callistophyton的植物营养体上。文中还讨论了该种子蕨的特殊性，以及与其它种子蕨植物的关系和其它裸子植物的关系。

旋光性聚合物HPLC-CSP的制备及手性拆分能力的研究

手性是自然界的一种普遍现象，生命现象离不开手性。手性物质在有机化学、药物化学、生物化学以及功能材料等领域显示出诱人的应用前景。外消旋体的拆分是手性研究的重要基础工作。高效液相色谱手性固定相法（HPLC-CSP）在对映体化合物的分离分析和制备方面表现出独特的优势。本论文以旋光性联萘类聚合物和纤维素类衍生物涂敷的手性固定相进行分析级和半制备级色谱拆分，研究和探讨了它们对外消旋化合物的手性识别能力。1. 纤维素类聚合物的合成 将微晶纤维素与相应的酰氯或异氰酸酯反应获得四种纤维系类衍生物，纤维素三苯甲酸酯（CTB）、纤维素三苯基氨基甲酸酯（CTPC）、纤维素三（3,5-二甲基苯基氨基甲酸酯）（CDMPC）、纤维素三联萘甲酸酯（CTBPT）。红外、核磁、元素分析证明原料纤维素已酯化完全。2. 旋光性聚合物手性固定相及HPLC手性柱的制备采用聚合物涂敷硅胶方法制备了四种纤维素类、三种联萘聚酰胺手性固定相和二种半制备级纤维素手性固定相，匀浆法装柱。研究了不同的涂敷液对色谱柱效的影响。3. 旋光性联萘聚酰胺手性柱拆分能力的探讨 在三种由（S）-联萘聚酰胺涂敷的色谱柱上，以多种流动相体系对多种外消旋化合物进行手性折分试验。4. 纤维素类手性分析柱拆分能力的研究 对手性柱进行塔板数和稳定性测试及拆分能力研究。对一些外消旋化合物实现了手性拆分。由实验结果可以看出，以CDMPC涂敷的手性柱对多种外消旋化合（包括药物）具有手性拆分能力，具分离度较高。5. 半制备级拆分 对三种外消旋药物在纤维素半制备色谱柱上进行了半制备级拆分。我们在分析型色谱柱进行了流动相条件的选择，将优化后的分析条件直接放大到半制备色谱中，不仅节省了模索条件的时间，而且可以节省大量的流动相，预计一天内所能达到的对外消旋体最大拆分量可达克级以上。6. 进行了HPLC-UV-旋光仪的联用检测研究，实现了在线流动过程中旋光曲线的绘制。

A clip domain serine protease (cSP) from the Chinese mitten crab Eriocheir sinensis: cDNA characterization and mRNA expression

Clip domain serine protease (cSP), characterized by conserved clip domains, is a new serine protease family identified mainly in arthropod, and plays important roles in development and immunity. In the present study, the full-length cDNA of a cSP (designated EscSP) was cloned from Chinese mitten crab Eriocheir sinensis by expressed sequence tags (ESTs) and PCR techniques. The 1380 bp EscSP cDNA contained a 1152 bp open reading frame (ORF) encoding a putative cSP of 383 amino acids, a 5'-untranslated region (UTR) of 54 bp, and a 3'-UTR of 174 bp. Multiple sequence alignment presented twelve conserved cysteine residues and a canonical catalytic triad (His(185), Asp(235) and Ser(332)) critical for the fundamental structure and function of EscSP. Two types of cSP domains, the clip domain and tryp_spc domain, were identified in the deduced amino acids sequence of EscSP. The conservation characteristics and similarities with previously known cSPs indicated that EscSP was a member of the large cSP family. The mRNA expression of EscSP in different tissues and the temporal expression in haemocytes challenged by Listonella anguillarum were measured by real-time RT-PCR. EscSP mRNA transcripts could be detected in all examined tissues, and were higher expressed in muscle than that in hepatopancreas. gill, gonad, haemocytes and heart. The EscSP mRNA expression in haemocytes was up-regulated after L anguillarum challenge and peaked at 2 h (4.96 fold, P < 0.05) and 12 h (9.90 fold, P < 0.05). Its expression pattern was similar to prophenoloxidase (EsproPO), one of the components of crab proPO system found in our previous report. These results implied that EscSP was involved in the processes of host-pathogen interaction probably as one of the proPO system members. (C) 2009 Elsevier Ltd. All rights reserved.

Successful termination in timed CSP

In proposing theories of how we should design and specify networks of processes it is necessary to show that the semantics of any language we use to write down the intended behaviours of a system has several qualities. First in that the meaning of what is written on the page reflects the intention of the designer; second that there are no unexpected behaviours that might arise in a specified system that are hidden from the unsuspecting specifier; and third that the intention for the design of the behaviour of a network of processes can be communicated clearly and intuitively to others. In order to achieve this we have developed a variant of CSP, called CSPt, designed to solve the problems of termination of parallel processes present in the original formulation of CSP. In CSPt we introduced three parallel operators, each with a different kind of termination semantics, which we call synchronous, asynchronous and race. These operators provide specifiers with an expressive and flexible tool kit to define the intended behaviour of a system in such a way that unexpected or unwanted behaviours are guaranteed not to take place. In this paper we extend out analysis of CSPt and introduce the notion of an alphabet diagram that illustrates the different categories of events that can arise in the parallel composition of processes. These alphabet diagrams are then used to analyse networks of three processes in parallel with the aim of identifying sufficient constraints to ensure associativity of their parallel composition. Having achieved this we then proceed to prove associativity laws for the three parallel operators of CSPt. Next, we illustrate how to design and construct a network of three processes that satisfy the associativity law, using the associativity theorem and alphabet diagrams. Finally, we outline how this could be achieved for more general networks of processes.