Pub Date : 2021-04-07DOI: 10.1007/s11786-021-00512-5
A. Hashemi, Thomas Izgin, D. Robertz, W. Seiler
{"title":"An Involutive GVW Algorithm and the Computation of Pommaret Bases","authors":"A. Hashemi, Thomas Izgin, D. Robertz, W. Seiler","doi":"10.1007/s11786-021-00512-5","DOIUrl":"https://doi.org/10.1007/s11786-021-00512-5","url":null,"abstract":"","PeriodicalId":45105,"journal":{"name":"Mathematics in Computer Science","volume":"69 1","pages":"419 - 452"},"PeriodicalIF":0.8,"publicationDate":"2021-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75340463","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}
Pub Date : 2021-03-26DOI: 10.1007/s11786-021-00506-3
Z. Kovács
{"title":"Two almost-circles, and two real ones","authors":"Z. Kovács","doi":"10.1007/s11786-021-00506-3","DOIUrl":"https://doi.org/10.1007/s11786-021-00506-3","url":null,"abstract":"","PeriodicalId":45105,"journal":{"name":"Mathematics in Computer Science","volume":"104 36","pages":"789 - 801"},"PeriodicalIF":0.8,"publicationDate":"2021-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11786-021-00506-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72376226","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}
Pub Date : 2021-03-10DOI: 10.11648/J.MCS.20210601.13
M. Asika
The study was carried out to identify relevant attributes that signals the capacity of borrower to pay back the loan and determine the fit of mathematical scoring model to evaluate credit worthiness of a potential borrower. The data was taken from primary and secondary sources which was through the use of questionnaires (primary source) while the secondary source was collection of data from all the financial statements of selected business owners in Ekpoma, Edo State credits history of these business owners as well. The descriptive research and the explanatory research designs were employed in this study. Two research questions were raised while one hypothesis was formulated to guide the study. Thirty five (35) business owners were randomly selected from Ekpoma metropolis of Edo state for this study based on loan applications and business capacity. The data collected were analyzed using Altman Z-scores, frequencies and percentages while the Pearson Product Moment Correlation Co-efficient was used to determine the relationship between Mathematical Scoring model and credits worthiness. The result showed that credit scores developed from borrower financial and non-financial records and history such as turnover, assets, previous loan repayment rate and trading capital perfectly classified them into five risk classes of A (Worthy and very able to payback), B (worthy and less able to pay back) and D (not worthy at all). The result revealed that credit score can safe award banks and creditors against credit risk default and loss of money. It was therefore recommended among others, that banks and credit facilities handlers should adopt mathematical credit scoring techniques to avoid loss of their money.
{"title":"Knowing Ahead Mathematical Determinant of Bank Customers Credit Worthiness: A Safe Strategy for Funding Loan in a Critical Economy","authors":"M. Asika","doi":"10.11648/J.MCS.20210601.13","DOIUrl":"https://doi.org/10.11648/J.MCS.20210601.13","url":null,"abstract":"The study was carried out to identify relevant attributes that signals the capacity of borrower to pay back the loan and determine the fit of mathematical scoring model to evaluate credit worthiness of a potential borrower. The data was taken from primary and secondary sources which was through the use of questionnaires (primary source) while the secondary source was collection of data from all the financial statements of selected business owners in Ekpoma, Edo State credits history of these business owners as well. The descriptive research and the explanatory research designs were employed in this study. Two research questions were raised while one hypothesis was formulated to guide the study. Thirty five (35) business owners were randomly selected from Ekpoma metropolis of Edo state for this study based on loan applications and business capacity. The data collected were analyzed using Altman Z-scores, frequencies and percentages while the Pearson Product Moment Correlation Co-efficient was used to determine the relationship between Mathematical Scoring model and credits worthiness. The result showed that credit scores developed from borrower financial and non-financial records and history such as turnover, assets, previous loan repayment rate and trading capital perfectly classified them into five risk classes of A (Worthy and very able to payback), B (worthy and less able to pay back) and D (not worthy at all). The result revealed that credit score can safe award banks and creditors against credit risk default and loss of money. It was therefore recommended among others, that banks and credit facilities handlers should adopt mathematical credit scoring techniques to avoid loss of their money.","PeriodicalId":45105,"journal":{"name":"Mathematics in Computer Science","volume":"12 1","pages":"16"},"PeriodicalIF":0.8,"publicationDate":"2021-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73434437","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}
Pub Date : 2021-03-05DOI: 10.1007/s11786-021-00500-9
E. Roanes-Lozano, Carmen Solano-Macías
{"title":"Using Fractals and Turtle Geometry to Visually Explain the Spread of a Virus to Kids: A STEM Multitarget Activity","authors":"E. Roanes-Lozano, Carmen Solano-Macías","doi":"10.1007/s11786-021-00500-9","DOIUrl":"https://doi.org/10.1007/s11786-021-00500-9","url":null,"abstract":"","PeriodicalId":45105,"journal":{"name":"Mathematics in Computer Science","volume":"4 1","pages":"689 - 699"},"PeriodicalIF":0.8,"publicationDate":"2021-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75894484","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}
Pub Date : 2021-02-27DOI: 10.1007/s11786-021-00499-z
P. Solín
{"title":"Self-Paced, Instructor-Assisted Approach to Teaching Linear Algebra","authors":"P. Solín","doi":"10.1007/s11786-021-00499-z","DOIUrl":"https://doi.org/10.1007/s11786-021-00499-z","url":null,"abstract":"","PeriodicalId":45105,"journal":{"name":"Mathematics in Computer Science","volume":"52 1","pages":"661 - 687"},"PeriodicalIF":0.8,"publicationDate":"2021-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90997579","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}
Pub Date : 2021-02-23DOI: 10.1007/s11786-021-00501-8
T. Mansour, J. L. Ramírez, Diana Toquica
{"title":"Counting Lattice Points on Bargraphs of Catalan Words","authors":"T. Mansour, J. L. Ramírez, Diana Toquica","doi":"10.1007/s11786-021-00501-8","DOIUrl":"https://doi.org/10.1007/s11786-021-00501-8","url":null,"abstract":"","PeriodicalId":45105,"journal":{"name":"Mathematics in Computer Science","volume":"79 1","pages":"701 - 713"},"PeriodicalIF":0.8,"publicationDate":"2021-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72707005","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}
Pub Date : 2021-01-28DOI: 10.11648/J.MCS.20210601.12
Víctor Pimentel, Aysajan Eziz, Tim Baker
Research in hotel revenue management system design has not paid much attention to the demand forecasting side of the system. And the research that has examined forecasting has tended to focus on the comparison of specific forecaster methodologies, as opposed to prioritizing how a total system should be parameterized: how far in the future should projections be, how much data to use to update each specific parameter, which measure of forecast error to use, and how long to freeze each parameter/forecast before updating. This paper fills this prioritization void by utilizing a full-functionality hotel reservation system simulation validated by the revenue management staff of a major hotel chain as the basis for running screening experiments on an exhaustive set of forecaster parameters with regards to their impact on bottom-line system performance (average nightly net revenue, where net revenue refers to total room rate receipts minus an overbooking per person penalty that estimates the discounted lost sales of future revenues). A screening experiment is run for each general type of operating environment (demand intensity, degree of market segment differentiation) that a property might face. We find that only two parameters are significant: the final combined forecast horizon length and how long that final forecast is frozen before updating. We find that these two factors interact in a negative fashion to influence net revenue.
{"title":"Patterns in Hotel Revenue Management Forecasting Systems: Improved Sample Sizes, Frozen Intervals, Horizon Lengths, and Accuracy Measures","authors":"Víctor Pimentel, Aysajan Eziz, Tim Baker","doi":"10.11648/J.MCS.20210601.12","DOIUrl":"https://doi.org/10.11648/J.MCS.20210601.12","url":null,"abstract":"Research in hotel revenue management system design has not paid much attention to the demand forecasting side of the system. And the research that has examined forecasting has tended to focus on the comparison of specific forecaster methodologies, as opposed to prioritizing how a total system should be parameterized: how far in the future should projections be, how much data to use to update each specific parameter, which measure of forecast error to use, and how long to freeze each parameter/forecast before updating. This paper fills this prioritization void by utilizing a full-functionality hotel reservation system simulation validated by the revenue management staff of a major hotel chain as the basis for running screening experiments on an exhaustive set of forecaster parameters with regards to their impact on bottom-line system performance (average nightly net revenue, where net revenue refers to total room rate receipts minus an overbooking per person penalty that estimates the discounted lost sales of future revenues). A screening experiment is run for each general type of operating environment (demand intensity, degree of market segment differentiation) that a property might face. We find that only two parameters are significant: the final combined forecast horizon length and how long that final forecast is frozen before updating. We find that these two factors interact in a negative fashion to influence net revenue.","PeriodicalId":45105,"journal":{"name":"Mathematics in Computer Science","volume":"23 1","pages":"8"},"PeriodicalIF":0.8,"publicationDate":"2021-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87604238","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}
Pub Date : 2021-01-18DOI: 10.11648/J.MCS.20210601.11
Yan Pan, Zhixiang Deng
The intelligent reflecting surface (IRS), which consists of a large number of reflecting units, can adjust the phase shifts of its reflecting units to strengthen the desired signal and/or suppress the undesired signal. In this paper, we consider an IRS-assisted wireless surveillance system where an IRS is deployed to assist the legal surveillance receiver E to monitor the information transmission of the suspicious link from AP to the suspicious receiver B. Two communication scenarios assuming whether the suspicious link is aware of the existence of the monitor are considered. The optimization problem under the constraint that the achievable rate at the monitor E is larger than that at the suspicious receiver B is proposed to jointly optimize the beamforming vector at the AP and the phase shift matrix at the IRS to maximize the achievable eavesdropping rate. To solve this non-convex problem, we introduce the semi-definite relaxation (SDR) approach and the alternating optimization (AO) method to convert the non-convex optimization problem to a series of semi-definite programs (SDPs) and solve the SDPs iteratively. Simulation results show that the assistance of IRS can greatly improve the performance of the surveillance, and achieves significant advantages over the traditional relay-assisted wireless surveillance system.
{"title":"Joint Beamforming Optimization for the Intelligent Reflecting Surface Assisted Wireless Surveillance System","authors":"Yan Pan, Zhixiang Deng","doi":"10.11648/J.MCS.20210601.11","DOIUrl":"https://doi.org/10.11648/J.MCS.20210601.11","url":null,"abstract":"The intelligent reflecting surface (IRS), which consists of a large number of reflecting units, can adjust the phase shifts of its reflecting units to strengthen the desired signal and/or suppress the undesired signal. In this paper, we consider an IRS-assisted wireless surveillance system where an IRS is deployed to assist the legal surveillance receiver E to monitor the information transmission of the suspicious link from AP to the suspicious receiver B. Two communication scenarios assuming whether the suspicious link is aware of the existence of the monitor are considered. The optimization problem under the constraint that the achievable rate at the monitor E is larger than that at the suspicious receiver B is proposed to jointly optimize the beamforming vector at the AP and the phase shift matrix at the IRS to maximize the achievable eavesdropping rate. To solve this non-convex problem, we introduce the semi-definite relaxation (SDR) approach and the alternating optimization (AO) method to convert the non-convex optimization problem to a series of semi-definite programs (SDPs) and solve the SDPs iteratively. Simulation results show that the assistance of IRS can greatly improve the performance of the surveillance, and achieves significant advantages over the traditional relay-assisted wireless surveillance system.","PeriodicalId":45105,"journal":{"name":"Mathematics in Computer Science","volume":"38 1","pages":"1"},"PeriodicalIF":0.8,"publicationDate":"2021-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74221900","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}
Pub Date : 2020-12-28DOI: 10.1007/s11786-020-00496-8
Sarah J. Berkemer, C. H. Z. Siederdissen, P. Stadler
{"title":"Compositional Properties of Alignments","authors":"Sarah J. Berkemer, C. H. Z. Siederdissen, P. Stadler","doi":"10.1007/s11786-020-00496-8","DOIUrl":"https://doi.org/10.1007/s11786-020-00496-8","url":null,"abstract":"","PeriodicalId":45105,"journal":{"name":"Mathematics in Computer Science","volume":"68 1","pages":"609 - 630"},"PeriodicalIF":0.8,"publicationDate":"2020-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90681035","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}
Many real-life problems, such as economic, industrial, engineering to mention but a few has been dealt with, using linear programming that assumes linearity in the objective function and constraint functions. It is noteworthy that there are many situations where the objective function and / or some or all of the constraints are non-linear functions. It is observed that many researchers have laboured so much at finding general solution approach to Non-linear programming problems but all to no avail. Of the prominent methods of solution of Non-linear programming problems: Karush- Kuhn-Tucker conditions method and Wolf modified simplex method. The Karush-Kuhn-Tucker theorem gives necessary and sufficient conditions for the existence of an optimal solution to non-linear programming problems, a finite-dimensional optimization problem where the variables have to fulfill some inequality constraints while Wolf in addition to Karush- Kuhn-Tucker conditions, modified the simplex method after changing quadratic linear function in the objective function to linear function. In this paper, an alternative method for Karush-Kuhn-Tucker conditional method is proposed. This method is simpler than the two methods considered to solve quadratic programming problems of maximizing quadratic objective function subject to a set of linear inequality constraints. This is established because of its computational efforts.
{"title":"A New Approach for Kuhn-Tucker Conditions to Solve Quadratic Programming Problems with Linear Inequality Constraints","authors":"Ayansola Olufemi Aderemi, Adejumo Adebowale Olusola","doi":"10.11648/j.mcs.20200505.11","DOIUrl":"https://doi.org/10.11648/j.mcs.20200505.11","url":null,"abstract":"Many real-life problems, such as economic, industrial, engineering to mention but a few has been dealt with, using linear programming that assumes linearity in the objective function and constraint functions. It is noteworthy that there are many situations where the objective function and / or some or all of the constraints are non-linear functions. It is observed that many researchers have laboured so much at finding general solution approach to Non-linear programming problems but all to no avail. Of the prominent methods of solution of Non-linear programming problems: Karush- Kuhn-Tucker conditions method and Wolf modified simplex method. The Karush-Kuhn-Tucker theorem gives necessary and sufficient conditions for the existence of an optimal solution to non-linear programming problems, a finite-dimensional optimization problem where the variables have to fulfill some inequality constraints while Wolf in addition to Karush- Kuhn-Tucker conditions, modified the simplex method after changing quadratic linear function in the objective function to linear function. In this paper, an alternative method for Karush-Kuhn-Tucker conditional method is proposed. This method is simpler than the two methods considered to solve quadratic programming problems of maximizing quadratic objective function subject to a set of linear inequality constraints. This is established because of its computational efforts.","PeriodicalId":45105,"journal":{"name":"Mathematics in Computer Science","volume":"35 1","pages":"86"},"PeriodicalIF":0.8,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84019060","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：