Query: Learning to Rank Non-Factoid Answers: Comment Selection in Web Forums

Relevant passages:
A Convolutional Neural Network for Modelling Sentences <=SEP=> The ability to accurately represent sentences is central to language understanding. We describe a convolutional architecture dubbed the Dynamic Convolutional Neural Network (DCNN) that we adopt for the semantic modelling of sentences. The network uses Dynamic k-Max Pooling, a global pooling operation over linear sequences. The network handles input sentences of varying length and induces a feature graph over the sentence that is capable of explicitly capturing short and long-range relations. The network does not rely on a parse tree and is easily applicable to any language. We test the DCNN in four experiments: small scale binary and multi-class sentiment prediction, six-way question classification and Twitter sentiment prediction by distant supervision. The network achieves excellent performance in the first three tasks and a greater than 25% error reduction in the last task with respect to the strongest baseline.

Convolutional Neural Network Architectures for Matching Natural Language Sentences <=SEP=> Semantic matching is of central importance to many natural language tasks [2, 28]. A successful matching algorithm needs to adequately model the internal structures of language objects and the interaction between them. As a step toward this goal, we propose convolutional neural network models for matching two sentences, by adapting the convolutional strategy in vision and speech. The proposed models not only nicely represent the hierarchical structures of sentences with their layerby-layer composition and pooling, but also capture the rich matching patterns at different levels. Our models are rather generic, requiring no prior knowledge on language, and can hence be applied to matching tasks of different nature and in different languages. The empirical study on a variety of matching tasks demonstrates the efficacy of the proposed model on a variety of matching tasks and its superiority to competitor models.

Long Short-Term Memory <=SEP=> Learning to store information over extended time intervals by recurrent backpropagation takes a very long time, mostly because of insufficient, decaying error backflow. We briefly review Hochreiter's (1991) analysis of this problem, then address it by introducing a novel, efficient, gradient based method called long short-term memory (LSTM). Truncating the gradient where this does not do harm, LSTM can learn to bridge minimal time lags in excess of 1000 discrete-time steps by enforcing constant error flow through constant error carousels within special units. Multiplicative gate units learn to open and close access to the constant error flow. LSTM is local in space and time; its computational complexity per time step and weight is O. 1. Our experiments with artificial data involve local, distributed, real-valued, and noisy pattern representations. In comparisons with real-time recurrent learning, back propagation through time, recurrent cascade correlation, Elman nets, and neural sequence chunking, LSTM leads to many more successful runs, and learns much faster. LSTM also solves complex, artificial long-time-lag tasks that have never been solved by previous recurrent network algorithms.

Convolutional Neural Networks for Sentence Classification <=SEP=> We report on a series of experiments with convolutional neural networks (CNN) trained on top of pre-trained word vectors for sentence-level classification tasks. We show that a simple CNN with little hyperparameter tuning and static vectors achieves excellent results on multiple benchmarks. Learning task-specific vectors through fine-tuning offers further gains in performance. We additionally propose a simple modification to the architecture to allow for the use of both task-specific and static vectors. The CNN models discussed herein improve upon the state of the art on 4 out of 7 tasks, which include sentiment analysis and question classification.

Convolutional Neural Networks vs. Convolution Kernels: Feature Engineering for Answer Sentence Reranking <=SEP=> In this paper, we study, compare and combine two state-of-the-art approaches to automatic feature engineering: Convolution Tree Kernels (CTKs) and Convolutional Neural Networks (CNNs) for learning to rank answer sentences in a Question Answering (QA) setting. When dealing with QA, the key aspect is to encode relational information between the constituents of question and answer in learning algorithms. For this purpose, we propose novel CNNs using relational information and combined them with relational CTKs. The results show that (i) both approaches achieve the state of the art on a question answering task, where CTKs produce higher accuracy and (ii) combining such methods leads to unprecedented high results.

