全文获取类型
收费全文 | 371篇 |
免费 | 48篇 |
国内免费 | 4篇 |
专业分类
化学 | 12篇 |
力学 | 17篇 |
综合类 | 4篇 |
数学 | 75篇 |
物理学 | 33篇 |
无线电 | 282篇 |
出版年
2025年 | 4篇 |
2024年 | 6篇 |
2023年 | 8篇 |
2022年 | 11篇 |
2021年 | 14篇 |
2020年 | 10篇 |
2019年 | 16篇 |
2018年 | 11篇 |
2017年 | 15篇 |
2016年 | 19篇 |
2015年 | 19篇 |
2014年 | 26篇 |
2013年 | 23篇 |
2012年 | 24篇 |
2011年 | 29篇 |
2010年 | 26篇 |
2009年 | 17篇 |
2008年 | 21篇 |
2007年 | 22篇 |
2006年 | 18篇 |
2005年 | 15篇 |
2004年 | 12篇 |
2003年 | 11篇 |
2002年 | 7篇 |
2001年 | 7篇 |
2000年 | 6篇 |
1999年 | 4篇 |
1998年 | 6篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1991年 | 3篇 |
1989年 | 2篇 |
1985年 | 1篇 |
1979年 | 2篇 |
排序方式: 共有423条查询结果,搜索用时 0 毫秒
41.
Ratnabali Biswas Kaushik Chowdhury Dharma P. Agrawal 《International Journal of Wireless Information Networks》2006,13(4):303-315
Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes. 相似文献
42.
43.
Internet的飞速发展要求核心路由器能够实现快速的分组转发和路由更新功能,实现这一功能的关键是路由表的组织结构和快速的路由查找算法.提出了带有转发域信息树的多分支Trie结构路由查找算法,它由固定步长的多分支Tile结构的路由表和转发域信息树两部分组成.对于一个长度为w的路由前缀,其查找、插入、删除路由的时间复杂度均为O((w-m)/n+1),其中m、n为Trie树的步长.它解决路由查找过程中快速更新的问题,具有算法简单、查找速度快、易于更新、空间利用率高、便于向IPv6过渡等优点. 相似文献
44.
Based on a study of the Broyden–Fletcher–Goldfarb–Shanno (BFGS) update Hessian formula to locate minima on a hypersurface potential energy, we present an updated Hessian formula to locate and optimize saddle points of any order that in some sense preserves the initial structure of the BFGS update formula. The performance and efficiency of this new formula is compared with the previous updated Hessian formulae such as the Powell and MSP ones. We conclude that the proposed update is quite competitive but no more efficient than the normal updates normally used in any optimization of saddle points. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 349–362, 1998 相似文献
45.
Alexander V. Mitin 《Journal of computational chemistry》1998,19(16):1877-1886
The use of the symmetric rank-one Hessian update and the Broyden–Fletcher–Goldfarb–Shano (BFGS) update formula are considered in an ab initio molecular geometry optimization algorithm. It is noted that the symmetric rank-one Hessian update has an advantage when compared with the BFGS update formula and this advantage must be more evident in the optimization of molecular geometry, because the total energy surface is a near-quadratic function with a small nonlinearity close to a minimum point. The results obtained in geometry optimization of a test group of molecules support this proposal and show that the use of the symmetric rank-one Hessian update formula permits reduction of the number of energy and gradient evaluations needed to locate a minimum on the energy surface. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1877–1886, 1998 相似文献
46.
零速修正在抑制车载惯性导航系统误差发散方面具有重要作用,普适准确的零速检测方法是实现零速修正的关键.针对传统零速检测方法在复杂环境下易受扰动、检测准确率低的问题,提出了一种改进的车载组合导航零速检测及运动约束方法.首先,归纳总结了基于速度和惯性测量装置数据的几种典型的零速检验方法,并分析了各种方法的优缺点;其次,设计了融合陀螺仪模值检验统计量和水平速度检验统计量的零速检测方案;最后,对所提方法进行了实验验证.实验结果表明,城市环境下所提方法的检测准确率为 99.222%,漏检率为 0.628%,误检率为 1.366%.相较于基于速度的零速检测方法,准确率提高了 8.000%,漏检率和误检率分别降低了 8.793%和 4.901%,速度精度平均提升了32.49%,姿态精度平均提升了 28.69%. 相似文献
47.
48.
Hierarchical Mobile IPv6 (HMIPv6) is an enhanced version of Mobile IPv6 designed to reduce signaling overhead and to support seamless handoff in IP-based wireless/mobile networks. To support more scalable services, HMIPv6 networks can be organized as the form of a multi-level hierarchy architecture (i.e., tree structure). However, since multi-level HMIPv6 networks incur additional packet processing overhead at multiple mobility agents, it is important to find the optimal hierarchy level to minimize the total cost, which consists of the location update cost and the packet delivery cost. In this paper, we investigate this problem, namely the design of an optimal multi-level HMIPv6 (OM-HMIPv6) network. To accomplish this, we design a function to represent the location update cost and the packet delivery cost in multi-level HMIPv6 networks. Based on these formulated cost functions, we calculate the optimal hierarchy level in multi-level HMIPv6 networks, in order to minimize the total cost. In addition, we investigate the effects of the session-to-mobility ratio (SMR) on the total cost and the optimal hierarchy. The numerical results, which show various relationships among the network size, optimal hierarchy, and SMR, can be utilized to design an optimal HMIPv6 network. In addition, the analytical results are validated by comprehensive simulations. Sangheon Pack received his B.S. (2000, magna cum laude) and Ph.D. (2005) degrees from Seoul National University, both in computer engineering. He is a post doctor fellow in the School of Computer Science and Engineering at the Seoul National University, Korea. He is a member of the IEEE and ACM. During 2002–2005, he was a recipient of the Korea Foundation for Advanced Studies (KFAS) Computer Science and Information Technology Scholarship. He has been also a member of Samsung Frontier Membership (SFM) from 1999. He received a student travel grant award for the IFIP Personal Wireless Conference (PWC) 2003. He was a visiting researcher to Fraunhofer FOKUS, German in 2003. His research interests include mobility management, wireless multimedia transmission, and QoS provision issues in the next-generation wireless/mobile networks. Yanghee Choi received B.S. in electronics engineering from Seoul National University, M.S. in electrical engineering from Korea advanced Institute of Science, and Doctor of Engineering in Computer Science from Ecole Nationale Superieure des Telecommunications (ENST) in Paris, in 1975, 1977 and 1984 respectively. Before joining the School of Computer Engineering, Seoul National University in 1991, he has been with Electronics and Telecommunications Research Institute (ETRI) during 1977–1991, where he served as director of Data Communication Section, and Protocol Engineering Center. He was research student at Centre National d'Etude des Telecommunications (CNET), Issy-les-Moulineaux, during 1981–1984. He was also Visiting Scientist to IBM T.J. Watson Research Center for the year 1988–1989. He is now leading the Multimedia Communications Laboratory in Seoul National University. He is also director of Computer Network Research Center in Institute of Computer Technology (ICT). He was editor-in-chief of Korea Information Science Society journals. He was chairman of the Special Interest Group on Information Networking. He has been associate dean of research affairs at Seoul National University. He was president of Open Systems and Internet Association of Korea. His research interest lies in the field of multimedia systems and high-speed networking. Minji Nam received her B.S. and M.S degrees in Computer Science and Engineering from Seoul National University in 2003 and 2005, respectively. From 2005, she has worked on Portable Internet Development Team for Korea Telecom. Her research interests are mobile networks, portable internet technology (IEEE 802.16) and Mobile IPv6. 相似文献
49.
50.