979 resultados para Loss labeling (classification)
Resumo:
Advanced bus-clamping switching sequences, which employ an active vector twice in a subcycle, are used to reduce line current distortion and switching loss in a space vector modulated voltage source converter. This study evaluates minimum switching loss pulse width modulation (MSLPWM), which is a combination of such sequences, for static reactive power compensator (STATCOM) application. It is shown that MSLPWM results in a significant reduction in device loss over conventional space vector pulse width modulation. Experimental verification is presented at different power levels of up to 150 kVA.
Resumo:
The paper describes an algorithm for multi-label classification. Since a pattern can belong to more than one class, the task of classifying a test pattern is a challenging one. We propose a new algorithm to carry out multi-label classification which works for discrete data. We have implemented the algorithm and presented the results for different multi-label data sets. The results have been compared with the algorithm multi-label KNN or ML-KNN and found to give good results.
Resumo:
The problem of classification of time series data is an interesting problem in the field of data mining. Even though several algorithms have been proposed for the problem of time series classification we have developed an innovative algorithm which is computationally fast and accurate in several cases when compared with 1NN classifier. In our method we are calculating the fuzzy membership of each test pattern to be classified to each class. We have experimented with 6 benchmark datasets and compared our method with 1NN classifier.
Resumo:
The capacity of species to track shifting climates into the future will strongly influence outcomes for biodiversity under a rapidly changing climate. However, we know remarkably little about the dispersal abilities of most species and how these may be influenced by climate change. Here we show that climate change is projected to substantially reduce the seed dispersal services provided by frugivorous vertebrates in rainforests across the Australian Wet Tropics. Our model projections show reductions in both median and long-distance seed dispersal, which may markedly reduce the capacity of many rainforest plant species to track shifts in suitable habitat under climate change. However, our analyses suggest that active management to maintain the abundances of a small set of important frugivores under climate change could markedly reduce the projected loss of seed dispersal services and facilitate shifting distributions of rainforest plant species.
Resumo:
Differential mobility analyzers (DMAs) are commonly used to generate monodisperse nanoparticle aerosols. Commercial DMAs operate at quasi-atmospheric pressures and are therefore not designed to be vacuum-tight. In certain particle synthesis methods, the use of a vacuum-compatible DMA is a requirement as a process step for producing high-purity metallic particles. A vacuum-tight radial DMA (RDMA) has been developed and tested at low pressures. Its performance has been evaluated by using a commercial NANO-DMA as the reference. The performance of this low-pressure RDMA (LP-RDMA) in terms of the width of its transfer function is found to be comparable with that of other NANO-DMAs at atmospheric pressure and is almost independent of the pressure down to 30 mbar. It is shown that LP-RDMA can be used for the classification of nanometer-sized particles (5-20 nm) under low pressure condition (30 mbar) and has been successfully applied to nanoparticles produced by ablating FeNi at low pressures.
Resumo:
Thiolases are enzymes involved in lipid metabolism. Thiolases remove the acetyl-CoA moiety from 3-ketoacyl-CoAs in the degradative reaction. They can also catalyze the reverse Claisen condensation reaction, which is the first step of biosynthetic processes such as the biosynthesis of sterols and ketone bodies. In human, six distinct thiolases have been identified. Each of these thiolases is different from the other with respect to sequence, oligomeric state, substrate specificity and subcellular localization. Four sequence fingerprints, identifying catalytic loops of thiolases, have been described. In this study genome searches of two mycobacterial species (Mycobacterium tuberculosis and Mycobacterium smegmatis), were carried out, using the six human thiolase sequences as queries. Eight and thirteen different thiolase sequences were identified in M. tuberculosis and M. smegmatis, respectively. In addition, thiolase-like proteins (one encoded in the Mtb and two in the Msm genome) were found. The purpose of this study is to classify these mostly uncharacterized thiolases and thiolase-like proteins. Several other sequences obtained by searches of genome databases of bacteria, mammals and the parasitic protist family of the Trypanosomatidae were included in the analysis. Thiolase-like proteins were also found in the trypanosomatid genomes, but not in those of mammals. In order to study the phylogenetic relationships at a high confidence level, additional thiolase sequences were included such that a total of 130 thiolases and thiolase-like protein sequences were used for the multiple sequence alignment. The resulting phylogenetic tree identifies 12 classes of sequences, each possessing a characteristic set of sequence fingerprints for the catalytic loops. From this analysis it is now possible to assign the mycobacterial thiolases to corresponding homologues in other kingdoms of life. The results of this bioinformatics analysis also show interesting differences between the distributions of M. tuberculosis and M. smegmatis thiolases over the 12 different classes. (C) 2014 Elsevier Ltd. All rights reserved.
Resumo:
Background: The function of a protein can be deciphered with higher accuracy from its structure than from its amino acid sequence. Due to the huge gap in the available protein sequence and structural space, tools that can generate functionally homogeneous clusters using only the sequence information, hold great importance. For this, traditional alignment-based tools work well in most cases and clustering is performed on the basis of sequence similarity. But, in the case of multi-domain proteins, the alignment quality might be poor due to varied lengths of the proteins, domain shuffling or circular permutations. Multi-domain proteins are ubiquitous in nature, hence alignment-free tools, which overcome the shortcomings of alignment-based protein comparison methods, are required. Further, existing tools classify proteins using only domain-level information and hence miss out on the information encoded in the tethered regions or accessory domains. Our method, on the other hand, takes into account the full-length sequence of a protein, consolidating the complete sequence information to understand a given protein better. Results: Our web-server, CLAP (Classification of Proteins), is one such alignment-free software for automatic classification of protein sequences. It utilizes a pattern-matching algorithm that assigns local matching scores (LMS) to residues that are a part of the matched patterns between two sequences being compared. CLAP works on full-length sequences and does not require prior domain definitions. Pilot studies undertaken previously on protein kinases and immunoglobulins have shown that CLAP yields clusters, which have high functional and domain architectural similarity. Moreover, parsing at a statistically determined cut-off resulted in clusters that corroborated with the sub-family level classification of that particular domain family. Conclusions: CLAP is a useful protein-clustering tool, independent of domain assignment, domain order, sequence length and domain diversity. Our method can be used for any set of protein sequences, yielding functionally relevant clusters with high domain architectural homogeneity. The CLAP web server is freely available for academic use at http://nslab.mbu.iisc.ernet.in/clap/.
Resumo:
The problem of bipartite ranking, where instances are labeled positive or negative and the goal is to learn a scoring function that minimizes the probability of mis-ranking a pair of positive and negative instances (or equivalently, that maximizes the area under the ROC curve), has been widely studied in recent years. A dominant theoretical and algorithmic framework for the problem has been to reduce bipartite ranking to pairwise classification; in particular, it is well known that the bipartite ranking regret can be formulated as a pairwise classification regret, which in turn can be upper bounded using usual regret bounds for classification problems. Recently, Kotlowski et al. (2011) showed regret bounds for bipartite ranking in terms of the regret associated with balanced versions of the standard (non-pairwise) logistic and exponential losses. In this paper, we show that such (non-pairwise) surrogate regret bounds for bipartite ranking can be obtained in terms of a broad class of proper (composite) losses that we term as strongly proper. Our proof technique is much simpler than that of Kotlowski et al. (2011), and relies on properties of proper (composite) losses as elucidated recently by Reid and Williamson (2010, 2011) and others. Our result yields explicit surrogate bounds (with no hidden balancing terms) in terms of a variety of strongly proper losses, including for example logistic, exponential, squared and squared hinge losses as special cases. An important consequence is that standard algorithms minimizing a (non-pairwise) strongly proper loss, such as logistic regression and boosting algorithms (assuming a universal function class and appropriate regularization), are in fact consistent for bipartite ranking; moreover, our results allow us to quantify the bipartite ranking regret in terms of the corresponding surrogate regret. We also obtain tighter surrogate bounds under certain low-noise conditions via a recent result of Clemencon and Robbiano (2011).
Resumo:
Designing a robust algorithm for visual object tracking has been a challenging task since many years. There are trackers in the literature that are reasonably accurate for many tracking scenarios but most of them are computationally expensive. This narrows down their applicability as many tracking applications demand real time response. In this paper, we present a tracker based on random ferns. Tracking is posed as a classification problem and classification is done using ferns. We used ferns as they rely on binary features and are extremely fast at both training and classification as compared to other classification algorithms. Our experiments show that the proposed tracker performs well on some of the most challenging tracking datasets and executes much faster than one of the state-of-the-art trackers, without much difference in tracking accuracy.
Resumo:
Transmission loss (TL) of a simple expansion chamber (SEC) consists of periodic domes with sharp troughs. This limits practical application of the SEC in the variable-speed automobile exhaust systems. Three-fourths of the troughs of the SEC can be lifted by appropriate tuning of the extended inlet/outlet lengths. However, such mufflers suffer from high back pressure and generation of aerodynamic noise due to free shear layers at the area discontinuities. Therefore, a perforate bridge is made between the extended inlet and outlet. It is shown that the TL curve of a concentric tube resonator (CTR) can also be lifted in a similar way by proper tuning of the extended unperforated lengths. Differential lengths have to be used to correct the inlet/outlet lengths in order to account for the perforate inertance. The resonance peak frequencies calculated by means of the 1-D analysis are compared with those of the 3-D FEM, and appropriate differential lengths are calculated. It is shown how different geometric characteristics of the muffler and mean flow affect the differential lengths. A general correlation is obtained for the differential lengths by considering seven relevant geometric and environmental parameters in a comprehensive parametric study. The resulting expressions would help in design of extended-tube CTR for wide-band TL. (C) 2014 Institute of Noise Control Engineering.
Resumo:
Clock synchronization in wireless sensor networks (WSNs) assures that sensor nodes have the same reference clock time. This is necessary not only for various WSN applications but also for many system level protocols for WSNs such as MAC protocols, and protocols for sleep scheduling of sensor nodes. Clock value of a node at a particular instant of time depends on its initial value and the frequency of the crystal oscillator used in the sensor node. The frequency of the crystal oscillator varies from node to node, and may also change over time depending upon many factors like temperature, humidity, etc. As a result, clock values of different sensor nodes diverge from each other and also from the real time clock, and hence, there is a requirement for clock synchronization in WSNs. Consequently, many clock synchronization protocols for WSNs have been proposed in the recent past. These protocols differ from each other considerably, and so, there is a need to understand them using a common platform. Towards this goal, this survey paper categorizes the features of clock synchronization protocols for WSNs into three types, viz, structural features, technical features, and global objective features. Each of these categories has different options to further segregate the features for better understanding. The features of clock synchronization protocols that have been used in this survey include all the features which have been used in existing surveys as well as new features such as how the clock value is propagated, when the clock value is propagated, and when the physical clock is updated, which are required for better understanding of the clock synchronization protocols in WSNs in a systematic way. This paper also gives a brief description of a few basic clock synchronization protocols for WSNs, and shows how these protocols fit into the above classification criteria. In addition, the recent clock synchronization protocols for WSNs, which are based on the above basic clock synchronization protocols, are also given alongside the corresponding basic clock synchronization protocols. Indeed, the proposed model for characterizing the clock synchronization protocols in WSNs can be used not only for analyzing the existing protocols but also for designing new clock synchronization protocols. (C) 2014 Elsevier B.V. All rights reserved.
Resumo:
Multiwall carbon nanotubes (MWNTs) were anchored onto graphene oxide sheets (GOs) via diazonium and C-C coupling reactions and characterized by spectroscopic and electron microscopic techniques. The thus synthesized MWNT-GO hybrid was then melt mixed with 50/50 polyamide6-maleic anhydride-modified acrylonitrile-butadiene-styrene (PA6-mABS) blend to design materials with high dielectric constant (30) and low dielectric loss. The phase morphology was studied by SEM and it was observed that the MWNT-GO hybrid was selectively localized in the PA6 phase of the blend. The 30 scales with the concentration of MWNT-GO in the blends, which interestingly showed a very low dielectric loss (< 0.2) making them potential candidate for capacitors. In addition, the dynamic storage modulus scales with the fraction of MWNT-GO in the blends, demonstrating their reinforcing capability as well.
Resumo:
Ser/Thr and Tyr protein kinases orchestrate many signalling pathways and hence loss in this balance leads to many disease phenotypes. Due to their high abundance, diversity and importance, efforts have been made in the past to classify kinases and annotate their functions at both gross and fine levels. These kinases are conventionally classified into subfamilies based on the sequences of catalytic domains. Usually the domain architecture of a full-length kinase is consistent with the subfamily classification made based on the sequence of kinase domain. Important contributions of modular domains to the overall function of the kinase are well known. Recently occurrence of two kinds of outlier kinases-''Hybrid'' and ``Rogue'' has been reported. These show considerable deviations in their domain architectures from the typical domain architecture known for the classical kinase subfamilies. This article provides an overview of the different subfamilies of human kinases and the role of non-kinase domains in functions and diseases. Importantly this article provides analysis of hybrid and rogue kinases encoded in the human genome and highlights their conservation in closely related primate species. These kinases are examples of elegant rewiring to bring about subtle functional differences compared to canonical variants.
Resumo:
Understanding technology evolution through periodic landscaping is an important stage of strategic planning in R&D Management. In fields like that of healthcare, where the initial R&D investment is huge and good medical product serve patients better, these activities become crucial. Approximately five percentage of the world population has hearing disabilities. Current hearing aid products meet less than ten percent of the global needs. Patent data and classifications on cochlear implants from 1977-2010, show the landscapes and evolution in the area of such implant. We attempt to highlight emergence and disappearance of patent classes over period of time showing variations in cochlear implant technologies. A network analysis technique is used to explore and capture technology evolution in patent classes showing what emerged or disappeared over time. Dominant classes are identified. The sporadic influence of university research in cochlear implants is also discussed.