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

Relative magnetic field and slipping effect on Casson dusty fluid of two phase fluctuating flow over inclined parallel plate

引用

South African Journal of Chemical engineering 2023年 44卷 135-146页

作者： khan, Dolat Kumam, Poom Kumam, Wiyada Suttiarporn, Panawan Rehman, Ali Fixed Point Research Laboratory Fixed Point Theory and Applications Research Group Center of Excellence in Theoretical and Computational Science (TaCS-CoE) Faculty of Science King Mongkut's University of Technology Thonburi (KMUTT) 126 Pracha Uthit Rd. Bang Mod Bangkok Thung Khru 10140 Thailand Center of Excellence in Theoretical and Computational Science (TaCS-CoE) Faculty of Science King Mongkut's University of Technology Thonburi (KMUTT) 126 Pracha Uthit Rd. Bang Mod Bangkok Thung Khru 10140 Thailand Applied Mathematics for Science and Engineering Research Unit (AMSERU) Program in Applied Statistics Department of Mathematics and Computer Science Faculty of Science and Technology Rajamangala University of Technology Thanyaburi (RMUTT) Pathum Thani 12110 Thailand Faculty of Science Energy and Environment King Mongkut's University of Technology North Bangkok Rayong Campus Rayong 21120 Thailand Special Interest Group for Modelling and Data Analytics Faculty of Ocean Engineering Technology and Informatics Universiti Malaysia Terengganu Terengganu Kuala Nerus 21030 Malaysia

Due to its significant applications in magnetic devices for cell separation, magnetic drugs for cancer tumor treatment, blood flow adjustment during surgery, magnetic endoscopy, and fluid pumping in industrial and engineering processes, magnetohydrodynamics (MHD) has a wide range of applications. Therefore, the aim of this study to investigate the Relative Magnetic Field and slipping effect on Casson dusty fluid of two-phase fluctuating flow over inclined parallel plate. More exactly, the relative magnetic phenomena are fixed relatively to the plate (MFFRP) or fixed relatively to the fluid (MFFRF). The mathematical modeling was established as the set of partial differential equations for dusty Casson fluid. Buckingham's pi theorem is used to find out the dimensionless variables, to make our system dimensionless. The solution in perturb form is to find out by incorporating Poincare–Lighthill perturbation technique (PLPT). To know in-depth different parameters the graphical results for both velocities are plotted with the help of software Mathcad- 15. It is clearly detected that the relative magnetic field performs a vital part in the fluid as well as particle motion. Moreover, the relative magnetic field play a vital role in the decreasing of skin friction of both plates. © 2023

关键词： Brinkman fluid Dust particles Fluctuating vertical plate Inclined relative magnetic field PLPT

来源：评论

学校读者我要写书评

暂无评论

Geospatial Intelligence for Individual Crop Detection and Anomaly Monitoring

Geospatial Intelligence for Individual Crop Detection and An...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Freda Elikem Dorbu Leila Hashemi-Beni Department of Computational Data Science and Engineering North Carolina A&T State University Department of Built Environment Geomatics Program North Carolina A&T State University

Acquisition of geospatial data by UAV has been acknowledged as an effective method of attaining reliable and quick high-resolution remote sensing data for analysis and decision-making in different applications such as agriculture as it produces timely results, and it is affordable. UAVs coupled with other technological applications such as robotics, computing and deep learning facilitate the execution of precision agriculture. The execution of individual tree identification enables vivid description of the crop peak height and canopy for accurate estimation of issues related to crop growth such as biomass reduction, lodging, and stunted growth. A geospatial intelligence algorithm was developed to determine the lodging state of the crops. First, the optical imagery (RGB) was automatically annotated using maximum likelihood classification algorithm for faster acquisition of ground truth and to verify with the manually annotated image data for deep learning training. The acquired images were split for training of fine-tuned three deep learning methods including U-net, U-net++ and attention-residual Unet. The results show that each model has the tendency to learn patterns in data and predict lodged crops. Results from the analysis were validated by visual assessment of the time-series aerial images and validation data acquired from the ground truth data using k-fold cross validation approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Correction: Materials laboratories of the future for alloys, amorphous, and composite materials (MRS Bulletin, (2025), 50, 2, (190-207), 10.1557/s43577-024-00846-y)

