Related papers: Color Transparency Assumptions
The concept of color transparency is introduced. This new feature of QCD is characteristic of a gauge theory. It enables strong interactions to be studied in a new domain: scattering amplitudes of transversally small color singlet objects.…
Color representation is essential in computer vision and human-computer interaction. There are multiple color models available. The choice of a suitable color model is critical for various applications. This paper presents a review of color…
Visual illusions may be explained by the likelihood of patches in real-world images, as argued by input-driven paradigms in Neuro-Science. However, neither the data nor the tools existed in the past to extensively support these…
A recent experiment [{\bf Phys. Rev. Lett. 126,082301 (2021)}] used the $(e,e'p)$ reaction on $^{12}$C to search for the effects of color transparency (the absence of final state interactions). Color transparency was said to be ruled out.…
We present an exactly solvable model for photon emission, which allows us to examine the evolution of the photon wavefunction in space and time. We apply this model to coherent phenomena in three-level systems with a special emphasis on the…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
Interpretable classification models are built with the purpose of providing a comprehensible description of the decision logic to an external oversight agent. When considered in isolation, a decision tree, a set of classification rules, or…
Interpretability, trustworthiness, and usability are key considerations in high-stake security applications, especially when utilizing deep learning models. While these models are known for their high accuracy, they behave as black boxes in…
We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…
Several philosophical issues in connection with computer simulations rely on the assumption that results of simulations are trustworthy. Examples of these include the debate on the experimental role of computer simulations \cite{Parker2009,…
A new, model dependent way of uncovering some of the values of the underlying GMSB parameters is proposed. This method is faster than the existing procedures and once enough luminosity is available, can be used to check the consistency of…
We survey some principal results and open problems related to colorings of algebraic and geometric objects endowed with symmetries.
The assumption that a small point-like configuration does not interact with nucleons leads to a new set of sum rules that are interpreted as models of the baryon-nucleon interaction. These models are rendered semi-realistic by requiring…
Recent advancements in AI applications to healthcare have shown incredible promise in surpassing human performance in diagnosis and disease prognosis. With the increasing complexity of AI models, however, concerns regarding their opacity,…
Diffusion models have shown great promise in synthesizing visually appealing images. However, it remains challenging to condition the synthesis at a fine-grained level, for instance, synthesizing image pixels following some generic color…
When predictive models are used to support complex and important decisions, the ability to explain a model's reasoning can increase trust, expose hidden biases, and reduce vulnerability to adversarial attacks. However, attempts at…
Color transparency CT depends on the formation of a wavepacket of small spatial extent. It is useful to interpret experimental searches for CT with a multiple scattering scattering series based on wavepacket-nucleon scattering instead of…
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
Auditors demand financial models be transparent yet no consensus exists on what that means precisely. Without a clear modeling transparency definition we cannot know when our models are "transparent". The financial modeling community…
We define a perfect coloring of a graph $G$ as a proper coloring of $G$ such that every connected induced subgraph $H$ of $G$ uses exactly $\omega(H)$ many colors where $\omega(H)$ is the clique number of $H$. A graph is perfectly colorable…