Breaking the Chains of Trafficking: An Educational Program

With popular television shows and films focusing on the issue of sex trafficking, many discursive constructions of the issue allow for a script to be followed and replicated in many anti-trafficking discourses. Ultimately, the constructions of the issue become a basis of understanding on sex trafficking, which can consequentially limit the availability and accuracy of anti-trafficking resources. From examining popular discourses and their construction of sex trafficking on a global and U.S. scale, to creating an educational program designed for college-level courses on the realities of trafficking, this project focuses on de-bunking the myths of sex trafficking on a local level. By using a framework of applied communication and social justice with a Transnational Feminist lens, this creative thesis project examined the ways in which students in select courses at Eastern Illinois University understood sex trafficking prior to the educational program, as well as after the presentations

Breaking the Chains of Trafficking: An Educational Program

With popular television shows and films focusing on the issue of sex trafficking, many discursive constructions of the issue allow for a script to be followed and replicated in many anti-trafficking discourses. Ultimately, the constructions of the issue become a basis of understanding on sex trafficking, which can consequentially limit the availability and accuracy of anti-trafficking resources. From examining popular discourses and their construction of sex trafficking on a global and U.S. scale, to creating an educational program designed for college-level courses on the realities of trafficking, this project focuses on de-bunking the myths of sex trafficking on a local level. By using a framework of applied communication and social justice with a Transnational Feminist lens, this creative thesis project examined the ways in which students in select courses at Eastern Illinois University understood sex trafficking prior to the educational program, as well as after the presentations

Vortex energy and vortex bending for a rotating Bose-Einstein condensate

For a Bose-Einstein condensate placed in a rotating trap, we give a simplified expression of the Gross-Pitaevskii energy in the Thomas Fermi regime, which only depends on the number and shape of the vortex lines. Then we check numerically that when there is one vortex line, our simplified expression leads to solutions with a bent vortex for a range of rotationnal velocities and trap parameters which are consistent with the experiments.Comment: 7 pages, 2 figures. submitte

Emergence of fractal behavior in condensation-driven aggregation

We investigate a model in which an ensemble of chemically identical Brownian particles are continuously growing by condensation and at the same time undergo irreversible aggregation whenever two particles come into contact upon collision. We solved the model exactly by using scaling theory for the case whereby a particle, say of size $x$, grows by an amount $\alpha x$ over the time it takes to collide with another particle of any size. It is shown that the particle size spectra of such system exhibit transition to dynamic scaling $c(x,t)\sim t^{-\beta}\phi(x/t^z)$ accompanied by the emergence of fractal of dimension $d_f={{1}\over{1+2\alpha}}$. One of the remarkable feature of this model is that it is governed by a non-trivial conservation law, namely, the $d_f^{th}$ moment of $c(x,t)$ is time invariant regardless of the choice of the initial conditions. The reason why it remains conserved is explained by using a simple dimensional analysis. We show that the scaling exponents $\beta$ and $z$ are locked with the fractal dimension $d_f$ via a generalized scaling relation $\beta=(1+d_f)z$.Comment: 8 pages, 6 figures, to appear in Phys. Rev.

Skeleton and fractal scaling in complex networks

We find that the fractal scaling in a class of scale-free networks originates from the underlying tree structure called skeleton, a special type of spanning tree based on the edge betweenness centrality. The fractal skeleton has the property of the critical branching tree. The original fractal networks are viewed as a fractal skeleton dressed with local shortcuts. An in-silico model with both the fractal scaling and the scale-invariance properties is also constructed. The framework of fractal networks is useful in understanding the utility and the redundancy in networked systems.Comment: 4 pages, 2 figures, final version published in PR

Physics of Fashion Fluctuations

We consider a market where many agents trade many different types of products with each other. We model development of collective modes in this market, and quantify these by fluctuations that scale with time with a Hurst exponent of about 0.7. We demonstrate that individual products in the model occationally become globally accepted means of exchange, and simultaneously become very actively traded. Thus collective features similar to money spontaneously emerge, without any a priori reason.Comment: 9 pages RevTeX, 5 Postscript figure

The Stable Roommates problem with short lists

We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists SRI that are degree constrained, i.e., preference lists are of bounded length. The first variant, EGAL d-SRI, involves finding an egalitarian stable matching in solvable instances of SRI with preference lists of length at most d. We show that this problem is NP-hard even if d=3. On the positive side we give a (2d+3)/7-approximation algorithm for d={3,4,5} which improves on the known bound of 2 for the unbounded preference list case. In the second variant of SRI, called d-SRTI, preference lists can include ties and are of length at most d. We show that the problem of deciding whether an instance of d-SRTI admits a stable matching is NP-complete even if d=3. We also consider the "most stable" version of this problem and prove a strong inapproximability bound for the d=3 case. However for d=2 we show that the latter problem can be solved in polynomial time.Comment: short version appeared at SAGT 201