Search

Purpose. As a scientific field, bioinformatics has drawn remarkable attention from various fields, such as information technology, mathematics, and modern biological sciences, in recent years. The topic models originating from the field of natural language processing have become the focus of attention with the rapid accumulation of biological datasets. Thus, this research is aimed at modeling the topic content of the bioinformatics literature presented by Iranian researchers in the Scopus Citation Database. Methodology. This research was a descriptive-exploratory study, and the studied population included 3899 papers indexed in the Scopus database, which had been indexed in this database until March 9, 2022. The topic modeling was then performed on the abstracts and titles of the papers. A combination of LDA and TF-IDF was utilized for topic modeling. Findings. The data analysis with topic modeling resulted in identifying seven main topics "Molecular Modeling," "Gene Expression," "Biomarker," "Coronavirus," "Immunoinformatics," "Cancer Bioinformatics," and "Systems Biology." Moreover, "Systems Biology" and "Coronavirus" had the largest and smallest clusters, respectively. Conclusion. The present investigation demonstrated an acceptable performance for the LDA algorithm in classifying the topics included in this field. The extracted topic clusters indicated excellent consistency and topic connection with each other. [ABSTRACT FROM AUTHOR]

This research aims to improve the rationality and intelligence of AUTOMATICALLY HIGHER MATHEMATICALLY EXAM SYSTEM (AHMES) through some AI algorithms. AHMES is an intelligent and high-quality higher math examination solution for the Department of Computer Engineering at Pai Chai University. This research redesigned the difficulty system of AHMES and used some AI algorithms for initialization and continuous adjustment. This paper describes the multiple linear regression algorithm involved in this research and the AHMES learning (AL) algorithm improved by the Q-learning algorithm. The simulation test results of the upgraded AHMES show the effectiveness of these algorithms. [ABSTRACT FROM AUTHOR]

With the rapid development of artificial intelligence (AI) concept technology, it promotes the innovation of educational concept. Mostly for the education information analysis in the class of mathematics in the university, it should be based on a big data-driven system to promote the quality of teaching in the classroom. In the method of teaching math in university, teachers should take full advantage of the benefits of a big data-driven system powered by AI, grow a good teaching model for students, promote education through big data, progressively teach students according to their aptitude, develop in a tailored direction, increase teaching quality and effectiveness, and finally create more great talents for our country. For the sake of improving the resource sharing and the management level of the curriculum which teaches advanced knowledge about mathematics teaching, based on a particle swarm optimization algorithm, an advanced math teaching system is proposed in this paper. The fusion model that can be used in the teaching process of math in university is constructed, the adaptive scheduling of the curriculum which teaches advanced knowledge about mathematics auxiliary teaching resources is realized by an optimization algorithm used for fusion particle swarm, the autocorrelation feature of the curriculum which teaches advanced knowledge about mathematics auxiliary teaching resources is extracted, and the adaptive optimization of the curriculum which teaches advanced knowledge about mathematics auxiliary teaching resource fusion is realized by fuzzy correlation feature matching and statistical analysis. In the process of particle swarm optimization, the combination of statistical features is studied and managed, the resource scheduling and information fusion are realized, and the management capability of the curriculum which teaches advanced knowledge about mathematics auxiliary teaching is promoted, and the experimental results demonstrate that the designed system has a high integration of teaching information resources and strong information scheduling ability and improved the management level of the curriculum which teaches advanced knowledge about mathematics complementary teaching. [ABSTRACT FROM AUTHOR]

Malignant melanoma is one of the most threatening cancers to human health. Only 14% of patients with malignant melanoma have a remaining life span of 5 years. At present, there have been some studies looking for potential prognostic indicators of esophageal cancer from the level of genes and infiltrating immune cells, but there are still some problems that need to be resolved urgently. This paper proposes IGHG3 as the immune infiltration of malignant melanoma, which takes into account the computational mathematics. It aims to deduce the characteristics of immune cell infiltration in malignant melanoma and study the relationship between different immune cell infiltration characteristics and prognosis. The method in this article is to establish a computational mathematical model for the immunotherapy of melanoma, then study the method of identification of the affinity of the IGHG3 reagent, and finally obtain the gene expression of immune infiltration. The functions of these methods are, respectively, to predict the dynamic behavior of T cells with two different specificities through mathematical models and to test the matching degree of different concentrations of IGHG3 reagent with the human body. Then use the ssGSEA algorithm to obtain immune infiltration related data and calculate the difference between the weighted empirical cumulative distribution function of all genes in the effect of IGHG3 on melanoma that was carried out. The experimental results showed the computational mathematical method genome and all the remaining genes. In this study, a computational mathematical method to detect the IGHG3 gene expression had a significant inhibitory effect on A375 cells in the experimental group, and the knockdown efficiency reached 85.6%. [ABSTRACT FROM AUTHOR]

