全文获取类型
收费全文 | 1733篇 |
免费 | 89篇 |
国内免费 | 13篇 |
专业分类
电工技术 | 12篇 |
综合类 | 3篇 |
化学工业 | 637篇 |
金属工艺 | 45篇 |
机械仪表 | 46篇 |
建筑科学 | 44篇 |
矿业工程 | 6篇 |
能源动力 | 64篇 |
轻工业 | 41篇 |
水利工程 | 4篇 |
石油天然气 | 27篇 |
武器工业 | 1篇 |
无线电 | 118篇 |
一般工业技术 | 495篇 |
冶金工业 | 57篇 |
原子能技术 | 27篇 |
自动化技术 | 208篇 |
出版年
2023年 | 23篇 |
2022年 | 132篇 |
2021年 | 131篇 |
2020年 | 59篇 |
2019年 | 54篇 |
2018年 | 64篇 |
2017年 | 58篇 |
2016年 | 54篇 |
2015年 | 50篇 |
2014年 | 75篇 |
2013年 | 145篇 |
2012年 | 140篇 |
2011年 | 130篇 |
2010年 | 90篇 |
2009年 | 77篇 |
2008年 | 83篇 |
2007年 | 81篇 |
2006年 | 51篇 |
2005年 | 51篇 |
2004年 | 45篇 |
2003年 | 32篇 |
2002年 | 43篇 |
2001年 | 21篇 |
2000年 | 26篇 |
1999年 | 16篇 |
1998年 | 16篇 |
1997年 | 11篇 |
1996年 | 12篇 |
1995年 | 14篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1986年 | 2篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1975年 | 1篇 |
1974年 | 4篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1968年 | 1篇 |
1967年 | 1篇 |
1963年 | 1篇 |
排序方式: 共有1835条查询结果,搜索用时 15 毫秒
11.
12.
Vladimir Aniskin Sergey Mironov Anatoliy Maslov 《Microfluidics and nanofluidics》2013,14(3-4):605-614
Results of research on microjets escaping into an ambient space from nozzles with diameters of 341–10.4 μm are described. A special Pitot microtube is used for studying the structure of supersonic microjets. The main feature of this microtube is a small diameter of the intake hole (12 μm). The main parameters of supersonic underexpanded microjets are identified, including the size of shock cells and the supersonic core length of the microjet. The results show a significant increase in the supersonic core length of microjets compared to macrojets. The Reynolds numbers of the laminar–turbulent transition in microjets are found to be in the range of 1,100–2,100. In addition, a classification of supersonic underexpanded axisymmetric microjets escaping into the ambient space is proposed. 相似文献
13.
Baysan Mehmet Sarac Kamil Chandrasekaran Ramaswamy Bereg Sergey 《Parallel and Distributed Systems, IEEE Transactions on》2009,20(7):913-924
Network-wide broadcast (simply broadcast) is a frequently used operation in wireless ad hoc networks (WANETs). One promising practical approach for energy-efficient broadcast is to use localized algorithms to minimize the number of nodes involved in the propagation of the broadcast messages. In this context, the minimum forwarding set problem (MFSP) (also known as multipoint relay (MPR) problem) has received a considerable attention in the research community. Even though the general form of the problem is shown to be NP-complete, the complexity of the problem has not been known under the practical application context of ad hoc networks. In this paper, we present a polynomial time algorithm to solve the MFSP for wireless network under unit disk coverage model. We prove the existence of some geometrical properties for the problem and then propose a polynomial time algorithm to build an optimal solution based on these properties. To the best of our knowledge, our algorithm is the first polynomial time solution to the MFSP under the unit disk coverage model. We believe that the work presented in this paper will have an impact on the design and development of new algorithms for several wireless network applications including energy-efficient multicast, broadcast, and topology control protocols for WANETs and sensor networks. 相似文献
14.
Zhukov N. D. Mosiyash D. S. Sinev I. V. Khazanov A. A. Smirnov A. V. Lapshin I. V. 《Technical Physics Letters》2017,43(12):1124-1127
Technical Physics Letters - Current–voltage (I–V) characteristics of conductance in multigrain layers of submicron particles of silicon, gallium arsenide, indium arsenide, and indium... 相似文献
15.
One of the more well-studied problems in data mining is the search for association rules in market basket data. Association rules are intended to identify patterns of the type: A customer purchasing item A often also purchases item B. Motivated partly by the goal of generalizing beyond market basket data and partly by the goal of ironing out some problems in the definition of association rules, we develop the notion of dependence rules that identify statistical dependence in both the presence and absence of items in itemsets. We propose measuring significance of dependence via the chi-squared test for independence from classical statistics. This leads to a measure that is upward-closed in the itemset lattice, enabling us to reduce the mining problem to the search for a border between dependent and independent itemsets in the lattice. We develop pruning strategies based on the closure property and thereby devise an efficient algorithm for discovering dependence rules. We demonstrate our algorithm's effectiveness by testing it on census data, text data (wherein we seek term dependence), and synthetic data. 相似文献
16.
In this paper we use an approach based on sliding mode control to design a feedback which stabilizes the origin for the so-called nonholonomic integrator or Heisenberg system, a particular case of a canonical class of nonlinear driftless control systems of the form which fail Brockett's necessary condition for the existence of a smooth stabilizing feedback. 相似文献
17.
We consider interconnections of locally input-to-state stable (LISS) systems. The class of LISS systems is quite large, in particular it contains input-to-state stable (ISS) and integral input-to-state stable (iISS) systems.Local small-gain conditions both for LISS trajectory and Lyapunov formulations guaranteeing LISS of the composite system are provided in this paper. Notably, estimates for the resulting stability region of the composite system are also given. This in particular provides an advantage over the linearization approach, as will be discussed. 相似文献
18.
For a number of programming languages, among them Eiffel, C, Java, and Ruby, Hoare-style logics and dynamic logics have been developed. In these logics, pre- and postconditions are typically formulated using potentially effectful programs. In order to ensure that these pre- and postconditions behave like logical formulae (that is, enjoy some kind of referential transparency), a notion of purity is needed. Here, we introduce a generic framework for reasoning about purity and effects. Effects are modelled abstractly and axiomatically, using Moggi’s idea of encapsulation of effects as monads. We introduce a dynamic logic (from which, as usual, a Hoare logic can be derived) whose logical formulae are pure programs in a strong sense. We formulate a set of proof rules for this logic, and prove it to be complete with respect to a categorical semantics. Using dynamic logic, we then develop a relaxed notion of purity which allows for observationally neutral effects such writing on newly allocated memory. 相似文献
19.
Favre M Chtcheglova LA Lapshin DA Sekatskii SK Valle F Dietler G 《Ultramicroscopy》2007,107(10-11):882-886
We have recently developed a new method for directly measuring the spring constant of single molecules and molecular complexes on a real-time basis [L.A. Chtcheglova, G.T. Shubeita, S.K. Sekatskii, G. Dietler, Biophys. J. 86 (2004) 1177]. The technique combines standard force spectroscopy with a small dithering of tip. Changes in the amplitude of the oscillations are measured as a function of the pulling-off force to yield the spring constant of the complex. In this report, we present the first results of combination of this approach with the force-clamp spectroscopy. The standard atomic-force microscope has been supplemented with an electronic unit, which is capable of realizing an arbitrary force function, and permits the force-loading regime to be interrupted at any time. Using this method, the time needed to rupture a single bond can be measured as a function of the force that is required to maintain the complex in a stretched condition. The energy landscape of the avidin-biotin complex is explored and discussed. 相似文献
20.
Sergey Smirnov Hajo A. Reijers Mathias Weske Thijs Nugteren 《Distributed and Parallel Databases》2012,30(1):63-99
The discipline of business process management aims at capturing, understanding, and improving work in organizations by using
process models as central artifacts. Since business-oriented tasks require different information from such models to be highlighted,
a range of abstraction techniques has been developed over the past years to manipulate overly detailed models. At this point,
a clear understanding of what distinguishes these techniques and how they address real world use cases has not yet been established.
In this paper we systematically develop, classify, and consolidate the use cases for business process model abstraction and
present a case study to illustrate the value of this technique. The catalog of use cases that we present is based on a thorough
evaluation of the state of the art, as well as on our cooperation with end users in the health insurance sector. It has been
subsequently validated by experts from the consultancy and tool vendor domains. Based on our findings, we evaluate how the
existing business process model abstraction approaches support the discovered use cases and reveal which areas are not adequately
covered, as such providing an agenda for further research in this area. 相似文献