Search

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]

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]

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]

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]

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]

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 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]

Integrated energy systems (IESs) can improve energy efficiency and reduce carbon emissions, essential for achieving peak carbon emissions and carbon neutrality. This study investigated the characteristics of the CHP model considering P2G and carbon capture systems, and a two-stage robust optimization model of the electricity-heat-gas-cold integrated energy system was developed. First, a CHP model considering the P2G and carbon capture system was established, and the electric-thermal coupling characteristics and P2G capacity constraints of the model were derived, which proved that the model could weaken the electric-thermal coupling characteristics, increase the electric power regulation range, and reduce carbon emissions. Subsequently, a two-stage robust optimal scheduling model of an IES was constructed, in which the objective function in the day-ahead scheduling stage was to minimize the start-up and shutdown costs. The objective function in the real-time scheduling stage was to minimize the equipment operating costs, carbon emission costs, wind curtailment, and solar curtailment costs, considering multiple uncertainties. Finally, after the objective function is linearized with a ψ-piecewise method, the model is solved based on the C&CG algorithm. Simulation results show that the proposed model can effectively absorb renewable energy and reduce the total cost of the system. [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 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]

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]

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]

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]

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]

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]

The genomic scale metabolic networks of the microorganisms can be constructed based on their genome sequences, functional annotations, and biochemical reactions, reflecting almost all of the metabolic functions. Mathematical simulations of metabolic fluxes could make these functions be visualized, thereby providing guidance for rational engineering design and experimental operations. This review summarized recently developed flux simulation algorithms of microbial systems. For the single microbial systems, the optimal planning algorithm has low complexity because there is no interaction between microorganisms, and it can quickly simulate the stable metabolic states through the pseudo-steady hypothesis. Besides, the experimental conditions of single microbial systems are easier to reach or close to the optimal states of simulation, compared with polymicrobial systems. The polymicrobial culture systems could outcompete the single microbial systems as they could relieve metabolic pressure through metabolic division, resource exchange, and complex substrate coutilization. Besides, they provide varieties of intracellular production environments, which render them the potential to achieve efficient bioproduct synthesis. However, due to the quasi-steady hypothesis that restricts the simulation of the dynamic processes of microbial interactions and the algorithm complexity, there are few researches on simulation algorithms of polymicrobial metabolic fluxes. Therefore, this review also analyzed and combed the microbial interactions based on the commonly used hypothesis of maximizing growth rates, and studied the strategies of coupling interactions with optimal planning simulations for metabolism. Finally, this review provided new insights into the genomic scale metabolic flux simulations of polymicrobial systems. [ABSTRACT FROM AUTHOR]

The stability of cable-net structures depends on the prestress of the system. Due to the large displacement and mutual effect of the cables, it is difficult to simulate the tensioning process and control the forming accuracy. The Backward Algorithm (BA) has been used to simulate the tensioning process. The traditional BA involves complicated and tedious matrix operations. In this paper, a new numerical method based on the Vector Form Intrinsic Finite Element (VFIFE) method is proposed for BA application. Moreover, the tensioning sequence of a complex cable-net structure is introduced. Subsequently, a new approach for BA application in the simulation of the tensioning process is presented, which combines the VFIFE approach and the notion of form-finding. Finally, a numerical example is simulated in detail and the results of different tensioning stages are analyzed to verify the feasibility of the proposed approach. This study provides a significant reference for improving the construction control and forming accuracy of complex prestressed cable-net structures. [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]

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]

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]

This article presents a distributed model predictive control algorithm including fuzzy negotiation among subsystems and a dynamic setpoint generation method, applied to a simulated sewerage network. The methodology considers WWTP as an additional objective of control. To improve the performance of a DMPC using a hydraulic model for prediction, a more detailed model has been considered including suspended solids concentration (TSS). The results obtained with the proposed methodology have been validated on a benchmark simulation model for sewer systems developed to test and compare methodologies, showing good performance. [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]

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]

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]

