This paper numerically investigates a 3D mesh independency study of a straight blade horizontal axis tidal turbine modelled using Computational Fluid Dynamics (CFD). The solution was produced by employing two turbulence models, the standard k-ε model and Shear Stress Transport (SST) in ANSYS CFX. Three parameters were investigated: mesh resolution, turbulence model, and power coefficient in the initial CFD, analysis. It was found that the mesh resolution and the turbulence model affect the power coefficient results. The power coefficients obtained from the standard k-ε model are 15% to 20% lower than the accuracy of the SST model. It can also be demonstrated that the torque coefficient increases with the increasing Tip Speed Ratio (TSR), but drops drastically after TSR = 5 and k-ε model failing to capture the non-linearity in the torque coefficient with the increasing TSR.

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.

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.

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.

The Doppler band compensated by the keystone transform (KT) is limited. Therefore, it needs to be used in conjunction with the Doppler ambiguity compensation function to correct the range migration (RM) caused by maneuvering targets with Doppler ambiguity. However, the KT implemented by sinc interpolation suffers from significant performance loss at boundaries of compensation Doppler bands. Additionally, in a multi-target scenario, KT implementation methods occupy high complexity when the Doppler range of targets spans over two compensation Doppler bands. To address aforementioned issues, this study presents a variable Doppler starting point keystone transform (VDSPKT) method, where a new form of ambiguity compensation function is constructed, turning the Doppler starting point of the compensation band in KT variable. Firstly, the position of the compensation Doppler band is changed from fixed to adjustable as needed, enhancing the flexibility of KT. Crucially, the connection points of the compensation Doppler bands in sinc interpolation are reset, avoiding the performance loss at their boundaries. Also, the compensation band is adjusted to cover the narrow Doppler frequency range caused by targets, significantly improving the computational efficiency. Finally, the simulation results demonstrate that the proposed approach effectively addresses the performance degradation and high computational complexity of KT in the aforementioned scenarios, resulting in a computational load reduced by approximately 50% compared to traditional methods.

Panel data of our interest consist of a moderate number of panels, while the panels contain a small number of observations. An estimator of common breaks in panel means without a boundary issue for this kind of scenario is proposed. In particular, the novel estimator is able to detect a common break point even when the change happens immediately after the first time point or just before the last observation period. Another advantage of the elaborated change point estimator is that it results in the last observation in situations with no structural breaks. The consistency of the change point estimator in panel data is established. The results are illustrated through a simulation study. As a by-product of the developed estimation technique, a theoretical utilization for correlation structure estimation, hypothesis testing, and bootstrapping in panel data is demonstrated. A practical application to non-life insurance is presented as well.

We generalize the point information gain (PIG) and derived quantities, i.e., point information gain entropy (PIE) and point information gain entropy density (PIED), for the case of the Rényi entropy and simulate the behavior of PIG for typical distributions. We also use these methods for the analysis of multidimensional datasets. We demonstrate the main properties of PIE/PIED spectra for the real data on the example of several images, and discuss further possible utilizations in other fields of data processing.

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.

The task of weakly supervised point cloud semantic segmentation has received widespread attention and also has been widely used in autonomous driving, robotics, and modern industries. Due to the high dimensionality and large volume of point cloud data, many technical difficulties appeal to weakly supervised semantic processing, especially segmentation. However, weakly-supervised schemes usually provide only partial labelling information of the underlying point cloud data and thus need to effectively extract local features, geometric information, and contextual relationships only using these limited labelled data for supervised learning. To improve weakly-supervised semantic segmentation, we propose a novel segmentation network through the boundary-based feature aggregation based on a K-NN algorithm with down-sampling operation, and also introduce the smoothness loss and Siamese loss for effective segmentation. The experiments on public datasets demonstrate that our presented segmentation method exceeds most of the existing fully supervised and weakly-supervised methods in terms of mIoU. Specifically, our network has high segmentation accuracy on the labels of objects with similar geometrical structures, such as ceiling, wall, floor, chair and table, reaching 91.2%, 98.8%, 83.3%, 75.3% and 80.2%, respectively. Extensive experiments also illustrate its robustness, effectiveness, and generalization of the proposed weakly supervised segmentation network.

Genomic analysis indicates that SARS-CoV-2 is most related to RaTG13, a beta corona virus derived from bats by 96% ¹. At present, RaTG13 is only available on the public database in the form of a genome sequence. The genome of RaTG13 (MN996532.1) was sequenced from the RNA of a bat faecal swab collected in 2013 from Yunnan, China, however the exact location is not mentioned. Since RaTG13 is one of the main supports for SARS-CoV-2 to have a natural origin, it is of utmost importance to understand the sample location. RNA dependent RNA polymerase (RdRp) sequence of RaTG13 shows that it is 100% similar to that of bat corona virus BtCoV/4991 and 98.7-98.9% similar to SARS-CoV-2 RdRp ². BtCoV/4991 was described to be a SARS-like (SL-) corona virus from bat faeces sampled in an abandoned mine from Mojiang ². Both the publications ^1,2 are authored by Dr. Zheng-li Shi (Z-L Shi), who is described as the bat woman of China ³. However, BtCoV/4991 has not been mentioned by Zhou et al 2020 ¹ where novel corona virus was first described. Based on the RdRp sequence similarities, similarities in sample collection dates, sample locations, and the fact that RaTG13 is mentioned synonymous to BtCoV/4991 on the Chinese bat database, it is predicted that RaTG13 and BtCoV/4991 originate from the same sample. The sample, bat faecal swab was collected in 2013 from an abandoned mineshaft in Mojiang by Dr. Shi and her work group. In 2012, in a Mojiang mineshaft, six mine workers suffered from atypical pneumonia and three of them died. These workers were engaged in the work of clearing debris from a mineshaft which had a lot of bats and bat faeces ^3,4. A detailed health investigation indicated that the miners suffered from atypical pneumonia mostly of the viral origin ⁴. Therefore, in the light of the present Covid-19 caused by SARS-CoV-2, the fact that its phylogenetic neighbour RaTG13 originated from bat faeces collected from a mineshaft, which was also the origin of pneumonia-like disease in miners in 2012, should be noted.

