Query: Autoencoders trained with relevant information: Blending Shannon and Wiener's perspectives

Relevant passages:
Mean Shift, Mode Seeking, and Clustering <=SEP=> Mean shift, a simple iterative procedure that shifts each data point to the average of data points in its neighborhood, is generalized and analyzed in this paper. This generalization makes some k-means like clustering algorithms its special cases. It is shown that mean shift is a mode-seeking process on a surface constructed with a “shadow” kernel. For Gaussian kernels, mean shift is a gradient mapping. Convergence is studied for mean shift iterations. Cluster analysis is treated as a deterministic problem of finding a fixed point of mean shift that characterizes the data. Applications in clustering and Hough transform are demonstrated. Mean shift is also considered as an evolutionary strategy that performs multistart global optimization.

Information Theoretic-Learning auto-encoder <=SEP=> We propose Information Theoretic-Learning (ITL) divergence measures for variational regularization of neural networks. We also explore ITL-regularized autoencoders as an alternative to variational autoencoding bayes, adversarial autoencoders and generative adversarial networks for randomly generating sample data without explicitly defining a paritition function. This paper also formalizes, generative moment matching networks under the ITL framework.

Adversarial Autoencoders <=SEP=> In this paper we propose a new method for regularizing autoencoders by imposing an arbitrary prior on the latent representation of the autoencoder. Our method, named “adversarial autoencoder”, uses the recently proposed generative adversarial networks (GAN) in order to match the aggregated posterior of the hidden code vector of the autoencoder with an arbitrary prior. Matching the aggregated posterior to the prior ensures that there are no “holes” in the prior, and generating from any part of prior space results in meaningful samples. As a result, the decoder of the adversarial autoencoder learns a deep generative model that maps the imposed prior to the data distribution. We show how adversarial autoencoders can be used to disentangle style and content of images and achieve competitive generative performance on MNIST, Street View House Numbers and Toronto Face datasets.

Autoencoders, Unsupervised Learning, and Deep Architectures <=SEP=> To better understand deep architectures and unsupervised learning, uncluttered by hardware details, we develop a general autoencoder framework for the comparative study of autoencoders, including Boolean autoencoders. We derive several results regarding autoencoders and autoencoder learning, including results on learning complexity, vertical and horizontal composition, and fundamental connections between critical points and clustering. Possible implications for the theory of deep architectures are discussed.

Information Theory, Inference, and Learning Algorithms <=SEP=> 

EPIC: Efficient Private Image Classification (or: Learning from the Masters) <=SEP=> Outsourcing an image classification task raises privacy concerns, both from the image provider’s perspective, who wishes to keep their images confidential, and from the classification algorithm provider’s perspective, who wishes to protect the intellectual property of their classifier. We propose EPIC, an efficient private image classification system based on support vector machine (SVM) learning, secure against malicious adversaries. EPIC builds upon transfer learning techniques known from the Machine Learning (ML) literature and minimizes the load on the privacy-preserving part. Our solution is based on Multiparty Computation (MPC), it is 34 times faster than Gazelle (USENIX’18) –the state-of-the-art in private image classification– and it improves the communication cost by 50 times, with a 7% higher accuracy on CIFAR-10 dataset. For the same accuracy as Gazelle achieves on CIFAR-10, EPIC is 700 times faster and the communication cost is reduced by 500 times.

Web-Based Ontology Languages and its Based Description Logics <=SEP=> The main object of semantic web languages is to add semantics to the existing information on the Web. These web languages have been developed to represent or express ontologies. Therefore, these description languages provide richer constructors for forming complex class expressions and axioms. An ontology is expressed in a knowledge representation language, which provides a formal frame of semantics. Since description logic is the basis of most ontology language, it is appropriate to explain briefly the base of the description to understand the ontology language clearly. The aim of this paper is to provide a brief survey of state-of-the-art ontology languages which are used to express ontology over the Web is provided. Also the gaol of this paper is to provide a basic understanding of ontologies and description logics, which are the basis of ontology languages.

Feature Mining for Localised Crowd Counting <=SEP=> This paper presents a multi-output regression model for crowd counting in public scenes. Existing counting by regression methods either learn a single model for global counting, or train a large number of separate regressors for localised density estimation. In contrast, our single regression model based approach is able to estimate people count in spatially localised regions and is more scalable without the need for training a large number of regressors proportional to the number of local regions. In particular, the proposed model automatically learns the functional mapping between interdependent low-level features and multi-dimensional structured outputs. The model is able to discover the inherent importance of different features for people counting at different spatial locations. Extensive evaluations on an existing crowd analysis benchmark dataset and a new more challenging dataset demonstrate the effectiveness of our approach.

