Search

Hidden Markov models (HMMs), which can characterize dynamic heterogeneity, are valuable tools for analyzing longitudinal data. The order of HMMs (ie, the number of hidden states) is typically assumed to be known or predetermined by some model selection criterion in conventional analysis. As prior information about the order frequently lacks, pairwise comparisons under criterion-based methods become computationally expensive with the model space growing. A few studies have conducted order selection and parameter estimation simultaneously, but they only considered homogeneous parametric instances. This study proposes a Bayesian double penalization (BDP) procedure for simultaneous order selection and parameter estimation of heterogeneous semiparametric HMMs. To overcome the difficulties in updating the order, we create a brand-new Markov chain Monte Carlo algorithm coupled with an effective adjust-bound reversible jump strategy. Simulation results reveal that the proposed BDP procedure performs well in estimation and works noticeably better than the conventional criterion-based approaches. Application of the suggested method to the Alzheimer's Disease Neuroimaging Initiative research further supports its usefulness., (© 2024 John Wiley & Sons Ltd.)

Estimating causal effects from large experimental and observational data has become increasingly prevalent in both industry and research. The bootstrap is an intuitive and powerful technique used to construct standard errors and confidence intervals of estimators. Its application however can be prohibitively demanding in settings involving large data. In addition, modern causal inference estimators based on machine learning and optimization techniques exacerbate the computational burden of the bootstrap. The bag of little bootstraps has been proposed in non-causal settings for large data but has not yet been applied to evaluate the properties of estimators of causal effects. In this article, we introduce a new bootstrap algorithm called causal bag of little bootstraps for causal inference with large data. The new algorithm significantly improves the computational efficiency of the traditional bootstrap while providing consistent estimates and desirable confidence interval coverage. We describe its properties, provide practical considerations, and evaluate the performance of the proposed algorithm in terms of bias, coverage of the true 95% confidence intervals, and computational time in a simulation study. We apply it in the evaluation of the effect of hormone therapy on the average time to coronary heart disease using a large observational data set from the Women's Health Initiative., (© 2024 John Wiley & Sons Ltd.)

The U.S. Food and Drug Administration (FDA) has launched Project Optimus to shift dose selection from the maximum tolerated dose (MTD) to the dose that produces the optimal risk-benefit tradeoff. One approach highlighted in the FDA's guidance involves conducting a randomized phase II trial following the completion of a phase I trial, where multiple doses (typically including the MTD and one or two doses lower than the MTD) are compared to identify the optimal dose that maximizes the benefit-risk tradeoff. This article focuses on the design of such a multiple-dose randomized trial, specifically the determination of the sample size. We generalized the standard definitions of type I error and power to accommodate the unique characteristics of dose optimization and derived a decision rule along with an algorithm to determine the optimal sample size. The resulting design is referred to as MERIT (Multiple-dosE RandomIzed Trial design for dose optimization based on toxicity and efficacy). Simulation studies demonstrate that MERIT has desirable operating characteristics, and a sample size between 20 and 40 per dosage arm often offers reasonable power and type I errors to ensure patient safety and benefit. To facilitate the implementation of the MERIT design, we provide software, available at https://www.trialdesign.org., (© 2024 John Wiley & Sons Ltd.)

Simulation is a powerful approach that plays a significant role in science and technology. Computational models that simulate learner interactions and data hold great promise for educational technology as well. Amongst others, simulated learners can be used for teacher training, for generating and evaluating hypotheses on human learning, for developing adaptive learning algorithms, for building virtual worlds in which students can practice collaboration skills with simulated pals, and for testing learning environments. This paper provides the first systematic literature review on simulated learners in the broad area of artificial intelligence in education and related fields, focusing on the decade 2010-19. We analyze the trends regarding the use of simulated learners in educational technology within this decade, the purposes for which simulated learners are being used, and how the validity of the simulated learners is assessed. We find that simulated learner models tend to represent only narrow aspects of student learning. And, surprisingly, we also find that almost half of the studies using simulated learners do not provide "any" evidence that their modeling addresses the most fundamental question in simulation design -- is the model valid? This poses a threat to the reliability of results that are based on these models. Based on our findings, we propose that future research should focus on developing more complete simulated learner models. To validate these models, we suggest a standard and universal criterion, which is based on the lasting idea of Turing's Test. We discuss the properties of this test and its potential to move the field of simulated learners forward.

Simulation Analysis and Modeling II (SAAM II) is a graphical modeling software used in life sciences for compartmental model analysis, particularly, but not exclusively, appreciated in pharmacokinetics (PK) and pharmacodynamics (PD), metabolism, and tracer modeling. Its intuitive "circles and arrows" visuals allow users to easily build, solve, and fit compartmental models without the need for coding. It is suitable for rapid prototyping of models for complex kinetic analysis or PK/PD problems, and in educating students and non-modelers. Although it is straightforward in design, SAAM II incorporates sophisticated algorithms programmed in C to address ordinary differential equations, deal with complex systems via forcing functions, conduct multivariable regression featuring the Bayesian maximum a posteriori, perform identifiability and sensitivity analyses, and offer reporting functionalities, all within a single package. After 26 years from the last SAAM II tutorial paper, we demonstrate here SAAM II's updated applicability to current life sciences challenges. We review its features and present four contemporary case studies, including examples in target-mediated PK/PD, CAR-T-cell therapy, viral dynamics, and transmission models in epidemiology. Through such examples, we demonstrate that SAAM II provides a suitable interface for rapid model selection and prototyping. By enabling the fast creation of detailed mathematical models, SAAM II addresses a unique requirement within the mathematical modeling community., (© 2024 The Author(s). CPT: Pharmacometrics & Systems Pharmacology published by Wiley Periodicals LLC on behalf of American Society for Clinical Pharmacology and Therapeutics.)

