全文获取类型
收费全文 | 4942篇 |
免费 | 378篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 70篇 |
综合类 | 2篇 |
化学工业 | 1484篇 |
金属工艺 | 192篇 |
机械仪表 | 143篇 |
建筑科学 | 126篇 |
矿业工程 | 31篇 |
能源动力 | 239篇 |
轻工业 | 797篇 |
水利工程 | 16篇 |
石油天然气 | 11篇 |
武器工业 | 3篇 |
无线电 | 293篇 |
一般工业技术 | 884篇 |
冶金工业 | 151篇 |
原子能技术 | 14篇 |
自动化技术 | 873篇 |
出版年
2023年 | 32篇 |
2022年 | 73篇 |
2021年 | 230篇 |
2020年 | 137篇 |
2019年 | 166篇 |
2018年 | 252篇 |
2017年 | 233篇 |
2016年 | 295篇 |
2015年 | 228篇 |
2014年 | 296篇 |
2013年 | 519篇 |
2012年 | 313篇 |
2011年 | 257篇 |
2010年 | 253篇 |
2009年 | 244篇 |
2008年 | 217篇 |
2007年 | 175篇 |
2006年 | 120篇 |
2005年 | 93篇 |
2004年 | 95篇 |
2003年 | 96篇 |
2002年 | 80篇 |
2001年 | 48篇 |
2000年 | 48篇 |
1999年 | 44篇 |
1998年 | 42篇 |
1997年 | 49篇 |
1996年 | 46篇 |
1995年 | 31篇 |
1994年 | 35篇 |
1993年 | 29篇 |
1992年 | 19篇 |
1991年 | 24篇 |
1990年 | 36篇 |
1989年 | 14篇 |
1988年 | 26篇 |
1987年 | 28篇 |
1986年 | 22篇 |
1985年 | 36篇 |
1984年 | 48篇 |
1983年 | 54篇 |
1982年 | 38篇 |
1981年 | 49篇 |
1980年 | 34篇 |
1979年 | 32篇 |
1978年 | 15篇 |
1977年 | 17篇 |
1976年 | 13篇 |
1975年 | 15篇 |
1973年 | 12篇 |
排序方式: 共有5329条查询结果,搜索用时 47 毫秒
121.
Adam Kłodowski Timo Rantalainen Aki Mikkola Ari Heinonen Harri Sievänen 《Multibody System Dynamics》2011,25(4):395-409
A method for bone strain estimation is examined in this article. The flexibility of a single bone in an otherwise rigid human
skeleton model has been studied previously by various authors. However, in the previous studies, the effect of the flexibility
of multiple bones on the musculoskeletal model behavior was ignored. This study describes a simulation method that can be
used to estimate the bone strains at both tibias and femurs of a 65-year-old Caucasian male subject. The verification of the
method is performed by the comparison of the results with other studies available in literature. The results of the study
show good correlation with the results of previous empirical studies. A damping effect of the flexible bones on the model
is also studied in this paper. 相似文献
122.
123.
124.
Andrzej Chmielowiec 《Theoretical computer science》2010,411(1):288-4737
In this paper the problem of the number of fixed points for an RSA algorithm is considered. This is an important question from the point of view of any cryptosystem. We have estimated the expected value of this number for randomly chosen RSA parameters. It turned out that it is O(ln2n), and the probability of finding such a point is O(ln2n/n). Thus, these values are really negligible, which had been intuitively expected. 相似文献
125.
The paper addresses the problem of multi-slot just-in-time scheduling. Unlike the existing literature on this subject, it
studies a more general criterion—the minimization of the schedule makespan rather than the minimization of the number of slots
used by schedule. It gives an O(nlog 2
n)-time optimization algorithm for the single machine problem. For arbitrary number of m>1 identical parallel machines it presents an O(nlog n)-time optimization algorithm for the case when the processing time of each job does not exceed its due date. For the general
case on m>1 machines, it proposes a polynomial time constant factor approximation algorithm. 相似文献
126.
127.
Marcin Miłkowski 《Minds and Machines》2009,19(4):465-475
In Darwin’s Dangerous Idea, Daniel Dennett claims that evolution is algorithmic. On Dennett’s analysis, evolutionary processes are trivially algorithmic
because he assumes that all natural processes are algorithmic. I will argue that there are more robust ways to understand
algorithmic processes that make the claim that evolution is algorithmic empirical and not conceptual. While laws of nature
can be seen as compression algorithms of information about the world, it does not follow logically that they are implemented
as algorithms by physical processes. For that to be true, the processes have to be part of computational systems. The basic
difference between mere simulation and real computing is having proper causal structure. I will show what kind of requirements
this poses for natural evolutionary processes if they are to be computational. 相似文献
128.
Tomasz Fałat Kazimierz Friedel Norman Marenco Stephan Warnat 《Microsystem Technologies》2009,15(1):181-190
The current paper focuses on several mechanical aspects of a waferlevel packaging approach using a direct face-to-face Chip-to-Wafer
(C2W) bonding of a MEMS device on an ASIC substrate wafer. Requirements of minimized inherent stress from packaging and good
decoupling from forces applied in manufacturing and application are discussed with particular attention to the presence of
through-silicon vias (TSV) in the substrate wafer. The paper deals with FEM analysis of temperature excursion, pressure during
molding, materials used and handling load influence on mechanical stress within the TSV system and on wafer level, which can
be large enough to disintegrate the system. 相似文献
129.
130.
Two mobile agents, starting from different nodes of a network at possibly different times, have to meet at the same node. This problem is known as rendezvous. Agents move in synchronous rounds. Each agent has a distinct integer label from the set \(\{1,\ldots ,L\}\). Two main efficiency measures of rendezvous are its time (the number of rounds until the meeting) and its cost (the total number of edge traversals). We investigate tradeoffs between these two measures. A natural benchmark for both time and cost of rendezvous in a network is the number of edge traversals needed for visiting all nodes of the network, called the exploration time. Hence we express the time and cost of rendezvous as functions of an upper bound E on the time of exploration (where E and a corresponding exploration procedure are known to both agents) and of the size L of the label space. We present two natural rendezvous algorithms. Algorithm Cheap has cost O(E) (and, in fact, a version of this algorithm for the model where the agents start simultaneously has cost exactly E) and time O(EL). Algorithm Fast has both time and cost \(O(E\log L)\). Our main contributions are lower bounds showing that, perhaps surprisingly, these two algorithms capture the tradeoffs between time and cost of rendezvous almost tightly. We show that any deterministic rendezvous algorithm of cost asymptotically E (i.e., of cost \(E+o(E)\)) must have time \(\varOmega (EL)\). On the other hand, we show that any deterministic rendezvous algorithm with time complexity \(O(E\log L)\) must have cost \(\varOmega (E\log L)\). 相似文献