Mathematics最新文献_第4页

On Properties of the Hyperbolic Distribution 论双曲线分布的性质

IF 2.4 3区数学

Mathematics Pub Date : 2024-09-16 DOI: 10.3390/math12182888

Roman V. Ivanov

引用次数: 0

C-Semigroups and Their Induced Order C 族半群及其诱导有序

IF 2.4 3区数学

Mathematics Pub Date : 2024-09-16 DOI: 10.3390/math12182889

Daniel Marín-Aragón, Raquel Tapia-Ramos

引用次数: 0

Applications of the Hahn-Banach Theorem, a Solution of the Moment Problem and the Related Approximation 哈恩-巴拿赫定理的应用、矩问题的解法及相关近似法

IF 2.4 3区数学

Mathematics Pub Date : 2024-09-15 DOI: 10.3390/math12182878

Octav Olteanu

引用次数: 0

Fixed-Point and Random Fixed-Point Theorems in Preordered Sets Equipped with a Distance Metric 配备距离度量的有序集合中的定点定理和随机定点定理

IF 2.4 3区数学

Mathematics Pub Date : 2024-09-15 DOI: 10.3390/math12182877

Himanshu Baranwal, Ravindra Kishor Bisht, Arya Kumar Bedabrata Chand, Jen-Chih Yao

引用次数: 0

Multi-Type Self-Attention-Based Convolutional-Neural-Network Post-Filtering for AV1 Codec 用于 AV1 编解码器的基于卷积神经网络的多类型自注意后过滤技术

IF 2.4 3区数学

Mathematics Pub Date : 2024-09-15 DOI: 10.3390/math12182874

Woowoen Gwun, Kiho Choi, Gwang Hoon Park