This paper addresses the predefined-time distributed optimization of nonlinear multi-agent system using a hierarchical control approach. Considering unknown nonlinear functions and external disturbances, we propose a two-layer hierarchical control framework. At the first layer, a predefined-time distributed estimator is employed to produce optimal consensus trajectories. At the second layer, a neural-network-based predefined-time disturbance observer is introduced to estimate the disturbance, with neural networks used to approximate the unknown nonlinear functions. A neural-network-based anti-disturbance sliding mode control mechanism is presented to ensure that the system trajectories can track the optimal trajectories within a predefined time. The feasibility of this hierarchical control framework is verified by utilizing the Lyapunov method. Numerical simulations are conducted separately using models of robotic arms and mobile robots to validate the effectiveness of the proposed method., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Background and Objective: Interactive soft tissue dissection has been a fundamental procedure in virtual surgery systems. Existing cutting algorithms involve complex topology changes of simulation meshes, which can increase simulation overhead and produce visual artifacts. In this paper, we proposed a novel graph-based shape-matching method that allows for real-time, flexible, progressive, and discontinuous cuts on soft tissue., Methods: We employed shape-matching constraints within the position-based dynamics (PBD) framework, a widely adopted approach for real-time simulation applications. The soft tissue was effectively modeled using overlapping clusters, each governed by shape-matching constraints. The dissection process was bifurcated into two distinct stages. In the first stage, the surgical scalpel presses the surface of the soft tissue. The soft tissue is cut apart when the surface pressure exceeds a threshold, entering the second stage. To address the discrepancy between the visual mesh and the simulation model during cluster separation, we developed an Aggregate Finding Connected Components (AFCC) algorithm, optimized for GPU computation and integrated with a background grid. This approach also avoids ghost forces and fragmentation artifacts. To control the increase in the number of clusters, we also propose a merging strategy that can run in parallel., Results: Our simulation outcomes demonstrated that the AFCC dissection algorithm effectively manages cluster separation and expansion with robustness. There were no ghost forces between the cutting surface and unrealistic fragments. Our simulation capability extended to supporting intricate and discontinuous cutting routes. Our dissection simulation maintained real-time performance even with over 100,000 particles constituting the soft tissue., Conclusions: Our real-time and robust surgical dissection simulation technique enables the performance of complex cuts in various surgical scenarios, demonstrating its potential in virtual surgery applications., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influ- ence the work reported in this paper., (Copyright © 2024 Elsevier B.V. All rights reserved.)

Conventional supervised learning usually operates under the premise that data are collected from the same underlying population. However, challenges may arise when integrating new data from different populations, resulting in a phenomenon known as dataset shift. This paper focuses on prior probability shift, where the distribution of the outcome varies across datasets but the conditional distribution of features given the outcome remains the same. To tackle the challenges posed by such shift, we propose an estimation algorithm that can efficiently combine information from multiple sources. Unlike existing methods that are restricted to discrete outcomes, the proposed approach accommodates both discrete and continuous outcomes. It also handles high-dimensional covariate vectors through variable selection using an adaptive least absolute shrinkage and selection operator penalty, producing efficient estimates that possess the oracle property. Moreover, a novel semiparametric likelihood ratio test is proposed to check the validity of prior probability shift assumptions by embedding the null conditional density function into Neyman's smooth alternatives (Neyman, 1937) and testing study-specific parameters. We demonstrate the effectiveness of our proposed method through extensive simulations and a real data example. The proposed methods serve as a useful addition to the repertoire of tools for dealing dataset shifts., (© The Author(s) 2024. Published by Oxford University Press on behalf of The International Biometric Society.)

Interacting strategies in evolutionary games is studied analytically in a well-mixed population using a Markov chain method. By establishing a correspondence between an evolutionary game and Markov chain dynamics, we show that results obtained from the fundamental matrix method in Markov chain dynamics are equivalent to corresponding ones in the evolutionary game. In the conventional fundamental matrix method, quantities like fixation probability and fixation time are calculable. Using a theorem in the fundamental matrix method, conditional fixation time in the absorbing Markov chain is calculable. Also, in the ergodic Markov chain, the stationary probability distribution that describes the Markov chain's stationary state is calculable analytically. Finally, the Rock, scissor, paper evolutionary game are evaluated as an example, and the results of the analytical method and simulations are compared. Using this analytical method saves time and computational facility compared to prevalent simulation methods., Competing Interests: The authors have declared that no competing interests exist.

Path planning plays an essential role in mobile robot navigation, and the A* algorithm is one of the best-known path planning algorithms. However, the traditional A* algorithm has some limitations, such as slow planning speed, close to obstacles. In this paper, we propose an improved A*-based algorithm, called the EBS-A* algorithm, that introduces expansion distance, bidirectional search, and smoothing into path planning. The expansion distance means keeping an extra space from obstacles to improve path reliability by avoiding collisions. Bidirectional search is a strategy searching path from the start node and the goal node simultaneously. Smoothing improves path robustness by reducing the number of right-angle turns. In addition, simulation tests for the EBS-A* algorithm are performed, and the effectiveness of the proposed algorithm is verified by transferring it to a robot operating system (ROS). The experimental results show that compared with the traditional A* algorithm, the proposed algorithm improves the path planning efficiency by 278% and reduces the number of critical nodes by 91.89% and the number of right-angle turns by 100%., Competing Interests: The authors have declared that no competing interests exist.