In this paper, the theory of viscoelastic material relaxation modulus testing, testing method, and material relaxation modulus parameter solution method is studied. Based on the IoT sensor test devices and the Hertzian mathematics theory, the relationship between the compression amount, pressure, and relaxation modulus of a rigid spherical indenter pressed into a flat viscoelastic material is studied. In combination with the Boltzmann superposition principle, the relaxation modulus test method and theory for viscoelastic materials are proposed. A good fitting curve was obtained to solve the relaxation modulus parameters of various materials under the three-element Maxwell model. The experimental setup and the results of the parameter fitting were analyzed to verify the feasibility and accuracy of the results. [ABSTRACT FROM AUTHOR]

In order to improve the effect of classroom teaching and realize the improvement of mathematics teaching quality, this article combines data-driven decision-making technology to design a mathematics teaching plan system and applies data-driven decision-making technology to the design of mathematics teaching plan by improving the big data algorithm. In addition, this paper designs a mathematics teaching plan design system based on data-driven decision-making technology. The system learning module displays the knowledge points in a chapter-sequential navigation mode and stores data or information in the nodes, which are connected to form a network structure through chains. Finally, this paper verifies the designed system with experiments. From the results of the experimental research data, it can be seen that the mathematical teaching plan design system based on the data-driven decision-making technology constructed in this article has good practical effects. On this basis, the system constructed in this article can be verified through further practice. [ABSTRACT FROM AUTHOR]

With the increasing importance of mathematics in basic education, how to evaluate and analyze the intelligent effect of mathematics teaching classroom through scientific methods has become one of the indicators to evaluate the intelligent classroom. This paper studies the design and application of mathematics teaching intelligent classroom based on the PCA-NN (principal component analysis-neural network) algorithm. Firstly, this paper briefly describes the current research status of mathematics teaching intelligent classroom design and PCA-NN algorithm. Secondly, combined with the key factors of mathematics teaching, it formulates specific standards and puts forward an adaptive strategy of intelligent and personalized intelligent mathematics teaching classroom. Finally, the algorithm is verified by experiments. The results show that, for students with different mathematics basic levels, the mathematics teaching intelligent classroom based on the PCA-NN algorithm can effectively improve the quality of mathematics classroom teaching. Through the research on the factors such as teaching quality, effect, and interaction mode involved in the process of mathematics teaching classroom design, the intelligent classroom design factors affecting teaching quality are determined. This paper analyzes and studies the system from different angles. The research results provide some help for the current quality evaluation of classroom teaching and use the PCA-NN algorithm to make quantitative analysis and multivariate verification of mathematics classroom teaching effect. [ABSTRACT FROM AUTHOR]

The main purpose of this paper is to introduce a new hybrid iterative scheme for finding a common element of set of solutions for a system of generalized mixed equilibrium problems, set of common fixed points of a family of quasi-φ-asymptotically nonexpansive mappings, and null spaces of finite family of γ-inverse strongly monotone mappings in a 2-uniformly convex and uniformly smooth real Banach space. The results presented in the paper improve and extend the corresponding results announced by some authors. [ABSTRACT FROM AUTHOR]

This paper describes a design for a least mean square error estimator in discrete time systems where the components of the state vector, in measurement equation, are corrupted by different multiplicative noises in addition to observation noise. We show how known results can be considered a particular case of the algorithm stated in this paper. [ABSTRACT FROM AUTHOR]

Retrial queues can only be solved in a closed form in very few and simple cases, so researchers must resort to approximate models. However, most of the papers that propose approximate models assume the convergence of the proposed models to their exact counterparts, without providing a rigorous mathematical proof. In this paper we demonstrate the convergence of finite truncated models with two reattempt orbits. [ABSTRACT FROM AUTHOR]

The problem of stochastic stability is investigated for a class of neural networks with both Markovian jump parameters and continuously distributed delays. The jumping parameters are modeled as a continuous-time, finite-state Markov chain. By constructing appropriate Lyapunov-Krasovskii functionals, some novel stability conditions are obtained in terms of linear matrix inequalities (LMIs). The proposed LMI-based criteria are computationally efficient as they can be easily checked by using recently developed algorithms in solving LMIs. A numerical example is provided to show the effectiveness of the theoretical results and demonstrate the LMI criteria existed in the earlier literature fail. The results obtained in this paper improve and generalize those given in the previous literature. [ABSTRACT FROM AUTHOR]

