Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction

Regenerating codes are a class of distributed storage codes that allow for efficient repair of failed nodes, as compared to traditional erasure codes. An [n, k, d] regenerating code permits the data to be recovered by connecting to any k of the n nodes in the network, while requiring that a failed node be repaired by connecting to any d nodes. The amount of data downloaded for repair is typically much smaller than the size of the source data. Previous constructions of exact-regenerating codes have been confined to the case n = d + 1. In this paper, we present optimal, explicit constructions of (a) Minimum Bandwidth Regenerating (MBR) codes for all values of [n, k, d] and (b) Minimum Storage Regenerating (MSR) codes for all [n, k, d >= 2k - 2], using a new product-matrix framework. The product-matrix framework is also shown to significantly simplify system operation. To the best of our knowledge, these are the first constructions of exact-regenerating codes that allow the number n of nodes in the network, to be chosen independent of the other parameters. The paper also contains a simpler description, in the product-matrix framework, of a previously constructed MSR code with [n = d + 1, k, d >= 2k - 1].

Three-Component Self-Assembly of a Series of Triply Interlocked Pd12 Coordination Prisms and Their Non-Interlocked Pd6 Analogues

Template-assisted formation of multicomponent Pd6 coordination prisms and formation of their self-templated triply interlocked Pd12 analogues in the absence of an external template have been established in a single step through Pd?N/Pd?O coordination. Treatment of cis-[Pd(en)(NO3)2] with K3tma and linear pillar 4,4'-bpy (en=ethylenediamine, H3tma=benzene-1,3,5-tricarboxylic acid, 4,4'-bpy=4,4'-bipyridine) gave intercalated coordination cage [{Pd(en)}6(bpy)3(tma)2]2[NO3]12 (1) exclusively, whereas the same reaction in the presence of H3tma as an aromatic guest gave a H3tma-encapsulating non-interlocked discrete Pd6 molecular prism [{Pd(en)}6(bpy)3(tma)2(H3tma)2][NO3]6 (2). Though the same reaction using cis-[Pd(NO3)2(pn)] (pn=propane-1,2-diamine) instead of cis-[Pd(en)(NO3)2] gave triply interlocked coordination cage [{Pd(pn)}6(bpy)3(tma)2]2[NO3]12 (3) along with non-interlocked Pd6 analogue [{Pd(pn)}6(bpy)3(tma)2](NO3)6 (3'), and the presence of H3tma as a guest gave H3tma-encapsulating molecular prism [{Pd(pn)}6(bpy)3(tma)2(H3tma)2][NO3]6 (4) exclusively. In solution, the amount of 3' decreases as the temperature is decreased, and in the solid state 3 is the sole product. Notably, an analogous reaction using the relatively short pillar pz (pz=pyrazine) instead of 4,4'-bpy gave triply interlocked coordination cage [{Pd(pn)}6(pz)3(tma)2]2[NO3]12 (5) as the single product. Interestingly, the same reaction using slightly more bulky cis-[Pd(NO3)2(tmen)] (tmen=N,N,N',N'-tetramethylethylene diamine) instead of cis-[Pd(NO3)2(pn)] gave non-interlocked [{Pd(tmen)}6(pz)3(tma)2][NO3]6 (6) exclusively. Complexes 1, 3, and 5 represent the first examples of template-free triply interlocked molecular prisms obtained through multicomponent self-assembly. Formation of the complexes was supported by IR and multinuclear NMR (1H and 13C) spectroscopy. Formation of guest-encapsulating complexes (2 and 4) was confirmed by 2D DOSY and ROESY NMR spectroscopic analyses, whereas for complexes 1, 3, 5, and 6 single-crystal X-ray diffraction techniques unambiguously confirmed their formation. The gross geometries of H3tma-encapsulating complexes 2 and 4 were obtained by universal force field (UFF) simulations.

An approach toward the synthesis of PPAP natural product garsubellin A: construction of the tricyclic core

In a study directed toward the bioactive natural product garsubellin A, an expedient route to the bicyclo 3.3.1]nonan-9-one bearing tricyclic core, with a bridgehead anchored tetrahydrofuran ring, is delineated. The approach emanating from commercially available dimedone involved a DIBAL-H mediated retro aldol/re-aldol cyclization cascade and a PCC mediated oxidative cyclization as the key steps. (C) 2013 Elsevier Ltd. All rights reserved.

Combining product information and process information to build virtual assembly situations for knowledge acquisition

