全文获取类型
收费全文 | 18132篇 |
免费 | 2972篇 |
国内免费 | 1331篇 |
专业分类
化学 | 7839篇 |
晶体学 | 50篇 |
力学 | 1883篇 |
综合类 | 373篇 |
数学 | 5817篇 |
物理学 | 6473篇 |
出版年
2024年 | 40篇 |
2023年 | 199篇 |
2022年 | 507篇 |
2021年 | 504篇 |
2020年 | 518篇 |
2019年 | 560篇 |
2018年 | 618篇 |
2017年 | 694篇 |
2016年 | 842篇 |
2015年 | 800篇 |
2014年 | 1240篇 |
2013年 | 1455篇 |
2012年 | 1151篇 |
2011年 | 1269篇 |
2010年 | 1004篇 |
2009年 | 1229篇 |
2008年 | 1205篇 |
2007年 | 1154篇 |
2006年 | 1035篇 |
2005年 | 933篇 |
2004年 | 832篇 |
2003年 | 746篇 |
2002年 | 568篇 |
2001年 | 444篇 |
2000年 | 425篇 |
1999年 | 351篇 |
1998年 | 326篇 |
1997年 | 295篇 |
1996年 | 239篇 |
1995年 | 227篇 |
1994年 | 158篇 |
1993年 | 153篇 |
1992年 | 127篇 |
1991年 | 56篇 |
1990年 | 87篇 |
1989年 | 56篇 |
1988年 | 52篇 |
1987年 | 50篇 |
1986年 | 46篇 |
1985年 | 44篇 |
1984年 | 49篇 |
1983年 | 14篇 |
1982年 | 33篇 |
1981年 | 13篇 |
1980年 | 11篇 |
1979年 | 17篇 |
1978年 | 7篇 |
1977年 | 12篇 |
1976年 | 7篇 |
1957年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
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 相似文献
32.
The influence of the parameter of amplitude-phase coupling for nonlinear amplification on the phase-frequency characteristics of an injection laser in the regime of pumping current modulation has been investigated theoretically. The parameter is defined as the coefficient of proportionality between changes in the real and imaginary parts of the refractive index during variation of the density of photons in the cavity. The substantial dependence of the coefficient of phase modulation on the parameter of the amplitude-phase coupling for nonlinear amplification at small modulation frequencies is shown. A technique to determine the indicated parameter based on the frequency dependence of the ratio between the coefficients of phase and amplitude modulation is suggested. 相似文献
33.
Joji Ohshita Ryosuke Taketsugu Yuki Nakahara Atsutaka Kunai 《Journal of organometallic chemistry》2004,689(20):3258-3264
Selective dehydrogenative coupling of di- and trihydrosilanes with alcohols catalyzed by PdCl2 or NiCl2 afforded alkoxyhydro- and dialkoxyhydrosilanes in good yield. Further treatment of the resulting alkoxyhydrosilanes with carbon tetrachloride or allyl bromide in the presence of the same catalyst led to the formation of alkoxychloro- and alkoxybromosilanes, respectively. Similar reactions of dialkoxyhydrosilanes with carbon tetrachloride afforded dialkoxychlorosilanes in good yield, although contamination of small amounts of trialkoxysilanes and alkoxydichlorosilanes was detected in the products. Selective substitution of the alkoxyhalosilanes with nucleophiles is also reported. 相似文献
34.
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. 相似文献
35.
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. 相似文献
36.
I.IlltroductionWhenanactiveunderwateracousticalpositioningsystemissearchingforanunderwatertarget,itisnecessaryforittocompleteatransmittingandreceivingcycIewithineachworkingperiodinordertofindoutthelocationofthetargetcorrectly.Forexample,whenanunder-wateracoustica1synchronouspositioningsystemistrackinganunderwatertargetwithagivensynchr0nizingperiod,thepropagati0ntimeofthepositioningsignaltravellingfr0mthetaJrgettothearrayofthesystemshouldbelessthanthesynchronizingperiod0therwisetargetdis-tance… 相似文献
37.
Francisco‐Javier Sayas 《Numerical Methods for Partial Differential Equations》2003,19(5):555-570
This article presents and analyzes a simple method for the exterior Laplace equation through the coupling of finite and boundary element methods. The main novelty is the use of a smooth parametric artificial boundary where boundary elements fit without effort together with a straight approximate triangulation in the bounded area, with the coupling done only in nodes. A numerically integrated version of the algorithm is also analyzed. Finally, an isoparametric variant with higher order is proposed. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 555–570, 2003 相似文献
38.
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. 相似文献
39.
关于可达矩阵的求法探讨 总被引:6,自引:0,他引:6
在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 . 相似文献
40.
Hossam A. Zaki 《Computational Optimization and Applications》1995,4(1):23-45
State-of-the-art computational results have shown that the shortest augmenting path (SAP) methods are more efficient than other primal-dual and primal-simplex based methods for solving the linear assignment problem on uniprocessor computers. There is, however, some controversy concerning their merits when compared with Bertsekas' auction algorithm on multiprocessor computers. In this study we investigate the performance of these competing methods on the Alliant FX/8. For each method, theoretical motivation, sources of parallelism and computational results are presented. 相似文献