The k-means is one of the most popular and widely used clustering algorithm, however, it is limited to only numeric data. The k-prototypes algorithm is one of the famous algorithms for dealing with both numeric and categorical data. However, there have been no studies to accelerate k-prototypes algorithm. In this paper, we propose a new fast k-prototypes algorithm that gives the same answer as original k-prototypes. The proposed algorithm avoids distance computations using partial distance computation. Our k-prototypes algorithm finds minimum distance without distance computations of all attributes between an object and a cluster center, which allows it to reduce time complexity. A partial distance computation uses a fact that a value of the maximum difference between two categorical attributes is 1 during distance computations. If data objects have m categorical attributes, maximum difference of categorical attributes between an object and a cluster center is m. Our algorithm first computes distance with only numeric attributes. If a difference of the minimum distance and the second smallest with numeric attributes is higher than m, we can find minimum distance between an object and a cluster center without distance computations of categorical attributes. The experimental shows proposed k-prototypes algorithm improves computational performance than original k-prototypes algorithm in our dataset.

Data mining plays a critical role in the sustainable decision making. The k-prototypes algorithm is one of the best-known algorithm for clustering both numeric and categorical data. Despite this, however, clustering a large number of spatial object with mixed numeric and categorical attributes is still inefficient due to its high time complexity. In this paper, we propose an efficient grid-based k-prototypes algorithms, GK-prototypes, which achieves high performance for clustering spatial objects. The first proposed algorithm utilizes both maximum and minimum distance between cluster centers and a cell, which can remove unnecessary distance calculation. The second proposed algorithm as extensions of the first proposed algorithm utilizes spatial dependence that spatial data tend to be more similar as objects are closer. Each cell has a bitmap index which stores categorical values of all objects in the same cell for each attribute. This bitmap index can improve the performance in case that a categorical data is skewed. Our evaluation experiments showed that proposed algorithms can achieve better performance than the existing pruning technique in the k-prototypes algorithm.

In this paper, we present sums and partial sums of Horadam sequences via generating functions which extends a recent result of Prodinger.

This work presents a novel approach for the study of the movement of droplets on inclined surfaces under the influence of gravity and chemical heterogeneities. The developed numerical methodology uses data-driven modeling to extend the applicability limits of an analytically derived reduced-order model for the contact line velocity. More specifically, while the reduced-order model is able to capture the effects of the chemical heterogeneities to a satisfactory degree, it does not account for gravity. To alleviate this shortcoming, datasets generated from direct numerical simulations are used to train a data-driven model for the contact line velocity, which is based on the Fourier neural operator and corrects the reduced-order model predictions to match the reference solutions. This hybrid surrogate model, which comprises of both analytical and data-driven components, is then integrated in time to simulate the droplet movement, offering a speedup of five orders of magnitude compared to direct numerical simulations. The performance of this hybrid model is quantified and assessed in different wetting scenarios, by considering various inclination angles and values for the Bond number, demonstrating the accuracy of the predictions as long as the adopted parameters lie within the ranges considered in the training dataset.

Often, when solving forward, inverse or data assimilation problems, only a part of the solution is needed. As a model, we consider the stationary diffusion problem. We demonstrate an algorithm that can compute only a part or a functional of the solution, without calculating the full inversion operator and the complete solution. It is a well-known fact about partial differential equations that the solution at each discretisation point depends on the solutions at all other discretisation points. Therefore, it is impossible to compute the solution only at one point, without calculating the solution at all other points. The standard numerical methods like a conjugate gradient or Gauss elimination compute the whole solution and/or the complete inverse operator. We suggest a method which can compute the solution of the given partial differential equation 1) at a point; 2) at few points; 3) on an interface; or a functional of the solution, without computing the solution at all points. The required storage cost and computational resources will be lower as in the standard approach. With this new method, we can speed up, for instance, computation of the innovation in filtering or the likelihood distribution, which measures the data misfit (mismatch). Further, we can speed up the solution of the regression, Bayesian inversion, data assimilation, and Kalman filter update problems. Applying additionally the hierarchical matrix approximation, we reduce the cubic computational cost to almost linear $\mathcal{O}(k^2n \log^2 n)$, where $k\ll n$ and $n$ is the number of degrees of freedom. Up to the hierarchical matrix approximation error, the computed solution is exact. One of the disadvantages of this method is the need to modify the existing deterministic solver.

For a positive integer k, a radio k-coloring of a simple connected graph G = (V (G), E(G)) is a mapping | f(u) - f(v)| ≥ k +1-d (u , v ) such that f :V (G)→{0,1, 2,...} for each pair of distinct vertices u and v of G, where d(u, v) is the distance between u and v in G. The span of a radio k-coloring f, rck(f), is the maximum integer it assigns to some vertex of G. The radio k-chromatic number, rck(G) of G is min{rck(f)}, where the minimum is taken over all radio k-colorings f of G. If k is the diameter of G, then rck(G) is known as the radio number of G. In this work, we propose four algorithms (two serial algorithms and their parallel versions) which related to the radio k-coloring problem. One of them is an approximate algorithm that determines an upper bound of the radio number of a given graph. The other is an exact algorithm which finds the radio number of a graph G. The approximate algorithm is a polynomial time algorithm while the exact algorithm is an exponential time algorithm. The parallel algorithms are parallelized using the Message Passing Interface (MPI) standard. The experimental results prove the ability of the proposed algorithms to achieve a speedup 7 for 8 processors.

Warren Weaver, writing about the function that science should have in mankind’s developing future, ideas and ideals, proposed to classify scientific problems into ‘problems of simplicity’, ‘problems of disorganised complexity’, and ‘problems of organised complexity’ — the huge complementary class to which all biological, human, and social problems belong. Problems of simplicity have few components and variables and have been extensively addressed in the last 400 years. Problems of disorganised complexity have a huge number of individually erratic components and variables, but possess collective regularities that can be analysed by resourcing to stochastic methods. Yet, problems of organised complexity do not yield easily to classical or statistical treatment since interrelations among phenomenon elements change during its evolution alongside commonly used state variables, affecting behaviour and outcome. Moreover, organisation, the focal point in this complementary class, is still an elusive concept despite the gigantic efforts undertaken since a century ago to tame it. This paper addresses the description, representation and study of phenomena in the ‘problems of organised complexity’ class. Grounded on relational mathematical constructs, a theoretical framework providing operational definitions and schemes for formally modelling organisations and interaction of organisations is introduced. This framework extends the general systems’ concept and provides a novel perspective for addressing organised complexity phenomena as a collection of interacting organisations.

We introduce the notion of generalized contraction on dualistic partial metric spaces. A fixed point theorem for mappings satisfying above mentioned contraction is obtained. Some consequences of our result are obtained. We construct an example to demonstrate the effectiveness of our result among the corresponding results in partial metric spaces. Our results provide substantial generalizations and improvements of several well known results existing in the comparable literature. We discuss an application of our fixed point results to show the existence of solution of functional equations.

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.

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

Reducing the construction time for large logistics buildings can result in reduced construction management costs and economic gains from early operation. A large logistic building with a heavy load and long spans was constructed as a precast concrete (PC) structure, which requires the use of a sizable crane to lift heavy PC members. A basic analytical approach is employed to resolve potential errors in the planning of PC member erection and to build a systematic erection plan. Calculation techniques for the trajectory distance, which use the crane location, are applied to select an erection plan that minimizes crane work. A crane trajectory distance calculation algorithm for sustainable PC member erection in large logistic buildings with heavy loads and long spans has been developed. The developed model aids in creating simulation and optimization models to ensure minimal usage of cranes in the future and determining cost, construction time, CO2 emissions, and energy use for each erection plan.

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

