全文获取类型
收费全文 | 1872篇 |
免费 | 234篇 |
国内免费 | 231篇 |
专业分类
电工技术 | 74篇 |
综合类 | 189篇 |
化学工业 | 41篇 |
金属工艺 | 56篇 |
机械仪表 | 71篇 |
建筑科学 | 62篇 |
矿业工程 | 14篇 |
能源动力 | 11篇 |
轻工业 | 50篇 |
水利工程 | 8篇 |
石油天然气 | 8篇 |
武器工业 | 12篇 |
无线电 | 188篇 |
一般工业技术 | 90篇 |
冶金工业 | 12篇 |
原子能技术 | 2篇 |
自动化技术 | 1449篇 |
出版年
2024年 | 5篇 |
2023年 | 21篇 |
2022年 | 24篇 |
2021年 | 31篇 |
2020年 | 47篇 |
2019年 | 47篇 |
2018年 | 44篇 |
2017年 | 49篇 |
2016年 | 58篇 |
2015年 | 74篇 |
2014年 | 93篇 |
2013年 | 125篇 |
2012年 | 148篇 |
2011年 | 155篇 |
2010年 | 127篇 |
2009年 | 149篇 |
2008年 | 158篇 |
2007年 | 157篇 |
2006年 | 161篇 |
2005年 | 110篇 |
2004年 | 86篇 |
2003年 | 79篇 |
2002年 | 63篇 |
2001年 | 48篇 |
2000年 | 40篇 |
1999年 | 20篇 |
1998年 | 25篇 |
1997年 | 26篇 |
1996年 | 20篇 |
1995年 | 26篇 |
1994年 | 14篇 |
1993年 | 18篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 10篇 |
1983年 | 2篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1975年 | 5篇 |
1974年 | 4篇 |
1973年 | 2篇 |
排序方式: 共有2337条查询结果,搜索用时 93 毫秒
1.
2.
Design and Implementation of a Flexible Manufacturing Control System Using Neural Network 总被引:1,自引:0,他引:1
Magdy M. Abdelhameed Farid A. Tolbah 《International Journal of Flexible Manufacturing Systems》2002,14(3):263-279
Design and implementation of a sequential controller based on the concept of artificial neural networks for a flexible manufacturing system are presented. The recurrent neural network (RNN) type is used for such a purpose. Contrary to the programmable controller, an RNN-based sequential controller is based on a definite mathematical model rather than depending on experience and trial and error techniques. The proposed controller is also more flexible because it is not limited by the restrictions of the finite state automata theory. Adequate guidelines of how to construct an RNN-based sequential controller are presented. These guidelines are applied to different case studies. The proposed controller is tested by simulations and real-time experiments. These tests prove the successfulness of the proposed controller performances. Theoretical as well as experimental results are presented and discussed indicating that the proposed design procedure using Elman's RNN can be effective in designing a sequential controller for event-based type manufacturing systems. In addition, the simulation results assure the effectiveness of the proposed controller to outperform the effect of noisy inputs. 相似文献
3.
In the paper, a model typical for contact situations of automotive brakes is established based on the method of movable cellular automata. The processes taking place at local contacts in an automotive brake system are analysed. Based on microscopic and micro-analytical observations, the following contact situations were simulated: (i) a couple of ferritic steel against pearlitic steel, both covered by an oxide layer mixed with graphite nanoparticles and (ii) the same situation but without oxide layers. The results of calculated mean coefficients of friction of the oxide-on-oxide contact correspond well to expected values for a real braking system, whereas steel-on-steel contact are twice as high. This allows one to make some conclusions; for example, oxide formation will take place more quickly than friction layer elimination, and finally this is responsible for the stabilisation of the coefficient of friction. 相似文献
4.
Learning Automata from Ordered Examples 总被引:1,自引:1,他引:0
Connectionist learning models have had considerable empirical success, but it is hard to characterize exactly what they learn. The learning of finite-state languages (FSL) from example strings is a domain which has been extensively studied and might provide an opportunity to help understand connectionist learning. A major problem is that traditional FSL learning assumes the storage of all examples and thus violates connectionist principles. This paper presents a provably correct algorithm for inferring any minimum-state deterministic finite-state automata (FSA) from a complete ordered sample using limited total storage and without storing example strings. The algorithm is an iterative strategy that uses at each stage a current encoding of the data considered so far, and one single sample string. One of the crucial advantages of our algorithm is that the total amount of space used in the course of learning for encoding any finite prefix of the sample is polynomial in the size of the inferred minimum state deterministic FSA. The algorithm is also relatively efficient in time and has been implemented. More importantly, there is a connectionist version of the algorithm that preserves these properties. The connectionist version requires much more structure than the usual models and has been implemented using the Rochester Connectionist Simulator. We also show that no machine with finite working storage can iteratively identify the FSL from arbitrary presentations. 相似文献
5.
6.
This paper addresses the key issue of providingflexible multimedia presentation with user participation and suggests synchronization models that can specify the user participation during the presentation. We study models like the Petrinet-based hypertext model and the object composition Petri nets (OCPN). We suggest adynamic timed Petri nets structure that can model pre-emptions and modifications to the temporal characteristics of the net. This structure can be adopted by the OCPN to facilitate modeling of multimedia synchronization characteristics with dynamic user participation. We show that the suggested enhancements for the dynamic timed Petri nets satisfy all the properties of the Petri net theory. We use the suggested enhancements to model typical scenarios in a multimedia presentation with user inputs. 相似文献
7.
Antonio Camurri Paolo Franchi Francesca Gandolfo Renato Zaccaria 《Journal of Intelligent and Robotic Systems》1993,8(1):99-123
In this paper, we propose a class of algorithms for the sub-optimal solution of a particular class of problems of process scheduling, particularly focusing on a case study in the area of flexible manufacturing systems (FMSs). The general class of problems we face in our approach is characterized as follows: there is a set of concurrent processes, each formed by a number of temporally related tasks (segments). Tasks are executable by alternate resource sets, different both in performance and costs. Processes and tasks are characterized by release times, due dates, and deadlines. Time constraints are also present in the availability of each resource in resource sets. It has been proven that such a problem does not admit an algorithm for an optimal solution in polynomial time. Our proposed algorithm finds a sub-optimal schedule according to a set of optimization criteria, based on task and process times (earliness, tardiness), and/or time independent costs of resources. Our approach to process scheduling is based on Timed Coloured Petri Nets. We describe the structure of the coordination and scheduling algorithms, concentrating on (i) the general-purpose component, and (ii) the application-dependent component. In particular, the paper focuses on the following issues: (i) theautomatic synthesis of Petri net models of the coordination subsystem, starting from the problem knowledge base; (ii) the dynamic behavior of the coordination subsystem, whose kernel is a High Level Petri net executor, a coordination process based on an original, general purpose algorithm; (iii) the structure of the real-time scheduling subsystem, based on particular heuristic sub-optimal multi-criteria algorithms. Furthermore, the paper defines the interaction mechanisms between the coordination and scheduling subsystems. Our approach clearly distinguishes the mechanism of the net execution from the decision support system. Two conceptually distinct levels, which correspond to two different, interacting implementation modules in the prototype CASE tool, have been defined: theexecutor and thescheduler levels. One of the outstanding differences between these levels is that the executor is conceived as a fast, efficient coordination process, without special-purpose problem-solving capabilities in case of conflicts. The scheduler, on the other hand, is the adaptive, distributed component, whose behavior may heavily depend on the problem class. If the scheduler fails, the executor is, in any case, able to proceed with a general-purpose conflict resolution strategy. Experimental results on the real-time performance of the kernel of the implemented system are finally shown in the paper. The approach described in this paper is at the basis of a joint project with industrial partners for the development of a CASE tool for the simulation of blast furnaces. 相似文献
8.
We report an unexpectedly rich variety of new flow patterns on a granular heap that is centrifuged so as to simulate a reduction
in gravity. These surface patterns exhibit coexisting static and flowing regions that depend strongly on centrifugal stress,
but surprisingly not on mass flow rate. A discrete cellular automata model reproduces some of the patterning features and
indicates that subsurface jamming may precipitate the formation of localized frozen patterns on the surface. This model provides
insights into the mechanics of granular flows under controlled stress environment and jammed-to-flowing transitions in granular
media. 相似文献
9.
We exhibit small size measure-once one-way quantum finite automata (mo-1qfa’s) inducing multiperiodic stochastic events. Moreover, for certain classes of multiperiodic languages, we exhibit: (i) isolated cut point mo-1qfa’s whose size logarithmically depends on the periods; (ii) Monte Carlo mo-1qfa’s whose size logarithmically depends on the periods and polynomially on the inverse of the error probability. 相似文献
10.
Obtaining shorter regular expressions from finite-state automata 总被引:1,自引:0,他引:1
We consider the use of state elimination to construct shorter regular expressions from finite-state automata (FAs). Although state elimination is an intuitive method for computing regular expressions from FAs, the resulting regular expressions are often very long and complicated. We examine the minimization of FAs to obtain shorter expressions first. Then, we introduce vertical chopping based on bridge states and horizontal chopping based on the structural properties of given FAs. We prove that we should not eliminate bridge states until we eliminate all non-bridge states to obtain shorter regular expressions. In addition, we suggest heuristics for state elimination that leads to shorter regular expressions based on vertical chopping and horizontal chopping. 相似文献