全文获取类型
收费全文 | 13502篇 |
免费 | 1515篇 |
国内免费 | 395篇 |
专业分类
化学 | 1288篇 |
晶体学 | 28篇 |
力学 | 1078篇 |
综合类 | 150篇 |
数学 | 6738篇 |
物理学 | 1498篇 |
无线电 | 4632篇 |
出版年
2024年 | 40篇 |
2023年 | 202篇 |
2022年 | 350篇 |
2021年 | 470篇 |
2020年 | 378篇 |
2019年 | 362篇 |
2018年 | 361篇 |
2017年 | 500篇 |
2016年 | 543篇 |
2015年 | 482篇 |
2014年 | 831篇 |
2013年 | 856篇 |
2012年 | 967篇 |
2011年 | 833篇 |
2010年 | 639篇 |
2009年 | 768篇 |
2008年 | 788篇 |
2007年 | 827篇 |
2006年 | 669篇 |
2005年 | 594篇 |
2004年 | 443篇 |
2003年 | 421篇 |
2002年 | 373篇 |
2001年 | 339篇 |
2000年 | 304篇 |
1999年 | 231篇 |
1998年 | 254篇 |
1997年 | 216篇 |
1996年 | 156篇 |
1995年 | 172篇 |
1994年 | 142篇 |
1993年 | 132篇 |
1992年 | 109篇 |
1991年 | 89篇 |
1990年 | 76篇 |
1989年 | 63篇 |
1988年 | 50篇 |
1987年 | 41篇 |
1986年 | 38篇 |
1985年 | 57篇 |
1984年 | 52篇 |
1983年 | 15篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 18篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 218 毫秒
831.
Queues of tow/barges form when a river lock is rendered inoperable due to lock malfunction, a tow/barge accident or adverse lock operating conditions. In this paper, we develop model formulations that allow the queue to be cleared using a number of differing objectives. Of particular interest is the presence of different setup times between successive passages of tow/barges through the lock. Dependent on the objective chosen, we are able to show that certain ordering protocols may be used to markedly reduce the sequencing search space for N tow/barges from the order of N! to 2N. We present accompanying linear and nonlinear integer programming formulations and carry out computational experiments on a representative set of problems. 相似文献
832.
A general monotonization method is proposed for converting a constrained programming problem with non-monotone objective function and monotone constraint functions into a monotone programming problem. An equivalent monotone programming problem with only inequality constraints is obtained via this monotonization method. Then the existing convexification and concavefication methods can be used to convert the monotone programming problem into an equivalent better-structured optimization problem. 相似文献
833.
This paper demonstrates the application of the topology optimization method as a general and systematic approach for microfluidic mixer design. The mixing process is modeled as convection dominated transport in low Reynolds number incompressible flow. The mixer performance is maximized by altering the layout of flow/non‐flow regions subject to a constraint on the pressure drop between inlet and outlet. For a square cross‐sectioned pipe the mixing is increased by 70% compared with a straight pipe at the cost of a 2.5 fold increase in pressure drop. Another example where only the bottom profile of the channel is a design domain results in intricate herring bone patterns that confirm findings from the literature. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
834.
835.
Wei Wang 《Operations Research Letters》2008,36(5):515-519
We propose a sample average approximation (SAA) method for stochastic programming problems with expected value constraints. Such problems arise, for example, in portfolio selection with constraints on conditional value-at-risk (CVaR). We provide a convergence analysis and a statistical validation scheme for the proposed method. 相似文献
836.
Various variants and hybrid approaches evolved from the origin of Delp and Mitchell's block truncation coding (BTC) or moment preserving quantizer (MPQ) have formed a niche as an effective and simple image compression methodology with attractive coding performance achieved at moderate bitrates. As BTC is still lacking a fundamental error analysis, in this paper we present some fundamental insights regarding one-bit (or two-level) BTC's truncation error by providing mathematical analysis as well as novel geometric interpretation. We further show that the mean-square error (MSE) of Lema and Mitchell's absolute moment block truncation coding (AMBTC) is always bounded below (i.e., less than or equal to) that of BTC. Therefore, with additional advantages in computation and implementation, AMBTC is always superior. Furthermore, we developed a new adaptive equal sign position optimization (ESPO) algorithm for optimum pixel classification. Our quantization error analysis shows that incorporating the ESPO algorithm into conventional AMBTC or BTC achieves minimum MSE in either case. 相似文献
837.
Extending a class of continuous estimation of distribution algorithms to dynamic problems 总被引:1,自引:0,他引:1
In this paper, a class of continuous Estimation of Distribution Algorithms (EDAs) based on Gaussian models is analyzed to
investigate their potential for solving dynamic optimization problems where the global optima may change dramatically during
time. Experimental results on a number of dynamic problems show that the proposed strategy for dynamic optimization can significantly
improve the performance of the original EDAs and the optimal solutions can be consistently located. 相似文献
838.
Summary A computer-assisted method is presented for the simultaneous multifactor optimization (stationary phase loading, column temperature and carrier gas flow rate) of the analytical conditions for the optimum separation of multicomponent samples in gas chromatography. The optimization of the separation over the experimental region is based on a special polynomial from twelve preliminary experiments using the resolution as the selection criterion. Computer scanning technique was used for optimum selection in three dimensions. Excellent agreement was obtained between the predicted data and the experimental results. 相似文献
839.
Y. Wardi 《Journal of Optimization Theory and Applications》1990,64(3):615-640
A stochastic approximation algorithm for minimax optimization problems is analyzed. At each iterate, it performs one random experiment, based on which it computes a direction vector. It is shown that, under suitable conditions, it a.s. converges to the set of points satisfying necessary optimality conditions. The algorithm and its analysis bring together ideas from stochastic approximation and nondifferentiable optimization. 相似文献
840.
Richard H. Byrd Cornelius L. Dert Alexander H. G. Rinnooy Kan Robert B. Schnabel 《Mathematical Programming》1990,46(1-3):1-29
The global optimization problem, finding the lowest minimizer of a nonlinear function of several variables that has multiple local minimizers, appears well suited to concurrent computation. This paper presents a new parallel algorithm for the global optimization problem. The algorithm is a stochastic method related to the multi-level single-linkage methods of Rinnooy Kan and Timmer for sequential computers. Concurrency is achieved by partitioning the work of each of the three main parts of the algorithm, sampling, local minimization start point selection, and multiple local minimizations, among the processors. This parallelism is of a coarse grain type and is especially well suited to a local memory multiprocessing environment. The paper presents test results of a distributed implementation of this algorithm on a local area network of computer workstations. It also summarizes the theoretical properties of the algorithm.Research supported by AFOSR grant AFOSR-85-0251, ARO contract DAAG 29-84-K-0140, NSF grant DCR-8403483, and NSF cooperative agreement DCR-8420944. 相似文献