全文获取类型
收费全文 | 9253篇 |
免费 | 1168篇 |
国内免费 | 362篇 |
专业分类
化学 | 988篇 |
晶体学 | 14篇 |
力学 | 1042篇 |
综合类 | 389篇 |
数学 | 5661篇 |
物理学 | 2689篇 |
出版年
2024年 | 15篇 |
2023年 | 87篇 |
2022年 | 224篇 |
2021年 | 283篇 |
2020年 | 204篇 |
2019年 | 202篇 |
2018年 | 229篇 |
2017年 | 338篇 |
2016年 | 457篇 |
2015年 | 302篇 |
2014年 | 556篇 |
2013年 | 621篇 |
2012年 | 507篇 |
2011年 | 557篇 |
2010年 | 451篇 |
2009年 | 581篇 |
2008年 | 604篇 |
2007年 | 625篇 |
2006年 | 502篇 |
2005年 | 461篇 |
2004年 | 405篇 |
2003年 | 343篇 |
2002年 | 319篇 |
2001年 | 276篇 |
2000年 | 245篇 |
1999年 | 213篇 |
1998年 | 200篇 |
1997年 | 165篇 |
1996年 | 147篇 |
1995年 | 108篇 |
1994年 | 72篇 |
1993年 | 83篇 |
1992年 | 73篇 |
1991年 | 40篇 |
1990年 | 48篇 |
1989年 | 28篇 |
1988年 | 34篇 |
1987年 | 23篇 |
1986年 | 29篇 |
1985年 | 31篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 6篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 203 毫秒
71.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
72.
In this paper,we consider a class of quadratic maximization problems.For a subclass of the problems,we show that the SDP relaxation approach yields an approximation solution with the ratio is dependent on the data of the problem with α being a uniform lower bound.In light of this new bound,we show that the actual worst-case performance ratio of the SDP relaxation approach (with the triangle inequalities added) is at least α δd if every weight is strictly positive,where δd > 0 is a constant depending on the problem dimension and data. 相似文献
73.
This paper studies the problem of how changes in the design of the genetic algorithm (GA) have an effect on the results obtained in real-life applications. In this study, focused on the application of a GA to the tuning of technical trading rules in the context of financial markets, our tentative thesis is that the GA is robust with respect to design changes. The optimization of technical trading systems is a suitable area for the application of the GA metaheuristic, as the complexity of the problem grows exponentially as new technical rules are added to the system and as the answer time is crucial when applying the system to real-time data. Up to now, most of GAs applications to this subject obviated the question of possible “design dependence” in their results. The data we report, based on our experiments, do not allow us to refute the hypothesis of robustness of the GA to design implementation, when applying to technical trading systems tuning. 相似文献
74.
75.
The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems. 相似文献
76.
I.IlltroductionWhenanactiveunderwateracousticalpositioningsystemissearchingforanunderwatertarget,itisnecessaryforittocompleteatransmittingandreceivingcycIewithineachworkingperiodinordertofindoutthelocationofthetargetcorrectly.Forexample,whenanunder-wateracoustica1synchronouspositioningsystemistrackinganunderwatertargetwithagivensynchr0nizingperiod,thepropagati0ntimeofthepositioningsignaltravellingfr0mthetaJrgettothearrayofthesystemshouldbelessthanthesynchronizingperiod0therwisetargetdis-tance… 相似文献
77.
几种约束广义逆矩阵的有限算法 总被引:2,自引:0,他引:2
陈永林 《高等学校计算数学学报》1997,19(3):232-240
1引言与引理众所周知,关于非奇异方阵的正则逆的有限算法是由Faddeev大给在1949年之前提出的,这就是著名的Faddeev算法[1,P…334-336]。自从五十年代中期广义逆矩阵的研究复兴与发展以来,有不少学者提出了关于广义逆矩阵的有限算法。第一个给出关于广义逆矩 相似文献
78.
Satoru Ibaraki Masao Fukushima Toshihide Ibaraki 《Computational Optimization and Applications》1992,1(2):207-226
A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs. 相似文献
79.
This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems. 相似文献
80.
关于可达矩阵的求法探讨 总被引:6,自引:0,他引:6
在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 . 相似文献