Scalar and Tensor Force Contribution to the Nucleon-Nucleon Interaction Within a Chiral Constituent Quark Model

The nucleon-nucleon problem is studied as a six-quark system in a nonrelativistic chiral constituent quark model where the Hamiltonian contains a linear confinement and a pseudoscalar meson (Goldstone boson) exchange interaction between the quarks. This hyperfine interaction has a long-range Yukawa-type part, depending on the mass of the exchanged meson and a short-range part, mainly responsible for the good description of the baryon spectra.Comment: 6 pages (LaTeX with aip-6s.clo, aipproc.cls and aipxfm.sty packages), 2 eps figures. Presented at the II International Workshop on Hadron Physics, 25-29 September, 2002, Coimbra, Portuga

The Lyons Den - Creative Honors Thesis

Daniel is walking to Luke’s house as Luke\u27s mom gives the keys to her 1980s pink Cadillac to Luke. Luke is opposed to driving the Cadillac; however, Daniel is completely for it. Luke reluctantly takes the keys, drives away, hides the car, and walks to school. Rusty, the bully, approaches the boys, and banter starts. Angered, Luke starts to throw a punch. The duo ends up in the principal’s office. Mrs. Francois lightly scolds the boys, but they all leave with smiles. Logan, running for class president, smooth-talks students into voting for him. However, Luke thinks he\u27s up to something. After school, Daniel and Luke start walking home. In the background, Logan and Rusty shake hands. They walk over to eavesdrop behind the fence; it seems as if Logan is blackmailing Rusty. After Logan leaves, Rusty picks up his backpack and throws it against the fence which falls and reveals the duo. Rusty\u27s furious about them spying on him and charges Luke and Daniel who run for their lives. They escape. Daniel and Luke then figure out that Logan is blackmailing Rusty who is trying to get information to exonerate his dad from jail. Information which Logan has

Scenes From A Friendly\u27s Restaurant

In lieu of an abstract, below is the essay\u27s first paragraph. Somehow, when you observe people all your life, it becomes a sort of art. Each individual is distinctly different, a mystery within itself. What intrigues me though is looking for their story: where are they going, who are they looking for, what troubles them--the list is endless. If I possessed the ability to look into each person\u27s mind I would block it out. For the whole purpose of observing others is to use your imagination, make up a story, add other characters--there are countless possibilities. Jason, a close friend of mine, is an excellent player. His mind is in constant overdrive. He has the ability to recite people\u27s lives as if they personally handed him the script

Adding Music to the Math Equation

Depending on the material covered on any particular day, students may end up with anywhere from 5 minutes to 35 minutes to do their homework in class. Unfortunately, students will only stay on task for so long before they get off task. This research project will investigate the effects of playing classical music during in-class work time on the work ethic and environment of the classroom

Optimal pricing for optimal transport

Suppose that $c(x,y)$ is the cost of transporting a unit of mass from $x\in X$ to $y\in Y$ and suppose that a mass distribution $\mu$ on $X$ is transported optimally (so that the total cost of transportation is minimal) to the mass distribution $\nu$ on $Y$. Then, roughly speaking, the Kantorovich duality theorem asserts that there is a price $f(x)$ for a unit of mass sold (say by the producer to the distributor) at $x$ and a price $g(y)$ for a unit of mass sold (say by the distributor to the end consumer) at $y$ such that for any $x\in X$ and $y\in Y$, the price difference $g(y)-f(x)$ is not greater than the cost of transportation $c(x,y)$ and such that there is equality $g(y)-f(x)=c(x,y)$ if indeed a nonzero mass was transported (via the optimal transportation plan) from $x$ to $y$. We consider the following optimal pricing problem: suppose that a new pricing policy is to be determined while keeping a part of the optimal transportation plan fixed and, in addition, some prices at the sources of this part are also kept fixed. From the producers' side, what would then be the highest compatible pricing policy possible? From the consumers' side, what would then be the lowest compatible pricing policy possible? In the framework of $c$-convexity theory, we have recently introduced and studied optimal $c$-convex $c$-antiderivatives and explicit constructions of these optimizers were presented. In the present paper we employ optimal $c$-convex $c$-antiderivatives and conclude that these are natural solutions to the optimal pricing problems mentioned above. This type of problems drew attention in the past and existence results were previously established in the case where $X=Y=R^n$ under various specifications. We solve the above problem for general spaces $X,Y$ and real-valued, lower semicontinuous cost functions $c$

List and Probabilistic Unique Decoding of Folded Subspace Codes

A new class of folded subspace codes for noncoherent network coding is presented. The codes can correct insertions and deletions beyond the unique decoding radius for any code rate $R\in[0,1]$. An efficient interpolation-based decoding algorithm for this code construction is given which allows to correct insertions and deletions up to the normalized radius $s(1-((1/h+h)/(h-s+1))R)$, where $h$ is the folding parameter and $s\leq h$ is a decoding parameter. The algorithm serves as a list decoder or as a probabilistic unique decoder that outputs a unique solution with high probability. An upper bound on the average list size of (folded) subspace codes and on the decoding failure probability is derived. A major benefit of the decoding scheme is that it enables probabilistic unique decoding up to the list decoding radius.Comment: 6 pages, 1 figure, accepted for ISIT 201

On Decoding Schemes for the MDPC-McEliece Cryptosystem

Recently, it has been shown how McEliece public-key cryptosystems based on moderate-density parity-check (MDPC) codes allow for very compact keys compared to variants based on other code families. In this paper, classical (iterative) decoding schemes for MPDC codes are considered. The algorithms are analyzed with respect to their error-correction capability as well as their resilience against a recently proposed reaction-based key-recovery attack on a variant of the MDPC-McEliece cryptosystem by Guo, Johansson and Stankovski (GJS). New message-passing decoding algorithms are presented and analyzed. Two proposed decoding algorithms have an improved error-correction performance compared to existing hard-decision decoding schemes and are resilient against the GJS reaction-based attack for an appropriate choice of the algorithm's parameters. Finally, a modified belief propagation decoding algorithm that is resilient against the GJS reaction-based attack is presented

Important configurations for NN processes in a Goldstone boson exchange model

We study the short-range nucleon-nucleon interaction in a nonrelativistic chiral constituent quark model by diagonalizing a Hamiltonian containing a linear confinement and a Goldstone boson exchange interaction between quarks. A finite six-quark basis obtained from single particle cluster model states was previously used. Here we show that the configurations which appear naturally through the use of molecular orbitals, instead of cluster model states, are more efficient in lowering the six-quark energy.Comment: 17 pages, RevTe