Search

Optical tomography has a wide range of biomedical applications. Accurate prediction of photon transport in media is critical, as it directly affects the accuracy of the reconstructions. The radiative transfer equation (RTE) is the most accurate deterministic forward model, yet it has not been widely employed in practice due to the challenges in robust and efficient numerical implementations in high dimensions. Herein, we propose a method that combines the discrete ordinate method (DOM) with a streamline diffusion modified continuous Galerkin method to numerically solve RTE. Additionally, a phase function normalization technique was employed to dramatically reduce the instability of the DOM with fewer discrete angular points. To illustrate the accuracy and robustness of our method, the computed solutions to RTE were compared with Monte Carlo (MC) simulations when two types of sources (ideal pencil beam and Gaussian beam) and multiple optical properties were tested. Results show that with standard optical properties of human tissue, photon densities obtained using RTE are, on average, around 5% of those predicted by MC simulations in the entire/deeper region. These results suggest that this implementation of the finite element method-RTE is an accurate forward model for optical tomography in human tissues.

Distributed Systems architectures are becoming the standard computational model for processing and transportation of information, especially for Cloud Computing environments. The increase in demand for application processing and data management from enterprise and end-user workloads continues to move from a single-node client-server architecture to a distributed multitier design where data processing and transmission are segregated. Software development must considerer the orchestration required to provision its core components in order to deploy the services efficiently in many independent, loosely coupled—physically and virtually interconnected—data centers spread geographically, across the globe. This network routing challenge can be modeled as a variation of the Travelling Salesman Problem (TSP). This paper proposes a new optimization algorithm for optimum route selection using Algorithmic Information Theory. The Kelly criterion for a Shannon-Bernoulli process is used to generate a reliable quantitative algorithm to find a near optimal solution tour. The algorithm is then verified by comparing the results with benchmark heuristic solutions in 3 test cases. A statistical analysis is designed to measure the significance of the results between the algorithms and the entropy function can be derived from the distribution. The tested results shown an improvement in the solution quality by producing routes with smaller length and time requirements. The quality of the results proves the flexibility of the proposed algorithm for problems with different complexities without relying in nature-inspired models such as Genetic Algorithms, Ant Colony, Cross Entropy, Neural Networks, 2opt and Simulated Annealing. The proposed algorithm can be used by applications to deploy services across large cluster of nodes by making better decision in the route design. The findings in this paper unifies critical areas in Computer Science, Mathematics and Statistics that many researchers have not explored and provided a new interpretation that advances the understanding of the role of entropy in decision problems encoded in Turing Machines.

An effective traffic control strategy will improve travel reliability in urban transportation networks. Lack of coordination between vehicles, however, exacerbates congestion due mainly to frequent stops at unsignalized intersections. It is beneficial to develop a conflict-free cooperation method that collects basic safety message from multiple approaching Connected and Autonomous Vehicles (for short, CAVs) and guarantees efficient unsignalized intersection operations with safe and incident free vehicle maneuvers. This paper proposes an interspersed traffic organization method under controlled constraints. Firstly, relied on shared location technology and considered the operating characteristics of CAVs at unsignalized intersections to detect and analyze traffic conflicts to establish a right-of-way judgment model for CAVs. In order to further ensure the safety and operating efficiency of the vehicle, based on the judgment results of right-of-way judgment model, a vehicle speed guidance model is established for different traffic conditions. Taking the real city standard intersection as the experimental analysis object, through data collection and simulation experiment, the signal control method and the organization method proposed in this paper are compared and analyzed. The results showed that the traffic organization method proposed in this paper improves the operational efficiency of 46%, the average travel time is reduced by 6.54s, which is not only better than the signal control method, but also supports the development of car networking technology.

