全文获取类型
收费全文 | 6223篇 |
免费 | 385篇 |
国内免费 | 361篇 |
专业分类
化学 | 359篇 |
晶体学 | 2篇 |
力学 | 160篇 |
综合类 | 51篇 |
数学 | 1437篇 |
物理学 | 588篇 |
综合类 | 4372篇 |
出版年
2024年 | 20篇 |
2023年 | 53篇 |
2022年 | 104篇 |
2021年 | 138篇 |
2020年 | 116篇 |
2019年 | 120篇 |
2018年 | 108篇 |
2017年 | 149篇 |
2016年 | 162篇 |
2015年 | 174篇 |
2014年 | 284篇 |
2013年 | 326篇 |
2012年 | 337篇 |
2011年 | 396篇 |
2010年 | 312篇 |
2009年 | 332篇 |
2008年 | 391篇 |
2007年 | 497篇 |
2006年 | 422篇 |
2005年 | 388篇 |
2004年 | 292篇 |
2003年 | 251篇 |
2002年 | 227篇 |
2001年 | 232篇 |
2000年 | 192篇 |
1999年 | 145篇 |
1998年 | 105篇 |
1997年 | 101篇 |
1996年 | 105篇 |
1995年 | 69篇 |
1994年 | 67篇 |
1993年 | 61篇 |
1992年 | 41篇 |
1991年 | 40篇 |
1990年 | 37篇 |
1989年 | 40篇 |
1988年 | 53篇 |
1987年 | 21篇 |
1986年 | 15篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 4篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1959年 | 1篇 |
1955年 | 2篇 |
排序方式: 共有6969条查询结果,搜索用时 15 毫秒
21.
A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics. 相似文献
22.
Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J. 《Journal of Heuristics》2004,10(2):205-229
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms. 相似文献
23.
在清华大学物理系成立60周年之际,我们对近年来清华大学物理系量子信息研究的主要进展情况作一介绍,包括量子搜索算法研究,核磁共振量子计算的实验研究,量子通讯的理论与实验研究.在量子搜索算法研究方面,我们提出了量子搜索算法的相位匹配,纠正了当时的一种错误观点,并且提出了一种成功率为100%的量子搜索算法,改进了Grover算法;在核磁共振量子计算实验方面,我们实现了2到7个量子比特的多种量子算法的实验演示;在量子通讯方面,我们提出了分布式传输的量子通讯的思想,应用于量子密钥分配、量子秘密共享、量子直接安全通讯等方面,构造了多个量子通讯的理论方案.在实验室,我们实现了2米距离的空间量子密码通讯的演示实验. 相似文献
24.
The present study mainly probed the relationships between ERP components and the degrees of difficulty in visual search. Three experimental and one controlled conditions were randomly selected. Results showed that the P1, N1, and P2 amplitudes and latencies had no significant differences among the three experimental and one controlled conditions, and the ERP waveforms of low perceptual load of visual search were different from that of high perceptual load. These results might indicate that the latencies and amplitudes of initial P1, N1 and P2 in high and low perceptual load conditions were almost the same. The ERP waveforms of parallel search were very different from that of serial search, and the ERP waveforms of serial search were very similar. The P3 amplitudes increased as the degrees of the difficulty in visual search decreased. 相似文献
25.
We consider the generalization of the classical P||Cmax problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria. 相似文献
26.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献
27.
The use of liquid fuels such as kerosene is of interest for the pulse detonation engine (PDE). Within this context, the aim
of this work, which is a preliminary study, was to show the feasibility to initiate a detonation in air with liquid-fuel pyrolysis
products, using energies and dimensions of test facility similars to those of PDEs. Therefore, two liquids fuels have been
compared, JP10, which is a synthesis fuel generally used in the field of missile applications, and decane, which is one of
the major components of standard kerosenes (F-34, Jet A1, ...). The thermal degradation of these fuels was studied with two
pyrolysis processes, a batch reactor and a flow reactor. The temperatures varied from 600°C to 1,000°C and residence times
for the batch reactor and the flow reactor were, respectively, between 10–30 s and 0.1–2 s. Subsequently, the detonability
of synthetic gaseous mixtures, which was a schematisation of the decomposition state after the pyrolysis process, has been
studied. The detonability study, regarding nitrogen dilution and equivalence ratio, was investigated in a 50 mm-diameter,
2.5 m-long detonation tube. These dimensions are compatible with applications in the aircraft industry and, more particularly,
in PDEs. Therefore, JP10 and decane were compared to choose the best candidate for liquid-fuel PDE studies.
This paper was based on work that was presented at the 20th International Colloquium on the Dynamics of Explosions and Reactive
Systems, Montreal, Canada, July 31 – August 5, 2005. 相似文献
28.
Decisions concerning a project’s expedition, traditionally involved considerations regarding time and cost tradeoff. It was recently suggested that the quality of a project should also be taken into considerations. In this paper, we propose a meta-heuristic solution procedure for the discrete time, cost and quality tradeoff problem. This problem involves the scheduling of project activities in order to minimize the total cost of the project while maximizing the quality of the project and also meeting a given deadline. We apply a so called electromagnetic scatter search to solve this problem. In this process, we initially generate a population of feasible solutions. In so doing, we use frequency memory to well sample the feasible region. A number of these solutions are then selected and improved locally. The improved solutions are then combined to generate new set of solutions. The combination process utilizes attraction–repulsion mechanisms borrowed from the electromagnetism theory. The whole process is stopped when no significant improvement in the set of solutions are observed. The validity of the proposed solution procedure is demonstrated, and its applicability is tested on a randomly generated large and complex problem having 19,900 activities. 相似文献
29.
C. Bogani M. G. Gasparo A. Papini 《Journal of Optimization Theory and Applications》2007,134(1):47-59
We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search
methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that
it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to
ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical
experiments seem to be encouraging.
This work was supported by M.U.R.S.T., Rome, Italy. 相似文献
30.
Protein Conformation of a Lattice Model Using Tabu Search 总被引:1,自引:0,他引:1
We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model. 相似文献