Search Results

Secret sharing is particularly important in the field of information security, which allows for the reconstruction of secret information from secure shares. However, due to the large amount of data and non-integer data type of 3D (three-dimensional) ...

The search for binary sequences with low peak sidelobe level value represents a formidable computational problem. To locate better sequences for this problem, we designed a stochastic algorithm that uses two fitness functions. In these fitness ...

• The two-phase optimization of binary sequences with low peak sidelobe level value.
• The concurrent computing on the graphic processing unit.
• The new best-known sequences achieved by the proposed algorithm.

The k-Nearest Neighbors algorithm is a fundamental algorithm that finds applications in many fields like Machine Learning, Computer Graphics, Computer Vision, and others. The algorithm determines the closest points (d-dimensional) of a reference ...

Various resources as the essential elements of data centers, and their utilization is vital to resource managers. In terms of the persistence, the periodicity and the spatial-temporal dependence of stream workload, a new Storm scheduler with ...

Graph pattern matching is widely used in real-world applications, such as social network analysis. Since the traditional subgraph isomorphism is NP-complete and often too restrictive to catch sensible matches, relaxed graph pattern matching models ...$$$$

This paper provides the parallel distributed Kalman filter (PDKF) with non-aligned time indexes, which uses four processing nodes to run the linear Kalman filter in parallel. To provide outputs that are in sync with the time indexes that are now ...

In this paper, a design model for resource allocation is formulated beyond 5G networks for effective data allocations in each network nodes. In all networks, data is transmitted only after allocating all resources, and an unrestrained approach is ...

Secret sharing is an important encryption technique in the field of information security. It can ensure the security of secret information. Textured 3D (three-dimensional) mesh model is an information carrier with a large amount of non-integer ...$$

Orbit prediction (OP) recently tends to be a very crucial step for supporting real-time GNSS orbit services due to the dynamic stability of navigation satellite orbits. The OP performance depends on the length of the predicted orbits and the ...

Agent-based epidemiological simulators have been proven to be one of the most successful tools for the analysis of COVID-19 propagation. The ability of these tools to reproduce the behavior and interactions of each single individual leads to ...

The optimization of sawing processes in the wood industry is critical for maximizing efficiency and profitability. The introduction of computerized tomography scanners provides sawmill operators with three-dimensional internal models of logs, ...

• A sawing optimization problem is studied considering product grading based on wane.
• Algorithms were developed to maximize value yield based on a flexible sawing scheme.
• A system employing a MIP solver was developed for decision-...

This paper proposes a hierarchical metaheuristic framework for optimally solving large-scale Euclidean Traveling Salesman Problems (TSP) that strategically embeds the clustered structure of input instances within crossed cubes interconnection networks to ...

• GMM manual parallelization method on DSP outperform automatic method(OpenMP).
• Parallelizing on a multi-core DSP platform can speed up algorithm processing.
• OpenMP's dynamic scheduling is suitable for GMM parallelization on DSP.

Scene segmentation is crucial in video processing applications, such as vehicle detection. The Gaussian Mixture Model (GMM) based background subtraction (BS) is a widely employed technique for scene segmentation. However, due to its high ...

Display Omitted

This paper studies batch processing of core maintenance in hypergraph streams. We focus on updating the coreness of each vertex after the hypergraph evolves. Unlike existing works that mainly focus on exact coreness updates for the single ...

As the size of graph data grows exponentially, it is usually processed by parallel and distributed computing environment. During parallel processing, the first step is to divide the graph data into many subgraphs and then place them on different ...

Secret sharing can protect the security of important secret information in the network environment. However, the computational complexity and processing delay increase drastically when the secret information contains large amounts of data, such as ...

Obtaining overlaps between all pairs from billions of strings is a fundamental computational challenge in de novo whole genome assembly. This paper presents a memory-efficient, massively parallel algorithm that uses GPUs to find overlaps from ...

Computing edit distance for very long strings has been hampered by quadratic time complexity with respect to string length. The WFA algorithm reduces the time complexity to a quadratic factor with respect to the edit distance between ...

• The WFA algorithm can be adapted to compute the edit distance for long strings by using a two-column approach.

Using data envelopment analysis (DEA) with large-scale data poses a big challenge to applications due to its computing-intensive nature. So far, various strategies have been proposed in academia to accelerate the DEA computation, including DEA ...

Localization in wireless sensor networks (WSN) is gaining a lot of attention from the researchers due to its usefulness in many real-time applications to identify the source of events. Wireless sensor networks are also utilized to transmit ...