標(biāo)題: Titlebook: Network and Parallel Computing; IFIP International C Jian Cao,Minglu Li,Jinjun Chen Conference proceedings 2008 IFIP International Federati [打印本頁(yè)] 作者: 撕成碎片 時(shí)間: 2025-3-21 18:09
書(shū)目名稱Network and Parallel Computing影響因子(影響力)
書(shū)目名稱Network and Parallel Computing影響因子(影響力)學(xué)科排名
書(shū)目名稱Network and Parallel Computing網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Network and Parallel Computing網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Network and Parallel Computing被引頻次
書(shū)目名稱Network and Parallel Computing被引頻次學(xué)科排名
書(shū)目名稱Network and Parallel Computing年度引用
書(shū)目名稱Network and Parallel Computing年度引用學(xué)科排名
書(shū)目名稱Network and Parallel Computing讀者反饋
書(shū)目名稱Network and Parallel Computing讀者反饋學(xué)科排名
作者: Microaneurysm 時(shí)間: 2025-3-21 22:29
Youn-Sik Hong,Ki-Young Leel environment of the atom occupying the site. The site symmetry concept is familiar to crystallographers and commonly used by them in the description of crystalline structures. However, in the application of group theory to solid state physics problems, the site symmetry approach has been used only 作者: sigmoid-colon 時(shí)間: 2025-3-22 00:55
Eunyoung Kang,Yongsoon Im,Ungmo Kiml environment of the atom occupying the site. The site symmetry concept is familiar to crystallographers and commonly used by them in the description of crystalline structures. However, in the application of group theory to solid state physics problems, the site symmetry approach has been used only 作者: Coeval 時(shí)間: 2025-3-22 06:09 作者: Blanch 時(shí)間: 2025-3-22 11:21 作者: 遠(yuǎn)足 時(shí)間: 2025-3-22 13:48 作者: LUMEN 時(shí)間: 2025-3-22 20:49 作者: 解凍 時(shí)間: 2025-3-22 23:20
Shuhua Wu,Yuefei Zhumethods of site-specific protein labeling offer new possibilities for pharmaceutical R&D, classical methods are still the mainstay mainly due to being well established. However, site-specific protein labeling is expected to increase in importance, in particular for antibody–drug conjugates and other作者: RALES 時(shí)間: 2025-3-23 02:46
Fagen Li,Masaaki Shirase,Tsuyoshi Takagid paired ends (PEs) for sequencing. The advantages of this approach are the following: (1) the circularization of short fragments with sticky ends is efficient; therefore the success rate is higher than other approaches that attempt to join both blunt ends of large fosmid vectors; and (2) the restri作者: Ointment 時(shí)間: 2025-3-23 08:44
Ruonan Rao,Shuying Liang,Jinyuan Youhe modular and programmable DNA-binding domain and through directed evolution of the serine recombinase catalytic domain. This chapter reviews the development of the zinc-finger recombinase technology, including discussions of its strengths and weaknesses and the future directions necessary to trans作者: CRACY 時(shí)間: 2025-3-23 11:05 作者: 吵鬧 時(shí)間: 2025-3-23 16:49 作者: JAUNT 時(shí)間: 2025-3-23 21:30 作者: 開(kāi)始沒(méi)有 時(shí)間: 2025-3-24 02:00
Bowei Yang,Guanghua Song,Yao Zhenghe modular and programmable DNA-binding domain and through directed evolution of the serine recombinase catalytic domain. This chapter reviews the development of the zinc-finger recombinase technology, including discussions of its strengths and weaknesses and the future directions necessary to trans作者: 冥想后 時(shí)間: 2025-3-24 06:26
Qing Liuld hold on their own? Is indigenous ‘original and unsullied’ to be seen mostly in opposition to modern/scientific knowledge? Could they interact? Could they change? Was a synthesis or coproduction possible? The present paper attempts to address these questions with the help of examples and illustra作者: 上漲 時(shí)間: 2025-3-24 09:14 作者: BINGE 時(shí)間: 2025-3-24 12:20 作者: 帶傷害 時(shí)間: 2025-3-24 18:34
Feedback Control-Based Database Connection Management for Proportional Delay Differentiation-Enabledaluate the performance of the closed-loop system. Experiment results indicate that, the controller is effective in handling varying workloads, and PDD can be achieved in the DBCP even if the number of concurrent dynamic requests changes abruptly under different kinds of workloads.作者: 朦朧 時(shí)間: 2025-3-24 22:19 作者: 或者發(fā)神韻 時(shí)間: 2025-3-25 03:11
0302-9743 mong the high-quality submissions, only 32 regular papers were accepted by the conferences. All of the selected conference papers are included in the conference978-3-540-88139-1978-3-540-88140-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 明確 時(shí)間: 2025-3-25 04:59 作者: 昏暗 時(shí)間: 2025-3-25 10:07
Xiaofei Liao,Hao Wang,Song Wu,Hai Jinombinase, ?C31 integrase, transposases and resolvases are fully detailed with their strengths and weaknesses. All these information’s will help students and experienced researchers to understand and choose the 978-94-017-8075-9978-94-007-4531-5Series ISSN 1610-2096 Series E-ISSN 1610-6970 作者: 固定某物 時(shí)間: 2025-3-25 12:03 作者: Morphine 時(shí)間: 2025-3-25 16:47
Network and Parallel Computing978-3-540-88140-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 失望昨天 時(shí)間: 2025-3-25 23:44 作者: 和平主義者 時(shí)間: 2025-3-26 03:04
https://doi.org/10.1007/978-3-540-88140-7Routing; Scheduling; System; ad-hoc networks; algorithms; authentication; cognitive networks; communication作者: arrogant 時(shí)間: 2025-3-26 06:49 作者: Exonerate 時(shí)間: 2025-3-26 11:41 作者: Simulate 時(shí)間: 2025-3-26 14:05
Deadline Probing: Towards Timely Cognitive Wireless Networkon deadline probing paradigm, and an optimal probing and transmission schedule with time constraints is proposed, which is a pure threshold policy. Simulation results show that, deadline probing paradigm effectively improves network resource utilization as multiple channels presented with probing and transmission deadlines.作者: 純樸 時(shí)間: 2025-3-26 19:54 作者: 健壯 時(shí)間: 2025-3-27 00:40 作者: 挑剔為人 時(shí)間: 2025-3-27 05:01 作者: 有害處 時(shí)間: 2025-3-27 06:59 作者: 藕床生厭倦 時(shí)間: 2025-3-27 12:31
HRS: A Hybrid Replication Strategy for Exhaustive P2P Searchfficiently handle both kind of queries, popular or not. We evaluate this design through mathematical proof and comprehensive simulations. Results show that HRS outperforms existing replication-based search paradigms in terms of search performance and resource consummation.作者: Modify 時(shí)間: 2025-3-27 16:30 作者: 死貓他燒焦 時(shí)間: 2025-3-27 18:47 作者: pericardium 時(shí)間: 2025-3-28 00:24 作者: 頭腦冷靜 時(shí)間: 2025-3-28 05:44
0302-9743 PC has been a premier conference that has brought together researchers and pr- titioners from academia, industry and governments around the world to advance the theories and technologies of network and parallel computing. The goal of NPC is to establish an international forum for researchers and pra作者: Trabeculoplasty 時(shí)間: 2025-3-28 07:25 作者: 取之不竭 時(shí)間: 2025-3-28 10:59
An AIAD-Based Adaptive Routing Protocol in Ad-Hoc Wireless Networkscurrent network status. We have tested our proposed method with both the conventional AODV and the method using timestamp based on the three performance metrics; i.e., node mobility, node velocity, and node density, to compare their performances.作者: textile 時(shí)間: 2025-3-28 16:11 作者: Dappled 時(shí)間: 2025-3-28 19:21 作者: 使習(xí)慣于 時(shí)間: 2025-3-29 00:57
HTL: A Locality Bounded Flat Hash Location Servicece and destination nodes is ., the cost of query is .(..). We define this property as ..-locality bounded. HTL is the location service that achieves this property with the least storage and network overhead. Both analysis and experiment results are presented in this paper concerned with the cost, the locality bounded property and the scalability.作者: 事與愿違 時(shí)間: 2025-3-29 04:26
Accelerating the Propagation of Active Worms by Employing Multiple Target Discovery Techniquesvery techniques that can best accelerate propagation of active worms discovered from results of the comprehensive simulations. The significance of this paper lies in it being very beneficial to understanding of propagation mechanisms of active worms, and thus building effective and efficient defense systems against their propagation.作者: 北極人 時(shí)間: 2025-3-29 11:07 作者: Emg827 時(shí)間: 2025-3-29 13:15
An AIAD-Based Adaptive Routing Protocol in Ad-Hoc Wireless Networksments, the performance degrades rapidly with increasing mobility. Our primary concern is to enhance the performance of AODV by reducing the volume of the control packets like RREQ and RREP during the route discovery process effectively due to the node mobility. The propagation delays of the all poss作者: 聰明 時(shí)間: 2025-3-29 18:42 作者: Obstruction 時(shí)間: 2025-3-29 22:46
A Formal Approach to Robustness Testing of Network Protocolr, related theory is not well developed and prevalent test practices have deficiencies. This paper builds a novel NPEFSM model containing sufficient inputs and their processing rules to formalize complex protocol. Based on this model, Normal-Verification Sequence is proposed to enhance verdict mecha作者: avarice 時(shí)間: 2025-3-30 01:11
Deadline Probing: Towards Timely Cognitive Wireless Network, and often suffer from highly dynamic multi-channel environments. As they focus more on transmitting packets with the optimal channel, resources are not efficiently used when sufficient channels are available in multi-radio multi-channel systems. Decisions are made without time constraints, while i作者: nephritis 時(shí)間: 2025-3-30 06:23
SRDFA: A Kind of Session Reconstruction DFAion reconstruction for these webpages with or without frame. Moreover, SRDFA can be used to do session reconstruction on those websites which open URLs in new windows. This paper also takes an example to show that sessions reconstructed by SRDFA are more close to users’ actual browsing path.作者: 聾子 時(shí)間: 2025-3-30 11:59 作者: 單調(diào)女 時(shí)間: 2025-3-30 14:37
Feedback Control-Based Database Connection Management for Proportional Delay Differentiation-Enabledses of requests or packets according to pre-specified parameters. This paper considers providing PDD service in web application servers through feedback control-based database connection management. To achieve this goal, an approximate linear time-invariant model of the database connection pool (DBC作者: 小蟲(chóng) 時(shí)間: 2025-3-30 20:15
Research on the Detection of Distributed Denial of Service Attacks Based on the Characteristics of Ieatures’ capabilities of recognizing DDoS are analyzed through experiments. With these features as inputs, a neural network classifier is used to detect DDoS. Experiments’ results show that these IP Flow based features can be very helpful to DDoS detection if they are put together.作者: 損壞 時(shí)間: 2025-3-30 23:36
Password-Authenticated Key Exchange between Clients in a Cross-Realm Settingal aspects. AuthA is an example of such a technology considered for standardization by the IEEE P1363.2 working group. Unfortunately in its current form AuthA, including some variants, only considered the classic client and server (2-party) scenarios. In this paper, based on a variant of AuthA, we c作者: heterodox 時(shí)間: 2025-3-31 02:41 作者: FLAG 時(shí)間: 2025-3-31 07:54
Key Management Using Certificateless Public Key Cryptography in Ad Hoc Networksing attention. In this paper, we propose a distributed key management approach by using the recently developed concepts of certificateless public key cryptography and threshold secret sharing schemes. Without any assumption of prefixed trust relationship between nodes, the ad hoc network works in a 作者: HARD 時(shí)間: 2025-3-31 09:38 作者: machination 時(shí)間: 2025-3-31 13:38
HTL: A Locality Bounded Flat Hash Location Serviceed) to solve the locality problem, that in a location service, the location information can be stored potentially far away from both the source and destination nodes, even when the source and destination nodes are close. As a result, it causes high overhead in update and query. HTL uses a double ind作者: 復(fù)習(xí) 時(shí)間: 2025-3-31 21:16
Accelerating the Propagation of Active Worms by Employing Multiple Target Discovery Techniquess employing single target discovery technique and various combinations of two or three different target discovery techniques from attackers’ perspective. We performed a series of simulation experiments to investigate their propagation characteristics under various scenarios. We found uniform scannin作者: 含糊 時(shí)間: 2025-4-1 00:53
Online Accumulation: Reconstruction of Worm Propagation Pathere breached. Fast and accurate online tracing network worm during its propagation, help to detect worm origin and the earliest infected nodes, and is essential for large-scale worm containment. This paper introduces the Accumulation Algorithm which can efficiently tracing worm origin and the initia作者: 庇護(hù) 時(shí)間: 2025-4-1 02:08 作者: Verify 時(shí)間: 2025-4-1 06:28
ResourceDog: A Trusted Resource Discovery and Automatic Invocation P2P Framework drawbacks of existing P2P frameworks, such as totally decentralized structured and semantic searchable topology based on dual level DHT network hierarchy, distributed metadata storage, unified resource abstraction and trusted recommendation system based on statistic model of reputation. The Resourc作者: phlegm 時(shí)間: 2025-4-1 11:16
