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

Computer Sciences & Mathematics Forum最新文献

筛选
英文 中文
A New MDPI Proceedings Journal: Computer Sciences and Mathematics Forum 新MDPI学报:计算机科学与数学论坛
Computer Sciences & Mathematics Forum Pub Date : 2021-11-26 DOI: 10.3390/cmsf2021001001
Constanze Schelhorn
{"title":"A New MDPI Proceedings Journal: Computer Sciences and Mathematics Forum","authors":"Constanze Schelhorn","doi":"10.3390/cmsf2021001001","DOIUrl":"https://doi.org/10.3390/cmsf2021001001","url":null,"abstract":"Academic conferences and other scientific events are an integral part of scientific communication, serving as a platform to discuss novel findings, to establish collaborations, and to foster scholarly exchange in general [...]","PeriodicalId":155422,"journal":{"name":"Computer Sciences & Mathematics Forum","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115180459","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
Simple Methods for Traveling Salesman Problems 旅行推销员问题的简单方法
Computer Sciences & Mathematics Forum Pub Date : 2021-10-13 DOI: 10.3390/ioca2021-10914
N. Vakhania
{"title":"Simple Methods for Traveling Salesman Problems","authors":"N. Vakhania","doi":"10.3390/ioca2021-10914","DOIUrl":"https://doi.org/10.3390/ioca2021-10914","url":null,"abstract":"Here we will focus on an ongoing project on approximation algorithms for the Euclidean Traveling Salesman Problems (TSP) [...]","PeriodicalId":155422,"journal":{"name":"Computer Sciences & Mathematics Forum","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122585112","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
Advances in Crest Factor Minimization for Wide-Bandwidth Multi-Sine Signals with Non-Flat Amplitude Spectra 非平坦幅值谱宽频带多正弦信号波峰因子最小化研究进展
Computer Sciences & Mathematics Forum Pub Date : 2021-09-28 DOI: 10.3390/ioca2021-10908
H-Juergen Althoff, Maximilian Eberhardt, Steffen Geinitz, Christian Linder
{"title":"Advances in Crest Factor Minimization for Wide-Bandwidth Multi-Sine Signals with Non-Flat Amplitude Spectra","authors":"H-Juergen Althoff, Maximilian Eberhardt, Steffen Geinitz, Christian Linder","doi":"10.3390/ioca2021-10908","DOIUrl":"https://doi.org/10.3390/ioca2021-10908","url":null,"abstract":"Multi-sine excitation signals give spectroscopic insight into fast chemical processes over bandwidths from 101 Hz to 107 Hz. The crest factor (CF) determines the information density of a multi-sine signal. Minimizing the CF yields higher information density and is the goal of the presented work. Four algorithms and a combination of two of them are presented. The first two algorithms implement different iterative optimizations of the amplitude and phase angle values of the signal. The combined algorithm alternates between the first and second optimization algorithms. Additionally, a simulated annealing approach and a genetic algorithm optimizing the CF were implemented.","PeriodicalId":155422,"journal":{"name":"Computer Sciences & Mathematics Forum","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125521258","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
Maximum Multi-Commodity Flow with Proportional and Flow-Dependent Capacity Sharing 具有比例和流量相关容量共享的最大多商品流
Computer Sciences & Mathematics Forum Pub Date : 2021-09-26 DOI: 10.3390/ioca2021-10904
D. Khanal, Urmila Pyakurel, T. N. Dhamala, S. Dempe
{"title":"Maximum Multi-Commodity Flow with Proportional and Flow-Dependent Capacity Sharing","authors":"D. Khanal, Urmila Pyakurel, T. N. Dhamala, S. Dempe","doi":"10.3390/ioca2021-10904","DOIUrl":"https://doi.org/10.3390/ioca2021-10904","url":null,"abstract":"Multi-commodity flow problems concerned with the transshipment of more than one commodity from respective sources to the corresponding sinks without violating the capacity constraints on the arcs. If the objective of the problem is to send the maximum amount of flow within a given time horizon, then it becomes the maximum flow problem. In multi-commodity flow problems, the flow of different commodities departing from their sources arriving at the common intermediate node have to share the capacity through the arc. The sharing of the capacity in the common arc (bundle arc) is one of the major issues in the multi-commodity flow problems. In this paper, we introduce the maximum static and maximum dynamic multi-commodity flow problems with proportional capacity sharing and present polynomial time algorithms to solve the problems. Similarly, we investigate the maximum dynamic multi-commodity flow problems with flow-dependent capacity sharing and present a pseudo-polynomial time solution strategy.","PeriodicalId":155422,"journal":{"name":"Computer Sciences & Mathematics Forum","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121958095","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
Parallel WSAR for Solving Permutation Flow Shop Scheduling Problem 求解置换流水车间调度问题的并行WSAR
Computer Sciences & Mathematics Forum Pub Date : 2021-09-26 DOI: 10.3390/ioca2021-10901
A. Baykasoğlu, M. E. Şenol
{"title":"Parallel WSAR for Solving Permutation Flow Shop Scheduling Problem","authors":"A. Baykasoğlu, M. E. Şenol","doi":"10.3390/ioca2021-10901","DOIUrl":"https://doi.org/10.3390/ioca2021-10901","url":null,"abstract":"This study presents a coalition-based parallel metaheuristic algorithm for solving the Permutation Flow Shop Scheduling Problem (PFSP). This novel approach incorporates five different single-solution-based metaheuristic algorithms (SSBMA) (Simulated Annealing Algorithm, Random Search Algorithm, Great Deluge Algorithm, Threshold Accepting Algorithm and Greedy Search Algorithm) and a population-based algorithm (Weighted Superposition Attraction–Repulsion Algorithm) (WSAR). While SSBMAs are responsible for exploring the search space, WSAR serves as a controller that handles the coalition process. SSBMAs perform their searches simultaneously through the MATLAB parallel programming tool. The proposed approach is tested on PFSP against the state-of-the-art algorithms in the literature. Moreover, the algorithm is also tested against its constituents (SSBMAS and WSAR) and its serial version. Non-parametric statistical tests are organized to compare the performances of the proposed approach statistically with the state-of-the-art algorithms, its constituents and its serial version. The statistical results prove the effectiveness of the proposed approach.","PeriodicalId":155422,"journal":{"name":"Computer Sciences & Mathematics Forum","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125075356","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
Two Optimized IoT Device Architectures Based on Fast Fourier Transform to Monitor Patient’s Photoplethysmography and Body Temperature 基于快速傅立叶变换的两种优化物联网设备架构监测患者光容积脉搏波和体温
Computer Sciences & Mathematics Forum Pub Date : 2021-09-26 DOI: 10.3390/ioca2021-10905
J. Kodithuwakku, Dilki Dandeniya Arachchi, Saw Thiha, Jay Rajasekera
{"title":"Two Optimized IoT Device Architectures Based on Fast Fourier Transform to Monitor Patient’s Photoplethysmography and Body Temperature","authors":"J. Kodithuwakku, Dilki Dandeniya Arachchi, Saw Thiha, Jay Rajasekera","doi":"10.3390/ioca2021-10905","DOIUrl":"https://doi.org/10.3390/ioca2021-10905","url":null,"abstract":"The measurement of blood-oxygen saturation (SpO2), heart rate (HR), and body temperature are very critical in monitoring patients. Photoplethysmography (PPG) is an optical method that can be used to measure heart rate, blood-oxygen saturation, and many analytics about cardiovascular health of a patient by analyzing the waveform. With the COVID-19 pandemic, there is a high demand for a product that can remotely monitor such parameters of a COVID-19 patient. This paper proposes two major design architectures for the product with optimized system implementations by utilizing the ESP32 development environment and cloud computing. In one method, it discusses edge computing with the fast Fourier transform (FFT) and valley detection algorithms to extract features from the waveform before transferring data to the cloud, and the other method transfers raw sensor values to the cloud without any loss of information. This paper especially compares the performance of both system architectures with respect to bandwidth, sampling frequency, and loss of information.","PeriodicalId":155422,"journal":{"name":"Computer Sciences & Mathematics Forum","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126387144","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
A Bicriteria Model for Saving a Path Minimizing the Time Horizon of a Dynamic Contraflow 最小化动态逆向流时间范围的路径保存双准则模型
Computer Sciences & Mathematics Forum Pub Date : 2021-09-25 DOI: 10.3390/ioca2021-10897
H. Nath, T. N. Dhamala, S. Dempe
{"title":"A Bicriteria Model for Saving a Path Minimizing the Time Horizon of a Dynamic Contraflow","authors":"H. Nath, T. N. Dhamala, S. Dempe","doi":"10.3390/ioca2021-10897","DOIUrl":"https://doi.org/10.3390/ioca2021-10897","url":null,"abstract":"The quickest contraflow in a single-source-single-sink network is a dynamic flow that minimizes the time horizon of a given flow value at the source to be sent to the sink allowing arc reversals. Because of the arc reversals, for a sufficiently large value of the flow, the residual capacity of all or most of the paths towards the source, from a given node, may be zero or reduced significantly. In some cases, e.g., for the movement of facilities to support an evacuation in an emergency, it is imperative to save a path from a given node towards the source. We formulate such a problem as a bicriteria optimization problem, in which one objective minimizes the length of the path to be saved from a specific node towards the source, and the other minimizes the quickest time of the flow from the source towards the sink, allowing arc reversals. We propose an algorithm based on the epsilon-constraint approach to find non-dominated solutions.","PeriodicalId":155422,"journal":{"name":"Computer Sciences & Mathematics Forum","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116342651","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
Unscented Kalman Filter Empowered by Bayesian Model Evidence for System Identification in Structural Dynamics 基于贝叶斯模型证据的无气味卡尔曼滤波在结构动力学系统识别中的应用
Computer Sciences & Mathematics Forum Pub Date : 2021-09-25 DOI: 10.3390/ioca2021-10896
Luca Rosafalco, S. Eftekhar Azam, A. Manzoni, A. Corigliano, S. Mariani
{"title":"Unscented Kalman Filter Empowered by Bayesian Model Evidence for System Identification in Structural Dynamics","authors":"Luca Rosafalco, S. Eftekhar Azam, A. Manzoni, A. Corigliano, S. Mariani","doi":"10.3390/ioca2021-10896","DOIUrl":"https://doi.org/10.3390/ioca2021-10896","url":null,"abstract":"System identification is often limited to parameter identification, while model uncertainties are disregarded or accounted for by a fictitious process noise. However, modelling assumptions may have a large impact on system identification. For this reason, we propose to use an unscented Kalman filter (UKF) empowered by online Bayesian model evidence computation for the sake of system identification and model selection. This approach employs more than one model to track the state of the system and associates with each model a plausibility measure, updated whenever new measurements are available. The filter outcomes obtained for different models are then compared and a quantitative confidence value is associated with each of them. Only the system identification outcomes related to the model with the highest plausibility are considered. While the coupling of extended Kalman filters (EKFs) and Bayesian model evidence was already addressed, we modify the approach to exploit the most striking features of the UKF, namely, the ease of implementation and higher-order accuracy in the description of the evolution of the state mean and variance. A challenging identification problem related to structural dynamics is discussed to show the effectiveness of the proposed methodology.","PeriodicalId":155422,"journal":{"name":"Computer Sciences & Mathematics Forum","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117188802","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
An Image-Based Algorithm for the Automatic Detection of Loosened Bolts 一种基于图像的螺栓松动自动检测算法
Computer Sciences & Mathematics Forum Pub Date : 2021-09-23 DOI: 10.3390/ioca2021-10893
T. Huynh, Nhat-Duc Hoang, Duc-Duy Ho, Xuan-Linh Tran
{"title":"An Image-Based Algorithm for the Automatic Detection of Loosened Bolts","authors":"T. Huynh, Nhat-Duc Hoang, Duc-Duy Ho, Xuan-Linh Tran","doi":"10.3390/ioca2021-10893","DOIUrl":"https://doi.org/10.3390/ioca2021-10893","url":null,"abstract":"The bolted joint has been widely used to connect load-bearing elements in aerospace, civil, and mechanical engineering systems. During its service life, particularly under external dynamical loads, a bolted joint may undergo self-loosening. Bolt looseness causes a reduction in its load-bearing capacity and eventually leads to the failure of a bolted joint. This paper presents an automated image-based algorithm combining the Faster R-CNN model with image processing for the quick detection of loosened bolts in a structural connection. The algorithm is validated using a lab-scale bolted joint model for which various bolt-loosening events are simulated. The imagery data of the joint is captured and passed through the algorithm for bolt looseness detection. The obtained results show that the loosened bolts in the joint were well-detected and that their loosening degrees were precisely quantified; therefore, the image-based algorithm is promising for real-time structural health monitoring of realistic bolted joints.","PeriodicalId":155422,"journal":{"name":"Computer Sciences & Mathematics Forum","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122782526","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
A Generative Adversarial Network Based Autoencoder for Structural Health Monitoring 基于生成对抗网络的结构健康监测自编码器
Computer Sciences & Mathematics Forum Pub Date : 2021-09-22 DOI: 10.3390/ioca2021-10887
Giorgia Colombera, Luca Rosafalco, Matteo Torzoni, F. Gatti, S. Mariani, Andrea Manzoni, A. Corigliano
{"title":"A Generative Adversarial Network Based Autoencoder for Structural Health Monitoring","authors":"Giorgia Colombera, Luca Rosafalco, Matteo Torzoni, F. Gatti, S. Mariani, Andrea Manzoni, A. Corigliano","doi":"10.3390/ioca2021-10887","DOIUrl":"https://doi.org/10.3390/ioca2021-10887","url":null,"abstract":"Civil structures, infrastructures and lifelines are constantly threatened by natural hazards and climate change. Structural Health Monitoring (SHM) has therefore become an active field of research in view of online structural damage detection and long term maintenance planning. In this work, we propose a new SHM approach leveraging a deep Generative Adversarial Network (GAN), trained on synthetic time histories representing the structural responses of both damaged and undamaged multistory building to earthquake ground motion. In the prediction phase, the GAN generates plausible signals for different damage states, based only on undamaged recorded or simulated structural responses, thus without the need to rely upon real recordings linked to damaged conditions.","PeriodicalId":155422,"journal":{"name":"Computer Sciences & Mathematics Forum","volume":"56 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123447322","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}
引用次数: 2
下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信