Search

In this paper, we employ the theory of differential subordination to establish a theorem that delineates certain sufficient conditions for starlikeness, convexity, close-to-convexity, and quasi-convexity in relation to functions with fixed initial coefficients. Furthermore, we introduce some results derived from these conditions. Building upon this framework, we derive an extension of Nunokawa's lemma for analytic functions with fixed initial coefficients. [ABSTRACT FROM AUTHOR]

The classic pump scheduling or optimal water flow (OWF) problem for water distribution networks (WDNs) minimizes the cost of power consumption for a given WDN over a fixed time horizon. In its exact form, the OWF is a computationally challenging mixed-integer nonlinear program (MINLP). It is complicated by nonlinear equality constraints that model network physics, discrete variables that model operational controls, and intertemporal constraints that model changes to storage devices. To address the computational challenges of the OWF, this paper develops tight polyhedral relaxations of the original MINLP, derives novel valid inequalities (or cuts) using duality theory, and implements novel optimization-based bound tightening and cut generation procedures. The efficacy of each new method is rigorously evaluated by measuring empirical improvements in OWF primal and dual bounds over 45 literature instances. The evaluation suggests that our relaxation improvements, model strengthening techniques, and a thoughtfully selected polyhedral relaxation partitioning scheme can substantially improve OWF primal and dual bounds, especially when compared with similar relaxation-based techniques that do not leverage these new methods. History: Accepted by David Alderson, Area Editor for Network Optimization: Algorithms & Applications. Funding: This work was supported by the U.S. Department of Energy (DOE) Advanced Grid Modeling project, Coordinated Planning and Operation of Water and Power Infrastructures for Increased Resilience and Reliability. Incorporation of the PolyhedralRelaxations Julia package was supported by Los Alamos National Laboratory's Directed Research and Development program under the project Fast, Linear Programming-Based Algorithms with Solution Quality Guarantees for Nonlinear Optimal Control Problems [Grant 20220006ER]. All work at Los Alamos National Laboratory was conducted under the auspices of the National Nuclear Security Administration of the U.S. DOE, Contract No. 89233218CNA000001. This work was also authored in part by the National Renewable Energy Laboratory, operated by the Alliance for Sustainable Energy, LLC, for the U.S. DOE, Contract No. DE-AC36-08GO28308. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0233) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0233). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

The main purpose of this paper, is to introduce a new subclass of analytic functions involving Polylogarithm functions and obtain coefficient inequalities, distortion properties, extreme points, radii of starlikeness and convexity, Hadamard product, and convolution and integral operators for the class. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the distributed approximate subgradient-type method for minimizing a sum of differentiable and non-differentiable convex functions subject to nondifferentiable convex functional constraints in a Euclidean space. We establish the convergence of the sequence generated by our method to an optimal solution of the problem under consideration. Moreover, we derive a convergence rate of order O(N1−a) for the objective function values, where a ∈ (0.5, 1). Finally, we provide a numerical example illustrating the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, entries of sequences, infinite series and infinite matrices are real or complex numbers. The present paper is a continuation of [8], where we established some properties of the matrix class (ℓα, ℓα), 0 < α ≤ 1. In this paper, we also record some properties of the class (ℓα, c) and the sequence space ℓα, 0 < α ≤ 1. [ABSTRACT FROM AUTHOR]

If a subset of vertices of a graph, designed in such a way that the remaining vertices have unique identification (usually called representations) with respect to the selected subset, then this subset is named as a metric basis (or resolving set). The minimum count of the elements of this subset is called as metric dimension. This concept opens the gate for different new parameters, like faulttolerant metric dimension, in which the failure of any member of the designed subset is tolerated and the remaining subset fulfills the requirements of the resolving set. In the pattern of the resolving sets, a concept was introduced where the representations of edges must be unique instead of vertices. This concept was called the edge metric dimension, and this as well as the previously mentioned concepts belong to the idea of resolvability parameters in graph theory. In this paper, we find all the above resolving parametric sets of a convex polytope F♃ and compare their cardinalities. [ABSTRACT FROM AUTHOR]

