全文获取类型
收费全文 | 9769篇 |
免费 | 934篇 |
国内免费 | 779篇 |
专业分类
电工技术 | 1171篇 |
技术理论 | 3篇 |
综合类 | 987篇 |
化学工业 | 189篇 |
金属工艺 | 156篇 |
机械仪表 | 567篇 |
建筑科学 | 232篇 |
矿业工程 | 133篇 |
能源动力 | 176篇 |
轻工业 | 102篇 |
水利工程 | 62篇 |
石油天然气 | 110篇 |
武器工业 | 93篇 |
无线电 | 1530篇 |
一般工业技术 | 441篇 |
冶金工业 | 121篇 |
原子能技术 | 66篇 |
自动化技术 | 5343篇 |
出版年
2024年 | 31篇 |
2023年 | 71篇 |
2022年 | 96篇 |
2021年 | 136篇 |
2020年 | 172篇 |
2019年 | 187篇 |
2018年 | 153篇 |
2017年 | 200篇 |
2016年 | 249篇 |
2015年 | 315篇 |
2014年 | 527篇 |
2013年 | 568篇 |
2012年 | 572篇 |
2011年 | 682篇 |
2010年 | 508篇 |
2009年 | 599篇 |
2008年 | 662篇 |
2007年 | 741篇 |
2006年 | 693篇 |
2005年 | 633篇 |
2004年 | 523篇 |
2003年 | 445篇 |
2002年 | 385篇 |
2001年 | 358篇 |
2000年 | 303篇 |
1999年 | 275篇 |
1998年 | 225篇 |
1997年 | 222篇 |
1996年 | 188篇 |
1995年 | 156篇 |
1994年 | 145篇 |
1993年 | 102篇 |
1992年 | 85篇 |
1991年 | 70篇 |
1990年 | 37篇 |
1989年 | 36篇 |
1988年 | 24篇 |
1987年 | 18篇 |
1986年 | 21篇 |
1985年 | 17篇 |
1984年 | 9篇 |
1983年 | 15篇 |
1982年 | 8篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1973年 | 2篇 |
1957年 | 2篇 |
1951年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
31.
32.
在综述目前广泛研究的智能终端模式的基础上,提出了一种新的基于智能终端和面向服务体系结构的移动MIS基础平台。该平台基于智能客户端技术和元数据业务模型,可以实现移动公办与后台管理信息系统的结合。详细阐述了移动MIS基础平台的设计、实现及其优点。 相似文献
33.
Because the oceanaut plays a significant role in safety and capability during manned deep-diving scientific tasks, preventing oceanaut performance decline is of paramount importance. However, the factors responsible for oceanaut performance are almost entirely unexplored. To address the preceding issues, a quantitative method of fuzzy integrated Bayesian network (FIBN) was modeled within the limits of oceanaut operating procedures. To quantify the probabilities of the influencing factors, the probability of each node in the FIBN was calculated using integrated expert judgement, fuzzy logic theory, and Bayesian network. By considering a total of 28 factors related to oceanaut performance in the “Jiaolong” manned submersible, this study found that difficult sampling, long sampling times, cabin equipment failure, oceanaut physical decline, and declining decision-making ability are important factors that affect oceanaut performance. The FIBN proposed in our study fused the qualitative and quantitative methods and can be developed into a versatile tool for analysis of comprehensive systems that contain both static and dynamic factors.Relevance to industryThe results provide a powerful basis for the design of manned submersible and assignment of tasks to oceanauts, while the fuzzy integrated Bayesian network (FIBN) method proposed can be effectively applied to various quantitative assessment fields which direct researchers to deal with analysis problems of complex systems. 相似文献
34.
The Constraint Logic Programming Scheme defines a class of languages designed for programming with constraints using a logic programming approach. These languages are soundly based on a unified framework of formal semantics. In particular, as an instance of this scheme with real arithmetic constraints, the CLP() language facilitates and encourages a concise and declarative style of programming for problems involving a mix of numeric and non-numeric computation.In this paper we illustrate the practical applicability of CLP() with examples of programs to solve electrical engineering problems. This field is particularly rich in problems that are complex and largely numeric, enabling us to demonstrate a number of the unique features of CLP(). A detailed look at some of the more important programming techniques highlights the ability of CLP() to support well-known, powerful techniques from constraint programming. Our thesis is that CLP() is an embodiment of these techniques in a language that is more general, elegant and versatile than the earlier languages, and yet is practical.An earlier version of this paper appeared in the proceedings of the 4th International Conference on Logic Programming, Melbourne, May 1987. Much of this work was carried out while the authors were at Monash University, Melbourne, Australia. 相似文献
35.
Certain tasks, such as formal program development and theorem proving, fundamentally rely upon the manipulation of higher-order objects such as functions and predicates. Computing tools intended to assist in performing these tasks are at present inadequate in both the amount of knowledge they contain (i.e., the level of support they provide) and in their ability to learn (i.e., their capacity to enhance that support over time). The application of a relevant machine learning technique—explanation-based generalization (EBG)—has thus far been limited to first-order problem representations. We extend EBG to generalize higher-order values, thereby enabling its application to higher-order problem encodings.Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out. First-order Horn logics (e.g., Prolog) are not, however, well suited to higher-order applications. Instead, we employ Prolog, a higher-order logic programming language, as our basic framework for realizing higher-order EBG. In order to capture the distinction between domain theory and training instance upon which EBG relies, we extend Prolog with the necessity operator of modal logic. We develop a meta-interpreter realizing EBG for the extended language, Prolog, and provide examples of higher-order EBG. 相似文献
36.
A paradigm of scientific discovery is defined within a first-order logical framework. Within this paradigm, the concept of successful scientific inquiry is formalized and investigated. Among other results, it is shown that a simple method of scientific inquiry is universal in the sense that it leads to success on every problem for which success is in principle possible. 相似文献
37.
Kosta Došen 《Journal of Logic, Language and Information》1992,1(3):173-201
The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are.However, though we do not always have the deduction theorem, we may always obtain a modal analogue of the deduction theorem for conservative modal extensions of the basic systems. Modal postulates which are necessary and sufficient for that are postulates of S4 plus modal postulates which mimic structural rules. For example, the modal postulates which Girard has recently considered in linear logic are necessary and sufficient for the modal analogue of the deduction theorem.All this may lead towards results about functional completeness in categories. When functional completeness, which is analogous to the deduction theorem, fails, we may perhaps envisage a modal analogue of functional completeness in a modal category, of which our original category is a full subcategory. 相似文献
38.
39.
James F. Lynch 《Computational Complexity》1992,2(1):40-66
For every nondeterministic Turing machineM of time complexityT(n), there is a second-order sentence of a very restricted form, whose set of finite models encodes the set of strings recognized byM. Specifically, has a relational symbol which is interpreted as addition restricted to finite segments of the natural numbers, and a prefix consisting of existentially quantified unary second-order variables followed by a universal-existential first-order part. Here, every input stringx is encoded by a model of sizeT(|x|). Using a closely related encoding of strings as models where the size of the model is the length of the string, a consequence is that ifT(n)=n
d, then there is a sentence with a similar prefix but whose second-order variables ared-ary and whose finite models encode the strings accepted byM. Potential applications to low-level complexity are discussed. 相似文献
40.
将形式本体理论应用于UML语言的改进是UML的形式化研究的主要方法之一,其中On-toUML是一个概念上完整、语义上清晰和更具本体意义的UML版本。虽然OntoUML基于本体对UML进行了扩充,提供了更为丰富,更能表达现实世界语义的建模原语,但其表达方式不利于在信息系统的设计与开发中应用。本文基于描述逻辑对OntoUML中的关键建模原语及其关系给出了SHIQ形式化表示方法,并进行了实例研究。该方法表达精练、语义清晰,不仅能够表达逻辑清晰的模型,而且保证模型能够正确反映领域事实。这种形式化方法为信息系统概念建模方法提供了理论和应用支撑,在一定程度上推动了OntoUML更为广泛的应用。 相似文献