Search

Quantifying the impact of a scholarly paper is of great significance, yet the effect of geographical distance of cited papers has not been explored. In this paper, we examine 30,596 papers published in Physical Review C, and identify the relationship between citations and geographical distances between author affiliations. Subsequently, a relative citation weight is applied to assess the impact of a scholarly paper. A higher-order weighted quantum PageRank algorithm is also developed to address the behavior of multiple step citation flow. Capturing the citation dynamics with higher-order dependencies reveals the actual impact of papers, including necessary self-citations that are sometimes excluded in prior studies. Quantum PageRank is utilized in this paper to help differentiating nodes whose PageRank values are identical. [ABSTRACT FROM AUTHOR]

It is vital to consider acoustic scattering when using geometrical acoustic simulation techniques, such as ray tracing. However, there are few methods for modelling scattering, and most rely on strong assumptions of uniformity on the distribution of scattered energy. In this paper, a model for directional scattering in ray tracers is presented. The model is based on an idealized model of a 1D scatterer, which is then used to extend the most commonly used scattering algorithm in ray tracers today. The developed algorithm is implemented in a ray tracer and tested to evaluate its performance compared to existing methods. It is found that the directional scattering algorithm can be used to replicate measured effects on room acoustic parameters caused by changes in the orientation of 1D scatterers. [ABSTRACT FROM AUTHOR]

An analytical solution of the Boussinesq equations for the motion of a viscous stably stratified fluid driven by a surface thermal forcing with large horizontal gradients (step changes) is obtained. The solution can be used to verify that computer codes for Boussinesq fluid system simulations are free of errors in formulation of wall boundary conditions, and to evaluate the relative performances of competing numerical algorithms. Because the solution pertains to flows driven by a surface thermal forcing, one of its main applications may be for testing the no-slip, impermeable wall boundary conditions for the pressure Poisson equation. Examples of such tests are presented. [ABSTRACT FROM AUTHOR]

Recent increase of spatial resolution for satellite instruments has it made feasible to study distributions of trace gas column densities on a regional scale. For this application a new gridding algorithm was developed to map measurements from the instrument's frame of reference (Level 2) onto a longitude-latitude grid (Level 3). The algorithm is designed for the Ozone Monitoring Instrument (OMI) and can be employed easily to similar instruments, for example, the upcoming TROPOspheric Monitoring Instrument (TROPOMI). Trace gas distributions are reconstructed by a continuous parabolic spline surface. The algorithm explicitly considers the spatially varying sensitivity of the sensor resulting from the instrument function. At the swath edge, the inverse problem of computing the spline coefficients is very sensitive to measurement errors and is regularised by a second-order difference matrix. Since this regularisation corresponds to the penalty term for smoothing splines, it similarly attenuates the effect of measurement noise over the entire swath width. Monte Carlo simulations are conducted to study the performance of the algorithm for different distributions of trace gas column densities. The optimal weight of the penalty term is found to be proportional to the measurement uncertainty and the width of the instrument function. A comparison with an established gridding algorithm shows improved performance for small to moderate measurement errors due to better parametrization of the distribution. The resulting maps are smoother and extreme values are more accurately reconstructed. The performance improvement is further illustrated with high-resolution distributions obtained from a regional chemistry model. The new algorithm is applied to tropospheric NO2 column densities measured by OMI. Examples of regional NO2 maps are shown for densely populated areas in China, Europe and the United States of America. This work demonstrates that the newly developed gridding algorithm improves regional trace gas maps; its application could be very helpful for the study of satellite-derived trace gas distributions. [ABSTRACT FROM AUTHOR]

We present a new algorithm for satellite retrievals of the atmospheric water vapor column in the blue spectral range. The water vapor absorption cross section in the blue spectral range is much weaker than in the red spectral range. Thus the detection limit and the uncertainty of individual observations is systematically larger than for retrievals at longer wavelengths. Nevertheless, water vapor retrievals in the blue spectral range have also several advantages: since the surface albedo in the blue spectral range is similar over land and ocean, water vapor retrievals are more consistent than for longer wavelengths. Compared to retrievals at longer wavelengths, over ocean the sensitivity for atmospheric layers close to the surface is higher due to the (typically 2 to 3 times) higher ocean albedo in the blue. Water vapor retrievals in the blue spectral range are also possible for satellite sensors, which do not measure at longer wavelengths of the visible spectral range like the Ozone Monitoring instrument (OMI). We investigated details of the water vapor retrieval in the blue spectral range based on radiative transfer simulations and observations from the Global Ozone Monitoring Experiment 2 (GOME-2) and OMI. It is demonstrated that it is possible to retrieve the atmospheric water vapor column density in the blue spectral range over most parts of the globe. The findings of our study are of importance also for future satellite missions like e.g. Sentinel 4 and 5 [ABSTRACT FROM AUTHOR]

This paper does some research and discussion on the finite element analysis of a building structure, especially the computer graphics simulation method in building structure simulation. Moreover, with the support of BIM technology and computer finite element simulation technology, this paper constructs a building structure simulation system and analyzes the building structure simulation system based on actual conditions such as building structure and stress load. In addition, this paper improves the traditional structural analysis algorithm and designs experiments to evaluate the effect of the method proposed in this paper and analyze the data in the form of simulation to compare the validity of the test results. Finally, an experiment is designed to evaluate the data processing capability of the test system in this paper. The experimental analysis results verify the effectiveness of the method in this paper, which can provide relevant theoretical references for subsequent building structure simulation. [ABSTRACT FROM AUTHOR]

