首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   68356篇
  免费   1998篇
  国内免费   1040篇
化学   34295篇
晶体学   1152篇
力学   3617篇
综合类   57篇
数学   5522篇
物理学   26751篇
  2022年   790篇
  2021年   790篇
  2020年   797篇
  2019年   740篇
  2018年   819篇
  2017年   726篇
  2016年   1325篇
  2015年   1008篇
  2014年   1438篇
  2013年   3173篇
  2012年   3150篇
  2011年   3833篇
  2010年   2617篇
  2009年   2682篇
  2008年   3328篇
  2007年   3162篇
  2006年   2941篇
  2005年   2620篇
  2004年   2285篇
  2003年   1962篇
  2002年   1882篇
  2001年   3184篇
  2000年   2321篇
  1999年   1811篇
  1998年   1264篇
  1997年   1193篇
  1996年   1032篇
  1995年   937篇
  1994年   835篇
  1993年   724篇
  1992年   1037篇
  1991年   1029篇
  1990年   920篇
  1989年   787篇
  1988年   784篇
  1987年   834篇
  1986年   693篇
  1985年   915篇
  1984年   855篇
  1983年   580篇
  1982年   584篇
  1981年   553篇
  1980年   511篇
  1979年   625篇
  1978年   663篇
  1977年   670篇
  1976年   584篇
  1975年   490篇
  1974年   530篇
  1973年   456篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
81.
For any two points p and q in the Euclidean plane, define LUNpq = { v | vR2, dpv < dpq and dqv < dpq}, where duv is the Euclidean distance between two points u and v . Given a set of points V in the plane, let LUNpq(V) = V ∩ LUNpq. Toussaint defined the relative neighborhood graph of V, denoted by RNG(V) or simply RNG, to be the undirected graph with vertices V such that for each pair p,qV, (p,q) is an edge of RNG(V) if and only if LUNpq (V) = ?. The relative neighborhood graph has several applications in pattern recognition that have been studied by Toussaint. We shall generalize the idea of RNG to define the k-relative neighborhood graph of V, denoted by kRNG(V) or simply kRNG, to be the undirected graph with vertices V such that for each pair p,qV, (p,q) is an edge of kRNG(V) if and only if | LUNpq(V) | < k, for some fixed positive number k. It can be shown that the number of edges of a kRNG is less than O(kn). Also, a kRNG can be constructed in O(kn2) time. Let Ec = {epq| pV and qV}. Then Gc = (V,Ec) is a complete graph. For any subset F of Ec, define the maximum distance of F as maxepqFdpq. A Euclidean bottleneck Hamiltonian cycle is a Hamiltonian cycle in graph Gc whose maximum distance is the minimum among all Hamiltonian cycles in graph Gc. We shall prove that there exists a Euclidean bottleneck Hamiltonian cycle which is a subgraph of 20RNG(V). Hence, 20RNGs are Hamiltonian.  相似文献   
82.
83.
Lipase from Candida rugosa was covalently anchored onto acid-treated multi-walled carbon nanotubes (MWNTs) through a self-catalytic mechanism. A variety of characterization techniques including FTIR, Raman spectroscopy, and XPS were employed to demonstrate the formation of the ester linkage between lipase and MWNTs. The MWNTs-lipase biocomposites showed significantly increased solubility in some common-used organic solvents, such as THF, DMF and chloroform. This study may offer a novel and facile route for covalent modification of carbon nanotubes, and expand the potential utilization of both lipases and MWNTs in the fields of biocatalyst and biosensor.  相似文献   
84.
A fast electrooptic modulation in a polymer waveguide using a ferroelectric liquid crystal has been proposed. In this device, the surface stabilized ferroelectric liquid crystal and the soft mode ferroelectric liquid crystal are used as an active material on the passive polymer waveguide, and electrooptic switching is realized by controlling the total reflection at the polymer waveguide-liquid crystal interface. The response time is of the order of several microseconds. The analogue electrooptic modulation in the waveguide is realized using the field induced linear molecular tilt of the electroclinic effect in the soft mode ferroelectric liquid crystal.  相似文献   
85.
A novel method using small neon glow lamps with electrodes is developed for measuring intense microwave field patterns. When the lamp axis coincide with the electric field direction, the lamp discharge starts at the feeblest microwave electric field strength. Therefore, the lamp axis shows the field direction and the discharge starting indicates the field strength. The field strength for starting the microwave discharge is less than the strength for AC discharge, because of its low loss discharge mechanism. In the experiments using a microwave oven, it has been demonstrated again comparing with the simulated results that the method is able to use for measuring the intense electric field strength and direction.  相似文献   
86.
We report muon spin relaxation/rotation measurements on sintered powder samples of Nd2−x Ce x CuO4−y and a large single crystal of Nd2CuO4−y . We find an electronic phase diagram which is quite similar to that of hole-doped superconductors such as La2−x Sr x CuO4−y , although the doping of electrons into the system is less efficient in destroying the static moments on the copper spins. Static magnetic order in Nd2CuO4−y appears below about 250 K, and two spin reorientations are seen atT=75 K andT=35 K. Measurements of the magnetic field penetration depth have been unsuccessful due to the rare-earth paramagnetism of these materials.  相似文献   
87.
The n-dimensional cube Qn is the graph whose vertices are the subsets of {1,…n}, with two vertices adjacent if and only if their symmetric difference is a singleton. Clearly Qn has diameter and radious n. Write M = n2n-1 = e(Qn) for the size of Qn. Let Q = (Qt)oM be a random Qn-process. Thus Qt is a spanning subgraph of Qn of size t, and Qt is obtained from Qt–1 by the random addition of an edge of Qn not in Qt–1, Let t(k) = τ(Q;δ?k) be the hitting time of the property of having minimal degree at least k. We show that the diameter dt = diam (Qt) of Qt in almost every Q? behaves as follows: dt starts infinite and is first finite at time t(1), it equals n + 1 for t(1) ? t(2) and dt, = n for t ? t(2). We also show that the radius of Qt, is first finite for t = t(1), when it assumes the value n. These results are deduced from detailed theorems concerning the diameter and radius of the almost surely unique largest component of Qt, for t = Ω(M). © 1994 John Wiley & Sons, Inc.  相似文献   
88.
89.
In this paper, we consider a real-life vehicle routeing problem that occurs in a major Swiss company producing pet food and flour. In contrast with usual hypothetical problems, a large variety of restrictions has to be considered. The main constraints are relative to the accessibility and the time windows at customers, the carrying capacities of vehicles, the total duration of routes and the drivers' breaks. To find good solutions to this problem, we propose two heuristic methods: a fast straightforward insertion procedure and a method based on tabu search techniques. Next, the produced solutions are compared with the routes actually covered by the company. Our outcomes indicate that the total distance travelled can be reduced significantly when such methods are used.  相似文献   
90.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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