全文获取类型
收费全文 | 1998篇 |
免费 | 131篇 |
国内免费 | 62篇 |
学科分类
工业技术 | 2191篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 22篇 |
2021年 | 29篇 |
2020年 | 37篇 |
2019年 | 25篇 |
2018年 | 19篇 |
2017年 | 60篇 |
2016年 | 42篇 |
2015年 | 50篇 |
2014年 | 111篇 |
2013年 | 75篇 |
2012年 | 128篇 |
2011年 | 141篇 |
2010年 | 133篇 |
2009年 | 104篇 |
2008年 | 103篇 |
2007年 | 110篇 |
2006年 | 131篇 |
2005年 | 123篇 |
2004年 | 121篇 |
2003年 | 106篇 |
2002年 | 82篇 |
2001年 | 68篇 |
2000年 | 47篇 |
1999年 | 54篇 |
1998年 | 57篇 |
1997年 | 37篇 |
1996年 | 38篇 |
1995年 | 27篇 |
1994年 | 22篇 |
1993年 | 15篇 |
1992年 | 19篇 |
1991年 | 12篇 |
1990年 | 4篇 |
1989年 | 11篇 |
1988年 | 7篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有2191条查询结果,搜索用时 31 毫秒
71.
Network-on-chip-based multiprocessor systems-on-chip are considered as future embedded systems platforms. One of the steps in mapping an application onto such a parallel platform involves scheduling the communication on the network-on-chip. This paper presents different scheduling strategies that minimize resource usage by exploiting all scheduling freedom offered by networks-on-chip. It also introduces a technique to take the dynamism in applications into account when scheduling the communication of an application on the network-on-chip while minimizing the resource usage. Our experiments show that resource-utilization is improved when compared to existing techniques. 相似文献
72.
Huafeng Yu Abdoulaye Gamatié Éric Rutten Jean-Luc Dekeyser 《Innovations in Systems and Software Engineering》2008,4(3):215-222
In this paper, we use the UML MARTE profile to model high-performance embedded systems (HPES) in the GASPARD2 framework. We address the design correctness issue on the UML model by using the formal validation tools associated with
synchronous languages, i.e., the SIGALI model checker, etc. This modeling and validation approach benefits from the advantages of UML as a standard, and from the
number of validation tools built around synchronous languages. In our context, model transformations act as a bridge between
UML and the chosen validation technologies. They are implemented according to a model-driven engineering approach. The modeling
and validation are illustrated using the multimedia functionality of a new-generation cellular phone. 相似文献
73.
Determining order relationship between events of a distributed computation is a fundamental problem in distributed systems
which has applications in many areas including debugging, visualization, checkpointing and recovery. Fidge/Mattern’s vector-clock
mechanism captures the order relationship using a vector of size N in a system consisting of N processes. As a result, it incurs message and space overhead of N integers. Many distributed applications use synchronous messages for communication. It is therefore natural to ask whether it is possible to reduce the timestamping overhead for such applications.
In this paper, we present a new approach for timestamping messages and events of a synchronously ordered computation, that is, when processes communicate using synchronous messages. Our approach depends on decomposing edges in the communication
topology into mutually disjoint edge groups such that each edge group either forms a star or a triangle. We show that, to accurately capture the order relationship between
synchronous messages, it is sufficient to use one component per edge group in the vector instead of one component per process.
Timestamps for events are only slightly bigger than timestamps for messages. Many common communication topologies such as
ring, grid and hypercube can be decomposed into edge groups, resulting in almost 50% improvement in both space and communication overheads. We prove that the problem of
computing an optimal edge decomposition of a communication topology is NP-complete in general. We also present a heuristic
algorithm for computing an edge decomposition whose size is within a factor of two of the optimal. We prove that, in the worst
case, it is not possible to timestamp messages of a synchronously ordered computation using a vector containing fewer than
components when N ≥ 2. Finally, we show that messages in a synchronously ordered computation can always be timestamped in an offline manner
using a vector of size at most .
An earlier version of this paper appeared in 2002 Proceedings of the IEEE International Conference on Distributed Computing
Systems (ICDCS).
The author V. K. Garg was supported in part by the NSF Grants ECS-9907213, CCR-9988225, an Engineering Foundation Fellowship.
This work was done while the author C. Skawratananond was a Ph.D. student at the University of Texas at Austin. 相似文献
74.
One of the early results concerning the asynchronous π-calculus which significantly contributed to its popularity is the capability of encoding the output prefix of the (choiceless) π-calculus in a natural and elegant way. Encodings of this kind were proposed by Honda and Tokoro, by Nestmann and (independently) by Boudol. We investigate whether the above encodings preserve De Nicola and Hennessy’s testing semantics. In this sense, it turns out that, under some general conditions, no encoding of the output prefix is able to preserve the must testing. This negative result is due to (a) the non-atomicity of the sequences of steps which are necessary in the asynchronous π-calculus to mimic synchronous communication, and (b) testing semantics’ sensitivity to divergence. 相似文献
75.
76.
77.
现代远程教育之网络技术研究与探讨 总被引:5,自引:0,他引:5
现代远程教育是近年来国际教育发展的重要趋势。介绍了我国现代远程教育状况,就现代远程教育的解决方案中的网络技术进行了深入地研究和讨论。 相似文献
78.
在CORBA中实现异步调用 总被引:1,自引:0,他引:1
介绍了CORBA中的四种异步激发方式:多线程方式、单向异步激发方式、延迟同步激发方式以及异步方法调用方式,并讨论了各种异步激发方式的优缺点。 相似文献
79.
80.
Jawwad ShamsiAuthor Vitae Monica BrockmeyerAuthor Vitae 《Journal of Parallel and Distributed Computing》2012,72(1):70-82
Providing bounded communication among participating nodes is significant for distributed systems. Internet-based applications suffer with lower performance due to absence of bounded latency. We describe PSON, an overlay network solution to this challenging problem. PSON has two components. The monitoring component, SyncProbe, utilizes efficient and adaptive monitoring techniques to measure latency, detect packet loss, and provide real-time estimates of maximum expected latency along paths of an Internet substrate. The QoSMap component constructs and manages overlay such that it yields application-level QoS and provides resilience against network failures. A distinctive feature of QoSMap is construction of QoS-compliant backup paths which facilitate in overlay management and operation during the period when primary overlay paths violate QoS. We evaluate PSON on PlanetLab to provide predictable communication for applications with different topology and QoS requirement. Our experiments confirm the effectiveness of PSON in providing an inexpensive and efficient application-layer solution to Internet’s unpredictable behavior. 相似文献