全文获取类型
收费全文 | 1723篇 |
免费 | 42篇 |
国内免费 | 57篇 |
专业分类
电工技术 | 5篇 |
综合类 | 28篇 |
化学工业 | 21篇 |
金属工艺 | 25篇 |
机械仪表 | 39篇 |
建筑科学 | 56篇 |
矿业工程 | 4篇 |
能源动力 | 3篇 |
轻工业 | 11篇 |
水利工程 | 6篇 |
石油天然气 | 12篇 |
武器工业 | 1篇 |
无线电 | 82篇 |
一般工业技术 | 64篇 |
冶金工业 | 7篇 |
原子能技术 | 1篇 |
自动化技术 | 1457篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 8篇 |
2021年 | 17篇 |
2020年 | 9篇 |
2019年 | 9篇 |
2018年 | 11篇 |
2017年 | 28篇 |
2016年 | 28篇 |
2015年 | 31篇 |
2014年 | 74篇 |
2013年 | 58篇 |
2012年 | 66篇 |
2011年 | 97篇 |
2010年 | 76篇 |
2009年 | 109篇 |
2008年 | 132篇 |
2007年 | 126篇 |
2006年 | 151篇 |
2005年 | 104篇 |
2004年 | 82篇 |
2003年 | 91篇 |
2002年 | 66篇 |
2001年 | 45篇 |
2000年 | 61篇 |
1999年 | 37篇 |
1998年 | 46篇 |
1997年 | 32篇 |
1996年 | 27篇 |
1995年 | 36篇 |
1994年 | 28篇 |
1993年 | 19篇 |
1992年 | 28篇 |
1991年 | 15篇 |
1990年 | 7篇 |
1989年 | 6篇 |
1988年 | 5篇 |
1987年 | 5篇 |
1986年 | 5篇 |
1985年 | 5篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1976年 | 3篇 |
1975年 | 1篇 |
排序方式: 共有1822条查询结果,搜索用时 15 毫秒
1.
The performance verification of micro-CMMs is now of intense interest because of their capability to perform length measurements in three dimensions to high accuracy with low uncertainties. Currently, verification of micro-CMMs is completed in the spirit of existing specification standards, because strict adherence to these standards is often difficult. This review aims to present and discuss verification techniques available for micro-CMMs: specification standards, existing calibrated test lengths and traceability routes that can be associated with micro-CMMs. Three specification standards used in the testing of CMMs will be considered. In addition, a wide range of calibrated test lengths are reported, and any advantages and disadvantages associated with their use are discussed. It is concluded that micro-CMMs cannot yet be verified in accordance with existing specification standards. Suggestions are made for future standardisation work required to rectify these issues. 相似文献
2.
We consider a language of operations which pass parameters by means of a stack. An algebra over the set of type signatures is introduced, which allows the type signature of a program to be obtained from the type signatures of its constituent operations.Although the theories apply in principle to any stack based language, they have been evolved with particular regard to the proposed ANSI Standard Forth language, which is currently implemented in a type free manner. We hope this work will stimulate an interest in Forth amongst those applying algebraic techniques in software engineering, and we hope to lay the theoretical foundations for implementing practical type checkers to support Forth. 相似文献
3.
CAPP中参数化规格表的建立及可视化填写的实现 总被引:1,自引:0,他引:1
计算机辅助工艺设计(CAPP)软件能否高效地发挥其功用,其基础数据库建立的好坏起着极其重要的作用。在对众多商品化CAPP软件进行详细调研的基础上,开发出了能由用户自行建立参数化规格表并实现可视化填写的CAPP系统,并在国家863/CF-CIMS应用示范工程中得到应用。 相似文献
4.
圆盘锯机在线材厂投入使用时不能满足生产的需要:锯切周期太长,锯片使用性能差,经过对设备进行技术改造和对设备操作规程进行优化,以及在操作上加强管理,使之关键指标大幅度提升,为圆盘锯机的使用改善提供了新的思路。 相似文献
5.
Motivated by a study of similar problems stated for factors of words, we study forbidden subwords of a language or a word. A procedure for obtaining the set of all words avoiding a given set of subwords is presented. On the other hand, an algorithm for computing the set of minimal forbidden subwords for a word is given. The case of a two-letter alphabet appears to be particularly interesting and it is considered separately. 相似文献
6.
Cezar Câmpeanu 《Information Processing Letters》2004,92(6):267-274
We define the pattern expressions as an extension of both regular expressions and patterns. We prove several properties of the new family of languages, similar to those of extended regex languages [Câmpeanu et al., Int. J. Found. Comput. Sci. 14 (6) (2003) 1007-1018]. We also define an automata system that recognizes these languages. Differences between regex and pattern expressions are also discussed. 相似文献
7.
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 相似文献
8.
The MSMIE protocol [SBC89] allows processors in a distributed system to communicate via shared memory. It was designed to meet the reliability and efficiency needs of applications such as nuclear safety systems. We present a formal model of the MSMIE protocol expressed in the notation CCS. Desirable properties of the protocol are expressed in the modal mu-calculus, an expressive modal logic. We show that the protocol lacks an important liveness property. In actual operation, additional operating constraints are checked to avoid potential problems. We present a modified protocol and show that it possesses the liveness property even without checking operating constraints. We also show how parts of the analysis were automated with the Concurrency Workbench. 相似文献
9.
Reorganisation and evolution of class hierarchies is important for object-oriented system development and has received considerable attention in the literature. The contributions of this paper are: (1) a formal study of a set of extension relations and transformations on class hierarchies; (2) a presentation of a small set of primitive transformations which form a minimal and complete basis for the extension relations; and (3) an analysis of the impact of these transformations at the object level.The study leads to a better understanding of evolution and reuse of object-oriented software and class hierarchies. It also provides a terminology and a means of classification for design reuse. The theory presented in this paper is based on the Demeter data model, which gives a concise mathematical foundation for classes and their inheritance and part-of relationships. Parts of the theory have been implemented in the Demeter System
TM
C++, a CASE tool for object-oriented design and programming. 相似文献
10.
Sven Beyer Christian Jacobi Daniel Kröning Dirk Leinenbach Wolfgang J. Paul 《International Journal on Software Tools for Technology Transfer (STTT)》2006,8(4-5):411-430
In the verified architecture microprocessor (VAMP) project we have designed, functionally verified, and synthesized a processor
with full DLX instruction set, delayed branch, Tomasulo scheduler, maskable nested precise interrupts, pipelined fully IEEE
compatible dual precision floating point unit with variable latency, and separate instruction and data caches. The verification
has been carried out in the theorem proving system PVS. The processor has been implemented on a Xilinx FPGA.
A shorter version of this article with the title “Instantiating uninterpreted functional units and memory system: functional
verification of the VAMP” appeared in [8]. The work reported here was done while all the authors were with Saarland University. 相似文献