检索结果-内蒙古大学图书馆

Maximizing the Differences Between a Monotone DR-Submodular Function and a Linear Function on the Integer Lattice

Journal of the Operations Research Society of China 2024年第3期12卷 795-807页

作者： Zhen-Ning Zhang Dong-Lei Du Ran Ma Dan Wu Department of Operations Research and Information Engineering Beijing University of TechnologyBeijing100124China Faculty of Management University of New BrunswickFrederictonNB E3B 9Y2Canada School of Management Engineering Qingdao University of TechnologyQingdao266525ShandongChina School of Mathematics and Statistics Henan University of Science and TechnologyLuoyang471023HenanChina

In this paper,we investigate the maximization of the differences between a nonnegative monotone diminishing return submodular(DR-submodular)function and a nonnegative linear function on the integer *** it is almost unapproximable for maximizing a submodular function without the condition of nonnegative,we provide weak(bifactor)approximation algorithms for this problem in two online settings,*** the unconstrained online model,we combine the ideas of single-threshold greedy,binary search and function scaling to give an efficient algorithm with a 1/2 weak approximation *** the online streaming model subject to a cardinality constraint,we provide a one-pass(3-√5)/2 weak approximation ratio streaming *** memory complexity is(k log k/ε),and the update time for per element is(log^(2)k/ε).

关键词： Submodular maximization DR-submodular Integer lattice Single-threshold greedy algorithm Streaming algorithm

来源：评论

学校读者我要写书评

暂无评论

AI-based Dynamic programming Approach in Agriculture for Solving Intuitionistic Fuzzy Assignment Problems 10

AI-based Dynamic Programming Approach in Agriculture for Sol...

引用

17th INDIACom;2023 10th International Conference on Computing for Sustainable Global Development, INDIACom 2023

作者： Pal, Surya Kant Mir, S.A. Lone, Mushtaq A Mushtaq, Tabasum Roy, Rita Sirohi, Anu Sharda University Department of Mathematics Ssbsr Uttar Pradesh Greater Noida India Foh Skuast Department of Statistics J and K India Gdc Department of Statistics J and K Shopian India Gitam Institute of Technology Department of Computer Science and Engineering Andhra Pradesh Visakhapatnam India Sharda University Center for Ai in Medicine Imaging and Forensics Department of Mathematics Uttar Pradesh Greater Noida India

ISBN: (纸本)9789380544472

A well-known and most suitable method to address real-life situations is the Assignment problem. In this paper, an optimum distribution of duty of paddocks to the crops is in the Intuitionistic fuzzy (IF) assignment problem with the cost function as an Intuitionistic triangular undefined number. The assignment costs are fuzzified into crisp numbers, and a multistage decision-making method known as Dynamic Mathematical programming is used to find the best solution to the inverse problem. This study uses an AI-based dynamic programming approach in the field of agriculture. This study tries to solve the IF assignment problems. © 2023 Bharati Vidyapeeth, New Delhi.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Regulation of nucleation and crystallization for blade-coating large-area CsPbBr_(3)perovskite light-emitting diodes

引用

Science Bulletin 2025年第2期70卷 212-222页

作者： Guoyi Chen Shuxin Wang Zhiqiu Yu Chaomin Dong Peng Jia Dexin Pu Kailian Dong Hongsen Cui Hongyi Fang Chen Wang Ruimin Gao Fang Yao Weijun Ke Gang Li Guojia Fang Key Laboratory of Artificial Micro-and Nano-Structures of Ministry of Education School of Physics and TechnologyWuhan UniversityWuhan 430072China School of Mathematics and Statistics Huazhong University of Science and TechnologyWuhan 430074China School of Electronic and Electrical Engineering Wuhan Textile UniversityWuhan 430200China Shenzhen Research Institute Wuhan UniversityShenzhen 518055China Department of Electronic and Information Engineering The Hong Kong Polytechnic UniversityHong Kong 999077China

