scholarly journals A k-Distribution-Based Spectral Module for Radiation Calculations in Multi-Phase Mixtures

2009 ◽  
Author(s):  
Gopalendu Pal ◽  
Anquan Wang ◽  
Michael F. Modest
Keyword(s):  
State Of The Art ◽  
Source Code ◽  
Computational Cost ◽  
High Accuracy ◽  
Grid Structure ◽  
Participating Media ◽  
Flow Solver ◽  
Domain Of Applicability ◽  
Code Module ◽  
Multi Phase

k-distribution-based approaches are promising models for radiation calculations in strongly nongray participating media. Advanced k-distribution methods were found to achieve close-to benchmark line-by-line (LBL) accuracy for strongly inhomogeneous multi-phase media accompanied by several orders of magnitude smaller computational cost. In this paper, a k-distribution-based portable spectral module is developed, incorporating several state-of-the-art k-distribution methods along with compact and high-accuracy databases of k-distributions. The module construction is flexible — the user can choose among various k-distribution methods with their relevant k-distribution databases, to carry out accurate radiation calculations. The spectral module is portable, such that it can be coupled to any flow solver code with its own grid structure, discretization scheme, and solver libraries. This open source code module is made available for free for all noncommercial purposes. This article outlines in detail the design and the use of the spectral module. The k-distribution methods included in the module are briefly described with a discussion of their advantages, disadvantages and their domain of applicability. Examples are provided for various sample radiation calculations in multi-phase mixtures using the new spectral module and the results are compared with LBL calculations.

New insights on the ESIPT process based on solid-state data and state-of-the-art computational methods

2021 ◽  
Author(s):  
Jean Nunes Laner ◽  
Henrique de Castro Silva Junior ◽  
Fabiano Severo Rodembusch ◽  
Eduardo Ceretta Moreira
Keyword(s):  
Excited State ◽  
Solid State ◽  
Proton Transfer ◽  
State Of The Art ◽  
Computational Cost ◽  
Intramolecular Proton Transfer ◽  
High Accuracy ◽  
Computational Techniques ◽  
Vibrational Properties ◽  
State Data

Updated computational techniques to investigate the excited-state intramolecular proton transfer (ESIPT) process obtaining theoretical electronic and vibrational properties in the solid-state with high accuracy at a small computational cost.

scholarly journals The Degree of Oxidation of Graphene Oxide

Nanomaterials ◽  
2021 ◽  
Vol 11 (3) ◽  
pp. 560
Author(s):  
Alexandra Carvalho ◽  
Mariana C. F. Costa ◽  
Valeria S. Marangoni ◽  
Pei Rou Ng ◽  
Thi Le Hang Nguyen ◽  
...  
Keyword(s):  
Graphene Oxide ◽  
Ab Initio ◽  
State Of The Art ◽  
High Accuracy ◽  
Precise Determination ◽  
Photoemission Spectroscopy ◽  
Pristine Graphene ◽  
X Ray ◽  
Degree Of Oxidation

We show that the degree of oxidation of graphene oxide (GO) can be obtained by using a combination of state-of-the-art ab initio computational modeling and X-ray photoemission spectroscopy (XPS). We show that the shift of the XPS C1s peak relative to pristine graphene, ΔEC1s, can be described with high accuracy by ΔEC1s=A(cO−cl)2+E0, where c0 is the oxygen concentration, A=52.3 eV, cl=0.122, and E0=1.22 eV. Our results demonstrate a precise determination of the oxygen content of GO samples.

scholarly journals Image Restoration by Learning Morphological Opening-Closing Network

2020 ◽  
Vol 4 (1) ◽  
pp. 87-107
Author(s):  
Ranjan Mondal ◽  
Moni Shankar Dey ◽  
Bhabatosh Chanda
Keyword(s):  
Neural Network ◽  
Image Restoration ◽  
State Of The Art ◽  
Source Code ◽  
Back Propagation ◽  
Image Features ◽  
Main Difficulty ◽  
The Right ◽  
Right Order ◽  
Morphological Opening

AbstractMathematical morphology is a powerful tool for image processing tasks. The main difficulty in designing mathematical morphological algorithm is deciding the order of operators/filters and the corresponding structuring elements (SEs). In this work, we develop morphological network composed of alternate sequences of dilation and erosion layers, which depending on learned SEs, may form opening or closing layers. These layers in the right order along with linear combination (of their outputs) are useful in extracting image features and processing them. Structuring elements in the network are learned by back-propagation method guided by minimization of the loss function. Efficacy of the proposed network is established by applying it to two interesting image restoration problems, namely de-raining and de-hazing. Results are comparable to that of many state-of-the-art algorithms for most of the images. It is also worth mentioning that the number of network parameters to handle is much less than that of popular convolutional neural network for similar tasks. The source code can be found here https://github.com/ranjanZ/Mophological-Opening-Closing-Net

scholarly journals A Machine Vision Approach for Bioreactor Foam Sensing