In this paper, an algorithm is introduced to solve the global optimization problem for melanoma skin cancer segmentation. The algorithm is based on the smoothing of an auxiliary function that is constructed using a known local minimizer and smoothed by utilising Bezier curves. This function achieves all filled function properties. The proposed optimization method is applied to find the threshold values in melanoma skin cancer images. The proposed algorithm is implemented on PH2, ISBI2016 challenge, and ISBI 2017 challenge datasets for melanoma segmentation. The results show that the proposed algorithm exhibits high accuracy, sensitivity, and specificity compared with other methods. [ABSTRACT FROM AUTHOR]

In mathematical modeling of economic problems, it is common to assume that economic laws influence the process and analyze the type of solution obtained. Sometimes these laws have unknown parameters and they worth studying if these parameters can be determined. In this paper, a structured system is considered and the identifiability is analyzed. In case the parameters can be uniquely identified, an algorithm for obtaining the model parameters is presented and, finally, the existence of a balanced growth solution is studied. [ABSTRACT FROM AUTHOR]

This paper proposes an efficient method to solve the optimal power flow problem in power systems using Particle Swarm Optimization (PSO). The objective of the proposed method is to find the steady-state operating point which minimizes the fuel cost, while maintaining an acceptable system performance in terms of limits on generator power, line flow, and voltage. Three different inertia weights, a constant inertia weight (CIW), a time-varying inertia weight (TVIW), and global-local best inertia weight (GLbestIW), are considered with the particle swarm optimization algorithm to analyze the impact of inertia weight on the performance of PSO algorithm. The PSO algorithm is simulated for each of the method individually. It is observed that the PSO algorithm with the proposed inertia weight yields better results, both in terms of optimal solution and faster convergence. The proposed method has been tested on the standard IEEE 30 bus test system to prove its efficacy. The algorithm is computationally faster, in terms of the number of load flows executed, and provides better results than other heuristic techniques. [ABSTRACT FROM AUTHOR]

This paper discusses the prediction of time series with missing data. A novel forecast model is proposed based on max-margin classification of data with absent features. The issue of modeling incomplete time series is considered as classification of data with absent features. We employ the optimal hyperplane of classification to predict the future values. Compared with traditional predicting process of incomplete time series, our method solves the problem directly rather than fills the missing data in advance. In addition, we introduce an imputation method to estimate the missing data in the history series. Experimental results validate the effectiveness of our model in both prediction and imputation. [ABSTRACT FROM AUTHOR]

A novel filled function is given in this paper to find a global minima for a nonsmooth constrained optimization problem. First, a modified concept of the filled function for nonsmooth constrained global optimization is introduced, and a filled function, which makes use of the idea of the filled function for unconstrained optimization and penalty function for constrained optimization, is proposed. Then, a solution algorithm based on the proposed filled function is developed. At last, some preliminary numerical results are reported. The results show that the proposed approach is promising. [ABSTRACT FROM AUTHOR]

It is well known that every cycle of a graph must intersect every cut in an even number of edges. For planar graphs, Ford and Fulkerson proved that, for any edge e, there exists a cycle containing e that intersects every minimal cut containing e in exactly two edges. The main result of this paper generalizes this result to any nonplanar graph G provided G does not have a K 3,3 minor containing the given edge e. Ford and Fulkerson used their result to provide an efficient algorithm for solving the maximum-flow problem on planar graphs. As a corollary to the main result of this paper, it is shown that the Ford-Fulkerson algorithm naturally extends to this more general class of graphs. [ABSTRACT FROM AUTHOR]

This paper is concerned with accurate and efficient numerical methods for solving viscous and nonviscous wave problems. The paper first introduces a new second-order PR-ADI like scheme. For an efficient simulation, the scheme is also extended to a highorder compact PRADI likemethod. Both of themhave the advantages of unconditional stability, less impact of the perturbing terms on the accuracy, and being convenient to compute the boundary values of the intermediates. Besides this, the compact scheme has high-order accuracy and costs less in computational time. Numerical results are presented to show the accuracy and efficiency of the new algorithms. [ABSTRACT FROM AUTHOR]

We introduce a new iterative algorithm for finding a common element of a fixed point problem of amenable semigroups of nonexpansive mappings, the set solutions of a system of a general system of generalized equilibria in a real Hilbert space. Then, we prove the strong convergence of the proposed iterative algorithm to a common element of the above three sets under some suitable conditions. As applications, at the end of the paper, we apply our results to find the minimum-norm solutions which solve some quadratic minimization problems. The results obtained in this paper extend and improve many recent ones announced by many others. [ABSTRACT FROM AUTHOR]

