全文获取类型
收费全文 | 56753篇 |
免费 | 2167篇 |
国内免费 | 62篇 |
专业分类
电工技术 | 344篇 |
综合类 | 44篇 |
化学工业 | 10649篇 |
金属工艺 | 932篇 |
机械仪表 | 958篇 |
建筑科学 | 1468篇 |
矿业工程 | 99篇 |
能源动力 | 1292篇 |
轻工业 | 8322篇 |
水利工程 | 442篇 |
石油天然气 | 218篇 |
武器工业 | 8篇 |
无线电 | 1880篇 |
一般工业技术 | 7496篇 |
冶金工业 | 18077篇 |
原子能技术 | 274篇 |
自动化技术 | 6479篇 |
出版年
2024年 | 92篇 |
2023年 | 388篇 |
2022年 | 831篇 |
2021年 | 1300篇 |
2020年 | 926篇 |
2019年 | 1107篇 |
2018年 | 1624篇 |
2017年 | 1623篇 |
2016年 | 1726篇 |
2015年 | 1357篇 |
2014年 | 1730篇 |
2013年 | 3434篇 |
2012年 | 2695篇 |
2011年 | 2902篇 |
2010年 | 2269篇 |
2009年 | 2177篇 |
2008年 | 2003篇 |
2007年 | 1782篇 |
2006年 | 1376篇 |
2005年 | 1215篇 |
2004年 | 1124篇 |
2003年 | 1005篇 |
2002年 | 927篇 |
2001年 | 667篇 |
2000年 | 667篇 |
1999年 | 968篇 |
1998年 | 5667篇 |
1997年 | 3532篇 |
1996年 | 2313篇 |
1995年 | 1350篇 |
1994年 | 1084篇 |
1993年 | 1250篇 |
1992年 | 341篇 |
1991年 | 384篇 |
1990年 | 300篇 |
1989年 | 313篇 |
1988年 | 310篇 |
1987年 | 291篇 |
1986年 | 259篇 |
1985年 | 278篇 |
1984年 | 169篇 |
1983年 | 139篇 |
1982年 | 198篇 |
1981年 | 211篇 |
1980年 | 264篇 |
1979年 | 99篇 |
1978年 | 108篇 |
1977年 | 528篇 |
1976年 | 1164篇 |
1973年 | 84篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
981.
One of the most efficient non-perturbative methods for the calculation of thermal properties of quantum systems is the Hybrid Monte Carlo algorithm, as evidenced by its use in large-scale lattice quantum chromodynamics calculations. The performance of this algorithm is determined by the speed at which the fermion operator is applied to a given vector, as it is the central operation in the preconditioned conjugate gradient iteration. We study a simple implementation of these operations for the fermion matrix of the Hubbard model in d+1 spacetime dimensions, and report a performance comparison between a 2.66 GHz Intel Xeon E5430 CPU and an NVIDIA Tesla C1060 GPU using double-precision arithmetic. We find speedup factors ranging between 30 and 350 for d=1, and in excess of 40 for d=3. We argue that such speedups are of considerable impact for large-scale simulational studies of quantum many-body systems. 相似文献
982.
Yolanda Blanco-Fernández Martín López-Nores Alberto Gil-Solla Manuel Ramos-Cabrer José J. Pazos-Arias 《Information Sciences》2011,181(21):4823-4846
Recommender systems fight information overload by selecting automatically items that match the personal preferences of each user. The so-called content-based recommenders suggest items similar to those the user liked in the past, using syntactic matching mechanisms. The rigid nature of such mechanisms leads to recommending only items that bear strong resemblance to those the user already knows. Traditional collaborative approaches face up to overspecialization by considering the preferences of other users, which causes other severe limitations. In this paper, we avoid the intrinsic pitfalls of collaborative solutions and diversify the recommendations by reasoning about the semantics of the user’s preferences. Specifically, we present a novel content-based recommendation strategy that resorts to semantic reasoning mechanisms adopted in the Semantic Web, such as Spreading Activation techniques and semantic associations. We have adopted these mechanisms to fulfill the personalization requirements of recommender systems, enabling to discover extra knowledge about the user’s preferences and leading to more accurate and diverse suggestions. Our approach is generic enough to be used in a wide variety of domains and recommender systems. The proposal has been preliminary evaluated by statistics-driven tests involving real users in the recommendation of Digital TV contents. The results reveal the users’ satisfaction regarding the accuracy and diversity of the reasoning-driven content-based recommendations. 相似文献
983.
Fracture analysis of plane piezoelectric/piezomagnetic multiphase composites under transient loading
R. Rojas-Díaz F. García-Sánchez A. Sáez E. Rodríguez-Mayorga Ch. Zhang 《Computer Methods in Applied Mechanics and Engineering》2011,200(45-46):2931-2942
The transient response of cracked composite materials made of piezoelectric and piezomagnetic phases, when subjected to in-plane magneto-electro-mechanical dynamic loads, is addressed in this paper by means of a mixed boundary element method (BEM) approach. Both the displacement and traction boundary integral equations (BIEs) are used to develop a single-domain formulation. The convolution integrals arising in the time-domain BEM are numerically computed by Lubich’s quadrature, which determines the integration weights from the Laplace transformed fundamental solution and a linear multistep method. The required Laplace-domain fundamental solution is derived by means of the Radon transform in the form of line integrals over a unit circumference. The singular and hypersingular BIEs are numerically evaluated in a precise and efficient manner by a regularization procedure based on a simple change of variable, as previously proposed by the authors for statics. Discontinuous quarter-point elements are used to properly capture the behavior of the extended crack opening displacements (ECOD) around the crack-tip and directly evaluate the field intensity factors (stress, electric displacement and magnetic induction intensity factors) from the computed nodal data. Numerical results are obtained to validate the formulation and illustrate its capabilities. The effect of the combined application of electric, magnetic and mechanical loads on the dynamic field intensity factors is analyzed in detail for several crack configurations under impact loading. 相似文献
984.
To allow efficient and user‐friendly development of a component‐based application, component systems have to provide a rather complex development infrastructure, including a tool for component composition, component repository, and a run‐time infrastructure. In this paper, we present and evaluate benefits of using meta‐modeling during the process of defining a component system and also during creation of the development and run‐time infrastructures. Most of the presented arguments are based on a broad practical experience with designing the component systems SOFA and SOFA 2; the former designed in a classical ad hoc ‘manual’ way, whereas the latter with the help of meta‐modeling. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
985.
Mu’awya NaserPedro Peris-Lopez Rahmat BudiartoBenjamín Ramos Álvarez 《Computer Communications》2011,34(18):2248-2249
In this letter, we analyze the security of an RFID authentication protocol proposed by Liu and Bailey [1], called privacy and authentication protocol (PAP). We present two traceability attacks and an impersonation attack. 相似文献
986.
Juan M. Marín Pérez Jorge Bernal Bernabé Jose M. Alcaraz Calero Felix J. Garcia Clemente Gregorio Martínez Pérez Antonio F. Gómez Skarmeta 《Future Generation Computer Systems》2011,27(1):40-55
There are a few issues that still need to be covered regarding security in the Grid area. One of them is authorization where there exist good solutions to define, manage and enforce authorization policies in Grid scenarios. However, these solutions usually do not provide Grid administrators with semantic-aware components closer to the particular Grid domain and easing different administration tasks such as conflict detection or resolution. This paper defines a proposal based on Semantic Web to define, manage and enforce security policies in a Grid scenario. These policies are defined by means of semantic-aware rules which help the administrator to create higher-level definitions with more expressiveness. These rules also permit performing added-value tasks such as conflict detection and resolution, which can be of interest in medium and large scale scenarios where different administrators define the authorization rules that should be followed before accessing a resource in the Grid. The proposed solution has been also tested providing some reasonable response times in the authorization decision process. 相似文献
987.
J��r?me Schmid Jos�� A. Iglesias?Guiti��n Enrico Gobbetti Nadia Magnenat-Thalmann 《The Visual computer》2011,27(2):85-95
Despite the ability of current GPU processors to treat heavy parallel computation tasks, its use for solving medical image
segmentation problems is still not fully exploited and remains challenging. A lot of difficulties may arise related to, for
example, the different image modalities, noise and artifacts of source images, or the shape and appearance variability of
the structures to segment. Motivated by practical problems of image segmentation in the medical field, we present in this
paper a GPU framework based on explicit discrete deformable models, implemented over the NVidia CUDA architecture, aimed for
the segmentation of volumetric images. The framework supports the segmentation in parallel of different volumetric structures
as well as interaction during the segmentation process and real-time visualization of the intermediate results. Promising
results in terms of accuracy and speed on a real segmentation experiment have demonstrated the usability of the system. 相似文献
988.
Zolt��n Kir��ly 《Algorithmica》2011,60(1):3-20
We first consider the problem of finding a maximum size stable matching if incomplete lists and ties are both allowed, but ties are on one side only. For this problem we give a simple, linear time 3/2-approximation algorithm, improving on the best known approximation factor 5/3 of Irving and Manlove (J. Comb. Optim., doi:10.1007/s10878-007-9133-x, 2007). Next, we show how this extends to the Hospitals/Residents problem with the same ratio if the residents have strict orders. We also give a simple linear time algorithm for the general problem with approximation factor 5/3, improving the best known 15/8-approximation algorithm of Iwama, Miyazaki and Yamauchi (SODA ??07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.?288?C297, 2007). For the cases considered in this paper it is NP-hard to approximate within a factor of 21/19 by the result of Halldórsson et?al. (ACM Transactions on Algorithms 3(3):30, 2007). Our algorithms not only give better approximation ratios than the cited ones, but are much simpler and run significantly faster. Also we may drop a restriction used in (J. Comb. Optim., doi:10.1007/s10878-007-9133-x, 2007) and the analysis is substantially more moderate. Preliminary versions of this paper appeared in (Király, Egres Technical Report TR-2008-04, www.cs.elte.hu/egres/, 2008; Király in Proceedings of MATCH-UP 2008: Matching Under Preferences??Algorithms and Complexity, Satellite Workshop of ICALP, July 6, 2008, Reykjavík, Iceland, pp.?36?C45, 2008; Király in ESA 2008, Lecture Notes in Computer Science, vol.?5193, pp.?623?C634, 2008). For the related results obtained thenceforth see Sect.?5. 相似文献
989.
Khaled Elbassioni Erik Krohn Domagoj Matijević Julián Mestre Domagoj Ševerdija 《Algorithmica》2011,60(2):451-463
We present a 4-approximation algorithm for the problem of placing the fewest guards on a 1.5D terrain so that every point
of the terrain is seen by at least one guard. This improves on the previous best approximation factor of 5 (see King in Proceedings
of the 13th Latin American Symposium on Theoretical Informatics, pp. 629–640, 2006). Unlike most of the previous techniques, our method is based on rounding the linear programming relaxation of the corresponding
covering problem. Besides the simplicity of the analysis, which mainly relies on decomposing the constraint matrix of the
LP into totally balanced matrices, our algorithm, unlike previous work, generalizes to the weighted and partial versions of
the basic problem. 相似文献
990.
Angel Rivas Casado Rafael Martinez‐Tomás Antonio Fernández‐Caballero 《Expert Systems》2011,28(5):488-501
This work presents a multi‐agent system for knowledge‐based high‐level event composition, which interprets activities, behaviour and situations semantically in a scenario with multi‐sensory monitoring. A perception agent (plurisensory agent and visual agent)‐based structure is presented. The agents process the sensor information and identify (agent decision system) significant changes in the monitored signals, which they send as simple events to the composition agent that searches for and identifies pre‐defined patterns as higher‐level semantic composed events. The structure has a methodology and a set of tools that facilitate its development and application to different fields without having to start from scratch. This creates an environment to develop knowledge‐based systems generally for event composition. The application task of our work is surveillance, and event composition/inference examples are shown which characterize an alarming situation in the scene and resolve identification and tracking problems of people in the scenario being monitored. 相似文献