For massive multiple-input multiple-output (MIMO) communications, the minimum mean square error (MMSE) scheme provides close to optimal recognition but involves inverting the high-dimensional matrix. A Gauss-Seidel (GS) detector based on conjugate gradient and Jacobi iteration (CJ) joint processing is introduced to address this problem. Firstly, the signal is initialized with the best of the three initialization regimes for faster algorithm convergence. Secondly, the signal is processed together with CJ. Finally, the pre-processed result is transferred to the GS detector. The simulation results indicate that the proposed iterative algorithm has a lower BER performance than the GS and improved iterative scheme based on GS in channels with different correlation levels.

There are some limitations in the null test measurement in the stitching interferometry. In order to meet the null test conditions, the moving distance between the sub-apertures often deviates from the theoretical preset distance, which leads to a position deviation of sub-apertures under measurements. To overcome this problem, an algorithm for data processing is proposed. We used iterative calculation of the deviations between the sub-apertures to adjust their positions, to ensure the local validity of the linear approximation algorithm and realize the exact stitching. A cylindrical lens as an object for experimental examination of the proposed method was taken. The obtained results demonstrate the validity, reliability and feasibility of our iterative stitching algorithm.

This paper presents a new adaptive and optimal algorithm for the trajectory tracking control of a quadrotor using iterative learning algorithm (ILA) and enumerative learning algorithm. Ordinarily the ILA, as an adaptive method, can perform well with PID control to improve the controller’s performance for a nonlinear system. Quadrotors are considered as non-linear and unstable systems which the use of an adaptive and optimal controller can increase its stability and decrease error level. In this method, a PID controller is proposed for the outer and inner control loops of a quadrotor and the ILA is used to adapt PID control gains. Subsequently, an enumerative learning algorithm is used to optimize the learning rates of the ILA. For this purpose, at first, the dynamic model of the quadrotor is acquired. After that, the structure of the inner and outer control loops is defined. In the end, the simulation results for the trajectory tracking control of a quadrotor are demonstrated. Through simulation, it is concluded that as time increases, the performance of the suggested control method in trajectory tracking control becomes better and better and error signals convergence to zero.

Recently, a layer-stacked ESN model named deep echo state Network (DeepESN) has been established. As an interactional model of recurrent neural network and deep neural network, investigations of DeepESN are of significant importance in both areas. Optimizing the structure of neural networks remains a common task in artificial neural networks, and the question of how many neurons should be used in each layer of DeepESN must be stressed. In this paper, our aim is to solve the problem of choosing the optimized size of DeepESN. Inspired by the sensitive iterative pruning algorithm, a neuronal similarity-based iterative pruning merging algorithm (NS-IPMA) is proposed to iteratively prune or merge the most similar neurons in DeepESN. Two chaotic time series prediction tasks are applied to demonstrate the effectiveness of NS-IPMA. The results show that the DeepESN pruned by NS-IPMA outperforms unpruned DeepESN with the same network size, and NS-IPMA is a feasible and superior approach to improving the generalization performance of DeepESN.

The node position information is critical in the wireless sensor network (WSN). However, the existing positioning algorithms commonly have low positioning accuracy because of noise interferences in communication. To solve this problem, this paper presents an iterative positioning model based on distance correction to improve the positioning accuracy of the target node in WSN. First, the log-distance distribution model of received signal strength indication (RSSI) ranging is built and the noise impact factor is derived based on the model. Second, the initial position coordinates of the target node are obtained based on the triangle centroid localization algorithm, thereby calculating the distance deviation coefficient under the influence of noise. Then, the ratio of the distance measured by the log-normal distribution model to the median distance deviation coefficient is taken as the new distance between the anchor node and the target node. Based on the new distance, the triangular centroid positioning algorithm is used again to calculate the target node coordinates. Finally, the iterative positioning model is constructed, and the distance deviation coefficient is updated repeatedly to update the positioning result until the set number of iterations is reached. Experiment results show that the proposed iterative positioning model can improve positioning accuracy effectively.

Use of MS Excel as a platform for teaching simple iterative solution of partial differential equations runs into issues of reliability of the computation because of the large number of calculations required. This article documents the problem and an empirical solution. The cause of this unreliability was found by detailed examination of the numerical results from three simultaneous iterations. Computers of several types from different manufacturers were found to fail occasionally in updating variables in the numerical iteration. A simple work-around is suggested and was tested on several platforms.

This study assessed the performance of low-dose CT lung scans across various acquisition parameters and examined the impact of iterative reconstruction (IR) algorithms on image quality for lung cancer screening. The performance of multi-slice CT scanners was assessed by using a Catphan 600 phantom, specifically within the CTP404 test module that contains materials like Teflon, Delrin, Acrylic, Polystyrene, LDPE, PMP, Air, and water. Three protocols were selected and categorized into standard, low dose, and ultra-low dose. The standard protocol featured a tube voltage of 100 kVp for single-detector CT, a pitch of 0.75, detector collimation of 0.60 mm, and a gantry rotation time of 0.33 seconds, with 5 mm slice thickness. Images were reconstructed using standard kernels like B80f and 170f, combined with either FBP or various IR algorithms. Findings indicated that the noise power spectrum (NPS) peak value (HU2mm2) increased with higher IR levels, with FBP showing the highest peak. Additionally, NPS spatial frequency diminished as IR levels rose. Optimizing contrast and spatial resolution for both background and regions of interest involved adjusting the target transfer function (TTF) and contrast-to-noise ratio (CNR), crucial for protocol optimization. Proper adjustment of IR levels is vital, as higher levels can alter image texture and affect NPS spatial frequency. The results of this study showed that the use of IR algorithms in low-dose CT lung scans significantly improved image quality, particularly in terms of noise reduction and spatial resolution. However, the choice of acquisition parameters also played a crucial

As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.

In the Versatile Video Coding (VVC) standard, affine motion models have been applied to enhance the resolution of complex motion patterns. However, due to the high computational complexity involved in affine motion estimation, real-time video processing applications face significant challenges. This paper focuses on optimizing affine motion estimation algorithms in the VVC environment and proposes a fast gradient iterative algorithm based on edge detection for efficient computation. Firstly, we establish judging conditions during the construction of affine motion candidate lists to streamline the redundant judging process. Secondly, we employ the Canny edge detection method for gradient assessment in the affine motion estimation process, thereby enhancing the iteration speed of affine motion vectors. Experimental results demonstrate that our affine motion estimation algorithm reduces encoding time by approximately 15%-35% while maintaining video bitrate and quality.

In this paper, we first investigate secure communications for a two-hop interference relay system in the wireless Internet of Things (IoT), where K source-destination pairs communicate in the presence of an eavesdropper. Explicitly, we jointly design source, relay and destination matrices upon minimizing total mean-squared error (MSE) of all legitimate destinations while keeping the MSE at eavesdropper above a certain threshold. We illuminate that the joint design of the source, relay and destination matrices subject to both secrecy and transmit power constraints. More specifically, we proposed an efficient iterative distributed algorithm to simplify the process of the joint design for optimal source, relay and destination matrices. Furthermore, the convergence of the iterative distributed algorithm is described. Additionally, the performances of the proposed algorithm, including both its secrecy rate and MSE, are characterized with the aid of simulation results. We demonstrate that our proposed algorithm outperforms the traditional approach. As a benefit, secure communications can be guaranteed by using the proposed algorithm for the multiple input multiple output (MIMO) interference relay IoT network in the presence of an eavesdropper.

Greenhouse gas (GHG) emissions from agriculture are significant contributors to global change. We experimentally manipulated biogeochemical control points of irrigation and nitrogen (N) to examine management strategies that could impact GHG flux, i.e., carbon dioxide (CO2), methane (CH4) and nitrous oxide (N2O) and soil physiochemical changes over a growing season in an arid New Mexico sorghum (Sorghum bicolor (L.) Moench) cropping system. Sorghum is water and N efficient and amenable to environmental stress. Interrogating how crop systems perform in intense heat, aridity and ultraviolet stress of the southwestern US climate can inform future management in areas that produce more food currently, but that will undergo these stresses in the near future. Water was applied at regionally typical rates, or at ~30% below those rates. Timing N to plant needs may reduce N loss and N2O emissions, and we tested this hypothesis by adding equal amounts of fertilizer to all plots, with half receiving all fertilizer at planting versus plots fertilized at 50:50 planting and 30 days post-planting. Gas flux from soil was analyzed via FTIR. More biomass was harvested from the fully irrigated plots; N timing did not significantly affect biomass. Soil pH fluctuated throughout the season in response to both treatments. Carbon dioxide emissions significantly increased in fully irrigated plots through time. Methane uptake was depressed by full irrigation. Nitrous oxide flux was lower in split N plots, but N2O emissions were not impacted by reduced irrigation. These results suggest that arid adapted crops can maintain economically feasible yield, and biogeochemical monitoring within a growing season can help manage for GHG flux.

The key links of face recognition are digital image preprocessing, facial feature extraction and pattern recognition, this article aimed at the current problem of slow speed and low recognition accuracy of face recognition , from the above three key links, on the basic of analyzing the therories of Fractional Differential Masks Operator (FDMO), Principal Component Analysis (PCA) and Support Vector Machine (SVM), design a kind of FDMO+PVA+SVM coupling algorithm that applies to face recognition to improve the speed and accuracy of it. To realize FDMO+PCA+SVM coupling algorithm, first, we should apply FDMO to face image processing binary marginalization, the purpose is getting face contour; Then, we apply PCA to get the feature of face image which is disposed by binary marainalization. At last, we can apply One-Against All of the SVM classifier and LibSVM software package to realize face recognition. Beside, the article with nine different coupling algorithm design four groups of experimental reaults on the ORL face database verified by comparative analysic FDMO+PCA+SVM coupling algorithm in the superiority of face recognition accuracy and speed.

Conditions under which compositions of component systems form a well-defined system-of-systems here are formulated at a fundamental level. Statement of what defines a well-defined composition and sufficient conditions guaranteeing such a result offers insight into exemplars that can be found in special cases such as differential equation and discrete event systems. For any given global state of a composition, two requirements can be stated informally as: 1) the system can leave this state, i.e., there is at least one trajectory defined that starts from the state, and 2) the trajectory evolves over time without getting stuck at a point in time. Considered for every global state, these conditions determine whether the resultant is a well-defined system and if so, whether it is non-deterministic or deterministic. We formulate these questions within the framework of iterative specifications for mathematical system models that are shown to be behaviorally equivalent to the Discrete Event System Specification (DEVS) formalism. This formalization supports definitions and proofs of the afore-mentioned conditions. Implications are drawn at the fundamental level of existence where the emergence of a system from an assemblage of components can be characterized. We focus on systems with feedback coupling where existence and uniqueness of solutions is problematic.