2021 ◽  
pp. 247263032110088
Author(s):  
Jonas Austerjost ◽  
Robert Söldner ◽  
Christoffer Edlund ◽  
Johan Trygg ◽  
David Pollard ◽  
...  
Keyword(s):  
Machine Learning ◽  
Machine Vision ◽  
State Of The Art ◽  
Low Cost ◽  
High Accuracy ◽  
Consumer Electronics ◽  
Learning System ◽  
Automotive Applications ◽  
Fine Grained

Machine vision is a powerful technology that has become increasingly popular and accurate during the last decade due to rapid advances in the field of machine learning. The majority of machine vision applications are currently found in consumer electronics, automotive applications, and quality control, yet the potential for bioprocessing applications is tremendous. For instance, detecting and controlling foam emergence is important for all upstream bioprocesses, but the lack of robust foam sensing often leads to batch failures from foam-outs or overaddition of antifoam agents. Here, we report a new low-cost, flexible, and reliable foam sensor concept for bioreactor applications. The concept applies convolutional neural networks (CNNs), a state-of-the-art machine learning system for image processing. The implemented method shows high accuracy for both binary foam detection (foam/no foam) and fine-grained classification of foam levels.

scholarly journals Plant Leaf Disease Recognition Using Depth-Wise Separable Convolution-Based Models

Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 511
Author(s):  
Syed Mohammad Minhaz Hossain ◽  
Kaushik Deb ◽  
Pranab Kumar Dhar ◽  
Takeshi Koshiba
Keyword(s):  
State Of The Art ◽  
Computational Cost ◽  
Region Of Interest ◽  
Number Of Clusters ◽  
Plant Leaf ◽  
Leaf Disease ◽  
Automatic Initialization ◽  
Adequate Accuracy ◽  
Model Size ◽  
High Computational Cost

Proper plant leaf disease (PLD) detection is challenging in complex backgrounds and under different capture conditions. For this reason, initially, modified adaptive centroid-based segmentation (ACS) is used to trace the proper region of interest (ROI). Automatic initialization of the number of clusters (K) using modified ACS before recognition increases tracing ROI’s scalability even for symmetrical features in various plants. Besides, convolutional neural network (CNN)-based PLD recognition models achieve adequate accuracy to some extent. However, memory requirements (large-scaled parameters) and the high computational cost of CNN-based PLD models are burning issues for the memory restricted mobile and IoT-based devices. Therefore, after tracing ROIs, three proposed depth-wise separable convolutional PLD (DSCPLD) models, such as segmented modified DSCPLD (S-modified MobileNet), segmented reduced DSCPLD (S-reduced MobileNet), and segmented extended DSCPLD (S-extended MobileNet), are utilized to represent the constructive trade-off among accuracy, model size, and computational latency. Moreover, we have compared our proposed DSCPLD recognition models with state-of-the-art models, such as MobileNet, VGG16, VGG19, and AlexNet. Among segmented-based DSCPLD models, S-modified MobileNet achieves the best accuracy of 99.55% and F1-sore of 97.07%. Besides, we have simulated our DSCPLD models using both full plant leaf images and segmented plant leaf images and conclude that, after using modified ACS, all models increase their accuracy and F1-score. Furthermore, a new plant leaf dataset containing 6580 images of eight plants was used to experiment with several depth-wise separable convolution models.

The smallest extraction problem

2021 ◽  
Vol 14 (11) ◽  
pp. 2445-2458
Author(s):  
Valerio Cetorelli ◽  
Paolo Atzeni ◽  
Valter Crescenzi ◽  
Franco Milicchio
Keyword(s):  
Unsupervised Learning ◽  
Optimization Problem ◽  
Learning Algorithm ◽  
State Of The Art ◽  
Data Extraction ◽  
Source Code ◽  
Web Data ◽  
Web Data Extraction ◽  
New Family ◽  
Context Free

We introduce landmark grammars , a new family of context-free grammars aimed at describing the HTML source code of pages published by large and templated websites and therefore at effectively tackling Web data extraction problems. Indeed, they address the inherent ambiguity of HTML, one of the main challenges of Web data extraction, which, despite over twenty years of research, has been largely neglected by the approaches presented in literature. We then formalize the Smallest Extraction Problem (SEP), an optimization problem for finding the grammar of a family that best describes a set of pages and contextually extract their data. Finally, we present an unsupervised learning algorithm to induce a landmark grammar from a set of pages sharing a common HTML template, and we present an automatic Web data extraction system. The experiments on consolidated benchmarks show that the approach can substantially contribute to improve the state-of-the-art.

Analysis of Transonic Bladerows With Non-Uniform Geometry Using Spectral Method

2020 ◽  
Author(s):  
Feng Wang ◽  
Luca di Mare
Keyword(s):  
Flow Field ◽  
Spectral Method ◽  
Computational Cost ◽  
Leading Edge ◽  
Wave Number ◽  
Efficient Tool ◽  
Flow Solver ◽  
Engine Order ◽  
Harmonic Flow ◽  
Good Agreement