Metal halide perovskite light-emitting diodes(PeLEDs)and large-area perovskite color conversion layers for liquid crystal display exhibit great potential in the field of illumination and ***-coating method stands out as a highly suitable technique for fabricating large-scale films,albeit with challenges such as uneven nucleation coverage and non-uniformity crystallization *** this work,we developed an in-situ characterization measurement system to monitor the perovskite nucleation,and crystallization *** incorporating formamidine acetate(FAAc)into perovskite precursor solutions,the nucleation rate and nuclei density of perovskite were increased,leading to more uniform *** addition,we inserted a layer of[2-(9H-carbazol-9-yl)ethyl]phosphonic acid above the poly(9-vinylcarbazole)hole transport *** layer acts as an anchor for the perovskite nano-crystal nuclei formed in the precursor,enhancing the steric hindrance of the solute and subsequently slowing down the crystal growth rate,thereby improving crystal *** on these improvements,large-area perovskite nano-polycrystalline films with significantly improved uniformity and enhanced photoluminescence quantum yield were obtained.A small-area PeLED(2 mm×2 mm)with a maximum external quantum efficiency of 25.91%was realized,marking the highest record of PeLED prepared by bladecoating method to *** ultra-large-area PeLED(5 cm×7 cm)was also prepared,which is the largest PeLED prepared by the solution method reported so far.

关键词： Perovskite light-emitting diodes Blade-coating method Large-area LED Nucleation and crystallization regulation

来源：评论

学校读者我要写书评

暂无评论

An Efficient Global Algorithm for One-Bit Maximum-Likelihood MIMO Detection 24

An Efficient Global Algorithm for One-Bit Maximum-Likelihood...

引用

24th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2023

作者： Yu, Cheng-Yang Shao, Mingjie Chen, Wei-Kun Liu, Ya-Feng Ma, Wing-Kin Beijing Institute of Technology School of Mathematics and Statistics Beijing China Shandong University School of Information Science and Engineering Qingdao China Chinese Academy of Sciences Lsec Icmsec Academy of Mathematics and Systems Science Beijing China The Chinese University of Hong Kong Department of Electronic Engineering Hong Kong

ISBN: (纸本)9781665496261

There has been growing interest in implementing massive MIMO systems by one-bit analog-to-digital converters (ADCs), which have the benefit of reducing the power consumption and hardware complexity. One-bit MIMO detection arises in such a scenario. It aims to detect the multiuser signals from the one-bit quantized received signals in an uplink channel. In this paper, we consider one-bit maximum-likelihood (ML) MIMO detection in massive MIMO systems, which amounts to solving a large-scale nonlinear integer programming problem. We propose an efficient global algorithm for solving the one-bit ML MIMO detection problem. We first reformulate the problem as a mixed integer linear programming (MILP) problem that has a massive number of linear constraints. The massive number of linear constraints raises computational challenges. To solve the MILP problem efficiently, we custom build a light-weight branch-and-bound tree search algorithm, where the linear constraints are incrementally added during the tree search procedure and only small-size linear programming subproblems need to be solved at each iteration. We provide simulation results to demonstrate the efficiency of the proposed method. © 2023 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Improved bounds on the size of permutation codes under Kendall τ-metric

arXiv

引用

arXiv 2024年

作者： Parvaresh, Farzad Sobhani, Reza Abdollahi, Alireza Bagherian, Javad Jafari, Fatemeh Khatami, Maryam Department of Electrical Engineering University of Isfahan Isfahan Iran Department of Applied Mathematics and Computer Science Faculty of Mathematics and Statistics University of Isfahan Isfahan81746-73441 Iran Department of Pure Mathematics Faculty of Mathematics and Statistics University of Isfahan Isfahan81746-73441 Iran Tehran19395-5746 Iran