The aim of this systematic review is to synthesize and analyze interactive collaborative work in the virtual economy of the metaverse. We carried out a quantitative literature review of ProQuest, Scopus, and the Web of Science throughout May 2022, with search terms including "metaverse interactive environment" + "virtual employee engagement and immersive workspaces," "wearable augmented reality technology," and "spatial data mining and simulation modeling algorithms." As we analyzed research published in 2022, only 158 papers met the eligibility criteria. By removing controversial or unclear findings (scanty/unimportant data), results unsupported by replication, undetailed content, or papers having quite similar titles, we decided on 30, chiefly empirical, sources. Data visualization tools: Dimensions (bibliometric mapping) and VOSviewer (layout algorithms). Reporting quality assessment tool: PRISMA. Methodological quality assessment tools include: AXIS, Distiller SR, ROBIS, and SRDR. [ABSTRACT FROM AUTHOR]

Throughout the world, the reliability-based approach to safety design of aircraft systems is quite mature and widely used. However, there are still shortcomings in the reliability-based aircraft system safety analysis method. It cannot dynamically analyze the accident evolution process and lack consideration of the complex situation of multifactor coupling. On the basis of the original aircraft system safety analysis method, this paper innovatively proposes a functional hazard analysis (FHA) method based on the analytic hierarchy process (AHP) and multifactor fuzzy comprehensive assessment (FCA). The purpose is to improve the objectivity and quantification of the FHA method in the safety design of aircraft systems. At the same time, in the terminal airworthiness verification, this paper proposes a repeatable and controllable virtual test flight verification method, which aims to reduce the cost and cycle of the terminal airworthiness verification and expand the coverage of the envelope verification. Finally, combined with the clauses in MIL-HDBK-516B, a case calculation is carried out to verify the feasibility of the proposed method. [ABSTRACT FROM AUTHOR]

This paper introduces a novel and innovative approach to simulating random variates from two distinct probability distributions, namely the neutrosophic uniform distribution and the neutrosophic Weibull distribution. The primary objective of this research is to present a cutting-edge methodology for generating random variates by leveraging the accept-reject simulation method, particularly in the context of managing and addressing uncertainty. In addition to introducing the simulation methodology, this work will also provide comprehensive algorithms tailored to these proposed methods. These algorithms are essential for implementing the simulation techniques and will be instrumental in their practical applications. Furthermore, this study aims to explore the relationship between the level of indeterminacy and the resulting random variates. By investigating how varying degrees of indeterminacy impact random variates, we gain valuable insights into the dynamics of these distributions under different uncertainty conditions. Preliminary results suggest that random variates exhibit a trend of decreasing as indeterminacy levels increase, shedding light on the intriguing interplay between indeterminacy and random variate generation. [ABSTRACT FROM AUTHOR]

In this paper, the conceptualization of a control hardware architecture aimed to the implementation of integer- and fractional-order identification and control algorithms is presented. The proposed hardware architecture combines the capability of implementing PC-based control applications with embedded applications on microprocessor- and FPGA-based real-time targets. In this work, the potential advantages of this hardware architecture over other available alternatives are discussed from different perspectives. The experimental prototype that has been designed and built to evaluate the control hardware architecture proposed in this work is also described in detail. The thermal-based process taking place in the prototype is characterized for being reconfigurable and exhibiting fractional behaviour, which results in a suitable equipment for the purpose of fractional-order identification and control. In order to demonstrate the applicability and effectiveness of the proposed control hardware architecture, integer- and fractional-order identification and control algorithms implemented in various control technologies have been applied to the temperature-based experimental prototype described before. Detailed discussion about results and identification and control issues are provided. The main contribution of this work is to provide an efficient and practical hardware architecture for implementing fractional-order identification and control algorithms in different control technologies, helping to bridge the gap between real-time hardware solutions and software-based simulations of fractional-order systems and controllers. Finally, some conclusions and concluding remarks are offered in the industrial context. [ABSTRACT FROM AUTHOR]

To enhance the convergence performance of the affine projection sign subband adaptive filter (AP-SSAF) algorithm under highly correlated inputs, the novel AP-SSAF (NAP-SSAF) algorithm was proposed through fully utilizing the decorrelation characteristic of SAF, which obtains quicker convergence behavior than the AP-SSAF algorithm. However, under unknown system identification, the estimation accuracy of the NAP-SSAF algorithm may unavoidably decrease when the input of the adaptive filter is contaminated by noise. To alleviate this issue, in this paper, we propose the bias-compensated NAP-SSAF (BC-NAP-SSAF) algorithm to alleviate the estimated bias through employing unbiasedness criterion. Benefiting from the unbiased criterion, the proposed BC-NAP-SSAF algorithm achieves an asymptotically unbiased estimation. Moreover, the convergence bounds of the proposed BC-NAP-SSAF algorithm in the mean and mean-square senses are provided to ensure stability, which are obtained by resorting to Price's theorem along with some reasonable assumptions. The effectiveness of the derived theoretical convergence bounds is also corroborated. Finally, numerical simulations under system identification and acoustic echo cancellation applications demonstrate that the proposed BC-NAP-SSAF algorithm outperforms other algorithms in terms of estimation accuracy and tracking capability for noisy input under impulsive noise environment. [ABSTRACT FROM AUTHOR]