Transformation of generalized chebyshev lowpass filter prototype to Suspended Stripline Structure highpass filter for wideband communication systems <=SEP=> This paper presents the transformation of generalized Chebyshev lowpass filter prototype to highpass filter using Suspended Stripline Structure (SSS) technology. The study involves circuit analysis to determine generalized Chebyshev responses with a transmission zero at finite frequency. The transformation of the highpass filter from the lowpass filter prototype provides a cutoff frequency of 3.1 GHz with a return loss better than -20 dB. The design is simulated on a Roger Duroid RO4350 with a dielectric constant, εr of 3.48 and a thickness of 0.168 mm. The simulation performance results show promising results that could be further examined during the experimental works. This class of generalized Chebyshev highpass filter with finite transmission zero would be useful in any RF/ microwave communication systems particularly in wideband applications where the reduction of overall physical volume and weight as well as cost very important, while maintaining its excellent performance.

Coupled IGMM-GANs for deep multimodal anomaly detection in human mobility data <=SEP=> Detecting anomalous activity in human mobility data has a number of applications including road hazard sensing, telematic based insurance, and fraud detection in taxi services and ride sharing. In this paper we address two challenges that arise in the study of anomalous human trajectories: 1) a lack of ground truth data on what defines an anomaly and 2) the dependence of existing methods on significant pre-processing and feature engineering. While generative adversarial networks seem like a natural fit for addressing these challenges, we find that existing GAN based anomaly detection algorithms perform poorly due to their inability to handle multimodal patterns. For this purpose we introduce an infinite Gaussian mixture model coupled with (bi-directional) generative adversarial networks, IGMM-GAN, that is able to generate synthetic, yet realistic, human mobility data and simultaneously facilitates multimodal anomaly detection. Through estimation of a generative probability density on the space of human trajectories, we are able to generate realistic synthetic datasets that can be used to benchmark existing anomaly detection methods. The estimated multimodal density also allows for a natural definition of outlier that we use for detecting anomalous trajectories. We illustrate our methodology and its improvement over existing GAN anomaly detection on several human mobility datasets, along with MNIST.

Lexical Analysis for the Webshell Attacks <=SEP=> In this paper, we proposed a design considering for web application firewall system. Anyway, the website managing, web technology and hacker technology are vastly different from each other, whilst hacker techs are keep on moving forward, while company and government MIS are difficult of updating their information to the latest state due to working, they are often not updated and followed to the latest stuffs. And moreover, these newest techs are in generally needed to be figured out whether it matches the compatibility of the old versions, such as the recent PHP 7, many MIS are not capable to update their software to handle the variants of WAF bypass methods.

An Italian Twitter Corpus of Hate Speech against Immigrants <=SEP=> The paper describes a recently-created Twitter corpus of about 6,000 tweets, annotated for hate speech against immigrants, and developed to be a reference dataset for an automatic system of hate speech monitoring. The annotation scheme was therefore specifically designed to account for the multiplicity of factors that can contribute to the definition of a hate speech notion, and to offer a broader tagset capable of better representing all those factors, which may increase, or rather mitigate, the impact of the message. This resulted in a scheme that includes, besides hate speech, the following categories: aggressiveness, offensiveness, irony, stereotype, and (on an experimental basis) intensity. The paper hereby presented namely focuses on how this annotation scheme was designed and applied to the corpus. In particular, also comparing the annotation produced by CrowdFlower contributors and by expert annotators, we make some remarks about the value of the novel resource as gold standard, which stems from a preliminary qualitative analysis of the annotated data and on future corpus development.

Towards reducing the attack surface of software backdoors <=SEP=> Backdoors in software systems probably exist since the very first access control mechanisms were implemented and they are a well-known security problem. Despite a wave of public discoveries of such backdoors over the last few years, this threat has only rarely been tackled so far.
 In this paper, we present an approach to reduce the attack surface for this kind of attacks and we strive for an automated identification and elimination of backdoors in binary applications. We limit our focus on the examination of server applications within a client-server model. At the core, we apply variations of the delta debugging technique and introduce several novel heuristics for the identification of those regions in binary application that backdoors are typically installed in (i.e., authentication and command processing functions). We demonstrate the practical feasibility of our approach on several real-world backdoors found in modified versions of the popular software tools ProFTPD and OpenSSH. Furthermore, we evaluate our implementation not only on common instruction set architectures such as x86-64, but also on commercial off-the-shelf embedded devices powered by a MIPS32 processor.