A novel physiologically based algorithm (PBA) for fast CFD computation of Flow Fractional Reserve (FFR) in Coronary Artery Trees (CATs) is proposed and developed, which, unlike traditional methods, is based on the extension of the Murray’s law for blood vessels at the outlets and extra inlet conditions prescribed alternatively and iteratively. The PBA is then implemented in both SimVascular and Ansys CFD for testing and validation. For validation purpose, 3D models of CATs are built by using their CT images and computational meshes generated for mesh convergence study. Results obtained are then compared with Invasive Coronary Angiographic (ICA) data for validation and evaluation of its accuracy and computational efficiency. It is found that discrepancies between experimental and calculated values of pressure and flow rate at the inlet were less than 0.1% at the end of the 10^th round of iteration or less. Further validation shows that the difference between estimated and experimental FFR agree with each other with a maximum difference of 1.62% after convergence is achieved. The PBA is found to be a robust patient-specific and physiologically sound method that can be a good alternative to the existing Lumped Parameter Model (LPM) which is based on empirical scaling correlations using limited population-averaged data and requires nonlinear iterative computation for convergence.

This paper's aim is to extend horizons in symbolic AI. The key to doing so is to establish a scientific basis for knowledge foundations, and specifically for the concept of meaning, and its computation. This led to the creation of the Meaning Computation AI (MCAI). Knowledge structures are at the heart of MCAI. The semantic triple chain, one of such structures, is the subject of this paper. This structure is the core of introducing computational semantic reasoning models across a variety of domains. To efficiently apply knowledge structures to create semantic reasoning applications MCAI contains a development framework consisting of four components. The first component stems from our discovery that knowledge is relational in nature. It can be expressed through implicit relations (which reflect meaning) and semantic relations (which describe how implicit relations act between entities). An algebraical apparatus for relational knowledge, specifically for implicit and semantic relations, represents the first component. Axiomatic models of relational domain ontologies and domain-oriented semantic reasoning models comprise the second and third components. The fourth component contains domain-oriented semantic reasoning engines.

In this paper, closed forms of the sum formulas $\sum_{k=0}^{n}x^{k}W_{k}^{3}$ and $\sum_{k=1}^{n}x^{k}W_{-k}^{3}$ for the cubes of generalized Fibonacci numbers are presented. As special cases, we give sum formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers.

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

Solar photovoltaic (PV) generation suffers from multiple serious issues, for example shading effects directly affect the performance of installed PV arrays. By studying these issues, it can play a key role in improving the limitations and performance of PV panels. The study of PV arrays under partial shading conditions is mentioned in many papers as a part of other studies and as an independent phenomenon. Therefore, it is essential to improve these studies and update them with new research and study this problem in detail to know how to limit the effects of partial shading irradiance conditions on PV arrays performances, including economical aspects. This paper proposes to study the effects of different partial shading irradiance conditions for a PV array in various configurations. The analysis is proved in detail through the simulation of the proposed PV array in the Matlab/Simulink environment. The obtained results show the performances of interconnected PV arrays under different partial shading irradiance and temperature conditions, including the solar array I-V and P-V characteristics. In addition, different PV array configurations with and without bypass and blocking protection diodes improve and minimize the effect of partial shading conditions and avoid the reductions in output power.

The partial discharge (PD) event in high voltage insulation releases energy, exerts mechanical pressure, and generates elastic waves. Detecting and locating these PD events through short-duration acoustic pulses is well-established, particularly in gas-insulated systems and oil-insulated transformers. However, its full potential remains untapped in solid insulation systems, where the propagation capability of acoustic pulse and the acoustic reflections pose fundamental challenges to the Acoustic Emission (AE) detection technique. This study investigates the influence of reflections and multiple paths on the propagating acoustic pulse in polymeric insulating materials using a finite element method (FEM) in COMSOL. It was observed that the reflections from the boundary influence the propagating pulse's shape, peak magnitude, and arrival time. An analytical MATLAB model further quantifies the impact of multiple propagation paths on the shape, magnitude, and arrival time of the pulse travelling in a cylinder. Additionally, a Perfect Matched Layer (PML) was implemented in the COMSOL model to eliminate reflections from the boundary, and it revealed that the acoustic pulse magnitude decreases with distance following the inverse square law. In essence, the models aid in measuring how reflections contribute to the observed signals, facilitating the precise identification of the source of the PD event in the tested system.

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

This research work deals with the formulation of numerical scheme with algorithm to compute singularly perturbed partial differential equations(SP-PDEs) involving a significant negative shift. The problem involves small parameter which causes a rapidly changing boundary layers in the vicinity of a body, and the negative shift term causes interior layer. Such appearance of an abruptly varying layers causes difficulties to find the exact solution and it is not adequate to employ classical numerical methods. The technique presented in this research work simplifies these challenges and yields accurate numerical solution.The stability and convergence analyses of the methods are examined and proven. To test the developed technique, numerical experiments are carried out and confirmed with theoretical analysis.

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

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

This paper discusses about the quantum energy levels of muonic hydrogen considering only Coulomb interaction. The computational analysis in this paper will help the reader get a good understanding of how different a muonic hydrogen is from its electronic counterparts. Energy eigenvalues are calculated by numerical method and the probability density distribution of muon around the nucleus is plotted for different quantum states using special functions. The code is written in python. A comparative study of emission spectra between the muonic hydrogen and hydrogen has also been discussed.

A novel physiologically based algorithm (PBA) for the computation of fractional flow reserve (FFR) in coronary artery trees (CATs) using computational fluid dynamics (CFD) is proposed and developed. The PBA is based on the extension of Murray's law and additional inlet conditions prescribed iteratively, and is implemented in OpenFOAM for testing and validation. 3D models of CATs are created using CT scans and computational meshes, and the results are compared to in-vasive coronary angiographic (ICA) data to validate the accuracy and effectiveness of the PBA. The discrepancy between calculated and experimental FFR is within 2.33-5.26% in steady-state and transient simulations, respectively, when convergence is reached. The PBA is a reliable and physiologically sound technique compared to the current lumped parameter model (LPM), which is based on empirical scaling correlations and requires nonlinear iterative computing for conver-gence. The accuracy of the PBA method is further confirmed using the FDA nozzle, which demonstrates good alignment with CFD-validated values.

