全文获取类型
收费全文 | 1748篇 |
免费 | 117篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 16篇 |
综合类 | 9篇 |
化学工业 | 530篇 |
金属工艺 | 41篇 |
机械仪表 | 31篇 |
建筑科学 | 73篇 |
矿业工程 | 2篇 |
能源动力 | 39篇 |
轻工业 | 139篇 |
水利工程 | 21篇 |
石油天然气 | 2篇 |
无线电 | 114篇 |
一般工业技术 | 327篇 |
冶金工业 | 233篇 |
原子能技术 | 9篇 |
自动化技术 | 282篇 |
出版年
2023年 | 19篇 |
2022年 | 48篇 |
2021年 | 48篇 |
2020年 | 42篇 |
2019年 | 55篇 |
2018年 | 50篇 |
2017年 | 51篇 |
2016年 | 54篇 |
2015年 | 39篇 |
2014年 | 77篇 |
2013年 | 100篇 |
2012年 | 73篇 |
2011年 | 126篇 |
2010年 | 85篇 |
2009年 | 70篇 |
2008年 | 76篇 |
2007年 | 80篇 |
2006年 | 73篇 |
2005年 | 61篇 |
2004年 | 45篇 |
2003年 | 47篇 |
2002年 | 32篇 |
2001年 | 23篇 |
2000年 | 20篇 |
1999年 | 21篇 |
1998年 | 44篇 |
1997年 | 43篇 |
1996年 | 29篇 |
1995年 | 22篇 |
1994年 | 26篇 |
1993年 | 22篇 |
1992年 | 18篇 |
1991年 | 10篇 |
1990年 | 13篇 |
1988年 | 9篇 |
1986年 | 13篇 |
1985年 | 10篇 |
1984年 | 12篇 |
1983年 | 15篇 |
1982年 | 12篇 |
1981年 | 11篇 |
1980年 | 18篇 |
1979年 | 11篇 |
1978年 | 10篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 10篇 |
1971年 | 9篇 |
排序方式: 共有1868条查询结果,搜索用时 31 毫秒
21.
Johan M. M. van Rooij Marcel E. van Kooten Niekerk Hans L. Bodlaender 《Theory of Computing Systems》2013,52(4):687-718
We consider the Partition Into Triangles problem on bounded degree graphs. We show that this problem is polynomial-time solvable on graphs of maximum degree three by giving a linear-time algorithm. We also show that this problem becomes $\mathcal{NP}$ -complete on graphs of maximum degree four. Moreover, we show that there is no subexponential-time algorithm for this problem on graphs of maximum degree four unless the Exponential-Time Hypothesis fails. However, the Partition Into Triangles problem on graphs of maximum degree at most four is in many cases practically solvable as we give an algorithm for this problem that runs in $\mathcal{O}(1.02220^{n})$ time and linear space. 相似文献
22.
Jean Marcel Pallo 《Information Processing Letters》2010,111(1):46-50
We generalize the Kleene theorem to the case where nonassociative products are used. For this purpose, we apply rotations restricted to the root of binary trees. 相似文献
23.
Duc-Khanh Tran Christophe Ringeissen Silvio Ranise Hélène Kirchner 《Journal of Symbolic Computation》2010
Decision procedures are key components of theorem provers and constraint satisfaction systems. Their modular combination is of prime interest for building efficient systems, but their effective use is often limited by poor interface capabilities, when such procedures only provide a simple “sat/unsat” answer. In this paper, we develop a framework to design cooperation schemas between such procedures while maintaining modularity of their interfaces. First, we use the framework to specify and prove the correctness of classic combination schemas by Nelson–Oppen and Shostak. Second, we introduce the concept of deduction complete satisfiability procedures, we show how to build them for large classes of theories, then we provide a schema to modularly combine them. Third, we consider the problem of modularly constructing explanations for combinations by re-using available proof-producing procedures for the component theories. 相似文献
24.
Deduction modulo is a way to combine computation and deduction in proofs, by applying the inference rules of a deductive system (e.g. natural deduction or sequent calculus) modulo some congruence that we assume here to be presented by a set of rewrite rules. Using deduction modulo is equivalent to proving in a theory corresponding to the rewrite rules, and leads to proofs that are often shorter and more readable. However, cuts may be not admissible anymore.We define a new system, the unfolding sequent calculus, and prove its equivalence with the sequent calculus modulo, especially w.r.t. cut-free proofs. It permits to show that it is even undecidable to know if cuts can be eliminated in the sequent calculus modulo a given rewrite system.Then, to recover the cut admissibility, we propose a procedure to complete the rewrite system such that the sequent calculus modulo the resulting system admits cuts. This is done by generalizing the Knuth–Bendix completion in a non-trivial way, using the framework of abstract canonical systems.These results enlighten the entanglement between computation and deduction, and the power of abstract completion procedures. They also provide an effective way to obtain systems admitting cuts, therefore extending the applicability of deduction modulo in automated theorem proving. 相似文献
25.
26.
Daniel Klan Marcel Karnstedt Katja Hose Liz Ribe-Baumann Kai-Uwe Sattler 《Distributed and Parallel Databases》2011,29(1-2):151-183
Wireless sensor networks are powerful, distributed, self-organizing systems used for event and environmental monitoring. In-network query processors like TinyDB offer a user friendly SQL-like application development. Due to the sensor nodes?? resource limitations, monolithic approaches often support only a restricted number of operators. For this reason, complex processing is typically outsourced to the base station. Nevertheless, previous work has shown that complete or partial in-network processing can be more efficient than the base station approach. In this paper, we introduce AnduIN, a system for developing, deploying, and running complex in-network processing tasks. In particular, we present the query planning and execution strategies used in AnduIN, a system combining sensor-local in-network processing and a data stream engine. Query planning employs a multi-dimensional cost model taking energy consumption into account and decides autonomously which query parts will be processed within the sensor network and which parts will be processed at the central instance. 相似文献
27.
Sanjiv Singh Marcel Bergerman Jillian Cannons Benjamin Grocholsky Bradley Hamner German Holguin Larry Hull Vincent Jones George Kantor Harvey Koselka Guiqin Li James Owen Johnny Park Wenfan Shi James Teza 《Intelligent Service Robotics》2010,3(4):245-262
Comprehensive Automation for Specialty Crops is a project focused on the needs of the specialty crops sector, with a focus on apples and nursery trees. The project’s main thrusts are the integration of robotics technology and plant science; understanding and overcoming socio-economic barriers to technology adoption; and making the results available to growers and stakeholders through a nationwide outreach program. In this article, we present the results obtained and lessons learned in the first year of the project with a reconfigurable mobility infrastructure for autonomous farm driving. We then present sensor systems developed to enable three real-world agricultural applications—insect monitoring, crop load scouting, and caliper measurement—and discuss how they can be deployed autonomously to yield increased production efficiency and reduced labor costs. 相似文献
28.
Objective: Objective and subjective methods have been used in the past to assess workplace fatigue, but little is known about correlations between them. We examine correlations between subjective and objective measures, including measures collected in a workplace scenario. Methods: 15 young and 17 older participants were assessed before and after work with four types of fatigue measure: objective physical (posturography), objective mental (psychomotor vigilance task), subjective physical and mental (self-assessment), objective and subjective realistic (oculomotor behaviour, observer-rated facial expression, typing performance). Results: Pre- and post-test scores were analysed with an ANOVA, significant differences were submitted to a factor analysis. It yielded three factors: one representing posturography, the second self-rated mental and physical fatigue and the third observer-rated facial expression. Conclusions: Results advocate the existence of three independent fatigue components: Objective physical fatigue, introspective and extrospective fatigue.
Practitioner Summary: This study analyses correlations between different subjective and objective fatigue markers to better understand the complex nature of workplace fatigue. Measurements were conducted directly at the workplace. Results reveal that fatigue comprises three independent fatigue components: Objective physical fatigue, introspective and extrospective fatigue. 相似文献
29.
Semi-implicit and Newton-like finite element methods are developed for the stationary compressible Euler equations. The Galerkin discretization of the inviscid fluxes is potentially oscillatory and unstable. To suppress numerical oscillations, the spatial discretization is performed by a high-resolution finite element scheme based on algebraic flux correction. A multidimensional limiter of TVD type is employed. An important goal is the efficient computation of stationary solutions in a wide range of Mach numbers, which is a challenging task due to oscillatory correction factors associated with TVD-type flux limiters. A semi-implicit scheme is derived by a time-lagged linearization of the nonlinear residual, and a Newton-like method is obtained in the limit of infinite CFL numbers. Special emphasis is laid on the numerical treatment of weakly imposed characteristic boundary conditions. Numerical evidence for unconditional stability is presented. It is shown that the proposed approach offers higher accuracy and better convergence behavior than algorithms in which the boundary conditions are implemented in a strong sense. 相似文献
30.
In this paper we describe a network invariant for all configurations of the Futurebus+ Cache Coherence Protocol. The network invariant was computed with PAX and verified by a model checker. Using this invariant we are able to prove a specification of cache coherence correct for an arbitrary number of components on a single bus of the system. This specification includes a progress property not proven yet. We show how the result for the single bus system can be extended to tree-shaped systems. This is, as far as we know, the first uniform proof of the protocol with multiple data-buses. 相似文献