Assembly is an important part of the product development process. To avoid potential issues during assembly in specialized domains such as aircraft assembly, expert knowledge to predict such issues is helpful. Knowledge based systems can act as virtual experts to provide assistance. Knowledge acquisition for such systems however, is a challenge, and this paper describes one part of an ongoing research to acquire knowledge through a dialog between an expert and a knowledge acquisition system. In particular this paper discusses the use of a situation model for assemblies to present experts with a virtual assembly and help them locate the specific context of the knowledge they provide to the system.

Total synthesis and determination of the absolute configuration of 5,6-Dihydro-alpha-pyrone natural product synargentolide B

Enantiospecific total synthesis and determination of the absolute stereochemistry of the alpha-pyrone-containing natural product synargentolide B were accomplished. The absolute stereochemistry of the natural product was established by synthesizing the possible diastereomers and comparison of the data with those reported for the natural product. During the process, total synthesis of the putative structure of related natural product 6R-1S,2R,SR,6S-(tetraacetyloxy)-3E-heptenyl]-5,6-dihydro-2H-pyran-2-o ne was also accomplished and confirmed by X-ray crystal structure analysis. Wittig-Horner reaction of a chiral phosphonate derived from (S)-lactic acid and ring-closing metathesis were the key reactions during the course of the total synthesis.

Product Dimension of Forests and Bounded Treewidth Graphs

The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study the product dimension of forests, bounded treewidth graphs and k-degenerate graphs. We show that every forest on n vertices has product dimension at most 1.441 log n + 3. This improves the best known upper bound of 3 log n for the same due to Poljak and Pultr. The technique used in arriving at the above bound is extended and combined with a well-known result on the existence of orthogonal Latin squares to show that every graph on n vertices with treewidth at most t has product dimension at most (t + 2) (log n + 1). We also show that every k-degenerate graph on n vertices has product dimension at most inverted right perpendicular5.545 k log ninverted left perpendicular + 1. This improves the upper bound of 32 k log n for the same by Eaton and Rodl.

Unified Taxonomy for Reference Ontology of Shape Features in Product Model

This paper presents a unified taxonomy of shape features. Such taxonomy is required to construct ontologies to address heterogeneity in product/shape models. Literature provides separate classifications for volumetric, deformation and free-form surface features. The unified taxonomy proposed allows classification, representation and extraction of shape features in a product model. The novelty of the taxonomy is that the classification is based purely on shape entities and therefore it is possible to automatically extract the features from any shape model. This enables the use of this taxonomy to build reference ontology.

Shape-function-relationship (SFR) framework for semantic interoperability of product model

The problem of semantic interoperability arises while integrating applications in different task domains across the product life cycle. A new shape-function-relationship (SFR) framework is proposed as a taxonomy based on which an ontology is developed. Ontology based on the SFR framework, that captures explicit definition of terminology and knowledge relationships in terms of shape, function and relationship descriptors, offers an attractive approach for solving semantic interoperability issue. Since all instances of terms are based on single taxonomy with a formal classification, mapping of terms requires a simple check on the attributes used in the classification. As a preliminary study, the framework is used to develop ontology of terms used in the aero-engine domain and the ontology is used to resolve the semantic interoperability problem in the integration of design and maintenance. Since the framework allows a single term to have multiple classifications, handling context dependent usage of terms becomes possible. Automating the classification of terms and establishing the completeness of the classification scheme are being addressed presently.

Optimal incentive timing strategies for product marketing on social networks

We consider the problem of devising incentive strategies for viral marketing of a product. In particular, we assume that the seller can influence penetration of the product by offering two incentive programs: a) direct incentives to potential buyers (influence) and b) referral rewards for customers who influence potential buyers to make the purchase (exploit connections). The problem is to determine the optimal timing of these programs over a finite time horizon. In contrast to algorithmic perspective popular in the literature, we take a mean-field approach and formulate the problem as a continuous-time deterministic optimal control problem. We show that the optimal strategy for the seller has a simple structure and can take both forms, namely, influence-and-exploit and exploit-and-influence. We also show that in some cases it may optimal for the seller to deploy incentive programs mostly for low degree nodes. We support our theoretical results through numerical studies and provide practical insights by analyzing various scenarios.

Condition R and proper holomorphic maps between equidimensional product domains

We consider proper holomorphic mappings of equidimensional pseudoconvex domains in complex Euclidean space, where both source and target can be represented as Cartesian products of smoothly bounded domains. It is shown that such mappings extend smoothly up to the closures of the domains, provided each factor of the source satisfies Condition R. It also shown that the number of smoothly bounded factors in the source and target must be the same, and the proper holomorphic map splits as a product of proper mappings between the factor domains. (C) 2013 Elsevier Inc. All rights reserved.