Effects of intraperitoneal injection of cortisol on nonspecific immune functions of Ctenopharyngodon idella

After grass carps Ctenopharyngodon idellus were injected with cortisol, with (CBC) and without (C) a cocoa butter carrier, the effects of both slowly and rapidly acting exogenous cortisol oil their non-specific immune functions were investigated. On the one hand, after injection with CBC, the cortisol concentration and lysozyme activity in fish serum were enhanced and were sustained at high levels for a long period (30 days). The killing activity in the serum declined with time, and phagocytosis of head kidney macrophages diminished significantly (P < 0.05 or P < 0.01). The leukocrit values in the high dose group (31-8 mg cortisol fish(-1)) increased over time, however, with the maximum average being 5.6% at day 30. The spleen mass index in the high dose group was 0.93 x 10(-3) after 30 days, notably lower (P < 0.05) than that in the control group. In addition, a decrease in resistance to Aeronionas hydrophilo infection in cortisol-treated fish was shown, with the final cumulative mortalities being 54.5 and 66.7% in the low and high dose groups, respectively. On the other hand, there was a decrease in both serum cortisol concentration and lysozyme activity of the experimental fish within 2 weeks after injection with C, where plasma bactericidal activities in the high dose group (31-8 mg cortisol fish(-1)) were remarkably lower (P < 0.01) than those in the control group at each sampling, but were increased slightly over time. The results of which were different from those in the CBC trial. Phagocytic activity of head kidney macrophages and spleen mass index decreased significantly (P < 0.05), while there were increases in leukocrit value and cumulative mortality due to A. hydrophila. The results of which were similar to those in the CBC trial. This study indicated that the injection of cortisol depressed the non-specific immune functions of the grass carp and increased its susceptibility to disease. (c) 2005 The Fisheries Society of the British Isles.

Predictive entropy search for efficient global optimization of black-box functions

We propose a novel information-theoretic approach for Bayesian optimization called Predictive Entropy Search (PES). At each iteration, PES selects the next evaluation point that maximizes the expected information gained with respect to the global maximum. PES codifies this intractable acquisition function in terms of the expected reduction in the differential entropy of the predictive distribution. This reformulation allows PES to obtain approximations that are both more accurate and efficient than other alternatives such as Entropy Search (ES). Furthermore, PES can easily perform a fully Bayesian treatment of the model hyperparameters while ES cannot. We evaluate PES in both synthetic and real-world applications, including optimization problems in machine learning, finance, biotechnology, and robotics. We show that the increased accuracy of PES leads to significant gains in optimization performance.

Study on Closed-set Speaker Identification Based on Biomimetic Pattern Recognition

In this paper, a new classifier of speaker identification has been proposed, which is based on Biomimetic pattern recognition (BPR). Distinguished from traditional speaker recognition methods, such as DWT, HMM, GMM, SVM and so on, the proposed classifier is constructed by some finite sub-space which is reasonable covering of the points in high dimensional space according to distributing characteristic of speech feature points. It has been used in the system of speaker identification. Experiment results show that better effect could be obtained especially with lesser samples. Furthermore, the proposed classifier employs a much simpler modeling structure as compared to the GMM. In addition, the basic idea "cognition" of Biomimetic pattern recognition (BPR) results in no requirement of retraining the old system for enrolling new speakers.

Silica-based 64-channel arrayed waveguide gratings with double functions

Silica-based 64-channel arrayed waveguide gratings (AWGs) with double functions and 0.4 nm (50 GHz) channel spacing have been designed and fabricated. On the same component, Gauss and flat-top output response spectra are obtained simultaneously. The test results show that when the insertion loss ranges from 3.5 dB to 6 dB,the crosstalk is better than -34 dB, the 1 dB bandwidth is 0.12 nm, the 3 dB bandwidth is 0,218 nm, and the polarization-dependent loss (PDL) is less than 0.5 dB for Gauss response. When the insertion loss ranges,from 5.8 dB to 7.8 dB, the crosstalk is better than -30 dB, the 1 dB bandwidth is 0.24 nm, the 3 dB bandwidth is 0.33 nm, and the PDL is less than 0.2 dB for flat-top response.

A novel hybrid phase-locked-loop frequency synthesizer using single-electron devices and CMOS transistors

This paper proposes a novel phase-locked loop (PLL) frequency synthesizer using single-electron devices (SEDs) and metal-oxide-semiconductor (MOS) field-effect transistors. The PLL frequency synthesizer mainly consists of a single-electron transistor (SET)/MOS hybrid voltage-controlled oscillator circuit, a single-electron (SE) turnstile/MOS hybrid phase-frequency detector (PFD) circuit and a SE turnstile/MOS hybrid frequency divider. The phase-frequency detection and frequency-division functions are realized by manipulating the single electrons. We propose a SPICE model to describe the behavior of the MOSFET-based SE turnstile. The authors simulate the performance of the PILL block circuits and the whole PLL synthesizer. Simulation results indicated that the circuit can well perform the operation of the PLL frequency synthesizer at room temperature. The PILL synthesizer is very compact. The total number of the transistors is less than 50. The power dissipation of the proposed PLL circuit is less than 3 uW. The authors discuss the effect of fabrication tolerance, the effect of background charge and the SE transfer accuracy on the performance of the PLL circuit. A technique to compensate parameter dispersions of SEDs is proposed.

Monostable-Bistable Transition Logic Element (MOBILE) Model for Single-Electron Transistors

The traditional monostable-bistable transition logic element (MOBILE) structure is usually composed of resonant tunneling diodes (RTD). This letter describes a new type MOBILE structure consisting of single-electron transistors (i.e. SET-MOBILE). The analytical model of single-electron transistors ( SET) has been considered three states (including an excited state) of the discrete quantum energy levels. The simulation results show negative differential conductance (NDC) characteristics in I-DS-V-DS curve. The SET-MOBILE utilizing NDC characteristics can successfully realize the basic logic functions as the RTD-MOBILE.

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.

The Category-Theoretic Solution of Recursive Domain Equations

Recursive specifications of domains plays a crucial role in denotational semantics as developed by Scott and Strachey and their followers. The purpose of the present paper is to set up a categorical framework in which the known techniques for solving these equations find a natural place. The idea is to follow the well-known analogy between partial orders and categories, generalizing from least fixed-points of continuous functions over cpos to initial ones of continuous functors over $\omega $-categories. To apply these general ideas we introduce Wand's ${\bf O}$-categories where the morphism-sets have a partial order structure and which include almost all the categories occurring in semantics. The idea is to find solutions in a derived category of embeddings and we give order-theoretic conditions which are easy to verify and which imply the needed categorical ones. The main tool is a very general form of the limit-colimit coincidence remarked by Scott. In the concluding section we outline how compatibility considerations are to be included in the framework. A future paper will show how Scott's universal domain method can be included too.

On a Certain Algebraic Property of Block Ciphers

This is a study on a certain group theoretic property of the set of encryption functions of a block cipher. We have shown how to construct a subset which has this property in a given symmetric group by a computer algebra software GAP4.2 (Groups, Algorithms, and Programming, Version 4.2). These observations on group structures of block ciphers suggest us that we may be able to set a trapdoor based on meet-in-the-middle attack on block ciphers.

Additions and corrections to “Terminal coalgebras in well-founded set theory”

This note is to correct certain mistaken impressions of the author's that were in the original paper, “Terminal coalgebras in well-founded set theory”, which appeared in Theoretical Computer Science 114 (1993) 299–315.

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.