首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6480篇
  免费   248篇
  国内免费   29篇
化学   4565篇
晶体学   42篇
力学   179篇
数学   985篇
物理学   986篇
  2024年   5篇
  2023年   51篇
  2022年   115篇
  2021年   222篇
  2020年   170篇
  2019年   160篇
  2018年   122篇
  2017年   119篇
  2016年   264篇
  2015年   228篇
  2014年   239篇
  2013年   357篇
  2012年   432篇
  2011年   517篇
  2010年   294篇
  2009年   274篇
  2008年   409篇
  2007年   382篇
  2006年   373篇
  2005年   348篇
  2004年   310篇
  2003年   255篇
  2002年   211篇
  2001年   78篇
  2000年   70篇
  1999年   77篇
  1998年   49篇
  1997年   54篇
  1996年   81篇
  1995年   48篇
  1994年   48篇
  1993年   42篇
  1992年   49篇
  1991年   39篇
  1990年   23篇
  1989年   22篇
  1988年   13篇
  1987年   16篇
  1986年   21篇
  1985年   25篇
  1984年   24篇
  1983年   24篇
  1982年   16篇
  1981年   12篇
  1980年   14篇
  1979年   18篇
  1977年   8篇
  1976年   5篇
  1975年   3篇
  1906年   2篇
排序方式: 共有6757条查询结果,搜索用时 31 毫秒
31.
 We are given a unique rectangular piece of stock material S, with height H and width W, and a list of m rectangular shapes to be cut from S. Each shape's type i (i = 1, ..., m) is characterized by a height , a width , a profit , and an upper bound ub i indicating the maximum number of items of type i which can be cut. We refer to the Two-Dimensional Knapsack (TDK) as the problem of determining a cutting pattern of S maximizing the sum of the profits of the cut items. In particular, we consider the classical variant of TDK in which the maximum number of cuts allowed to obtain each item is fixed to 2, and we refer to this problem as 2-staged TDK (2TDK). For the 2TDK problem we present two new Integer Linear Programming models, we discuss their properties, and we compare them with other formulations in terms of the LP bound they provide. Finally, both models are computationally tested within a standard branch-and-bound framework on a large set of instances from the literature by reinforcing them with the addition of linear inequalities to eliminate symmetries. Received: October 17, 2000 / Accepted: December 19, 2001 Published online: September 27, 2002 Key words. packing – cutting – integer linear programming  相似文献   
32.
A ruthenium-catalyzed ring opening-ring closing metathesis reaction serves as the key step in the stereoselective synthesis of a new enantiopure 2-substituted-4,5-dehydropiperidine skeleton, a valuable intermediate for the synthesis of piperidine alkaloids (such as (−)-halosaline) and of hydroxylated quinolizidines (such as (2R,9aR)-(+)-2-hydroxy-quinolizidine).  相似文献   
33.
In this work, chemically and topographically nanopatterned surfaces were produced by a top-down processing approach for biosensing devices. The nanopatterning was the result of the combination of plasma polymerisation (pp) of biofunctional materials and colloidal lithography techniques. The morphological and chemical properties induced by the plasma deposition-etching treatment were characterised by optical method combining ellipsometry and Fourier Transform Infrared spectroscopy studies. This method supported by atomic force microscopy measurements, allowed the full optical characterization of each step of the top-down process. The optical characterization of the end-up nanopatterned samples demonstrated that the chosen process is able to produce well-defined nanostructured surfaces with controlled chemical and morphological properties.  相似文献   
34.
In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located. The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous spaces and network facility location. We will show that the problems presented here have a close connection with continuous dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional facilities location in the continuous case.  相似文献   
35.
36.
37.
A line bundle on a complex projective manifold is said to be lef if one of its powers is globally generated and defines a semismall map in the sense of Goresky-MacPherson. As in the case of ample bundles the first Chern class of lef line bundles satisfies the Hard Lefschetz Theorem and the Hodge-Riemann Bilinear Relations. As a consequence, we prove a generalization of the Grauert contractibility criterion: the Hodge Index Theorem for semismall maps, Theorem 2.4.1. For these maps the Decomposition Theorem of Beilinson, Bernstein and Deligne is equivalent to the non-degeneracy of certain intersection forms associated with a stratification. This observation, joint with the Hodge Index Theorem for semismall maps gives a new proof of the Decomposition Theorem for the direct image of the constant sheaf. A new feature uncovered by our proof is that the intersection forms involved are definite.  相似文献   
38.
The sulfonated calixarene I8C12 acts as a host for homologous merocyanines Mc1 and Mc2 in organic solvents, exhibiting neither selectivity towards the guest dyes nor solvent dependence of the complexation equilibria. In water, on the contrary, only the lower homologue, Mc1, is solubilized in the presence of the calixarene. A combination of UV–visible and fluorescence spectroscopic and photophysical analysis and MD structural simulation of the calixarene-dye complexes was employed to account for the observations, and suggests that a radical change in the complexation mode occurs upon moving from an organic to an aqueous environment.  相似文献   
39.
Polyamide 6 (PA6) nanofibers were prepared from formic acid solutions by using electrospinning technique. The fibers were smooth, defects free and with diameters smaller than 200 nm. Small amounts of a perfluorinated acridine were added as dopant to the feed solution to modify the wettability of the fibers. The effect of doping on the contact angle values is well apparent. The contact angle values go from 50° of pure PA6 to 120° when 6% of acridine is added. A comparison between fibers and films of pure and doped polyamide 6 was carried out in order to determine the effect of morphology on wettability. Thermal annealing near the Tg of the polymer promoted the segregation of the molecules to the surface, reaching contact angles of 131° with smaller amounts (4%) of acridine. The surface segregation was also promoted by time aging.  相似文献   
40.
We discuss various scattering properties of the classical system ofn repelling particles on the real line. In the integrable case, i.e. if the asymptotic velocities are preserved under the scattering map, the asymptotic phases behave as if the particles collided pairwise.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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