32 resultados para COLOR-MAGNITUDE DIAGRAMS
em Indian Institute of Science - Bangalore - Índia
Resumo:
We present deep Washington photometry of 45 poorly populated star cluster candidates in the Large Magellanic Cloud (LMC). We have performed a systematic study to estimate the parameters of the cluster candidates by matching theoretical isochrones to the cleaned and dereddened cluster color-magnitude diagrams. We were able to estimate the basic parameters for 33 clusters, out of which 23 are identified as single clusters and 10 are found to be members of double clusters. The other 12 cluster candidates have been classified as possible clusters/asterisms. About 50% of the true clusters are in the 100-300 Myr age range, whereas some are older or younger. We have discussed the distribution of age, location, and reddening with respect to field, as well as the size of true clusters. The sizes and masses of the studied sample are found to be similar to that of open clusters in the Milky Way. Our study adds to the lower end of cluster mass distribution in the LMC, suggesting that the LMC, apart from hosting rich clusters, also has formed small, less massive open clusters in the 100-300 Myr age range.
Resumo:
We have estimated a metallicity map of the Large Magellanic Cloud (LMC) using the Magellanic Cloud Photometric Survey (MCPS) and Optical Gravitational Lensing Experiment (OGLE III) photometric data. This is a first of its kind map of metallicity up to a radius of 4 degrees-5 degrees, derived using photometric data and calibrated using spectroscopic data of Red Giant Branch (RGB) stars. We identify the RGB in the V, (V - I) colour-magnitude diagrams of small subregions of varying sizes in both data sets. We use the slope of the RGB as an indicator of the average metallicity of a subregion, and calibrate the RGB slope to metallicity using spectroscopic data for field and cluster red giants in selected subregions. The average metallicity of the LMC is found to be Fe/H] = -0.37 dex (sigmaFe/H] = 0.12) from MCPS data, and Fe/H] = -0.39 dex (sigmaFe/H] = 0.10) from OGLE III data. The bar is found to be the most metal-rich region of the LMC. Both the data sets suggest a shallow radial metallicity gradient up to a radius of 4 kpc (-0.049 +/- 0.002 dex kpc(-1) to -0.066 +/- 0.006 dex kpc(-1)). Subregions in which the mean metallicity differs from the surrounding areas do not appear to correlate with previously known features; spectroscopic studies are required in order to assess their physical significance.
Resumo:
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the optimizer over the query parameter space. These diagrams have proved to be a powerful metaphor for the analysis and redesign of modern optimizers, and are gaining currency in diverse industrial and academic institutions. However, their utility is adversely impacted by the impractically large computational overheads incurred when standard brute-force exhaustive approaches are used for producing fine-grained diagrams on high-dimensional query templates. In this paper, we investigate strategies for efficiently producing close approximations to complex plan diagrams. Our techniques are customized to the features available in the optimizer's API, ranging from the generic optimizers that provide only the optimal plan for a query, to those that also support costing of sub-optimal plans and enumerating rank-ordered lists of plans. The techniques collectively feature both random and grid sampling, as well as inference techniques based on nearest-neighbor classifiers, parametric query optimization and plan cost monotonicity. Extensive experimentation with a representative set of TPC-H and TPC-DS-based query templates on industrial-strength optimizers indicates that our techniques are capable of delivering 90% accurate diagrams while incurring less than 15% of the computational overheads of the exhaustive approach. In fact, for full-featured optimizers, we can guarantee zero error with less than 10% overheads. These approximation techniques have been implemented in the publicly available Picasso optimizer visualization tool.
Resumo:
Color displays used in image processing systems consist of a refresh memory buffer storing digital image data which are converted into analog signals to display an image by driving the primary color channels (red, green, and blue) of a color television monitor. The color cathode ray tube (CRT) of the monitor is unable to reproduce colors exactly due to phosphor limitations, exponential luminance response of the tube to the applied signal, and limitations imposed by the digital-to-analog conversion. In this paper we describe some computer simulation studies (using the U*V*W* color space) carried out to measure these reproduction errors. Further, a procedure to correct for color reproduction error due to the exponential luminance response (gamma) of the picture tube is proposed, using a video-lookup-table and a higher resolution digital-to-analog converter. It is found, on the basis of computer simulation studies, that the proposed gamma correction scheme is effective and robust with respect to variations in the assumed value of the gamma.
Resumo:
A new two-dimensional 3d-4f mixed-metal mixed dicarboxylate (homocyclic and heterocyclic) of the formula [Gd2(H2O)2Ni(H2O)2(1,2-bdc)2(2,5-pydc)2] 3 8H2O (1; 1,2-H2bdc = 1,2-benzenedicarboxylic acid and 2,5-H2pydc = 2,5- pyridinedicarboxylic acid) has been prepared by employing the hydrothermal method. The structure has infinite onedimensional-Gd-O-Gd- chains formed by the edge-shared GdO9 polyhedral units, resulting exclusively from the connectivity between the Gd3+ ions and the 1,2-bdc units. The chains are connected by the [Ni(H2O)2(2,5-pydc)2]2- metalloligand, forming the two-dimensional layer arrangements. The stacking of the layers creates hydrophilic and hydrophobic spaces in the interlamellar region. A one-dimensional water ladder structure, formed by the extraframework water molecules, occupies the hydrophilic region while the benzene ring of 1,2-bdc occupies the hydrophobic region. To the best of our knowledge, the present compound represents the first example of a 3d-4f mixed-metal carboxylate in which two different aromatic dicarboxylate anions act as the linkers. The stabilization energies of the water clusters have been evaluated using density functional theory calculations. The water molecules in 1 are fully reversible accompanied by a change in color (greenish blue to brown) and coordination around Ni2+ ions (octahedral to distorted tetrahedral).
Resumo:
Monopoles which are sources of non-Abelian magnetic flux are predicted by many models of grand unification. It has been argued elsewhere that a generic transformation of the "unbroken" symmetry group H cannot be globally implemented on such monopoles for reasons of topology. In this paper, we show that similar topological obstructions are encountered in the mechanics of a test particle in the field of these monopoles and that the transformations of H cannot all be globally implemented as canonical transformations. For the SU(5) model, if H is SU(3)C×U(1)em, a consequence is that color multiplets are not globally defined, while if H is SU(3)C×SU(2)WS×U(1)Y, the same is the case for both color and electroweak multiplets. There are, however, several subgroups KT, KT′,… of H which can be globally implemented, with the transformation laws of the observables differing from group to group in a novel way. For H=SU(3)C×U(1)em, a choice for KT is SU(2)C×U(1)em, while for H=SU(3)C×SU(2)WS×U(1)Y, a choice is SU(2)C×U(1)×U(1)×U(1). The paper also develops the differential geometry of monopoles in a form convenient for computations.
Resumo:
Many grand unified theories (GUT's) predict non-Abelian monopoles which are sources of non-Abelian (and Abelian) magnetic flux. In the preceding paper, we discussed in detail the topological obstructions to the global implementation of the action of the "unbroken symmetry group" H on a classical test particle in the field of such a monopole. In this paper, the existence of similar topological obstructions to the definition of H action on the fields in such a monopole sector, as well as on the states of a quantum-mechanical test particle in the presence of such fields, are shown in detail. Some subgroups of H which can be globally realized as groups of automorphisms are identified. We also discuss the application of our analysis to the SU(5) GUT and show in particular that the non-Abelian monopoles of that theory break color and electroweak symmetries.
Resumo:
The paper elucidates a simple way ooJ'dcriving the coordinates for &awing sfereo-&gram of molecules. This method is an alternative, but not a substitute, to the 'ORTEP (suggested by C. K. Johnsori) which, is extensively used in the literature. Illustrations are given using a progrunz which was written based on the method mentioned here. The program is also given in an appendix for practical help.
Resumo:
Visual tracking has been a challenging problem in computer vision over the decades. The applications of Visual Tracking are far-reaching, ranging from surveillance and monitoring to smart rooms. Mean-shift (MS) tracker, which gained more attention recently, is known for tracking objects in a cluttered environment and its low computational complexity. The major problem encountered in histogram-based MS is its inability to track rapidly moving objects. In order to track fast moving objects, we propose a new robust mean-shift tracker that uses both spatial similarity measure and color histogram-based similarity measure. The inability of MS tracker to handle large displacements is circumvented by the spatial similarity-based tracking module, which lacks robustness to object's appearance change. The performance of the proposed tracker is better than the individual trackers for tracking fast-moving objects with better accuracy.
Resumo:
Bi3+ ions substituting at Ba-sites in a limited concentration range with another donor dopant occupying the Ti-sites in polycrystalline BaTiO3 enhanced the positive temperature coefficient of resistance (PTCR) by over seven orders of magnitude. These ceramics did not require normal post sinter annealing or a change to an oxygen atmosphere during annealing. These ceramics had low porosities coupled with better stabilities to large applied electric fields and chemically reducing atmospheres. Bi3+ ions limited the grain growth to less than 8 mum in size, they enhanced the concentration of acceptor-type trap centres at the grain-boundary-layer regions and maintained complete tetragonality at low grain sizes in BaTiO3 ceramics.
Resumo:
We report the results of Monte Carlo simulation of oxygen ordering in the oxygen deficient portion (x<0.5) of YBa2Cu3O6+x at low temperatures. We find qualitative agreement among cluster - variation, Monte Carlo and transfer matrix methods. However, low temperature and ground state simulations clearly indicate the presence of a tetragonal phase. There is also evidence for two second order phase transition lines separating the tetragonal and the �double cell� ortho II phase. The effect of decreasing the inter-chain repulsion on oxygen ordering has also been investigated.
Resumo:
One of the main disturbances in EEG signals is EMG artefacts generated by muscle movements. In the paper, the use of a linear phase FIR digital low-pass filter with finite wordlength precision coefficients is proposed, designed using the compensation procedure, to minimise EMG artefacts in contaminated EEG signals. To make the filtering more effective, different structures are used, i.e. cascading, twicing and sharpening (apart from simple low-pass filtering) of the designed FIR filter Modifications are proposed to twicing and sharpening structures to regain the linear phase characteristics that are lost in conventional twicing and sharpening operations. The efficacy of all these transformed filters in minimising EMG artefacts is studied, using SNR improvements as a performance measure for simulated signals. Time plots of the signals are also compared. Studies show that the modified sharpening structure is superior in performance to all other proposed methods. These algorithms have also been applied to real or recorded EMG-contaminated EEG signal. Comparison of time plots, and also the output SNR, show that the proposed modified sharpened structure works better in minimising EMG artefacts compared with other methods considered.
Resumo:
A new topology of asymmetric cascaded H-Bridge inverter is presented in this paper It consists of two cascaded H-bridge cells per phase. They are fed from isolated dc sources having a dc bus ratio of 1:0.366. Out of many space vectors possible from this circuit, only those are chosen that lie on 12-sided polygons. Thus, the overall space vector diagram produced by this circuit consists of multiple numbers of 12-sided polygons. With a proper PWM timing calculations based on these selected space vectors, it is possible to eliminate all the 6n +/- 1, (n = odd) harmonics from the phase voltage under all operating conditions. The switching frequency of individual H-Bridge cells is also substantially low. Extensive experimental results have been presented in this paper to validate the proposed concept.
Resumo:
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently that, for industrial-strength database engines, these diagrams are often remarkably complex and dense, with a large number of plans covering the space. However, they can often be reduced to much simpler pictures, featuring significantly fewer plans, without materially affecting the query processing quality. Plan reduction has useful implications for the design and usage of query optimizers, including quantifying redundancy in the plan search space, enhancing useability of parametric query optimization, identifying error-resistant and least-expected-cost plans, and minimizing the overheads of multi-plan approaches. We investigate here the plan reduction issue from theoretical, statistical and empirical perspectives. Our analysis shows that optimal plan reduction, w.r.t. minimizing the number of plans, is an NP-hard problem in general, and remains so even for a storage-constrained variant. We then present a greedy reduction algorithm with tight and optimal performance guarantees, whose complexity scales linearly with the number of plans in the diagram for a given resolution. Next, we devise fast estimators for locating the best tradeoff between the reduction in plan cardinality and the impact on query processing quality. Finally, extensive experimentation with a suite of multi-dimensional TPCH-based query templates on industrial-strength optimizers demonstrates that complex plan diagrams easily reduce to "anorexic" (small absolute number of plans) levels incurring only marginal increases in the estimated query processing costs.