全文获取类型
收费全文 | 4800篇 |
免费 | 647篇 |
国内免费 | 694篇 |
专业分类
电工技术 | 286篇 |
综合类 | 443篇 |
化学工业 | 74篇 |
金属工艺 | 25篇 |
机械仪表 | 185篇 |
建筑科学 | 182篇 |
矿业工程 | 48篇 |
能源动力 | 36篇 |
轻工业 | 56篇 |
水利工程 | 84篇 |
石油天然气 | 98篇 |
武器工业 | 24篇 |
无线电 | 438篇 |
一般工业技术 | 272篇 |
冶金工业 | 227篇 |
原子能技术 | 195篇 |
自动化技术 | 3468篇 |
出版年
2024年 | 30篇 |
2023年 | 78篇 |
2022年 | 144篇 |
2021年 | 154篇 |
2020年 | 174篇 |
2019年 | 198篇 |
2018年 | 125篇 |
2017年 | 185篇 |
2016年 | 201篇 |
2015年 | 198篇 |
2014年 | 272篇 |
2013年 | 287篇 |
2012年 | 302篇 |
2011年 | 312篇 |
2010年 | 253篇 |
2009年 | 325篇 |
2008年 | 339篇 |
2007年 | 328篇 |
2006年 | 303篇 |
2005年 | 282篇 |
2004年 | 205篇 |
2003年 | 180篇 |
2002年 | 181篇 |
2001年 | 135篇 |
2000年 | 133篇 |
1999年 | 122篇 |
1998年 | 100篇 |
1997年 | 81篇 |
1996年 | 73篇 |
1995年 | 86篇 |
1994年 | 64篇 |
1993年 | 64篇 |
1992年 | 56篇 |
1991年 | 33篇 |
1990年 | 26篇 |
1989年 | 23篇 |
1988年 | 9篇 |
1987年 | 5篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 3篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1976年 | 7篇 |
1975年 | 3篇 |
1959年 | 3篇 |
排序方式: 共有6141条查询结果,搜索用时 15 毫秒
1.
We introduce a new architecture for the design of a tool for modeling and simulation of continuous and hybrid systems. The environment includes a compiler based on Modelica, a modular and a causal standard specification language for physical systems modeling (the tool supports models composed using certain component classes defined in the Modelica Standard Library, and the instantiation, parameterization and connection of these MSL components are described using a subset of Modelica). Models are defined in Modelica and are translated into DEVS models. DEVS theory (originally defined for modeling and simulation of discrete event systems) was extended in order to permit defining these of models. The different steps in the compiling process are show, including how to model these dynamic systems under the discrete event abstraction, including examples of model simulation with their execution results. 相似文献
2.
现阶段的语义解析方法大部分都基于组合语义,这类方法的核心就是词典。词典是词汇的集合,词汇定义了自然语言句子中词语到知识库本体中谓词的映射。语义解析一直面临着词典中词汇覆盖度不够的问题。针对此问题,该文在现有工作的基础上,提出了基于桥连接的词典学习方法,该方法能够在训练中自动引入新的词汇并加以学习,为了进一步提高新学习到的词汇的准确度,该文设计了新的词语—二元谓词的特征模板,并使用基于投票机制的核心词典获取方法。该文在两个公开数据集(WebQuestions和Free917)上进行了对比实验,实验结果表明,该文方法能够学习到新的词汇,提高词汇的覆盖度,进而提升语义解析系统的性能,特别是召回率。 相似文献
3.
四川盆地上三叠统划分对比研究 总被引:36,自引:6,他引:30
四川盆地上三叠统对比长期存在混乱,给盆地整体评价带来困难。通过岩石地层、地震地层、事件地层及高分辨率旋回地层等多种方法讨论了须家河组与香溪群各岩性段的对比关系,得出了全盆地上三叠统的对比关系;指出须四段底可近似看成等时界面;须家河组下部地层自西向东、向南逐层超覆在雷口坡组之上,上部地层在盆地西北部自东南向西北方向剥蚀层位渐次变老。文章建议四川盆地上三叠统废除“香溪群”,统一使用“须家河组”,以利于对全盆地上三叠统进行油气资源整体评价与深化研究。 相似文献
4.
网络安全事件的关联分析方法的比较研究 总被引:2,自引:0,他引:2
随着当前攻击手段和技术的日益复杂化,一次入侵事件往往需要多个步骤才能完成,这些步骤都是彼此相关的。但是传统的入侵检测集中于检测底层的入侵或异常,所检测到的结果也仅仅是一次完整入侵的一部分,所以不能将不同的报警结合起来以发现入侵的逻辑步骤或者入侵背后的攻击策略。关联分析技术将不同分析器上产生的报警进行融合与关联分析,极大地减少了报警的数量,降低了入侵检测的误报率,并且适当的减少了入侵检测的漏报率。文中在对网络安全事件关联分析方法的系统结构进行分析后,着重介绍了当前比较流行的几种网络安全事件关联分析方法,最后对各种方法进行了比较研究。 相似文献
5.
6.
7.
Gabriel Wainer 《Software》2002,32(13):1261-1306
The features of a toolkit for modeling and simulation based on the DEVS formalism are presented. The tool is built as a set of independent software pieces running on different platforms. Not only are the main characteristics of the environment presented, a focus on its use is also considered by inclusion of application examples for a variety of problems. Many models can be defined in an automated fashion, simplifying the construction of new models and easing their verification. The use of this formal approach has allowed the development of safe and cost‐effective simulations, significantly reducing development time. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
8.
已往库存论中的决策模型,它是把现实过程用数学的方法进行分析,得到决策值,但不能看到决策的过程,不能反映出现实生活中的不确定性、动态性。运用Delphi 7.0和SQL server 2000对销售过程进行了动态仿真,利用Newsboy模型的推广(S,s)订购策略来监控库存并做出决策,这样就体现出此过程的不确定性、动态性;且举出了一个仿真商品销售的实例,对其中的一些关键技术,如何仿真、算法的实现等进行了阐述。 相似文献
9.
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 相似文献
10.
The parallel language FORK [1], based on a scalable shared memory model, is a PASCAL-like language with some additional parallel constructs. A PRAM (Parallel Random Access Machine) algorithm can be expressed on a high level of abstraction as a FORK program which is translated into efficient PRAM code guaranteeing theoretically predicted runtimes.
In this paper, we concentrate on those features of the language FORK related to parallelism, such as the group concept, a shared memory access and synchronous or asynchronous execution. We present a trace-based denotational interleaving semantics where processes describe synchronous computations. Processes are created or deleted dynamically and run asynchronously. Interleaving rules reflect the underlying CRCW (concurrent-read-concurrent-write) PRAM model. 相似文献