The global attractor of a non-local PDE model with delay for population dynamics in ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

In this paper, we consider a non-local PDE model with delay for population dynamics in ℝ ⁿ . First, we prove the existence and uniqueness of weak solutions under some suitable decayed assumptions on non-local term at infinity. Then, we obtain the global attractor by proving ω-limit compactness property of the solution operator semigroup.     

The coherent-constructible correspondence and Fourier-Mukai transforms

As evidence for his conjecture in birational log geometry, Kawamata constructed a family of derived equivalences between toric orbifolds. In a previous paper, the authors showed that the derived category of a toric orbifold is naturally identified with a category of polyhedrally-constructible sheaves on ℝ ⁿ . In this paper we investigate and reprove some of Kawamata’s results from this perspective.     

Optimizing fracture design based on a novel RBF neural network

The factors affecting performance of fractured wells are analyzed in this work. The static and dynamic geologic data of fractured well and fracturing treatment parameters obtained from 51 fractured wells in sand reservoirs of Zhongyuan oilfield are analyzed by applying the grey correlation method. Ten parameters are screened, including penetrability, porosity, net thickness, oil saturation, water cut, average daily production, and injection rate, amount cementing front spacer, amount sand-carrying agent and amount sand. With the novel Radial Basis Function neural network model based on immune principles, 13 parameters of 42 wells out of 51 are used as the input samples and the stimulation ratios as the output samples. The nonlinear interrelationship between the input samples and output samples are investigated, and a productivity prediction model of optimizing fracture design is established. The data of the rest 7 wells are used to test the model. The results show that the relative errors are all less than 7%, which proves that the novel Radial Basis Function neural network model based on immune principles has less calculation, high precision and good generalization ability.     

On countable unions of nonmeager sets in hereditarily Lindelöf spaces

It is well known that any Vitali set on the real line ? does not possess the Baire property. The same is valid for finite unions of Vitali sets. What can be said about infinite unions of Vitali sets? Let S be a Vitali set, S _r be the image of S under the translation of ? by a rational number r and F = {S _r : r is rational}. We prove that for each non-empty proper subfamily F′ of F the union ∪F′ does not possess the Baire property. We say that a subset A of ? possesses Vitali property if there exist a non-empty open set O and a meager set M such that A ? O \ M. Then we characterize those non-empty proper subfamilies F′ of F which unions ∪F′ possess the Vitali property.     

Bootstrap approximation of wavelet estimates in a semiparametric regression model

The inference for the parameters in a semiparametric regression model is studied by using the wavelet and the bootstrap methods. The bootstrap statistics are constructed by using Efron＇s resampling technique, and the strong uniform convergence of the bootstrap approximation is proved. Our results can be used to construct the large sample confidence intervals for the parameters of interest. A simulation study is conducted to evaluate the finite-sample performance of the bootstrap method and to compare it with the normal approximation-based method.     

Geometric properties of the ridge function manifold

We study geometrical properties of the ridge function manifold \(\mathcal{R}_n\) consisting of all possible linear combinations of n functions of the form g(a· x), where a·x is the inner product in \({\mathbb R}^d\). We obtain an estimate for the ε-entropy numbers in terms of smaller ε-covering numbers of the compact class G _n,s formed by the intersection of the class \(\mathcal{R}_n\) with the unit ball \(B\mathcal{P}_s^d\) in the space of polynomials on \({\mathbb R}^d\) of degree s. In particular we show that for n?≤?s ^d???1 the ε-entropy number H _ε (G _n,s,L _q ) of the class G _n,s in the space L _q is of order nslog1/ε (modulo a logarithmic factor). Note that the ε-entropy number \(H_\varepsilon(B\mathcal{P}_s^d,L_q)\) of the unit ball is of order s ^d log1/ε. Moreover, we obtain an estimate for the pseudo-dimension of the ridge function class G _n,s.     

A fuzzy greedy heuristic for permutation flow-shop scheduling

This paper describes a polynomial-time heuristic for the permutation flow-shop scheduling problem with the makespan criterion. The proposed method consists of two phases: arranging the jobs in priority order and then constructing a sequence. A fuzzy greedy evaluation function is employed to prioritize the jobs for incorporating into the construction phase of the heuristic. Computational experiments using standard benchmark problems indicate an improvement of the new heuristic over the well-known Nawaz, Enscore and Ham (NEH) heuristic. It will be seen that the NEH heuristic is a special case of our more general heuristic.     

Covering continuous demand in the plane

Continuous demand is generated in a convex polygon. A facility located in the area covers demand within a given radius. The objective is to find the locations for p facilities that cover the maximum demand in the area. A procedure that calculates the total area covered by a set of facilities is developed. A multi start heuristic approach for solving this problem is proposed by applying a gradient search from a randomly generated set of p locations for the facilities. Computational experiments for covering a square area illustrate the effectiveness of the proposed algorithm.     

Vehicle routing and scheduling with time-varying data: A case study

A heuristic algorithm is described for vehicle routing and scheduling problems to minimise the total travel time, where the time required for a vehicle to travel along any road in the network varies according to the time of travel. The variation is caused by congestion that is typically greatest during morning and evening rush hours. The algorithm is used to schedule a fleet of delivery vehicles operating in the South West of the United Kingdom for a sample of days. The results demonstrate how conventional methods that do not take time-varying speeds into account when planning, except for an overall contingency allowance, may still lead to some routes taking too long. The results are analysed to show that in the case study using the proposed approach can lead to savings in CO₂ emissions of about 7%.     

Modelling credit risk of portfolio of consumer loans

One of the issues that the Basel Accord highlighted was that, though techniques for estimating the probability of default and hence the credit risk of loans to individual consumers are well established, there were no models for the credit risk of portfolios of such loans. Motivated by the reduced form models for credit risk in corporate lending, we seek to exploit the obvious parallels between behavioural scores and the ratings ascribed to corporate bonds to build consumer-lending equivalents. We incorporate both consumer-specific ratings and macroeconomic factors in the framework of Cox Proportional Hazard models. Our results show that default intensities of consumers are significantly influenced by macro factors. Such models then can be used as the basis for simulation approaches to estimate the credit risk of portfolios of consumer loans.