全文获取类型
收费全文 | 7009篇 |
免费 | 84篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 70篇 |
综合类 | 5篇 |
化学工业 | 1356篇 |
金属工艺 | 140篇 |
机械仪表 | 144篇 |
建筑科学 | 398篇 |
矿业工程 | 13篇 |
能源动力 | 229篇 |
轻工业 | 695篇 |
水利工程 | 132篇 |
石油天然气 | 33篇 |
无线电 | 465篇 |
一般工业技术 | 1207篇 |
冶金工业 | 1125篇 |
原子能技术 | 51篇 |
自动化技术 | 1035篇 |
出版年
2024年 | 37篇 |
2023年 | 44篇 |
2022年 | 79篇 |
2021年 | 110篇 |
2020年 | 108篇 |
2019年 | 118篇 |
2018年 | 116篇 |
2017年 | 127篇 |
2016年 | 130篇 |
2015年 | 146篇 |
2014年 | 191篇 |
2013年 | 430篇 |
2012年 | 348篇 |
2011年 | 426篇 |
2010年 | 292篇 |
2009年 | 342篇 |
2008年 | 451篇 |
2007年 | 370篇 |
2006年 | 306篇 |
2005年 | 320篇 |
2004年 | 261篇 |
2003年 | 234篇 |
2002年 | 217篇 |
2001年 | 121篇 |
2000年 | 93篇 |
1999年 | 113篇 |
1998年 | 137篇 |
1997年 | 108篇 |
1996年 | 126篇 |
1995年 | 89篇 |
1994年 | 94篇 |
1993年 | 85篇 |
1992年 | 67篇 |
1991年 | 49篇 |
1990年 | 59篇 |
1989年 | 77篇 |
1988年 | 42篇 |
1987年 | 53篇 |
1986年 | 46篇 |
1985年 | 62篇 |
1984年 | 64篇 |
1983年 | 57篇 |
1982年 | 46篇 |
1981年 | 50篇 |
1980年 | 31篇 |
1979年 | 39篇 |
1978年 | 33篇 |
1977年 | 26篇 |
1976年 | 23篇 |
1975年 | 28篇 |
排序方式: 共有7098条查询结果,搜索用时 0 毫秒
991.
Jorge Gonzlez‐Domínguez María J. Martín Guillermo L. Taboada Juan Tourio Ramn Doallo Damin A. Malln Brian Wibecan 《Concurrency and Computation》2012,24(14):1645-1667
The popularity of Partitioned Global Address Space (PGAS) languages has increased during the last years thanks to their high programmability and performance through an efficient exploitation of data locality, especially on hierarchical architectures such as multicore clusters. This paper describes UPCBLAS, a parallel numerical library for dense matrix computations using the PGAS Unified Parallel C language. The routines developed in UPCBLAS are built on top of sequential basic linear algebra subprograms functions and exploit the particularities of the PGAS paradigm, taking into account data locality in order to achieve a good performance. Furthermore, the routines implement other optimization techniques, several of them by automatically taking into account the hardware characteristics of the underlying systems on which they are executed. The library has been experimentally evaluated on a multicore supercomputer and compared with a message‐passing‐based parallel numerical library, demonstrating good scalability and efficiency. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
992.
The evaluation of government programmes designed to prepare for future contingencies is an ongoing challenge for analysts and public managers. Despite significant focus in emergency management, the existing approaches have difficulty linking preparedness inputs to their effect on performance at future response operations. Adapting techniques from the analysis of technical systems, an approach for assessing response reliability – the likelihood that a response system will be able to deliver response capabilities at or above a specific level at a future incident – is described. The approach bases evaluation on the systematic assessment of the likelihood and consequences of events that would disrupt operations and reduce response performance. By doing so, it provides a clearer method for assessing the cost effectiveness of different preparedness policies and evaluating the performance of past investments in preparedness programmes. 相似文献
993.
Smoke animations are hard to art‐direct because simple changes in parameters such as simulation resolution often lead to unpredictable changes in the final result. Previous work has addressed this problem with a guiding approach which couples low‐resolution simulations – that exhibit the desired flow and behaviour – to the final, high‐resolution simulation. This is done in such a way that the desired low frequency features are to some extent preserved in the high‐resolution simulation. However, the steady (i.e. constant) guiding used often leads to a lack of sufficiently high detail, and employing time‐dependent guiding is expensive because the matrix of the resulting set of equations needs to be recomputed at every iteration. We propose an improved mathematical model for Eulerian‐based simulations which is better suited for dynamic, time‐dependent guiding of smoke animations through a novel variational coupling of the low‐ and high‐resolution simulations. Our model results in a matrix that does not require re‐computation when the guiding changes over time, and hence we can employ time‐dependent guiding more efficiently both in terms of storage and computational requirements. We demonstrate that time‐dependent guiding allows for more high frequency detail to develop without losing correspondence to the low resolution simulation. Furthermore, we explore various artistic effects made possible by time‐dependent guiding. 相似文献
994.
Wantao Liu Brian Tieman Rajkumar Kettimuthu Ian Foster 《Concurrency and Computation》2011,23(18):2404-2420
Modern scientific experiments can generate hundreds of gigabytes to terabytes or even petabytes of data that may be maintained in large numbers of relatively small files. Frequently, these data must be disseminated to remote collaborators or computational centers for data analysis. Moving this dataset with high performance and strong robustness and providing a simple interface for users are challenging tasks. We present a data transfer framework comprising a high‐performance data transfer library based on GridFTP, an extensible data scheduler with four data scheduling policies, and a GUI that allows users to transfer their dataset easily, reliably, and securely. This system incorporates automatic tuning mechanisms to select at runtime the number of concurrent threads to be used for transfers. Also included are restart mechanisms for handling client, network, and server failures. Experimental results indicate that our data transfer system can significantly improve data transfer performance and can recover well from failures. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
995.
Jack S. Elston Jason Roadman Maciej Stachura Brian Argrow Adam Houston Eric Frew 《野外机器人技术杂志》2011,28(4):461-483
996.
Adrian N. Bishop Mohammad Deghat Brian D. O. Anderson Yiguang Hong 《国际强度与非线性控制杂志
》2015,25(17):3210-3230
》2015,25(17):3210-3230
Heterogeneous formation shape control with interagent bearing and distance constraints involves the design of a distributed control law that ensures the formation moves such that these interagent constraints are achieved and maintained. This paper looks at the design of a distributed control scheme to solve different formation shape control problems in an ambient two‐dimensional space with bearing, distance and mixed bearing and distance constraints. The proposed control law allows the agents in the formation to move in any direction on a half‐plane and guarantees that despite this freedom, the proposed shape control algorithm ensures convergence to a formation shape meeting the prescribed constraints. This work provides an interesting and novel contrast to much of the existing work in formation control where distance‐only constraints are typically maintained and where each agent's motion is typically restricted to follow a very particular path. A stability analysis is sketched, and a number of illustrative examples are also given. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
997.
In this paper, we address the problem of agent loss in vehicle formations and sensor networks via two separate approaches: (1) perform a ‘self‐repair’ operation in the event of agent loss to recover desirable information architecture properties or (2) introduce robustness into the information architecture a priori such that agent loss does not destroy desirable properties. We model the information architecture as a graph G(V, E), where V is a set of vertices representing the agents and E is a set of edges representing information flow amongst the agents. We focus on two properties of the graph called rigidity and global rigidity, which are required for formation shape maintenance and sensor network self‐localization, respectively. For the self‐repair approach, we show that while previous results permit local repair involving only neighbours of the lost agent, the repair cannot always be implemented using only local information. We present new results that can be applied to make the local repair using only local information. We describe implementation and illustrate with algorithms and examples. For the robustness approach, we investigate the structure of graphs with the property that rigidity or global rigidity is preserved after removing any single vertex (we call the property as 2‐vertex‐rigidity or 2‐vertex‐global‐rigidity, respectively). Information architectures with such properties would allow formation shape maintenance or self‐localization to be performed even in the event of agent failure. We review a characterization of a class of 2‐vertex‐rigidity and develop a separate class, making significant strides towards a complete characterization. We also present a characterization of a class of 2‐vertex‐global‐rigidity. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
998.
A stability robustness test is developed for internally stable, nominal, linear time‐invariant (LTI) feedback systems subject to structured, linear time‐varying uncertainty. There exists (in the literature) a necessary and sufficient structured small gain condition that determines robust stability in such cases. In this paper, the structured small gain theorem is utilized to formulate a (sufficient) stability robustness condition in a scaled LTI ν‐gap metric framework. The scaled LTI ν‐gap metric stability condition is shown to be computable via linear matrix inequality techniques, similar to the structured small gain condition. Apart from a comparison with a generalized robust stability margin as the final part of the stability test, however, the solution algorithm implemented to test the scaled LTI ν‐gap metric stability robustness condition is shown to be independent of knowledge about the controller transfer function (as opposed to the LMI feasibility problem associated with the scaled small gain condition which is dependent on knowledge about the controller). Thus, given a nominal plant and a structured uncertainty set, the stability robustness condition presented in this paper provides a single constraint on a controller (in terms of a large enough generalized robust stability margin) that (sufficiently) guarantees to stabilize all plants in the uncertainty set. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
999.
Symon K. Podilchak Brian M. Frank Al P. Freundorfer Yahia M. M. Antar 《国际射频与微波计算机辅助工程杂志》2009,19(2):163-169
Two CMOS integrated circuits are presented that utilize metamaterial composite right/left handed (CRLH) transmission lines (TLs) for zero insertion phase at 30 GHz. Specifically, 2 and 3 unit cell structures are presented with controlled insertion phase that is achieved by cascading lumped element capacitors and spiral inductors in an LC network configuration defining the TL unit cells. Furthermore, the fixed TL structures suggest the possibility of zero, advanced or delayed insertion phases by element variation, or by the use of simple active components. Simulation and measured results are in good agreement with CRLH TL theory, and display a linear insertion phase and flat group delay values that are dependent on the number of unit cells with an insertion loss of ~0.8 dB per cell. These findings suggest that such high speed CRLH TLs structures can be implemented for linear array feeding networks and compact antenna designs in CMOS at millimeter wave frequencies. © 2008 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009. 相似文献
1000.
Brian Kelly 《New Review of Information Networking》2013,18(2):219-227
RSS (Really Simple Syndication/RDF Site Summary) is a simple lightweight format that was originally used for news alerts and content syndication. It is now being used in a wide range of applications. This paper describes the background to RSS and describes the various ways in which RSS can be used. Examples are provided of the ways in which RSS can be viewed and the variety of approaches for creating RSS. The paper argues that, although there is still confusion over the different types of RSS standards, the format is an essential for use in digital library services. 相似文献