施钙对花生产量,品质及钙素在植株体内分布的影响

以棕壤为供试土壤进行施用钙素的盆栽试验结果表明,与对照相比,每公斤土施钙２００ｍｇ和８００ｍｇ时,花生分别增产４５％和５２％;每公斤土施钙２００ｍｇ的处理花生果仁中蛋白质含量较对照增加７．１％,从经济高效施肥观点出发,该处理较好。在花生开花下针期以前,每日单株吸钙量逐渐增加,而生育后期呈下降趋势。在苗期花生植株地上部含有的钙元素占整个植株体的比率较高,开花下针期居中,成熟期偏少一些。     

蛋白质MQF—COSY,TOCSY谱自旋系统划分算法

运用二叉树生长及搜索技术对蛋白质及多个自旋偶合系统的样品体系的多量子滤波COSY及TOCSY谱峰进行划分,产生出对应于氨基酸结构单元的互相独立的自旋偶合系统集。划分的结果自动转化为自旋拓扑邻接表,便于蛋白质NMR谱峰归属过程中做进一步的图论处理。实验表明,对于混合的但互相独立的氨基酸样品体系,如果没有强偶合作用(个别含芳环的氨基酸分子除外),划分可获得良好的结果。对于蛋白质样品,谱峰覆盖情况较多,划分的结果不太理想,但对于蛋白质结构决定仍有重要意义,此时划分算法要与覆盖分辨技术相配合。     

地乐胺（dibutralin）对大豆幼苗根腐病,核酸和蛋白质的影响

地乐胺（dibutralin）可降低大豆幼苗根腐病的发病率和严重度，可使大豆幼苗的RNA含量和叶部蛋白质含量增加，RNA酶活性提高，对蛋白酶的活性无影响，这说明地乐胺可诱发某些应激蛋白的产生。另外DNA含量和根部蛋白质含量略减少，幼苗体内IAA,GA,Z，ABA4种激素的含量有不同程度的变化。这些变化都对大豆根腐病的发生有不同程度的影响。     

基于加权子网参与度和多源信息融合的关键蛋白质识别算法

现有关键蛋白质识别算法对生物信息考虑不全面、识别准确率亦有待提高,针对此问题,提出一种高效关键蛋白质识别算法PDWS。首先,结合由亚细胞定位信息获取到的蛋白质位置和蛋白质相互作用网络边聚类系数构建加权网络;其次,依据蛋白质所处亚细胞位置,提出亚细胞定位区室子网参与度指标;最后,融合亚细胞定位区室子网参与度和蛋白质复合物子网参与度指标,多维度度量蛋白质关键性。在DIP和Krogan两个标准数据集上的实验结果表明,PDWS算法性能优于PeC、PCSD等已有算法,可识别出更多特定结构的关键蛋白质,且识别精度分别达到0.76与0.73。     

nr数据库分析及其本地化

通过用NCBI的blastp程序对nr数据库与IPI数据库中属于人类的蛋白质序列进行比较，论证了nr数据库整合到蛋白质注释系统中的必要性。并在此基础上，设计方案实现了nr数据库的本地化，对nr数据库的记录进行了统计分析，提供了数据库的内部访问，为蛋白质拄释系统整合nr数据库做好了第一步工作。     

基于改进的PSO算法的关键蛋白质识别方法研究

关键蛋白质是生物体内维持所有生命活动最重要的物质基础。随着高通量技术的发展,如何从蛋白质相互作用网络中识别出关键蛋白质成为目前蛋白质组学的研究热点。针对大部分现有方法仅仅基于网络拓扑结构信息进行识别以及蛋白质相互作用数据假阳性高的问题,提出了改进的粒子群算法来识别关键蛋白质。通过综合考虑网络拓扑结构特性和多源生物属性信息构建了高质量的加权网络,还考虑使用蛋白质节点间联系的紧密程度来衡量蛋白质的关键性,并扩展局部网络拓扑至二阶邻居,大大提高了预测的准确率。提出了衡量top-p关键蛋白质的整体性指标,降低了计算复杂度。在标准数据集上的实验结果表明,与其他经典算法相比,所提算法更具优势,能够识别出更多的蛋白质,具有较高的准确率。     

一种新的基于多数据源的蛋白质复合物识别算法