Electronic textiles: a platform for pervasive computing <=SEP=> In our era of converging technologies, it is significant that the second Industrial Revolution should meet the first on common ground: textiles. Modern data processing is, after all, an offshoot of technology first introduced in the 18th century to automate the production of woven textiles. The punched-card system developed by J.-M. Jacquard in 1804 to regulate the weaving of patterned fabrics was later adapted by the English inventor C. Babbage for his proposed analytical engine, the precursor of all binary-based digital computers. Now researchers are delving into a new technology that literally weaves a computing platform into wearable fabrics, creating electronic textiles, or e-textiles, that offer the wearer ready access to information anytime, anywhere, through the medium of an unobtrusive interface. This new field of research draws together an interdisciplinary cadre of specialists in information technology, computing and communications, microtechnology, textiles, and application domains. Their objective is to develop an economical process for the manufacture of large-area, flexible, conformable information systems that can be used in such diverse areas as medicine, sports, space research, firefighting, and law enforcement. In this paper, the authors explore the synergies accruing from wedding the capabilities of textiles with those of computing. In addition to the twin dimensions of functionality and aesthetics, clothing can now be woven to accommodate a third dimension: intelligence. Clothing, the authors point out, meets the user’s requirements for interactivity, connectivity, individuality, and adaptability. It is also probably the most universal of human–computer interfaces: it is familiar; it can be tailored to individual sizes, tastes, and budgets; and it is adaptable to varying climatic conditions. Textiles also provide the ultimate flexibility in systems design by offering a broad range of fibers, yarns, fabrics, and manufacturing techniques. Fabrics also have the spatial capacity needed for hosting the large numbers of sensors and processors demanded for covering broad terrains, such as a battlefield. The size of clothing further enables designers the latitude to build in redundant systems to ensure fault tolerance.

4G- A NEW ERA IN WIRELESS TELECOMMUNICATION <=SEP=> 4G – “connect anytime, anywhere, anyhow” promising ubiquitous network access at high speed to the end users, has been a topic of great interest especially for the wireless telecom industry. 4G seems to be the solution for the growing user requirements of wireless broadband access and the limitations of the existing wireless communication system. The purpose of this paper is to provide an overview of the different aspects of 4G which includes its features, its proposed architecture and key technological enablers. It also elaborates on the roadblocks in its implementations. A special consideration has been given to the security concerns of 4G by discussing a security threat analysis model proposed by International Telecommunication Union (ITU). By applying this model, a detailed analysis of threats to 4G and the corresponding measures to counter them can be performed.

Synchromesh Torque Estimation in an Electric Vehicle's Clutchless Automated Manual Transmission Using Unknown Input Observer <=SEP=> This paper studies the estimation of the frictional torque of the synchromesh during the gear shifting operation in an electric vehicle equipped with a clutchless automated manual transmission (AMT). The clutchless drivetrain of the electric vehicle is discussed and the dynamical model of the powertrain from the electric traction motor to the synchromesh system of a two-speed AMT is developed. In order to estimate the frictional torque of the synchromesh, which is indeed an unknown input to the dynamical system, it is assumed to be generated by a fictitious autonomous system. Thereafter, the augmented state- space representation of the actual and fictitious state variables, which forms the basis for the observer design, is provided and the observability of this augmented system is discussed. A deterministic Luenberger observer and a stochastic Kalman-Bucy filter are designed in order to estimate the frictional torque of the synchromesh. The estimation is based on the measuring angular velocities of the electric motor and synchro ring together with the known electromagnetic torque of the traction motor. The performance of the observers is assessed experimentally by means of a test rig. The results demonstrate the satisfactory performance of the stochastic observer when the system encounters process and measurement noise which are likely to happen in practice.

Automatic Cloud I/O Configurator for I/O Intensive Parallel Applications <=SEP=> As the cloud platform becomes a promising alternative to traditional HPC (high performance computing) centers or in-house clusters, the I/O bottleneck problem is highlighted in this new environment, typically with top-of-the-line compute instances but sub-par communication and I/O facilities. It has been observed that changing the cloud I/O system configurations, such as choices of file systems, number of I/O servers and their placement strategies, etc., will lead to a considerable variation in the performance and cost efficiency of I/O intensive parallel applications. However, storage system configuration is tedious and error-prone to do manually, even for expert users, leading to solutions that are grossly over-provisioned (low cost inefficiency), substantially under-performing (poor performance) or, in the worst case, both. This paper proposes ACIC, a system which automatically searches for optimized I/O system configurations from many candidates for each individual application running on a given cloud platform. ACIC takes advantage of machine learning models to perform performance/cost predictions. To tackle the high-dimensional parameter exploration space, we enable affordable, reusable, and incremental training on cloud platforms, guided by the Plackett and Burman Matrices for experiment design. Our evaluation results with four representative parallel applications indicate that ACIC consistently identifies optimal or near-optimal configurations among a large group of candidate settings. The top ACIC-recommended configuration is capable of improving the applications' performance by a factor of up to 10.5 (3.1 on average), and cost saving of up to 89 percent (51 percent on average), compared with a commonly used baseline I/O configuration. In addition, we carried out a small-scale user study for one of the test applications, which found that ACIC consistently beat the user and even the application's developer, often by a significant margin, in selecting optimized configurations.