This paper focuses on the problem of maximizing the minimum power gain in a wide main lobe for an array antenna. To obtain the desired power gain pattern, current literatures solve the problem known as shaped beam pattern synthesis (SBPS) by setting the beam pattern expression as the cost function. The power gain in a certain direction of the array antenna is comprehensively decided by the array radiated power density and the total radiated power. Both these two parameters are affected by the selection of array elements’ weights. However, the SBPS-based methods do not take the total radiated power into account. Therefore, the SBPS-based methods cannot obtain the power gain pattern directly, and the optimal power gain pattern, consequently, cannot be guaranteed. To overcome this deficiency, this paper maximizes the minimum power gain in the desired wide main lobe by directly setting the power gain expression as the cost function. Aiming at optimizing the cost function, this paper first sets up a power gain optimization problem which has concave form. Termed this optimization problem as the power gain pattern synthesis (PGPS) problem. The concave PGPS problem is then converted to a series of convex subproblems and an iterative algorithm is proposed to solve it efficiently. Solution to the PGPS problem is proven to be able to achieve higher minimum power gain in a desired wide main lobe than the results from the SBPS-based algorithms. Simulations are carried out with both linear array antenna and planar array antenna. Comparisons with the existed SBPS-based algorithms validate the effectiveness and advantages of the proposed PGPS-based algorithm. In addition, further improvement on suppressing the sidelobe level for the PGPS problem is discussed. [ABSTRACT FROM AUTHOR]

Lift-off variation causes errors in the eddy current thickness measurements of metallic plates. In this paper, we have developed an algorithm that can compensate for this variation and produce an index that is linked to the thickness, but is virtually independent of lift-off. This index, termed as the compensated peak frequency, can be obtained from the measured multifrequency inductance spectral data using the algorithm we developed in this paper. This method has been derived through mathematical manipulation and verified by both the simulation and experimental data. Accuracy in the thickness measurements at different lift-offs proved to be within 2%. [ABSTRACT FROM AUTHOR]

This paper describes the development of a new reference controller framework for fixed and floating offshore wind turbines that greatly facilitates controller tuning and represents standard industry practices. The reference wind turbine controllers that are most commonly cited in the literature have been developed to work with specific reference wind turbines. Although these controllers have provided standard control functionalities, they are often not easy to modify for use on other turbines, so it has been challenging for researchers to run representative, fully dynamic simulations of other wind turbine designs. The Reference Open-Source Controller (ROSCO) has been developed to provide a modular reference wind turbine controller that represents industry standards and performs comparably to or better than existing reference controllers. The formulation of the ROSCO controller logic and tuning processes is presented in this paper. Control capabilities such as tip speed ratio tracking generator torque control, minimum pitch saturation, wind speed estimation, and a smoothing algorithm at near-rated operation are included to provide modern controller features. A floating offshore wind turbine feedback module is also included to facilitate growing research in the floating offshore arena. All of the standard controller implementations and control modules are automatically tuned such that a non-controls engineer or automated optimization routine can easily improve the controller performance. This article provides the framework and theoretical basis for the ROSCO controller modules and generic tuning processes. Simulations of the National Renewable Energy Laboratory (NREL) 5MWreference wind turbine and International Energy Agency 15MW reference turbine on the University of Maine semisubmersible platform are analyzed to demonstrate the controller's performance in both fixed and floating configurations, respectively. The simulation results demonstrate ROSCO's peak shaving routine to reduce maximum rotor thrusts by over 10% compared to the NREL 5MWreference wind turbine controller on the land-based turbine and to reduce maximum platform pitch angles by nearly 30% when using the platform feedback routine instead of a more traditional low-bandwidth controller. [ABSTRACT FROM AUTHOR]

This paper presents a simulation scheme for water distribution systems based on loop flows algorithms. Water networks are large scale and non-linear systems. The operational control of such system has posed difficulties in the past to the human operator that had to take the right decisions, such as pumping more water or closing a valve, within a short period of time and quite frequently in the absence of reliable measurement information such as pressure and flow values. Computer simulations of such systems have alleviated these difficulties. They allowed 'what-if' scenarios to be run by the human operator, giving him the possibility to know in advance the operational problems that can arise in the real-life networks due to malfunctions of valves or burst in pipes. However these computer simulations are generally relying on solving a system of equations and the nodal heads variables have been the most frequently used variables in these computer simulations. More recently the numerical algorithms based on loop corrective flows have started to receive more attention due to the reduce size of the matrixes involved in the numerical computations, which relies on the loop structure of the water network rather than the nodes. This can improve the numerical properties of the algorithms that model the real-time behaviour of the network. It is shown that such an efficient simulation scheme can be developed in the context of the loop flows algorithms and some problems that appear from doing this are successfully solved. [ABSTRACT FROM AUTHOR]

In this paper, a coupled interaction matrix is proposed to describe the interactions between line outages and the load shed at buses. The coupled interaction matrix is effectively estimated by the Expectation Maximization algorithm. A highly probabilistic coupled interaction model is further proposed to efficiently generate cascades with both line outages and the load shed based on the coupled interaction matrix and the distribution of initial outages. To mitigate cascading failures, critical links are identified based on the coupled interaction matrix by calculating a comprehensive severity index that considers the consequences of both line outages and the load shed. Simulation results on the IEEE 300-bus system verify the effectiveness of the proposed approach. The cascades generated from the coupled interaction model match the statistics of the original cascades very well. The identified critical links based on the comprehensive severity index enable a proper tradeoff between reducing line outages and reducing the load shed, leading to a better mitigation effect than only considering either line outages or the load shed. [ABSTRACT FROM AUTHOR]

This paper deals with a modified technique for the recognition of single stage and multiple power quality (PQ) disturbances. An algorithm based on Stockwell's transform and artificial neural network-based classifier and a rule-based decision tree is proposed in this paper. The analysis and classification of single stage PQ disturbances consisting of both events and variations such as sag, swell, interruption, harmonics, transients, notch, spike, and flicker are presented. Moreover, the proposed algorithm is also applied on multiple PQ disturbances such as harmonics with sag, swell, flicker, and interruption. A database of these PQ disturbances based on IEEE-1159 standard is generated in MATLAB for simulation studies. The proposed algorithm extracts significant features of various PQ disturbances using S-transform, which are used as input to this hybrid classifier for the classification of PQ disturbances. Satisfactory results of effective recognition and classification of PQ disturbances are obtained with the proposed algorithm. Finally, the proposed method is also implemented on real-time PQ events acquired in a laboratory to confirm the validity of this algorithm in practical conditions. [ABSTRACT FROM PUBLISHER]

