首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   22268篇
  免费   3791篇
  国内免费   2367篇
电工技术   7031篇
技术理论   2篇
综合类   2095篇
化学工业   356篇
金属工艺   246篇
机械仪表   834篇
建筑科学   921篇
矿业工程   255篇
能源动力   810篇
轻工业   117篇
水利工程   454篇
石油天然气   252篇
武器工业   213篇
无线电   2314篇
一般工业技术   1162篇
冶金工业   401篇
原子能技术   126篇
自动化技术   10837篇
  2024年   147篇
  2023年   369篇
  2022年   657篇
  2021年   796篇
  2020年   882篇
  2019年   719篇
  2018年   703篇
  2017年   944篇
  2016年   1007篇
  2015年   1198篇
  2014年   1893篇
  2013年   1680篇
  2012年   2096篇
  2011年   2277篇
  2010年   1740篇
  2009年   1779篇
  2008年   1752篇
  2007年   1804篇
  2006年   1387篇
  2005年   1081篇
  2004年   794篇
  2003年   546篇
  2002年   400篇
  2001年   340篇
  2000年   290篇
  1999年   197篇
  1998年   161篇
  1997年   131篇
  1996年   95篇
  1995年   100篇
  1994年   77篇
  1993年   61篇
  1992年   42篇
  1991年   44篇
  1990年   29篇
  1989年   28篇
  1988年   32篇
  1987年   17篇
  1986年   12篇
  1985年   11篇
  1984年   9篇
  1983年   14篇
  1982年   15篇
  1981年   13篇
  1980年   12篇
  1979年   6篇
  1978年   7篇
  1977年   6篇
  1976年   6篇
  1975年   7篇
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
1.
In this paper, an off‐grid direction of arrival (DoA) estimation method is proposed for wideband signals. This method is based on the sparse representation (SR) of the array covariance matrix. Similar to the time domain DoA estimation methods, the correlation function of the sources was assumed to be the same and known. A new measurement vector is obtained using the lower‐left triangular elements of the covariance matrix. The DoAs are estimated by quantizing the entire range of continuous angle space into discrete grid points. However, the exact DoAs may be located between two grid points; therefore, this estimation has errors. The accuracy of DoA estimation is improved by the minimization of the difference between the new measurement vector and its estimated values. Simulation results revealed that the proposed method can enhance the DoA estimation accuracy of wideband signals.  相似文献   
2.
3.
4.
5.
In this article we illustrate a methodology for building cross-language search engine. A synergistic approach between thesaurus-based approach and corpus-based approach is proposed. First, a bilingual ontology thesaurus is designed with respect to two languages: English and Spanish, where a simple bilingual listing of terms, phrases, concepts, and subconcepts is built. Second, term vector translation is used – a statistical multilingual text retrieval techniques that maps statistical information about term use between languages (Ontology co-learning). These techniques map sets of t f id f term weights from one language to another. We also applied a query translation method to retrieve multilingual documents with an expansion technique for phrasal translation. Finally, we present our findings.  相似文献   
6.
金鑫城  孙浩睿 《发电技术》2020,41(2):137-205
泛在电力物联网是物联网在电力领域的具体体现,建设泛在电力物联网是推进"三型两网"建设的关键环节,也是实现能源转型的必要手段。阐述了泛在电力物联网的定义,从供电公司角度出发,根据北京经济技术开发区实际情况,讨论了依托地区特点的泛在电力物联网实施策略和实际应用场景,分析了可能遇到的问题。得出结论:随着泛在电力物联网的深入建设,供电公司能够为电力客户提供多元化服务,提高客户满意度;地市供电公司能够依托泛在电力物联网开展更多电力相关业务;泛在电力物联网的安全性、实用性、有效性是发展面临的首要问题。  相似文献   
7.
ABSTRACT

In this paper, we review some algebraic control system. Precisely, linear and bilinear systems on Euclidean spaces and invariant and linear systems on Lie groups. The fourth classes of systems have a common issue: to any class, there exists an associated subgroup. From this object, we survey the controllability property. Especially, from those coming from our contribution to the theory.  相似文献   
8.
The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.  相似文献   
9.
The identification of the Hammerstein–Wiener (H-W) systems based on the nonuniform input–output dataset remains a challenging problem. This article studies the identification problem of a periodically nonuniformly sampled-data H-W system. In addition, the product terms of the parameters in the H-W system are inevitable. In order to solve the problem, the key-term separation is applied and two algorithms are proposed. One is the key-term-based forgetting factor stochastic gradient (KT-FFSG) algorithm based on the gradient search. The other is the key-term-based hierarchical forgetting factor stochastic gradient (KT-HFFSG) algorithm. Compared with the KT-FFSG algorithm, the KT-HFFSG algorithm gives more accurate estimates. The simulation results indicate that the proposed algorithms are effective.  相似文献   
10.
The architectural choices underlying Linked Data have led to a compendium of data sources which contain both duplicated and fragmented information on a large number of domains. One way to enable non-experts users to access this data compendium is to provide keyword search frameworks that can capitalize on the inherent characteristics of Linked Data. Developing such systems is challenging for three main reasons. First, resources across different datasets or even within the same dataset can be homonyms. Second, different datasets employ heterogeneous schemas and each one may only contain a part of the answer for a certain user query. Finally, constructing a federated formal query from keywords across different datasets requires exploiting links between the different datasets on both the schema and instance levels. We present Sina, a scalable keyword search system that can answer user queries by transforming user-supplied keywords or natural-languages queries into conjunctive SPARQL queries over a set of interlinked data sources. Sina uses a hidden Markov model to determine the most suitable resources for a user-supplied query from different datasets. Moreover, our framework is able to construct federated queries by using the disambiguated resources and leveraging the link structure underlying the datasets to query. We evaluate Sina over three different datasets. We can answer 25 queries from the QALD-1 correctly. Moreover, we perform as well as the best question answering system from the QALD-3 competition by answering 32 questions correctly while also being able to answer queries on distributed sources. We study the runtime of SINA in its mono-core and parallel implementations and draw preliminary conclusions on the scalability of keyword search on Linked Data.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号