Structure of data set is of critical importance in identifying clusters, especially the density difference feature. In this paper, we present a clustering algorithm based on density consistency, which is a filtering process to identify same structure feature and classify them into same cluster. This method is not restricted by the shapes and high dimension data set, and meanwhile it is robust to noises and outliers. Extensive experiments on synthetic and real world data sets validate the proposed the new clustering algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a general and comprehensive description of Optimization Methods, and Algorithms from a novel viewpoint. It is shown, in particular, that Direct Methods, Iterative Methods, and Computer Science Algorithms belong to a well-defined general class of both Finite and Infinite Procedures, characterized by suitable descent directions. [ABSTRACT FROM AUTHOR]

This paper is concerned with the study of a penalization-gradient algorithm for solving variational inequalities, namely, find x̅∈C such that 〈Ax̅,y-x̅〉≥0 for all y∈C, where A:H→H is a single-valued operator, C is a closed convex set of a real Hilbert space H. Given Ψ:H→R∪{+∞} which acts as a penalization function with respect to the constraint x̅∈C, and a penalization parameter βk, we consider an algorithm which alternates a proximal step with respect to ∂Ψ and a gradient step with respect to A and reads as xk=(I+λkβk∂Ψ)-1(xk-1-λkAxk-1). Under mild hypotheses, we obtain weak convergence for an inverse strongly monotone operator and strong convergence for a Lipschitz continuous and strongly monotone operator. Applications to hierarchical minimization and fixed-point problems are also given and the multivalued case is reached by replacing the multivalued operator by its Yosida approximate which is always Lipschitz continuous. [ABSTRACT FROM AUTHOR]

This paper presents a novel optimization model called hierarchical swarm optimization (HSO), which simulates the natural hierarchical complex system from where more complex intelligence can emerge for complex problems solving. This proposed model is intended to suggest ways that the performance of HSO-based algorithms on complex optimization problems can be significantly improved. This performance improvement is obtained by constructing the HSO hierarchies, which means that an agent in a higher level swarm can be composed of swarms of other agents from lower level and different swarms of different levels evolve on different spatiotemporal scale. A novel optimization algorithm (named PS²O), based on the HSO model, is instantiated and tested to illustrate the ideas of HSO model clearly. Experiments were conducted on a set of 17 benchmark optimization problems including both continuous and discrete cases. The results demonstrate remarkable performance of the PS²O algorithm on all chosen benchmark functions when compared to several successful swarm intelligence and evolutionary algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a strategy for designing a robust discrete-time adaptive controller for stabilizing linear time-invariant (LTI) continuous-time dynamic systems. Such systems may be unstable and noninversely stable in the worst case. A reduced-order model is considered to design the adaptive controller. The control design is based on the discretization of the system with the use of a multirate sampling device with fast-sampled control signal. A suitable on-line adaptation of the multirate gains guarantees the stability of the inverse of the discretized estimated model, which is used to parameterize the adaptive controller. A dead zone is included in the parameters estimation algorithm for robustness purposes under the presence of unmodeled dynamics in the controlled dynamic system. The adaptive controller guarantees the boundedness of the system measured signal for all time. Some examples illustrate the efficacy of this control strategy. [ABSTRACT FROM AUTHOR]

Virtual enterprise (VE) has to manage its risk effectively in order to guarantee the profit. However, restricting the risk in a VE to the acceptable level is considered difficult due to the agility and diversity of its distributed characteristics. First, in this paper, an optimization model for VE risk management based on distributed decision making model is introduced. This optimization model has two levels, namely, the top model and the base model, which describe the decision processes of the owner and the partners of the VE, respectively. In order to solve the proposed model effectively, this work then applies two powerful artificial intelligence optimization techniques known as evolutionary algorithms (EA) and swarm intelligence (SI). Experiments present comparative studies on the VE risk management problem for one EA and three state-of-the-art SI algorithms. All of the algorithms are evaluated against a test scenario, in which the VE is constructed by one owner and different partners. The simulation results show that the PS²O algorithm, which is a recently developed SI paradigm simulating symbiotic coevolution behavior in nature, obtains the superior solution for VE risk management problem than the other algorithms in terms of optimization accuracy and computation robustness. [ABSTRACT FROM AUTHOR]

We consider a curve reconstruction problem from unorganized point clouds with noise. In general, the result of curve reconstruction depends on how to select and order the representative points to resemble the shape of the clouds. We exploit a natural distance based on a property of one-dimensional Brownian motion to order sample points, which simultaneously reflect smoothness and nearness of points, so that our algorithm is able to reconstruct not only simple curves but also nonsimple curves. Numerous examples show that this algorithm is effective. The natural distance proposed in this paper is able to play an important role in a variety of fields of measuring the distance of points with considering direction. [ABSTRACT FROM AUTHOR]

