首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   323篇
  免费   11篇
  国内免费   14篇
综合类   9篇
化学工业   1篇
机械仪表   3篇
建筑科学   12篇
矿业工程   1篇
石油天然气   2篇
无线电   144篇
一般工业技术   3篇
自动化技术   173篇
  2022年   3篇
  2021年   4篇
  2020年   6篇
  2019年   2篇
  2018年   6篇
  2017年   8篇
  2016年   10篇
  2015年   11篇
  2014年   21篇
  2013年   21篇
  2012年   18篇
  2011年   26篇
  2010年   19篇
  2009年   19篇
  2008年   28篇
  2007年   22篇
  2006年   17篇
  2005年   16篇
  2004年   16篇
  2003年   15篇
  2002年   7篇
  2001年   7篇
  2000年   5篇
  1999年   8篇
  1998年   1篇
  1997年   3篇
  1996年   3篇
  1995年   5篇
  1994年   3篇
  1993年   4篇
  1992年   4篇
  1990年   3篇
  1989年   1篇
  1988年   3篇
  1986年   1篇
  1985年   1篇
  1981年   1篇
排序方式: 共有348条查询结果,搜索用时 0 毫秒
31.
介绍在PowerPoint中插放Flash动画以及几种实现超级链接应用的方法和技巧。  相似文献   
32.
For a complete network of n processors within which communication lines are private, we show how to achieve concurrently many Byzantine Agreements within constant expected time both on synchronous and asynchronous networks. As an immediate consequence, this provides a solution to the Interactive Consistency problem. Our algorithms tolerate up to (n-1)/3 faulty processors in both the synchronous and asynchronous cases and are therefore resilient-optimal. In terms of time complexity, our results improve a time bound of (for n concurrent agreements) which is immediately implied by the constant expected time Byzantine Agreement of Feldman and Micali (synchronous systems) and of Canetti and Rabin (asynchronous systems). In terms of resiliency, our results improve the resiliency bound of the constant time, -resilient algorithm of Ben-Or. An immediate application of our protocols is a constant expected time simulation of simultaneous broadcast channels over a network with private lines.Received: April 2001, Accepted: September 2002, Michael Ben-Or: Research supported by Israel Academy of Sciences and by United States - Israel Binational Science Foundation grant BSF-87-00082  相似文献   
33.
Optimal regulation of stochastically behaving agents is essential to achieve a robust aggregate behavior in a swarm of agents. How optimally these behaviors are controlled leads to the problem of designing optimal control architectures. In this paper, we propose a novel broadcast stochastic receding horizon control architecture as an optimal strategy for stabilizing a swarm of stochastically behaving agents. The goal is to design, at each time step, an optimal control law in the receding horizon control framework using collective system behavior as the only available feedback information and broadcast it to all agents to achieve the desired system behavior. Using probabilistic tools, a conditional expectation based predictive model is derived to represent the ensemble behavior of a swarm of independently behaving agents with multi-state transitions. A stochastic finite receding horizon control problem is formulated to stabilize the aggregate behavior of agents. Analytical and simulation results are presented for a two-state multi-agent system. Stability of the closed-loop system is guaranteed using the supermartingale theory. Almost sure (with probability 1) convergence of the closed-loop system to the desired target is ensured. Finally, conclusions are presented.  相似文献   
34.
基于IP广播的计算机远程唤醒机制及其实现   总被引:3,自引:0,他引:3  
通过远程唤醒使远程主机自动加电启动,进而利用远程控制软件可对远程主机进行有效控制。基于IP广播的计算机远程唤醒机制,采用WinSock实现了计算机的远程唤醒、远程关机和重新启动,从而为远程控制计算机提供有力支持。  相似文献   
35.
We study the broadcast scheduling problem in which clients send their requests to a server in order to receive some files available on the server. The server may be scheduled in a way that several requests are satisfied in one broadcast. When files are transmitted over computer networks, broadcasting the files by fragmenting them provides flexibility in broadcast scheduling that allows the optimization of per user response time. The broadcast scheduling algorithm, then, is in charge of determining the number of segments of each file and their order of transmission in each round of transmission. In this paper, we obtain a closed form approximation formula which approximates the optimal number of segments for each file, aiming at minimizing the total response time of requests. The obtained formula is a function of different parameters including those of underlying network as well as those of requests arrived at the server. Based on the obtained approximation formula we propose an algorithm for file broadcast scheduling which leads to total response time which closely conforms to the optimum one. We use extensive simulation and numerical study in order to evaluate the proposed algorithm which reveals high accuracy of obtained analytical approximation. We also investigate the impact of various headers that different network protocols add to each file segment. Our segmentation approach is examined for scenarios with different file sizes at the range of 100 KB to 1 GB. Our results show that for this range of file sizes the segmentation approach shows on average 13% tolerance from that of optimum in terms of total response time and the accuracy of the proposed approach is growing by increasing file size. Besides, using proposed segmentation in this work leads to a high Goodput of the scheduling algorithm.  相似文献   
36.
王青龙  杨波  蔡英  韩臻 《计算机科学》2008,35(12):114-115
以身份加密为基础的应用研究在近年得到了快速发展.提出一种新的类身份的广播加密方案.与已有的基于身份的广播加密方案相比较,在保持存储密钥相同的情况下,本方案在计算量和传输开销方面得到了明显改善,有效提高了方案的效率.  相似文献   
37.
The mobile ad hoc network (MANET) has recently been recognized as an attractive network architecture for wireless communication. Reliable broadcast is an important operation in MANET (e.g., giving orders, searching routes, and notifying important signals). However, using a naive flooding to achieve reliable broadcasting may be very costly, causing a lot of contention, collision, and congestion, to which we refer as the broadcast storm problem. This paper proposes an efficient reliable broadcasting protocol by taking care of the potential broadcast storm problem that could occur in the medium-access level. Existing protocols are either unreliable, or reliable but based on a too costly approach. Our protocol differs from existing protocols by adopting a low-cost broadcast, which does not guarantee reliability, as a basic operation. The reliability is ensured by additional acknowledgement and handshaking. Simulation results do justify the efficiency of the proposed protocol.  相似文献   
38.
P2P存储系统副本一致性维护策略   总被引:1,自引:0,他引:1       下载免费PDF全文
副本策略是提高P2P存储系统的可扩展性、容错性、可用性的有效手段。随着新的应用发展,P2P中副本应用从只读静态文件共享转变为读写动态文件交互,副本的一致性维护变得越来越重要。提出一种副本信息传播树的维护策略,该策略把文件副本的相关信息保存在二叉树上,通过订阅和取消订阅算法维护副本的一致。实验证明该策略能有效减少维护开销,避免相关问题的出现。  相似文献   
39.
杨保泉 《电讯技术》1990,30(1):65-77
本文较全面地分析了调频发射机各部分的原理、电路、测量、安装、使用及维修技术,既有理论分析,更注重电路实践。文中还收集了不同电路方案,有关国家标准,故障分析,判断及排除经验。  相似文献   
40.
本文分析了FM立体声广播发射机中锁相调频环路参数与立体声分离度的关系,给出了环路参数的设计原则。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号