全文获取类型
收费全文 | 4022篇 |
免费 | 439篇 |
国内免费 | 438篇 |
专业分类
电工技术 | 233篇 |
综合类 | 409篇 |
化学工业 | 65篇 |
金属工艺 | 51篇 |
机械仪表 | 442篇 |
建筑科学 | 65篇 |
矿业工程 | 55篇 |
能源动力 | 141篇 |
轻工业 | 43篇 |
水利工程 | 23篇 |
石油天然气 | 56篇 |
武器工业 | 55篇 |
无线电 | 276篇 |
一般工业技术 | 196篇 |
冶金工业 | 42篇 |
原子能技术 | 15篇 |
自动化技术 | 2732篇 |
出版年
2024年 | 9篇 |
2023年 | 24篇 |
2022年 | 40篇 |
2021年 | 55篇 |
2020年 | 67篇 |
2019年 | 80篇 |
2018年 | 64篇 |
2017年 | 74篇 |
2016年 | 107篇 |
2015年 | 105篇 |
2014年 | 200篇 |
2013年 | 215篇 |
2012年 | 230篇 |
2011年 | 318篇 |
2010年 | 259篇 |
2009年 | 280篇 |
2008年 | 302篇 |
2007年 | 361篇 |
2006年 | 368篇 |
2005年 | 289篇 |
2004年 | 257篇 |
2003年 | 203篇 |
2002年 | 175篇 |
2001年 | 160篇 |
2000年 | 124篇 |
1999年 | 85篇 |
1998年 | 112篇 |
1997年 | 70篇 |
1996年 | 61篇 |
1995年 | 54篇 |
1994年 | 38篇 |
1993年 | 27篇 |
1992年 | 23篇 |
1991年 | 16篇 |
1990年 | 11篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1987年 | 5篇 |
1986年 | 1篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1981年 | 1篇 |
1980年 | 5篇 |
1979年 | 1篇 |
1977年 | 2篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有4899条查询结果,搜索用时 0 毫秒
71.
Implementing efficient scheduling and dispatching policies is a critical means to gain competitiveness for modern semiconductor manufacturing systems. In contemporary global market, a successful semiconductor manufacturer has to excel in multiple performance indices, consequently qualified scheduling approaches should provide efficient and holistic management of wafer products, information and manufacturing resources and make adaptive decisions based on real-time processing status to reach an overall optimized system performance. To cope with this challenge, a timed extended object-oriented Petri nets (EOPNs) based multiple-objective scheduling and real-time dispatching approach is proposed in this paper. Four performance objectives pursued by semiconductor manufacturers are integrated into a priority-ranking algorithm that serves as the initial scheduling guidance, and then all wafer lots will be dynamically dispatched by the hybrid real-time dispatching control system. A set of simulation experiments validate the proposed multiple-objective scheduling and real-time dispatching algorithm may achieve satisfactory performances. 相似文献
72.
73.
74.
75.
Sadok Rezig Zied Achour Mohamed-Ali Kammoun 《International journal of systems science》2016,47(14):3425-3435
This paper addresses the synthesis of Petri net (PN) controller for the forbidden state transition problem with a new utilisation of the theory of regions. Moreover, as any method of control synthesis based on a reachability graph, the theory of regions suffers from the combinatorial explosion problem. The proposed work minimises the number of equations in the linear system of theory of regions and therefore one can reduce the computation time. In this paper, two different approaches are proposed to select minimal cuts in the reachability graph in order to synthesise a PN controller. Thanks to a switch from one cut to another, one can activate and deactivate the corresponding?PNcontroller. An application is implemented in a flexible manufacturing system to illustrate the present method. Finally, comparison with previous works with experimental results in obtaining a maximally permissive controller is presented. 相似文献
76.
Traditional region-based liveness-enforcing supervisors focus on (1) maximal permissiveness of not losing legal states, (2) structural simplicity of minimal number of monitors, and (3) fast computation. Lately, a number of similar approaches can achieve minimal configuration using efficient linear programming. However, it is unclear as to the relationship between the minimal configuration and the net structure. It is important to explore the structures involved for the fewest monitors required. Once the lower bound is achieved, further iteration to merge (or reduce the number of) monitors is not necessary. The minimal strongly connected resource subnet (i.e., all places are resources) that contains the set of resource places in a basic siphon is an elementary circuit. Earlier, we showed that the number of monitors required for liveness-enforcing and maximal permissiveness equals that of basic siphons for a subclass of Petri nets modelling manufacturing, called α systems. This paper extends this to systems more powerful than the α one so that the number of monitors in a minimal configuration remains to be lower bounded by that of basic siphons. This paper develops the theory behind and shows examples. 相似文献
77.
Duan Li Xiaoling Sun Jianjun Gao Shenshen Gu Xiaojin ZhengAuthor vitae 《Automatica》2011,47(9):2094-2098
Reachability is one of the most important behavioral properties of Petri nets. We propose in this paper a novel approach for solving the fundamental equation in the reachability analysis of acyclic Petri nets, which has been known to be NP-complete. More specifically, by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry, we develop an efficient solution scheme to identify firing count vector solution(s) to the fundamental equation on a bounded integer set, with a complexity bound of O((nu)n−m), where n is the number of transitions, m is the number of places and u is the upper bound of the number of firings for all individual transitions. 相似文献
78.
Rob J. van Glabbeek Ursula Goltz Jens-Wolfhard Schicke 《Information Processing Letters》2011,111(13):626-633
A well-known problem in Petri net theory is to formalise an appropriate causality-based concept of process or run for place/transition systems. The so-called individual token interpretation, where tokens are distinguished according to their causal history, giving rise to the processes of Goltz and Reisig, is often considered too detailed. The problem of defining a fully satisfying more abstract concept of process for general place/transition systems has so-far not been solved. In this paper, we recall the proposal of defining an abstract notion of process, here called BD-process, in terms of equivalence classes of Goltz-Reisig processes, using an equivalence proposed by Best and Devillers. It yields a fully satisfying solution for at least all one-safe nets. However, for certain nets which intuitively have different conflicting behaviours, it yields only one maximal abstract process. Here we identify a class of place/transition systems, called structural conflict nets, where conflict and concurrency due to token multiplicity are clearly separated. We show that, in the case of structural conflict nets, the equivalence proposed by Best and Devillers yields a unique maximal abstract process only for conflict-free nets. Thereby BD-processes constitute a simple and fully satisfying solution in the class of structural conflict nets. 相似文献
79.
Performance analysis of hierarchical group key management integrated with adaptive intrusion detection in mobile ad hoc networks 总被引:1,自引:0,他引:1
Jin-Hee ChoAuthor Vitae 《Performance Evaluation》2011,68(1):58-75
We develop a mathematical model to quantitatively analyze a scalable region-based hierarchical group key management protocol integrated with intrusion detection to deal with both outsider and insider security attacks for group communication systems (GCSs) in mobile ad hoc networks (MANETs). Our proposed adaptive intrusion detection technique is based on majority voting by nodes in a geographical region to cope with collusion of compromised nodes, with each node preloaded with anomaly-based or misuse-based intrusion detection techniques to diagnose compromised nodes in the same region. When given a set of parameter values characterizing operational and environmental conditions, we identify the optimal intrusion detection rate and the optimal regional area size under which the mean time to security failure of the system is maximized and/or the total communication cost is minimized for GCSs in MANET environments. The tradeoff analysis in performance versus security is useful in identifying and dynamically applying optimal settings to maximize the system lifetime for scalable mobile group applications while satisfying application-specific performance requirements. 相似文献
80.
We prove several decidability and undecidability results for ν-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of ν-PN strictly surpasses that of P/T nets. We encode ν-PN into Petri Data Nets, so that coverability, termination and boundedness are decidable. Moreover, we obtain Ackermann-hardness results for all our decidable decision problems. Then we consider two properties, width-boundedness and depth-boundedness, that factorize boundedness. Width-boundedness has already been proven to be decidable. Here we prove that its complexity is also non-primitive recursive. Then we prove undecidability of depth-boundedness. Finally, we prove that the corresponding “place version” of all the boundedness problems is undecidable for ν-PN. These results carry over to Petri Data Nets. 相似文献