全文获取类型
收费全文 | 3058篇 |
免费 | 228篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 36篇 |
综合类 | 1篇 |
化学工业 | 745篇 |
金属工艺 | 75篇 |
机械仪表 | 122篇 |
建筑科学 | 127篇 |
矿业工程 | 2篇 |
能源动力 | 223篇 |
轻工业 | 540篇 |
水利工程 | 16篇 |
石油天然气 | 16篇 |
无线电 | 198篇 |
一般工业技术 | 578篇 |
冶金工业 | 94篇 |
原子能技术 | 19篇 |
自动化技术 | 500篇 |
出版年
2024年 | 19篇 |
2023年 | 42篇 |
2022年 | 76篇 |
2021年 | 135篇 |
2020年 | 127篇 |
2019年 | 122篇 |
2018年 | 155篇 |
2017年 | 143篇 |
2016年 | 177篇 |
2015年 | 123篇 |
2014年 | 163篇 |
2013年 | 388篇 |
2012年 | 176篇 |
2011年 | 220篇 |
2010年 | 177篇 |
2009年 | 207篇 |
2008年 | 164篇 |
2007年 | 133篇 |
2006年 | 97篇 |
2005年 | 70篇 |
2004年 | 67篇 |
2003年 | 41篇 |
2002年 | 52篇 |
2001年 | 21篇 |
2000年 | 24篇 |
1999年 | 32篇 |
1998年 | 29篇 |
1997年 | 12篇 |
1996年 | 24篇 |
1995年 | 7篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 9篇 |
1991年 | 10篇 |
1990年 | 7篇 |
1989年 | 2篇 |
1988年 | 4篇 |
1987年 | 4篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 4篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有3292条查询结果,搜索用时 312 毫秒
91.
Error-correcting codes are used to correct errors when messages are transmitted through a noisy communication channel. Bounded distance decoding (i.e. decoding up to the error-correcting capacity) is a method of correcting errors that guarantees unique decoding. Secret sharing is a cryptographic protocol that allows a secret known from a person called the dealer to be distributed to n participants. No single participant knows the secret but some special subsets of participants called coalitions can. In this paper, we present a multisecret-sharing scheme based on an error-correcting code where secret reconstruction is made by using bounded distance decoding of the code. This scheme is ideal in the sense that the size of each secret equals the size of any share. Its security improves on that of multisecret-sharing schemes. 相似文献
92.
Robotic manipulation systems suffer from two main problems in unstructured human environments: uncertainty and clutter. We introduce a planning framework addressing these two issues. The framework plans rearrangement of clutter using non-prehensile actions, such as pushing. Pushing actions are also used to manipulate object pose uncertainty. The framework uses an action library that is derived analytically from the mechanics of pushing and is provably conservative. The framework reduces the problem to one of combinatorial search, and demonstrates planning times on the order of seconds. With the extra functionality, our planner succeeds where traditional grasp planners fail, and works under high uncertainty by utilizing the funneling effect of pushing. We demonstrate our results with experiments in simulation and on HERB, a robotic platform developed at the Personal Robotics Lab at Carnegie Mellon University. 相似文献
93.
94.
Neural Computing and Applications - In this paper, we consider a system of nonlinear delay integro-differential equations with convolution kernels, which arises in biology. This problem... 相似文献
95.
96.
The Internet not only facilitates our daily activities, such as communication, entertainment and shopping but also serves as the enabling technology for many critical services, including finance, manufacturing, healthcare and transportation. On the other hand, a wide spectrum of attacks targets its communication infrastructure to disable or disrupt the network connectivity and traffic flow until recovery processes take place. Attacking all autonomous systems (ASes) in the Internet is typically beyond the capability of an adversary. Therefore, targeting a small number of ASes which results in the highest impact is the best strategy for attackers. Similarly, it is important for network practitioners to identify, fortify and secure those critical ASes to mitigate the impact of the attacks. In this study we introduce an intuitive and effective measure, IP address spatial path stress centrality, to assess and identify the critical ASes in the Internet. We compare IP address spatial path stress centrality to the three well-known and widely used centrality measures, namely customer-cone size, node degree and betweenness. We demonstrate that the proposed measure incorporates business relations and IP address spaces to achieve a better measure for identifying the critical ASes in the Internet. 相似文献
97.
98.
99.
100.