In order to overcome the challenges caused by flash memories and also to protect against errors related to reading information stored in DNA molecules in the shotgun sequencing method, the rank modulation is proposed. In the rank modulation framework, codewords are permutations. In this paper, we study the largest size P (n, d) of permutation codes of length n, i.e., subsets of the set Sn of all permutations on {1, ..., n} with the minimum distance at least d ∈ {1, . . ., (n2 )} under the Kendall τ -metric. By presenting an algorithm and some theorems, we managed to improve the known lower and upper bounds for P (n, d). In particular, we show that P (n, d) = 4 for all n ≥ 6 and 3/5(n2) n2). Additionally, we prove that for any prime number n and integer r ≤ n/6 , P (n, 3) ≤ (n − 1)! − n − 6r / √n2 − 8rn + 20r2 √ (n − 1)! / n(n − r)! . This result greatly improves the upper bound of P (n, 3) for all primes n ≥ 37. © 2024, CC BY-NC-SA.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

Online Container Scheduling for Data-intensive Applications in Serverless Edge Computing 42

Online Container Scheduling for Data-intensive Applications ...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Shang, Xiaojun Mao, Yingling Liu, Yu Huang, Yaodong Liu, Zhenhua Yang, Yuanyuan Stony Brook University Department of Electrical and Computer Engineering United States Shenzhen University College of Computer Science and Software Engineering Shenzhen China Stony Brook University Department of Applied Mathematics and Statistics United States

ISBN: (纸本)9798350334142

Introducing the emerging serverless paradigm into edge computing could avoid over- and under-provisioning of limited edge resources and make complex edge resource management transparent to application developers, which largely facilitates the cost-effectiveness, portability, and short time-to-market of edge applications. However, the computation/data dispersion and device/network heterogeneity of edge environments prevent current serverless computing platforms from acclimating to the network edge. In this paper, we address such challenges by formulating a container placement and data flow routing problem, which fully considers the heterogeneity of edge networks and the overhead of operating serverless platforms on resource-limited edge servers. We design an online algorithm to solve the problem. We further show its local optimum for each arriving container and prove its theoretical guarantee to the optimal offline solution. We also conduct extensive simulations based on practical experiment results to show the advantages of the proposed algorithm over existing baselines. © 2023 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

A New Approach for EOQ Calculation Using Modified Opportunity Cost

引用

Recent Advances in Computer Science and Communications 2022年第1期15卷 106-110页

作者： Singh, Juhi Mittal, Mandeep Pareek, Sarla Amity School of Science Engineering and Technology Haryana India Amity School of Computer Sciences Haryana Noida India Department of Mathematics and Statistics Banasthali University Rajasthan Jaipur India

Introduction: Optimal inventory levels are necessary for a firm to avoid short-age/excess of an item. The shortage of an item leads to stock out conditions resulting in loss of profit. When items are correlated with each other, the stock out condition of one item may result in the nonpurchase of its associated items also which, in turn, further brings down the profit. In this paper, this loss in profit is used to modify the opportunity cost of an item resulting in its modified EOQ. Methods: One illustrative example has been discussed which incorporates purchase dependencies in retail multi-item inventory management. The model discussed in this research paper will be motivational for researchers and inventory managers and provides a method for incorporating correlation among items while managing inventory. Results: The EOQs of items are estimated both by using the traditional method and then by using modified opportunity cost (modeled as loss profit). Results show that in frequent itemset {A, B, D}, EOQs of all three items increased when correlation among them is considered, resulting in an increase in the profit. Discussion: In inventory management system, for increasing the profit of a firm, EOQs of items need to be calculated in order to avoid shortage or excess of inventory. For explaining the approach, a very small database is taken consisting of only 5 items and 10 transactions, therefore, the increase in profit is minimal however when this approach is applied on a real database consisting of thousands of items and transactions, the increase in profit will be significant. Conclusion: One of the major focus areas of inventory management is to determine when and how much quantity of items needs to be ordered so that total inventory cost can be minimized and the profit of a firm can be maximized. However, while calculating the true value of an item and the profit it brings to the firm, it is very essential to analyze its effect on the sale of other items. Associat

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

A Theory of Non-Linear Feature Learning with One Gradient Step in Two-Layer Neural Networks 41