Protein-DNA interactions play a fundamental role in all life systems. A critical issue of such interactions is given by the strategy of protein search for specific targets on DNA. The mechanisms by which the protein are able to find relatively small cognate sequences, typically 15-20 base pairs (bps) for repressors, and 4-6 bps for restriction enzymes among the millions of bp of non-specific chromosomal DNA have hardly engaged researcher for decades. Recent experimental studies have generated new insights on the basic processes of protein-DNA interactions evidencing the underlying complex dynamic phenomena involved, which combine three-dimensional and one-dimensional motion along the DNA chain. It has been demonstrated that protein molecules spend most of search time on the DNA chain with an extraordinary ability to find the target very quickly, in some cases, with two orders of magnitude faster than the diffusion limit. This unique property of protein-DNA search mechanism is known asfacilitated diffusion. Several theoretical mechanisms have been suggested to describe the origin of facilitated diffusion. However, none of such models currently has the ability to fully describe the protein search strategy.In this paper, we suggest that the ability of proteins to identify consensus sequence on DNA is based on the entanglement of π-π electrons between DNA nucleotides and protein amino acids. The π-π entanglement is based on Quantum Walk (QW), through Coin-position entanglement (CPE). First, the protein identifies a dimer belonging to the consensus sequence, and localize a π on such dimer, hence, the other π electron scans the DNA chain until the sequence is identified. By focusing on the example of recognition of consensus sequences by EcoRV or EcoRI, we will describe the quantum features of QW on protein-DNA complexes during search strategy, such as walker quadratic spreading on a coherent superposition of different vertices and environment-supported long-time survival probability of the walker. We will employ both discrete- or continuous-time versions of QW. Biased and unbiased classical Random Walk (CRW) has been used for a long time to describe Protein-DNA search strategy. QW, the quantum version of CRW, have been widely studied for its applications in quantum information applications. In our biological application, the walker (the protein) resides at a vertex in a graph (the DNA structural topology). Differently to CRW, where the walker moves randomly, the quantum walker can hop along the edges in the graph to reach other vertices entering coherently a superposition across different vertices spreading quadratically faster than CRW analogous evidencing the typical speed up features of the QW. When applied to protein-DNA target search problem, QW gives the possibility to achieve the experimental diffusional motion of proteins over diffusion classical limits experienced along DNA chains exploiting quantum features such as CPE and long-time survival probability supported by environment. In turn, we come to the conclusion that, under quantum picture, the protein search strategy does not distinguish between one-dimensional (1D) and three-dimensional (3D) case.SignificanceMost biological processes are associated to specific protein molecules binding to specific target sequences of DNA. Experiments have revealed a paradoxical phenomenon that can be synthesized as follows: proteins generally diffuse on DNA very slowly, but they can find targets very fast overwhelming two orders of magnitude faster than the diffusion limit. This paradox is known asfacilitated diffusion. In this paper, we demonstrate that the paradox is solved by invoking the quantum walk picture for protein search strategy. This because the protein exploits quantum properties, such as long-time survival probability due to coherence shield induced by environment and coin-position entanglement to identify consensus sequence, in searching strategy. To our knowledge, this is the first application of quantum walk to the problem of protein-DNA target search strategy.

In this paper, a novel multiscale method is proposed for the study of heterogeneous tumor spheroid growth in vitro. The entire tumor spheroid is described by an ellipsoid-based model while nutrient and other environmental factors are treated as continua. The ellipsoid-based discrete component is capable of incorporating mechanical effects and deformability, while keeping a minimum set of free variables to describe complex shape variations. Moreover, our purely cell-based description of tumor avoids the complex mutual conversion between a cell-based model and continuum model within a tumor, such as force and mass transformation. This advantage makes it highly suitable for the study of tumor spheroids in vitro whose size are normally less than 800 μm in diameter. In addition, our numerical scheme provides two computational options depending on tumor size. For a small or medium tumor spheroid, a three-dimensional (3D) numerical model can be directly applied. For a large spheroid, we suggest the use of a 3D-adapted 2D cross section configuration, which has not yet been explored in the literature, as an alternative for the theoretical investigation to bridge the gap between the 2D and 3D models. Our model and its implementations have been validated and applied to various studies given in the paper. The simulation results fit corresponding in vitro experimental observations very well.

In this paper, a novel 3D roaming algorithm considering collision detection and interaction is proposed that adopts a triangle mesh to organize and manage massive spatial data and uses a customized bounding box intersector to rapidly obtain the potential collided triangles. The proposed algorithm can satisfy the requirements of timeliness and practicability during complicated large 3D scene collision detection. Moreover, we designed a method to calculate the collision point coordinates according to the spatial position relation and distance change between the virtual collision detection sphere and triangles, with the triangle edges and three vertices being considered. Compared to the methods that use the native intersector of OpenSceneGraph (OSG) to obtain the collision point coordinates, the calculation efficiency of the proposed method is greatly improved. Usually, when there is a big split/pit in the scene, the viewpoints will fly off the scene due to the fall of the collision detection sphere, or the region interior cannot be accessed when the entrance of some local region (e.g., internal grotto) of the scene is too small. These problems are solved in this paper through 3D scene-path training and by self-adaptively adjusting the radius of the virtual collision detection sphere. The proposed 3D roaming and collision detection method applicable for massive spatial data overcomes the limitation that the existing roaming and collision detection methods are only applicable to 3D scenes with a small amount of data and simple models. It provides technical supports for freewill browsing and roaming of indoor/outdoor and overground/underground of the 3D scene in cases of massive spatial data.

