1- and 2-Chloromorphine. Halogenation of Morphine meta to the Free Phenolic Hydroxyl Group

Treatment of morphine in aqueous HCl at 70° with KIO3 yields a monochloromorphine, identified as 1-chloromorphine by spectroscopic means and by the fact that it, and its methyl ether 1-chlorocodeine, are different from 2-chloromorphine and 2-chlorocodeine prepared from 2-aminomorphine of unequivocally established structure. Formation of 1-chloromorphine and the previously known 1-bromomorphine involves entry of the halogen into the position meta to the free phenolic hydroxyl. Possible mechanistic interpretations of this unusual orientation are discussed.

Geochemistry of meta-anorthosites from Holénarasipur, Karnataka, South India

Geochemical and Rb---Sr isotope studies indicate that the meta-anorthosites of Holénarasipur, occurring as minor differentiates in ultramafic-mafic complex are igneous intrusives with cumulus character, emplaced around 3095 m.y. ago. The fine-grained nature is secondary; relict cumulus features are preserved in less deformed bodies. In major element chemistry, they compare well with other Archean anorthosites. Abundance levels of Ti, Zr, Y and P indicate the evolution through crystal fractionation of a parental magma; cumulus olivine and pyroxenes dominated chemistry for ultramafites, cumulus plagioclase and possibly clinopyroxene controlled chemistry for anorthosite-gabbros and cumulus magnetite in magnetite-gabbros. Magnetite is not an early cumulate. REE geochemistry is dominated by plagioclase with low abundance levels, slightly LREE enriched and variable positive Eu anomaly. Sr and Image values vary with An content in plagioclase. Isotopic studies show low initial Image (=0.7016) indicating that Rb---Sr isochron age represents the time of intrusion rather than the time of metamorphism.

Crystal structure of ferroelectric sodium meta vanadate, NaVO3

The crystal structure of ferroelectric sodium meta vanadate, NaVO3 has been solved using three dimensional X-ray data and refined to an R-value of 0.077 for 375 observed reflections. The crystal belongs to the monoclinic system with space group Cc and with unit cell dimensions a = 10.494 (9) Aring, b = 9.434 (7) Aring, c = 5.863 (6) Aring and β = 108° 48' in the room temperature ferroelectric phase. The unit cell dimensions in the high temperature paraelectric phase (above 380°C) are a = 10.595 (15) Aring, b = 9.671 (10) Aring, c = 5.926 (8) Aring and β = 108° 45' with space group C2/c. The crystal structure may be viewed as consisting of alternate channels of sodium polyhedra and VO4 tetrahedra.

Polyvanadate-stimulated NADH oxidation by plasma membranes-The need for a mixture of deca and meta forms of vanadate

Polyvanadate solutions obtained by extracting vanadium pentoxide with dilute alkali over a period of several hours contained increasing amounts of decavanadate as characterized by NMR and ir spectra. Those solutions having a metavanadate:decavanadate ratio in the range of 1-5 showed maximum stimulation of NADH oxidation by rat liver plasma membranes. Reduction of decavanadate, but not metavanadate, was obtained only in the presence of the plasma membrane enzyme system. High simulation of activity of NADH oxidation was obtained with a mixture of the two forms of vanadate and this further increased on lowering the pH. Addition of increasing concentrations of decavanadate to metavanadate and vice versa increased the stimulatory activity, reaching a maximum when the metavanadate:decavanadate ratio was in the range of 1-5. Increased stimulatory activity can also be obtained by reaching these ratios by conversion of decavanadate to metavanadate by alkaline phosphate degradation, and of metavanadate to decavanadate by acidification. These studies show for the first time that both deca and meta forms of vanadate present in polyvanadate solutions are needed for maximum activity of NADH oxidation.

Isoperimetric Problem and Meta-fibonacci Sequences