引用

MRS Bulletin 2025年 1-2页

作者： Banerjee, Sarbajit Meng, Y. Shirley Minor, Andrew M. Zhang, Minghao Zaluzec, Nestor J. Chan, Maria K.Y. Seidler, Gerald McComb, David W. Agar, Joshua Mukherjee, Partha P. Melot, Brent Chapman, Karena Guiton, Beth S. Klie, Robert F. McCue, Ian D. Voyles, Paul M. Robertson, Ian Li, Ling Chi, Miaofang Destino, Joel F. Devaraj, Arun Marquis, Emmanuelle A. Segre, Carlo U. Liu, Huinan H. Yang, Judith C. Momeni, Kasra Misra, Amit Abdolrahim, Niaz Medvedeva, Julia E. Cai, Wenjun Sehirlioglu, Alp Dizbay-Onat, Melike Mehta, Apurva Graham-Brady, Lori Maruyama, Benji Rajan, Krishna Warner, Jamie H. Taheri, Mitra L. Kalinin, Sergei V. Reeja-Jayan, B. Schwarz, Udo D. Simon, Sindee L. Brown, Craig M. Department of Chemistry and Department of Materials Science & Engineering Texas A & M University College Station United States Pritzker School of Molecular Engineering The University of Chicago Chicago United States Department of Materials Science & Engineering University of California Berkeley Berkeley United States National Center for Electron Microscopy Molecular Foundry Lawrence Berkeley National Laboratory Berkeley United States Center for Nanoscale Materials Argonne National Laboratory Lemont United States Department of Physics University of Washington Seattle United States Department of Materials Science & Engineering The Ohio State University Columbus United States Department of Mechanical Engineering and Mechanics Drexel University Philadelphia United States School of Mechanical Engineering Purdue University West Lafayette United States Department of Chemistry University of Southern California Los Angeles United States Department of Chemistry Stony Brook University The State University of New York Stony Brook United States Department of Chemistry University of Kentucky Lexington United States Department of Physics University of Illinois at Chicago Chicago United States Department of Materials Science & Engineering Northwestern University Evanston Bangladesh Department of Materials Science & Engineering University of Wisconsin–Madison Madison United States Department of Materials Science and Engineering University of Pennsylvania Philadelphia United States Department of Mechanical Engineering and Materials Science Duke University Durham United States Department of Chemistry Creighton University Omaha United States Physical and Computational Sciences Directorate Pacific Northwest National Laboratory Richland United States Department of Materials Science & Engineering University of Michigan–Ann Arbor Ann Arbor United States Department of Physics Illinois Institute of Technology Chicago United States Department of Bioengineering and the Mater

This article was updated to correct Minghao Zhang’s affiliation from "Pritzker School of Molecular engineering, The University of Chicago, Chicago, USA" to "Pritzker School of Molecular engineering, The University of Chicago, Chicago, USA;Argonne National Laboratory, Lemont, USA." Argonne National Laboratory was left off the original publication. © The Author(s) 2025.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Orchard: building large cancer phylogenies using stochastic combinatorial search

arXiv

引用

arXiv 2023年

作者： Kulman, Ethan Kuang, Rui Morris, Quaid Computational and Systems Biology Program Sloan Kettering Institute New YorkNY United States Department of Computer Science and Engineering University of Minnesota MinneapolisMN United States

