全文获取类型
收费全文 | 19387篇 |
免费 | 2677篇 |
国内免费 | 548篇 |
专业分类
化学 | 767篇 |
晶体学 | 16篇 |
力学 | 1032篇 |
综合类 | 324篇 |
数学 | 5492篇 |
物理学 | 2815篇 |
无线电 | 12166篇 |
出版年
2024年 | 73篇 |
2023年 | 254篇 |
2022年 | 443篇 |
2021年 | 520篇 |
2020年 | 519篇 |
2019年 | 450篇 |
2018年 | 460篇 |
2017年 | 664篇 |
2016年 | 883篇 |
2015年 | 889篇 |
2014年 | 1425篇 |
2013年 | 1331篇 |
2012年 | 1371篇 |
2011年 | 1491篇 |
2010年 | 1035篇 |
2009年 | 1177篇 |
2008年 | 1307篇 |
2007年 | 1362篇 |
2006年 | 1141篇 |
2005年 | 949篇 |
2004年 | 803篇 |
2003年 | 696篇 |
2002年 | 601篇 |
2001年 | 465篇 |
2000年 | 420篇 |
1999年 | 311篇 |
1998年 | 295篇 |
1997年 | 243篇 |
1996年 | 217篇 |
1995年 | 150篇 |
1994年 | 104篇 |
1993年 | 113篇 |
1992年 | 98篇 |
1991年 | 43篇 |
1990年 | 55篇 |
1989年 | 34篇 |
1988年 | 39篇 |
1987年 | 23篇 |
1986年 | 30篇 |
1985年 | 33篇 |
1984年 | 30篇 |
1983年 | 10篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
931.
This paper deals with a new solution technique for approximately solving certain variational problems in elasticity by using discrete optimization techniques that were originally used in information theory. This allows us to easily and approximately solve large deformation buckling problems for slender cantilever beams (including post-buckling behavior) as well as problems where the strain energy function is non-convex.The core idea is to quantize or discretize the variables describing the possible configurations of the body. This, when combined with the fact that the variational problem has an inherent Markov structure allows us to use computationally efficient search techniques based on dynamic programming (equivalent to finding the shortest path in a weighted directed graph) to find optimal solutions within the quantized state space. The results can be used in two ways: (1) directly as a fast approximate solution to the variational problem (2) As a means for finding very good (nearly minimum energy) initial configurations for application of conventional minimization techniques, which might otherwise fail because of a poor starting configurations which are far from the global minimum. We demonstrate both these uses in the paper. 相似文献
932.
This paper presents an infeasible-interior-point algorithm for a class of nonmonotone complementarity problems, and analyses
its convergence and computational complexity. The results indicate that the proposed algorithm is a polynomial-time one. 相似文献
933.
P. Das N.R. Chakraborti P.K. Chaudhuri 《Computational Optimization and Applications》2001,18(3):311-326
This paper presents an algorithm for determining a minimax location to service demand points that are equally weighted and distributed over a sphere. The norm under consideration is geodesic. The algorithm presented here is based on enumeration and has a polynomial time complexity. 相似文献
934.
935.
Majid Adib 《Numerical Linear Algebra with Applications》2008,15(7):637-642
In 1979, Gay proved that Broyden's methods, when used for n‐square linear systems, terminate in at most 2n iterations (SIAM J. Numer. Anal. 1979; 16 :623–630). Also, the ABS methods were introduced in 1984 (Numer. Math. 1984; 45 :1361–1376). In this paper we show another (handy) proof of Gay's theorem by these algorithms. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
936.
On the performance of the ICP algorithm 总被引:2,自引:0,他引:2
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay as a successful heuristic for matching of point sets in d-space under translation, but so far it seems not to have been rigorously analyzed. We consider two standard measures of resemblance that the algorithm attempts to optimize: The RMS (root mean squared distance) and the (one-sided) Hausdorff distance. We show that in both cases the number of iterations performed by the algorithm is polynomial in the number of input points. In particular, this bound is quadratic in the one-dimensional problem, under the RMS measure, for which we present a lower bound construction of Ω(nlogn) iterations, where n is the overall size of the input. Under the Hausdorff measure, this bound is only O(n) for input point sets whose spread is polynomial in n, and this is tight in the worst case.We also present several structural geometric properties of the algorithm under both measures. For the RMS measure, we show that at each iteration of the algorithm the cost function monotonically and strictly decreases along the vector Δt of the relative translation. As a result, we conclude that the polygonal path π, obtained by concatenating all the relative translations that are computed during the execution of the algorithm, does not intersect itself. In particular, in the one-dimensional problem all the relative translations of the ICP algorithm are in the same (left or right) direction. For the Hausdorff measure, some of these properties continue to hold (such as monotonicity in one dimension), whereas others do not. 相似文献
937.
Energy-Efficient Broadcast and Multicast Trees in Wireless Networks 总被引:10,自引:0,他引:10
Jeffrey E. Wieselthier Gam D. Nguyen Anthony Ephremides 《Mobile Networks and Applications》2002,7(6):481-492
The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. In this paper we focus on the problem of multicast tree construction, and we introduce and evaluate algorithms for tree construction in infrastructureless, all-wireless applications. The performance metric used to evaluate broadcast and multicast trees is energy-efficiency. We develop the Broadcast Incremental Power (BIP) algorithm, and adapt it to multicast operation by introducing the Multicast Incremental Power (MIP) algorithm. These algorithms exploit the broadcast nature of the wireless communication environment, and address the need for energy-efficient operation. We demonstrate that our algorithms provide better performance than algorithms that have been developed for the link-based, wired environment. 相似文献
938.
Minimum weight edge covering problem, known as a classic problem in graph theory, is employed in many scientific and engineering applications. In the applications, the weight may denote cost, time, or opponent’s payoff, which can be vague in practice. This paper considers the edge covering problem under fuzzy environment, and formulates three models which are expected minimum weight edge cover model, α-minimum weight edge cover model, and the most minimum weight edge cover model. As an extension for the models, we respectively introduce the crisp equivalent of each model in the case that the weights are independent trapezoidal fuzzy variables. Due to the complexity of the problem, a hybrid intelligent algorithm is employed to solve the models, which can deal with the problem with any type of fuzzy weights. At last, some numerical experiments are given to show the application of the models and the robustness of the algorithm. 相似文献
939.
本文研究了线性规划的求解问题.利用对偶转化的方法,获得了一个计算效率高的新的无人工变量通用算法.该新算法比最近提出的无人工变量算法push-to-pull算法效率更高. 相似文献
940.
An ant-based algorithm for coloring graphs 总被引:1,自引:0,他引:1
This paper presents an ant-based algorithm for the graph coloring problem. An important difference that distinguishes this algorithm from previous ant algorithms is the manner in which ants are used in the algorithm. Unlike previous ant algorithms where each ant colors the entire graph, each ant in this algorithm colors just a portion of the graph using only local information. These individual coloring actions by the ants form a coloring of the graph. Even with the lack of pheromone laying capacity by the ants, the algorithm performed well on a set of 119 benchmark graphs. Furthermore, the algorithm produced very consistent results, having very small standard deviations over 50 runs of each graph tested. 相似文献