Searcharxiv⌕ Search

arXiv subjects

Huan Liu

Publications and source records attributed to Huan Liu.

At least 361 records · Page 20Linked to original sources

Edge states in self-complementary checkerboard photonic crystals: Zak phase, surface impedance and experimental verification

Edge states of photonic crystals have attracted much attention for the potential applications such as high transmission waveguide bends, spin dependent splitters and one-way photonic circuits. Here, we theoretically discuss and experimentally observe the deterministic edge states in checkerboard photonic crystals. Due to the self-complementarity of checkerboard photonic crystals, a common band gap is structurally protected between two photonic crystals with different unit cells. Deterministic edge states are found inside the common band gap by exploiting the Zak phase analysis and surface impedance calculation. These edge states are also confirmed by a microwave experiment.

physics.optics↗

Cross-Platform Emoji Interpretation: Analysis, a Solution, and Applications

Most social media platforms are largely based on text, and users often write posts to describe where they are, what they are seeing, and how they are feeling. Because written text lacks the emotional cues of spoken and face-to-face dialogue, ambiguities are common in written language. This problem is exacerbated in the short, informal nature of many social media posts. To bypass this issue, a suite of special characters called "emojis," which are small pictograms, are embedded within the text. Many emojis are small depictions of facial expressions designed to help disambiguate the emotional meaning of the text. However, a new ambiguity arises in the way that emojis are rendered. Every platform (Windows, Mac, and Android, to name a few) renders emojis according to their own style. In fact, it has been shown that some emojis can be rendered so differently that they look "happy" on some platforms, and "sad" on others. In this work, we use real-world data to verify the existence of this problem. We verify that the usage of the same emoji can be significantly different across platforms, with some emojis exhibiting different sentiment polarities on different platforms. We propose a solution to identify the intended emoji based on the platform-specific nature of the emoji used by the author of a social media post. We apply our solution to sentiment analysis, a task that can benefit from the emoji calibration technique we use in this work. We conduct experiments to evaluate the effectiveness of the mapping in this task.

cs.CL↗

Intelligent Disaster Response via Social Media Analysis - A Survey

The success of a disaster relief and response process is largely dependent on timely and accurate information regarding the status of the disaster, the surrounding environment, and the affected people. This information is primarily provided by first responders on-site and can be enhanced by the firsthand reports posted in real-time on social media. Many tools and methods have been developed to automate disaster relief by extracting, analyzing, and visualizing actionable information from social media. However, these methods are not well integrated in the relief and response processes and the relation between the two requires exposition for further advancement. In this survey, we review the new frontier of intelligent disaster relief and response using social media, show stages of disasters which are reflected on social media, establish a connection between proposed methods based on social media and relief efforts by first responders, and outline pressing challenges and future research directions.

cs.SI↗

Fake News Detection on Social Media: A Data Mining Perspective

Social media for news consumption is a double-edged sword. On the one hand, its low cost, easy access, and rapid dissemination of information lead people to seek out and consume news from social media. On the other hand, it enables the wide spread of "fake news", i.e., low quality news with intentionally false information. The extensive spread of fake news has the potential for extremely negative impacts on individuals and society. Therefore, fake news detection on social media has recently become an emerging research that is attracting tremendous attention. Fake news detection on social media presents unique characteristics and challenges that make existing detection algorithms from traditional news media ineffective or not applicable. First, fake news is intentionally written to mislead readers to believe false information, which makes it difficult and nontrivial to detect based on news content; therefore, we need to include auxiliary information, such as user social engagements on social media, to help make a determination. Second, exploiting this auxiliary information is challenging in and of itself as users' social engagements with fake news produce data that is big, incomplete, unstructured, and noisy. Because the issue of fake news detection on social media is both challenging and relevant, we conducted this survey to further facilitate research on the problem. In this survey, we present a comprehensive review of detecting fake news on social media, including fake news characterizations on psychology and social theories, existing algorithms from a data mining perspective, evaluation metrics and representative datasets. We also discuss related research areas, open problems, and future research directions for fake news detection on social media.