Blockchains such as the bitcoin blockchain depend on reaching a global consensus on the distributed ledger; therefore, they suffer from well know scalability problems. This paper proposes an algorithm that avoids double-spending in the short term with just O(√n) messages; each node receiving money off-chain performs the due diligence of consulting k√n random nodes to check if any of them is aware of double-spending. Two nodes receiving double-spent money will in this way consult at least one common node with very high probability, due to the ‘birthday paradox’, and any common honest node consulted will detect the fraud. Since the velocity of money in the real world has coins circulating through at most a few wallets per day, the size of the due diligence communication is small in the short term. This `k-root-n’ algorithm is suitable for an environment with synchronous or asynchronous (but with fairly low latency) communication and with Byzantine faults. The presented k-root-n algorithm should be practical to avoid double-spending with arbitrarily high probability, while feasibly coping with the throughput of all world commerce. It is resistant to Sybil attacks even beyond 50% of nodes. In the long term, the k-root-n algorithm is less efficient. Therefore, it should preferably be used as a complement and not a replacement to a global distributed ledger technology.

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

Optimal planning and design of microgrids is a priority for electrification of off-grid areas. Indeed, according to one of the Sustainable Development Goals (SDG) 7, the UN recommends universal access to electricity for all but, at the lowest cost. To achieve this goal, several optimization methods with different strategies have been proposed in the literature. This paper proposes a microgrid installation and planning model based on a combination of several techniques. Python 3.10, the programming language, has been used in conjunction with machine learning techniques such as unsupervised learning based on K-means clustering and deterministic optimization methods based on mixed linear programming. These methods were complemented by the open-source spatial method for optimal electrification planning: onsset. The results obtained enabled us to simulate the model obtained, with a cluster considered as a case study, based on the elbow and k-means clustering method; then, in a second phase, to size the microgrid with a capacity of 40 kW, by optimizing all the resources available on the site: the example of the various resources in the case of Togo was considered (solar, wind, hydropower). This study therefore highlighted the optimal resources obtained by integrating battery systems by the optimization model formulated on the basis of the various technology costs, such as investment, maintenance and operating costs, based on the technical limits of the various technologies. For the optimum results obtained, solar systems account for 80% of the maximum load considered, compared with 7.5% for wind systems and 12.5% for battery systems. Next, an optimal microgrid connection model was proposed, based on the constraints of a voltage stability limit estimated at 10% of the maximum voltage drop. The substation capacity limit was also taken into account. The results obtained from the case studied enabled us again, to present selective results for load nodes in relation to the substation node. And finally, the spatial technology planning tool made it possible to obtain results on the different strategies for the various technologies required for the electrification planning study of the Togo case. The various results obtained from the different techniques provide the leads needed for a feasibility study for optimal electrification of off-grid areas, using microgrid systems.

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

Alternative fertilizations are essential to minimize the deteriorating effects of chemical fertilizers on soil and water quality/health. Accordingly, the present work investigated the effects of combined organic-inorganic fertilization (COIF) on wheat and rice yields, soil nutrients, and soil Cd accumulation. Hence, seven different treatments were set up: control (CK); conventional fertilization (CF); optimized fertilization (OF); organic fertilizer replacing 25% (T1) and 50% (T2) of OF; and organic nitrogen (N) replacing 25% (M1) and 50% (M2) of OF-N. Overall, significant increases occurred in the yields of COIF crops. Compared with the CF, the highest wheat and rice yields happened in M1 treatment (approximately by18.5%) (P < 0.05). COIF slightly alleviated soil acidification, and improved the cation exchange capacity (CEC) of the study soils. Besides, COIF treatments significantly increased the contents of total phosphorus, total potassium, available phosphorus, and available potassium by 6.35 to 16.9 %, 3.17 to 10.9 %, 5.53 to 28.7 %, and 2.6 to 12 %, respectively (P <0.05). Nevertheless, negligible increases took place in Cd content of COIF soils compared with the CK. Altogether, our results concluded on 25% replacement of OF-N by organic N (M1) to effectively improve the fertility/ecological sustainability of the study soils.

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

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

In this paper, the feasibility of automated and accurate in vivo measurements of vascular parameters continuously and non-invasively using ultrasound sensor is presented. Vascular parameters such as pulse wave velocity (PWV), blood pressure (BP), arterial compliance (AC) and stiffness index (SI) are affluent indicators of cardiovascular disorders and needs to be monitored non-invasively and continuously during surgeries and follow-up procedures. Cuff based or invasive catheter techniques are considered as gold standard to measure BP and are fed manually to compute AC and SI which employ imaging algorithms. In this context, a Continuous and Non-Invasive Vascular Stiffness and Arterial Compliance Screener (CaNVAS) is developed to measure said parameters continuously and non-invasively using ultrasound sensor. Acoustic waves of 5 MHz (2.2 – 10 MHz) are driven through target arterial walls, reflected echoes captured, pre-processed and frequency shift is used to calculate PWV. It is observed that PWV measured using CaNVAS varies exponentially with BP values obtained from sphygmomanometer (BPMR-120) and this relationship is used to compute instantaneous values of BP. The proposed device is validated by performing measurements on 250 subjects in pre and post exercise conditions and found to have 95% accuracy and an average of 12.5% coefficient of variation.

The problem of reliable function computation is extended by imposing privacy, secrecy, and storage constraints on a remote source whose noisy measurements are observed by multiple parties. The main additions to the classic function computation problem include 1) privacy leakage to an eavesdropper is measured with respect to the remote source rather than the transmitting terminals’ observed sequences; 2) the information leakage to a fusion center with respect to the remote source is considered as a new privacy leakage metric; 3) the function computed is allowed to be a distorted version of the target function, which allows to reduce the storage rate as compared to a reliable function computation scenario in addition to reducing secrecy and privacy leakages; 4) two transmitting node observations are used to compute a function. Inner and outer bounds on the rate regions are derived for lossless and lossy single-function computation with two transmitting nodes, which recover previous results in the literature. For special cases that include invertible and partially-invertible functions, and degraded measurement channels, exact lossless and lossy rate regions are characterized, and one exact region is evaluated for an example scenario.

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

Hydrogenated amorphous silicon (a-Si:H) can be produced by plasma-enhanced chemical vapour deposition (PECVD) of SiH4 (Silane) mixed with Hydrogen. The resulting material shows outstanding radiation resistance properties and can be deposited on a wide variety of different substrates. These devices have been used to detect many different kinds of radiation namely: MIPs, x-rays, neutrons and ions as well as low energy protons and alphas. However, MIP detection using planar diodes has always been difficult due to the unsatisfactory S/N ratio arising from a combination of high leakage current, high capacitance and a limited charge collection efficiency (50% at best for a 30 µm planar diode). To overcome these limitations the 3D-SiAm collaboration proposes to use a 3D detector geometry. The use of vertical electrodes allows for a small collection distance to be maintained while conserving a large detector thickness for charge generation. The depletion voltage in this configuration can be kept below 400 V with consequent reduction in the leakage current. In this paper, following a detailed description of the fabrication process, the results of the tests performed on the planar p-i-n structures made with ion implantation of the dopants and with carrier selective contacts will be illustrated.

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

In the paper, the authors generalize the notion "k-Mittag-Leffler function'', establish some integral transforms of the generalized k-Mittag-Leffler function, and derive several special and known conclusions in terms of the generalized Wright function and the generalized k-Wright function.

We propose two methods for obtaining estimations on the minimum distance and covering radius of orthogonal arrays. Both methods are based on knowledge about the (feasible) sets of distance distributions of orthogonal arrays with given length, cardinality, factors and strength. New bounds are presented either in analytic form and as products of an ongoing project for computation and investigation of the possible distance distributions of orthogonal arrays with parameters in doable ranges.

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

The assessment of Histone deacetylases in conjunction with Curcumin, conducted through the Mcule Database employing the Autodock Vina algorithm, involves an examination of molecular interactions. This analysis includes the calculation of binding energies, revealing the strength and stability of the interactions between Curcumin and various Histone deacetylase targets. The comparison encompasses diverse aspects such as binding energies, specific binding sites, interactions across different targets, structural details, and potential implications for biological activity. The results imply that Curcumin shows heightened affinity for Histone deacetylase 4 in comparison to other investigated histone deacetylases.

An increasing amount of electric energy is consumed by computers as they progress in function and capabilities. All of it is dissipated in heat during the computing and communicating operations and we reached the point that further developments are hindered by the unbearable amount of heat produced. In this paper we briefly review the fundamental limits in energy dissipation, as imposed by the laws of physics, with specific reference to computing and memory storage activities.

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

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

We prove that the Legendre coefficients associated with a function f(x) can be represented as the Fourier coefficients of a suitable Abel-type transform of the function itself. Thus, the computation of N Legendre coefficients can be performed efficiently in O(NlogN) operations by means of a single Fast Fourier Transform of the Abel-type transform of f(x). We also show how the symmetries associated with the Abel-type transform can be exploited to further reduce the computational complexity. The dual problem of calculating the sum of Legendre expansions is also considered. We prove that a Legendre series can be written as the Abel transform of a suitable Fourier series. This fact allows us to state an efficient algorithm for the evaluation of Legendre expansions. Finally, numerical tests are presented to exemplify and confirm the theoretical results.

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

The sustainability of ecotourism is the backbone of tourism development of a country. Ecotourism can contribute to both conservation and development in which involves dynamic relationship between tourism, biodiversity and communities, facilitate by great management. The purpose of this study is to analyze the dimensions of the socio-economic and environmental impacts of ecotourism in communities surrounding the Tasik Kenyir in Terengganu, Malaysia. This study provides a framework for the development and evaluation of ecotourism. The framework will determine if the relationships between indicators are positively correlated which will result in positive contribution to the other by using System Dynamic. Socio-cultural and economic data will be collected through interviews and group discussions in selected communities in Tasik Kenyir. Data on wildlife will be extracted from secondary data from Kenyir Research Institute, Universiti Malaysia Terengganu. The data analysis will explore the socio-cultural and economic differences between and within different communities due to ecotourism development, the contribution of ecotourism to conservation activities, local support for conservation and ecotourism as well as the influence of tourist activities on the distribution of wildlife species in Tasik Kenyir. This study aims to contribute toward understanding the natural resource community-ecotourism inter-relationship and help to bridge the knowledge gap that hinders biodiversity conservation initiatives. The findings will be used as a base for further development of ecotourism and will recommend alternative management options where necessary for the study area.

We propose a quantum version of the well known minimum distance classification model called "Nearest Mean Classifier" (NMC). In this regard, we presented our first results in two previous works. In [34] a quantum counterpart of the NMC for two-dimensional problems was introduced, named "Quantum Nearest Mean Classifier" (QNMC), together with a possible generalization to arbitrary dimensions. In [33] we studied the n-dimensional problem into detail and we showed a new encoding for arbitrary n-feature vectors into density operators. In the present paper, another promising encoding of n-dimensional patterns into density operators is considered, suggested by recent debates on quantum machine learning. Further, we observe a significant property concerning the non-invariance by feature rescaling of our quantum classifier. This fact, which represents a meaningful difference between the NMC and the respective quantum version, allows to introduce a free parameter whose variation provides, in some cases, better classification results for the QNMC. The experimental section is devoted to: i) compare the NMC and QNMC performance on different datasets; ii) study the effects of the non-invariance under uniform rescaling for the QNMC.

We review time expansion wave theory and refine our model showing it to accurately match observed cosmological luminosity data. The theory augments general relativity to create a container within which quantum effects can be explained by treating time as an artefact of a fourth spatial dimension that we observe as the expansion of the universe. This leads us to explain mass creation, the speed of light limit, gravity, black holes without singularities and other macroscopic effects. Our model leads to an expansion velocity of 6.87 0.36 × 106 ms-1, which results in a Hubble expansion rate constant of 71.3 3.7 km/s/Mpc. Because of the finite window of time in which we exist, an extra a degree of freedom is available leading to interesting interpretations at the subatomic level. At this size range, then a spin is allowed within the time dimension explaining why wave particle duality occurs and explains the electromagnetic force and other quantum mechanical properties. It provides a solution to the double slit conundrum and can explain how quantum entangled partners can behave in a quantum way and pass seemingly time-defying information. The potential quantitative origin of the fine structure constant which governs the size of the electromagnetic force is also strongly indicated by this theory.

Bone Scan Index (BSI) is an image biomarker for quantification on bone metastasis of cancers. To compute BSI, not only the hotspots (metastasis) but also the bones have to be segmented. Most related researches focus on binary classification on bone scintigraphy: having metastasis or none. Rare studies focus on pixelwise segmentation. In this study we compare three advanced convolutional neural network (CNN) based models to explore the bone segmentation on dataset in house. The best model is Mask R-CNN, which reaches the precision, sensitivity and F1-score: 0.93, 0.87, 0.90 for prostate cancer patients and 0.92, 0.86, 0.88 for breast cancer patients, respectively. The results are the average of 10-fold cross-validation, which reveals the reliability for clinical use on bone segmentation.

We communicate the theoretical results in the study of utilizing the quantum phenomena in optical current for quantum computation in the context of high precision voltage measurements. These results can be used around computation by quantum sampling and quantum communication as the basis for further research and physical implementations. We propose a Main Optical Setup (MOS) for such computation which allows to make a superstructure to implement specific computations and algorithms. To create MOS we used the nonlinear units (e.g., beta- barium borate crystal), arranged in series, powered with pulsed laser pump, and ended with the beam splitter to generate the output state of a number of entangled photon pairs. The computation is made by propagation of entanglement with beam splitters applied crossword and adjustable phase shifters that are tools for parameter steering. We show how to implement the series of cosine-based components on the example of two-component case. The results opens a broad area for future research in the area of building quantum optimizer using the quantum sampling methods and in the area of high precision temporal measurement of voltage, which is the important process for building high-fidelity devices.

This paper will explore analogs of groups formed by the transformations of two ropes as presented by Minh-Tam Quang Trinh.1 The two operations acting on these ropes are T and S, defined as twists and clockwise turns, respectively. These actions intertwine the ropes, creating tangles. T and S also have the ability to untangle the rope when used in certain combinations. In the two-rope case, these actions expressed as a group presentation were shown to be isomorphic to SL₂(Z). We explored the analog of these opera- tions, T and S, and conjectured the corresponding group to which they are isomorphic. Partial proofs for this conjecture are included and future work would include proving our conjecture as well as generalizing results to k ropes.

The authors previously found a model of universal quantum computation by making use of the coset structure of subgroups of a free group $G$ with relations. A valid subgroup $H$ of index $d$ in $G$ leads to a \lq magic' state $\left|\psi\right\rangle$ in $d$-dimensional Hilbert space that encodes a minimal informationally complete quantum measurement (or MIC), possibly carrying a finite \lq contextual' geometry. In the present work, we choose $G$ as the fundamental group $\pi_1(V)$ of an exotic $4$-manifold $V$, more precisely a \lq small exotic' (space-time) $R^4$ (that is homeomorphic and isometric, but not diffeomorphic to the Euclidean $\mathbb{R}^4$). Our selected example, due to to S. Akbulut and R.~E. Gompf, has two remarkable properties: (a) it shows the occurence of standard contextual geometries such as the Fano plane (at index $7$), Mermin's pentagram (at index $10$), the two-qubit commutation picture $GQ(2,2)$ (at index $15$) as well as the combinatorial Grassmannian Gr$(2,8)$ (at index $28$) , (b) it allows the interpretation of MICs measurements as arising from such exotic (space-time) $R^4$'s. Our new picture relating a topological quantum computing and exotic space-time is also intended to become an approach of \lq quantum gravity'.

Thrombosis is the pathological clot formation under abnormal hemodynamic conditions, which can result in vascular obstruction, causing ischemic strokes and myocardial infarction. Thrombus growth under moderate to low shear (<1000 s^-1) relies on platelet activation and coagulation. Thrombosis at elevated high shear rates (>10,000 s-1) is predominantly driven by unactivated platelet binding and aggregating mediated by von Willebrand factor (VWF), while platelet activation and coagulation are secondary in supporting and reinforcing the thrombus. Given the molecular and cellular level information it can access, multiscale computational modelling informed by biology can provide new pathphysiological mechanisms that are otherwise not accessible experimentally, holding promise for novel first-principle-based therapeutics. In this review, we summarize the key aspects of platelet biorheology and mechanobiology, focusing on the molecular and cellular scale events and how they build up to thrombosis through platelet adhesion and aggregation in the presence or absence of platelet activation. In particular, we highlight recent advancements in multiscale modeling of platelet biorheology and mechanobiology and how they can lead to better prediction and quantification of thrombus formation, exemplifying the exciting paradigm of digital medicine.

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

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

The KcsA is a prokaryotic potassium-oriented channel, which is sourced from the Streptomyces lividans soil bacteria. From extensive studies that have been carried over the KcsA potassium channel, it has been proved that various factors enable the gating and shuttling of the potassium ions into and out of the cells. Some of the factors include the different concentration of protons in the inside and outside membrane. The other factor is the existence of the selectivity filter equipped in the exit of channel pore, which enables the movement of the K⁺ ions. Not only are potassium ions present in the channel but also sodium ions. Potassium and sodium ions are the ions that are essential in the conductivity of a cell because of their charge. An intuitive idea about why K⁺ ions are at least 10,000 times more permeant than Na⁺ ions is presented in various entities. The hypothesis is that the selectivity ratio is probably related to the successive entry of Na⁺ ions, based on the premise that the ratio seems to be relevant to unpredictable quantities caused by Brownian corrosion of ions.

The excessive intake of sodium (Na) and insufficient intake of potassium (K) are major concerns to prevent hypertension. Using low-Na/K seasonings (reducing 25% of the NaCl and adding K salt) may improve the dietary Na/K ratio and help prevent hypertension. To devise an intervention study using low-Na/K seasonings at a company cafeteria, we calculated the Na and K contents of the meals served at the cafeteria and estimated changes in the intakes when suitable low-Na/K seasonings were used. We also considered using milk as a good source of K. We used an ingredient list of a company cafeteria and calculated Na and K contents in each dish. The average amounts of NaCl and K per use were 5.04 g and 718 mg, respectively. Seasonings contributed 70.9% of the NaCl. With the use of low-Na/K seasonings, an estimated reduction in NaCl of 0.8 g/day and an estimated increase in K of 308 mg/day was achieved. An additional serving (200 mL) of milk, NaCl was reduced by 0.57 g/day and K was increased by 610 mg/day, with an overall decrease in the dietary Na/K ratio from 3.20 to 2.40. The use of low-Na/K seasonings and dairy may improve the dietary Na/K ratio among cafeteria users and help prevent hypertension.

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

Abstract The aim of the present review is to discuss the roles of vitamin K and vitamin K-dependent proteins, and the combined action of the vitamins K and D, for maintenance of bone health. The most relevant vitamin K-dependent proteins in this respect are osteocalcin and matrix Gla-protein (MGP). When carboxylated these proteins appear to have the ability to chelate and import calcium from the blood to the bone, thereby reducing the risk of osteoporosis. Carboxylated osteocalcin appears to contribute directly to bone quality and strength. Adequate vitamin K status is required for carboxylation of MGP and osteocalcin. In addition, vitamin K acts on bone metabolism by other mechanism, such as a ligand for the nuclear steroid and xenobiotic receptor (SXR). In this narrative review, we examine the evidence for increased bone mineralization through dietary adequacy of vitamin K (phylloquinone or menaquinone). Summarizing the evidence for a synergistic effect of vitamin K and vitamin D3 we find that an adequate supply of vitamin K on top of an optimal vitamin D status seems to add to the benefit for maintaining bone health. More research related to synergism and possible mechanisms of vitamins D3 and K interaction in bone health is needed.

In pediatric burn care, achieving swift healing with minimal complications remains paramount. This investigation assesses polyhexamethylene biguanide (PHMB)'s role in managing superficial partial-thickness burns in children, focusing on the effects of various patient-specific factors on recovery. Through a retrospective analysis of 27 pediatric cases treated with PHMB, we explored the impact of age, burn size, dressing frequency, treatment delay, cold therapy application, and analgesic usage on the duration until reepithelialization. Notably, the majority of patients benefited from early cold therapy, yet only 1 in 3 patients received analgesics. The study reveals a mean healing time of 8.78 days, with the extent of the burn showing a strong correlation to recovery speed. Most treatments were managed outpatient, evidenced by a negligible average hospital stay. Impressively, the intervention recorded no complications. Our findings endorse PHMB as a promising treatment for second-degree burns in young patients, offering healing efficiency on par with or surpassing traditional methods, without increasing complication risks. This investigation underscores the necessity for continued exploration into the optimal application of prehospital interventions and the comprehensive benefits of PHMB in pediatric burn management, advocating for future research aimed at assessing long-term outcomes, including scar quality and patient satisfaction.

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

At the beginning of 2020, with the onset of the pandemic, the traditional learning environment for learners drastically changed globally. Since then, most students/teachers have started and practiced distance and virtual learning/teaching. Thus, a technological breakthrough in virtual learning has followed. In connection with this, many countries worldwide have commenced allocating additional financing and funds for educational institutions' technological improvement and development. The long-term stay in distance learning has revealed and highlighted new problems students face: their knowledge level has decreased, they lack socialization skills, and they face psychological and physical health problems. Due to this negative impact on students, a need to research and evaluate how much the EU countries allocated to solve the distance learning-caused problems and what programs or models they prepared has emerged and encouraged further studies. The research has found that many countries increased their allocations very minimally, e.g., 0.0.1%, but some increased their available budgets to 32%. Notably, most countries did not separate distance learning exit funding from distance learning preparation funding. Based on the problems the countries saw, only a few states identified withdrawal from distance learning as a problem. Considering this, we set ourselves the goal to evaluate exit models from distance learning and allocated funding amounts. The following objectives were planned to achieve the goal: · to evaluate the global practice of exit from distance learning; · to determine the scope of funding for pandemic management; · to evaluate the amounts of funding allocated to manage pandemic-caused consequences and the GDP ratio. Research methods: mathematical-statistical analysis, empirical analysis, and analysis of scientific literature.

Bonchev and Trinajstic defined two distance based entropy measures to measure the molecular branching of molecular graphs in 1977 [Information theory, distance matrix, and molecular branching, J. Chem. Phys., 38 (1977), 4517–4533]. In this paper we use these entropy measures which are based on distance matrices of graphs. The first one is based on distribution of distances in distance matrix and the second one is based on distribution of distances in upper triangular submatrix. We obtain the two entropy measures of paths, stars, complete graphs, cycles and complete bipartite graphs. Finally we obtain the minimal trees with respect to these entropy measures with fixed diameter.

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

From single-cell organisms to complex neural networks, all evolved to provide control solutions to generate context and goal-specific actions. Neural circuits performing sensorimotor computation to drive navigation employ inhibitory control as a gating mechanism, as they hierarchically transform (multi)sensory information into motor actions. Here, we focus on this literature to critically discuss the proposition that prominent inhibitory projections form sensorimotor circuits. After reviewing the neural circuits of navigation across various invertebrate species, we argue that with increased neural circuit complexity and the emergence of parallel computations inhibitory circuits acquire new functions. The contribution of inhibitory neurotransmission for navigation goes beyond shaping the communication that drives motor neurons, instead, include encoding of emergent sensorimotor representations. A mechanistic understanding of the neural circuits performing sensorimotor computations in invertebrates will unravel the minimum circuit requirements driving adaptive navigation.

The $k$-means problem is to compute a set of $k$ centers (points) that minimizes the sum of squared distances to a given set of $n$ points in a metric space. Arguably, the most common algorithm to solve it is $k$-means++ which is easy to implement, and provides a provably small approximation factor in time that is linear in $n$. We generalize $k$-means++ to support: (i) non-metric spaces and any pseudo-distance function. In particular, it supports M-estimators functions that handle outliers, e.g. where the distance $\mathrm{dist}(p,x)$ between a pair of points is replaced by $\min {\mathrm{dist}(p,x),1}$. (ii) $k$-means clustering with $m\geq 1$ outliers, i.e., where the $m$ farthest points from the $k$ centers are excluded from the total sum of distances. This is the first algorithm whose running time is linear in $n$ and polynomial in $k$ and $m$.

Nanoporous membranes promise energy-efficient water desalination. Hexagonal boron nitride (h-BN), like graphene, exhibits outstanding physical and chemical properties, making it a promising candidate for water treatment. We employed Car–Parrinello molecular dynamics simulations to establish accurate modeling of Na+ and Cl- permeation through hydrogen passivated nanopores in graphene and h-BN membranes. In these complex systems the classical potentials cannot properly account for the physics at play. We demonstrate that ion separation works well for the h-BN by imposing a barrier of 0.13 eV and 0.24 eV for Na+ and Cl- permeation respectively, compared to the graphene where the Cl- ion faces a negative barrier of 0.68 eV and is prone toward blockade and Na+ permeation is associated with a slightly negative barrier of 0.03 eV. From the change in the solvation shell, we get the following trend: Na/h-BN > Na/G > Cl/G > Cl/h-BN. We argue that the trend in the permeation barrier changes to Cl-h-BN > Na-h-BN > Na-G > Cl-G due to a combination of several interactions, including the distortion of the water network induced by the ions, the ion-water interaction, and the ion-nanopore interaction. Overall, the desalination performance of h-BN surpasses that of their graphene counterparts.

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

The management of urban water has evolved from single-function systems to more sustainable designs promoting society and nature as inputs to engineer novel infrastructure. In transdisciplinary research, co-design refers to a design thinking strategy in which people jointly frame a problem-solution. This article presents a conceptual framework to assess a case study focusing on the process of co-design and implementation of green infrastructure as a prototype for stormwater management. The evaluation is carried out from a self-reflective post-implementation perspective. Research activities are translated into the framework to evaluate conditions shaping the trajectory of the prototype. As a result, key aspects driving the research regarding levels of stakeholder participation and dimensions of power are identified. Planning resilient co-design strategies to retrofit urban spaces is necessary to avoid unintended consequences, especially at the initial experimental stages. This study aims to contribute to the continuous improvement of pilot strategies in urban spaces by providing a framework for a structured evaluation of research experiences.

Recent data suggest that K-Ras4B (hereafter K-Ras) can drive cancer cell stemness via calmodulin (CaM)-dependent, non-canonical Wnt-signalling. Here we examined whether another Ca2+-binding protein, the CaM-related centrin1, binds to K-Ras and could mediate some K-Ras functions that were previously ascribed to CaM. While CaM and centrin1 appear to distinguish between peptides that were derived from their classical targets, they both bind to K-Ras in cells. Cellular BRET-data suggest that CaM engages more with K-Ras than centrin1 and that the interaction with the C-terminal membrane anchor of K-Ras is sufficient for this. Surprisingly, binding of neither K-Ras nor its membrane anchor alone to CaM or centrin1 is sensitive to inhibition of prenylation. In support of an involvement of the G-domain of K-Ras in cellular complexes with these Ca2+-binding proteins, we find that oncogenic K-RasG12V displays increased engagement with both CaM and centrin1. This is abrogated by addition of the D38A effector-site mutation, suggesting that K-RasG12V is held together with CaM or centrin1 in complexes with effectors. When treated with CaM-inhibitors the BRET-interaction of K-RasG12V with centrin1 was also disrupted in the low micromolar range, comparable to that with CaM. While CaM predominates in regulating functional membrane anchorage of K-Ras, it has a very similar co-distribution with centrin1 on mitotic organelles. Given these results, a significant overlap of the CaM- and centrin1-dependent functions of K-Ras is suggested.

Let G[F,Vk, Huv] be the graph with k pockets, where F is a simple graph of order n ≥ 1,Vk= {v1,v2,··· ,vk} is a subset of the vertex set of F and Hvis a simple graph of order m ≥ 2,v is a specified vertex of Hv. Also let G[F,Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek= {e1,e2,···ek} is a subset of the edge set of F and Huvis a simple graph of order m ≥ 3, uv is a specified edge of Huvsuch that Huv− u is isomorphic to Huv− v. In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of G[F,Vk, Hv] and G[F,Ek, Huv] in terms of the resistance distance and Kirchhoff index F, Hv and F, Huv, respectively.

The paper describes a new formula for calculating the mutual inductance between a thin conical sheet inductor and a filamentary circular loop, which are coaxial. The presented formula is derived semi-analytically using the complete elliptic integrals of the first, second, and the third kind, along with the integral term which will be solved numerically. The results are validated using double and single integration methods, as well as the semi-analytical formula. The mutual inductance between a thin wall solenoid and a filamentary circular loop can be obtained using the new formula for the conical coil and circular loop. Presented formulas can be useful in various applications, such as broadband RF and wireless power transfer systems that utilize conical inductors. Overall, the paper presents a valuable contribution to the field of inductor design and can be useful in various applications involving conical inductors.

One of the most reliable methods of authentication used today is biometric matching. This authentication process, which is done by using biometrics information such as fingerprint, iris, face, etc. is used in many application areas. Authentication at border gates is one of these areas. However, some restrictions have been introduced to storing and using such data, especially with the General Data Protection Regulation (GDPR). The main goal of this work is to find the practical implementation of fully homomorphic encryption-based biometric matching in border controls. In this paper, we propose a biometric authentication system based on hash expansion and fully homomorphic encryption features, considering these restrictions. One of the most significant drawbacks of the homomorphic encryption method is the long execution time. We solved this problem by executing the matching algorithm in parallel manner. The proposed scheme is implemented as proof-of-concept in the SMILE, and its advantages in privacy preservation has been demonstrated.

A parallel shallow water flow model is introduced in this paper. The explicit-time finite volume approach is adopted to solve the 2D shallow water equations on an unstructured triangular mesh. The proposed scheme is second-order accurate in temporal and spatial terms using the two-stage Runge-Kutta and the monotone upwind scheme for conservation law (MUSCL) methods, respectively. Based on Message Passing Interface (MPI) and OpenACC, a multi-GPU model is presented with the METIS library to produce the domain decomposition. A CUDA-aware MPI library through GPUDirect for peer-to-peer (P2P) transfer between two GPUs and overlapping computation and MPI communication are used to speed up MPI memory exchange and the performance of the code. A 2D circular dam break test with wet and dry downstream beds and grid resolutions of about 2 million cells is considered to verify the accuracy of the code, and good results were achieved compared to the numerical simulations of published studies. Compared with the multi-CPU version of the 6-core CPU, maximum speedups of 56.18 and 331.51 were obtained using the single-GPU and multi-GPU versions, respectively. Results indicate that acceleration performance improves as the mesh resolution increases.

Most neuromorphic technologies use a point-neuron model, missing the spatiotemporal nature of neuronal computation performed in dendrites. Dendritic morphology and synaptic organization are structurally tailored for spatiotemporal information processing, enabling various computations like visual perception. Here, we report on a neuromorphic computational model termed ‘dendristor’, which integrates functional synaptic organization with dendritic tree-like morphology computation. The dendristor presents bioplausible nonlinear integration of excitatory and inhibitory synaptic inputs with silent synapses and diverse spatial distribution dependency. We show that the dendristor can emulate direction selectivity, which is the feature to react robustly to a preferred signal direction on the dendrite. We discover that silent synapses can remarkably enhance direction selectivity, turning out to be a crucial player in dendritic computation processing. Finally, we develop neuromorphic dendritic neural circuits that can emulate a cognitive function such as motion perception in the retina. Using dendritic morphology, we achieve visual perception of motion in 3D space by various mapping of spatial information on different dendritic branches. This neuromorphic dendritic computation innovates beyond current neuromorphic computation and provides solutions to explore new skylines in artificial intelligence, neurocomputation, and brain-inspired computing.

Drug design is used for different applications of bioinformatics tools analyze DNA, genome, and sequence target region of a small organic molecule in order to understand the molecules of disease. Bioinformatics tools are identified a newly wide research field and minimize future risks through web servers and data mining. Clinical sample test performed with the bioinformatics tools as the biomedical detective. A particular structure and configuration of protein obliging in Drug design concluded Bioinformatics. This review bioinformatics tools and webserver will discuss functions of small organic molecules according to clinical pharmacology.

Nearest-neighbour clustering is a simple yet powerful machine learning algorithm that finds natural application in the decoding of signals in classical optical-fibre communication systems. Quantum k-means clustering promises a speed-up over the classical k-means algorithm; however, it has been shown to currently not provide this speed-up for decoding optical-fibre signals due to the embedding of classical data, which introduces inaccuracies and slowdowns. Although still not achieving an exponential speed-up for NISQ implementations, this work proposes the generalised inverse stereographic projection as an improved embedding into the Bloch sphere for quantum distance estimation in k-nearest-neighbour clustering, which allows us to get closer to the classical performance. We also use the generalised inverse stereographic projection to develop an analogous classical clustering algorithm and benchmark its accuracy, runtime and convergence for decoding real-world experimental optical-fibre communication data. This proposed `quantum-inspired' algorithm provides an improvement in both the accuracy and convergence rate with respect to the k-means algorithm. Hence, this work presents two main contributions. Firstly, we propose the general inverse stereographic projection into the Bloch sphere as a better embedding for quantum machine learning algorithms; here, we use the problem of clustering quadrature amplitude modulated optical-fibre signals as an example. Secondly, as a purely classical contribution inspired by the first contribution, we propose and benchmark the use of the general inverse stereographic projection and spherical centroid for clustering optical-fibre signals, showing that optimizing the radius yields a consistent improvement in accuracy and convergence rate.