Let G = (V,E) be a simple, finite, undirected graph. For S ⊆ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$ , such that (u,v) ∈ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ∣ V ∣, the edge and vertex isoperimetric value at i is defined as b e (i,G) =  min S ⊆ V; |S| = i |δ(S,G)| and b v (i,G) =  min S ⊆ V; |S| = i |φ(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i. Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book “Gödel, Escher, Bach. An Eternal Golden Braid”. The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i − 1 − a(i − 1)) + a(i − 2 − a(i − 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 − 2a(i), for each i ≥ 1. We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.

Robust heuristics for scalable optimization of complex SQL queries

Modern database systems incorporate a query optimizer to identify the most efficient "query execution plan" for executing the declarative SQL queries submitted by users. A dynamic-programming-based approach is used to exhaustively enumerate the combinatorially large search space of plan alternatives and, using a cost model, to identify the optimal choice. While dynamic programming (DP) works very well for moderately complex queries with up to around a dozen base relations, it usually fails to scale beyond this stage due to its inherent exponential space and time complexity. Therefore, DP becomes practically infeasible for complex queries with a large number of base relations, such as those found in current decision-support and enterprise management applications. To address the above problem, a variety of approaches have been proposed in the literature. Some completely jettison the DP approach and resort to alternative techniques such as randomized algorithms, whereas others have retained DP by using heuristics to prune the search space to computationally manageable levels. In the latter class, a well-known strategy is "iterative dynamic programming" (IDP) wherein DP is employed bottom-up until it hits its feasibility limit, and then iteratively restarted with a significantly reduced subset of the execution plans currently under consideration. The experimental evaluation of IDP indicated that by appropriate choice of algorithmic parameters, it was possible to almost always obtain "good" (within a factor of twice of the optimal) plans, and in the few remaining cases, mostly "acceptable" (within an order of magnitude of the optimal) plans, and rarely, a "bad" plan. While IDP is certainly an innovative and powerful approach, we have found that there are a variety of common query frameworks wherein it can fail to consistently produce good plans, let alone the optimal choice. This is especially so when star or clique components are present, increasing the complexity of th- e join graphs. Worse, this shortcoming is exacerbated when the number of relations participating in the query is scaled upwards.

The unusual formation of methyl alpha-(5,6-dimethoxycarbonyl-2,3-dimethoxyazepin-7-ylidene)-alpha-[5-methoxycarbonyl-2,3-dimethoxypyrid-6-yl)acetate during the pyrolysis of ''azido-meta-hemipinate'' - First example of a reaction involving a concomitant ring expansion and ring extrusion

he ortho methoxycarbonyl substituent constitutes a sole exception in the ring closure reactions of ortho substituted aryl azides, as it provides no rate acceleration to this reaction. Pyrolysis of ''azido-meta-hemipinate'', an aryl azide containing such a substituent, led us to the title compound, a new azepinylidenepyridylacetic ester, whose structure has been established unambiguously by a single crystal X-ray diffraction study. This is the first report of a reaction involving both a ring expansion to an azaheptafulvalene and a ring extrusion to a pyridyl ring residue.

A meta-analysis of the traits affecting dispersal ability in butterflies: can wingspan be used as a proxy?

1. Dispersal ability of a species is a key ecological characteristic, affecting a range of processes from adaptation, community dynamics and genetic structure, to distribution and range size. It is determined by both intrinsic species traits and extrinsic landscape-related properties. 2. Using butterflies as a model system, the following questions were addressed: (i) given similar extrinsic factors, which intrinsic species trait(s) explain dispersal ability? (ii) can one of these traits be used as a proxy for dispersal ability? (iii) the effect of interactions between the traits, and phylogenetic relatedness, on dispersal ability. 3. Four data sets, using different measures of dispersal, were compiled from published literature. The first data set uses mean dispersal distances from capture-mark-recapture studies, and the other three use mobility indices. Data for six traits that can potentially affect dispersal ability were collected: wingspan, larval host plant specificity, adult habitat specificity, mate location strategy, voltinism and flight period duration. Each data set was subjected to both unifactorial, and multifactorial, phylogenetically controlled analyses. 4. Among the factors considered, wingspan was the most important determinant of dispersal ability, although the predictive powers of regression models were low. Voltinism and flight period duration also affect dispersal ability, especially in case of temperate species. Interactions between the factors did not affect dispersal ability, and phylogenetic relatedness was significant in one data set. 5. While using wingspan as the only proxy for dispersal ability maybe problematic, it is usually the only easily accessible species-specific trait for a large number of species. It can thus be a satisfactory proxy when carefully interpreted, especially for analyses involving many species from all across the world.

Amphiphilic poly(meta-phenylene)s: A novel conjugated polysoap; A possible foldamer?

Novel amphiphilic poly(meta-phenylene)s were prepared by an oxidative coupling approach. These polymers were synthesized to shed light on their solution properties with special emphasis on aggregation and folding behavior. The polymers were characterized by NMR spectroscopy and molecular weights were determined by Gel Permeation Chromatography using Universal calibration. Literature studies revealed that the backbone of these PMPs can be helical moreover, the light emitting properties of this conjugated polymer can be used as a handle to study the possible aggregation or self-assembling behavior. In this report we show the synthesis, characterization and preliminary aggregation properties that points out that one of the synthesized PMP behave as a polysoap.

How general is a female mating preference for clustered males in lekking species? a meta-analysis

A principal hypothesis for the evolution of leks (rare and intensely competitive territorial aggregations) is that leks result from females preferring to mate with clustered males. This hypothesis predicts more female visits and higher mating success per male on larger leks. Evidence for and against this hypothesis has been presented by different studies, primarily of individual populations, but its generality has not yet been formally investigated. We took a meta-analytical approach towards formally examining the generality of such a female bias in lekking species. Using available published data and using female visits as an index of female mating bias, we estimated the shape of the relationship between lek size and total female visits to a lek, female visits per lekking male and, where available, per capita male mating success. Individual analyses showed that female visits generally increased with lek size across the majority of taxa surveyed; the meta-analysis indicated that this relationship with lek size was disproportionately positive. The findings from analysing per capita female visits were mixed, with an increase with lek size detected in half of the species, which were, however, widely distributed taxonomically. Taken together, these findings suggest that a female bias for clustered males may be a general process across lekking species. Nevertheless, the substantial variation seen in these relationships implies that other processes are also important. Analyses of per capita copulation success suggested that, more generally, increased per capita mating benefits may be an important selective factor in lek maintenance.

Subject independent human action recognition using spatio-depth information and meta-cognitive RBF network

In this paper, we present a machine learning approach for subject independent human action recognition using depth camera, emphasizing the importance of depth in recognition of actions. The proposed approach uses the flow information of all 3 dimensions to classify an action. In our approach, we have obtained the 2-D optical flow and used it along with the depth image to obtain the depth flow (Z motion vectors). The obtained flow captures the dynamics of the actions in space time. Feature vectors are obtained by averaging the 3-D motion over a grid laid over the silhouette in a hierarchical fashion. These hierarchical fine to coarse windows capture the motion dynamics of the object at various scales. The extracted features are used to train a Meta-cognitive Radial Basis Function Network (McRBFN) that uses a Projection Based Learning (PBL) algorithm, referred to as PBL-McRBFN, henceforth. PBL-McRBFN begins with zero hidden neurons and builds the network based on the best human learning strategy, namely, self-regulated learning in a meta-cognitive environment. When a sample is used for learning, PBLMcRBFN uses the sample overlapping conditions, and a projection based learning algorithm to estimate the parameters of the network. The performance of PBL-McRBFN is compared to that of a Support Vector Machine (SVM) and Extreme Learning Machine (ELM) classifiers with representation of every person and action in the training and testing datasets. Performance study shows that PBL-McRBFN outperforms these classifiers in recognizing actions in 3-D. Further, a subject-independent study is conducted by leave-one-subject-out strategy and its generalization performance is tested. It is observed from the subject-independent study that McRBFN is capable of generalizing actions accurately. The performance of the proposed approach is benchmarked with Video Analytics Lab (VAL) dataset and Berkeley Multimodal Human Action Database (MHAD). (C) 2013 Elsevier Ltd. All rights reserved.