Ovariohysterectomy versus ovariectomy for elective sterilization of female dogs and cats: is removal of the uterus necessary? <=SEP=> Views: Commentary 1409 E sterilization of female dogs and cats is one of the most common procedures performed in veterinary practice and is considered by private veterinary practitioners as one of the most important skills required of new graduates. Potential benefits of sterilization include population control, prevention of diseases of the reproductive tract, and elimination of undesirable behaviors associated with hormonal cycling. The AVMA and the Association of Shelter Veterinarians both promote elective sterilization of female dogs and cats as integral to reducing euthanasia of unwanted dogs and cats. Sterilization of female dogs and cats can be accomplished by removing both the ovaries and uterus (ovariohysterectomy) or by removing the ovaries alone (ovariectomy). Ovariohysterectomy has historically been recommended in the United States and Canada and is currently emphasized at schools and colleges of veterinary medicine in these countries. To our knowledge, only one of the most frequently used surgical textbooks in the United States and Canada describes ovariectomy, and ovariectomy is generally not taught to veterinary students during their surgical laboratories. The Clinical Proficiency Examination, which is the final step in the Educational Commission for Foreign Veterinary Graduates’ program for establishing the educational equivalence of graduates of nonaccredited veterinary schools seeking licensure in the United States or Canada, requires “complete removal of both ovaries and removal of the majority of the uterus” to obtain a passing grade. Despite the apparent preference for ovariohysterectomy in the United States and Canada, ovariectomy appears to have become the standard of care in many European countries. In addition, with the development of minimally invasive surgical techniques, laparoscopic ovariectomy has gained popularity. Thus, it may be helpful to review the scientific evidence comparing ovariohysterectomy and ovariectomy for elective sterilization of healthy female dogs and cats.

Discovering Texture Regularity as a Higher-Order Correspondence Problem <=SEP=> Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of near-regular textures in real images. The underlying lattice of a near-regular texture identifies all of the texels as well as the global topology among the texels. A key contribution of this paper is to formulate lattice-finding as a correspondence problem. The algorithm finds a plausible lattice by iteratively proposing texels and assigning neighbors between the texels. Our matching algorithm seeks assignments that maximize both pair-wise visual similarity and higher-order geometric consistency. We approximate the optimal assignment using a recently developed spectral method. We successfully discover the lattices of a diverse set of unsegmented, real-world textures with significant geometric warping and large appearance variation among

ltm : An R Package for Latent Variable Modeling and Item Response Theory Analyses <=SEP=> The R package ltm has been developed for the analysis of multivariate dichotomous and polytomous data using latent variable models, under the Item Response Theory approach. For dichotomous data the Rasch, the Two-Parameter Logistic, and Birnbaum’s Three-Parameter models have been implemented, whereas for polytomous data Semejima’s Graded Response model is available. Parameter estimates are obtained under marginal maximum likelihood using the Gauss-Hermite quadrature rule. The capabilities and features of the package are illustrated using two real data examples.

Mining frequent closed graphs on evolving data streams <=SEP=> Graph mining is a challenging task by itself, and even more so when processing data streams which evolve in real-time. Data stream mining faces hard constraints regarding time and space for processing, and also needs to provide for concept drift detection. In this paper we present a framework for studying graph pattern mining on time-varying streams. Three new methods for mining frequent closed subgraphs are presented. All methods work on coresets of closed subgraphs, compressed representations of graph sets, and maintain these sets in a batch-incremental manner, but use different approaches to address potential concept drift. An evaluation study on datasets comprising up to four million graphs explores the strength and limitations of the proposed methods. To the best of our knowledge this is the first work on mining frequent closed subgraphs in non-stationary data streams.

