首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5893篇
  免费   251篇
  国内免费   14篇
化学   4315篇
晶体学   10篇
力学   107篇
数学   888篇
物理学   838篇
  2023年   40篇
  2022年   44篇
  2021年   71篇
  2020年   102篇
  2019年   110篇
  2018年   66篇
  2017年   58篇
  2016年   160篇
  2015年   174篇
  2014年   196篇
  2013年   288篇
  2012年   363篇
  2011年   400篇
  2010年   217篇
  2009年   194篇
  2008年   288篇
  2007年   314篇
  2006年   312篇
  2005年   293篇
  2004年   302篇
  2003年   212篇
  2002年   191篇
  2001年   115篇
  2000年   79篇
  1999年   93篇
  1998年   85篇
  1997年   102篇
  1996年   79篇
  1995年   73篇
  1994年   88篇
  1993年   63篇
  1992年   54篇
  1991年   55篇
  1990年   41篇
  1989年   50篇
  1988年   39篇
  1987年   41篇
  1986年   49篇
  1985年   55篇
  1984年   60篇
  1983年   44篇
  1982年   58篇
  1981年   35篇
  1980年   44篇
  1979年   65篇
  1978年   44篇
  1977年   51篇
  1976年   34篇
  1974年   22篇
  1973年   28篇
排序方式: 共有6158条查询结果,搜索用时 78 毫秒
1.
2.
Mass spectrometry (MS) driven metabolomics is a frequently used tool in various areas of life sciences; however, the analysis of polar metabolites is less commonly included. In general, metabolomic analyses lead to the detection of the total amount of all covered metabolites. This is currently a major limitation with respect to metabolites showing high turnover rates, but no changes in their concentration. Such metabolites and pathways could be crucial metabolic nodes (e.g., potential drug targets in cancer metabolism). A stable-isotope tracing capillary electrophoresis–mass spectrometry (CE-MS) metabolomic approach was developed to cover both polar metabolites and isotopologues in a non-targeted way. An in-house developed software enables high throughput processing of complex multidimensional data. The practicability is demonstrated analyzing [U-13C]-glucose exposed prostate cancer and non-cancer cells. This CE-MS-driven analytical strategy complements polar metabolite profiles through isotopologue labeling patterns, thereby improving not only the metabolomic coverage, but also the understanding of metabolism.  相似文献   
3.
4.
5.
6.
We prove that a spread S over a locally compact nondlscrete field F defines a topological translation plane if and only if the spread is compact. For F=R, this is implicit in Breuning's thesis [Bre], cf. [B 2]. For the proof, we describe the point set of the projective translation plane as a quotient space of some projective space, with identifications taking place in one hyperplane. This is new even for F=R.  相似文献   
7.
8.
This paper is devoted to the numerical study of diffraction by periodic structures of plane waves under oblique incidence. For this situation Maxwell's equations can be reduced to a system of two Helmholtz equations in R 2 coupled via quasiperiodic transmission conditions on the piecewise smooth interfaces between different materials. The numerical analysis is based on a strongly elliptic variational formulation of the differential problem in a bounded periodic cell involving nonlocal boundary operators. We obtain existence and uniqueness results for discrete solutions and provide the corresponding error analysis.  相似文献   
9.
The paper proposes a rational method to derive fairness measures for surfaces. It works in cases where isophotes, reflection lines, planar intersection curves, or other curves are used to judge the fairness of the surface. The surface fairness measure is derived by demanding that all the given curves should be fair with respect to an appropriate curve fairness measure. The method is applied to the field of ship hull design where the curves are plane intersections. The method is extended to the case where one considers, not the fairness of one curve, but the fairness of a one parameter family of curves. Six basic third order invariants by which the fairing measures can be expressed are defined. Furthermore, the geometry of a plane intersection curve is studied, and the variation of the total, the normal, and the geodesic curvature and the geodesic torsion is determined.  相似文献   
10.
We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.

This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.

This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

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