全文获取类型
收费全文 | 2800篇 |
免费 | 134篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 32篇 |
化学工业 | 522篇 |
金属工艺 | 40篇 |
机械仪表 | 66篇 |
建筑科学 | 159篇 |
矿业工程 | 11篇 |
能源动力 | 151篇 |
轻工业 | 236篇 |
水利工程 | 26篇 |
石油天然气 | 2篇 |
无线电 | 248篇 |
一般工业技术 | 574篇 |
冶金工业 | 198篇 |
原子能技术 | 16篇 |
自动化技术 | 657篇 |
出版年
2023年 | 20篇 |
2022年 | 39篇 |
2021年 | 65篇 |
2020年 | 51篇 |
2019年 | 61篇 |
2018年 | 63篇 |
2017年 | 77篇 |
2016年 | 98篇 |
2015年 | 72篇 |
2014年 | 110篇 |
2013年 | 197篇 |
2012年 | 198篇 |
2011年 | 251篇 |
2010年 | 160篇 |
2009年 | 154篇 |
2008年 | 174篇 |
2007年 | 151篇 |
2006年 | 123篇 |
2005年 | 110篇 |
2004年 | 94篇 |
2003年 | 80篇 |
2002年 | 74篇 |
2001年 | 54篇 |
2000年 | 37篇 |
1999年 | 31篇 |
1998年 | 41篇 |
1997年 | 39篇 |
1996年 | 24篇 |
1995年 | 30篇 |
1994年 | 21篇 |
1993年 | 9篇 |
1992年 | 15篇 |
1991年 | 13篇 |
1990年 | 14篇 |
1989年 | 9篇 |
1988年 | 11篇 |
1987年 | 8篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1984年 | 16篇 |
1983年 | 15篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 12篇 |
1976年 | 8篇 |
1975年 | 11篇 |
1973年 | 6篇 |
排序方式: 共有2938条查询结果,搜索用时 203 毫秒
71.
Kendell R. Jillson Vishnu Chapalamadugu B. Erik Ydstie 《Journal of Process Control》2009,19(9):1470-1485
We present control strategies for an Integrated Gasification Combined Cycle (IGCC) power plant with CO2 recycles. One recycle allows for composition control and is useful when the side objective is to produce synthesis gas for chemicals. The second recycle enables temperature control in the gas turbine by using CO2 as a diluent. The main advantages of the second recycle are that NOx is not produced and that CO2/H2O separation is significantly easier than CO2/N2 separation, which reduces cost if the CO2 is to be sequestered. Models and control systems are developed using process network theory. We introduce a novel method for controlling quality variables and functions of inventories. Dynamic simulations using MATLAB/Simulink models show the response to step changes in setpoints and disturbances. The inventory control method is derived from conservation laws and the second law and it is applicable to process system models of any degree of complexity. A steady-state sensitivity analysis is performed, examining the effect of changing the temperature and C:O ratio within the gasifier on the power production. 相似文献
72.
Design patterns for user interface for mobile applications 总被引:1,自引:0,他引:1
The topic of this paper is a collection of user interface (UI) design patterns for mobile applications. In the paper we present the structure of the patterns collection – the patterns are suggested solutions to problems that are grouped into a set of problem areas that are further grouped into three main problem areas – a structure which is valuable both as an index to identifying patterns to use, and it gives a fairly comprehensive overview of issues when designing user interfaces for mobile applications. To show the breadth of the patterns collection we present six individual problems with connected design patterns in some detail – each coming from different problem areas. They represent important and relevant problems, and are on different levels of abstraction, thus showing how patterns may be used to present problems and solutions on different levels of detail. To show the relevance and usefulness of the patterns collection for usability professionals with a mixed background, we present some relevant findings from a validation of the patterns collection. In addition to verifying the relevance and usefulness of the patterns collection, it also shows both expected and surprising correlations between background and perceived relevance and usefulness. One important finding from the validation is an indication that the patterns collection is best suited for experienced UI developers wanting to start developing mobile UIs. Using a patterns collection for documenting design knowledge and experience has been a mixed experience, so we discuss pros and cons of this. Finally, we present related work and future research. 相似文献
73.
A k-spanner of a graph G is a spanning subgraph of G in which the distance between any pair of vertices is at most k times the distance in G. We prove that for fixed k,w, the problem of deciding if a given graph has a k-spanner of treewidth w is fixed-parameter tractable on graphs of bounded degree. In particular, this implies that finding a k-spanner that is a tree (a tree k-spanner) is fixed-parameter tractable on graphs of bounded degree. In contrast, we observe that if the graph has only one vertex of unbounded degree, then Treek-Spanner is NP-complete for k?4. 相似文献
74.
Khaled Elbassioni Erik Krohn Domagoj Matijević Julián Mestre Domagoj Ševerdija 《Algorithmica》2011,60(2):451-463
We present a 4-approximation algorithm for the problem of placing the fewest guards on a 1.5D terrain so that every point
of the terrain is seen by at least one guard. This improves on the previous best approximation factor of 5 (see King in Proceedings
of the 13th Latin American Symposium on Theoretical Informatics, pp. 629–640, 2006). Unlike most of the previous techniques, our method is based on rounding the linear programming relaxation of the corresponding
covering problem. Besides the simplicity of the analysis, which mainly relies on decomposing the constraint matrix of the
LP into totally balanced matrices, our algorithm, unlike previous work, generalizes to the weighted and partial versions of
the basic problem. 相似文献
75.
76.
Extensible Markup Language (XML) and the XML Path Language (XPath) are introduced with software examples demonstrating how one can use them to write laboratory data management programs. Topics explored include XML document creation, manipulation, and searching. Programming examples make use of the Microsoft® XML Parser library and the Visual Basic programming language. The problem of managing microplate screening data is used as an illustration. Source code for all examples can be downloaded from http://www.labprogrammer.net. 相似文献
77.
Real-time path planning in dynamic virtual environments using multiagent navigation graphs 总被引:1,自引:0,他引:1
Sud A Andersen E Curtis S Lin MC Manocha D 《IEEE transactions on visualization and computer graphics》2008,14(3):526-538
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG), which is constructed using first- and second-order Voronoi diagrams. The MaNG is used to perform route planning and proximity computations for each agent in real time. Moreover, we use the path information and proximity relationships for local dynamics computation of each agent by extending a social force model [Helbing05]. We compute the MaNG using graphics hardware and present culling techniques to accelerate the computation. We also address undersampling issues and present techniques to improve the accuracy of our algorithm. Our algorithm is used for real-time multi-agent planning in pursuit-evasion, terrain exploration and crowd simulation scenarios consisting of hundreds of moving agents, each with a distinct goal. 相似文献
78.
79.
Staged self-assembly: nanomanufacture of arbitrary shapes with <Emphasis Type="Italic">O</Emphasis>(1) glues 总被引:1,自引:1,他引:0
Erik D. Demaine Martin L. Demaine Sándor P. Fekete Mashhood Ishaque Eynat Rafalin Robert T. Schweller Diane L. Souvaine 《Natural computing》2008,7(3):347-370
We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later
mixing. This model and its various constraints and performance measures are motivated by a practical nanofabrication scenario
through protein-based bioengineering. Staging allows us to break through the traditional lower bounds in tile self-assembly
by encoding the shape in the staging algorithm instead of the tiles. All of our results are based on the practical assumption
that only a constant number of glues, and thus only a constant number of tiles, can be engineered. Under this assumption,
traditional tile self-assembly cannot even manufacture an n × n square; in contrast, we show how staged assembly in theory enables manufacture of arbitrary shapes in a variety of precise
formulations of the model.
相似文献
Diane L. SouvaineEmail: |
80.
An enduring mystery in biology is how a physical entity simple enough to have arisen spontaneously could have evolved into
the complex life seen on Earth today. Cairns-Smith has proposed that life might have originated in clays which stored genomes
consisting of an arrangement of crystal monomers that was replicated during growth. While a clay genome is simple enough to
have conceivably arisen spontaneously, it is not obvious how it might have produced more complex forms as a result of evolution.
Here, we examine this possibility in the tile assembly model, a generalized model of crystal growth that has been used to
study the self-assembly of DNA tiles. We describe hypothetical crystals for which evolution of complex crystal sequences is
driven by the scarceness of resources required for growth. We show how, under certain circumstances, crystal growth that performs
computation can predict which resources are abundant. In such cases, crystals executing programs that make these predictions
most accurately will grow fastest. Since crystals can perform universal computation, the complexity of computation that can
be used to optimize growth is unbounded. To the extent that lessons derived from the tile assembly model might be applicable
to mineral crystals, our results suggest that resource scarcity could conceivably have provided the evolutionary pressures
necessary to produce complex clay genomes that sense and respond to changes in their environment.
相似文献
Erik Winfree (Corresponding author)Email: |