全文获取类型
收费全文 | 417篇 |
免费 | 39篇 |
国内免费 | 33篇 |
学科分类
工业技术 | 489篇 |
出版年
2024年 | 2篇 |
2023年 | 4篇 |
2022年 | 12篇 |
2021年 | 8篇 |
2020年 | 5篇 |
2019年 | 7篇 |
2018年 | 10篇 |
2017年 | 10篇 |
2016年 | 10篇 |
2015年 | 13篇 |
2014年 | 18篇 |
2013年 | 25篇 |
2012年 | 34篇 |
2011年 | 47篇 |
2010年 | 27篇 |
2009年 | 21篇 |
2008年 | 26篇 |
2007年 | 25篇 |
2006年 | 19篇 |
2005年 | 20篇 |
2004年 | 24篇 |
2003年 | 23篇 |
2002年 | 18篇 |
2001年 | 14篇 |
2000年 | 6篇 |
1999年 | 11篇 |
1998年 | 6篇 |
1997年 | 3篇 |
1996年 | 8篇 |
1995年 | 3篇 |
1994年 | 9篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1976年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有489条查询结果,搜索用时 15 毫秒
1.
2.
Shao Zhiqing 《计算机科学技术学报》1993,8(2):59-65
In this paper we try to introduce a new approach to operational semantics of recursive programsby using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu ofmodelling partial functions by introducing undefined values in a traditional approach,we shall define apriority derivation tree for every term,and by respecting the rule“attacking the subterm of thehighest priority first”we define transition relations,computation sequences etc.directly based on astandard interpretation which includes no undefined value in its domain.Finally,we prove that ournew approach generates the same operational semantics as the traditional one.It is also pointed outthat we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semanticsof recursive programs cannot be built based on predicate logic. 相似文献
3.
H. M. Logan 《Computers and the Humanities》1989,23(4-5):385-395
The study of the history of new words in theNewOED described in this paper was undertaken in 1986-87, and is based on the material then available. Since then, theNewOED has been finished, and PAT, the inquiry system developed at the University of Waterloo for the investigation of theNewOED data base, has been much altered and improved. Nevertheless, this report should prove useful in indicating the potentiality for analyzing the computerizedNewOED and some of the problems. This project is a study of the ways in which new words are created in English at various periods of time. A chronological dictionary 's created listing words introduced into the language over 50 year increments. These words are then classified by the processes used in forming them to show, in proportional terms, if certain processes are more common at some times than at others.H. M. Logan, Associate Professor, Department of English, University of Waterloo, Waterloo, Ontario, Canada, has written The Dialect of the Middle English Life of St. Katherine (Mouton, 1973), making use of the computer in a study of medieval dialectology. He has also written articles on computer stylistics and literary analysis inCHum, ALLC Journal, Language and Style, College Literature, and on the dictionary inDictionaries. 相似文献
4.
靛蓝染液组分浓度在线检测系统 总被引:2,自引:0,他引:2
为实现靛蓝染液组分浓度的在线检测,提高检测的准确度和精确度,设计开发了采用电位滴定法在线实时检测靛蓝染液中各组分浓度的系统。系统以工控机为核心,基于研华板卡PCI1710,在C#环境下,实现工控机对设备的控制以及对检测数据的采集,采用二阶微商法确定电位滴定的终点。通过对检测结果的分析可知误差在2%以内,说明系统可以满足工业生产的需要。 相似文献
5.
We give an example of a monoid with finitely many left and right ideals, all of whose Schützenberger groups are presentable by finite complete rewriting systems, and so each have finite derivation type, but such that the monoid itself does not have finite derivation type, and therefore does not admit a presentation by a finite complete rewriting system. The example also serves as a counterexample to several other natural questions regarding complete rewriting systems and finite derivation type. Specifically it allows us to construct two finitely generated monoids M and N with isometric Cayley graphs, where N has finite derivation type (respectively, admits a presentation by a finite complete rewriting system) but M does not. This contrasts with the case of finitely generated groups for which finite derivation type is known to be a quasi-isometry invariant. The same example is also used to show that neither of these two properties is preserved under finite Green index extensions. 相似文献
6.
Rick RabiserAuthor Vitae Pádraig O’LearyAuthor Vitae Ita RichardsonAuthor Vitae 《Journal of Systems and Software》2011,84(2):285-300
More and more organizations adopt software product lines to leverage extensive reuse and deliver a multitude of benefits such as increased quality and productivity and a decrease in cost and time-to-market of their software development. When compared to the vast amount of research on developing product lines, relatively little work has been dedicated to the actual use of product lines to derive individual products, i.e., the process of product derivation. Existing approaches to product derivation have been developed independently for different aims and purposes. While the definition of a general approach applicable to every domain may not be possible, it would be interesting for researchers and practitioners to know which activities are common in existing approaches, i.e., what are the key activities in product derivation. In this paper we report on how we compared two product derivation approaches developed by the authors in two different, independent research projects. Both approaches independently sought to identify product derivation activities, one through a process reference model and the other through a tool-supported derivation approach. Both approaches have been developed and validated in research industry collaborations with different companies. Through the comparison of the approaches we identify key product derivation activities. We illustrate the activities’ importance with examples from industry collaborations. To further validate the activities, we analyze three existing product derivation approaches for their support for these activities. The validation provides evidence that the identified activities are relevant to product derivation and we thus conclude that they should be considered (e.g., as a checklist) when developing or evaluating a product derivation approach. 相似文献
7.
一种基于程序正确性证明理论的程序开发方法 总被引:3,自引:0,他引:3
程序的形式推导方法是一种基于程序正确性证明理论的程序开发方法,它使得程序的开发和证明同时进行,程序开发完成的同时其正确性亦得以保 证,以两个问题的程序开发为例说明了程序的形式推导方法的使用。 相似文献
8.
以logistic模型为基础 ,以时间因子为媒介 ,推导出一个能准确描述植物病害I-S的logistic衍生模型。通过对油松落针病、花生锈病、烟草黄瓜花叶病和小麦赤霉病等多组I-S关系数据的实例验证与比较分析 ,显示出这一模型具有较强的数据拟合能力和广泛的适用性。Logistic衍生模型尚可应用于林木胸径与材积(D -V)关系、径与树高(D -H)关系以及生物量预估等项研究。此外 ,还提出一个具有普遍指导意义的通用模型 相似文献
9.
席高文 《重庆科技学院学报(自然科学版)》2012,14(3):177-179
通过对一类微积分计算方法的探究,从本质上分析所形成的思维模式,给出了一元微分以及积分区域为圆的二重积分通过平移变换简单巧妙的计算方法.由此可以类比出多元微分,以及多重积分的计算方法. 相似文献
10.