961 resultados para class interval
Resumo:
The paper reports the effect of the addition of small amount of Al on the microstructure and properties of HITPERM class rapidly solidified Fe44Co44Zr7B4Cu1 glassy alloy. Using three dimensional atom probe measurements we present evidence for the formation of Cu clusters on annealing in the metallic glass matrix of the Al containing alloy Fe43Co43Al2Zr7B4Cu1. Such clusters are otherwise absent in the parent alloy under similar conditions. The Cu clusters provides heterogeneous nucleation sites for the formation of bcc alpha'-FeCo phase leading to an increase in number density of this nanocrystalline phase and thereby enhancing the magnetic properties. (C) 2012 Elsevier B.V. All rights reserved.
Resumo:
In search for a new antioxidant and antimicrobial agent with improved potency, we synthesized a series of benzofuran based 1,3,5-substituted pyrazole analogues (5a-l) in five step reaction. Initially, o-alkyl derivative of salicyaldehyde readily furnish corresponding 2-acetyl benzofuran 2 in good yield, on treatment with 1,8-diaza bicyclo5.4.0]undec-7-ene (DBU) in the presence of molecular sieves. Further, aldol condensation with vanillin, Claisen-Schmidt condensation reaction with hydrazine hydrate followed by coupling of substituted anilines afforded target compounds. The structures of newly synthesized compounds were confirmed by IR, H-1 NMR, C-13 NMR, mass, elemental analysis and further screened for their antioxidant and antimicrobial activities. Among the tested compounds 5d and 5f exhibited good antioxidant property with 50% inhibitory concentration higher than that of reference while compounds 5h and 5l exhibited good antimicrobial activity at concentration 1.0 and 0.5 mg/mL compared with standard, streptomycin and fluconazole respectively. (C) 2012 Elsevier Ltd. All rights reserved.
Resumo:
Temperature dependent X-ray powder diffraction and dielectric studies have been carried out on tetragonal compositions of (1-x) PbTiO 3(x) BiMeO 3; Me similar to Sc and Zn 1/2 Ti 1/2. The cubic and the tetragonal phases coexist over more than 100 degrees C for 0.70 PbTiO 30.3 Bi ( Zn 1/2 Ti 1/2) O 3 and 0.66 PbTiO 30.34 BiScO 3. The wide temperature range of phase coexistence is shown to be an intrinsic feature of the system, and is attributed to the increase in the degree of the covalent character of the ( Pb +Bi ) O bond with increasing concentration of Bi at the Pb -site. The d-values of the {111} planes of the coexisting phases are nearly identical, suggesting this plane to be the invariant plane for the martensitic type cubic-tetragonal transformation occurring in these systems.
Resumo:
It is generally known that addition of conducting or insulating particles to mineral transformer oil, lowers its breakdown strength, E-d. However, if the particulates are of molecular dimensions, or nanoparticles, (NPs), as they are called, the breakdown strength is seen to increase considerably. Recent experiments by the authors on oil cooled power equipment such as transformers showed that, nanofluids comprising NPs of selected oxides of iron, such as Fe(3)o(4), called magnetite, added to transformer oil increased the breakdown voltage of the virgin oil and more importantly a remarkable enhancement in the thermal conductivity and the viscosity and hence an increased loadability of the transformer for a given top oil temperature (TOT).
Resumo:
This article considers a class of deploy and search strategies for multi-robot systems and evaluates their performance. The application framework used is deployment of a system of autonomous mobile robots equipped with required sensors in a search space to gather information. The lack of information about the search space is modelled as an uncertainty density distribution. The agents are deployed to maximise single-step search effectiveness. The centroidal Voronoi configuration, which achieves a locally optimal deployment, forms the basis for sequential deploy and search (SDS) and combined deploy and search (CDS) strategies. Completeness results are provided for both search strategies. The deployment strategy is analysed in the presence of constraints on robot speed and limit on sensor range for the convergence of trajectories with corresponding control laws responsible for the motion of robots. SDS and CDS strategies are compared with standard greedy and random search strategies on the basis of time taken to achieve reduction in the uncertainty density below a desired level. The simulation experiments reveal several important issues related to the dependence of the relative performances of the search strategies on parameters such as the number of robots, speed of robots and their sensor range limits.
Resumo:
In the design of practical web page classification systems one often encounters a situation in which the labeled training set is created by choosing some examples from each class; but, the class proportions in this set are not the same as those in the test distribution to which the classifier will be actually applied. The problem is made worse when the amount of training data is also small. In this paper we explore and adapt binary SVM methods that make use of unlabeled data from the test distribution, viz., Transductive SVMs (TSVMs) and expectation regularization/constraint (ER/EC) methods to deal with this situation. We empirically show that when the labeled training data is small, TSVM designed using the class ratio tuned by minimizing the loss on the labeled set yields the best performance; its performance is good even when the deviation between the class ratios of the labeled training set and the test set is quite large. When the labeled training data is sufficiently large, an unsupervised Gaussian mixture model can be used to get a very good estimate of the class ratio in the test set; also, when this estimate is used, both TSVM and EC/ER give their best possible performance, with TSVM coming out superior. The ideas in the paper can be easily extended to multi-class SVMs and MaxEnt models.
Resumo:
Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional axis parallel boxes in Rk. Equivalently, it is the minimum number of interval graphs on the vertex set V such that the intersection of their edge sets is E. It is known that boxicity cannot be approximated even for graph classes like bipartite, co-bipartite and split graphs below O(n0.5-ε)-factor, for any ε > 0 in polynomial time unless NP = ZPP. Till date, there is no well known graph class of unbounded boxicity for which even an nε-factor approximation algorithm for computing boxicity is known, for any ε < 1. In this paper, we study the boxicity problem on Circular Arc graphs - intersection graphs of arcs of a circle. We give a (2+ 1/k)-factor polynomial time approximation algorithm for computing the boxicity of any circular arc graph along with a corresponding box representation, where k ≥ 1 is its boxicity. For Normal Circular Arc(NCA) graphs, with an NCA model given, this can be improved to an additive 2-factor approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity is O(mn+n2) in both these cases and in O(mn+kn2) which is at most O(n3) time we also get their corresponding box representations, where n is the number of vertices of the graph and m is its number of edges. The additive 2-factor algorithm directly works for any Proper Circular Arc graph, since computing an NCA model for it can be done in polynomial time.
Resumo:
Let M be the completion of the polynomial ring C(z) under bar] with respect to some inner product, and for any ideal I subset of C (z) under bar], let I] be the closure of I in M. For a homogeneous ideal I, the joint kernel of the submodule I] subset of M is shown, after imposing some mild conditions on M, to be the linear span of the set of vectors {p(i)(partial derivative/partial derivative(w) over bar (1),...,partial derivative/partial derivative(w) over bar (m)) K-I] (., w)vertical bar(w=0), 1 <= i <= t}, where K-I] is the reproducing kernel for the submodule 2] and p(1),..., p(t) is some minimal ``canonical set of generators'' for the ideal I. The proof includes an algorithm for constructing this canonical set of generators, which is determined uniquely modulo linear relations, for homogeneous ideals. A short proof of the ``Rigidity Theorem'' using the sheaf model for Hilbert modules over polynomial rings is given. We describe, via the monoidal transformation, the construction of a Hermitian holomorphic line bundle for a large class of Hilbert modules of the form I]. We show that the curvature, or even its restriction to the exceptional set, of this line bundle is an invariant for the unitary equivalence class of I]. Several examples are given to illustrate the explicit computation of these invariants.
Resumo:
Pathogenic mycobacteria employ several immune evasion strategies such as inhibition of class II transactivator (CIITA) and MHC-II expression, to survive and persist in host macrophages. However, precise roles for specific signaling components executing down-regulation of CIITA/MHC-II have not been adequately addressed. Here, we demonstrate that Mycobacterium bovis bacillus Calmette-Guerin (BCG)-mediated TLR2 signaling-induced iNOS/NO expression is obligatory for the suppression of IFN-gamma-induced CIITA/MHC-II functions. Significantly, NOTCH/PKC/MAPK-triggered signaling cross-talk was found critical for iNOS/NO production. NO responsive recruitment of a bifunctional transcription factor, KLF4, to the promoter of CIITA during M. bovis BCG infection of macrophages was essential to orchestrate the epigenetic modifications mediated by histone methyltransferase EZH2 or miR-150 and thus calibrate CIITA/MHC-II expression. NO-dependent KLF4 regulated the processing and presentation of ovalbumin by infected macrophages to reactive T cells. Altogether, our study delineates a novel role for iNOS/NO/KLF4 in dictating the mycobacterial capacity to inhibit CIITA/MHC-II-mediated antigen presentation by infected macrophages and thereby elude immune surveillance.
Resumo:
Transductive SVM (TSVM) is a well known semi-supervised large margin learning method for binary text classification. In this paper we extend this method to multi-class and hierarchical classification problems. We point out that the determination of labels of unlabeled examples with fixed classifier weights is a linear programming problem. We devise an efficient technique for solving it. The method is applicable to general loss functions. We demonstrate the value of the new method using large margin loss on a number of multi-class and hierarchical classification datasets. For maxent loss we show empirically that our method is better than expectation regularization/constraint and posterior regularization methods, and competitive with the version of entropy regularization method which uses label constraints.
Resumo:
A natural class of weighted Bergman spaces on the symmetrized polydisc is isometrically embedded as a subspace in the corresponding weighted Bergman space on the polydisc. We find an orthonormal basis for this subspace. It enables us to compute the kernel function for the weighted Bergman spaces on the symmetrized polydisc using the explicit nature of our embedding. This family of kernel functions includes the Szego and the Bergman kernel on the symmetrized polydisc.
Resumo:
The curvature (T)(w) of a contraction T in the Cowen-Douglas class B-1() is bounded above by the curvature (S*)(w) of the backward shift operator. However, in general, an operator satisfying the curvature inequality need not be contractive. In this paper, we characterize a slightly smaller class of contractions using a stronger form of the curvature inequality. Along the way, we find conditions on the metric of the holomorphic Hermitian vector bundle E-T corresponding to the operator T in the Cowen-Douglas class B-1() which ensures negative definiteness of the curvature function. We obtain a generalization for commuting tuples of operators in the class B-1() for a bounded domain in C-m.
Resumo:
In several systems, the physical parameters of the system vary over time or operating points. A popular way of representing such plants with structured or parametric uncertainties is by means of interval polynomials. However, ensuring the stability of such systems is a robust control problem. Fortunately, Kharitonov's theorem enables the analysis of such interval plants and also provides tools for design of robust controllers in such cases. The present paper considers one such case, where the interval plant is connected with a timeinvariant, static, odd, sector type nonlinearity in its feedback path. This paper provides necessary conditions for the existence of self sustaining periodic oscillations in such interval plants, and indicates a possible design algorithm to avoid such periodic solutions or limit cycles. The describing function technique is used to approximate the nonlinearity and subsequently arrive at the results. Furthermore, the value set approach, along with Mikhailov conditions, are resorted to in providing graphical techniques for the derivation of the conditions and subsequent design algorithm of the controller.