Introducing technology in algebra in Hong Kong: addressing issues in learning

A review of recent studies in Hong Kong suggests that possible problems in secondary school algebra may be due to the procedural paradigm orientation in the curriculum and the conventional style of teaching in the classroom which do not provide sufficient opportunities for students to develop conceptual understanding. Based on the works of a number of projects in the West, it is hypothesized that the introduction of technology in lessons which embody a cognitive model in their design and delivery will provide a viable alternative for enhancing algebraic thinking. The key features of the cognitive model are concrete preparation, cognitive conflict, construction, metacognition and bridging, imbedded in a ‘mediation’ style of teaching. These features are exemplified by detailed accounts of classroom episodes from a Hong Kong lesson supported by the use of graphics calculators. Results indicate that while the approach places particular demands on teachers (a tension between a transmission style of teaching and mediating) there is real potential for supporting more dynamic student constructions.     

基于主动学习神经网络的转向架构架疲劳可靠性分析

为了提高转向架构架疲劳可靠性分析的精度与效率,提出一种主动学习BR-BP神经网络模型与Monte Carlo法相结合的可靠性分析方法。该方法针对BP神经网络的缺陷,使用贝叶斯正则BR(Bayesian regularization)算法作为训练算法,以提高神经网络的拟合精度与收敛速度,并考虑可靠性分析的固有特点,构造了一种适用于BP神经网络的主动学习函数,用于指导最佳样本点的选择。提出的学习函数不仅保证了样本点分布在极限状态函数附近,还考虑了样本点的预测误差以及样本点分布对失效概率计算的影响。转向架构架可靠性分析结果表明,本文方法在提高拟合精度的同时兼顾了计算效率,验证了所提方法的优越性与可行性。     

基于更新支持向量的大跨度斜拉桥体系可靠度分析

针对斜拉桥静力体系可靠度分析中隐式功能函数重构和繁杂失效路径的特点,提出了一种基于更新支持向量的体系可靠度分析方法,将传统的用于构件可靠度分析的支持向量机(SVM)改进并应用于斜拉桥体系可靠度分析。该方法主要有4个步骤:首先通过构件的敏感分析识别斜拉桥的主要失效路径;其次采用最小二乘支持向量机(LS-SVM)对斜拉桥的隐式功能函数进行重构,并通过Monte-Carlo抽样得出构件的可靠指标;然后根据已经更新的有限元模型对支持向量进行更新,得出相关构件失效后的剩余构件的条件可靠指标;最后由结构体系的失效树和串并联关系得出斜拉桥的体系可靠度。主跨为420m的混凝土斜拉桥算例分析表明了上述算法的有效性和实用性,同时也获得了该斜拉桥的主要失效路径并识别了影响其体系可靠度的主要构件。     

一致L-Lipschitz的渐近伪压缩映象不动点的Ishikawa迭代逼近问题

在任意实的Banach空间中研究了用具误差的修正的Ishikawa与Mann迭代程序来逼近一致L-Lipschitz的渐近伪压缩映象不动点的强收敛性问题,在去掉条件$$\sum\limits_{n=0}^{\infty}\alpha_{n}^{2}<\infty, \q \sum\limits_{n=0}^{\infty }\gamma_{n}<\infty,\q \sum\limits_{n=0}^{\infty }\alpha_{n}(\beta_{n}+\delta_{n})<\infty,\q \sum\limits_{n=0}^{\infty}\alpha_{n}(k_{n}-1)<\infty$$之下,证明了相关文献的结果仍然成立.所得结果不但改进和推广了最近一些人的最新结果,而且也从根本上改进了定理的证明方法.     

乌龟线粒体细胞色素b基因片段的初步研究

于2004年3月从浙江省级中华草龟良种场采集5只乌龟（Chinemys reevesii）．参照鱼类的线粒体细胞色素b基因序列设计合成1对引物，扩增了乌龟的细胞色素b基因片段，并对扩增产物进行序列测定分析．结果在5个个体中都获得序列相同的细胞色素b基因片段，长度为408bp，其中A、T、G、C含量分别为125bp（30．6％）、113bp（27、7％）、51bp（12．5％）、119bp（29．2％），与其他水生动物相同基因片段碱基序列含量相似．     

On matching numbers of tree and bipartite degree sequences

We study the possible values of the matching number among all trees with a given degree sequence as well as all bipartite graphs with a given bipartite degree sequence. For tree degree sequences, we obtain closed formulas for the possible values. For bipartite degree sequences, we show the existence of realizations with a restricted structure, which allows to derive an analogue of the Gale–Ryser Theorem characterizing bipartite degree sequences. More precisely, we show that a bipartite degree sequence has a realization with a certain matching number if and only if a cubic number of inequalities similar to those in the Gale–Ryser Theorem are satisfied. For tree degree sequences as well as for bipartite degree sequences, the possible values of the matching number form intervals.     

单一生产商单一零售商供应链中最优生产与运输协调策略研究

在供应链背景下,易腐品的生产运输协调决策具有非常重要的现实意义,也是近几年研究的热点问题。本文在前人研究的基础上,通过引入安全库存并将其作为决策变量,拓展了易腐品生产运输协调决策模型;并证明了最佳运输批量序列一定是单调不减的及第一次补货时一定要清空库存;进而证明了最佳运输批量序列的具体形式并提出了一种运输策略。本文的目标是在新的运输策略下最大化单一生产商单一零售商供应链系统的利润,找到最佳运输批量、最佳生产时间以及运输次数。最后,本文进行了算例分析,用来验证本文提出的模型。     

Diagonal multilinear operators on Köthe sequence spaces

We analyse the interplay between maximal/minimal/adjoint ideals of multilinear operators (between sequence spaces) and their associated Köthe sequence spaces. We establish relationships with spaces of multipliers and apply these results to describe diagonal multilinear operators from Lorentz sequence spaces. We also define and study some properties of the ideal of (E, p)-summing multilinear mappings, a natural extension of the linear ideal of absolutely (E, p)-summing operators.     

一类适应随机变量序列的强极限定理

研究了一类适应随机变量序列的局部收敛性,推广了文献[1]中的结论.并在假定部分和序列为极限鞅时,得到了极限鞅的强极限定理.最后给出了*-mixing序列的强大数定律.