蛋白质复合物是许多生物过程得以实现的基石。蛋白质相互作用数据中的假阳性和假阴性对各种识别蛋白质复合物的计算方法有不良影响。为了解决这一问题,1种新的蛋白质复合物识别算法(ICMDS,Identifying Complexes based on Multiple Data Sources)被提出。该方法整合基因表达谱、关键蛋白质信息和蛋白质相互作用3种生物数据进行蛋白质复合物的挖掘。首先,ICMDS重新定义了2个相互作用的蛋白质之间的功能相似性(FS,Functional Similarity)。然后,ICMDS选择已知的关键蛋白质作为种子构建蛋白质复合物。为了消除冗余的复合物,ICMDS算法也设计了冗余过滤子程序。另外,ICMDS也使用非关键蛋白质作为种子并将之扩展为蛋白质复合物。实验结果表明ICMDS识别蛋白质复合物的能力明显优于其他计算方法。     

饲粮蛋白质（赖氨酸）水平对高产母猪泌乳行为,泌乳量和乳成分的影响研究

３０头中国瘦肉猪新品系ＤⅢ系和ＤⅢ－Ⅰ系经产母猪,平均胎次４．６７胎,平均产后体重２０６ｋｇ,平均带仔数为１２．５头,依据品种,胎次、产活仔数等相一致的原则,随机分为５个组增重研究了５种蛋白水平分别为１１．５％、１３．８％、１５．９％、１８．０％和２０．２％,相应的赖氨酸为０．６１％、０．７４％、０．８７％、１．０％和１．１２％的５种等能饲粮对母猪泌乳行为、泌乳量和乳成分的影响。结果表明,饲粮蛋白     

基于氨基酸组成预测蛋白质热稳定性的ν-支持向量机方法

支持向量机有许多优点：有效防止过拟和，适合大的特征空间，给定数据集的信息压缩。本文首次利用支持向量机从氨基酸组成来预测蛋白质的稳定性。总预测率可以达到80．64％，对嗜热蛋白质的预测率为82．50％，对嗜温蛋白质的预测率为80．29％从预测率可以验证氨基酸组成与蛋白质热稳定性成正相关的关系，支持向量机可以成为基于氨基酸组成预测蛋白质热稳定性的有效工具。     

企业内网域管理系统的部署与实施

文章阐述了域管理系统在现代企业内网管理中的作用。通过详述域管理系统的模型设计、组策略配置、客户端加入域等过程,展示了企业内网域管理系统的特点及优势,并为类似域管理系统的部署和实施提供了有益经验。     

Sorting Unsigned Permutations by Weighted Reversals,Transpositions, and Transreversals

Reversals, transpositions and transreversals are common events in genome rearrangement. The genome rearrangement sorting problem is to transform one genome into another using the minimum number of given rearrangement operations. An integer permutation is used to represent a genome in many cases. It can be divided into disjoint strips with each strip denoting a block of consecutive integers. A singleton is a strip of one integer. And the genome rearrangement problem turns into the problem of sorting a permutation into the identity permutation equivalently. Hannenhalli and Pevzner designed a polynomial time algorithm for the unsigned reversal sorting problem on those permutations with O(log n) singletons. In this paper, first we describe one case in which Hannenhalli and Pevzner’s algorithm may fail and propose a corrected approach. In addition, we propose a (1+ε)-approximation algorithm for sorting unsigned permutations with O(log n) singletons by reversals of weight 1 and transpositions/transreversals of weight 2.     

自适应Mean Shift算法的彩色图像平滑与分割算法

采用Mean shift算法对图像进行平滑和分割处理时, 带宽和采样点权重的选择直接影响平滑和分割的效果. 带宽分为空域带宽和值域带宽. 本文根据图像颜色分布的丰富程度定义了自适应空域带宽. 在此基础上, 通过最小化局部方差函数和最大化频域结构相似度函数获得自适应值域带宽. 此外, 通过定义采样点权重, 克服了图像过平滑问题. 通过随机选取大量的图像进行实验, 结果表明运用本文所选择的带宽和权重, 可以得到正确的图像区域分割结果.     

V(D)J recombinase precursors and coding structure of signal sequence directed rearrangement

