全文获取类型
收费全文 | 752篇 |
免费 | 84篇 |
国内免费 | 109篇 |
专业分类
电工技术 | 18篇 |
综合类 | 127篇 |
化学工业 | 19篇 |
金属工艺 | 5篇 |
机械仪表 | 15篇 |
建筑科学 | 45篇 |
矿业工程 | 2篇 |
轻工业 | 17篇 |
水利工程 | 3篇 |
石油天然气 | 9篇 |
武器工业 | 2篇 |
无线电 | 58篇 |
一般工业技术 | 23篇 |
冶金工业 | 73篇 |
原子能技术 | 1篇 |
自动化技术 | 528篇 |
出版年
2024年 | 4篇 |
2023年 | 7篇 |
2022年 | 17篇 |
2021年 | 10篇 |
2020年 | 19篇 |
2019年 | 14篇 |
2018年 | 13篇 |
2017年 | 19篇 |
2016年 | 10篇 |
2015年 | 20篇 |
2014年 | 26篇 |
2013年 | 26篇 |
2012年 | 34篇 |
2011年 | 45篇 |
2010年 | 44篇 |
2009年 | 52篇 |
2008年 | 59篇 |
2007年 | 59篇 |
2006年 | 64篇 |
2005年 | 52篇 |
2004年 | 35篇 |
2003年 | 35篇 |
2002年 | 39篇 |
2001年 | 30篇 |
2000年 | 27篇 |
1999年 | 28篇 |
1998年 | 17篇 |
1997年 | 17篇 |
1996年 | 22篇 |
1995年 | 15篇 |
1994年 | 7篇 |
1993年 | 19篇 |
1992年 | 12篇 |
1991年 | 8篇 |
1990年 | 2篇 |
1989年 | 7篇 |
1986年 | 3篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1974年 | 1篇 |
1970年 | 1篇 |
1967年 | 1篇 |
1966年 | 2篇 |
1965年 | 3篇 |
1964年 | 1篇 |
1957年 | 2篇 |
1956年 | 2篇 |
1954年 | 2篇 |
排序方式: 共有945条查询结果,搜索用时 8 毫秒
101.
科技期刊论文撰写中存在问题分析 总被引:1,自引:0,他引:1
按照科技论文必要组成部分的顺序,说明了各部分的要求、常见问题及注意事项. 相似文献
102.
为方便通信双方在未协商通信内容情况下动态、高效地交换模型和数据,提出了电力系统动态消息编码技术。该编码技术采用二进制自描述方式描述大型电力系统模型和数据,共有四种编码方式:M0用于兼容抽象语法标记(ASN.1);M1在ASN.1的基础上加入名字选项,用于少量数据的结构化描述;M2扩展编码头部,编码效率高;M3扩展编码头部,描述类信息。实际使用中,首次通信时使用M3发送类型和结构信息,其后通信使用M2发送数据;当类型和结构发生变化时,再次发送类型和结构信息,有效地解决了数据量和维护的矛盾问题。 相似文献
103.
I argue that intentional psychology does not stand in need of vindication by a lower-level implementation theory from cognitive science, in particular the representational theory of mind (RTM), as most famously Jerry Fodor has argued. The stance of the paper is novel in that I claim this holds even if one, in line with Fodor, views intentional psychology as an empirical theory, and its theoretical posits as as real as those of other sciences. I consider four metaphysical arguments for the idea that intentional psychological states, such as beliefs, must be seen as requiring in-the-head mental representations for us to be able to understand their characteristic causal powers and argue that none of them validly generate their desired conclusions. I go on to argue that RTM, or some computational version thereof, is not motivated by appeal to the nature of cognitive science research either. I conclude that intentional psychology, though an empirical theory, is autonomous from details of lower level mechanism in a way that renders RTM unwarranted. 相似文献
104.
[Correction Notice: An erratum for this article was reported in Vol 137(2) of Journal of Experimental Psychology: General (see record 2008-05019-011). The DOI for the supplemental materials was printed incorrectly. The correct DOI is as follows: http://dx.doi.org/10.1037/0096-3445.137.1.22.supp] What are the origins of abstract concepts such as "seven," and what role does language play in their development? These experiments probed the natural number words and concepts of 3-year-old children who can recite number words to ten but who can comprehend only one or two. Children correctly judged that a set labeled eight retains this label if it is unchanged, that it is not also four, and that eight is more than two. In contrast, children failed to judge that a set of 8 objects is better labeled by eight than by four, that eight is more than four, that eight continues to apply to a set whose members are rearranged, or that eight ceases to apply if the set is increased by 1, doubled, or halved. The latter errors contrast with children's correct application of words for the smallest numbers. These findings suggest that children interpret number words by relating them to 2 distinct preverbal systems that capture only limited numerical information. Children construct the system of abstract, natural number concepts from these foundations. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
105.
106.
Francesco Ranzato 《Information and Computation》1999,152(2):236
It is well known that closure operators on a complete lattice, ordered pointwise, give rise to a complete lattice, and this basic fact plays an important rôle in many fields of the semantics area, notably in domain theory and abstract interpretation. We strengthen that result by showing that closure operators on any directed-complete partial order (CPO) still form a complete lattice. An example of application in abstract interpretation theory is given. 相似文献
107.
No authorship indicated 《Canadian Metallurgical Quarterly》2000,45(3):310
Presents a series of abstracts for selected Division 22 symposia and paper/poster presentations from the 2000 Annual Convention of the American Psychological Association. The abstracts focus on a variety of topics related to rehabilitation psychology. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
108.
109.
Lang Qiuhong 《中国邮电高校学报(英文版)》1997,(2)
TheAnalysisofthePostalIndividualFinanceManuscriptreceivedFeb.7,1996LangQiuhong(ShijiazhuangPostalColege,Shijiazhuang050021,P.... 相似文献
110.
In this paper we generalize the notion of compositional semantics to cope with transfinite reductions of a transition system. Standard denotational and predicate transformer semantics, even though compositional, provide inadequate models for some known program manipulation techniques. We are interested in the systematic design of extended compositional semantics, observing possible transfinite computations, i.e. computations that may occur after a given number of infinite loops. This generalization is necessary to deal with program manipulation techniques modifying the termination status of programs, such as program slicing. We include the transfinite generalization of semantics in the hierarchy developed in 1997 by P. Cousot, where semantics at different levels of abstraction are related with each other by abstract interpretation. We prove that a specular hierarchy of non-standard semantics modeling transfinite computations of programs can be specifiedin such a way that the standard hierarchy can be derived by abstract interpretation. We prove that non-standard transfinite denotational and predicate transformer semantics can be both systematically derived as solutions of simple abstract domain equations involving the basic operation of reduced power of abstract domains. This allows us to prove the optimality of these semantics, i.e. they are the most abstract semantics in the hierarchy which are compositional and observe respectively the terminating and initial states of transfinite computations, providing an adequate mathematical model for program manipulation. 相似文献