全文获取类型
收费全文 | 22843篇 |
免费 | 1758篇 |
国内免费 | 777篇 |
专业分类
电工技术 | 1233篇 |
技术理论 | 3篇 |
综合类 | 1334篇 |
化学工业 | 4066篇 |
金属工艺 | 1110篇 |
机械仪表 | 1383篇 |
建筑科学 | 1822篇 |
矿业工程 | 487篇 |
能源动力 | 605篇 |
轻工业 | 1589篇 |
水利工程 | 399篇 |
石油天然气 | 1179篇 |
武器工业 | 173篇 |
无线电 | 2401篇 |
一般工业技术 | 3302篇 |
冶金工业 | 1236篇 |
原子能技术 | 304篇 |
自动化技术 | 2752篇 |
出版年
2024年 | 91篇 |
2023年 | 334篇 |
2022年 | 580篇 |
2021年 | 736篇 |
2020年 | 615篇 |
2019年 | 533篇 |
2018年 | 550篇 |
2017年 | 670篇 |
2016年 | 603篇 |
2015年 | 815篇 |
2014年 | 991篇 |
2013年 | 1209篇 |
2012年 | 1285篇 |
2011年 | 1390篇 |
2010年 | 1194篇 |
2009年 | 1140篇 |
2008年 | 1220篇 |
2007年 | 1140篇 |
2006年 | 1220篇 |
2005年 | 1175篇 |
2004年 | 744篇 |
2003年 | 718篇 |
2002年 | 644篇 |
2001年 | 554篇 |
2000年 | 708篇 |
1999年 | 764篇 |
1998年 | 659篇 |
1997年 | 569篇 |
1996年 | 505篇 |
1995年 | 473篇 |
1994年 | 339篇 |
1993年 | 254篇 |
1992年 | 214篇 |
1991年 | 172篇 |
1990年 | 135篇 |
1989年 | 120篇 |
1988年 | 90篇 |
1987年 | 45篇 |
1986年 | 48篇 |
1985年 | 43篇 |
1984年 | 18篇 |
1983年 | 5篇 |
1982年 | 14篇 |
1981年 | 13篇 |
1980年 | 12篇 |
1979年 | 6篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1970年 | 3篇 |
1951年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
92.
A study of dislocation configurations in superconducting oxide BiSrCaCuO has been made by transmission electron microscopy. Evidence was found for the presence of dislocation pairs composed of two parallel single dislocations holding together with the same Burgers vectors. The pair can further dissociate into partials, giving rise to a four-fold ribbon. Networks consisting of dislocation pairs were also observed. These phenomena are attributed to the possible ordering of strontium and calcium ions and the existence of some oxygen sheet of the Aurivillius type in the oxide crystal. Schemes to illustrate the configurations are suggested and discussed. 相似文献
93.
首先本文介绍了开发富客户端应用程序的RIA技术,然后对当前一种可用的RIA技术—XUL的各方面特性以及由它实现富客户端的途径做了深入探讨,最后通过一个项目实例-订单管理系统演示了基于XUL开发富客户端应用程序的一种实现。 相似文献
94.
立体书是一种独特的纸张艺术形式,有着精细的几何结构.针对一类特殊的V型立体纸雕进行了系统性的研究,给出了V型立体纸雕可实现性的充分条件,使其可以只借助2张支撑面的力量进行打开和关闭,同时在这个过程中所有的面片都保持刚性并且相互不产生自交.基于这些充分条件,文中分别实现了一个计算机辅助交互V型纸雕设计工具,以及一个基于体方法的自动生成算法. 相似文献
95.
In group assessment, the focus is on finding high‐authority experts to improve the reliability of assessment results. In this study, we propose an authority updating algorithm while considering the power and judgement reliability of an expert on the basis of social networks and post‐evaluations. A network power index is established and used to reflect the power of an expert while considering social networks. The measurement of the judgement reliability of an expert considers the post‐evaluation of the objects selected by experts, thereby more scientifically reflecting the reliability of experts. The analysis shows the following: although the social‐network structure influences the authority of experts, the influence weakens when the assessment group is a highly or even fully connected group; the network effect may increase the authority of some experts and reduce that of others, and it will weaken as the network connectivity increases; moreover, the judgement reliability and authority of an expert while considering post‐evaluation can encourage him/her to make fair assessments and strive to reduce his/her motivation and cognitive biases. 相似文献
96.
Gu Min Gu Yanhui Luo Weilan Xu Guandong Yang Zhenglu Zhou Junsheng Qu Weiguang 《Neural computing & applications》2021,33(11):6009-6025
Neural Computing and Applications - Semantic understanding is an essential research issue for many applications, such as social network analysis, collective intelligence and content computing,... 相似文献
97.
Guoqiang Gao Ruixuan Li Kunmei Wen Xiwu Gu 《Journal of Network and Computer Applications》2012,35(1):85-96
Unstructured peer-to-peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. The search efficiency problem in unstructured P2P networks has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve search efficiency for rare objects. It uses an object-probing technique for peers to decide whether or not to establish replications for their objects when they join the network. This strategy can effectively increase the popularity of rare objects in order to enhance search efficiency. We also present a rare object search algorithm to reduce the overhead caused by the replication strategy. When a peer forwards a search request, the forward probability is calculated according to its neighbors' degrees and the number of neighbors' objects. Therefore, the search request is forwarded to the peers more likely containing target objects. Simulations show that our proactive replication strategy greatly improves search efficiency for rare objects with moderate communication overhead. The rare object search algorithm not only improves search efficiency for rare objects, but also achieves load balance in search. 相似文献
98.
Fuzzy local maximal marginal embedding for feature extraction 总被引:1,自引:0,他引:1
Cairong Zhao Zhihui Lai Chuancai Liu Xingjian Gu Jianjun Qian 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(1):77-87
In graph-based linear dimensionality reduction algorithms, it is crucial to construct a neighbor graph that can correctly
reflect the relationship between samples. This paper presents an improved algorithm called fuzzy local maximal marginal embedding
(FLMME) for linear dimensionality reduction. Significantly differing from the existing graph-based algorithms is that two
novel fuzzy gradual graphs are constructed in FLMME, which help to pull the near neighbor samples in same class nearer and
nearer and repel the far neighbor samples of margin between different classes farther and farther when they are projected
to feature subspace. Through the fuzzy gradual graphs, FLMME algorithm has lower sensitivities to the sample variations caused
by varying illumination, expression, viewing conditions and shapes. The proposed FLMME algorithm is evaluated through experiments
by using the WINE database, the Yale and ORL face image databases and the USPS handwriting digital databases. The results
show that the FLMME outperforms PCA, LDA, LPP and local maximal marginal embedding. 相似文献
99.
This paper presents the following results on sets that are complete for NP.
- If there is a problem in NP that requires $2^{n^{\Omega(1)}}$ time at almost all lengths, then every many-one NP-complete set is complete under length-increasing reductions that are computed by polynomial-size circuits.
- If there is a problem in co-NP that cannot be solved by polynomial-size nondeterministic circuits, then every many-one NP-complete set is complete under length-increasing reductions that are computed by polynomial-size circuits.
- If there exist a one-way permutation that is secure against subexponential-size circuits and there is a hard tally language in NP??co-NP, then there is a Turing complete language for NP that is not many-one complete.
100.
Qishi Wu Mengxia Zhu Yi Gu Patrick Brown Xukang Lu Wuyin Lin Yangang Liu 《Journal of Grid Computing》2012,10(3):367-393
Next-generation scientific applications feature complex workflows comprised of many computing modules with intricate inter-module dependencies. Supporting such scientific workflows in wide-area networks especially Grids and optimizing their performance are crucial to the success of collaborative scientific discovery. We develop a Scientific Workflow Automation and Management Platform (SWAMP), which enables scientists to conveniently assemble, execute, monitor, control, and steer computing workflows in distributed environments via a unified web-based user interface. The SWAMP architecture is built entirely on a seamless composition of web services: the functionalities of its own are provided and its interactions with other tools or systems are enabled through web services for easy access over standard Internet protocols while being independent of different platforms and programming languages. SWAMP also incorporates a class of efficient workflow mapping schemes to achieve optimal end-to-end performance based on rigorous performance modeling and algorithm design. The performance superiority of SWAMP over existing workflow mapping schemes is justified by extensive simulations, and the system efficacy is illustrated by large-scale experiments on real-life scientific workflows for climate modeling through effective system implementation, deployment, and testing on the Open Science Grid. 相似文献