Ramp metering on freeway is one of the effective methods to alleviate traffic congestion. This paper advances the field of freeway ramp metering by introducing an application to the on-ramp, capitalizing on the macro traffic follow theory and improved the freeway traffic flow. The Particle Swarm Optimization (PSO) based on Proportional Integral Derivative (PID) controller is further developed to single ramp metering as well as to optimize the PID parameters. The approach is applied to a case study of the Changyi Freeway(G5513) in Hunan, China. The simulation is conducted by applying the actual profile traffic data to PID controller to adjust the entering traffic flow on the freeway on-ramp. The results show that the PSO-PID controller tends to converge in about 80 minutes, and the density tends to be stable after 240 iterations. The system has smaller oscillation, more accurate adjustment of ramp regulation rate, and more ideal expected traffic flow density. The traffic congestion on mainline is effectively slowed down, traffic efficiency is improved, and travel time and cost are reduced. The nonlinear processing ability of PSO-PID controller overcomes the defects of the traditional manual closing ramp, and can be successfully applied in the field of intelligent ramp metering., Competing Interests: The authors have declared that no competing interests exist.

In this paper, a novel swarm-based metaheuristic algorithm is proposed, which is called tuna swarm optimization (TSO). The main inspiration for TSO is based on the cooperative foraging behavior of tuna swarm. The work mimics two foraging behaviors of tuna swarm, including spiral foraging and parabolic foraging, for developing an effective metaheuristic algorithm. The performance of TSO is evaluated by comparison with other metaheuristics on a set of benchmark functions and several real engineering problems. Sensitivity, scalability, robustness, and convergence analyses were used and combined with the Wilcoxon rank-sum test and Friedman test. The simulation results show that TSO performs better compared to other comparative algorithms., Competing Interests: The authors declare that they have no conflicts of interest., (Copyright © 2021 Lei Xie et al.)

The firefly algorithm (FA) is proposed as a heuristic algorithm, inspired by natural phenomena. The FA has attracted a lot of attention due to its effectiveness in dealing with various global optimization problems. However, it could easily fall into a local optimal value or suffer from low accuracy when solving high-dimensional optimization problems. To improve the performance of the FA, this paper adds the self-adaptive logarithmic inertia weight to the updating formula of the FA, and proposes the introduction of a minimum attractiveness of a firefly, which greatly improves the convergence speed and balances the global exploration and local exploitation capabilities of FA. Additionally, a step-size decreasing factor is introduced to dynamically adjust the random step-size term. When the dimension of a search is high, the random step-size becomes very small. This strategy enables the FA to explore solution more accurately. This improved FA (LWFA) was evaluated with ten benchmark test functions under different dimensions (D = 10, 30, and 100) and with standard IEEE CEC 2010 benchmark functions. Simulation results show that the performance of improved FA is superior comparing to the standard FA and other algorithms, i.e., particle swarm optimization, the cuckoo search algorithm, the flower pollination algorithm, the sine cosine algorithm, and other modified FA. The LWFA also has high performance and optimal efficiency for a number of optimization problems., Competing Interests: The authors have declared that no competing interests exist.

Contemporary computational microRNA(miRNA)-target prediction tools have been playing a vital role in pursuing putative targets for a solitary miRNA or a group of miRNAs. These tools utilise a set of probabilistic algorithms, machine learning techniques and analyse experimentally validated miRNA targets to identify the potential miRNA-target pairs. Unfortunately, current tools generate a huge number of false-positive predictions. A standardized approach with a single tool or a combination of tools is still lacking. Moreover, sensitivity, specificity and overall efficiency of any single tool are yet to be satisfactory. Therefore, a systematic combination of selective online tools combining the factors regarding miRNA-target identification would be valuable as an miRNA-target prediction scheme. The focus of this study was to develop a theoretical framework by combining six available online tools to facilitate the current understanding of miRNA-target identification., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2021 Elsevier B.V. and Société Française de Biochimie et Biologie Moléculaire (SFBBM). All rights reserved.)

The prevalence of dropout events is a serious problem for single-cell Hi-C (scHiC) data due to insufficient sequencing depth and data coverage, which brings difficulties in downstream studies such as clustering and structural analysis. Complicating things further is the fact that dropouts are confounded with structural zeros due to underlying properties, leading to observed zeros being a mixture of both types of events. Although a great deal of progress has been made in imputing dropout events for single cell RNA-sequencing (RNA-seq) data, little has been done in identifying structural zeros and imputing dropouts for scHiC data. In this paper, we adapted several methods from the single-cell RNA-seq literature for inference on observed zeros in scHiC data and evaluated their effectiveness. Through an extensive simulation study and real data analysis, we have shown that a couple of the adapted single-cell RNA-seq algorithms can be powerful for correctly identifying structural zeros and accurately imputing dropout values. Downstream analysis using the imputed values showed considerable improvement for clustering cells of the same types together over clustering results before imputation., (© The Author(s) 2020. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.)

This paper introduces a new application of the Electrical Resistivity Imaging (ERI) method within the realm of structural assessment, deviating from its conventional use in geology. The study presents an innovative inversion model that incorporates the Levenberg-Marquardt algorithm, representing a notable leap in seamlessly integrating ERI into structural analysis. Rigorous validation of the inversion methodology is conducted through extensive benchmarking against simulated reference data, focusing on 1D and 2D resistivity distributions within timber specimens. By utilizing known resistivity fields, the paper quantitatively validates the accuracy of reconstructed models obtained through numerical simulations. Notably, both longitudinal and transverse surveys exhibit exceptional outcomes, showcasing a high correlation with the actual resistivity profiles, achieved within a concise 10-13 iterations. This meticulous validation process conclusively underscores the effectiveness and precision of the proposed inversion approach. Beyond its scientific contribution, this research expands the conventional boundaries of ERI application and establishes it as an invaluable tool for structural monitoring. [ABSTRACT FROM AUTHOR]