Vitamin K occupies a unique and often obscured place among its fellow fat-soluble vitamins. Evidence is mounting however, that vitamin K (VK) may play an important role in the visual system apart from the hepatic carboxylation of hemostatic related proteins. However, to our knowledge, no review covering the topic has appeared in the medical literature. Recent studies have confirmed that matrix Gla protein (MGP), a vitamin K-dependent protein (VKDP), is essential for the regulation of intraocular pressure in the mouse. The PREDIMED (Prevención con Dieta Mediterránea) study, a randomized trial involving 5860 adults at risk for cardiovascular disease, demonstrated a 29% reduction in the risk of cataract surgery in participants with the highest tertile of dietary vitamin K1 (PK) intake compared with the lowest tertile. However, the specific requirements of the eye and visual system (EVS) for VK, and what might constitute an optimized VK status, is currently unknown and largely unexplored. It is the intention therefore of this narrative review to provide an introduction concerning VK and the visual system, review ocular VK biology, and to provide some historical context to recent discoveries. Potential opportunities and gaps in current research efforts will be touched upon, in the hope of raising awareness, and encouraging continued VK related investigations in this important and highly specialized sensory system.

Clustering, or otherwise known as cluster analysis, is a learning problem that takes place without any human supervision. This technique has often been utilized, much efficiently, in data analysis, and serves for observing and identifying interesting, useful, or desired patterns in the said data. The clustering technique functions by performing a structured division of the data involved, in similar objects based on the characteristics that it identifies. This process results in the formation of groups, and each group that is formed, is called a cluster. A single said cluster consists of objects from the data, that have similarities among other objects found in the same cluster, and resemble differences when compared to objects identified from the data that now exist in other clusters. The process of clustering is very significant in various aspects of data analysis, as it determines and presents the intrinsic grouping of objects present in the data, based on their attributes, in a batch of unlabeled raw data. A textbook or otherwise said, good criteria, does not exist in this method of cluster analysis. That is because this process is so different and so customizable for every user, that needs it in his/her various and different needs. There is no outright best clustering algorithm, as it massively depends on the user’s scenario and needs. This paper is intended to compare and study two different clustering algorithms. The algorithms under investigation are k-mean and mean shift. These algorithms are compared according to the following factors: time complexity, training, prediction performance and accuracy of the clustering algorithms.

