全文获取类型
收费全文 | 2783篇 |
免费 | 134篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 32篇 |
化学工业 | 527篇 |
金属工艺 | 39篇 |
机械仪表 | 66篇 |
建筑科学 | 159篇 |
矿业工程 | 11篇 |
能源动力 | 150篇 |
轻工业 | 236篇 |
水利工程 | 24篇 |
石油天然气 | 2篇 |
无线电 | 249篇 |
一般工业技术 | 573篇 |
冶金工业 | 184篇 |
原子能技术 | 15篇 |
自动化技术 | 653篇 |
出版年
2024年 | 5篇 |
2023年 | 21篇 |
2022年 | 47篇 |
2021年 | 65篇 |
2020年 | 51篇 |
2019年 | 61篇 |
2018年 | 63篇 |
2017年 | 76篇 |
2016年 | 97篇 |
2015年 | 72篇 |
2014年 | 110篇 |
2013年 | 196篇 |
2012年 | 197篇 |
2011年 | 249篇 |
2010年 | 160篇 |
2009年 | 154篇 |
2008年 | 174篇 |
2007年 | 151篇 |
2006年 | 123篇 |
2005年 | 109篇 |
2004年 | 94篇 |
2003年 | 79篇 |
2002年 | 73篇 |
2001年 | 54篇 |
2000年 | 37篇 |
1999年 | 31篇 |
1998年 | 34篇 |
1997年 | 34篇 |
1996年 | 21篇 |
1995年 | 29篇 |
1994年 | 19篇 |
1993年 | 7篇 |
1992年 | 15篇 |
1991年 | 13篇 |
1990年 | 14篇 |
1989年 | 9篇 |
1988年 | 11篇 |
1987年 | 8篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1984年 | 16篇 |
1983年 | 14篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 12篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 12篇 |
1973年 | 6篇 |
排序方式: 共有2920条查询结果,搜索用时 15 毫秒
71.
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. 相似文献
72.
73.
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. 相似文献
74.
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. 相似文献
75.
76.
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: |
77.
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: |
78.
Hollnagel E 《Applied ergonomics》2007,38(4):409-416
The change from managed to free flight is expected to have large effects, over and above the intended efficiency gains. Human factor concerns have understandably focused on how free flight may affect the pilots in the cockpit. Yet it is necessary to see the change from managed to free flight as more than just an increment to the pilots' work. Despite the best intentions the transition will not be a case of a smooth, carefully planned and therefore uneventful introduction of a new technology. It is more likely to be a substantial change to an already challenging working environment, in the air as well as on the ground. The significant effects will therefore not just happen within the existing structure or distribution of work and responsibilities, but affect the structure of work itself. This paper takes a look at free flight from a cognitive systems engineering perspective and identifies two major concerns: first what effects free flight has on the boundaries of the joint cognitive systems, and second how this affects demands to control. The conclusion is that both will change considerably and that we need to understand the nature of these changes before focusing on the possible effects of free flight on pilots' performance. 相似文献
79.
We present a dynamic comparison-based search structure that supports insertions, deletions, and searches within the unified bound. The unified bound specifies that it is quick to access an element that is near a recently accessed element. More precisely, if w(y) distinct elements have been accessed since the last access to element y, and d(x,y) denotes the rank distance between x and y among the current set of elements, then the amortized cost to access element x is O(minylog[w(y)+d(x,y)+2]). This property generalizes the working-set and dynamic-finger properties of splay trees. 相似文献
80.
Epochal dynamics, in which long periods of stasis in an evolving population are punctuated by a sudden burst of change, is a common behavior in both natural and artificial evolutionary processes. We analyze the population dynamics for a class of fitness functions that exhibit epochal behavior using a mathematical framework developed recently, which incorporates techniques from the fields of mathematical population genetics, molecular evolution theory, and statistical mechanics. Our analysis predicts the total number of fitness function evaluations to reach the global optimum as a function of mutation rate, population size, and the parameters specifying the fitness function. This allows us to determine the optimal evolutionary parameter settings for this class of fitness functions.We identify a generalized error threshold that smoothly bounds the two-dimensional regime of mutation rates and population sizes for which epochal evolutionary search operates most efficiently. Specifically, we analyze the dynamics of epoch destabilization under finite-population sampling fluctuations and show how the evolutionary parameters effectively introduce a coarse graining of the fitness function. More generally, we find that the optimal parameter settings for epochal evolutionary search correspond to behavioral regimes in which the consecutive epochs are marginally stable against the sampling fluctuations. Our results suggest that in order to achieve optimal search, one should set evolutionary parameters such that the coarse graining of the fitness function induced by the sampling fluctuations is just large enough to hide local optima. 相似文献