To solve the control problem of time-varying state-scale nonlinear systems whose initial state is not affected by settling time, fixed-time convergence algorithms are proposed for first-order systems and higher-order systems in this paper. First, a scalar model is used to illustrate how the time-varying feedback parameter can guarantee that the system achieves asymptotic stability while achieving finite-time convergence, and it is proved that the settling time obtained in this paper is only related to the prescribed boundary. This allows us to design the settling time with an appropriate parameter based on the prescribed boundary. To exhibit the effectiveness and extensibility of the proposed algorithm for first-order scalar systems, the results are subsequently extended to general higher-order systems based on the backstepping method. By introducing numerical simulation results, this paper verifies that the proposed algorithm will make the system achieve asymptotic stability and its output can converge to a given boundary, regardless of the system's initial states. [ABSTRACT FROM AUTHOR]

Population Based Algorithms (PBAs) are excellent search tools that allow searching space of parameters defined by problems under consideration. They are especially useful when it is difficult to define a differentiable evaluation criterion. This applies, for example, to problems that are a combination of continuous and discrete (combinatorial) problems. In such problems, it is often necessary to select a certain structure of the solution (e.g. a neural network or other systems with a structure usually selected by the trial and error method) and to determine the parameters of such structure. As PBAs have great application possibilities, the aim is to develop more and more effective search formulas used in them. An interesting approach is to use multiple populations and process them with separate PBAs (in a different way). In this paper, we propose a new multi-population-based algorithm with: (a) subpopulation evaluation and (b) replacement of the associated PBAs subpopulation formulas used for their processing. In the simulations, we used a set of typical CEC2013 benchmark functions. The obtained results confirm the validity of the proposed concept. [ABSTRACT FROM AUTHOR]

This paper demonstrates the importance of a proper contact algorithm selection when a constitutive model is correlated and validated, especially in the case of brittle materials. A parametric study is carried out to study the influence of contact parameters on the outcomes of the numerical simulations of a dynamic compression test. The split Hopkinson pressure bar (SHPB) model is developed, and sandstone rock is considered as a representative material having considerably different properties compared to SHPB bars. The finite element method (FEM) and smoothed particle hydrodynamics (SPH) were used to simulate specimen behaviour using a LS-Dyna solver. Two contact types based on the penalty method are analysed: nodes to surface (FEM and SPH) and surface to surface (FEM only). Furthermore, three approaches of contact stiffness calculation are used for each contact type. The waveform data and failure patterns are then compared among all simulated cases and the corresponding experimental outcomes. It is found that the soft constraint stiffness (SOFT = 1) provides the best outcomes, especially in the case of one-way contact, and is nearly insensitive to stiffness scaling parameters. By contrast, standard (SOFT = 0) and segment-based (SOFT =2) approaches require a substantial effort in adjusting the stiffness scaling parameters to obtain satisfactory results. This paper provides valuable guidance for correlating and validating parameters of constitutive models for rock and other brittle materials in the SHPB test. [ABSTRACT FROM AUTHOR]

General type-2 fuzzy logic systems (GT2 FLSs) on the basis of alpha-plane representation of GT2 fuzzy sets (FSs) have attracted considerable attention in recent years. For the kernel type-reduction (TR) block of GT2 FLSs, the enhanced Karnik-Mendel (EKM) algorithm is the most popular approach. This paper proposes the sensible beginning divided-search EKM (SBDEKM) algorithms for completing the centroid TR of GT2 FLSs. Computer simulations are provided to show the performances of the SBDEKM algorithms. Compared with EKM algorithms and sensible beginning EKM (SBEKM) algorithms, the SBDEKM algorithms have almost the same accuracies and better computational efficiency. [ABSTRACT FROM AUTHOR]

This paper analyzes the modeling of a computer-aided piano music automatic notation algorithm, combines the influence of music on psychological detachment, and designs the piano music automatic notation algorithm in psychological detachment model construction. This paper investigates the multiresolution time-frequency representation constant Q-transform (CQT), which is common in music signal analysis, and finds that although CQT has higher frequency resolution at low frequencies, it also leads to lower temporal resolution. The variable Q-transform is introduced as a tool for multibasic frequency estimation of the time-frequency representation of music signals, which has better temporal resolution than CQT at the exact frequency resolution and efficient coefficient calculation. The short-time Fourier transform and constant Q-transform time-frequency analysis methods are implemented, respectively, and note onset detection and multibasic tone detection are implemented based on CNN models. The network structure, training method, and postprocessing method of CNN are optimized. This paper proposes a temporal structure model for maintaining music coherence to avoid manual input and ensure interdependence between tracks in music generation. This paper also investigates and implements a method for generating discrete music events based on multiple channels, including a multitrack correlation model and a discretization process. In this paper, the automatic piano music notation algorithm can play an influential role in significantly enhancing the actual effect of psychological detoxification. [ABSTRACT FROM AUTHOR]

This paper does some research and discussion on the finite element analysis of a building structure, especially the computer graphics simulation method in building structure simulation. Moreover, with the support of BIM technology and computer finite element simulation technology, this paper constructs a building structure simulation system and analyzes the building structure simulation system based on actual conditions such as building structure and stress load. In addition, this paper improves the traditional structural analysis algorithm and designs experiments to evaluate the effect of the method proposed in this paper and analyze the data in the form of simulation to compare the validity of the test results. Finally, an experiment is designed to evaluate the data processing capability of the test system in this paper. The experimental analysis results verify the effectiveness of the method in this paper, which can provide relevant theoretical references for subsequent building structure simulation. [ABSTRACT FROM AUTHOR]

