On a problem of Alfréd Rényi

Alfréd Rényi, in a paper of 1962, A new approach to the theory ofEngel's series, proposed a problem related to the growth of theelements of an Engel's series. In this paper, we reformulate andsolve Rényi's problem for both, Engel's series and Pierceexpansions.

The P-median problem in a changing network: The case of Barcelona

In this paper a p--median--like model is formulated to address theissue of locating new facilities when there is uncertainty. Severalpossible future scenarios with respect to demand and/or the travel times/distanceparameters are presented. The planner will want a strategy of positioning thatwill do as ``well as possible'' over the future scenarios. This paper presents a discrete location model formulation to address this P--Medianproblem under uncertainty. The model is applied to the location of firestations in Barcelona.

Recent misconceptions about the "database search problem": a probabilistic analysis using Bayesian networks

This paper analyses and discusses arguments that emerge from a recent discussion about the proper assessment of the evidential value of correspondences observed between the characteristics of a crime stain and those of a sample from a suspect when (i) this latter individual is found as a result of a database search and (ii) remaining database members are excluded as potential sources (because of different analytical characteristics). Using a graphical probability approach (i.e., Bayesian networks), the paper here intends to clarify that there is no need to (i) introduce a correction factor equal to the size of the searched database (i.e., to reduce a likelihood ratio), nor to (ii) adopt a propositional level not directly related to the suspect matching the crime stain (i.e., a proposition of the kind 'some person in (outside) the database is the source of the crime stain' rather than 'the suspect (some other person) is the source of the crime stain'). The present research thus confirms existing literature on the topic that has repeatedly demonstrated that the latter two requirements (i) and (ii) should not be a cause of concern.

Locating emergency services with different priorities: The priority queuing covering location problem

Previous covering models for emergency service consider all the calls to be of the sameimportance and impose the same waiting time constraints independently of the service's priority.This type of constraint is clearly inappropriate in many contexts. For example, in urban medicalemergency services, calls that involve danger to human life deserve higher priority over calls formore routine incidents. A realistic model in such a context should allow prioritizing the calls forservice.In this paper a covering model which considers different priority levels is formulated andsolved. The model heritages its formulation from previous research on Maximum CoverageModels and incorporates results from Queuing Theory, in particular Priority Queuing. Theadditional complexity incorporated in the model justifies the use of a heuristic procedure.

Adaptive approach heuristics for the generalized assignment problem

The Generalized Assignment Problem consists in assigning a setof tasks to a set of agents with minimum cost. Each agent hasa limited amount of a single resource and each task must beassigned to one and only one agent, requiring a certain amountof the resource of the agent. We present new metaheuristics forthe generalized assignment problem based on hybrid approaches.One metaheuristic is a MAX-MIN Ant System (MMAS), an improvedversion of the Ant System, which was recently proposed byStutzle and Hoos to combinatorial optimization problems, and itcan be seen has an adaptive sampling algorithm that takes inconsideration the experience gathered in earlier iterations ofthe algorithm. Moreover, the latter heuristic is combined withlocal search and tabu search heuristics to improve the search.A greedy randomized adaptive search heuristic (GRASP) is alsoproposed. Several neighborhoods are studied, including one basedon ejection chains that produces good moves withoutincreasing the computational effort. We present computationalresults of the comparative performance, followed by concludingremarks and ideas on future research in generalized assignmentrelated problems.

Late Proterozoic thrust tectonics, high-pressure metamorphism and Uranium mineralization in the domes area, Lufilian arc, northwestern Zambia