Radio propagation prediction simulation methods based on deterministic technique such as ray launching is extensively used to accomplish radio channel characterization. However, the superiority of the simulation depends on the number of rays launched and received. This paper presented the indoor three-dimensional (3D) Minimum Ray Launching Maximum Accuracy (MRLMA) technique, which is applicable for an efficient indoor radio wave propagation prediction. Utilizing the novel MRLMA technique in the simulation environment for ray lunching and tracing can drastically reduce the number of rays that need to be traced, and improve the efficiency of ray tracing. Implementation and justification of MRLMA presented in the paper. An indoor office 3D layouts are selected and simulations have been performed using the MRLMA and other reference techniques. Results showed that the indoor 3D MRLMA model is appropriate for wireless communications network systems design and optimization process with respect to efficiency, coverage, number of rays launching, number of rays received by the mobile station, and simulation time.

This paper introduces an optimal sizing algorithm for a hybrid renewable energy system using smart grid load management application based on the available generation. This algorithm aims to maximize the system energy production and meet the load demand with minimum cost and highest reliability. This system is formed by photovoltaic array, wind turbines, storage batteries, and diesel generator as a backup source of energy. Demand profile shaping as one of the smart grid applications is introduced in this paper using load shifting-based load priority. Particle swarm optimization is used in this algorithm to determine the optimum size of the system components. The results obtained from this algorithm are compared with those from the iterative optimization technique to assess the adequacy of the proposed algorithm. The study in this paper is performed in some of the remote areas in Saudi Arabia and can be expanded to any similar regions around the world. Numerous valuable results are extracted from this study that could help researchers and decision makers.

For high-dimensional and massive data sets, traditional centralized gene expression programming (GEP) or improved algorithms lead to increased run-time and decreased prediction accuracy. To solve this problem, this paper proposes a new improved algorithm called distributed function mining for gene expression programming based on fast reduction (DFMGEP-FR). In DFMGEP-FR, fast attribution reduction in binary search algorithms (FAR-BSA) is proposed to quickly find the optimal attribution set, and the function consistency replacement algorithm is given to solve integration of the local function model. Thorough comparative experiments for DFMGEP-FR, centralized GEP and the parallel gene expression programming algorithm based on simulated annealing (parallel GEPSA) are included in this paper. For the waveform, mushroom, connect-4 and musk datasets, the comparative results show that the average time-consumption of DFMGEP-FR drops by 89.09%%, 88.85%, 85.79% and 93.06%, respectively, in contrast to centralized GEP and by 12.5%, 8.42%, 9.62% and 13.75%, respectively, compared with parallel GEPSA. Six well-studied UCI test data sets demonstrate the efficiency and capability of our proposed DFMGEP-FR algorithm for distributed function mining.

This paper presents an interface system based on the Dual Active Bridge (DAB) converter for Photovoltaic (PV) arrays. Two control strategies are proposed for the DAB converter to harvest the maximum power from the PV array. The first strategy is based on a simple PI controller to regulate the terminal PV voltage through the phase shift angle of the DAB converter. The Perturb and Observe (P&O) Maximum Power Point Tracking (MPPT) technique is utilized to set the reference of the PV terminal voltage. The second strategy presented in this paper employs the Artificial Neural Network (ANN) to directly set the phase shift angle of the DAB converter that results in harvesting maximum power. This feed-forward strategy overcomes the stability issues of the feedback strategy. The proposed PV interface systems are modeled and simulated using MATLAB/SIMULINK and the EMTDC/PSCAD software packages. The simulation results reveal accurate and fast response of the proposed systems. The dynamic performance of the proposed feed-forward strategy outdoes that of the feedback strategy in terms of accuracy and response time. Moreover, an experimental prototype is built to test and validate the proposed PV interface system.

Space operations will be the main space missions in the future. This paper focuses on the precise operations for non-cooperative target, and researches of coordinated parameter identification (CPI) which allows the motion of multi-joints. The contents of this paper are organized: (1) Summarize the inertial parameters identification techniques which have been conducted now, and the technique based on momentum conservation is selected for reliability and realizability; (2) Elaborate the basic principles and primary algorithm of coordinated parameter identification, and analyze some special problems in calculation (3) Numerical simulation of coordinated identification technique by an case study on non-cooperative target of spacecraft mounting dual-arm with six joints is done. The results show that the coordinated parameter identification technique could get all the inertial parameters of the target in 3D by one-time identification, and does not need special configuration or driven joints, moreover the results are highly precise and save much more time than traditional ones.

