全文获取类型
收费全文 | 427883篇 |
免费 | 29668篇 |
国内免费 | 15454篇 |
专业分类
电工技术 | 21971篇 |
技术理论 | 33篇 |
综合类 | 24794篇 |
化学工业 | 68575篇 |
金属工艺 | 25340篇 |
机械仪表 | 25746篇 |
建筑科学 | 29538篇 |
矿业工程 | 11942篇 |
能源动力 | 11059篇 |
轻工业 | 24399篇 |
水利工程 | 7744篇 |
石油天然气 | 23227篇 |
武器工业 | 3196篇 |
无线电 | 47373篇 |
一般工业技术 | 55225篇 |
冶金工业 | 20163篇 |
原子能技术 | 3921篇 |
自动化技术 | 68759篇 |
出版年
2024年 | 1194篇 |
2023年 | 5084篇 |
2022年 | 8839篇 |
2021年 | 13562篇 |
2020年 | 10023篇 |
2019年 | 8381篇 |
2018年 | 22393篇 |
2017年 | 22916篇 |
2016年 | 18731篇 |
2015年 | 14215篇 |
2014年 | 17330篇 |
2013年 | 20567篇 |
2012年 | 25808篇 |
2011年 | 33503篇 |
2010年 | 29619篇 |
2009年 | 25934篇 |
2008年 | 26649篇 |
2007年 | 27074篇 |
2006年 | 20316篇 |
2005年 | 18786篇 |
2004年 | 12813篇 |
2003年 | 11534篇 |
2002年 | 10521篇 |
2001年 | 8951篇 |
2000年 | 8665篇 |
1999年 | 9483篇 |
1998年 | 7338篇 |
1997年 | 6258篇 |
1996年 | 5840篇 |
1995年 | 4743篇 |
1994年 | 3950篇 |
1993年 | 2756篇 |
1992年 | 2222篇 |
1991年 | 1680篇 |
1990年 | 1219篇 |
1989年 | 966篇 |
1988年 | 780篇 |
1987年 | 516篇 |
1986年 | 379篇 |
1985年 | 241篇 |
1984年 | 172篇 |
1983年 | 114篇 |
1982年 | 135篇 |
1981年 | 91篇 |
1980年 | 74篇 |
1968年 | 43篇 |
1966年 | 42篇 |
1965年 | 46篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
961.
Yong Bai 《Canadian Metallurgical Quarterly》2007,133(4):335-342
Due to increased government regulations on environment, health, and safety, the cost of on-site bridge painting has quadrupled over the past several years. The construction industry faces a great challenge in how to control the increased costs of bridge painting and meet the regulations at the same time. A possible solution to address this challenge is to develop a robotic bridge painting system. The development of the robotic system can be justified by the potential improvements in safety and productivity. This paper presents the development and testing of an Intelligent Painting Process Planner. The Planner, built based on bridge feature scheme, is the key component for the robotic bridge painting system that integrates the painting process planning, robot path planning, cost optimization, and quality control functions. During the development process, lab experiments were conducted to determine the values of painting process planning parameters and coating thickness distribution functions. Field tests demonstrated that the prototype robotic bridge painting system achieved the specified painting quality using the parameter values provided by the Planner. Areas that need to be improved in the future were also identified. 相似文献
962.
This paper presents a semianalytical method for the prediction of interlaminar stresses and displacements near the free edges and ply cracks in general angle-ply laminates subjected to biaxial extensions and/or in plane shear deformation. The method is based on a state space representation of the three-dimensional equations of elasticity. Numerical solutions are obtained by using layer refinement in the through thickness direction and Fourier series expansion in the other directions. By this approach, an angle-ply laminate may be composed of an arbitrary number of monoclinic layers and each layer may have different material property and thickness. This method guarantees continuous fields of all interlaminar stresses across interfaces between material layers. Numerical results are compared with those obtained from other methods. It is found that the theory provides a satisfactory approximation to the stress singularities near the free edges and ply cracks. Numerical solutions for antisymmetric laminates under extension and general laminates under shearing are new in the literature and can be used as benchmarks for validating new models. 相似文献
963.
964.
965.
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. 相似文献
966.
Peter Bro Miltersen 《Theory of Computing Systems》2007,41(1):119-125
We prove that the one-dimensional sandpile prediction problem is in LOGDCFL, a subset of AC1. The previously best known upper bound on the ACi-scale was AC2. Furthermore, we prove that the one-dimensional sandpile prediction problem is hard for TC0 and thus not in AC1-ε for any constant ε > 0. 相似文献
967.
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. 相似文献
968.
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. 相似文献
969.
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. 相似文献
970.
Katsutoshi Yada 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(8):811-817
The aim of this paper is to propose a new system for the strategic use of customer data that includes and integrates such
differing data sources as company databases, mobile telephone networks and Internet data and is a consumer research support
system for the discovery of new marketing opportunities. This system, called CODIRO, will be discussed in this paper using
a case study of the effects on sales of processed food product television commercials. A system for verifying the validity
of consumer behavior models will also be described and discussed. Use of the CODIRO analysis system makes it easy to introduce,
into the analytic model, consumer attitude changes and in-store data of many types that have not been used to measure advertising
and promotional activity effectiveness in the past. 相似文献