Moral Notions, with Three Papers on Plato

Morality is often thought of as non-rational or sub-rational. In Moral Notions, first published in 1967, Julius Kovesi argues that the rationality of morality is built into the way we construct moral concepts. In showing this he also resolves the old Humean conundrum of the relation between 'facts' and 'values'. And he puts forward a method of reasoning that might make 'applied ethics' (at present largely a hodge-podge of opinions) into a constructive discipline. Kovesi's general theory of concepts - important in its own right - is indebted to his interpretation of Plato, and his three papers on Plato, first published here, explain this debt. This new edition of Moral Notions also includes a foreward by Philippa Foot, a biography of the author, and a substantial afterword in which the editors, Robert Ewin and Alan Tapper, explain the signficance of Kovesi's work

Malleable coding for updatable cloud caching

In software-as-a-service applications provisioned through cloud computing, locally cached data are often modified with updates from new versions. In some cases, with each edit, one may want to preserve both the original and new versions. In this paper, we focus on cases in which only the latest version must be preserved. Furthermore, it is desirable for the data to not only be compressed but to also be easily modified during updates, since representing information and modifying the representation both incur cost. We examine whether it is possible to have both compression efficiency and ease of alteration, in order to promote codeword reuse. In other words, we study the feasibility of a malleable and efficient coding scheme. The tradeoff between compression efficiency and malleability cost-the difficulty of synchronizing compressed versions-is measured as the length of a reused prefix portion. The region of achievable rates and malleability is found. Drawing from prior work on common information problems, we show that efficient data compression may not be the best engineering design principle when storing software-as-a-service data. In the general case, goals of efficiency and malleability are fundamentally in conflict.This work was supported in part by an NSF Graduate Research Fellowship (LRV), Grant CCR-0325774, and Grant CCF-0729069. This work was presented at the 2011 IEEE International Symposium on Information Theory [1] and the 2014 IEEE International Conference on Cloud Engineering [2]. The associate editor coordinating the review of this paper and approving it for publication was R. Thobaben. (CCR-0325774 - NSF Graduate Research Fellowship; CCF-0729069 - NSF Graduate Research Fellowship)Accepted manuscrip

Malleable Coding with Fixed Reuse

In cloud computing, storage area networks, remote backup storage, and similar settings, stored data is modified with updates from new versions. Representing information and modifying the representation are both expensive. Therefore it is desirable for the data to not only be compressed but to also be easily modified during updates. A malleable coding scheme considers both compression efficiency and ease of alteration, promoting codeword reuse. We examine the trade-off between compression efficiency and malleability cost-the difficulty of synchronizing compressed versions-measured as the length of a reused prefix portion. Through a coding theorem, the region of achievable rates and malleability is expressed as a single-letter optimization. Relationships to common information problems are also described

On palimpsests in neural memory: an information theory viewpoint

The finite capacity of neural memory and the reconsolidation phenomenon suggest it is important to be able to update stored information as in a palimpsest, where new information overwrites old information. Moreover, changing information in memory is metabolically costly. In this paper, we suggest that information-theoretic approaches may inform the fundamental limits in constructing such a memory system. In particular, we define malleable coding, that considers not only representation length but also ease of representation update, thereby encouraging some form of recycling to convert an old codeword into a new one. Malleability cost is the difficulty of synchronizing compressed versions, and malleable codes are of particular interest when representing information and modifying the representation are both expensive. We examine the tradeoff between compression efficiency and malleability cost, under a malleability metric defined with respect to a string edit distance. This introduces a metric topology to the compressed domain. We characterize the exact set of achievable rates and malleability as the solution of a subgraph isomorphism problem. This is all done within the optimization approach to biology framework.Accepted manuscrip

Starfruit Leaves as Glucose Absorption Inhibitor in Mice's Small Intestinal Epithelial Cells

Background: Starfruit (Averrhoa carambola) leaves contain flavone derivatives that exhibit anti-hyperglycemic effects. This study aims to determine the effect of starfruit leaves in reducing glucose absorption in intestinal epithelial cells of mice. Methods: This study was done by performing perfusion on the small intestines of mice. The mice that were used in this study were divided into four groups. The control group was given glucose solution without infused starfruit leaves whereas, the remaining 3 groups were given 3 mmol (540 mg/dL) glucose solution with infused starfruit leaves of varying concentrations; 200, 400, and 600 mg/kg. Samples were collected at 0, 15th, 30th, 45th, and 60th minute. The sample was tested for glucose levels using spectrophotometry. Results: Test of significance showed a significant difference between the control group and the test group with p < 0.05. Conclusions: Starfruit leaves have a reduction effect towards glucose absorption in the small intestines in Wistar strains where the group using 600 mg/kg of infused starfruit leaves have the most significant effect as compared to other groups

Comparative analysis of Cardiac ISO enzyme CK-MB in pericardial fluid and serum in the Post mortem diagnosis of myocardial Infarction

Myocardial infarction resulting in sudden cardiac death is the most prevalent cause of death all over the globe, even in age group less than 40 and constitutes significant number of autopsies being done by forensic doctors. Cardiac marker CK-MB has high sensistivity and specificity in detecting myocytes damage and being used routinely by clinicians.in forensic medicine this diagnostic utility of this marker for postmortem diagnosis of mi has not been fully established. This study is carried out with aim to evaluate the diagnostic efficiency of CK-MB in pericardial fluid and in serum and to compare both for autopsy diagnosis of MI. This study included 30 subjects with 20 subjects having evidence of cad and remaining 10 cases as unnatural sudden death cases. Biochemical analysis of CK-MB carried out in ventricular blood and in pericardial fluid. The sensistivity and specificity were found higher in pericardial fluid than in ventricular blood in diagnosing mi at autopsy

A Comprehensive Analysis of Swarming-based Live Streaming to Leverage Client Heterogeneity

Due to missing IP multicast support on an Internet scale, over-the-top media streams are delivered with the help of overlays as used by content delivery networks and their peer-to-peer (P2P) extensions. In this context, mesh/pull-based swarming plays an important role either as pure streaming approach or in combination with tree/push mechanisms. However, the impact of realistic client populations with heterogeneous resources is not yet fully understood. In this technical report, we contribute to closing this gap by mathematically analysing the most basic scheduling mechanisms latest deadline first (LDF) and earliest deadline first (EDF) in a continuous time Markov chain framework and combining them into a simple, yet powerful, mixed strategy to leverage inherent differences in client resources. The main contributions are twofold: (1) a mathematical framework for swarming on random graphs is proposed with a focus on LDF and EDF strategies in heterogeneous scenarios; (2) a mixed strategy, named SchedMix, is proposed that leverages peer heterogeneity. The proposed strategy, SchedMix is shown to outperform the other two strategies using different abstractions: a mean-field theoretic analysis of buffer probabilities, simulations of a stochastic model on random graphs, and a full-stack implementation of a P2P streaming system.Comment: Technical report and supplementary material to http://ieeexplore.ieee.org/document/7497234