Many products of lipid oxidation have been associated with human diseases. These include F2-isoprostanes (F2-IsoPs), hydroxyeicosatetraenoic acid products (HETEs), and cholesterol oxidation products (COPs). Here we present measurements of F2-IsoPs, HETEs, COPs, and arachidonate in single plasma samples of patients with acute (dengue fever and ischemic stroke) and chronic (Parkinson's) diseases,...

Geo-replicated, distributed data stores that support complex online applications, such as social networks, must provide an “alwayson” experience where operations always complete with low latency. Today’s systems often sacrifice strong consistency to achieve these goals, exposing inconsistencies to their clients and necessitating complex application logic. In this paper, we identify and define a...

The game of cops and robbers is played with a set of 'cops' and a 'robber' who occupy some vertices of a graph. Both sides have perfect information and they move alternately to adjacent vertices. The robber is captured if at least one of the cops occupies the same vertex as the robber. The problem is to determine on a given graph, G, the least number of cops sufficient to capture the robber, ca...

Innovation patterns in complex product systems industry the case of shipbuilding Jouni Saarni and Mikko Pohjola Saarni (2011-2016) & Pohjola: Centre for Collaborative Research Turku School of Economics University of Turku, Finland Pohjola (2010-2013): Utrecht University School of Economics [email protected] [email protected] Abstract Coping with the complex technologies and organisations has beco...

As artificial intelligence (AI) is increasingly integrated into the context of complex products and systems (CoPS), making more intelligent, this article explores consequences implications for engineering management in emerging intelligent (CoIS). Based on five aspects, including design objectives, system boundaries, architecting modeling, predictability emergence, learning adaptation, a case s...

In this version of the Cops and Robber game, the cops move in tandems, or pairs, such that they are at distance at most one from each other after every move. The problem is to determine, for a given graph G, the minimum number of tandems sufficient to guarantee a win for the cops. We investigate this game on three graph products, the Cartesian, categorical and strong products.