Abstract Turbomachinery blade rows can have non-uniform geometries due to design intent, manufacture errors or wear. When predictions are sought for the effect of such non-uniformities, it is generally the case that whole assembly calculations are needed. A spectral method is used in this paper to approximate the flow fields of the whole assembly but with significantly less computation cost. The method projects the flow perturbations due to the geometry non-uniformity in an assembly in Fourier space, and only one passage is required to compute the flow perturbations corresponding to a certain wave-number of geometry variation. The performance of this method on transonic blade rows is demonstrated on a modern fan assembly. Low engine order and high engine order geometry non-uniformity (e.g. “saw-tooth” pattern) are examined. The non-linear coupling between the flow perturbations and the passage-averaged flow field is also demonstrated. Pressure variations on the blade surface and the potential flow field upstream of the leading edge from the proposed spectral method and the direct whole assembly solutions are compared. Good agreement is observed on both quasi-3D and full 3D cases. A lumped approach to compute deterministic fluxes is also proposed to further reduce the computational cost of the spectral method. The spectral method is formulated in such a way that it can be easily implemented into an existing harmonic flow solver by adding an extra source term, and can be potentially used as an efficient tool for aeromechanical and aeroacoustics design of turbomachinery blade rows.

scholarly journals AN EFFICIENT AND ROBUST GPGPU-BASED SHALLOW WATER MODEL

2020 ◽  
pp. 47
Author(s):  
Fatima-zahra Mihami ◽  
Volker Roeber
Keyword(s):  
Numerical Solution ◽  
Shallow Water ◽  
Computational Cost ◽  
Free Surface Flow ◽  
Surface Flow ◽  
Water Model ◽  
Staggered Grid ◽  
Finite Volume Scheme ◽  
Flow Solver ◽  
Riemann Solvers

We present an efficient and robust numerical model for the solution of the Shallow Water Equations with the objective to develop the numerical foundation for an advanced free surface flow solver. The numerical solution is based on an explicit Finite Volume scheme on a staggered grid to ensure the conservation of mass and momentum across flow discontinuities and wet-dry transitions. This leads to an accurate numerical solution at low computational cost without the need for Riemann solvers. The efficiency of the lean numerical structure is further optimized through a CUDA-GPU implementation.Recorded Presentation from the vICCE (YouTube Link): https://youtu.be/xMnK_r7Tj1Q

scholarly journals Binary and Multiclass Text Classification by Means of Separable Convolutional Neural Network

Inventions ◽  
2021 ◽  
Vol 6 (4) ◽  
pp. 70
Author(s):  
Elena Solovyeva ◽  
Ali Abdullah
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Convolutional Neural Network ◽  
Recurrent Neural Networks ◽  
Low Cost ◽  
Computational Cost ◽  
High Accuracy ◽  
Activation Functions ◽  
Fully Connected ◽  
Fully Connected Networks

In this paper, the structure of a separable convolutional neural network that consists of an embedding layer, separable convolutional layers, convolutional layer and global average pooling is represented for binary and multiclass text classifications. The advantage of the proposed structure is the absence of multiple fully connected layers, which is used to increase the classification accuracy but raises the computational cost. The combination of low-cost separable convolutional layers and a convolutional layer is proposed to gain high accuracy and, simultaneously, to reduce the complexity of neural classifiers. Advantages are demonstrated at binary and multiclass classifications of written texts by means of the proposed networks under the sigmoid and Softmax activation functions in convolutional layer. At binary and multiclass classifications, the accuracy obtained by separable convolutional neural networks is higher in comparison with some investigated types of recurrent neural networks and fully connected networks.

scholarly journals AtLoc: Attention Guided Camera Localization

2020 ◽  
Vol 34 (06) ◽  
pp. 10393-10401
Author(s):  
Bing Wang ◽  
Changhao Chen ◽  
Chris Xiaoxuan Lu ◽  
Peijun Zhao ◽  
Niki Trigoni ◽  
...  
Keyword(s):  
Deep Learning ◽  
Experimental Evidence ◽  
State Of The Art ◽  
Source Code ◽  
Single Image ◽  
Saliency Maps ◽  
Camera Localization ◽  
Camera Pose ◽  
Dynamic Objects ◽  
Indoor And Outdoor

Deep learning has achieved impressive results in camera localization, but current single-image techniques typically suffer from a lack of robustness, leading to large outliers. To some extent, this has been tackled by sequential (multi-images) or geometry constraint approaches, which can learn to reject dynamic objects and illumination conditions to achieve better performance. In this work, we show that attention can be used to force the network to focus on more geometrically robust objects and features, achieving state-of-the-art performance in common benchmark, even if using only a single image as input. Extensive experimental evidence is provided through public indoor and outdoor datasets. Through visualization of the saliency maps, we demonstrate how the network learns to reject dynamic objects, yielding superior global camera pose regression performance. The source code is avaliable at https://github.com/BingCS/AtLoc.

Sign in / Sign up

Export Citation Format

Share Document