全文获取类型
收费全文 | 85239篇 |
免费 | 1061篇 |
国内免费 | 410篇 |
专业分类
电工技术 | 797篇 |
综合类 | 2316篇 |
化学工业 | 11796篇 |
金属工艺 | 4810篇 |
机械仪表 | 3050篇 |
建筑科学 | 2221篇 |
矿业工程 | 564篇 |
能源动力 | 1194篇 |
轻工业 | 3794篇 |
水利工程 | 1279篇 |
石油天然气 | 344篇 |
无线电 | 9371篇 |
一般工业技术 | 16582篇 |
冶金工业 | 2695篇 |
原子能技术 | 258篇 |
自动化技术 | 25639篇 |
出版年
2023年 | 24篇 |
2022年 | 52篇 |
2021年 | 71篇 |
2020年 | 31篇 |
2019年 | 58篇 |
2018年 | 14480篇 |
2017年 | 13418篇 |
2016年 | 10007篇 |
2015年 | 651篇 |
2014年 | 316篇 |
2013年 | 316篇 |
2012年 | 3265篇 |
2011年 | 9535篇 |
2010年 | 8361篇 |
2009年 | 5659篇 |
2008年 | 6876篇 |
2007年 | 7854篇 |
2006年 | 183篇 |
2005年 | 1252篇 |
2004年 | 1181篇 |
2003年 | 1208篇 |
2002年 | 576篇 |
2001年 | 118篇 |
2000年 | 190篇 |
1999年 | 82篇 |
1998年 | 73篇 |
1997年 | 59篇 |
1996年 | 64篇 |
1995年 | 28篇 |
1994年 | 23篇 |
1993年 | 17篇 |
1992年 | 15篇 |
1991年 | 26篇 |
1988年 | 14篇 |
1969年 | 24篇 |
1968年 | 43篇 |
1967年 | 33篇 |
1966年 | 42篇 |
1965年 | 44篇 |
1964年 | 11篇 |
1963年 | 28篇 |
1962年 | 22篇 |
1961年 | 18篇 |
1960年 | 30篇 |
1959年 | 35篇 |
1958年 | 37篇 |
1957年 | 36篇 |
1956年 | 34篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
Nicolas Clauvelin Basile Audoly Sébastien Neukirch 《Scientific Modeling and Simulation》2007,14(1):95-101
The DNA molecule is modeled as an elastic rod with bending and twisting rigidities, subjected to external tension and twist applied at one end, the other end being clamped. We study the plectonemic equilibrium of such a rod, taking into account the impenetrability constraint. Numerical solutions of this boundary value problem have previously shown that purely elastic models can reproduce the supercoiling response of the DNA molecule. Using a variational approach, we derive analytical formulae for the elastic response of the filament, and extend former numerical results. 相似文献
102.
103.
104.
We show new upper bounds for problems in the W-hierarchy of fixed-parameter complexity. A crucial ingredient of our proofs
is an extension to the W-RAM model, which permits more-powerful operations but remains equivalent to the original. We use
the extended model to give new upper bounds for Subsetsum, Maximum Irredundant Set, and various problems concerning intersection
of finite-state machines. 相似文献
105.
Daniel Meister 《Theory of Computing Systems》2007,41(2):257-289
A finite recurrent system over sets of natural numbers of dimension n is a pair composed of n n-ary functions over sets of
natural numbers and an n-tuple of singleton sets of natural numbers. Every function is applied to the entries of the tuple
and computes a set of natural numbers, that may also be empty. The results are composed into another tuple, and the process
is started anew. Thus, a finite recurrent system defines an infinite sequence of n-tuples containing sets of natural numbers.
The last entry of a generated n-tuple is called the output of a step, and the union of the output sets of all steps is the
set defined by the finite recurrent system. Membership problems ask whether a given number is in a specified output set or
in some output set. We study membership problems for special finite recurrent systems, whose functions are built from the
set operations union, intersection and complementation and the arithmetical operations addition and multiplication. Sum and
product of two sets of natural numbers are defined elementwise. We restrict the set of operations from which functions are
built and determine the impact on the complexity of the membership problems. We focus on PSPACE-decidable membership problems
and show completeness results for the complexity classes NL, NP and PSPACE. 相似文献
106.
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations.
This article introduces a refined notion of dynamic problems which takes the initial structure into account. It develops the
basic structural complexity notions accordingly. It also shows that the dynamic version of the LOGCFL-complete problem D2LREACH(acyclic) can be maintained with first-order updates. 相似文献
107.
We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic
truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation
randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines
is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable payment scheme that
yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a
previous result of Auletta et al., who showed a (4 + ε)-approximation truthful mechanism. 相似文献
108.
Dragan Simić Svetlana Simić 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(12):1185-1192
A concept of business intelligent system for financial prediction is considered in this paper. It provides data needed for
fast, precise and good business decision support to all levels of management. The aim of the project is the development of
a new online analytical processing oriented on case-based reasoning (CBR) where a previous experience for every new problem
is taken into account. Methodological aspects have been tested in practice as a part of the management information system
development project of “Novi Sad Fair”. A case study of an improved application of CBR in prediction of future payments is
discussed in the paper.
This paper is originally presented at The International Conference on Hybrid Information Technology 2006, at the special session
on “Intelligent Information Systems for Financial Engineering”, November 2006 in Cheju Island, Korea. 相似文献
109.
110.
The multi-homogeneous Bezout number is a bound for the number of solutions of a system of multi-homogeneous polynomial equations,
in a suitable product of projective spaces. Given an arbitrary, not necessarily multi-homogeneous, system, one can ask for
the optimal multi-homogenization that would minimize the Bezout number. In this paper it is proved that the problem of computing,
or even estimating, the optimal multi-homogeneous Bezout number is actually NP-hard. In terms of approximation theory for
combinatorial optimization, the problem of computing the best multi-homogeneous structure does not belong to APX, unless P
= NP. Moreover, polynomial-time algorithms for estimating the minimal multi-homogeneous Bezout number up to a fixed factor
cannot exist even in a randomized setting, unless BPP ⫆ NP. 相似文献