全文获取类型
收费全文 | 7191篇 |
免费 | 1636篇 |
国内免费 | 1616篇 |
专业分类
电工技术 | 312篇 |
综合类 | 860篇 |
化学工业 | 140篇 |
金属工艺 | 52篇 |
机械仪表 | 309篇 |
建筑科学 | 183篇 |
矿业工程 | 111篇 |
能源动力 | 92篇 |
轻工业 | 116篇 |
水利工程 | 190篇 |
石油天然气 | 89篇 |
武器工业 | 69篇 |
无线电 | 833篇 |
一般工业技术 | 316篇 |
冶金工业 | 196篇 |
原子能技术 | 24篇 |
自动化技术 | 6551篇 |
出版年
2024年 | 24篇 |
2023年 | 105篇 |
2022年 | 231篇 |
2021年 | 300篇 |
2020年 | 346篇 |
2019年 | 297篇 |
2018年 | 318篇 |
2017年 | 375篇 |
2016年 | 430篇 |
2015年 | 440篇 |
2014年 | 627篇 |
2013年 | 525篇 |
2012年 | 703篇 |
2011年 | 702篇 |
2010年 | 672篇 |
2009年 | 618篇 |
2008年 | 625篇 |
2007年 | 591篇 |
2006年 | 439篇 |
2005年 | 384篇 |
2004年 | 328篇 |
2003年 | 234篇 |
2002年 | 217篇 |
2001年 | 164篇 |
2000年 | 143篇 |
1999年 | 93篇 |
1998年 | 83篇 |
1997年 | 76篇 |
1996年 | 54篇 |
1995年 | 51篇 |
1994年 | 46篇 |
1993年 | 42篇 |
1992年 | 23篇 |
1991年 | 22篇 |
1990年 | 20篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 9篇 |
1986年 | 8篇 |
1985年 | 10篇 |
1984年 | 4篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1963年 | 4篇 |
1961年 | 2篇 |
1960年 | 5篇 |
1959年 | 6篇 |
1958年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately. 相似文献
2.
An effective practical approach that allows not only a significant reduction in the scope of practical experiments in the course of studying suspension separation processes in hydrocyclones, but also makes it possible to assess the intensity of random components of the processes and define the interrelation between such components and hydrodynamics of flows in a hydrocyclone is presented. Within the frames of the developed probabilistic‐statistical model of suspension separation in hydrocyclones on the basis of statistical self‐similarity properties, a relationship was found between determined and random components of the processes. This allowed transitioning from three‐parameter probability density functions for suspension particles in hydrocyclones to two‐parameter functions; thus significantly improving the efficiency of practical application of the developed model. 相似文献
3.
In the early design stage, automotive modeling should both meet the requirements of aesthetics and engineering. Therefore, a vehicle CAD (computer aided design) model that can be easily adjusted by feedbacks is necessary. Based on CE-Bézier surface, this paper presents a set of algorithms for parametric segmentation and fairing surface generation in a car model. This model is defined by a simplified automotive template and relevant control points, shape parameters and segmentation parameters, which can be modified to alter the car form efficiently. With this model and the corresponding adjustment method, more than fifty various vehicle models are established in this research according to different parameters. And two methods for calculating similarity index between car models are constructed, which are suitable for brand design trend analysis and modelling design decisionmaking. 相似文献
4.
掌握了理论知识并不等于有了实战经验,更不等于有实战能力。从理论到有实战能力的飞跃,只有亲临生产线,在不断解决问题过程中实现。 相似文献
5.
在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。 相似文献
6.
水锤涌浪联合试验的变态模型相似律 总被引:1,自引:0,他引:1
该文详细推导了在同一个物理模型中同时模拟调压室涌浪和压力钢管中的水锤时应满足的变态模型相似律,结果应用于电站模型试验中。 相似文献
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.
基于分层加权的多边形图形匹配 总被引:6,自引:3,他引:3
提出了一种适用凸凹多边形匹配的分层加权测度方法,在此方法中,对凹多边形、首先进行基于提取凸多边形的模式分解,对凹多边形添加辅助线,形成新的外接凸多边形、通过依次抽取外接凸多边形,将凹多边形表达为仅由凸多边形组成的多层拓扑结构,然后,利用预先定义的互为模板的相似度量准则和分层加权测度模型,计算得到多边形的相似度系数,从而实现凹多边形的匹配和检索。 相似文献