arXiv subjects

Jiyeon Lee

Publications and source records attributed to Jiyeon Lee.

At least 19 recordsLinked to original sources

arXiv2026

What Gets Lost When Memory Becomes Media? Evaluating AI-Generated Oral History Visualization

What gets lost when memory becomes media? Diaspora oral-history interviews require a double transformation; first-person recollection to third-person scene, present interview room to past time and place. When generative AI performs this transformation, no agreed criteria for success exist. We derive success conditions from oral-history theory, design 15 metrics around three failure modes, and compare a Multi-Agent Scene-decomposition pipeline (MAS) with a Single Summarization Pipeline (SSP) across 82 interviews from diaspora communities, spanning from oral interviews to 6-image sequences. Scene-planning and narrative preservation conflict in the majority of cases, and the narrative-structure strength of the source testimony is the primary predictor of this conflict. We propose a failure-mode-based evaluation framework, an empirical analysis of conflict conditions, and a routing protocol for system selection based on narrative-structure strength.

cs.HC↗

arXiv2025

KFinEval-Pilot: A Comprehensive Benchmark Suite for Korean Financial Language Understanding

We introduce KFinEval-Pilot, a benchmark suite specifically designed to evaluate large language models (LLMs) in the Korean financial domain. Addressing the limitations of existing English-centric benchmarks, KFinEval-Pilot comprises over 1,000 curated questions across three critical areas: financial knowledge, legal reasoning, and financial toxicity. The benchmark is constructed through a semi-automated pipeline that combines GPT-4-generated prompts with expert validation to ensure domain relevance and factual accuracy. We evaluate a range of representative LLMs and observe notable performance differences across models, with trade-offs between task accuracy and output safety across different model families. These results highlight persistent challenges in applying LLMs to high-stakes financial applications, particularly in reasoning and safety. Grounded in real-world financial use cases and aligned with the Korean regulatory and linguistic context, KFinEval-Pilot serves as an early diagnostic tool for developing safer and more reliable financial AI systems.

cs.CL↗

arXiv2025

Tunneling magnetoresistance in altermagnetic RuO$_2$-based magnetic tunnel junctions

Altermagnets exhibit characteristics akin to antiferromagnets, with spin-split anisotropic bands in momentum space. RuO$_2$ has been considered as a prototype altermagnet; however, recent reports have questioned altermagnetic ground state in this material. In this study, we provide direct experimental evidence of altermagnetic characteristics in RuO$_2$ films by demonstrating spin-dependent tunneling magnetoresistance (TMR) in RuO$_2$-based magnetic tunnel junctions. Our results show the spin-splitted anisotropic band structure of RuO$_2$, with the observed TMR determined by the direction of the Néel vector of RuO$_2$. These results reflect the altermagnetic nature of RuO$_2$ and highlight its potential for spintronic applications, leveraging the combined strengths of ferromagnetic and antiferromagnetic systems.

cond-mat.mtrl-sci↗

arXiv2023

A game-theoretic analysis of baccara chemin de fer, II

In a previous paper, we considered several models of the parlor game baccara chemin de fer, including Model B2 (a $2\times2^{484}$ matrix game) and Model B3 (a $2^5\times2^{484}$ matrix game), both of which depend on a positive-integer parameter $d$, the number of decks. The key to solving the game under Model B2 was what we called Foster's algorithm, which applies to additive $2\times2^n$ matrix games. Here "additive" means that the payoffs are additive in the $n$ binary choices that comprise a player II pure strategy. In the present paper, we consider analogous models of the casino game baccara chemin de fer that take into account the $100\,α$ percent commission on Banker (player II) wins, where $0\leα\le1/10$. Thus, the game now depends not just on the discrete parameter $d$ but also on a continuous parameter $α$. Moreover, the game is no longer zero sum. To find all Nash equilibria under Model B2, we generalize Foster's algorithm to additive $2\times2^n$ bimatrix games. We find that, with rare exceptions, the Nash equilibrium is unique. We also obtain a Nash equilibrium under Model B3, based on Model B2 results, but here we are unable to prove uniqueness.