With the increasing concern of environment, the energy-efficiency scheduling of manufacturing industry is becoming urgent and popular. In turning processes, both spindle speed and processing time can affect the final energy consumption and thus the spindle speed and scheduling scheme need to be optimized simultaneously. Since the turning workshop can be regarded as the flexible flow shop, this paper formulates a mixed integer linear programming model for energy-efficient scheduling of flexible flow shop. Accordingly, a new decoding method is developed by considering of the optimization of spindle speed and scheduling scheme simultaneously, and an estimation of distribution algorithm adopting the new decoding method is proposed to solve large-size problems. The parameters of this algorithm are determined by statistical technique with a simplified practical case. In order to validate the proposed method, a case from practical factories is studied, in which the makespan can be shortened by 25.22%, and the consumed energy can be saved by 5.48%. These results demonstrate the effectiveness of the proposed mathematical model and algorithm.

This study utilizes repeated geoacoustic mapping to quantify the morphodynamic response of the nearshore to storm-induced changes. The aim of this study was to quantitatively map the nearshore zone of Assateague Island National Seashore (ASIS) to determine what changes in bottom sediments, benthic fauna and fish habitat are attributable to storm events including hurricane Sandy and the passage of hurricane Joaquin. Specifically, (1) the entire domain of the National Parks Service offshore area was mapped with side-scan sonar and multibeam bathymetry at a resolution comparable to that of the existing pre-storm survey, (2) a subset of the benthic stations were resampled that represented all sediment strata previously identified, and (3) newly obtained data were compared to that from the pre-storm survey to determined changes that could be attributed to specific storms such as Sandy and Joaquin. Capturing event specific dynamics requires rapid response surveys in close temporal association of the before and after period. The time-lapse between the pre-storm surveys for Sandy and our study meant that only a time and storm integrated signature for that storm could be obtained whereas with hurricane Joaquin we could identify impacts to the habitat type and geomorphology more directly related to that particular storm. This storm impacts study provides for the National Park Service direct documentation of storm-related changes in sediments and marine habitats on multiple scales: from large scale, side-scan sonar maps and interpretation of acoustic bottom types, to characterize as fully as possible habitats from 1 to 10 m up to many kilometer scales, as well as from point benthic samples within each sediment stratum and these results can help guide management of the island resources.

In order to overcome the limitation of the traditional adaptive Unscented Kalman Filtering (UKF) algorithm in noise covariance estimation for statement and measurement, we propose a hybrid adaptive UKF algorithm based on combining Maximum a posteriori (MAP) criterion and Maximum likelihood (ML) criterion, in this paper. First, to prevent the actual noise covariance deviating from the true value which can lead to the state estimation error and arouse the filtering divergence, a real-time covariance matrices estimation algorithm based on hybrid MAP and ML is proposed for obtaining the statement and measurement noises covariance, respectively; and then, a balance equation the two kinds of covariance matrix is structured in this proposed to minimize the statement estimation error. Compared with the UFK based MAP and based ML, the proposed algorithm provides better convergence and stability.

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

In wireless sensor networks (WSNs), each sensor node can estimate the global parameter from the local data in distributed manner. This paper proposed a robust diffusion estimation algorithm based on minimum error entropy criterion with self-adjusting step-size, which are referred to as diffusion MEE-SAS (DMEE-SAS) algorithm. The DMEE-SAS algorithm has fast speed of convergence and is robust against non-Gaussian noise in the measurements. The detailed performance analysis of the DMEE-SAS algorithm is performed. By combining the DMEE-SAS with diffusion minimum error entropy (DMEE) algorithms, an Improving DMEE-SAS algorithm is proposed, in non-stationary environment where tracking is very important. The Improving DMEE-SAS algorithm can avoid insensitivity of the DMEE-SAS algorithm due to the small effective step-size near the optimal estimator, and obtain a fast convergence speed. Numerical simulations are given to verify the effectiveness and advantages of these proposed algorithms.

Oryzias latipes is an important model organism for physiology, genetics and developmental studies, and has also emerged a relevant vertebrate model for aquatic ecotoxicology. Knowledge regarding its associ-ated microbiota on the other hand is still scarce and limited to adults, despite the relevance of associated microbiome to hosts biology. This study provides first insights into the establishment of bacterial mi-crobiota during early developmental stages of laboratory-reared medaka using a 16SrRNA sequenc-ing-based approach. Major shifts in community compositions are observed, from a Proteobacte-ria-dominated community in larvae and juveniles to a more phylum diverse community towards adult-hood, with no obvious difference between female and male specimens. Major bacterial taxa found in adults, including genera Cetobacterium and ZOR0006, establish progressively and are rare during early stages. Dominance shifts are comparable to those documented in another major model teleost, the zebrafish. Results from this study provide a basis for future work investigating the influence of meda-ka-associated bacteria during host development.

In this paper, we first discuss the research status and application progress of the finite element method and the smoothed particle method. By analyzing the advantages of the smoothed particle method and the finite element method, a new coupling algorithm, namely FEM-SPH algorithm, is proposed. By the method of comparison, it shows that finite element method and SPH method in the simulation of large deformation problems each have advantages and disadvantages, the finite element method smoothed particle coupling algorithm is effective to achieve the performance of high computational efficiency and can naturally simulate large deformation problems across. In the process of calculation, the large deformation unit can be freely into an algorithm to facilitate the calculation accuracy and efficiency of three methods of numerical simulation. Through the study found, FEM-SPH algorithm not only overcome the defect of smooth particle tensile instability, but also overcomes the problem of low efficiency of finite element computation. To further test the FEM-SPH algorithm has advantages in the practical engineering, we have carried out the actual test to the example of the super high speed collision, concluded that, since the target of most of the computational domain is always finite element, smoothed particle focused only in contact with the projectile and target of local area, particle number is not much, the whole calculation process just ten minutes, computational efficiency has been greatly improved, at the same time in the simulation of large deformation, the advantage is very obvious .This provides a criterion for the actual project, depending on the specific material deformation mode and choose a more appropriate conversion algorithm.

This paper proposes a new approach for multi-focus images fusion based on Region Mosaicing on Contrast Pyramids (REMCP). A density-based region growing method is developed to construct a focused region mask for multi-focus images. The segmented focused region mask is decomposed into a mask pyramid, which is then used for supervised region mosaicking on a contrast pyramid. In this way, the focus measurement and the continuity of focused regions are incorporated and the pixel level pyramid fusion is improved at the region level. Objective and subjective experiments show that the proposed REMCP is more robust to noise than compared algorithms and can fully preserves the focus information of the multi-focus images meanwhile reducing distortions of the fused images.

Pavement crack detection is one of the key links in highway pavement maintenance management. In the current road crack detection, the network model easily ignores the shallow geometric features of cracks and cannot extract the key feature information of cracks. Aiming at the above problems, an EC-YOLOX network model is proposed. The CFPN is constructed to cross-fuse different scale features to solve the feature scale invariance. In the strengthen feature extraction layer, ECANet is fused to enhance the ability to pay attention to key information. The WEIoU loss function is proposed, which assigns different penalty terms to the target box in the vertical and horizontal directions. In terms of data, geometric distortion constraint correction is performed on the single-point perspective pavement image. The experimental data show that the accuracy of EC-YOLOX on the self-built data set reaches 76.34% [email protected], which is 4.45% higher than that of YOLOX. The loss curve of EC-YOLOX is smoother than that of YOLOX, and the minimum training loss value is 2.136, which is 0.648 lower than the minimum loss value 2.784 of YOLOX. Many experiments have verified the effectiveness of EC-YOLOX in improving the detection effect in pavement crack detection.

Classifying network flow subsequences in an Industrial IoT gateway is an effective method for identifying Industrial IoT faults. This paper proposes a subsequence classification algorithm SSGBUL-IKNN based on unsupervised learning encoding to address the problem of low classification accuracy. Firstly, we built a network module based on unsupervised learning to encode the flow sequence of the Industrial IoT gateway. In the encoding module, a subsequence calibration algorithm controls the increasing error during the coding process. Then, the specific fault type is obtained through an improved KNN classification algorithm based on the indication distance source from the integrated coding sequences converted by multi-dimensional network flow sequences. The test result on three Industrial IoT datasets of a sewage treatment plant shows that the accuracy of SSGBUL-IKNN in this paper exceeds 92%, significantly higher than the algorithm DTW and TSF. It reaches the classification requirements of Industrial IoT fault diagnosis.

The state of charge estimation is an important part of the battery management system, the estimation accuracy of which seriously affects the working performance of the lithium ion battery pack. The unscented Kalman filter algorithm has been developed and applied to the iterative calculation process. When it is used to estimate the SOC value, there is a rounding error in the numerical calculation. When the sigma point is sampled in the next round, an imaginary number appears, resulting in the estimation failure. In order to improve the estimation accuracy, an improved adaptive square root - unscented Kalman filter method is introduced which combines the QR decomposition in the calculation process. Meanwhile, an adaptive noise covariance matching method is implied. Experiments show that the proposed method can guarantee the semi-positive and numerical stability of the state covariance, and the estimation accuracy can reach the third-order precision. The error remains about 1.60% under the condition of drastic voltage and current changes. The conclusion of this experiment can provide a theoretical basis of the state of charge estimation in the battery management of the lithium ion battery pack.

The properties of iterative splitting methods with serial versions have been analyzed since recent years, see [1] and [3]. We extend the iterative splitting methods to a class of parallel versions, which allow to reduce the computational time and keep the bene t of the higher accuracy with each iterative step. Parallel splitting methods are nowadays important to solve large problems, which can be splitted in subproblems and computed independently with the dierent processors. We present a novel parallel iterative splitting method, which is based on the multi-splitting methods, see [2], [10] and [15]. Such a exibilisation with multisplitting methods allow to decompose large iterative splitting methods and recover the bene t of their underlying waveform-relaxation (WR) methods. We discuss the convergence results of the parallel iterative splitting methods, while we could reformulate such an error to a summation of the individual WR methods. We discuss the numerical convergence of the serial and parallel iterative splitting methods and present dierent numerical applications to validate the bene t of the parallel versions.

