首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   100810篇
  免费   12952篇
  国内免费   6971篇
电工技术   8400篇
技术理论   2篇
综合类   10053篇
化学工业   13811篇
金属工艺   6461篇
机械仪表   7016篇
建筑科学   7855篇
矿业工程   3731篇
能源动力   2725篇
轻工业   11145篇
水利工程   2990篇
石油天然气   3837篇
武器工业   1353篇
无线电   11150篇
一般工业技术   9390篇
冶金工业   4169篇
原子能技术   1722篇
自动化技术   14923篇
  2024年   1257篇
  2023年   2007篇
  2022年   4261篇
  2021年   5352篇
  2020年   3976篇
  2019年   2860篇
  2018年   3187篇
  2017年   3547篇
  2016年   3124篇
  2015年   4731篇
  2014年   6050篇
  2013年   7063篇
  2012年   8347篇
  2011年   8600篇
  2010年   8099篇
  2009年   7541篇
  2008年   7570篇
  2007年   7194篇
  2006年   6020篇
  2005年   4862篇
  2004年   3529篇
  2003年   2416篇
  2002年   2217篇
  2001年   1837篇
  2000年   1603篇
  1999年   988篇
  1998年   445篇
  1997年   411篇
  1996年   360篇
  1995年   286篇
  1994年   214篇
  1993年   164篇
  1992年   126篇
  1991年   95篇
  1990年   62篇
  1989年   81篇
  1988年   50篇
  1987年   25篇
  1986年   24篇
  1985年   7篇
  1984年   18篇
  1983年   11篇
  1982年   5篇
  1981年   16篇
  1980年   30篇
  1979年   14篇
  1977年   2篇
  1976年   1篇
  1959年   33篇
  1951年   15篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