Aiming at effectively generating safe and reliable motion paths for quadruped robots, a hierar-chical path planning approach driven by dynamic 3D point cloud is proposed in this article. The developed path planning model is essentially constituted of two layers: global path planning layer and local path planning layer. At the global path planning layer, a new method is proposed for calculating terrain potential field based on point cloud height segmentation. Variable step size is employed to improve the path smoothness. At the local path planning layer, a real-time prediction method for potential collision area and a strategy for temporary target point selection is developed. Quadruped robot experiments were carried out in an outdoor complex environment. The experi-mental results verified that, for global path planning, the smoothness of the path is improved and the complexity of the passing ground is reduced. The effective step size is increased by a maxi-mum of 13.4 times, and the number of iterations is decreased by up to 1/6, compared with the traditional fixed step size planning algorithm. For local path planning, the path length is short-ened by 20%, more efficient dynamic obstacle avoidance and more stable velocity planning are achieved by using the improved dynamic window approach (DWA).

Due to an urgent need for reducing the fast progressing climate changes, a rapid, standardized and replicable solution for the infrastructure restructuring of heat demand coverage of buildings at district and city level must be developed. As more and more communities in Europe, especially in Germany, are obligated to have plans for coverage of heat demand, city planners, energy agencies seek a tool, which will help them to design the first drafts of heating network routes, which can supply whole districts and cities with renewable energy. ArcGIS Pro Tools like Least-Cost-Path-Analysis (LCPA) and Closest Facility (CF) allow to find the shortest and “cheapest” way between the heat source and heat consumers in the analyzed areas. Starting from the community level, through the district, county, voivodeship and whole country levels, the replication of the methods for generating district heating (DH) network infrastructure can be achieved. The proposed LCPA and CF based methods help to design the most suitable and efficient DH networks in the analyzed areas. As only few open-source data input, like street networks and building footprints are needed, the methods can be implemented in all communities of the country of Poland. In this paper one example of one community of Wroclaw county, called Siechnice and surroundings is presented.

The prevalence of hepatitis B and delta viruses (HBV/HDV) among people who use drugs (PWUD) remains largely unknown. In the context of one Philadelphia-based harm reduction organization (HRO), this study aimed to assess HBV/HDV prevalence and facilitate linkage to care. Participants completed a demographic HBV/HDV risk factor survey and were screened for HBV and reflexively for HDV if positive for HBV surface antigen or isolated core antibody. Fisher’s exact tests and regression were used to understand relationships between risks and HBV blood markers. Of the 498 participants, 126 (25.3%) were susceptible to HBV, 52.6% had been vaccinated against HBV, and 17.9% had recovered from a past infection. Eleven (2.2%) participants tested positive for isolated HBV core antibody, 10 (2.0%) for HBV surface antigen, and one (0.2%) for HDV antibody. History of incarceration was associated with current HBV infection, while transactional sex and experience of homelessness were predictive of previous exposure. This study found high rates of current and past HBV infection, and a 10% HBV/HDV co-infection rate. Despite availability of vaccine, one quarter of participants remained vulnerable to infection. Findings demonstrate the need to improve low-threshold HBV/HDV screening, vaccination, and linkage to care among PWUD. The study also identified gaps in the HBV/HDV care cascade, including lack of point-of-care diagnostics and lack of support for HROs to provide HBV services.

Artificial intelligence (AI) is increasingly being used to improve the quality control of point-of-care diagnostics. This is caused by a number of factors, including the following: 1. AI can accelerate and improve testing accuracy. In comparison to humans, AI technology can review data more quickly and precisely, reducing errors and improving overall quality assurance. 2. When it comes to improving POC test findings on healthcare issues such as infectious diseases or medical crises such as heart attacks, AI can be used for sophisticated predictive analytics and modeling that aid in better decision-making. 3. Artificial intelligence facilitates process automation, increasing productivity and lowering labor costs in labor-intensive tasks such as testing and analyzing samples collected at point-of-care facilities. 4. The use of AI enables organizations implementing these solutions to gain insights from large volumes of raw diagnostic data generated faster and more accurately, allowing them to build solid frameworks around preventive care initiatives and significantly influence public health outcomes.5. Artificial intelligence (AI) has been demonstrated to be a useful tool for real-time monitoring systems that identify any problems with test results early so that they can be corrected before affected patients receive inaccurate diagnoses or treatment plans based on false information provided by diagnostic tests performed at points of care such as clinics or hospitals.Using these technologies would allow healthcare organizations to spend less on labor while still receiving exact diagnoses and rapid treatment delivery at a fraction of the cost that manual approaches required earlier.

The research of object classification and part segmentation is a hot topic in computer vision. A considerable number of studies have been carried out about deep learning on 3D point clouds. However,it is challenging to achieve effective feature learning due to sparsity of point clouds. Recently, a variety of Transformers have been adopted to improve point cloud processing and display great potential. Nevertheless, large numbers of Transformer layers tend to incur huge computational and memory costs. PointNet++ is one of the most influential neural architectures for point cloud understanding. Although the accuracy of PointNet++ has been largely surpassed by recent networks, this does not mean that PointNet++ has no potential.Thus, this paper offer two major contributions that significantly improve PointNet++ performance. Firstly, we introduce a novel contextual feature extraction (CFE) block that significantly enhances the feature extraction capabilities of PointNet++ networks. Secondly, to further enhance feature fusion, we seamlessly integrate a mutual learning (ML) block into the network architecture. By embedding these two innovative blocks within each layer of the network, we not only enrich the network's functionality but also impart it with greater robustness and adaptability. The specific experiments were conducted on the S3DIS (6-fold cross-validation) and Modelnet40 datasets with 86.5% and 92.7% accuracy, respectively, which proved that our model is comparable or even better than most existing methods for classification and segmentation tasks.

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.

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.

For multi-sensor integrated systems, such as a mobile mapping system (MMS), data fusion at sensor-level, i.e., the 2D-3D registration between optical camera and LiDAR, is a prerequisite for higher level fusion and further applications. This paper proposes a line-based registration method for panoramic images and LiDAR point cloud collected by a MMS. We first introduce the system configuration and specification, including the coordinate systems of the MMS, the 3D LiDAR scanners, and the two panoramic camera models. We then establish the line-based transformation model for panoramic camera. Finally, the proposed registration method is evaluated for two types of camera models by visual inspection and quantitative comparison. The results demonstrate that the line-based registration method can significantly improve the alignment of the panoramic image and LiDAR datasets under either the ideal spherical or the rigorous panoramic camera model, though the latter is more reliable.

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.

