全文获取类型
收费全文 | 13135篇 |
免费 | 1208篇 |
国内免费 | 650篇 |
专业分类
电工技术 | 921篇 |
技术理论 | 2篇 |
综合类 | 988篇 |
化学工业 | 2002篇 |
金属工艺 | 733篇 |
机械仪表 | 763篇 |
建筑科学 | 1010篇 |
矿业工程 | 364篇 |
能源动力 | 453篇 |
轻工业 | 1111篇 |
水利工程 | 269篇 |
石油天然气 | 612篇 |
武器工业 | 139篇 |
无线电 | 1528篇 |
一般工业技术 | 1587篇 |
冶金工业 | 712篇 |
原子能技术 | 109篇 |
自动化技术 | 1690篇 |
出版年
2024年 | 68篇 |
2023年 | 212篇 |
2022年 | 467篇 |
2021年 | 593篇 |
2020年 | 470篇 |
2019年 | 396篇 |
2018年 | 411篇 |
2017年 | 495篇 |
2016年 | 468篇 |
2015年 | 560篇 |
2014年 | 695篇 |
2013年 | 776篇 |
2012年 | 930篇 |
2011年 | 908篇 |
2010年 | 811篇 |
2009年 | 823篇 |
2008年 | 734篇 |
2007年 | 704篇 |
2006年 | 644篇 |
2005年 | 520篇 |
2004年 | 446篇 |
2003年 | 385篇 |
2002年 | 492篇 |
2001年 | 418篇 |
2000年 | 315篇 |
1999年 | 260篇 |
1998年 | 198篇 |
1997年 | 144篇 |
1996年 | 143篇 |
1995年 | 119篇 |
1994年 | 114篇 |
1993年 | 69篇 |
1992年 | 28篇 |
1991年 | 36篇 |
1990年 | 26篇 |
1989年 | 28篇 |
1988年 | 13篇 |
1987年 | 12篇 |
1986年 | 11篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1982年 | 8篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1975年 | 5篇 |
1969年 | 3篇 |
1951年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
151.
152.
153.
Ming Hua Jian Pei Xuemin Lin 《The VLDB Journal The International Journal on Very Large Data Bases》2011,20(1):129-153
Uncertain data is inherent in a few important applications. It is far from trivial to extend ranking queries (also known as top-k queries), a popular type of queries on certain data, to uncertain data. In this paper, we cast ranking queries on uncertain data using three parameters: rank threshold k, probability threshold p, and answer set size threshold l. Systematically, we identify four types of ranking queries on uncertain data. First, a probability threshold top-k query computes the uncertain records taking a probability of at least p to be in the top-k list. Second, a top-(k, l) query returns the top-l uncertain records whose probabilities of being ranked among top-k are the largest. Third, the p-rank of an uncertain record is the smallest number k such that the record takes a probability of at least p to be ranked in the top-k list. A rank threshold top-k query retrieves the records whose p-ranks are at most k. Last, a top-(p, l) query returns the top-l uncertain records with the smallest p-ranks. To answer such ranking queries, we present an efficient exact algorithm, a fast sampling algorithm, and a Poisson approximation-based algorithm. To answer top-(k, l) queries and top-(p, l) queries, we propose PRist+, a compact index. An efficient index construction algorithm and efficacious query answering methods are developed for PRist+. An empirical study using real and synthetic data sets verifies the effectiveness of the probabilistic ranking queries and the efficiency of our methods. 相似文献
154.
Dual-key-binding cancelable palmprint cryptosystem for palmprint protection and information security
Biometric cryptosystems and cancelable biometrics are both practical and promising schemes to enhance the security and privacy of biometric systems. Though a number of bio-crypto algorithms have been proposed, they have limited practical applicability because they lack of cancelability. Since biometrics are immutable, the users whose biometrics are stolen cannot use bio-crypto systems anymore. Cancelable biometric schemes are of cancelability; however, they are difficult to compromise the conflicts between the security and performance. By embedded a novel cancelable palmprint template, namely “two dimensional (2D) Palmprint Phasor”, the proposed palmprint cryptosystem overcomes the lack of cancelability in existing biometric cryptosystems. Besides, the authentication performance is enhanced when users have different tokens/keys. Furthermore, we develop a novel dual-key-binding cancelable palmprint cryptosystem to enhance the security and privacy of palmprint biometric. 2D Palmprint Phasor template is scrambled by the scrambling transformation based on the chaotic sequence that is generated by both the user's token/key and strong key extracted from palmprint. Dual-key-binding scrambling not only has more robustness to resist against chosen plain text attack, but also enhances the secure requirement of non-invertibility. 2D Palmprint Phasor algorithm and dual-key-binding scrambling both increase the difficulty of adversary's statistical analysis. The experimental results and security analysis confirm the efficiency of the proposed scheme. 相似文献
155.
This paper develops a mesh-free numerical method for solving PDEs, based on integrated radial basis function networks (IRBFNs) with adaptive residual subsampling training scheme. The multiquadratic function is chosen as the transfer function of the neurons. The nonlinear algebraic equation systems for weights training are solved by Levenberg–Marquardt algorithm. The performance of the proposed method is demonstrated in numerical examples by approximating several functions and solving nonlinear PDEs. The result of numerical experiments shows that the IRBFNs with the adaptive procedure requires less neurons to attain the desired accuracy than conventional radial basis function networks. 相似文献
156.
节点定位是无线传感网络的研究基础,具有重要的研究价值和研究意义.现有定位算法主要分为测距相关的算法(range-based)与测距无关的算法(range-free)两类.前者通常使用未经处理的、包含环境噪声的测距信号,导致其定位稳定性较差;后者常使用节点间的连通性信息,导致其定位精度相对较低.针对该现状,本文提出一种基于模糊处理的节点自适应定位算法(fuzzy localization, FL).FL算法首先收集有关测距信息,然后对测距信息进行模糊化处理,最后采用自适应算法计算节点位置.FL算法对测距信息的模糊化处理,减少了环境噪声对定位的影响,提高了节点定位的稳定性;同时细化了通讯半径内的距离估计,提高了节点的定位精度;且自适应算法能对模糊化过程进行自适应控制,取得有效模糊化参数.实验结果表明,与DV-Hop算法和Spring算法相比,FL算法减少了约31%和6%的定位误差,且定位稳定性较好. 相似文献
157.
数据收集是无线传感网络研究的关键问题,是诸多无线传感网络应用的基础.降低数据聚集的延迟是数据聚集研究中的重点问题.现有的面向延迟的数据聚集算法,多是通过在树型网络结构上设计无冲突的节点调度算法,来降低数据聚集的延迟,没有考虑到无线网络数据易丢失的特性,不能达到期望的延迟效果.本文针对上述问题,提出一种采用任意播(anycast)方式的机会数据收集算法(OA算法).该算法利用机会传输(opportunistic transmission)的思想,用任意播方式传输数据,通过减少数据聚集中重传数据包的数目,来降低数据聚集的延迟.实验表明,与SPT(Shortest path tree)上的数据聚集延迟相比,该方法的发包数目减少了15%,延迟降低了10%. 相似文献
158.
A Bayesian approach to variable selection which is based on the expected Kullback-Leibler divergence between the full model and its projection onto a submodel has recently been suggested in the literature. For generalized linear models an extension of this idea is proposed by considering projections onto subspaces defined via some form of L1 constraint on the parameter in the full model. This leads to Bayesian model selection approaches related to the lasso. In the posterior distribution of the projection there is positive probability that some components are exactly zero and the posterior distribution on the model space induced by the projection allows exploration of model uncertainty. Use of the approach in structured variable selection problems such as ANOVA models is also considered, where it is desired to incorporate main effects in the presence of interactions. Projections related to the non-negative garotte are able to respect the hierarchical constraints. A consistency result is given concerning the posterior distribution on the model induced by the projection, showing that for some projections related to the adaptive lasso and non-negative garotte the posterior distribution concentrates on the true model asymptotically. 相似文献
159.
基于FPGA的新型高速CCD图像数据采集系统 总被引:3,自引:1,他引:2
介绍一种基于Actel公司Fusion StartKit FPGA的线阵CCD图像数据采集系统。以FPGA作为图像数据的控制和处理核心,通过采用高速A/D、异步FIFO、UART以及电平转换、放大滤波、二值化电路和光学系统实现对图像数据的信号处理,并运用Visual Studio C++和Microsoft公司的基本类库MFC实现对采集数据的显示、绘图、传输控制等。利用搭建的系统平台实现对物体尺寸的测量,通过对所得的数据进行分析处理,明确测量的精度和可以达到的水平。对该系统在实时监控中的优点进行分析。 相似文献
160.