cs.GT↗

arXiv2022

Pulse-Driven Self-Reconfigurable Meta-Antennas

Wireless communications and sensing have notably advanced thanks to the recent developments in both software and hardware. Although various modulation schemes have been proposed to efficiently use the limited frequency resources by exploiting several degrees of freedom, antenna performance is essentially governed by frequency only. Here, we present a new antenna design concept based on metasurfaces to manipulate antenna performances in response to the time width of electromagnetic pulses. We numerically and experimentally show that by using a proper set of spatially arranged metasurfaces loaded with lumped circuits, ordinary omnidirectional antennas can be reconfigured by the incident pulse width to exhibit directional characteristics varying over hundreds of milliseconds or billions of cycles, far beyond conventional performance. We demonstrate that the proposed concept can be applied for sensing, selective reception under simultaneous incidence and mutual communications as the first step to expand existing frequency resources based on pulse width.

physics.app-ph↗

arXiv2020

How strong can the Parrondo effect be? II

Parrondo's coin-tossing games comprise two games, $A$ and $B$. The result of game $A$ is determined by the toss of a fair coin. The result of game $B$ is determined by the toss of a $p_0$-coin if capital is a multiple of $r$, and by the toss of a $p_1$-coin otherwise. In either game, the player wins one unit with heads and loses one unit with tails. Game $B$ is fair if $(1-p_0)(1-p_1)^{r-1}=p_0\,p_1^{r-1}$. In a previous paper we showed that, if the parameters of game $B$, namely $r$, $p_0$, and $p_1$, are allowed to be arbitrary, subject to the fairness constraint, and if the two (fair) games $A$ and $B$ are played in an arbitrary periodic sequence, then the rate of profit can not only be positive (the so-called Parrondo effect), but also be arbitrarily close to 1 (i.e., 100%). Here we prove the same conclusion for a random sequence of the two games instead of a periodic one, that is, at each turn game $A$ is played with probability $γ$ and game $B$ is played otherwise, where $γ\in(0,1)$ is arbitrary.

math.PR↗

arXiv2019

Snackjack: A toy model of blackjack

Snackjack is a highly simplified version of blackjack that was proposed by Ethier (2010) and given its name by Epstein (2013). The eight-card deck comprises two aces, two deuces, and four treys, with aces having value either 1 or 4, and deuces and treys having values 2 and 3, respectively. The target total is 7 (vs. 21 in blackjack), and ace-trey is a natural. The dealer stands on 6 and 7, including soft totals, and otherwise hits. The player can stand, hit, double, or split, but split pairs receive only one card per paircard (like split aces in blackjack), and there is no insurance. We analyze the game, both single and multiple deck, deriving basic strategy and one-parameter card-counting systems. Unlike in blackjack, these derivations can be done by hand, though it may nevertheless be easier and more reliable to use a computer. More importantly, the simplicity of snackjack allows us to do computations that would be prohibitively time-consuming at blackjack. We can thereby enhance our understanding of blackjack by thoroughly exploring snackjack.

math.PR↗

arXiv2019

The tilted flashing Brownian ratchet

The flashing Brownian ratchet is a stochastic process that alternates between two regimes, a one-dimensional Brownian motion and a Brownian ratchet, the latter being a one-dimensional diffusion process that drifts towards a minimum of a periodic asymmetric sawtooth potential. The result is directed motion. In the presence of a static homogeneous force that acts in the direction opposite that of the directed motion, there is a reduction (or even a reversal) of the directed motion effect. Such a process may be called a tilted flashing Brownian ratchet. We show how one can study this process numerically, using a random walk approximation or, equivalently, using numerical solution of the Fokker-Planck equation. Stochastic simulation is another viable method.

math.PR↗

arXiv2019

How strong can the Parrondo effect be?

