全文获取类型
收费全文 | 10894篇 |
免费 | 631篇 |
国内免费 | 53篇 |
专业分类
电工技术 | 169篇 |
综合类 | 102篇 |
化学工业 | 1820篇 |
金属工艺 | 225篇 |
机械仪表 | 222篇 |
建筑科学 | 472篇 |
矿业工程 | 48篇 |
能源动力 | 137篇 |
轻工业 | 1339篇 |
水利工程 | 72篇 |
石油天然气 | 30篇 |
无线电 | 698篇 |
一般工业技术 | 2509篇 |
冶金工业 | 2259篇 |
原子能技术 | 94篇 |
自动化技术 | 1382篇 |
出版年
2023年 | 116篇 |
2022年 | 60篇 |
2021年 | 179篇 |
2020年 | 143篇 |
2019年 | 146篇 |
2018年 | 318篇 |
2017年 | 318篇 |
2016年 | 356篇 |
2015年 | 272篇 |
2014年 | 347篇 |
2013年 | 647篇 |
2012年 | 433篇 |
2011年 | 526篇 |
2010年 | 435篇 |
2009年 | 452篇 |
2008年 | 504篇 |
2007年 | 461篇 |
2006年 | 328篇 |
2005年 | 284篇 |
2004年 | 258篇 |
2003年 | 278篇 |
2002年 | 248篇 |
2001年 | 260篇 |
2000年 | 180篇 |
1999年 | 204篇 |
1998年 | 797篇 |
1997年 | 472篇 |
1996年 | 347篇 |
1995年 | 183篇 |
1994年 | 200篇 |
1993年 | 182篇 |
1992年 | 63篇 |
1991年 | 80篇 |
1990年 | 65篇 |
1989年 | 67篇 |
1988年 | 57篇 |
1987年 | 52篇 |
1986年 | 67篇 |
1985年 | 115篇 |
1984年 | 73篇 |
1983年 | 58篇 |
1982年 | 58篇 |
1981年 | 48篇 |
1980年 | 68篇 |
1979年 | 36篇 |
1978年 | 41篇 |
1977年 | 62篇 |
1976年 | 115篇 |
1973年 | 29篇 |
1943年 | 26篇 |
排序方式: 共有10000条查询结果,搜索用时 125 毫秒
251.
Wolfgang Däubler 《Datenschutz und Datensicherheit - DuD》2010,34(1):20-24
Der betriebliche Datenschutzbeauftragte dient der Selbstkontrolle der verantwortlichen Stelle. Wirksam ist solch eine Selbstkontrolle
aber nur dann, wenn der Datenschutzbeauftragte auch Unabh?gigkeit genie?t. Welche Voraussetzungen hierfür erfüllt sein müssen,
erl?utert der folgende Beitrag. 相似文献
252.
The steady-state simplified P
N
approximation to the radiative transfer equation has been successfully applied to many problems involving radiation. Recently,
time-dependent simplified P
N
equations have been derived by an asymptotic analysis similar to the asymptotic derivation of the steady-state SP
N
equations (Frank et al. in J. Comput. Phys. 226:2289–2305, 2007). In this paper, we present computational results for the time-dependent SP
N
equations in two dimensions, obtained by using an adaptive finite element approach. Several numerical comparisons with other
existing models are shown. 相似文献
253.
254.
Moving threads is a new kind of approach for multicore processor architectures. Traditionally, each thread stays in the core
where it is created, and data is moved from the main memory via caches to each core and thread. In the moving threads approach,
each core can access only a certain portion of the main memory via its local memory block, and thus extremely lightweight
threads are moved between the cores. As a consequence, all kinds of cache coherence problems and need for read reply messages
are eliminated. Also Lamport’s sequential consistency of shared memory multiprocessor systems is achieved for free. In this
paper, we propose a processor architecture (MTPA) for the moving threads paradigm. We describe the overall structure, operation,
instruction set, and thread management mechanism as well as evaluate the proposed architecture with different functional unit
settings with simulations and give early silicon area and power consumption estimates. 相似文献
255.
Images can be acquired at high rates with modern fluorescence microscopy hardware, giving rise to a demand for high-speed analysis of image data. Digital image cytometry, i.e., automated measurements and extraction of quantitative data from images of cells, provides valuable information for many types of biomedical analysis. There exists a number of different image analysis software packages that can be programmed to perform a wide array of useful measurements. However, the multi-application capability often compromises the simplicity of the tool. Also, the gain in speed of analysis is often compromised by time spent learning complicated software. We provide a free software called BlobFinder that is intended for a limited type of application, making it easy to use, easy to learn and optimized for its particular task. BlobFinder can perform batch processing of image data and quantify as well as localize cells and point like source signals in fluorescence microscopy images, e.g., from FISH, in situ PLA and padlock probing, in a fast and easy way. 相似文献
256.
Veikko Kernen 《Theoretical computer science》2009,410(38-40):3893-3900
257.
Vesa Halava Tero Harju Tomi Kärki Patrice Séébold 《Theoretical computer science》2009,410(8-10):943-948
We prove that there exist infinitely many infinite overlap-free binary partial words containing at least one hole. Moreover, we show that these words cannot contain more than one hole and the only hole must occur either in the first or in the second position. We define that a partial word is -overlap-free if it does not contain a factor of the form where the length of is at least . We prove that there exist infinitely many 2-overlap-free binary partial words containing an infinite number of holes. 相似文献
258.
JavaScript provides the technological foundation of Web 2.0 applications. AJAX (Asynchronous JavaScript And XML) applications have received wide-spread attention as a new way to develop highly interactive web applications. Breaking with the complete-page-reload paradigm of traditional web applications, AJAX applications rival desktop applications in their look-and-feel. But AJAX places a high burden on a web developer requiring extensive JavaScript knowledge as well as other advanced client-side technologies. In this paper, we introduce a technique that allows a developer to implement an application in Java or any.NET language and then automatically cross-compile it to an AJAX-enabled web application. 相似文献
259.
260.
On Definability in Dependence Logic 总被引:1,自引:1,他引:0
We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable by means of identity only in dependence logic, or equivalently in independence friendly logic. 相似文献