全文获取类型
收费全文 | 4071篇 |
免费 | 92篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 193篇 |
综合类 | 13篇 |
化学工业 | 931篇 |
金属工艺 | 101篇 |
机械仪表 | 73篇 |
建筑科学 | 87篇 |
矿业工程 | 4篇 |
能源动力 | 139篇 |
轻工业 | 292篇 |
水利工程 | 9篇 |
石油天然气 | 5篇 |
无线电 | 435篇 |
一般工业技术 | 556篇 |
冶金工业 | 919篇 |
原子能技术 | 86篇 |
自动化技术 | 325篇 |
出版年
2023年 | 21篇 |
2022年 | 43篇 |
2021年 | 78篇 |
2020年 | 25篇 |
2019年 | 34篇 |
2018年 | 50篇 |
2017年 | 44篇 |
2016年 | 63篇 |
2015年 | 47篇 |
2014年 | 103篇 |
2013年 | 181篇 |
2012年 | 137篇 |
2011年 | 181篇 |
2010年 | 138篇 |
2009年 | 132篇 |
2008年 | 157篇 |
2007年 | 163篇 |
2006年 | 117篇 |
2005年 | 142篇 |
2004年 | 97篇 |
2003年 | 131篇 |
2002年 | 98篇 |
2001年 | 89篇 |
2000年 | 79篇 |
1999年 | 99篇 |
1998年 | 381篇 |
1997年 | 215篇 |
1996年 | 145篇 |
1995年 | 104篇 |
1994年 | 103篇 |
1993年 | 81篇 |
1992年 | 41篇 |
1991年 | 42篇 |
1990年 | 35篇 |
1989年 | 56篇 |
1988年 | 29篇 |
1987年 | 26篇 |
1986年 | 35篇 |
1985年 | 35篇 |
1984年 | 36篇 |
1983年 | 39篇 |
1982年 | 29篇 |
1981年 | 35篇 |
1980年 | 28篇 |
1979年 | 32篇 |
1978年 | 34篇 |
1977年 | 37篇 |
1976年 | 54篇 |
1974年 | 17篇 |
1973年 | 11篇 |
排序方式: 共有4168条查询结果,搜索用时 15 毫秒
51.
For a connected graph G=(V,E), a subset U⊆V is a disconnected cut if U disconnects G and the subgraph G[U] induced by U is disconnected as well. A cut U is a k-cut if G[U] contains exactly k(≥1) components. More specifically, a k-cut U is a (k,?)-cut if V?U induces a subgraph with exactly ?(≥2) components. The Disconnected Cut problem is to test whether a graph has a disconnected cut and is known to be NP-complete. The problems k-Cut and (k,?)-Cut are to test whether a graph has a k-cut or (k,?)-cut, respectively. By pinpointing a close relationship to graph contractibility problems we show that (k,?)-Cut is in P for k=1 and any fixed constant ?≥2, while it is NP-complete for any fixed pair k,?≥2. We then prove that k-Cut is in P for k=1 and NP-complete for any fixed k≥2. On the other hand, for every fixed integer g≥0, we present an FPT algorithm that solves (k,?)-Cut on graphs of Euler genus at most g when parameterized by k+?. By modifying this algorithm we can also show that k-Cut is in FPT for this graph class when parameterized by k. Finally, we show that Disconnected Cut is solvable in polynomial time for minor-closed classes of graphs excluding some apex graph. 相似文献
52.
53.
Codevelopmental learning between human and humanoid robot using a dynamic neural-network model. 总被引:1,自引:0,他引:1
Jun Tani Ryu Nishimoto Jun Namikawa Masato Ito 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2008,38(1):43-59
This paper examines characteristics of interactive learning between human tutors and a robot having a dynamic neural-network model, which is inspired by human parietal cortex functions. A humanoid robot, with a recurrent neural network that has a hierarchical structure, learns to manipulate objects. Robots learn tasks in repeated self-trials with the assistance of human interaction, which provides physical guidance until the tasks are mastered and learning is consolidated within the neural networks. Experimental results and the analyses showed the following: 1) codevelopmental shaping of task behaviors stems from interactions between the robot and a tutor; 2) dynamic structures for articulating and sequencing of behavior primitives are self-organized in the hierarchically organized network; and 3) such structures can afford both generalization and context dependency in generating skilled behaviors. 相似文献
54.
Makoto Sakamoto Kaoru Kajisa Naoko Tomozoe Takao Ito Hiroshi Furutani Michio Kono Satoshi Ikeda 《Artificial Life and Robotics》2008,13(1):61-64
In 1997, C.R. Dyer and A. Rosenfeld introduced an acceptor on a two-dimensional pattern (or tape), called the pyramid cellular acceptor, and demonstrated that many useful recognition tasks are executed by pyramid cellular acceptors in time proportional to the
logarithm of the diameter of the input. They also introduced a bottom-up pyramid cellular acceptor which is a restricted version of the pyramid cellular acceptor, and proposed some interesting open problems of the bottom-up
pyramid cellular acceptors. On the other hand, we think that the study of threedimensional automata has been meaningful as
the computational model of three-dimensional information processing such as computer vision, robotics, and so forth. In this
paper, we investigate about bottom-up pyramid cellular acceptors with three-dimensional layers, and show their some accepting
powers.
This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January
31–February 2, 2008 相似文献
55.
Chuzo Iwamoto Naoki Hatayama Yoshiaki Nakashiba Kenichi Morita Katsunobu Imai 《Acta Informatica》2007,44(5):345-359
We present translational lemmas for the three standard models of parallel computation, and apply them to obtain tight hierarchy
results. It is shown that, for arbitrarily small rational constant , (i) there is a language which can be accepted by a -uniform circuit family of depth and size but not by any -uniform circuit family of depth and size , (ii) there is a language which can be accepted by a -time -space ATM with l worktapes but not by any -time -space ATM with the same l worktapes if the number of tape symbols is fixed, and (iii) there is a language which can be accepted by a -time PRAM with processors but not by any -time PRAM with processors. Here, c > 0, d ≥ 1, r
1 > 1, and r
2 ≥ 1 are arbitrary rational constants, and l ≥ 2 is an arbitrary integer.
Preliminary versions of different parts of this paper appeared in Proc. MCU 2004 (LNCS 3354) and Proc. FCT 2005 (LNCS 3623). 相似文献
56.
The authors investigate complete system development using a Java machine aimed at FPGA devices. A new design strategy targets a single FPGA chip, within which the dedicated Java microcontroller-FemtoJava-is synthesized 相似文献
57.
Given a digraph (or an undirected graph) G=(V,E) with a set V of vertices v with nonnegative real costs w(v), and a set E of edges and a positive integer k, we deal with the problem of finding a minimum cost subset SV such that, for each vertex vV−S, there are k vertex-disjoint paths from S to v. In this paper, we show that the problem can be solved by a greedy algorithm in
time in a digraph (or in
time in an undirected graph), where n=|V| and m=|E|. Based on this, given a digraph and two integers k and ℓ, we also give a polynomial time algorithm for finding a minimum cost subset SV such that for each vertex vV−S, there are k vertex-disjoint paths from S to v as well as ℓ vertex-disjoint paths from v to S. 相似文献
58.
We consider weighted finite transducers over arbitrary groups, that is finite transducers having a counter in which, at any
step, a value of the group is stored but no information regarding the content of this counter is available until the computation
is finished. The computation is valid if the counter value is the neutral element of the group. We generalize here some results
from [8] and [17].
Received: 28 January 2001 / 5 June 2001 相似文献
59.
Optical two-way communication system using a rotary coupler 总被引:1,自引:0,他引:1
60.
Case learning for CBR-based collision avoidance systems 总被引:1,自引:1,他引:0
Yuhong Liu Chunsheng Yang Yubin Yang Fuhua Lin Xuanmin Du Takayuki Ito 《Applied Intelligence》2012,36(2):308-319
With the rapid development of case-based reasoning (CBR) techniques, CBR has been widely applied to real-world applications
such as collision avoidance systems. A successful CBR-based system relies on a high-quality case base, and a case creation
technique for generating such a case base is highly required. In this paper, we propose an automated case learning method
for CBR-based collision avoidance systems. Building on techniques from CBR and natural language processing, we developed a
methodology for learning cases from maritime affair records. After giving an overview on the developed systems, we present
the methodology and the experiments conducted in case creation and case evaluation. The experimental results demonstrated
the usefulness and applicability of the case learning approach for generating cases from the historic maritime affair records. 相似文献