Model-based analysis and synthesis applied to the dynamics, guidance, and control of an autonomous undersea vehicle are presented. As the dynamic model for describing vehicle motion mathematically, the equations of motion are derived. The stability derivatives in the equations of motion are determined by a simulation-based technique using computational fluid dynamics analysis. The dynamic model is applied to the design of the low-level control systems, offering model-based synthetic approach in dynamics and control applications. As an intelligent navigational strategy for undersea vehicles, we present the optimal guidance in environmental disturbances. The optimal guidance aims at the minimum-time transit of a vehicle in an environmental flow disturbance. In this paper, a newly developed algorithm for obtaining the numerical solution of the optimal guidance law is presented. The algorithm is a globally working procedure deriving the optimal guidance in any deterministic environmental disturbance. As a fail-safe tactic in achieving the optimal navigation in environments of moderate uncertainty, we propose the quasi-optimal guidance. Performances of the optimal and the quasi-optimal guidances are demonstrated by the simulated navigations in a few environmental disturbances. [ABSTRACT FROM AUTHOR]

This paper demonstrates that nonnegative matrix factorisation is mathematically related to a class of neural networks that employ negative feedback as a mechanism of competition. This observation inspires a novel learning algorithm which we call Divisive Input Modulation (DIM). The proposed algorithm provides a mathematically simple and computationally efficient method for the unsupervised learning of image components, even in conditions where these elementary features overlap considerably. To test the proposed algorithm, a novel artificial task is introduced which is similar to the frequently-used bars problem but employs squares rather than bars to increase the degree of overlap between components. Using this task, we investigate how the proposed method performs on the parsing of artificial images composed of overlapping features, given the correct representation of the individual components; and secondly, we investigate how well it can learn the elementary components from artificial training images. We compare the performance of the proposed algorithm with its predecessors including variations on these algorithms that have produced state-of-the-art performance on the bars problem. The proposed algorithm is more successful than its predecessors in dealing with overlap and occlusion in the artificial task that has been used to assess performance. [ABSTRACT FROM AUTHOR]

Generalized autocalibrating partially parallel acquisition (GRAPPA) has been a widely used parallel MRI technique. However, noise deteriorates the reconstructed image when reduction factor increases or even at low reduction factor for some noisy datasets. Noise, initially generated from scanner, propagates noise-related errors during fitting and interpolation procedures of GRAPPA to distort the final reconstructed image quality. The basic idea we proposed to improve GRAPPA is to remove noise from a system identification perspective. In this paper, we first analyze the GRAPPA noise problem from a noisy input-output system perspective; then, a new framework based on errors-in-variables (EIV) model is developed for analyzing noise generation mechanism in GRAPPA and designing a concrete method—instrument variables (IV) GRAPPA to remove noise. The proposed EIV framework provides possibilities that noiseless GRAPPA reconstruction could be achieved by existing methods that solve EIV problem other than IV method. Experimental results show that the proposed reconstruction algorithm can better remove the noise compared to the conventional GRAPPA, as validated with both of phantom and in vivo brain data. [ABSTRACT FROM AUTHOR]

Constructing rooted phylogenetic networks from rooted phylogenetic trees has become an important problem in molecular evolution. So far, many methods have been presented in this area, in which most efficient methods are based on the incompatible graph, such as the CASS, the LNETWORK, and the BIMLR. This paper will research the commonness of the methods based on the incompatible graph, the relationship between incompatible graph and the phylogenetic network, and the topologies of incompatible graphs. We can find out all the simplest datasets for a topology G and construct a network for every dataset. For any one dataset C, we can compute a network from the network representing the simplest dataset which is isomorphic to C. This process will save more time for the algorithms when constructing networks. [ABSTRACT FROM AUTHOR]

Multiobjective evolutionary algorithms have incorporated surrogate models in order to reduce the number of required evaluations to approximate the Pareto front of computationally expensive multiobjective optimization problems. Currently, few works have reviewed the state of the art in this topic. However, the existing reviews have focused on classifying the evolutionary multiobjective optimization algorithms with respect to the type of underlying surrogate model. In this paper, we center our focus on classifying multiobjective evolutionary algorithms with respect to their integration with surrogate models. This interaction has led us to classify similar approaches and identify advantages and disadvantages of each class. [ABSTRACT FROM AUTHOR]