With the integrated development of the Internet, wireless sensor technology, cloud computing, and mobile Internet, there has been a lot of attention given to research about and applications of the Internet of Things. A Wireless Sensor Network (WSN) is one of the important information technologies in the Internet of Things; it integrates multi-technology to detect and gather information in a network environment by mutual cooperation, using a variety of methods to process and analyze data, implement awareness, and perform tests. This paper mainly researches the localization algorithm of sensor nodes in a wireless sensor network. Firstly, a multi-granularity region partition is proposed to divide the location region. In the range-based method, the RSSI (Received Signal Strength indicator, RSSI) is used to estimate distance. The optimal RSSI value is computed by the Gaussian fitting method. Furthermore, a Voronoi diagram is characterized by the use of dividing region. Rach anchor node is regarded as the center of each region; the whole position region is divided into several regions and the sub-region of neighboring nodes is combined into triangles while the unknown node is locked in the ultimate area. Secondly, the multi-granularity regional division and Lagrange multiplier method are used to calculate the final coordinates. Because nodes are influenced by many factors in the practical application, two kinds of positioning methods are designed: the unknown node is in the positioning unit or not. When the unknown node is on the side of the positioning unit, we use the method of vector similarity. Moreover, we use the centroid algorithm to calculate the ultimate coordinates of unknown node. When the unknown node is not on the side of the positioning unit, we establish a Lagrange equation containing the constraint condition to calculate the first coordinates. Furthermore, we use the Taylor expansion formula to correct the coordinates of the unknown node. In addition, this localization method has been validated by establishing the real environment.

The paper presents an error model of a measurement chain containing link performing discrete wavelet transform algorithm which is most often the last stage of measurement signal processing. The goal is to determine the uncertainty budget of the input quantities of the wavelet transform algorithm. The error model takes into account parts of analog, analog-to-digital and digital processing, describing the properties of subsequent fragments of the chain using their transmittance and processing functions. The proposed model enables the description of both deterministic and non-deterministic properties of signal errors. The proposed model was validated using an example measurement chain created for this purpose.

The conventional well placement was done manually by using a numerical reservoir simulator, and it required a lengthy trial-and-error process. It required great experience and expertise to manipulate the variables and uncertainties that lie on the reservoir to determine the best placement of the well. In addition, the traditional gradient-based methods such as Line-search and Trust-region were not viable in terms of maximum results obtained. Gradient-based methods were too dependent on the surface gradient of the solution and may only converge to local optima instead of global optima. Complex reservoirs have rough surfaces with high uncertainties, which hinders the traditional gradient-based method from converging to global optima. Thus, genetic algorithms were utilized to automate the manual trial-and-error process and to overcome the limitations of the traditional gradient-based method. The objectives of this study were to analyse the effect of different initial well placement distributions, the number of random solution sizes, and the crossover rate on cumulative oil production. A synthetic reservoir model built using CMG Builder was used as the testing platform for the optimization problems. Well-placement parameterization and optimization set-up were carried out using the CMG CMOST optimization tool. The integration of CMG IMEX and CMOST optimized cumulative oil production based on the objectives of the study. The results obtained showed that the higher number of random solutions used resulted in higher cumulative oil production, with more generations needed to reach the optimum solution. It can be concluded that the larger number of random solutions used increased the probability of reaching the optimum solution, but will take more generations.

Recent advances in quantum computing systems attract tremendous attention. Commercial companies, such as IBM, Amazon, and IonQ, have started to provide access to noisy intermediate-scale quantum computers. Researchers and entrepreneurs attempt to deploy their applications that aim to achieve a quantum speedup. Grover’s algorithm and quantum phase estimation are the foundations of many applications with the potential for such a speedup. While these algorithms, in theory, obtain marvelous performance, deploying them on existing quantum devices is a challenging task. For example, quantum phase estimation requires extra qubits and a large number of controlled operations, which are impractical due to low-qubit and noisy hardware. To fully utilize the limited onboard qubits, we develop a distributed application with a key-value data structure based on Grover’s algorithm called IQuCS . Consider a database with duplicates. By encoding each element to a binary type with a unique key and forming a key-value pair, we can count the number of occurrences of each element in the database based on quantum computing. We have optimized the operation process by filtering data points to make it more efficient. To determine the effect of this optimization, we evaluate it with datasets of different sizes and with different numbers of duplicates. With the assistance of classical computers, IQuCS can reduce the problem set for each query. Due to this reduction, IQuCS requires fewer qubits. Through the iterative management, IQuCS achieves a reduction of qubit virtualized consumption, up to 66.2%, with reasonable accuracy.

Depth-sensing technology has led to broad applications of inexpensive depth cameras that can capture human motion and scenes in 3D space. Background subtraction algorithms can be improved by fusing color and depth cues, thereby allowing many issues encountered in classical color segmentation to be solved. In this paper, we propose a new fusion method that combines depth and color information for foreground segmentation based on an advanced color-based algorithm. First, a background model and a depth model are developed. Then, based on these models, we propose a new updating strategy that can eliminate ghosting and black shadows almost completely. Extensive experiments have been performed to compare the proposed algorithm with other, conventional RGB-D algorithms. The experimental results suggest that our method extracts foregrounds with higher effectiveness and efficiency.

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assisted. It is especially relevant for sensor nodes location in UWSNs. Global Positioning System (GPS) is not suitable for using in UWSNs because of the underwater propagation problems. Hence some localization algorithms based on the precise time synchronization between sensor nodes have been proposed which are not feasible for UWSNs. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme base on the Particle Swarm Optimization (PSO) algorithm to decrease the localization error. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence in this algorithm, we use a small number of mobile beacons to help achieve location without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.

Insulated Gate Bipolar Transistor (IGBT) may convey high current and sustain high breakdown voltages; it may provide high power control. In a sense, how IGBT demonstrates the capability of power control was not specifically described, and the equivalent bipolar junction transistors (BJT) activated by an applied bias to the insulated gate is intriguing. As seen in Figure 1, IGBT shows an equivalent circuit structure containing two types of BJT, (NPN-type Bipolar transistor and PNP-type Bipolar transistor), which can be modeled as diode-associated transistor. Apparently, as a bias applies to the controlling gate, the channel beneath the gate oxide gets strongly inversed and turns out to be conductive just like what happens on metal-oxide-silicon field effect transistor (MOSFET), which provides necessary igniting currents to both BJTs and thus causes high current gain flowing through them-selves from the bottom. A proposed and renewed formula provides addressing the above scenario and successfully fitting the measured data that forms the characteristic curves. Some parameters in the proposed formula, which includes size and mobility associated constant, threshold voltage, and Early-Voltage-related lambda for MOSFET, explain and explore the underlying physics. IGBT thus enjoy high input impedance and high current gain due to MOSFET (Insulated Gate) and BJT, respectively. This formula combines both merits of MOSFET and BJT in order to fit the measured data. Indeed, the formula intimately fits IGBT electrical characteristic curves, and thus may be qualified and served as a model. The new model is then advisable for designing power integrated circuit to exactly achieve power saving, power control, and power efficiency.

We present a MATLAB-based, open source reconstruction software for Hybrid Imaging problem arising from Current Density Impedance Imaging (CDII) and Acoustic-Electrical Impedance Tomography (AEIT), utilizing mixed finite element method solver of Darcy toolbox {\tt DarcyLite}~. For a formulation of hybrid inverse problems in impedance tomography the successive substitution iterative schemes are adapted and an reconstruction algorithm is developed. The problem formulation is a class of hybrid imaging modality which is current density impedance imaging or Acoustic-Electrical Impedance Tomography. The proposed algorithm is implemented numerically in two dimensions.

In this paper, it is proved that s-iteration with error and Picard-Mann iteration with error iterative processes converge strongly to the unique fixed point of Lipschitzian strongly pseudo-contractive map. This convergence is almost -stable and -stable. Applications of these results to the operator equations, where is a strongly accretive and accretive mappings of into itself.

Deadlock is a real problem that can cause expensive, time-dependent hang-ups or failures in distributed computing systems. Some studies have been conducted with deadlock detection and resolution in generalized request computing models, most of these studies are based on the diffusing computation scheme, where forward and backward propagated probe and reply messages respectively are diffused between dependent processes. The replies carry the dependency information between processes for the initiator. Using this dependency information initiator can detect and resolve the deadlock cycle. It has been proven in the literature that a deadlock cycle length distribution is skewed with a large majority of cycles (90%) having length two. Based on this fact an improved algorithm is proposed for handling deadlock detection in distributed computing systems under the distributed request model where each process has several requests at a time. The improved algorithm depends mainly on message propagation and timeout policy. Probe and reply messages are propagated between the initiator and its successors only to detect deadlock cycles between them. Global timeout policy is used to detect potential deadlock cycles with large length distribution. The proposed algorithm can handle concurrent executions. Simulation experiments are performed to see the effectiveness of the improved algorithm. It is found that the improved algorithm compares favorably with other existing algorithms and it shows better results for several performance metrics especially in reducing deadlock latency and execution time.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

Detection of subsurface archaeological remains using a range of remote sensing methods, poses several challenges until today. Recent studies regarding the detection of archaeological proxies like those of cropmarks highlight the complexity of the phenomenon. In this work we present three different methods, and associated indices, for identifying stressed reflectance signatures indicating buried archaeological remains, based on a dataset of measured ground spectroradiometric reflectance. Several spectral profiles between the visible and near infrared part of the spectrum, were taken over a controlled environment in Cyprus during the 2011-2012 and are re-used in this study. The first two (spectral) methods are based on a suitable analysis of the spectral signatures in (1) the visible part of the spectrum, and in particular in the neighborhood of 570 nm, and (2) the red edge-near infrared part of the spectrum, in the neighborhood of 730 nm. Machine learning (decision trees) allows for the deduction of suitable wavelengths to focus on, in order to formulate the proposed indices and the associated classification criteria (decision boundaries) that can enhance the detection probability of stressed vegetation. Noise in the signal is taken into account by simulating reflectance signatures perturbed by white noise. Applying decision tree classification on the ensemble of simulations and basic statistical analysis we refine the formulation of the indices and criteria for the noisy signatures. The success rate of the proposed methods is over 90%. The third method rests on the estimation of vegetation/canopy reflectance parameters through inversion of the physical-based PROSAIL reflectance model and the associated classification through machine learning methods. The obtained results provide further insights into the formation of stress vegetation that occurred due to the presence of shallow buried archaeological remains, which are well aligned with physical-based models and existing empirical knowledge. To the best of the authors' knowledge, this is the first study demonstrating the usefulness of radiative transfer models such as PROSAIL for understanding the formation of cropmarks. Similar studies can support future research directions towards the development of regional remote sensing methods and algorithms if systematic observations are adequately dispersed in space and time.