Based on the type-II fuzzy logic, this paper proposes a robust adaptive fault diagnosis and fault-tolerant control (FTC) scheme for multisensor faults in the variable structure hypersonic vehicles with parameter uncertainties. Type-II fuzzy method approximates the original models while eliminating the parameter uncertainties. Hence the sensor faults are detected and isolated by the multiple output residuals and thresholds considering nonlinear approximation errors and disturbance. Based on the fuzzy adaptive augmented observer, the faults and disturbance are all estimated accurately by an improved proportional-differential part. Then a variable structure FTC scheme repairs the faults by the estimation, the fast-varying disturbance is considered in FTC scheme and is compensated by the control parameters designed based on its derivative function, thereby enhancing the output robust tracking accuracy of the variable structure hypersonic vehicles. The Lyapunov theory proves the system robust stability, semi-physical simulation verifies the validity of the proposed method and the superiority compared with the traditional method.

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

Durotaxis, the phenomena where cells migrate up a gradient in substrate stiffness, remains poorly understood. It has been proposed that durotaxis results from the reinforcement of focal adhesions on stiff substrates. In this paper we formulate a mathematical model of single cell migration on elastic substrates with spatially varying stiffness. We develop a stochastic model where the cell moves by updating the position of its adhesion sites at random times, and the rate of updates is determined by the local stiffness of the substrate. We investigate two physiologically motivated mechanisms of stiffness sensing. From the stochastic model of single cell migration we derive a population level description in the form of a partial differential equation for the time evolution of the density of cells. The equation is an advection–diffusion equation, where the advective velocity is proportional to the stiffness gradient. The model shows quantitative agreement with experimental results in which cells tend to cluster when seeded on a matrix with periodically varying stiffness.

In this paper, we propose an SIS-type reaction-diffusion equations, which contains both direct transmission and indirect transmission via free-living and spatially diffusive bacteria/virus in the contaminated environment, motivated by the dynamics of hospital infections. We establish the basic reproduction number $R_0$ which can act as threshold level to determine whether the disease persists or not. In particular, if $R_0 1$. For the spatially homogeneous system, we investigate the traveling wave solutions and obtain that there exists a critical wave speed, below which there has no traveling waves, above which the traveling wave solutions may exist for small diffusion coefficient by the geometric singular perturbation method. The finding implies that great spatial transmission leads to an increase in new infection, while large diffusion of bacteria/virus results in the new infection decline for spatially heterogeneous environment.

In this paper, we studied an SVIR epidemic model with nonlocal dispersal and delay, and we find that the existence of traveling wave is determined by the basic reproduction number ℜ₀ and minimal wave speed c*. By applying Schauder's fixed point theorem and Lyapunov functional, the existence and boundary asymptotic behaviour of traveling wave solutions is investigated for ℜ₀>1 and c>c*. The existence of traveling waves is obtained for ℜ₀>1 and c=c* by employing a limiting argument. We also show that the nonexistence of traveling wave solutions by Laplace transform. Our results imply that (i) the diffusion and infection ability of infected individuals can accelerate the wave speed; (ii) the latent period and successful rate of vaccination can slow down the wave speed.

In this paper, we propose a diffusive epidemic model with a standard incidence rate and distributed delays in disease transmission. We also consider the degenerate case when one of the diffusion coe cients vanishes. By establishing existence theory of traveling wave solutions and providing sharp lower bound for the wave speeds, we prove linear determinacy of the proposed model system. Sensitivity analysis suggests that disease propagation is slowed down by transmission delay but fastened by spatial diffusion. The existence proof is based on the construction of a suitable convex set which is invariant under the integral map of traveling wave equations. An innovative argument is formulated to study the boundary value problems of nonlinear elliptic equations satisfied by the traveling wave solutions, which enables us to prove that there does not exist a positive traveling wave connecting two nontrivial equilibria.

This paper presents the design of a Built-in-self-Test (BIST) implemented Advanced Encryption Standard (AES) cryptoprocessor Application Specific Integrated Circuit (ASIC). AES has been proved as the strongest symmetric encryption algorithm declared by USA Govt. and it outperforms all other existing cryptographic algorithms. Its hardware implementation offers much higher speed and physical security than that of its software implementation. Due to this reason, a number of AES cryptoprocessor ASIC have been presented in the literature, but the problem of testability in the complex AES chip is not addressed yet. This research introduces a solution to the problem for the AES cryptoprocessor ASIC implementing mixed-mode BIST technique, a hybrid of pseudo-random and deterministic techniques. The BIST implemented ASIC is designed using IEEE industry standard Hardware Description Language(HDL). It has been simulated using Electronic Design Automation (EDA)tools for verification and validation using the input-output data from the National Institute of Standard and Technology (NIST) of the USA Govt. The simulation results show that the design is working as per desired functionalities in different modes of operation of the ASIC. The current research is compared with those of other researchers, and it shows that it is unique in terms of BIST implementation into the ASIC chip.

