全文获取类型
收费全文 | 899篇 |
免费 | 57篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 10篇 |
化学工业 | 264篇 |
金属工艺 | 13篇 |
机械仪表 | 9篇 |
建筑科学 | 30篇 |
矿业工程 | 3篇 |
能源动力 | 18篇 |
轻工业 | 190篇 |
水利工程 | 3篇 |
石油天然气 | 4篇 |
无线电 | 38篇 |
一般工业技术 | 121篇 |
冶金工业 | 117篇 |
原子能技术 | 4篇 |
自动化技术 | 135篇 |
出版年
2024年 | 2篇 |
2023年 | 11篇 |
2022年 | 53篇 |
2021年 | 58篇 |
2020年 | 25篇 |
2019年 | 32篇 |
2018年 | 26篇 |
2017年 | 29篇 |
2016年 | 24篇 |
2015年 | 33篇 |
2014年 | 44篇 |
2013年 | 74篇 |
2012年 | 54篇 |
2011年 | 65篇 |
2010年 | 44篇 |
2009年 | 48篇 |
2008年 | 37篇 |
2007年 | 33篇 |
2006年 | 32篇 |
2005年 | 24篇 |
2004年 | 28篇 |
2003年 | 27篇 |
2002年 | 13篇 |
2001年 | 10篇 |
2000年 | 13篇 |
1999年 | 14篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 11篇 |
1995年 | 10篇 |
1994年 | 7篇 |
1993年 | 8篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 6篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 6篇 |
1981年 | 4篇 |
1978年 | 2篇 |
1974年 | 2篇 |
1970年 | 1篇 |
1969年 | 2篇 |
1968年 | 2篇 |
1960年 | 1篇 |
1945年 | 1篇 |
排序方式: 共有959条查询结果,搜索用时 15 毫秒
1.
A systems approach is introduced and applied to the development of expressive and communicative action of infants in the first year of life. In this approach, expressive and communicative actions are organized, as part of cooperative systems with other elements of the infants' physiology, cognition, behavior, and social environment. A systems approach presumes that order arises dynamically as a result of the interaction between the cooperating elements that are changing asynchronously, rather than as the result of centrally coordinated developmental change that is synchronous across domains. The systems approach further assumes that the control parameter responsible for eliciting developmental change may be different depending on age, context, and task. It offers a means to understand previously unexplained developmental phenomena: the appearance of mature forms of expression before mature functon has been achieved, the asynchronous rates of development of communicative-action components, discontinuous developmental shifts arising from continuous processes, and the process by which adults influence communicative development. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
2.
Sylvia V A Uzochukwu Esther Balogh Owen G Tucknot Mervyn J Lewis Patrick O Ngoddy 《Journal of the science of food and agriculture》1994,64(4):405-411
Palm wine and pasteurised palm sap volatiles were collected, concentrated on a Tenax GC and analysed by gas chromatography and gas chromatography-mass spectrometry. Eighty-two components were identified: 47 esters, 9 alcohols, 5 acids, 6 carbonyls, 2 acetals, 4 terpenes and 9 hydrocarbons. These had all been found previously in conventional wines. Odour evaluation of the separated palm wine components as they eluted suggested that no one compound is responsible for the characteristic palm wine odour. The acetates of higher alcohols and the ethyl esters of straight-chain aliphatic C6-C10 acids seemed to be important and may play a big role in imparting the fruity nuances of characteristic palm wine odour. Their association with alcohols seemed also to be necessary for the expression of typical palm wine odour. The qualitative difference between palm sap aroma and palm wine aroma appeared to be due mainly to the presence of these esters and alcohols in palm wine and their apparent absence from palm sap, as well as to the presence of some low-boiling esters and alcohols in palm sap and their apparent absence from palm wine. 相似文献
3.
Regression analyses of counts and rates: Poisson, overdispersed Poisson, and negative binomial models. 总被引:1,自引:0,他引:1
The regression models appropriate for counted data have seen little use in psychology. This article describes problems that occur when ordinary linear regression is used to analyze count data and presents 3 alternative regression models. The simplest, the Poisson regression model, is likely to be misleading unless restrictive assumptions are met because individual counts are usually more variable ("overdispersed") than is implied by the model. This model can be modified in 2 ways to accommodate this problem. In the overdispersed model, a factor can be estimated that corrects the regression model's inferential statistics. In the second alternative, the negative binomial regression model, a random term reflecting unexplained between-subject differences is included in the regression model. The authors compare the advantages of these approaches. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
4.
María Esther Diupotex-Chong Néstor J Cazzaniga Alejandra Hernández-Santoyo José Miguel Betancourt-Rule 《Biocell》2004,28(3):279-285
Mitotic chromosomes of the freshwater snail Pomacea patula catemacensis (Baker 1922) were analyzed on gill tissue of specimens from the type locality (Lake Catemaco, Mexico). The diploid number of chromosomes is 2n = 26, including nine metacentric and four submetacentric pairs; therefore, the fundamental number is FN = 52, No sex chromosomes could be identified. The same chromosome number and morphology were already reported for P. flagellata, i.e., the other species of the genus living in Mexico. The basic haploid number for family Ampullariidae was reported to be n = 14 in the literature; so, its reduction to n = 13 is probably an apomorphy of the Mexican Pomacea snails. Lanistes bolteni, from Egypt, also shows n = 13, but its karyotype is much more asymmetrical, and seems to have evolved independently from P. flagellata and P. patula catemacensis. The nominotypical subspecies, P. patula patula (Reeve 1856), is a poorly known taxon, whose original locality is unknown. A taxonomical account is presented here, and a Mexican origin postulated as the most parsimonious hypothesis. 相似文献
5.
We consider an extension of the functional programming language Standard ML with a modular structure based upon concepts in category theory such as categories, functors, natural transformations and adjunctions. In essence, we are following the categorical imperative of considering arrows as well as objects. This is intended to enforce a certain mathematical rigour on the programmer, so that the only programs that can be expressed are those with a categorical significance. The essentially algebraic nature of category theory means that we may generate equational correctness conditions for the modular structure of programs, thus separating the correctness of individual functions from that of modules. We describe this programming language, give examples of its use, and explain how it is implemented in a type system. 相似文献
6.
Esther Brown 《Information & Communications Technology Law》1995,4(1):79-94
This paper outlines the development considerations which led to the construction of a prototype “expert law tutor”. This is a system which models the competencies of the trained law teacher and is intended primarily for use as an interactive student‐directed multidimensional learning tool. The aim is to computerize those activities which might be encountered in a real‐life tutorial exercise—research, reasoning, problem solving and advising, testing, diagnosis and feedback. The paper takes a liberal view of what constitutes an expert system. The terminology expert system is retained but is defined broadly, perhaps contrary to convention, to encompass not only an advisory component or a diagnostic tool but other tutorial functions. To highlight this difference reference is made to an “expert law tutor”. It is the “expertise” of the human law tutor which is called upon. For this reason the system includes a hypertext library or information component and an multiple choice assessment component as well as a legal adviser. Providing “expert” tutor feedback is a key element in the dialogue between system and student. The prototype system was developed using (inter alia) a rule‐based expert system shell and an object‐oriented hypertext tool, and the paper comments on the features of these development tools. 相似文献
7.
8.
Helmut Alt Esther M. Arkin Alon Efrat George Hart Ferran Hurtado Irina Kostitsyna Alexander Kröller Joseph S. B. Mitchell Valentin Polishchuk 《Theory of Computing Systems》2014,54(4):689-714
We show how to compute the smallest rectangle that can enclose any polygon, from a given set of polygons, in nearly linear time; we also present a PTAS for the problem, as well as a linear-time algorithm for the case when the polygons are rectangles themselves. We prove that finding a smallest convex polygon that encloses any of the given polygons is NP-hard, and give a PTAS for minimizing the perimeter of the convex enclosure. We also give efficient algorithms to find the smallest rectangle simultaneously enclosing a given pair of convex polygons. 相似文献
9.
Juan de Lara Esther Guerra Artur Boronat Reiko Heckel Paolo Torrini 《Software and Systems Modeling》2014,13(1):209-238
Graph transformation is being increasingly used to express the semantics of domain-specific visual languages since its graphical nature makes rules intuitive. However, many application domains require an explicit handling of time to accurately represent the behaviour of a real system and to obtain useful simulation metrics to measure throughputs, utilization times and average delays. Inspired by the vast knowledge and experience accumulated by the discrete event simulation community, we propose a novel way of adding explicit time to graph transformation rules. In particular, we take the event scheduling discrete simulation world view and provide rules with the ability to schedule the occurrence of other rules in the future. Hence, our work combines standard, efficient techniques for discrete event simulation (based on the handling of a future event set) and the intuitive, visual nature of graph transformation. Moreover, we show how our formalism can be used to give semantics to other timed approaches and provide an implementation on top of the rewriting logic system Maude. 相似文献
10.
Testing model transformations poses several challenges, among them the automatic generation of appropriate input test models and the specification of oracle functions. Most approaches for the generation of input models ensure a certain coverage of the source meta-model or the transformation implementation code, whereas oracle functions are frequently defined using query or graph languages. However, these two tasks are usually performed independently regardless of their common purpose, and sometimes, there is a gap between the properties exhibited by the generated input models and those considered by the transformations. Recently, we proposed a formal specification language for the declarative formulation of transformation properties (by means of invariants, pre-, and postconditions) from which we generated partial oracle functions used for transformation testing. Here, we extend the usage of our specification language for the automated generation of input test models by SAT solving. The testing process becomes more intentional because the generated models ensure a certain coverage of the transformation requirements. Moreover, we use the same specification to consistently derive both the input test models and the oracle functions. A set of experiments is presented, aimed at measuring the efficacy of our technique. 相似文献