Evolutionary algorithm in Forex trade strategy generation <=SEP=> This paper shows an evolutionary algorithm application to generate profitable strategies to trade futures contracts on foreign exchange market (Forex). Strategy model in approach is based on two decision trees, responsible for taking the decisions of opening long or short positions on Euro/US Dollar currency pair. Trees take into consideration only technical analysis indicators, which are connected by logic operators to identify border values of these indicators for taking profitable decision(s). We have tested the efficiency of presented approach on learning and test time-frames of various characteristics.

Enhanced 3GPP system for Machine Type Communications and Internet of Things <=SEP=> The Third Generation Partnership Project (3GPP) has been working on developing specifications on Machine Type Communications (MTC), also known as Machine to Machine Communications (M2M), which is all part of Internet of Things (IoT), a technology that enables machines and devices to be inter-connected via the internet. This paper presents recent M2M/IoT feature enhancements in 3GPP. These features include architectural enhancements for inclusion of a service exposure framework, group based IoT management, efficient monitoring mechanisms for IoT devices, optimization of IoT device power consumption, and high latency communications. These M2M/IoT related functionalities and enhancements are a continuing effort within 3GPP to make the mobile network fulfil the ever changing M2M/IoT requirements, and in so doing allow operators/service providers to offer unique services.

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators <=SEP=> This paper shows, by means of an operator called a splitting operator, that the Douglas-Rachford splitting method for finding a zero of the sum of two monotone operators is a special case of the proximal point algorithm, Therefore, applications of Douglas -Rachford splitting, such as the alternating direction method of multipliers for convex programming decomposit ion, are also special cases of the proximal point algorithm. This observation allows the unification and generalization of a variety of convex programming algorithms. By introducing a modified version of the proximal point algorithm, we derive a new, generalized alternating direction method of multipliers for convex programming. Advances of this sort illustrate the power and generality gained by adopting monotone operator theory as a conceptual framework.

Mikro Bloglardaki Finans Toplulukları için Kullanıcı Ağırlıklandırılmış Duygu Analizi Yöntemi <=SEP=> Nowadays, sentiment analysis is a popular research area in computer science. which aims to determine a person’s or a group’s mood, behaviour and opinion about any topic with using textual documents. With the proliferation of social micro-blogging sites, digital opinion text data is increased. Thus, many sentiment analysis researches are performed on these public data in different sociological fields, such as finance, economy and politics. In this paper, a novel sentiment analysis method is proposed on micro-blogging sites which uses new user metrics. Proposed method is used to measure financial community’s sentiment polarity on micro-blogging sites. In addition to that we analyze the correlation between the mood of financial community and the behavior of the Borsa Istanbul 100 index weekly by Pearson correlation coefficient method. Our test results show that this novel sentiment analysis method improves to the accuracy of linear relationship between the behavior of the stock market and the sentiment polarity of the financial community.

Testing predictions from personality neuroscience. Brain structure and the big five. <=SEP=> We used a new theory of the biological basis of the Big Five personality traits to generate hypotheses about the association of each trait with the volume of different brain regions. Controlling for age, sex, and whole-brain volume, results from structural magnetic resonance imaging of 116 healthy adults supported our hypotheses for four of the five traits: Extraversion, Neuroticism, Agreeableness, and Conscientiousness. Extraversion covaried with volume of medial orbitofrontal cortex, a brain region involved in processing reward information. Neuroticism covaried with volume of brain regions associated with threat, punishment, and negative affect. Agreeableness covaried with volume in regions that process information about the intentions and mental states of other individuals. Conscientiousness covaried with volume in lateral prefrontal cortex, a region involved in planning and the voluntary control of behavior. These findings support our biologically based, explanatory model of the Big Five and demonstrate the potential of personality neuroscience (i.e., the systematic study of individual differences in personality using neuroscience methods) as a discipline.