{"title":"Multi-Type Self-Attention-Based Convolutional-Neural-Network Post-Filtering for AV1 Codec","authors":"Woowoen Gwun, Kiho Choi, Gwang Hoon Park","doi":"10.3390/math12182874","DOIUrl":"https://doi.org/10.3390/math12182874","url":null,"abstract":"Over the past few years, there has been substantial interest and research activity surrounding the application of Convolutional Neural Networks (CNNs) for post-filtering in video coding. Most current research efforts have focused on using CNNs with various kernel sizes for post-filtering, primarily concentrating on High-Efficiency Video Coding/H.265 (HEVC) and Versatile Video Coding/H.266 (VVC). This narrow focus has limited the exploration and application of these techniques to other video coding standards such as AV1, developed by the Alliance for Open Media, which offers excellent compression efficiency, reducing bandwidth usage and improving video quality, making it highly attractive for modern streaming and media applications. This paper introduces a novel approach that extends beyond traditional CNN methods by integrating three different self-attention layers into the CNN framework. Applied to the AV1 codec, the proposed method significantly improves video quality by incorporating these distinct self-attention layers. This enhancement demonstrates the potential of self-attention mechanisms to revolutionize post-filtering techniques in video coding beyond the limitations of convolution-based methods. The experimental results show that the proposed network achieves an average BD-rate reduction of 10.40% for the Luma component and 19.22% and 16.52% for the Chroma components compared to the AV1 anchor. Visual quality assessments further validated the effectiveness of our approach, showcasing substantial artifact reduction and detail enhancement in videos.","PeriodicalId":18303,"journal":{"name":"Mathematics","volume":"15 1","pages":""},"PeriodicalIF":2.4,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142249134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Mathematical Formulations for Predicting Pressure Drop in Solid–Liquid Slurry Flow through a Straight Pipe Using Computational Modeling 利用计算建模预测固液浆液流经直管时压降的数学公式

IF 2.4 3区数学

Mathematics Pub Date : 2024-09-15 DOI: 10.3390/math12182879

Tanuj Joshi, Abhinav Gupta, Om Parkash, Ralph Kristoffer B. Gallegos, Nay Lin Oo, Gopal Krishan

引用次数: 0

On Signifiable Computability: Part I: Signification of Real Numbers, Sequences, and Types 论可符号计算性：第一部分：实数、序列和类型的符号化

IF 2.4 3区数学

Mathematics Pub Date : 2024-09-15 DOI: 10.3390/math12182881

Vladimir A. Kulyukin

引用次数: 0

Imputing Missing Data in One-Shot Devices Using Unsupervised Learning Approach 使用无监督学习方法推算一次性设备中的缺失数据

IF 2.4 3区数学

Mathematics Pub Date : 2024-09-15 DOI: 10.3390/math12182884

Hon Yiu So, Man Ho Ling, Narayanaswamy Balakrishnan

{"title":"Imputing Missing Data in One-Shot Devices Using Unsupervised Learning Approach","authors":"Hon Yiu So, Man Ho Ling, Narayanaswamy Balakrishnan","doi":"10.3390/math12182884","DOIUrl":"https://doi.org/10.3390/math12182884","url":null,"abstract":"One-shot devices are products that can only be used once. Typical one-shot devices include airbags, fire extinguishers, inflatable life vests, ammo, and handheld flares. Most of them are life-saving products and should be highly reliable in an emergency. Quality control of those productions and predicting their reliabilities over time is critically important. To assess the reliability of the products, manufacturers usually test them in controlled conditions rather than user conditions. We may rely on public datasets that reflect their reliability in actual use, but the datasets often come with missing observations. The experimenter may lose information on covariate readings due to human errors. Traditional missing-data-handling methods may not work well in handling one-shot device data as they only contain their survival statuses. In this research, we propose Multiple Imputation with Unsupervised Learning (MIUL) to impute the missing data using Hierarchical Clustering, k-prototype, and density-based spatial clustering of applications with noise (DBSCAN). Our simulation study shows that MIUL algorithms have superior performance. We also illustrate the method using datasets from the Crash Report Sampling System (CRSS) of the National Highway Traffic Safety Administration (NHTSA).","PeriodicalId":18303,"journal":{"name":"Mathematics","volume":"116 1","pages":""},"PeriodicalIF":2.4,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142249144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Learning Unsupervised Cross-Domain Model for TIR Target Tracking 学习用于近红外目标跟踪的无监督跨域模型

IF 2.4 3区数学

Mathematics Pub Date : 2024-09-15 DOI: 10.3390/math12182882

Xiu Shu, Feng Huang, Zhaobing Qiu, Xinming Zhang, Di Yuan

引用次数: 0

Study on Single-Machine Common/Slack Due-Window Assignment Scheduling with Delivery Times, Variable Processing Times and Outsourcing 具有交货时间、可变处理时间和外包的单机共同/松弛到期窗口作业调度研究

IF 2.4 3区数学

Mathematics Pub Date : 2024-09-15 DOI: 10.3390/math12182883

Bing Bai, Cai-Min Wei, Hong-Yu He, Ji-Bo Wang

{"title":"Study on Single-Machine Common/Slack Due-Window Assignment Scheduling with Delivery Times, Variable Processing Times and Outsourcing","authors":"Bing Bai, Cai-Min Wei, Hong-Yu He, Ji-Bo Wang","doi":"10.3390/math12182883","DOIUrl":"https://doi.org/10.3390/math12182883","url":null,"abstract":"Single-machine due-window assignment scheduling with delivery times and variable processing times is investigated, where the variable processing time of a job means that the processing time is a function of its position in a sequence and its resource allocation. Currently, there are multiple optimization objectives for the due-window assignment problem, and there is a small amount of research on optimization problems where the window starting time, the rejected cost and the optimal scheduling are jointly required. The goal of this paper is to minimize the weighed sum of scheduling cost, resource consumption cost and outsourcing measure under the optional job outsourcing (rejection). Under two resource allocation models (i.e., linear and convex resource allocation models), the scheduling cost is the weighted sum of the number of early–tardy jobs, earliness–tardiness penalties and due-window starting time and size, where the weights are positional-dependent. The main contributions of this paper include the study and data simulation of single-machine scheduling with learning effects, delivery times and outsourcing cost. For the weighed sum of scheduling cost, resource consumption cost and outsourcing measure, we prove the polynomial solvability of the problem. Under the common and slack due-window assignments, through the theoretical analysis of the optimal solution, we reveal that four problems can be solved in O(n6) time, where n is the number of jobs.","PeriodicalId":18303,"journal":{"name":"Mathematics","volume":"5 1","pages":""},"PeriodicalIF":2.4,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142249143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0