首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   316篇
  免费   1篇
  国内免费   1篇
化学   97篇
晶体学   3篇
力学   56篇
数学   84篇
物理学   78篇
  2020年   3篇
  2018年   5篇
  2016年   3篇
  2015年   16篇
  2014年   4篇
  2013年   21篇
  2012年   12篇
  2011年   9篇
  2010年   6篇
  2009年   7篇
  2008年   15篇
  2007年   7篇
  2006年   14篇
  2005年   14篇
  2004年   9篇
  2003年   5篇
  2002年   5篇
  2001年   8篇
  2000年   5篇
  1999年   4篇
  1998年   4篇
  1996年   5篇
  1995年   9篇
  1994年   8篇
  1993年   8篇
  1992年   6篇
  1991年   4篇
  1990年   5篇
  1989年   3篇
  1987年   3篇
  1986年   3篇
  1985年   6篇
  1984年   7篇
  1983年   4篇
  1982年   5篇
  1980年   3篇
  1977年   2篇
  1975年   6篇
  1974年   10篇
  1973年   2篇
  1972年   4篇
  1971年   5篇
  1969年   3篇
  1967年   2篇
  1966年   2篇
  1964年   3篇
  1925年   2篇
  1924年   2篇
  1905年   3篇
  1880年   2篇
排序方式: 共有318条查询结果,搜索用时 600 毫秒
111.
112.
113.
Mathematische Annalen -  相似文献   
114.
115.

We prove that if , a generic Riemann surface of genus 1 admits a meromorphic function (i.e., an analytic branched cover of ) of degree such that every branch point has multiplicity and the monodromy group is the alternating group . To prove this theorem, we construct a Hurwitz space and show that it maps (generically) onto the genus one moduli space.

  相似文献   

116.
Phylogenetic footprints are short pieces of noncoding DNA sequence in the vicinity of a gene that are conserved between evolutionary distant species. A seemingly simple problem is to sort footprints in their order along the genomes. It is complicated by the fact that not all footprints are collinear: they may cross each other. The problem thus becomes the identification of the crossing footprints, the sorting of the remaining collinear cliques, and finally the insertion of the noncollinear ones at "reasonable" positions. We show that solving the footprint sorting problem requires the solution of the "Minimum Weight Vertex Feedback Set Problem", which is known to be NP-complete and APX-hard. Nevertheless good approximations can be obtained for data sets of interest. The remaining steps of the sorting process are straightforward: computation of the transitive closure of an acyclic graph, linear extension of the resulting partial order, and finally sorting w.r.t. the linear extension. Alternatively, the footprint sorting problem can be rephrased as a combinatorial optimization problem for which approximate solutions can be obtained by means of general purpose heuristics. Footprint sortings obtained with different methods can be compared using a version of multiple sequence alignment that allows the identification of unambiguously ordered sublists. As an application we show that the rat has a slightly increased insertion/deletion rate in comparison to the mouse genome.  相似文献   
117.
A comparison deals with the advantages and disadvantages of the classical random-base, exhaustive and gradient searches and presents a precise local search combined global search control strategy including a new, systematic point selection which makes possible the escape from local minima by time. As a demonstration electrochemically etched porous silicon (PS) samples were investigated by spectroscopic ellipsometry (SE). The evaluation process (a global optimisation task) was made in different ways to see the difficulties and the differences among the evaluating possibilities. The new, topographical search (named Gradient Cube search) was compared with some classical methods (Grid search, Random or Monte-Carlo search, and Levenberg-Marquardt gradient search) and with two more complex algorithms (Genetic Algorithms and Simulated Annealing) by evaluating real measurements. The application results prove that the classical methods have difficulties to give enough reliability and precision at the same time in global optimisation tasks if the error surface is hilly. There is therefore a hard need of escaping from local minima, and a need of a systematic evaluation to avoid the uncertainty of random-base evaluation. The Gradient Cube search is an effective, systematic hill-climbing search with high precision and so it can be useful in ellipsometry.  相似文献   
118.
Using the principle of virtual power, we develop general balance equations, interface conditions, triple-junction conditions, and boundary conditions for second-grade nanocrystalline elastic materials undergoing infinitesimal deformations. We further develop thermodynamically consistent constitutive equations and provide a weak formulation of resulting boundary-value problems that automatically yields internal conditions such those that hold across interfaces and at triple junctions.  相似文献   
119.
120.
JPC – Journal of Planar Chromatography – Modern TLC - Diapause in insects typically results in metabolic adjustments that may include the levels of feeding and activity, metabolic rate,...  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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