全文获取类型
收费全文 | 2776篇 |
免费 | 374篇 |
国内免费 | 33篇 |
专业分类
化学 | 1篇 |
晶体学 | 1篇 |
力学 | 2篇 |
综合类 | 42篇 |
数学 | 467篇 |
物理学 | 100篇 |
无线电 | 2570篇 |
出版年
2024年 | 8篇 |
2023年 | 40篇 |
2022年 | 37篇 |
2021年 | 49篇 |
2020年 | 69篇 |
2019年 | 54篇 |
2018年 | 52篇 |
2017年 | 71篇 |
2016年 | 100篇 |
2015年 | 119篇 |
2014年 | 179篇 |
2013年 | 226篇 |
2012年 | 185篇 |
2011年 | 216篇 |
2010年 | 184篇 |
2009年 | 205篇 |
2008年 | 164篇 |
2007年 | 235篇 |
2006年 | 188篇 |
2005年 | 138篇 |
2004年 | 157篇 |
2003年 | 132篇 |
2002年 | 101篇 |
2001年 | 95篇 |
2000年 | 51篇 |
1999年 | 28篇 |
1998年 | 22篇 |
1997年 | 16篇 |
1996年 | 13篇 |
1995年 | 10篇 |
1994年 | 6篇 |
1993年 | 7篇 |
1992年 | 9篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 8篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有3183条查询结果,搜索用时 15 毫秒
121.
Chi‐Jen Wu De‐Kai Liu Ren‐Hung Hwang 《International Journal of Communication Systems》2007,20(1):83-102
This work describes a novel location‐aware, self‐organizing, fault‐tolerant peer‐to‐peer (P2P) overlay network, referred to as Laptop. Network locality‐aware considerations are a very important metric for designing a P2P overlay network. Several network proximity schemes have been proposed to enhance the routing efficiency of existing DHT‐based overlay networks. However, these schemes have some drawbacks such as high overlay network and routing table maintenance overhead, or not being completely self‐organizing. As a result, they may result in poor scalability as the number of nodes in the system grows. Laptop constructs a location‐aware overlay network without pre‐determined landmarks and adopts a routing cache scheme to avoid maintaining the routing table periodically. In addition, Laptop significantly reduces the overlay maintenance overhead by making each node maintain only the connectivity between parent and itself. Mathematical analysis and simulations are conducted to evaluate the efficiency, scalability, and robustness of Laptop. Our mathematical analysis shows that the routing path length is bounded by logd N, and the joining and leaving overhead is bounded by d logd N, where N is the number of nodes in the system, and d is the maximum degree of each node on the overlay tree. Our simulation results show that the average latency stretch is 1.6 and the average routing path length is only about three in 10 000 Laptop nodes, and the maximum degree of a node is bounded by 32. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
122.
Abdelhamid Mellouk Saïd Hoceïni Yacine Amirat 《International Journal of Communication Systems》2007,20(10):1113-1130
In this paper, we propose two adaptive routing algorithms based on reinforcement learning. In the first algorithm, we have used a neural network to approximate the reinforcement signal, allowing the learner to take into account various parameters such as local queue size, for distance estimation. Moreover, each router uses an online learning module to optimize the path in terms of average packet delivery time, by taking into account the waiting queue states of neighbouring routers. In the second algorithm, the exploration of paths is limited to N‐best non‐loop paths in terms of hops number (number of routers in a path), leading to a substantial reduction of convergence time. The performances of the proposed algorithms are evaluated experimentally with OPNET simulator for different levels of traffic's load and compared with standard shortest‐path and Q‐routing algorithms. Our approach proves superior to classical algorithms and is able to route efficiently even when the network load varies in an irregular manner. We also tested our approach on a large network topology to proof its scalability and adaptability. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
123.
Suzan Bayhan Gürkan Gür Fatih Alagöz 《International Journal of Communication Systems》2007,20(12):1367-1389
In this article, performance of delay‐sensitive traffic in multi‐layered satellite Internet Protocol (IP) networks with on‐board processing (OBP) capability is investigated. With OBP, a satellite can process the received data, and according to the nature of application, it can decide on the transmission properties. First, we present a concise overview of relevant aspects of satellite networks to delay‐sensitive traffic and routing. Then, in order to improve the system performance for delay‐sensitive traffic, specifically Voice over Internet Protocol (VoIP), a novel adaptive routing mechanism in two‐layered satellite network considering the network's real‐time information is introduced and evaluated. Adaptive Routing Protocol for Quality of Service (ARPQ) utilizes OBP and avoids congestion by distributing traffic load between medium‐Earth orbit and low‐Earth orbit layers. We utilize a prioritized queueing policy to satisfy quality‐of‐service (QoS) requirements of delay‐sensitive applications while evading non‐real‐time traffic suffer low performance level. The simulation results verify that multi‐layered satellite networks with OBP capabilities and QoS mechanisms are essential for feasibility of packet‐based high‐quality delay‐sensitive services which are expected to be the vital components of next‐generation communications networks. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
124.
Ad hoc网络安全与攻击探讨 总被引:6,自引:0,他引:6
介绍了Ad hoc网络的体系结构和特点,分析了其存在的网络安全问题,总结了对Ad hoc网络的多种攻击方法,并提出了几种改善Ad hoc网络安全的策略。 相似文献
125.
文章介绍了无线传感器网络的体系结构,提出了一种基于跨层设计的管理控制机制;在对无线传感器网络的关键技术,如媒体接入控制(MAC)技术和无线路由协议,分别进行阐述和比较的基础上,提出了一种把简单的IEEE 802 MAC协议应用于无线传感器网络的思想;为了提高系统容量,提出了多信道策略,可以用来有效减少系统碰撞阻塞率,减少接入时延;认为虽然无线传感器网络的应用前景非常广阔,但是仍存在很多问题,除了要尽量减少功耗外,必须提高系统容量,减少碰撞阻塞率,以加快无线传感器网络实用化的进程. 相似文献
126.
Gabriel Gutiérrez-Jarpa Guy Desaulniers Gilbert Laporte Vladimir Marianov 《European Journal of Operational Research》2010
In the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows, the set of customers is the union of delivery customers and pickup customers. A fleet of identical capacitated vehicles based at the depot must perform all deliveries and profitable pickups while respecting time windows. The objective is to minimize routing costs, minus the revenue associated with the pickups. Five variants of the problem are considered according to the order imposed on deliveries and pickups. An exact branch-and-price algorithm is developed for the problem. Computational results are reported for instances containing up to 100 customers. 相似文献
127.
This paper studies an NP-hard multi-period production–distribution problem to minimize the sum of three costs: production setups, inventories and distribution. This problem is solved by a very recent form of metaheuristic called memetic algorithm with population management (MA∣PM). Contrary to classical two-phase methods (production planning, then distribution planning), the algorithm simultaneously tackles production and distribution decisions. Several versions with different population management strategies are evaluated and compared with a two-phase heuristic and a Greedy Randomized Adaptive Search Procedure (GRASP), on 90 randomly generated instances with 20 periods and 50, 100 or 200 customers. The significant savings obtained compared to the two other methods confirm both the interest of integrating production and distribution decisions and of using the MA∣PM template. 相似文献
128.
We study the routing of a single vehicle that delivers multiple products under stochastic demand. Specifically, we investigate two practical variations of this problem: (i) The case in which each product type is stored in its dedicated compartment in the vehicle, and (ii) the case in which all products are stored together in the vehicle’s single compartment. Suitable dynamic programming algorithms are proposed to determine the minimum expected (routing) cost for each case. Furthermore, the optimal routing policy is derived by developing appropriate theorems. The efficiency of the algorithms is studied by solving large problem sets. 相似文献
129.
An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile ad hoc networks. ODMRP is a mesh-based, rather than a conventional tree-based, multicast scheme and uses a forwarding group concept; only a subset of nodes forwards the multicast packets via scoped flooding. It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation. 相似文献
130.
In this paper, we address the problem of permanent guaranteed routing through a LEO satellite constellation with inter-satellite links. A reduction to a geometric problem of intersection of rectangles is given, along with algorithmic issues. We express the problem on a very simple model, and discuss the extension to more complicated schemes. We present some experimental results based on this framework that demonstrate the efficiency of the method in a call admission control process. 相似文献