首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   669篇
  免费   52篇
  国内免费   15篇
化学   36篇
晶体学   1篇
力学   32篇
综合类   21篇
数学   585篇
物理学   61篇
  2023年   9篇
  2022年   15篇
  2021年   16篇
  2020年   23篇
  2019年   17篇
  2018年   11篇
  2017年   20篇
  2016年   33篇
  2015年   17篇
  2014年   31篇
  2013年   59篇
  2012年   24篇
  2011年   31篇
  2010年   29篇
  2009年   40篇
  2008年   44篇
  2007年   32篇
  2006年   24篇
  2005年   22篇
  2004年   20篇
  2003年   26篇
  2002年   19篇
  2001年   15篇
  2000年   22篇
  1999年   20篇
  1998年   17篇
  1997年   5篇
  1996年   10篇
  1995年   2篇
  1994年   8篇
  1993年   7篇
  1992年   6篇
  1991年   2篇
  1990年   1篇
  1989年   4篇
  1988年   5篇
  1987年   4篇
  1986年   2篇
  1985年   6篇
  1984年   7篇
  1983年   7篇
  1982年   10篇
  1981年   5篇
  1980年   4篇
  1978年   3篇
  1975年   1篇
  1973年   1篇
排序方式: 共有736条查询结果,搜索用时 31 毫秒
101.
It has been 20 years since the European Commission adopted the Green Paper on Future Noise Policy in 1996, taking the first comprehensive step towards the development of an EU-wide noise policy. This document envisioned a directive that would harmonise methods for the assessment of environmental noise and the dissemination of information to the public. This led to the establishment of Directive 2002/49/EC in 2002 also known as the Environmental Noise Directive (END). The END called for the development of strategic noise maps and action plans across every EU Member State in five year intervals. Two phases of noise mapping and action planning have now been completed and Member States are about to embark on the third phase of noise mapping, due in 2017. Focussing on results reported to the European Commission, this study summarises the current state of noise mapping, 20 years after the publication of the Green Paper, and identifies critical needs for future noise mapping phases.  相似文献   
102.
Suppose that in a multiple choice examination the leading significant digit of the correct options follows Benford's Law, while the leading digit of the distractors is uniform. Consider a strategy for guessing at answers that selects the option with the lowest leading digit with ties broken at random. We provide an expression for both the probability that this strategy selects the correct option and also the generalization to the probability of selecting the option with the lowest r significant digit string.  相似文献   
103.
The quasi-reversibility method is considered for the non-homogeneous backward Cauchy problem ut+Au = f(t), u(τ) = ? for 0≤t<τ, which is known to be an ill-posed problem. Here, A is a densely defined positive self-adjoint unbounded operator on a Hilbert space H with given data fL1([0,τ],H) and ?H. Error analysis is considered when the data ?, f are exact and also when they are noisy. The results obtained generalize and simplify many of the results available in the literature.  相似文献   
104.
Given a rectangle R with area α and a set of n positive reals A={a1,a2,…,an} with ∑aiAai=α, we consider the problem of dissecting R into n rectangles ri with area so that the set R of resulting rectangles minimizes an objective function such as the sum of the perimeters of the rectangles in R, the maximum perimeter of the rectangles in R, and the maximum aspect ratio of the rectangles in R, where we call the problems with these objective functions PERI-SUM, PERI-MAX and ASPECT-RATIO, respectively. We propose an O(nlogn) time algorithm that finds a dissection R of R that is a 1.25-approximate solution to PERI-SUM, a -approximate solution to PERI-MAX, and has an aspect ratio at most , where ρ(R) denotes the aspect ratio of R.  相似文献   
105.
Dzik [2] gives a direct proof of the axiom of choice from the generalized Lindenbaum extension theorem LET. The converse is part of every decent logical education. Inspection of Dzik’s proof shows that its premise let attributes a very special version of the Lindenbaum extension property to a very special class of deductive systems, here called Dzik systems. The problem therefore arises of giving a direct proof, not using the axiom of choice, of the conditional . A partial solution is provided. Mathematics Subject Classification (2000): Primary 03B22; Secondary 03E25  相似文献   
106.
本文通过对经济、社会、自然租技术诸方面的系统分析,全面论述了上海港新港址的选择.认为上海港新港址不宜高度集中于一处,而应在沿河和滨海分期分批建设新港区.  相似文献   
107.
一般寿命分布和定时截尾的Bayes变量抽样方案   总被引:1,自引:0,他引:1  
林(1994)研究了指数分布和定时截尾的变量抽样方案.本文将讨论一般寿命分布和定时截尾的一次抽样方案.在多项式损失函数的假设下,我们讨论了Weibull分布、双参数指数分布和-分布三种情形,并着重讨论Weibull分布的情形.本文还提出了一个可用于近似地确定最优抽样方案的有报算法,并且进行了灵敏度分析,还同林较早的模型(1990,1994)做了比较.  相似文献   
108.
If L is a lattice with the interpolation property whose cardinality is a strong limit cardinal of uncountable cofinality, then some finite power has an antichain of size . Hence there are no infinite opc lattices. However, the existence of strongly amorphous sets implies (in ZF) the existence of infinite opc lattices. Received November 2, 1998; accepted in final form March 19, 1999.  相似文献   
109.
We show that the axiom of choice AC is equivalent to the Vector Space Kinna‐Wagner Principle, i.e., the assertion: “For every family 𝒱= {Vi : i ∈ k} of non trivial vector spaces there is a family ℱ = {Fi : ik} such that for each ik, Fi is a non empty independent subset of Vi”. We also show that the statement “every vector space over ℚ has a basis” implies that every infinite well ordered set of pairs has an infinite subset with a choice set, a fact which is known not to be a consequence of the axiom of multiple choice MC.  相似文献   
110.
We will prove that some so‐called union theorems (see [2]) are equivalent in ZF0 to statements about the transitive closure of relations. The special case of “bounded” union theorems dealing with κ‐hereditary sets yields equivalents to statements about the transitive closure of κ‐narrow relations. The instance κ = ω1 (i. e., hereditarily countable sets) yields an equivalent to Howard‐Rubin's Form 172 (the transitive closure Tc(x) of every hereditarily countable set x is countable). In particular, the countable union theorem (Howard‐Rubin's Form 31) and, a fortiori, the axiom of countable choice imply Form 172.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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