This paper deals with p-maxian problem on cycles with an upper bound on the distances of all facilities. We consider the case of p = 2 and show that, in the worst case, the optimal solution contains at least one vertex of the underlying cycle, which helps to develop an efficient algorithm to solve the constrained 2-maxian problem. Based on this property, we develop a linear time algorithm for the constrained 2-maxian problem on a cycle. We also discuss the relations between the constrained and unconstrained 2-maxian problems on which the underlying graphs are cycles. [ABSTRACT FROM AUTHOR]

The purpose of the present paper is to introduce subclasses of p - valent functions defined by linear operator. Inclusion relationships for functions in these subclasses are discussed. [ABSTRACT FROM AUTHOR]

In this paper we prove some properties for functions that are multivalent in the unit disc |z| < 1 in the complex plane. As a corollary we obtain that if f(z) is p-valent, p ≥ 10, and |arg{f(p)(z)}|<π in |z| < 1, then f (z) is p-valent starlike. [ABSTRACT FROM AUTHOR]

Initialization plays an important role in the accuracy of endmember extraction algorithms (EEAs) in linear hyperspectral unmixing (LHU). Random initialization can lead to varying endmembers generated by EEAs. To address this challenge, an initialization strategy has been introduced, encompassing vertex component analysis (VCA), automatic target generation process (ATGP), among others. These techniques significantly contribute to enhancing the accuracy of EEAs. However, complex initialization is sometimes less preferable, prompting the unexplored question of whether there exists an EEA robust to initialization. This paper focuses on analyzing this issue within the context of minimum simplex volume-based (MV) methods, which have received considerable attention in the past two decades due to their robustness against the absence of pure pixels. MV methods typically formulate LHU as an optimization problem, most of which includes a non-convex volume term. Additionally, many MV methods use VCA as an initialization strategy. Firstly, this paper demonstrates that the variable splitting augmented Lagrangian approach (SISAL), as a representative non-convex MV method, heavily depends on initialization. To our knowledge, the impact of initialization for MV methods has not been thoroughly analyzed before. Furthermore, this paper proposes an initially robust MV method by introducing a new convex MV term. Numerical experiments conducted on simulated and real datasets demonstrate its outstanding performance in accuracy and robustness to initialization. Throughout the experiments the proposed method proves to be the most stable, which is crucial in real scene where the ground truth is unknown beforehand. [ABSTRACT FROM AUTHOR]

