Search

Rationale The recent development of isotope ratio infrared spectroscopy (IRIS) was quickly followed by the addition of online extraction and analysis systems, making it faster and easier to measure soil and plant water isotopes. However, memory and sample size effects limit the efficiency and accuracy of these new setups. In response, this study presents a scheme dedicated to estimating and eliminating these two effects. Methods Memory effect was determined by injecting two standard waters alternately. Each standard was injected nine times in a row and analyzed using induction module cavity ring-down spectroscopy (IM-CRDS). Memory coefficients were calculated using a new 'multistage jump' algorithm. Sample size effects were evaluated by injecting water volumes ranging from 1 μL to 6 μL. Finally, the influence of cellulose filter paper on the isotopic measurements, the memory, and the sample size effect was evaluated by comparing it with glass filter paper. Results Memory effects were detected for both δ18O and δ2H values, with the latter being stronger. Isotopic differences between replicates of the same plant or soil sample showed a clear decrease after memory correction. A small water volume effect was found only when the injected water volume was larger than 3 μL. However, while the correction method performed well for laboratory-made samples, it did not for field samples, due to the heterogeneity of the isotopic composition of the samples. Stronger memory and water volume effects were found for cellulose filter paper. Conclusions The memory coefficients and the water volume-isotope relationship improved the consistency and accuracy of both laboratory and field data. Our results indicate that cellulose filter paper may not be a suitable medium to measure standard waters and evaluate memory and water volume effects. Finally, a detailed correction and calibration protocol is suggested, along with notes on best practices to obtain good-quality IM-CRDS data. Copyright © 2017 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The dynamic use of land that results from urbanization has an impact on the urban ecosystem. Yola North Local Government Area (Yola North LGA) of Adamawa state, Nigeria, has experienced tremendous changes in its land use and land cover (LULC) over the past two decades due to the influx of people from rural areas seeking for the benefits of its economic activities. The goal of this research is to develop an efficient and accurate framework for continuous monitoring of land use and land cover (LULC) change and quantify the transformation in land use and land cover pattern over a specific period (between 2002 and 2022). Land sat images of 2002, 2012, and 2022 were obtained, and the Support Vector Machine classification method was utilized to stratify the images. Land Change Modeler (LCM) tool in Idrissi Selva software was then used to analyze the LULC change. SVM produced a good classification result for all three years, with 2022 having the highest overall accuracy of 95.5%, followed by 2002 with 90% and 2012 with 87.7% which indicates the validity of the algorithm for future predictions. The results showed that severe land changes have occurred over the course of two decades in built-up (37.32%), vegetation (forest, scrubland, and grassland) (-3.27%), bare surface (-33.47%), and water bodies (-0.59%). Such changes in LULC could lead to agricultural land lost and reduced food supply. This research develops a robust framework for continuous land use monitoring, utilizing machine learning and geo-spatial data for urban planning, natural resource management, and environmental conservation. In conclusion, this study underscores the efficacy of support vector machine algorithm in analyzing complex land use and land cover changes., (© 2023. The Author(s), under exclusive licence to Springer Nature Switzerland AG.)

Cryo-electron microscopy (cryo-EM) captures snapshots of dynamic macromolecules, collectively illustrating the involved structural landscapes. This provides an exciting opportunity to explore the structural variations of macromolecules under study. However, traditional cryo-EM single-particle analysis often yields static structures. Here we describe OPUS-DSD, an algorithm capable of efficiently reconstructing the structural landscape embedded in cryo-EM data. OPUS-DSD uses a three-dimensional convolutional encoder-decoder architecture trained with cryo-EM images, thereby encoding structural variations into a smooth and easily analyzable low-dimension space. This space can be traversed to reconstruct continuous dynamics or clustered to identify distinct conformations. OPUS-DSD can offer meaningful insights into the structural variations of macromolecules, filling in the gaps left by traditional cryo-EM structural determination, and potentially improves the reconstruction resolution by reliably clustering similar particles within the dataset. These functionalities are especially relevant to the study of highly dynamic biological systems. OPUS-DSD is available at https://github.com/alncat/opusDSD ., (© 2023. The Author(s).)

