A compiled key to the recent Stomatopoda of the Indo-West Pacific region

A taxonomic key is presented of the Stomatopoda (family Gonodactylidae) of the IndoWest Pacific Region.

A compiled key to the recent Stomatopoda of the Indo-West Pacific region

An identification key is given for the Stomatopod family Lysiosquillidae occurring in the Indo-West Pacific region.

Results of the Austrian-Ceylonese hydrobiological mission 1970 of the Institute of Zoology of the University of Vienna (Austria) and the Department of Zoology of the University of Sri Lanka, Vidyalankara Campus, Kelaniya. Pt. 19. Aquatic and semiaquatic Hemiptera of Sri Lanka from the Austrian Indo-Pacific expedition, 1970-71

This report concerns the aquatic and semiaquatic Hemiptera collected in Sri Lanka by Prof. Starmühlner and Prof. Costa during November and December 1970. A surprising number of new species have been found in the Starmühlner-Costa material, even in groups for which comprehensive revisions exist. Seven new species are described here.

A preliminary phylogenetic analysis of Metapenaeopsis (Decapoda : Penaeidae) based on mitochondrial dna sequences of selected species from the Indo-West Pacific

Phylogenetic relationships within Metapenaeopsis remain largely unknown. The modern revision of the genus suggests that the shape of the petasma, followed by the presence of a stidulating organ, are the most important distinguishing taxonomic features. In the present study, phylogenetic relationships were studied among seven Metapenaeopsis species from the Indo-West Pacific based on partial sequences of mitochondrial 16S rRNA and cytochrome c oxidase I (COI) genes. Mean sequence divergence was 6.4% for 16S and 15.8% for COI. A strikingly large nucleotide distance (10.0% for 16S and 16.9% for COI) was recorded between M. commensalis, the only Indo-West Pacific species with a one-valved petasma, and the other species with a two-valved petasma. Phylogenetic analyses using neighbor-joining, maximum parsimony, and maximum likelihood generated mostly identical tree topologies in which M. commensalis is distantly related to the other species. Two clades were resolved for the remaining species, one with and the other without a stridulating organ, supporting the main groupings of the recent taxonomic revision. Results of the present study also indicate that the deep-water forms represent a relatively recent radiation in Metapenaeopsis.

On equations for regular languages, finite automata, and sequential networks

We consider systems of equations of the form where A is the underlying alphabet, the Xi are variables, the Pi,a are boolean functions in the variables Xi, and each δi is either the empty word or the empty set. The symbols υ and denote concatenation and union of languages over A. We show that any such system has a unique solution which, moreover, is regular. These equations correspond to a type of automation, called boolean automation, which is a generalization of a nondeterministic automation. The equations are then used to determine the language accepted by a sequential network; they are obtainable directly from the network.

practical type checking of functions defined on context-free languages

A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF.languages is not decidable,a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked.Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented.

pattern matching compilation of functions defined in context-free languages

LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become complicated and further studies are needed.

facilitating formal specification acquisition by using recursive functions on context-free languages

Although formal specification techniques are very useful in software development, the acquisition of formal specifications is a difficult task. This paper presents the formal specification language LFC, which is designed to facilitate the acquisition and validation of formal specifications. LFC uses context-free languages for syntactic aspect and relies on a new kind of recursive functions, i.e. recursive functions on context-free languages, for semantic aspect of specifications. Construction and validation of LFC specifications are machine-aided. The basic ideas behind LFC, the main aspects of LFC, and the use of LFC and illustrative examples are described.

on string languages generated by spiking neural p systems

We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated by that system. Although the "direct" generative capacity of spiking neural P systems is rather restricted (some very simple languages cannot be generated in this framework), regular languages are inverse-morphic images of languages of finite spiking neural P systems, and recursively enumerable languages are projections of inverse-morphic images of languages generated by spiking neural P systems.

Studies on interaction of bovine serum albumin with indo-1 by fluorescence spectroscopic method

The binding-site number was calculated by using fluorescence spectroscopic method with bovine serum albumin(BSA) and Indo-1 as protein and ligand models, respectively. The method for calculating binding-site number in BSA for Indo-1 was developed based on the relationships between the changes of Indo-1 fluorescence intensity and the analytical concentration of BSA. And the interaction of BSA with Indo-1 was investigated comprehensively by using fluorescence techniques as well as fluorescence resonance energy transfer, and the thermodynamic parameters were calculated according to the changes of enthalpy on temperature.,

牛血清白蛋白与Indo-1相互作用的荧光光谱法研究

以牛血清白蛋白(Bovine serum album in,BSA)与荧光探针Indo-1为蛋白质和配体模型,基于Indo-1的荧光强度与BSA的分析浓度间的关系,建立了计算二者相互作用位点数的方法,并利用荧光共振能量转移及各种荧光技术对Indo-1和BSA的相互作用进行了研究.结果表明,Indo-1在BSA中有3个作用位点,这3个作用位点与BSA中的212位色氨酸(Trp 212)间的距离分别为2.93,2.57和2.40 nm;Indo-1通过疏水性作用进入到BSA的3个疏水性空腔.在荧光猝灭实验中,通过M icrolab 500系列进样器和PTI荧光仪的联用实现了荧光强度的自动和实时记录.