全文获取类型
收费全文 | 2397篇 |
免费 | 96篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 24篇 |
综合类 | 2篇 |
化学工业 | 681篇 |
金属工艺 | 71篇 |
机械仪表 | 49篇 |
建筑科学 | 83篇 |
矿业工程 | 5篇 |
能源动力 | 73篇 |
轻工业 | 207篇 |
水利工程 | 13篇 |
石油天然气 | 3篇 |
无线电 | 220篇 |
一般工业技术 | 502篇 |
冶金工业 | 150篇 |
原子能技术 | 43篇 |
自动化技术 | 373篇 |
出版年
2023年 | 10篇 |
2022年 | 24篇 |
2021年 | 53篇 |
2020年 | 29篇 |
2019年 | 30篇 |
2018年 | 50篇 |
2017年 | 58篇 |
2016年 | 55篇 |
2015年 | 37篇 |
2014年 | 78篇 |
2013年 | 148篇 |
2012年 | 137篇 |
2011年 | 170篇 |
2010年 | 120篇 |
2009年 | 128篇 |
2008年 | 149篇 |
2007年 | 118篇 |
2006年 | 117篇 |
2005年 | 83篇 |
2004年 | 73篇 |
2003年 | 67篇 |
2002年 | 81篇 |
2001年 | 43篇 |
2000年 | 41篇 |
1999年 | 35篇 |
1998年 | 51篇 |
1997年 | 48篇 |
1996年 | 38篇 |
1995年 | 34篇 |
1994年 | 27篇 |
1993年 | 31篇 |
1992年 | 17篇 |
1991年 | 19篇 |
1990年 | 21篇 |
1989年 | 18篇 |
1988年 | 17篇 |
1987年 | 13篇 |
1986年 | 16篇 |
1985年 | 14篇 |
1984年 | 21篇 |
1983年 | 17篇 |
1982年 | 17篇 |
1981年 | 22篇 |
1980年 | 13篇 |
1979年 | 17篇 |
1978年 | 15篇 |
1976年 | 16篇 |
1975年 | 11篇 |
1974年 | 12篇 |
1973年 | 9篇 |
排序方式: 共有2499条查询结果,搜索用时 15 毫秒
61.
Dynamic system of relative degree two controlled by discontinuous‐hybrid‐impulsive feedback in the presence of bounded perturbations is considered. The state feedback impulsive‐twisting control exhibits a uniform exact finite time convergence to the second‐order sliding mode with zero convergence time. The output feedback discontinuous control augmented by a simplified hybrid‐impulsive functions provides uniform exact convergence with zero convergence time of the system's states to a real second‐order sliding mode in the presence of bounded perturbations. Only ‘snap’ knowledge of the output derivative, that is, the knowledge of the output derivative in isolated time instants, is required. The output feedback hybrid‐impulsive control with practically implemented impulsive actions asymptotically drives the system's states to the origin. The Lyapunov analysis of the considered hybrid‐impulsive‐discontinuous system proves the system's stability. The efficacy of the proposed control technique is illustrated via computer simulations. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
62.
Raphael M. Jungers Francisca Zamorano Vincent D. Blondel Alain Vande Wouwer Georges BastinAuthor vitae 《Automatica》2011,47(6):1255-1259
The concept of elementary flux vector is valuable in a number of applications of metabolic engineering. For instance, in metabolic flux analysis, each admissible flux vector can be expressed as a non-negative linear combination of a small number of elementary flux vectors. However a critical issue concerns the total number of elementary flux vectors which may be huge because it combinatorially increases with the size of the metabolic network. In this paper we present a fast algorithm that randomly computes a decomposition of admissible flux vectors in a minimal number of elementary flux vectors without explicitly enumerating all of them. 相似文献
63.
Stephen Wornom Hilde Ouvrard Maria Vittoria Salvetti Bruno Koobus Alain Dervieux 《Computers & Fluids》2011,47(1):44-50
Variational multiscale large-eddy simulations (VMS–LES) of the flow around a circular cylinder are carried out at different Reynolds numbers in the subcritical regime, viz. Re = 3900, 10,000 and 20,000, based on the cylinder diameter. A mixed finite-element/finite-volume discretization on unstructured grids is used. The separation between the largest and the smallest resolved scales is obtained through a variational projection operator and finite-volume cell agglomeration. The WALE subgrid scale model is used to account for the effects of the unresolved scales; in the VMS approach, it is only added to the smallest resolved ones. The capability of this methodology to accurately predict the aerodynamic forces acting on the cylinder and in capturing the flow features are evaluated for the different Reynolds numbers considered. The sensitivity of the results to different simulation parameters, viz. agglomeration level and numerical viscosity, is also investigated at Re = 20,000. 相似文献
64.
Karim JaballiAuthor Vitae Alain BellaciccoAuthor VitaeJamel LouatiAuthor Vitae Alain RiviereAuthor VitaeMohamed HaddarAuthor Vitae 《Computers in Industry》2011,62(5):541-554
During the production of new part in an industrial environment, it results in a high percentage of scrap if manufacturing planning is not carried out properly. One of the major factors responsible for this phenomenon is tolerance synthesis. In this paper, we deal with tolerance synthesis, and especially tolerance type identified after transfer. An algorithmic Rational method for 3D Manufacturing Tolerancing Synthesis (R3DMTSyn), which is based on the use of the Technologically and Topologically Related Surface (TTRS) rules, is developed. The TTRS concept helps to generate only the necessary manufacturing specification needed to guarantee the respect of the functional specification studied.The manufacturing project is modeled by a graphical representation called the SPIDER GRAPH. With the SPIDER GRAPH, all active surfaces can be detected (machined and positioning surfaces), so it is possible to identify the location of the functional surfaces used in each functional specification. The construction or the determination of the tolerancing torsor, belonging to each active surface, contributes to the selection of the adequate case of associations. A semantic study is already done to identify all possible combinations or associations needed to locate surfaces during each phases.Finally, referring to the developed TTRS_Cars_Process and in every phase, one or more manufacturing specifications are generated until finishing the treatment of all surfaces (surface belonging to the functional condition, or intermediate surfaces). 相似文献
65.
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in the message forwarding problem in a message-switched network in which the system resources must be managed in order to deliver messages to any processor of the network. To this end, we use the information provided by a routing algorithm. In the context of an arbitrary initialization (due to stabilization), this information may be corrupted. In Cournier et al. (2009) [1], we show that there exist snap-stabilizing algorithms for this problem (in the state model). This implies that we can request the system to begin forwarding messages without losses even if routing information is initially corrupted.In this paper, we propose another snap-stabilizing algorithm for this problem which improves the space complexity of the one in Cournier et al. (2009) [1]. 相似文献
66.
We show that for some special functions (called k-multigrid equidistributed functions), we can compute the limit of the frequency of patterns in the discretization of their graph, when the resolution tends to zero. This result is applied to parabolas. We deduce also that local length estimators almost never converge to the length for the parabolas. 相似文献
67.
The idea of decomposed software pipelining is to decouple the software pipelining problem into a cyclic scheduling problem without resource constraints and an acyclic scheduling problem with resource constraints. In terms of loop transformation and code motion, the technique can be formulated as a combination of loop shifting and loop compaction. Loop shifting amounts to moving statements between iterations thereby changing some loop independent dependences into loop carried dependences and vice versa. Then, loop compaction schedules the body of the loop considering only loop independent dependences, but taking into account the details of the target architecture. In this paper, we show how loop shifting can be optimized so as to minimize both the length of the critical path and the number of dependences for loop compaction. The first problem is well-known and can be solved by an algorithm due to Leiserson and Saxe. We show that the second optimization (and the combination with the first one) is also polynomially solvable with a fast graph algorithm, variant of minimum-cost flow algorithms. Finally, we analyze the improvements obtained on loop compaction by experiments on random graphs. 相似文献
68.
Sébastien Bardin Alain Finkel Jérôme Leroux Laure Petrucci 《International Journal on Software Tools for Technology Transfer (STTT)》2008,10(5):401-424
Fast acceleration of symbolic transition systems (Fast) is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing
the reachability set of the system under study. Even if this reachability set is not necessarily recursive, we use innovative
techniques, namely symbolic representation, acceleration and circuit selection, to increase convergence. Fast has proved to perform very well on case studies. This paper describes the tool, from the underlying theory to the architecture
choices. Finally, Fast capabilities are compared with those of other tools. A range of case studies from the literature is investigated.
This paper is mainly based on results presented at CAV 2003, TACAS 2004 and ATVA 2005. 相似文献
69.
Brice T. Hughes Jordan M. Berg Darryl L. James Akif Ibraguimov Shaorong Liu Henryk Temkin 《Microfluidics and nanofluidics》2008,5(6):761-774
This paper presents a numerical steady-state model of ion transport in micro- and nanofluidic devices with widely varying
geometric scale, such as transitions between micro- and nanochannels. Finite element or finite volume simulation of such problems
is challenging, due to the number of elements needed to produce a satisfactory mesh. Here, only the lengthwise channel dimension
is meshed; standard analytical approximations are used to incorporate cross-channel properties. Singularly perturbed cases
are built up by continuation. The method is shown to reproduce our previously reported measurements of electric double-layer
effects on conductivity, ion concentration, and ion enhancement and depletion. Comparison with 2-D simulations reported in
the literature shows that effects on accuracy due to the 1-D approximation are small. The model incorporates analytical models
of surface charge density taken from the literature. This enables predictive simulation with reasonable accuracy using published
parameter values, or these values may be tuned based on experiment to give improved results. Use of the model for iterative
design and parameter estimation is demonstrated. 相似文献
70.
The contribution of this paper is threefold. First, we present the paradigm of snap-stabilization. A snap- stabilizing protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves
according to its specification. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes
in 0 rounds). Second, we propose a new Propagation of Information with Feedback (PIF) cycle, called Propagation of Information with Feedback and Cleaning (). We show three different implementations of this new PIF. The first one is a basic cycle which is inherently snap-stabilizing. However, the first PIF cycle can be delayed O(h
2) rounds (where h is the height of the tree) due to some undesirable local states. The second algorithm improves the worst delay of the basic
algorithm from O(h
2) to 1 round. The state requirement for the above two algorithms is 3 states per processor, except for the root and leaf processors
that use only 2 states. Also, they work on oriented trees. We then propose a third snap-stabilizing PIF algorithm on un-oriented
tree networks. The state requirement of the third algorithm depends on the degree of the processors, and the delay is at most
h rounds. Next, we analyze the maximum waiting time before a PIF cycle can be initiated whether the PIF cycle is infinitely
and sequentially repeated or launch as an isolated PIF cycle. The analysis is made for both oriented and un-oriented trees.
We show or conjecture that the two best of the above algorithms produce optimal waiting time. Finally, we compute the minimal
number of states the processors require to implement a single PIF cycle, and show that both algorithms for oriented trees
are also (in addition to being time optimal) optimal in terms of the number of states.
WARNING: The concept of snap-stabilization was first introduced in [12]. The concept evolved over the last eight years. We
take this evolution in consideration in this paper, which includes the early results published in [10] and [12]. In particular,
infinite repetition of computation cycles is a requirement of self-stabilizing systems. This is not required in snap-stabilization because snap-stabilization ensures that the first completed computation cycle is executed according to the
specification of the problem. The correctness proofs conform to this basic property. 相似文献