Searcharxiv⌕ Search

arXiv subjects

Zhou Yang

Publications and source records attributed to Zhou Yang.

At least 127 records · Page 7Linked to original sources

COVID19 Tracking: An Interactive Tracking, Visualizing and Analyzing Platform

The Coronavirus Disease 2019 (COVID-19) has now become a pandemic, inflicting millions of people and causing tens of thousands of deaths. To better understand the dynamics of COVID-19, we present a comprehensive COVID-19 tracking and visualization platform that pinpoints the dynamics of the COVID-19 worldwide. Four essential components are implemented: 1) presenting the visualization map of COVID-19 confirmed cases and total counts all over the world; 2) showing the worldwide trends of COVID-19 at multi-grained levels; 3) provide multi-view comparisons, including confirmed cases per million people, mortality rate and accumulative cure rate; 4) integrating a multi-grained view of the disease spreading dynamics in China and showing how the epidemic is taken under control in China.

cs.CY↗

Fusing Motion Patterns and Key Visual Information for Semantic Event Recognition in Basketball Videos

Many semantic events in team sport activities e.g. basketball often involve both group activities and the outcome (score or not). Motion patterns can be an effective means to identify different activities. Global and local motions have their respective emphasis on different activities, which are difficult to capture from the optical flow due to the mixture of global and local motions. Hence it calls for a more effective way to separate the global and local motions. When it comes to the specific case for basketball game analysis, the successful score for each round can be reliably detected by the appearance variation around the basket. Based on the observations, we propose a scheme to fuse global and local motion patterns (MPs) and key visual information (KVI) for semantic event recognition in basketball videos. Firstly, an algorithm is proposed to estimate the global motions from the mixed motions based on the intrinsic property of camera adjustments. And the local motions could be obtained from the mixed and global motions. Secondly, a two-stream 3D CNN framework is utilized for group activity recognition over the separated global and local motion patterns. Thirdly, the basket is detected and its appearance features are extracted through a CNN structure. The features are utilized to predict the success or failure. Finally, the group activity recognition and success/failure prediction results are integrated using the kronecker product for event recognition. Experiments on NCAA dataset demonstrate that the proposed method obtains state-of-the-art performance.

cs.CV↗

Data Centers Job Scheduling with Deep Reinforcement Learning

Efficient job scheduling on data centers under heterogeneous complexity is crucial but challenging since it involves the allocation of multi-dimensional resources over time and space. To adapt the complex computing environment in data centers, we proposed an innovative Advantage Actor-Critic (A2C) deep reinforcement learning based approach called A2cScheduler for job scheduling. A2cScheduler consists of two agents, one of which, dubbed the actor, is responsible for learning the scheduling policy automatically and the other one, the critic, reduces the estimation error. Unlike previous policy gradient approaches, A2cScheduler is designed to reduce the gradient estimation variance and to update parameters efficiently. We show that the A2cScheduler can achieve competitive scheduling performance using both simulated workloads and real data collected from an academic data center.

cs.OS↗

$T\bar{T}$ deformations and integrable spin chains

We consider current-current deformations that generalise $T\bar{T}$ ones, and show that they may be also introduced for integrable spin chains. In analogy with the integrable QFT setup, we define the deformation as a modification of the S matrix in the Bethe equations. Using results by Bargheer, Beisert and Loebbert we show that the deforming operator is composite and constructed out of two currents on the lattice; its expectation value factorises like for $T\bar{T}$. Such a deformation may be considered for any combination of charges that preserve the model's integrable structure.

hep-th↗

Discovering Opioid Use Patterns from Social Media for Relapse Prevention

The United States is currently experiencing an unprecedented opioid crisis, and opioid overdose has become a leading cause of injury and death. Effective opioid addiction recovery calls for not only medical treatments, but also behavioral interventions for impacted individuals. In this paper, we study communication and behavior patterns of patients with opioid use disorder (OUD) from social media, intending to demonstrate how existing information from common activities, such as online social networking, might lead to better prediction, evaluation, and ultimately prevention of relapses. Through a multi-disciplinary and advanced novel analytic perspective, we characterize opioid addiction behavior patterns by analyzing opioid groups from Reddit.com - including modeling online discussion topics, analyzing text co-occurrence and correlations, and identifying emotional states of people with OUD. These quantitative analyses are of practical importance and demonstrate innovative ways to use information from online social media, to create technology that can assist in relapse prevention.

cs.SI↗

Addict Free -- A Smart and Connected Relapse Intervention Mobile App

It is widely acknowledged that addiction relapse is highly associated with spatial-temporal factors such as some specific places or time periods. Current studies suggest that those factors can be utilized for better relapse interventions, however, there is no relapse prevention application that makes use of those factors. In this paper, we introduce a mobile app called "Addict Free", which records user profiles, tracks relapse history and summarizes recovering statistics to help users better understand their recovering situations. Also, this app builds a relapse recovering community, which allows users to ask for advice and encouragement, and share relapse prevention experience. Moreover, machine learning algorithms that ingest spatial and temporal factors are utilized to predict relapse, based on which helpful addiction diversion activities are recommended by a recovering recommendation algorithm. By interacting with users, this app targets at providing smart suggestions that aim to stop relapse, especially for alcohol and tobacco addiction users.

