全文获取类型
收费全文 | 14268篇 |
免费 | 2457篇 |
国内免费 | 1860篇 |
专业分类
电工技术 | 955篇 |
综合类 | 1446篇 |
化学工业 | 391篇 |
金属工艺 | 339篇 |
机械仪表 | 1263篇 |
建筑科学 | 222篇 |
矿业工程 | 338篇 |
能源动力 | 261篇 |
轻工业 | 218篇 |
水利工程 | 106篇 |
石油天然气 | 879篇 |
武器工业 | 884篇 |
无线电 | 2818篇 |
一般工业技术 | 864篇 |
冶金工业 | 286篇 |
原子能技术 | 61篇 |
自动化技术 | 7254篇 |
出版年
2024年 | 91篇 |
2023年 | 273篇 |
2022年 | 541篇 |
2021年 | 537篇 |
2020年 | 595篇 |
2019年 | 528篇 |
2018年 | 493篇 |
2017年 | 629篇 |
2016年 | 716篇 |
2015年 | 813篇 |
2014年 | 1064篇 |
2013年 | 966篇 |
2012年 | 1194篇 |
2011年 | 1172篇 |
2010年 | 1024篇 |
2009年 | 1020篇 |
2008年 | 999篇 |
2007年 | 1030篇 |
2006年 | 855篇 |
2005年 | 722篇 |
2004年 | 555篇 |
2003年 | 531篇 |
2002年 | 398篇 |
2001年 | 340篇 |
2000年 | 280篇 |
1999年 | 234篇 |
1998年 | 198篇 |
1997年 | 169篇 |
1996年 | 99篇 |
1995年 | 95篇 |
1994年 | 87篇 |
1993年 | 59篇 |
1992年 | 45篇 |
1991年 | 32篇 |
1990年 | 40篇 |
1989年 | 26篇 |
1988年 | 18篇 |
1987年 | 5篇 |
1986年 | 12篇 |
1985年 | 13篇 |
1984年 | 16篇 |
1983年 | 17篇 |
1982年 | 10篇 |
1981年 | 9篇 |
1980年 | 3篇 |
1979年 | 8篇 |
1978年 | 7篇 |
1977年 | 4篇 |
1976年 | 7篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
Aggregate question answering essentially returns answers for given questions by obtaining query graphs with unique dependencies between values and corresponding objects. Word order dependency, as the key to uniquely identify dependency of the query graph, reflects the dependencies between the words in the question. However, due to the semantic gap caused by the expression difference between questions encoded with word vectors and query graphs represented with logical formal elements, it is not trivial to match the correct query graph for the question. Most existing approaches design more expressive query graphs for complex questions and rank them just by directly calculating their similarities, ignoring the semantic gap between them. In this paper, we propose a novel Structure-sensitive Semantic Matching(SSM) approach that learns aligned representations of dependencies in questions and query graphs to eliminate their gap. First, we propose a cross-structure matching module to bridge the gap between two modalities(i.e., textual question and query graph). Then, we propose an entropy-based gated AQG filter to remove the structural noise caused by the uncertainty of dependencies. Finally, we present a two-channel query graph representation that fuses the semantics of abstract structure and grounding content of the query graph explicitly. Experimental results show that SSM could learn aligned representations of questions and query graphs to eliminate the gaps between their dependencies, and improves up to 12% (F1 score) on aggregation questions of two benchmark datasets. 相似文献
2.
3.
A method is proposed to generate categorical colour observer functions (individual colour matching functions) for any field size based on the CIE 2006 system of physiological observer functions. The method combines proposed categorical observer techniques of Sarkar et al with a physiologically-based individual observer model of Asano et al and a clustering technique to produce the optimal set of categorical observers. The number of required categorical observers varies depending on an application with as many as 50 required to predict individual observers' matches when a laser projector is viewed. However, 10 categorical observers are sufficient to represent colour-normal populations for personalized colour imaging. The proposed and recommended categorical observers represent a robust and inclusive technique to examine and quantify observer metamerism in any application of colorimetry. 相似文献
4.
Fundamental Evaluation of Power Supply and Rectifiers for Wireless Power Transfer Using Magnetic Resonant Coupling 下载免费PDF全文
This paper provides a fundamental analysis of a power supply and rectifiers for wireless power transfer using magnetic resonant coupling (MRC). MRC enables efficient wireless power transfer over middle‐range transfer distances. MRC for wireless power transfer should operate at a high frequency in the industry science medical band, such as 13.56 MHz, because the size of the transfer device decreases at higher transfer frequencies. Therefore, the output frequency of the power supply on the transmitting side should be 13.56 MHz. In addition, the rectifier on the receiving side is operated at a high frequency. This paper focuses on the reflected power in the power supply and rectifiers. Thus, the parametric design method is clarified for the power supply, including a low‐pass filter to match the output, the impedance of the power supply with the characteristic impedance of the transmission line. In addition, the effects on the rectifiers of silicon carbide and gallium nitride diodes are confirmed by performing an experiment and a loss analysis. 相似文献
5.
为解决共享交通下的共乘用户群体发现效率低、准确率不高问题,依据R-树原理建立GeoOD-Tree索引,并在此基础上提出以最大化共乘率为目标的群体发现策略。首先,对原始时空轨迹数据进行特征提取与标定处理,挖掘有效出行起讫点(OD)轨迹;其次,针对用户起讫点轨迹的特征,建立GeoOD-Tree索引进行有效的存储管理;最后,给出以最大化共乘行程为目标的群体发现模型,并运用K最近邻(KNN)查询对搜索空间剪枝压缩,提高群体发现效率。采用西安市近12000辆出租车营运轨迹数据,选取动态时间规整(DTW)等典型算法与所提算法在查询效率与准确率上进行性能对比分析。与DTW算法相比,所提算法的准确率提高了10.12%,查询效率提高了约15倍。实验结果表明提出的群体发现策略能有效提高共乘用户群体发现的准确率和效率,可有效提升共乘出行方式的出行率。 相似文献
6.
AbstractModel order reduction is a common practice to reduce large order systems so that their simulation and control become easy. Nonlinearity aware trajectory piecewise linear is a variation of trajectory piecewise linearization technique of order reduction that is used to reduce nonlinear systems. With this scheme, the reduced approximation of the system is generated by weighted sum of the linearized and reduced sub-models obtained at certain linearization points on the system trajectory. This scheme uses dynamically inspired weight assignment that makes the approximation nonlinearity aware. Just as weight assignment, the process of linearization points selection is also important for generating faithful approximations. This article uses a global maximum error controller based linearization points selection scheme according to which a state is chosen as a linearization point if the error between a current reduced model and the full order nonlinear system reaches a maximum value. A combination that not only selects linearization points based on an error controller but also assigns dynamic inspired weights is shown in this article. The proposed scheme generates approximations with higher accuracies. This is demonstrated by applying the proposed method to some benchmark nonlinear circuits including RC ladder network and inverter chain circuit and comparing the results with the conventional schemes. 相似文献
7.
针对跨数据中心的资源调度问题,提出了一种基于组合双向拍卖(PCDA)的资源调度方案。首先,将云资源拍卖分为三个部分:云用户代理报价、云资源提供商要价、拍卖代理组织拍卖;其次,在定义用户的优先级及任务紧迫度的基础上,在拍卖过程中估算每一个工作发生的服务等级协议(SLA)违规并以此计算云提供商的收益,同时每轮竞拍允许成交多项交易;最终达到根据用户等级合理分配云资源调度的效果。仿真实验结果表明该算法保证了竞拍成功率,与传统一次拍卖成交一项的组合双向拍卖方案相比,PCDA在竞拍时间段产生的能耗降低了35.00%,拍卖云提供商的利润提高了约38.84%。 相似文献
8.
A new matching cost computation method based on nonsubsampled contourlet transform (NSCT) for stereo image matching is proposed in this paper. Firstly, stereo image is decomposed into high frequency sub-band images at different scales and along different directions by NSCT. Secondly, by utilizing coefficients in high frequency domain and grayscales in RGB color space, the computation model of weighted matching cost between two pixels is designed based on the gestalt laws. Lastly, two types of experiments are carried out with standard stereopairs in the Middlebury benchmark. One of the experiments is to confirm optimum values of NSCT scale and direction parameters, and the other is to compare proposed matching cost with nine known matching costs. Experimental results show that the optimum values of scale and direction parameters are respectively 2 and 3, and the matching accuracy of the proposed matching cost is twice higher than that of traditional NCC cost. 相似文献
9.
针对现有的基于局部特征的图像匹配算法对光照变化敏感、匹配正确率低等问题,提出一种具有光照鲁棒性的图像匹配算法。首先使用实时对比保留去色(RTCP)算法灰度化图像,然后利用对比拉伸函数模拟不同光照变换对图像的影响从而提取抗光照变换特征点,最后采用局部强度顺序模式建立特征点描述符,根据待匹配图像局部特征点描述符的欧氏距离判断是否为成对匹配点。在公开数据集上,所提算法与尺度不变特征变换(SIFT)算法、加速鲁棒特征(SURF)算法、"风"(KAZE)算法和ORB算法在匹配速度和匹配正确率上进行了对比实验。实验结果表明:随着图像亮度差异的增加,SIFT算法、SURF算法、"风"(KAZE)算法和ORB算法匹配正确率下降迅速,所提算法下降缓慢并且正确率均高于80%;所提算法特征点检测较慢和描述符维数较高,平均耗时为23.47 s,匹配速度不及另外四种算法,但匹配质量却远超过它们。对实时性要求不高的系统中,所提算法可以克服光照变化对图像匹配造成的影响。 相似文献
10.