Bounds of <Emphasis Type="Italic">p</Emphasis>-adic weighted Hardy-Cesàro operators and their commutators on <Emphasis Type="Italic">p</Emphasis>-adic weighted spaces of Morrey types

In this paper we aim to investigate the boundedness of the p-adic weighted Hardy-Cesàro operators and their commutators on weighted functional spaces of Morrey type. In each case, we obtain the corresponding operator norms.     

The challenge in managing new financial risks: adopting an heuristic or theoretical approach

The financial crisis began with the collapse of Lehman Brothers and the subprime asset backed securities debacle. Credit risk was turned into liquidity risk, resulting in a lack of confidence among financial institutions. In this article, we will propose a way to model liquidity risk and the credit risk in best practices. We will show that liquidity risk is a new type of risk and the current way to deal with it is based solely on observed variables without any theoretical link. We propose an heuristic approach to combine the numerous liquidity risk indicators with a logistic regression for the first time. In regards to credit risk, several articles prove that the best practice is to use an option model to appreciate this risk. We will present our methodology using stochastic diffusion for the interest rate because currently the yield curves aren’t liquid. This approach is more relevant because the basis model in prior publications has a constant interest rate or a forward rate. Both models allow a better understanding of liquidity and credit risks and the further development of research deals with the link between these two financial risks.     

A computational study of hybrid approaches of metaheuristic algorithms for the cell formation problem

In this paper we solve the 0–1 cell formation problem where the number of cells is fixed a priori and where the objective is to maximize the overall efficiency of a production system by grouping together machines providing service to similar parts into a subsystem (denoted cell). Three different methods are introduced and compared numerically. The first local search method is an implementation of simulated annealing (SA) where the definition of the neighbourhood is specific to the application and requires using a diversification and intensification strategies. The second local search method is an adaptive simulated annealing method where the neighbourhood is selected randomly at each iteration. The procedure is adaptive in the sense that the probability of selecting a neighbourhood is updated during the process. The third method is a hybrid method (HM) of a population-based method and a local search method. To improve the solution obtained with HM, we apply a SA method afterward. The best variants are very efficient to solve the 35 benchmark problems commonly used in the literature.     

Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches

In this paper, we consider a task allocation model that consists of assigning a set of m unmanned aerial vehicles (UAVs) to a set of n tasks in an optimal way. The optimality is quantified by target scores. The mission is to maximize the target score while satisfying capacity constraints of both the UAVs and the tasks. This problem is known to be NP-hard. Existing algorithms are not suitable for the large scale setting. Scalability and robustness are recognized as two main issues. We deal with these issues by two optimization approaches. The first approach is the Cross-Entropy (CE) method, a generic and practical tool of stochastic optimization for solving NP-hard problem. The second one is Branch and Bound algorithm, an efficient classical tool of global deterministic optimization. The numerical results show the efficiency of our approaches, in particular the CE method for very large scale setting.     

Improperly efficient solutions in a class of vector optimization problems

Journal of Global Optimization - Improperly efficient solutions in the sense of Geoffrion in linear fractional vector optimization problems with unbounded constraint sets are studied systematically...     

A Perturbation Approach to Vector Optimization Problems: Lagrange and Fenchel–Lagrange Duality

Journal of Optimization Theory and Applications - In this paper, we study a general minimization vector problem which is expressed in terms of a perturbation mapping defined on a product of locally...     

Natural Abundance 17O-NMR. Study of Some Macrocyclic Complexes with Alkali Metal Cations

Complexation between crown ethers 12C4, 15C5, 18C6 and cryptand 222, and alkali cations Li⁺, Na⁺, K⁺ in various solvents were studied by ¹⁷O-NMR. spectroscopy. Small diamagnetic shifts arising from the cation electric field are observed. They increase according to the sequence K⁺ < Na⁺ < Li⁺. ¹⁷O-linewidth are discussed and compared to the ¹³C relaxation times. Linewidth modification results mainly from modifications of the effective correlation time. In general, for crown ethers, considerable line broadening occurs when the cation fits well into the cavity but line narrowing occurs when the cation is much smaller than the cavity.     

Oxygen-17 nuclear magnetic resonance: The effects of remote unsaturation on 17o-chemical shifts in polycyclic ethers

Natural-abundance ¹⁷O-NMR spectra of 7-oxanorbornane exo-3-oxatricyclo [3.2.1.0^2.4]octane and their unsaturated derivatives (endo cyclic and exocyclic double bonds) have been measured. Linear correlation laws were observed for $\text{δ}{}_{\mathrm{o}}\text{δ}{}_{\mathrm{c}}$ of these ethers/corresponding hydrocarbons. The “cyclization shifts” for δ_o in ethers were not correlated by the “cyclization shifts” for δ_c of the corresponding hydrocarbons.