cs.HC↗

More than 3-mm-long carrier diffusion and strong absorption over the full solar spectrum in copper oxide and selenium composite film

Usually, single-crystal material has a longer carrier diffusion length due to fewer defects. Here, we report a nano/amorphous copper oxide and selenium (COS) composite film prepared by radio frequency magnetron co-sputtering of CuO and Se and post annealing. The photo-generated carriers in the COS film can diffuse very far (3.147 mm). Additionally, the COS film can strongly absorb light over the entire solar spectrum region (250-2500 nm) (average absorptance is ~80%). These results indicate that the COS composite is an excellent material and can be used in solar cells and other photo-electric devices.

physics.app-ph↗

Ontology Based Global and Collective Motion Patterns for Event Classification in Basketball Videos

In multi-person videos, especially team sport videos, a semantic event is usually represented as a confrontation between two teams of players, which can be represented as collective motion. In broadcast basketball videos, specific camera motions are used to present specific events. Therefore, a semantic event in broadcast basketball videos is closely related to both the global motion (camera motion) and the collective motion. A semantic event in basketball videos can be generally divided into three stages: pre-event, event occurrence (event-occ), and post-event. In this paper, we propose an ontology-based global and collective motion pattern (On_GCMP) algorithm for basketball event classification. First, a two-stage GCMP based event classification scheme is proposed. The GCMP is extracted using optical flow. The two-stage scheme progressively combines a five-class event classification algorithm on event-occs and a two-class event classification algorithm on pre-events. Both algorithms utilize sequential convolutional neural networks (CNNs) and long short-term memory (LSTM) networks to extract the spatial and temporal features of GCMP for event classification. Second, we utilize post-event segments to predict success/failure using deep features of images in the video frames (RGB_DF_VF) based algorithms. Finally the event classification results and success/failure classification results are integrated to obtain the final results. To evaluate the proposed scheme, we collected a new dataset called NCAA+, which is automatically obtained from the NCAA dataset by extending the fixed length of video clips forward and backward of the corresponding semantic events. The experimental results demonstrate that the proposed scheme achieves the mean average precision of 58.10% on NCAA+. It is higher by 6.50% than state-of-the-art on NCAA.

cs.CV↗

Gain-Embedded Meta Mirrors for Optically Pumped Semiconductor Disk Lasers

We propose and analyze an active mirror structure that uses a subwavelength grating reflector combined with optical gain. The structure is designed to be directly bonded to a thermal substrate (such as diamond) for efficient heat removal. We present optical wave propagation and thermal transport analysis and show that such a structure is well suited for power scaling of optically pumped semiconductor disk lasers to multi-kilowatt CW power operation.

physics.app-ph↗

Constrained portfolio-consumption strategies with uncertain parameters and borrowing costs

This paper studies the properties of the optimal portfolio-consumption strategies in a {finite horizon} robust utility maximization framework with different borrowing and lending rates. In particular, we allow for constraints on both investment and consumption strategies, and model uncertainty on both drift and volatility. With the help of explicit solutions, we quantify the impacts of uncertain market parameters, portfolio-consumption constraints and borrowing costs on the optimal strategies and their time monotone properties.

q-fin.PM↗

Spatial-temporal Multi-Task Learning for Within-field Cotton Yield Prediction

Understanding and accurately predicting within-field spatial variability of crop yield play a key role in site-specific management of crop inputs such as irrigation water and fertilizer for optimized crop production. However, such a task is challenged by the complex interaction between crop growth and environmental and managerial factors, such as climate, soil conditions, tillage, and irrigation. In this paper, we present a novel Spatial-temporal Multi-Task Learning algorithms for within-field crop yield prediction in west Texas from 2001 to 2003. This algorithm integrates multiple heterogeneous data sources to learn different features simultaneously, and to aggregate spatial-temporal features by introducing a weighted regularizer to the loss functions. Our comprehensive experimental results consistently outperform the results of other conventional methods, and suggest a promising approach, which improves the landscape of crop prediction research fields.

cs.LG↗

Predicting Opioid Relapse Using Social Media Data

Opioid addiction is a severe public health threat in the U.S, causing massive deaths and many social problems. Accurate relapse prediction is of practical importance for recovering patients since relapse prediction promotes timely relapse preventions that help patients stay clean. In this paper, we introduce a Generative Adversarial Networks (GAN) model to predict the addiction relapses based on sentiment images and social influences. Experimental results on real social media data from Reddit.com demonstrate that the GAN model delivers a better performance than comparable alternative techniques. The sentiment images generated by the model show that relapse is closely connected with two emotions `joy' and `negative'. This work is one of the first attempts to predict relapses using massive social media data and generative adversarial nets. The proposed method, combined with knowledge of social media mining, has the potential to revolutionize the practice of opioid addiction prevention and treatment.

cs.SI↗

Coordinating Disaster Emergency Response with Heuristic Reinforcement Learning

