QTL Mapping for Frond Length and Width in Laminaria japonica Aresch (Laminarales, Phaeophyta) Using AFLP and SSR Markers

In Laminaria japonica Aresch breeding practice, two quantitative traits, frond length (FL) and frond width (FW), are the most important phenotypic selection index. In order to increase the breeding efficiency by integrating phenotypic selection and marker-assisted selection, the first set of QTL controlling the two traits were determined in F-2 family using amplified fragment length polymorphism (AFLP) and simple sequence repeat (SSR) markers. Two prominent L. japonicas inbred lines, one with "broad and thin blade" characteristics and another with "long and narrow blade" characteristics, were applied in the hybridization to yield the F-2 mapping population with 92 individuals. A total of 287 AFLP markers and 11 SSR markers were used to construct a L. japonica genetic map. The yielded map was consisted of 28 linkage groups (LG) named LG1 to LG28, spanning 1,811.1 cM with an average interval of 6.7 cM and covering the 82.8% of the estimated genome 2,186.7 cM. While three genome-wide significant QTL were detected on LG1 (two QTL) and LG4 for "FL," explaining in total 42.36% of the phenotypic variance, two QTL were identified on LG3 and LG5 for the trait "FW," accounting for the total of 36.39% of the phenotypic variance. The gene action of these QTL was additive and partially dominant. The yielded linkage map and the detected QTL can provide a tool for further genetic analysis of two traits and be potential for maker-assisted selection in L. japonica breeding.

Genetic mapping of laminaria japonica and l. longissima using amplified fragment length polymorphism markers in a "two-way pseudo-testcross" strategy

With a "two-way pseudo-testcross" mapping strategy, we applied the amplified fragment length polymorphism (AFLP) markers to construct two moderate density genetic linkage maps for Laminaria. The linkage maps were generated from the 60 progenies of the F, cross family (Laminaria longissima Aresch. x L. japonica Miyabe) with twenty pairs of primer combinations. Of the 333 polymorphic loci scored in 60 progenies, 173 segregated in a 1:1 ratio, corresponding to DNA polymorphisms heterozygous in a single parent, and the other 58 loci existing in both parents followed a 3:1 Mendelian segregation ratio. Among the loci with 1:1 segregating ratios, 79 loci were ordered in 14 linkage groups (648.6 cM) of the paternal map, and 72 loci were ordered in 14 linkage groups (601.9 cM) of the maternal map. The average density of loci was approximately 1 per 8 cM. To investigate the homologies between two parental maps, we used 58 loci segregated 3:1 for further analysis, and deduced one homologous linkage group. The linkage data developed in these maps will be useful for detecting loci-controlling commercially important traits for Laminaria.

One step isolation and purification of liquiritigenin and isoliquiritigenin from Glycyrrhiza uralensis Risch using high-speed counter-current chromatography

High-speed counter-current chromatography (HSCCC) technique in semi-preparative scale has been successfully applied to the separation of bioactive flavonoid compounds, liquiritigenin and isoliquiritigenin in one step from the crude extract of Glycyrrhiza uralensis Risch. The HSCCC was performed using a two-phase solvent system composed of n-hexane-ethyl acetate-methanol-acetonitrile-water (2:2:1:0.6:2, v/v). Yields of liquiritigenin (98.9% purity) and isoliquiritigenin (98.3% purity) obtained were 0.52% and 0.32%. Chemical structures of the purified liquiritigenin and isoliquiritigenin were identified by electrospray ionization-MS (ESI-MS) and NMR analysis. (c) 2005 Published by Elsevier B.V.

Identification and mapping of amplified fragment length polymorphism markers linked to shell color in bay scallop, Argopecten irradians irradians (Lamarck, 1819)

Amplified fragment length polymorphisms (AFLP) were used to study the inheritance of shell color in Argopecten irradians. Two scallops, one with orange and the other with white shells, were used as parents to produce four F-1 families by selfing and outcrossing. Eighty-eight progeny, 37 orange and 51 white, were randomly selected from one of the families for segregation and mapping analysis with AFLP and microsatellite markers. Twenty-five AFLP primer pairs were screened, yielding 1138 fragments, among which 148 (13.0%) were polymorphic in two parents and segregated in progeny. Six AFLP markers showed significant (P < 0.05) association with shell color. All six loci were mapped to one linkage group. One of the markers, F1f335, is completely linked to the gene for orange shell, which we designated as Orange1, without any recombination in the progeny we sampled. The marker was amplified in the orange parent and all orange progeny, but absent in the white parent and all the white progeny. The close linkage between F1f335 and Orange1 was validated using bulk segregation analysis in two natural populations, and all our data indicate that F1f335 is specific for the shell color gene, Orange1. The genomic mapping of a shell color gene in bay scallop improves our understanding of shell color inheritance and may contribute to the breeding of molluscs with desired shell colors.

Its length polymorphism in oysters and its use in species identification