The multi-energy conversion system (MCS) plays an important role in improving the utilization of energy resources and realizing the energy transition. With the application of the new generation of information technologies, the new MCS can realize real-time information interaction, multi-energy collaboration, and real-time demand response, in which energy suppliers can intelligently motivate consumers' energy use behavior. In this paper, an MCS coupled with a cloud platform is proposed to address information explosion and data security issues. Due to the development of Internet technology, the increasing energy data, and the serious energy coupling, it is difficult for traditional optimization methods to deal with the interaction between participants of the MCS. Therefore, the non-cooperative game is used to formulate the interactions between participants with the aim of maximizing the energy suppliers' profit and minimizing the customers' cost. It is proved that the game model is an ordinary game with one Nash equilibrium. The simulation was performed with a gradient projection algorithm and the results show that the proposed MCS improves energy utilization efficiency through energy conversion while ensuring consumer satisfaction, and benefits both the customers and suppliers by reducing the energy consumption cost and the peak load demand, which effectively improve the supply quality and enrich the energy consumption patterns.

In recent years, the flow characteristics research of the interstage region in counter-rotating axial fans in terms of fluid dynamics has attracted much attention. Especially, the dynamic relationship between interstage pressure pulsation and blade vibration in counter-rotating axial fans has not yet been clarified. This paper performs the signal processing method of wavelet decomposition and reconstruction in time-frequency analysis process. Under different flow conditions, weak-coupling numerical simulation program is employed to analyze the fluid-structure coupling interaction between interstage pressure pulsations and blade vibrations in counter-rotating axial fans. The results indicate that the fluid-structure coupling interaction field in the interstage of counter-rotating axial fans mainly excites the first-order vibration of the second-stage blade. At the same time, the consistency between the pulsation frequency and the vibration frequency of the airflow reflects the good coupling property. Two stage blades cut the airflow to cause field changes and airflow pulsation, and then, airflow pulsation causes blades deformation and produces vibrations of the same frequency at the blade. The deformation of the blades, in turn, causes the flow field changes. Rotating stall, vortex movement and breakdown produced low-frequency airflow pulsation and vortex vibration of the blade.

Focusing on the problem incurred during particle swarm optimization (PSO) that tends to fall into local optimization when solving Nash equilibrium solutions of games, as well as the problem of slow convergence when solving higher order game pay off matrices, this paper proposes an improved Predator-Prey particle swarm optimization (IPP-PSO) algorithm based on a Predator-Prey particle swarm optimization (PP-PSO) algorithm. First, the convergence of the algorithm is advanced by improving the distribution of the initial predator and prey. By improving the inertia weight of both predator and prey, the problem of “precocity” of the algorithm is improved. By improving the formula used to represent particle velocity, the problems of local optimizations and slowed convergence rates are solved. By increasing pathfinder weight, the diversity of the population is increased, and the global search ability of the algorithm is improved. Then, by solving the Nash equilibrium solution of both a zero-sum game and a non-zero-sum game, the convergence speed and global optimal performance of the original PSO, the PP-PSO and the IPP-PSO are compared. Simulation results demonstrated that the improved Predator-Prey algorithm is convergent and effective. The convergence speed of the IPP-PSO is significantly higher than that of the other two algorithms. In the simulation, the PSO does not converge to the global optimal solution, and PP-PSO approximately converges to the global optimal solution after about 40 iterations, while IPP-PSO approximately converges to the global optimal solution after about 20 iterations. Furthermore, the IPP-PSO is superior to the other two algorithms in terms of global optimization and accuracy.

Pollution source parameter identification (PSPI) is significant for pollution control, since it can provide important information and save a lot of time for subsequent pollution elimination works. For solving the PSPI problem, a large number of pollution sensor nodes can be rapidly deployed to cover a large area and form a wireless sensor network (WSN). Based on the measurements of WSN, least-squares estimation methods can solve the PSPI problem by searching for the solution that minimize the sum of squared measurement noises. They are independent of the measurement noise distribution, i.e., robust to the noise distribution. To search for the least-squares solution, population-based parallel search techniques usually can overcome the premature convergence problem, which can stagnate the single-point search algorithm. In this paper, we adapt the relatively newly presented artificial bee colony (ABC) algorithm to solve the WSN-based PSPI problem and verifies its feasibility and robustness. Extensive simulation results show that the ABC and the particle swarm optimization (PSO) algorithm obtained similar identification results in the same simulation scenario. Moreover, the ABC and the PSO achieved much better performance than a traditionally used single-point search algorithm, i.e., the trust-region reflective algorithm.

