Search

Aim Fuzzy wavelet neural network (FWNN) has proven to be a promising strategy in the identification of nonlinear systems. The network considers both global and local properties, deals with imprecision present in sensory data, leading to desired precisions. In this paper, we proposed a new FWNN model nominated “Fuzzy Jump Wavelet Neural Network” (FJWNN) for identifying dynamic nonlinear-linear systems, especially in practical applications. Methods The proposed FJWNN is a fuzzy neural network model of the Takagi-Sugeno-Kang type whose consequent part of fuzzy rules is a linear combination of input regressors and dominant wavelet neurons as a sub-jump wavelet neural network. Each fuzzy rule can locally model both linear and nonlinear properties of a system. The linear relationship between the inputs and the output is learned by neurons with linear activation functions, whereas the nonlinear relationship is locally modeled by wavelet neurons. Orthogonal least square (OLS) method and genetic algorithm (GA) are respectively used to purify the wavelets for each sub-JWNN. In this paper, fuzzy rule induction improves the structure of the proposed model leading to less fuzzy rules, inputs of each fuzzy rule and model parameters. The real-world gas furnace and the real electromyographic (EMG) signal modeling problem are employed in our study. In the same vein, piecewise single variable function approximation, nonlinear dynamic system modeling, and Mackey–Glass time series prediction, ratify this method superiority. The proposed FJWNN model is compared with the state-of-the-art models based on some performance indices such as RMSE, RRSE, Rel ERR%, and VAF%. Results The proposed FJWNN model yielded the following results: RRSE (mean±std) of 10e-5±6e-5 for piecewise single-variable function approximation, RMSE (mean±std) of 2.6–4±2.6e-4 for the first nonlinear dynamic system modelling, RRSE (mean±std) of 1.59e-3±0.42e-3 for Mackey–Glass time series prediction, RMSE of 0.3421 for gas furnace modelling and VAF% (mean±std) of 98.24±0.71 for the EMG modelling of all trial signals, indicating a significant enhancement over previous methods. Conclusions The FJWNN demonstrated promising accuracy and generalization while moderating network complexity. This improvement is due to applying main useful wavelets in combination with linear regressors and using fuzzy rule induction. Compared to the state-of-the-art models, the proposed FJWNN yielded better performance and, therefore, can be considered a novel tool for nonlinear system identification

One of the most challenging problems in recent antenna engineering fields is to achieve highly reliable beamforming capabilities in an extremely restricted space of small handheld devices. In this paper, we introduce a new perspective on single-radiator multiple-port (SRMP) antenna to alter the traditional approach of multiple-antenna arrays for improving beamforming performances with reduced aperture sizes. The major contribution of this paper is to demonstrate the beamforming capability of the SRMP antenna for use as an extremely miniaturized front-end component in more sophisticated beamforming applications. To examine the beamforming capability, the radiation properties and the array factor of the SRMP antenna are theoretically formulated for electromagnetic characterization and are used as complex weights to form adaptive array patterns. Then, its fundamental performance limits are rigorously explored through enumerative studies by varying the dielectric constant of the substrate, and field tests are conducted using a beamforming hardware to confirm the feasibility. The results demonstrate that the new perspective of the SRMP antenna allows for improved beamforming performances with the ability of maintaining consistently smaller aperture sizes compared to the traditional multiple-antenna arrays.

Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole.

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.

The logistic coupled map lattices (LCML) have been widely investigated as well as their pattern dynamics. The patterns formation may depend on not only fluctuations of system parameters, but variation of the initial conditions. However, the mathematical discussion is quite few for the effect of initial values so far. The present paper is concerned with the pattern formation for a two-dimensional Logistic coupled map lattice, where any initial value can be linear expressed by corresponding eigenvectors, and patterns formation can be determined by selecting the corresponding eigenvectors. A set of simulations are conducted whose results demonstrate the fact. The method utilized in the present paper could be applied to other discrete systems as well.

The existence of parallel joints has an impact on the size effect of the uniaxial compressive strength of rock, but the relationship is yet to be obtained. In this paper, the influence of parallel-joint spacing on the size effect and characteristic size of rock uniaxial compressive strength is studied by establishing five types of parallel-joint-spacing simulation schemes. The influence of parallel-joint spacing on the size effect of rock uniaxial compressive strength is explored by analyzing the stress–strain curves of rocks with different parallel-joint spacings and rock sizes. The relationship between the uniaxial compressive strength and the size of the rock with parallel joints and its special mathematical model are obtained, and the particular form of the compressive-strength characteristic size and parallel-joint spacing is obtained.

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.

