全文获取类型
收费全文 | 8404篇 |
免费 | 910篇 |
国内免费 | 260篇 |
专业分类
化学 | 1047篇 |
晶体学 | 7篇 |
力学 | 630篇 |
综合类 | 87篇 |
数学 | 2643篇 |
物理学 | 1358篇 |
无线电 | 3802篇 |
出版年
2024年 | 26篇 |
2023年 | 125篇 |
2022年 | 236篇 |
2021年 | 267篇 |
2020年 | 235篇 |
2019年 | 167篇 |
2018年 | 194篇 |
2017年 | 280篇 |
2016年 | 280篇 |
2015年 | 294篇 |
2014年 | 519篇 |
2013年 | 510篇 |
2012年 | 496篇 |
2011年 | 526篇 |
2010年 | 410篇 |
2009年 | 518篇 |
2008年 | 561篇 |
2007年 | 594篇 |
2006年 | 489篇 |
2005年 | 398篇 |
2004年 | 344篇 |
2003年 | 312篇 |
2002年 | 258篇 |
2001年 | 199篇 |
2000年 | 171篇 |
1999年 | 160篇 |
1998年 | 161篇 |
1997年 | 110篇 |
1996年 | 114篇 |
1995年 | 76篇 |
1994年 | 75篇 |
1993年 | 73篇 |
1992年 | 58篇 |
1991年 | 44篇 |
1990年 | 38篇 |
1989年 | 26篇 |
1988年 | 37篇 |
1987年 | 22篇 |
1986年 | 25篇 |
1985年 | 24篇 |
1984年 | 33篇 |
1983年 | 9篇 |
1982年 | 16篇 |
1981年 | 14篇 |
1980年 | 10篇 |
1979年 | 10篇 |
1978年 | 9篇 |
1977年 | 10篇 |
1976年 | 6篇 |
1974年 | 2篇 |
排序方式: 共有9574条查询结果,搜索用时 724 毫秒
31.
We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1. 相似文献
32.
本文利用选区电子衍射,并结合X射线衍射对六种不同成份的急冷合金及其退火后的相组成进行了鉴定,得到了它们的相组成。 相似文献
33.
A novel dynamic survivable routing in WDM optical networks with/without sparse wavelength conversion
Vinh Trong Le Xiaohong Jiang Son Hong Ngo Susumu Horiguchi Yasushi Inoguchi 《Optical Switching and Networking》2006,3(3-4):173-190
In this paper, we study the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion, and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report cycles (that are formed by two disjoint-link routes) into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without the time consuming process associated with current GA-based lightpath protection schemes. We further improve the performance of our algorithm by introducing a more advanced fitness function that is suitable for both the above networks. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieves a significantly lower blocking probability than the conventional survivable routing algorithms for all the cases we studied. 相似文献
34.
35.
Joseph Y.-T. Leung 《Discrete Applied Mathematics》2007,155(8):945-970
We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space. 相似文献
36.
A. A. Dokukin 《Computational Mathematics and Mathematical Physics》2006,46(5):914-918
To validate approximate optimization schemes for estimate calculation algorithms (ECAs), it is necessary to compute the optimal height, which cannot be done in a reasonable amount of time. A variety of samples are built for which the optimal height of the ECAs is known by construction. 相似文献
37.
M. A. Posypkin I. Kh. Sigal 《Computational Mathematics and Mathematical Physics》2006,46(12):2187-2202
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. 相似文献
38.
现代优化计算方法在蛋白质结构预测中的应用 总被引:2,自引:1,他引:1
现代优化计算方法在蛋白质结构预测中占有重要地位.简要地介绍了模拟退火算法,遗传算法,人工神经网络和图论算法在蛋白质结构预测中的应用.对国内外近年来应用这些算法,特别是在蛋白质构象搜索问题中,解决蛋白质结构预测的研究作了回顾,并分析、比较了这几种算法的效果和特点. 相似文献
39.
M.Z. Arslanov 《Operations Research Letters》2007,35(5):636-644
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem. 相似文献
40.
This work proposes and demonstrates the feasibility of gray image encryption using multiple polarization encoding, in which
the cascaded twisted nematic liquid crystal devices sandwiched between a crossed polarizer pair are used to implement exclusive
OR (XOR) logical encryption and decryption. The polarization encoding scheme provides a multichannel XOR logic operation to
secure bit-plane images derived from a gray image, according to the adiabatic following properties of twisted nematic liquid
crystal devices. Experimental data reveal that the multiple polarization encoding schemes for gray image encryption and decryption
are performed with acceptable image quality by selecting appropriate polarization orientation and modulation conditions. Both
analytic and experimental results are presented and discussed. 相似文献