全文获取类型
收费全文 | 6454篇 |
免费 | 879篇 |
国内免费 | 769篇 |
专业分类
电工技术 | 281篇 |
综合类 | 587篇 |
化学工业 | 108篇 |
金属工艺 | 79篇 |
机械仪表 | 470篇 |
建筑科学 | 151篇 |
矿业工程 | 78篇 |
能源动力 | 87篇 |
轻工业 | 76篇 |
水利工程 | 291篇 |
石油天然气 | 18篇 |
武器工业 | 66篇 |
无线电 | 548篇 |
一般工业技术 | 276篇 |
冶金工业 | 568篇 |
原子能技术 | 17篇 |
自动化技术 | 4401篇 |
出版年
2024年 | 51篇 |
2023年 | 108篇 |
2022年 | 211篇 |
2021年 | 206篇 |
2020年 | 165篇 |
2019年 | 167篇 |
2018年 | 151篇 |
2017年 | 172篇 |
2016年 | 215篇 |
2015年 | 229篇 |
2014年 | 278篇 |
2013年 | 314篇 |
2012年 | 339篇 |
2011年 | 386篇 |
2010年 | 342篇 |
2009年 | 399篇 |
2008年 | 432篇 |
2007年 | 455篇 |
2006年 | 498篇 |
2005年 | 426篇 |
2004年 | 382篇 |
2003年 | 344篇 |
2002年 | 290篇 |
2001年 | 230篇 |
2000年 | 216篇 |
1999年 | 163篇 |
1998年 | 159篇 |
1997年 | 119篇 |
1996年 | 125篇 |
1995年 | 90篇 |
1994年 | 88篇 |
1993年 | 82篇 |
1992年 | 60篇 |
1991年 | 58篇 |
1990年 | 31篇 |
1989年 | 36篇 |
1988年 | 20篇 |
1987年 | 14篇 |
1986年 | 10篇 |
1985年 | 6篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1979年 | 3篇 |
1975年 | 2篇 |
1965年 | 3篇 |
1964年 | 3篇 |
1963年 | 2篇 |
1962年 | 2篇 |
1961年 | 2篇 |
1960年 | 2篇 |
排序方式: 共有8102条查询结果,搜索用时 8 毫秒
1.
2.
H. D. Saltzstein and T. Kasachkoff (2004) (see record 2004-21519-004) critique the social intuitionist model (J. Haidt, 2001) (see record 2001-18918-008), but the model they critique is a stripped-down version that should be called the "possum" model. They make 3 charges about the possum model that are not true about the social intuitionist model: that it includes no role for reasoning, that it reduces social influence to compliance, and that it does not take a developmental perspective. After a defense of the honor of the social intuitionist model, this article raises 2 areas of legitimate dispute: the scope and nature of moral reasoning and the usefulness of appealing to innate ideas, rather than to learning and reasoning, as the origin of moral knowledge. This article presents 3 clusters of innate moral intuitions, related to sympathy, hierarchy, and reciprocity. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
3.
Thirty patients who had undergone either a right or left unilateral temporal lobectomy (14 RTL; 16 LTL) and 16 control participants were tested on a computerized human analogue of the Morris Water Maze. The procedure was designed to compare allocentric and egocentric spatial memory. In the allocentric condition, participants searched for a target location on the screen, guided by object cues. Between trials, participants had to walk around the screen, which disrupted egocentric memory representation. In the egocentric condition, participants remained in the same position, but the object cues were shifted between searches to prevent them from using allocentric memory. Only the RTL group was impaired on the allocentric condition, and neither the LTL nor RTL group was impaired on additional tests of spatial working memory or spatial manipulation. The results support the notion that the right anterior temporal lobe stores long-term allocentric spatial memories. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
4.
Wesley W. Chu Ph.D. Ion T. leong Ph.D. Ricky K. Taira Ph.D. 《The VLDB Journal The International Journal on Very Large Data Bases》1994,3(4):445-477
We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach. 相似文献
5.
Inaki Arrazola Agn s Plainfoss Henri Prade Claudette Testemale 《Information Systems》1989,14(6):487-492
This paper presents different approaches which enable a data base management system to obtain a plausible fuzzy estimate for an attribute value of an item for which the information is not explicitly stored in the data base. This can be made either by a kind of analogical reasoning from information about particular items or by means of expert rules which specify the (fuzzy) sets of possible values of the attribute under consideration, for various classes of items. Another kind of expert rules enables the system to compute an estimate from the attribute value of another item provided that, in other respects, this latter item sufficiently resembles the item, the value of which we are interested in; then these expert rules are used either for controlling the analogical reasoning process or for enlarging the scope of application of the first kind of expert rules. The different approaches are discussed in the framework of possibility theory. 相似文献
6.
7.
Common sense sometimes predicts events to be likely or unlikely rather than merely possible. We extend methods of qualitative reasoning to predict the relative likelihoods of possible qualitative behaviors by viewing the dynamics of a system as a Markov chain over its transition graph. This involves adding qualitative or quantitative estimates of transition probabilities to each of the transitions and applying the standard theory of Markov chains to distinguish persistent states from transient states and to calculate recurrence times, settling times, and probabilities for ending up in each state. Much of the analysis depends solely on qualitative estimates of transition probabilities, which follow directly from theoretical considerations and which lead to qualitative predictions about entire classes of systems. Quantitative estimates for specific systems are derived empirically and lead to qualitative and quantitative conclusions, most of which are insensitive to small perturbations in the estimated transition probabilities. The algorithms are straightforward and efficient. 相似文献
8.
Dragan Simić Svetlana Simić 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(12):1185-1192
A concept of business intelligent system for financial prediction is considered in this paper. It provides data needed for
fast, precise and good business decision support to all levels of management. The aim of the project is the development of
a new online analytical processing oriented on case-based reasoning (CBR) where a previous experience for every new problem
is taken into account. Methodological aspects have been tested in practice as a part of the management information system
development project of “Novi Sad Fair”. A case study of an improved application of CBR in prediction of future payments is
discussed in the paper.
This paper is originally presented at The International Conference on Hybrid Information Technology 2006, at the special session
on “Intelligent Information Systems for Financial Engineering”, November 2006 in Cheju Island, Korea. 相似文献
9.
The paper describes a prototype system called HiSQL (Historical SQL) which extends the functionality of SQL in manipulating
historical data, by providing functions for spatial and temporal processing. Conceptually the paper is divided into three
parts: the first part deals with the design and architecture of the system; the second part introduces a case study (the defters);
and the third part describes specific functions for spatial and temporal processing of serial documents. The paper concludes
with a comparison between HiSQL and SQL and suggestions for further work.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
10.
J. Dingel 《Formal Aspects of Computing》2002,14(2):123-197
Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to
the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists.
Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these
problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus
allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The
calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction
of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are
independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated.
Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification
notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus
rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement
relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality.
The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing
program and vice versa.
Received July 2001 / Accepted in revised form May 2002 相似文献