全文获取类型
收费全文 | 2872篇 |
免费 | 97篇 |
国内免费 | 94篇 |
专业分类
电工技术 | 86篇 |
综合类 | 85篇 |
化学工业 | 200篇 |
金属工艺 | 101篇 |
机械仪表 | 177篇 |
建筑科学 | 156篇 |
矿业工程 | 212篇 |
能源动力 | 344篇 |
轻工业 | 58篇 |
水利工程 | 25篇 |
石油天然气 | 42篇 |
武器工业 | 20篇 |
无线电 | 124篇 |
一般工业技术 | 130篇 |
冶金工业 | 101篇 |
原子能技术 | 18篇 |
自动化技术 | 1184篇 |
出版年
2024年 | 1篇 |
2023年 | 28篇 |
2022年 | 35篇 |
2021年 | 38篇 |
2020年 | 50篇 |
2019年 | 41篇 |
2018年 | 33篇 |
2017年 | 65篇 |
2016年 | 72篇 |
2015年 | 95篇 |
2014年 | 128篇 |
2013年 | 124篇 |
2012年 | 140篇 |
2011年 | 226篇 |
2010年 | 193篇 |
2009年 | 170篇 |
2008年 | 188篇 |
2007年 | 208篇 |
2006年 | 173篇 |
2005年 | 137篇 |
2004年 | 143篇 |
2003年 | 118篇 |
2002年 | 101篇 |
2001年 | 86篇 |
2000年 | 94篇 |
1999年 | 68篇 |
1998年 | 60篇 |
1997年 | 34篇 |
1996年 | 35篇 |
1995年 | 45篇 |
1994年 | 26篇 |
1993年 | 18篇 |
1992年 | 19篇 |
1991年 | 15篇 |
1990年 | 16篇 |
1989年 | 8篇 |
1988年 | 7篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1978年 | 3篇 |
1977年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有3063条查询结果,搜索用时 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.
Recommendation systems aim to recommend items or packages of items that are likely to be of interest to users. Previous work on recommendation systems has mostly focused on recommending points of interest (POI), to identify and suggest top-k items or packages that meet selection criteria and satisfy compatibility constraints on items in a package, where the (packages of) items are ranked by their usefulness to the users. As opposed to prior work, this paper investigates two issues beyond POI recommendation that are also important to recommendation systems. When there exist no sufficiently many POI that can be recommended, we propose (1) query relaxation recommendation to help users revise their selection criteria, or (2) adjustment recommendation to guide recommendation systems to modify their item collections, such that the users׳ requirements can be satisfied.We study two related problems, to decide (1) whether the query expressing the selection criteria can be relaxed to a limited extent, and (2) whether we can update a bounded number of items, such that the users can get desired recommendations. We establish the upper and lower bounds of these problems, all matching, for both combined and data complexity, when selection criteria and compatibility constraints are expressed in a variety of query languages, for both item recommendation and package recommendation. To understand where the complexity comes from, we also study the impact of variable sizes of packages, compatibility constraints and selection criteria on the analyses of these problems. Our results indicate that in most cases the complexity bounds of query relaxation and adjustment recommendation are comparable to their counterparts of the basic recommendation problem for testing whether a given set of (resp. packages of) items makes top-k items (resp. packages). In other words, extending recommendation systems with the query relaxation and adjustment recommendation functionalities typically does not incur extra overhead. 相似文献
3.
在分析单一MU(Most Uncertainty)采样缺陷的基础上,提出一种"全局最优搜寻"方法 GOS(Global Optimal Search),并结合MU共同完成查询选择。GOS+MU方法中,GOS着眼全局寻找目标,在应用环境能提供的训练样本数量有限、分类器受训不充分时,该方法选择的对象学习价值高,能快速推进分类器学习进程;MU则能够在GOS采样失效情形下,利用分类器当前训练成果,选择查询不确定性最强的样本补充训练集。通过对网络商品的用户评论进行分类仿真,并比较其他采样学习方法的效果,证明了GOS+MU方法在压缩学习成本、提高训练效率方面的有效性。 相似文献
4.
Professional search in patent repositories poses several unique challenges. One key requirement is to search the entire affected space of concepts, following well-defined procedures to ensure traceability of results obtained. Several techniques have been introduced to enhance query generation, preferably via automated query term expansion, to improve retrieval effectiveness. Currently, these approaches are mostly limited to computing additional query terms from patent documents based on statistical measures. For conceptual search to solve the limitation of traditional keyword search standard dictionaries are used to provide synonyms and keyword phrases for query refinement. Studies show that these are insufficient in such highly specialized domains. In this paper, we present an approach to extract keyword phrases from query logs created during the validation procedure of the patent applications. This creates valuable domain-specific lexical databases for several specific patent classes that can be used to both expand as well as limit the scope of a patent search. This provides a more powerful means to guide a professional searcher through the search process. We evaluate the lexical databases based on real query sessions of patent examiners. 相似文献
5.
6.
The present study is an investigation on the behaviors of concrete-filled thin-walled steel tubular members subjected to combined loading, such as compression and torsion, bending and torsion, compression, bending and torsion. ABAQUS software is used in this paper for the finite element analysis (FEA). A comparison of results calculated using this modeling shows generally good agreement with test results. The FEA modeling is then used to investigate the influence of important parameters that determine the ultimate strength of the composite members under combined loading, such as compression and torsion, bending and torsion, compression, bending and torsion. The parametric studies provide information for the development of formulae for calculating the ultimate strength of the composite members subjected to combined loading. 相似文献
7.
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in terms of the resource one is interested in) is polynomial in the syntactic distance between the initial and the target concept, but only polylogarithmic in the number of variables in the universe. We give an efficient revision algorithm in the model of learning with equivalence and membership queries for threshold functions, and some negative results showing, for instance, that threshold functions cannot be revised efficiently from either type of query alone. The algorithms work in a general revision model where both deletion and addition type revision operators are allowed. 相似文献
8.
Here, we describe the development of a reacting flow multi-species/combustion methodology, implemented as an extension to the differential reduced ejector analysis (DREA) computer program [Mathematical and computer modeling, vol. 31, 2000, p. 21; Appl. Math. Model. 25 (2001) 427; Comput. Math. Appl. 43(10–11); NASA Contractor Report, 1998]. Use of the single fluid IVP solver framework that was developed for the original DREA model has been directly coupled into the combustion formulation. With these modifications, the analysis has an elementary single step reaction Fuel+Oxidizer→Product combustion capability. Though approximate in nature, the simplicity and efficiency of the DREA formulation make it suitable for its original niche, namely design and preliminary design environments where more complex and expensive models may be inappropriate. 相似文献
9.
This paper presents the main current theoretical issues in Information Retrieval. The principles of conceptual modelling, as they have emerged in the database area, are presented and their application to document modelling in order to enhance document retrieval is discussed. Finally, the main features of the MULTOS project are presented and critically reviewed confronting them with the requirements which have been identified during the general discussion on document conceptual modelling for information retrieval. 相似文献
10.
张合新 《导弹与航天运载技术》1998,(6):17-24
研究了一种中制导段采用雷达修正的遥控制导方式和末制导段采用捷联式自寻的导引头的自导引制导方式的捷联式复合制导的中远程战术导弹的导航滤波问题,考虑到目标的大机动性和模型的非线性,基于最佳估计理论中的广义卡尔曼滤波理论,建立了通用导航滤波方程,仿真计算与仿真结果表明所做设计是合理和有效的。 相似文献