Hand Gesture Recognition for Real Time Human Machine Interaction System <=SEP=> Real Time Human-machine Interaction system using hand gesture Recognition to handle the mouse event , media player , image viewer .Users have to repeat same mouse and keyboard actions, inducing waste of time. Gestures have long been considered as an interaction technique that can potentially deliver more natural. A fast gesture recognition scheme is proposed to be an interface for the human-machine interaction (HMI) of systems. The system presents some lowcomplexity algorithms and gestures to reduce the gesture recognition complexity and be more suitable for controlling real-time computer systems. In this paper we use the webcam for capturing the image. After capturing the image it converts into the binary image. A gesture is a specific combination of hand position.

Solution aversion: On the relation between ideology and motivated disbelief. <=SEP=> There is often a curious distinction between what the scientific community and the general population believe to be true of dire scientific issues, and this skepticism tends to vary markedly across groups. For instance, in the case of climate change, Republicans (conservatives) are especially skeptical of the relevant science, particularly when they are compared with Democrats (liberals). What causes such radical group differences? We suggest, as have previous accounts, that this phenomenon is often motivated. However, the source of this motivation is not necessarily an aversion to the problem, per se, but an aversion to the solutions associated with the problem. This difference in underlying process holds important implications for understanding, predicting, and influencing motivated skepticism. In 4 studies, we tested this solution aversion explanation for why people are often so divided over evidence and why this divide often occurs so saliently across political party lines. Studies 1, 2, and 3-using correlational and experimental methodologies-demonstrated that Republicans' increased skepticism toward environmental sciences may be partly attributable to a conflict between specific ideological values and the most popularly discussed environmental solutions. Study 4 found that, in a different domain (crime), those holding a more liberal ideology (support for gun control) also show skepticism motivated by solution aversion.

Lava: Hardware Design in Haskell <=SEP=> Lava is a tool to assist circuit designers in specifying, designing, verifying and implementing hardware. It is a collection of Haskell modules. The system design exploits functional programming language features, such as monads and type classes, to provide multiple interpretations of circuit descriptions. These interpretations implement standard circuit analyses such as simulation, formal verification and the generation of code for the production of real circuits.Lava also uses polymorphism and higher order functions to provide more abstract and general descriptions than are possible in traditional hardware description languages. Two Fast Fourier Transform circuit examples illustrate this.

Locality preserving indexing for document representation <=SEP=> Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Indexing (LSI) is considered effective in deriving such an indexing. LSI essentially detects the most representative features for document representation rather than the most discriminative features. Therefore, LSI might not be optimal in discriminating documents with different semantics. In this paper, a novel algorithm called Locality Preserving Indexing (LPI) is proposed for document indexing. Each document is represented by a vector with low dimensionality. In contrast to LSI which discovers the global structure of the document space, LPI discovers the local structure and obtains a compact document representation subspace that best detects the essential semantic structure. We compare the proposed LPI approach with LSI on two standard databases. Experimental results show that LPI provides better representation in the sense of semantic structure.

Dear Sir or Madam, May I Introduce the GYAFC Dataset: Corpus, Benchmarks and Metrics for Formality Style Transfer <=SEP=> Style transfer is the task of automatically transforming a piece of text in one particular style into another. A major barrier to progress in this field has been a lack of training and evaluation datasets, as well as benchmarks and automatic metrics. In this work, we create the largest corpus for a particular stylistic transfer (formality) and show that techniques from the machine translation community can serve as strong baselines for future work. We also discuss challenges of using automatic metrics.

A Deep Policy Inference Q-Network for Multi-Agent Systems <=SEP=> We present DPIQN, a deep policy inference Q-network that targets multi-agent systems composed of controllable agents, collaborators, and opponents that interact with each other. We focus on one challenging issue in such systems—modeling agents with varying strategies—and propose to employ “policy features” learned from raw observations (e.g., raw images) of collaborators and opponents by inferring their policies. DPIQN incorporates the learned policy features as a hidden vector into its own deep Q-network (DQN), such that it is able to predict better Q values for the controllable agents than the state-of-the-art deep reinforcement learningmodels. We further propose an enhanced version of DPIQN, called deep recurrent policy inference Q-network (DRPIQN), for handling partial observability. Both DPIQN and DRPIQN are trained by an adaptive training procedure, which adjusts the network’s attention to learn the policy features and its own Q-values at different phases of the training process. We present a comprehensive analysis of DPIQN and DRPIQN, and highlight their effectiveness and generalizability in various multi-agent settings. Our models are evaluated in a classic soccer game involving both competitive and collaborative scenarios. Experimental results performed on 1 vs. 1 and 2 vs. 2 games show that DPIQN and DRPIQN demonstrate superior performance to the baseline DQN and deep recurrent Q-network (DRQN) models. We also explore scenarios in which collaborators or opponents dynamically change their policies, and show that DPIQN and DRPIQN do lead to better overall performance in terms of stability and mean scores.