cs.SI↗

Application of Hilbert-Huang decomposition to reduce noise and characterize for NMR FID signal of proton precession magnetometer

The parameters in a nuclear magnetic resonance (NMR) free induction decay (FID) signal contain information that is useful in magnetic field measurement, magnetic resonance sounding (MRS) and other related applications. A real time sampled FID signal is well modeled as a finite mixture of exponential sequences plus noise. We propose to use the Hilbert-Huang Transform (HHT) for noise reduction and characterization, where the generalized Hilbert-Huang represents a way to decompose a signal into so-called intrinsic mode function (IMF) along with a trend, and obtain instantaneous frequency data. Moreover, the HHT for an FID signal's feature analysis is applied for the first time. First, acquiring the actual untuned FID signal by a developed prototype of proton magnetometer, and then the empirical mode decomposition (EMD) is performed to decompose the noise and original FID. Finally, the HHT is applied to the obtained IMFs to extract the Hilbert energy spectrum, to indicate the energy distribution of the signal on the frequency axis. By theory analysis and the testing of an actual FID signal, the results show that, compared with general noise reduction methods such as auto correlation and singular value decomposition (SVD), combined with the proposed method can further suppress the interfered signals effectively, and can obtain different components of FID signal, which can use to identify the magnetic anomaly, the existence of groundwater etc. This is a very important property since it can be exploited to separate the FID signal from noise and to estimate exponential sequence parameters of FID signal.

physics.ins-det↗

Heroes and Zeroes: Predicting the Impact of New Video Games on Twitch.tv

Video games and the playing thereof have been a fixture of American culture since their introduction in the arcades of the 1980s. However, it was not until the recent proliferation of broadband connections robust and fast enough to handle live video streaming that players of video games have transitioned from a content consumer role to a content producer role. Simultaneously, the rise of social media has revealed how interpersonal connections drive user engagement and interest. In this work, we discuss the recent proliferation of video game streaming, particularly on Twitch.tv, analyze trends and patterns in video game viewing, and develop predictive models for determining if a new game will have substantial impact on the streaming ecosystem.

cs.SI↗

DeepProf: Performance Analysis for Deep Learning Applications via Mining GPU Execution Patterns

Deep learning applications are computation-intensive and often employ GPU as the underlying computing devices. Deep learning frameworks provide powerful programming interfaces, but the gap between source codes and practical GPU operations make it difficult to analyze the performance of deep learning applications. In this paper, through examing the features of GPU traces and deep learning applications, we use the suffix tree structure to extract the repeated patten in GPU traces. Performance analysis graphs can be generated from the preprocessed GPU traces. We further present \texttt{DeepProf}, a novel tool to automatically process GPU traces and generate performance analysis reports for deep learning applications. Empirical study verifies the effectiveness of \texttt{DeepProf} in performance analysis and diagnosis. We also find out some interesting properties of Tensorflow, which can be used to guide the deep learning system setup.

cs.SE↗

Low-cost high-efficiency solar steam generation by wick material with graphite micro/nano particles

Generating water steam by solar energy is a significant process for many fields. In this paper, a low-cost high-efficiency wick type steam generator is proposed. It's based on the heat localization and thin-film evaporation. The measurements show that the energy efficiency is 84 % at 1 kw/m2. Besides, the dependence of efficiency on particle concentration and size are discussed. The optimal particle concentration is found at 60 g/m2, and a smaller particle size gives higher efficiency. The experimental results agree well with the theoretical prediction based on thin-film evaporation theory. Our study offers a new in-depth understanding of low-cost high-efficiency solar steam generation.

cond-mat.mes-hall↗

NeuroRule: A Connectionist Approach to Data Mining

Classification, which involves finding rules that partition a given data set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining classification rules for large databases are mainly decision tree based symbolic learning methods. The connectionist approach based on neural networks has been thought not well suited for data mining. One of the major reasons cited is that knowledge generated by neural networks is not explicitly represented in the form of rules suitable for verification or interpretation by humans. This paper examines this issue. With our newly developed algorithms, rules which are similar to, or more concise than those generated by the symbolic methods can be extracted from the neural networks. The data mining process using neural networks with the emphasis on rule extraction is described. Experimental results and comparison with previously published works are presented.

