Knowledge Reuse for Customization: Metamodels in an Open Design Community for 3d Printing

Theories of knowledge reuse posit two distinct processes: reuse for replication and reuse for innovation. We identify another distinct process, reuse for customization. Reuse for customization is a process in which designers manipulate the parameters of metamodels to produce models that fulfill their personal needs. We test hypotheses about reuse for customization in Thingiverse, a community of designers that shares files for three-dimensional printing. 3D metamodels are reused more often than the 3D models they generate. The reuse of metamodels is amplified when the metamodels are created by designers with greater community experience. Metamodels make the community's design knowledge available for reuse for customization-or further extension of the metamodels, a kind of reuse for innovation

Secure and efficient application monitoring and replication

Memory corruption vulnerabilities remain a grave threat to systems software written in C/C++. Current best practices dictate compiling programs with exploit mitigations such as stack canaries, address space layout randomization, and control-flow integrity. However, adversaries quickly find ways to circumvent such mitigations, sometimes even before these mitigations are widely deployed. In this paper, we focus on an "orthogonal" defense that amplifies the effectiveness of traditional exploit mitigations. The key idea is to create multiple diversified replicas of a vulnerable program and then execute these replicas in lockstep on identical inputs while simultaneously monitoring their behavior. A malicious input that causes the diversified replicas to diverge in their behavior will be detected by the monitor; this allows discovery of previously unknown attacks such as zero-day exploits. So far, such multi-variant execution environments (MVEEs) have been held back by substantial runtime overheads. This paper presents a new design, ReMon, that is non-intrusive, secure, and highly efficient. Whereas previous schemes either monitor every system call or none at all, our system enforces cross-checking only for security critical system calls while supporting more relaxed monitoring policies for system calls that are not security critical. We achieve this by splitting the monitoring and replication logic into an in-process component and a cross-process component. Our evaluation shows that ReMon offers same level of security as conservative MVEEs and run realistic server benchmarks at near-native speeds

Natural Selection of Paths in Networks

We present a novel algorithm that exhibits natural selection of paths in a network. If each node and weighted directed edge has a unique identifier, a path in the network is defined as an ordered list of these unique identifiers. We take a population perspective and view each path as a genotype. If each node has a node phenotype then a path phenotype is defined as the list of node phenotypes in order of traversal. We show that given appropriate path traversal, weight change and structural plasticity rules, a path is a unit of evolution because it can exhibit multiplicative growth (i.e. change it’s probability of being traversed), and have variation and heredity. Thus, a unit of evolution need not be a spatially distinct physical individual. The total set of paths in a network consists of all possible paths from the start node to a finish node. Each path phenotype is associated with a reward that determines whether the edges of that path will be multiplicatively strengthened (or weakened). A pair-wise tournament selection algorithm is implemented which compares the reward obtained by two paths. The directed edges of the winning path are strengthened, whilst the directed edges of the losing path are weakened. Edges shared by both paths are not changed (or weakened if diversity is desired). Each time a node is activated there is a probability that the path will mutate, i.e. find an alternative route that bypasses that node. This generates the potential for a novel but correlated path with a novel but correlated phenotype. By this process the more frequently traversed paths are responsible for most of the exploration. Nodes that are inactive for some period of time are lost (which is equivalent to connections to and from them being broken). This network-based natural selection compares favourably with a standard pair-wise tournament-selection based genetic algorithm on a range of combinatorial optimization problems and continuous parametric optimization problems. The network also exhibits memory of past selective environments and can store previously discovered characters for reuse in later optimization tasks. The pathway evolution algorithm has several possible implementations and permits natural selection with unlimited heredity without template replication

Fast Lean Erasure-Coded Atomic Memory Object

In this work, we propose FLECKS, an algorithm which implements atomic memory objects in a multi-writer multi-reader (MWMR) setting in asynchronous networks and server failures. FLECKS substantially reduces storage and communication costs over its replication-based counterparts by employing erasure-codes. FLECKS outperforms the previously proposed algorithms in terms of the metrics that to deliver good performance such as storage cost per object, communication cost a high fault-tolerance of clients and servers, guaranteed liveness of operation, and a given number of communication rounds per operation, etc. We provide proofs for liveness and atomicity properties of FLECKS and derive worst-case latency bounds for the operations. We implemented and deployed FLECKS in cloud-based clusters and demonstrate that FLECKS has substantially lower storage and bandwidth costs, and significantly lower latency of operations than the replication-based mechanisms

Genetic loci on chromosome 5 are associated with circulating levels of interleukin-5 and eosinophil count in a European population with high risk for cardiovascular disease

IL-5 is a Th2 cytokine which activates eosinophils and is suggested to have an atheroprotective role. Genetic variants in the IL5 locus have been associated with increased risk of CAD and ischemic stroke. In this study we aimed to identify genetic variants associated with IL-5 concentrations and apply a Mendelian randomisation approach to assess IL-5 levels for causal effect on intima-media thickness in a European population at high risk of coronary artery disease. We analysed SNPs within robustly associated candidate loci for immune, inflammatory, metabolic and cardiovascular traits. We identified 2 genetic loci for IL-5 levels (chromosome 5, rs56183820, BETA = 0.11, P = 6.73E−5 and chromosome 14, rs4902762, BETA = 0.12, P = 5.76E−6) and one for eosinophil count (rs72797327, BETA = −0.10, P = 1.41E−6). Both chromosome 5 loci were in the vicinity of the IL5 gene, however the association with IL-5 levels failed to replicate in a meta-analysis of 2 independent cohorts (rs56183820, BETA = 0.04, P = 0.2763, I2 = 24, I2 − P = 0.2516). No significant associations were observed between SNPs associated with IL-5 levels or eosinophil count and IMT measures. Expression quantitative trait analyses indicate effects of the IL-5 and eosinophil-associated SNPs on RAD50 mRNA expression levels (rs12652920 (r2 = 0.93 with rs56183820) BETA = −0.10, P = 8.64E−6 and rs11739623 (r2 = 0.96 with rs72797327) BETA = −0.23, P = 1.74E−29, respectively). Our data do not support a role for IL-5 levels and eosinophil count in intima-media thickness, however SNPs associated with IL-5 and eosinophils might influence stability of the atherosclerotic plaque via modulation of RAD50 levels

Rethinking State-Machine Replication for Parallelism

State-machine replication, a fundamental approach to designing fault-tolerant services, requires commands to be executed in the same order by all replicas. Moreover, command execution must be deterministic: each replica must produce the same output upon executing the same sequence of commands. These requirements usually result in single-threaded replicas, which hinders service performance. This paper introduces Parallel State-Machine Replication (P-SMR), a new approach to parallelism in state-machine replication. P-SMR scales better than previous proposals since no component plays a centralizing role in the execution of independent commands---those that can be executed concurrently, as defined by the service. The paper introduces P-SMR, describes a "commodified architecture" to implement it, and compares its performance to other proposals using a key-value store and a networked file system