Artiklen baseres på forskningsprojektet AISHA, der fokuserer de stadigt flere plejekræ- vende ældre med minoritetsbaggrund, baggrund af Servicelovens §94 vælger at få deres hjemkommune til ansætte et familiemedlem som ”selvudpegede hjælper”. Typisk falder valget en ægtefælle, datter eller svigerdatter, får opgave levere omsorgsydelser, den er visiteret til. Normalt vil dette blive vareta...

The mathematical model of portfolio optimization is usually represented as a bicriteria optimization problem where a reasonable trade–off between expected rate of return and risk is sought. In a classical Markowitz model the risk is measured by a variance, thus resulting in a quadratic programming model. As an alternative, the MAD model was proposed where risk is measured by (mean) absolute dev...

We employ the recently installed near infrared Multi-Conjugate Adaptive Optics demonstrator (MAD) to determine basic properties of a newly identified, old and distant, Galactic open cluster (FSR 1415). The MAD facility remarkably approaches the diffraction limit, reaching a resolution of 0. 07 (in K), that is also uniform in a field of ∼ 1.8 in diameter. The MAD facility provides photometry tha...

Computerized generation of humor is a notoriously difficult AI problem. We develop an algorithm called Libitum that helps humans generate humor in a Mad Lib R ©, which is a popular fill-in-the-blank game. The algorithm is based on a machine learned classifier that determines whether a potential fill-in word is funny in the context of the Mad Lib story. We use Amazon Mechanical Turk to create gr...

The Logarithmic Number System (LNS) offers good performance for some multimedia applications at low precisions. Motion estimation is a key part of the MPEG encoding system. Usually the motion estimation is performed by using a fixed-point Mean Absolute Difference (MAD) cost function for block matching. LNS Mean Larger Ratio (MLR) is another cost function which can produce comparable video encod...

The square G of a graph G is the graph obtained from G by adding an edge between every pair of vertices having a common neighbor. A proper coloring of G is also called a 2-distance coloring of G. The maximum average degree Mad(G) of a graph G is the maximum among the average degrees of the subgraphs of G, i.e. Mad(G) = max { 2|E(H)| V (H) |H ⊆ G } . Graphs with bounded maximum average degree ar...