首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   796篇
  免费   24篇
  国内免费   3篇
化学   409篇
晶体学   5篇
力学   44篇
数学   148篇
物理学   217篇
  2023年   5篇
  2022年   3篇
  2021年   11篇
  2020年   14篇
  2019年   5篇
  2018年   9篇
  2017年   7篇
  2016年   25篇
  2015年   16篇
  2014年   33篇
  2013年   58篇
  2012年   45篇
  2011年   65篇
  2010年   39篇
  2009年   29篇
  2008年   41篇
  2007年   44篇
  2006年   42篇
  2005年   37篇
  2004年   39篇
  2003年   13篇
  2002年   21篇
  2001年   24篇
  2000年   14篇
  1999年   7篇
  1998年   5篇
  1997年   8篇
  1996年   7篇
  1995年   12篇
  1994年   11篇
  1993年   12篇
  1992年   15篇
  1991年   9篇
  1990年   6篇
  1989年   8篇
  1988年   11篇
  1987年   4篇
  1986年   3篇
  1985年   7篇
  1984年   4篇
  1983年   4篇
  1982年   7篇
  1981年   6篇
  1980年   4篇
  1979年   3篇
  1978年   3篇
  1977年   3篇
  1975年   4篇
  1973年   6篇
  1899年   2篇
排序方式: 共有823条查询结果,搜索用时 15 毫秒
1.
This paper considers the problem of building a set of hybrid abstractions for affine systems in order to compute over approximations of the reachable space. Each abstraction is based on a decomposition of the continuous state space that is defined by hyperplanes generated by linear combinations of two vectors. The choice of these vectors is based on consideration of the dynamics of the system and uses, for example, the left eigenvectors of the matrix that defines these dynamics. We show that the reachability calculus can then be performed on a combination of such abstractions and how its accuracy depends on the choice of hyperplanes that define the decomposition.  相似文献   
2.
The auction algorithm for the transportation problem   总被引:1,自引:0,他引:1  
The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems.  相似文献   
3.
We discuss the preparation and spectroscopic characterisation of a single InAs/InP quantum dot suitable for long-distance quantum key distribution applications around λ=1.55 μm. The dot is prepared using a site-selective growth technique which allows a single dot to be deposited in isolation at a controlled spatial location. Micro-photoluminescence measurements as a function of exciton occupation are used to determine the electronic structure of the dot. Biexciton emission, shell filling and many-body re-normalization effects are observed for the first time in single InAs/InP quantum dots.  相似文献   
4.
We prove universality at the edge of the spectrum for unitary (β = 2), orthogonal (β = 1), and symplectic (β = 4) ensembles of random matrices in the scaling limit for a class of weights w(x) = e?V(x) where V is a polynomial, V(x) = κ2mx2m + · · ·, κ2m > 0. The precise statement of our results is given in Theorem 1.1 and Corollaries 1.2 and 1.4 below. For the same class of weights, a proof of universality in the bulk of the spectrum is given in [12] for the unitary ensembles and in [9] for the orthogonal and symplectic ensembles. Our starting point in the unitary case is [12], and for the orthogonal and symplectic cases we rely on our recent work [9], which in turn depends on the earlier work of Widom [46] and Tracy and Widom [42]. As in [9], the uniform Plancherel‐Rotach‐type asymptotics for the orthogonal polynomials found in [12] plays a central role. The formulae in [46] express the correlation kernels for β = 1, 4 as a sum of a Christoffel‐Darboux (CD) term, as in the case β = 2, together with a correction term. In the bulk scaling limit [9], the correction term is of lower order and does not contribute to the limiting form of the correlation kernel. By contrast, in the edge scaling limit considered here, the CD term and the correction term contribute to the same order: this leads to additional technical difficulties over and above [49]. © 2006 Wiley Periodicals, Inc.  相似文献   
5.
Signaling in living systems needs to achieve high specificity, to be reversible, and to achieve high signal to noise. Signaling mediated by multiprotein systems has evolved that avoids the requirement for high-affinity binary complexes that would be difficult to reverse and which, in the overcrowded cell, would lead to excessive noise in the system. Symmetrical structures are only occasionally formed. When they are, it is principally to colocate components, for example, the tyrosyl kinases of growth factors, where dimers form. Symmetry is, however, often broken, presumably to create more sensitivity and specificity in the signaling system by assembling other components, into higher-order multiprotein systems. The binding of a single heparin to two 1:1 FGF:FGFR complexes is an example, as is the binding of a single ligase to the Xrcc4 dimer, perhaps so creating a further DNA-binding site.  相似文献   
6.
We announce the classification of all firm and residually connected geometries satisfying the conditions (I P)2 and (2T)1 and on which the Mathieu group M 22 acts flag-transitively and residually weakly primitively. The complete list of geometries is available as a supplement to this note [6].  相似文献   
7.
We construct nine rank five incidence geometries that are firm and residually connected and on which the Mathieu group M22 acts flag-transitively. The constructions use mainly objects arising from the Steiner systemS(3, 6, 22). One of these geometries was constructed by Meixner and Pasini in [10]. Three of them are obtained from the geometry of Meixner and Pasini using doubling (see [8] or [12]) or similar constructions. The remaining five are new and four of them have a star diagram. These latter four geometries are constructed using special partitions of the 22 points of the Steiner system S(3, 6, 22).  相似文献   
8.
9.
10.
Thin layers of cellulose I nanocrystals were spin-coated onto silicon wafers to give a flat model cellulose surface. A mild heat treatment was required to stabilize the cellulose layer. Interactions of this surface with polyelectrolyte layers and multilayers were probed by atomic force microscopy in water and dilute salt solutions. Deflection–distance curves for standard silicon nitride tips were measured for silicon, cellulose-coated silicon, and for polyelectrolytes adsorbed on the cellulose surface. Transfer of polymer to the tip was checked by running deflection–distance curves against clean silicon. Deflection–distance curves were relatively insensitive to adsorbed polyelectrolyte, but salt addition caused transfer of cationic polyelectrolyte to the tip, and swelling of the polyelectrolyte multilayers.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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