Keystroke dynamics based authentication is one of the prevention mechanisms used to protect one’s account from criminals’ illegal access. In this authentication mechanism, keystroke dynamics are used to capture patterns in a user typing behavior. Sequence alignment is shown to be one of effective algorithms for keystroke dynamics based authentication, by comparing the sequences of keystroke data to detect imposter’s anomalous sequences. In previous research, static divisor has been used for sequence generation from the keystroke data, which is a number used to divide a time difference of keystroke data into an equal-length subinterval. After the division, the subintervals are mapped to alphabet letters to form sequences. One major drawback of this static divisor is that the amount of data for this subinterval generation is often insufficient, which leads to premature termination of subinterval generation and consequently causes inaccurate sequence alignment. To alleviate this problem, we introduce sequence alignment of dynamic divisor (SADD) in this paper. In SADD, we use mean of Horner’s rule technique to generate dynamic divisors and apply them to produce the subintervals with different length. The comparative experimental results with SADD and other existing algorithms indicate that SADD is usually comparable to and often outperforms other existing algorithms. [ABSTRACT FROM AUTHOR]

In wireless sensor network (WSN), the sensors are deployed and placed uniformly to transmit the sensed data to a centralized station periodically. So, the major threat of the WSN network layer is sinkhole attack and it is still being a challenging issue on the sensor networks, where the malicious node attracts the packets from the other normal sensor nodes and drops the packets. Thus, this paper proposes an Intrusion Detection System (IDS) mechanism to detect the intruder in the network which uses Low Energy Adaptive Clustering Hierarchy (LEACH) protocol for its routing operation. In the proposed algorithm, the detection metrics, such as number of packets transmitted and received, are used to compute the intrusion ratio (IR) by the IDS agent. The computed numeric or nonnumeric value represents the normal or malicious activity. As and when the sinkhole attack is captured, the IDS agent alerts the network to stop the data transmission. Thus, it can be a resilient to the vulnerable attack of sinkhole. Above all, the simulation result is shown for the proposed algorithm which is proven to be efficient compared with the existing work, namely, MS-LEACH, in terms of minimum computational complexity and low energy consumption. Moreover, the algorithm was numerically analyzed using TETCOS NETSIM. [ABSTRACT FROM AUTHOR]

In WSNs, routing algorithms need to handle dynamical changes of network topology, extra overhead, energy saving, and other requirements. Therefore, routing in WSNs is an extremely interesting and challenging issue. In this paper, we present a novel bio-inspired trusted routing scheme (B-iTRS) based on ant colony optimization (ACO) and Physarum autonomic optimization (PAO). For trust assessment, B-iTRS monitors neighbors’ behavior in real time, receives feedback from Sink, and then assesses neighbors’ trusts based on the acquired information. For routing scheme, each node finds routes to the Sink based on ACO and PAO. In the process of path finding, B-iTRS senses the load and trust value of each node and then calculates the link load and link trust of the found routes to support the route selection. Moreover, B-iTRS also assesses the route based on PAO to maintain the route table. Simulation results show how B-iTRS can achieve the effective performance compared to existing state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

A novel algorithm is proposed for two-dimensional direction of arrival (2D-DOA) estimation with uniform rectangular array using reduced-dimension propagator method (RD-PM). The proposed algorithm requires no eigenvalue decomposition of the covariance matrix of the receive data and simplifies two-dimensional global searching in two-dimensional PM (2D-PM) to one-dimensional local searching. The complexity of the proposed algorithm is much lower than that of 2D-PM. The angle estimation performance of the proposed algorithm is better than that of estimation of signal parameters via rotational invariance techniques (ESPRIT) algorithm and conventional PM algorithms, also very close to 2D-PM. The angle estimation error and Cramér-Rao bound (CRB) are derived in this paper. Furthermore, the proposed algorithm can achieve automatically paired 2D-DOA estimation. The simulation results verify the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

We investigate the topic of two-dimensional direction of arrival (2D-DOA) estimation for rectangular array. This paper links angle estimation problem to compressive sensing trilinear model and derives a compressive sensing trilinear model-based angle estimation algorithm which can obtain the paired 2D-DOA estimation. The proposed algorithm not only requires no spectral peak searching but also has better angle estimation performance than estimation of signal parameters via rotational invariance techniques (ESPRIT) algorithm. Furthermore, the proposed algorithm has close angle estimation performance to trilinear decomposition. The proposed algorithm can be regarded as a combination of trilinear model and compressive sensing theory, and it brings much lower computational complexity and much smaller demand for storage capacity. Numerical simulations present the effectiveness of our approach. [ABSTRACT FROM AUTHOR]