The theory of geometric functions was first introduced by Bernard Riemann in 1851. In 1916, with the concept of normalized function revealed by Bieberbach, univalent function concept has found application area. Assume f(z)=z+Σn>2(anzn converges for all complex numbers z with 1,|z|, and f(z)is one-to-one on the set of such z. Convex and starlike functions f(z) and g(z) are discussed with the help of subordination. The f(z) and g(z) are analytic in unit disc and f(0)0,f'(0)=1, and g(0)=0,g'(0)-1=0. A single valued function f(z) is said to be univalent (or schlict or one-to-one) in domain DCC never gets the same value twice; that is, if f(x1)-fz2 for all z1 and z2 with z1= z2. Let A be the class of analytic functions in the unit disk U={z:|z|1} that are normalized with f(0)=0,f'(0)=1. In this paper we give the some necessary conditions for f(z)E S*[a,a²] and 0< a²-r. [ABSTRACT FROM AUTHOR]

The objective of this paper is to construct canonical Orlicz class and study their fundamental properties. Also, we prove that this space contains Henstock–Kurzweil integrable functions. [ABSTRACT FROM AUTHOR]

The normalization of the combination of generalized Lommel–Wright function J κ 1 , κ 2 κ 3 , m (z) (m ∈ N , κ 3 > 0 and κ 1 , κ 2 ∈ C ) defined by J κ 1 , κ 2 κ 3 , m (z) : = Γ m (κ 1 + 1) Γ (κ 1 + κ 2 + 1) 2 2 κ 1 + κ 2 z 1 − (κ 2 / 2) − κ 1 J κ 1 , κ 2 κ 3 , m (z) , where J κ 1 , κ 2 κ 3 , m (z) : = (1 − 2 κ 1 − κ 2) J κ 1 , κ 2 κ 3 , m (z) + z (J κ 1 , κ 2 κ 3 , m (z)) ′ and J κ 1 , κ 2 κ 3 , m (z) = (z 2) 2 κ 1 + κ 2 ∑ n = 0 ∞ (− 1) n Γ m (n + κ 1 + 1) Γ (n κ 3 + κ 1 + κ 2 + 1) (z 2) 2 n , was previously introduced and some of its geometric properties have been considered. In this paper, we report conditions for J κ 1 , κ 2 κ 3 , m (z) to be starlike and convex of order α, 0 ≤ α < 1 , inside the open unit disk using some technical manipulations of the gamma and digamma functions, as well as inequality for the digamma function that has been proved (Guo and Qi in Proc. Am. Math. Soc. 141(3):1007–1015, 2013). In addition, a method presented by Lorch (J. Approx. Theory 40(2):115–120 1984) and further developed by Laforgia (Math. Compet. 42(166):597–600 1984) is applied to establish firstly sharp inequalities for the shifted factorial that will be used to obtain the order of starlikeness and convexity. We compare then the obtained orders of starlikeness and convexity with some important consequences in the literature as well as the results proposed by all techniques to demonstrate the accuracy of our approach. Ultimately, a lemma by (Fejér in Acta Litt. Sci. 8:89–115 1936) is used to prove that the modified form of the function J κ 1 , κ 2 κ 3 , m (z) defined by I κ 1 , κ 2 κ 3 , m (z) = J κ 1 , κ 2 κ 3 , m (z) ∗ z / (1 + z) is in the class of starlike and convex functions, respectively. Further work regarding the function J κ 1 , κ 2 κ 3 , m (z) is underway and will be presented in a forthcoming paper. [ABSTRACT FROM AUTHOR]

In recent years, the theory of convex mappings has gained much more attention due to its massive utility in different fields of mathematics. It has been characterized by different approaches. In 1929, G. H. Hardy, J. E. Littlewood, and G. Polya established another characterization of convex mappings involving an ordering relationship defined over R n known as majorization theory. Using this theory many inequalities have been obtained in the literature. In this paper, we study Hermite–Hadamard type inequalities using the Jensen–Mercer inequality in the frame of q ˙ -calculus and majorized l-tuples. Firstly we derive q ˙ -Hermite–Hadamard–Jensen–Mercer (H.H.J.M) type inequalities with the help of Mercer's inequality and its weighted form. To obtain some new generalized (H.H.J.M)-type inequalities, we prove a generalized quantum identity for q ˙ -differentiable mappings. Next, we obtain some estimation-type results; for this purpose, we consider q ˙ -identity, fundamental inequalities and the convexity property of mappings. Later on, We offer some applications to special means that demonstrate the importance of our main results. With the help of numerical examples, we also check the validity of our main outcomes. Along with this, we present some graphical analyses of our main results so that readers may easily grasp the results of this paper. [ABSTRACT FROM AUTHOR]

In this paper, the CQN_Chen function is used to characterize the plastic anisotropic evolution of 304 stainless steel (SS304). The uniaxial tensile tests along different loading directions are conducted to experimentally investigate the anisotropic hardening behavior for SS304. The experimental data indicates that the anisotropy of SS304 is weak. The convexity analysis is carried out by the geometry-inspired numerical convex analysis method for the CQN_Chen yield locus during plastic deformation. The Hill48, SY2009 and CQN functions are used as the comparison to evaluate the accuracy of the CQN_Chen function in characterizing plastic evolution. The predicted values are compared with the experimental data. The comparison demonstrates that the CQN_Chen function can accurately characterize anisotropic hardening behavior under uniaxial tension along distinct loading directions and equibiaxial tension. Simultaneously, the CQN_Chen model has the capacity to adjust the yield surface shape between uniaxial tension and equibiaxial tension. The CQN_Chen model is recommended to characterize plastic evolving behavior under uniaxial tension along different directions and equibiaxial tension. [ABSTRACT FROM AUTHOR]

This paper aims to introduce a measure of the non-univalency of a harmonic mapping. By using it, we find the best approximation of an analytic function by a univalent harmonic mapping. [ABSTRACT FROM AUTHOR]

The objective of this paper is to explore novel unified continuous and discrete versions of the Trapezium-Jensen-Mercer (TJM) inequality, incorporating the concept of convex mapping within the framework of q-calculus, and utilizing majorized tuples as a tool. To accomplish this goal, we establish two fundamental lemmas that utilize the 1q and 2q differentiability of mappings, which are critical in obtaining new left and right side estimations of the midpoint q-TJM inequality in conjunction with convex mappings. Our findings are significant in a way that they unify and improve upon existing results. We provide evidence of the validity and comprehensibility of our outcomes by presenting various applications to means, numerical examples, and graphical illustrations. [ABSTRACT FROM AUTHOR]

A similar problem was recently considered with (t) (is the maximum value for the existence or no existence of), and. In this paper, we study same the equation (with) and we establish the existence of solutions satisfying the boundary conditions (0) (0) and (+). In order to do that, we utilize the shooting technique, then we consider the initial value problem consisting of the differential equation such that... and... We accompany our results by some numerical illustrations.. [ABSTRACT FROM AUTHOR]

Let G be a connected graph. A set S ⊆ V (G) is convex 2-dominating if S is both convex and 2-dominating. The minimum cardinality among all convex 2-dominating sets in G, denoted by γ2con(G), is called the convex 2-domination number of G. In this paper, we initiate the study of convex 2- domination in graphs. We show that any two positive integers a and b with 6 ≤ a ≤ b are, respectively, realizable as the convex domination number and convex 2-domination number of some connected graph. Furthermore, we characterize the convex 2-dominating sets in the join, corona, lexicographic product, and Cartesian product of two graphs and determine the corresponding convex 2-domination number of each of these graphs. [ABSTRACT FROM AUTHOR]

Let H be the class of complex-valued harmonic mappings f = h + g ¯ defined in the unit disk D := { z ∈ C : | z | < 1 } , where h and g are analytic functions in D with the normalization h (0) = 0 = h ′ (0) − 1 and g (0) = 0. Let H 0 = { f = h + g ¯ ∈ H : g ′ (0) = 0 }. Let P H 0 (M) := { f = h + g ¯ ∈ H 0 : Re (z h ′ ′ (z)) > − M + | z g ′ ′ (z) | , z ∈ D and M > 0 }. be the class of harmonic univalent mappings in the unit disk D [Ghosh N, Allu V. On some subclasses of harmonic mappings. Bull Aust Math Soc. 2020;101:130–140.]. In this paper, we obtain the sharp Bohr–Rogosinski inequality, improved Bohr inequality, refined Bohr inequality and Bohr-type inequality for the class P H 0 (M). [ABSTRACT FROM AUTHOR]

The concept of convex ordered hyperrings associated with a strongly regular relation was investigated in this study. In this paper, we first studied hyperatom elements of ordered hyperrings and then investigated characterizations of quotient ordered rings. Is there a strongly regular relation θ on a convex ordered hyperring R for which R / θ is a convex ordered ring? This leads to an ordered ring obtained from an ordered hyperring. [ABSTRACT FROM AUTHOR]

The main focus of the present paper is to establish sufficient conditions for the parameters of the normalized form of the generalized Le Roy-type Mittag-Leffler function have certain geometric properties like close-to-convexity, univalency, convexity and starlikeness inside the unit disc. The results are new and their usefulness is depicted by deducing several interesting corollaries. The results improve several results available in the literature for the Mittag-Leffler function. [ABSTRACT FROM AUTHOR]

The aim of this paper is to derive some new fractional analogues of trapezium like inequalities essentially using a new three variable extension of Riemann-Liouville fractional integrals. In order to establish the main results of the paper we use the three variable convexity property of the functions. [ABSTRACT FROM AUTHOR]

C*-algebras form rather general and rich mathematical structures that can be studied with different morphisms (preserving multiplication, or not), and with different properties (commutative, or not). These various options can be used to incorporate various styles of computation (set-theoretic, probabilistic, quantum) inside categories of C*-algebras. At first, this paper concentrates on the commutative case and shows that there are functors from several Kleisli categories, of monads that are relevant to model probabilistic computations, to categories of C*-algebras. This yields a new probabilistic version of Gelfand duality, involving the "Radon" monad on the category of compact Hausdorff spaces. We then show that the state space functor from C*-algebras to Eilenberg-Moore algebras of the Radon monad is full and faithful. This allows us to obtain an appropriately commuting state-and-effect triangle for C*-algebras. [ABSTRACT FROM AUTHOR]

In this paper, by use of the familiar concept of neighborhoods of p-valently analytic functions, the authors show several inclusion relations associated with the (n, τ)-neighborhood of certain subclasses of analytic functions. [ABSTRACT FROM AUTHOR]

Let H be the class of complex-valued harmonic mappings f = h + g ¯ defined in the unit disk D , where h and g are analytic functions in D with h (0) = 0 = h ′ (0) - 1 and g (0) = 0 and H 0 = { f = h + g ¯ ∈ H : g ′ (0) = 0 } and P H 0 (M) : = { f = h + g ¯ ∈ H 0 : Re (z h ″ (z)) > - M + | z g ″ (z) | , z ∈ D , M > 0 } . Functions in the class P H 0 (M) are known to be fully starlike univalent functions for 0 < M < 1 / log 4 . In this paper, we obtain the sharp Bohr–Rogosinski type inequality and improved Bohr inequality and the corresponding Bohr radius for the class P H 0 (M) . [ABSTRACT FROM AUTHOR]

In this paper we show that the set of Gibbs measures for models with countable set of spin values is convex and compact. Also, by using analogue of Kolmogorov’s extension theorem, we prove the set of Gibbs measures for the models is nonempty. [ABSTRACT FROM AUTHOR]

The main objective of this paper is to analyze the Montgomery identities and Ostrowski like inequalities, within the framework of quantum calculus. The study utilizes qϖ3 and qϖ4 differentiable functions to establish two new Montgomery identities, which are essential for the development of our main results which are new quantum estimates of general Ostrowski type inequality. The study involves numerous techniques, including q-identities, Hölder-like inequalities, and the Jensen-Mercer inequality for convex mappings, to derive the main outcomes of the paper. Additionally, the study presents special cases, numerical validation, and graphical illustrations to support the main results.

In this paper, we derive two new identities involving q-Riemann-Liouville fractional integrals. Using these identities, as auxiliary results, we derive some new q-fractional estimates of trapezoidal-like inequalities, essentially using the class of generalized exponential convex functions. [ABSTRACT FROM AUTHOR]

In the paper, we introduce subclasses of meromorphic functions by using principle of subordination and find necessary and sufficient condition for coefficients of functions F to belonge to these classes. [ABSTRACT FROM AUTHOR]

This paper introduces the stochastic Fejér-monotone hybrid steepest descent method (S-FM-HSDM) to solve affinely constrained and composite convex minimization tasks. The minimization task is not known exactly; noise contaminates the information about the composite loss function and the affine constraints. S-FM-HSDM generates sequences of random variables that, under certain conditions and with respect to a probability space, converge point-wise to solutions of the noiseless minimization task. S-FM-HSDM enjoys desirable attributes of optimization techniques such as splitting of variables and constant step size (learning rate). Furthermore, it provides a novel way of exploiting the information about the affine constraints via fixed-point sets of appropriate nonexpansive mappings. Among the offsprings of S-FM-HSDM, the hierarchical recursive least squares (HRLS) takes advantage of S-FM-HSDM's versatility toward affine constraints and offers a novel twist to LS by generating sequences of estimates that converge to solutions of a hierarchical optimization task: minimize a convex loss over the set of minimizers of the ensemble LS loss. Numerical tests on a sparsity-aware LS task show that HRLS compares favorably to several state-of-the-art convex, as well as non-convex, stochastic-approximation, and online-learning counterparts. [ABSTRACT FROM AUTHOR]

This paper studies Markov decision processes (MDPs) with atomless initial state distributions and atomless transition probabilities. Such MDPs are called atomless. The initial state distribution is considered to be fixed. We show that for discounted MDPs with bounded one-step reward vector-functions, for each policy there exists a deterministic (that is, nonrandomized and stationary) policy with the same performance vector. This fact is proved in the paper for a more general class of uniformly absorbing MDPs with expected total rewards, and then it is extended under certain assumptions to MDPs with unbounded rewards. For problems with multiple criteria and constraints, the results of this paper imply that for atomless MDPs studied in this paper it is sufficient to consider only deterministic policies, while without the atomless assumption it is well-known that randomized policies can outperform deterministic ones. We also provide an example of an MDP demonstrating that if a vector measure is defined on a standard Borel space, then Lyapunov's convexity theorem is a special case of the described results. [ABSTRACT FROM AUTHOR]

Spectrum resources are the precious and limited natural resources. In order to improve the utilization of spectrum resources and maximize the network throughput, this paper studies the resource allocation of the downlink cognitive radio network with non-orthogonalmultiple access (CRN-NOMA). NOMA, as the key technology of the fifth-generation communication (5G), can effectively increase the capacity of 5G networks. The optimization problem proposed in this paper aims to maximize the number of secondary users (SUs) accessing the system and the total throughput in the CRN-NOMA. Under the constraints of total power, minimum rate, interference and SINR, CRN-NOMA throughput is maximized by allocating optimal transmission power. First, for the situation of multiple sub-users, an adaptive optimization method is proposed to reduce the complexity of the optimization solution. Secondly, for the optimization problem of nonlinear programming, a maximization throughput optimization algorithm based on Chebyshev and convex (MTCC) for CRN-NOMA is proposed, which converts multi-objective optimization problem into single-objective optimization problem to solve. At the same time, the convergence and time complexity of the algorithm are verified. Theoretical analysis and simulation results show that the algorithm can effectively improve the system throughput. In terms of interference and throughput, the performance of the sub-optimal solution is better than that of orthogonal-frequency-division-multiple-access (OFDMA). This paper provides important insights for the research and application of NOMA in future communications. [ABSTRACT FROM AUTHOR]

The main objective of this paper is to obtain some new trapezium type in-equalities essentially involving the class of harmonic convex functions and generalized fractional integrals. [ABSTRACT FROM AUTHOR]

The aim of the present paper is to introduce and study a subfamily of holomorphic and normalized functions defined by a differential inequality. Some geometric properties of this family of holomorphic functions and different problems of a family of such functions are presented. [ABSTRACT FROM AUTHOR]

In this paper, we consider a distributed optimization problem of minimizing sum of convex functions over the intersection of fixed-point constraints. We propose a distributed method for solving the problem. We prove the convergence of the generated sequence to the solution of the problem under certain assumption. We further discuss the convergence rate with an appropriate positive stepsize. A numerical experiment is given to show the effectiveness of the obtained theoretical result. [ABSTRACT FROM AUTHOR]

In this paper, we would like to state well-known Ostrowski inequality via generalized Montgomery identity for the Φ - λ -convex function. Also, we would like to state the generalization of the classical Ostrowski inequality via generalized fractional integrals, which is obtained for functions whose first derivative in absolute values is Φ - λ -convex. Moreover we establish some Ostrowski type inequalities via generalized fractional integrals and their particular cases for the class of functions whose derivatives in absolute values at certain powers are Φ - λ - convex by using different techniques including Hölder's inequality and power mean inequality. Also, standard results would be capture as special cases. Moreover, some applications in terms of special means would also be given. [ABSTRACT FROM AUTHOR]

In this paper we study some results concerning the Hadamard product of certain classes related to uniformly starlike and convex univalent meromorphic functions with positive coefficients. [ABSTRACT FROM AUTHOR]

In 1964, Levinson [4] proved integral inequalities concerning generalization of Hardy's inequalities. In this paper two results are given. First one is extension of the Levinson Integral inequalities via convexity and the second is for the Levinson Integral inequalities of Hardy, this inequalities are established for p < 1 and some related inequalities are also considered with a sharp constant. [ABSTRACT FROM AUTHOR]

Let H be the class of harmonic functions f = h + g ¯ in the unit disk D : = { z ∈ C : | z | < 1 } , where h and g are analytic in D . Let P H 0 (α) = { f = h + g ¯ ∈ H : Re (h ′ (z) - α) > | g ′ (z) | with 0 ≤ α < 1 , g ′ (0) = 0 , z ∈ D } be the class of close-to-convex mappings defined by Li and Ponnusamy (Nonlinear Anal 89:276–283, 2013). In this paper, we obtain the sharp Bohr–Rogosinski radius, improved Bohr radius and refined Bohr radius for the class P H 0 (α) . [ABSTRACT FROM AUTHOR]