发布求助
文献互助 智能选刊 最新文献

Lms Journal of Computation and Mathematics最新文献

筛选
英文 中文
Bayesian outcome selection modeling. 贝叶斯结果选择模型。
IF 1.7
Lms Journal of Computation and Mathematics Pub Date : 2023-01-01 Epub Date: 2023-03-29 DOI: 10.1002/sta4.568
Khue-Dung Dang, Louise M Ryan, Richard J Cook, Tugba Akkaya Hocagil, Sandra W Jacobson, Joseph L Jacobson
{"title":"Bayesian outcome selection modeling.","authors":"Khue-Dung Dang, Louise M Ryan, Richard J Cook, Tugba Akkaya Hocagil, Sandra W Jacobson, Joseph L Jacobson","doi":"10.1002/sta4.568","DOIUrl":"10.1002/sta4.568","url":null,"abstract":"<p><p>In psychiatric and social epidemiology studies, it is common to measure multiple different outcomes using a comprehensive battery of tests thought to be related to an underlying construct of interest. In the research that motivates our work, researchers wanted to assess the impact of in utero alcohol exposure on child cognition and neuropsychological development, which are evaluated using a range of different psychometric tests. Statistical analysis of the resulting multiple outcomes data can be challenging, because the outcomes measured on the same individual are not independent. Moreover, it is unclear, a priori, which outcomes are impacted by the exposure under study. While researchers will typically have some hypotheses about which outcomes are important, a framework is needed to help identify outcomes that are sensitive to the exposure and to quantify the associated treatment or exposure effects of interest. We propose such a framework using a modification of stochastic search variable selection, a popular Bayesian variable selection model and use it to quantify an overall effect of the exposure on the affected outcomes. The performance of the method is investigated empirically and an illustration is given through application using data from our motivating study.</p>","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"5 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10653254/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85687704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf 利用Isabelle / zf机械化的选择公理的相对一致性
Lms Journal of Computation and Mathematics Pub Date : 2021-04-26 DOI: 10.1112/S1461157000000449
Lawrence Charles Paulson
{"title":"The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf","authors":"Lawrence Charles Paulson","doi":"10.1112/S1461157000000449","DOIUrl":"https://doi.org/10.1112/S1461157000000449","url":null,"abstract":"The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle⁄ZF, building on a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the formalization unusually long, and not entirely satisfactory: two parts of the proof do not fit together. It seems impossible to solve these problems without formalizing the metatheory. However, the present development follows a standard textbook, Kenneth Kunen's Set theory: an introduction to independence proofs , and could support the formalization of further material from that book. It also serves as an example of what to expect when deep mathematics is formalized.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"6 1","pages":"198-248"},"PeriodicalIF":0.0,"publicationDate":"2021-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157000000449","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46219430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
The Linear Programming Relaxation Permutation Symmetry Group of an Orthogonal Array Defining Integer Linear Program 定义整数线性规划的正交阵列的线性规划松弛置换对称群
Lms Journal of Computation and Mathematics Pub Date : 2021-04-22 DOI: 10.1112/S1461157016000085
David M. Arquette, D. Bulutoglu
{"title":"The Linear Programming Relaxation Permutation Symmetry Group of an Orthogonal Array Defining Integer Linear Program","authors":"David M. Arquette, D. Bulutoglu","doi":"10.1112/S1461157016000085","DOIUrl":"https://doi.org/10.1112/S1461157016000085","url":null,"abstract":"There is always a natural embedding of $S_{s}wr S_{k}$\u0000 into the linear programming (LP) relaxation permutation symmetry group of an orthogonal array integer linear programming (ILP) formulation with equality constraints. The point of this paper is to prove that in the $2$\u0000 -level, strength- $1$\u0000 case the LP relaxation permutation symmetry group of this formulation is isomorphic to $S_{2}wr S_{k}$\u0000 for all $k$\u0000 , and in the $2$\u0000 -level, strength- $2$\u0000 case it is isomorphic to $S_{2}^{k}rtimes S_{k+1}$\u0000 for $kgeqslant 4$\u0000 . The strength- $2$\u0000 result reveals previously unknown permutation symmetries that cannot be captured by the natural embedding of $S_{2}wr S_{k}$\u0000 . We also conjecture a complete characterization of the LP relaxation permutation symmetry group of the ILP formulation. Supplementary materials are available with this article.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"19 1","pages":"206-216"},"PeriodicalIF":0.0,"publicationDate":"2021-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157016000085","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43223161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Lens Spaces, Isospectral on Forms but not on Functions 镜头空间，形式上的等谱，而不是函数上的等谱
Lms Journal of Computation and Mathematics Pub Date : 2019-06-18 DOI: 10.1112/S1461157000001273
Ruth Gornet, J. McGowan
{"title":"Lens Spaces, Isospectral on Forms but not on Functions","authors":"Ruth Gornet, J. McGowan","doi":"10.1112/S1461157000001273","DOIUrl":"https://doi.org/10.1112/S1461157000001273","url":null,"abstract":"This paper means to correct an error by the authors for the composite $q$ case in the paper \"Lens Spaces, Isospectral on Forms but not on Functions\", published in LMS J. Comput. Math.} 9 (2006), 270-286. All calculations and examples presented in cite{GM} for prime $q$ remain valid, and we include detailed calculations below justifying this. Our original mistake was to conclude that Formula (3.11) cite[p. 399]{Ikeda} remained true for all $q$ when in fact it is only valid if $q$ is prime. This means formulas (3) and (4) in cite{GM} must be reworked to account for complications when $q$ is composite.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"9 1","pages":"270-286"},"PeriodicalIF":0.0,"publicationDate":"2019-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44009357","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
A generalized scheme based on shifted Jacobi polynomials for numerical simulation of coupled systems of multi-term fractional-order partial differential equations 基于移位雅可比多项式的多项分数阶偏微分方程耦合系统数值模拟的广义格式
Lms Journal of Computation and Mathematics Pub Date : 2017-01-01 DOI: 10.1112/S146115701700002X
K. Shah, H. Khalil, R. Khan
{"title":"A generalized scheme based on shifted Jacobi polynomials for numerical simulation of coupled systems of multi-term fractional-order partial differential equations","authors":"K. Shah, H. Khalil, R. Khan","doi":"10.1112/S146115701700002X","DOIUrl":"https://doi.org/10.1112/S146115701700002X","url":null,"abstract":"Due to the increasing application of fractional calculus in engineering and biomedical processes, we analyze a new method for the numerical simulation of a large class of coupled systems of fractional-order partial differential equations. In this paper, we study shifted Jacobi polynomials in the case of two variables and develop some new operational matrices of fractional-order integrations as well as fractional-order differentiations. By the use of these operational matrices, we present a new and easy method for solving a generalized class of coupled systems of fractional-order partial differential equations subject to some initial conditions. We convert the system under consideration to a system of easily solvable algebraic equation without discretizing the system, and obtain a highly accurate solution. Also, the proposed method is compared with some other well-known differential transform methods. The proposed method is computer oriented. We use MatLab to perform the necessary calculation. The next two parts will appear soon.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"20 1","pages":"11-29"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S146115701700002X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63412372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 23
The Schwarzian equation for completely replicable functions 完全可复制函数的Schwarzian方程
Lms Journal of Computation and Mathematics Pub Date : 2017-01-01 DOI: 10.1112/S1461157017000031
Abdelkrim El Basraoui, J. McKay
{"title":"The Schwarzian equation for completely replicable functions","authors":"Abdelkrim El Basraoui, J. McKay","doi":"10.1112/S1461157017000031","DOIUrl":"https://doi.org/10.1112/S1461157017000031","url":null,"abstract":"We describe the Schwarzian equations for the 328 completely replicable functions with integral $q$ -coefficients [Ford et al. , ‘More on replicable functions’, Comm. Algebra 22 (1994) no. 13, 5175–5193].","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"20 1","pages":"30-52"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157017000031","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63412430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Treatment for third-order nonlinear differential equations based on the Adomian decomposition method 基于Adomian分解法的三阶非线性微分方程处理
Lms Journal of Computation and Mathematics Pub Date : 2017-01-01 DOI: 10.1112/S1461157017000018
Xueqin Lv, Jianfang Gao
{"title":"Treatment for third-order nonlinear differential equations based on the Adomian decomposition method","authors":"Xueqin Lv, Jianfang Gao","doi":"10.1112/S1461157017000018","DOIUrl":"https://doi.org/10.1112/S1461157017000018","url":null,"abstract":"The Adomian decomposition method (ADM) is an efficient method for solving linear and nonlinear ordinary differential equations, differential algebraic equations, partial differential equations, stochastic differential equations, and integral equations. Based on the ADM, a new analytical and numerical treatment is introduced in this research for third-order boundary-value problems. The effectiveness of the proposed approach is verified by numerical examples.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"20 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157017000018","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63412360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
On the zeros of Dirichlet $L$ -functions – RETRACTION 狄利克雷$L$ -函数-缩回的零点
Lms Journal of Computation and Mathematics Pub Date : 2017-01-01 DOI: 10.1112/S1461157018000013
Sami Omar, Raouf Ouni, Kamel Mazhouda
{"title":"On the zeros of Dirichlet $L$ -functions – RETRACTION","authors":"Sami Omar, Raouf Ouni, Kamel Mazhouda","doi":"10.1112/S1461157018000013","DOIUrl":"https://doi.org/10.1112/S1461157018000013","url":null,"abstract":"On the zeros of Dirichlet L-functions – RETRACTION Sami Omar, Raouf Ouni and Kamel Mazhouda (LMS J. Comput. Math. 14 (2011) 140–154) This paper [1], which was published online on 1 June 2011, has been retracted by agreement between the authors, the journal’s Editor-in-Chief Derek Holt, the London Mathematical Society and Cambridge University Press. The retraction was agreed to prevent other authors from using incorrect mathematical results.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"20 1","pages":"53-53"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157018000013","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63412442","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Finding 47:23 in the Baby Monster 在Baby Monster找到47:23
Lms Journal of Computation and Mathematics Pub Date : 2016-05-18 DOI: 10.1112/S1461157016000024
J. Bray, R. Parker, R. Wilson
{"title":"Finding 47:23 in the Baby Monster","authors":"J. Bray, R. Parker, R. Wilson","doi":"10.1112/S1461157016000024","DOIUrl":"https://doi.org/10.1112/S1461157016000024","url":null,"abstract":"In this paper we describe methods for finding very small maximal subgroups of very large groups, with particular application to the subgroup 47:23 of the Baby Monster. This example is completely intractable by standard or naive methods. The example of finding 31:15 inside the Thompson group $text{Th}$\u0000 is also discussed as a test case.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"19 1","pages":"229-234"},"PeriodicalIF":0.0,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157016000024","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63412420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Computing -series of geometrically hyperelliptic curves of genus three 三属几何超椭圆曲线级数的计算
Lms Journal of Computation and Mathematics Pub Date : 2016-05-01 DOI: 10.1112/S1461157016000383
David Harvey, Maike Massierer, Andrew V. Sutherland
{"title":"Computing -series of geometrically hyperelliptic curves of genus three","authors":"David Harvey, Maike Massierer, Andrew V. Sutherland","doi":"10.1112/S1461157016000383","DOIUrl":"https://doi.org/10.1112/S1461157016000383","url":null,"abstract":"Let C/Q be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of Q, but may not have a hyperelliptic model of the usual form over Q. We describe an algorithm that computes the local zeta functions of C at all odd primes of good reduction up to a prescribed bound N. The algorithm relies on an adaptation of the \"accumulating remainder tree\" to matrices with entries in a quadratic field. We report on an implementation, and compare its performance to previous algorithms for the ordinary hyperelliptic case.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"19 1","pages":"220-234"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157016000383","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63412284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信