This paper focuses on studying the optimization problem of multi-agent systems (MAS) under undirected graph. To reduce the communication frequency among agents, a zero-gradient-sum (ZGS) algorithm based on dynamic event-triggered (DET) mechanism is investigated. The event-triggered condition of each agent only uses its own state information and the neighbor's state information at the previous triggering instants, without requiring continuous state information from the neighbor. In addition, the designed algorithm allows for the sampling period to be arbitrarily large. The Lyapunov method is utilized to derive the sufficient conditions that incorporate time delay and parameters. As the event is only checked at the periodic moment, zeno behavior can be directly excluded. Finally, numerical simulations demonstrate the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

This paper proposes a new image encryption algorithm using novel block-level scrambling scheme and bit-level filer diffusion technology. In order to increase the diversity of pseudo-random number generator (PRNG) and improve the security of encryption system, a new Josephus travel scheme is proposed in this paper. Then, based on the novel Josephus travel method, a novel block-level scrambling scheme and bit-vector diffusion operation are proposed to improve the encryption efficiency of the algorithm. Numerical simulation and comparison experiments shows that the proposed encryption algorithm has high security and faster encryption speed, and can resist various attacks. [ABSTRACT FROM AUTHOR]

This paper studies distributed optimization problems of a class of agents with fractional order dynamics and unknown external disturbances. Motivated by the celebrated active disturbance rejection control (ADRC) method, a fractional order extended state observer (Frac-ESO) is first constructed, and an ADRC-based PI-like protocol is then proposed for the target distributed optimization problem. It is rigorously shown that the decision variables of the agents reach a domain of the optimal solution when the external disturbance is bounded. In particular, for constant disturbances, the Frac-ESO is Mittag-Leffler convergent and the optimization problem can be solved exactly. Finally, numerical simulations are presented to validate the effective properties of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Close-range photogrammetry methods are widely used for non-contact and accurate measurements of surface shapes. These methods are based on calculating the three-dimensional coordinates of an object from two-dimensional images using special digital processing algorithms. Due to the relatively complex measurement principle, the accurate estimation of the photogrammetric measurement error is a non-trivial task. Typically, theoretical estimations or computer modelling are used to solve this problem. However, these approaches cannot provide an accurate estimate because it is impossible to consider all factors that influence the measurement results. To solve this problem, we propose the use of physical modelling. The measurement results from the photogrammetric system under test were compared with the results of a more accurate reference measurement method. This comparison allowed the error to be estimated under controlled conditions. The test object was a flexible surface whose shape could vary smoothly over a wide range. The estimation of the measurement accuracy for a large number of different surface shapes allows us to obtain new results that are difficult to obtain using standard approaches. To implement the proposed approach, a laboratory system for the error estimation of close-range photogrammetric measurements was developed. The paper contains a detailed description of the developed system and the proposed technique for a comparison of the measurement results. The error in the reference method, which was chosen to be phasogrammetry, was evaluated experimentally. Experimental testing of the stereo photogrammetric system was performed according to the proposed technique. The obtained results show that the proposed technique can reveal dependencies that may not be detected by standard approaches. [ABSTRACT FROM AUTHOR]

This paper presents a solution to the problem of providing an autonomous vehicle with a safe control task when moving around many other autonomous vehicles. This is achieved by developing an appropriate computer control algorithm that takes into account the possible risk of a collision resulting from both the impact of environmental disturbances and the imperfection of the rules of maneuvering in situations where many vehicles pass each other, giving the control process a decisive character. For this purpose, three types of algorithms were synthesized: kinematic and dynamic optimization with neural domains, as well as sequential game control of an autonomous vehicle. The control algorithms determine a safe trajectory, which is implemented by the actuators of the autonomous vehicle. Computer simulations of the control algorithms in the Matlab/Simulink software allow for their comparative analysis in terms of meeting the criteria for the optimality and safety of an autonomous vehicle when passing a larger number of other autonomous vehicles. For this purpose, scenarios of multidirectional and one-way traffic of autonomous vehicles were used. [ABSTRACT FROM AUTHOR]

Among the distribution network faults, single-phase grounding faults have the greatest probability. The faults are often accompanied by arcs in the grounding point soil. This type of fault current has a small amplitude and seldom can obtain field record data. A soil arc grounding fault is tested on a realistic-distribution-network-experimental-platform (RDNEP), and it is concluded that the soil-arc-grounding-fault (SAGF) has three main characteristics: hysteresis, nonlinearity, and asymmetry. By comparing with the characteristics of common arc models, it is pointed out that common arc models cannot accurately fit the characteristics of SAGF. This paper proposes and establishes a double exponential function arc model. Through the comparison of simulation waveforms with experimental data, it is verified that the numerical simulation method proposed in this paper can simulate the development process of SAGF more accurately. Furthermore, the equivalence of RDNEP is verified on the real distribution network system (RDNS). On this basis, analyzed the arc characteristic changes of different SAGF development cycles. Finally, by studying the applicability of the proposed model in simulating ground faults in grass and gravel roads, it is verified that the model proposed in this paper has a strong generalization capability. The research has laid a theoretical foundation for a detection algorithm that is based on the characteristics of SAGF. [ABSTRACT FROM AUTHOR]

This paper focuses on a high-dimensional semi-parametric regression model in which a partially linear model is used for the parametric part and the B-spline basis function approach is used to estimate the unknown function for the non-parametric part. Within the framework of this model, the constrained least squares estimation is investigated, and the alternating-direction multiplier method (ADMM) is used to solve the model. The convergence is proved under certain conditions. Finally, numerical simulations are performed and applied to workers' wage data from CPS85. The results show that the ADMM algorithm is very effective in solving high-dimensional partially linear models. [ABSTRACT FROM AUTHOR]

