作者: 混亂生活 時(shí)間: 2025-3-21 22:18 作者: gustation 時(shí)間: 2025-3-22 03:53 作者: critic 時(shí)間: 2025-3-22 04:47
APPLE: A Novel P2P Based e-Learning Environmentth the help of Gnutella-like P2P network, APPLE provides live broadcasting services to share services of education resources. We build a virtual classroom service based on WSRF.NET, which exposes the service as a grid service that could be accessed by all the users among the grid.作者: APNEA 時(shí)間: 2025-3-22 12:09
Performance of Fair Distributed Mutual Exclusion Algorithms. The exact number of messages depends on the concurrency of requests, and is difficult to prove or analyze theoretically. This paper shows the superior performance of LK over RA using extensive simulations under a wide range of critical section access patterns and network loads.作者: CRATE 時(shí)間: 2025-3-22 16:47
Flexible Cycle Synchronized Algorithm in Parallel and Distributed Simulationde and describe the implementation of the flexible cycle algorithm. This improved algorithm solves some fatal problems of conservative or optimistic algorithms, resulting in the best of both methods. Finally we also analyze how to compute the performance parameter M of this algorithm in detail.作者: CRATE 時(shí)間: 2025-3-22 19:34
On Design of Cluster and Grid Computing Environment Toolkit for Bioinformatics Applicationste and share resources and biological data using the grid computing technology. Still in this paper, the well-known FASTA application is performed as matter of testing and analysis in our grid computing platform, as goal to show the improved efficiency and reduced computation time.作者: Mendacious 時(shí)間: 2025-3-23 00:38 作者: Noctambulant 時(shí)間: 2025-3-23 04:49 作者: 神秘 時(shí)間: 2025-3-23 07:03 作者: 古文字學(xué) 時(shí)間: 2025-3-23 12:38
Rule Mining for Dynamic Databases are very few algorithms that deal with dynamic(incremental) databases. The most classical algorithm to find frequent itemsets in dynamic database is . algorithm [7]. But the . algorithm is suitable for centralized databases. This paper presents a modified version of the . algorithm, called ., which is suitable for . databases.作者: 異端邪說(shuō)2 時(shí)間: 2025-3-23 15:38 作者: LAY 時(shí)間: 2025-3-23 21:41 作者: 蛤肉 時(shí)間: 2025-3-23 22:18 作者: Nonconformist 時(shí)間: 2025-3-24 05:17 作者: micronized 時(shí)間: 2025-3-24 08:37 作者: Malfunction 時(shí)間: 2025-3-24 14:16 作者: 金哥占卜者 時(shí)間: 2025-3-24 14:59 作者: propose 時(shí)間: 2025-3-24 20:36 作者: 抵押貸款 時(shí)間: 2025-3-25 02:25
The Year 1968 and the Soviet Communist Partyy specific assumptions on scheduling and constraints imposed by implementation environments. The application of t-UNITY formalism to specification and reasoning about real-time systems is illustrated by an example.作者: aptitude 時(shí)間: 2025-3-25 04:26
Conference proceedings 2005t city of Kolkata! Bhabani P. Sinha Indian Statistical Institute, Kolkata, India December 2004 Sajal K. Das University of Texas, Arlington, USA December 2004 Program Chairs’ Message On behalf of the Technical Program Committee of the 6th International Wo- shop on Distributed Computing, IWDC 2004, it作者: 通知 時(shí)間: 2025-3-25 07:35
Peritoneal Dialysis Prescriptionimizes the distance from . to . have been presented. In contrast, in this paper we focus on selecting, efficiently and distributively, the best swap edge according to an objective function suggested in?[13]: we choose the swap edge that minimizes the distance from . to ..作者: 長(zhǎng)處 時(shí)間: 2025-3-25 14:29 作者: stress-test 時(shí)間: 2025-3-25 18:47
https://doi.org/10.1007/978-3-642-72005-5f directional antenna to further reduce the contention between the flows in the wireless medium. The proposed scheme is evaluated on QualNet network simulator to demonstrate that our scheme guarantees fairness to all contending flows.作者: 強(qiáng)有力 時(shí)間: 2025-3-25 23:32
Distributed Computation for Swapping a Failing Edgeimizes the distance from . to . have been presented. In contrast, in this paper we focus on selecting, efficiently and distributively, the best swap edge according to an objective function suggested in?[13]: we choose the swap edge that minimizes the distance from . to ..作者: 樸素 時(shí)間: 2025-3-26 01:08 作者: Bernstein-test 時(shí)間: 2025-3-26 05:11 作者: remission 時(shí)間: 2025-3-26 09:00
0302-9743 lly vibrant city of Kolkata! Bhabani P. Sinha Indian Statistical Institute, Kolkata, India December 2004 Sajal K. Das University of Texas, Arlington, USA December 2004 Program Chairs’ Message On behalf of the Technical Program Committee of the 6th International Wo- shop on Distributed Computing, IWD作者: 拱形大橋 時(shí)間: 2025-3-26 15:00
Peritonitis and Exit-Site Infection are very few algorithms that deal with dynamic(incremental) databases. The most classical algorithm to find frequent itemsets in dynamic database is . algorithm [7]. But the . algorithm is suitable for centralized databases. This paper presents a modified version of the . algorithm, called ., which is suitable for . databases.作者: GLUT 時(shí)間: 2025-3-26 17:32
Negotiation of a Single European Marketlled . (MRR) that targets high throughput for data grid applications. We have analyzed the performance potentials of MRR, and have developed a simulator to evaluate it with typical grid configurations. Our results show that MRR brings significant performance improvements over existing online and batch heuristics like MCT, Min–min and Max-min.作者: 常到 時(shí)間: 2025-3-26 22:18 作者: HALO 時(shí)間: 2025-3-27 03:18
https://doi.org/10.1057/9780230119833In this paper we position distributed filesystems as a possible solution to this problem. We discuss the constraints imposed by such environments on traditional distributed filesystem design parameters. We describe the design and implementation of a distributed filesystem (lean-dfs) for such environments.作者: fetter 時(shí)間: 2025-3-27 08:33 作者: 輕信 時(shí)間: 2025-3-27 11:53
978-3-540-24076-1Springer-Verlag Berlin Heidelberg 2005作者: sparse 時(shí)間: 2025-3-27 13:43
Virtual Molecular Computing – Emulating DNA Moleculeslitate study of this model without test-tubes and their associated laboratory errors, this paper proposes a scheme for software emulation of a well-known test tube algorithm, the first NP-complete problem SAT. Multi-threading is employed to obtain the effect of simultaneous test-tube reactions.作者: 道學(xué)氣 時(shí)間: 2025-3-27 20:39 作者: 人充滿活力 時(shí)間: 2025-3-27 23:13
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281800.jpg作者: 尾隨 時(shí)間: 2025-3-28 02:52 作者: Introvert 時(shí)間: 2025-3-28 07:10 作者: 悠然 時(shí)間: 2025-3-28 12:51 作者: 運(yùn)動(dòng)的我 時(shí)間: 2025-3-28 15:19
the essentials in cardiac pacingInternet and its continued growth on various fronts. Clearly the Internet has emerged to be a very critical infrastructure for all aspects of our modern society. However, the Internet also suffers from serious limitations for its expanding role in the society..Success of the Internet and its continu作者: Metastasis 時(shí)間: 2025-3-28 19:22 作者: 流浪者 時(shí)間: 2025-3-29 01:44 作者: Ligneous 時(shí)間: 2025-3-29 06:28
Peritoneal Dialysis Prescriptiony the failed link, then the message will be delivered through that path; otherwise, we want to guarantee that, when the message reaches the edge (.,.) where the failure has occurred, the message will then be re-routed using the computed swap edge. There exist highly efficient serial solutions for th作者: sigmoid-colon 時(shí)間: 2025-3-29 09:23
Hemodialysis Procedure and Prescription algorithms badly limited its performance. So recently there has been a great deal of interest in parallel and distributed simulation, which runs on multiple processors to accelerate simulation. This paper begins with introduction of synchronization mechanisms. The emphasis of this paper is to provi作者: 本土 時(shí)間: 2025-3-29 14:39 作者: 旅行路線 時(shí)間: 2025-3-29 17:04
EFTA’s Experience with Non-tariff Barrierste knowledge. Various e-Learning systems have been designed to help people take full advantage of the benefit brought by the technology. The newly emerged . (P2P) and grid computing will serve as the key driven forces to bring revolutionary impact on the future society. This paper evaluates the pote作者: Astigmatism 時(shí)間: 2025-3-29 22:00 作者: insipid 時(shí)間: 2025-3-30 00:54
The Essentials of Economic Integrationed when sites are distributed, autonomous and heterogeneous. Grid architecture is such an evolving distributed architecture. Databases operating in Grid architecture have different recovery issues than their other distributed counterparts – distributed and multidatabase. In this paper we focus on ma作者: 膠水 時(shí)間: 2025-3-30 05:29
Introduction: Setting the Scenecations. The grid environment permits the sharing of a large amount of idle computing resources and data. The investigation of bioinformatics demands orders of magnitude of computing resources and in parallel, the biological data are growing in such a high speed. By using BioGrid, we plan to integra作者: 存心 時(shí)間: 2025-3-30 10:54
The Essentials of Knowledge Managementd large data sets mostly distributed geographically. Data grids have found applications in scientific research, in the field of high-energy Physics, Life Sciences etc. The issues that need to be considered in the data grid research area include: resource management including computation management a作者: motivate 時(shí)間: 2025-3-30 16:05 作者: Morsel 時(shí)間: 2025-3-30 17:20 作者: 正面 時(shí)間: 2025-3-30 21:02
Ettore Bolisanl,Alessandro Oltramaritc. As the areas of usage are more crucial the matter of assurance of correctness of programs is important. However, verification of these systems has received attention only very recently. Hitherto such systems have been programmed without a clearly defined formal semantics and with very little ide作者: 遺傳 時(shí)間: 2025-3-31 03:21
Epilogue: The Lingering Cold Warse behaviors in a running environment using a semi-centralised .2. system (eDonkey). To achieve this, we use a trace of the queries made to a large server managing up to fifty thousands peers simultaneously, and a few thousands queries per second. We analyse these data using complex network methods,作者: micronized 時(shí)間: 2025-3-31 08:11
The Year 1968 and the Soviet Communist Party The UNITY formalism of Chandi and Misra [1] is extended by introducing timing constraints in the definition of safety and liveness properties and in the proof logic. The proposed t-UNITY framework enables specification of both time independent logical properties and real-time properties, without an作者: Anonymous 時(shí)間: 2025-3-31 13:08
Epilogue: The Lingering Cold Warind the feasible set (i.e. common subset) . and the pareto-optimal subset of . with minimum disclosure in presence or absence of a third party are explored. These are useful in multiparty negotiations.作者: 吹牛者 時(shí)間: 2025-3-31 14:50 作者: Myocyte 時(shí)間: 2025-3-31 19:21
https://doi.org/10.1007/978-3-642-72005-5e contention resolution schemes. However, these protocols do not necessarily guarantee a fair allocation of wireless medium among contending flows. Our objective in this paper is to adaptively adjust the flow-rates of contending flows, so that each gets fair access to the medium. This adaptive adjus作者: 植物學(xué) 時(shí)間: 2025-4-1 00:53
the essentials in cardiac pacingto develop disruptive new networking technologies and solutions that would take us beyond Internet and serve the society for the next several decades..In this talk, firstly a context for networking research will be provided and then several key NSF programs are outlined, that are aimed at keeping th作者: sphincter 時(shí)間: 2025-4-1 02:50
