首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   31231篇
  免费   5030篇
  国内免费   3740篇
化学   22055篇
晶体学   399篇
力学   1821篇
综合类   329篇
数学   3548篇
物理学   11849篇
  2024年   104篇
  2023年   642篇
  2022年   1077篇
  2021年   1134篇
  2020年   1280篇
  2019年   1193篇
  2018年   1036篇
  2017年   990篇
  2016年   1421篇
  2015年   1451篇
  2014年   1729篇
  2013年   2159篇
  2012年   2708篇
  2011年   2768篇
  2010年   1926篇
  2009年   1777篇
  2008年   2033篇
  2007年   1830篇
  2006年   1715篇
  2005年   1414篇
  2004年   1136篇
  2003年   985篇
  2002年   961篇
  2001年   757篇
  2000年   653篇
  1999年   724篇
  1998年   573篇
  1997年   493篇
  1996年   512篇
  1995年   458篇
  1994年   412篇
  1993年   359篇
  1992年   304篇
  1991年   261篇
  1990年   271篇
  1989年   181篇
  1988年   130篇
  1987年   92篇
  1986年   103篇
  1985年   76篇
  1984年   44篇
  1983年   45篇
  1982年   39篇
  1981年   24篇
  1980年   8篇
  1979年   7篇
  1976年   1篇
  1957年   5篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
