全文获取类型
收费全文 | 1205篇 |
免费 | 73篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 11篇 |
综合类 | 8篇 |
化学工业 | 263篇 |
金属工艺 | 21篇 |
机械仪表 | 11篇 |
建筑科学 | 62篇 |
能源动力 | 44篇 |
轻工业 | 167篇 |
水利工程 | 14篇 |
石油天然气 | 2篇 |
无线电 | 150篇 |
一般工业技术 | 232篇 |
冶金工业 | 90篇 |
原子能技术 | 14篇 |
自动化技术 | 190篇 |
出版年
2023年 | 12篇 |
2022年 | 12篇 |
2021年 | 23篇 |
2020年 | 15篇 |
2019年 | 20篇 |
2018年 | 28篇 |
2017年 | 32篇 |
2016年 | 25篇 |
2015年 | 32篇 |
2014年 | 46篇 |
2013年 | 51篇 |
2012年 | 74篇 |
2011年 | 69篇 |
2010年 | 55篇 |
2009年 | 58篇 |
2008年 | 47篇 |
2007年 | 58篇 |
2006年 | 48篇 |
2005年 | 36篇 |
2004年 | 37篇 |
2003年 | 35篇 |
2002年 | 27篇 |
2001年 | 22篇 |
2000年 | 19篇 |
1999年 | 21篇 |
1998年 | 37篇 |
1997年 | 32篇 |
1996年 | 26篇 |
1995年 | 21篇 |
1994年 | 14篇 |
1993年 | 18篇 |
1992年 | 9篇 |
1991年 | 11篇 |
1990年 | 8篇 |
1989年 | 10篇 |
1988年 | 5篇 |
1987年 | 11篇 |
1986年 | 14篇 |
1985年 | 19篇 |
1984年 | 17篇 |
1983年 | 10篇 |
1982年 | 13篇 |
1981年 | 20篇 |
1980年 | 15篇 |
1979年 | 4篇 |
1978年 | 10篇 |
1977年 | 14篇 |
1976年 | 13篇 |
1975年 | 7篇 |
1973年 | 4篇 |
排序方式: 共有1279条查询结果,搜索用时 15 毫秒
21.
Decoupling Charge Transport and Electroluminescence in a High Mobility Polymer Semiconductor
下载免费PDF全文
![点击此处可从《Advanced materials (Deerfield Beach, Fla.)》网站下载免费的PDF全文](/ch/ext_images/free.gif)
22.
Horst Kesselmeier Inga Tschiersch Klaus Henning Beate Stoffels Sebastian Kutscha 《AI & Society》1998,12(1-2):55-63
Today technology design can no longer be understood as a design process on a green site. Design and implementation of new technology are always dependent on existing technology and the way it is used by people. In this respect Software-Engineering has also changed to the characteristics of normal technology design taking into account existing computer systems. Experiences show that the conditions and needs of such Software-Reengineering projects are highly complex and differ in their special characteristics ranging from aspects of quality of existing system documentation to organizational structures of the computer departments concerned. The Task-Artifact Cycle presented here gives a suitable reengineering approach emphasizing both analysis and design in Software-Reengineering. 相似文献
23.
Valuations — morphisms from (
n
*
,·,) to ((0, ), ·, 1) — are a simple generalization of so-called Bernoulli morphisms. In this paper, we show a characterization of strongly unambiguous regular expressions with the help of valuations and formal power series. We apply these algebraic results to the determination of Hausdorff dimensions of fractals described by regular expressions. 相似文献
24.
Edith Hemaspaandra Henning Schnoor Ilka Schnoor 《Journal of Computer and System Sciences》2010,76(7):561-578
It is well known that modal satisfiability is PSPACE-complete (Ladner (1977) [21]). However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators, since a propositional operator is simply a Boolean function. We completely classify the complexity of modal satisfiability for every finite set of propositional operators, i.e., in contrast to previous work, we classify an infinite number of problems. We show that, depending on the set of propositional operators, modal satisfiability is PSPACE-complete, coNP-complete, or in P. We obtain this trichotomy not only for modal formulas, but also for their more succinct representation using modal circuits. We consider both the uni-modal and the multi-modal cases, and study the dual problem of validity as well. 相似文献
25.
L.J. Zeballos O.D. Quiroga G.P. Henning 《Engineering Applications of Artificial Intelligence》2010,23(2):229-248
This contribution presents an integrated constraint programming (CP) model to tackle the problems of tool allocation, machine loading, part routing, and scheduling in a flexible manufacturing system (FMS). The formulation, which is able to take into account a variety of constraints found in industrial environments, as well as several objective functions, has been successfully applied to the solution of various case studies of different sizes. Though some of the problem instances have bigger sizes than the examples reported to date in literature, very good-quality solutions were reached in quite reasonable CPU times. This good computational performance is due to two essential characteristics of the proposed model. The most significant one is the use of two sets of two-index variables to capture manufacturing activities instead of having just one set of four indexes. Thus, dimensionality is greatly reduced. The other relevant feature is the fact that the model relies on an indirect representation of tool needs by means of tool types, thus avoiding the consideration of tool copies. 相似文献
26.
We investigate the decidability of the operation problem for T0L languages and subclasses. Fix an operation on formal languages. Given languages from the family considered (0L languages, T0L languages, or their propagating variants), is the application of this operation to the given languages still a language that belongs to the same language family? Observe, that all the Lindenmayer language families in question are anti-AFLs, that is, they are not closed under homomorphisms, inverse homomorphisms, intersection with regular languages, union, concatenation, and Kleene closure. Besides these classical operations we also consider intersection and substitution, since the language families under consideration are not closed under these operations, too. We show that for all of the above mentioned language operations, except for the Kleene closure, the corresponding operation problems of 0L and T0L languages and their propagating variants are not even semidecidable. The situation changes for unary 0L languages. In this case we prove that the operation problems with respect to Kleene star, complementation, and intersection with regular sets are decidable. 相似文献
27.
Arnaud Grasset Philippe Millet Philippe Bonnot Sami Yehia Wolfram Putzke-Roeming Fabio Campi Alberto Rosti Michael Huebner Nikolaos S. Voros Davide Rossi Henning Sahlbach Rolf Ernst 《International journal of parallel programming》2011,39(3):328-356
Reconfigurable computing offers a wide range of low cost and efficient solutions for embedded systems. The proper choice of the reconfigurable device, the granularity of its processing elements and its memory architecture highly depend on the type of application and their data flow. Existing solutions either offer fine grain FPGAs, which rely on a hardware synthesis flow and offer the maximum degree of flexibility, or coarser grain solutions, which are usually more suitable for a particular type of data flow and applications. In this paper, we present the MORPHEUS architecture, a versatile reconfigurable heterogeneous System-on-Chip targeting streaming applications. The presented architecture exploits different reconfigurable technologies at several computation granularities that efficiently address the different applications needs. In order to efficiently exploit the presented architecture, we implemented a complete software solution to map C applications to the reconfigurable architecture. In this paper, we describe the complete toolset and provide concrete use cases of the architecture. 相似文献
28.
29.
30.
Henning Fernau 《Information and Computation》2009,207(4):521-541
We describe algorithms that directly infer very simple forms of 1-unambiguous regular expressions from positive data. Thus, we characterize the regular language classes that can be learned this way, both in terms of regular expressions and in terms of (not necessarily minimal) deterministic finite automata. 相似文献