A crucial and time-sensitive task when any disaster occurs is to rescue victims and distribute resources to the right groups and locations. This task is challenging in populated urban areas, due to the huge burst of help requests generated in a very short period. To improve the efficiency of the emergency response in the immediate aftermath of a disaster, we propose a heuristic multi-agent reinforcement learning scheduling algorithm, named as ResQ, which can effectively schedule the rapid deployment of volunteers to rescue victims in dynamic settings. The core concept is to quickly identify victims and volunteers from social network data and then schedule rescue parties with an adaptive learning algorithm. This framework performs two key functions: 1) identify trapped victims and rescue volunteers, and 2) optimize the volunteers' rescue strategy in a complex time-sensitive environment. The proposed ResQ algorithm can speed up the training processes through a heuristic function which reduces the state-action space by identifying the set of particular actions over others. Experimental results showed that the proposed heuristic multi-agent reinforcement learning based scheduling outperforms several state-of-art methods, in terms of both reward rate and response times.

cs.LG↗

Efficient Destination Prediction Based on Route Choices with Transition Matrix Optimization

Destination prediction is an essential task in a variety of mobile applications. In this paper, we optimize the matrix operation and adapt a semi-lazy framework to improve the prediction accuracy and efficiency of a state-of-the-art approach. To this end, we employ efficient dynamic-programming by devising several data constructs including Efficient Transition Probability and Transition Probabilities with Detours that are capable of pinpointing the minimum amount of computation. We prove that our method achieves one order of cut in both time and space complexity. The experimental results on real-world and synthetic datasets have shown that our solution consistently outperforms its state-of-the-art counterparts in terms of both efficiency (approximately over 100 times faster) and accuracy (above 30% increase).

cs.DB↗

Dynkin Game of Convertible Bonds and Their Optimal Strategy

This paper studies the valuation and optimal strategy of convertible bonds as a Dynkin game by using the reflected backward stochastic differential equation method and the variational inequality method. We first reduce such a Dynkin game to an optimal stopping time problem with state constraint, and then in a Markovian setting, we investigate the optimal strategy by analyzing the properties of the corresponding free boundary, including its position, asymptotics, monotonicity and regularity. We identify situations when call precedes conversion, and vice versa. Moreover, we show that the irregular payoff results in the possibly non-monotonic conversion boundary. Surprisingly, the price of the convertible bond is not necessarily monotonic in time: it may even increase when time approaches maturity.

q-fin.MF↗

Indifference Pricing and Hedging in a Multiple-Priors Model with Trading Constraints

This paper considers utility indifference valuation of derivatives under model uncertainty and trading constraints, where the utility is formulated as an additive stochastic differential utility of both intertemporal consumption and terminal wealth, and the uncertain prospects are ranked according to a multiple-priors model of Chen and Epstein (2002). The price is determined by two optimal stochastic control problems (mixed with optimal stopping time in the case of American option) of forward-backward stochastic differential equations. By means of backward stochastic differential equation and partial differential equation methods, we show that both bid and ask prices are closely related to the Black-Scholes risk-neutral price with modified dividend rates. The two prices will actually coincide with each other if there is no trading constraint or the model uncertainty disappears. Finally, two applications to European option and American option are discussed.

q-fin.MF↗

Map Matching based on Conditional Random Fields and Route Preference Mining for Uncertain Trajectories

In order to improve offline map matching accuracy of low-sampling-rate GPS, a map matching algorithm based on conditional random fields (CRF) and route preference mining is proposed. In this algorithm, road offset distance and the temporal-spatial relationship between the sampling points are used as features of GPS trajectory in CRF model, which can utilize the advantages of integrating the context information into features flexibly. When the sampling rate is too low, it is difficult to guarantee the effectiveness using temporal-spatial context modeled in CRF, and route preference of a driver is used as replenishment to be superposed on the temporal-spatial transition features. The experimental results show that this method can improve the accuracy of the matching, especially in the case of low sampling rate.

cs.NI↗

Dynkin Game of Stochastic Differential Equations with Random Coefficients, and Associated Backward Stochastic Partial Differential Variational Inequality

A Dynkin game is considered for stochastic differential equations with random coefficients. We first apply Qiu and Tang's maximum principle for backward stochastic partial differential equations to generalize Krylov estimate for the distribution of a Markov process to that of a non-Markov process, and establish a generalized Itô-Kunita-Wentzell's formula allowing the test function to be a random field of Itô's type which takes values in a suitable Sobolev space. We then prove the verification theorem that the Nash equilibrium point and the value of the Dynkin game are characterized by the strong solution of the associated Hamilton-Jacobi-Bellman-Isaacs equation, which is currently a backward stochastic partial differential variational inequality (BSPDVI, for short) with two obstacles. We obtain the existence and uniqueness result and a comparison theorem for strong solution of the BSPDVI. Moreover, we study the monotonicity on the strong solution of the BSPDVI by the comparison theorem for BSPDVI and define the free boundaries. Finally, we identify the counterparts for an optimal stopping time problem as a special Dynkin game.

math.OC↗