Phylogenies depicting the evolutionary history of genetically heterogeneous subpopulations of cells from the same cancer, i.e., cancer phylogenies, offer valuable insights about cancer development and guide treatment strategies. Many methods exist that reconstruct cancer phylogenies using point mutations detected with bulk DNA sequencing. However, these methods become inaccurate when reconstructing phylogenies with more than 30 mutations, or, in some cases, fail to recover a phylogeny altogether. Here, we introduce Orchard, a cancer phylogeny reconstruction algorithm that is fast and accurate using up to 1000 mutations. Orchard samples without replacement from a factorized approximation of the posterior distribution over phylogenies, a novel result derived in this paper. Each factor in this approximate posterior corresponds to a conditional distribution for adding a new mutation to a partially built phylogeny. Orchard optimizes each factor sequentially, generating a sequence of incrementally larger phylogenies that ultimately culminate in a complete tree containing all mutations. Our evaluations demonstrate that Orchard outperforms state-of-the-art cancer phylogeny reconstruction methods in reconstructing more plausible phylogenies across 90 simulated cancers and 14 B-progenitor acute lymphoblastic leukemias (B-ALLs). Remarkably, Orchard accurately reconstructs cancer phylogenies using up to 1,000 mutations. Additionally, we demonstrate that the large and accurate phylogenies reconstructed by Orchard are useful for identifying patterns of somatic mutations and genetic variations among distinct cancer cell subpopulations. © 2023, CC BY.

关键词： Plant diseases

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Training of a Dynamic Context-Aware Deep Denoising Framework for Low-Dose Fluoroscopic Imaging

arXiv

引用

arXiv 2024年

作者： Jeon, Sun-Young Wang, Sen Wang, Adam S. Gold, Garry E. Choi, Jang-Hwan Department of Artificial Intelligence Convergence Department of Computational Medicine Graduate Program in System Health Science and Engineering Ewha Womans University Seoul Korea Republic of Department of Radiology Stanford University StanfordCA United States

Fluoroscopy is critical for real-time X-ray visualization in medical imaging. However, low-dose images are compromised by noise, potentially affecting diagnostic accuracy. Noise reduction is crucial for maintaining image quality, especially given such challenges as motion artifacts and the limited availability of clean data in medical imaging. To address these issues, we propose an unsupervised training framework for dynamic context-aware denoising of fluoroscopy image sequences. First, we train the multi-scale recurrent attention U-Net (MSR2AU-Net) without requiring clean data to address the initial noise. Second, we incorporate a knowledge distillation-based uncorrelated noise suppression module and a recursive filtering-based correlated noise suppression module enhanced with motion compensation to further improve motion compensation and achieve superior denoising performance. Finally, we introduce a novel approach by combining these modules with a pixel-wise dynamic object motion cross-fusion matrix, designed to adapt to motion, and an edge-preserving loss for precise detail retention. To validate the proposed method, we conducted extensive numerical experiments on medical image datasets, including 3500 fluoroscopy images from dynamic phantoms (2,400 images for training, 1,100 for testing) and 350 clinical images from a spinal surgery patient. Moreover, we demonstrated the robustness of our approach across different imaging modalities by testing it on the publicly available 2016 Low Dose CT Grand Challenge dataset, using 4,800 images for training and 1,136 for testing. The results demonstrate that the proposed approach outperforms state-of-the-art unsupervised algorithms in both visual quality and quantitative evaluation while achieving comparable performance to well-established supervised learning methods across low-dose fluoroscopy and CT imaging. The related source code will be available at https://***/sunyoungIT/***. Copyright © 2024, The Auth

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

To Sharpen or not to Sharpen? On the Effect of Sharpening Filters Applied to Magnified Images 14

To Sharpen or not to Sharpen? On the Effect of Sharpening Fi...

引用

14th International Conference on Digital Image Processing, ICDIP 2022

作者： Emmendorfer, Leonardo R. de Olviveira, Vinicius Menezes Schein, Tatiana T. de Jesus, Junior C. Rodriguez, Bárbara D.A. Electrical Energy Processing Department Federal University of Santa Maria 97105-340 Brazil Center for Computational Science Federal University of Rio Grande 96201-900 Brazil Computational Modeling PhD Program Federal University of Rio Grande 96201-900 Brazil Computer Engineering Graduate Program Federal University of Rio Grande 96201-900 Brazil Institute of Mathematics Statistics and Physics Federal University of Rio Grande 96201-900 Brazil

