首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   121篇
  免费   1篇
化学   18篇
力学   5篇
数学   54篇
物理学   45篇
  2023年   1篇
  2017年   1篇
  2016年   2篇
  2014年   3篇
  2013年   3篇
  2012年   3篇
  2011年   6篇
  2010年   2篇
  2009年   3篇
  2008年   4篇
  2007年   3篇
  2006年   3篇
  2005年   5篇
  2003年   3篇
  2002年   4篇
  2001年   5篇
  2000年   8篇
  1999年   4篇
  1998年   4篇
  1997年   1篇
  1996年   1篇
  1995年   5篇
  1994年   12篇
  1993年   8篇
  1992年   4篇
  1991年   2篇
  1990年   2篇
  1989年   2篇
  1985年   1篇
  1983年   1篇
  1981年   1篇
  1980年   3篇
  1979年   1篇
  1975年   1篇
  1972年   2篇
  1971年   1篇
  1967年   2篇
  1966年   4篇
  1965年   1篇
排序方式: 共有122条查询结果,搜索用时 609 毫秒
101.
Hollow piezoelectric cylindrical shell transducers may be made directional for underwater acoustic applications by the use of suitable acoustical baffles and the operational bandwidth may be extended by using multiple resonant modes. A theoretical and experimental investigation was performed for circumferentially baffled piezoelectric cylindrical shell transducers operating in the zero and one modes of extensional vibration. The frequency responses and directivity patterns were analyzed under various conditions of energizing separate halves of electrodes. It was found that the broadest frequency response with nearly constant beamwidth can be obtained when the two halves of the piezoelectric ring are electromechanically excited 90 deg out-of-phase. The experimental results obtained with a proof-of-concept transducer were in good agreement with the theoretical predictions.  相似文献   
102.
103.
Given linearly inseparable sets R of red points and B of blue points, we consider several measures of how far they are from being separable. Intuitively, given a potential separator (“classifier”), we measure its quality (“error”) according to how much work it would take to move the misclassified points across the classifier to yield separated sets. We consider several measures of work and provide algorithms to find linear classifiers that minimize the error under these different measures.  相似文献   
104.
The skeleton of a polyhedral set is the union of its edges and vertices. Let \(\mathcal {P}\) be a set of fat, convex polytopes in three dimensions with n vertices in total, and let f max be the maximum complexity of any face of a polytope in \(\mathcal {P}\). We prove that the total length of the skeleton of the union of the polytopes in \(\mathcal {P}\) is at most O(α(n)?log? n?logf max) times the sum of the skeleton lengths of the individual polytopes.  相似文献   
105.
106.
107.
The star unfolding of a convex polytope with respect to a pointx on its surface is obtained by cutting the surface along the shortest paths fromx to every vertex, and flattening the surface on the plane. We establish two main properties of the star unfolding:
1.  It does not self-overlap: it is a simple polygon.
2.  The ridge tree in the unfolding, which is the locus of points with more than one shortest path fromx, is precisely the Voronoi diagram of the images ofx, restricted to the unfolding.
These two properties permit conceptual simplification of several algorithms concerned with shortest paths on polytopes, and sometimes a worst-case complexity improvement as well:
•  The construction of the ridge tree (in preparation for shortest-path queries, for instance) can be achieved by an especially simpleO(n 2) algorithm. This is no worst-case complexity improvement, but a considerable simplification nonetheless.
•  The exact set of all shortest-path “edge sequences” on a polytope can be found by an algorithm considerably simpler than was known previously, with a time improvement of roughly a factor ofn over the old bound ofO(n 7 logn).
•  The geodesic diameter of a polygon can be found inO(n 9 logn) time, an improvement of the previous bestO(n 10) algorithm.
  相似文献   
108.
109.
110.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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