全文获取类型
收费全文 | 4509篇 |
免费 | 853篇 |
国内免费 | 851篇 |
专业分类
电工技术 | 192篇 |
综合类 | 488篇 |
化学工业 | 103篇 |
金属工艺 | 35篇 |
机械仪表 | 128篇 |
建筑科学 | 66篇 |
矿业工程 | 66篇 |
能源动力 | 30篇 |
轻工业 | 56篇 |
水利工程 | 57篇 |
石油天然气 | 68篇 |
武器工业 | 22篇 |
无线电 | 545篇 |
一般工业技术 | 120篇 |
冶金工业 | 58篇 |
原子能技术 | 15篇 |
自动化技术 | 4164篇 |
出版年
2024年 | 22篇 |
2023年 | 68篇 |
2022年 | 114篇 |
2021年 | 120篇 |
2020年 | 164篇 |
2019年 | 136篇 |
2018年 | 149篇 |
2017年 | 198篇 |
2016年 | 202篇 |
2015年 | 263篇 |
2014年 | 365篇 |
2013年 | 262篇 |
2012年 | 396篇 |
2011年 | 426篇 |
2010年 | 364篇 |
2009年 | 360篇 |
2008年 | 411篇 |
2007年 | 399篇 |
2006年 | 284篇 |
2005年 | 263篇 |
2004年 | 259篇 |
2003年 | 151篇 |
2002年 | 160篇 |
2001年 | 144篇 |
2000年 | 109篇 |
1999年 | 71篇 |
1998年 | 58篇 |
1997年 | 62篇 |
1996年 | 35篇 |
1995年 | 34篇 |
1994年 | 32篇 |
1993年 | 30篇 |
1992年 | 15篇 |
1991年 | 13篇 |
1990年 | 7篇 |
1989年 | 9篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 8篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1975年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有6213条查询结果,搜索用时 15 毫秒
1.
Somnath Karmakar 《Polycyclic Aromatic Compounds》2019,39(2):159-171
Eigensolutions of {X( = C,B,N),Y( = C,B,N)}-cyclacene graphs with next nearest neighbor (nnn) interactions have been obtained in analytical forms by adapting n-fold rotational symmetry followed by two-fold rotational symmetry (or a plane of symmetry). Expressions of eigensolution indicate the subspectral relationship among such cyclacenes with an even number of hexagonal rings e.g., eigenvalues of {X,Y}-di-cyclacene are found in the eigenspectra of all such even cyclacenes. Total π-electron energies and highest occupied molecular orbital and lowest unoccupied molecular orbital (HOMO–LUMO) gaps are calculated using the analytical expressions obtained and are found to vary negligibly with the variation of nnn interactions in such cyclacenes. Total π-electron energy is found to increase due to increase in restriction intensity of nnn interactions, whereas the HOMO–LUMO gap of polyacenecs having the even number of hexagonal rings and with one electron at each site (atom) decreases with increase in the restriction intensity since such systems contain degenerate half-filled HOMO (bonding or nonbonding) that are much more vulnerable for perturbations imposed through nnn interactions. 相似文献
2.
在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。 相似文献
3.
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 相似文献
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.
毛家河水电站库区岩溶发育特征及邻谷渗漏分析 总被引:1,自引:0,他引:1
毛家河水电站位于碳酸盐岩地区,库首距左岸邻谷可渡河14—23km、距右岸邻谷北盘江干流14.8km,水库两岸大型落水洞、溶洞及地下岩溶管道相对较为发育。为初步判断水库存在邻谷渗漏的可能性,对水库两岸可溶岩地层岩溶发育形态、特征及规律进行了勘察,并根据现场地质调查资料对3条可疑渗漏带进行了分析论证。 相似文献
7.
8.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n
2
log
n) toO(n log2
n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296. 相似文献
9.
10.
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. 相似文献