Tetrahedron beam computed tomography (TBCT) performs volumetric imaging using a stack of fan beams generated by a multiple pixel X-ray source.While the TBCT system was designed to overcome the scatter and detector issues faced by cone beam computed tomography (CBCT), it still suffers the same large cone angle artifacts as CBCT due to the use of approximate reconstruction algorithms. It has been shown that iterative reconstruction algorithms are better able to model irregular system geometries and that algebraic iterative algorithms in particular have been able to reduce cone artifacts appearing at large cone angles. In this paper, the SART algorithm is modified for the use with the different TBCT geometries and is tested using both simulated projection data and data acquired using the TBCT benchtop system.The modified SART reconstruction algorithms were able to mitigate the effects of using data generated at large cone angles and were also able to reconstruct CT images without the introduction of artifacts due to either the longitudinal or transverse truncation in the data sets. Algebraic iterative reconstruction can be especially useful for dual-source dual-detector TBCT, wherein the cone angle is the largest in the center of the field of view. [ABSTRACT FROM AUTHOR]

This paper is concerned with the problem of delay-dependent finite-time H∞ filtering for Markovian jump systems with different system modes. By using the new augmented multiple mode-dependent Lyapunov-Krasovskii functional and employing the proposed integrals inequalities in the derivation of our results, a novel sufficient condition for finite-time boundness with an H∞ performance index is derived. Particularly, two different Markov processes have been considered for modeling the randomness of system matrix and the state delay. Based on the derived condition, the H∞ filtering problem is solved, and an explicit expression of the desired filter is also given; the system trajectory stays within a prescribed bound during a specified time interval. Finally, a numerical example is given to illustrate the effectiveness and the potential of the proposed techniques. [ABSTRACT FROM AUTHOR]

When using interior methods for solving semidefinite programming (SDP), one needs to solve a system of linear equations at each iteration. For problems of large size, solving the system of linear equations can be very expensive. In this paper, based on a semismooth equation reformulation using Fischer's function, we propose a filter method with trust region for solving large-scale SDP problems. At each iteration we perform a number of conjugate gradient iterations, but do not need to solve a system of linear equations. Under mild assumptions, the convergence of this algorithm is established. Numerical examples are given to illustrate the convergence results obtained. [ABSTRACT FROM AUTHOR]

In consideration of the significant role the brake plays in ensuring the fast and safe running of vehicles, and since the present parameter optimization design models of brake are far from the practical application, this paper proposes a multiobjective optimization model of drum brake, aiming at maximizing the braking efficiency and minimizing the volume and temperature rise of drum brake. As the commonly used optimization algorithms are of some deficiency, we present a differential evolution cellular multiobjective genetic algorithm (DECell) by introducing differential evolution strategy into the canonical cellular genetic algorithm for tackling this problem. For DECell, the gained Pareto front could be as close as possible to the exact Pareto front, and also the diversity of nondominated individuals could be better maintained. The experiments on the test functions reveal that DECell is of good performance in solving high-dimension nonlinear multiobjective problems. And the results of optimizing the new brake model indicate that DECell obviously outperforms the compared popular algorithm NSGA-II concerning the number of obtained brake design parameter sets, the speed, and stability for finding them. [ABSTRACT FROM AUTHOR]

In wireless channel assignment, control channels are often needed for coordination among wireless devices. In this paper, we propose an algorithm for finding the optimal set of control channels given a number of wireless devices and the ranges of channels these devices can access. [ABSTRACT FROM AUTHOR]

Image motion deblurring with unknown blur kernel is an ill-posed problem. This paper proposes a blind motion deblurring approach that solves blur kernel and the latent image robustly. For kernel optimization, an edge mask is used as an image prior to improve kernel update, then an edge selection mask is adopted to improve image update. In addition, an alternative iterative method is introduced to perform kernel optimization under a multiscale scheme. Moreover, for image restoration, a total-variation-(TV)- based algorithm is proposed to recover the latent image via nonblind deconvolution. Experimental results demonstrate that our method obtains accurate blur kernel and achieves better deblurring results than previous works. [ABSTRACT FROM AUTHOR]

A filled function approach is proposed for solving a non-smooth unconstrained global optimization problem. First, the definition of filled function in Zhang2009 for smooth global optimization is extended to non-smooth case and a new one is put forwarded. Then, a novel filled function is proposed for non-smooth the global optimization and a corresponding non-smooth algorithm based on the filled function is designed. At last, a numerical test is made. The computational results demonstrate that the proposed approach is efficient and reliable. [ABSTRACT FROM AUTHOR]

The well-known root-locus method is developed for special subset of linear time-invariant systems known as fractional-order systems. Transfer functions of these systems are rational functions with polynomials of rational powers of the Laplace variable s. Such systems are defined on a Riemann surface because of their multivalued nature. A set of rules for plotting the root loci on the first Riemann sheet is presented. The important features of the classical root-locus method such as asymptotes, roots condition on the real axis, and breakaway points are extended to fractional case. It is also shown that the proposed method can assess the closed-loop stability of fractional-order systems in the presence of a varying gain in the loop. Three illustrative examples are presented to confirm the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

