Image inpainting methods recover true images from partial noisy observations. Natural images usually have two layers consisting of cartoons and textures. Methods using simultaneous cartoon and texture inpainting are popular in the literature by using two combined tight frames: one (often built from wavelets, curvelets or shearlets) provides sparse representations for cartoons and the other (often built from discrete cosine transforms) offers sparse approximation for textures. Inspired by the recent development on directional tensor product complex tight framelets ( $\text{TP}\text{-}\mathbb{C}\text{TF}$ s) and their impressive performance for the image denoising problem, we propose an iterative thresholding algorithm using tight frames derived from $\text{TP}\text{-}\mathbb{C}\text{TF}$ s for the image inpainting problem. The tight frame $\text{TP}\text{-}\mathbb{C}\text{TF}_{6}$ contains two classes of framelets; one is good for cartoons and the other is good for textures. Therefore, it can handle both the cartoons and the textures well. For the image inpainting problem with additive zero-mean independent and identically distributed Gaussian noise, our proposed algorithm does not require us to tune parameters manually for reasonably good performance. Experimental results show that our proposed algorithm performs comparatively better than several well-known frame systems for the image inpainting problem.

We study a nonpreemptive scheduling on two parallel identical machines with a dedicated loading server and a dedicated unloading server. Each job has to be loaded by the loading server before being processed on one of the machines and unloaded immediately by the unloading server after its processing. The loading and unloading times are both equal to one unit of time. The goal is to minimize the makespan. Since the problem is NP-hard, we apply the classical list scheduling and largest processing time heuristics, and show that they have worst-case ratios, $8/5$ and $6/5$ , respectively.

We analyse a parallel (identical) machine scheduling problem with job delivery to a single customer. For this problem, each job needs to be processed on $m$ parallel machines non-pre-emptively and then transported to a customer by one vehicle with a limited physical capacity. The optimization goal is to minimize the makespan, the time at which all the jobs are processed and delivered and the vehicle returns to the machine. We present an approximation algorithm with a tight worst-case performance ratio of $7/3-1/m$ for the general case, $m\geq 3$ .

We analyse the coverage performance of cognitive radio networks powered by renewable energy. Particularly, with an energy harvesting module and energy storage module, the primary transmitters (PTs) and the secondary transmitters (STs) are assumed to be able to collect ambient renewables, and store them in batteries for future use. Upon harvesting sufficient energy, the corresponding PTs and STs (denoted by eligible PTs and STs) are then allowed to access the spectrum according to their respective medium access control (MAC) protocols. For the primary network, an Aloha-type MAC protocol is considered, under which the eligible PTs make independent decisions to access the spectrum with probability $\unicode[STIX]{x1D70C}_{p}$ . By applying tools from stochastic geometry, we characterize the transmission probability of the STs. Then, with the obtained results of transmission probability, we evaluate the coverage (transmission nonoutage) performance of the overlay CR network powered by renewable energy. Simulations are also provided to validate our analysis.

We provide an elementary method for exploring pricing problems of one spread options within a fractional Wick–Itô–Skorohod integral framework. Its underlying assets come from two different interactive markets that are modelled by two mixed fractional Black–Scholes models with Hurst parameters, $H_{1}\neq H_{2}$ , where $1/2\leq H_{i}<1$ for $i=1,2$ . Pricing formulae of these options with respect to strike price $K=0$ or $K\neq 0$ are given, and their application to the real market is examined.

A new generalized class of fuzzy implications, called ( $h,f,g$ )-implications, is introduced and discussed in this paper. The results show that the new fuzzy implications possess some good properties, such as the left neutrality property and the exchange principle.

The valuation of perpetual timer options under the Hull–White stochastic volatility model is discussed here. By exploring the connection between the Hull–White model and the Bessel process and using time-change techniques, the triple joint distribution for the instantaneous volatility, the cumulative reciprocal volatility and the cumulative realized variance is obtained. An explicit analytical solution for the price of perpetual timer call options is derived as a Black–Scholes–Merton-type formula.

We study a delayed fuzzy $H_{\infty }$ control problem for an offshore platform under external wave forces. First, by considering perturbations of the masses of the platform and an active mass damper, a Takagi–Sugeno fuzzy model is established. Then, by introducing time delays into the control channel, a delayed fuzzy state feedback $H_{\infty }$ controller is designed. Simulation results show that the delayed fuzzy state feedback $H_{\infty }$ controller can reduce vibration amplitudes of the offshore platform and can save control cost significantly.

We investigate the approximate controllability of a size- and space-structured population model, for which the control function acts on a subdomain and corresponds to the migration of individuals. We establish the main result via the unique continuation property of the adjoint system. The desired controller is the minimizer of an infinite-dimensional optimization problem.

Based on the definition of divisibility of Markovian quantum dynamics, we discuss the Markovianity of tensor products, multiplications and some convex combinations of Markovian quantum dynamics. We prove that the tensor product of two Markovian dynamics is also a Markovian dynamics and propose a new witness of non-Markovianity.