Practitioners of current data analysis are regularly confronted with the situation where the heavy-tailed skewed response is related to both multiple functional predictors and high-dimensional scalar covariates. We propose a new class of partially functional penalized convolution-type smoothed quantile regression to characterize the conditional quantile level between a scalar response and predictors of both functional and scalar types. The new approach overcomes the lack of smoothness and severe convexity of the standard quantile empirical loss, considerably improving the computing efficiency of partially functional quantile regression. We investigate a folded concave penalized estimator for simultaneous variable selection and estimation by the modified local adaptive majorize-minimization (LAMM) algorithm. The functional predictors can be dense or sparse and are approximated by the principal component basis. Under mild conditions, the consistency and oracle properties of the resulting estimators are established. Simulation studies demonstrate a competitive performance against the partially functional standard penalized quantile regression. A real application using Alzheimer's Disease Neuroimaging Initiative data is utilized to illustrate the practicality of the proposed model., (© 2023 Wiley-VCH GmbH.)

Objectives: The primary aim was to estimate the influence of various depths on ultrasound attenuation coefficient (AC) of multiple vendors in the liver. The secondary aim was to evaluate the impact of region of interest (ROI) size on AC measurements in a subset of participants., Methods: This Institutional Review Board (IRB)-approved Health Insurance Portability and Accountability Act (HIPAA)-compliant retrospective study was carried out in two centers using AC-Canon and AC-Philips algorithms and extracting AC-Siemens values from ultrasound-derived fat fraction algorithm. Measurements were performed positioning ROI upper edge (3 cm size) at 2, 3, 4, 5 cm from the liver capsule with AC-Canon and AC-Philips and at 1.5, 2, 3 cm with Siemens algorithm. In a subset of participants, measurements were obtained with 1 and 3 cm ROI size. Univariate and multivariate linear regression models and Lin's concordance correlation coefficient (CCC) were used for statistical analysis as appropriate., Results: Three different cohorts were studied. Sixty-three participants (34 females; mean age: 51 ± 14 years) were studied with AC-Canon, 60 (46 females; mean age: 57 ± 11 years) with AC-Philips, and 50 (25 females; 61 ± 13 years) with AC-Siemens. There was a decrease in AC values per 1 cm increase in depth in all. In multivariable analysis, the coefficient was -0.049 (-0.060; -0.038 P < .001) with AC-Canon, -0.058 (-0.066; -0.049 P < .001) with AC-Philips and -0.081 (-0.112; -0.050 P < .001) with AC-Siemens. AC values with 1 cm ROI were significantly higher than those obtained with 3 cm ROI at all depths (P < .001) but the agreement between AC values obtained with different ROI size was excellent (CCC 0.82 [0.77-0.88])., Conclusions: There is depth dependence in AC measurement that affects results. A standardized protocol with fixed ROI's depth and size is needed., (© 2023 The Authors. Journal of Ultrasound in Medicine published by Wiley Periodicals LLC on behalf of American Institute of Ultrasound in Medicine.)

Background: Food frequency questionnaires (FFQs) are one of the most useful tools for studying and understanding diet-disease relationships. However, because FFQs are self-reported data, they are susceptible to response bias, social desirability bias, and misclassification. Currently, several methods have been created to combat these issues by modelling the measurement error in diet-disease relationships., Method: In this paper, a novel machine learning method is proposed to adjust for measurement error found in misreported data by using a random forest (RF) classifier to label the responses in the FFQ based on the input dataset and creating an algorithm that adjusts the measurement error. We demonstrate this method by addressing underreporting in selected FFQ responses., Result: According to the results, we have high model accuracies ranging from 78% to 92% in participant collected data and 88% in simulated data., Conclusion: This shows that our proposed method of using a RF classifier and an error adjustment algorithm is efficient to correct most of the underreported entries in the FFQ dataset and could be used independent of diet-disease models. This could help nutrition researchers and other experts to use dietary data estimated by FFQs with less measurement error and create models from the data with minimal noise., (© 2023. BioMed Central Ltd., part of Springer Nature.)

