{"title":"Optimizing hospital bed allocation for coordinated medical efficiency and quality improvement","authors":"Haiyue Yu, Ting Shen, Liwei Zhong","doi":"10.1007/s10878-024-01210-1","DOIUrl":"https://doi.org/10.1007/s10878-024-01210-1","url":null,"abstract":"<p>In this study, we aim to optimize hospital bed allocation to enhance medical service efficiency and quality. We developed an optimization model and algorithms considering cross-departmental bed-sharing costs, patient waiting costs, and the impact on medical quality when patients are assigned to non-primary departments. First, we propose an algorithm to calculate departmental similarity and quantify the effect on patients’ length of stay when admitted to non-primary departments. We then formulate a two-stage cost minimization problem: the first stage involves determining bed allocation for each department, and the second stage involves dynamic admission control decisions. For the second stage, we apply a dynamic programming method and approximate the model using deterministic linear programming to ensure practicality and computational efficiency. Numerical studies validate the effectiveness of our approach. Results show that our model and algorithms significantly improve bed resource utilization and medical service quality, supporting hospital management decisions.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142452390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new system of sylvester-like matrix equations with arbitrary number of equations and unknowns over the quaternion algebra","authors":"Zhuo-Heng He, Andrii Dmytryshyn, Qing-Wen Wang","doi":"10.1080/03081087.2024.2413635","DOIUrl":"https://doi.org/10.1080/03081087.2024.2413635","url":null,"abstract":"In this paper, we derive some practical necessary and sufficient conditions for the existence of a solution to a new system of coupled two-sided Sylvester-like matrix equations with arbitrary numbe...","PeriodicalId":49905,"journal":{"name":"Linear & Multilinear Algebra","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142452391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A unified local projection-based stabilized virtual element method for the coupled Stokes-Darcy problem","authors":"Sudheer Mishra, E. Natarajan","doi":"10.1007/s10444-024-10199-4","DOIUrl":"https://doi.org/10.1007/s10444-024-10199-4","url":null,"abstract":"<p>In this work, we propose and analyze a new stabilized virtual element method for the coupled Stokes-Darcy problem with Beavers-Joseph-Saffman interface condition on polygonal meshes. We derive two variants of local projection stabilization methods for the coupled Stokes-Darcy problem. The significance of local projection-based stabilization terms is that they provide reasonable control of the pressure component of the Stokes flow without involving higher-order derivative terms. The discrete inf-sup condition of the coupled Stokes-Darcy problem is established for the equal-order virtual element triplets involving velocity, hydraulic head, and pressure. The optimal error estimates are derived using the equal-order virtual elements in the energy and <span>(L^2)</span> norms. The proposed methods have several advantages: mass conservative, avoiding the coupling of the solution components, more accessible to implement, and performing efficiently on hybrid polygonal elements. Numerical experiments are conducted to depict the flexibility of the proposed methods, validating the theoretical results.</p>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142451931","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}
{"title":"Multivector Contractions Revisited, Part II","authors":"André L. G. Mandolesi","doi":"10.1007/s00006-024-01358-3","DOIUrl":"10.1007/s00006-024-01358-3","url":null,"abstract":"<div><p>The theory of contractions of multivectors, and star duality, was reorganized in a previous article, and here we present some applications. First, we study inner and outer spaces associated to a general multivector <i>M</i> via the equations <span>(v wedge M = 0)</span> and <span>(v mathbin {lrcorner }M=0)</span>. They are then used to analyze special decompositions, factorizations and ‘carvings’ of <i>M</i>, to define generalized grades, and to obtain new simplicity criteria, including a reduced set of Plücker-like relations. We also discuss how contractions are related to supersymmetry, and give formulas for supercommutators of multi-fermion creation and annihilation operators.</p></div>","PeriodicalId":7330,"journal":{"name":"Advances in Applied Clifford Algebras","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142451090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ill-Posedness for the Cauchy Problem of the Modified Camassa-Holm Equation in (B_{infty ,1}^0)","authors":"Zhen He, Zhaoyang Yin","doi":"10.1007/s00021-024-00903-1","DOIUrl":"10.1007/s00021-024-00903-1","url":null,"abstract":"<div><p>In this paper, we prove the norm inflation and get the ill-posedness for the modified Camassa-Holm equation in <span>(B_{infty ,1}^0)</span>. Therefore we completed all well-posedness and ill-posedness problem for the modified Camassa-Holm equation in all critical spaces <span>(B_{p,1}^frac{1}{p})</span> with <span>(pin [1,infty ])</span>.</p></div>","PeriodicalId":649,"journal":{"name":"Journal of Mathematical Fluid Mechanics","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142451083","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}
{"title":"Adjoint-Based Calibration of Nonlinear Stochastic Differential Equations","authors":"Jan Bartsch, Robert Denk, Stefan Volkwein","doi":"10.1007/s00245-024-10181-y","DOIUrl":"10.1007/s00245-024-10181-y","url":null,"abstract":"<div><p>To study the nonlinear properties of complex natural phenomena, the evolution of the quantity of interest can be often represented by systems of coupled nonlinear stochastic differential equations (SDEs). These SDEs typically contain several parameters which have to be chosen carefully to match the experimental data and to validate the effectiveness of the model. In the present paper the calibration of these parameters is described by nonlinear SDE-constrained optimization problems. In the optimize-before-discretize setting a rigorous analysis is carried out to ensure the existence of optimal solutions and to derive necessary first-order optimality conditions. For the numerical solution a Monte–Carlo method is applied using parallelization strategies to compensate for the high computational time. In the numerical examples an Ornstein–Uhlenbeck and a stochastic Prandtl–Tomlinson bath model are considered.</p></div>","PeriodicalId":55566,"journal":{"name":"Applied Mathematics and Optimization","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00245-024-10181-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142451029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
{"title":"The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs","authors":"Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides","doi":"10.1007/s10878-024-01207-w","DOIUrl":"https://doi.org/10.1007/s10878-024-01207-w","url":null,"abstract":"<p>An <i>s</i>, <i>t</i> Hamiltonian path <i>P</i> for an <span>(m times n)</span> rectangular grid graph <span>(mathbb {G})</span> is a Hamiltonian path from the top-left corner <i>s</i> to the bottom-right corner <i>t</i>. We define an operation “square-switch” on <i>s</i>, <i>t</i> Hamiltonian paths <i>P</i> affecting only those edges of <i>P</i> that lie in some small (2 units by 2 units) square subgrid of <span>(mathbb {G})</span>. We prove that when applied to suitable locations, the result of the square-switch is another <i>s</i>, <i>t</i> Hamiltonian path. Then we use square-switch to achieve a reconfiguration result for a subfamily of <i>s</i>, <i>t</i> Hamiltonian paths we call <i>simple paths</i>, that has the minimum number of bends for each maximal internal subpath connecting any two vertices on the boundary of the grid graph. We give an algorithmic proof that the Hamiltonian path graph <span>(mathcal {G})</span> whose vertices represent simple paths is connected when edges arise from the square-switch operation: our algorithm reconfigures any given initial simple path <i>P</i> to any given target simple path <span>(P')</span> in <span>(mathcal {O})</span>(<span>( |P |)</span>) time and <span>(mathcal {O})</span>(<span>( |P |)</span>) space using at most <span>({5} |P |/ {4})</span> square-switches, where <span>( |P |= m times n)</span> is the number of vertices in the grid graph <span>(mathbb {G})</span> and hence in any Hamiltonian path <i>P</i> for <span>(mathbb {G})</span>. Thus the diameter of the simple path graph <span>(mathcal {G})</span> is at most 5<i>mn</i>/ 4 for the square-switch operation, which we show is asymptotically tight for this operation.\u0000</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142451395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Annals of PdePub Date : 2024-10-19DOI: 10.1007/s40818-024-00187-8
Jiajun Tong, Dongyi Wei
{"title":"Geometric Properties of the 2-D Peskin Problem","authors":"Jiajun Tong, Dongyi Wei","doi":"10.1007/s40818-024-00187-8","DOIUrl":"10.1007/s40818-024-00187-8","url":null,"abstract":"<div><p>The 2-D Peskin problem describes a 1-D closed elastic string immersed and moving in a 2-D Stokes flow that is induced by its own elastic force. The geometric shape of the string and its internal stretching configuration evolve in a coupled way, and they combined govern the dynamics of the system. In this paper, we show that certain geometric quantities of the moving string satisfy extremum principles and decay estimates. As a result, we can prove that the 2-D Peskin problem admits a unique global solution when the initial data satisfies a medium-size geometric condition on the string shape, while no assumption on the size of stretching is needed.</p></div>","PeriodicalId":36382,"journal":{"name":"Annals of Pde","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142451051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Note on the Smash Product and Regular Associativity","authors":"Marco Grandis","doi":"10.1007/s10485-024-09787-8","DOIUrl":"10.1007/s10485-024-09787-8","url":null,"abstract":"<div><p>We want to study the smash product of pointed topological spaces, in an organic way and full generality, without relying on some ‘convenient subcategory’. The <i>n</i>-ary smash product has a ‘colax’ form of associativity, which supplies a categorical framework for the properties of this operation and its connection with the function spaces. Various concrete computations of smash products are given, including a large class of cases where associativity fails. Lax and colax monoidal structures are unusual and interesting, in category theory. Some parts of this note will be obvious to a topologist and others to a categorist, in order to take into account both backgrounds.</p></div>","PeriodicalId":7952,"journal":{"name":"Applied Categorical Structures","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142451017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"How Sharp Are Error Bounds? –Lower Bounds on Quadrature Worst-Case Errors for Analytic Functions–","authors":"Takashi Goda, Yoshihito Kazashi, Ken’ichiro Tanaka","doi":"10.1137/24m1634163","DOIUrl":"https://doi.org/10.1137/24m1634163","url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 62, Issue 5, Page 2370-2392, October 2024. <br/> Abstract. Numerical integration over the real line for analytic functions is studied. Our main focus is on the sharpness of the error bounds. We first derive two general lower estimates for the worst-case integration error, and then apply these to establish lower bounds for various quadrature rules. These bounds turn out to either be novel or improve upon existing results, leading to lower bounds that closely match upper bounds for various formulas. Specifically, for the suitably truncated trapezoidal rule, we improve upon general lower bounds on the worst-case error obtained by Sugihara [Numer. Math., 75 (1997), pp. 379–395] and provide exceptionally sharp lower bounds apart from a polynomial factor, and in particular we show that the worst-case error for the trapezoidal rule by Sugihara is not improvable by more than a polynomial factor. Additionally, our research reveals a discrepancy between the error decay of the trapezoidal rule and Sugihara’s lower bound for general numerical integration rules, introducing a new open problem. Moreover, the Gauss–Hermite quadrature is proven suboptimal under the decay conditions on integrands we consider, a result not deducible from upper-bound arguments alone. Furthermore, to establish the near-optimality of the suitably scaled Gauss–Legendre and Clenshaw–Curtis quadratures, we generalize a recent result of Trefethen [SIAM Rev., 64 (2022), pp. 132–150] for the upper error bounds in terms of the decay conditions.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":null,"pages":null},"PeriodicalIF":2.9,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142449547","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}