| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910348225703321 |
|
|
Autore |
Willcocks Dianne M |
|
|
Titolo |
Private Lives in Public Places [[electronic resource] ] : Research-based Critique of Residential Life in Local Authority Old People's Homes |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Hoboken, : Taylor and Francis, 2012 |
|
|
|
|
|
|
|
ISBN |
|
1-135-80068-5 |
1-280-16468-9 |
9786610164684 |
0-203-99315-2 |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (178 p.) |
|
|
|
|
|
|
Altri autori (Persone) |
|
PeaceSheila |
KellaherLeonie |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
|
|
Soggetti |
|
Old age homes - Institutional care - Great Britain |
Older people - Great Britain |
Nursing Homes |
Aged |
Homes for the Aged |
Electronic books. |
United Kingdom |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di contenuto |
|
Front Cover; Private Lives in Public Places; CopyrightPage; Contents; Acknowledgements; Foreword: M.Powell Lawton; 1. The concept of home; 2. The legacy of past caring; 3. Crossing the threshold; 4. Creators of care: staff; 5. The physical world; 6. Institutional living; 7. Private lives in public places; 8. Unfinished business; Appendix 1; Appendix 2; References; Name index; Subject index |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
Public Order and Private Lives is a radical examination of the political forces which shape the law and order debate in Britain. Mike Brake and Chris Hale provide a hard-hitting analysis of Conservative policies on Crime, showing that, ironically, Conservative policies have created the very social conditions in which crime has flourished. They argue that |
|
|
|
|
|
|
|
|
|
|
|
|
|
the government is undermining basic civil liberties by its increased use of legislation as a means of control and coercion. |
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910339038903321 |
|
|
Titolo |
Rīgas Tehniskās universitātes zinātniskie raksti . 15. sērija Tehnogēnās vides drošība = : Scientific journal of Riga Technical University, Series 15, Safety of technogenic environment |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Riga, : RTU Press, 2011-2017 |
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Periodico |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
|
|
|
|
|
|
|
3. |
Record Nr. |
UNINA9910484803003321 |
|
|
Titolo |
Evolutionary Computation in Combinatorial Optimization : 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings / / edited by Carlos Cotta, Jano van Hemert |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
|
|
|
|
|
|
|
|
|
ISBN |
|
1-280-85348-4 |
9786610853489 |
3-540-71615-7 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2007.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (250 p.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4446 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Algorithms |
Numerical analysis |
Computer science - Mathematics |
Discrete mathematics |
Theory of Computation |
Numerical Analysis |
Discrete Mathematics in Computer Science |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
A New Local Search Algorithm for the DNA Fragment Assembly Problem -- A Hybrid Immune-Based System for the Protein Folding Problem -- A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags -- A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem -- Genetic Algorithms for Word Problems in Partially Commutative Groups -- A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling -- Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges -- Iterated k-Opt Local Search for the Maximum Clique Problem -- Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem -- Evolutionary Algorithms for Real-World Instances of the Automatic Frequency Planning Problem in |
|
|
|
|
|
|
|
|
|
|
|
GSM Networks -- A New Metaheuristic for the Vehicle Routing Problem with Split Demands -- Generation of Tree Decompositions by Iterated Local Search -- Edge Assembly Crossover for the Capacitated Vehicle Routing Problem -- Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms -- A Population-Based Local Search for Solving a Bi-objective Vehicle Routing Problem -- Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem -- Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling -- An Analysis of Problem Difficulty for a Class of Optimisation Heuristics -- A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem -- A Hybrid Method for Solving Large-Scale Supply Chain Problems -- Crossover Operators for the Car Sequencing Problem. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2007, held in Valencia, Spain in April 2007. The 21 revised full papers presented were carefully reviewed and selected from 81 submissions. The papers cover evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, memetic algorithms, variable neighborhood search, greedy randomized adaptive search procedures, ant colony optimization, and particle swarm optimization algorithms. The papers are specifically dedicated to the application of evolutionary computation and related methods to combinatorial optimization problems and cover any issue of metaheuristic for combinatorial optimization. The papers deal with representations, heuristics, analysis of problem structures, and comparisons of algorithms. The list of studied combinatorial optimization problems includes prominent examples like graph coloring, knapsack problems, the traveling salesperson problem, scheduling, graph matching, as well as specific real-world problems. |
|
|
|
|
|
|
|
| |