This study furthers the utilisation of the parametric group method of data handling (GMDH) in assessing the possibility of rainfall modelling and prediction, using publicly available temperature and rainfall data. In using ordinary GMDH approaches, the modelling is inconclusive with no clear consistency demonstrated through coefficients of determination and analysis of variance. Hence, an empirical assessment has been undertaken to provide an explanation of the inconsistency. In doing so, state variable distribution, their classification within the fuzzy context, and the need to integrate the principle of incompatibility into the GMDH modelling format are all assessed. The mathematical foundations of GMDH are discussed within the heuristic framework of data partitioning, partial description synthesis, the limitations of the least-squares coefficient of determination, incompleteness theorem, and the necessity for an external criterion in the selection procedure for polynomials. Methods for modelling improvement include the potential for hybridisation with least square support vector machines (LSSVM), the application of filters for parameter estimation, and the combination with signal processing techniques, ensemble empirical mode decomposition (EEMD), wavelet transformation (WT), and wavelet packet transformation (WPT). These have been investigated in addition to the implementation of enhanced GMDH (eGMDH) and fuzzy GMDH (FGMDH). The inclusion of exogenous data and its application within the GMDH modelling paradigm are also discussed. The study concludes with recommendations to enhance the potential for future rainfall modelling study success using parametric GMDH., (© 2022. The Author(s).)

We present an analysis of an epidemic spreading process on an Apollonian network that can describe an epidemic spreading in a non-sedentary population. We studied the modified diffusive epidemic process using the Monte Carlo method by computational analysis. Our model may be helpful for modeling systems closer to reality consisting of two classes of individuals: susceptible (A) and infected (B). The individuals can diffuse in a network according to constant diffusion rates [Formula: see text] and [Formula: see text], for the classes A and B, respectively, and obeying three diffusive regimes, i.e., [Formula: see text], [Formula: see text], and [Formula: see text]. Into the same site i, the reaction occurs according to the dynamical rule based on Gillespie's algorithm. Finite-size scaling analysis has shown that our model exhibits continuous phase transition to an absorbing state with a set of critical exponents given by [Formula: see text], [Formula: see text], and [Formula: see text] familiar to every investigated regime. In summary, the continuous phase transition, characterized by this set of critical exponents, does not have the same exponents of the mean-field universality class in both regular lattices and complex networks., (© 2023. The Author(s), under exclusive licence to Springer Nature B.V.)

The folded paper-size illusion is as easy to demonstrate as it is powerful in generating insights into perceptual processing: First take two A4 sheets of paper, one original sized, another halved by folding, then compare them in terms of area size by centering the halved sheet on the center of the original one! We perceive the larger sheet as far less than double (i.e., 100%) the size of the small one, typically only being about two thirds larger--this illusion is preserved by rotating the inner sheet and even by aligning it to one or two sides, but is dissolved by aligning both sheets to three sides, here documented by 88 participants' data. A potential explanation might be the general incapability of accurately comparing more than one geometrical dimension at once--in everyday life, we solve this perceptual-cognitive bottleneck by reducing the complexity of such a task via aligning parts with same lengths. [ABSTRACT FROM AUTHOR]

Copyright of Revista Catalana de Dret Públic is the property of Revista Catalana de Dret Public and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

