您的位置: 专家智库 > >

国家自然科学基金(DAAD)

作品数:2 被引量:4H指数:1
发文基金:国家自然科学基金安徽省自然科学基金更多>>
相关领域:医药卫生理学更多>>

文献类型

  • 2篇中文期刊文章

领域

  • 1篇医药卫生
  • 1篇理学

主题

  • 1篇神经网
  • 1篇神经网络
  • 1篇偏心因子
  • 1篇SOLVIN...
  • 1篇TOPOLO...
  • 1篇LARGE
  • 1篇CONVEX
  • 1篇SEQUEN...
  • 1篇SYMMET...
  • 1篇COMPEN...
  • 1篇IMPLEM...

传媒

  • 1篇仪器仪表学报
  • 1篇Journa...

年份

  • 1篇2007
  • 1篇2005
2 条 记 录,以下是 1-2
排序方式:
Eccentric error and compensation in rotationally symmetric laser triangulation被引量:4
2007年
Rotationally symmetric triangulation(RST)sensor has more flexibility and less uncertainty limits because of the abaxial rotationally symmetric optical system.But if the incident laser is eccentric,the symmetry of the image will descend,and it will result in the eccentric error especially when some part of the imaged ring is blocked.The model of rotationally symmetric triangulation that meets the Schimpflug condition is presented in this paper.The error from eccentric incident laser is analysed.It is pointed out that the eccentric error is composed of two parts,one is a cosine in circumference and proportional to the eccentric departure factor,and the other is a much smaller quadric factor of the departure.When the ring is complete,the first error factor is zero because it is integrated in whole ring, but if some part of the ring is blocked,the first factor will be the main error.Simulation verifies the result of the a- nalysis.At last,a compensation method to the error when some part of the ring is lost is presented based on neural network.The results of experiment show that the compensation will make the absolute maximum error descend to half,and the standard deviation of error descends to 1/3.
Wang LeiGao JunWang XiaojiaJohannes EcksteinPeter Ott
关键词:偏心因子神经网络
SEQUENTIAL CONVEX PROGRAMMING METHODS FOR SOLVING LARGE TOPOLOGY OPTIMIZATION PROBLEMS: IMPLEMENTATION AND COMPUTATIONAL RESULTS
2005年
In this paper, we describe a method to solve large-scale structural optimization problems by sequential convex programming (SCP). A predictor-corrector interior point method is applied to solve the strictly convex subproblems. The SCP algorithm and the topology optimization approach are introduced. Especially, different strategies to solve certain linear systems of equations are analyzed. Numerical results are presented to show the efficiency of the proposed method for solving topology optimization problems and to compare different variants.
Qin NiCh.ZilloberK.Schittkowski
共1页<1>
聚类工具0