Constraint satisfaction problems are an important class of problems in complexity theory. They generalize many combinatorial problems as well as satisfiability problems and provide canonical complete problems for many complexity classes. The computational complexity of all Boolean constraint satisfaction problems was classified by Schaefer [Sch78] and reveals a dichotomic behavior that is conje...

Non-Volatile Memory (NVM) is an emerging memory technology that combines the best properties of today’s hard disks and today’s main memory by combining non-volatility, high density, high speed, and byte addressability. This provides an opportunity to redesign systems and their software stacks to improve performance and to reduce the system and software complexity. Present-day database systems a...

Smothering is a major concern within the Swiss layer industry as it can lead to high number of animal losses. The underlying cause piling behaviour (PB), phenomenon where hens densely cluster together in litter area. aim this study was describe PB and events preceding PB. Furthermore, we investigated relation piles, pile duration, involved with time day, flock colour, age, environmental factors...