It is widely accepted that next-generation networks will provide guaranteed services, in contrast to the “best effort” approach today. We study and analyze queueing policies for network switches that support the QoS (Quality of Service) feature. One realization of the QoS feature is that packets are not necessarily all equal, with some having higher priorities than the others. We model this situation by assigning an intrinsic value to each packet. In this paper we are concerned with three different queueing policies: the nonpreemptive model, the FIFO preemptive model, and the bounded delay model. We concentrate on the situation where the incoming traffic overloads the queue, resulting in packet loss. The objective is to maximize the total value of packets transmitted by the queueing policy. The difficulty lies in the unpredictable nature of the future packet arrivals. We analyze the performance of the online queueing policies via competitive analysis, providing upper and lower bounds for the competitive ratios. We develop practical yet sophisticated online algorithms (queueing policies) for the three queueing models. The algorithms in many cases have provably optimal worst-case bounds. For the nonpreemptive model, we devise an optimal online algorithm for the common 2-value model. We provide a tight logarithmic bound for the general nonpreemptive model. For the FIFO preemptive model, we improve the general lower bound to 1.414, while showing a tight bound of 1.434 for the special case of queue size 2. We prove that the bounded delay model with uniform delay 2 is equivalent to a modified FIFO preemptive model with queue size 2. We then give improved upper and lower bounds on the 2-uniform bounded delay model. We also show an improved lower bound of 1.618 for the 2-variable bounded delay model, matching the previously known upper bound.  相似文献   
22.
For 1 ≤ dk, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which ij if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005  相似文献   
23.
For an arbitrary bounded closed set E in the complex plane with complement Ω of finite connectivity, we study the degree of convergence of the lemniscates in Ω.  相似文献   
24.
5-Perfluorophenyl 4,5-dihydro-1H-pyrazoles were synthesized from 1,3-dipolar cycloaddition reaction of perfluorobenyl 2,4,6-triisopropylbenzenesulfonylhydrazone and α,β-unsaturated carbonyl compounds or acrylonitrile in THF or water. It was worthy to note that better results were obtained when water was employed as the solvent, which was considered as an effective, economic and environmentally friendly method to synthesize these pyrazole derivatives.  相似文献   
25.
The reactivity of the surface of poly(ethylene terephthalate) (PET) film under 172 nm UV irradiation (xenon excimer lamp) towards nitrogen-borne 1-octene, n-nonane and heptafluorodecene vapor was investigated. Materials receiving from 0 to 24 J/cm2 of UV were examined by X-ray photoelectron spectroscopy (XPS), time of flight secondary ion mass spectroscopy (ToF/SIMS), water and mineral oil contact angle measurement and atomic force microscopy (AFM). A uniform nanoscale layer developed on PET surface attributed to the grafting reaction between photolytically-produced polymer radicals and vapor phase molecules.  相似文献   
26.
27.
黄翔 《运筹学学报》2005,9(4):74-80
近年来,决定椭圆型方程系数反问题在地磁、地球物理、冶金和生物等实际问题上有着广泛的应用.本文讨论了二维的决定椭圆型方程系数反问题的数值求解方法.由误差平方和最小原则,这个反问题可化为一个变分问题,并进一步离散化为一个最优化问题,其目标函数依赖于要决定的方程系数.本文着重考察非线性共轭梯度法在此最优化问题数值计算中的表现,并与拟牛顿法作为对比.为了提高算法的效率我们适当选择加快收敛速度的预处理矩阵.同时还考察了线搜索方法的不同对优化算法的影响.数值实验的结果表明,非线性共轭梯度法在这类大规模优化问题中相对于拟牛顿法更有效.  相似文献   
28.
A least‐squares meshfree method based on the first‐order velocity–pressure–vorticity formulation for two‐dimensional incompressible Navier–Stokes problem is presented. The convective term is linearized by successive substitution or Newton's method. The discretization of all governing equations is implemented by the least‐squares method. Equal‐order moving least‐squares approximation is employed with Gauss quadrature in the background cells. The boundary conditions are enforced by the penalty method. The matrix‐free element‐by‐element Jacobi preconditioned conjugate method is applied to solve the discretized linear systems. Cavity flow for steady Navier–Stokes problem and the flow over a square obstacle for time‐dependent Navier–Stokes problem are investigated for the presented least‐squares meshfree method. The effects of inaccurate integration on the accuracy of the solution are investigated. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
29.
A new series of copolymers was synthesized through the oxidative polymerization of pyrrole (PY) and o‐phenetidine (PHT) with inorganic oxidants in acidic media. The polymerization parameters including the mixing method of the oxidant with the comonomer, the comonomer ratio, the time, the temperature, the oxidant, the organic medium, and the acid were systematically optimized for the synthesis of copolymers with high yields, intrinsic viscosities, and solubility. The resultant copolymers were characterized by elemental analysis, infrared, ultraviolet–visible, solution high‐resolution 1H NMR and solid‐state high‐resolution 13C NMR, circular dichroism spectroscopy, and cyclic voltammetry. The results showed that the PY observed content in the copolymers was much higher than the PY feed content. The regular variation of the polymerization yield, intrinsic viscosity, solubility, macromolecular structure, and electroactivity of the resulting polymers with the comonomer ratio, together with the complete solubility of a PY/PHT (10/90) polymer in highly polar solvents, indicated the formation of real random copolymers containing both PY and PHT units rather than a mixture of two homopolymers. However, the polymers containing more than 59 mol % PY were not homogeneous copolymers consisting of soluble and insoluble parts. A semiquantitative relationship between the polymerization yield or solubility of the copolymers and the polarity index of the organic solvents was examined. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 2073–2092, 2004  相似文献   
30.
In order to elucidate the distributions of the elements among the particulate and dissolved fractions in pond water, major-to-ultratrace elements in different sizes of particles as well as in the filtrate passed through the 0.05 microm filter were determined by inductively coupled plasma atomic emission spectrometry (ICP-AES) and inductively coupled plasma mass spectrometry (ICP-MS). The different sizes of particle samples (ca. 100-300 microg each) were collected on the membrane filters with pore sizes of 10, 3.0, 1.2, 0.4, 0.2 and 0.05 microm, respectively, by sequential fractionation. As a result, about 40 elements in different sizes of particles could be determined by ICP-AES and ICP-MS, after acid digestion using HNO3/HF/HClO4. Then, the fractional distribution factors of major-to-ultratrace elements among the particulate and dissolved fractions were estimated from the analytical results. The total contents of Al, Fe, Ti, REEs (rare earth elements), Bi, Pb and Ag in the particulate fractions (larger than 0.05 microm) were more than 80-90%, while those of Ca, Sr, Cs, W, Ba, Mn and Co in the dissolved fraction, which corresponded to the filtrate passed through the 0.05 microm membrane filter, were more than 80%. It was further found that the fractional distributions of Cu and Zn in the dissolved fraction were ca. 50%. In addition, the enrichment factors (EFs) of the elements in the particulate fractions with particle sizes of 3.0-10 microm and 0.05-0.2 microm were estimated to elucidate their geochemical characteristics in natural water.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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