全文获取类型
收费全文 | 178篇 |
免费 | 3篇 |
国内免费 | 4篇 |
专业分类
综合类 | 5篇 |
化学工业 | 7篇 |
金属工艺 | 1篇 |
机械仪表 | 9篇 |
建筑科学 | 2篇 |
能源动力 | 6篇 |
轻工业 | 2篇 |
水利工程 | 1篇 |
武器工业 | 1篇 |
无线电 | 12篇 |
一般工业技术 | 7篇 |
原子能技术 | 6篇 |
自动化技术 | 126篇 |
出版年
2022年 | 1篇 |
2020年 | 1篇 |
2019年 | 3篇 |
2018年 | 5篇 |
2017年 | 4篇 |
2016年 | 3篇 |
2015年 | 4篇 |
2014年 | 7篇 |
2013年 | 11篇 |
2012年 | 9篇 |
2011年 | 23篇 |
2010年 | 17篇 |
2009年 | 14篇 |
2008年 | 12篇 |
2007年 | 10篇 |
2006年 | 18篇 |
2005年 | 13篇 |
2004年 | 6篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1982年 | 1篇 |
排序方式: 共有185条查询结果,搜索用时 312 毫秒
91.
92.
无结构P2P网络搜索方法及其改进 总被引:14,自引:1,他引:13
对等(P2P)计算是未来网络中的关键技术,对等网络是实现下一代互联网的重要组成部分。如何高效地搜索P2P网络上的资源是P2P网络实现的最为关键的问题。在讲述对等网络的基本搜索方法的基础上,分析了许多改进的搜索方法,包括基于转发的改进方法、基于缓存的改进方法和基于覆盖网拓扑优化的改进方法。 相似文献
93.
94.
Despite many improvements on original unstructured P2P networks, these systems still suffer from several problems, the most
important of which are, (a) lack of guarantees on the integrity of the network topology in the face of churns, (b) excessive
traffic cost and (c) poor quality of search results. This paper introduces an end-to-end scalable unstructured P2P networking
solution called SUPNET to address many of these issues. SUPNET is based on our pragmatic, design oriented approach to engineering
complex networks. Rather than modeling dynamical behavior in already-existing networks, we actively design and implement local
stochastic dynamics so that an engineered global system, with predictable structures emerges. The resulting protocol, SUPNET,
consists of two sub-protocols for network management and content search. The network management sub-protocol is scalable and
highly robust and is capable of utilizing the heterogeneous distribution of network resources. Its high stability is the result
of implementation of a novel distributed feedback mechanism. The search sub-protocol is capable of locating every item, even
if a single copy of that item exists in the network, while producing a traffic that scales provably sub-linear with the network
size. It also contains mechanisms for very efficient location of popular items as well as distributed parameter tuning algorithms.
These, along with inherently self-organized and de-centralized operation, relative ease of implementation and solid analytical
foundation, make SUPNET a compelling solution for unstructured P2P networking.
Nima Sarshar received his B.Sc. from Sharif University of Technology, Iran, his Masters from University of California, Los Angeles, USA and his Ph.D. from McMaster University, Canada, all in electrical engineering. Currently, he is an Assistant Professor in Faculty of Engineering, University of Regina, SK, Canada. His research interests include large scale distributed processing, P2P computing and multimedia networking. He has won the best paper award at IEEE P2P ’04 for his paper, “Percolation Search Algorithm in Power-Law Networks: Making Unstructured P2P Networks Scalable” and at VCIP ’08 for his paper “Rate-Distortion Optimized Multimedia Communication in Networks”. Vwani P. Roychowdhury received the Ph.D. degree in Electrical Engineering from Stanford University. He is a professor of Electrical Engineering at the University of California, Los Angeles. His research focuses on computation models, including parallel and distributed processing systems, quantum computation and information processing, and circuits and computing paradigms for nanoelectronics and molecular electronics. 相似文献
Vwani P. RoychowdhuryEmail: |
Nima Sarshar received his B.Sc. from Sharif University of Technology, Iran, his Masters from University of California, Los Angeles, USA and his Ph.D. from McMaster University, Canada, all in electrical engineering. Currently, he is an Assistant Professor in Faculty of Engineering, University of Regina, SK, Canada. His research interests include large scale distributed processing, P2P computing and multimedia networking. He has won the best paper award at IEEE P2P ’04 for his paper, “Percolation Search Algorithm in Power-Law Networks: Making Unstructured P2P Networks Scalable” and at VCIP ’08 for his paper “Rate-Distortion Optimized Multimedia Communication in Networks”. Vwani P. Roychowdhury received the Ph.D. degree in Electrical Engineering from Stanford University. He is a professor of Electrical Engineering at the University of California, Los Angeles. His research focuses on computation models, including parallel and distributed processing systems, quantum computation and information processing, and circuits and computing paradigms for nanoelectronics and molecular electronics. 相似文献
95.
96.
97.
A simple unified Godunov-type upwind approach that does not need Riemann solvers for the flux calculation is developed for the finite volume discrete Boltzmann method (FVDBM) on an unstructured cell-centered triangular mesh. With piecewise-constant (PC), piecewise-linear (PL) and piecewise-parabolic (PP) reconstructions, three Godunov-type upwind flux schemes with different orders of accuracy are subsequently derived. After developing both a semi-implicit time marching scheme tailored for the developed flux schemes, and a versatile boundary treatment that is compatible with all of the flux schemes presented in this paper, numerical tests are conducted on spatial accuracy for several single-phase flow problems. Four major conclusions can be made. First, the Godunov-type schemes display higher spatial accuracy than the non-Godunov ones as the result of a more advanced treatment of the advection. Second, the PL and PP schemes are much more accurate than the PC scheme for velocity solutions. Third, there exists a threshold spatial resolution below which the PL scheme is better than the PP scheme and above which the PP scheme becomes more accurate. Fourth, besides increasing spatial resolution, increasing temporal resolution can also improve the accuracy in space for the PL and PP schemes. 相似文献
98.
Unstructured mesh quality, as measured geo-metrically, has long been known to influence solution accuracy and efficiency for
finite-element and finite-volume simulations. Recent guaranteed-quality unstructured meshing algorithms are therefore welcome
tools. However, these algorithms allow no explicit control over mesh resolution or grading. We define a geometric length scale,
similar in principle to the local feature size, which allows automatic global control of mesh resolution and grading. We describe
how to compute this length scale efficiently and modify Ruppert’s two-dimensional and Shewchuk’s three-dimensional meshing
algorithms to produce meshes matching our length scale. We provide proofs of mesh quality, good grading, and size optimality
for both two- and three-dimensions, and present examples, including comparison with existing schemes known to generate good-quality
meshes. 相似文献
99.
结构化数据挖掘与复杂类型数据挖掘既有联系,又有区别。如何将这两者统一起来,建立一个统一的理论框架,以指导数据挖掘与知识发现研完,已经成为一个迫切需要解决的问题。本文提出了知识发现状态空间统一模型UMKDSS,将结构化数据挖掘与复杂类型数据挖掘联系起来,为复杂类型数据挖掘提供理论指导。文章最后给出了UMKDSS在Web文本挖掘中的应用实例。 相似文献
100.
The adjoint RANS method has been implemented in the framework of an unstructured general-purpose finite volume code following the derive-then-discretise strategy (continuous adjoint approach). An explicit filtering technique is applied to the shape derivatives in order to extract noise from the mesh-based representation of high-resolution. In a CAD-free optimisation strategy the method is applied to a semi-circular profile in incompressible, external flow. It was observed that the filtering is particularly relevant at high Reynolds-numbers. In the complex scenario of ship hull design, the filtered shape derivative can directly be applied to the base-line configuration in order to support both manual and automatic shape optimisation. 相似文献