Mixed models: Models allowing for continuous heterogeneity by assuming that value of one or more parameters follow a specified distribution have become increasingly popular. This is known as ‘mixing’ parameters, and it is standard practice by researchers - and the default option in many statistical programs - to base test statistics for mixed models on simulations using asymmetric draws (e.g. Halton draws). Problem 1: Inconsistent LR tests due to asymmetric draws:: This paper shows that when the estimated likelihood functions depend on standard deviations of mixed parameters this practice is very likely to cause misleading test results for the number of draws usually used today. The paper illustrates that increasing the number of draws is a very inefficient solution strategy requiring very large numbers of draws to ensure against misleading test statistics. The main conclusion of this paper is that the problem can be solved completely by using fully antithetic draws, and that using one dimensionally antithetic draws is not enough to solve the problem. Problem 2: Maintaining the correct dimensions when reducing the mixing distribution:: A second point of the paper is that even when fully antithetic draws are used, models reducing the dimension of the mixing distribution must replicate the relevant dimensions of the quasi-random draws in the simulation of the restricted likelihood. Again this is not standard in research or statistical programs. The paper therefore recommends using fully antithetic draws replicating the relevant dimensions of the quasi-random draws in the simulation of the restricted likelihood and that this should become the default option in statistical programs. JEL classification: C15; C25. [ABSTRACT FROM AUTHOR]

Dynamic development of Programmable Logic Controller (PLC) technology and Supervisory Control and Data Acquisition (SCADA) software has resulted in their widespread usage in integrated systems of automation, becoming one of the main directions of ship automation. This change justifies the need to improve the training of future crews on simulators built with the use of PLC and SCADA technologies. This paper presents a simulator prototype for selective processes of a main-propulsion boiler's fuel-gas-line nitrogenpurging system, applied in LNG (liquefied natural gas) ships. Control algorithms and appropriateschematic diagrams of the LNG fuel system of these processes were also presented. A Versa Max Micro-series PLC and an InTouch 9.0 PL SCADA software were applied in construction of the simulator. As a result of simulations, a visualisation of different states of fuel line in the form of screenshots was included. Finally, the paper contains a concept for simulator development based on hardware (sensors and actuators) without significant changes in existing software; further development will provide the simulator with more similarities to a real ship system. [ABSTRACT FROM AUTHOR]

Shamir's secret sharing scheme is an effective way to distribute secret to a group of shareholders. The security of the unprotected sharing scheme, however, can be easily broken by cheaters or attackers who maliciously feed incorrect shares during the secret recovery stage or inject faults into hardware computing the secret. In this paper, we propose cheater detection and identification schemes based on robust and algebraic manipulation detection (AMD) codes and m-disjunct matrices (superimposed codes). We present the constructions of codes for cheater detection and identification and describe how the cheater identification problem can be related to the classic group testing algorithms based on m-disjunct matrices. Simulation and synthesis results show that the proposed architecture can improve the security level significantly even under strong cheating attack models with reasonable area and timing overheads. [ABSTRACT FROM PUBLISHER]

The service performance and life of the aero-engine are directly affected by the blade machining accuracy. In the end milling of the flexible blade, the profile tolerance would usually be violated by the deflection errors induced by excessive static deformations under the action of milling force. In order to predict the blade deflection errors, this paper presents an iterative algorithm considering the coupling relationship between milling force and elastic deformation based on the milling finite element simulation model. Then a novel multipoint rod-shaped auxiliary support technology is proposed to suppress the blade deflection errors. Taking the influence of layout parameters on blade deflection errors into account, the layout of auxiliary support is optimized by a genetic algorithm. To verify the effectiveness of the proposed method, an auxiliary support mechanism is designed and manufactured, and the deflection errors suppression experiment is implemented. The measured results show that the prediction error of blade maximum deflection is 17.6%. Furthermore, the blade average deflection error on two measured curves reduces from 45.88 μm to 24.39 μm with the support of the designed mechanism. Thus, this auxiliary support mechanism and layout optimization method can achieve higher accuracy in blade milling. [ABSTRACT FROM AUTHOR]

In this paper, we establish a framework for enabling ultra-reliable and low-latency communications in the control and non-payload communications (CNPC) links of the unmanned aerial vehicle (UAV) communication systems. We first derive the available range of the CNPC links between UAVs and a ground control station. The available range is defined as the maximal horizontal communication distance within which the round-trip delay and the overall packet loss probability can be ensured with a required probability. To exploit the macro-diversity gain of the distributed multi-antenna systems (DAS) and the array gain of the centralized multi-antenna systems (CAS), we consider a modified DAS (M-DAS), where the ground control station is equipped with the distributed access points (APs), and each AP can have multiple antennas. We then show that the available range can be maximized by judiciously optimizing the altitude of UAVs, the duration of the uplink and downlink phases, and the antenna configuration. To solve the non-convex problem, we propose an algorithm that can converge to the optimal solution in DAS and CAS, and then extend it into more general M-DAS. The simulation and numerical results validate our analysis and show that the available range of M-DAS can be significantly larger than those of the DAS and CAS. [ABSTRACT FROM AUTHOR]