In an effort to develop genetic markers for oyster identification, we studied length polymorphism in internal transcribed spacers (ITS) between major ribosomal RNA genes in 12 common species of Ostreidae: Crassostrea virginica, C. rhizophorae, C. gigas, C. angulata, C. sikamea, C. ariakensis, C. hongkongensis, Saccostrea echinata, S. glomerata, Ostrea angasi, O. edulis, and O. conchaphila. We designed two pairs of primers and optimized PCR conditions for simultaneous amplification of ITS 1 and ITS2 in a single PCR. Amplification was successful in all 12 species, and PCR products were visualized on high-resolution agarose gels. ITS2 was longer than ITS 1 in all Crassostrea and Saccostrea species, whereas they were about the same size in the three Ostrea species. No intraspecific variation in ITS length was detected. Among species, the length of ITS I and ITS2 was polymorphic and provided unique identification of 8 species or species pairs: C. ariakensis, C. hongkongensis, C. sikamea, O. conchaphila, C. virginica/C. rhizophorae, C. gigas/C. angulata, S. echinata/S. glonzerata, and O. angasi/O. edulis. The ITS assay provides simple, rapid and effective identification of C. ariakensis and several other oyster species. Because the primer sequences are conserved, the ITS assay may be useful in the identification of other bivalve species.

水下机械手运动学逆解的一种优化解法

本文给出一种运用约束最优化的变尺度法求解Schilling水下机械手运动学逆解的方法。这种方法不仅具有牛顿方法的快速性和理想的总体收敛性,通过迭代求取H阵,不仔在奇异性问题,运用惩罚函数法选取步长,保证了从任意点进行搜索,同时有效地处理了约束的存在。这种方法较其它优化算法和搜索法有明显的快速性,在PⅡ550微机上的求解实验证明此算法完全可以用在此机械手运动学的实时求解中。

数据驱动型多次波衰减方法的研究

In the practical seismic profile multiple reflections tend to impede the task of even the experienced interpreter in deducing information from the reflection data. Surface multiples are usually much stronger, more broadband, and more of a problem than internal multiples because the reflection coefficient at the water surface is much larger than the reflection coefficients found in the subsurface. For this reason most attempts to remove multiples from marine data focus on surface multiples, as will I. A surface-related multiple attenuation method can be formulated as an iterative procedure. In this essay a fully data-driven approach which is called MPI —multiple prediction through inversion (Wang, 2003) is applied to a real marine seismic data example. This is a pretty promising scheme for predicting a relative accurate multiple model by updating the multiple model iteratively, as we usually do in a linearized inverse problem. The prominent characteristic of MPI method lie in that it eliminate the need for an explicit surface operator which means it can model the multiple wavefield without any knowledge of surface and subsurface structures even a source signature. Another key feature of this scheme is that it can predict multiples not only in time but also in phase and in amplitude domain. According to the real data experiments it is shown that this scheme for multiple prediction can be made very efficient if a good initial estimate of the multiple-free data set can be provided in the first iteration. In the other core step which is multiple subtraction we use an expanded multi-channel matching filter to fulfil this aim. Compared to a normal multichannel matching filter where an original seismic trace is matched by a group of multiple-model traces, in EMCM filter a seismic trace is matched by not only a group of the ordinary multiple-model traces but also their adjoints generated mathematically. The adjoints of a multiple-model trace include its first derivative, its Hilbert transform and the derivative of the Hilbert transform. The third chapter of the thesis is the application for the real data using the previous methods we put forward from which we can obviously find the effectivity and prospect of the value in use. For this specific case I have done three group experiments to test the effectiveness of MPI method, compare different subtraction results with fixed filter length but different window length, invest the influence of the initial subtraction result for MPI method. In terms of the real data application, we do fine that the initial demultiple estimate take on a great deal of influence for the MPI method. Then two approaches are introduced to refine the intial demultiple estimate which are first arrival and masking filter respectively. In the last part some conclusions are drawn in terms of the previous results I have got.

One-step heterogeneously catalytic oxidation of o-cresol by oxygen to salicylaldehyde

Salicylaldehyde (selectivity = 57.3% at a conversion = 73.8%) was prepared for the first time by the oxidation of o-cresol in a single step using impregnated CuCo/C catalysts.

The Bifurcation Interpreter: A Step Towards the Automatic Analysis of Dynamical Systems

The Bifurcation Interpreter is a computer program that autonomously explores the steady-state orbits of one-parameter families of periodically- driven oscillators. To report its findings, the Interpreter generates schematic diagrams and English text descriptions similar to those appearing in the science and engineering research literature. Given a system of equations as input, the Interpreter uses symbolic algebra to automatically generate numerical procedures that simulate the system. The Interpreter incorporates knowledge about dynamical systems theory, which it uses to guide the simulations, to interpret the results, and to minimize the effects of numerical error.

PILOT: A Step Toward Man-Computer Symbiosis