Accurate classification of objects in 3D point clouds is a significant problem in several applications, such as autonomous navigation and augmented/virtual reality scenarios, which has become a research hot spot. In this paper, we presented a deep learning strategy for 3D object classification in augmented reality. The proposed approach is a combination of the GRU and LSTM. LSTM networks learn longer dependencies well, but due to the number of gates, it takes longer to train; on the other hand, GRU networks have a weaker performance than LSTM, but their training speed is much higher than GRU, which is The speed is due to its fewer gates. The proposed approach used the combination of speed and accuracy of these two networks. The proposed approach achieved an accuracy of 0.99 in the 4,499,0641 points dataset, which includes eight classes (unlabeled, man-made terrain, natural terrain, high vegetation, low vegetation, buildings, hardscape, scanning artifacts, cars). Meanwhile, the traditional machine learning approaches could achieve a maximum accuracy of 0.9489 in the best case.

The wave energy converter (WEC) technology constantly develops new designs and models. To encourage its development within the energy sector, research is required to improve current designs and create durable and effective devices. However, it is also crucial to investigate the suitability of a WEC to a site-specific sea condition as this can impact its optimal power absorption and constructability. This study evaluates and compares the efficiency of a heaving buoy with varied geometries in one of the most energetic places along the Mexican coast. A statistical analysis of the wave climate on the coast of Ensenada during the last 42 years is performed to define the conditions to which the device is subjected. The location of the WEC in shallow waters is chosen using a computational model which solves the modified mild slope equation in its elliptic shape. The heaving buoy floater is studied using three distinct geometries: a semi-sphere, a cylinder, and a proposed rounded semi-rectangle. The hydrodynamic response of the three geometries is then analysed in the frequency and time domain using ANSYS AQWA. The hydrodynamic study involves the assessment of the floating body dynamics, exerted forces, the power absorbed as well as the suitability of the proposed power take-off (PTO) system. Findings reveal that the proposed geometry absorbs the most energy, with an annual power of 135.11 MW, and that the transmission PTO design is appropriate for this type of technology.

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.

This paper proposes a novel single-stage buck-boost three-Level neutral-point-clamped (NPC) inverter with two independent dc sources coupled for the grid-tied photovoltaic (PV) application, which can effectively solve the unbalanced operational conditions generally appeared between two coupled independent PV sources induced by the unequal irradiation and temperature distribution. The proposed control scheme can simultaneously guarantee the maximum power point (MPP) operation of both PV sources and maintain the output waveform quality. Compared to the traditional two-stage PV inverter, the proposed NPC inverter could reduce the PV array voltage requirement and dc-link capacitors’ voltage rating, meanwhile show the advantage in operational efficiency. MATLAB simulations and the captured experimental results are presented to show the performance of the proposed three-level inverter.

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.

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.

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.

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.

The point cloud is a form of three-dimensional data that comprises various detailed features at multiple scales. Due to this characteristic and its irregularity, point cloud analysis based on deep learning is challenging. While previous works utilize the sampling-grouping operation of PointNet++ for feature description and then explore geometry by means of sophisticated feature extractors or deep networks, such operations fail to describe multi-scale features effectively. Additionally, these techniques have led to performance saturation. And it is difficult for standard MLPs to directly "mine" point cloud. To address above problems, we propose the Detail Activation (DA) module, which encodes data based on Fourier transform after sampling and grouping. We activate the channels at different frequency levels from low to high in the DA module to gradually recover finer point cloud details. As training progresses, the proposed Point-MDA can uncover local and global geometries of point cloud progressively. Our experiments show that Point-MDA achieves superior classification accuracy, outperforming PointNet++ by 3.3% and 7.9% in terms of overall accuracy on the ModelNet40 and ScanObjectNN dataset, respectively. Furthermore, it accomplishes this without employing complicated operations, while exploring the full potential of PointNet++.

A software defined radio (SDR) is a communication system that makes use of components that can be configured through software, in contrast to traditional systems where these components are variable through hardware, these radio devices are much more versatile, this article describes the factors that must be considered when implementing a communication system based on Software Defined Radios (SDR), in order to reduce the attenuation factors and thus obtain the maximum distance for a transmission of data effectively in the UHF band. The calculations made for the first Fresnel zone and for the design of the Ground Plane type antennas used in the transmission/reception stages of the x40 bladeRF platforms are also presented. The tests were carried out at the facilities of the Huarangal Nuclear Center of the Peruvian Institute of Nuclear Energy, obtaining favorable results that allow ratifying the versatility and performance of the SDRs.

Interactions between mobile robots and human operators in common areas require a high safety especially in terms of trajectory planning, obstacle avoidance and mutual cooperation. In this connection the crossings of planned trajectories, their uncertainty based on model fluctuations, system noise and sensor noise,play an outstanding role. This paper discusses the calculation of expected areas of interactions du ring human-robot navigation with respect to fuzzy and noisy information. Expected crossing points of possible trajectories are nonlinearily associated with positions and orientations of robot and human. The nonlinear transformation of a noisy system input, such as directions of motion of human and robot, to a system output, the expected area of intersection of their trajectories, is done by two methods: statistical linearization and the sigma-point-transformation. For both approaches fuzzy approximations are presented and the inverse problem is discussed where the input distribution parameters are computed from given output distribution parameters.

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.

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.

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.

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.

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 investigate the impact of aging on exchangeable inter-arrival times in mixed renewal processes, exploring its implications for reliability and survival analysis. In this study, first, we revisit the definition of renewal point processes, where inter-event time intervals are considered as exchangeable non-negative random variables. Then, we define the concept of statistical aging as latency in the observational process of event counting. Latency affects event detection but preserves exchangeability. However, it may alter the statistical properties of inter-event time intervals. Our analytical and numerical assessments highlight the significance of aging in exchangeable lifetimes, offering insights into key metrics such as the failure survival function, renewal function, and hazard rate function. Through archetypal examples and empirical findings, we illustrate the implications of aging on renewal processes. In particular, employing a Bayesian perspective, we analyze high-frequency currency exchange rate data to assess the impact of aging on volatility risk evaluation. This study contributes novel insights to the literature of renewal theory and survival analysis, emphasizing the role of latency aging in stochastic point processes under exchangeability assumption.

