全文获取类型
收费全文 | 2304篇 |
免费 | 279篇 |
国内免费 | 179篇 |
专业分类
电工技术 | 105篇 |
综合类 | 313篇 |
化学工业 | 72篇 |
金属工艺 | 66篇 |
机械仪表 | 108篇 |
建筑科学 | 99篇 |
矿业工程 | 63篇 |
能源动力 | 58篇 |
轻工业 | 43篇 |
水利工程 | 56篇 |
石油天然气 | 23篇 |
武器工业 | 31篇 |
无线电 | 121篇 |
一般工业技术 | 166篇 |
冶金工业 | 301篇 |
原子能技术 | 6篇 |
自动化技术 | 1131篇 |
出版年
2024年 | 11篇 |
2023年 | 25篇 |
2022年 | 50篇 |
2021年 | 53篇 |
2020年 | 54篇 |
2019年 | 52篇 |
2018年 | 63篇 |
2017年 | 55篇 |
2016年 | 66篇 |
2015年 | 76篇 |
2014年 | 114篇 |
2013年 | 136篇 |
2012年 | 153篇 |
2011年 | 179篇 |
2010年 | 182篇 |
2009年 | 160篇 |
2008年 | 182篇 |
2007年 | 155篇 |
2006年 | 170篇 |
2005年 | 104篇 |
2004年 | 110篇 |
2003年 | 85篇 |
2002年 | 92篇 |
2001年 | 69篇 |
2000年 | 42篇 |
1999年 | 24篇 |
1998年 | 25篇 |
1997年 | 30篇 |
1996年 | 30篇 |
1995年 | 29篇 |
1994年 | 28篇 |
1993年 | 24篇 |
1992年 | 21篇 |
1991年 | 19篇 |
1990年 | 8篇 |
1989年 | 5篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 11篇 |
1984年 | 9篇 |
1983年 | 9篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 7篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1964年 | 2篇 |
1957年 | 2篇 |
排序方式: 共有2762条查询结果,搜索用时 15 毫秒
21.
Integrating information from multiple data sources is becoming increasingly important for enterprises that partner with other companies for e‐commerce. However, companies have their internal business applications deployed on diverse platforms and no standard solution for integrating information from these sources exists. To support business intelligence query activities, it is useful to build a data warehouse on top of middleware that aggregates the data obtained from various heterogeneous database systems. Online analytical processing (OLAP) can then be used to provide fast access to materialized views from the data warehouse. Since extensible markup language (XML) documents are a common data representation standard on the Internet and relational tables are commonly used for production data, OLAP must handle both relational and XML data. SQL and XQuery can be used to process the materialized relational and XML data cubes created from the aggregated data. This paper shows how to handle the two kinds of data cubes from a relational–XML data warehouse using extract, transformation and loading. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
22.
Gemma Robles 《Journal of Logic, Language and Information》2008,17(2):161-181
In this paper, consistency is understood in the standard way, i.e. as the absence of a contradiction. The basic constructive
logic BKc4, which is adequate to this sense of consistency in the ternary relational semantics without a set of designated points, is
defined. Then, it is shown how to define a series of logics by extending BKc4 up to minimal intuitionistic logic. All logics defined in this paper are paraconsistent logics. 相似文献
23.
Anna Bucalo 《Journal of Logic, Language and Information》1994,3(3):211-232
We present a semantic study of a family of modal intuitionistic linear systems, providing various logics with both an algebraic semantics and a relational semantics, to obtain completeness results. We call modality a unary operator on formulas which satisfies only one rale (regularity), and we consider any subsetW of a list of axioms which defines the exponential of course of linear logic. We define an algebraic semantics by interpreting the modality as a unary operation on an IL-algebra. Then we introduce a relational semantics based on pretopologies with an additional binary relationr between information states. The interpretation of is defined in a suitable way, which differs from the traditional one in classical modal logic. We prove that such models provide a complete semantics for our minimal modal system, as well as, by requiring the suitable conditions onr (in the spirit of correspondence theory), for any of its extensions axiomatized by any subsetW as above. We also prove an embedding theorem for modal IL-algebras into complete ones and, after introducing the notion of general frame, we apply it to obtain a duality between general frames and modal IL-algebras. 相似文献
24.
Given a sequenceA of lengthM and a regular expressionR of lengthP, an approximate regular expression pattern-matching algorithm computes the score of the optimal alignment betweenA and one of the sequencesB exactly matched byR. An alignment between sequencesA=a1a2 ... aM andB=b1b2... bN is a list of ordered pairs, (i1,j1), (i2j2), ..., (it,jtt) such that ik < ik+1 and jk < jk+1. In this case the alignmentaligns symbols aik and bjk, and leaves blocks of unaligned symbols, orgaps, between them. A scoring schemeS associates costs for each aligned symbol pair and each gap. The alignment's score is the sum of the associated costs, and an optimal alignment is one of minimal score. There are a variety of schemes for scoring alignments. In a concave gap penalty scoring schemeS={, w}, a function (a, b) gives the score of each aligned pair of symbolsa andb, and aconcave function w(k) gives the score of a gap of lengthk. A function w is concave if and only if it has the property that, for allk > 1, w(k + 1) –w(k) w(k) –w(k –1). In this paper we present an O(MP(logM + log2
P)) algorithm for approximate regular expression matching for an arbitrary and any concavew.
This work was supported in part by the National Institute of Health under Grant RO1 LM04960. 相似文献
25.
Valuations — morphisms from (
n
*
,·,) to ((0, ), ·, 1) — are a simple generalization of so-called Bernoulli morphisms. In this paper, we show a characterization of strongly unambiguous regular expressions with the help of valuations and formal power series. We apply these algebraic results to the determination of Hausdorff dimensions of fractals described by regular expressions. 相似文献
26.
为使关系数据库系统具备处理动态模糊数据的能力,将动态模糊理论和关系数据库理论相结合,通过分析面向动态模糊数据的关系数据库系统的功能,构造了该数据库的系统结构,探讨了实现该数据库的方法,对面向动态模糊数据的关系数据库系统做了初步的研究。 相似文献
27.
介绍组态软件iFIX在污水控制系统中的应用,提出了系统进行组态过程中的两个主要技术问题,iFIX和关系数据库的通信以及日报表的生成,并给出解决方法。 相似文献
28.
Robert Lagerström Author Vitae Pontus Johnson Author VitaeAuthor Vitae 《Journal of Systems and Software》2010,83(8):1387-1403
Enterprise architecture (EA) models can be used in order to increase the general understanding of enterprise systems and to perform various kinds of analysis. This paper presents instantiated architectural models based on a metamodel for enterprise systems modifiability analysis, i.e. for assessing the cost of making changes to enterprise-wide systems. The instantiated architectural models detailed are based on 21 software change projects conducted at four large Nordic companies. Probabilistic relational models (PRMs) are used for formalizing the EA analysis approach. PRMs enable the combination of regular entity-relationship modeling aspects with means to perform enterprise architecture analysis under uncertainty. The modifiability metamodel employed in the analysis is validated with survey and workshop data (in total 110 experts were surveyed) and with the data collected in the 21 software change projects. Validation indicates that the modifiability metamodel contains the appropriate set of elements. It also indicates that the metamodel produces estimates within a 75% accuracy in 87% of the time and has a mean accuracy of 88% (when considering projects of 2000 man-hours or more). 相似文献
29.
Defining the meaning of tabular mathematical expressions 总被引:2,自引:0,他引:2
Ying Jin 《Science of Computer Programming》2010,75(11):980-1000
Mathematical expressions in tabular form (also called “tabular expressions” or “tables”) have been shown to be useful for documenting and analysing software systems. They are usually easier to read than conventional mathematical expressions but are no less precise. They can be used wherever mathematical expressions are used. To avoid misunderstandings, and to support users with trustworthy tools, the meaning of these expressions must be fully defined.This paper presents a new method for defining the meaning of tabular expressions. Each definition of an expression type names the expression’s constituents, and provides a restriction schema and one or more evaluation schemas. The restriction schema defines the class of well-formed expressions of the type. An evaluation schema maps a well-formed tabular expression of the type to a mathematical expression of a previously defined type. Since the meaning of conventional mathematical expressions is well known, describing an equivalent expression fully defines the meaning of a tabular expression.In this approach, indexation is used to decouple the appearance of a tabular expression from its semantics. A tabular expression is an indexed set of grids; a grid is an indexed set of expressions. The expressions in a grid can be either conventional expressions or tabular expressions of a previously defined type.Defining the meaning of a tabular expression in this way facilitates the building of tools that faithfully implement the semantics. The decoupling of syntax and semantics by means of indices overcomes some limitations of older approaches.The method presented in the paper is illustrated by defining several previously known types of tabular expressions and some new ones. The use of the new model to build a suite of tools for the input, presentation, validation, evaluation, simplification, conversion and composition of tabular expressions is discussed. 相似文献
30.
Navigational features have been largely recognized as fundamental for graph database query languages. This fact has motivated several authors to propose RDF query languages with navigational capabilities. In this paper, we propose the query language nSPARQL that uses nested regular expressions to navigate RDF data. We study some of the fundamental properties of nSPARQL and nested regular expressions concerning expressiveness and complexity of evaluation. Regarding expressiveness, we show that nSPARQL is expressive enough to answer queries considering the semantics of the RDFS vocabulary by directly traversing the input graph. We also show that nesting is necessary in nSPARQL to obtain this last result, and we study the expressiveness of the combination of nested regular expressions and SPARQL operators. Regarding complexity of evaluation, we prove that given an RDF graph G and a nested regular expression E, this problem can be solved in time O(|G||E|). 相似文献