PILOT is a programming system constructed in LISP. It is designed to facilitate the development of programs by easing the familiar sequence: write some code, run the program, make some changes, write some more code, run the program again, etc. As a program becomes more complex, making these changes becomes harder and harder because the implications of changes are harder to anticipate. In the PILOT system, the computer plays an active role in this evolutionary process by providing the means whereby changes can be effected immediately, and in ways that seem natural to the user. The user of PILOT feels that he is giving advice, or making suggestions, to the computer about the operation of his programs, and that the system then performs the work necessary. The PILOT system is thus an interface between the user and his program, monitoring both in the requests of the user and operation of his program. The user may easily modify the PILOT system itself by giving it advice about its own operation. This allows him to develop his own language and to shift gradually onto PILOT the burden of performing routine but increasingly complicated tasks. In this way, he can concentrate on the conceptual difficulties in the original problem, rather than on the niggling tasks of editing, rewriting, or adding to his programs. Two detailed examples are presented. PILOT is a first step toward computer systems that will help man to formulate problems in the same way they now help him to solve them. Experience with it supports the claim that such "symbiotic systems" allow the programmer to attack and solve more difficult problems.

Finding Edges and Lines in Images

The problem of detecting intensity changes in images is canonical in vision. Edge detection operators are typically designed to optimally estimate first or second derivative over some (usually small) support. Other criteria such as output signal to noise ratio or bandwidth have also been argued for. This thesis is an attempt to formulate a set of edge detection criteria that capture as directly as possible the desirable properties of an edge operator. Variational techniques are used to find a solution over the space of all linear shift invariant operators. The first criterion is that the detector have low probability of error i.e. failing to mark edges or falsely marking non-edges. The second is that the marked points should be as close as possible to the centre of the true edge. The third criterion is that there should be low probability of more than one response to a single edge. The technique is used to find optimal operators for step edges and for extended impulse profiles (ridges or valleys in two dimensions). The extension of the one dimensional operators to two dimentions is then discussed. The result is a set of operators of varying width, length and orientation. The problem of combining these outputs into a single description is discussed, and a set of heuristics for the integration are given.

KBEmacs: A Step Toward the Programmer's Apprentice

The Knowledge-Based Editor in Emacs (KBEmacs) is the current demonstration system implemented as part of the Programmer's Apprentice project. KBEmacs is capable of acting as a semi-expert assistant to a person who is writing a program ??king over some parts of the programming task. Using KBEmacs, it is possible to construct a program by issuing a series of high level commands. This series of commands can be as much as an order of magnitude shorter than the program is describes. KBEmacs is capable of operating on Ada and Lisp programs of realistic size and complexity. Although KBEmacs is neither fast enough nor robust enough to be considered a true prototype, both of these problems could be overcome if the system were to be reimplemented.

One-step synthesis of 2-pentanone from ethanol over K-Pd/MnOx-ZrO2-ZnO catalyst

A highly active and selective K-Pd/MnOx-ZrO2-ZnO catalyst for the one-step synthesis of 2-pentanone from ethanol is described. The possible reaction pathways for ethanol reaction over K-Pd/MnOx-ZrO2-ZnO catalyst were investigated by means of TPSR, CO2- and NH3-TPD techniques. The reactions were performed in a fixed bed continuous flow reactor. Complete conversion with high selectivity for 2-pentanone, was observed under 370 similar to 390degreesC, 2 similar to 4 MPa, GHSV = 8000 similar to 10,000 h(-1) and LHSV < 1.25 h(-1) conditions. Ethanol reactions over K-Pd/MnOx-ZrO2-ZnO catalyst showed that the catalyst could catalyze dehydrogenation. aldol. dehydration and hydrogenation reactions. Both acidic and basic properties are found on the surface of K-Pd/MnOx-ZrO2-ZnO catalyst, whose multifunctionality with the combination of basic, acid and metal sites may be responsible for the efficiency of the K-PdMnOx-ZrO2-ZnO catalyst. (C) 2004 Elsevier B.V. All rights reserved.

A stochastic approximation algorithm with step size adaptation

Plakhov, A.Y.; Cruz, P., (2004) 'A stochastic approximation algorithm with step size adaptation', Journal of Mathematical Science 120(1) pp.964-973 RAE2008

A Two-step Statistical Approach for Inferring Network Traffic Demands (Revises Technical Report BUCS-2003-003)

Accurate knowledge of traffic demands in a communication network enables or enhances a variety of traffic engineering and network management tasks of paramount importance for operational networks. Directly measuring a complete set of these demands is prohibitively expensive because of the huge amounts of data that must be collected and the performance impact that such measurements would impose on the regular behavior of the network. As a consequence, we must rely on statistical techniques to produce estimates of actual traffic demands from partial information. The performance of such techniques is however limited due to their reliance on limited information and the high amount of computations they incur, which limits their convergence behavior. In this paper we study a two-step approach for inferring network traffic demands. First we elaborate and evaluate a modeling approach for generating good starting points to be fed to iterative statistical inference techniques. We call these starting points informed priors since they are obtained using actual network information such as packet traces and SNMP link counts. Second we provide a very fast variant of the EM algorithm which extends its computation range, increasing its accuracy and decreasing its dependence on the quality of the starting point. Finally, we evaluate and compare alternative mechanisms for generating starting points and the convergence characteristics of our EM algorithm against a recently proposed Weighted Least Squares approach.