全文获取类型
收费全文 | 8069篇 |
免费 | 1434篇 |
国内免费 | 1264篇 |
专业分类
电工技术 | 1042篇 |
综合类 | 825篇 |
化学工业 | 394篇 |
金属工艺 | 123篇 |
机械仪表 | 389篇 |
建筑科学 | 197篇 |
矿业工程 | 187篇 |
能源动力 | 145篇 |
轻工业 | 263篇 |
水利工程 | 87篇 |
石油天然气 | 179篇 |
武器工业 | 85篇 |
无线电 | 1432篇 |
一般工业技术 | 535篇 |
冶金工业 | 166篇 |
原子能技术 | 656篇 |
自动化技术 | 4062篇 |
出版年
2024年 | 40篇 |
2023年 | 139篇 |
2022年 | 205篇 |
2021年 | 275篇 |
2020年 | 290篇 |
2019年 | 252篇 |
2018年 | 271篇 |
2017年 | 338篇 |
2016年 | 381篇 |
2015年 | 384篇 |
2014年 | 595篇 |
2013年 | 726篇 |
2012年 | 683篇 |
2011年 | 677篇 |
2010年 | 555篇 |
2009年 | 534篇 |
2008年 | 593篇 |
2007年 | 623篇 |
2006年 | 547篇 |
2005年 | 422篇 |
2004年 | 411篇 |
2003年 | 322篇 |
2002年 | 251篇 |
2001年 | 231篇 |
2000年 | 194篇 |
1999年 | 139篇 |
1998年 | 122篇 |
1997年 | 104篇 |
1996年 | 70篇 |
1995年 | 65篇 |
1994年 | 72篇 |
1993年 | 56篇 |
1992年 | 31篇 |
1991年 | 28篇 |
1990年 | 17篇 |
1989年 | 20篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 14篇 |
1985年 | 14篇 |
1984年 | 12篇 |
1983年 | 10篇 |
1982年 | 3篇 |
1981年 | 8篇 |
1980年 | 6篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1975年 | 1篇 |
1964年 | 1篇 |
1959年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
1.
2.
3.
针对现有海量点云可视化方法存在索引构建时间长、内存占用大等问题,研究一种八叉树索引结合OSG分页结点的快速可视化方法,可在占用较小内存的基础上快速建立点云索引并实时调度。采用八叉树索引结构对海量点云进行数据组织,建立各层级的八叉树结点并以文件映射的方式分块保存,对结点文件重组织转换为支持OSG渲染引擎的多分辨率点云数据。采用基于OSG分页结点的实时调度技术,对海量点云进行高质量可视化。与目前两款主流的点云数据处理商业软件进行实验对比分析,结果表明所提方法具有索引建立速度快、内存占用小等优点,同时可视化交互更加流畅,适用于各种配置计算机下海量点云数据的调度管理与实时可视化。 相似文献
4.
5.
在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。 相似文献
6.
7.
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 相似文献
8.
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. 相似文献
9.
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. 相似文献
10.
Masami Ikeda Susumu Fukumoto Hiroshi Takao Shinya Ohtsuka Eiichi Haginomori Masayuki Hikita 《Electrical Engineering in Japan》2002,141(4):16-24
This paper describes the dielectric breakdown characteristics of oil and oil‐impregnated paper for very fast transient (VFT) voltages. Blumlein circuits generate VFT voltages of 60 and 300 ns in a pulse width that simulates disconnecting switching surges in gas‐insulated switch gears. We measured the breakdown voltages of needle‐to‐plane, plane‐to‐plane oil gaps and several pieces of paper between plane electrodes for VFT and lightning impulse voltages. The measured data were formulated in V‐t characteristics and Weibull probability distributions. The inclination n of V‐t characteristics of insulating paper is 150, which is less than n = 13.7 of the plane‐to‐plane oil gap in the VFT time range. The shape parameters of Weibull distribution obtained in this study show that the scattering of breakdown voltages of paper is much less than that of oil. © 2002 Wiley Periodicals, Inc. Electr Eng Jpn, 141(4): 16–24, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.10043 相似文献