This paper presents the potential of applying physics-informed neural networks for solving nonlinear multiphysics problems, which are essential to many fields such as biomedical engineering, earthquake prediction, and underground energy harvesting. Specifically, we investigate how to extend the methodology of physics-informed neural networks to solve both the forward and inverse problems in relation to the nonlinear diffusivity and Biot's equations. We explore the accuracy of the physics-informed neural networks with different training example sizes and choices of hyperparameters. The impacts of the stochastic variations between various training realizations are also investigated. In the inverse case, we also study the effects of noisy measurements. Furthermore, we address the challenge of selecting the hyperparameters of the inverse model and illustrate how this challenge is linked to the hyperparameters selection performed for the forward one.

In this paper, a novel, effective meta-heuristic, population-based Hybrid Firefly Particle Swarm Optimization (HFPSO) algorithm is applied to solve different non-linear and convex optimal power flow (OPF) problems. The HFPSO algorithm is a hybridization of the Firefly Optimization (FFO) and the Particle Swarm Optimization (PSO) technique, to enhance the exploration, exploitation strategies, and to speed up the convergence rate. In this work, five objective functions of OPF problems are studied to prove the strength of the proposed method: total generation cost minimization, voltage profile improvement, voltage stability enhancement, the transmission lines active power loss reductions, and the transmission lines reactive power loss reductions. The particular fitness function is chosen as a single objective based on control parameters. The proposed HFPSO technique is coded using MATLAB software and its effectiveness is tested on the standard IEEE 30-bus test system. The obtained results of the proposed algorithm are compared to simulated results of the original Particle Swarm Optimization (PSO) method and the present state-of-the-art optimization techniques. The comparison of optimum solutions reveals that the recommended method can generate optimum, feasible, global solutions with fast convergence and can also deal with the challenges and complexities of various OPF problems.

Elasticity and viscosity of soft tissues can be obtained from the complex shear modulus imaging (CSMI). CSMI is often used not only to investigate the structure of tissues but also to detect tumors in tissues. One of the most popular ways to categorize the methods used in CSMI is into quasi-static and dynamic methods. In the dynamic method, a force excitation is used to create the shear wave propagation, and the particle velocities are measured to extract their amplitude and phase at spatial locations. These parameters are then employed to directly or indirectly estimate the Complex Shear Modulus (CSM) represented by elasticity and viscosity. Algebraic Helmholtz Inversion (AHI) algorithm provides the direct estimation of CSM using the Finite Difference Time Domain (FDTD) technique. The limitation of this method, however, is that the noise generated from measuring the particle velocity strongly degrades the accuracy of the estimation. To overcome this problem, we proposed in this paper an adaptive AHI (AAHI) algorithm that offers a good performance in CSMI with a mean error of 2.06%.

Medical ultrasound images are corrupted by speckle noise, and despeckling methods are required to effectively and efficiently reduce speckle noise while simultaneously preserving details of tissues. This paper proposes a despeckling approach named the Gabor-based anisotropic diffusion coupled with the lattice Boltzmann method (GAD-LBM), which uses the lattice Boltzmann method (LBM) to fast solve the partial differential equation of an anisotropic diffusion model embedded with the Gabor edge detector. We evaluated the GAD-LBM on both synthetic and clinical ultrasound images, and the experimental results suggested that the GAD-LBM was superior to other nine methods in speckle suppression and detail preservation. For synthetic and clinical images, the computation time of the GAD-LBM was about 1/90 to 1/20 of the GAD solved with the finite difference, indicating the advantage of the GAD-LBM in efficiency. The GAD-LBM not only has excellent ability of noise reduction and detail preservation for ultrasound images, but also has advantages in computational efficiency.

In this paper we consider a time-delayed mathematical model describing tumor growth with angiogenesis and Gibbs-Thomson relation. In the model there are two unknown functions: One is $\sigma(r,t)$ which is the nutrient concentration at time $t$ and radius $r$, and the other one is $R(t)$ which is the outer tumor radius at time $t$. Since $R(t)$ is unknown and varies with time, this problem has a free boundary. Assume $\alpha(t)$ is the rate at which the tumor attracts blood vessels and the Gibbs-Thomson relation is considered for the concentration of nutrient at outer boundary of the tumor, so that on the outer boundary, the condition $$\dfrac{\partial \sigma}{\partial r}+\alpha(t)\left(\sigma-N(t)\right)=0,~~r=R(t)$$ holds, where $N(t)=\bar{\sigma}\left(1-\dfrac{\gamma}{R(t)}\right)H(R(t))$ is derived from Gibbs-Thomson relation. $H(\cdot)$ is smooth on $(0,\infty)$ satisfying $H(x)=0$ if $x\leq \gamma$, $H(x)=1$ if $x\geq 2\gamma$ and $0\leq H'(x)\leq 2/\gamma$ for all $x\geq 0$. In the case where $\alpha$ is a constant, the existence of steady-state solutions is discussed and the stability of the steady-state solutions is proved. In another case where $\alpha$ depends on time, we show that $R(t)$ will be also bounded if $\alpha(t)$ is bounded and some sufficient conditions for the disappearance of tumors are given.

