大型喷浆机器人的灵巧度分析

灵巧度是衡量机器人运动失真程度的重要参数。对机器人灵巧度评价指标进行了对比研究 ,结合大型喷浆机器人自由度较多的特点 ,用雅可比矩阵的条件数对喷浆机器人的灵巧度进行了分析。结果表明 ,大型喷浆机器人在不同形位下的条件数都很小 ,具有较好的运动灵巧度。     

一种考虑补偿信用风险资本要求的算法

基于现行法定资本体制不考虑信用投资组合的多样化和限制空头信用风险头寸的补偿能力，设计了一种考虑补偿的信用风险资本要求的计算方法．该算法根据信用等级决定风险权重，可以更精确地测定信用风险资本．采用期限分段方法建立一个期间结构，区分当前和远期信用风险，考虑多头与空头信用风险头寸间的补偿．     

带有非局部源项的发展方程全局解的不存在性

通过试验函数法,本文讨论了具有形如‖u‖p或‖ Du‖p的非局部源项的发展方程全局解的不存在性.     

秋水仙素诱导青虾次级卵母细胞二倍体初探

以青虾卵巢为材料，采用秋水仙素诱导多倍体次级卵母细胞．经滴片试验，确立此实验最佳滴片高度为1．5cm，通过设置5个秋水仙素浓度(0．08～0．40mg／mL)及3个作用时间(6～24h)，观察发生染色体加倍的细胞相对数目．实验结果表明：在使用秋水仙素的浓度为0．08～0．40mg／mL，处理6～24h时都可以获得多倍体卵细胞．在秋水仙素浓度是0．32mg／mL，处理6h可得到最高二倍体突变率(32．58％)．还测试了0．32mg／mL COM作用6h时ATPase活性与生理盐水对照组的变化，结果显示COM会在一定程度上影响细胞的新陈代谢．但是50％左右的成活率表明，这种诱导突变的方法仍具有一定的应用价值．     

PDE-Based Medial Axis Extraction and Shape Manipulation of Arbitrary Meshes

Shape skeletonization （i.e., medial axis extraction） is powerful in many visual computing applications, such as pattern recognition, object segmentation, registration, and animation. In this paper, the authors expand the use of diffusion equations combined with distance field information to approximate medial axes of arbitrary 3D differential properties. It offers an alternative solids represented by polygonal meshes based on their but natural way for medial axis extraction for commonly used 3D polygonal models. By solving the PDE along time axis, this system can not only quickly extract diffusion-based medial axes of input meshes, but also allow users to visualize the extraction process at each time step. In addition, the proposed model provides users a set of manipulation toolkits to sculpt extracted medial axes, then use diffusion-based techniques to recover corresponding deformed shapes according to the original input datasets. This skeleton-based shape manipulation offers a fast and easy way for animation and deformation of complicated mesh objects.     

广义IMBq方程的各向异性有限元方法

研究了广义IMBq方程的各向异性有限元方法,在不需要传统的Ritz投影的情况下,得到了半离散格式下的误差估计.     

Systemic Intervention in a University Department: Reflections on Arrested Action Research

This paper reflects on my experience as an insider researcher attempting to use critical systems ideas and practices to promote quality improvement in a university engineering department. Reflection is a key part of learning. This paper is intended to contribute to critically, self-reflective learning for the community of systems practitioners. These reflections on my questions about participation, ethics, politics of process, and the choices and actions resulting from them may help others to formulate their own. The complexity of systems practice places substantial demands on the researcher, particularly in the case of insider, practitioner research. Nevertheless, the exploration of critical systems approaches to critique boundaries and structure ‘problems’ in the core aspects of higher education in locally meaningful ways should continue. While demanding, it still can work to promote learning about authentic quality.     

浅谈吕梁三泉焦化工业园区区域定位研究

文章以科学发展观为指导,以做大、做强、做优特色园区为目标,以实现高效、稳健、科学发展为前提,分析并提出了吕梁三泉焦化工业园区的发展定位.     

PEAK COVARIANCE STABILITY OF A RANDOM RICCATI EQUATION ARISING FROM KALMAN FILTERING WITH OBSERVATION LOSSES

We consider the stability of a random Riccati equation with a Markovian binary jump coefficient. More specifically, we are concerned with the boundedness of the solution of a random Riccati difference equation arising from Kalman filtering with measurement losses. A sufficient condition for the peak covariance stability is obtained which has a simpler form and is shown to be less conservative in some cases than a very recent result in existing literature. Furthermore, we show that a known sufficient condition is also necessary when the observability index equals one.     

CONSTRUCTIVE KISSING NUMBERS IN HIGH-DIMENSIONAL SPACES

In the present paper, we focus on constructive spherical codes. By employing algebraic geometry codes, we give an explicit construction of spherical code sequences. By making use of the idea involved in the proof of the Gilbert-Varshamov bound in coding theory, we construct a spherical code sequence in exponential time which meets the best-known asymptotic bound by Shamsiev and Wyner.