To make agents' route decision-making behaviours as real as possible, this paper proposes a layered navigation algorithm, emphasizing the coordinating of the global route planning at strategic level and the local route planning at tactical level. Specifically, by an improved visibility graph method, the global route is firstly generated based on static environment map. Then, a new local route planning (LRP) based on dynamic local environment is activated for multipath selection to allow pedestrian to respond changes at a real-time sense. In particular, the LRP model is developed on the basis of a passenger's psychological motivation. The pedestrians' individual preferences and the uncertainties existing in the process of evaluation and choice are fully considered. The suitable local path can be generated according to an estimated passing time. The LRP model is applied to the choice of ticket gates at a subway station, and the behaviours of gate choosing and rechoosing are investigated. By utilizing C++, the layered navigation algorithm is implemented. The simulation results exhibit agents' tendency to avoid congestion, which is often observed in real crowds. [ABSTRACT FROM AUTHOR]

The multimode power-split architecture for hybrid electric vehicle (HEV) powertrains is generally known for the complexity of its operation. This paper first addresses the challenge of developing an automated on-line near-optimal control strategy for these systems. Particularly, a machine learning logic based on supervised learning is developed for on-line selection of the HEV operating mode, thus the particular set of clutches to be engaged. An efficiency-based approach is then adopted to determine the optimal power-split between powertrain components. Later, the developed strategy finds integration in an optimal design methodology for multimode power-split HEVs considering the effectiveness and ease of on-line controllability. The obtained results are compared with the ones by the traditional HEV design methodology that only considers off-line energy management. The illustrated design methodology with on-line control reveals efficient at identifying the multimode HEV design that demonstrates optimal predicted fuel economy values and ease of on-line controllability simultaneously. Results suggest that the HEV design optimization procedure may produce different outcomes and demonstrate more effective when the evaluation of the on-line controlled operation is integrated. [ABSTRACT FROM AUTHOR]

As Vehicular Ad hoc Network (VANET) features random topology and accommodates freely connected nodes, it is important that the cooperation among the nodes exists. This paper proposes a trust model called Implicit Web of Trust in VANET (IWOT-V) to reason out the trustworthiness of vehicles. Such that untrusted nodes can be identified and avoided when we make a decision regarding whom to follow or cooperate with. Furthermore, the performance of Cooperative Intelligent Transport System (C-ITS) applications improves. The idea of IWOT-V is mainly inspired by web page ranking algorithms such as PageRank. Although there does not exist explicit link structure in VANET because of random topology and dynamic connections, social trust relationship among vehicles exists and an implicit web of trust can be derived. To accomplish the derivation, two algorithms are presented, i.e., BayesTrust and VehicleRank. They are responsible for deriving the local and global trust relationships, respectively. The simulation results show that IWOT-V can accurately identify trusted and untrusted nodes if enough local trust information is collected. The performance of IWOT-V affected by five threat models is demonstrated, and the related discussions are also given. [ABSTRACT FROM AUTHOR]

This paper describes a new method of power-grid signal variation measurement, consisting of a demodulation algorithm and a set of measures (indices). The measures that will be presented are the abstract functionals, operating on the complex envelope of a signal. This paper presents a demodulation algorithm, definitions of proposed functionals, results of simulations, as well as laboratory experiments. [ABSTRACT FROM AUTHOR]

Ensembles are a well established machine learning paradigm, leading to accurate and robust models, predominantly applied to predictive modeling tasks. Ensemble models comprise a finite set of diverse predictive models whose combined output is expected to yield an improved predictive performance as compared to an individual model. In this paper, we propose a new method for learning ensembles of process-based models of dynamic systems. The process-based modeling paradigm employs domain-specific knowledge to automatically learn models of dynamic systems from time-series observational data. Previous work has shown that ensembles based on sampling observational data (i.e., bagging and boosting), significantly improve predictive performance of process-based models. However, this improvement comes at the cost of a substantial increase of the computational time needed for learning. To address this problem, the paper proposes a method that aims at efficiently learning ensembles of process-based models, while maintaining their accurate long-term predictive performance. This is achieved by constructing ensembles with sampling domain-specific knowledge instead of sampling data. We apply the proposed method to and evaluate its performance on a set of problems of automated predictive modeling in three lake ecosystems using a library of process-based knowledge for modeling population dynamics. The experimental results identify the optimal design decisions regarding the learning algorithm. The results also show that the proposed ensembles yield significantly more accurate predictions of population dynamics as compared to individual process-based models. Finally, while their predictive performance is comparable to the one of ensembles obtained with the state-of-the-art methods of bagging and boosting, they are substantially more efficient. [ABSTRACT FROM AUTHOR]

In this paper, we investigate parameter estimation for generalized frequency division multiplexing (GFDM) signals over frequency-selective fading channels. Based on the characteristics of the second-order cyclostationary statistics of GFDM signals, we develop algorithms to blindly estimate pure block duration, overall block duration, symbol duration, and number of subcarriers. The proposed algorithms are robust to timing, phase, and carrier frequency uncertainties and do not require any a priori knowledge of the received signal. Simulation results verify the feasibility of the proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, the noise reduction property of type-2 fuzzy logic (FL) systems (FLSs) (T2FLSs) that use a novel type-2 fuzzy membership function is studied. The proposed type-2 membership function has certain values on both ends of the support and the kernel and some uncertain values for the other values of the support. The parameter tuning rules of a T2FLS that uses such a membership function are derived using the gradient descend learning algorithm. There exist a number of papers in the literature that claim that the performance of T2FLSs is better than type-1 FLSs under noisy conditions, and the claim is tried to be justified by simulation studies only for some specific systems. In this paper, a simpler T2FLS is considered with the novel membership function proposed in which the effect of input noise in the rule base is shown numerically in a general way. The proposed type-2 fuzzy neuro structure is tested on different input–output data sets, and it is shown that the T2FLS with the proposed novel membership function has better noise reduction property when compared to the type-1 counterparts. [ABSTRACT FROM AUTHOR]