In this paper, we consider the simplest class of stratified spaces linearly embedded graphs. We present an algorithm that learns the abstract structure of an embedded graph and models the specific embedding from a point cloud sampled from it. We use tools and inspiration from computa-tional geometry, algebraic topology, and topological data analysis and prove the correctness of the identified abstract structure under assumptions on the embedding. The algorithm is implemented in the Julia package Skyler, which we used for the numerical simulations in this paper. [ABSTRACT FROM AUTHOR]

This paper describes the second part of our study devoted to automated anonymization of personal data. The overview and analysis of research prospects is supplemented with a practical result. An anonymization model is proposed, which reduces anonymization of personal data to manipulation of samples of random elements of different types. The key idea of our approach to anonymization of personal data with preservation of their usefulness is the use of the synthesis method, i.e., the complete replacement of all non-anonymized data with synthetic values. In the proposed model, a set of element types is selected, for which corresponding synthesys templates are proposed. The set of templates constitutes a synthesis-based anonymization algorithm. Technically, each template is based on a well-known statistical tool: frequency estimates of probabilities, Parzen–Rosenblatt kernel density estimates, statistical means, and covariances. The proposed approach is illustrated by a simple example from civil aviation. [ABSTRACT FROM AUTHOR]

This paper designs event-triggered delay compensation and disturbance attenuation control algorithms for multi-agent systems. First, through predictor-based model reduction method, an unknown large input delay can be compensated and delay-free dynamics is obtained. Based on the transformed systems, predictive descriptor observers are proposed to obtain estimated system states and sensor faults. Then, an event-triggered fault-tolerant algorithm is designed to save energy resources for communication among the agents while attenuating the disturbances. Moreover, it is validated that the systems do not exhibit Zeno behaviour using the designed event-triggering sequence. Numerical simulations are conducted to demonstrate the effectiveness of designed algorithms. [ABSTRACT FROM AUTHOR]

Copyright of Control Theory & Applications / Kongzhi Lilun Yu Yinyong is the property of Editorial Department of Control Theory & Applications 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 this paper, an encryption scheme, based on a double deterministic phase mask and the Yang-Gu algorithm, is proposed. It consists of double random phase encoding and the Yang-Gu algorithm in Fresnel and Fourier transform, respectively. The random phase masks are replaced with deterministic phase masks that are constructed using chaotic logistic and cubic maps. The encrypted image obtained by the scheme in one-way binary modulation is real and more convenient for storage and transmission. The validation of the proposed cryptosystem is carried out using numerical simulations on greyscale images of Man, DICOM and CUH binary images. The proposed scheme is investigated for its robustness through statistical analysis using histograms and correlation plots. The scheme is also tested for its resistance against occlusion, noise and cryptographic attacks. The proposed cryptosystem is found to be highly sensitive to its private key and Fresnel parameters and therefore secure. [ABSTRACT FROM AUTHOR]

The electromagnetic scattering characteristics of foam in Marine environment are studied in this paper. The Elfouhaily sea spectrum model is established, and the dielectric constants of seawater/ocean foam are calculated based on the double Debye dielectric constant model, furthermore, the formula relation between them is given. As an important factor affecting ocean electromagnetic scattering, the thickness of foam is proportional to the wind speed above the sea surface. In this paper, the SMCG method based on the surface current equation is mainly used to calculate the electromagnetic scattering coefficient of the environment, and the correctness of the SMCG algorithm is verified by comparing the calculated results with the actual measured data. Based on the computer simulation, the influence of the existence of ocean foam on the environmental scattering is discussed, and the Marine electromagnetic scattering coefficients under different wind speeds, different scrape angles and different radar bands are calculated. Through the analysis of the calculation results, the influences of wind speed, grazing angle and frequency on the electromagnetic scattering characteristics of the Marine environment containing foam are studied, and the general variation rule is obtained: the intensity of electromagnetic scattering increases with the increase of wind speed, the decrease of incident Angle and the increase of frequency. The results of this paper can be used to guide ocean navigation and fishery, and have reference significance in the military field. [ABSTRACT FROM AUTHOR]

Gradient clipping is an effective method to prevent gradient explosion, but the selection of the gradient clipping parameter usually has a great inuence on the performance of training models. To address this issue, this paper proposes an improved differentially private stochastic gradient descent algorithm by adaptively adjusting the gradient clipping parameter. First, an adaptive gradient clipping method is proposed by using the quantile and exponential averaging strategy to dynamically and adaptively adjust the gradient clipping parameter. Second, the convergence and privacy of the proposed algorithm for the case of non-convex objective function are analyzed. Finally, numerical simulations are performed on MNIST, Fasion-MNIST and IMDB datasets. The results show that the proposed algorithm can significantly improve the model accuracy compared to traditional stochastic gradient descent methods. [ABSTRACT FROM AUTHOR]

This paper investigates the distributed optimization problem of networked Euler–Lagrange (EL) systems with actuator faults and unknown model parameters. In order to solve this issue, some event‐triggered fault‐tolerant (ETFT) optimal coordination algorithms with the mechanism of intermittent communication and intermittent controller update are designed for the first time to compensate for the impact of physical faults on the system, and reduce communication costs and control resource consumption. For practical applications, it is difficult for the system to have a secure environment if there exist malicious attacks blocking network channels among agents. Therefore, the resilient ETFT optimal coordination with intermittent communication subject to asynchronous denial‐of‐service (DoS) attacks is considered. Especially, auxiliary systems with adaptive gains are introduced in the algorithms due to the unavailability of the EL model parameters, which also enable virtual data exchange between agents and protect actual state information. Note that the algorithms are fully distributed as the global topology information is not required. Finally, the feasibility of the proposed algorithms is verified through numerical simulation of examples. [ABSTRACT FROM AUTHOR]