Amid the swift progression of the global automobile industry, the aspiration for lightweight vehicle design has surfaced as a crucial approach to boost fuel efficiency and curtail environmental impact. The objective of this study revolves around achieving holistic optimization of vehicle structure via detailed scrutiny of vehicle process characteristics, amalgamated with a Back Propagation neural network (BPNN) optimized by a genetic algorithm (GA) and a topology optimization (TO) method.The process initiates with an examination of the vehicle's technical characteristics, succeeded by an optimization protocol that couples GA with BPNN. This exhaustive optimization procedure derives the best-fit values of design parameters and identifies the globally optimal lightweight design approach. Subsequently, a comprehensive structural optimization is actualized by modifying the topological distribution of the structure.A simulation experiment of the conceptual car body beam skeleton is conducted as a conclusive step, and the anti-collision capacity of the car body beam skeleton is assessed by measuring deformation intrusion. The findings reveal that in the vehicle topology optimization, a comparative analysis of pre and post-optimization results indicates an improved topological density across diverse sections. The topological density of the vehicle's frontal structure escalates from 0.75 to 0.8. Following optimization, the stiffness assessment records a marginal increase (within the range of 0.02–0.05), implying that the lightweight design does not compromise the general rigidity of the structure.The optimized body structure manifests superior crashworthiness in the crash test: the deformation intrusion diminishes by 27% in front-end collisions. In side impacts, the deformation and intrusion at critical points are reduced by 13.15% to 10% respectively. The comprehensive method proposed herein proves to be an efficient strategy to actualize the lightweight design of vehicles.

The demand for explainable and transparent models increases with the continued success of reinforcement learning. In this article, we explore the potential of generating shallow decision trees (DT) as simple and transparent surrogate models for opaque deep reinforcement learning (DRL) agents. We investigate three algorithms for generating training data for axis-parallel and oblique DTs with the help of DRL agents ("oracles") and evaluate these methods on classic control problems from OpenAI Gym. The results show that one of our newly developed algorithms, the iterative training, outperforms traditional sampling algorithms, resulting in well-performing DTs that often even surpass the oracle from which they were trained. Even higher dimensional problems can be solved with surprisingly shallow DTs. We discuss the advantages and disadvantages of different sampling methods and insights into the decision-making process made possible by the transparent nature of DTs. Our work contributes to the development of not only powerful but also explainable RL agents and highlights the potential of DTs as a simple and effective alternative to complex DRL models.

Based on previous research results, we propose a new preprocessing HSS iteration method (PHSS) for the generalized Lyapunov equation. At the same time, the corresponding inexact PHSS algorithm (IPHSS) is given from the angle of application. All the new methods presented in this paper have given the corresponding convergence proof. The numerical experiments are carried out to compare the new method with the existing methods, and the improvement effect is obvious. The feasibility and effectiveness of the proposed method are proved from two aspects of theory and calculation.

Gaze tracking of high-speed moving targets is a novel application mode for low Earth orbit microsatellites. In this mode, small satellites are equipped with high-resolution narrow-field-of-view video cameras for stable gaze-tracking imaging of high-speed moving targets. This paper proposes a high-precision attitude adaptive integral sliding mode control method with a feedforward compensation disturbance observer to enhance the capability of a microsatellite attitude control system for gaze tracking of high-speed moving targets. Specifically, first, we present the attitude control system model for microsatellites and the calculation method for the desired attitude of target tracking based on image feedback. Then, an adaptive integral sliding mode attitude control algorithm with a feedforward compensation disturbance observer, which meets the requirements of high-precision tracking control, is designed. The developed algorithm utilizes the disturbance observer to observe the friction torque of the flywheel and compensates for it through feedforward control. It also employs the adaptive integral sliding mode control algorithm to reduce the impact of uncertain disturbances, decrease the steady-state error of the system, and enhance the attitude control precision. Simulation experiments demonstrated that the designed disturbance observer can successfully observe the frictional disturbance torque of the flywheel. The attitude Euler angle control precision for high-speed moving target tracking reached 0.009°, and the angular velocity control precision reached 0.005°/s, validating the effectiveness of the proposed approach.

Count data analysis presents unique challenges due to its discrete nature, often exhibiting excessive zeros and overdispersion. To address these complexities, count models, such as Poisson regression and Negative Binomial regression, have been developed, enabling modeling and prediction of count-based phenomena. Additionally, it’s important to notice that zero inflation, a phenomenon commonly observed in count data, requires specialized techniques for robust analysis. This article provides an overview of count data and count models, explores zero inflation, introduces Likelihood Ratio Tests, and explains how the Vuong Test can be used as a model selection criteria. Furthermore, we created a Vuong Test implementation from scratch using the Python programming language. This implementation enhances the accessibility and applicability of the Vuong Test in real-world scenarios, providing a valuable contribution to the academic community, since Python didn’t have an implementation of this statistical test.

In the last years, a recent growing line of research has been developed with fruitful results by using fractional and conformable derivatives in the iterative procedures of classical methods for solving nonlinear equations. In that sense, the use of conformable derivatives has shown better behavior than fractional ones, not only in the theory, but also in the practice. In this work, we adapt the approximation of conformable derivatives in order to design the first conformable derivative-free iterative schemes to solve nonlinear equations: a Steffensen’s type method and a Secant type method; the latter with memory. Convergence analysis is made, preserving the order of classical cases, and the numerical performance is studied in order to confirm the results in the theory. It is shown that these methods can present some numerical advantages versus their classical partners, with wide sets of converging initial estimations.

Original and improved version of the Hardy Cross iterative method with related modifications are today widely used for calculation of fluid flow through conduits in loops-like distribution networks of pipes with known node fluid consumptions. Fluid in these networks is usually natural gas for distribution in the municipalities, water in waterworks or hot water in district heating system, air in the case of ventilation systems in buildings or mines, etc. Since, the resistances in these networks depend of flow, problem is not linear like in electrical circuits, and iterative procedure must be used. In both version of the Hardy Cross method, in original and in the improved one, initial results of calculation in iteration procedure is not flow, but rather the correction of flow. Unfortunately, these corrections should be added to or subtracted from a flow calculated in previous iteration according to complicate algebraic rules. After the here presented node-loop method, final results in each of the iterations is flow directly rather than flow correction. In that way complex algebraic scheme for sign of flow correction is avoided, while the final results still remain unchanged. Numbers of required iterations for the same results are comparable with the improved Hardy Cross method.

Accurate forecasting of icing thickness has a great significance for ensuring the security and stability of power grid. In order to improve the forecasting accuracy, this paper proposes an icing forecasting system based on fireworks algorithm and weighted least square support vector machine (W-LSSVM). The method of fireworks algorithm is employed to select the proper input features with the purpose of eliminating the redundant influence. In addition, the aim of W-LSSVM model is to train and test the historical data-set with the selected features. The capability of this proposed icing forecasting model and framework is tested through the simulation experiments using real-world icing data from monitoring center of key laboratory of anti-ice disaster, Hunan, South China. The results show that the proposed W-LSSVM-FA method has a higher prediction accuracy and it may be a promising alternative for icing thickness forecasting.

Background This paper draws learnings and successes based on field implementation experience spanning four years (2016–2019) of implementing CLTS by Prince of Peace Orphans and Widows Vision, a community-based organization located in Kaberamaido district in eastern Uganda. Methods The study aimed to document, disseminate and inform from an evidence-based point of view how adaptation and collaborative engagements triggers learning from mistakes to inform iterative changes from improvements and success.This is a descriptive paper that used project documents review based on field implementation experience. Existing project reports were synthesised, collated and curated for evidence. Data were drawn from project reports and records to inform narratives in writing. Implementation of the project was executed in homogenous rural communities occupied by people of the same dialect, cultural and social settings. Results We note that success in CLTS implementation can hardly be achieved by merely following prescriptions in handbooks and guidelines but rather by devising innovative community engagement and other participatory and community-driven techniques that foster adaptive management, promote ownership, and buy-in.Having learned from our failures, we used data to inform decisions and transformatively deviated from traditional CLTS implementation and introduced high impact and innovative approaches such as the use of CLTS helpdesks and Situation room, the Pamoja approach, learning labs and iterative feedback loops, innovatively tackling slippage and carefully introducing the follow-up mandona approach. These enhanced experiential learning and ultimately resulted in sustained sanitation behaviour. Conclusions The CLTS approach as outlined in the handbook needs to be flexibly adapted to address contextual needs. Reflective and learning sessions reinforced with routine feedback loops from implementers and beneficiaries yields tremendous results, propagates experiential learning, and ultimately results in a transformative deviation from undesirable to desired sanitation behaviours. These innovative approaches once carefully blended have proved to be sustainable, are adaptable and can work in an even larger scale and in a variety of contexts.

This article addresses the trajectory tracking between two non-identical systems with chaotic properties. We employ the Rossler chaotic and RCL-shunted Josephson junctions model in similar phase space to study trajectory tracking. In order to achieve the goal tracking, we afford two stages to approximate the target tracking. The first stage utilizes the active control technique to transfer the output signal from the RCLs-J system into the quasi-Rossler system. Then next, the RCLs-J system employs the proposed the iterative learning control scheme and the control signal from the drive system to trace the trajectory of Rossler system. The numerical results demonstrate the proposed method and the tracking system is asymptotically stable.

The weight coefficients of the diaphragm spring depend on experiences in the traditional optimization. However, this method not only cannot guarantee the optimal solution but it is also not universal. Therefore, a new optimization target function is proposed. The new function takes the minimum of average compress force changing of the spring and the minimum force of the separation as total objectives. Based on the optimization function, the result of the clutch diaphragm spring in a car is analyzed by the non-dominated sorting genetic algorithm (NSGA-II) and the solution set of Pareto is obtained. The results show that the pressing force of the diaphragm spring is improved by 4.09%by the new algorithmand the steering separation force is improved by 6.55%, which has better stability and steering portability. The problem of the weight coefficient in the traditional empirical design is solved. The pressing force of the optimized diaphragm spring varied slightly during the abrasion range of the friction film, and the manipulation became remarkably light.

Recently, deep learning models have been widely applied to modulation recognition, which have become a hot topic due to their excellent end-to-end learning capabilities. However, current methods are mostly based on uni-modal inputs, which suffer from incomplete information and local optimization. To complement the advantages of different modalities, we focus on the multi-modal fusion method. Therefore, we introduce an iterative dual-scale attentional fusion (iDAF) method to integrate multimodal data. Firstly, two feature maps with different receptive field sizes are constructed using local and global embedding layers. Secondly, the feature inputs are iterated into the Iterative Dual Scale Attention Module (iDCAM), where the two branches capture the details of high-level features and the global weights of each modal channel, respectively. The iDAF not only extracts the recognition characteristics of each specific domains, but also complements the strengths of different modalities to obtain a fruitful view. Our iDAF achieves a recognition accuracy of 93.5\% at 10dB and 0.6232 at full SNR. The comparative experiments and ablation studies effectively demonstrate the effectiveness and superiority of the iDAF.