A Model-Driven Framework to Develop Personalized Health Monitoring <=SEP=> Both distributed healthcare systems and the Internet of Things (IoT) are currently hot topics. The latter is a new computing paradigm to enable advanced capabilities in engineering various applications, including those for healthcare. For such systems, the core social requirement is the privacy/security of the patient information along with the technical requirements (e.g., energy consumption) and capabilities for adaptability and personalization. Typically, the functionality of the systems is predefined by the patient’s data collected using sensor networks along with medical instrumentation; then, the data is transferred through the Internet for treatment and decision-making. Therefore, systems creation is indeed challenging. In this paper, we propose a model-driven framework to develop the IoT-based prototype and its reference architecture for personalized health monitoring (PHM) applications. The framework contains a multi-layered structure with feature-based modeling and feature model transformations at the top and the application software generation at the bottom. We have validated the framework using available tools and developed an experimental PHM to test some aspects of the functionality of the reference architecture in real time. The main contribution of the paper is the development of the model-driven computational framework with emphasis on the synergistic effect of security and energy issues.

Recognizing human activity in smart home using deep learning algorithm <=SEP=> There is a topic of interest for many researchers about human activities recognition in recent years. In this paper, we propose the research to recognize human activities by deep learning (DL) algorithm. We collected the data from participants performing activities in order to evaluate the human activities recognition results. After pre-training the deep network, the fine-tuning process begins. Compared with Hidden Markov Model (HMM) and naïve Bayes Classifier (NBC), the experiment results show that the proposed deep learning algorithm is an effective way for recognizing human activities in smart home.

Real User Evaluation of Spoken Dialogue Systems Using Amazon Mechanical Turk <=SEP=> This paper describes a framework for evaluation of spoken dialogue systems. Typically, evaluation of dialogue systems is performed in a controlled test environment with carefully selected and instructed users. However, this approach is very demanding. An alternative is to recruit a large group of users who evaluate the dialogue systems in a remote setting under virtually no supervision. Crowdsourcing technology, for example Amazon Mechanical Turk (AMT), provides an efficient way of recruiting subjects. This paper describes an evaluation framework for spoken dialogue systems using AMT users and compares the obtained results with a recent trial in which the systems were tested by locally recruited users. The results suggest that the use of crowdsourcing technology is feasible and it can provide reliable results.

Pocket reflectometry <=SEP=> We present a simple, fast solution for reflectance acquisition using tools that fit into a pocket. Our method captures video of a flat target surface from a fixed video camera lit by a hand-held, moving, linear light source. After processing, we obtain an SVBRDF.
 We introduce a BRDF chart, analogous to a color "checker" chart, which arranges a set of known-BRDF reference tiles over a small card. A sequence of light responses from the chart tiles as well as from points on the target is captured and matched to reconstruct the target's appearance.
 We develop a new algorithm for BRDF reconstruction which works directly on these LDR responses, without knowing the light or camera position, or acquiring HDR lighting. It compensates for spatial variation caused by the local (finite distance) camera and light position by warping responses over time to align them to a specular reference. After alignment, we find an optimal linear combination of the Lambertian and purely specular reference responses to match each target point's response. The same weights are then applied to the corresponding (known) reference BRDFs to reconstruct the target point's BRDF. We extend the basic algorithm to also recover varying surface normals by adding two spherical caps for diffuse and specular references to the BRDF chart.
 We demonstrate convincing results obtained after less than 30 seconds of data capture, using commercial mobile phone cameras in a casual environment.

Un Método para definir la Arquitectura de Procesos <=SEP=> In this paper we present a method for systematically defining the process architecture of any organization. We begin by presenting a detailed interpretation of the upper levels of Zachman’s framework, providing an answer to the cell formed by the intersection of the perspective of the Planner (row 1) and the dimension of Function (column 2). Our method consists of four steps: capturing the organizational structure; exhaustively analyzing the flow of information between the different organizational units, customers, and providers, allowing for a high-level understanding of the organization’s operation; identifying and modeling the configuration of value that best adapts itself to the creation of value for the organization (value chain, workshop, or network); and, given the specified value configuration, identifying, defining, and interrelating the different essential processes.

Development of Self Balance Transporter : A Segway <=SEP=> This paper deals with constructing the vehicle which is fully functional to transport the one person only and movement of it is achieve by naturally. Forward and backwards motion is achieved by leaning forwards and backwards. Segway uses handlebar for turning purpose. In Segway technique uses principle of inverted pendulum in which it keeps an angle of Zero degrees with vertical at all times. The rider motion enables this technique to accelerate, brake or steer the vehicle, for this it uses Gyroscopic Sensor and it is Eco-friendly and non polluting.

