首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   177992篇
  免费   18337篇
  国内免费   10405篇
化学   92866篇
晶体学   1924篇
力学   13039篇
综合类   533篇
数学   42768篇
物理学   55604篇
  2024年   369篇
  2023年   2133篇
  2022年   3645篇
  2021年   3874篇
  2020年   4249篇
  2019年   4138篇
  2018年   13045篇
  2017年   12645篇
  2016年   10744篇
  2015年   5716篇
  2014年   6292篇
  2013年   8062篇
  2012年   12934篇
  2011年   19590篇
  2010年   11678篇
  2009年   11786篇
  2008年   12760篇
  2007年   14285篇
  2006年   5666篇
  2005年   5839篇
  2004年   4841篇
  2003年   4530篇
  2002年   3371篇
  2001年   2211篇
  2000年   2044篇
  1999年   2219篇
  1998年   2032篇
  1997年   1856篇
  1996年   2080篇
  1995年   1614篇
  1994年   1531篇
  1993年   1257篇
  1992年   1121篇
  1991年   1045篇
  1990年   840篇
  1989年   621篇
  1988年   522篇
  1987年   439篇
  1986年   431篇
  1985年   364篇
  1984年   283篇
  1983年   190篇
  1982年   183篇
  1981年   144篇
  1980年   122篇
  1979年   88篇
  1978年   68篇
  1976年   52篇
  1974年   56篇
  1973年   56篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
941.
In some situations estimates of unknown parameters must be corrected by additional measurements. It is in principle no problem to calculate the corrected estimates, however, it is of more interest to find formulae for correction itself. The formulae enable us to design an additional experiment and to judge its usefulness. The aim of the paper is to find such formulae for several situations. Supported by the grant of the Council of Czech Government MSM 6 198 959 214.  相似文献   
942.
We have recently proposed a very simple numerical method for constructing the averaged Gaussian quadrature formulas. These formulas exist in many more cases than the real positive Gauss–Kronrod formulas. In this note we try to answer whether the averaged Gaussian formulas are an adequate alternative to the corresponding Gauss–Kronrod quadrature formulas, to estimate the remainder term of a Gaussian rule.  相似文献   
943.
Motionless mixers have found a large range of applications, including blending, reaction, dispersion, heat transfer and mass transfer. Understanding the mixing processes that occur in these diverse systems is essential for predicting many aspects of practical importance. The objective of this study is to perform the experimental investigations of mixing characteristics for three different motionless mixers. The red color dye tracer was mixed in the main stream of green hair styling gel, and then the mixing efficiency was quantified by calculating the percentage area concentration of red color at the outlet cross section using a digital image processing technique. In the Sulzer SMX and YHC mixer, a single element mixes the fluid nearly in two dimensions, and three-dimensional mixing is accomplished by the next elements aligned at 90o to their former one. In the Sulzer SMX mixer, the flow appears to be globally well mixed after 5 elements, while in the YHC and YNU mixers, it is necessary to globally well mix more than 1 and 2 elements.  相似文献   
944.
In this paper, the multi-item, single-level, capacitated, dynamic lot sizing problem with set-up carry-over and backlogging, abbreviated to CLSP+, is considered. The problem is formulated as a mixed integer programming problem. A heuristic method consisting of four elements: (1) a demand shifting rule, (2) lot size determination rules, (3) checking feasibility conditions and (4) set-up carry-over determination, provides us with an initial feasible solution. The resulting feasible solution is improved by adopting the corresponding set-up and set-up carry-over schedule and re-optimizing it by solving a minimum-cost network flow problem. Then the improved solution is used as a starting solution for a tabu search procedure, with the value of moves assessed using the same minimum-cost network problem. Computational results on randomly generated problems show that the algorithm, which is coded in C++, is able to provide optimal solutions or solutions extremely close to optimal. The computational efficiency makes it possible to solve reasonably large problem instances routinely on a personal computer.  相似文献   
945.
B-doped ZnO thin films have been fabricated on fused quartz substrates using boron-ZnO mosaic target by pulsed-laser deposition technique, and the mechanical properties have been studied by nanoindentation continuous stiffness measurement technique and transmission electron microscope (TEM). Nanoindentation measurement revealed that the hardness of B-doped ZnO films, 9.32 ± 0.90 to 12.10 ± 1.00 GPa, is much greater than that of undoped ZnO films and very close to that of traditional semiconductor Si. The mean transmittance (%) is larger than 81% in the visible range (380-780 nm) for all the films, and the Hall effect measurement showed that the carrier density is around 2 × 1020 cm−3 and the resistivity lower than 3 × 10−3 Ω cm. TEM characteristics show undoped thin films have more amorphous area between grains while the B-doped ZnO films have thin grain boundaries. We suggest that the grain boundaries act as the strain compensation sites and the decrease in thickness of grain boundaries enhances the hardness of the B-doped ZnO films.  相似文献   
946.
We investigate traces of functions, belonging to a class of functions with dominating mixed smoothness in ℝ3, with respect to planes in oblique position. In comparison with the classical theory for isotropic spaces a few new phenomenona occur. We shall present two different approaches. One is based on the use of the Fourier transform and restricted to p = 2. The other one is applicable in the general case of Besov-Lizorkin-Triebel spaces and based on atomic decompositions.  相似文献   
947.
We examine the resource allocation problem of partitioning identical servers into two parallel pooling centers, and simultaneously assigning job types to pooling centers. Each job type has a distinct Poisson arrival rate and a distinct holding cost per unit time. Each pooling center becomes a queueing system with an exponential service time distribution. The goal is to minimize the total holding cost. The problem is shown to be polynomial if a job type can be divided between the pooling centers, and NP-hard if dividing job types is not possible. When there are two servers and jobs cannot be divided, we demonstrate that the two pooling center configuration is rarely optimal. A heuristic which checks the single pooling center has an upper bound on the relative error of 4/3. The heuristic is extended for the multiple server problem, where relative error is bounded above by the number of servers.   相似文献   
948.
Prior studies have shown that inventories in a one vendor, multi-buyer supply chain with deterministic demands can be coordinated effectively through the use of common replenishment epochs (CRE). In this paper, we study the impact of demand uncertainty on the effectiveness of coordinating such a supply chain. We develop a model to analyse the coordination mechanism using CRE in a one-vendor, multi-buyer supply chain, when the demand faced by the buyers is stochastic. Our numerical study based on the model found that coordination through CRE may not always be beneficial when the demand variance is high. We also investigate a strategy of advance order processing by the vendor to improve the effectiveness of coordination through CRE.  相似文献   
949.
950.
The essential first step of any OR investigation is to ensure that the ‘right problem’ is studied. Our approach is to propose a set of six ‘rights’ or questions whereby achievement against particular aspects of a problem space is made and these provide the basis for scoping the context, understanding the system, and proposing sound options to the decision-maker. This style of problem structuring is an essential element of the Defence problem domain, and especially so for the Land Force, where there exist multiple degrees of freedom for poorly defined problems in an environment of uncertainty and ambiguity. Central to this is performing conceptual rather than analytical modelling, as perturbations then provide a basis for exploring a space, rather than solving a problem.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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