In this paper, a new multi parameter iterative algorithm is proposed to address the PageRank problem based on the multi-splitting iteration method described by Gu et al . The proposed method in each iteration needs to solve two linear subsystems by splitting the coefficient matrix, therefore, we consider inner and outer iteration to find the approximate solutions of these linear subsystems. It can be shown that the iterative sequence generated by the multi parameter iterative algorithm finally converges to the PageRank vector when the parameters satisfy the certain conditions. Numerical experiments show that the proposed algorithm has better convergence and numerical stability than the existing algorithms.

The article presents a new scalable iterative method for linear programming called the “apex method”. The key feature of this method is constructing a path close to optimal on the surface of the feasible region from a certain starting point to the exact solution of linear programming problem. The optimal path refers to a path of minimum length according to the Euclidean metric. The apex method is based on the predictor-corrector framework and proceeds in two stages: quest (predictor) and target (corrector). The quest stage calculates a rough initial approximation of linear programming problem. The target stage refines the initial approximation with a given precision. The main operation used in the apex method is an operation that calculates the pseudoprojection, which is a generalization of the metric projection to a convex closed set. This operation is used both in the quest stage and in the target stage. A parallel algorithm using a Fejér mapping to compute the pseudoprojection is presented. An analytical estimation of the parallelism degree of this algorithm is obtained. Also, an algorithm implementing the target stage is given. The convergence of this algorithm is proven. An experimental study of the scalability of the apex method on a cluster computing system is described. The results of applying the apex method to solve problems from the Netlib-LP repository are presented.

The most common source of transformer failure is in the insulation, and the most prevalent warning signal for insulation weakness is partial discharge (PD). Locating positons of these partial discharges would help repair the transformer to prevent failures. This work investigates algorithms that could be deployed to locate the position of a PD event using data from ultra-high frequency (UHF) sensors inside the transformer. These algorithms typically proceed in two steps: first determine the signal arrival time and then locate the position based on time differences. This paper reviews available methods for each task and then propose new algorithms: a convolutional iterative filter with thresholding (CIFT) to determine the signal arrival time and a reference table of travel times to resolve the source location. The effectiveness of these algorithms are tested with a set of laboratory-triggered PD events and two sets of simulated PD events inside transfers in production use. Tests show the new approach provides more accurate locations than the best-known data analysis algorithms, and the difference is particularly large, 3.7X, when the signal sources are far from sensors.

Cyanobacteria are an ancient lineage of slow-growing photosynthetic bacteria and a prolific source of natural products with diverse chemical structures and potent biological activities and toxicities. The chemical identification of these compounds remains a major bottleneck. Strategies that can prioritize the most prolific strains and novel compounds are of great interest. Here, we combine chemical analysis and genomics to investigate the chemodiversity of secondary metabolites based on their pattern of distribution within some cyanobacteria. Planktothrix being a cyanobacterial genus known to form blooms worldwide and to produce a broad spectrum of toxins and other bioactive compounds, we applied this combined approach on four closely related strains of Planktothrix. The chemical diversity of the metabolites produced by the four strains was evaluated using an untargeted metabolomics strategy with high-resolution LC-MS. Metabolite profiles were correlated with the potential of metabolite production identified by genomics for the different strains. Although, the Planktothrix strains present a global similarity in term biosynthetic cluster gene for microcystin, aeruginosin and prenylagaramide for example, we found remarkable strain-specific chemo-diversity. Only few of the chemical features were common to the four studied strains. Additionally, the MS/MS data were analyzed using Global Natural Products Social Molecular Networking (GNPS) to identify molecular families of the same biosynthetic origin. In conclusion, we present an efficient integrative strategy for elucidating the chemical diversity of a given genus and link the data obtained from analytical chemistry to biosynthetic genes of cyanobacteria.

Since its emergence in March 2020, the SARS-CoV-2 global pandemic has produced more than 65 million cases and one point five million deaths worldwide. Despite the enormous efforts carried out by the scientific community, no effective treatments have been developed to date. We created a novel computational pipeline aimed to speed up the process of repurposable candidate drug identification. Compared with current drug repurposing methodologies, our strategy is centered on filtering the best candidate among all selected targets focused on the introduction of a mathematical formalism motivated by recent advances in the fields of algebraic topology and topological data analysis (TDA). This formalism allows us to compare three-dimensional protein structures. Its use in conjunction with two in silico validation strategies (molecular docking and transcriptomic analyses) allowed us to identify a set of potential drug repurposing candidates targeting three viral proteins (3CL viral protease, NSP15 endoribonuclease, and NSP12 RNA-dependent RNA polymerase), which included rutin, dexamethasone, and vemurafenib among others. To our knowledge, it is the first time that a TDA based strategy has been used to compare a massive amount of protein structures with the final objective of performing drug repurposing

P-band radar remote sensing applied during the Airborne Microwave Observatory of Subcanopy and Subsurface (AirMOSS) mission has shown great potential for estimation of root zone soil moisture. When retrieving the soil moisture profile (SMP) from P-band radar, a mathematical function describing the vertical moisture distribution is required. Because only a limited number of observations are available, the number of free parameters of the mathematical model must not exceed the number of observed data. For example, a second order polynomial that contains 3 free parameters was presumed based on in-situ SMP data. The polynomial is currently parameterized based on 3 backscatter observations provided by AirMOSS (i.e. one frequency at three polarizations of HH, VV and HV). In this paper, a more realistic, physically-based SMP model containing 3 free parameters is derived based on a solution to Richards’ equation for unsaturated flow in soils. Evaluation of the new SMP model based on both numerical simulations and measured data revealed that it exhibits greater flexibility for fitting measured and simulated SMPs than the currently applied polynomial. It is also demonstrated that the new SMP model can be reduced to a second order polynomial at the expense of fitting accuracy.

Our work uses Iterative Boltzmann Inversion (IBI) to study the coarse-grained interaction between 20 amino acids and the representative carbon nanotube CNT55L3. IBI is a multi-scale simulation method that has attracted the attention of many researchers in recent years. It can effectively modify the coarse-grained model derived from the Potential of Mean Force (PMF). IBI is based on the distribution result obtained by All-Atom molecular dynamics simulation, that is, the target distribution function, the PMF potential energy is extracted, and then the initial potential energy extracted by the PMF is used to perform simulation iterations using IBI. Our research results have gone through more than 100 iterations, and finally, the distribution obtained by coarse-grained molecular simulation (CGMD) can effectively overlap with the results of all-atom molecular dynamics simulation (AAMD). In addition, our work lays the foundation for the study of force fields for the simulation of the coarse-graining of super-large proteins and other important nanoparticles.

This research not only dedicated a less restrictive method of iteration-varying function for a learning control law to design a controller but also synchronize two nonlinear systems with free time-delay. In addition, the mathematical theory of system synchronization has proved rigorously and the theory verified through an example to demonstrate the behavior of each parameter in the theory. The design of a controller using the iterative learning control law is significant for robotic tracking. The controller in this research generates a feed-forward control input using the error dynamics among the drive-response systems. The error dynamics satisfies the Lyapunov function and the combination of output errors, which respectively represented relative estimated differences of the drive-response systems. The iterative learning control rule serves the function of a filter adding previous control error after the end of each iteration. The numerical example of a synchronous system is given a Lorenz system for driving and another with the iterative learning control law for response under different initial condition. The results verify and demonstrate the proposed mathematical theory. The simulation exhibits consistency in the behavior of each parameter to match mathematical theory.

The Marchenko method is a data-driven way which makes it possible to calculate Green's functions from virtual points in the subsurface by the reflection data at the surface, only requiring a macro velocity model. This method requires collocated sources and receivers. However, in practice, subsampling of sources or receivers will cause gaps and distortions in the obtained focusing functions and Green's functions. To solve this problem, this paper proposes to integrate sparse inversion into the iterative Marchenko scheme. Specifically, we add sparsity constraints to the Marchenko equations and apply sparse inversion during the iterative process. Our work not only reduces the strict requirements on acquisition geometries, but also avoids the complexity and instability of direct inversion for Marchenko equations. This new method is applied to a two-dimensional numerical example with irregular sampled data. The result shows that it can effectively fill gaps of the obtained focusing functions and Green's functions in the Marchenko method.

This article introduces a novel nature-inspired metaheuristic algorithm called Frilled Lizard Optimization (FLO), which emulates the hunting behavior of frilled lizards in their natural habitat. FLO draws in-spiration from the sit-and-wait strategy observed in frilled lizards during hunting. The underlying theory of FLO is presented and mathematically formulated in two phases: (i) an exploration phase, simulating the frilled lizard's attack towards prey, and (ii) an exploitation phase, simulating the lizard's retreat to the top of the tree after feeding. To assess FLO's efficacy in solving optimization problems, the algorithm's performance is evaluated across fifty-two standard benchmark functions, encompassing unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and the CEC 2017 test suite. Comparative analyses with twelve existing metaheuristic algorithms are conducted. The simulation results reveal that FLO, distinguished by its adeptness in exploration, exploitation, and balancing them during search process, outperforms competing algorithms. Additionally, FLO is implemented on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems, demonstrating its effectiveness in addressing real-world optimization applications.

In this article, an iterative method of two step is proposed for finding all roots simultaneously of polynomial equations. The order of convergence of the proposed algorithm is 2m, by using any iterative scheme of order m. Numerical tests are performed to confirm the theoretical results and to compare the proposed scheme with existing methods for finding all roots simultaneously.

The 3x+1 problem is a problem of continuous iteration for integers. According to the basic theorem of arithmetic and the way of iteration, we derive a general formula for continuous iteration for odd integers. Through this formula, we can construct a loop iteration equation and obtain the result of the equation: the equation has only one positive integer solution. In addition, this general formula can be converted into a linear indeterminate equation. The process of solving this equation shows that the relationship between the iteration result and the odd number being iterated is linear. Extending this result to all positive even numbers, we get the answer to the 3x + 1 question.

Impulsive noise is the main limiting factor for transmission over channels affected by electromagnetic interference. We study the estimation of (correlated) Gaussian signals in an impulsive noise scenarios. In this work, we analyze some of the existing as well as some novel estimation algorithms. Their performance is compared, for the first time, for different channel conditions, including the Markov-Middleton scenario, where the impulsive noise switches between different noise states. Following a modern approach in digital communications, the receiver design is based on a factor graph model and implements a message passing algorithm. The correlation among signal samples as well as among noise states brings about a loopy factor graph, where an iterative message passing scheme should be employed. As it is well known, approximate variational inference techniques are necessary in these cases. We propose and analyze different algorithms and provide a complete performance comparison among them, showing that both Expectation Propagation, Transparent Propagation, and the Parallel Iterative Schedule approaches reach a performance close to the optimal, at different channel conditions.