Automatic trajectory generation for robot manipulators is a highly desirable application for robots, In this paper, we take into account the geometric aspects of trajectory planning, especially the workpiece reconstruction and description used to generate the trajectories. Generating manipulator trajectories for free-form surfaces to satisfy manufacturing requirements is highly challenging due to the complex geometry of free-form surfaces. This paper describes the development of a 3D surface reconstruction guided manipulator trajectory generation system for a magnetic scattering film plating robot. After reviewing existing methods of trajectory generation, an effective trajectory generation method for robotic film plating is introduced and a trajectory planning algorithm that can be used to control a magnetic scattering film plating robot is proposed. A kinematics verification method is also provided to verify the generated trajectories. Results obtained from the simulation and experiments are presented, the results show that the trajectory generation system achieves satisfactory performance. The paper fulfils an identified need for an effective trajectory generation method for magnetic scattering robotic film plating based on the workpiece surface reconstruction after the mesh subdivision. The trajectory generation system can also be used to generate trajectories for many other surface-guided robot trajectory planning applications. [ABSTRACT FROM AUTHOR]

This paper proposes a framework for the incorporation of formal methods in the design flow of digital signal processing (DSP) systems in a rigorous way. In the proposed approach, DSP descriptions were modeled and verified at different abstraction levels using higher order logic based on the higher order logic (HOL) theorem prover. This framework enables the formal verification of DSP designs that in the past could only be done partially using conventional simulation techniques. To this end, a shallow embedding of DSP descriptions in HOL at the floating-point (FP), fixed-point (FXP), behavioral, register transfer level (RTL), and netlist gate levels is provided. The paper made use of existing formalization of FP theory in HOL and a parallel one developed for FXP arithmetic. The high ability of abstraction in HOL allows a seamless hierarchical verification encompassing the whole DSP design path, starting from top-level FP and FXP algorithmic descriptions down to RTL, and gate level implementations. The paper illustrates the new verification framework on the fast Fourier transform (FFT) algorithm as a case study. [ABSTRACT FROM AUTHOR]

This paper presents a new control algorithm development approach for induction machines by using model-based design and a systematically built model architecture implemented in MATLAB/Simulink. The model architecture follows a three-layer structure, and it is developed according to the principle of functional decomposition and the needs of reusability and expandability. The first model layer consists of elementary model and algorithm components, the second contains a machine simulation model and a field-oriented control (FOC) algorithm, built upon the first layer's components, and the third realises the executable models by connecting the models and algorithms defined in the second layer. Furthermore, rapid control prototyping (RCP) is discussed as an experimental validation method, and an experimental setup with RCP is also introduced. The application of the presented methods is demonstrated by simulations as well as by experiments, and by using a control algorithm based on FOC as an example. [ABSTRACT FROM AUTHOR]

In this correspondence paper, an underlay cognitive radio multicast network, consisting of a cognitive base station (CBS) and multiple multicast groups of secondary users (SUs), is considered. All SUs, belonging to a particular multicast group, are served by the CBS using a common primary user (PU) channel. The goal is to maximize the energy efficiency (EE) of the system, through dynamic adaptation of target rate and transmit power for each multicast group, under the PUs’ individual interference constraint. The optimization problem formulated for this is proved to be nonquasi-concave with respect to the joint variation of the CBS's transmit power and target rate. An efficient iterative algorithm for EE maximization is proposed along with its complexity analysis. Simulation results illustrate the performance gain of our proposed scheme. [ABSTRACT FROM AUTHOR]

The dispatching of hydro-thermal system is a nonlinear programming problem with multiple constraints and high dimensions and the solution techniques of the model have been a hotspot in research. Based on the advantage of that the artificial bee colony algorithm (ABC) can efficiently solve the high-dimensional problem, an improved artificial bee colony algorithm has been proposed to solve DHTS problem in this paper. The improvements of the proposed algorithm include two aspects. On one hand, local search can be guided in efficiency by the information of the global optimal solution and its gradient in each generation. The global optimal solution improves the search efficiency of the algorithm but loses diversity, while the gradient can weaken the loss of diversity caused by the global optimal solution. On the other hand, inspired by genetic algorithm, the nectar resource which has not been updated in limit generation is transformed to a new one by using selection, crossover and mutation, which can ensure individual diversity and make full use of prior information for improving the global search ability of the algorithm. The two improvements of ABC algorithm are proved to be effective via a classical numeral example at last. Among which the genetic operator for the promotion of the ABC algorithm’s performance is significant. The results are also compared with those of other state-of-the-art algorithms, the enhanced ABC algorithm has general advantages in minimum cost, average cost and maximum cost which shows its usability and effectiveness. The achievements in this paper provide a new method for solving the DHTS problems, and also offer a novel reference for the improvement of mechanism and the application of algorithms. [ABSTRACT FROM AUTHOR]

In order to improve the performance of traditional particle swarm optimization, this paper introduces the principle of Levy flight and cross-border reset mechanism. In the proposed particle swarm optimization, the dynamic variation of parameters meets the power-law distribution and the pattern of particles transition conforms to the Lévy flight in the process of algorithm optimization. It means the particles make long distance movements in the search space with a small probability and make short distance movements with a large probability. Therefore, the particles can jump out of local optimum more easily and coordinate the global search and local search of particle swarm optimization. This paper also designs the cross-border reset mechanism to make particles regain optimization ability when stranding on the border of search space after a long distance movement. The simulation results demonstrate the proposed algorithms are easier to jump out of local optimum and have higher accuracy when compared with the existing similar algorithms based on benchmark test functions and handwriting character recognition system. [ABSTRACT FROM AUTHOR]