We consider a Cauchy problem for differential equations in a Hilbert space $X$. The problem is stated in a time interval $I$, which can be finite or infinite. Weuse a fixed point argument for history-dependent operators to prove the unique solvability of the problem. Then, we state and prove convergence criteria for both a general fixed point problem and thecorresponding Cauchy problem. These criteria provide necessary and sufficient conditions on a sequence $\{u_n\}$ which guarantee its convergence to the solution of the corresponding problem, in the space of both continuous and continuously differentiable functions. We then specify our results in the study of a particular differential equation governed by two nonlinear operators. Finally, we provide an application in viscoelasticity and give a mechanical interpretation of the corresponding convergence result.

First came the digital banks without offices, and then the “fintech” companies that combined technology and finance to achieve greater efficiency and new business models. Later was the turn of transport and logistics, understood as the sector whose economic activities derived from the transport of people and goods, while on the one hand, it has had a new spring thanks to factors such as online sales. Then, perhaps catalyzed by the pandemic scenario, the turn has reached education, where years ago was only a complement of traditional education, now is a central part with multiple modern methodologies. Numerous studies exist about using or implementing these e-learning procedures, but technical analysis is barely found in references. This work aims to analyze the digital transformation of the main sectors of our society, including finances, transport, and education, together with several examples of how technology was helping to fight the pandemic scenario.

(1) Background: Considering highly selected patients with ductal carcinoma in situ (DCIS), active surveillance is a valid alternative to surgery. Our study is aimed at showing the reliability of post-biopsy complete lesion removal, documented by mammogram, as additional criterion to select these patients. (2) Methods: 2173 Vacuum Assisted Breast Biopsies (VABB) documented as DCIS have been reviewed. Surgery has been performed in all cases. We retrospectively collected the reports of post-VABB complete lesion removal and the histological results of the biopsy and surgery. We calculated the rate of upgrade of DCIS identified on VABB upon excision for patients with post-biopsy complete lesion removal and for those showing residual lesion. (3) Results: We observed 2173 cases of DCIS: 408 classified as low grade; 1262 as intermediate grade; 503 as high grade. The overall upgrading rate to invasive carcinoma was 15.2% (330/2173). The upgrade rate was significantly lower (8.2%) when considering patients showing mammographically documented complete removal of the lesion. (4) Conclusion: The absence of mammographically documented residual lesion following VABB is associated to a lower upgrading rate of DCIS to invasive carcinoma on surgical excision and should be considered when deciding the proper management DCIS diagnosis.

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.

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.

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.

Lymphedema is a chronic and debilitating disease that affects up to 250 million patients worldwide. Recent advances in understanding its pathophysiology, along with improved diagnosis and microsurgical techniques, have enhanced our ability to cope with the challenging task of treating this disease. This review provides an overview of the disease from a surgeon's point of view, including existing imaging modalities used for preoperative assessment, as well as surgical procedures used in its treatment. Advantages and drawbacks of various existing modalities used for pre or intraoperative assessment of lymphatic vessels are discussed. Lymphedema treatment has shifted from palliative debulking procedures (liposuction and direct excision) to those aimed at restoring lymphatic flow and countering the pathophysiology of the disease (lymphaticovenous anastomosis and vascularized lymph node transfer). A combination of both approaches can result in a synergistic benefit for patients and are discussed in this review. Despite recent advances, some controversies persist, and further studies are needed to better define surgical treatment algorithms.

Schizoaffective disorder and its classification have always been a topic of discrepancy among researchers. The overlapping presentations of schizoaffective disorder, schizophrenia and psychotic bipolar disorder makes it difficult to classify and diagnose. This study is a narrative review of literatures and genetic and epidemiological research evidences, done to determine the similarities and differences between schizoaffective and psychotic bipolar disorder. Beginning from the introduction of schizoaffective disorder as "schizoaffective psychosis" by Kasanin in 1933, various researchers have proposed different views regarding the diagnosis and classifications for schizoaffective disorder. DSM-III considered schizoaffective disorder as a diagnosis of exclusion as it fails to fit the definite diagnostic criteria of schizophrenia, major affective disorders, or schizophreniform disorder. DSM-V updated the criteria of schizoaffective disorder and stated it as a life time illness rather than being an episodic disorder as in DSM-IV and hence is more reliable. However, some studies show that schizoaffective disorder patients are more like schizophrenia than mood disorder. It still remains unclear whether schizoaffective disorder is a heterogenous disease, a form of schizophrenia, a form of mood disorder or a midpoint in the continuation spectrum of schizophrenia and psychotic bipolar disease.

3D object detection is essential for an accurate and reliable autonomous driving system. Currently, the methods used by the state-of-the-art two-stage detectors are not flexible enough and their fea-ture extraction capabilities are very limited to cope effectively with the disorder and irregularity of point clouds. In this paper, we combine the advantages of both PV-RCNN and PAConv (Position Adaptive Convolution) to create a completely new network, FANet, in order to overcome the ir-regularity and disorder of point clouds. The convolution in our network builds convolutional ker-nels from a basic weight matrix, whose combined coefficients are learned adaptively by LearnNet from relative points. This network allows for flexible modeling of complex spatial variations and geometric structures in the 3D point cloud, enabling better extraction of point cloud features and producing high-quality 3D proposal boxes. Compared to other methods, FANet is superior in terms of 3D object detection accuracy. Extensive experiments on the KITTI dataset have shown a signif-icant improvement in our approach.

In this paper, we present the idea of Self Supervised learning on the Shape Completion and Classification of point clouds. Most 3D shape completion pipelines utilize autoencoders to extract features from point clouds used in downstream tasks such as Classification, Segmentation, Detection, and other related applications. Our idea is to add Contrastive Learning into Auto-Encoders to learn both global and local feature representations of point clouds. We use a combination of Triplet Loss and Chamfer distance to learn global and local feature representations. To evaluate the performance of embeddings for Classification, we utilize the PointNet classifier. We also extend the number of classes to evaluate our model from 4 to 10 to show the generalization ability of learned features. Based on our results, embedding generated from the Contrastive autoencoder enhances Shape Completion and Classification performance from 84.2% to 84.9% of point clouds achieving the state-of-the-art results with 10 classes.