cs.LG↗

Challenges of Feature Selection for Big Data Analytics

We are surrounded by huge amounts of large-scale high dimensional data. It is desirable to reduce the dimensionality of data for many learning tasks due to the curse of dimensionality. Feature selection has shown its effectiveness in many applications by building simpler and more comprehensive model, improving learning performance, and preparing clean, understandable data. Recently, some unique characteristics of big data such as data velocity and data variety present challenges to the feature selection problem. In this paper, we envision these challenges of feature selection for big data analytics. In particular, we first give a brief introduction about feature selection and then detail the challenges of feature selection for structured, heterogeneous and streaming data as well as its scalability and stability issues. At last, to facilitate and promote the feature selection research, we present an open-source feature selection repository (scikit-feature), which consists of most of current popular feature selection algorithms.

cs.LG↗

SlangSD: Building and Using a Sentiment Dictionary of Slang Words for Short-Text Sentiment Classification

Sentiment in social media is increasingly considered as an important resource for customer segmentation, market understanding, and tackling other socio-economic issues. However, sentiment in social media is difficult to measure since user-generated content is usually short and informal. Although many traditional sentiment analysis methods have been proposed, identifying slang sentiment words remains untackled. One of the reasons is that slang sentiment words are not available in existing dictionaries or sentiment lexicons. To this end, we propose to build the first sentiment dictionary of slang words to aid sentiment analysis of social media content. It is laborious and time-consuming to collect and label the sentiment polarity of a comprehensive list of slang words. We present an approach to leverage web resources to construct an extensive Slang Sentiment word Dictionary (SlangSD) that is easy to maintain and extend. SlangSD is publicly available for research purposes. We empirically show the advantages of using SlangSD, the newly-built slang sentiment word dictionary for sentiment classification, and provide examples demonstrating its ease of use with an existing sentiment system.

cs.CL↗

A Survey of Signed Network Mining in Social Media

Many real-world relations can be represented by signed networks with positive and negative links, as a result of which signed network analysis has attracted increasing attention from multiple disciplines. With the increasing prevalence of social media networks, signed network analysis has evolved from developing and measuring theories to mining tasks. In this article, we present a review of mining signed networks in the context of social media and discuss some promising research directions and new frontiers. We begin by giving basic concepts and unique properties and principles of signed networks. Then we classify and review tasks of signed network mining with representative algorithms. We also delineate some tasks that have not been extensively studied with formal definitions and also propose research directions to expand the field of signed network mining.

cs.SI↗

Signed Link Analysis in Social Media Networks

Numerous real-world relations can be represented by signed networks with positive links (e.g., trust) and negative links (e.g., distrust). Link analysis plays a crucial role in understanding the link formation and can advance various tasks in social network analysis such as link prediction. The majority of existing works on link analysis have focused on unsigned social networks. The existence of negative links determines that properties and principles of signed networks are substantially distinct from those of unsigned networks, thus we need dedicated efforts on link analysis in signed social networks. In this paper, following social theories in link analysis in unsigned networks, we adopt three social science theories, namely Emotional Information, Diffusion of Innovations and Individual Personality, to guide the task of link analysis in signed networks.

cs.SI↗

Predicting Online Protest Participation of Social Media Users

Social media has emerged to be a popular platform for people to express their viewpoints on political protests like the Arab Spring. Millions of people use social media to communicate and mobilize their viewpoints on protests. Hence, it is a valuable tool for organizing social movements. However, the mechanisms by which protest affects the population is not known, making it difficult to estimate the number of protestors. In this paper, we are inspired by sociological theories of protest participation and propose a framework to predict from the user's past status messages and interactions whether the next post of the user will be a declaration of protest. Drawing concepts from these theories, we model the interplay between the user's status messages and messages interacting with him over time and predict whether the next post of the user will be a declaration of protest. We evaluate the framework using data from the social media platform Twitter on protests during the recent Nigerian elections and demonstrate that it can effectively predict whether the next post of a user is a declaration of protest.