The performance of standard MVDR algorithm would be decreased sharply when the sampled data is small. In this paper, vector MVDR algorithm and the diagonal loading are proposed to improve the robustness. Firstly, the sample date covariance matrix is whitened to obtain more uniform noise, and then use the standard deviation of covariance matrix as the loading amount to complete diagonal loading. Finally, the effectiveness and robustness of the proposed algorithm is verified by simulation. Simulation results reveal that it has higher positioning accuracy with small sample, with the increase of SNR and snapshots, the estimation's RMSE of target location decreases continuously. [ABSTRACT FROM AUTHOR]

This paper proposes the Marine Predators algorithm (MPA) linked with the reservoir simulation model and considering sedimentation, in order to improve reservoir rule curves. The release criteria of the hedging rule (HR) and standard operating policy (SOP) were investigated in this study. The results showed that the patterns of the new optimal rule curves from the MPA technique considering sedimentation and using HR were practically useful in this study, as were the patterns of the new optimal rule curves using SOP and those of the existing rule curves. Furthermore, the new optimal rule curves using HR criteria were able to alleviate both water scarcity and excess water situations better than both existing rule curves and optimal rule curves using SOP in terms of minimal average water shortage. The new curves reduced minimal average water shortage by 53% and excess release water deficit by 19%, whereas the frequency of water shortage term was increased by 3%. The results of rule curves efficiency from MPA were higher than GA and FPA techniques in terms of providing solutions. There was a significant difference in the efficiency of water problem alleviation between considering and not considering sedimentation. It can be concluded that the MPA linked with reservoir simulation using HR criteria and considering sedimentation can be used to find optimal rule curve solutions effectively. [ABSTRACT FROM AUTHOR]

In this paper, a symplectic algorithm is utilized to investigate constrained Hamiltonian systems. However, the symplectic method cannot be applied directly to the constrained Hamiltonian equations due to the non-canonicity. We firstly discuss the canonicalization method of the constrained Hamiltonian systems. The symplectic method is used to constrain Hamiltonian systems on the basis of the canonicalization, and then the numerical simulation of the system is carried out. An example is presented to illustrate the application of the results. By using the symplectic method of constrained Hamiltonian systems, one can solve the singular dynamic problems of nonconservative constrained mechanical systems, nonholonomic constrained mechanical systems as well as physical problems in quantum dynamics, and also available in many electromechanical coupled systems. [ABSTRACT FROM AUTHOR]

Motivated by the work of Dahrouj and Yu in applying the Han-Kobayashi transmission strategy for mitigating the intercell interference in a multi-cell multi-user multiple-input single-output interference network (MISO IN), this paper considers splitting messages into private and common parts in a multi-cell multi-user MIMO IN. Specifically, the covariances of the private messages and common messages are designed to optimize either the sum rate or the minimal rate. The common messages and private messages are decoded in sequence using successive decoding. This paper shows how these difficult optimization problems can be adequately solved by means of d.c. (difference of concave functions) optimization over a simple convex set. Numerical and simulation results also reveal the great advantage of our proposed solutions for various types of INs. In particular, the proposed solutions are shown to outperform the algorithm developed by Dahrouj and Yu for the simpler case of the MISO IN. [ABSTRACT FROM PUBLISHER]

Real-time (RT) simulation plays a fundamental role in the design and validation of hardware and software for power electronic converters and electric drives. In this paper, a field-programmable gate array (FPGA)-based RT platform for simulation of power converters and electric machines is presented. Strategies for modeling power electronic devices are explained and compared. In addition, a Thevenin-based equivalent model of a switch is enhanced to model the on characteristics of these devices. This motivates the design of an electrothermal algorithm for FPGA implementation. With respect to electric machines, different methods for modeling of the saturation characteristics are evaluated for their use in RT simulation. A procedure to efficiently compute the saturation characteristics is proposed. Finally, a hardware-in-the-loop model of an electric vehicle drive is used to illustrate the machine saturation. [ABSTRACT FROM PUBLISHER]

In this paper, we discuss the structure and performance of the maximum entropy temperature-emissivity separation (MaxEnTES) algorithm for assessing land temperature and emissivity from thermal infrared hyperspectral images. This procedure derives the emissivity spectrum and the temperature of the target adopting the maximum entropy (MaxEnt) estimation approach. The main advantage of the MaxEnt statistical inference is the absence of any external hypothesis, which is, instead, the main critical point characterizing any other temperature-emissivity separation (TES) algorithm. The MaxEnTES algorithm carries out the TES task adopting a modified version of the subgradient Shor's r-algorithm adopted for numerical optimization of a MaxEnt objective function. For this purpose, we have utilized the C/C++ Solvopt code from the University of Gratz to develop a practical data processing implementation. In this paper, we discuss the mathematical structure of the MaxEnTES algorithm and analyze its performance in depth using numerical simulations and remote sensing Multispectral Infrared/Visible Imaging Spectrometer images. We show that the MaxEnTES algorithm provides improved accuracy for temperature and emissivity estimation, lowering the standard estimation error to a fraction of degree Kelvin. In agreement with previous investigations, we find that the estimation accuracy grows when increasing the number of available spectral channels. The systematic errors affecting the temperature estimates (e.g., bias) are thoroughly evaluated. We prove that the MaxEnTES algorithm retrieves the correct shape of the target emissivity spectrum even in presence of a significant temperature estimation error. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a novel definition of opposite path. Its core feature is that the sequence of candidate paths and the distances between adjacent nodes in the tour are considered simultaneously. In a sense, the candidate path and its corresponding opposite path have the same (or similar at least) distance to the optimal path in the current population. Based on an accepted framework for employing opposition-based learning, Oppositional Biogeography-Based Optimization using the Current Optimum, called COOBBO algorithm, is introduced to solve traveling salesman problems. We demonstrate its performance on eight benchmark problems and compare it with other optimization algorithms. Simulation results illustrate that the excellent performance of our proposed algorithm is attributed to the distinct definition of opposite path. In addition, its great strength lies in exploitation for enhancing the solution accuracy, not exploration for improving the population diversity. Finally, by comparing different version of COOBBO, another conclusion is that each successful opposition-based soft computing algorithm needs to adjust and remain a good balance between backward adjacent node and forward adjacent node. [ABSTRACT FROM AUTHOR]

