Carte générale des Îles Britanniques contenant l'Angleterre, l'Écosse et l'Irlande : indiquant les principales routes, les canaux de navigation, les chemins de fer exécutés et en cours d'exécution dans la Grande-Bretagne / par J. Andriveau ; le burin par Piat ; écrit par Arnoul

Échelle(s) : [ca 1:1 4640 000], échelle de 25 lieues communes de France [= 7,6 cm]

A simple optimised search heuristic for the job-shop scheduling problem

This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.

Metaheuristics for the bus-driver scheduling problem

We present new metaheuristics for solving real crew scheduling problemsin a public transportation bus company. Since the crews of thesecompanies are drivers, we will designate the problem by the bus-driverscheduling problem. Crew scheduling problems are well known and severalmathematical programming based techniques have been proposed to solvethem, in particular using the set-covering formulation. However, inpractice, there exists the need for improvement in terms of computationalefficiency and capacity of solving large-scale instances. Moreover, thereal bus-driver scheduling problems that we consider can present variantaspects of the set covering, as for example a different objectivefunction, implying that alternative solutions methods have to bedeveloped. We propose metaheuristics based on the following approaches:GRASP (greedy randomized adaptive search procedure), tabu search andgenetic algorithms. These metaheuristics also present some innovationfeatures based on and genetic algorithms. These metaheuristics alsopresent some innovation features based on the structure of the crewscheduling problem, that guide the search efficiently and able them tofind good solutions. Some of these new features can also be applied inthe development of heuristics to other combinatorial optimizationproblems. A summary of computational results with real-data problems ispresented.

Adaptive dynamics and the implementation problem with complete information

This paper studies the equilibrating process of several implementationmechanisms using naive adaptive dynamics. We show that the dynamics convergeand are stable, for the canonical mechanism of implementation in Nash equilibrium.In this way we cast some doubt on the criticism of ``complexity'' commonlyused against this mechanism. For mechanisms that use more refined equilibrium concepts,the dynamics converge but are not stable. Some papers in the literatureon implementation with refined equilibrium concepts have claimed that themechanisms they propose are ``simple'' and implement ``everything'' (incontrast with the canonical mechanism). The fact that some of these ``simple''mechanisms have unstable equilibria suggests that these statements shouldbe interpreted with some caution.

Taking "Galton's problem" Seriously : Towards a Theory of Policy Diffusion

This article builds on the recent policy diffusion literature and attempts to overcome one of its major problems, namely the lack of a coherent theoretical framework. The literature defines policy diffusion as a process where policy choices are interdependent, and identifies several diffusion mechanisms that specify the link between the policy choices of the various actors. As these mechanisms are grounded in different theories, theoretical accounts of diffusion currently have little internal coherence. In this article we put forward an expected-utility model of policy change that is able to subsume all the diffusion mechanisms. We argue that the expected utility of a policy depends on both its effectiveness and the payoffs it yields, and we show that the various diffusion mechanisms operate by altering these two parameters. Each mechanism affects one of the two parameters, and does so in distinct ways. To account for aggregate patterns of diffusion, we embed our model in a simple threshold model of diffusion. Given the high complexity of the process that results, strong analytical conclusions on aggregate patterns cannot be drawn without more extensive analysis which is beyond the scope of this article. However, preliminary considerations indicate that a wide range of diffusion processes may exist and that convergence is only one possible outcome.

Spaced training facilitates long-term retention of place navigation in adult but not in adolescent rats

Young and adult Long Evans rats were tested in the water maze according to two different procedures: half of the subjects were given one session of four trials a day for 6 days, whereas the other subjects had the same amount of training massed in 1 day. For both conditions, a 14-day retention interval was then introduced to test long-term memory. This was followed by a four-trial reversal session. All groups showed a significant learning curve, but escape latencies were shorter for the adult than for the young rats, without differential effect of the training procedure. A first probe trial (PT1) confirmed similar accurate short-term retention in all the groups. But unimpaired long-term memory was only seen in the adult rats trained with the spaced procedure. The young rats trained over 1 day also showed some retention of the platform location after 14 days, but not the other two groups. Reversal acquisition of the new platform location was rapid in the four groups. These results indicate that although accurate short-term spatial memory in the water maze is seen after a 1-day massed training in both age groups, unimpaired long-term retention is only observed in adult rats trained with 24-h inter-session intervals.

« Histoire sommaire du commerce et de la navigation des anciens, » par P.-D. HUET. (1669).

Ms. autographe, dédié à Colbert.

Dispersal probability distributions and the wave-front speed problem

The speed and width of front solutions to reaction-dispersal models are analyzed both analytically and numerically. We perform our analysis for Laplace and Gaussian distribution kernels, both for delayed and nondelayed models. The results are discussed in terms of the characteristic parameters of the models

Zum Problem der Übersetzung von Gedichten : auch vom Gesichtspunkt des Computers

Abstract

Note on the blocking flow shop problem

We present some results attained with different algorithms for the Fm|block|Cmax problem using as experimental data the well-known Taillard instances.

Absence of snapshot memory of the target view interferes with place navigation learning by rats in the water maze

Contribution of visual and nonvisual mechanisms to spatial behavior of rats in the Morris water maze was studied with a computerized infrared tracking system, which switched off the room lights when the subject entered the inner circular area of the pool with an escape platform. Naive rats trained under light-dark conditions (L-D) found the escape platform more slowly than rats trained in permanent light (L). After group members were swapped, the L-pretrained rats found under L-D conditions the same target faster and eventually approached latencies attained during L navigation. Performance of L-D-trained rats deteriorated in permanent darkness (D) but improved with continued D training. Thus L-D navigation improves gradually by procedural learning (extrapolation of the start-target azimuth into the zero-visibility zone) but remains impaired by lack of immediate visual feedback rather than by absence of the snapshot memory of the target view.