We propose an iterative scheme for feature-based positioning using a new weighted dissimilarity measure with the goal of reducing the impact of large errors among the measured or modeled features. The weights are computed from the location-dependent standard deviations of the features and stored as part of the reference fingerprint map (RFM). Spatial filtering and kernel smoothing of the kinematically collected raw data allow efficiently estimating the standard deviations during RFM generation. In the positioning stage, the weights control the contribution of each feature to the dissimilarity measure, which in turn quantifies the difference between the set of online measured features and the fingerprints stored in the RFM. Features with little variability contribute more to the estimated position than features with high variability. Iterations are necessary because the variability depends on the location, and the location is initially unknown when estimating the position. Using real WiFi signal strength data from extended test measurements with ground truth in an office building, we show that the standard deviations of these features vary considerably within the region of interest and are neither simple functions of the signal strength nor of the distances from the corresponding access points. This is the motivation to include the empirical standard deviations in the RFM. We then analyze the deviations of the estimated positions with and without the location-dependent weighting. In the present example the maximum radial positioning error from ground truth are reduced by 40% comparing to kNN without the weighted dissimilarity measure.

Powered ankle prostheses have been proven to improve the walking economy of people with transtibial amputation. All commercial powered ankle prostheses that are currently available can only perform one-degree-of-freedom motion in a limited range. However, studies have shown that the frontal plane motion during ambulation is associated with balancing. In addition, as more advanced neural interfaces have become available for people with amputation, it is possible to fully recover ankle function by combining neural signals and a robotic ankle. Accordingly, there is a need for a powered ankle prosthesis that can have active control on not only plantarflexion and dorsiflexion but also eversion and inversion. We designed, built, and evaluated a two-degree-of-freedom (2-DoF) powered ankle-foot prosthesis that is untethered and can support level-ground walking. Benchtop tests were conducted to characterize the dynamics of the system. Walking trials were performed with a 77 kg subject that has unilateral transtibial amputation to evaluate system performance under realistic conditions. Benchtop tests demonstrated a step response rise time of less than 50 milliseconds for a torque of 40 N·m on each actuator. The closed-loop torque bandwidth of the actuator is 9.74 Hz. Walking trials demonstrated torque tracking errors (root mean square) of less than 7 N·m. These results suggested that the device can perform adequate torque control and support level-ground walking. This prosthesis can serve as a platform for studying biomechanics related to balance and has the possibility of further recovering the biological function of the ankle-subtalar-foot complex beyond the existing powered ankles.

In this paper, we report orthogonal fuzzy versions of some celebrated iterative mappings. We provide various concrete conditions on the real valued functions J,S:(0,1]→(−∞,∞) for the existence of fixed-points of (J,S)-fuzzy iterative mappings. We obtain many fixed point theorems in orthogonal fuzzy metric spaces. We apply (J,S)-fuzzy version of Banach fixed point theorem to show the existence and uniqueness of the solution. We support these results with several non-trivial examples and applications to Volterra-type integral equations and fractional differential equations.

This work is concerned with the existence and uniqueness of boundary value problems defined on semi-infinite intervals. These kinds of problems seldom admit exactly known solutions and, therefore, the theoretical information on their well-posedness is essential before attempting to derive an approximate solution by analytical or numerical means. Our utmost contribution in this context is the definition of a numerical test for investigating the existence and uniqueness of solutions of boundary problems defined on semi-infinite intervals. The main result is given by a theorem relating the existence and uniqueness question to the number of real zeros of a function implicitly defined within the formulation of the iterative transformation method. As a consequence, we can investigate the existence and uniqueness of solutions by studying the behaviour of that function. Within such a context the numerical test is illustrated by two examples where we find meaningful numerical results.

In this paper we evaluate the effects of hard and soft constraints on the Iterative Data Snooping (IDS), an iterative outlier elimination procedure. Here, the measurements of a levelling geodetic network were classified according to the local redundancy and maximum absolute correlation between the outlier test statistics, referred to as clusters. We highlight that the larger the relaxation of the constraints, the higher the sensitivity indicators MDB (Minimal Detectable Bias) and MIB (Minimal Identifiable Bias) for both the clustering of measurements and the clustering of constraints. There are circumstances that increase the family-wise error rate (FWE) of the test statistics, increase the performance of the IDS. Under a scenario of soft constraints, one should set out at least three soft constraints in order to identify an outlier in the constraints. In general, hard constraints should be used in the stage of pre-processing data for the purpose of identifying and removing possible outlying measurements. In that process, one should opt to set out the redundant hard constraints. After identifying and removing possible outliers, the soft constraints should be employed to propagate their uncertainties to the model parameters during the process of least-squares estimation.

We consider a coded compressed sensing protocol for unsourced massive random access (URA) that concatenates a shared Patterned Reed-Muller (PRM) inner codebook to an outer error-correction code. In this paper, an iterative list PRM projection algorithm is proposed to supplant the signal detector associated with the inner PRM sequences. In particular, we first propose an enhanced paths-saving algorithm called list PRM projection detection for the single-user scenario that keeps multiple candidates for the first few layers to remedy the risk of spreading errors. On this basis, we further propose an iterative list PRM projection algorithm for the multi-user scenario. The vectors for PRM codes and channel coefficients are jointly detected in an iterative manner, which offers significant improvements regarding the convergence rate for signal recovery. Furthermore, the performances of the proposed algorithms are analyzed mathematically, and we verified that the theoretical simulations are consistent with the numerical simulations. Finally, we concatenate the inner PRM codes that employ the iterative list detection to two practical error-correction outer codes. According to the simulation results, we conclude that the packetized URA with the proposed iterative list projection detection works better than benchmarks in terms of the number of active users it can support in each slot and the amount of energy needed per bit to meet an expected error probability.

In this paper, an iterative procedure to find the solution of a nonlinear structural model is introduced. The model presents different multiplicities where parameters are randomly selected within a solvability region. To achieve this aim, a class of multipoint fixed-point iterative schemes for single roots is modified to find multiple roots, reaching the fourth order of convergence. Complex discrete dynamics techniques are employed to select the members with the most stable performance. The structural problem, as well as some academic problems involving multiple roots, are solved numerically to verify the theoretical analysis, robustness and applicability of the proposed scheme.

Empirical Colebrook equation from 1939 is still accepted as an informal standard to calculate friction factor during the turbulent flow (4000 < Re < 10⁸) through pipes from smooth with almost negligible relative roughness (ε/D→0) to the very rough (up to ε/D = 0.05) inner surface. The Colebrook equation contains flow friction factor λ in implicit logarithmic form where it is, aside of itself; λ, a function of the Reynolds number Re and the relative roughness of inner pipe surface ε/D; λ = f (λ, Re, ε/D). To evaluate the error introduced by many available explicit approximations to the Colebrook equation, λ ≈ f(Re, ε/D), it is necessary to determinate value of the friction factor λ from the Colebrook equation as accurate as possible. The most accurate way to achieve that is using some kind of iterative methods. Usually classical approach also known as simple fixed point method requires up to 8 iterations to achieve the high level of accuracy, but does not require derivatives of the Colebrook function as here presented accelerated Householder’s approach (3^rd order, 2^nd order: Halley’s and Schröder’s method and 1^st order: Newton-Raphson) which needs only 3 to 7 iteration and three-point iterative methods which needs only 1 to 4 iteration to achieve the same high level of accuracy. Strategies how to find derivatives of the Colebrook function in symbolic form, how to avoid use of the derivatives (Secant method) and how to choose optimal starting point for the iterative procedure are shown. Householder’s approach to the Colebrook’s equations expressed through the Lambert W-function is also analyzed. One approximation to the Colebrook equation based on the analysis from the paper with the error of no more than 0.0617% is shown.

In this paper, we introduce a new iteration scheme, named as the S**-iteration scheme, for approximation of fixed point of the nonexpansive mappings. This scheme is faster than Picard, Mann, Ishikawa, Noor, Agarwal, Abbas, Thakur, and Ullah iteration schemes. We show the stability of our instigated scheme and give a numerical example to vindicate our claim. We also put forward some weak and strong convergence theorems for Suzuki's generalized nonexpansive mappings in the setting of uniformly convex Banach spaces. Our results comprehend, improve, and consolidate many results in the existing literature.

Nowadays genetic algorithm (GA) is greatly used in engineering pedagogy as an adaptive technique to learn and solve complex problems and issues. It is a meta-heuristic approach that is used to solve hybrid computation challenges. GA utilizes selection, crossover, and mutation operators to effectively manage the searching system strategy. This algorithm is derived from natural selection and genetics concepts. GA is an intelligent use of random search supported with historical data to contribute the search in an area of the improved outcome within a coverage framework. Such algorithms are widely used for maintaining high-quality reactions to optimize issues and problems investigation. These techniques are recognized to be somewhat of a statistical investigation process to search for a suitable solution or prevent an accurate strategy for challenges in optimization or searches. These techniques have been produced from natural selection or genetics principles. For random testing, historical information is provided with intelligent enslavement to continue moving the search out from the area of improved features for processing of the outcomes. It is a category of heuristics of evolutionary history using behavioral science-influenced methods like an annuity, gene, preference, or combination (sometimes refers to as hybridization). This method seemed to be a valuable tool to find solutions for problems optimization. In this paper, the author has explored the GAs, its role in engineering pedagogies, and the emerging areas where it is using, and its implementation.

Background: The Balaruc-les-Bains’ thermal mud was found to be colonized predominantly by microorganisms, with cyanobacteria constituting the primary organism in the microbial biofilm observed on the mud surface. The success of cyanobacteria in colonizing this specific ecological niche can be explained in part by their taxa-specific adaptation capacities, and also the diversity of bioactive natural products that they synthesize. This array of components has physiological and ecological properties that may be exploited for various applications.

The aim of this paper is to deep into the dynamic study of the well known Chebyshev-Halley family of iterative methods for solving nonlinear equations. Our objetives are twofold: one the one hand, we are interested in characterize the existence of extraneous attracting fixed points when the methods in the family are applied to polynomial equations. On the other hand, we are also interested in study the free critical points of the methods in the family, as a previous step to determine the existence of attracting cycles. In both cases, we want to identify situations where the methods in the family have a bad behavior from the root-finding point of view. Finally, and joining these two studies, we look for polynomials for which there are methods in the family where this two situations happen simultaneously. That is, the rational map obtained by applying a method in the Chebyshev-Halley family to a polynomial has both super-attracting extraneous fixed point and super-attracting cycles different to the roots of the polynomial.

