Searcharxiv⌕ Search

arXiv subjects

Tong Wang

Publications and source records attributed to Tong Wang.

189 records · Page 11Linked to original sources
arXiv2016

A micro-scale simulation of red blood cell passage through symmetric and asymmetric bifurcated vessels

Blood exhibits a heterogeneous nature of hematocrit, velocity, and effective viscosity in microcapillaries. Microvascular bifurcations have a significant influence on the distribution of the blood cells and blood flow behavior. This paper presents a simulation study performed on the two-dimensionalmotions and deformation of multiple red blood cells in microvessels with diverging and converging bifurcations. Fluid dynamics and membrane mechanics were incorporated. Effects of cell shape, hematocrit, and deformability of the cell membrane on rheological behavior of the red blood cells and the hemodynamics have been investigated. It was shown that the blood entering the daughter branch with a higher flow rate tended to receive disproportionally more cells. The results also demonstrate that red blood cells in microvessels experienced lateral migration in the parent channel and blunted velocity profiles in both straight section and daughter branches, and this effect was influenced by the shape and the initial position of the cells, the hematocrit, and the membrane deformability. In addition, a cell free region around the tip of the confluence was observed. The simulation results are qualitatively consistent with existing experimental findings. This study may provide fundamental knowledge for a better understanding of hemodynamic behavior of micro-scale blood flow.

physics.bio-ph↗
arXiv2015

Learning Optimized Or's of And's

Or's of And's (OA) models are comprised of a small number of disjunctions of conjunctions, also called disjunctive normal form. An example of an OA model is as follows: If ($x_1 = $ `blue' AND $x_2=$ `middle') OR ($x_1 = $ `yellow'), then predict $Y=1$, else predict $Y=0$. Or's of And's models have the advantage of being interpretable to human experts, since they are a set of conditions that concisely capture the characteristics of a specific subset of data. We present two optimization-based machine learning frameworks for constructing OA models, Optimized OA (OOA) and its faster version, Optimized OA with Approximations (OOAx). We prove theoretical bounds on the properties of patterns in an OA model. We build OA models as a diagnostic screening tool for obstructive sleep apnea, that achieves high accuracy with a substantial gain in interpretability over other methods.

cs.AI↗
arXiv2015

Antiferromagnetic Ordering in MnF(salen)

Antiferromagnetic order at $T_{\mathrm{N}} = 23$ K has been identified in Mn(III)F(salen), salen = H$_{14}$C$_{16}$N$_2$O$_2$, an $S = 2$ linear-chain system. Using single crystals, specific heat studies performed in magnetic fields up to 9 T revealed the presence of a field-independent cusp at the same temperature where $^1$H NMR studies conducted at 42 MHz observed dramatic changes in the spin-lattice relaxation time, $T_1$, and in the linewidths. Neutron powder diffraction performed on a randomly-oriented, as-grown, deuterated (12 of 14 H replaced by d) sample of 2.2 g at 10 K and 100 K did not resolve the magnetic ordering, while low-field (less than 0.1 T) magnetic susceptibility studies of single crystals and randomly-arranged microcrystalline samples reveal subtle features associated with the transition. Ensemble these data suggest a magnetic signature previously detected at 3.8 T for temperatures below nominally 500 mK is a spin-flop field of small net moments arising from alternating subsets of three Mn spins along the chains.

cond-mat.str-el↗
arXiv2015

Or's of And's for Interpretable Classification, with Application to Context-Aware Recommender Systems

We present a machine learning algorithm for building classifiers that are comprised of a small number of disjunctions of conjunctions (or's of and's). An example of a classifier of this form is as follows: If X satisfies (x1 = 'blue' AND x3 = 'middle') OR (x1 = 'blue' AND x2 = '<15') OR (x1 = 'yellow'), then we predict that Y=1, ELSE predict Y=0. An attribute-value pair is called a literal and a conjunction of literals is called a pattern. Models of this form have the advantage of being interpretable to human experts, since they produce a set of conditions that concisely describe a specific class. We present two probabilistic models for forming a pattern set, one with a Beta-Binomial prior, and the other with Poisson priors. In both cases, there are prior parameters that the user can set to encourage the model to have a desired size and shape, to conform with a domain-specific definition of interpretability. We provide two scalable MAP inference approaches: a pattern level search, which involves association rule mining, and a literal level search. We show stronger priors reduce computation. We apply the Bayesian Or's of And's (BOA) model to predict user behavior with respect to in-vehicle context-aware personalized recommender systems.