Entropy is an important index for describing the structure, function, and evolution of network. The existing research on entropy is primarily applied to undirected networks. Compared with an undirected network, a directed network involves a special asymmetric transfer. The research on the entropy of directed networks is very significant to effectively quantify the structural information of the whole network. Typical complex network models include nearest-neighbour coupling network, small-world network, scale-free network, and random network. These network models are abstracted as undirected graphs without considering the direction of node connection. For complex networks, modeling through the direction of network nodes is extremely challenging. In this paper, based on these typical models of complex network, a directed network model considering node connection in-direction is proposed, and the eigenvalue entropies of three matrices in the directed network is defined and studied, where the three matrices are adjacency matrix, in-degree Laplacian matrix and in-degree signless Laplacian matrix. The eigenvalue-based entropies of three matrices are calculated in directed nearest-neighbor coupling, directed small world, directed scale-free and directed random networks. Through the simulation experiment on the real directed network, the result shows that the eigenvalue entropy of the real directed network is between the eigenvalue entropy of directed scale-free network and directed small-world network.

This paper discusses the optimal control of pressure using the zero-gradient control (ZGC) approach. It is applied for the first time in the study to control the optimal pressure of hydrogen natural gas mixture in an inclined pipeline. The solution to the flow problem is first validated with existing results using the Taylor series approximation, regression analysis and the Runge-Kutta method combined. The optimal pressure is then determined using ZGC where the optimal set points are calculated without having to solve the non-linear system of equations associated with the standard optimization problem. It is shown that the mass ratio is the more effective parameter compared to the initial pressure in controlling the maximum variation of pressure in a gas pipeline.

Researchers are increasingly showing interest in the application of a Butler matrix for fifth-generation (5G) base station antennas. However, the design of the Butler matrix is challenging at millimeter wave because of the very small wavelength. The literature has reported issues of high insertion losses and incorrect output phases at the output ports of the Butler matrix, which affects the radiation characteristics. To overcome these issues, the circuit elements of the Butler matrix such as the crossover, the quadrature hybrid and the phase shifter must be designed using highly accurate dimensions. This paper presents a low-loss and compact single-layer 8 × 8 Butler matrix operating at 28 GHz. The optimum design of each circuit element is also demonstrated in detail. The designed Butler matrix was fabricated to validate the simulated results. The measured results showed return losses of less than −10 dB at 28 GHz. The proposed Butler matrix achieved a low insertion loss and a low phase error of ± 2 dB and ± 10°, respectively. In sum, this work obtained a good agreement between the simulated and measured results.

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.

High-temperature thermal contact resistance (TCR) plays an important role in heat-pipe-cooled thermal protection structures due to the existence of contact interface between the embedded heat pipe and the heat resistive structure, and the reduction mechanism of thermal contact resistance is of special interests in the design of such structures. The present paper proposed a finite element model of the high-temperature thermal contact resistance based on the multi-point contact model with the consideration of temperature-dependent material properties, heat radiation through the cavities at the interface and the effect of thermal interface material (TIM), and the geometry parameters of the finite element model are determined by simple surface roughness test and experimental data fitting. The experimental results of high-temperature thermal contact resistance between superalloy GH600 and C/C composite material are employed to validate the present finite element model. The effect of the crucial parameters on the thermal contact resistance with and without TIM are also investigated with the proposed finite element model.

In this paper, we propose a connectivity-preserving flocking algorithm for multi-agent systems in which the neighbor set of each agent is determined by the hybrid metric-topological distance so that the interaction topology can be represented as the range-limited Delaunay graph, which combines the properties of the commonly used disk graph and Delaunay graph. As a result, the proposed flocking algorithm has the following advantages over the existing ones. First, range-limited Delaunay graph is sparser than the disk graph so that the information exchange among agents is reduced significantly. Second, some links irrelevant to the connectivity can be dynamically deleted during the evolution of the system. Thus, the proposed flocking algorithm is more flexible than existing algorithms, where links are not allowed to be disconnected once they are created. Finally, the multi-agent system spontaneously generates a regular quasi-lattice formation without imposing the constraint on the ratio of the sensing range of the agent to the desired distance between two adjacent agents. With the interaction topology induced by the hybrid distance, the proposed flocking algorithm can still be implemented in a distributed manner. We prove that the proposed flocking algorithm can steer the multi-agent system to a stable flocking motion, provided the initial interaction topology of multi-agent systems is connected and the hysteresis in link addition is smaller than a derived upper bound. The correctness and effectiveness of the proposed algorithm are verified by extensive numerical simulations, where the flocking algorithms based on the disk and Delaunay graph are compared.

This paper proposes the correction of faulty sensors using a synthesis of the greedy sparse constrained optimization GSCO) technique. The failure of sensors can damage the radiation power pattern in terms of sidelobes and nulls. The synthesis problem can recover the wanted power pattern with reduced number of sensors into the background of greedy algorithm and solved with orthogonal matching pursuit (OMP) technique. Numerical simulation examples of linear arrays are offered to demonstrate the effectiveness of getting the wanted power pattern with a reduced number of antenna sensors which is compared with the available techniques in terms of sidelobes level and number of nulls.