Vienna Atomic Line Database (VALD) contains data on atomic and molecular energy levels and parameters of spectral lines required for stellar spectra analysis. Hundreds of millions lines for fine spectral synthesis and for opacity calculations are collected in present version of VALD (VALD3). Critical evaluation of the data and the diversity of extraction tools support high popularity of VALD among users. The data model of VALD3 incorporates obligatory links to the bibliography making our database more attractive as publishing platform for data producers. The VALD data quality and completeness are constantly improving allowing better reproduction of stellar spectra. To illustrate continuous evolution of the data content we present a comparative analysis of the recent experimental and theoretical atomic data for Fe-group elements, which will be included in the next VALD release. This release will also include a possibility for extracting the line data with full isotopic and hyperfine structures.

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.

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

The late universe contains a wealth of information about fundamental physics and gravity, wrapped up in non-Gaussian fields. To make use of as much information as possible it is necessary to go beyond two-point statistics. Rather than going to higher order N-point correlation functions, we demonstrate that the probability distribution function (PDF) of spheres in the matter field (a one-point function) already contains a significant amount of this non-Gaussian information. The matter PDF dissects different density environments which are lumped together in two-point statistics, making it particularly useful for probing modifications of gravity or expansion history. Our approach in Cataneo et. al. 2021 extends the success of Large Deviation Theory for predicting the matter PDF in ΛCDM in these “extended” cosmologies. A Fisher forecast demonstrates the information content in the matter PDF via constraints for a Euclid-like survey volume combining the 3D matter PDF with the 3D matter power spectrum. Adding the matter PDF halves the uncertainties on parameters in an evolving dark energy model, relative to the power spectrum alone. Additionally, the matter PDF contains enough non-linear information to substantially increase the detection significance of departures from General Relativity, with improvements up to six times the power spectrum alone. This analysis demonstrates that the matter PDF is a promising non-Gaussian statistic for extracting cosmological information, particularly for beyond ΛCDM models.

Current commitments by European governments seek to improve energy consumption as a means to reduce carbon emissions from building stock by 2050. Within such context, retrieving reliable three-dimensional contours from point clouds becomes an important step in developing facade retrofitting solutions since facade retrofitting projects often make use of as-built 3D models to help reduce inaccuracies by narrowing interpretation and measurement errors. This work aims to provide a method that uses topology-based parametric modelling for reconstructing building envelopes from point clouds. Through a semi-automated process that gives permanent visual feedback, the user adjusts parameters to custom standards of acceptability. A solution under the form of a Grasshopper definition delivers building envelope 3D contours in various file formats as a means for increasing interoperability. The main contributions of this work consist of a parametric reconstruction workflow capable of solving building topology for retrieving 3D contours, a strategy to bypass point cloud occlusion, and a strategy for converting those contours into an IFC model directly from the parametric modelling environment.

In this paper, we present a relapse based demonstrating way to deal with investigate various arrangement MTC information. A commonplace use of this displaying approach incorporates three stages: first, define a model that approximates the connection between quality articulation and trial factors, with boundaries consolidated to address the exploration premium; second, utilize least-squares and assessing condition methods to gauge boundaries and their relating standard blunders; third, register test insights, P-qualities and NFD as proportions of factual criticalness. The benefits of this methodology are as per the following. To begin with, it tends to the exploration interest in a particular, precise way, and maximally uses all the information and other important data. Second, it represents both orderly and irregular varieties related with the information, and the consequences of such examination give not just quality explicit data applicable to the exploration objective, yet additionally its dependability, in this way helping agents to settle on better choices for subsequent investigations. Third, this methodology is truly adaptable, and can undoubtedly be stretched out to different sorts of MTC considers or other microarray explores by detailing various models dependent on the test plan of the investigations.

Extruded polystyrene (XPS) is frequently used in the construction of many different structures. It is therefore necessary to appropriately characterize its mechanical properties to ensure the safety of said structures. Among the available characterization tests, static bending tests are simple and easy to perform; owing to these characteristics, they should be performed more frequently than other tests. However, in static bending tests on XPS, there are several challenges owing to the high flexibility of XPS, and the chosen testing method and sample configuration affect the accuracy of characterization. In this study, three bending properties (Young’s modulus, proportional limit stress, and bending strength) of samples cut from an XPS panel were determined using three-point bending (TPB), four-point bending (FPB), and compression bending (CB) tests with varying sample span/depth ratios, and statistical analyses were performed to determine the relevance of the tests. The experimental results suggest that the TPB and CB tests were more feasible than the FPB test when the span/depth ratio was appropriately determined. However, clear differences were observed in the sample bending properties determined in these tests. In light of these findings, further studies should be conducted to elucidate these differences.

Coastal cliffs erode in response to short- and long-term environmental changes but predicting these changes continues to be a challenge. In addition to a chronic lack of data on the cliff face, vegetation presence and growth can bias our erosion measurements and limit our ability to detect geomorphic erosion by obscuring the cliff face. This paper builds on past research segmenting vegetation in 3-band red, green, blue (RGB) imagery and presents two approaches to segmenting and filtering vegetation from the bare cliff face in dense point clouds constructed from RGB images and structure-from-motion (SfM) software. Vegetation indices were computed from previously published research and their utility in segmenting vegetation from bare cliff face were compared against machine learning (ML) models for point cloud segmentation. Results demonstrate that, while existing vegetation indices and ML models are both capable of segmenting vegetation and bare cliff face sediments, ML models can be more efficient and robust across different growing seasons. ML model accuracy quickly reached an asymptote with only two layers and RGB images only (i.e., no vegetation indices), suggesting that these more parsimonious models may be more robust to a range of environmental conditions than existing vegetation indices which vary substantially from one growing season to another with changes in vegetation phenology.

This paper introduces a method for tunnel point cloud and BIM model integration and cross-section monitoring, providing information to analyse tunnel cross-sections and surrounding rock deformation, and support for tunnel maintenance and reconstruction. Three types of data are processed for the integration: laser scanning point cloud, BIM tunnel model and terrain model from oblique photogrammetry. An adaptive BIM modelling scheme is proposed for tunnels with alien structures. Precise spatial registration of the data sets is conducted by applying singular value decomposition (SVD) algorithm to calculate transformation parameters from the point cloud model to the BIM model. Since the tunnel central line has high-order derivability, a cross-section calculation method based on tangent vector is proposed to obtain the cross-sectional profile of tunnels at any mileage. The proposed method has been verified by applying it to a tunnel reconstruction project. The experiment results show that the tunnel point cloud and the BIM model were highly coincident after the integration. The developed program can effectively get the cross-section of the tunnel at any mileage, and correctly express the spatial relationship between the BIM tunnel, the point cloud of tunnel and the external mountainous terrain.

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.