Homogenization is an important and crucial step to improve the usage of observational data for climate analysis. This work is motivated by the analysis of long series of GNSS Integrated Water Vapour (IWV) data, which have not yet been used in this context. This paper proposes a novel segmentation method called segfunc that integrates a periodic bias and a heterogeneous, monthly varying, variance. The method consists in estimating first the variance using a robust estimator and then estimating the segmentation and periodic bias iteratively. This strategy allows for the use of the dynamic programming algorithm, which is the most efficient exact algorithm to estimate the change point positions. The performance of the method is assessed through numerical simulation experiments. It is implemented in the R package GNSSseg, which is available on the CRAN. This paper presents the application of the method to a real data set from a global network of 120 GNSS stations. A hit rate of 32% is achieved with respect to available metadata. The final segmentation is made in a semi-automatic way, where the change points detected by three different penalty criteria are manually selected. In this case, the hit rate reaches 60% with respect to the metadata. [ABSTRACT FROM AUTHOR]

In this paper, we consider methods for generating draws of a binary random variable whose expectation conditional on covariates follows a logistic regression model with known covariate coefficients. We examine approximations for finding a "balancing intercept," that is, a value for the intercept of the logistic model that leads to a desired marginal expectation for the binary random variable. We show that a recently proposed analytical approximation can produce inaccurate results, especially when targeting more extreme marginal expectations or when the linear predictor of the regression model has high variance. We then formulate the balancing intercept as a solution to an integral equation, implement a numerical approximation for solving the equation based on Monte Carlo methods, and show that the approximation works well in practice. Our approach to the basic problem of the balancing intercept provides an example of a broadly applicable strategy for formulating and solving problems that arise in the design of simulation studies used to evaluate or teach epidemiologic methods. [ABSTRACT FROM AUTHOR]

The stochastic subspace algorithm is one of the most widely used structural identification techniques, which is generally involved with the stabilization diagram for estimating modal parameters. However, the conventional stabilization diagram has an inherent problem: some spurious modes may be identified as stable results, resulting in adverse effects on structural modal identification. To address this critical issue, this paper proposes an improved stochastic subspace algorithm involving a Monte Carlo–based stabilization diagram. Through a numerical simulation study, the good performance of the Monte Carlo–based stabilization diagram for discriminating the poles denoting the physical modes from those representing spurious modes is demonstrated. The numerical simulation results show that the proposed method can estimate structural modal parameters with high accuracy and robustness. Moreover, the proposed method is applied to field measurements on a 600-m-high skyscraper during Super Typhoon Mangkhut, and the results verify the applicability and effectiveness of the proposed method to field measurements. This paper aims to provide an effective tool for accurate estimation of modal parameters of civil structures. [ABSTRACT FROM AUTHOR]

This paper deals with the optimization of the CORDIC-based modified Gram-Schmidt (MGS) algorithm for QR decomposition (QRD) and presents a scalable algorithm with maximum throughput, the least possible latency, and hardware resources. The optimized algorithm is implemented on Xilinx Virtex 6 FPGA using ISE software as a fixed point with selected accuracy based on the results of MATLAB simulation. Using the loop unrolling technique with different coefficients, an attempt is made to reduce the latency and increase the throughput. In contrast, increasing the unrolling factor leads to a decrease in the frequency of the CORDIC unit as well as a decrease in the number of resources. As a result, there is a trade-off between the unrolling factor and the frequency of the CORDIC unit. By investigating the different unrolling factors, it is shown that the loop unrolling technique with a factor of 4 has the highest throughput with the value of 5.777 MQRD/s and the lowest latency with the value of 173 ns. Moreover, it is shown that throughput and latency are improved by 42.52% and 73.74% respectively compared to the not optimized case. The proposed method is also scalable for different sizes of m×m complex channel matrices, where log2 m ∈ N. [ABSTRACT FROM AUTHOR]

General type-2 fuzzy logic systems have received wide concerns in current academic subject. Type-reduction is the kernel module for the systems. This paper shows the interpretations for the beginning of Karnik–Mendel (KM) algorithms. According to the famous numerical integration technique, the weighting approaches of enhanced Karnik–Mendel (EKM) algorithms are put forward. Then, the sensible beginning weighted enhanced Karnik–Mendel (SBWEKM) algorithms are put forward to perform the centroid type-reduction. Compared with the EKM algorithms, WEKM algorithms and SBEKM algorithms, this approach helps to improve both the absolute errors and convergence speeds as shown in four computer simulation experiments. [ABSTRACT FROM AUTHOR]

Summary: This paper mainly investigates the issue of parameter identification for the fractional‐order input nonlinear output error autoregressive (IN‐OEAR) model. In order to avoid the problem of large computation of redundant parameter estimation, the output form of the system can be expressed by a linear combination of unknown parameters through the key term separation. Through employing the hierarchial identification principle, the fractional‐order IN‐OEAR model is decomposed into two sub‐models with a smaller number of parameters. On the basis of the recursive identification methods, a recursive least squares sub‐algorithm and a gradient stochastic sub‐algorithm are proposed to estimate the parameters and the fractional‐order, respectively. With the aim of achieving more accurate parameter estimates, a two‐stage multi‐innovation least recursive algorithm is proposed by means of the multi‐innovation identification theory. The numerical simulation results test the effectiveness of the proposed methods. [ABSTRACT FROM AUTHOR]

Digital image technology is penetrating into various fields of people's life, and it has been very mature and can effectively store and transmit data. Moreover, there are still various researches on image recognition, the core of this technology. The algorithm is mainly based on computer technology to obtain the target image for different scene categories, thus completely replacing the traditional classification form. Because of the limitations of traditional identification technology, there are some problems in the actual use. It does not depend on the prior knowledge requirements and can carry out complex feature space division. In this paper, an image recognition computer system is established by introducing an improved neural network algorithm. The algorithm is designed and tested, and the results show it has lower image recognition error rate. Subsequently, this research result is applied to the actual scene for testing. The test results show that the improved neural network optimization algorithm can make the extracted features more accurately expressed in the image processing, which is more effective than the traditional algorithm. [ABSTRACT FROM AUTHOR]

