首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   138912篇
  免费   12544篇
  国内免费   9006篇
化学   44445篇
晶体学   1959篇
力学   7688篇
综合类   1558篇
数学   46248篇
物理学   58564篇
  2023年   693篇
  2022年   946篇
  2021年   2199篇
  2020年   2156篇
  2019年   2443篇
  2018年   2137篇
  2017年   2100篇
  2016年   2429篇
  2015年   2232篇
  2014年   3918篇
  2013年   6180篇
  2012年   4216篇
  2011年   5268篇
  2010年   5466篇
  2009年   10631篇
  2008年   11771篇
  2007年   10340篇
  2006年   9020篇
  2005年   6681篇
  2004年   6208篇
  2003年   6123篇
  2002年   6356篇
  2001年   5186篇
  2000年   4830篇
  1999年   4484篇
  1998年   3851篇
  1997年   2973篇
  1996年   2692篇
  1995年   3017篇
  1994年   2917篇
  1993年   2371篇
  1992年   1857篇
  1991年   1342篇
  1990年   1157篇
  1989年   988篇
  1988年   977篇
  1987年   734篇
  1986年   527篇
  1985年   1427篇
  1984年   985篇
  1983年   693篇
  1982年   1013篇
  1981年   1161篇
  1980年   1031篇
  1979年   914篇
  1978年   814篇
  1977年   705篇
  1976年   679篇
  1974年   396篇
  1973年   550篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
《Discrete Mathematics》2022,345(12):113083
Let G be a graph, ν(G) the order of G, κ(G) the connectivity of G and k a positive integer such that k(ν(G)?2)/2. Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets V1 and V2 is defined to be Hamiltonian-laceable if such that |V1|=|V2| and for every pair of vertices pV1 and qV2, there exists a Hamiltonian path in G with endpoints p and q, or |V1|=|V2|+1 and for every pair of vertices p,qV1,pq, there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition (X,Y). Define bn(G) to be a maximum integer such that 0bn(G)<min{|X|,|Y|} and (1) for each non-empty subset S of X, if |S||X|?bn(G), then |N(S)||S|+bn(G), and if |X|?bn(G)<|S||X|, then N(S)=Y; and (2) for each non-empty subset S of Y, if |S||Y|?bn(G), then |N(S)||S|+bn(G), and if |Y|?bn(G)<|S||Y|, then N(S)=X; and (3) bn(G)=0 if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition (X,Y) such that |X|=|Y| and bn(G)>0. In this paper, we show that if ν(G)2κ(G)+4bn(G)?4, then G is Hamiltonian-laceable; or if ν(G)>6bn(G)?2, then for every pair of vertices xX and yY, there is an (x,y)-path P in G with |V(P)|6bn(G)?2. We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs.  相似文献   
2.
3.
4.
5.
6.
A reasonable prediction of photofission observables plays a paramount role in understanding the photofission process and guiding various photofission-induced applications, such as short-lived isotope production, nuclear waste disposal, and nuclear safeguards. However, the available experimental data for photofission observables are limited, and the existing models and programs have mainly been developed for neutron-induced fission processes. In this study, a general framework is proposed for characterizing the photofission observables of actinides, including the mass yield distributions (MYD) and isobaric charge distributions (ICD) of fission fragments and the multiplicity and energy distributions of prompt neutrons (np) and prompt γ rays (γp). The framework encompasses various systematic neutron models and empirical models considering the Bohr hypothesis and does not rely on the experimental data as input. These models are then validated individually against experimental data at an average excitation energy below 30 MeV, which shows the reliability and robustness of the general framework. Finally, we employ this framework to predict the characteristics of photofission fragments and the emissions of prompt particles for typical actinides including 232Th, 235, 238U and 240Pu. It is found that the 238U(γ, f) reaction is more suitable for producing neutron-rich nuclei compared to the 232Th(γ, f) reaction. In addition, the average multiplicity number of both np and γp increases with the average excitation energy.  相似文献   
7.
Based on the primal mixed variational formulation, a stabilized nonconforming mixed finite element method is proposed for the linear elasticity on rectangular and cubic meshes. Two kinds of penalty terms are introduced in the stabilized mixed formulation, which are the jump penalty term for the displacement and the divergence penalty term for the stress. We use the classical nonconforming rectangular and cubic elements for the displacement and the discontinuous piecewise polynomial space for the stress, where the discrete space for stress are carefully chosen to guarantee the well-posedness of discrete formulation. The stabilized mixed method is locking-free. The optimal convergence order is derived in the $L^2$-norm for stress and in the broken $H^1$-norm and $L^2$-norm for displacement. A numerical test is carried out to verify the optimal convergence of the stabilized method.  相似文献   
8.
A classical sampling strategy for load balancing policies is power-of-two, where any server pair is sampled with equal probability. This does not cover practical settings with assignment constraints which force non-uniform sampling. While intuition suggests that non-uniform sampling adversely impacts performance, this was only supported through simulations, and rigorous statements have remained elusive. Building on product-form distributions for redundancy systems, we prove the stochastic dominance of uniform sampling for a four-server system as well as arbitrary-size systems in light traffic.  相似文献   
9.
We discuss the length of the longest directed cycle in the sparse random digraph , constant. We show that for large there exists a function such that a.s. The function where is a polynomial in . We are only able to explicitly give the values , although we could in principle compute any .  相似文献   
10.
Given a graph sequence denote by T3(Gn) the number of monochromatic triangles in a uniformly random coloring of the vertices of Gn with colors. In this paper we prove a central limit theorem (CLT) for T3(Gn) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T3(Gn), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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