57 resultados para online cultures
em Indian Institute of Science - Bangalore - Índia
Resumo:
This paper presents a new approach for assessing power system voltage stability based on artificial feed forward neural network (FFNN). The approach uses real and reactive power, as well as voltage vectors for generators and load buses to train the neural net (NN). The input properties of the NN are generated from offline training data with various simulated loading conditions using a conventional voltage stability algorithm based on the L-index. The performance of the trained NN is investigated on two systems under various voltage stability assessment conditions. Main advantage is that the proposed approach is fast, robust, accurate and can be used online for predicting the L-indices of all the power system buses simultaneously. The method can also be effectively used to determining local and global stability margin for further improvement measures.
Resumo:
Embryogenesis has been induced from endosperm callus cultures of sandalwood (Santalum album L.). Viable plantlets developed from the embryoids on subculture to White's basal medium supplemented with 0.5 mg/l of indole acetic acid. Chromosomal analysis of the root tips showed the triploid number 3n = 30.
Resumo:
A high level of extracellular beta-lactamase activity was detected in cultures ofMycobacterium smegmatis SN2. The extracellular distribution of the enzyme varied with growth conditions such as additional carbon source and pH of the medium. Addition of chloramphenicol tothe culture inhibited the increase in the extracellular beta-lactamase activity. Cell wall damage or autolysis may be responsible for the extracellular beta-lactamase activity.
Resumo:
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engagement is minimised using differential evolution. The difficulty of solving it by existing conventional techniques in optimal control theory is caused by the nonlinearity of the dynamic constraint equation, inequality constraint on the control input and inequality constraint on another parameter that enters problem indirectly. The optimal control problem of finding the minimum miss distance has an analytical solution subject to several simplifying assumptions. In the approach proposed in this paper, the initial population is generated around the seed value given by this analytical solution. Thereafter, the algorithm progresses to an acceptable final solution within a few generations, satisfying the constraints at every iteration. Since this solution or the control input has to be obtained in real time to be of any use in practice, the feasibility of online implementation is also illustrated.
Resumo:
This paper suggests a scheme for classifying online handwritten characters, based on dynamic space warping of strokes within the characters. A method for segmenting components into strokes using velocity profiles is proposed. Each stroke is a simple arbitrary shape and is encoded using three attributes. Correspondence between various strokes is established using Dynamic Space Warping. A distance measure which reliably differentiates between two corresponding simple shapes (strokes) has been formulated thus obtaining a perceptual distance measure between any two characters. Tests indicate an accuracy of over 85% on two different datasets of characters.
Resumo:
Suspension cultures of Catharanthus roseus were used to evaluate ultraviolet-B (UV-B) treatment as an abiotic elicitor of secondary metabolites. A dispersed cell suspension culture from C. roseus leaves in late exponential phase and stationary phase were irradiated with UV-B for 5 min. The stationary phase cultures were more responsive to UV-B irradiation than late exponential phase cultures. Catharanthine and vindoline increased 3-fold and 12-fold, respectively, on treatment with a 5-min UV-B irradiation.
Resumo:
We propose a novel, language-neutral approach for searching online handwritten text using Frechet distance. Online handwritten data, which is available as a time series (x,y,t), is treated as representing a parameterized curve in two-dimensions and the problem of searching online handwritten text is posed as a problem of matching two curves in a two-dimensional Euclidean space. Frechet distance is a natural measure for matching curves. The main contribution of this paper is the formulation of a variant of Frechet distance that can be used for retrieving words even when only a prefix of the word is given as query. Extensive experiments on UNIPEN dataset(1) consisting of over 16,000 words written by 7 users show that our method outperforms the state-of-the-art DTW method. Experiments were also conducted on a Multilingual dataset, generated on a PDA, with encouraging results. Our approach can be used to implement useful, exciting features like auto-completion of handwriting in PDAs.
Resumo:
Mycobacterium smegmatis is known to form biofilms and many cell surface molecules like core glycopeptidolipids and short-chain mycolates appear to play important role in the process. However, the involvement of the cell surface molecules in mycobacteria towards complete maturation of biofilms is still not clear. This work demonstrates the importance of the glycopeptidolipid species with hydroxylated alkyl chain and the epoxylated mycolic acids, during the process of biofilm development. In our previous study, we reported the impairment of biofilm formation in rpoZ-deleted M. smegmatis, where rpoZ codes for the ω subunit of RNA polymerase (R. Mathew, R. Mukherjee, R. Balachandar, D. Chatterji, Microbiology 152 (2006) 1741). Here we report the occurrence of planktonic growth in a mc2155 strain which is devoid of rpoZ gene. This strain is deficient in selective incorporation of the hydroxylated glycopeptidolipids and the epoxy mycolates to their respective locations in the cell wall. Hence it forms a mutant biofilm defective in maturation, wherein the cells undertake various alternative metabolic pathways to survive in an environment where oxygen, the terminal electron acceptor, is limiting.
Resumo:
In this paper, we describe a system for the automatic recognition of isolated handwritten Devanagari characters obtained by linearizing consonant conjuncts. Owing to the large number of characters and resulting demands on data acquisition, we use structural recognition techniques to reduce some characters to others. The residual characters are then classified using the subspace method. Finally the results of structural recognition and feature-based matching are mapped to give final output. The proposed system Ifs evaluated for the writer dependent scenario.
Resumo:
This paper addresses the problem of resolving ambiguities in frequently confused online Tamil character pairs by employing script specific algorithms as a post classification step. Robust structural cues and temporal information of the preprocessed character are extensively utilized in the design of these algorithms. The methods are quite robust in automatically extracting the discriminative sub-strokes of confused characters for further analysis. Experimental validation on the IWFHR Database indicates error rates of less than 3 % for the confused characters. Thus, these post processing steps have a good potential to improve the performance of online Tamil handwritten character recognition.
Resumo:
In this paper, we study the performance of client-Access Point (AP) association policies in IEEE 802.11 based WLANs. In many scenarios, clients have a choice of APs with whom they can associate. We are interested in finding association policies which lead to optimal system performance. More specifically, we study the stability of different association policies as a function of the spatial distribution of arriving clients. We find for each policy the range of client arrival rates for which the system is stable. For small networks, we use Lyapunov function methods to formally establish the stability or instability of certain policies in specific scenarios. The RAT heuristic policy introduced in our prior work is shown to have very good stability properties when compared to several other natural policies. We also validate our analytical results by detailed simulation employing the IEEE 802.11 MAC.
Resumo:
In many IEEE 802.11 WLAN deployments, wireless clients have a choice of access points (AP) to connect to. In current systems, clients associate with the access point with the strongest signal to noise ratio. However, such an association mechanism can lead to unequal load sharing, resulting in diminished system performance. In this paper, we first provide a numerical approach based on stochastic dynamic programming to find the optimal client-AP association algorithm for a small topology consisting of two access points. Using the value iteration algorithm, we determine the optimal association rule for the two-AP topology. Next, utilizing the insights obtained from the optimal association ride for the two-AP case, we propose a near-optimal heuristic that we call RAT. We test the efficacy of RAT by considering more realistic arrival patterns and a larger topology. Our results show that RAT performs very well in these scenarios as well. Moreover, RAT lends itself to a fairly simple implementation.