In the particular configuration of the scalar field K-essence in the Wheeler-DeWitt quantum equation, for some age in the Bianchi type I anisotropic cosmological model, a fractional differential equation for the scalar field arises naturally. The order of the fractional differential equation is $\beta=\frac{2\alpha}{2\alpha - 1}$. This fractional equation belongs to different intervals, depending on the value of the barotropic parameter; when $\omega_{X} \in [0,1]$, the order belongs to the interval $1\leq \beta \leq 2$, and when $\omega_{X}\in[-1,0)$, the order belongs to the interval $0<\beta \leq 1$. In the quantum scheme, we introduce the factor ordering problem in the variables $(\Omega,\phi)$ and its corresponding momenta $(\Pi_\Omega, \Pi_\phi)$, obtaining a linear fractional differential equation with variable coefficients in the scalar field equation, then the solution is found using a fractional power series expansion. The corresponding quantum solutions are also given. We found the classical solution in the usual gauge N obtained in the Hamiltonian formalism and without a gauge. In the last case, the general solution is presented in a transformed time $T(\tau)$, however in the dust era we found a closed solution in the gauge time $\tau$.

The main objective of this paper is to introduce k-fractional derivative operator by using the definition of k-beta function. We establish some results related to the newly defined fractional operator such as Mellin transform and relations to k-hypergeometric and k-Appell's functions. Also, we investigate the k-fractional derivative of k-Mittag-Leffler and Wright hypergeometric functions.

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

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

