首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   126篇
  免费   0篇
  国内免费   1篇
化学   4篇
数学   95篇
物理学   10篇
综合类   18篇
  2023年   1篇
  2022年   1篇
  2021年   3篇
  2020年   2篇
  2019年   1篇
  2018年   2篇
  2017年   2篇
  2015年   1篇
  2014年   1篇
  2013年   7篇
  2012年   4篇
  2011年   7篇
  2010年   1篇
  2009年   12篇
  2008年   10篇
  2007年   9篇
  2006年   8篇
  2005年   5篇
  2004年   4篇
  2003年   3篇
  2002年   3篇
  2001年   3篇
  2000年   3篇
  1999年   6篇
  1998年   7篇
  1997年   5篇
  1996年   1篇
  1995年   2篇
  1994年   5篇
  1992年   1篇
  1990年   2篇
  1989年   1篇
  1988年   1篇
  1986年   1篇
  1985年   1篇
  1980年   1篇
排序方式: 共有127条查询结果,搜索用时 15 毫秒
121.
Following the work of Schur and Coleman, we prove the generalized Laguerre polynomial is irreducible over the rationals for all n?1 and has Galois group An if n+1 is an odd square, and Sn otherwise. We also show that for certain negative integer values of α and certain congruence classes of n modulo 8, the splitting field of Ln(α)(x) can be embedded in a double cover.  相似文献   
122.
Given any plane strictly convex region K and any positive integer n≥3, there exists an inscribed 2n-gon Q 2n and a circumscribed n-gon P n such that
The inequality is the best possible, as can be easily seen by letting K be an ellipse. As a corollary, it follows that for any convex region K and any n≥3, there exists a circumscribed n-gon P n such that
This improves the existing bounds for 5≤n≤11.  相似文献   
123.
Central configurations consist of two layer twisted regular polygons   总被引:3,自引:0,他引:3  
In this paper, we study the existence of a special twisted regular polygonal central configuration in R3.  相似文献   
124.
An effective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons P1, P2, P3, …, Pk in a container polygon Q, translate and rotate the polygons to diminish their overlap to a local minimum. A (local) overlap minimum has the property that any perturbation of the polygons increases the overlap. Overlap minimization is modified to create a practical algorithm for compaction: starting with a non-overlapping layout in a rectangular container, plan a non-overlapping motion that diminishes the length or area of the container to a local minimum. Experiments show that both overlap minimization and compaction work well in practice and are likely to be useful in industrial applications.  相似文献   
125.
In this paper we show that the h-p spectral element method developed in [3,8,9] applies to elliptic problems in curvilinear polygons with mixed Neumann and Dirichlet boundary conditions provided that the Babuska-Brezzi inf-sup conditions are satisfied. We establish basic stability estimates for a non-conforming h-p spectral element method which allows for simultaneous mesh refinement and variable polynomial degree. The spectral element functions are non-conforming if the boundary conditions are Dirichlet. For problems with mixed boundary conditions they are continuous only at the vertices of the elements. We obtain a stability estimate when the spectral element functions vanish at the vertices of the elements, which is needed for parallelizing the numerical scheme. Finally, we indicate how the mesh refinement strategy and choice of polynomial degree depends on the regularity of the coefficients of the differential operator, smoothness of the sides of the polygon and the regularity of the data to obtain the maximum accuracy achievable. An erratum to this article is available at .  相似文献   
126.
127.
理想材料零件实体模型自动添加支撑技术研究   总被引:1,自引:0,他引:1  
在一些RP工艺中,给各种形状的零件添加支撑对于完成零件的制造和保证零件的精度非常重要,但目前尚无很好的自动添加支撑算法能够应用于一般的情况.为此提出两种自动添加支撑算法:曲线追踪法和标志位追踪法.前者主要是在切片前基于追踪得到的采样点利用蒙面法重构支撑面片;而后者则是在切片后通过多边形的布尔运算逐层计算各切层端面的实际轮廓和综合轮廓.这两种算法形成了一种新的自动添加支撑方案.实例证明了这种方案的有效性和便利性.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号