In order to increase our understanding of the complex process of immunoglobulin and T-cell receptor signal sequence directed rearrangements in vertebrates, an evolutionary approach was designed to (1) assess structural motifs important for rearrangement, (2) discuss evidence for precursors of recombinase candidates and (3) characterize a putative example of a recombinase mediated translocation in a human tumor of non-hematologic origin. Genomic reorganization occurs as a normal, developmentally regulated process in a variety of organisms. In the vertebrates, recombination signal sequence directed V(D)J rearrangement operates during the development of both T- and B-cells to generate mature T-cell receptor and immunoglobulin variable region genes, respectively. It is argued that this type of signal sequence directed rearrangement event probably evolved from a primitive rearrangement system, and it is proposed that novel rearranging gene families exist in other terminally differentiating tissues.     

EMILIA, the LS counting efficiency for electron-capture and capture-gamma emitters

This version includes new aspects that improve the computation of the counting efficiency for each one of the three available atomic rearrangement detection models (i.e., KLM, KL₁L₂L₃M and KLMN). The first modification involves a correction algorithm that simulates the non-linear response of the detector to photoionization for low-energy X-ray photons. Although this correction has the inconvenience of substantially increasing the number of atomic rearrangement detection pathways, the computed counting efficiency for low-Z nuclides is reduced by 2% for moderate quenching in agreement with experiment. The program also simulates how the addition of extra components, such as a quencher or aqueous solutions, affects the counting efficiency. Since the CIEMAT/NIST method requires identical ionization quench functions for the electron-capture nuclide and the tracer, the computation of the counting efficiency for ³H, the low-energy beta-ray emitter commonly used as tracer, is included in the program as an option.

Program summary

Title of program:EMILIACatalogue identifier:ADWKProgram summary URL:http://cpc.cs.qub.ac.uk/summaries/ADWKProgram obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandLicensing previsions: noneComputers: revisions: any IBM PC compatible with 80386 or higher Intel processorsOperating systems under which the program has been tested:MS-DOS and higher systemsProgramming language used:FORTRAN 77Memory required to execute with typical data: 253 kwordNo. of bits in a word: 32No. of lines in distributed program, including test data, etc.:7147No. of bytes in distributed program, including test data, etc.:74 776Distribution format:tar.gzNature of the physical problem: The determination of radioactivity in liquid samples of electron-capture nuclides is demanded in radiation physics, radiation protection, dosimetry, radiobiology and nuclear medicine. The CIEMAT/NIST method has proved to be suitable for radionuclide standardizations when the counting efficiency of the liquid-scintillation spectrometer is sufficiently high. Although the method has widely been applied to beta-ray nuclides, its applicability to electron-capture nuclides nowadays has not the required degree of accuracy. The inaccuracies of the method are mainly induced by the huge number of low-energy electrons and X-ray photons emitted by the atomic rearrangement cascade after the electron-capture process, which are efficiently detected by liquid-scintillation counting, but are of difficult modeling due to the inherent complexity of the atomic rearrangement process and the non-linear response of the spectrometer in the low-energy range.Solution method: A detailed simulation of the non-linear response of the spectrometer to photoionization must include the radiation emitted by the atomic rearrangement cascade. However, a model considering all possible scintillator de-excitations at atomic level increases exponentially the number of atomic rearrangement detection pathways subsequent to capture. Since the contribution of the non-linear effects to the counting efficiency are only corrective, we can approximate the reduced energy involved in the photoionization process to a sum of only three terms: the photoelectron energy, the mean energy of the KXY Auger electrons and the global energy contribution of the remaining radiation (electrons and X-rays) emitted by the atomic rearrangement cascade. The value of each term depends on the nature of the atom in which photoabsorption is produced and on the atom shell from where the photoelectron is ejected. The non-linear correction required to simulate low-energy X-ray photoabsorption is basically important when the scintillator cocktail contains elements of high atomic numbers. For heavy atoms, the K- and L-shell binding energies can be slightly less than the energy of the colliding photon. For such cases, the non-linear effects can play an important role.Restrictions on the complexity of the problem: The simulation of all possible detection pathways of atomic rearrangement that follow to photoionization complicates the problem unnecessary. To correct the non-linear effects we consider only significative photoelectric interactions with the K- and L-shells. Also we assume that K-shell photoionizations only generate three types of entities: the photoelectron itself, KXY Auger electrons and a radiation group that includes the remaining emitted particles. For L-shell photoelectrons the radiation emission subsequent to photoionization is considered as a whole.     

Rearrangement Task by Multiple Mobile Robots With Efficient Calculation of Task Constraints