This study aims to unravel the paradox of perceptions and knowledge of the flood victims towards the causes of the disaster in both internal and external context. Internal context comprises of a comparison of perceptions and knowledge based on individual characteristics (age, gender, education and income). Whereas, the external context includes the factors of the awareness of the victims towards the amount of rainfall, the impact of land use changes as well as the negligence of the responsible parties. The main objective of this study is to determine the differences of perception and knowledge of December 2014 flood victims in Kelantan towards the factors that lead to the flood. This disaster had resulted in huge amount of money loss as well as traumatize the victims in which can be felt to this day. Since that incident, there were various points of view and different perceptions in finding the cause of the disaster occurred. Besides that, the study found that the level of perception and knowledge as to the cause of the disaster is different in the internal context (individual characteristics). This difference has a significant influence on the awareness of the causes of the floods that occurred in the external context. Significant relationships at the level of p <0.05 has existed between perception and knowledge of the causes of the disaster victims affected by environmental changes in the last 10 years. This indicates that although the victim is aware of the physical environment changes happening around them, but all that is seen as not a major contributing factor to the cause of the floods in Kelantan in 2014.

This study explores the dependence of drone acoustic detection systems performance on distance, using learning machines with different complexities, from simple linear discriminants, to deep neural networks, such as YAMNet, which exploits transfer learning. Other machine learning systems studied are the multilayer perceptron, support vector machines and random forest. These methods have been evaluated with a meticulously selected database that includes a wide variety of drone and interference sounds, previously processed by array signal processing and affected by ambient noise. Two strategies for training learning machines are considered. In the first one, they are trained with unattenuated signals, trying to preserve the information generated by the sound sources, but they are tested considering the attenuation with distance, achieving effective detection at distances up to 200 metres with some methods, especially linear discriminant. In all cases, the existence of interferences that hinder detection is considered. In the second strategy, the systems are trained and tested with attenuated signals as a function of distance. The effective detection range increases up to 300 metres for most methods and up to 500 metres for the YAMNet based detector. In addition, this second approach raises the possibility of developing specialised detectors for each distance range, thus significantly extending the effective detection range. These results underline the promising potential of acoustic detection of drones at various distances, encouraging further exploration in this research area.