Elliptical vibration cutting (EVC), as a precision machining technology, is used in many applications. In precision machining, control accuracy plays an essential role in improving the machinability of difficult-to-machine materials. To improve the control accuracy, dynamic and static characteristics of the system need to be tuned to obtain the optimal parameters. In this paper, we use a glowworm algorithm with an improved adaptive step size to tune the parameters of a robust adaptive fuzzy controller. We then obtain the optimal controller parameters through simulation. The optimal solution of the controller parameters is then applied to a 3D EVC system model for simulation and closed-loop testing experiments. The results indicate that a good agreement between the ideal curve and the tracking signal curve verifies the optimality of the controller parameters. Finally, under certain cutting conditions, the workpieces of three different materials are cut with two different cutting methods. The study revealed that the surface roughness value is reduced by 20 %–32 %, which further verifies the effectiveness of the optimal controller's parameters. [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]

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]

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]

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 addresses the problem of selecting a Pareto set from among finite alternatives, where each alternative has multiple performance measures evaluated by stochastic simulations. Under limited simulation resources, we propose an efficient algorithm for solving this problem based on a statistical hypothesis test. Using the test, the proposed algorithm evaluates the uncertainty of each design based on the observed simulation results to identify whether the selected Pareto set is accurate. Based on the evaluated uncertainty, the algorithm assigns additional resources to the designs to maximize the accuracy of the selected Pareto set. Applying the sequential procedure, the algorithm increases the precision of the observed information selectively and gradually. Several experiments, including a practical case study, demonstrated its improved efficiency compared to the existing algorithms in the literature. This improved efficiency, along with low complexity and high robustness to noise, allows the proposed algorithm to be effectively applied to practical system designs. [ABSTRACT FROM AUTHOR]

A complex and important task in the cloud resource management is the efficient allocation of virtual machines (VMs), or containers, in physical machines (PMs). The evaluation of VM placement techniques in real-world clouds can be tedious, complex and time-consuming. This situation has motivated an increasing use of cloud simulators that facilitate this type of evaluations. However, most of the reported VM placement techniques based on simulations have been evaluated taking into account one specific cloud resource (e.g., CPU), whereas values often unrealistic are assumed for other resources (e.g., RAM, awaiting times, application workloads, etc.). This situation generates uncertainty, discouraging their implementations in real-world clouds. This paper introduces CloudBench, a methodology to facilitate the evaluation and deployment of VM placement strategies in private clouds. CloudBench considers the integration of a cloud simulator with a real-world private cloud. Two main tools were developed to support this methodology, a specialized multi-resource cloud simulator (CloudBalanSim), which is in charge of evaluating VM placement techniques, and a distributed resource manager (Balancer), which deploys and tests in a real-world private cloud the best VM placement configurations that satisfied user requirements defined in the simulator. Both tools generate feedback information, from the evaluation scenarios and their obtained results, which is used as a learning asset to carry out intelligent and faster evaluations. The experiments implemented with the CloudBench methodology showed encouraging results as a new strategy to evaluate and deploy VM placement algorithms in the cloud. [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]

Fast inspection of a defect is a challenging task in mass production of curved surfaces, and photometric stereo (PS) utilizing multiple images from a single camera under a number of different illumination directions is a promising technique for this task due to its high sensitivity to surface normal perturbations. This paper adapts conventional PS and extends the technique to the inspection of non-Lambertian surfaces with high accuracy and efficiency. A data-driven PS is presented by establishing the Gaussian process (GP) model to represent the nonlinear reflectance behavior of various materials based on measured reflectance data sets. With the trained GP model, the surface normal can be estimated in two steps: prediction of bidirectional reflectance distribution function values under different light directions and the subsequent least-squares estimation of a surface normal. Comparison tests with other algorithms on the Mitsubishi Electric Research Laboratories data set and real workpieces with non-Lambertian materials show the superior accuracy and efficiency of the proposed method in surface normal estimation. After the surface normal of the workpiece is recovered, the defects can be detected by filtering out the perturbation of the surface normal. Experiments on steel and glossy polyester workpieces validate the efficacy of the proposed approach in detecting defects on curved non-Lambertian surfaces. [ABSTRACT FROM AUTHOR]

This paper uses an information-theoretic lens to view the error bound of wireless local area network (WLAN) localization, which is recognized as one of the superior candidate localization techniques in the GPS-denied environment. Interestingly, we analogize the process of WLAN localization into one of information propagation in a parallel Gaussian noisy channel, and then derive the corresponding localization error bound from the channel capacity of the analogical information propagation system. Experimental results show that compared with the widely-known Cramer-Rao Lower Bound (CRLB), the proposed approach performs better in localization error bound estimation under most of the cases of different access point deployment and reference point calibration. [ABSTRACT FROM AUTHOR]

Despeckling is a fundamental preprocessing step for applications using polarimetric synthetic aperture radar data in most cases. In this paper, a guided filter with nonlinear weight kernels and adaptive filtering windows is presented for PolSAR image despeckling, in which the guidance image is constructed by a weighted average using the statistical traits of the speckled image. The output result is then estimated by another weighted average, with the aid of the fully polarimetric information from both the guidance image and the speckled image. In the experimental part, the filtering results obtained with both simulated and real PolSAR images reveal the positive performance of the proposed method in both reducing speckle and retaining details, when compared with some of the state-of-the-art algorithms. Furthermore, the relatively low computational complexity is another strength of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we propose a deep reinforcement learning (DRL)-based method that allows unmanned aerial vehicles (UAVs) to execute navigation tasks in large-scale complex environments. This technique is important for many applications such as goods delivery and remote surveillance. The problem is formulated as a partially observable Markov decision process (POMDP) and solved by a novel online DRL algorithm designed based on two strictly proved policy gradient theorems within the actor-critic framework. In contrast to conventional simultaneous localization and mapping-based or sensing and avoidance-based approaches, our method directly maps UAVs’ raw sensory measurements into control signals for navigation. Experiment results demonstrate that our method can enable UAVs to autonomously perform navigation in a virtual large-scale complex environment and can be generalized to more complex, larger-scale, and three-dimensional environments. Besides, the proposed online DRL algorithm addressing POMDPs outperforms the state-of-the-art. [ABSTRACT FROM AUTHOR]

