全文获取类型
收费全文 | 3617篇 |
免费 | 138篇 |
国内免费 | 126篇 |
专业分类
化学 | 201篇 |
晶体学 | 4篇 |
力学 | 179篇 |
综合类 | 49篇 |
数学 | 3085篇 |
物理学 | 363篇 |
出版年
2024年 | 3篇 |
2023年 | 34篇 |
2022年 | 45篇 |
2021年 | 59篇 |
2020年 | 61篇 |
2019年 | 56篇 |
2018年 | 54篇 |
2017年 | 50篇 |
2016年 | 62篇 |
2015年 | 60篇 |
2014年 | 106篇 |
2013年 | 185篇 |
2012年 | 149篇 |
2011年 | 153篇 |
2010年 | 156篇 |
2009年 | 244篇 |
2008年 | 268篇 |
2007年 | 302篇 |
2006年 | 241篇 |
2005年 | 172篇 |
2004年 | 139篇 |
2003年 | 135篇 |
2002年 | 146篇 |
2001年 | 116篇 |
2000年 | 109篇 |
1999年 | 98篇 |
1998年 | 103篇 |
1997年 | 79篇 |
1996年 | 72篇 |
1995年 | 53篇 |
1994年 | 52篇 |
1993年 | 42篇 |
1992年 | 31篇 |
1991年 | 27篇 |
1990年 | 19篇 |
1989年 | 26篇 |
1988年 | 25篇 |
1987年 | 13篇 |
1986年 | 17篇 |
1985年 | 21篇 |
1984年 | 22篇 |
1983年 | 4篇 |
1982年 | 16篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 8篇 |
1978年 | 11篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 2篇 |
排序方式: 共有3881条查询结果,搜索用时 125 毫秒
21.
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. 相似文献
22.
HUYUDA MENGZHIQING 《高校应用数学学报(英文版)》1998,13(4):473-477
In this paper, the existence theorem of the cone-weak subdiflerential of set-valued mapping in locally convex topological vector space is proved. 相似文献
23.
本文以fp 同伦方法为工具,借助于一些适当的变换,研究有序的(B)空间中的集值映象方程的多正解问题;在文中的有关工作中,还使用了集值映象的拟导数的某些性质. 相似文献
24.
Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union
of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of
verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated
systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which
can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key
roles in solving large scale knowledge-based data classification problems where they are used to describe the containments
as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which
was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments. 相似文献
25.
建立[4]中定义的L-fuzzy拟序集的一种理想完备化,即证明了L-fuzzy拟序集上的所有L-fuzzy理想组成的集合,赋以合适的程度映射构成L-fuzzydomain,任意从L-fuzzy拟序集到L-fuzzydomain的L-fuzzy单调映射都可以扩张成为一个L-fuzzyScott连续映射。 相似文献
26.
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. 相似文献
27.
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. 相似文献
28.
We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for
actually finding such a partition by our proof. 相似文献
29.
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. 相似文献
30.
现代优化计算方法在蛋白质结构预测中的应用 总被引:2,自引:1,他引:1
现代优化计算方法在蛋白质结构预测中占有重要地位.简要地介绍了模拟退火算法,遗传算法,人工神经网络和图论算法在蛋白质结构预测中的应用.对国内外近年来应用这些算法,特别是在蛋白质构象搜索问题中,解决蛋白质结构预测的研究作了回顾,并分析、比较了这几种算法的效果和特点. 相似文献