In this paper, we present a new method based on dynamical system theory to study certain type of slow-fast motions in dynamical systems, for which geometric singular perturbation theory may not be applicable. The method is then applied to consider recurrence behavior in an oscillating network model which is biologically related to organic reactions. We analyze the stability and bifurcation of the equilibrium of the system, and find the conditions for the existence of recurrence, i.e., there exists a "window" in bifurcation diagram between a saddle-node bifurcation point and a Hopf bifurcation point, where the equilibrium is unstable. Simulations are given to show a very good agreement with analytical predictions.

In this paper, we focus on why intraplate seismic initiation and migration occurs, which has widely been considered to be caused by static stress triggering caused by earthquakes, as well as post-seismic slips. To illustrate the mechanism underlying large earthquakes, in particular the migration caused by two key episodes that occurred after 1500 in the Bohai-Zhangjiakou Fault Zone (BZFZ) of North China, we developed a high-resolution three-dimensional viscoelastic finite element model that includes the active faults with vertical segmentation, their periodical locking, and the lithosphere heterogeneity. We used the birth and death of element groups to simulate stress intensity changes during the two episodes (named Episode I and II), with our results showing that the Tangshan earthquake was primarily triggered by the Sanhe-Pinggu M8.0 earthquake in 1679, whereas the Zhangbei M6.2 earthquake in 1998 was not triggered by earthquakes in Episode I. According to our work, the calculated stress changes in the different segments of the fault zone correspond to the magnitude of the triggered earthquakes. Further, the largest stress decrease was near the Sanhe-Pinggu fault and occurred the largest earthquake in Episode I, whereas the largest stress increase was near the Tangshan fault and occurred during the largest earthquake in Episode II. Given the above, we propose a model for seismic migration to describe the dynamic mechanisms of earthquake migration within the BZFZ and North China, in which the factors affecting both the seismic migration path and intensity primarily include the distance between the triggered active fault and the original fault, the coupling of the active faults, the location and scale of the low-velocity anomaly, its distance from the active fault, and the location and scale of the crustal thinning.

There have been some results on bifurcations of codimension one (such as saddle-node, transcritical, pitchfork) and degenerate Hopf bifurcations for an enzyme-catalyzed reaction system comprising a branched network but no further discussion for bifurcations at its cusp. In this paper we give conditions for the existence of a cusp and compute the parameter curves for the Bogdanov-Takens bifurcation, which induces the appearance of homoclinic orbits and periodic orbits, indicating the tendency to steady-states or a rise of periodic oscillations for the concentrations of the substrate and the product.

Our understanding of how chromosomes structurally organize and dynamically interact has been revolutionized through the lens of long-chain polymer physics. Major protein contributors to chromosome structure and dynamics are condensin and cohesin that stochastically generate loops within and between chains, and entrap proximal strands of sister chromatids. In this paper, we explore the ability of transient, protein-mediated, gene-gene crosslinks to induce clusters of genes, thereby dynamic architecture, within the highly repeated ribosomal DNA that comprises the nucleolus of budding yeast. We implement three approaches: live cell microscopy; computational modeling of the full genome during G1 in budding yeast, exploring four decades of timescales for transient crosslinks between 5kbp domains (genes) in the nucleolus on Chromosome XII; and, temporal network models with automated community (cluster) detection algorithms applied to the full range of 4D modeling datasets. The data analysis tools detect and track gene clusters, their size, number, persistence time, and their plasticity (deformation). Of biological significance, our analysis reveals an optimal mean crosslink lifetime that promotes pairwise and cluster gene interactions through “flexible” clustering. In this state, large gene clusters self-assemble yet frequently interact (merge and separate), marked by gene exchanges between clusters, which in turn maximizes global gene interactions in the nucleolus. This regime stands between two limiting cases each with far less global gene interactions: with shorter crosslink lifetimes, “rigid” clustering emerges with clusters that interact infrequently; with longer crosslink lifetimes, there is a dissolution of clusters. These observations are compared with imaging experiments on a normal yeast strain and two condensin-modified mutant cell strains. We apply the same image analysis pipeline to the experimental and simulated datasets, providing support for the modeling predictions., Author summary The spatiotemporal organization of the genome plays an important role in cellular processes involving DNA, but remains poorly understood, especially in the nucleolus, which does not facilitate conventional techniques. Polymer chain models have shown ability in recent years to make accurate predictions of the dynamics of the genome. We consider a polymer bead-chain model of the full yeast genome during the interphase portion of the cell cycle, featuring special dynamic crosslinking to model the effects of structural maintenance proteins in the nucleolus, and investigate how the kinetic timescale on which the crosslinks bind and unbind affects the resulting dynamics inside the nucleolus. It was previously known that when this timescale is sufficiently short, large, stable clusters appear, but when it is long, there is no resulting structure. We find that there additionally exists a range of timescales for which flexible clusters appear, in which beads frequently enter and leave clusters. Furthermore, we demonstrate that these flexible clusters maximize the cross-communication between beads in the nucleolus. Finally, we apply network temporal community detection algorithms to identify what beads are in what communities at what times, in a way that is more robust and objective than conventional visual-based methods.