This study proposes an improved interferogram filtering method with mathematical morphology. The algorithm firstly converts the interferogram in cosine and sine parts to preserve the continuity of phases, then adopts the improved adaptive line structure elements to run reconstruction process on two parts based on grey scale morphological opening and closing operations. In addition combine the two filtered parts to get the wrapped phases. Simulated and real-data experiments show that the proposed algorithm is more robust in filtering compared with other algorithms referred in this study. [ABSTRACT FROM AUTHOR]

This paper introduces a Monte Carlo simulation method for pricing multidimensional American options based on the computation of the optimal exercise frontier. We consider Bermudan options that can be exercised at a finite number of times and compute the optimal exercise frontier recursively. We show that for every date of possible exercise, any single point of the optimal exercise frontier is a fixed point of a simple algorithm. Once the frontier is computed, we use plain vanilla Monte Carlo simulation to price the option and obtain a low-biased estimator. We illustrate the method with applications to several types of options. [ABSTRACT FROM AUTHOR]

In this paper, a novel technique based on magnetic field sensing is proposed for underground power cable detection and inspection. In this technique, the current sources of the underground power cables are reconstructed based on a set of measured magnetic field values at the ground surface level emanated by the electric currents carried by the underground power cables. The stochastic optimization technique developed with an artificial immune system algorithm is applied to realize the reconstruction. The principle of this method was proved and verified experimentally by our laboratory setup. Application of this method was demonstrated on the simulation models of 11- and 132-kV underground power cables. The reconstruction results of the electrical and spatial parameters of the cables match accurately with the actual source parameters of the cables in the models. This paper shows that the proposed method is able to remotely detect the horizontal locations and vertical depths of underground power cables with high accuracy at the ground surface level requiring no prior knowledge about the exact locations of the cables. Thus, it can be potentially used to develop a portable locator for providing a map of the underground electrical cables by simultaneous detection of multiple power lines. This method can also enable engineers to correctly inspect the operation states of the target cables during onsite maintenance. This technique is applicable to various laying conditions and cable configurations (three core or single core) of the underground power cables. In addition, this is an entirely passive method and does not need any signal injection into the cables. [ABSTRACT FROM PUBLISHER]

The Warp code (and its framework of associated tools) was initially developed for particle-in-cell simulations of space-charge-dominated ion beams in accelerators, for heavy-ion-driven inertial fusion energy, and related experiments. It has found a broad range of applications, including nonneutral plasmas in traps, stray electron clouds in accelerators, laser-based acceleration, and the focusing of ion beams produced when short-pulse lasers irradiate foil targets. We summarize novel methods used in Warp, including: time-stepping conducive to diagnosis and particle injection; an interactive Python-Fortran-C structure that enables scripted and interactive user steering of runs; a variety of geometries (3-D $x$ , $y$ , $z$ ; 2-D $r$ , $z$ ; 2-D $x$ , $y$ ); electrostatic and electromagnetic field solvers; a cut-cell representation for internal boundaries; the use of warped coordinates for bent beam lines; adaptive mesh refinement, including a capability for time-dependent space-charge-limited flow from curved surfaces; models for accelerator lattice elements (magnetic or electrostatic quadrupole lenses, accelerating gaps, etc.) at user-selectable levels of detail; models for particle interactions with gas and walls; moment/envelope models that support sophisticated particle loading; a drift-Lorentz mover for rapid tracking through regions of strong and weak magnetic field; a Lorentz-boosted frame formulation with a Lorentz-invariant modification of the Boris mover; an electromagnetic solver with tunable dispersion and stride-based digital filtering; and a pseudospectral electromagnetic solver. Warp has proven useful for a wide range of applications, described very briefly herein. It is available as an open-source code under a BSD license. This paper describes material presented during the Prof. Charles K. (Ned) Birdsall Memorial Session of the 2013 IEEE Pulsed Power and Plasma Science Conference. In addition to our overview of the computational methods used in Warp, we summarize a few aspects of Ned's contributions to plasma simulation and to the careers of those he mentored. [ABSTRACT FROM PUBLISHER]

With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is beneficial to save large storage space, it has several shortcomings such as the existence of backtracking and empty nodes. This paper proposes a new packet classification algorithm, Hierarchical Trie Algorithm Based on Expectation-Maximization Clustering (HTEMC). Firstly, this paper uses the formalization method to deal with the packet classification problem by means of mapping the rules and data packets into a two-dimensional space. Secondly, this paper uses expectation-maximization algorithm to cluster the rules based on their aggregate characteristics, and thereby diversified clusters are formed. Thirdly, this paper proposes a hierarchical trie based on the results of expectation-maximization clustering. Finally, this paper respectively conducts simulation experiments and real-environment experiments to compare the performances of our algorithm with other typical algorithms, and analyzes the results of the experiments. The hierarchical trie structure in our algorithm not only adopts trie path compression to eliminate backtracking, but also solves the problem of low efficiency of trie updates, which greatly improves the performance of the algorithm. [ABSTRACT FROM AUTHOR]