{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":21,"n_cols":5,"rows_kept":21,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[12,2,12,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996587859703316"]
[null,null,"Autore",null,"Tari Zahir"]
[null,null,"Titolo",null,"Algorithms and Architectures for Parallel Processing : 23rd International Conference, ICA3PP 2023, Tianjin, China, October 20-22, 2023, Proceedings, Part VII"]
[null,null,"Pubbl/distr/stampa",null,"Singapore : , : Springer, , 2024"]
[{"$nulls":4},"©2024"]
[null,null,"ISBN",null,"981-9708-62-1"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (375 pages)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science Series ; ; v.14493"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Intro -- Preface -- Organization -- Contents - Part VII -- An Efficient Scheduling Algorithm for Multi-mode Tasks on Near-Data Processing SSDs -- 1 Introduction -- 2 Background and Motivation -- 2.1 Task Processing of NDP-Based SSDs -- 2.2 Motivation Example -- 3 Problem Definition -- 4 Multi-mode Task Scheduling -- 4.1 Problem Analysis -- 4.2 MMTS Algorithm -- 5 Evaluation -- 5.1 Experimental Setups -- 5.2 Effect on Performance -- 5.3 Resource Utilization -- 6 Conclusion -- References -- HR-kESP: A Heuristic Algorithm for Robustness-Oriented k Edge Server Placement -- 1 Introduction -- 2 Problem and Model Formulation -- 2.1 Problem Statement -- 2.2 User Coverage -- 2.3 Network Robustness -- 2.4 Robustness-Oriented kESP Optimization Model -- 3 The Heuristic Algorithm for kESP -- 3.1 Selection of Initial Base Station -- 3.2 Gradual Generation of Server Deployment Scheme -- 3.3 HR-kESP Algorithm -- 4 Experimental Evaluation -- 4.1 Experimental Settings -- 4.2 Comparison on Different Numbers of Base Stations -- 4.3 Comparison on Different Server Budgets -- 4.4 Comparison on Different Numbers of Users -- 5 Related Work -- 6 Conclusion and Future Work -- References -- A Hybrid Kernel Pruning Approach for Efficient and Accurate CNNs -- 1 Introduction -- 2 Functional-Similarity-Based Kernel Pruning Algorithm -- 2.1 Distance-Based Kernel Pruning Algorithm -- 2.2 Hybrid Kernel Pruning Algorithm -- 3 Experimental Method -- 4 Experimental Results -- 4.1 Experimental Results for the Distance-Based Pruning Algorithm -- 4.2 Experimental Results for the Hybrid Pruning Algorithm -- 5 Analysis -- 6 Related Work -- 7 Conclusion -- References -- A Collaborative "]
[{"$nulls":4},"Migration Algorithm for Edge Services Based on Evolutionary Reinforcement Learning -- 1 Introduction -- 2 Related Work -- 3 Service Migration Model -- 3.1 Scene Description."]
[{"$nulls":4},"3.2 Service Migration Model Construction -- 3.3 Problem Formulation -- 4 Service Migration Algorithm Based on Evolutionary Reinforcement Learning -- 4.1 MDP Model -- 4.2 DEDRL-Based Service Migration Process -- 5 Experiment and Results -- 5.1 Experimental Environment and Parameter Settings -- 5.2 Analysis of Results -- 6 Conclusion -- References -- A Graph Generation Network with Privacy Preserving Capabilities -- 1 Introduction -- 2 Related Works -- 3 Preliminaries -- 3.1 Generative Adversarial Networks -- 3.2 Differential Privacy -- 4 RDPGGAN -- 5 Experimental Evaluations -- 6 Conclusion -- References -- Clustered Federated Learning Framework with Acceleration Based on Data Similarity -- 1 Introduction -- 2 Preliminaries -- 2.1 Federated Learning -- 2.2 Locality-Sensitive Hashing -- 3 Design of Our FedCSA Framework -- 3.1 Intra-group Acceleration -- 3.2 Group Aggregation -- 3.3 Privacy Analysis -- 4 Experiment and Result -- 4.1 Experiment Settings -- 4.2 Result and Analysis -- 5 Conclusion -- References -- An Anonymous Authentication Scheme with Low Overhead for Cross-Domain IoT -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 3.1 MHT and MHG -- 3.2 Zero-Knowledge Proof -- 4 Proposed Scheme -- 4.1 System Overview -- 4.2 Threat Model -- 5 Design Detail -- 5.1 Initialization Phase -- 5.2 Device Registration -- 5.3 Intra-domain Authentication -- 5.4 Cross-Domain Authentication -- 5.5 Key Agreement -- 5.6 Data Correctness Verification -- 6 Theoretical Analysis of CALA -- 7 Experiment and Evaluation -- 7.1 Experimental Settings -- 7.2 Performance Analysis -- 8 Conclusion -- References -- UAV-Assisted Data Collection and Transmission Using Petal Algorithm in Wireless Sensor Networks -- 1 Introduction -- 2 Mathematical Model for the UAV-Assisted Data Collection in WSNs -- 2.1 WSN Model and Fundamental Concepts."]
[{"$nulls":4},"2.2 Mathematical Model of the UAV-Assisted Data Collection -- 3 Petal Algorithm for the UAV-Assisted Data Collection -- 3.1 Analysis of the UAV-Assisted Data Collection in WSNs -- 3.2 Petal Algorithm for the UAV-Assisted Data Collection in WSNs -- 4 Experimental Simulation -- 4.1 Test Problem and Parameter Description -- 4.2 Comparative Analysis of Experimental Results -- 5 Conclusion -- References -- DeletePop: A DLT Execution Time Predictor Based on Comprehensive Modeling -- 1 Introduction -- 2 Background and Current Challenges -- 2.1 Distributed Strategy for Deep Learning Training -- 2.2 Job Scheduling Simulator -- 2.3 Major Challenges of Modeling and Simulation of Deep Learning Training Job -- 3 Cost Model Design -- 3.1 Modeling of the DLT Process -- 3.2 The Predicting Algorithm of the Cost Model -- 4 Simulator Design and Implementation -- 5 Evaluation -- 5.1 Prediction of Step Time (The Atomic Unit) -- 5.2 Prediction of Epoch Time -- 5.3 Performance Simulation Experiment -- 6 Related Work -- 7 Conclusion -- References -- CFChain: A Crowdfunding Platform that Supports Identity Authentication, Privacy Protection, and Efficient Audit -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 3.1 Bilinear Groups -- 3.2 BLS Aggregate Signature ch10BLS -- 3.3 Commitment and Non-interactive Zero-Knowledge Proofs -- 3.4 Distributed Identities -- 4 CFChain Overview -- 4.1 System Model -- 4.2 Threat Model and Design Goals -- 4.3 System Operations -- 5 Security Definitions -- 6 The CFChain Scheme -- 7 Security Analyse -- 8 Performance Evaluation -- 8.1 Functionality Comparison -- 8.2 Implementation -- 8.3 Performance -- 9 Conclusion -- References -- TBAF: A Two-Stage Biometric-Assisted Authentication Framework in Edge-Integrated UAV Delivery System -- 1 Introduction -- 2 Related "]
[{"$nulls":4},"Work -- 3 Preliminaries -- 3.1 Physical Unclonable Function."]
[{"$nulls":4},"3.2 Blakley Secret Sharing -- 3.3 Zero Knowledge Proofs -- 3.4 Cancelable Biometric Template Protection -- 4 The Proposed Scheme -- 4.1 System Overview -- 4.2 Three-Dimensional Space-Based Secret Sharing -- 4.3 Registration -- 4.4 Authentication and Key Negotiation -- 5 Evaluation -- 5.1 Formal Security Analysis Using BAN Logic -- 5.2 Informal Security Analysis -- 5.3 Efficiency Analysis -- 6 Conclusion and Future Work -- References -- Attention Enhanced Package Pick-Up Time Prediction via Heterogeneous Behavior Modeling -- 1 Introduction -- 2 Overview -- 2.1 Preliminaries -- 2.2 Problem Formulation -- 3 Model Design -- 3.1 Overview -- 3.2 Pre-trained Stay Time Prediction -- 3.3 Attention Enhanced Route Estimation -- 3.4 Training and Prediction -- 4 Evaluation -- 4.1 Dataset Description -- 4.2 Experimental Settings -- 4.3 Metrics -- 4.4 Baselines -- 4.5 Main Performance -- 4.6 Ablation Studies of the Pre-trained Module -- 4.7 Real-World Deployment -- 5 Discussion -- 5.1 Lessons Learned -- 5.2 Limitations and Future Works -- 6 Related Works -- 6.1 Estimate Time of Arrival Applications -- 6.2 Route Prediction in Transportation and Logistics Systems -- 6.3 Uniqueness of Our Work -- 7 Conclusion -- References -- Optimizing Pointwise Convolutions on Multi-core DSPs -- 1 Introduction and Related Work -- 2 Backgound -- 2.1 Pointwise Convolution -- 2.2 Architecture of FT-M7032 Heterogeneous Processors -- 3 Parallel Direct Implementation -- 3.1 Overview of Our Implementation -- 3.2 Multi-level Parallel Forward Propagation Algorithm -- 3.3 Multi-level Parallel Algorithms for Backward Propagation and Weight Gradient Update Propagation -- 4 Performance Evaluation -- 4.1 Experiment Setup -- 4.2 Performance -- 5 Conclusions and Future Work -- References -- Detecting SDCs in GPGPUs Through Efficient Partial Thread Redundancy -- 1 Introduction -- 2 Background."]
[{"$nulls":4},"2.1 GPGPUs Architecture and Programming Model -- 2.2 Fault Model -- 3 Thread-Level SDC Proneness Analysis -- 3.1 Vulnerability Identification -- 3.2 Intra-thread Error Propagation Analysis -- 3.3 Inter-thread Error Propagation Analysis -- 4 Partial Thread Protection Framework -- 4.1 Thread SDC Vulnerability Profiling -- 4.2 Partial Thread Redundancy -- 5 Experiment Methodology -- 6 Evaluation -- 6.1 SDC Probability Prediction Accuracy -- 6.2 Overhead -- 7 Related Work -- 8 Conclusion -- References -- FDRShare: A Fully Decentralized and Redactable EHRs Sharing Scheme with Constant-Size Ciphertexts -- 1 Introduction -- 1.1 Our Results and Contributions -- 2 Related Work -- 3 Preliminaries -- 3.1 Bilinear Pairing -- 3.2 DDH Assumption -- 3.3 Pseudo-Random Function -- 4 System Definition -- 4.1 Threat Model -- 4.2 System Model -- 5 Building Block -- 6 Detail Construction of FDRShare -- 7 Conclusion -- References -- An Efficient Fault Tolerance Strategy for Multi-task MapReduce Models Using Coded Distributed Computing -- 1 Introduction -- 2 Related Work -- 3 Preliminaries and Problem Formulation -- 3.1 The MapReduce Framework -- 3.2 Coded Distributed Computing -- 3.3 Problem Formulation -- 4 Fault Tolerance for Multiple Reduce Tasks Using Coded Distributed Computing -- 4.1 Preparation Stage -- 4.2 Map Stage -- 4.3 Shuffle Stage -- 4.4 Reduce Stage -- 5 Experiments -- 5.1 Experiment Setups -- 5.2 Experimental Results -- 6 Summary -- References -- Key-Based Transaction Reordering: An Optimized Approach for Concurrency Control in Hyperledger Fabric -- 1 Introduction -- 2 Related Work -- 2.1 Endorsement Phase Optimization -- 2.2 Ordering Phase Optimization -- 2.3 Validation Phase Optimization -- 3 Problem Definition -- 3.1 Types of Transaction Conflicts -- 3.2 Problem Formulation -- 4 System Design -- 4.1 "]
[{"$nulls":4},"System Model -- 4.2 Algorithm Design."]
[{"$nulls":4},"5 Experimental Evaluation."]