A 68-year-old man with malignant metastatic melanoma in complete remission after Pembrolizumab treatment, developed 10 months after Pembrolizumab cessation due a grade 3 diarrhea, confusion, altered mental status, progressive memory loss, gait disturbance. He was admitted to the neurologic department and comprehensive neurological workup, brain magnetic resonance imaging, cerebral fluid analysis, EEG, blood test allowed the diagnosis of autoimmune encephalitis. The patient was treated with plasmapheresis, high dose of intravenous steroids and intravenous immunoglobulins. The patient improved and he is now well with a performance status 1. This case is interesting since the AE developed approximately 10 months after the cessation of immunotherapy, the underlying cancer was in complete remission and the AE showed a good response to the treatment done.

The notion of Critical Point Theory has extensive application in the filed of Partial Differential Equations, one of which is studying the existence and commenting on the uniqueness and multiplicity (in case when the solution is not unique) of weak solutions to Elliptic PDEs under certain boundary conditions.\par This article provides a brief survey about specific concepts like : differentiation on Banach Spaces, maxima and minima and its applications to PDEs. Furthermore, we've discussed the notion of defining a weak topology on Banach Spaces, before introducing the Variational Principle and its applications.\par The epilogue of the article primarily deals with results which studies the existence of weak solutions to Dirichlet Boundary Value Problems under specific conditions. The most notable aspect of this article is the proof of \textit{Rabinowitz's Saddle Point Theorem} using the method of \textit{Brouwer Degree}. Readers who are highly motivated in pursuing research in any of the topics relevent to the contents of this paper will surely find the \texttt{References} section to be extremely resourceful.

The notion of oriented set is the basic elementary concept of the theory of changeable sets. The main motivation for the introduction of changeable sets was the sixth Hilbert problem, that is, the problem of mathematically rigorous formulation of the fundamentals of theoretical physics. In the present paper the necessary and sufficient condition of the existence of one-point time on an oriented set is established. From the intuitive point of view, one-point time is the time associated with the evolution of a system consisting of only one object (for example, from one material point). Namely, it is proven that the one-point time exists on the oriented set if and only if this oriented set is a quasi-chain. Also, using the obtained result, the problem of describing all possible images of linearly ordered sets is solved. This problem naturally arises in the theory of ordered sets.

This work condenses various modeling techniques for different Point Absorber configurations. A combined frequency - time domain model will be developed in Matlab-FORTRAN in order to compute the displacement, velocities and the power absorbed in the heave mode. Additionally, a single buoy motion including multiple degrees of freedom will be investigated as well. Therefore, the diffraction-radiation Boundary Element Method solvers NEMOH and BEMIO will be applied in the calculation of the hydrodynamic coefficients, which will determine the solution of Newtons impulse equations of motion. Initially, the Wave to wire model will be validated through comparison with previous experimental results for a submerged cone cylinder shape (Buldra-FO3). A single, generic, vertical floating cylinder will be contemplated then, that responds to the action of the passing waves excitation. Later, two vertical floating cylinders aligned with the incident wave direction will be modeled for a variable distance between the bodies. For both unidirectional regular and irregular waves as an input in deep water, the convolutive radiation force function term will be hereby approximated through the Prony method. By changing the spatial disposition of the axisymmetric buoys, using for instance triangular or diamond shaped arrays of three and four bodies respectively, the study will focus on the interaction effects for regular waves. The results will highlight the most efficient layout for maximizing the energy production whilst providing important insights into their performance, revealing for instance displacement amplification or capture width ratios in near-resonance conditions.

Measuring bias is important as it helps identify flaws in quantitative forecasting methods or judgmental forecasts. It can, therefore, potentially help improve forecasts. Despite this, bias tends to be under-represented in the literature: many studies focus solely on measuring accuracy. Methods for assessing bias in single series are relatively well-known and well-researched, but for datasets containing thousands of observations for multiple series, the methodology for measuring and reporting bias is less obvious. We compare alternative approaches against a number of criteria when rolling-origin point forecasts are available for different forecasting methods and for multiple horizons over multiple series. We focus on relatively simple, yet interpretable and easy-to-implement metrics and visualization tools that are likely to be applicable in practice. To study the statistical properties of alternative measures we use theoretical concepts and simulation experiments based on artificial data with predetermined features. We describe the difference between mean and median bias, describe the connection between metrics for accuracy and bias, provide suitable bias measures depending on the loss function used to optimise forecasts, and suggest which measures for accuracy should be used to accompany bias indicators. We propose several new measures and provide our recommendations on how to evaluate forecast bias across multiple series.

In this paper, we prove some common fi xed point theorems on complex partial metric space. The presented results gener- alize and expand some of the literature well-known results. We also explore some of the application of our key results.

This paper presents the validation of the End Point Rate (EPR) tool for QGIS (EPR4Q), a tool built-in QGIS Graphical Modeler to calculate the shoreline change by End Point Rate method. The EPR4Q tries to fill the gap of user-friendly and free open-source tool for shoreline analysis in Geographic Information System environment, since the most used software - Digital Shoreline Analysis System (DSAS) - although is a free extension, is suited for commercial software. Besides, the best free open-source option to calculate EPR called Analyzing Moving Boundaries Using R (AMBUR), since it is a robust and powerful tool, the complexity and heavy processes can restrict the accessibility and simple usage. The validation methodology consists of applying the EPR4Q, DSAS, and AMBUR on different examples of shorelines found in nature, extracted from the U.S. Geological Survey Open-File. The obtained results of each tool were compared with Pearson correlation coefficient. The validation results indicate that the EPR4Q tool created acquired high correlation values with DSAS and AMBUR, reaching a coefficient of 0.98 to 1.00 on linear, extensive, and non-extensive shorelines, guarantying that the EPR4Q tool is ready to be freely used by the academic, scientific, engineering, and coastal managers communities worldwide.

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.

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.

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.

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 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.

