全文获取类型
收费全文 | 696篇 |
免费 | 44篇 |
国内免费 | 52篇 |
专业分类
电工技术 | 2篇 |
综合类 | 15篇 |
金属工艺 | 1篇 |
机械仪表 | 4篇 |
能源动力 | 1篇 |
武器工业 | 1篇 |
无线电 | 178篇 |
一般工业技术 | 7篇 |
冶金工业 | 1篇 |
原子能技术 | 1篇 |
自动化技术 | 581篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2020年 | 1篇 |
2019年 | 1篇 |
2018年 | 4篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2015年 | 5篇 |
2014年 | 23篇 |
2013年 | 19篇 |
2012年 | 31篇 |
2011年 | 36篇 |
2010年 | 23篇 |
2009年 | 41篇 |
2008年 | 67篇 |
2007年 | 88篇 |
2006年 | 66篇 |
2005年 | 78篇 |
2004年 | 74篇 |
2003年 | 74篇 |
2002年 | 56篇 |
2001年 | 23篇 |
2000年 | 31篇 |
1999年 | 14篇 |
1998年 | 7篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1993年 | 2篇 |
1991年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有792条查询结果,搜索用时 15 毫秒
1.
WCDMA的MBMS技术 总被引:2,自引:0,他引:2
主要介绍了基于WCDMA的MBMS技术,给出了其网络架构和技术难点,并对其应用给无线网络带来的影响作了一定深度的探讨。 相似文献
2.
杜佳 《自动化与仪器仪表》2014,(8):139-140
随着科学技术的飞速发展,作为网络信息领导者的移动通信在日常生活工作中的应用也越来越广泛,但是移动通信在应用中也会遇到很多问题,比如移动网络切换延迟现象较为普遍,组播包的丢包率比较高等等.本文针对于以上问题,分析了多种组播协议,提出了新型的基于Agent的移动组播算法,此算法可以有效地改进切换延迟和丢包率等问题. 相似文献
3.
Multicast routing in mobile ad hoc networks (MANETs) poses several challenges due to inherent characteristics of the network such as node mobility, reliability, scarce resources, etc. This paper proposes an Agent Based Multicast Routing Scheme (ABMRS) in MANETs, which uses a set of static and mobile agents. Five types of agents are used in the scheme: Route manager static agent, Network initiation mobile agent, Network management static agent, Multicast initiation mobile agent and Multicast management static agent. The scheme operates in the following steps: (1) to identify reliable nodes; (2) to connect reliable nodes through intermediate nodes; (3) to construct a backbone for multicasting using reliable nodes and intermediate nodes; (4) to join multicast group members to the backbone; (5) to perform backbone and group members management in case of mobility. The scheme has been simulated in various network scenarios to test operation effectiveness in terms of performance parameters such as packet delivery ratio, control overheads and group reliability. Also, a comparison of proposed scheme with MAODV (Multicast Ad hoc on-demand Distance Vector) protocol is presented. ABMRS performs better than MAODV as observed from the simulation. ABMRS offers flexible and adaptable multicast services and also supports component based software development. 相似文献
4.
Abstract. The Online Maximal Dense Tree problem is as follows: given a weighted directed graph and a source node, users issue online requests for connection to
the source node. A request can either be accepted or rejected (the admission control decision). If the connection request
is accepted, it must be connected to the source or to a node previously connected to the source (the routing decision). The
objective is to maximize the total number of connections while keeping the connection density , i.e. the ratio of accepted requests to the weight of the spanning tree, sufficiently high.
The primary motivation for the Maximal Dense Tree problem is the Online Capacitated Multicast admission control and routing problem. In the Online Capacitated Multicast problem, we are given a communication network with limited link capacities and a set of signal source nodes. Users generate
online requests for connection to the signal sources, and the network administrator has to make the admission control and
routing decisions. The goal of the network administrator is to maximize the total number of users connected subject to the
network capacity constraints.
The Online Maximal Dense Tree problem is also faced by a cable TV operator who wishes to connect as many customers as possible while keeping down the
amount of wiring per customer. Informally, the Online Maximal Dense Tree algorithm must ``gamble' on certain geographic areas, connecting nodes which are unprofitable to start with, in the hope
that eventually enough requests will arrive in its vicinity to make the investment profitable.
In this paper we present a randomized online algorithm for the Maximal Dense Tree problem that guarantees acceptance of a
(1- ɛ) factor of the requests accepted by the optimum offline algorithm with the expectation of density being at most polylogarithmically
lower than that of the offline algorithm. This yields an online capacitated multicast algorithm whose throughput is only poly-logarithmically lower than that of the optimum offline algorithm.
Previous work on multicast routing and maximal dense tree problems either made probabilistic assumptions or resulted in linear performance gaps with the offline algorithm. Attempts to solve the Online Maximal Dense Tree problem have also lead to the development of the first polylogarithmic approximation algorithms for the k -MST and the Prize Collecting Salesman problems [AABV]. 相似文献
5.
This paper proposes a method to reduce the cost of a core-based group-shared multicast tree, where the cost is evaluated by the total bandwidth consumption of multicasting packets among all group members. Due to the broadcast nature of radio transmissions, we find that the challenge of determining minimum cost multicast tree can be approximated by finding the multicast tree with a minimum number of non-leaves (the minimum non-leaf multicast tree problem). However, we also find that the minimum non-leaf multicast tree problem is NP-complete. Thus, a method is proposed to dynamically reduce the number of non-leaves in an existing multicast tree. Experimental results show that our method reduces the cost of the multicast tree in both geometrically and randomly distributed network models and the random waypoint mobility model. 相似文献
6.
廖继红 《计算机应用与软件》2008,25(3):195-197
提出了一种基于PIM-SM的新的扩展协议EPIM-SM(extend to PIM-SM).该协议采用了一种新的算法代替PIM-SM用于RP选举的哈希算法,新协议提供这样一种机制:根据网络拓扑结构及组播源和成员的变化情况,为每个候选RPi估算其组播树整体代价,定期选择一个代价值最小的RP,以使组播树的代价始终保持接近最低. 相似文献
7.
组通信技术是未来互联网应用的关键支撑技术.目前,应用层组播是组通信技术研究中的热点,而代理型应用层组播体系结构已成为组播体系结构研究的重要方向之一.首先概述和比较了IP组播、主机型应用层组播和代理型应用层组播3种组播体系结构,接着重点研究和分析了代理型应用层组播体系结构的研究现状.以此为基础,进一步总结了代理型应用层组播体系结构设计中需要考虑的基本问题,并针对现有体系结构的不足,探讨了设计新的代理型应用层组播体系结构中值得关注的问题.最后对未来工作进行了展望. 相似文献
8.
Namgon?Kim JongWon?KimEmail author Thomas?D.?Uram 《Multimedia Tools and Applications》2009,44(1):17-37
In multi-party collaborative environments, a group of users can share multiple media streams via IP multicasting. However,
despite of the efficiency of IP multicast, it is not widely available and alternative application-layer multicast approaches
are introduced. Application-layer multicast is advantageous, however, it incurs additional processing delays. In this paper,
we present a new hybrid-style application-layer multicast solution that satisfies both network efficiency and easy deployment.
We achieve this goal by connecting multicast islands through UDP tunnels employing UMTP (UDP multicast tunneling protocol).
We also design a MPROBE protocol to remove multicast loop among multicast island in real Internet. We verify the feasibility
of the proposed solution by implementing a prototype tool, AG Connector, that works on Access Grid multi-party collaborative
environment.
相似文献
Thomas D. UramEmail: |
9.
10.