We construct a family of two-step optimal fourth order iterative methods for finding single root of non-linear equations. We generalize these methods to simultaneous iterative methods for determining all the distinct as well as multiple roots of single variable non-linear equations. Convergence analysis is present for both cases to show that the order of convergence is four in case of single root finding method and is twelve for simultaneous determination of all roots of non-linear equation. The computational cost, Basin of attraction, efficiency, log of residual and numerical test examples shows, the newly constructed methods are more efficient as compared to the existing methods in literature.

The Colebrook equation ζ is implicitly given in respect to the unknown flow friction factor λ ; λ=ζ(Re,ε*,λ) which cannot be expressed explicitly in exact way without simplifications and use of approximate calculus. Common approach to solve it is through the Newton-Raphson iterative procedure or through the fixed-point iterative procedure. Both requires in some case even eight iterations. On the other hand numerous more powerful iterative methods such as three-or two-point methods, etc. are available. The purpose is to choose optimal iterative method in order to solve the implicit Colebrook equation for flow friction accurately using the least possible number of iterations. The methods are thoroughly tested and those which require the least possible number of iterations to reach the accurate solution are identified. The most powerful three-point methods require in worst case only two iterations to reach final solution. The recommended representatives are Sharma-Guha-Gupta, Sharma-Sharma, Sharma-Arora, Džunić-Petković-Petković; Bi-Ren-Wu, Chun-Neta based on Kung-Traub, Neta, and Jain method based on Steffensen scheme. The recommended iterative methods can reach the final accurate solution with the least possible number of iterations. The approach is hybrid between iterative procedure and one-step explicit approximations and can be used in engineering design for initial rough, but also for final fine calculations.

Cyanobacteria constitute pioneer colonizer of specific environments whom settlement in new biotopes precedes the establishment of composite microbial consortia. Some heterotrophic bacteria constitute cyanobacterial partners that are considered as their cyanosphere, being potentially involved in mutualistic relationships through exchange and recycling of key nutrients, and sharing of common goods. Several non-axenic cyanobacterial strains have been recently isolated along with their associated cyanosphere from the thermal mud of Balaruc-les-Bains (France) and the biofilms of the retention basin where they develop. The community structure and relationships among members of the isolated cyanobacterial strains were characterized using a metagenomic approach combined with taxonomic and microscopic description of the microbial consortia. Results provide insights into the potential role and metabolic capabilities of microorganisms of thermal mud-associated cyanobacterial biofilms. Thus, the physical proximity, host-specificity and complimentary functions advocate for their complementarity between cyanobacteria and their associated microbiota. Besides these findings, our results also highlight the great influence of the reference protein database chosen when performing functional annotation of the metagenomes from organisms of the cyanosphere and the difficulty of selecting one unique database that appropriately cover both autotroph and heterotroph metabolic specificities.

(1) Background Diabetic Retinopathy (DR) is the primary cause of poor vision in young adults. Screening for DR is important but many patients do not attend; (2) Methods: We validated an algorithm for predicting DR and its progression by conducting a retrospective study of 11 children in a population of 120,389 T2DM (3) Results: By applying the algorithm to the population showed an AUC of 0.93 (95% CI, 0.92–0.94) for any-DR and 0.90 (95% CI, 0.89–0.91) for referable-DR(4) Conclusions: The algorithm is useful for predicting patients who could develop referable forms of DR and also for any-DR. This would allow a personalized screening plan to be drawn up for each patient.

As time progresses and technology improves, biological data sets are continuously increasing in size. New methods and new implementations of existing methods are needed to keep pace with this increase. In this paper, we present a high performance computing(HPC)-capable implementation of Iterative Random Forest (iRF). This new implementation enables the explainable-AI eQTL analysis of SNP sets with over a million SNPs. Using this implementation we also present a new method, iRF Leave One Out Prediction (iRF-LOOP), for the creation of Predictive Expression Networks on the order of 40,000 genes or more. We compare the new implementation of iRF with the previous R version and analyze its time to completion on two of the world's fastest supercomputers Summit and Titan. We also show iRF-LOOP's ability to capture biologically significant results when creating Predictive Expression Networks. This new implementation of iRF will enable the analysis of biological data sets at scales that were previously not possible.

The aim of this article is to extend the local as well as the semi-local convergence analysis of multi-point iterative methods using center Lipschitz conditions in combination with our idea, of the restricted convergence region. It turns out that this way a finer convergence analysis for these methods is obtained than in earlier works and without additional hypotheses. Numerical examples favoring our technique over earlier ones completes this article.

The eighty years old empirical Colebrook function widely used as an informal standard for hydraulic resistance relates implicitly the unknown flow friction factor , with the known Reynolds number and the known relative roughness of a pipe inner surface ; . It is based on logarithmic law in the form that captures the unknown flow friction factor in a way from which it cannot be extracted analytically. As an alternative to the explicit approximations or to the iterative procedures that require at least a few evaluations of computationally expensive logarithmic function or non-integer powers, this paper offers an accurate and computationally cheap iterative algorithm based on Padé polynomials with only one -call in total for the whole procedure (expensive -calls are substituted with Padé polynomials in each iteration with the exception of the first). The proposed modification is computationally less demanding compared with the standard approaches of engineering practice, but does not influence the accuracy or the number of iterations required to reach the final balanced solution.

In reservoir operations rule curves, it is necessary to apply rule curves to guide long-term reservoir management. This paper proposes an approach to optimize the reservoir operation rule curves (RORC) using intelligent optimization techniques from the Firefly Algorithm (FA) and a unique combination method utilizing the Artificial Bees Colony and Cultural Algorithm (ABC-CA). The aim is to establish a connection with the simulation model to determine the optimal RORC for flood control. The proposed model was used to determine the Nam-Oon Reservoir (NOR) is optimal flood control RORC in Northeastern Thailand. The minimum frequency and a minimum average of ex-cess water were given as an objective function for assessing the efficiency of the search process. The evaluation of the effectiveness of flood control RORC involved expressing water scarcity and excess water situations in terms of frequency, magnitude, and duration using historical inflow data syn-thesized from 1000 events. The results demonstrate that when using the obtained RORC to simulate the NOR system for reducing flooding in long-term operations, situations of excess water were smaller than those using the current RORC. The results indicated that situations of excess water using the obtained RORC from the proposed model were smaller than those using the current RORC situations. In decreasing flood situations, the newly acquired RORC from the suggested FA and ABC-CA models performed better than the current RORC.

In this paper, we present a new parametric class of optimal fourth-order iterative methods to estimate the solutions of nonlinear equations. After the convergence analysis, we study the stability of this class by using the tools of complex discrete dynamics. This allows us to select those elements of the class with lower dependence on initial estimations. We verify by means of numerical tests that the stable members on quadratic polynomials perform better than the unstable ones, when applied to other non-polynomial functions. We also compare the performance of the best elements of the family with known methods, such as the schemes by Newton or Chun, among others, showing robust and stable behaviour.

Maximum likelihood estimation (MLE) is a popular method for parameter estimation in both applied probability and statistics but MLE cannot solve the problem of incomplete data or hidden data because it is impossible to maximize likelihood function from hidden data. Expectation maximum (EM) algorithm is a powerful mathematical tool for solving this problem if there is a relationship between hidden data and observed data. Such hinting relationship is specified by a mapping from hidden data to observed data or by a joint probability between hidden data and observed data. In other words, the relationship helps us know hidden data by surveying observed data. The essential ideology of EM is to maximize the expectation of likelihood function over observed data based on the hinting relationship instead of maximizing directly the likelihood function of hidden data. Pioneers in EM algorithm proved its convergence. As a result, EM algorithm produces parameter estimators as well as MLE does. This tutorial aims to provide explanations of EM algorithm in order to help researchers comprehend it. Moreover some improvements of EM algorithm are also proposed in the tutorial such as combination of EM and third-order convergence Newton-Raphson process, combination of EM and gradient descent method, and combination of EM and particle swarm optimization (PSO) algorithm.

MAACS is a software architecture which layers multiple standard cipher algorithms together to increase the overall strength of the encrypted data stream, without modifying the standard algorithms, which have been heavily vetted from a cryptanalysis perspective and are already widely deployed. This layering technique makes the combination of algorithms significantly more resistant to traditional cryptanalysis attacks, while also addressing increased concerns over future quantum computing attacks against these algorithms. For example, concerns over published attacks against 256-bit AES and potential future attacks emanating from Grover’s algorithm and other unknowns in the quantum computing era are explored. Several approaches for evolving AES are considered. MAACS uses a concept termed "aperiodic modulation", whereby of a set of cryptographic algorithms are modified by an- other, independent software algorithm in an unpredictable, pseudo-random manner. In the MAACS reference architecture, a 256-bit ChaCha20 cryptographically secure pseudorandom number generator (CSPRNG) drives an aperiodic modulator that orchestrates encryption/decryption processes multiplexed across eight parallel 128-bit AES instances, yielding a cryptosystem with a composite strength of 1,376 bits or more in larger configurations.

In Brazil, sucrose-rich broths (cane juice and/or molasses) are used to produce billions of liters of both fuel ethanol and cachaça per year using selected Saccharomyces cerevisiae industrial strains. Aiming to improve this disaccharide fermentation, we have first determined the genetic characteristics, by array comparative genomic hybridization, of a group of 8 fuel ethanol and 5 cachaça industrial yeasts that tend to dominate the fermentors during the production season. The widespread presence of SUC genes encoding invertase at multiple telomeres has been shown to be a common feature of both baker’s and distillers’ yeast strains and is postulated to be an adaptation to sucrose-rich broths. Our results show that only two strains (one fuel ethanol and one cachaça yeast) have amplification of the SUC genes, with high invertase activity. The other industrial yeast strains had a single SUC locus (SUC2) in their genome, with different patterns of invertase activity. These results indicate that invertase activity probably does not limit sucrose fermentation during fuel ethanol and cachaça production by these industrial strains. Using this knowledge, we changed the mode of sucrose metabolism of an industrial strain by avoiding extracellular invertase activity, overexpressing the intracellular invertase, and increasing its transport through the AGT1 permease. This approach allowed higher ethanol production from sucrose by the modified industrial yeast when compared to its parental strain.