In this short communication, following a brief introduction, we undertake a comprehensive analytical study of the weighted Simpson index. Our primary emphasis concerns the precise determination of the optimal point (minimizer) coordinates and of the minimum value of the index, a differentiable convex function, which is related to the harmonic mean concept. Furthermore, we address and solve the inversion problem and show the tight connection between both approaches. Last, we give some insights and final remarks on this subject.

While the language model using the stop sign as an independent token has been widely used to decide when the model should stop, it may lead to the growth of vocabulary dimensions and further problems. Similarly, present research on game algorithms usually estimate stopping point related problems based on the evaluation of the winning rate. However, information redundancy may also exist in such models, thus increasing the training difficulty. Above two types of tasks (and similar autoregressive tasks) show a common problem of stopping point prediction. In this paper, we describe a design of separated model, trying to separate the complexity of stopping point prediction from the main task model, so that the information used for estimating stopping point can be reduced. On this basis, in order to verify the rationality of using separated model, we propose a model-free test method. It judges the separability of transformed data based on point difference and sequence difference metrics. In this way, it can predict the credibility of the separated model inference.

Most real-time terrain point cloud rendering techniques do not address the empty space between the points but rather try to minimize it by changing the way how the points are rendered by either rendering them bigger or with more appropriate shapes such as paraboloids. In this work, we propose an alternative approach to point cloud rendering, which addresses the empty space between the points and tries to fill it with appropriate values to achieve the best possible output. The proposed approach runs in real time and outperforms several existing point cloud rendering techniques in terms of speed and render quality.

In this note we describe a new approach to the option pricing problem by introducing the notion of the safe (and acceptable) for the writer price of an option, in contrast to the fair price used in the Black-Scholes model. Our starting point is that the option pricing problem is closely related with the hedging problem by practical techniques. Recalling that the Black - Scholes model does not give us the price of the option but the initial value of a replicating portfolio we observe easily that has a serious disadvantage because assumes the building of this replicating portfolio continuously in time and this is a disadvantage of any model that assumes such a construction. Here we study the problem from the practical point of view concerning mainly the over the counter market. This approach is not affected by the number of the underlying assets and is particularly useful for incomplete markets. In the usual Black-Scholes or binomial or some other approaches one assumes that one can invest or borrow at the same risk free rate $r>0$ which is not true in general. Even if this is the case one can immediately observes that this risk free rate is not a universal constant but is different among different people or institutions. So, the fair price of an option is not so much fair! Moreover, the two sides are not, in general, equivalent against the risk therefore the notion of a fair price has no meaning at all. We also define a variant of the usual binomial model, by estimating safe upward and downward rates $u,d$, trying to give a cheaper safe or acceptable price for the option.

The article presents the Base Point Split (BPSplit) algorithm for generating a polygon skeleton based on sets of vector data describing lakes and rivers. A key feature of the BPSplit algorithm is that it is dependent on base points representing the source or mouth of a river or a stream. The input values of base points determine the shape of the resulting skeleton. Various skeletons can be generated with the use of different base points. Base points are applied to divide polygon boundaries into segments. Segmentation supports the selection of TIN edges inside polygons. The midpoints of selected TIN edges constitute a basis for generating a skeleton. The algorithm handles polygons with numerous holes, and it accounts for all holes. This article proposes a method for modifying a complex skeleton with numerous holes. In the discussed approach, skeleton edges that do not meet the preset criteria (e.g. that the skeleton is to be located between holes in the center of the polygon), are automatically removed. A simple algorithm for smoothing zigzag lines was proposed.

This paper presents a unified reconfigurable coordinate rotation digital computer (CORDIC) processor for floating-point arithmetic. It can be configured to operate in multi-mode to achieve a variety of operations and replaces multiple single-mode CORDIC processors. A reconfigurable pipeline-parallel mixed architecture is proposed to adapt different operations, which maximizes the sharing of common hardware circuit and achieves the area-delay-efficiency. Compared with previous unified floating-point CORDIC processors, the consumption of hardware resources is greatly reduced. As a proof of concept, we apply it to 1638416384 points target Synthetic Aperture Radar (SAR) imaging system, which is implemented on Xilinx XC7VX690T FPGA platform. The maximum relative error of each phase function between hardware and software computation and the corresponding SAR imaging result can meet the accuracy index requirements.

In recent years, there has been significant growth in the ubiquity and popularity of three dimensional(3D) point clouds, with an increasing focus on the classification of 3D point clouds. To extract richer features from point clouds, many researchers have turned their attention to various point set regions and channels within irregular point clouds. However, this approach has limited capability in attending to crucial regions of interest in 3D point clouds and may overlook valuable information from neighboring features during feature aggregation. Therefore, this paper proposes a novel 3D point cloud classification method based on global attention and adaptive graph convolution. The method consists of two main branches: the first branch com-putes attention masks for each point, while the second branch employs adaptive graph convolu-tion to extract global features from the point set. It dynamically learns features based on point interactions, generating adaptive kernels to effectively and precisely capture diverse relationships among points from different semantic parts. Experimental results demonstrate that the proposed model achieves 93.8% in overall accuracy and 90.8% in average accuracy on the ModeNet40 dataset.