cs.LG↗
arXiv2014

Alternating Optimization Techniques for Power Allocation and Receiver Design in Multihop Wireless Sensor Networks

In this paper, we consider a multihop wireless sensor network with multiple relay nodes for each hop where the amplify-and-forward scheme is employed. We present algorithmic strategies to jointly design linear receivers and the power allocation parameters via an alternating optimization approach subject to different power constraints which include global, local and individual ones. Two design criteria are considered: the first one minimizes the mean-square error and the second one maximizes the sum-rate of the wireless sensor network. We derive constrained minimum mean-square error and constrained maximum sum-rate expressions for the linear receivers and the power allocation parameters that contain the optimal complex amplification coefficients for each relay node. An analysis of the computational complexity and the convergence of the algorithms is also presented. Computer simulations show good performance of our proposed methods in terms of bit error rate and sum-rate compared to the method with equal power allocation and an existing power allocation scheme.

cs.IT↗
arXiv2013

Resolution-aware network coded storage

In this paper, we show that coding can be used in storage area networks (SANs) to improve various quality of service metrics under normal SAN operating conditions, without requiring additional storage space. For our analysis, we develop a model which captures modern characteristics such as constrained I/O access bandwidth limitations. Using this model, we consider two important cases: single-resolution (SR) and multi-resolution (MR) systems. For SR systems, we use blocking probability as the quality of service metric and propose the network coded storage (NCS) scheme as a way to reduce blocking probability. The NCS scheme codes across file chunks in time, exploiting file striping and file duplication. Under our assumptions, we illustrate cases where SR NCS provides an order of magnitude savings in blocking probability. For MR systems, we introduce saturation probability as a quality of service metric to manage multiple user types, and we propose the uncoded resolution- aware storage (URS) and coded resolution-aware storage (CRS) schemes as ways to reduce saturation probability. In MR URS, we align our MR layout strategy with traffic requirements. In MR CRS, we code videos across MR layers. Under our assumptions, we illustrate that URS can in some cases provide an order of magnitude gain in saturation probability over classic non-resolution aware systems. Further, we illustrate that CRS provides additional saturation probability savings over URS.

cs.IT↗
arXiv2012

An Ehrenfeucht-Fraïssé Game for $L_{ω_1ω}$

Ehrenfeucht-Fraisse games are very useful in studying separation and equivalence results in logic. The standard finite Ehrenfeucht-Fraisse game characterizes equivalence in first order logic. The standard Ehrenfeucht-Fraisse game in infinitary logic characterizes equivalence in $L_{\inftyω}$. The logic $L_{ω_1ω}$ is the extension of first order logic with countable conjunctions and disjunctions. There was no Ehrenfeucht-Fraisse game for $L_{ω_1ω}$ in the literature. In this paper we develop an Ehrenfeucht-Fraisse Game for $L_{ω_1ω}$. This game is based on a game for propositional and first order logic introduced by Hella and Vaananen. Unlike the standard Ehrenfeucht-Fraisse games which are modeled solely after the behavior of quantifiers, this new game also takes into account the behavior of connectives in logic. We prove the adequacy theorem for this game. We also apply the new game to prove complexity results about infinite binary strings.

math.LO↗
arXiv2010

Software Requirements Specification of the IUfA's UUIS -- a Team 2 COMP5541-W10 Project Approach

In the 52-page document, we describe our approach to the Software Requirements Specification of the IUfA's UUIS prototype. This includes the overall system description, functional requirements, non-functional requirements, use cases, the corresponding data dictionary for all entities involved, mock user interface (UI) design, and the overall projected cost estimate. The design specification of UUIS can be found in arXiv:1005.0665.

cs.SE↗