ISBN: (纸本)9781510657564

Super-resolution algorithms aim to produce magnified high-resolution versions from low-resolution images. Some methods, however, are prone to generate blur during the process. Simple sharpening filters are adopted to alleviate this type of artifact. However, the actual effectiveness of this approach is not clear-cut in the literature. This work evaluates the effect of three simple sharpening filters on the quality of images obtained from super-resolution methods. Two metrics were considered in the evaluation: the Peak signal-to-noise ratio (PSNR) metric, and the Learned Perceptual Image Patch Similarity (LPIPS). One of the filters could consistently improve the LPIPS metric of magnified images from diverse benchmark sets on top of seven super-resolution methods. The increments obtained for the perceptual metric seem to occur due to the sharpening effect. Improvements on PSNR values were not as consistent. © 2022 SPIE.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

Particle swarm optimization with local search for height-map surface reconstruction from point clouds in reverse engineering

引用

Neural Computing and Applications 2024年 1-20页

作者： Gálvez, Akemi Fister, Iztok Deb, Suash Fister, Iztok Iglesias, Andrés Dept. of Applied Mathematics and Computational Sciences E.T.S.I. Caminos Canales y Puertos University of Cantabria Avda. de los Castros s/n Santander39005 Spain Faculty of Pharmaceutical Sciences Toho University 2-2-1 Miyama Funabashi274-8510 Japan Faculty of Electrical Engineering and Computer Science University of Maribor Koroska cesta 34 Maribor2000 Slovenia IT & Educational Consultant Ranchi India Distinguished Professorial Associate Decision Sciences and Modeling Program Victoria University Melbourne Australia

Surface reconstruction is a classical process in industrial engineering and manufacturing, particularly in reverse engineering, where the goal is to obtain a digital model from a physical object. For that purpose, the real object is typically scanned or digitized and the resulting point cloud is then fitted to mathematical surfaces through numerical optimization. The choice of the approximating functions is crucial for the accuracy of the process. Real-world objects such as manufactured workpieces often require complex nonlinear approximating functions, which are not well suited for standard numerical methods. In a previous paper presented at the ISMSI 2023 conference, we addressed this issue by using manually selected approximation functions via optimization through the cuckoo search algorithm with Lévy flights. Building upon that work, this paper presents an enhanced and extended method for surface reconstruction by using height-map surfaces obtained through a combination of exponential, polynomial and logarithmic functions. A feasible approach for this goal is to consider continuous bivariate distribution functions, which ensures consistent models along with good mathematical properties for the output shapes, such as smoothness and integrability. However, this approach leads to a difficult multivariate, constrained, multimodal continuous nonlinear optimization problem. To tackle this issue, we apply particle swarm optimization, a popular swarm intelligence technique for continuous optimization. The method is hybridized with a local search procedure for further improvement of the solutions and applied to a benchmark of 15 illustrative examples of point clouds fitted to different surface models. The performance of the method is analyzed through several computational experiments. The numerical and graphical results show that the method is able to recover the shape of the point clouds accurately and automatically. Furthermore, our approach outperforms other alternati

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Towards cross-modal causal structure and representation learning 2

Towards cross-modal causal structure and representation lear...

引用

2nd Machine Learning for Health Symposium, ML4H 2022

作者： Mao, Haiyi Liu, Hongfu Xiaotian Dou, Jason Benos, Panayiotis V. Joint CMU-Pitt PhD Program in Computational Biology University of Pittsburgh United States Michtom School of Computer Science Brandeis University United States Department of Electrical and Computer Engineering University of Pittsburgh United States Department of Epidemiology University of Florida United States

