全文获取类型
收费全文 | 13357篇 |
免费 | 224篇 |
国内免费 | 154篇 |
专业分类
电工技术 | 190篇 |
综合类 | 8篇 |
化学工业 | 966篇 |
金属工艺 | 504篇 |
机械仪表 | 126篇 |
建筑科学 | 163篇 |
矿业工程 | 3篇 |
能源动力 | 242篇 |
轻工业 | 303篇 |
水利工程 | 55篇 |
石油天然气 | 88篇 |
无线电 | 729篇 |
一般工业技术 | 730篇 |
冶金工业 | 164篇 |
原子能技术 | 102篇 |
自动化技术 | 9362篇 |
出版年
2024年 | 12篇 |
2023年 | 119篇 |
2022年 | 233篇 |
2021年 | 274篇 |
2020年 | 182篇 |
2019年 | 192篇 |
2018年 | 229篇 |
2017年 | 168篇 |
2016年 | 177篇 |
2015年 | 112篇 |
2014年 | 347篇 |
2013年 | 441篇 |
2012年 | 932篇 |
2011年 | 3247篇 |
2010年 | 1260篇 |
2009年 | 1134篇 |
2008年 | 764篇 |
2007年 | 641篇 |
2006年 | 517篇 |
2005年 | 633篇 |
2004年 | 569篇 |
2003年 | 611篇 |
2002年 | 306篇 |
2001年 | 35篇 |
2000年 | 28篇 |
1999年 | 50篇 |
1998年 | 117篇 |
1997年 | 43篇 |
1996年 | 37篇 |
1995年 | 16篇 |
1994年 | 21篇 |
1993年 | 24篇 |
1992年 | 26篇 |
1991年 | 13篇 |
1990年 | 17篇 |
1989年 | 21篇 |
1988年 | 24篇 |
1987年 | 11篇 |
1986年 | 22篇 |
1985年 | 17篇 |
1984年 | 30篇 |
1983年 | 19篇 |
1982年 | 11篇 |
1981年 | 13篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 8篇 |
1977年 | 4篇 |
1976年 | 7篇 |
1974年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
72.
73.
Xi-Ren CaoAuthor Vitae Zhiyuan RenAuthor Vitae Shalabh BhatnagarAuthor Vitae Michael FuAuthor Vitae Steven MarcusAuthor Vitae 《Automatica》2002,38(6):929-943
We propose a time aggregation approach for the solution of infinite horizon average cost Markov decision processes via policy iteration. In this approach, policy update is only carried out when the process visits a subset of the state space. As in state aggregation, this approach leads to a reduced state space, which may lead to a substantial reduction in computational and storage requirements, especially for problems with certain structural properties. However, in contrast to state aggregation, which generally results in an approximate model due to the loss of Markov property, time aggregation suffers no loss of accuracy, because the Markov property is preserved. Single sample path-based estimation algorithms are developed that allow the time aggregation approach to be implemented on-line for practical systems. Some numerical and simulation examples are presented to illustrate the ideas and potential computational savings. 相似文献
74.
75.
A very simple algorithm for computing all k nearest neighbors in 2-D is presented. The method does not rely on complicated forms of tessellation, it only requires simple data binning for fast range searching. Its applications range from scattered data interpolation to reverse engineering. 相似文献
76.
This paper describes how SWoRD (scaffolded writing and rewriting in the discipline), a web-based reciprocal peer review system, supports writing practice, particularly for large content courses in which writing is considered critical but not feasibly included. To help students gain content knowledge as well as writing and reviewing skills, SWoRD supports the whole cycle of writing, reviews, back-reviews, and rewriting by scaffolding the journal publication process as its authentic practice model. In addition, SWoRD includes algorithms that compute individual reviewer’s review accuracy, which is in turn used to support the various drawbacks of reciprocal peer reviews (e.g., variation in motivation or ability of reviewers). Finally, this paper describes an empirical evaluation showing that the SWoRD approach is effective in improving writing quality in content classes. 相似文献
77.
Jonathan Alexander Author Vitae William P. Banks Author Vitae 《Computers and Composition》2004,21(3):273-293
In this introduction to a special issue of Computers and Composition, the authors critically review current literature on computer-assisted writing pedagogies that grapple with issues of sexuality. Although this body of work is small, it points to provocative ways to develop our students’ critical and rhetorical sensibilities about the constructions of sexuality in our culture. Further, such work innovatively addresses the place of networked communication technologies in the interrogation of such constructions. The authors conclude with both an introduction of the work in this special issue that addresses the intersection of sexuality studies and computer-assisted writing studies and with a call for additional work in this field. 相似文献
78.
79.
Mohammed F. Bain M.F. Ruddell F.H. Linton D. Gamble H.S. Fusco V.F. 《Electron Devices, IEEE Transactions on》2005,52(7):1384-1391
The design and simulation of a novel silicon Schottky diode for nonlinear transmission line (NLTL) applications is discussed in this paper. The Schottky diode was fabricated on a novel silicon-on-silicide-on-insulator (SSOI) substrate for minimized series resistance. Ion implantation technology was used as a low-cost alternative to molecular beam epitaxy to approximate the delta (/spl delta/) doping profile, which results in strong nonlinear CV characteristics. The equivalent circuit model of the Schottky diode under reverse bias conditions was extracted from the S-parameter measurement performed on the diode. The measured CV characteristics show strong nonlinearity, the junction capacitance varies from 182 to 47.5 fF as the reverse bias voltage is varied from 0 to -5 V. A parasitic inductance of 40 pH was measured for the silicon Schottky diode, which is much smaller than a comparable sized GaAs Schottky diode. This small inductance is an advantage for the silicon Schottky diode offering improvement in the silicon NLTL performance. 相似文献
80.
This article presents an autonomous guide agent that can observe a community of learners on the web, interpret the learners' inputs, and then assess their sharing. The goal of this agent is to find a reliable helper (tutor or other learner) to assist a learner in solving his task. Despite the growing number of Internet users, the ability to find helpers is still a challenging and important problem. Although helpers could have much useful information about courses to be taught, many learners fail to understand their presentations. For that, the agent must be able to deal autonomously with the following challenges: Do helpers have information that the learners need? Will helpers present information that learners can understand? And can we guarantee that these helpers will collaborate effectively with learners? We have developed a new filtering framework, called a pyramid collaborative filtering model, to whittle the number of helpers down to just one. We have proposed four levels for the pyramid. Moving from one level to another depends on three filtering techniques: domain model filtering, user model filtering, and credibility model filtering. A new technique is filtering according to helpers' credibilities. Our experiments show that this method greatly improves filtering effectiveness. © 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 1065–1082, 2007. 相似文献