With the rapid development of information technology, scientific social networks (SSNs) have become the fastest and most convenient way for researchers to communicate with each other. Many published papers are shared via SSNs every day, resulting in the problem of information overload. How to appropriately recommend personalized and highly valuable papers for researchers is becoming more urgent. However, when recommending papers in SSNs, only a small amount of positive instances are available, leaving a vast amount of unlabelled data, in which negative instances and potential unseen positive instances are mixed together, which naturally belongs to One-Class Collaborative Filtering (OCCF) problem. Therefore, considering the extreme data imbalance and data sparsity of this OCCF problem, a hybrid approach of Social and Content aware One-class Recommendation of Papers in SSNs, termed SCORP, is proposed in this study. Unlike previous approaches recommended to address the OCCF problem, social information, which has been proved playing a significant role in performing recommendations in many domains, is applied in both the profiling of content-based filtering and the collaborative filtering to achieve superior recommendations. To verify the effectiveness of the proposed SCORP approach, a real-life dataset from CiteULike was employed. The experimental results demonstrate that the proposed approach is superior to all of the compared approaches, thus providing a more effective method for recommending papers in SSNs. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel paper currency defect detection algorithm using quaternion uniform strength. We first build paper currency image preprocessing integration framework which includes intensity balancing, paper currency location, and geometric correction. We then propose a global–local paper currency image registration algorithm by moving key areas within certain range which can eliminate the false difference effectively. Finally, the quaternion uniform strength is calculated by using quaternion convolution edge detector. The defect degree of paper currency is determined by using the quaternion uniform color difference. The proposed algorithm is tested using different datasets from five countries: CNY, USD, EUR, VND, and RUB. The experimental results demonstrate that the proposed algorithm yields better results than the existing state-of-the-art paper currency defect detection techniques. The demo of the proposed paper currency defect detection algorithm will be publicly available. [ABSTRACT FROM AUTHOR]

To improve the accuracy of defect detection in bank note sorting and decrease the effects of cracks and scratches of bank note on detecting, a new algorithm based on wavelet decomposition is proposed, in which affine transform and wavelet transform are applied to bank note image registration and the edge information is extracted by Kirsch operator, while the defect feature is extracted from edge intensity differential. The bank note image is divided into several fixed size subzones, in each of which the defect feature is calculated to judge the degree of contamination. The experimental results reveal that the proposed feature extraction method is robust to the gray intensity change in each subbone, and obtains high recognition rate and high stability. This method has already been used in practical bank note sorting system. [ABSTRACT FROM AUTHOR]

The authors offer observation on utilizing tables, figures, charts and graphs to help understand the research presented in a simple manner but also engage and sustain the reader's interest. Topics discussed include benefits provided by the use of tables/figures/charts/graphs, general methodology of design and submission, and copyright issues of using material from government publications/public domain.

The traditional method for transformer moisture diagnosis is to establish empirical equations between feature parameters extracted from frequency domain spectroscopy (FDS) and the transformer’s moisture content. However, the established empirical equation may not be applicable to a novel testing environment, resulting in an unreliable evaluation result. In this regard, it is acknowledged that FDS combined with machine learning is more suitable for estimating moisture content in a variety of test environments. Nonetheless, the accuracy of the estimation results obtained using the existing method is limited by the algorithm’s inability to generalize. To address this issue, we propose an AdaBoost algorithm-enhanced back-propagation neural network (BP_AdaBoost). This study creates a database by extracting feature parameters from the FDS that characterize the insulation states of the prepared samples. Then, using the BP_AdaBoost algorithm and the newly constructed database, the moisture estimation models are trained. Finally, the results of the estimation are discussed in terms of laboratory and field transformers. By comparing the proposed BP_AdaBoost algorithm to other intelligence algorithms, it is demonstrated that it not only performs better in generalization, but also maintains a high level of accuracy. [ABSTRACT FROM AUTHOR]