This study aims to identify benefits and barriers to distance education, particularly from the perspective of teachers in Saudi Arabia. As the applied data collection tool, a questionnaire was distributed to the general education teachers in three districts. The sample size of the study was 1076 teachers. The results revealed that despite several benefits gained from distance learning, there are also some barriers. Teachers found that the most important advantage in distance learning is the acquisition of technical skills during the online teaching processes, they learn more and use digital education platforms, they have sufficient time to prepare the scientific content, they were able to provide adequate technical solutions for their courses, and they have the opportunity to use multiple media to deliver their courses. With the introduction of distance learning, teachers have explored new ways to deliver course contents to students. It has fostered better ways to provide more interactive real-time and on-demand teaching and learning using modern technology, thus, helping teachers become familiar with the use of electronic resources. It seems that teachers invest in technical methods to enhance students’ performance. Also, teachers reported some obstacles that they face during remote teaching. Most of these problems are connection problems applied with devices and the internet, lack of students’ motivation to learn in distance, problems associated with urban learners.

Human number understanding is thought to rely on the analogue number system (ANS), working according to Weber’s law. We propose an alternative account, suggesting that symbolic mathematical knowledge is based on a discrete semantic system (DSS), a representation that stores values in a semantic network, similar to the mental lexicon or to a conceptual network. Here, focusing on the phenomena of numerical distance and size effects in comparison tasks, first we discuss how a DSS model could explain these numerical effects. Second, we demonstrate that DSS model can give quantitatively as appropriate a description of the effects as the ANS model. Finally, we show that symbolic numerical size effect is mainly influenced by the frequency of the symbols, and not by the ratios of their values. This last result suggests that numerical distance and size effects cannot be caused by the ANS, while the DSS model might be the alternative approach that can explain the frequency-based size effect.