Batch Nearest Neighbor Search for Video Retrieval   总被引:2,自引:0,他引:2  
To retrieve similar videos to a query clip from a large database, each video is often represented by a sequence of high- dimensional feature vectors. Typically, given a query video containing m feature vectors, an independent nearest neighbor (NN) search for each feature vector is often first performed. After completing all the NN searches, an overall similarity is then computed, i.e., a single content-based video retrieval usually involves m individual NN searches. Since normally nearby feature vectors in a video are similar, a large number of expensive random disk accesses are expected to repeatedly occur, which crucially affects the overall query performance. Batch nearest neighbor (BNN) search is stated as a batch operation that performs a number of individual NN searches. This paper presents a novel approach towards efficient high-dimensional BNN search called dynamic query ordering (DQO) for advanced optimizations of both I/O and CPU costs. Observing the overlapped candidates (or search space) of a pervious query may help to further reduce the candidate sets of subsequent queries, DQO aims at progressively finding a query order such that the common candidates among queries are fully utilized to maximally reduce the total number of candidates. Modelling the candidate set relationship of queries by a candidate overlapping graph (COG), DQO iteratively selects the next query to be executed based on its estimated pruning power to the rest of queries with the dynamically updated COG. Extensive experiments are conducted on real video datasets and show the significance of our BNN query processing strategy.  相似文献   
92.
To deal with the problem of insufficient labeled data in video object classification, one solution is to utilize additional pairwise constraints that indicate the relationship between two examples, i.e., whether these examples belong to the same class or not. In this paper, we propose a discriminative learning approach which can incorporate pairwise constraints into a conventional margin-based learning framework. Different from previous work that usually attempts to learn better distance metrics or estimate the underlying data distribution, the proposed approach can directly model the decision boundary and, thus, require fewer model assumptions. Moreover, the proposed approach can handle both labeled data and pairwise constraints in a unified framework. In this work, we investigate two families of pairwise loss functions, namely, convex and nonconvex pairwise loss functions, and then derive three pairwise learning algorithms by plugging in the hinge loss and the logistic loss functions. The proposed learning algorithms were evaluated using a people identification task on two surveillance video data sets. The experiments demonstrated that the proposed pairwise learning algorithms considerably outperform the baseline classifiers using only labeled data and two other pairwise learning algorithms with the same amount of pairwise constraints.  相似文献   
93.
介绍ADSL传输技术使用情况及与ISDN等的比较。  相似文献   
94.
露天磷矿选矿厂采用合理的配矿方案,对稳定入选磷矿的品位,增加选矿产率,降低生产成本有着重要的意义.为了提高入选磷矿石品位的均匀性和稳定性,提出了针对以入选磷矿品位为目标的从采矿场配矿到精矿仓配矿的整个生产环节的配矿方法.将采场内原矿、选矿厂原矿矿堆和选矿厂精矿仓均定义为矿堆,按照生产实际需求设定其属性.通过设定目标函数,实现使采矿场的开采原矿量最大,配矿方案总的运输距离最小,运输成本最低等目标.同时建立约束条件,使采矿场的开采原矿量要保证选矿厂正常生产,使每一矿堆的品位达到目标要求.最后,采集企业生产实际数据对模型加以验证,证明模型在指导露天磷矿山的生产过程中有重要的实际意义,配矿过程应成为矿山生产组织、管理的一个重要环节.  相似文献   
95.
A zeolite (ZFA) was synthesized from coal fly ash and then modified using hexadecyltrimethylammonium. The surfactant modified ZFA (SMZFA) was evaluated for its versatility to sequester multiple classes of pollutants from water. The target pollutants include ionic inorganic pollutants (ammonium and phosphate), ionic organic pollutants (methylene blue and humic acid), ionizable organic pollutants (bisphenol A,-chlorophenol and phenol, with different pKa), and electrically neutral or-ganic pollutants (aniline, nitrobenzene, and naphthalene, with different hydrophobicity). The SMZFA showed high potential for the retention of ammonium and phosphate, being comparable with ZFA. While the negative charge in the internal pores of zeolite was responsible for the retention of ammonium, the oxides of CaO, Al2O3and Fe2O3in the non-zeolite fraction, which originated from coal fly ash but received modification during zeolite synthesis, accounted for the removal of phosphate. Results also showed that while ZFA had little affinity for humic acid, the ionizable, and the electrically neutral organic compounds, SMZFA exhibited greatly enhanced adsorption capacity. Thus, the surfactant modified external surface, which formed a bilayer micelle of zeolite, imparts a hydrophobic characteristic that enables the uptake of the organic pollutants. We showed that SMZFA is a promising versatile sorbent for water treatment.  相似文献   
96.
2010~2011年度引水与往年比较,献县至十二孔闸段引水流量损失较大。本文主要分析了引起本次引水流量损失较大的可能因素,并提出了相应的解决方法,以提高引水效率,减少引水成本。  相似文献   
97.
During the past decade, many efforts have been made to use palmprints as a biometric modality. However, most of the existing palmprint recognition systems are based on encoding and matching creases, which are not as reliable as ridges. This affects the use of palmprints in large-scale person identification applications where the biometric modality needs to be distinctive as well as insensitive to changes in age and skin conditions. Recently, several ridge-based palmprint matching algorithms have been proposed to fill the gap. Major contributions of these systems include reliable orientation field estimation in the presence of creases and the use of multiple features in matching, while the matching algorithms adopted in these systems simply follow the matching algorithms for fingerprints. However, palmprints differ from fingerprints in several aspects: 1) Palmprints are much larger and thus contain a large number of minutiae, 2) palms are more deformable than fingertips, and 3) the quality and discrimination power of different regions in palmprints vary significantly. As a result, these matchers are unable to appropriately handle the distortion and noise, despite heavy computational cost. Motivated by the matching strategies of human palmprint experts, we developed a novel palmprint recognition system. The main contributions are as follows: 1) Statistics of major features in palmprints are quantitatively studied, 2) a segment-based matching and fusion algorithm is proposed to deal with the skin distortion and the varying discrimination power of different palmprint regions, and 3) to reduce the computational complexity, an orientation field-based registration algorithm is designed for registering the palmprints into the same coordinate system before matching and a cascade filter is built to reject the nonmated gallery palmprints in early stage. The proposed matcher is tested by matching 840 query palmprints against a gallery set of 13,736 palmprints. Experimental results show that the proposed matcher outperforms the existing matchers a lot both in matching accuracy and speed.  相似文献   
98.
Recent years have witnessed the growing popularity of sensor and sensor-network technologies, supporting important practical applications. One of the fundamental issues is how to accurately locate a user with few labeled data in a wireless sensor network, where a major difficulty arises from the need to label large quantities of user location data, which in turn requires knowledge about the locations of signal transmitters or access points. To solve this problem, we have developed a novel machine learning-based approach that combines collaborative filtering with graph-based semi-supervised learning to learn both mobile users' locations and the locations of access points. Our framework exploits both labeled and unlabeled data from mobile devices and access points. In our two-phase solution, we first build a manifold-based model from a batch of labeled and unlabeled data in an offline training phase and then use a weighted k-nearest-neighbor method to localize a mobile client in an online localization phase. We extend the two-phase colocalization to an online and incremental model that can deal with labeled and unlabeled data that come sequentially and adapt to environmental changes. Finally, we embed an action model to the framework such that additional kinds of sensor signals can be utilized to further boost the performance of mobile tracking. Compared to other state-of-the-art systems, our framework has been shown to be more accurate while requiring less calibration effort in our experiments performed on three different testbeds.  相似文献   
99.
在现代控制理论的基础上,根据火力发电厂单元机组的结构,结合各个参数之间的动态关系,在前人研究成果的基础上,给出了一种普遍意义下火电单元机组数学模型的参数估计方法,并试着给出对其数学模型平衡点的分析方法,最后以实例证明了此方法的可靠性与实用性.  相似文献   
100.
This paper concerns the problem of designing a modified repetitive-control system for a class of strictly proper plants. Repetitive control involves two types of actions: control and learning; but the insertion of a low-pass filter in a modified repetitive controller, which is employed to guarantee the stability of the system, mixes the two actions together. In this paper, a continuous–discrete two-dimensional model is first constructed. Next, the continuity of repetitive control and Lyapunov stability theory are applied to the model to establish two linear-matrix-inequality (LMI) based sufficient stability conditions, one for the design of the cutoff angular frequency and one for the design of the feedback gains. The features of these conditions are exploited to develop an iterative algorithm that searches for the best combination of the maximum cutoff angular frequency of the low-pass filter and the feedback gains. A numerical example illustrates the design procedure and demonstrates the validity of the method.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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