The paper presents a technique for determining the time index of growth of the slope of reverse voltage for double insulated cables, based on the body of the theory of series. It is proved that in the vicinity of the extremum point (maximum) the function of the reverse voltage is approximated by polynomials of the nth power. It is proposed to use second-degree polynomials for practical calculations. The method for calculating relevant indicators is illustrated using real data. Analysis of deviations made it possible to conclude that the calculation method proposed in the paper is far more accurate. In the final part of the study, it was concluded that there is a promising outlook for further development of methodological guidelines for determining complex indices of the remaining life of the cable, including but not limited to the use of various mathematical methods. [ABSTRACT FROM AUTHOR]

Each year, the editorial board of Computational Optimization and Applications selects a paper from the preceding year's publications for the Best Paper Award. This derivative-free algorithm relies on randomly generated directions and is analyzed from a probabilistic viewpoint, leading to complexity guarantees for both deterministic and probabilistic versions of the method. First, following recent developments in nonconvex optimization, complexity results have become increasingly popular in derivative-free optimization [[8]]. [Extracted from the article]

This document is an editorial for a special issue of the journal AIMS Mathematics on the topic of discrete optimization. The issue includes 21 papers covering a range of subjects, including molecular trees, network systems, variational inequality problems, scheduling, image restoration, spectral clustering, integral equations, convex functions, graph products, optimization algorithms, air quality prediction, humanitarian planning, inertial methods, neural networks, transportation problems, emotion identification, fixed-point problems, structural engineering design, single machine scheduling, and ensemble learning. The papers present new theoretical results, algorithms, and applications in these areas. The guest editor expresses gratitude to the journal staff and reviewers and hopes that readers will find inspiration for their own research. [Extracted from the article]

Copyright of Journal of East China University of Science & Technology is the property of Journal of East China University of Science & Technology Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In the work presented in this paper, we analyse ranking algorithms that can be applied to bibliographic citation networks and rank academic entities such as papers and authors. We evaluate how well these algorithms identify important and high-impact entities. The ranking algorithms are computed on the Microsoft Academic Search (MAS) and the ACM digital library citation databases. The MAS database contains 40 million papers and over 260 million citations that span across multiple academic disciplines, while the ACM database contains 1.8 million papers from the computing literature and over 7 million citations. We evaluate the ranking algorithms by using a test data set of papers and authors that won renowned prizes at numerous computer science conferences. The results show that using citation counts is, in general, the best ranking metric to measure high-impact. However, for certain tasks, such as ranking important papers or identifying high-impact authors, algorithms based on PageRank perform better. [ABSTRACT FROM AUTHOR]

In this paper two procedures are developed for the identification of the parameters contained in an orthotropic elastic-plastic-hardening model for free standing foils, particularly of paper and paperboard. The experimental data considered are provided by cruciform tests and digital image correlation. A simplified version of the constitutive model proposed by Xia et al. (Int J Solids Struct 39:4053-4071, ) is adopted. The inverse analysis is comparatively performed by the following alternative computational methodologies: (a) mathematical programming by a trust-region algorithm; (b) proper orthogonal decomposition and artificial neural network. The second procedure rests on preparatory once-for-all computations and turns out to be applicable economically and routinely in industrial environments. [ABSTRACT FROM AUTHOR]

The D50 CIELAB gamut volume was standardized as a suitable and unified gamut size measurement methodology. The color gamut volume is visualized using proportionate gamut rings in a two‐dimensional diagram. Gamut ring intersection assists the visual comparison of the size and shape of the color gamut coverage between a display and a reference. This paper introduces a desktop application with an intuitive graphical interface for visualizing the gamut rings and describes the algorithm of the gamut ring intersection. [ABSTRACT FROM AUTHOR]