The Mann-Whitney effect is a measure for comparing survival distributions between two groups. The Mann-Whitney effect is interpreted as the probability that a randomly selected subject in a group survives longer than a randomly selected subject in the other group. Under the independence assumption of two groups, the Mann-Whitney effect can be expressed as the traditional integral formula of survival functions. However, when the survival times in two groups are not independent each other, the traditional expression of the Mann-Whitney effect has to be modified. In this article, we propose a copula-based approach to compute the Mann-Witney effect with parametric survival models under dependence of two groups, which may arise in the potential outcome framework. In addition, we develop a Shiny web app that can implement the proposed method via simple commands (https://nkosuke.shinyapps.io/shiny_survival/). Through a simulation study, we show the correctness of the proposed calculator. We apply the proposed methods to two real datasets.

In this paper, we show that the entropy or information flow of a gravitational system constrains the dependence of gravitational force on radial distance r which for very large r is equivalent to gravity in two dimensions. This proposal solves the problem of flat rotation curves of galaxies at very large distances.

The visualization of hyperspectral images in display devices, having RGB colour composition channels is quite difficult due to the high dimensionality of these images. Thus, principal component analysis has been used as a dimensionality reduction algorithm to reduce information loss, by creating uncorrelated features. To classify regions in the hyperspectral images, K-means clustering has been used to form clusters/regions. These two algorithms have been implemented on the three datasets imaged by AVIRIS and ROSIS sensors.

Concept Knowledge (C-K) theory has been used in engineering and science-based research for more than a decade. Design of an Information Technology (IT) artefact is mostly pragmatic in nature. Design Science Research (DSR) methodology applied and studied in many Information Systems (IS) research. Many sub design decisions involved through the design of an IT artefact from a concept (idea) to a working prototype. A DSR artefact is based on a combination of decisions made during several sub-design stages. Artefacts are built based on the selection of elements in each sub-design space. Recording the design decisions on each sub-design space would be beneficial for future researchers. By knowing the design decisions on each sub-design space, researchers would be able to try different combinations of the design. C-K theory provides the ability to capture the design processes’ several sub-design spaces. In this paper, we discuss the DSR research methodology by looking at the stages proposed in the literature, and the application of C-K theory in an IT-based DSR. This paper also proposed a C-K theory-based protocol called Concept Tree for tracking and reporting artefact design steps. The application of C-K theory in DSR is exhibited using the implementation of the Concept Tree for a prototype design IT artefact.

In this paper, some convexity properties and some inequalities for the (p,k)-analogue of the Gamma function, Г_p,k(x) are given. In particular, a (p,k)-analogue of the celebrated Bohr-Mollerup theorem is given. Furthermore, a (p,k)-analogue of the Riemann zeta function, ζ_p,k(x) is introduced and some associated inequalities are derived. The established results provide the (p,k)-generalizations of some known results concerning the classical Gamma function.

The partial information decomposition (PID) framework is concerned with decomposing the information that a set of random variables has with respect to a target variable into three types of components: redundant, synergistic, and unique. Classical information theory alone does not provide a unique way to decompose information in this manner and additional assumptions have to be made. Inspired by Kolchinsky's recent proposal for measures of intersection information, we introduce three new measures based on well-known partial orders between communication channels and study some of their properties.

Epithelial-mesenchymal transition (EMT) is a cellular biological process involved in migration of primary cancer cells to secondary sites facilitating metastasis. Besides, EMT also confers properties such as stemness, drug resistance and immune evasion which can aid a successful colonization at the distant site. EMT is not a binary process; recent evidence suggests that cells in partial EMT or hybrid E/M phenotype(s) can have enhanced stemness and drug resistance as compared to those undergoing a complete EMT. Moreover, partial EMT enables collective migration of cells as clusters of circulating tumor cells or emboli, further endorsing that cells in hybrid E/M phenotypes may be the ‘fittest’ for metastasis. Here, we review mechanisms and implications of hybrid E/M phenotypes, including their reported association with hypoxia. Hypoxia-driven activation of HIF-1α can drive EMT. In addition, cyclic hypoxia, as compared to acute or chronic hypoxia, shows the highest levels of active HIF-1α and can augment cancer aggressiveness to a greater extent, including enriching for a partial EMT phenotype. We also discuss how metastasis is influenced by hypoxia, partial EMT and collective cell migration, and call for a better understanding of interconnections among these mechanisms. We discuss the known regulators of hypoxia, hybrid EMT and collective cell migration and highlight the gaps which needs to be filled for connecting these three axes which will increase our understanding of dynamics of metastasis and help control it more effectively.

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

Partial sums of analytic univalent functions and partial sums of starlike have been investigated extensively by several researchers. In this paper, we investigate a partial sums of convex harmonic functions that are univalent and sense preserving in the open unit disk.

In this work the existence and nonexistence of stationary radial solutions to the elliptic partial differential equation arising in the molecular beam epitaxy are studied. Since we are interested in radial solutions we arrive at the following fourth-order differential equation

The current study aims to produce a material that has a dual effect of healing and anti-inflammatory. For this target k-carrageenan/polyacrylamide hydrogel film loaded with cetrimide (k-CAR/PAAm/CI) was performed by manual casting technique. Definite concentrations of k-CAR and AAm was heated at 80°C for 2 hours, CI and glycerol were added. The solution was cast without using initiator and cross-linker. The reaction of the sulfonic acid group -SO3H of k-CAR with -CONH2 group of PAAm lead to the formation of a sulfonamide (-SO2NH-) linkage. The characteristics of the produced films were investigated by FTIR, TGA, contact angle, and mechanical properties. Improvement in the thermal stability was performed in k-CAR/PAAm/CI2 film containing 1.5% CI compared to the film has 0.5% CI (k-CAR/PAAm/CI1). The contact angle measurement proved the films are hydrophobic that enhanced by increasing CI content. The tensile strength and elongation percent values are considered adequate for materials used in wound care. k-CAR/PAAm/CI2 (1.5% CI) film showed superior antimicrobial activity against P. aeruginosa, moderate activity against S. aureus, and low activity against E. coli. The film k-CAR/PAAm/CI2 was effectively inhibiting the heat-induced hemolysis and may offer a promising approach for the development of effective wound dressings.

Background: Mental health has a special relevance in adolescence. Therefore, this study aimed to analyze the possible association between emotional distress and suicidal ideation among adolescents. Methods: The article presents the results of a survey of secondary school students (N=1419) in the city of Tarragona, Spain. The aim of the analysis was to verify the existence of an association between suicidal ideation and risk factors such as emotional distress and low self-esteem. All the data were also analysed to determine the existence of statistically significant differences between girls and boys. Bivariate analyses were performed with chi-square, point-biserial coefficient and non-parametric tests for independent groups. Logistic regression analysis was also performed to calculate the probability of suicidal ideation. Results: These analyses showed that both emotional distress and low self-esteem increase the likelihood of suicidal ideation among adolescents. This was more evident among boys with high levels of emotional distress. Conclusion: Schools should develop suicide ideation prevention programs for adolescents based on situations that cause emotional distress.

For public safety and physical security, currently more than a billion closed-circuit television (CCTV) cameras are deployed around the world. Proliferation of artificial intelligence (AI) and machine learning (ML) technologies has gained significant applications including crowd surveillance. The state-of-the-art distance and area estimation algorithms either need multiple cameras or a reference scale as a ground truth. It is an open question to obtain an estimation using a single camera without a scale reference. In this paper, we propose a novel solution called E-SEC, which estimates interpersonal distance between a pair of dynamic human objects, area occupied by a dynamic crowd, and density using a single edge camera. The E-SEC framework comprises edge CCTV cameras responsible for capture a crowd on video frames leveraging a customized YOLOv3 model for human detection. E-SEC contributes an interpersonal distance estimation algorithm vital for monitoring the social distancing of a crowd, and an area estimation algorithm for dynamically determining an area occupied by a crowd with changing size and position. A unified output module generates the crowd size, interpersonal distances, social distancing violations, area, and density per every frame. Experimental results validate the accuracy and efficiency of E-SEC with a range of different video datasets.