Does the SARS-CoV-2 virus cause patients' chest X-Rays ground-glass opacities? Does an IDH-mutation cause differences in patients' MRI images? Conventional causal discovery algorithms, although well developed to uncover the cause-effect relationships on structured data, cannot elucidate causal relations between unstructured images and structured scalar variables due to the complexity of the former. In this paper, we consider causal discovery between images and structured (scalar) variables. Specifically, we derive low dimensional image representations to analyze with structured variables. We propose a two-module amortized variational algorithm named Cross-Modal Variational Causal representation and structure Learning (CMCL). CMCL jointly learns identifiable representations given a set of independent structured variables and causal relations via formulating latent representations and structured variables into a direct acyclic graph. Moreover, we further enforce counterfactual invariance/variance onto representations. We demonstrate that CMCL outperforms other related methods on synthetic datasets and validate causal relations on semi-synthetic datasets by visualization. © 2022 P.N. Argaw, E. Healey & I.S. Kohane.

关键词： Coronavirus

来源：评论

学校读者我要写书评

暂无评论

Modeling of Measurement Error in Financial Returns Data

arXiv

引用

arXiv 2024年

作者： Jasra, Ajay Maama, Mohamed Mijatović, Aleksandar School of Data Science The Chinese University of Hong Kong Shenzhen China Applied Mathematics and Computational Science Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Department of Statistics University of Warwick United Kingdom

In this paper we consider the modeling of measurement error for fund returns data. In particular, given access to a time-series of discretely observed log-returns and the associated maximum over the observation period, we develop a stochastic model which models the true log-returns and maximum via a Lévy process and the data as a measurement error there-of. The main technical difficulty of trying to infer this model, for instance Bayesian parameter estimation, is that the joint transition density of the return and maximum is seldom known, nor can it be simulated exactly. Based upon the novel stick breaking representation of [12] we provide an approximation of the model. We develop a Markov chain Monte Carlo (MCMC) algorithm to sample from the Bayesian posterior of the approximated posterior and then extend this to a multilevel MCMC method which can reduce the computational cost to approximate posterior expectations, relative to ordinary MCMC. We implement our methodology on several applications including for real data. Copyright © 2024, The Authors. All rights reserved.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

COULD DROPPING A FEW CELLS CHANGE THE TAKEAWAYS FROM DIFFERENTIAL EXPRESSION?

arXiv

引用

arXiv 2023年

作者： Shiffman, Miriam Giordano, Ryan Broderick, Tamara MIT Computational & Systems Biology Program United States MIT Dept. of Electrical Engineering & Computer Science United States UC Berkeley Dept. of Statistics United States

Analysis of differential gene expression plays a fundamental role in biology toward illuminating the molecular mechanisms driving a difference between groups (e.g., due to treatment or disease). While any analysis is run on particular cells or samples, the intent is to generalize to future occurrences of the treatment or disease. Implicitly, generalization is justified under the assumption that present and future samples are independent and identically distributed from the same population. Though this assumption is always false, we might hope that any deviation from the assumption is small enough that A) fundamental conclusions of the analysis still hold, and B) standard tools like standard error, significance, and power still reflect generalizability. Conversely, we might worry about these deviations, and reliance on standard statistical tools, if conclusions could be substantively changed by dropping a very small fraction of observations. While checking every small fraction is computationally intractable, recent work develops an approximation to identify when such an influential subset exists. Building on this work, we develop a metric for dropping-data robustness of differential expression;namely, we cast the analysis in a differentiable form suitable to the approximation, extend the approximation to models whose hyperparameters depend on the full dataset, and extend the notion of a data point from a single cell to a pseudobulk observation. We then overcome the inherent non-differentiability of gene set enrichment analysis to develop an additional approximation for the robustness of top gene sets. We use our tool to assess the robustness of differential expression for published single-cell RNA-seq data, and discover that thousands of genes can have their results flipped by dropping Copyright © 2023, The Authors. All rights reserved.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：