In this paper, we investigate the existence, uniqueness, and spectral stability of traveling waves arising from a single threshold neural field model with one spatial dimension, a Heaviside firing rate function, axonal propagation delay, and biologically motivated oscillatory coupling types. Neuronal tracing studies show that long-ranged excitatory connections form stripe-like patterns throughout the mammalian cortex; thus, we aim to generalize the notions of pure excitation, lateral inhibition, and lateral excitation by allowing coupling types to spatially oscillate between excitation and inhibition. In turn, we hope to analyze traveling fronts and pulses with novel shapes. With fronts as our main focus, we exploit Heaviside firing rate functions in order to establish existence and utilize speed index functions with at most one critical point as a tool for showing uniqueness of wave speed. We are able to construct Evans functions, the so-called stability index functions, in order to provide positive spectral stability results. Finally, we show that by incorporating slow linear feedback, we can compute fast pulses numerically with phase space dynamics that are similar to their corresponding singular homoclinical orbits; hence, our work answers open problems and provides insight into new ones., Comment: 30 pages, 11 figures

The purpose of Fuzzy Comprehensive CS-SVR Model (FCCS-SVR) is to evaluate and monitor the health status of a radar equipment and then keep its safe operation. Due to reasons such as few samples, slow changes and the nonlinear structure of data of fault monitoring signal, the health status evaluation of a radar system is quite difficult. By establishing the evaluation index system of a radar, the combination of AHP method and Entropy weight method is studied in this paper. In order to evaluate the value of health status, several optimization algorithms including PSO, GA, BA and CS are used for optimizing the parameters of SVR model. Meanwhile, in order to avoid the problem that the system is at the edge of the state, a radar health assessment method based on the combination of Fuzzy Comprehensive Evaluation and Cuckoo Search-Support Vector Regression (CS-SVR), which is named as Fuzzy Comprehensive CS-SVR (FCCS-SVR), is further proposed. The result of case analysis reflects that the state evaluation of the radar system is realized. The system performance analysis shows that the use of FCCS-SVR evaluation method provides a high recognition rate and can accurately assess the health status of the radar system.

Conservative and non-conservative phase-field models are considered for the numerical simulation of lateral phase separation and coarsening in biological membranes. An unfitted finite element method is devised for these models to allow for a flexible treatment of complex shapes in the absence of an explicit surface parametrization. For a set of biologically relevant shapes and parameter values, the paper compares the dynamic coarsening produced by conservative and non-conservative numerical models, its dependence on certain geometric characteristics and convergence to the final equilibrium

Recent advances in electron microscopy have enabled the imaging of single cells in 3D at nanometer length scale resolutions. An uncharted frontier for in silico biology is the ability to simulate cellular processes using these observed geometries. Enabling such simulations requires watertight meshing of electron micrograph images into 3D volume meshes, which can then form the basis of computer simulations of such processes using numerical techniques such as the Finite Element Method. In this paper, we describe the use of our recently rewritten mesh processing software, GAMer 2, to bridge the gap between poorly conditioned meshes generated from segmented micrographs and boundary marked tetrahedral meshes which are compatible with simulation. We demonstrate the application of a workflow using GAMer 2 to a series of electron micrographs of neuronal dendrite morphology explored at three different length scales and show that the resulting meshes are suitable for finite element simulations. This work is an important step towards making physical simulations of biological processes in realistic geometries routine. Innovations in algorithms to reconstruct and simulate cellular length scale phenomena based on emerging structural data will enable realistic physical models and advance discovery at the interface of geometry and cellular processes. We posit that a new frontier at the intersection of computational technologies and single cell biology is now open., 39 pages, 14 figures. High resolution figures and supplemental movies available upon request