The chicken poultry business is becoming a crucial sector for our nation's sustainable food supply. To increase the health of chickens in coops and maybe increase the output of chicken meat and eggs, several innovations and inventions have been developed. Therefore, the creation of an automated chicken feeding device might be highly beneficial for the expansion of the poultry sector. This equipment may take the role of a worker in the chicken feeding process, solving the industry's labor shortage and introducing a semi-automatic procedure. The main processor of the automated chicken feeding system is a Raspberry Pi 3 Model B+. The machine consists of five main components: a Raspberry Pi with an amplifier that makes noise to draw the attention of free-range chickens, a Raspberry Pi with a pi camera that counts and detects the chickens, a Raspberry Pi with a servomotor that moves the food from storage to a container, a Raspberry Pi with a load cell that controls the number of feeds to avoid waste on foods, and a Raspberry Pi with a temperature sensor that monitors the food's freshness. This enhances the coop's atmosphere while lowering labor costs, conserving food, and ensuring that the chickens are fed on time. It also regulates the temperature sensor to ensure that the chicken food is fresh and prevents food from becoming polluted by insects and chicken excrement.

We present a new method of estimating fitness of countries and complexity of products by exploiting a non-linear non-homogeneous map applied to the publicly available information on the goods exported by a country. The non homogeneous terms guarantee both convergence and stability. After a suitable rescaling of the relevant quantities, the non homogeneous terms are eventually set to zero so that this new method is parameter free. This new map reproduces the findings of the method proposed by Tacchella et al. [1], and allows for an approximate analytic solution in case of actual binarized matrices based on the Revealed Comparative Advantage (RCA) indicator. This solution is connected with a new quantity describing the neighborhood of nodes in bipartite graphs, representing in this work the relations between countries and exported products. Moreover, we define the new indicator of country net-efficiency quantifying how a country efficiently invests in capabilities able to generate innovative complex high quality products. Eventually, we demonstrate analytically the local convergence of the algorithm.

Introduction: Radiation therapy (RT) has recently demonstrated promise at stimulating an enhanced immune response. The recent success of immunotherapies, such as checkpoint inhibitors, CART cells, and other immune modulators, affords new opportunities for combination with radiation. Methods: In this study, VISTA, an immune checkpoint, was blocked either by genetic knockout (KO) or an inhibitory antibody and combined with RT in two syngeneic murine cancer models. Selected mRNA, immune cell infiltration, and tumor growth delay were used to assess the biological effects. Results: When combined with a single 15 Gy radiation doses, both VISTA blockade techniques significantly enhanced anti-tumor immune signaling pathways at the mRNA, cellular infiltration level and tumor growth delay. The data suggests that the mechanism behind the enhanced tumor control is primarily a result of increased apoptosis and immune mediated cytotoxicity. Conclusion: VISTA blockade significantly enhances the anti-tumor effect of a single dose of 15 Gy radiation through increased expression and stimulation of cell mediated apoptosis pathways. These results suggest that VISTA is a biologically relevant immune promoter that has the potential to enhance the efficacy of a large single radiation dose in a synergic manner.

This paper describes an $\sim {\cal O}(n)$ pre-compute technique to speed up the Karatsuba algorithm for multiplying two numbers.

The algorithmic complexity vulnerability (ACV) that may lead to denial of service attacks greatly disrupts the security and availability of applications, and due to the widespread use of third-party libraries, its impact may be amplified through the software supply chain. The existing work in the field is dedicated to abstract loop or iterative patterns and fuzzing the entire application to discover algorithm complexity vulnerabilities, but they still face efficiency and effectiveness issues. Our research focuses on: (1) Proposing a representation and extraction method for code features related to algorithmic complexity vulnerabilities, helping analysts quickly understand program logic; (2) Providing a new ACV detecting model, focusing on the spatial complexity anomalies caused by deep recursion structures, and proposing a new filtering method; (3) Aiming at the difficulty of efficiently generating complex-data-type-related payloads using existing symbol execution techniques, a call-chain-guided payload construction method is proposed. We tested third-party components in the open-source Java Maven Repository, identified many unexposed vulnerabilities and 8 of them received CVE (Common Vulnerabilities &amp; Exposures) identifiers, and demonstrated that our method can discover more algorithmic complexity vulnerabilities compared to existing tools with better performance.

This paper describes a polynomial time algorithm for solving graph isomorphism and automorphism. We introduce a new tree data structure called Walk Length Tree. We show that such tree can be both constructed and compared with another in polynomial time. We prove that graph isomorphism and automorphism can be solved in polynomial time using Walk Length Trees.

It is unavoidable that the characteristics of the robot system alter inexactly or cannot be correctly determined during movement and are impacted by external disturbances. There are many adaptive control methods, such as sliding control or neural control, to improve the quality of trajectory tracking for robot motion systems. Still, those methods require a large amount of computation related to solving the problem of constrained nonlinear optimization problem. The article presents some techniques for determining an intelligent controller's online learning function parameters, including two circuits: the inner circuit is a state feedback linearized controller, and the outer course is an Interactive learning controller and does not use the robot's mathematical mode with function parameters online optimal learning and intelligent online learning closely following the joint model to stabilize the robot system. Finally, the 2-DOF planar robot simulation is performed on Matlab software R2022b. The findings indicate that outstanding tracking performance is achievable.

In this paper, we present a three-step sixth-order iterative schemes to estimate the solutions of a nonlinear systems of equations, for predicting the shear strength of a reinforced concrete beam. This procedure is designed by means of a weight function technique. The values for the parameters of this system were randomly selected inside the prescribed ranges by technical standards for structural concrete; moreover, some of this parameters were fixed taking into consideration the solvability region of the adopted steel constitutive model. The efficiency of the new class is compared with other current schemes, with very good results.

Nowadays, the wasting of resources is one of the fundamental challenges of the industrial sector. The rectangle packing problem can be very effective in this context. Practical applications of this issue in the timing and designing of the industries and businesses are very remarkable. The purpose of this issue is to arrange a set of rectangles with specific dimensions in a rectangular page with a specific width and unlimited height without overlapping. The fundamental challenge in this issue is that this is an NP-complete issue. Therefore, it is difficult to achieve the best arrangement, which has the maximum rate of resource utilization and also has a linear running time. Many algorithms have been presented to estimate a practical solution for this issue. In the past decades, the best fit method has been one of the most useful methods for this purpose. This study presents a combinatorial algorithm based on two algorithms, including the lowest front-line strategy and the best-fit algorithm. The running results indicate that the suggested algorithm performs well, despite its simplicity. The time complexity of the suggested algorithm is O(nm), in which n is the number of input rectangles and m is the number of the created front lines.

In this study, Acısu Basin, which is upper side of one of the most important basins (Gediz) in Türkiye, was modelled using three types of hydrological models and three different calibration algorithms. Lumped (GR4J), semi-distributed (SWAT+), and fully distributed (mHM) hydrological models were built and integrated with Parameter Estimation Tool (PEST) which is a model independent calibration tool including various algorithms. Levenberg Marquardt (L-M), Shuffled Complex Evolution (SCE), and Covariance Matrix Adoption Evolution Strategy (CMA-ES) were selected as calibration algorithms. Calibration period was 1991-2000, and validation results were obtained for 2002-2005. The effect of model structure and calibration algorithm selection on discharge simulation was evaluated via comparison of 9 different model-algorithm combinations. Results have shown that mHM and CMA-ES combination showed the best discharge simulation performance according to NSE values (calibration: 0.67, validation: 0.60). Although statistically the model results were classified as acceptable, the pattern comparison of discharge value shows that all of the models miss the peak values in significant amounts. This problem may be related to the interventions made in 2000-2001 years interval and possible to overcome by changing the calibration and validation periods, increasing the number of iterations or using the naturalized gauge data.

Graph visualization has evolved significantly over time, offering various methods to effectively represent complex data structures. This study introduces a novel force-directed algorithm for 3D data visualization, specifically tailored for commonly used datasets in linked data visualization. Leveraging the power of graph theory and methods, the algorithm aims to address the challenge of creating visually appealing and easily interpretable visualizations, which often necessitate advanced user interaction. By utilizing 3D space and the Unity Engine, the research successfully visualizes data and develops interactive visualizations, overcoming limitations of basic force-directed implementations. The main contribution of presented research is in the force-directed algorithm with springs and controlled placement as a visualization technique that combines the use of springs and attractive forces to stabilize a graph in a 3D environment. The combination of these two techniques also helps prevent the formation of a single large cluster within the graph, enhancing the overall visualization quality.

The widespread adoption of electromobility constitutes one of the measures designed to reduce air pollution caused by traditional fossil fuels. However, several factors are currently impending this process, ranging from insufficient charging infrastructure, battery capacity, long queueing and charging time, to psychological factors. On top of range anxiety, the frustration of the EV drivers is further fueled by the lack the uncertainty of finding an available charging point on their route. To address this issue, we propose a solution that comes to bypass the limitations of the Reserve now function of the OCPP standard, enabling drivers to make charging reservations for the upcoming days, especially when planning a longer trip. We created an algorithm that generates reservation intervals based on the charging station's reservation and transaction history. Subsequently, we ran a series of test cases that yielded promising results, with no overlapping reservations.

Hyper-spectral images contain a wide range of bands or wavelength due to which they are rich in information. These images are taken by specialized sensors and then investigated through various supervised or unsupervised learning algorithms. Data that is acquired by hyperspectral image contain plenty of information hence it can be used in applications where materials can be analyzed keenly, even the smallest difference can be detected on the basis of spectral signature i.e. remote sensing applications. In order to retrieve information about the concerned area, the image has to be grouped in different segments and can be analyzed conveniently. In this way, only concerned portions of the image can be studied that have relevant information and the rest that do not have any information can be discarded. Image segmentation can be done to assort all pixels in groups. Many methods can be used for this purpose but in this paper, we discussed k means clustering to assort data in AVIRIS cuprite, AVIRIS Muffet and Rosis Pavia in order to calculate the number of regions in each image and retrieved information of 1st, 10th and100th band. Clustering has been done easily and efficiently as k means algorithm is the easiest approach to retrieve information.

Information security plays a major role in the dynamics of today’s interconnected world. Despite the successful implementation and effectiveness of modern cryptographic techniques, their inherent limitations can be exploited by quantum computers. In this article we discuss Grover’s quantum searching algorithm and its impact on the security of modern symmetric ciphers. More specifically, we present its formal description and give an implementation of the algorithm using IBM’s Qiskit framework, which allows us to simulate and run the program on a real device. The developed program is modular and scalable, managing to properly run on any input state. We compare the performance of the algorithm running on the local simulator against its execution on a quantum processor from IBM’s lineup, noting the discrepancies between the results due to physical characteristics of the chip.