This paper explores digital marginalization, data marginalization, and algorithmic exclusions in the Souths. To this effect, it argues that underrepresented users and communities continue to be marginalized and excluded by digital technologies, by big data, and by algorithms employed by organizations, corporations, institutions, and governments in various data jurisdictions. Situating data colonialism within the Souths, the paper contends that data ableism, data disablism, and data colonialism are at play when data collected, collated, captured, configured, and processed from underrepresented users and communities is utilized by mega entities for their own multiple purposes. It also maintains that data coloniality, as opposed to data colonialism, is impervious to legal and legislative interventions within data jurisdictions. Additionally, it discusses digital citizenship (DC) and its related emerging regimes. Moreover, the paper argues that digital exclusion transcends the simplistic haves versus the have nots dualism as it manifests itself in multiple layers and in multiple dimensions. Furthermore, it characterizes how algorithmic exclusions tend to perpetuate historical human biases despite the pervasive view that algorithms are autonomous, neutral, rational, objective, fair, unbiased, and non-human. Finally, the paper advances a critical southern decolonial (CSD) approach to datafication, algorithms, and digital citizenship by means of which data coloniality, algorithmic coloniality, and the coloniality embodied in DC have to be critiqued, challenged, and dismantled. [ABSTRACT FROM AUTHOR]

For high dimensional gene expression data, one important goal is to identify a small number of genes that are associated with progression of the disease or survival of the patients. In this paper, we consider the problem of variable selection for multivariate survival data. We propose an estimation procedure for high dimensional accelerated failure time (AFT) models with bivariate censored data. The method extends the Buckley-James method by minimizing a penalized [Formula: see text] loss function with a penalty function induced from a bivariate spike-and-slab prior specification. In the proposed algorithm, censored observations are imputed using the Kaplan-Meier estimator, which avoids a parametric assumption on the error terms. Our empirical studies demonstrate that the proposed method provides better performance compared to the alternative procedures designed for univariate survival data regardless of whether the true events are correlated or not, and conceptualizes a formal way of handling bivariate survival data for AFT models. Findings from the analysis of a myeloma clinical trial using the proposed method are also presented., (© 2022. The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.)

Automatic identity verification is one of the most critical and research-demanding areas. One of the most effective and reliable identity verification methods is using unique human biological characteristics and biometrics. Among all types of biometrics, palm print is recognized as one of the most accurate and reliable identity verification methods. However, this biometrics domain also has several critical challenges: image rotation, image displacement, change in image scaling, presence of noise in the image due to devices, region of interest (ROI) detection, or user error. For this purpose, a new method of identity verification based on median robust extended local binary pattern (MRELBP) is introduced in this study. In this system, after normalizing the images and extracting the ROI from the microscopic input image, the images enter the feature extraction step with the MRELBP algorithm. Next, these features are reduced by the dimensionality reduction step, and finally, feature vectors are classified using the k-nearest neighbor classifier. The microscopic images used in this study were selected from IITD and CASIA data sets, and the identity verification rate for these two data sets without challenge was 97.2% and 96.6%, respectively. In addition, computed detection rates have been broadly stable against changes such as salt-and-pepper noise up to 0.16, rotation up to 5°, displacement up to 6 pixels, and scale change up to 94%., (© 2021 Wiley Periodicals LLC.)