A Theory of Non-Linear Feature Learning with One Gradient St...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Moniri, Behrad Lee, Donghwan Hassani, Hamed Dobriban, Edgar Department of Electrical and Systems Engineering University of Pennsylvania PA United States Graduate Group in Applied Mathematics and Computational Science University of Pennsylvania PA United States Department of Statistics and Data Science University of Pennsylvania PA United States

Feature learning is thought to be one of the fundamental reasons for the success of deep neural networks. It is rigorously known that in two-layer fully-connected neural networks under certain conditions, one step of gradient descent on the first layer can lead to feature learning;characterized by the appearance of a separated rank-one component-spike-in the spectrum of the feature matrix. However, with a constant gradient descent step size, this spike only carries information from the linear component of the target function and therefore learning non-linear components is impossible. We show that with a learning rate that grows with the sample size, such training in fact introduces multiple rank-one components, each corresponding to a specific polynomial feature. We further prove that the limiting large-dimensional and large sample training and test errors of the updated neural networks are fully characterized by these spikes. By precisely analyzing the improvement in the training and test errors, we demonstrate that these non-linear features can enhance learning. Copyright 2024 by the author(s)

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Understanding Diabetes Distress: A Machine Learning Approach

Understanding Diabetes Distress: A Machine Learning Approach

引用

2024 Advances in Science and engineering Technology International Conferences, ASET 2024

作者： Alsaleh, Ahmad Abouzeid, Medhat Safwat, Omar Sulieman, Hana Al Zubaidi, Hamzah Tareq American University of Sharjah Department of Computer Science & Engineering Sharjah United Arab Emirates American University of Sharjah Department of Mathematics & Statistics Sharjah United Arab Emirates University of Sharjah Department of Pharmacy Practice & Pharmacotherapy Sharjah United Arab Emirates

ISBN: (纸本)9798350344134

Diabetes distress, a condition marked by anxiety related to diabetes management, greatly affects patient wellbeing. This research focuses on minority groups, like Arabic- speaking immigrants, where such studies are scarce. We propose a unique method using advanced machine learning techniques, including Random Forest and Support Vector Machines, integrated with filter feature selection to identify key predictors of diabetes distress efficiently. This approach aims to reduce the number of clinical parameters to examine while ensuring accurate predictions. Our dataset covers English and Arabic-speaking patients, facilitating a thorough analysis across various cultural contexts. We employed binary classification, further categorizing diabetes distress into four distinct types. This method enhances our understanding and prediction of diabetes distress, leading to more tailored and effective healthcare solutions for diverse populations. This study not only advances medical informatics but also underscores the importance of inclusive research that caters to the specific needs of minority groups. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

An Efficient Meshless Method for Hyperbolic Telegraph Equations in (1 + 1) Dimensions

引用

Computer Modeling in engineering & Sciences 2021年第8期128卷 687-698页

作者： Fuzhang Wang Enran Hou Imtiaz Ahmad Hijaz Ahmad Yan Gu College of Mathematics and Statistics Xuzhou University of TechnologyXuzhou221018China College of Mathematics Huaibei Normal UniversityHuaibei235000China Department of Mathematics University of SwabiSwabi25000Pakistan Department of Basic Sciences University of Engineering and TechnologyPeshawar25000Pakistan College of Mathematics Qingdao UniversityQingdao266071China

Numerical solutions of the second-order one-dimensional hyperbolic telegraph equations are presented using the radial basis *** purpose of this paper is to propose a simple novel direct meshless scheme for solving hyperbolic telegraph *** is fulfilled by considering time variable as normal space *** this scheme,there is no need to remove time-dependent variable during the whole solution *** the numerical solution accuracy depends on the condition of coefficient matrix derived from the radial basis function *** propose a simple shifted domain method,which can avoid the full-coefficient interpolation matrix *** experiments performed with the proposed numerical scheme for several second-order hyperbolic telegraph equations are presented with some discussions.

关键词： Radial basis functions telegraph equation shifted domain method meshless method

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：