Parallel applications can spend a significant amount of time performing I/O on large-scale supercomputers. Fast near-compute storage accelerators called burst buffers can reduce the time a processor spends performing ...
详细信息
We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just ...
详细信息
We propose an approach which gives the user valuable information on the various platforms avail able in a grid in order to assess the numerical quality of an algorithm run on each of these platforms. In this manner, t...
详细信息
We propose an approach which gives the user valuable information on the various platforms avail able in a grid in order to assess the numerical quality of an algorithm run on each of these platforms. In this manner, the user is provided with at least very strong hints whether a program performs reliably in a grid before actually executing it. Our approach extends IeeeCC754 by two "grid-enabled" modes: The first mode calculates a "numerical checksum" on a specific grid host and executes the job only if the check sum is identical to a locally generated one. The second mode provides the user with information on the reliability and IEEE 754-conformity of the underlying floating-point implementation of various platforms. In addition, it can help to find a set of compiler options to optimize the application's performance while retaining numerical stability
Using concepts from the Weisfeiler-Lehman (WL) test of isomorphism, we propose a mixed WL graph kernel (MWLGK) framework based on a family of efficient WL graph kernels for constructing mixed graph kernel. This family...
详细信息
The dinoflagellate Pyrodinium bahamense var. compressum has been known to be the major cause of harmful algal blooms or H.A.B. recurring in Manila Bay and other bodies of water in the Philippines. This paper proposes ...
详细信息
The dinoflagellate Pyrodinium bahamense var. compressum has been known to be the major cause of harmful algal blooms or H.A.B. recurring in Manila Bay and other bodies of water in the Philippines. This paper proposes a framework for modeling the growth and spread of an algal bloom population over a hypothetical geographic area. The model is comprised of a networked system of nodes where each node contains an instantiation of a system of difference equations describing the population dynamics of the different life cycle stages of the dinoflagellate.
Due to the growing usage of DeepFake technology to produce fake photos and videos, the problem of DeepFake identification has become a serious concern in recent years. With the use of this technology, fake material th...
Due to the growing usage of DeepFake technology to produce fake photos and videos, the problem of DeepFake identification has become a serious concern in recent years. With the use of this technology, fake material that is difficult to tell apart from real content may be produced. Therefore, the development of accurate DeepFake detection algorithms is essential to identify and prevent the spread of manipulated content. However, current publicly available DeepFake detection datasets suffer from a lack of diversity, with only a few actors appearing in multiple videos. This results in an oversampled training dataset, leading to model overfitting and inadequate performance when tested on new data. The overfitting problem can cause deep neural networks to focus more on facial features than on specific traits of DeepFake content, thereby reducing the model's ability to generalize. To address this issue and broaden the training dataset's variety, we suggest applying data augmentation methods like Face Cutout and Random Erase. The Face Cutout technique randomly removes a rectangular area of an image containing the face, while the Random Erase technique randomly removes a rectangular area of the image. These techniques introduce variations in the images, making it more challenging for the model to overfit and focus on specific traits of DeepFake content. We evaluated our approach using several models and achieved significant accuracy improvements using the EfficientnetV2B0 model and Random Erase augmentation.
Compression of speech from the TIMIT corpus was investigated for several transform domain methods coding near-best and best bases from cosine and wavelet packet transforms. Satisficing (suboptimizing) search algorithm...
详细信息
Compression of speech from the TIMIT corpus was investigated for several transform domain methods coding near-best and best bases from cosine and wavelet packet transforms. Satisficing (suboptimizing) search algorithms for selecting near-best bases were compared with optimizing algorithms for best bases in these adaptive tree-structured transforms. Experiments were performed on several hundred seconds of speech spoken by both male and female speakers from all dialect regions of the TIMIT corpus. Near-best bases provided rate-distortion performance effectively as good as that of best bases but without the additional computational penalty. Cosine packet bases outperformed wavelet packet bases.
Existing approaches for solving the lattice Boltzmann equations with finite difference methods are explicit and semi-implicit;both have certain stability constraints on the time step size. In this work, a fully implic...
详细信息
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Standard Template Library (STL), the grap...
ISBN:
(纸本)9781581132380
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Standard Template Library (STL), the graph algorithms in GGCL do not depend on the particular data structures upon which they operate, meaning a single algorithm can operate on arbitrary concrete representations of graphs. To attain this type of flexibility for graph data structures, which are more complicated than the containers in STL, we introduce several concepts to form the generic interface between the algorithms and the data structures, namely, Vertex, Edge, Visitor, and Decorator. We describe the principal abstractions comprising the GGCL, the algorithms and data structures that it provides, and provide examples that demonstrate the use of GGCL to implement some common graph algorithms. Performance results are presented which demonstrate that the use of novel lightweight implementation techniques and static polymorphism in GGCL results in code which is significantly more efficient than similar libraries written using the object-oriented paradigm.
In this paper, we introduce and evaluate a multiscale correlation-based image velocimetry approach to the estimation of in-plane displacements of ultrasound speckles. The method replaces the conventional rectangular i...
详细信息
In this paper, we introduce and evaluate a multiscale correlation-based image velocimetry approach to the estimation of in-plane displacements of ultrasound speckles. The method replaces the conventional rectangular interrogation window by a smooth Gaussian weight function and locally adapts its shape and orientation to estimated velocities by evaluating a corresponding criterion. Furthermore, displacements are continuously refined which improves the sub-pixel accuracy of the computed velocities. Experimental results are reported that we obtained by applying the method to the SA-VFI challenge datasets.
暂无评论