首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   13135篇
  免费   1149篇
  国内免费   578篇
化学   1781篇
晶体学   31篇
力学   1333篇
综合类   286篇
数学   8719篇
物理学   2712篇
  2024年   23篇
  2023年   131篇
  2022年   280篇
  2021年   428篇
  2020年   261篇
  2019年   308篇
  2018年   315篇
  2017年   439篇
  2016年   471篇
  2015年   338篇
  2014年   671篇
  2013年   783篇
  2012年   809篇
  2011年   693篇
  2010年   595篇
  2009年   784篇
  2008年   809篇
  2007年   837篇
  2006年   730篇
  2005年   615篇
  2004年   480篇
  2003年   452篇
  2002年   432篇
  2001年   385篇
  2000年   380篇
  1999年   275篇
  1998年   293篇
  1997年   263篇
  1996年   192篇
  1995年   191篇
  1994年   171篇
  1993年   131篇
  1992年   123篇
  1991年   100篇
  1990年   84篇
  1989年   81篇
  1988年   55篇
  1987年   47篇
  1986年   48篇
  1985年   70篇
  1984年   59篇
  1983年   16篇
  1982年   28篇
  1981年   27篇
  1980年   25篇
  1979年   32篇
  1978年   22篇
  1977年   32篇
  1976年   23篇
  1974年   6篇
排序方式: 共有10000条查询结果,搜索用时 312 毫秒
71.
This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems (MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented. An erratum to this article is available at .  相似文献   
72.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18  相似文献   
73.
We study convergence properties of a modified subgradient algorithm, applied to the dual problem defined by the sharp augmented Lagrangian. The primal problem we consider is nonconvex and nondifferentiable, with equality constraints. We obtain primal and dual convergence results, as well as a condition for existence of a dual solution. Using a practical selection of the step-size parameters, we demonstrate the algorithm and its advantages on test problems, including an integer programming and an optimal control problem. *Partially Supported by 2003 UniSA ITEE Small Research Grant Ero2. Supported by CAPES, Brazil, Grant No. 0664-02/2, during her visit to the School of Mathematics and Statistics, UniSA.  相似文献   
74.
In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints.  相似文献   
75.
This paper proposes a new method that extends the efficient global optimization to address stochastic black-box systems. The method is based on a kriging meta-model that provides a global prediction of the objective values and a measure of prediction uncertainty at every point. The criterion for the infill sample selection is an augmented expected improvement function with desirable properties for stochastic responses. The method is empirically compared with the revised simplex search, the simultaneous perturbation stochastic approximation, and the DIRECT methods using six test problems from the literature. An application case study on an inventory system is also documented. The results suggest that the proposed method has excellent consistency and efficiency in finding global optimal solutions, and is particularly useful for expensive systems.  相似文献   
76.
通过PCR扩增出猪传染性胃肠炎病毒(TGEV)聚合酶部分片段,反向插入逆转录病毒表达载体pLXSN中,用脂质体法将重组质粒plxas-pol转染PA317细胞,经抗生素G418筛选出稳定的产毒细胞克隆,分别扩大培养后,取其上清液感染小鼠成纤维细胞NIH3T3,细胞克隆产生的重组病毒效价达9.0×105CFU/mL。用高效价假病毒感染IBRS2细胞,再经抗生素G418筛选,提取细胞克隆总RNA,经RT-PCR证明plxas-pol整合入IBRS2细胞。以TGEV感染IBRS2细胞和具有抗性的IBRS2细胞所产生的细胞病变为指标,证明该反义RNA对病毒有明显抑制作用,抑制率约为80%。用2×103和4×102TCID50/mL剂量的TGEV感染时,引起细胞死亡的时间分别为21 h和27 h,与对照组相比,抗性细胞系可明显延迟因病毒感染引起细胞死亡的时间。  相似文献   
77.
The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.  相似文献   
78.
The paper considers upper semicontinuous behavior in distribution of sequences of random closed sets. Semiconvergence in distribution will be described via convergence in distribution of random variables with values in a suitable topological space. Convergence statements for suitable functions of random sets are proved and the results are employed to derive stability statements for random optimization problems where the objective function and the constraint set are approximated simultaneously. The author is grateful to two anonymous referees for helpful suggestions.  相似文献   
79.
The nature of the financial time series is complex, continuous interchange of stochastic and deterministic regimes. Therefore, it is difficult to forecast with parametric techniques. Instead of parametric models, we propose three techniques and compare with each other. Neural networks and support vector regression (SVR) are two universally approximators. They are data-driven non parametric models. ARCH/GARCH models are also investigated. Our assumption is that the future value of Istanbul Stock Exchange 100 index daily return depends on the financial indicators although there is no known parametric model to explain this relationship. This relationship comes from the technical analysis. Comparison shows that the multi layer perceptron networks overperform the SVR and time series model (GARCH).  相似文献   
80.
A nonclassical problem is considered for the transport equation with coefficients depending on the energy of radiation. The task is to find the discontinuity surfaces for the coefficients of the equation from measurements of the radiation flux leaving the medium. For this tomography problem, an optimization problem is stated and numerically analyzed. The latter consists in determining the radiation energy that ensures the best reconstruction of the unknown medium. A simplified optimization problem is solved analytically.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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