We address multiple-robot rearrangement problems in this paper. The rearrangement of multiple objects is a fundamental problem involved in numerous applications. In this case, it must be considered that a rearrangement task has constraints regarding the order of the start, grasping and finish time of transportation. Attention to these constraints makes it possible to rearrange rapidly; however, the calculation of the constraints is costly in terms of computation. In this paper, we propose a rearrangement method that calculates constraints efficiently. We analyze constraints and classify them into two groups: those that require less computational cost and those that require more. Robots do not calculate all groups at the same time — the time required for each type of calculation varies. The proposed method is tested in a simulated environment 96 times in six kinds of working environments with up to four mobile robots. Compared to the method that calculates all constraints at the same time, the robots' inactive time is significantly reduced and the total time for task completion is also eventually reduced. The proposed method is incomplete, but can be used to perform most rearrangement problems in a short time.     

METEOR-S WSDI: A Scalable P2P Infrastructure of Registries for Semantic Publication and Discovery of Web Services

Web services are the new paradigm for distributed computing. They have much to offer towards interoperability of applications and integration of large scale distributed systems. To make Web services accessible to users, service providers use Web service registries to publish them. Current infrastructure of registries requires replication of all Web service publications in all Universal Business Registries. Large growth in number of Web services as well as the growth in the number of registries would make this replication impractical. In addition, the current Web service discovery mechanism is inefficient, as it does not support discovery based on the capabilities of the services, leading to a lot of irrelevant matches. Semantic discovery or matching of services is a promising approach to address this challenge. In this paper, we present a scalable, high performance environment for Web service publication and discovery among multiple registries. This work uses an ontology-based approach to organize registries into domains, enabling domain based classification of all Web services. Each of these registries supports semantic publication and discovery of Web services. We believe that the semantic approach suggested in this paper will significantly improve Web service publication and discovery involving a large number of registries. This paper describes the implementation and architecture of the METEOR-S Web Service Discovery Infrastructure, which leverages peer-to-peer computing as a scalable solution.     

Gremlin: an interactive visualization model for analyzing genomic rearrangements

In this work we present, apply, and evaluate a novel, interactive visualization model for comparative analysis of structural variants and rearrangements in human and cancer genomes, with emphasis on data integration and uncertainty visualization. To support both global trend analysis and local feature detection, this model enables explorations continuously scaled from the high-level, complete genome perspective, down to the low-level, structural rearrangement view, while preserving global context at all times. We have implemented these techniques in Gremlin, a genomic rearrangement explorer with multi-scale, linked interactions, which we apply to four human cancer genome data sets for evaluation. Using an insight-based evaluation methodology, we compare Gremlin to Circos, the state-of-the-art in genomic rearrangement visualization, through a small user study with computational biologists working in rearrangement analysis. Results from user study evaluations demonstrate that this visualization model enables more total insights, more insights per minute, and more complex insights than the current state-of-the-art for visual analysis and exploration of genome rearrangements.     

Multiple Robot Rearrangement Planning Using a Territorial Approach and an Extended Project Scheduling Problem Solver

In this paper, we address a multiple robot rearrangement problem. For different applications, problem-solving methods should be able to cope with various working environments. We focus on small working environments in particular with a concentrated arrangement of objects and narrow corridors. In this type of environment, the rearrangement problem can be very complicated because of high computational cost for priority settings to prevent robots from colliding and constraints related to the order of transportation. We propose a practical algorithm that divides a complicated rearrangement problem into simple subproblems. In our method, the rearrangement problem can be reduced to a project scheduling problem using a territorial approach. The application of a territorial approach can relax the complexity of priority settings, but yields new kinds of constraints at the same time. We propose an extended project scheduling problem solver to address these constraints. The solver is constructed on the basis of meta-heuristic strategy and generates the order of transportation that observes constraints. The proposed method is tested in a simulated environment with up to four mobile robots and 12 movable objects. Simulation results show the effectiveness of our method with respect to the applicability and a reasonable calculation time.     

Planar rearrangements of fullerenes

A notion of planar rearrangement of fullerenes is proposed as a general framework for all conceivable rearrangements of fullerenes satisfying a minimum physicochemical condition. The planar rearrangement is defined as an edge relocation such that the planarity of a given Schlegel diagram remains undisturbed. Graph-theoretical properties of planar rearrangements are discussed and characteristics for establishing a hierarchy between them are pointed out. A number of graph-theoretical concepts have been introduced to provide means for classification and systematic generation of fullerene rearrangements. The simpliest nontrivial rearrangements is shown to be the Stone-Wales rearrangement.