If the parameters of the original Parrondo games $A$ and $B$ are allowed to be arbitrary, subject to a fairness constraint, and if the two (fair) games $A$ and $B$ are played in an arbitrary periodic sequence, then the rate of profit can not only be positive, it can be arbitrarily close to 1 (i.e., 100%).

math.PR↗

arXiv2018

Game Data Mining Competition on Churn Prediction and Survival Analysis using Commercial Game Log Data

Game companies avoid sharing their game data with external researchers. Only a few research groups have been granted limited access to game data so far. The reluctance of these companies to make data publicly available limits the wide use and development of data mining techniques and artificial intelligence research specific to the game industry. In this work, we developed and implemented an international competition on game data mining using commercial game log data from one of the major game companies in South Korea: NCSOFT. Our approach enabled researchers to develop and apply state-of-the-art data mining techniques to game log data by making the data open. For the competition, data were collected from Blade & Soul, an action role-playing game, from NCSOFT. The data comprised approximately 100 GB of game logs from 10,000 players. The main aim of the competition was to predict whether a player would churn and when the player would churn during two periods between which the business model was changed to a free-to-play model from a monthly subscription. The results of the competition revealed that highly ranked competitors used deep learning, tree boosting, and linear regression.

cs.DB↗

arXiv2017

The flashing Brownian ratchet and Parrondo's paradox

A Brownian ratchet is a one-dimensional diffusion process that drifts toward a minimum of a periodic asymmetric sawtooth potential. A flashing Brownian ratchet is a process that alternates between two regimes, a one-dimensional Brownian motion and a Brownian ratchet, producing directed motion. These processes have been of interest to physicists and biologists for nearly 25 years. The flashing Brownian ratchet is the process that motivated Parrondo's paradox, in which two fair games of chance, when alternated, produce a winning game. Parrondo's games are relatively simple, being discrete in time and space. The flashing Brownian ratchet is rather more complicated. We show how one can study the latter process numerically using a random walk approximation.

math.PR↗

arXiv2016

Optimal conditional expectation at the video poker game Jacks or Better

There are 134,459 distinct initial hands at the video poker game Jacks or Better, taking suit exchangeability into account. A computer program can determine the optimal strategy (i.e., which cards to hold) for each such hand, but a complete list of these strategies would require a book-length manuscript. Instead, a hand-rank table, which fits on a single page and reproduces the optimal strategy perfectly, was found for Jacks or Better as early as the mid 1990s. Is there a systematic way to derive such a hand-rank table? We show that there is indeed, and it involves finding the exact optimal conditional expected return, given the initial hand. In the case of Jacks or Better (paying 800, 50, 25, 9, 6, 4, 3, 2, 1, 0), this is a random variable with 1,153 distinct values, of which 766 correspond to garbage hands for which it is optimal to draw five new cards. We describe the hands corresponding to each of the remaining 387 values of the optimal conditional expected return (sorted from largest to smallest) and show how this leads readily to an optimal strategy hand-rank table for Jacks or Better. Of course, the method applies to other video poker games as well.

math.OC↗

arXiv2015

Parrondo games with two-dimensional spatial dependence

Parrondo games with one-dimensional spatial dependence were introduced by Toral and extended to the two-dimensional setting by Mihailović and Rajković. $MN$ players are arranged in an $M\times N$ array. There are three games, the fair, spatially independent game $A$, the spatially dependent game $B$, and game $C$, which is a random mixture or nonrandom pattern of games $A$ and $B$. Of interest is $μ_B$ (or $μ_C$), the mean profit per turn at equilibrium to the set of $MN$ players playing game $B$ (or game $C$). Game $A$ is fair, so if $μ_B\le0$ and $μ_C>0$, then we say the Parrondo effect is present. We obtain a strong law of large numbers and a central limit theorem for the sequence of profits of the set of $MN$ players playing game $B$ (or game $C$). The mean and variance parameters are computable for small arrays and can be simulated otherwise. The SLLN justifies the use of simulation to estimate the mean. The CLT permits evaluation of the standard error of a simulated estimate. We investigate the presence of the Parrondo effect for both small arrays and large ones. One of the findings of Mihailović and Rajković was that "capital evolution depends to a large degree on the lattice size." We provide evidence that this conclusion is incorrect. Part of the evidence is that, under certain conditions, the means $μ_B$ and $μ_C$ converge as $M,N\to\infty$. Proof requires that a related spin system on ${\bf Z}^2$ be ergodic. However, our sufficient conditions for ergodicity are rather restrictive.

