Network and Parallel Computing: IFIP International Conference, NPC 2007, Dalian, China, September 18-21, 2007, ProceedingsKeqiu Li, Chris Jesshope, Hai Jin, Jean-Luc Gaudiot Springer, 2007. gada 18. sept. - 562 lappuses Welcome to the proceedings of the 2007 IFIP International Conference on Network and Parallel Computing (NPC 2007) held in Dalian, China. NPC 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 practitioners to present their - cellent ideas and experiences in all system fields of network and parallel computing. The main focus of NPC 2007 was on the most critical areas of network and parallel computing: network applications, network technologies, network and parallel arc- tectures, and parallel and distributed software. In total, the conference received more than 600 papers from researchers and prac- tioners from over 20 countries and areas. Each paper was reviewed by at least three internationally renowned referees and selected based on its originality, significance, correctness, relevance, and clarity of presentation. Among the high-quality subm- sions, only 53 regular papers were accepted by the conference. All of the selected conference papers are included in the conference proceedings. After the conference, some high-quality papers will be recommended to be published in a special issue of several international journals. |
Saturs
| 1 | |
| 13 | |
| 23 | |
| 31 | |
| 41 | |
Grid Scheduling Optimization Under Conditions of Uncertainty | 51 |
A Dynamic Adjustment Strategy for File Transformation in Data Grids | 61 |
Spatial Map Data Share and Parallel Dissemination System Based on Distributed Network Services and Digital Watermark | 71 |
Scheme of Defending Against DDoS Attacks in LargeScale ISP Networks | 296 |
Security Analysis of the Authentication Modules of Chinese WLAN Standard and Its Implementation Plan | 306 |
Restoration Design in IP over Reconfigurable AllOptical Networks | 315 |
A Stateful and FlowBased Intrusion Prevention System for Email Applications | 334 |
Design and Evaluation of Parallel String Matching Algorithms for Network Intrusion Detection Systems | 344 |
ObjectBased Storage Model for ObjectOriented Database | 354 |
A High Performance RDF Database | 364 |
A Direction to Avoid Reencryption in Cryptographic File Sharing | 375 |
Managing Email Overload with an Automatic Nonparametric Clustering Approach | 81 |
On the Routing Algorithms for Optical Multilog_2N Networks | 91 |
Overall Blocking Behavior Analysis on BanyanBased Optical Switching Networks Under Crosstalk Constraint | 101 |
A SmallWorld P2P Overlay Network | 114 |
Unmanned Navigation of the 110 Vehicle Using USAT | 124 |
EnergyEfficient Scheduling FixedPriority Tasks with Preemption Thresholds on Variable Voltage Processors | 133 |
Estimation of Absolute Positioning of Mobile Robot Using USAT | 143 |
A Collaborative Service Discovery and Service Sharing Framework for Mobile Ad Hoc Networks | 151 |
An Architecture for Adapting Web Page on SmallScreen Devices | 161 |
An EnergyEfficient GreedyFace Geographic Routing for Wireless Sensor Networks | 171 |
An Improved BandwidthUse Method on IEEE 80211e Standard over Wireless LAN | 183 |
Maximum LifeTime Localized Broadcast Routing in MANET | 193 |
Modulation Multiplexing Distributed SpaceTime Block Coding for TwoUser Cooperative Diversity in Wireless Network | 203 |
Modified Widest Disjoint Paths Algorithm for Multipath Routing | 212 |
Optimum Broadcasting Algorithms in n kStar Graphs Using Spanning Trees | 220 |
Link Protocol Based on DSCDMA with MUD for Decentralized AllConnected Wireless Network | 231 |
A SmallWorld Optimization Algorithm Based and ABC Supported QoS Unicast Routing Scheme | 242 |
Algorithms for the mCoverage Problem and kConnected mCoverage Problem in Wireless Sensor Networks | 250 |
A Novel Multiple Access Protocol with QoS Support for Mobile Ad Hoc Networks | 260 |
DualResidue Montgomery Multiplication | 267 |
Design and Performance Analysis of CZMLIPSec for Satellite IP Networks | 277 |
A Novel Group Key Management Based on Jacobian Elliptic Chebyshev Rational Map | 287 |
Exploit Temporal Locality of Shared Data in SRC Enabled CMP | 384 |
Architectural Implications of Cache Coherence Protocols with Network Applications on Chip MultiProcessors | 394 |
A SemiCompletelyConnected Bus for OnChip Systems | 404 |
An Instruction Folding Solution to a Java Processor | 415 |
A Novel Network Distance Prediction Mechanism | 425 |
Analytical Model of IEEE 802154 Nonbeacon Mode with Download Traffic by the Piggyback Method | 435 |
A Novel Algorithm for Estimating Flow Length DistributionsLSM | 445 |
Performance Prediction for Mappings of Distributed Applications on PC Clusters | 453 |
CommunicationPrediction of Scouting Switching in AdaptivelyRouted Torus Networks | 466 |
The Implementation and Evaluation of a LowPower Clock Distribution Network Based on EPIC | 476 |
Service Process Improvement Based on Exceptional Pattern Analysis | 486 |
An Improved Fuzzy Support Vector Machine for Credit Rating | 495 |
A CostAware Parallel Workload Allocation Approach Based on Machine Learning Techniques | 506 |
A Hierarchical Programming Model for Large Parallel Interactive Applications | 516 |
Design of a Simulator for MeshBased Reconfigurable Architectures | 526 |
Personal Grid | 536 |
On Parallel Models of Computation | 541 |
Challenges in Dependability of Networked Systems for Information Society | 542 |
Reference Architectural Styles for ServiceOriented Computing | 543 |
Author Index | 556 |
Bieži izmantoti vārdi un frāzes
according achieve algorithm analysis application approach architecture attack average bandwidth blocking broadcast cache called channel China cluster communication compared complexity component Computer connection considered cost defined delay device distance distributed dynamic effective efficient energy environment evaluate example experiment failure flow follows function given Grid IEEE implementation improve increase instructions International length mapping matching measured mechanism method module multiple node object operations optical optimal original packet parallel parameters path pattern peer performance position prediction presented probability problem processor proposed protocol received reduce References replica request requirements resource restoration routing scheduling scheme selection server sharing shown shows simulation solution step storage Table task Technology traffic transmission University
Populāri fragmenti
182. lappuse - In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM-02), volume 3 of Proceedings IEEE INFOCOM 2002, pages 1567-1576, Piscataway, NJ, USA, June 23-27 2002.
344. lappuse - Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong; email: ykwok@eee.hku.hk; I.
21. lappuse - This work is supported by National Natural Science Foundation of China under Grant No.
vi. lappuse - Thanks also go to the local conference organizers for their great support. Last but not least, we would like to express our gratitude to all of the organizations who have supported our efforts to bring the conference to fruition.
202. lappuse - M. Mauve, J. Widmer, and H. Hartenstein, "A survey on position-based routing in mobile Ad Hoc Networks.
123. lappuse - Kubiatowicz: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22 (2004): 41-53 8.
150. lappuse - A Stable Tracking Control Method for an Autonomous Mobile Robot.
10. lappuse - Higher order accurate difference solutions of fluid mechanics problems by a compact differencing technique, J.
469. lappuse - However, to capture the effects of virtual channels multiplexing, the mean message latency has to be scaled by a factor, V , representing the average degree of virtual channels multiplexing that takes place at a given physical channel. Therefore...