Search

Different geophysical methods use different model parameterizations and inversion algorithms. Thus, combining these different inversion systems and yet adding the nonlinear cross‐gradient constraint in a joint inversion framework might be a big challenge, for instance, as explained further by Moorkamp et al. in 2011, there is a complex interaction between the data misfit terms, regularization and cross‐gradient terms and an imperfect fit to the data is expected. In this paper, we use a sequential algorithm for a two‐dimensional joint inversion of gravity and magnetic data, which tries to avoid these issues by decoupling the gravity inversion, the magnetic inversion and the cross‐gradient minimization processes. The efficiency of the algorithm and developed code is demonstrated by the joint inversion of noisy synthetic data. The results show a significant improvement in the respective models obtained by introducing the cross‐gradient joint inversion over the models obtained by separate inversions for synthetic data and then for field data targeting potash ore source in the AjiChai salt deposit in north‐western Iran. In this application case, the lower density of salt minerals such as potash, compared to its surrounding sedimentary sequences, motivates a gravity study. Furthermore, the relative lower susceptibility of these salt minerals, alongside their diamagnetic effect, makes them a suitable target for magnetic surveys. Separate gravity and magnetic studies had been performed over the deposit; however, a constitutive relationship between density and magnetization within the area of interest supporting a joint inversion had not been established. In this paper, we apply the sequential cross‐gradient approach to perform the first full joint inversion for the AjiChai salt deposit. The magnetic inversion here is performed to recover the magnetization amplitudes rather than the magnetization vector. In fact, we assume there is no remanent magnetization and, therefore, that the magnetization vector is constant and parallel to the geomagnetic field direction. The constructed density and magnetization models are of high concordance with available geological information and previous studies including drilling results. In addition, unlike previous separate inversion models, the models are structurally and geometrically similar. [ABSTRACT FROM AUTHOR]

Improving network power quality through harmonic reduction requires recognition of Harmonic Sources (HSs) to drive them to compensate their harmonics. This paper proposes a new method for equitable distribution of the Harmonic Compensation Cost of the network among the HSs based on the Harmonic Contribution Matrix. Each element of the Harmonic Contribution Matrix is the harmonic contribution of a specific source to the harmonic voltage of a specific bus. The output of the proposed method is a penalty curve for each HS over time. The amount of the fine estimated for each individual HS per hour is a function of not only the contribution of that HS to the harmonic voltage of different buses, but also the contribution of the Harmonic Compensation Cost from the perspective of each bus, nominal voltage of each bus, and the sensitivity of each bus to the harmonic voltage. The proposed algorithm is evaluated on the IEEE 14‐bus network and Esfahan regional electrical power network in Iran. The simulation results demonstrate the capability of the proposed method to allocate the hourly penalty curve to the HSs. [ABSTRACT FROM AUTHOR]

Abstract: Natural language processing is a composition of several error‐prone and challenging tasks, including part of speech tagging, word sense disambiguation, named entity recognition, and compound verb detection. Studying intrasentence relations and roles is essential to improve the mentioned subtasks. Semi‐automatic schemes such as ontologies can be applied to clarify word's dependencies. This paper presents an ontology that is targeting to improve POS tagging, WSD, NER, and compound verb detection in Persian with extra properties that may ameliorate machine translation. The ontology is tested in combinations with several state‐of‐art algorithms on Dadegan corpus. The results show that coping semantic analysis with machine learning methods enhance relation detection and consequently precision of the mentioned subtasks, which is not widely addressed in Persian. Furthermore, the experimental results declare that the accuracy rate increases between 4.5 and 23% for different tasks. [ABSTRACT FROM AUTHOR]