全文获取类型
收费全文 | 2472篇 |
免费 | 184篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 53篇 |
综合类 | 3篇 |
化学工业 | 773篇 |
金属工艺 | 31篇 |
机械仪表 | 54篇 |
建筑科学 | 75篇 |
能源动力 | 97篇 |
轻工业 | 327篇 |
水利工程 | 15篇 |
石油天然气 | 6篇 |
无线电 | 241篇 |
一般工业技术 | 421篇 |
冶金工业 | 94篇 |
原子能技术 | 12篇 |
自动化技术 | 460篇 |
出版年
2024年 | 7篇 |
2023年 | 59篇 |
2022年 | 146篇 |
2021年 | 203篇 |
2020年 | 91篇 |
2019年 | 88篇 |
2018年 | 119篇 |
2017年 | 93篇 |
2016年 | 114篇 |
2015年 | 90篇 |
2014年 | 130篇 |
2013年 | 187篇 |
2012年 | 173篇 |
2011年 | 200篇 |
2010年 | 146篇 |
2009年 | 123篇 |
2008年 | 105篇 |
2007年 | 104篇 |
2006年 | 91篇 |
2005年 | 54篇 |
2004年 | 52篇 |
2003年 | 45篇 |
2002年 | 24篇 |
2001年 | 25篇 |
2000年 | 15篇 |
1999年 | 14篇 |
1998年 | 22篇 |
1997年 | 29篇 |
1996年 | 23篇 |
1995年 | 15篇 |
1994年 | 7篇 |
1993年 | 12篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 9篇 |
1989年 | 5篇 |
1988年 | 5篇 |
1985年 | 4篇 |
1984年 | 1篇 |
1983年 | 4篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有2662条查询结果,搜索用时 15 毫秒
71.
In recent years, there has been a growing interest in developing statistical learning methods to provide approximate solutions to “difficult” control problems. In particular, randomized algorithms have become a very popular tool used for stability and performance analysis as well as for design of control systems. However, as randomized algorithms provide an efficient solution procedure to the “intractable” problems, stochastic methods bring closer to understanding the properties of the real systems. The topic of this paper is the use of stochastic methods in order to solve the problem of control robustness: the case of parametric stochastic uncertainty is considered. Necessary concepts regarding stochastic control theory and stochastic differential equations are introduced. Then a convergence analysis is provided by means of the Chernoff bounds, which guarantees robustness in mean and in probability. As an illustration, the robustness of control performances of example control systems is computed. 相似文献
72.
In systems coordinated with a distributed set of tuple spaces, it is crucial to assist agents in retrieving the tuples they are interested in. This can be achieved by sorting techniques that group similar tuples together in the same tuple space, so that the position of a tuple can be inferred by similarity. Accordingly, we formulate the collective sort problem for distributed tuple spaces, where a set of agents is in charge of moving tuples up to a complete sort has been reached, namely, each of the N tuple spaces aggregate tuples belonging to one of the N kinds available. After pointing out the requirements for effectively tackling this problem, we propose a self-organizing solution resembling brood sorting performed by ants. This is based on simple agents that perform partial observations and accordingly take decisions on tuple movement. Convergence is addressed by a fully adaptive method for simulated annealing, based on noise tuples inserted and removed by agents on a need basis so as to avoid sub-optimal sorting. Emergence of sorting properties and scalability are evaluated through stochastic simulations. 相似文献
73.
74.
The aim of this paper is to deal with the problem of fault tolerant control in the framework of discrete event systems modeled as automata. A fault tolerant controller is a controller able to satisfy control specifications both in nominal operation and after the occurrence of a fault. This task is solved by means of a parameterized controller that is suitably updated on the basis of the information provided by online diagnostics: the supervisor actively reacts to the detection of a malfunctioning component in order to eventually meet degraded control specifications. Starting from an appropriate model of the system, we recall the notion of safe diagnosability as a necessary step in order to achieve fault tolerant control. We then introduce two new notions: (i) “safe controllability”, which represents the capability, after the occurrence of a fault, of steering the system away from forbidden zones and (ii) “active fault tolerant system”, which is the property of safely continuing operation after faults. Finally, we show how the problem can be solved using a general control architecture based on the use of special kind of diagnoser, called “diagnosing controller”, which is used to safely detect faults and to switch between the nominal control policy and a bank of reconfigured control policies. A simple example is used to illustrate the new notions and the control architecture introduced in the paper. 相似文献
75.
In the area of membrane computing, time-freeness has been defined as the ability for a timed membrane system to produce always
the same result, independently of the execution times associated to the rules. In this paper, we use a similar idea in the
framework of spiking neural P systems, a model inspired by the structure and the functioning of neural cells. In particular,
we introduce stochastic spiking neural P systems where the time of firing for an enabled spiking rule is probabilistically
chosen and we investigate when, and how, these probabilities can influence the ability of the systems to simulate, in a reliable
way, universal machines, such as register machines. 相似文献
76.
Enver Sangineto Nicola Capuano Matteo Gaeta Alessandro Micarelli 《Universal Access in the Information Society》2008,7(1-2):1-23
This paper presents an approach to automatic course generation and student modeling. The method has been developed during
the European funded projects Diogene and Intraserv, focused on the construction of an adaptive e-learning platform. The aim
of the platform is the automatic generation and personalization of courses, taking into account pedagogical knowledge on the
didactic domain as well as statistic information on both the student’s knowledge degree and learning preferences. Pedagogical
information is described by means of an innovative methodology suitable for effective and efficient course generation and
personalization. Moreover, statistic information can be collected and exploited by the system in order to better describe
the student’s preferences and learning performances. Learning material is chosen by the system matching the student’s learning
preferences with the learning material type, following a pedagogical approach suggested by Felder and Silverman. The paper
discusses how automatic learning material personalization makes it possible to facilitate distance learning access to both
able-bodied and disabled people. Results from the Diogene and Intraserv evaluation are reported and discussed. 相似文献
77.
Sacchi M Spezzani C Carpentiero A Prasciolu M Delaunay R Lüning J Polack F 《The Review of scientific instruments》2007,78(4):043702
We have developed a setup for measuring holographically formed interference patterns using an integrated sample-mask design. The direct space image of the sample is obtained via a two-dimensional Fourier transform of the X-ray diffraction pattern. We present the details of our setup, commenting on the influence of geometrical parameters on the imaging capabilities. As an example, we present and discuss the results of test experiments on a patterned Co film. 相似文献
78.
Matteo Casadei Luca Gardelli Mirko Viroli 《Electronic Notes in Theoretical Computer Science》2007,175(2):59
Recent coordination languages and models are moving towards the application of techniques coming from the research context of complex systems: adaptivity and self-organization are exploited in order to tackle the openness, dynamism and unpredictability of today's distributed systems. In this area, systems are to be described using stochastic models, and simulation is a valuable tool both for analysis and design. Accordingly, in this work we focused on modelling and simulating emergent properties of coordination techniques.We first develop a framework acting as a general-purpose engine for simulating stochastic transition systems, built as a library for the Maude term rewriting system. We then evaluate this tool to a coordination problem called collective sort, where autonomous agents move tuples across different tuple spaces according to local criteria, and resulting in the emergence of the complete clustering property. 相似文献
79.
80.
A number of techniques that infer finite state automata from execution traces have been used to support test and analysis activities. Some of these techniques can produce automata that integrate information about the data-flow, that is, they also represent how data values affect the operations executed by programs.The integration of information about operation sequences and data values into a unique model is indeed conceptually useful to accurately represent the behavior of a program. However, it is still unclear whether handling heterogeneous types of information, such as operation sequences and data values, necessarily produces higher quality models or not.In this paper, we present an empirical comparative study between techniques that infer simple automata and techniques that infer automata extended with information about data-flow. We investigate the effectiveness of these techniques when applied to traces with different levels of sparseness, produced by different software systems. To the best of our knowledge this is the first work that quantifies both the effect of adding data-flow information within automata and the effectiveness of the techniques when varying sparseness of traces. 相似文献