Can Active Memory Replace Attention? <=SEP=> Several mechanisms to focus attention of a neural network on selected parts of its input or memory have been used successfully in deep learning models in recent years. Attention has improved image classification, image captioning, speech recognition, generative models, and learning algorithmic tasks, but it had probably the largest impact on neural machine translation. Recently, similar improvements have been obtained using alternative mechanisms that do not focus on a single part of a memory but operate on all of it in parallel, in a uniform way. Such mechanism, which we call active memory, improved over attention in algorithmic tasks, image processing, and in generative modelling. So far, however, active memory has not improved over attention for most natural language processing tasks, in particular for machine translation. We analyze this shortcoming in this paper and propose an extended model of active memory that matches existing attention models on neural machine translation and generalizes better to longer sentences. We investigate this model and explain why previous active memory models did not succeed. Finally, we discuss when active memory brings most benefits and where attention can be a better choice.

Magnetic resonance imaging findings associated with surgically proven rotator interval lesions <=SEP=> To identify shoulder magnetic resonance imaging (MRI) findings associated with surgically proven rotator interval abnormalities. The preoperative MRI examinations of five patients with surgically proven rotator interval (RI) lesions requiring closure were retrospectively evaluated by three musculoskeletal-trained radiologists in consensus. We assessed the structures in the RI, including the coracohumeral ligament, superior glenohumeral ligament, fat tissue, biceps tendon, and capsule for variations in size and signal alteration. In addition, we noted associated findings of rotator cuff and labral pathology. Three of three of the MR arthrogram studies demonstrated extension of gadolinium to the cortex of the undersurface of the coracoid process compared with the control images, seen best on the sagittal oblique images. Four of five of the studies demonstrated subjective thickening of the coracohumeral ligament, and three of five of the studies demonstrated subjective thickening of the superior glenohumeral ligament. Five of five of the studies demonstrated a labral tear. The MRI arthrogram finding of gadolinium extending to the cortex of the undersurface of the coracoid process was noted on the studies of those patients with rotator interval lesions at surgery in this series. Noting this finding—especially in the presence of a labral tear and/or thickening of the coracohumeral ligament or superior glenohumeral ligament—may be helpful in the preoperative diagnosis of rotator interval lesions.

A Tidy Data Model for Natural Language Processing using cleanNLP <=SEP=> Recent advances in natural language processing have produced libraries that extract lowlevel features from a collection of raw texts. These features, known as annotations, are usually stored internally in hierarchical, tree-based data structures. This paper proposes a data model to represent annotations as a collection of normalized relational data tables optimized for exploratory data analysis and predictive modeling. The R package cleanNLP, which calls one of two state of the art NLP libraries (CoreNLP or spaCy), is presented as an implementation of this data model. It takes raw text as an input and returns a list of normalized tables. Specific annotations provided include tokenization, part of speech tagging, named entity recognition, sentiment analysis, dependency parsing, coreference resolution, and word embeddings. The package currently supports input text in English, German, French, and Spanish.

Learning Anisotropic RBF Kernels <=SEP=> We present an approach for learning an anisotropic RBF kernel in a game theoretical setting where the value of the game is the degree of separation between positive and negative training examples. The method extends a previously proposed method (KOMD) to perform feature re-weighting and distance metric learning in a kernel-based classification setting. Experiments on several benchmark datasets demonstrate that our method generally outperforms stateof-the-art distance metric learning methods, including the Large Margin Nearest Neighbor Classification family of methods.

Evaluation of Consumer Understanding of Different Front-of-Package Nutrition Labels, 2010–2011 <=SEP=> INTRODUCTION
Governments throughout the world are using or considering various front-of-package (FOP) food labeling systems to provide nutrition information to consumers. Our web-based study tested consumer understanding of different FOP labeling systems.


METHODS
Adult participants (N = 480) were randomized to 1 of 5 groups to evaluate FOP labels: 1) no label; 2) multiple traffic light (MTL); 3) MTL plus daily caloric requirement icon (MTL+caloric intake); 4) traffic light with specific nutrients to limit based on food category (TL+SNL); or 5) the Choices logo. Total percentage correct quiz scores were created reflecting participants' ability to select the healthier of 2 foods and estimate amounts of saturated fat, sugar, and sodium in foods. Participants also rated products on taste, healthfulness, and how likely they were to purchase the product. Quiz scores and product perceptions were compared with 1-way analysis of variance followed by post-hoc Tukey tests.