Scalable Modified Kneser-Ney Language Model Estimation <=SEP=> We present an efficient algorithm to estimate large modified Kneser-Ney models including interpolation. Streaming and sorting enables the algorithm to scale to much larger models by using a fixed amount of RAM and variable amount of disk. Using one machine with 140 GB RAM for 2.8 days, we built an unpruned model on 126 billion tokens. Machine translation experiments with this model show improvement of 0.8 BLEU point over constrained systems for the 2013 Workshop on Machine Translation task in three language pairs. Our algorithm is also faster for small models: we estimated a model on 302 million tokens using 7.7% of the RAM and 14.0% of the wall time taken by SRILM. The code is open source as part of KenLM.

ExpNet: Landmark-Free, Deep, 3D Facial Expressions <=SEP=> We describe a deep learning based method for estimating 3D facial expression coefficients. Unlike previous work, our process does not relay on facial landmark detection methods as a proxy step. Recent methods have shown that a CNN can be trained to regress accurate and discriminative 3D morphable model (3DMM) representations, directly from image intensities. By foregoing landmark detection, these methods were able to estimate shapes for occluded faces appearing in unprecedented viewing conditions. We build on those methods by showing that facial expressions can also be estimated by a robust, deep, landmark-free approach. Our ExpNet CNN is applied directly to the intensities of a face image and regresses a 29D vector of 3D expression coefficients. We propose a unique method for collecting data to train our network, leveraging on the robustness of deep networks to training label noise. We further offer a novel means of evaluating the accuracy of estimated expression coefficients: by measuring how well they capture facial emotions on the CK+ and EmotiW-17 emotion recognition benchmarks. We show that our ExpNet produces expression coefficients which better discriminate between facial emotions than those obtained using state of the art, facial landmark detectors. Moreover, this advantage grows as image scales drop, demonstrating that our ExpNet is more robust to scale changes than landmark detectors. Finally, our ExpNet is orders of magnitude faster than its alternatives.

A dual-band bagley power divider using modified Π-network <=SEP=> A new methodology to design a dual-band 3-way Bagley power divider is presented. The general method of using π-network as well as the proposed modified π-network has been discussed. The proposed π-network mimics a λ/2 line at two different frequencies. Design equations in closed form are obtained by using transmission line concepts and simple network analysis techniques. The proposed design is validated using Agilent ADS. This modification also leads to wider bandwidth as observed by a careful simulation.

Neural Darwinism and consciousness <=SEP=> Neural Darwinism (ND) is a large scale selectionist theory of brain development and function that has been hypothesized to relate to consciousness. According to ND, consciousness is entailed by reentrant interactions among neuronal populations in the thalamocortical system (the 'dynamic core'). These interactions, which permit high-order discriminations among possible core states, confer selective advantages on organisms possessing them by linking current perceptual events to a past history of value-dependent learning. Here, we assess the consistency of ND with 16 widely recognized properties of consciousness, both physiological (for example, consciousness is associated with widespread, relatively fast, low amplitude interactions in the thalamocortical system), and phenomenal (for example, consciousness involves the existence of a private flow of events available only to the experiencing subject). While no theory accounts fully for all of these properties at present, we find that ND and its recent extensions fare well.

Self-organizing semantic maps <=SEP=> Self-organized formation of topographic maps for abstract data, such as words, is demonstrated in this work. The semantic relationships in the data are reflected by their relative distances in the map. Two different simulations, both based on a neural network model that implements the algorithm of the selforganizing feature maps, are given. For both, an essential, new ingredient is the inclusion of the contexts, in which each symbol appears, into the input data. This enables the network to detect the “logical similarity” between words from the statistics of their contexts. In the first demonstration, the context simply consists of a set of attribute values that occur in conjunction with the words. In the second demonstration, the context is defined by the sequences in which the words occur, without consideration of any associated attributes. Simple verbal statements consisting of nouns, verbs, and adverbs have been analyzed in this way. Such phrases or clauses involve some of the abstractions that appear in thinking, namely, the most common categories, into which the words are then automatically grouped in both of our simulations. We also argue that a similar process may be at work in the brain.