math.PR↗

arXiv2015

The evolution of the game of baccarat

The game of baccarat has evolved from a parlor game played by French aristocrats in the first half of the 19th century to a casino game that generated over US\$41 billion in revenue for the casinos of Macau in 2013. The parlor game was originally a three-person zero-sum game. Later in the 19th century it was simplified to a two-person zero-sum game. Early in the 20th century the parlor game became a casino game, no longer zero-sum. In the mid 20th century, the strategic casino game became a nonstrategic game, with players competing against the house instead of against each other. We argue that this evolution was motivated by both economic and game-theoretic considerations.

math.OC↗

arXiv2015

Counting toroidal binary arrays, II

We derive formulas for $(i)$ the number of toroidal $n\times n$ binary arrays, allowing rotation of rows and/or columns as well as matrix transposition, and $(ii)$ the number of toroidal $n\times n$ binary arrays, allowing rotation and/or reflection of rows and/or columns as well as matrix transposition.

math.CO↗

arXiv2014

Parrondo games with spatial dependence, III

We study Toral's Parrondo games with $N$ players and one-dimensional spatial dependence as modified by Xie et al. Specifically, we use computer graphics to sketch the Parrondo and anti-Parrondo regions for $3\le N\le 9$. Our work was motivated by a recent paper of Li et al., who applied a state space reduction method to this model, reducing the number of states from $2^N$ to $N+1$. We show that their reduced Markov chains are inconsistent with the model of Xie et al.

math.PR↗

arXiv2014

On the three-person game baccara banque

Baccara banque is a three-person zero-sum game parameterized by $θ\in(0,1)$. A study of the game by Downton and Lockwood claimed that the Nash equilibrium is of only academic interest. Their preferred alternative is what we call the independent cooperative equilibrium. But this solution exists only for certain $θ$. A third solution, which we call the correlated cooperative equilibrium, always exists. Under a "with replacement" assumption as well as a simplifying assumption concerning the information available to one of the players, we derive each of the three solutions for all $θ$.

math.OC↗

arXiv2012

Parrondo games with spatial dependence and a related spin system, II

Let game B be Toral's cooperative Parrondo game with (one-dimensional) spatial dependence, parameterized by N (3 or more) and p_0,p_1,p_2,p_3 in [0,1], and let game A be the special case p_0=p_1=p_2=p_3=1/2. Let mu_B (resp., mu_(1/2,1/2)) denote the mean profit per turn to the ensemble of N players always playing game B (resp., always playing the randomly mixed game (1/2)(A+B)). In previous work we showed that, under certain conditions, both sequences converge and the limits can be expressed in terms of a parameterized spin system on the one-dimensional integer lattice. Of course one can get similar results for mu_(gamma,1-gamma) corresponding to gamma A+(1-gamma)B for 0<gamma<1. In this paper we replace the random mixture with the nonrandom periodic pattern A^r B^s, where r and s are positive integers. We show that, under certain conditions, mu_[r,s], the mean profit per turn to the ensemble of N players repeatedly playing the pattern A^r B^s, converges to the same limit that mu_(gamma,1-gamma) converges to, where gamma:=r/(r+s). For a particular choice of the probability parameters, namely p_0=1, p_1=p_2 in (1/2,1), and p_3=0, we show that the Parrondo effect (i.e., mu_B is nonpositive and mu_[r,s] is positive) is present if and only if N is even, at least when s=1.

math.PR↗