Frederiksberg slot, dets äldste historie : for en stor del utrykte kilder /

Mode of access: Internet.

Beretning om Frederiksberg kommune for regnskabsaaret ... samt kommunens budget for ...

Publisher varies.

Strengthening the food systems governance evidence base: Supporting commensurability of research through a systematic review of methods

Governance of food systems is a poorly understood determinant of food security. Much scholarship on food systems governance is non-empirical, while existing research is often case study-based and theoretically and methodologically incommensurable. This frustrates aggregation of evidence and generalisation. We undertook a systematic review of methods used in food systems governance research with a view to identifying a core set of indicators for future research. We gathered literature through a structured consultation and sampling from recent reviews. Indicators were identified and classified according to the levels and sectors they investigate. We found a concentration of indicators in food production at local to national levels and a sparseness in distribution and consumption. Unsurprisingly, many indicators of institutional structure were found, while agency-related indicators are moderately represented. We call for piloting and validation of these indicators and for methodological development to fill gaps identified. These efforts are expected to support a more consolidated future evidence base and eventual meta-analysis.

Statistiske oplysninger om stad Kjøbenhavn og Frederiksberg.

Mode of access: Internet.

'Living together on one's own': Cohousing for older people - an example from Denmark and The Netherlands

‘Living together on one’s own’ is the seemingly contradictory expression of the National Association of Housing Communities for Elderly People (LVGO) in The Netherlands which in fact captures the essence of cohousing. Cohousing is a novel kind of neighbourhood, housing a novel form of intentional community, which began to take shape in Denmark in the early to mid-1960s and, independently, in The Netherlands a few years later. The inventors of cohousing wanted to live in a much more communal or community-oriented neighbourhood than was usual, but they wanted to do so without sacrificing the privacy of individual families or households and their dwellings. Could they have their cake and eat it too? It would seem so. What is cohousing for older people (op-cohousing)? Op-cohousing is essentially no different, except for the differences in outlook or expectations, experience, interests and abilities that a particular, exclusively older, group of people have brought to this housing type. I discuss and analyse several communities in both countries.

Paternal age as a risk factor for psychosis and schizophrenia: Findings from Denmark, Sweden and Australia

The offspringof older fathers have an increased risk of various disorders that may be due to the accumulation of DNA mutations during spermatogenesis. Previous studies have suggested increased paternal age may be a risk factor for schizophrenia. The aim of the current study was to examine paternal age as a risk factor for schizophrenia andror psychosis. We used data from three sources: a population-based cohort studyŽDenmark., and two case-control studiesŽSweden and Australia.. In the Danish and Australian studies, we examined both psychosis and schizophrenia. In the Swedish study we examined psychosis only. After controllingfor the effect of maternal age, increased paternal age was significantly associated with increased risk of both psychosis and schizophrenia in the Danish study and of psychosis in the Swedish study. The Australian study found no association between paternal age and risk of psychosis or schizophrenia. In all three studies the relationship between paternal age and risk of disorder in the offspring was AUB-shaped. In addition to an increased risk for the offspringof older father Ž)35 years., there was a non-significant increase for the offspringof fathers aged less than 20 years. The possible role of paternally derived DNA mutations andror other psychosocial factors associated with older paternal age warrants further research. The ‘U’-shaped relationship suggests that factors other than DNA mutations may warrant consideration in this research. The Stanley Foundation supported this project.

Analysing TDMA with slot skipping

We propose a schedulability analysis for a particular class of time division multiple access (TDMA) networks, which we label as TDMA/SS. SS stands for slot skipping, reflecting the fact that a slot is skipped whenever it is not used. Hence, the next slot can start earlier in benefit of hard real-time traffic. In the proposed schedulability analysis, we assume knowledge of all message streams in the system, and that each node schedules messages in its output queue according to a rate monotonic policy (as an example). We present the analysis in two steps. Firstly, we address the case where a node is only permitted to transmit a maximum of one message per TDMA cycle. Secondly, we generalise the analysis to the case where a node is assigned a budget of messages per TDMA cycle it may transmit. A simple algorithm to assign budgets to nodes is also presented.

Implementing slot-based task-splitting multiprocessor scheduling

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A particular type of task-splitting algorithms, called slot-based task-splitting dispatching, is of particular interest because of its ability to schedule tasks with high processor utilizations. Unfortunately, no slot-based task-splitting algorithm has been implemented in a real operating system so far. In this paper we discuss and propose some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and we report the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34. We have also conducted an extensive range of experiments on a 4-core multicore desktop PC running task-sets with utilizations of up to 88%. The results show that the behavior of our implementation is in line with the theoretical framework behind it.

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.

Analyzing TDMA with slot skipping

Distributed real-time systems, such as factory automation systems, require that computer nodes communicate with a known and low bound on the communication delay. This can be achieved with traditional time division multiple access (TDMA). But improved flexibility and simpler upgrades are possible through the use of TDMA with slot-skipping (TDMA/SS), meaning that a slot is skipped whenever it is not used and consequently the slot after the skipped slot starts earlier. We propose a schedulability analysis for TDMA/SS. We assume knowledge of all message streams in the system, and that each node schedules messages in its output queue according to deadline monotonic. Firstly, we present a non-exact (but fast) analysis and then, at the cost of computation time, we also present an algorithm that computes exact queuing times.

Exact analysis of TDMA with slot skipping

Consider a communication medium shared among a set of computer nodes; these computer nodes issue messages that are requested to be transmitted and they must finish their transmission before their respective deadlines. TDMA/SS is a protocol that solves this problem; it is a specific type of Time Division Multiple Access (TDMA) where a computer node is allowed to skip its time slot and then this time slot can be used by another computer node. We present an algorithm that computes exact queuing times for TDMA/SS in conjunction with Rate-Monotonic (RM) or Earliest- Deadline-First (EDF).