cs.SI↗

Dose conversion coefficients for Chinese reference adult male and female voxel phantoms from idealized neutron exposures

A new set of fluence-to-dose conversion coefficients based on the Chinese reference adult voxel phantoms CRAM and CRAF are presented for six idealized external neutron exposures from 10-8 MeV to 20 MeV. The voxel phantoms CRAM and CRAF were adjusted from the previous phantoms CNMAN and CNWM respectively, and the masses of individual organs have been adjusted to the Chinese reference data. The calculation of organ-absorbed doses and effective doses were performed with the Monte Carlo transport code MCNPX. The resulting dose conversion coefficients were compared with those published in ICRP Publication 116, which represents the reference Caucasian. The organ-absorbed dose conversion coefficients of most organs are in good agreement with the results in ICRP Publication 116, however, obvious discrepancies are observed for some organs and certain geometries. For neutrons with energies above 2 MeV, the effective dose conversion coefficients of Chinese reference adult are almost identical to those of ICRP Publication 116 in AP, PA, ROT and ISO geometries. When energies range from 10-8 MeV to 1 MeV, differences are within 10% in AP (5%), PA (8%) and ROT (-4%) geometries. However, relatively large discrepancies are shown in lateral and ISO geometries when energies are below 1 MeV, with differences of -15% for LLAT, -20% for RLAT and -12% for ISO, respectively.

physics.med-ph↗

Leveraging Social Foci for Information Seeking in Social Media

The rise of social media provides a great opportunity for people to reach out to their social connections to satisfy their information needs. However, generic social media platforms are not explicitly designed to assist information seeking of users. In this paper, we propose a novel framework to identify the social connections of a user able to satisfy his information needs. The information need of a social media user is subjective and personal, and we investigate the utility of his social context to identify people able to satisfy it. We present questions users post on Twitter as instances of information seeking activities in social media. We infer soft community memberships of the asker and his social connections by integrating network and content information. Drawing concepts from the social foci theory, we identify answerers who share communities with the asker w.r.t. the question. Our experiments demonstrate that the framework is effective in identifying answerers to social media questions.

cs.SI↗

Negative Link Prediction in Social Media

Signed network analysis has attracted increasing attention in recent years. This is in part because research on signed network analysis suggests that negative links have added value in the analytical process. A major impediment in their effective use is that most social media sites do not enable users to specify them explicitly. In other words, a gap exists between the importance of negative links and their availability in real data sets. Therefore, it is natural to explore whether one can predict negative links automatically from the commonly available social network data. In this paper, we investigate the novel problem of negative link prediction with only positive links and content-centric interactions in social media. We make a number of important observations about negative links, and propose a principled framework NeLP, which can exploit positive links and content-centric interactions to predict negative links. Our experimental results on real-world social networks demonstrate that the proposed NeLP framework can accurately predict negative links with positive links and content-centric interactions. Our detailed experiments also illustrate the relative importance of various factors to the effectiveness of the proposed framework.

cs.SI↗

From Tweets to Events: Exploring a Scalable Solution for Twitter Streams

The unprecedented use of social media through smartphones and other web-enabled mobile devices has enabled the rapid adoption of platforms like Twitter. Event detection has found many applications on the web, including breaking news identification and summarization. The recent increase in the usage of Twitter during crises has attracted researchers to focus on detecting events in tweets. However, current solutions have focused on static Twitter data. The necessity to detect events in a streaming environment during fast paced events such as a crisis presents new opportunities and challenges. In this paper, we investigate event detection in the context of real-time Twitter streams as observed in real-world crises. We highlight the key challenges in this problem: the informal nature of text, and the high volume and high velocity characteristics of Twitter streams. We present a novel approach to address these challenges using single-pass clustering and the compression distance to efficiently detect events in Twitter streams. Through experiments on large Twitter datasets, we demonstrate that the proposed framework is able to detect events in near real-time and can scale to large and noisy Twitter streams.

cs.SI↗