全文获取类型
收费全文 | 3321篇 |
免费 | 518篇 |
国内免费 | 542篇 |
专业分类
电工技术 | 64篇 |
综合类 | 296篇 |
化学工业 | 38篇 |
金属工艺 | 23篇 |
机械仪表 | 95篇 |
建筑科学 | 31篇 |
矿业工程 | 31篇 |
能源动力 | 14篇 |
轻工业 | 17篇 |
水利工程 | 17篇 |
石油天然气 | 17篇 |
武器工业 | 9篇 |
无线电 | 329篇 |
一般工业技术 | 83篇 |
冶金工业 | 17篇 |
原子能技术 | 8篇 |
自动化技术 | 3292篇 |
出版年
2024年 | 14篇 |
2023年 | 34篇 |
2022年 | 63篇 |
2021年 | 61篇 |
2020年 | 79篇 |
2019年 | 59篇 |
2018年 | 75篇 |
2017年 | 110篇 |
2016年 | 108篇 |
2015年 | 166篇 |
2014年 | 228篇 |
2013年 | 191篇 |
2012年 | 269篇 |
2011年 | 318篇 |
2010年 | 241篇 |
2009年 | 264篇 |
2008年 | 315篇 |
2007年 | 282篇 |
2006年 | 221篇 |
2005年 | 193篇 |
2004年 | 207篇 |
2003年 | 135篇 |
2002年 | 125篇 |
2001年 | 119篇 |
2000年 | 84篇 |
1999年 | 57篇 |
1998年 | 61篇 |
1997年 | 56篇 |
1996年 | 38篇 |
1995年 | 32篇 |
1994年 | 42篇 |
1993年 | 33篇 |
1992年 | 16篇 |
1991年 | 14篇 |
1990年 | 9篇 |
1989年 | 12篇 |
1988年 | 7篇 |
1987年 | 6篇 |
1986年 | 10篇 |
1985年 | 11篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1975年 | 1篇 |
1964年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有4381条查询结果,搜索用时 15 毫秒
1.
在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。 相似文献
2.
An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods.
Recommended by: Patrick Valduriez 相似文献
3.
4.
Dimitris Papadias M.Sc. Ph.D. candidate Timos Sellis Ph.D. 《The VLDB Journal The International Journal on Very Large Data Bases》1994,3(4):479-516
Various relation-based systems, concerned with the qualitative representation and processing of spatial knowledge, have been developed in numerous application domains. In this article, we identify the common concepts underlying qualitative spatial knowledge representation, we compare the representational properties of the different systems, and we outline the computational tasks involved in relation-based spatial information processing. We also describesymbolic spatial indexes, relation-based structures that combine several ideas in spatial knowledge representation. A symbolic spatial index is an array that preserves only a set of spatial relations among distinct objects in an image, called the modeling space; the index array discards information, such as shape and size of objects, and irrelevant spatial relations. The construction of a symbolic spatial index from an input image can be thought of as a transformation that keeps only a set of representative points needed to define the relations of the modeling space. By keeping the relative arrangements of the representative points in symbolic spatial indexes and discarding all other points, we maintain enough information to answer queries regarding the spatial relations of the modeling space without the need to access the initial image or an object database. Symbolic spatial indexes can be used to solve problems involving route planning, composition of spatial relations, and update operations. 相似文献
5.
Wesley W. Chu Ph.D. Ion T. leong Ph.D. Ricky K. Taira Ph.D. 《The VLDB Journal The International Journal on Very Large Data Bases》1994,3(4):445-477
We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach. 相似文献
6.
7.
This research investigates and approach to query processing in a multidatabase system that uses an objectoriented model to capture the semantics of other data models. The object-oriented model is used to construct a global schema, defining an integrated view of the different schemas in the environment. The model is also used as a self-describing model to build a meta-database for storing information about the global schema. A unique aspect of this work is that the object-oriented model is used to describe the different data models of the multidatabase environment, thereby extending the meta database with semantic information about the local schemas. With the global and local schemas all represented in an object-oriented form, structural mappings between the global schema and each local schema are then easily supported. An object algebra then provides a query language for expressing global queries, using the structural mappings to translate object algebra queries into SQL queries over local relational schema. The advantage of using an object algebra is that the object-oriented database can be viewed as a blackboard for temporary storage of local data and for establishing relationships between different databases. The object algebra can be used to directly retrieve temporarily-stored data from the object-oriented database or to transparently retrieve data from local sources using the translation process described in this paper. 相似文献
8.
Structured document storage and refined declarative and navigational access mechanisms in HyperStorM 总被引:2,自引:0,他引:2
Klemens Böhm Karl Aberer Erich J. Neuhold Xiaoya Yang 《The VLDB Journal The International Journal on Very Large Data Bases》1997,6(4):296-311
The combination of SGML and database technology allows to refine both declarative and navigational access mechanisms for
structured document collection: with regard to declarative access, the user can formulate complex information needs without
knowing a query language, the respective document type definition (DTD) or the underlying modelling. Navigational access is
eased by hyperlink-rendition mechanisms going beyond plain link-integrity checking. With our approach, the database-internal
representation of documents is configurable. It allows for an efficient implementation of operations, because DTD knowledge
is not needed for document structure recognition. We show how the number of method invocations and the cost of parsing can
be significantly reduced.
Edited by Y.C. Tay. Received April 22, 1996 / Accepted March 16, 1997 相似文献
9.
G. Dong 《Annals of Mathematics and Artificial Intelligence》1993,7(1-4):107-127
LDL is one of the recently proposed logical query languages, which incorporate set, for data and knowledge base systems. Since LDL programs can simulate negation, they are not monotonic in general. On the other hand, there are monotonic LDL programs. This paper addresses the natural question of “When are the generally nonmonotonic LDL programs monotonic?” and investigates related topics such as useful applications for monotonicity. We discuss four kinds of monotonicity, and examine two of them in depth. The first of the two, called “ω-monotonicity”, is shown to be undecidable even when limited to single-stratum programs. The second, called “uniform monotonicity”, is shown to implyω-monotonicity. We characterize the uniform monotonicity of a program (i) by a relationship between its Bancilhon-Khoshafian semantics and its LDL semantics, and (ii) with a useful property called subset completion independence. Characterization (ii) implies that uniformly monotonie programs can be evaluated more efficiently by discarding dominated facts. Finally, we provide some necessary and/or sufficient, syntactic conditions for uniform monotonicity. The conditions pinpoint (a) enumerated set terms, (b) negations of membership and inclusion, and (c) sharing of set terms as the main source for nonuniform monotonicity. 相似文献
10.
适于复杂信息融合系统的近似联合概率数据关联算法 总被引:2,自引:0,他引:2
文中在B.Zhou提出的直接概率计算(DC)和近似概率计算(AC)算法基础上提出了一种新的近似多传感器多目标联合概率数据关联算法。近似概率法是以一个目标为中心的近似聚为构造互联事件的起点,并在计算中将DC和AC结合得到的一种全邻的点迹—航迹关联算法,它能有效地提高目标点迹—航迹的关联正确率,在计算时耗上较完全联合概率法快得多,能满足工程中实时性的要求。将其在杂波下目标密集、航迹复杂的数据融合系统中进行实验,对关联正确率,关联耗时等与最近邻法进行了比较,效果较好。 相似文献