Establishing causal relations between random variables from observational data is perhaps the most important challenge in today’s science. In remote sensing and geosciences, this is of special relevance to better understand the earth’s system and the complex interactions between the governing processes. In this paper, we focus on an observational causal inference, and thus, we try to estimate the correct direction of causation using a finite set of empirical data. In addition, we focus on the more complex bivariate scenario that requires strong assumptions and no conditional independence tests can be used. In particular, we explore the framework of (nondeterministic) additive noise models, which relies on the principle of independence between the cause and the generating mechanism. A practical algorithmic instantiation of such principle only requires: 1) two regression models in the forward and backward directions and 2) the estimation of statistical independence between the obtained residuals and the observations. The direction leading to more independent residuals is decided to be the cause. We instead propose a criterion that uses the sensitivity (derivative) of the dependence estimator, the sensitivity criterion allows to identify samples most affecting the dependence measure, and hence, the criterion is robust to spurious detections. We illustrate the performance in a collection of 28 geoscience causal inference problems, a database of radiative transfer models simulations and machine learning emulators in vegetation parameter modeling involving 182 problems, and assessing the impact of different regression models in a carbon cycle problem. The criterion achieves the state-of-the-art detection rates in all cases, and it is generally robust to noise sources and distortions. The presented approach confirms the validity in observational bivariate problems in the earth sciences. [ABSTRACT FROM AUTHOR]

In practice, most projects result in cost overruns and schedule slippage due to poor resource management. This paper presents an approach that aims at reducing project duration and costs by empowering project managers to assess different scenarios. The proposed approach addresses combinatorial modes for tasks, multi-skilled resources, and multiple calendars for resources. A case study reported in the literature is presented to demonstrate the capabilities of this method. As for practical implications, this approach enhances the decision-making process which results in improved solutions in terms of total project duration and cost. From an academic viewpoint, this paper adds empirical evidence to enrich the existing literature, as it highlights relevant issues to model properly the complexity of real-life projects. [ABSTRACT FROM AUTHOR]

In the traditional EKF-SLAM algorithm, the computational complexity and uncertainty will grow up rapidly with the increase of the feature points and the enlargement of the map coverage. As we know, the computational complexity is proportional to the quadratic of the number of feature points contained in a single filtering process. The approach represented in the paper combines EKF-SLAM with local submaps, which can improve the computational efficiency and reduce the computational complexity. At first, an independent local submap is established for the observed feature points. When the number of feature points contained in the local submap reaches a certain threshold value, the local submap is integrated into the global map. At last, the submap is initialized again. The simulation results show that the approach can reduce the computational complexity effectively and increase the computation speed greatly in the case of maintaining the computational accuracy of the traditional EKF-SLAM algorithm. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive synthesis using the particle swarm optimization (PSO) for implementations of resonator-coupled filters is proposed. The coupling matrix of in-band filtering response is achieved and optimized by the PSO-based synthesis. Meanwhile, the stopband coupling matrix of the filter is predicted based on the combination of extra resonant nodes representing stopband spurious and parasitic effect of input/output ports. In addition, an enhanced accurate prediction of filter performance is calculated by the proposed approach, considering the practical fabrication tolerance on filter design. To verify principles mentioned earlier, various resonator-coupled filters are implemented. The calculation, EM-simulation, and measurement of filters show good agreements in both passband and stopband. [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]

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]

Flooding produces debris and waste including liquids, dead animal bodies and hazardous materials such as hospital waste. Debris causes serious threats to people's health and can even block the roads used to give emergency aid, worsening the situation. To cope with these issues, flood management systems (FMSs) are adopted for the decision-making process of critical situations. Nowadays, conventional artificial intelligence and computational intelligence (CI) methods are applied to early flood event detection, having a low false alarm rate. City authorities can then provide quick and efficient response in post-disaster scenarios. This paper aims to present a comprehensive survey about the application of CI-based methods in FMSs. CI approaches are categorized as single and hybrid methods. The paper also identifies and introduces the most promising approaches nowadays with respect to the accuracy and error rate for flood debris forecasting and management. Ensemble CI approaches are shown to be highly efficient for flood prediction. [ABSTRACT FROM AUTHOR]