Purpose: Radiation dose reduction is critical to the success of x-ray computed tomography (CT). Many advanced reconstruction techniques have been developed over the years to combat noise resulting from the low-dose CT scans. These algorithms rely on accurate local estimation of the image noise to determine reconstruction parameters or to select inferencing models. Because of the difficulties in the noise estimation for heterogeneous objects, the performance of many algorithms is inconsistent and suboptimal. Here, we propose a novel approach to overcome such shortcoming., Method: By injecting appropriate amount of noise in the CT raw data, a computer simulation approach is capable of accurately estimating the local statistics of the raw data and the local noise in the reconstructed images. This information is then used to guide the noise-reduction process during the reconstruction. As an initial implementation, a scaling map is generated based on the noise predicted from the simulation and the noise estimated from existing reconstruction algorithms. Images generated with existing algorithms are subsequently modified based on the scaling map. In this study, both iterative reconstruction (IR) and deep learning image reconstruction (DLIR) algorithms are evaluated., Results: Phantom experiments were conducted to evaluate the performance of the simulation-based noise estimation in terms of the standard deviation and noise power spectrum. Quantitative results have demonstrated that the noise measured from the original image matches well with the noise estimated from the simulation. Clinical datasets were utilized to further confirm the accuracy of the proposed approach under more challenging conditions. To validate the performance of the proposed reconstruction approach, clinical scans were used. Performance comparison was carried out qualitatively and quantitatively. Two existing advanced reconstruction techniques, IR and DLIR, were evaluated against the proposed approach. Results have shown that the proposed approach outperforms existing IR and DLIR algorithms in terms of noise suppression and, equally importantly, noise uniformity across the entire imaging volume. Visual assessment of the images also reveals that the proposed approach does not endure noise texture issues faced by some of the existing reconstruction algorithms today., Conclusion: Phantom and clinical results have demonstrated superior performance of the proposed approach with regard to noise reduction as well as noise homogeneity. Visual inspection of the noise texture further confirms the clinical utility of the proposed approach. Future enhancements on the current implementation are explored regarding image quality and computational efficiency. Because of the limited scope of this paper, detailed investigation on these enhancement features will be covered in a separate report., (© 2022 American Association of Physicists in Medicine.)

