全文获取类型
收费全文 | 10457篇 |
免费 | 425篇 |
国内免费 | 10篇 |
专业分类
电工技术 | 113篇 |
综合类 | 5篇 |
化学工业 | 2056篇 |
金属工艺 | 120篇 |
机械仪表 | 266篇 |
建筑科学 | 303篇 |
矿业工程 | 17篇 |
能源动力 | 347篇 |
轻工业 | 1420篇 |
水利工程 | 114篇 |
石油天然气 | 41篇 |
武器工业 | 2篇 |
无线电 | 410篇 |
一般工业技术 | 1127篇 |
冶金工业 | 3223篇 |
原子能技术 | 60篇 |
自动化技术 | 1268篇 |
出版年
2024年 | 26篇 |
2023年 | 78篇 |
2022年 | 277篇 |
2021年 | 361篇 |
2020年 | 224篇 |
2019年 | 248篇 |
2018年 | 302篇 |
2017年 | 322篇 |
2016年 | 356篇 |
2015年 | 238篇 |
2014年 | 313篇 |
2013年 | 624篇 |
2012年 | 516篇 |
2011年 | 626篇 |
2010年 | 415篇 |
2009年 | 447篇 |
2008年 | 391篇 |
2007年 | 325篇 |
2006年 | 279篇 |
2005年 | 190篇 |
2004年 | 168篇 |
2003年 | 164篇 |
2002年 | 141篇 |
2001年 | 98篇 |
2000年 | 100篇 |
1999年 | 172篇 |
1998年 | 1087篇 |
1997年 | 609篇 |
1996年 | 418篇 |
1995年 | 244篇 |
1994年 | 176篇 |
1993年 | 226篇 |
1992年 | 53篇 |
1991年 | 42篇 |
1990年 | 51篇 |
1989年 | 42篇 |
1988年 | 47篇 |
1987年 | 41篇 |
1986年 | 37篇 |
1985年 | 42篇 |
1984年 | 21篇 |
1983年 | 23篇 |
1982年 | 24篇 |
1981年 | 25篇 |
1980年 | 40篇 |
1979年 | 8篇 |
1978年 | 11篇 |
1977年 | 66篇 |
1976年 | 131篇 |
1975年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
131.
L. Beirão da Veiga A. Buffa D. Cho G. Sangalli 《Computer Methods in Applied Mechanics and Engineering》2011,200(21-22):1787-1803
We develop optimal approximation estimates for T-splines in the case of geometries obtained by gluing two standard tensor product patches. We derive results both for the T-spline space in the parametric domain and the mapped T-NURBS in the physical one. A set of numerical tests in complete accordance with the theoretical developments is also presented. 相似文献
132.
In the last few decades the continuous monitoring of complex dynamic systems has become an increasingly important issue across diverse engineering areas. This paper presents a pattern recognition based system that uses visual-based efficient invariants features for continuous monitoring of induction motors. The procedures presented here are based on the image identification of the 3-D current state space patterns that allow the identification of distinct fault types and, furthermore, their corresponding severity. This automatic fault detection system deals with time-variant electric currents and is based on the identification of three-phase stator currents specified patterns. Several simulation and experimental results are also presented in order to verify the effectiveness of the proposed methodology. 相似文献
133.
We consider a variant of the graph searching games that models the routing reconfiguration problem in WDM networks. In the digraph processing game, a team of agents aims at processing, or clearing, the vertices of a digraph D. We are interested in two different measures: (1) the total number of agents used, and (2) the total number of vertices occupied by an agent during the processing of D. These measures, respectively, correspond to the maximum number of simultaneous connections interrupted and to the total number of interruptions during a routing reconfiguration in a WDM network.Previous works have studied the problem of independently minimizing each of these parameters. In particular, the corresponding minimization problems are APX-hard, and the first one is known not to be in APX. In this paper, we give several complexity results and study tradeoffs between these conflicting objectives. In particular, we show that minimizing one of these parameters while the other is constrained is NP-complete. Then, we prove that there exist some digraphs for which minimizing one of these objectives arbitrarily impairs the quality of the solution for the other one. We show that such bad tradeoffs may happen even for a basic class of digraphs. On the other hand, we exhibit classes of graphs for which good tradeoffs can be achieved. We finally detail the relationship between this game and the routing reconfiguration problem. In particular, we prove that any instance of the processing game, i.e. any digraph, corresponds to an instance of the routing reconfiguration problem. 相似文献
134.
J.E. Labra Gayo M.C. Luengo Díez J.M. Cueva Lovelle A. Cernuda del Río 《Electronic Notes in Theoretical Computer Science》2001,44(2)
This paper describes LPS, a Language Prototyping System that facilitates the modular development of interpreters from semantic building blocks. The system is based on the integration of ideas from Modular Monadic Semantics and Generic Programming.To define a new programming language, the abstract syntax is described as the fixpoint of non-recursive pattern functors. For each functor an algebra is defined whose carrier is the computational monad obtained from the application of several monad transformers to a base monad. The interpreter is automatically generated by a catamorphism or, in some special cases, a monadic catamorphism.The system has been implemented as a domain-specific language embedded in Haskell and we have also implemented an interactive framework for language testing. 相似文献
135.
Towards a Reference Model for Surveying Mobile Agent Systems 总被引:2,自引:1,他引:1
136.
Agostinho de Medeiros Brito Junior Adri?o Duarte Dória Neto Jorge Dantas de Melo Luiz Marcos Garcia Goncalves 《Neural Networks, IEEE Transactions on》2008,19(6):1130-1140
In this paper, we propose a multiresolution approach for surface reconstruction from clouds of unorganized points representing an object surface in 3-D space. The proposed method uses a set of mesh operators and simple rules for selective mesh refinement, with a strategy based on Kohonen's self-organizing map (SOM). Basically, a self-adaptive scheme is used for iteratively moving vertices of an initial simple mesh in the direction of the set of points, ideally the object boundary. Successive refinement and motion of vertices are applied leading to a more detailed surface, in a multiresolution, iterative scheme. Reconstruction was experimented on with several point sets, including different shapes and sizes. Results show generated meshes very close to object final shapes. We include measures of performance and discuss robustness. 相似文献
137.
The time aggregation properties of the Hodrick-Prescott (HP) filter, which decomposes a time series into trend and cycle, are analyzed for the case of annual, quarterly, and monthly data. Aggregation of the disaggregate components cannot be obtained as the exact result from direct application of an HP filter to the aggregate series. Employing several criteria, HP decompositions for different levels of aggregation that provide similar results can be found. The aggregation is guided by the principle that the period associated with the frequency for which the filter gain is should not be altered. This criterion is intuitive and easy to apply. It is shown that it is approximated, to the first order, by an already proposed empirical rule and that alternative, more complex criteria yield similar results. Moreover, the values of the smoothing parameter of the HP filter that provide results which are approximately consistent under aggregation are considerably robust with respect to the ARIMA model of the series. Aggregation is found to perform better for the case of temporal aggregation than for systematic sampling. The desirability of exact aggregation consistency is investigated. A clarification concerning the supposed spuriousness of the cycles obtained by the HP filter is discussed. 相似文献
138.
Coordination components for collaborative virtual environments 总被引:1,自引:0,他引:1
Alberto B. Raposo Adailton J. A. da Cruz Christian M. Adriano Lo P. Magalhes 《Computers & Graphics》2001,25(6):1025-1039
This paper deals with the behavior of virtual environments from the collaboration point-of-view, in which actors (human or virtual beings) interact and collaborate by means of interdependent tasks. In this sense, actors may realize tasks that are dependent on tasks performed by other actors, while the interdependencies between tasks (through resource management and temporal relations) delineate the overall behavior of a virtual environment. Our main goal is to propose an approach for the coordination of those behaviors. Initially a generic study of possible interdependencies between collaborative tasks is presented, followed by the formal modeling (using Petri Nets) of coordination mechanisms for those dependencies. In order to implement such mechanisms, an architecture of reusable and pluggable coordination components is also introduced. These components are used in an implementation of a multi-user videogame. The presented approach is a concrete step to create virtual societies of actors that collaborate to reach common goals without the risk of getting involved in conflicting or repetitive tasks. 相似文献
139.
MA Bloomberg HS Jordan KO Angel MH Bailit KJ Goonan J Straus 《Canadian Metallurgical Quarterly》1993,19(12):586-595
This article describes a collaborative effort between a major health care purchaser, three area health maintenance organizations, and a state Medicaid agency to develop clinical indicators as the basis for a comparison database. Some of the difficulties in developing a "common yardstick" of quality and value are candidly discussed. 相似文献
140.
O. Bozorg Haddad M. Mohammad Rezapour Tabari E. Fallah-Mehdipour M. A. Mariño 《Water Resources Management》2013,27(7):2515-2529
Groundwater models are computer models that simulate or predict aquifer conditions by using input data sets and hydraulic parameters. Commonly, hydraulic parameters are extracted by calibration, using observed and simulated aquifer conditions. The accuracy of calibration affects other modeling processes, especially the hydraulic head simulation. Meta-heuristic algorithms are good candidates to determine optimal/near-optimal parameters in groundwater models. In this paper, two meta-heuristic algorithms: (1) particle swarm optimization (PSO) and (2) pattern search (PS) are applied and compared in the Ghaen aquifer, by considering the sum of the squared deviation (SSD) between observed and simulated hydraulic heads and the sum of the absolute value of deviation (SAD) between observed and simulated hydraulic heads as the objective functions. Results show that obtained values of the objective function are enhanced significantly by using the PS algorithm. Accordingly, PS improves (decreases) the SSD and SAD by 0.20 and 2.36 percent, respectively, compared to results reported by using the PSO algorithm. Results also indicate that the proposed PS optimization tool is effective in the calibration of aquifer parameters. 相似文献