On the basis of studying datasets of students' course scores, we constructed a Bayesian network and undertook probabilistic inference analysis. We selected six requisite courses in computer science as Bayesian network nodes. We determined the order of the nodes based on expert knowledge. Using 356 datasets, the K2 algorithm learned the Bayesian network structure. Then, we used maximum a posteriori probability estimation to learn the parameters. After constructing the Bayesian network, we used the message-passing algorithm to predict and infer the results. Finally, the results of dynamic knowledge inference were presented through a detailed inference process. In the absence of any evidence node information, the probability of passing other courses was calculated. A mathematics course (a basic professional course) was chosen as the evidence node to dynamically infer the probability of passing other courses. Over time, the probability of passing other courses greatly improved, and the inference results were consistent with the actual values and can thus be visualized and applied to an actual school management system. [ABSTRACT FROM AUTHOR]

Finding an optimal set of discriminative features is still a crucial but challenging task in biomedical science. The complexity of the task is intensified when any of the two scenarios arise: a highly dimensioned dataset and a small sample-sized dataset. The first scenario poses a big challenge to existing machine learning approaches since the search space for identifying the most relevant feature subset is so diverse to be explored quickly while utilizing minimal computational resources. On the other hand, the second aspect poses a challenge of too few samples to learn from. Though many hybrid metaheuristic approaches (i.e., combining multiple search algorithms) have been proposed in the literature to address these challenges with very attractive performance compared to their counterpart standard standalone metaheuristics, more superior hybrid approaches can be achieved if the individual metaheuristics within the proposed hybrid algorithms are improved prior to the hybridization. Motivated by this, we propose a new hybrid Excited- (E-) Adaptive Cuckoo Search- (ACS-) Intensification Dedicated Grey Wolf Optimization (IDGWO), i.e., EACSIDGWO. EACSIDGWO is an algorithm where the step size of ACS and the nonlinear control strategy of parameter a → of the IDGWO are innovatively made adaptive via the concept of the complete voltage and current responses of a direct current (DC) excited resistor-capacitor (RC) circuit. Since the population has a higher diversity at early stages of the proposed EACSIDGWO algorithm, both the ACS and IDGWO are jointly involved in local exploitation. On the other hand, to enhance mature convergence at latter stages of the proposed algorithm, the role of ACS is switched to global exploration while the IDGWO is still left conducting the local exploitation. To prove that the proposed algorithm is superior in providing a good learning from fewer instances and an optimal feature selection from information-rich biomedical data, all these while maintaining a high classification accuracy of the data, the EACSIDGWO is employed to solve the feature selection problem. The EACSIDGWO as a feature selector is tested on six standard biomedical datasets from the University of California at Irvine (UCI) repository. The experimental results are compared with the state-of-the-art feature selection techniques, including binary ant-colony optimization (BACO), binary genetic algorithm (BGA), binary particle swarm optimization (BPSO), and extended binary cuckoo search algorithm (EBCSA). These results reveal that the EACSIDGWO has comprehensive superiority in tackling the feature selection problem, which proves the capability of the proposed algorithm in solving real-world complex problems. Furthermore, the superiority of the proposed algorithm is proved via various numerical techniques like ranking methods and statistical analysis. [ABSTRACT FROM AUTHOR]

A simple and efficient algorithm for finding the GCD of a pair of univariate polynomials is derived. The process requires only successive subtraction of two monic polynomials. Amazingly, this approach gives the desired GCD for a pair of test polynomials of very high degree, such as (x + 1)⋀ 1000 and its derivative. [ABSTRACT FROM AUTHOR]

Introducing the notion of cross means we give iterative algorithms involving the power binomial mean and converging to the power logarithmic and difference means. At the end, we address a list of open problems derived from our present work. [ABSTRACT FROM AUTHOR]

A rational divide-and-conquer relation, which is a natural generalization of the classical divide-and-conquer relation, is a recursive equation of the form f(bn) = R(f (n), f (n) ,…,f(b -1) n) + g (n) where is a positive integer ≥ 2; a rational function in b - 1 variables and g a given function. Closed-form solutions of certain rational divide-and-conquer relations which can be used to characterize the trigonometric cotangent-tangent and the hyperbolic cotangent-tangent function solutions are derived and their global behaviors are investigated. [ABSTRACT FROM AUTHOR]

The variational iteration algorithm combined with the exp-function method is suggested to solve the generalized Benjamin-Bona-Mahony equation (BBM) with variable coefficients. Periodic and soliton solutions are formally derived in a general form. Some particular cases are considered. [ABSTRACT FROM AUTHOR]