全文获取类型
收费全文 | 4390篇 |
免费 | 220篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 71篇 |
综合类 | 3篇 |
化学工业 | 1083篇 |
金属工艺 | 135篇 |
机械仪表 | 85篇 |
建筑科学 | 171篇 |
矿业工程 | 21篇 |
能源动力 | 94篇 |
轻工业 | 562篇 |
水利工程 | 30篇 |
石油天然气 | 9篇 |
无线电 | 282篇 |
一般工业技术 | 734篇 |
冶金工业 | 795篇 |
原子能技术 | 24篇 |
自动化技术 | 520篇 |
出版年
2023年 | 31篇 |
2022年 | 89篇 |
2021年 | 189篇 |
2020年 | 81篇 |
2019年 | 71篇 |
2018年 | 110篇 |
2017年 | 128篇 |
2016年 | 126篇 |
2015年 | 120篇 |
2014年 | 171篇 |
2013年 | 241篇 |
2012年 | 222篇 |
2011年 | 243篇 |
2010年 | 189篇 |
2009年 | 167篇 |
2008年 | 178篇 |
2007年 | 149篇 |
2006年 | 134篇 |
2005年 | 134篇 |
2004年 | 107篇 |
2003年 | 99篇 |
2002年 | 101篇 |
2001年 | 70篇 |
2000年 | 80篇 |
1999年 | 63篇 |
1998年 | 239篇 |
1997年 | 151篇 |
1996年 | 96篇 |
1995年 | 84篇 |
1994年 | 68篇 |
1993年 | 66篇 |
1992年 | 39篇 |
1991年 | 38篇 |
1990年 | 30篇 |
1989年 | 26篇 |
1988年 | 26篇 |
1987年 | 35篇 |
1986年 | 26篇 |
1985年 | 23篇 |
1984年 | 28篇 |
1983年 | 21篇 |
1982年 | 22篇 |
1981年 | 23篇 |
1980年 | 23篇 |
1979年 | 15篇 |
1977年 | 18篇 |
1976年 | 60篇 |
1975年 | 26篇 |
1974年 | 16篇 |
1973年 | 10篇 |
排序方式: 共有4619条查询结果,搜索用时 46 毫秒
101.
本文就目前国际上对以太网基本性能测量的指标进行整理和分析并给出了相应的测试方法。 相似文献
102.
Lars Mönch John W. Fowler Stéphane Dauzère-Pérès Scott J. Mason Oliver Rose 《Journal of Scheduling》2011,14(6):583-599
In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting from describing the manufacturing process,
we identify typical scheduling problems found in semiconductor manufacturing systems. We describe batch scheduling problems,
parallel machine scheduling problems, job shop scheduling problems, scheduling problems with auxiliary resources, multiple
orders per job scheduling problems, and scheduling problems related to cluster tools. We also present important solution techniques
that are used to solve these scheduling problems by means of specific examples, and report on known implementations. Finally,
we summarize some of the challenges in scheduling semiconductor manufacturing operations. 相似文献
103.
Christian Bessiere Stéphane Cardon Romuald Debruyne Christophe Lecoutre 《Constraints》2011,16(1):25-53
In this paper, we propose two original and efficient approaches for enforcing singleton arc consistency. In the first one,
the data structures used to enforce arc consistency are shared between all subproblems where a domain is reduced to a singleton.
This new algorithm is not optimal but it requires far less space and is often more efficient in practice than the optimal
algorithm SAC-Opt. In the second approach, we perform several runs of a greedy search (where at each step, arc consistency
is maintained), possibly detecting the singleton arc consistency of several values in one run. It is an original illustration
of applying inference (i.e., establishing singleton arc consistency) by search. Using a greedy search allows benefiting from
the incrementality of arc consistency, learning relevant information from conflicts and, potentially finding solution(s) during
the inference process. We present extensive experiments that show the benefit of our two approaches. 相似文献
104.
105.
In the context of comparative analysis of protein–protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex (pattern graph) in the protein–protein interaction graph (target graph) of another species with respect to (w.r.t.) orthologous proteins. We give an efficient exponential-time randomized algorithm in case the occurrence of the pattern graph in the target graph is required to be exact. For approximate occurrences, we prove a tight inapproximability result and give four approximation algorithms that deal with bounded degree graphs, small ortholog numbers, linear forests and very simple yet hard instances, respectively. 相似文献
106.
Combining knowledge from different sources 总被引:1,自引:1,他引:0
Ewa Straszecka 《Expert Systems》2010,27(1):40-52
Abstract: The present paper deals with the problem of an assessment of symptoms in medical diagnosis. A unified interpretation of symptoms is necessary to estimate their significance in a diagnosis. Yet, even if they are properly defined, different evaluations of them based on experts' knowledge or statistical estimation are possible. The present study aims at combining evaluations that may originate from an expert or can be found from statistical features of the data, as well as those determined for 'easy' and 'difficult' diagnostic cases. A model of diagnostic inference is proposed in the framework of the Dempster–Shafer theory extended for fuzzy focal elements. The basic probability assignment defined in this theory estimates weights of symptoms. Two basic probability assignments can be created and then combined. In this way weights of symptoms represent knowledge common for two kinds of data or obtained from an expert and from data. Thus, a combination of heuristics and data mining results becomes possible. An algorithm of the basic probability assignment calculation is suggested and tested for medical data: a database from the internet and individually gathered data. 相似文献
107.
108.
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce
in this paper a global constraint and an associated filtering algorithm to solve this problem within the context of constraint
programming. The main idea of the filtering algorithm is to label every node with respect to its relationships with other
nodes of the graph, and to define a partial order on these labels in order to express compatibility of labels for subgraph
isomorphism. This partial order over labels is used to filter domains. Labelings can also be strengthened by adding information
from the labels of neighbors. Such a strengthening can be applied iteratively until a fixpoint is reached. Practical experiments
illustrate that our new filtering approach is more effective on difficult instances of scale free graphs than state-of-the-art
algorithms and other constraint programming approaches. 相似文献
109.
Michael A. Bender Gerth Stølting Brodal Rolf Fagerberg Riko Jacob Elias Vicari 《Theory of Computing Systems》2010,47(4):934-962
We study the problem of sparse-matrix dense-vector multiplication (SpMV) in external memory. The task of SpMV is to compute
y:=Ax, where A is a sparse N×N matrix and x is a vector. We express sparsity by a parameter k, and for each choice of k consider the class of matrices where the number of nonzero entries is kN, i.e., where the average number of nonzero entries per column is k. 相似文献
110.
Stéphane Zieba Philippe Polet Frédéric Vanderhaegen Serge Debernard 《Cognition, Technology & Work》2010,12(3):193-203
Unmanned ground vehicles tend to be more and more autonomous, but both complete teleoperation and full autonomy are not efficient
enough to deal with all possible situations. To be efficient, the human–robot system must be able to anticipate, react and
recover from errors of different kinds, i.e., to be resilient. From this observation, this paper proposes a survey on the
resilience of a human–machine system and the means to control the resilience. The resilience of a system can be defined as
the ability to maintain or recover a stable state when subject to disturbance. Adjustable autonomy and human–machine cooperation
are considered as means of resilience for the system. This paper then proposes three indicators to assess different meanings
of resilience of the system: foresight and avoidance of events, reaction to events and recovery from occurrence of events.
The third of these metrics takes into consideration the concept of affordances that allows a common representation for the
opportunities of action between the automated system and its environment. 相似文献