We consider an efficient two-party protocol for securely computing the similarity of strings w.r.t. an extended edit distance measure. Here, two parties possessing strings x and y, respectively, want to jointly comput...
详细信息
ISBN:
(纸本)9783030398811;9783030398804
We consider an efficient two-party protocol for securely computing the similarity of strings w.r.t. an extended edit distance measure. Here, two parties possessing strings x and y, respectively, want to jointly compute an approximate value for EDM(x, y), the minimum number of edit operations including substring moves needed to transform x into y, without revealing any private information. Recently, the first secure two-party protocol for this was proposed, based on homomorphic encryption, but this approach is not suitable for long strings due to its high communication and round complexities. In this paper, we propose an improved algorithm that significantly reduces the round complexity without sacrificing its cryptographic strength. We examine the performance of our algorithm for DNA sequences compared to previous one.
this book constitutes revised papers from the internationalworkshops held at the 21st internationalconference on Business Process Management, BPM 2023, in Utrecht, the Netherlands, during September 2023.;Papers from...
详细信息
ISBN:
(数字)9783031509742
ISBN:
(纸本)9783031509735
this book constitutes revised papers from the internationalworkshops held at the 21st internationalconference on Business Process Management, BPM 2023, in Utrecht, the Netherlands, during September 2023.;Papers from the following workshops are included:;• 7thinternational Workshop on Artificial Intelligence for Business Process Management (AI4BPM 2023);• 7thinternational Workshop on Business Processes Meet Internet-of-things (BP-Meet-IoT 2023);• 19thinternational Workshop on Business Process Intelligence (BPI 2023);• 16thinternational Workshop on Social and Human Aspects of Business Process Management (BPMS2 2023);• 2nd international Workshop on Data-Driven Business Process Optimization (BPO 2023);• 11thinternational Workshop on Declarative, Decision and Hybrid Approaches to Processes (DEC2H 2023);• 1st international Workshop on Digital Twins for Business Processes (DT4BP 2023);• 1st international Workshop on Formal Methods for Business Process Management (FM-BPM 2023);• 2nd international Workshop on Natural Language Processing for Business Process Management (NLP4BPM 2023);• 1st international Workshop on Object-Centric Processes from A to Z (OBJECTS 2023);• 3rd international Workshop on Change, Drift, and Dynamics of Organizational Processes (ProDy 2023);Each of the workshops focused on particular aspects of business process management. Overall, after a thorough review process, 42 full papers were selected from a total of 86 submissions.
Blockchain has emerged as a decentralized and trustable ledger for recording and storing digital transactions. the mining process of blockchain, however, requires to consume heavy computation-resources to solve the pr...
详细信息
ISBN:
(纸本)9781538678640
Blockchain has emerged as a decentralized and trustable ledger for recording and storing digital transactions. the mining process of blockchain, however, requires to consume heavy computation-resources to solve the proof-of-work puzzle, which is prohibitive from the perspective of the conventional mobile terminals (MTs). In this work, we investigate the mobile edge computing (MEC) assisted Blockchain, in which a group of MTs exploit MEC to enhance their computing-powers for solving the proof-of-work puzzle. In particular, we consider the recent advanced multiple-access MEC (MA-MEC) which enables each MT to acquire the computing-powers from several edge servers (ESs) simultaneously. We formulate a joint optimization problem which aims at maximizing the total reward of all MTs, while keeping the fairness among the MTs. Despite the nonconvexity of the problem, we propose efficient layered algorithms to compute the optimal solution. Extensive numerical results have been provided to validate the efficiency of our proposed algorithms.
Multimedia Internet of things (MIoT) network is prone to a variety of challenging constraints, especially in terms of performance and security. Employed MIoT devices can be limited in terms of power, computation, and ...
详细信息
ISBN:
(纸本)9781665464956
Multimedia Internet of things (MIoT) network is prone to a variety of challenging constraints, especially in terms of performance and security. Employed MIoT devices can be limited in terms of power, computation, and memory, which make them suffer withthe high volume of collected multimedia data. In this context, data compression is one solution to reduce the size of communicated data. However, existing lossy multimedia compression algorithms, such as JPEG and BPG, impose a practical challenge for several MIoT devices since they require high computation and memory resources. Another challenge is the errors that can occur during transmission due to channel errors, which require re-transmitting the erroneous data. In this case, channel coding is one solution. However, channel coding solutions impose overhead in terms of computation and communication resources. To reduce this overhead, in this paper, we propose a lightweight source and channel coding solution that should be applied only on the application server. this solution consists of down-scaling each input image with a factor alpha >= 2 at the MIoT device. this reduces the computation, communicated data size, and memory consumption, which would consequently reduce both energy consumption and latency. However, the down-scaled image might be corrupted by channel errors due to the reliance on the wireless connection. In addition, if the down-scaled image was encrypted, an error in one data block will propagate to other data blocks after the decryption process at the application server. thus, to avoid costly data re-transmission or redundancy, our solution proposes to apply a Deep Learning (DL) denoising/super-resolution model at the server-side to recuperate high-quality images. this model plays the role of source and channel coding algorithm. the obtained results show the effectiveness of the proposed solution, especially in terms of enhancing the visual quality of the reconstructed high-resolution images from dow
We consider the problem of extracting the morphology of a terrain discretized as a triangle mesh. We discuss first how to transpose Morse theory to the discrete case in order to describe the morphology of triangulated...
详细信息
ISBN:
(纸本)9783642240850
We consider the problem of extracting the morphology of a terrain discretized as a triangle mesh. We discuss first how to transpose Morse theory to the discrete case in order to describe the morphology of triangulated terrains. We review algorithms for computing Morse decompositions, that we have adapted and implemented for triangulated terrains. We compare the the Morse decompositions produced by them, by considering two different metrics.
We propose an efficient algorithm for approximate biased quantile computation in large data streams. Our algorithm computes decomposable biased quantile summaries on fixed sized blocks and dynamically maintains the bi...
详细信息
ISBN:
(纸本)9781595938039
We propose an efficient algorithm for approximate biased quantile computation in large data streams. Our algorithm computes decomposable biased quantile summaries on fixed sized blocks and dynamically maintains the biased quantile summary for the entire stream as the exponential histogram over the block-wise quantile summaries. the algorithm is computationally efficient and achieves an amortized computational cost of O(log(1/e log(en))) and a space requirement of O(log3en/e). Our algorithm does not assume prior knowledge of the stream sizes or the range of data values in the streams. In practice, our algorithm is able to efficiently maintain summaries over large data streams with over tens of millions of observations and achieves significant performance improvement over prior algorithms. Copyright 2007 ACM.
the proceedings contain 16 papers. the topics discussed include: the impact of length and mathematical operators on the usability and security of system-assigned one-time PINs;QRishing: the susceptibility of smartphon...
ISBN:
(纸本)9783642413193
the proceedings contain 16 papers. the topics discussed include: the impact of length and mathematical operators on the usability and security of system-assigned one-time PINs;QRishing: the susceptibility of smartphone users to QR code phishing attacks;soulmate or acquaintance? visualizing tie strength for trust inference;awareness about photos on the web and how privacy-privacy-tradeoffs could help;bootstrapping trust in online dating: social verification of online dating profiles;SHADE: secure hamming distance computation from oblivious transfer;privacy preserving data processing with collaboration of homomorphic cryptosystems;and targeting FPGA DSP slices for a large integer multiplier for integer based FHE.
the proceedings contain 25 papers. the special focus in this conference is on algorithms in Bioinformatics. the topics include: Optimal computation of avoided words;a biclique approach to reference anchored gene block...
ISBN:
(纸本)9783319436807
the proceedings contain 25 papers. the special focus in this conference is on algorithms in Bioinformatics. the topics include: Optimal computation of avoided words;a biclique approach to reference anchored gene blocks and its applications to pathogenicity islands;an efficient branch and cut algorithm to find frequently mutated subnetworks in cancer;isometric gene tree reconciliation revisited;further improvement in approximating the maximum duo-preservation string mapping problem;predicting core columns of protein multiple sequence alignments for improved parameter advising;fast compatibility testing for phylogenies with nested taxa;the gene family-free median of three;copy-number evolution problems: complexity and algorithms;a fast and memory-efficient k-mer counter with GPU-support;genome rearrangements on both gene order and intergenic regions;better identification of repeats in metagenomic scaffolding;better identification of repeats in metagenomic scaffolding;solving generalized maximum-weight connected subgraph problem for network enrichment analysis;inferring population genetic parameters: particle filtering, HMM, ripley’s k-function or runs of homozygosity?;a graph extension of the positional burrows-wheeler transform and its applications;compact universal k-mer hitting sets;a new approximation algorithm for unsigned translocation sorting;a linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates and a hybrid parameter estimation algorithm for beta mixtures and applications to methylation state classification.
Federated learning ensures that the quality of the model is uncompromised while the resulting global model is consistent withthe model trained by directly collecting user data. However, the risk of inferring data con...
详细信息
ISBN:
(纸本)9783030861308;9783030861292
Federated learning ensures that the quality of the model is uncompromised while the resulting global model is consistent withthe model trained by directly collecting user data. However, the risk of inferring data considered in federated learning. Furthermore, the inference to the learning outcome considered in a federated learning environment must satisfy that data cannot be inferred from any outcome except the owner of the data. In this paper, we propose a new federated learning scheme based on secure multi-party computation (SMC) and differential privacy. the scheme prevents inference during the learning process as well as inference of the output. Meanwhile, the scheme protects the user's local data during the learning process to ensure the correctness of the results after users' midway exits through the process.
throughout the years, biological processing demands have been addressed by relying on the design of algorithmic approaches for parallel architectures. By taking advantage of multicore processor systems, we can deal wi...
详细信息
ISBN:
(纸本)9781479955480
throughout the years, biological processing demands have been addressed by relying on the design of algorithmic approaches for parallel architectures. By taking advantage of multicore processor systems, we can deal withthe main sources of complexity which explain the NP-hard nature of multiple problems in computational biology. In this work, we address the inference of phylogenetic topologies by using two multiobjective metaheuristics: Fast Non-Dominated Sorting Genetic Algorithm and Strength Pareto Evolutionary Algorithm 2. the additional complexity introduced by the multiobjective formulation of the problem motivates that parallel designs of these algorithms must be undertaken. For this purpose, OpenMP-based implementations of these two metaheuristics are applied. To evaluate the performance of these approaches, a comparative study has been conducted by performing experimentation on four nucleotide data sets. Our experiments suggest the relevance of these parallel algorithmic designs, improving the phylogenetic results reported by other multiobjective tools in reduced execution times.
暂无评论