Multi-View Unsupervised Feature Selection with Adaptive Similarity and View Weight <=SEP=> With the advent of multi-view data, multi-view learning has become an important research direction in both machine learning and data mining. Considering the difficulty of obtaining labeled data in many real applications, we focus on the multi-view unsupervised feature selection problem. Traditional approaches all characterize the similarity by fixed and pre-defined graph Laplacian in each view separately and ignore the underlying common structures across different views. In this paper, we propose an algorithm named Multi-view Unsupervised Feature Selection with Adaptive Similarity and View Weight (ASVW) to overcome the above mentioned problems. Specifically, by leveraging the learning mechanism to characterize the common structures adaptively, we formulate the objective function by a common graph Laplacian across different views, together with the sparse <inline-formula><tex-math notation="LaTeX">$\ell _{2,p}$</tex-math> <alternatives><inline-graphic xlink:href="hou-ieq1-2681670.gif"/></alternatives></inline-formula>-norm constraint designed for feature selection. We develop an efficient algorithm to address the non-smooth minimization problem and prove that the algorithm will converge. To validate the effectiveness of ASVW, comparisons are made with some benchmark methods on real-world datasets. We also evaluate our method in the real sports action recognition task. The experimental results demonstrate the effectiveness of our proposed algorithm.

Evolution of Trajectories: A Novel Representation for Deep Action Recognition <=SEP=> Achieving high classification accuracy remains a challenge for human action recognition approaches that are based on convolutional neural networks (CNN). CNN-based action recognition methods on resource-constrained edge systems are currently unable to train on whole videos due to infeasible computational and memory requirements. On the other hand, approaches that utilize video-level supervision with sparse-sampling designs run the risk of learning local features shared with multiple similar classes. Additionally, features captured by motion estimation algorithms for temporal stream CNN's are already reduced in dimension, increasing the possibility of label mismatch in methods that rely on short-term features. To address the aforementioned points, we design a novel temporal representation to capture a 1) long-term interval of motion and 2) integrate the trajectory of motion captured therein. We compare our approach with current motion representations and demonstrate its efficacy for examples containing local features with high inter-class similarity. We implement our representation as part of two and three-stream CNN's and conduct experiments on one of the popular and most difficult action recognition datasets: HMDB51. Our results show that, for methods employing sparse-sampling designs, our approach surpasses the current state-of-the-art approaches achieving 71.76% on HMDB51.

BranchScope: A New Side-Channel Attack on Directional Branch Predictor <=SEP=> We present BranchScope - a new side-channel attack where the attacker infers the direction of an arbitrary conditional branch instruction in a victim program by manipulating the shared directional branch predictor. The directional component of the branch predictor stores the prediction on a given branch (taken or not-taken) and is a different component from the branch target buffer (BTB) attacked by previous work. BranchScope is the first fine-grained attack on the directional branch predictor, expanding our understanding of the side channel vulnerability of the branch prediction unit. Our attack targets complex hybrid branch predictors with unknown organization. We demonstrate how an attacker can force these predictors to switch to a simple 1-level mode to simplify the direction recovery. We carry out BranchScope on several recent Intel CPUs and also demonstrate the attack against an SGX enclave.

How GaN Power Transistors Drive High-Performance Lidar: Generating ultrafast pulsed power with GaN FETs <=SEP=> Light detection and ranging (lidar) is a versatile light-based remote sensing technology that recently has been the subject of great attention. It has shown up in a number of media venues and has even led to public debate about the engineering choices of a well-known electric car company, Tesla Motors [1]. While this article is not going to enter the fray, it will provide some background on lidar and discuss its strong connection to power electronics technologies.

Color Transform Based Approach for Disease Spot Detection on Plant Leaf <=SEP=> In this research, an algorithm for disease spot segmentation using image processing techniques in plant leaf is implemented. This is the first and important phase for automatic detection and classification of plant diseases. Disease spots are different in color but not in intensity, in comparison with plant leaf color. So we color transform of RGB image can be used for better segmentation of disease spots. In this paper a comparison of the effect of CIELAB, HSI and YCbCr color space in the process of disease spot detection is done. Median filter is used for image smoothing. Finally threshold can be calculated by applying Otsu method on color component to detect the disease spot. An algorithm which is independent of background noise, plant type and disease spot color was developed and experiments were carried out on different “Monocot” and “Dicot” family plant leaves with both, noise free (white) and noisy background.