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.

Behaviour simulation in computer aided product concept sketching

In the product conceptualization phase of design, sketches are often used for exploration of diverse behaviour patterns of the components to achieve the required functionality. This paper presents a method to animate the sketch produced using a tablet interface to aid verification of the desired behaviour. A sketch is a spatial organization of strokes whose perceptual organization helps one to visually interpret its components and their interconnections. A Gestalt based segmentation followed by interactive grouping and articulation, presented in this paper, enables one to use a mechanism simulation framework to animate the sketch in a “pick and drag” mode to visualize different configurations of the product and gain insight into the product’s behaviour.

Enantioselective synthesis of macrolactone core of the natural product Sch725674

An enantioselective synthesis of the macrolactone core of natural product Sch725674 was accomplished from furfural. Key reactions in assembly of the macrolactone are the use of furan as a but-2-ene-dione equivalent and ring closing metathesis. (C) 2014 Elsevier Ltd. All rights reserved.

Proper holomorphic mappings between hyperbolic product manifolds

We prove a result on the structure of finite proper holomorphic mappings between complex manifolds that are products of hyperbolic Riemann surfaces. While an important special case of our result follows from the ideas developed by Remmert and Stein, the proof of the full result relies on the interplay of the latter ideas and a finiteness theorem for Riemann surfaces.

Extended liaison as an interface between product and process model in assembly

This paper describes the use of liaison to better integrate product model and assembly process model so as to enable sharing of design and assembly process information in a common integrated form and reason about them. Liaison can be viewed as a set, usually a pair, of features in proximity with which process information can be associated. A liaison is defined as a set of geometric entities on the parts being assembled and relations between these geometric entities. Liaisons have been defined for riveting, welding, bolt fastening, screw fastening, adhesive bonding (gluing) and blind fastening processes. The liaison captures process specific information through attributes associated with it. The attributes are associated with process details at varying levels of abstraction. A data structure for liaison has been developed to cluster the attributes of the liaison based on the level of abstraction. As information about the liaisons is not explicitly available in either the part model or the assembly model, algorithms have been developed for extracting liaisons from the assembly model. The use of liaison is proposed to enable both the construction of process model as the product model is fleshed out, as well as maintaining integrity of both product and process models as the inevitable changes happen to both design and the manufacturing environment during the product lifecycle. Results from aerospace and automotive domains have been provided to illustrate and validate the use of liaisons. (C) 2014 Elsevier Ltd. All rights reserved.

OPTIMALITY OF THE PRODUCT-MATRIX CONSTRUCTION FOR SECURE MSR REGENERATING CODES

In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of l(1) nodes as well as all the repair traffic entering a second disjoint set of l(2) nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever l(2) <= d - k +1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.

A Modified Sum-Product Algorithm over Graphs with Isolated Short Cycles

We investigate into the limitations of the sum-product algorithm in the probability domain over graphs with isolated short cycles. By considering the statistical dependency of messages passed in a cycle of length 4, we modify the update equations for the beliefs at the variable and check nodes. We highlight an approximate log domain algebra for the modified variable node update to ensure numerical stability. At higher signal-to-noise ratios (SNR), the performance of decoding over graphs with isolated short cycles using the modified algorithm is improved compared to the original message passing algorithm (MPA).

ADAPTATION OF MW LEVEL NATURAL GAS LEAN BURN ENGINE FOR PRODUCER GAS OPERATION A GRID CONNECTED POWER PLANT

Availability of producer gas engines at MW being limited necessitates to adapt engine from natural gas operation. The present work focus on the development of necessary kit for adapting a 12 cylinder lean burn turbo-charged natural gas engine rated at 900 kWe (Waukesha make VHP5904LTD) to operate on producer and set up an appropriate capacity biomass gasification system for grid linked power generation in Thailand. The overall plant configuration had fuel processing, drying, reactor, cooling and cleaning system, water treatment, engine generator and power evacuation. The overall project is designed for evacuation of 1.5 MWe power to the state grid and had 2 gasification system with the above configuration and 3 engines. Two gasification system each designed for about 1100 kg/hr of woody biomass was connected to the engine using a producer gas carburetor for the necessary Air to fuel ratio control. In the use of PG to fuel IC engines, it has been recognized that the engine response will differ as compared to the response with conventional fueled operation due to the differences in the thermo-physical properties of PG. On fuelling a conventional engine with PG, power de-rating can be expected due to the lower calorific value (LCV), lower adiabatic flame temperature (AFT) and the lower than unity product to reactant more ratio. Further the A/F ratio for producer gas is about 1/10th that of natural gas and requires a different carburetor for engine operation. The research involved in developing a carburetor for varying load conditions. The patented carburetor is based on area ratio control, consisting of a zero pressure regulator and a separate gas and air line along with a mixing zone. The 95 litre engine at 1000 rpm has an electrical efficiency of 33.5 % with a heat input of 2.62 MW. Each engine had two carburetors designed for producer gas flow each capable of handling about 1200 m3/hr in order to provide similar engine heat input at a lower conversion efficiency. Cold flow studies simulating the engine carburetion system results showed that the A/F was maintained in the range of 1.3 +/- 0.1 over the entire flow range. Initially, the gasification system was tested using woody biomass and the gas composition was found to be CO 15 +/- 1.5 % H-2 22 +/- 2% CH4 2.2 +/- 0.5 CO2 11.25 +/- 1.4 % and rest N-2, with the calorific value in the range of 5.0 MJ/kg. After initial trials on the engine to fine tune the control system and adjust various engine operating parameter a peak load of 800 kWe was achieved, while a stable operating conditions was found to be at 750 kWe which is nearly 85 % of the natural gas rating. The specific fuel consumption was found to be 0.9 kg of biomass per kWh.

Boxicity and cubicity of product graphs

The boxicity (cubicity) of a graph G is the minimum natural number k such that G can be represented as an intersection graph of axis-parallel rectangular boxes (axis-parallel unit cubes) in R-k. In this article, we give estimates on the boxicity and the cubicity of Cartesian, strong and direct products of graphs in terms of invariants of the component graphs. In particular, we study the growth, as a function of d, of the boxicity and the cubicity of the dth power of a graph with respect to the three products. Among others, we show a surprising result that the boxicity and the cubicity of the dth Cartesian power of any given finite graph is, respectively, in O(log d/ log log d) and circle dot(d/ log d). On the other hand, we show that there cannot exist any sublinear bound on the growth of the boxicity of powers of a general graph with respect to strong and direct products. (C) 2015 Elsevier Ltd. All rights reserved.

Understanding Medical Device Patenting and Clinical Trials for Product Leadership

Unmet clinical needs remain the primary driving force for innovations in medical devices. While appropriate mechanisms to protect these innovative outcomes are essential, the performance of clinical trials to ensure safety is also mandated before the invention is ready for public use. Literature explaining the relationship between patenting activities and clinical trials of medical devices is scarce. Linking patent ownership to clinical trials may imply product leadership and value chain control. In this paper, we use patent data from Indian Patent Office (IPO), PCT, and data from Clinical Trials Registry of India (CTRI) to identify whether patent assignees have any role in leading as primary sponsors of clinical trials. A total of 42 primary sponsors are identified from the CTRI database in India. Number of patents awarded to these primary sponsors in the particular medical device, total number of patents awarded to the primary sponsor in all technologies, total number of patents in the specific medical device technology provides an indication of leadership and control in the value chain.