Peripheral spectrum of positive quasi-compact operators onC 0(X)

LetX be a locally compact space, andT, a quasi-compact positive operator onC ₀(X), with positive spectral radius,r. Then the peripheral spectrum ofT is a finite set of poles containingr, and the residue of the resolvent ofT at each peripheral pole is of finite rank. Using the concept of closed absorbing set, we develop an iterative process that gives the order,p, ofr, some special bases of the algebraic eigenspaces ker(T-r) ^p and ker(T ^*-r) ^p , and finally the dimension of the algebraic eigenspace associated to each peripheral pole.     

The volume and compressibility change for the formation of transition metal sulfate ion pairs at 25°C

The apparent molal volume and adiabatic compressibilities of some transition metal (Mn²⁺, Co²⁺ Ni²⁺, Cu²⁺, Zn²⁺, and Cd²⁺) sulfates have been determined at 25°C. Values of to 11.4 cm³-mole^–1 and to 31.3 × 10^–4cm³-mole^–1-bar^–1 at 1 atm were found for the formation of the transition metal sulfate ion pairs. These results are in good agreement with the values obtained from the high-pressure conductance measurements of Fisher et al., Shimizu et al., and Taniguchi et al. The volume and compressibility data indicate that 3.1±0.7 water molecules are lost when transition metals form ion pairs with SO ₄ ^2– . The fractions of inner-sphere ion pairs (20%) estimated in this study are in good agreement with the values obtained from ultrasonic measurements.     

Cost impact of float loss on a project with adjustable activity durations

Although delays to non-critical activities within the float do not always affect the overall completion time of a project, they commonly cause disputes over the impact cost and apportionment resulting from the complexity of resource utilization in construction projects. Therefore, considerable attention has been focused on providing an effective and reliable method for analysing the effects of float loss. Several recent studies have proposed various methods; however, most of these methods are based on the assumption of a fixed duration for each activity or activity-based cost simulation. Few studies have considered the trade-off between time and costs and the integration of project resources. Using genetic algorithms, this study introduces a critical path method (CPM)-modified resource-integrated optimization model and successfully quantifies the impact of float loss on the total cost of the project. The results provide objective quantification for accurately evaluating the impact of within-float delays and facilitate the analysis of the impact of delay claims on cost and apportionment in construction projects.     

Estimating a survival function with incomplete cause-of-death data

We propose a random censorship model which permits uncertainty in the cause of death assessments for a subset of the subjects in a survival experiment. A nonparametric maximum likelihood approach and a “self-consistency” approach are considered. The solution sets corresponding to both approaches are found. They are infinite and identical. Only some of the solutions are consistent; i.e., the MLEs and self-consistent estimators are not consistent in general. Two estimates are thus proposed and their asymptotic properties are studied. It is shown that both estimates are strongly consistent and converge to Gaussian processes. The covariance structures of these Gaussian processes are derived.     

A Note on Large Rainbow Matchings in Edge-coloured Graphs

A rainbow subgraph in an edge-coloured graph is a subgraph such that its edges have distinct colours. The minimum colour degree of a graph is the smallest number of distinct colours on the edges incident with a vertex over all vertices. Kostochka, Pfender, and Yancey showed that every edge-coloured graph on n vertices with minimum colour degree at least k contains a rainbow matching of size at least k, provided ${n\geq \frac{17}{4}k^2}$ . In this paper, we show that n ≥ 4k ? 4 is sufficient for k ≥ 4.     

A benchmark-learning roadmap for regional sustainable development in China

Journal of the Operational Research Society - Serious environmental problems have accompanied China's remarkable economic growth for decades, which also have direct and indirect impacts on its...     

Multi-objectives Tabu Search based algorithm for progressive resource allocation

Military course of action planning involves time and space synchronization as well as resource and asset allocation. A mission could be seen as a defined set of logical ordered tasks with time and space constraints. The resources to task rules require that available assets should be allocated to each task. A combination of assets might be required to execute a given task. The couple (task, resources) constitutes an action. This problem is formulated as a multi-objectives scheduling and resource allocation problem. Any solution is assessed based on a number of conflicting and heterogeneous objectives. In fact, military planning officers should keep perfecting the plan based on the Commander’s criteria for success. The scheduling problem and resource allocation problem are considered as NP-Hard Problems [A. Guitouni, B. Urli, J.-M. Martel, Course of action planning: A project based modelling, Working Paper, Faculté des sciences de l’ administration, Université Laval, Québec, 2005]. This paper is concerned with the multi-objectives resource allocation problem. Our objective is to find adequate resource allocation for given courses of action schedule. To optimize this problem, this paper investigates non-exact solution methods, like meta-heuristic methods for finding potential efficient solutions. A progressive resource allocation methodology is proposed based on Tabu Search and multi-objectives concepts. This technique explores the search space so as to find a set of potential efficient solutions without aggregating the objectives into a single objective function. It is guided by the principle of maximizing the usage of any resource before considering a replacement resource. Thus, a given resource is allocated to the maximum number of tasks for a given courses of action schedule. A good allocation is a potential efficient solution. These solutions are retained by applying a combination of a dominance rule and a multi-criteria filtering method. The performance of the proposed Pareto-based approach is compared to two aggregation approaches: weighted-sum and the lexicographic techniques. The result shows that a Pareto-based approach is providing better solutions and allowing more flexibility to the decision-maker.     

A Brownian Particle in a Microscopic Periodic Potential

We study a model for a massive test particle in a microscopic periodic potential and interacting with a reservoir of light particles. In the regime considered, the fluctuations in the test particle’s momentum resulting from collisions typically outweigh the shifts in momentum generated by the periodic force, so the force is effectively a perturbative contribution. The mathematical starting point is an idealized reduced dynamics for the test particle given by a linear Boltzmann equation. In the limit that the mass ratio of a single reservoir particle to the test particle tends to zero, we show that there is convergence to the Ornstein–Uhlenbeck process under the standard normalizations for the test particle variables. Our analysis is primarily directed towards bounding the perturbative effect of the periodic potential on the particle’s momentum.