全文获取类型
收费全文 | 27703篇 |
免费 | 3523篇 |
国内免费 | 2434篇 |
专业分类
电工技术 | 3334篇 |
技术理论 | 1篇 |
综合类 | 2696篇 |
化学工业 | 1073篇 |
金属工艺 | 981篇 |
机械仪表 | 2935篇 |
建筑科学 | 964篇 |
矿业工程 | 1051篇 |
能源动力 | 538篇 |
轻工业 | 855篇 |
水利工程 | 627篇 |
石油天然气 | 1004篇 |
武器工业 | 713篇 |
无线电 | 4397篇 |
一般工业技术 | 1355篇 |
冶金工业 | 1309篇 |
原子能技术 | 125篇 |
自动化技术 | 9702篇 |
出版年
2024年 | 121篇 |
2023年 | 304篇 |
2022年 | 678篇 |
2021年 | 775篇 |
2020年 | 947篇 |
2019年 | 631篇 |
2018年 | 639篇 |
2017年 | 864篇 |
2016年 | 975篇 |
2015年 | 1206篇 |
2014年 | 2036篇 |
2013年 | 1628篇 |
2012年 | 2419篇 |
2011年 | 2344篇 |
2010年 | 1944篇 |
2009年 | 1803篇 |
2008年 | 1786篇 |
2007年 | 2087篇 |
2006年 | 1819篇 |
2005年 | 1650篇 |
2004年 | 1258篇 |
2003年 | 1161篇 |
2002年 | 903篇 |
2001年 | 778篇 |
2000年 | 598篇 |
1999年 | 469篇 |
1998年 | 353篇 |
1997年 | 305篇 |
1996年 | 225篇 |
1995年 | 183篇 |
1994年 | 171篇 |
1993年 | 100篇 |
1992年 | 94篇 |
1991年 | 73篇 |
1990年 | 53篇 |
1989年 | 54篇 |
1988年 | 45篇 |
1987年 | 19篇 |
1986年 | 24篇 |
1985年 | 20篇 |
1984年 | 24篇 |
1983年 | 24篇 |
1982年 | 15篇 |
1981年 | 9篇 |
1980年 | 5篇 |
1979年 | 10篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 8篇 |
1975年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
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.
针对自动飞行控制系统结构复杂、关联部件众多,发生故障时诊断时间长,从而影响飞机运行效率的问题,提出一种基于飞机通信寻址报告系统(ACARS)的远程实时故障诊断方案。首先,分析自动飞行控制系统的故障特点,设计搭建检测滤波器;然后,利用ACARS数据链实时发送的自动飞行控制系统的关键信息进行相关部件的残差计算,并根据残差决策算法进行故障诊断及定位;最后,针对不同故障部件残差间的差异大、决策门限无法统一的缺点,提出基于二次差值的残差决策改进算法,减缓了检测对象的整体变化趋势,降低了随机噪声和干扰的影响,避免了将瞬态故障诊断为系统故障的情况。实验仿真结果表明,基于二次差值的改进残差决策算法避免了多决策门限的复杂性,在采样时间为0.1 s的情况下,故障检测所需时间大约为2 s,故障检测时间大幅降低,有效故障检测率大于90%。 相似文献
5.
针对新闻文本领域,该文提出一种基于查询的自动文本摘要技术,更加有针对性地满足用户信息需求。根据句子的TF-IDF、与查询句的相似度等要素,计算句子权重,并根据句子指示的时间给定不同的时序权重系数,使得最近发生的新闻内容具有更高的权重,最后使用最大边界相关的方法选择摘要句。通过与基于TF-IDF、Text-Rank、LDA等六种方法的对比,该摘要方法ROUGE评测指标上优于其他方法。从结合评测结果及摘要示例可以看出,该文提出的方法可以有效地从新闻文档集中摘取核心信息,满足用户查询内容的信息需求。 相似文献
6.
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. 相似文献
7.
H.C. Weigele L. Gygax A. Steiner B. Wechsler J.-B. Burla 《Journal of dairy science》2018,101(3):2370-2382
Lameness is one of the most prevalent diseases affecting the welfare of cows in modern dairy production. Lameness leads to behavioral changes in severely lame cows, which have been investigated in much detail. For early detection of lameness, knowledge of the effects of moderate lameness on cow behavior is crucial. Therefore, the behavior of nonlame and moderately lame cows was compared on 17 Swiss dairy farms. On each farm, 5 to 11 nonlame (locomotion score 1 of 5) and 2 to 7 moderately lame (locomotion score 3 of 5) cows were selected for data collection in two 48-h periods (A, B) separated by an interval of 6 to 10 wk. Based on visual locomotion scoring, 142 nonlame and 66 moderately lame cows were examined in period A and 128 nonlame and 53 moderately lame cows in period B. Between these 2 periods, the cows underwent corrective hoof trimming. Lying behavior, locomotor activity, and neck activity were recorded by accelerometers (MSR145 data logger, MSR Electronics GmbH, Seuzach, Switzerland), and feeding and rumination behaviors by noseband sensors (RumiWatch halter, ITIN + HOCH GmbH, Liestal, Switzerland). Furthermore, visits to the brush and the concentrate feeder, and the milking order position were recorded. In comparison with nonlame cows, moderately lame cows had a longer lying duration, a longer average lying bout duration, and a greater lateral asymmetry in lying duration. Average locomotor activity, locomotor activity during 1 h after feed delivery or push-ups, and average neck activity were lower in moderately lame cows. Eating time and the number of eating chews (jaw movements) were reduced in moderately lame compared with nonlame cows, whereas no effect of moderate lameness was evident for ruminating time, number of ruminating chews and boluses, and average number of ruminating chews per bolus. Moderately lame cows visited the concentrate feeder and the brush less frequently, and they were further back in the milking order compared with nonlame cows. In conclusion, nonlame and moderately lame cows differed in a biologically relevant way in many of the behavioral variables investigated in this study. Therefore, the use of these behavioral changes seems to be promising to develop a tool for early lameness detection. 相似文献
8.
分析了冶炼烟气制酸工艺的特点,介绍了由PROFIBUS-DP现场总线构建的冶炼厂烟气制酸监控系统,详细介绍了其硬件配置及相应的软件设计。 相似文献
9.
10.
Paul Feautrier 《International journal of parallel programming》2006,34(5):459-487
Scheduling a program (i.e. constructing a timetable for the execution of its operations) is one of the most powerful methods
for automatic parallelization. A schedule gives a blueprint for constructing a synchronous program, suitable for an ASIC or
VLIW processor. However, constructing a schedule entails solving a large linear program. Even if one accepts the (experimental)
fact that the Simplex is almost always polynomial, the scheduling time is of the order of a large power of the program size.
Hence, the method does not scale well. The present paper proposes two methods for improving the situation. First, a large
program can be divided into smaller units (processes), which can be scheduled separately. This is structured scheduling. Second, one can use projection methods for solving linear programs incrementally. This is specially efficient if the dependence
graph is sparse. 相似文献