We measured the anelastic, dielectric and structural properties of the metal-free molecular perovskite (ABX$_{3}$) (MDABCO)(NH$_{4}$)I$_{3}$, which has already been demonstrated to become ferroelectric below $T_{\text{C}}=$ 448~K. Both the dielectric permittivity measured in air on discs pressed from powder and the complex Young's modulus measured on resonating bars in vacuum show that the material starts deteriorating with loss of mass just above $T_{\text{C}}$, introducing defects and markedly lowering $T_{\text{C}}$. The elastic modulus softens of 50\% when heating through the initial $T_{\mathrm{C}}$, contrary to usual ferroelectrics, which are stiffer in the paraelectric phase. This suggests improper ferroelectricity, where the primary order parameter of the transition is not the electric polarization, but the orientational order of the MDABCO molecules. The degraded material presents thermally activated relaxation peaks in the elastic energy loss, whose intensities increase together with the decrease of ~$T_{\mathrm{C}}$. The peaks are much broader than pure Debye, due to the general loss of crystallinity, also apparent from X-ray diffraction, but their relaxation times have parameters typical of point defects. It is argued that the major defects should be of the Schottky type, mainly due to the loss of (MDABCO)$^{2+} $ and I$^{-}$, leaving charge neutrality, and possibly also (NH$_{4}$)$^{+}$ vacancies. The focus is on an anelastic relaxation process peaked around 200~K at $\sim 1$~kHz, whose relaxation time follows the Arrhenius law with $\tau $$_{0}$~$\sim $\ $10^{-13}$\ s and $E\simeq 0.4$~eV. This peak is attributed to I vacancies (V$_{\text{X}}$) hopping around MDABCO vacancies (V$_{\text{A}}$) and its intensity presents a peculiar dependence on temperature and content of defects. The phenomenology is thoroughly discussed in terms of lattice disorder introduced by defects and of partition of V$_{\text{X}}$ among sites that are far from and close to the cation vacancies. A method is proposed for calculating the relative concentrations of V$_{\text{X}}$, that are untrapped, paired with V$_{\text{A}}$ or forming V$_{\text{X}}$--V$_{\text{A}}$--V$_{\text{X}}$ complexes.

This paper provides a new management method (MM) to optimally operate standalone direct current (DC) photovoltaic water pumping system (PVWPS) and synchronize its hydraulic performance to variable daily irradiance. The proposed approach well considers the issues from PV generator and a positive displacement pump mismatching to deserve a hydraulic network. Accordingly, Management Method uses small pumps mounted in parallel scheme to displace the hydraulic power point (HPP) in order to satisfy the mal adequacy between supply and load. Based on experimental Study; this approach showed a yielded standalone system, possibility of running pumping system using only photovoltaic supply (Without use of capacitance), and possibility to design more economical PV systems as the maximum peak power demand for each month can be satisfied using small power pumps in parallel and adjusting their switch with accordance to varying daily irradiance. Moreover, an analytical model was developed with reference to the obtained experimental results. This model based on a daily occurring irradiance as inputs in order to predict optimal performance outputs. It can be considered as a decision tool to track power point resulting from optimal electrical and hydraulic performances of the pumping system according to changes of the daily irradiance.

The nature of the fracture and fragmentation process of concrete medium under blast loading is the transformation process of the medium from continuum to discontinuity, coupled with the significant rate correlation of concrete medium, its mechanical behavior presents a high degree of complexity. Problems such as grid distortion and even negative volume are often encountered in the finite element method and others when solving this problem, while the material point method can effectively avoid these problems. In addition, the widely used HJC concrete constitutive model does not take into account the segmented characteristics of the calculation function for dynamic increasing factor. Therefore, in this paper, firstly, the calculation function for dynamic increasing factor in the HJC concrete model is modified by SHPB experiment, and the improved HJC concrete model is proposed; secondly, the material point method simulation program is developed, and the improved HJC concrete model is embedded into the simulation program; finally, the simulation program is verified by numerical examples, and the results show that the developed simulation program can better simulate the fracture and fragmentation process of concrete medium under blast loading, especially the pulverization characteristics of the medium in the near zone of the load.

Biosensors have shown great potential in realizing rapid, low cost and portable on-site detection for diseases. This work reports the development of a new bioelectronic sensor called AC electrokinetics-based capacitive (ABC) biosensor, for the detection of genomic DNA (gDNA) of methicillin-resistant Staphylococcus aureus (MRSA). The ABC sensor is based on interdigitated microelectrodes biofunctionalized with oligonucleotide probes. It uses a special AC signal for direct capacitive monitoring of topological change on nanostructured sensor surface, which simultaneously induce dieletrophoretic enrichment of target gDNAs. As a result, rapid and specific detection of gDNA/probe hybridization can be realized with high sensitivity. It requires no signal amplification such as labelling, hybridization chain reaction, or nucleic acid sequence-based amplification. This method involves only simple sample preparation. After optimization of nano-structured sensor surface and signal processing, the ABC sensor demonstrated fast turnaround of results (~10 s detection), excellent sensitivity (a detection limit of 4.7 DNA copies /µL MRSA gDNA) and high specificity, suitable for point of care diagnosis. As a bioelectronic sensor, the developed ABC sensors can be easily adapted for detection of other infectious agents.

Empirically based modeling is an essential aspect of design for a wave energy converter. These models are used in structural, mechanical and control design processes, as well as for performance prediction. The design of experiments and methods used to produce models from collected data have a strong impact on the quality of the model. This study considers the system identification and model validation process based on data collected from a wave tank test of a model-scale wave energy converter. Experimental design and data processing techniques based on general system identification procedures are discussed and compared with the practices often followed for wave tank testing. The general system identification processes are shown to have a number of advantages. The experimental data is then used to produce multiple models for the dynamics of the device. These models are validated and their performance is compared against one and other. While most models of wave energy converters use a formulation with wave elevation as an input, this study shows that a model using a hull pressure sensor to incorporate the wave excitation phenomenon has better accuracy.

Introduction: Austere environments include the wilderness and many lower-and-middle-income countries, many of these facing unrest and war. The access to advanced diagnostic equipment is often unaffordable even if available and is often liable to breakdown. This short review paper examines the options available to medical professionals to undertake clinical and point of care diagnostic testing in resource constrained environments and also illustrates the development of mobile advanced diagnostic equipment. The aim is to provide an overview of the spectrum and functionality of these devices beyond clinical acumen.

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.

Based on the teaching material of "Robotics" course, this paper studied the automatic knowledge graph construction, including knowledge points extraction and knowledge point relation extraction. We proposed a new method of extracting the first-level, second-level, and third-level knowledge points as well as their prerequisite relations of knowledge points in the textbook. For the problem of insufficient knowledge of the pre-trained language model in the specific field, methods such as incremental pre-training and optimization of cost functions are employed to integrate subject knowledge into the pre-trained language model, thus improving its effectiveness. To overcome the problem that the traditional method of relationship extraction can not be applied directly to the extraction of teaching materials, a new scheme for knowledge point relationship extraction based on keyword relationship is proposed. The experimental data from textbooks shows that the F1 score of knowledge point extraction reaches 93%, considerably improved compared to the traditional model. Consequently, the knowledge point entity extraction and relationship extraction methods based on the pre-trained model can effectively extract structured information and facilitate the automatic construction of knowledge graphs.