Currently, tracking in photovoltaic (PV) systems suffers from some problems such as high energy consumption, poor anti-interference performance, and large tracking errors. This paper presents a solar PV tracking system on the basis of an improved perturbation and observation method, which maximizes photoelectric conversion efficiency. According to the projection principle, we design a sensor module with a light-intensity-detection module for environmental light-intensity measurement. The effect of environmental factors on the system operation is reduced, and intelligent identification of the weather is realized. This system adopts the discrete-type tracking method to reduce power consumption. A mechanical structure with a level-pitch double-degree-of-freedom is designed, and attitude correction is performed by closed-loop control. A worm-and-gear mechanism is added, and the reliability, stability, and precision of the system are improved. Finally, the perturbation and observation method designed and improved by this study was tested by simulated experiments. The experiments verified that the photoelectric sensor resolution can reach 0.344°, the tracking error is less than 2.5°, the largest improvement in the charge efficiency can reach 44.5%, and the system steadily and reliably works.

Parkinson's disease (PD) is a common and debilitating neurodegenerative disorder that affects patients in all countries and of all nationalities. Magnetic resonance imaging (MRI) is currently one of the most widely used diagnostic imaging techniques utilized for detection of neurologic diseases. Changes in structural biomarkers will likely play an important future role in assessing progression of many neurological diseases inclusive of PD. In this paper, we derived structural biomarkers from diffusion MRI (dMRI), a structural modality that allows for non-invasive inference of neuronal fiber connectivity patterns. The structural biomarker we use is the ensemble average propagator (EAP), a probability density function fully characterizing the diffusion locally at a voxel level. To assess changes with respect to a normal anatomy, we construct an unbiased template brain map from the EAP fields of a control population. Use of an EAP captures both orientation and shape information of the diffusion process at each voxel in the dMRI data, and this feature can be a powerful representation to achieve enhanced PD brain mapping. This template brain map construction method is applicable to small animal models as well as to human brains. The differences between the control template brain map and novel patient data can then be assessed via a nonrigid warping algorithm that transforms the novel data into correspondence with the template brain map, thereby capturing the amount of elastic deformation needed to achieve this correspondence. We present the use of a manifold-valued feature called the Cauchy deformation tensor (CDT), which facilitates morphometric analysis and automated classification of a PD versus a control population. Finally, we present preliminary results of automated discrimination between a group of 22 controls and 46 PD patients using CDT. This method may be possibly applied to larger population sizes and other parkinsonian syndromes in the near future.

The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS) is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive) and exploitation (intensive) of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be used in global optimization problems.

The design and verification of complex electronic systems, especially the analog and mixed-signal ones, prove to be extremely time consuming tasks, if only circuit-level simulations are involved. A significant amount of time can be saved if a cost effective solution is used for the extensive analysis of the system, under all conceivable conditions. This paper proposes a data-driven method to build fast to evaluate, but also accurate metamodels capable of generating not-yet simulated waveforms as a function of different combinations of the parameters of the system. The necessary data are obtained by early-stage simulation of an electronic control system from the automotive industry. The metamodel development is based on three key elements: a wavelet transform for waveform characterization, a genetic algorithm optimization to detect the optimal wavelet transform and to identify the most relevant decomposition coefficients, and an artificial neuronal network to derive the relevant coefficients of the wavelet transform for any new parameters combination. The resulted metamodels for three different waveform families are fully reliable. They satisfy the required key points: high accuracy (a maximum mean squared error of 7.1x10-5 for the unity-based normalized waveforms), efficiency (fully affordable computational effort for metamodel build-up: maximum 18 minutes on a general purpose computer), and simplicity (less than 1 second for running the metamodel, the user only provides the parameters combination). The metamodels can be used for very efficient generation of new waveforms, for any possible combination of dependent parameters, offering the possibility to explore the entire design space. A wide range of possibilities becomes achievable for the user, such as: all design corners can be analyzed, possible worst-case situations can be investigated, extreme values of waveforms can be discovered, sensitivity analyses can be performed (the influence of each parameter on the output waveform).

Grade information has been considered in Yuan et al. (2007) wherein they proposed a Quasi-CRM method to incorporate the grade toxicity information in phase I trials. A potential problem with the Quasi-CRM model is that the choice of skeleton may dramatically vary the performance of the CRM model, which results in similar consequences for the Quasi-CRM model. In this paper, we propose a new model by utilizing bayesian model selection approach – Robust Quasi-CRM model – to tackle the above-mentioned pitfall with the Quasi-CRM model. The Robust Quasi-CRM model literally inherits the BMA-CRM model proposed by Yin and Yuan (2009) to consider a parallel of skeletons for Quasi-CRM. The superior performance of Robust Quasi-CRM model was demonstrated by extensive simulation studies. We conclude that the proposed method can be freely used in real practice.