Enzyme reactions are highly dependent on reaction conditions. To ensure reproducibility of enzyme reaction parameters, experiments need to be carefully designed and kinetic modeling meticulously executed. Furthermore, to enable quality control of enzyme reaction parameters, the experimental conditions, the modeling process as well as the raw data need to be reported comprehensively. By taking these steps, enzyme reaction parameters can be open and FAIR (findable, accessible, interoperable, re-usable) as well as repeatable, replicable and reproducible. This review discusses these requirements and provides a practical guide to designing initial rate experiments for the determination of enzyme reaction parameters and gives an open, FAIR and re-editable example of the kinetic modeling of an enzyme reaction. Both the guide and example are scripted with Python in Jupyter Notebooks and are publicly available (https://fairdomhub.org/investigations/483/snapshots/1). Finally, the prerequisites of automated data analysis and machine learning algorithms are briefly discussed to provide further motivation for the comprehensive, open and FAIR reporting of enzyme reaction parameters., (© 2022 Walter de Gruyter GmbH, Berlin/Boston.)

Histopathologic evaluation of muscle biopsy samples is essential for classifying and diagnosing muscle diseases. However, the numbers of experienced specialists and pathologists are limited. Although new technologies such as artificial intelligence are expected to improve medical reach, their use with rare diseases, such as muscle diseases, is challenging because of the limited availability of training datasets. To address this gap, we developed an algorithm based on deep convolutional neural networks (CNNs) and collected 4041 microscopic images of 1400 hematoxylin-and-eosin-stained pathology slides stored in the National Center of Neurology and Psychiatry for training CNNs. Our trained algorithm differentiated idiopathic inflammatory myopathies (mostly treatable) from hereditary muscle diseases (mostly non-treatable) with an area under the curve (AUC) of 0.996 and achieved better sensitivity and specificity than the diagnoses done by nine physicians under limited diseases and conditions. Furthermore, it successfully and accurately classified four subtypes of the idiopathic inflammatory myopathies with an average AUC of 0.958 and classified seven subtypes of hereditary muscle disease with an average AUC of 0.936. We also established a method to validate the similarity between the predictions made by the algorithm and the seven physicians using visualization technology and clarified the validity of the predictions. These results support the reliability of the algorithm and suggest that our algorithm has the potential to be used straightforwardly in a clinical setting., (© 2021. The Author(s), under exclusive licence to United States and Canadian Academy of Pathology.)

Edge computing enables portable devices to provide smart applications, and the indoor positioning technique offers accurate location-based indoor navigation and personalized smart services. To achieve the high positioning accuracy, an indoor positioning algorithm based on particle filter requires a large number of sample particles to approximate the probability density function, which leads to the additional computational cost and high fusion delay. Focusing on real-time and accurate positioning, an edge computing-enabled green multi-source fusion indoor positioning algorithm called APFP is proposed based on adaptive particle filter in this paper. APFP considers both pedestrian dead reckoning (PDR) signals in mobile terminals and the received signal strength indication (RSSI) of Bluetooth, and effectively merges the error-free accumulation of trilateral positioning and the accurate short-range positioning of PDR, which enables mobile terminals adaptively perform particle filter to reduce the computing time and power consumption while ensuring positioning accuracy simultaneously. Detailed experimental results show that, compared with the traditional particle filter algorithm and the map-constrained algorithm, the proposed APFP reduces fusion computing cost by 59.89% and 54.37%, respectively. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

We study the quadratic cycle cover problem (QCCP), which aims to find a node-disjoint cycle cover in a directed graph with minimum interaction cost between successive arcs. We derive several semidefinite programming (SDP) relaxations and use facial reduction to make these strictly feasible. We investigate a nontrivial relationship between the transformation matrix used in the reduction and the structure of the graph, which is exploited in an efficient algorithm that constructs this matrix for any instance of the problem. To solve our relaxations, we propose an algorithm that incorporates an augmented Lagrangian method into a cutting-plane framework by utilizing Dykstra's projection algorithm. Our algorithm is suitable for solving SDP relaxations with a large number of cutting-planes. Computational results show that our SDP bounds and efficient cutting-plane algorithm outperform other QCCP bounding approaches from the literature. Finally, we provide several SDP-based upper bounding techniques, among which is a sequential Q-learning method that exploits a solution of our SDP relaxation within a reinforcement learning environment. Summary of Contribution: The quadratic cycle cover problem (QCCP) is the problem of finding a set of node-disjoint cycles covering all the nodes in a graph such that the total interaction cost between successive arcs is minimized. The QCCP has applications in many fields, among which are robotics, transportation, energy distribution networks, and automatic inspection. Besides this, the problem has a high theoretical relevance because of its close connection to the quadratic traveling salesman problem (QTSP). The QTSP has several applications, for example, in bioinformatics, and is considered to be among the most difficult combinatorial optimization problems nowadays. After removing the subtour elimination constraints, the QTSP boils down to the QCCP. Hence, an in-depth study of the QCCP also contributes to the construction of strong bounds for the QTSP. In this paper, we study the application of semidefinite programming (SDP) to obtain strong bounds for the QCCP. Our strongest SDP relaxation is very hard to solve by any SDP solver because of the large number of involved cutting-planes. Because of that, we propose a new approach in which an augmented Lagrangian method is incorporated into a cutting-plane framework by utilizing Dykstra's projection algorithm. We emphasize an efficient implementation of the method and perform an extensive computational study. This study shows that our method is able to handle a large number of cuts and that the resulting bounds are currently the best QCCP bounds in the literature. We also introduce several upper bounding techniques, among which is a distributed reinforcement learning algorithm that exploits our SDP relaxations. [ABSTRACT FROM AUTHOR]

Pulping production process produces a large amount of wastewater and pollutant emitted, which has become one of the main pollution sources in pulp and paper industry. To solve this problem, it is necessary to implement cleaner production by using modeling and optimization technology. This paper studies the modeling and multi-objective genetic algorithms for continuous digester process. First, model is established, in which environmental pollution and saving energy factors are considered. Then hybrid genetic algorithm based on Pareto stratum-nichecount is designed for finding near-Pareto or Pareto optimal solutions in the problem and a new genetic evaluation and selection mechanism is proposed. Finally using the real data from a pulp mill shows the results of computer simulation. Through comparing with the practical curve of digester, this method can reduce the pollutant effectively and increase the profit while keeping the pulp quality unchanged.