標(biāo)題: Titlebook: Global Computing; IST/FET Internationa Corrado Priami,Paola Quaglia Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 2005 Clus [打印本頁] 作者: GALL 時間: 2025-3-21 18:25
書目名稱Global Computing影響因子(影響力)
書目名稱Global Computing影響因子(影響力)學(xué)科排名
書目名稱Global Computing網(wǎng)絡(luò)公開度
書目名稱Global Computing網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Global Computing被引頻次
書目名稱Global Computing被引頻次學(xué)科排名
書目名稱Global Computing年度引用
書目名稱Global Computing年度引用學(xué)科排名
書目名稱Global Computing讀者反饋
書目名稱Global Computing讀者反饋學(xué)科排名
作者: GLUT 時間: 2025-3-21 22:08 作者: DAUNT 時間: 2025-3-22 01:33
0302-9743 Overview: 978-3-540-24101-0978-3-540-31794-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Isolate 時間: 2025-3-22 07:15
https://doi.org/10.1007/b103251Cluster; UML; Unified Modeling Language (UML); algorithm; algorithms; dependable computing; distributed co作者: Decrepit 時間: 2025-3-22 12:44
https://doi.org/10.1007/978-1-4613-4190-1 and deployment diagrams. Specifications are translated into the stochastic .-calculus, and quantitative analysis is then performed via the BioSpi tool. The approach is applied to a web-based Micro-business case study.作者: Epidural-Space 時間: 2025-3-22 15:33 作者: Epidural-Space 時間: 2025-3-22 18:24 作者: 控制 時間: 2025-3-22 23:48
https://doi.org/10.1007/978-1-4757-2046-4 Once a system is modeled in this framework, a temporal graph logic can be used to express some of its relevant behavioral properties. Then, under certain constraints, such properties can be checked automatically.The approach is illustrated over a simple case study, the so-called Airport Case Study,作者: 溫順 時間: 2025-3-23 01:30 作者: 使隔離 時間: 2025-3-23 06:39
Transplantation in Otolaryngologyether semantically related services. Each such group is termed a community. Communities are organized in a global taxonomy whose nodes are related contextually. The taxonomy can be seen as an expandable, flexible and distributed semantic index over the system, which aims at improving service discove作者: 不斷的變動 時間: 2025-3-23 12:54
Immunoglobulins in blood transfusiones not include. To relate these two different models of cryptography, in this paper we enrich a formal model for cryptographic expressions, originally based on the Dolev-Yao assumptions, with computational aspects based on notions of probability and computational power. The obtained result is that i作者: semble 時間: 2025-3-23 13:52
N. J. Calvanico,T. B. Tomasi Jr. automated formal analyses with minimal overhead. In this paper, we present For-LySa, an instantiation of the DEGAS approach for authentication analysis, which exploits an existing analysis tool developed for the process calculus LySa. We discuss what information is needed for the analysis, and how 作者: Inculcate 時間: 2025-3-23 19:48 作者: SOB 時間: 2025-3-23 22:25 作者: cinder 時間: 2025-3-24 04:58
Multiple Antibodies from the Same Species,asis for studying component-based distributed programming. The Kell calculus is built around a .-calculus core, and follows five design principles which are essential for a foundational model of distributed and mobile programming: hierarchical localities, local actions, higher-order communication, p作者: ASTER 時間: 2025-3-24 08:55
https://doi.org/10.1007/978-1-4612-0139-7with primitives to design and implement run-time systems for distributed process calculi. The paper describes the four main components of abstract machines for mobile calculi (node topology, naming and binding, communication protocols and mobility) that have been implemented as Java packages. The pa作者: LATER 時間: 2025-3-24 11:44 作者: 不如屎殼郎 時間: 2025-3-24 15:00 作者: 極端的正確性 時間: 2025-3-24 20:20
Hypogammaglobulinaemia: Recent Advances,connected communication network. In this paper, we formally verify a typical application running on a .xed set of nodes. This work is the foundation for studies of a more dynamic system..We identify a value and expression language for a value-passing CCS that allows us to formally model a distribute作者: 全部 時間: 2025-3-25 00:21 作者: 辯論的終結(jié) 時間: 2025-3-25 04:00
Ralph Snyderman,Marilyn C. Pikememory usage. Processes only have “l(fā)ocal knowledge” about each other. They organize themselves dynamically (right from the bootstrapping phase), according to join, leave or crash events, to form a locality-based dissemination graph. Broadcast messages can be disseminated using these graphs in large 作者: 壓倒性勝利 時間: 2025-3-25 11:06 作者: Generosity 時間: 2025-3-25 15:36 作者: ETCH 時間: 2025-3-25 16:30
https://doi.org/10.1007/978-981-15-5823-8utational entity is seen as an agent developed using Computational Logic tools and techniques. We model a KGP agent by relying upon a collection of capabilities, which are then used to define a collection of transitions, to be used within logically specified, context sensitive control theories, whic作者: 長處 時間: 2025-3-25 22:52 作者: 范圍廣 時間: 2025-3-26 02:42 作者: JIBE 時間: 2025-3-26 07:34
Mobile UML Statecharts with Localities,ehaviour is given by statecharts. Each object resides in a given place, and a collection of such places forms a network. Objects are aware of the . of other objects, i.e. the logical names of the places where the latter reside, but not of the physical name of such places. In addition to their usual 作者: 踉蹌 時間: 2025-3-26 10:57
Communities: Concept-Based Querying for Mobile Services,ether semantically related services. Each such group is termed a community. Communities are organized in a global taxonomy whose nodes are related contextually. The taxonomy can be seen as an expandable, flexible and distributed semantic index over the system, which aims at improving service discove作者: 清洗 時間: 2025-3-26 15:56
Towards a Formal Treatment of Secrecy Against Computational Adversaries,es not include. To relate these two different models of cryptography, in this paper we enrich a formal model for cryptographic expressions, originally based on the Dolev-Yao assumptions, with computational aspects based on notions of probability and computational power. The obtained result is that i作者: 陶器 時間: 2025-3-26 20:49
For-LySa: UML for Authentication Analysis, automated formal analyses with minimal overhead. In this paper, we present For-LySa, an instantiation of the DEGAS approach for authentication analysis, which exploits an existing analysis tool developed for the process calculus LySa. We discuss what information is needed for the analysis, and how 作者: 首創(chuàng)精神 時間: 2025-3-26 22:51 作者: 休戰(zhàn) 時間: 2025-3-27 03:57 作者: Immunization 時間: 2025-3-27 07:03 作者: IRATE 時間: 2025-3-27 12:16 作者: VOC 時間: 2025-3-27 14:03
A Generic Membrane Model (Note),ain containing processes with some computing power, including in particular some specific primitives to manage the movements of entities from the inside to the outside of a domain, and conversely. We define a .-calculus instance of our model, and illustrate by means of examples its expressive power.作者: habitat 時間: 2025-3-27 19:33
A Framework for Structured Peer-to-Peer Overlay Networks,lications in which participating peers share computing resources as equals. In the past three year, various structured peer-to-peer overlay networks have been proposed, and probably more are to come. We present a framework for understanding, analyzing and designing structured peer-to-peer overlay ne作者: 替代品 時間: 2025-3-27 22:31
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case,connected communication network. In this paper, we formally verify a typical application running on a .xed set of nodes. This work is the foundation for studies of a more dynamic system..We identify a value and expression language for a value-passing CCS that allows us to formally model a distribute作者: 神圣在玷污 時間: 2025-3-28 02:49 作者: 放肆的你 時間: 2025-3-28 06:56
BGP-Based Clustering for Scalable and Reliable Gossip Broadcast,memory usage. Processes only have “l(fā)ocal knowledge” about each other. They organize themselves dynamically (right from the bootstrapping phase), according to join, leave or crash events, to form a locality-based dissemination graph. Broadcast messages can be disseminated using these graphs in large 作者: 遵循的規(guī)范 時間: 2025-3-28 14:26
Trust Lifecycle Management in a Global Computing Environment,nformation about their potential collaborators. The SECURE project addresses this requirement by using trust as the mechanism for managing risks and uncertainty. This paper describes how trust lifecycle management, a procedure of collecting and processing evidence, is used by the SECURE collaboratio作者: helper-T-cells 時間: 2025-3-28 16:13
The SOCS Computational Logic Approach to the Specification and Verification of Agent Societies,t CL-based agents. It describes the SOCS social model: an agent interaction specification and verification framework equipped with a declarative and operational semantics, expressed in terms of abduction. The operational counterpart of the proposed framework has been implemented and integrated in SO作者: FAST 時間: 2025-3-28 19:22
The KGP Model of Agency for Global Computing: Computational Model and Prototype Implementation,utational entity is seen as an agent developed using Computational Logic tools and techniques. We model a KGP agent by relying upon a collection of capabilities, which are then used to define a collection of transitions, to be used within logically specified, context sensitive control theories, whic作者: Microgram 時間: 2025-3-29 02:49 作者: armistice 時間: 2025-3-29 06:16 作者: 驚奇 時間: 2025-3-29 09:37 作者: Bernstein-test 時間: 2025-3-29 12:33
Trust Lifecycle Management in a Global Computing Environment,of a particular principal on its current trust value both in terms of trustworthiness and certainty and is one of the distinctive characteristics of the SECURE collaboration making it more appropriate for a global computing setting.作者: Eeg332 時間: 2025-3-29 16:56
https://doi.org/10.1007/978-1-4757-2046-4tain constraints, such properties can be checked automatically.The approach is illustrated over a simple case study, the so-called Airport Case Study, which has been widely used along the first two years of the AGILE GC project.作者: predict 時間: 2025-3-29 21:18
https://doi.org/10.1007/978-1-4612-0139-7hines for mobile calculi (node topology, naming and binding, communication protocols and mobility) that have been implemented as Java packages. The paper also contains the description of a prototype implementation of a run-time system for the Distributed Pi-Calculus relying on the presented framework.作者: SHOCK 時間: 2025-3-30 03:23 作者: Aggrandize 時間: 2025-3-30 05:14 作者: 愛得痛了 時間: 2025-3-30 11:44 作者: Innovative 時間: 2025-3-30 15:10 作者: B-cell 時間: 2025-3-30 20:12
A. O. Tarakanov,V. A. Skormin,S. P. Sokolova of the capabilities of their computer-world counterparts. We identify the problems arising when applying current routing and searching methods to this nano-world, and present some initial solutions, using a case study of a sensor network instance; Smart Dust.作者: 引起 時間: 2025-3-30 22:03
Multiple Antibodies from the Same Species,ions on pattern languages, by means of a form of higher-order bisimulation called strong context bisimulation. The paper also contains several examples that illustrate the expressive power of Kell calculi.作者: EXPEL 時間: 2025-3-31 04:44 作者: otic-capsule 時間: 2025-3-31 06:04 作者: 剝皮 時間: 2025-3-31 12:16
Ralph Snyderman,Marilyn C. Piketructed using BGP routing information about process “l(fā)ocality”. We convey the feasibility of the algorithm using both simulation and experimental results and describe an application of our algorithm for broadcasting information streams.