This paper investigates interrelated price online inventory problems, in which decisions as to when and how much of a product to replenish must be made in an online fashion to meet some demand even without a concrete knowledge of future prices. The objective of the decision maker is to minimize the total cost while meeting the demands. Two different types of demand are considered carefully, that is, demands which are linearly and exponentially related to price. In this paper, the prices are online, with only the price range variation known in advance, and are interrelated with the preceding price. Two models of price correlation are investigated, namely, an exponential model and a logarithmic model. The corresponding algorithms of the problems are developed, and the competitive ratios of the algorithms are derived as the solutions by use of linear programming.

In this paper, we characterize Borel $\unicode[STIX]{x1D70E}$ -fields of the set of all fuzzy numbers endowed with different metrics. The main result is that the Borel $\unicode[STIX]{x1D70E}$ -fields with respect to all known separable metrics are identical. This Borel field is the Borel $\unicode[STIX]{x1D70E}$ -field making all level cut functions of fuzzy mappings from any measurable space to the fuzzy number space measurable with respect to the Hausdorff metric on the cut sets. The relation between the Borel $\unicode[STIX]{x1D70E}$ -field with respect to the supremum metric $d_{\infty }$ is also demonstrated. We prove that the Borel field is induced by a separable and complete metric. A global characterization of measurability of fuzzy-valued functions is given via the main result. Applications to fuzzy-valued integrals are given, and an approximation method is presented for integrals of fuzzy-valued functions. Finally, an example is given to illustrate the applications of these results in economics. This example shows that the results in this paper are basic to the theory of fuzzy-valued functions, such as the fuzzy version of Lebesgue-like integrals of fuzzy-valued functions, and are useful in applied fields.

We investigate delayed state feedback control of a periodic-review inventory management system with perishable goods. The stock under consideration is replenished from multiple supply sources. By using delayed states as well as current states of the inventory system, a delayed feedback $H_{\infty }$ control strategy is developed to mitigate bullwhip effects of the system. Some conditions on the existence of the delayed feedback $H_{\infty }$ controller are derived. It is found through simulation results that the proposed delayed $H_{\infty }$ control scheme is capable of improving the performance of the inventory management significantly. In addition, the delayed controller is better than the traditional delay-free $H_{\infty }$ controller.

We analyse the asymptotic behaviour of a biological system described by a stochastic competition model with $n$ species and $k$ resources (chemostat model), in which the species mortality rates are influenced by the fractional Brownian motion of the extrinsic noise environment. By constructing a Lyapunov functional, the persistence and extinction criteria are derived in the mean square sense. Some examples are given to illustrate the effectiveness of the theoretical result.

We address the construction and approximation for feed-forward neural networks (FNNs) with zonal functions on the unit sphere. The filtered de la Vallée-Poussin operator and the spherical quadrature formula are used to construct the spherical FNNs. In particular, the upper and lower bounds of approximation errors by the FNNs are estimated, where the best polynomial approximation of a spherical function is used as a measure of approximation error.

We consider a class of network-design problems with minimum sum of modification and network costs for minimum spanning trees under Hamming distance. By constructing three auxiliary networks, we present a strongly polynomial-time algorithm for this problem. The method can be applied to solve many network-design problems. And, we show that a variation model of this problem is NP-hard, even when the underlying network is a tree, by transforming the 0–1 knapsack problem to this model.

Understanding how seasonal patterns change from year to year is important for the management of infectious disease epidemics. Here, we present a mathematical formalization of the application of complex demodulation, which has previously only been applied in an exploratory manner in the context of infectious diseases. This method extracts the changing amplitude and phase from seasonal data, allowing comparisons between the size and timing of yearly epidemics. We first validate the method using synthetic data that displays the key features of epidemic data. In particular, we analyse both annual and biennial synthetic data, and explore the effect of delayed epidemics on the extracted amplitude and phase. We then demonstrate the usefulness of complex demodulation using national notification data for influenza in Australia. This method clearly highlights the higher number of notifications and the early peak of the influenza pandemic in 2009. We also identify that epidemics that peaked later than usual generally followed larger epidemics and involved fewer overall notifications. Our analysis establishes a role for complex demodulation in the study of seasonal epidemiological events.

The $L_{r}$ convergence and a class of weak laws of large numbers are obtained for sequences of $\widetilde{\unicode[STIX]{x1D70C}}$ -mixing random variables under the uniform Cesàro-type condition. This is weaker than the $p$ th-order Cesàro uniform integrability.

Computer or communication networks are so designed that they do not easily get disrupted under external attack. Moreover, they are easily reconstructed when they do get disrupted. These desirable properties of networks can be measured by various parameters, such as connectivity, toughness and scattering number. Among these parameters, the isolated scattering number is a comparatively better parameter to measure the vulnerability of networks. In this paper we first prove that for split graphs, this number can be computed in polynomial time. Then we determine the isolated scattering number of the Cartesian product and the Kronecker product of special graphs and special permutation graphs.