Trypsin inhibitor activity of soybean as affected by genotype and fertilisation

The presence of protease inhibitors in soybean prohibits the utilisation of the raw beans for food and feed. However, little information is available about environmental influences and the effects of nitrogen and sulphur supply on the antinutritional constituents of soybean. As these factors may influence protease inhibitors, soybean genotypes segregated according to the presence or absence of the Kunitz trypsin inhibitor have been evaluated for trypsin inhibitor activity (TIA) in field trials. TIA was affected significantly by environment (geographical location), fertilisation treatment and genotype. Environmental means of TIA were between 69.5 and 104.8 mg g^?1. Nitrogen application, which caused an increase in seed protein content, resulted in a reduction in TIA by about 15% as compared with the control. Remarkably, simultaneous application of nitrogen and sulphur in the form of ammonium sulphate had a similar reductive effect on TIA to that of nitrogen application alone, although soybean protease inhibitors are rich in sulphur amino acids. Significant genetic variation in TIA was found both within the genotype class with the Kunitz inhibitor present as well as within the class lacking this inhibitor. The results suggest that TIA of soybean may be modified considerably by genetic improvement and appropriate agronomic management. Copyright © 2003 Society of Chemical Industry     

扁管承压能力的有限元分析

应用有限元分析方法，对相同周长、相同壁厚的扁管在直边段和圆弧半径的不同比值条件下与所能承受最大外压力的关系进行了分析．并对计算分析取得的数据进行拟和得到了扁管在直边段和圆弧半径的不同比值条件下能承受最大外压力的关系及经验公式．     

A method to find all solutions of a system of multivariate polynomial equalities and inequalities in the max algebra

In this paper we show that finding solutions of a system of multivariate polynomial equalities and inequalities in the max algebra is equivalent to solving an Extended Linear Complementarity Problem. This allows us to find all solutions of such a system of multivariate polynomial equalities and inequalities and provides a geometrical insight in the structure of the solution set. We also demonstrate that this enables us to solve many important problems in the max algebra and the max-min-plus algebra such as matrix decompositions, construction of matrices with a given characteristic polynomial, state space transformations and the (minimal) state space realization problem.Research assistant with the N.F.W.O. (Belgian National Fund for Scientific Research).Senior research associate with the N.F.W.O.     

Huffman algebras for independent random variables

Based on a rearrangement inequality by Hardy, Littlewood, and Polya, we define two-operator algebras for independent random variables. These algebras are called Huffman algebras since the Huffman algorithm on these algebras produces an optimal binary tree that minimizes the weighted lengths of leaves. Many examples of such algebras are given. For the case with random weights of the leaves, we prove the optimality of the tree constructed by the power-of-2 rule, i.e., the Huffman algorithm assuming identical weights, when the weights of the leaves are independent and identically distributed.     

面向文本分类的多头注意力池化RCNN模型

针对经典循环卷积神经网络（RCNN）在池化层采用的最大池化策略较为单一,会忽略除最突出特征外的其他特征,影响分类精度的问题,提出基于多头注意力池化的循环卷积神经网络（MHAP-RCNN）模型。多头注意力池化可以充分考虑各特征对分类的贡献,且能在训练过程中动态优化,有效缓解最大池化的单一性问题。在三个公开的文本分类数据集上进行实验,结果表明与经典RCNN及其他各模型相比,提出的模型具有更好的文本分类性能。     

概率最大受限路径相容算法

研究了可用于求解约束满足问题的最大受限路径相容算法(maxRPC).maxRPC算法执行过程中有大量无效的寻找路径相容证明(PC-witness)的操作,有效地识别和避免这些无效的寻找PC-witness的操作,可以提高maxRPC算法的求解效率.首先,提出了在一条约束上任意两个相容的值在任意路径上存在PC-witness的概率;然后,基于这一概率提出了一种概率最大受限路径相容算法(PmaxRPC),并将新算法成功应用于求解约束满足问题的回溯搜索.实验结果显示:PmaxRPC可以避免一部分无效的寻找PC-witness的操作,在求解约束满足问题时,PmaxRPC效率高于maxRPC.在某些测试用例上,PmaxRPC比maxRPC和最流行的弧相容算法效率更高.     

3ds max材质在工业设计产品效果图中的应用

本文介绍了用3ds max来制作三维产品效果图过程中,对材质的调配是至关重要的。3ds max中的材质非常的丰富,表现工业产品材质的类型非常广泛,应用手法也很多样。     

存储最优的连续MAX查询方法

考虑滑动窗口数据流上的连续MAX查询问题,提出了一种存储最优的方法.该方法只需保存数据集中可能成为极大值点的部分数据(候选点集),而将所有完全不可能成为极值点的数据进行丢弃,从而可以有效降低存储开销;提出了一个动态维护候选点集的方法,当数据独立分布时,处理一个新到数据所需的时间为O(1og N),处理数据失效的时间开销为O(1),其中N为滑动窗口包含的全部数据数目.理论分析和实验结果表明了该方法能够适应流速很快的场景,具有较高的效率.     

一种大尺度Gauss模糊的快速采样算法

针对大模板Gauss模糊的传统算法计算复杂度较高的缺点,提出了一种基于快速采样的新算法,将计算复杂度从O(N2)降到O(N)级别.利用极大似然估计理论,对传统Gauss模板和采样模板进行分析,给出了采样算法和传统算法的联系与区别.实验表明,新算法在极大的提高算法的速度的同时,可以将两者之间的能量误差控制在1%左右,当采样点等于10N时,人眼基本无法察觉两种算法的差异.     

基于最大应用模板的服务组合模型

针对面向服务架构中的服务组合问题,提出基于最大应用模板的动态应用定制与服务组合模型,采用最大应用模板描述一类应用的业务逻辑,根据用户输入自动演化生成个性化的应用定制,并以此实现服务组合,采用基于信用的服务质量保证机制和动态重构技术保证组合的服务质量,设计并实现基于该模型的一站式服务平台DACSC,对相关算法进行仿真验证。结果表明该模型可以自动实现应用定制和服务组合,并能降低用户交互次数和服务调度次数,保证组合服务的高可用性。