The following main lithostratigraphic units have been distinguished in the Domes Area. The Kibaran basement complex composed of gneisses, migmatites with amphibolite bands and metagranites is exposed in dome structures; metamorphic features of Kibaran age have been almost completely obliterated by extensive Lufilian reactivation. The post-Kibaran cover sequence is subdivided into the Lower Roan Group consisting of well-preserved quartzites with high Mg content, talc-bearing, extremely foliated schists intercalated with pseudo-conglomerates of tectonic origin and the Upper Roan Group including dolomitic marbles with rare stromatolites, metapelites and a sequence of detrital metasediments, with local volcano-sedimentary components and interlayered banded ironstones. The sediments of the Lower Roan Group are interpreted as continental to lagoonal-evaporitic deposits partly converted into the talc-kyanite + garnet assemblage characteristic of ``white schists''. The dolomites and metapelites of the Upper Roan Group are attributed to a carbonate platform sequence progressively subsiding under terrigenous deposits, whilst the detrital metasediments and BIF may be interpreted as a basinal sequence, probably deposited on oceanic crust grading laterally into marbles. Metagabbros and metabasalts are considered as remnants of an ocean-floor-type crustal unit probably related to small basins. Alkaline stocks of Silurian age intruded the post-Kibaran cover. Significant ancestral tectonic discontinuities promoted the development of a nappe pile that underwent high-pressure metamorphism during the Lufilian orogeny and all lithostratigraphic units. Rb-Sr and K-Ar and U-Pb data indicate an age of 700 Ma for the highest grade metamorphism and 500 Ma for blocking of the K-Ar and Rb-Sr system in micas, corresponding to the time when the temperature dropped below 350-degrees-400-degrees-C and to an age of about 400 Ma for the emplacement of hypabyssal syenitic bodies. A first phase of crustal shortening by decoupling of basement and cover slices along shallow shear zones has been recognized. Fluid-rich tectonic slabs of cover sediments were thus able to transport fluids into the anhydrous metamorphic basement or mafic units. During the subsequent metamorphic re-equilibration stage of high pressure, pre-existing thrusts horizons were converted into recrystallized mylonites. Due to uplift, rocks were re-equilibrated into assemblages compatible with lower pressures and slightly lower temperatures. This stage occurs under a decompressional (nearly adiabatic) regime, with P(fluid) almost-equal-to P(lithostatic). It is accompanied by metasomatic development of minerals, activated by injection of hot fluids. New or reactivated shear zones and mylonitic belts were the preferred conduits of fluids. The most evident regional-scale effect of these processes is the intense metasomatic scapolitization of formerly plagioclase-rich lithologies. Uraninite mineralization can probably be assigned to the beginning of the decompressional stage. A third regional deformation phase characterized by open folds and local foliation is not accompanied by significant growth of new minerals. However, pitchblende mineralization can be ascribed to this phase as late-stage, short-range remobilization of previously existing deposits. Finally, shallow alkaline massifs were emplaced when the level of the Domes Area now exposed was already subjected to exchange with meteoric circuits, activated by residual geothermal gradients generally related to intrusions or rifting. Most of the superficial U-showings with U-oxidation products were probably generated during this relatively recent phase.

Driver scheduling problem modelling

The Drivers Scheduling Problem (DSP) consists of selecting a set of duties for vehicle drivers, for example buses, trains, plane or boat drivers or pilots, for the transportation of passengers or goods. This is a complex problem because it involves several constraints related to labour and company rules and can also present different evaluation criteria and objectives. Being able to develop an adequate model for this problem that can represent the real problem as close as possible is an important research area.The main objective of this research work is to present new mathematical models to the DSP problem that represent all the complexity of the drivers scheduling problem, and also demonstrate that the solutions of these models can be easily implemented in real situations. This issue has been recognized by several authors and as important problem in Public Transportation. The most well-known and general formulation for the DSP is a Set Partition/Set Covering Model (SPP/SCP). However, to a large extend these models simplify some of the specific business aspects and issues of real problems. This makes it difficult to use these models as automatic planning systems because the schedules obtained must be modified manually to be implemented in real situations. Based on extensive passenger transportation experience in bus companies in Portugal, we propose new alternative models to formulate the DSP problem. These models are also based on Set Partitioning/Covering Models; however, they take into account the bus operator issues and the perspective opinions and environment of the user.We follow the steps of the Operations Research Methodology which consist of: Identify the Problem; Understand the System; Formulate a Mathematical Model; Verify the Model; Select the Best Alternative; Present the Results of theAnalysis and Implement and Evaluate. All the processes are done with close participation and involvement of the final users from different transportation companies. The planner s opinion and main criticisms are used to improve the proposed model in a continuous enrichment process. The final objective is to have a model that can be incorporated into an information system to be used as an automatic tool to produce driver schedules. Therefore, the criteria for evaluating the models is the capacity to generate real and useful schedules that can be implemented without many manual adjustments or modifications. We have considered the following as measures of the quality of the model: simplicity, solution quality and applicability. We tested the alternative models with a set of real data obtained from several different transportation companies and analyzed the optimal schedules obtained with respect to the applicability of the solution to the real situation. To do this, the schedules were analyzed by the planners to determine their quality and applicability. The main result of this work is the proposition of new mathematical models for the DSP that better represent the realities of the passenger transportation operators and lead to better schedules that can be implemented directly in real situations.

The struggle against creative accounting: Is "true and fair view" part of the problem or part of the solution?

Creative accounting is a growing issue of interest in Spain. In this article we argue that the concept true and fair view can limit or promote the use of creative accounting depending upon its interpretation. We review the range of meanings that true and fair view can take at an international level and compare the experience of the United Kingdom with the Australian one by analysing the use of true and fair view to limit creative accounting. Finally, we suggest lines of action to be considered by the Spanish accounting standards-setting institutions.

A new chance-constrained maximum capture location problem

The paper presents a new model based on the basic Maximum Capture model,MAXCAP. The New Chance Constrained Maximum Capture modelintroduces astochastic threshold constraint, which recognises the fact that a facilitycan be open only if a minimum level of demand is captured. A metaheuristicbased on MAX MIN ANT system and TABU search procedure is presented tosolve the model. This is the first time that the MAX MIN ANT system isadapted to solve a location problem. Computational experience and anapplication to 55 node network are also presented.