RESULTS
The MTL+caloric intake group (mean [standard deviation], 73.3% [6.9%]) and Choices group (72.5% [13.2%]) significantly outperformed the no label group (67.8% [10.3%]) and the TL+SNL group (65.8% [7.3%]) in selecting the more healthful product on the healthier product quiz. The MTL and MTL+caloric intake groups achieved average scores of more than 90% on the saturated fat, sugar, and sodium quizzes, which were significantly better than the no label and Choices group average scores, which were between 34% and 47%.


CONCLUSION
An MTL+caloric intake label and the Choices symbol hold promise as FOP labeling systems and require further testing in different environments and population subgroups.

Does High Self-Esteem Cause Better Performance, Interpersonal Success, Happiness, or Healthier Lifestyles? <=SEP=> Self-esteem has become a household word. Teachers, parents, therapists, and others have focused efforts on boosting self-esteem, on the assumption that high self-esteem will cause many positive outcomes and benefits-an assumption that is critically evaluated in this review. Appraisal of the effects of self-esteem is complicated by several factors. Because many people with high self-esteem exaggerate their successes and good traits, we emphasize objective measures of outcomes. High self-esteem is also a heterogeneous category, encompassing people who frankly accept their good qualities along with narcissistic, defensive, and conceited individuals. The modest correlations between self-esteem and school performance do not indicate that high self-esteem leads to good performance. Instead, high self-esteem is partly the result of good school performance. Efforts to boost the self-esteem of pupils have not been shown to improve academic performance and may sometimes be counterproductive. Job performance in adults is sometimes related to self-esteem, although the correlations vary widely, and the direction of causality has not been established. Occupational success may boost self-esteem rather than the reverse. Alternatively, self-esteem may be helpful only in some job contexts. Laboratory studies have generally failed to find that self-esteem causes good task performance, with the important exception that high self-esteem facilitates persistence after failure. People high in self-esteem claim to be more likable and attractive, to have better relationships, and to make better impressions on others than people with low self-esteem, but objective measures disconfirm most of these beliefs. Narcissists are charming at first but tend to alienate others eventually. Self-esteem has not been shown to predict the quality or duration of relationships. High self-esteem makes people more willing to speak up in groups and to criticize the group's approach. Leadership does not stem directly from self-esteem, but self-esteem may have indirect effects. Relative to people with low self-esteem, those with high self-esteem show stronger in-group favoritism, which may increase prejudice and discrimination. Neither high nor low self-esteem is a direct cause of violence. Narcissism leads to increased aggression in retaliation for wounded pride. Low self-esteem may contribute to externalizing behavior and delinquency, although some studies have found that there are no effects or that the effect of self-esteem vanishes when other variables are controlled. The highest and lowest rates of cheating and bullying are found in different subcategories of high self-esteem. Self-esteem has a strong relation to happiness. Although the research has not clearly established causation, we are persuaded that high self-esteem does lead to greater happiness. Low self-esteem is more likely than high to lead to depression under some circumstances. Some studies support the buffer hypothesis, which is that high self-esteem mitigates the effects of stress, but other studies come to the opposite conclusion, indicating that the negative effects of low self-esteem are mainly felt in good times. Still others find that high self-esteem leads to happier outcomes regardless of stress or other circumstances. High self-esteem does not prevent children from smoking, drinking, taking drugs, or engaging in early sex. If anything, high self-esteem fosters experimentation, which may increase early sexual activity or drinking, but in general effects of self-esteem are negligible. One important exception is that high self-esteem reduces the chances of bulimia in females. Overall, the benefits of high self-esteem fall into two categories: enhanced initiative and pleasant feelings. We have not found evidence that boosting self-esteem (by therapeutic interventions or school programs) causes benefits. Our findings do not support continued widespread efforts to boost self-esteem in the hope that it will by itself foster improved outcomes. In view of the heterogeneity of high self-esteem, indiscriminate praise might just as easily promote narcissism, with its less desirable consequences. Instead, we recommend using praise to boost self-esteem as a reward for socially desirable behavior and self-improvement.

Phantom vibrations among undergraduates: Prevalence and associated psychological characteristics <=SEP=>