Modal-free optimization algorithms do not require specific mathematical models, and they, along with their other benefits, have great application potential in adaptive optics. In this study, two different algorithms, the single-dimensional perturbation descent algorithm (SDPD) and the second-order stochastic parallel gradient descent algorithm (2SPGD), are proposed for wavefront sensorless adaptive optics, and a theoretical analysis of the algorithms' convergence rates is presented. The results demonstrate that the single-dimensional perturbation descent algorithm outperforms the stochastic parallel gradient descent (SPGD) and 2SPGD algorithms in terms of convergence speed. Then, a 32-unit deformable mirror is constructed as the wavefront corrector, and the SPGD, single-dimensional perturbation descent, and 2SPSA algorithms are used in an adaptive optics numerical simulation model of the wavefront controller. Similarly, a 39-unit deformable mirror is constructed as the wavefront controller, and the SPGD and single-dimensional perturbation descent algorithms are used in an adaptive optics experimental verification device of the wavefront controller. The outcomes demonstrate that the convergence speed of the algorithm developed in this paper is more than twice as fast as that of the SPGD and 2SPGD algorithms, and the convergence accuracy of the algorithm is 4% better than that of the SPGD algorithm. [ABSTRACT FROM AUTHOR]

Low-level wind shear is a vital weather process affecting aircraft safety while taking off and landing and is known as the "aircraft killer" in the aviation industry. As a result, effective monitoring and warning are required. Several ramps detection algorithms for low-level wind shear based on glide path scanning of lidar have been developed, including double and simple ramp detection, with the ramp length extension and contraction strategies corresponding to the algorithm. However, current algorithms must be improved to determine the maximum shear value and location. In this paper, a new efficient algorithm based on the shear intensity factor value is presented, in which wind speed changes and distance are both considered when calculating wind shear. Simultaneously, the effectiveness of the improved algorithm has been validated through numerical simulation experiments. Results reveal that the improved algorithm can determine the maximum intensity value and wind shear location more accurately than the traditional algorithm. In addition, the new algorithm improved the detection ability of lidar for weak wind shear. [ABSTRACT FROM AUTHOR]

This paper presents a new passivity-preserving order reduction method for linear time-invariant passive systems, which are also called positive real (PR) systems, with the aid of the balanced truncation (BT) method. The proposed method stems from the conic positive real balanced truncation (CPRBT) method, which is a modification of the BT method for PR systems. CPRBT presents an algorithm in which the reduced models are obtained from some Riccati equations in which the phase angle of the transfer function has been taken into consideration. Although CPRBT is a powerful algorithm for obtaining accurate PR reduced-order models, it cannot guarantee that the phase diagram of the reduced model remains inside the same interval as that of the original full-order system. We aim to address such a problem by modifying CPRBT in the way that the phase angle of the reduced transfer function always remains inside the conic and homolographic phase interval of the original system. This is proven through some matrix manipulations, which has added mathematical value to the paper. Finally, in order to assess the efficacy of the proposed method, two numerical examples are simulated. [ABSTRACT FROM AUTHOR]

This paper proposes a new hybrid robust control method for control of an autonomous underwater vehicle. Fractional sliding mode control (FSMC) is robust against external disturbances. The main drawback of the FSMC method is creating a chattering phenomenon. Therefore, a compound control method is applied, which benefits in both robustness of the FSMC method and chattering elimination by the new control algorithm. A random noise is applied in order to verify the robustness of the proposed control method. The stability of FSMC and proposed compound control method has been verified by Lyapunov theory. The effectiveness of the proposed control method is compared with FSMC, which numerical simulation results confirm the best performance of the proposed control method. [ABSTRACT FROM AUTHOR]

Background: Despite its obvious relevance to computer science, computational thinking (CT) is transdisciplinary with the potential of impacting one's analytical ability. Although countless efforts have been invested across K‐12 education, there is a paucity of research at the postsecondary level about the extent to which CT can contribute to sustainable learning outcomes. Objectives: The current study examines how a series of Arduino‐based robotics learning activities capture the fuller essence of concepts related to CT. Methods: College students (n = 50) completed a series of six robotics learning activities. Think‐alouds, student reflections and performance scores were used to assess students' CT through a robotics challenge in virtual and physical learning environments. Results and Conclusions: Students verbalized CT concepts related to algorithmic thinking much more than abstraction, problem decomposition and testing and debugging. Students exposed to active learning performed better in a virtual robotics challenge compared to their peers in a traditional‐oriented classroom. Students' scores on the physical robotics challenge increased as a function of the number of references they made to CT concepts during the think‐alouds. It is possible to design pedagogical experiences that tap into various dimensions of CT at incremental levels of complexity through a series of Arduino‐based robotics activities. With the integration of an online simulation, students can visualize and transfer their CT skills between a virtual and physical learning environment, thus leading to more sustainable learning outcomes. Lay Description: What is already known about this topic: Computational thinking (CT) is the conceptual foundation for problem‐solving.CT shifted from unplugged to plugged activities.CT concepts can be fostered through educational robotics. What this paper adds: A multi‐dimensional approach to assessing CT.Applications of CT provide insights into skill transfer.An integrative theoretical approach to study the 'how' and the 'what' of CT. Implications for practice: Educational robotics activities can cater to a fuller range of CT skills.Virtual simulations with constructive feedback are beneficial for students in traditional settings.Mixed learning environments contribute to making links between lectures and labs. [ABSTRACT FROM AUTHOR]