Online users nowadays are facing serious information overload problem. In recent years, recommender systems have been widely studied to help people find relevant information. Adaptive social recommendation is one of these systems in which the connections in the online social networks are optimized for the information propagation so that users can receive interesting news or stories from their leaders. Validation of such adaptive social recommendation methods in the literature assumes uniform distribution of users' activity frequency. In this paper, our empirical analysis shows that the distribution of online users' activity is actually heterogenous. Accordingly, we propose a more realistic multi-agent model in which users' activity frequency are drawn from a power-law distribution. We find that previous social recommendation methods lead to serious delay of information propagation since many users are connected to inactive leaders. To solve this problem, we design a new similarity measure which takes into account users' activity frequencies. With this similarity measure, the average delay is significantly shortened and the recommendation accuracy is largely improved.

Cortical spreading depression (CSD) is a pathophysiological phenomenon, which underlies some neurological disorders, such as migraine and stroke, but its mechanisms are still not completely understood. One of the striking facts is that the spatiotemporal evolution of CSD wave is varying. Observations in experiments reveal that a CSD wave may propagate through the entire cortex, or just bypass some areas of the cortex. In this paper, we have applied a 2D reaction-diffusion equation with recovery term to study the spatiotemporal evolution of CSD. By modulating the recovery rate from CSD in the modeled cortex, CSD waves with different spatiotemporal evolutions, either bypassing some areas or propagating slowly in these areas, were present. Moreover, spiral CSD waves could also be induced in case of the transiently altered recovery rate, i.e. block release from the absolute refractory period. These results suggest that the refractory period contributes to the different propagation patterns of CSD, which may help to interpret the mechanisms of CSD propagation.

Disordered regions, i.e., regions of proteins that do not adopt a stable three-dimensional structure, have been shown to play various and critical roles in many biological processes. Predicting and understanding their formation is therefore a key sub-problem of protein structure and function inference. A wide range of machine learning approaches have been developed to automatically predict disordered regions of proteins. One key factor of the success of these methods is the way in which protein information is encoded into features. Recently, we have proposed a systematic methodology to study the relevance of various feature encodings in the context of disulfide connectivity pattern prediction. In the present paper, we adapt this methodology to the problem of predicting disordered regions and assess it on proteins from the 10th CASP competition, as well as on a very large subset of proteins extracted from PDB. Our results, obtained with ensembles of extremely randomized trees, highlight a novel feature function encoding the proximity of residues according to their accessibility to the solvent, which is playing the second most important role in the prediction of disordered regions, just after evolutionary information. Furthermore, even though our approach treats each residue independently, our results are very competitive in terms of accuracy with respect to the state-of-the-art. A web-application is available at http://m24.giga.ulg.ac.be:81/x3Disorder.

Collaboration may be understood as the execution of coordinated tasks (in the most general sense) by groups of users, who cooperate for achieving a common goal. Collaboration is a fundamental assumption and requirement for the correct operation of many communication systems. The main challenge when creating collaborative systems in a decentralized manner is dealing with the fact that users may behave in selfish ways, trying to obtain the benefits of the tasks but without participating in their execution. In this context, Game Theory has been instrumental to model collaborative systems and the task allocation problem, and to design mechanisms for optimal allocation of tasks. In this paper, we revise the classical assumptions and propose a new approach to this problem. First, we establish a system model based on heterogenous nodes (users, players), and propose a basic distributed mechanism so that, when a new task appears, it is assigned to the most suitable node. The classical technique for compensating a node that executes a task is the use of payments (which in most networks are hard or impossible to implement). Instead, we propose a distributed mechanism for the optimal allocation of tasks without payments. We prove this mechanism to be robust event in the presence of independent selfish or rationally limited players. Additionally, our model is based on very weak assumptions, which makes the proposed mechanisms susceptible to be implemented in networked systems (e.g., the Internet)., Comment: 23 pages, 5 figures, 3 algorithms

In chemistry and computational biology, structural graph descriptors have been proven essential for characterizing the structure of chemical and biological networks. It has also been demonstrated that they are useful to derive empirical models for structure-oriented drug design. However, from a more general (complex network-oriented) point of view, investigating mathematical properties of structural descriptors, such as their uniqueness and structural interpretation, is also important for an in-depth understanding of the underlying methods. In this paper, we emphasize the evaluation of the uniqueness of distance, degree and eigenvalue-based measures. Among these are measures that have been recently investigated extensively. We report numerical results using chemical and exhaustively generated graphs and also investigate correlations between the measures.