How to scan speeds faster than 158 mi/h (255km/h)?
What is causeing this knock? Video included inside.
Please help me understand the autotune etc.
Where are all my E38 pids?
KR maxes out in PE..?
If I increase shift speeds do I also need to increase TCC and shift pressure?
cant get it to idle.
misfire with no codes, need help please!
2010 E38 Camaro 6 speed NO VATS?
2011 Camaro L99 Scan PIDS?
24X to 58X and Vice Versa?
Can you see and filter out cell hits?
SAE TPS and actual TPS opening %?
P1516 DTC truck goes into limp mode.
09 Chevy truck with E38...ASPARK?
Runway lighting on E38 & E67 ECM's?
Pulse width down-duty cyle up?
427 stroker fuel surge help?
Please Help! Major mpg issue after tune!
2001 Suburban 5.3L Cylinder Numbers????
03 suburban mult cylinder misfire???
IAT vs Injector flow, scanners referencing ECT....what?
Better MPG with higher octane = something is wrong with engine???
Why is my Main VE Table zeroing out?
Can you make curve charts using scantool?
Is HP Tuners better for gas engines than EFI Live?
PID's selected but wont show in data tab - HELP!!
LC-1 reading too rich...how program it to correct?
Pulling stored scans from handheld.
when changeing rpm what all needs changeing ?
I'm trying to scan a 2006 equinox but i can't?
What does it take to make the EPA OBD II catalyst monitor complete?
98 silverado 350 no supported pids?
Help! How can I install a new computer from salvage yard tune it & get past theft D.?
Please help with my tune, has idle surge and hesitation at low throttle.
Is the factory PCM capable of doing what I want?
How to load just manual trans calibration to auto calibration tune?
First time tuner. Anyone want to look at my base auto ve tune?
Newbie needs help with Hummer H2 timing question??
Need Help with Idle and Turbo Tuning!
Spooling the turbo with timing.
Need some help with a E67 and T42 files !!!
Full flash a different os into correct service number e67 possible?
not sure If in right location .
Need help asap after update!!!!!!!!
Help setting up wide band to log.


text:
\section{Introduction}
\label{sec:intro}

Quantum contextuality is the property of a quantum system that
a result of any of its measurements might depend on other
compatible measurements that might be carried out on the system.
The so-called Kochen-Specker (KS) sets provide constructive proofs
of quantum contextuality and therefore provide straightforward
blueprints for their experimental setups. KS sets are likely to find
applications in the field of quantum information, similar to ones
recently found for the Bell setups in implementing
entanglements.~\cite{heinbriegel04,cabello-moreno-09}
The most recent result of A.~Cabello \cite{cabello-10-arxiv},
according to which local contextuality can be used to reveal
quantum nonlocality, supports this conjecture. Also our
most recent results
\cite{bdm-ndm-mp-fresl-jmp-10,mp-7oa-arXiv,pavicic-rmp09} show that
KS sets play an important role in Hilbert space description
of complex setups.

A series of KS experiments have been carried out in the last
ten years. The most recent ones made use of quantum gates and
employed recently developed quantum information techniques
of handling, manipulating, and measuring of qubits by means of
quantum circuits of such gates.

The  experiments were proposed, designed, and carried out for
spin$-\frac{1}{2}\otimes\frac{1}{2}$ particles (correlated
photons or spatial and spin neutron degrees of freedom).
\cite{simon-zeil00,michler-zeil-00,cabell-01,ks-exp-03,h-rauch06,cabello-fillip-rauch-08,b-rauch-09,k-cabello-blatt-09-arXiv,amselem-cabello-09-arXiv,liu-09,moussa-09-arXiv}
The KS sets that were used in these experiments were
from $2\times 2=4$-dim Hilbert space. In particular they
were either from the 24-24 class of KS sets (set with 18 through 24
vectors and 9  through 24 orthogonal vector tetrads) or the
Mermin set.\ \cite{pmm-2-09}

They used specified vectors (e.g., \cite{peres})  and relied on
particular orientation of measurement devices along those vectors.
That limited possible implementations of a given KS set.
Therefore in~\cite{pmmm04c,pmm-2-09} we exhaustively generated
all KS sets from the 24-24 class without ascribing coordinates to
Hilbert vector (states, wave function) components. That was done by
means of McKay-Megill-Pavicic (MMP) hypergraph representation
(MMP diagrams). For these hypergraphs it is only important that the
equations that determine vector components of a setup have solutions.
Solutions  themselves can be determined by an algorithm, and
observables need not be grouped or particularly chosen.
E.g., in both 3-dim (spin-1, qutrits) and 4-dim (spin-$\frac{3}{2}$)
KS setups we can make use of generalized Stern-Gerlach devices
\cite{anti-shimony} with outputs corresponding to vector components.

Most recently
\cite{mp-nm-pka-mw-11,waeg-aravind-megill-pavicic-11}
we generated millions of KS sets from a 4-dim 60-75 KS set we obtained
from the so-called  600-cell (the 4-dimensional analog
of the icosahedron)\cite{aravind10-arxiv}. Since they
all stem from this single 60-75 set and since no set from the 24-24
class belongs to it, we call it the {\em 60-75 KS class}. The
experimental implementations of the sets
belonging to this class are straightforward although demanding.
For instance, we let a spin-$\frac{3}{2}$ systems through a series
generalized Stern-Gerlach devices, enabling control over
outcoming directions of particles.~\cite{anti-shimony}
The approach can also be used to make quantum gates that must
be purely quantum for whatever state it applies to.

For any experimental application it is not viable to consider all
possible millions of sets but only those that can be experimentally
distinguished. Hence, we extract critical non-redundant
non-isomorphic KS sets with 26 to 60 vectors from all possible
60-75 KS sets.  ``Critical'' means that they are minimal in the sense
that no orthogonal tetrads can be removed without causing the KS
contradiction to disappear. We found several thousand critical KS
setups that have no experimental redundancies.

In \cite{waeg-aravind-megill-pavicic-11} we developed a
method of exhaustive generation of all those KS sets that allow
the so-called parity proofs (see below). However, the parity proofs
are applicable only to the sets with an odd number of tetrads
of orthogonal vectors, and the aforementioned generation
gives only such sets.

In this paper, we describe a method for
generating all KS sets from the 60-75 KS class,
in particular those sets that we cannot obtain
by our parity-proof-generation method.
While in principle the method is exhaustive, full generation
is at present too demanding for even a large supercomputing
cluster.  Instead, we used random samples of the search
space and applied Bernoulli trial probability analysis to
obtain expected means and confidence intervals.
We obtained these samples using techniques of graph theory and quantum
mechanical lattice theory. Also, since the parity proof method
is faster for obtaining critical KS sets with odd number of
vector tetrads (edges in hypergraphs), we concentrate on even
numbers of tetrads (see Table \ref{table:even}). In this sense our
probabilistic generation method and our parity-proof-generation
method are complementary. Also our present probabilistic generation
method is better at finding a large number of critical sets of
both kinds since it does not depend on the values ascribed to
vectors (vertices in hypergraphs) from the sets.

This study extends our preliminary results reported in
Ref.~\cite{mp-nm-pka-mw-11}.  We will describe the improved algorithms
that have allowed us to go beyond the results of that study and survey a
huge number of possible tetrads from 1 through 75.  In the random sample
used for our survey, they ranged from 26-13 (and suspected to be the
smallest) to a very large one, 60-41.  In addition, based on
statistical extrapolation from our sample, we give an estimation method
according to which there might be a practically unlimited number
($\approx 4.3\cdot 10^{12}$, Fig.~\ref{fig:stat}) of non-isomorphic
critical KS sets that are subsets of the 60-75 set. The
method is however esentially classical, so it might
happen that a future exahustive generation will give far
less numbers of critical sets. If it does, that will show
to which extent quantum data differ from classical
estimations. If it confirms our estimation then we will
have a powerful tool for estimating the reliability of
random generation of critical KS sets. For non-critical
KS sets the exahustive generation of sets with 63 to 75
tetrads already confirmed our estimation; we give
comparative numerical values in Sec.~\ref{sec:con}.

Finally, we will summarize the overall picture of the critical KS sets we
found, describe patterns we have observed in their relative distribution
versus number of vectors and tetrads, and list some open questions about
whether others that we haven't found yet exist and whether, for some
sizes, we have exhausted all possible isomorphism classes.

We make use of theory and algorithms from several
disciplines: quantum mechanics, lattice theory, graph theory, and
geometry.  Thus in the context of our study,
the  term ``vertex'' is synonymous
with the terms ``ray,'' ``atom,'' ``1-dim subspace,'' and ``vector''
that appear in the literature; ``edge''  with the terms
``base,''  ``block,'' and ``tetrad (of mutually orthogonal vectors);'' and
``MMP hypergraph'' with the terms ``MMP diagram'' and
``KS sets.''

\section{Results}
\label{sec:res}

The {\em Kochen-Specker\/  {\rm (KS)} theorem} states that a
quantum system cannot in general possess a definite value of a
measurable property prior to measurement, and quantum
measurements (essentially detector clicks) carried out on
quantum systems cannot always be ascribed predetermined
values (say 0 and 1). This means that two measurements of
the same observable of the same system sometimes
must yield different outcomes in different contexts.
This is called the {\em quantum contextuality\/}.
One way of proving the theorem is to
prove the existence of KS sets, i.e., to provide
algorithms for their constructive generation. The more
abundant they are, the more important the contextuality
of quantum mechanics appears to be.

{\em Kochen-Specker\/ {\rm (KS)} set\/} is a set of vectors $
|\psi_i\rangle,\psi_i'\rangle,\dots$ in ${\cal H}^n$, $n\ge 3$ to
which it is impossible to assign $1$'s and $0$'s in such a way that:
\begin{enumerate}
\item No two orthogonal vectors are both
assigned the value $1$;
\item In any subset of $n$ mutually orthogonal vectors, not all
them are assigned the value $0$.
\end{enumerate}

KS subsets of mutually orthogonal vectors in a 3-dim space we call
triads, in a 4-dim space tetrads, etc. KS set is a union of such
triads, tetrads, etc. of vectors.  They can be represented by means of
MMP hypergraph defined below. In a KS  set, the vectors correspond
to vertices and the tetrads to edges of MMP hypergraphs.

We define MMP hypergraphs as follows\ \cite{pmmm04c}
\begin{itemize}
\item[(i)] Every vertex belongs to at least one edge;
\item[(ii)] Every edge contains at least 3 vertices;
\item[(iii)] Edges that intersect each other in $n-2$
         vertices contain at least $n$ vertices.
\end{itemize}

This definition enables us to formulate algorithms for exhaustive
generation of MMP hypergraphs.  We
work with subsets of the starting hypergraph, the 60-75 one, so
the job of generating the hypergraphs amounts to a creation of
all possible subsets of the 60-75 set with a specified number of edges
deleted.  The ``only'' difficulty we face is the shear size of these
generated subsets---we are dealing with a haystack of $2^{75}$ or 38
sextillion subsets, in which we wish to find certain ``needles'' i.e.
critical KS sets.  Our primary purpose is to survey the $2^{75}$
subsets to gain an overview of what critical sets are inside.

The hypergraphs we obtain reflect only the orthogonal structure
of KS sets and do not in any way refer to the vector components of the
original 60-75 KS set. This is yet another aspect in which the present
method differs from the parity-proof method we used in
\cite{waeg-aravind-megill-pavicic-11}, which relies on
the vector components of the vector in each KS sets that were
inherited from the original 60-75 set. For each hypergraph
we can however find appropriate vector components by our
program {\tt vectorfind} or by interval analysis we developed in
~\cite{pmmm04c}. These components need not have the
values the vector components have in the 60-75 set.

\font\1=cmss8
\font\2=cmssdc8
\font\3=cmr8
\font\4=cmss7

We encode MMP hypergraphs by means of alphanumeric
and other printable ASCII characters. Each vertex
is represented by one of the following
characters: {\11 2 3 4 5 6 7 8 9 A B C D E
F G H I J K L M N O P Q R S T U V W X Y Z a b c d
e f g h i j k l m n o p q r s t u v w x y z ! " \#
{\scriptsize\$} \% \& ' ( ) * - / : ; $<$ = $>$ ?
@ [ {\scriptsize$\backslash$} ] \^{} \_
{\scriptsize$\grave{}$} {\scriptsize\{} {\scriptsize$|$}
{\scriptsize\}} {\scriptsize\~{}}}\ , and then again all
these characters prefixed by `+', then prefixed by `++',
etc. There is no upper limit on the number of characters.

Each edge is represented by a string of characters that
represent vertices (without spaces). Edges are separated by
commas (without spaces). All edges in a line form a
representation of a hypergraph.  The order of the edges is
irrelevant---however, we shall often present them
starting with edges forming the biggest loop to facilitate
their possible drawing.  The line must end with a full stop.
Skipping of characters is allowed.

In Figs.~\ref{fig:30-15a} and \ref{fig:30-15b} we show a
graphical representation of 3 critical KS hypergraphs from
\cite{mp-nm-pka-mw-11,waeg-aravind-megill-pavicic-11}
which are drawn by hand and a new one that is drawn by our
programs for automated drawing of MMP hypergraphs.
The MMP notation for  hypergraphs  in
Figs.~\ref{fig:30-15a} and \ref{fig:30-15b}$\,$(a)  is given in
\cite{mp-nm-pka-mw-11} and for 38-19 in Fig.~\ref{fig:30-15b}
it reads {\noindent\1
A9BC,CE8D,DNMO,OQJP,PV1R,RLGS,SZ5a,ac4Y,YKIX,XW2T,TU6A,1234,5678,FGHE,IJH7,\break
KLMB,VWN9,bcQF,bZU3.}

\begin{figure}[hbt]
\includegraphics[width=0.4\textwidth]{ara-critical-26-13.eps}\qquad\qquad
\includegraphics[width=0.4\textwidth]{ara-critical-30-15a-s.eps}\quad%
\caption{\label{fig:30-15a}Critical KS sets 26-13 and 30-15.
They, as well as other figures with odd number of edges below,
vividly illustrate the parity proof: all vertices share two edges.}
\end{figure}

\begin{figure}[hbt]
\includegraphics[width=0.44\textwidth]{ara-critical-34-17b.eps}\qquad
\includegraphics[width=0.48\textwidth]{ara-critical-38-19.eps}%
\caption{\label{fig:30-15b}Critical KS sets 34-17
and 38-19. The latter one is drawn by {\tt Asymptote} (vector graphic
language). By changing parameters one can interactively control and
change the shape of each edge line and unambiguously discern vertices
that share an edge.}
\end{figure}

{\it Parity Proof.\/} By looking at the KS hypergraphs shown
in Figs.~\ref{fig:30-15a} and \ref{fig:30-15b}, we see
that we cannot ascribe values 0 and 1 to all vertices so
that in each edge we ascribe 1 to one of the vertices and
0 to the others. Namely, in all these hypergraphs,
each vertex shares exactly two edges, so there should be an
even number of 1s. At the same time, each edge must contain
one 1 by definition, and since there are an odd number of edges,
there should be an odd number of 1s---a contradiction. This is
the simplest form of the parity proofs of the Kochen-Specker
theorem on KS sets.

In these parity proofs, as well as in more involved ones we give
in \cite{waeg-aravind-megill-pavicic-11}, the essential
part of the proof is that we have an odd number of edges.
We found 90 kinds of such critical KS sets starting with a 26-13
and ending with a 60-41 one and presented them
qualitatively in Table 3 of
Ref.~\cite{waeg-aravind-megill-pavicic-11}.
These KS set we found by means of the parity proofs in
Ref.~\cite{waeg-aravind-megill-pavicic-11}, but not by
the algorithms we used for this paper, we indicated by
``$\otimes$'' in Table~\ref{table:even} below.

In Table~\ref{table:even} and Fig.~\ref{fig:stat}, we show the
distribution and numbers for each kind that were found by the
random sampling of our present survey.

We prove the impossibility of assigning 0 and 1 to vertices by means
our program {\tt states01}, which exhaustively tests
each hypergraph. For KS sets with an odd number of edges, we can
also quickly verify their KS property with the help of the parity
proof.

In the sample used for our survey, on average $3\cdot 10^8$ for
each of 13--63 edges (1--12 and 64--75 were exhaustively scanned), we
obtained 35 kinds of  critical KS sets with an even number of
edges, which cannot be obtained by the parity-proof method.
We also obtained 62 kinds of critical KS sets with an odd number of
edges. They are all among 90 kinds of KS critical sets we obtained by
the parity-proof method in \cite{waeg-aravind-megill-pavicic-11}.
Those that we did not obtain in our samples are indicated
by ``$\otimes$'' in Table~\ref{table:even}. Our scanning in
\cite{waeg-aravind-megill-pavicic-11} was designed to obtain as
many different kinds of critical sets as possible. So, we always stopped
scanning as soon as we found a new kind and therefore we cannot
estimate numbers of critical sets of each kind that would correspond
to to numbers obtained in this paper and shown in Table~\ref{table:even}.

\begin{table}[hbt]
\addtolength{\tabcolsep}{-4.25pt}
{\1\begin{tabular}{|c||c|c|c|c|c|c|c|c|c|c|c|c|c|c|c||c|c|c|c|c|c|c|c|c|c|}
\hline&\multicolumn{15}{|c||}{\2critical KS sets with odd
  number of edges}&\multicolumn{9}{|c|}{\2\dots\ with even number of edges}\\
\hline \hline
{\2ver}&13&15&17&19&21&23&25&27&29&31&33&35&37&39&41&24&26&28&30&32&34&36&38&40\\[-2.5pt]
\hline \hline
26&1&&&&&&&&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline\hline
30&&3&&&&&&&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline
32&&&1&&&&&&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline
33&&&2&&&&&&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline
34&&&5&&&&&&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline\hline
36&&&&11&&&&&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline
37&&&&9&&&&&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline
38&&&&6&10&&&&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline
39&&&&&30&&&&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline
40&&&&&38&10&&&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline
41&&&&&22&5&&&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline
42&&&&&6&16&3&&&&&&&&&1&&&&&&&&\\[-2.5pt]
\hline
43&&&&&&22&38&&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline
44&&&&&&14&16&$\otimes$&&&&&&&&&&&&&&&&\\[-2.5pt]
\hline
45&&&&&&3&5&32&&&&&&&&&2&&&&&&&\\[-2.5pt]
\hline
46&&&&&&1&3&130&$\otimes$&&&&&&&&&3&&&&&&\\[-2.5pt]
\hline
47&&&&&&&1&74&$\otimes$&&&&&&&&&6&&&&&&\\[-2.5pt]
\hline
48&&&&&&&2&19&9&$\otimes$&&&&&&&&11&&&&&&\\[-2.5pt]
\hline
49&&&&&&&$\otimes$&$\otimes$&11&1&&&&&&&&3&9&&&&&\\[-2.5pt]
\hline
50&&&&&&&1&$\otimes$&7&13&&&&&&&&&39&&&&&\\[-2.5pt]
\hline
51&&&&&&&&$\otimes$&1&33&$\otimes$&&&&&&&&19&18&&&&\\[-2.5pt]
\hline
52&&&&&&&&$\otimes$&$\otimes$&37&33&&&&&&&&4&69&&&&\\[-2.5pt]
\hline
53&&&&&&&&$\otimes$&$\otimes$&11&114&$\otimes$&&&&&&&1&73&45&&&\\[-2.5pt]
\hline
54&&&&&&&&$\otimes$&$\otimes$&$\otimes$&153&16&&&&&&&&26&275&&&\\[-2.5pt]
\hline
55&&&&&&&&&$\otimes$&1&56&158&$\otimes$&&&&&&&5&339&25&&\\[-2.5pt]
\hline
56&&&&&&&&&$\otimes$&$\otimes$&21&241&28&&&&&&&&136&262&&\\[-2.5pt]
\hline
57&&&&&&&&&&$\otimes$&1&133&378&&&&&&&&54&448&45&\\[-2.5pt]
\hline
58&&&&&&&&&&$\otimes$&$\otimes$&30&678&27&&&&&&&2&256&493&\\[-2.5pt]
\hline
59&&&&&&&&&&&$\otimes$&2&308&381&&&&&&&1&55&864&16\\[-2.5pt]
\hline
60&&&&&&&&&&&$\otimes$&$\otimes$&48&562&1&&&&&&&5&316&145\\
\hline
\end{tabular}}
\caption{List of KS critical sets we obtained in this paper. By $\otimes$
we indicate the existence of KS critical sets (at least
one set) we obtained in \cite{waeg-aravind-megill-pavicic-11} by
the parity proof method. The average sample sizes of
$3\cdot 10^8$ sets used here were too small
to obtain them by our algorithms/programs.}
\label{table:even}
\end{table}

In Figs.~\ref{fig:even24-30a}, \ref{fig:even24-30b},
\ref{fig:54-34a},  and \ref{fig:54-34b}, we show some
further examples of hypergraphs automatically drawn
by our program written in {\tt Asymptote}.

In the MMP notation for these (shown below), the
numbers in parentheses [$(n)$] are the size of
the maximal loops ($n$-gons) that the
edges can form. The first $n$ edges (tetrads) form $n$-gons.
We obtain them by our program {\tt loopbig\/}. Additional examples of
hypergraphs of each kind not given here are listed in \ref{sec:app}.

There are three types of edges in an MMP hypergraph
\newcommand{\setlength{\itemsep}{0pt} \setlength{\parskip}{0pt} \setlength{\leftskip}{7.7em}}{\setlength{\itemsep}{0pt} \setlength{\parskip}{0pt} \setlength{\leftskip}{7.7em}}
\begin{itemize}
\setlength{\itemsep}{0pt} \setlength{\parskip}{0pt} \setlength{\leftskip}{7.7em}
\item[\hbox to 80pt{\em Polygon edges\hfill}]those that form the
  $n$-gon.
\item[\hbox to 80pt{\em Free edges\hfill}]those that contain vertices
  that do not belong to the $n$-gon.
We call that latter vertices {\em free vertices\/}.
\item[\hbox to 80pt{\em Span edges\hfill}]all others.
\end{itemize}

To better discern the vertices in an MMP hypergraph with over 24
vertices and over 40 edges, we usually represent them by two
figures---one showing the $n$-gon with free edges and the other showing
the $n$-gon with span edges.

{\noindent {\em 42-24} \ (13) \  {\1
    3124,4VIU,UX97,7586,6WOd,dHBT,TRSM,MKJL,LcCb,bPGf,fgAe,eYQa,aZE3,
   9ABC,DEF8,GHIJ,NOPQ,WXYF,ecVD,gUSO,ZTN7,bWR2,fK63,eJ72.}}
Shown in Figs.~\ref{fig:even24-30a}..

{\noindent {\em 50-30}  \  (15) \ {\1
   3124,4DEF,Fm6i,ihbP,POQJ,JHIG,GoCj,jkKS,SRTU,UeLd,dl7W,WVNX,Xg8f,fnAZ,
ZYa3,5678,9ABC,KLMN,bcaM,TQFC,ecEB,lkPA,mdZO,mgRI,iYKH,njcW,jhg4,VHA4,oaR7,
oife.}} \quad Shown in Fig.~\ref{fig:even24-30b}.

{\noindent {\em 54-34} \ (16) \ {\1
    1234,4567,789A,ABCD,DEFG,GHIJ,JKLM,MNOP,PQRS,STUV,VWXY,YZab,bcde,
    efgh,hijk,klm1,3EQb,5DWl,7JYk,8Ubl,CHXe,DKTa,EMfm,OTck,2nLZ,3To9,6FLq,7Nen,Bonm,\break
    IQWn,Ipdi,LRlp,Srsj,Ugrq.}}  \quad Shown in Fig.~\ref{fig:54-34a}.

{\noindent {\em 60-40} \ (18) \ {\1
     3124,4576,6yau,uvVt,trqs,soTP,Pxh9,98AB,BpWM,MJLK,KicU,UwOl,lmnk,kjSH,
     HGIF,FCED,DYRf,feg3,,NOPM,QRSB,TUVW,XYZW,abcd,hiI2,odZS,pjc7,qLA6,wtbH,xvpg,yxnR,
rhSJ,vOEA,mYP6,ieCB,oneG,ncXA,ulhf,reaO,wpoD,slB4}}
\quad Shown in Fig.~\ref{fig:54-34b}.

To obtain these hypergraphs, we used a procedure that strips one edge at a
time.  For $n$ input hypergraphs each with $b$ edges, $n\cdot b$ output
hypergraphs, each with $n-1$ edges, were generated.  After
passing these output hypergraphs through several filters to eliminate
unconnected hypergraphs,
duplicates, non-KS (colorable) sets, and isomorphic sets, a smaller
number of hypergraphs usually resulted.  In order to keep the run time
feasible, we took a semi-random\footnote{We say ``semi-random'' because
while we chose random edges from each input hypergraph, we did not
choose random input hypergraphs.  This may have a small effect on
some of the inferred statistics; see the first paragraph of
\ref{sec:appstat}.} sample of the generated hypergraphs so that in
the end we would have approximately the same number $n$ of hypergraphs to
send to the next edge-stripping step.

\begin{figure}[hbt]
\includegraphics[width=0.45\textwidth]{ara-critical-42-24a.eps}\qquad \qquad
\includegraphics[width=0.37\textwidth]{ara-critical-42-24b.eps}
\caption{\label{fig:even24-30a} Critical KS sets with even number of
edges. (a,b) presentations of 42-24 using the
biggest loop (13-gon): (a) 13-gon with only free edges; (b) with only
span edges; tension of the lines in (b) is higher for better
discerning of the edges.}
\end{figure}

\begin{figure}[hbt]
\includegraphics[width=0.45\textwidth]{ara-critical-50-30a.eps}\qquad
\includegraphics[width=0.42\textwidth]{ara-critical-50-30b.eps}
\caption{\label{fig:even24-30b} (a,b) 50-30 (15-gon): (c) free edges only;
(d) span edges only. We can add or delete vertices and edges [as in
of Fig.~\ref{fig:even24-30a} and Fig.~\ref{fig:54-34b}]
according to an algorithm so as to obtain sub-hypergraphs for
various applications, e.g, finding Hilbert space equations for quantum
systems.~\cite{bdm-ndm-mp-fresl-jmp-10,mp-7oa-arXiv}}
\end{figure}

The programs we used and their algorithms are described in Sec.~\ref{sec:alg}.
We used the program {\tt mmpstrip} to strip edges from
starting hypergraphs.  We adjusted the increment parameter of {\tt
mmpstrip} so that, after each edge removal and post-processing step, we
ended up with a sample of a desired size, say 50,000 hypergraphs.  We
ended up with 64 sample sets of up to 50,000 hypergraph each, with one
sample set for each hypergraph size from 12 through 75 edges.  For
12 edges and less, no KS sets have ever remained, probably because
they don't exist.

The complete processing of the samples sets of this size, including
finding all of the critical KS hypergraphs among them, took about 4 days
on a single CPU.  We ran 200 such jobs on a cluster, then combined the
results.  The random selection and the large sample space ensured that
we would have, with high probability, completely different samples on
successive program runs.  Except near the extreme edge sizes of 75 and
12 where the sample space is essentially exhausted, we never found a
duplicated hypergraph in our spot checking.

\begin{figure}[hbt]
\begin{center}
\includegraphics[width=0.99\textwidth]{ara-critical-54-34.eps}
\end{center}
\caption{\label{fig:54-34a}  A critical 54-34 KS set shown in two
figures. (a) A maximal 16-gon + span edges; (b) 16-gon + free edges.}
\end{figure}

\begin{figure}[hbt]
\begin{center}
\includegraphics[width=0.42\textwidth]{ara-critical-60-40a.eps}\qquad
\includegraphics[width=0.48\textwidth]{ara-critical-60-40b.eps}
\end{center}
\caption{\label{fig:54-34b} A critical 60-40 set;
(a) A maximal 18-gon + free edges; (b) 18-gon + span edges. Letters
and edges might appear overcrowded, but the MMP hypergraph
offers a clear alternate representation for each of them. Also, by means of our
programs, they can be easily discerned textually and visually.
Actually, when an MMP figure of a KS set is shown as a figure, we
need not give ASCII characters at all---we can always ascribe them
to vertices in an arbitrarily chosen way later on.}
\end{figure}

The overall iterative procedure we used is as follows.  We started with
the MMP hypergraph for the 60-75 KS set.
\begin{enumerate}
\item
We started with the 60-75 KS set and with  {\tt mmpstrip} obtained
75 new 60-74 sets---each with one less edge
than the original 60-75. Then we repeated the procedure
to obtain 2775 new 60-73 sets, etc.\ but not more than 50,000 hypergraphs
(or a million for some studies) to keep the run time reasonable.
We used {\tt mmpstrip}'s increment parameter $i$, which selects every $i$th
edge on average, to achieve this limit.
The increment parameter can be a non-integer
to better control the output size.  When it is greater than 1,
the edges can be selected either with uniform spacing or randomly;
the latter option was usually chosen.
\item A hypergraph is {\em connected} if there is a chain of zero or
more edges connecting every pair of edges.  Unconnected hypergraphs
were removed with {\tt mmpstrip}.
\item  Duplicate hypergraphs result when one edge is removed
at a time (rather than multiple edges combinatorially).
These duplicates were removed.
\item
  Isomorphic hypergraphs were removed with {\tt shortd}.
\item
  Colorable hypergraphs were filtered out with {\tt states01},
  leaving only non-colorable ones (i.e.\ KS sets).
\end{enumerate}
Typically, we first ran these steps on  a small
sample of the hypergraphs (a hundred or so) so that the increment
parameter for each {\tt mmpstrip} call could be estimated,
in order to end up with the same number of output hypergraphs as
input hypergraphs after each edge removal step.

We examined the final set of MMP hypergraphs obtained after each iteration
of the above process in order to determine which hypergraphs were critical,
using an option of the {\tt states01} program.  Any critical sets found
were collected for analysis.

The advantage of stripping one edge at a time then filtering at each
stage is that many fewer MMP hypergraphs had to be examined, because at
each step we consider only the non-isomorphic KS sets from the previous
step.  For example, from Fig.~\ref{fig:stat} (below), there are
$3.1\cdot 10^{20}$ hypergraphs with 28 edges, of which only $1.6\cdot
10^{13}$ are KS sets.  The 23 critical sets were were found by examining
a sample of only $6\cdot 10^7$ KS sets rather than $1.2\cdot 10^{15}$
starting MMP hypergraphs that would have been required, representing a
speedup factor of about 20 million.

\section{Algorithms}\label{sec:alg}

For the purpose of the KS theorem, the vertices of an MMP hypergraph are
interpreted as rays, i.e.\ 1-dim subspaces of a Hilbert space, each
specified by a representative (non-zero) vector in the subspace.  The
vertices on a single edge are assumed to be mutually orthogonal rays or
vectors.  In order for an MMP hypergraph to correspond to a KS set,
first there must exist an assignment of vectors to the vertices such
that the orthogonality conditions specified by the edges are satisfied.
Second, there must not exist an assignment (sometimes called a
``coloring'') of 0/1 (non-dispersive or classical) probability states to
the vertices such that each edge has exactly one vertex assigned to 1
and others assigned to 0.

For a given MMP hypergraph, we use two programs to confirm these two
conditions.  The first one, {\tt vectorfind}, attempts to find an
assignment of vectors to the vertices that meets the above requirement.
This program is described in Ref.~\cite{pmm-2-09}.  The second program,
{\tt states01}, determines whether or not a 0/1 coloring is possible
that meets the above requirement.  The algorithm used by {\tt states01}
is described in Ref.~\cite{pmmm03a}.  An additional option was added to
{\tt states01} to determine if a hypergraph is critical i.e.\ whether the
hypergraph is non-colorable but becomes colorable if any single edge is removed.

The 60-vertex, 75-edge MMP hypergraph based on the 600-cell described
above (which we refer to as 60-75) has been shown to be a KS set.\
\cite{aravind-600} However, it has redundancies (is not a critical set)
because we can remove edges from it and it will continue to be a KS
set.  The purpose of this study was to try to find subsets of the 60-75
hypergraph that are critical i.e.\ that are minimal in the sense that if
any one edge is removed, the subset is no longer a KS set.

While the program {\tt vectorfind} independently confirmed that 60-75
admits the necessary vector assignment, such an assignment remains valid
when a edge is removed.  Thus it is not necessary to run {\tt
vectorfind} on subsets of 60-75.  However, a non-colorable (KS) set
will eventually admit a coloring when enough edges are removed, and the
program {\tt states01} is used to test for this condition.

A basic method in our study was to start with the 60-75 hypergraph and
generate successive subsets, each with one or more edges stripped off
of the previous subset, then keep the ones that continued to admit no
coloring and discard the rest.  Of these, ones isomorphic to others were
also discarded.

The program {\tt mmpstrip} was used to generate subsets with edges
stripped off.  The user provides the number of edges $k$ to strip from
an input MMP hypergraph with $n$ edges, and the program will produce
all $\binom{n}{k}$ subsets with a simple combinatorial algorithm that
generates a sequence of subsets known as the ``banker's sequence.''
\cite{loughry-subset}
Partial output sets can be generated with start and end parameters.
By default, {\tt mmpstrip} will scan linearly through the edges to pick
every $i$th one when the increment parameter is $i$.  The program will
optionally randomise this edge selection, so that while a fraction
$1/i$ of edges is picked from each input hypergraph, which edges are
picked are random. The goal of this feature is to lessen the chance of
a biased selection due to a pattern that is repeated for every
hypergraph (such as removing only the first edge from each hypergraph).
It is hoped that the samples would thus provide a more
uniform representation of the search space.

Optionally, {\tt mmpstrip} can take truly random samples with
replacement (for a given number of edges) from the starting 60-75 MMP
hypergraph (in contrast to the semi-random method of the previous
paragraph).  This mode was used to verify or improve some of the
statistical estimates in Fig.~\ref{fig:stat}.  A cryptographic hash of
the time of day, process ID, and CPU time is used as the seed for the
pseudo-random number generator.  The seed may also be provided by the
user in order to repeat a result.

The {\tt mmpstrip} program will optionally suppress MMP hypergraphs
that are not connected, such as those with isolated edges or two
unconnected sections, since these are of no interest.  The
output lines are by default renormalized (assigned a canonical vertex
naming), so that there are no gaps in the vertex naming as is required by
some other MMP processing programs.

In order to detect isomorphic hypergraphs, one of two programs was used.
For testing small sets of hypergraphs, we used the program {\tt
subgraph} described in Ref.~\cite{pmm-2-09}, which has the advantage of
displaying the isomorphism mapping for manual verification.  For a large
number of hypergraphs, we used Brendan McKay's program {\tt shortd},
which has a much faster run time.

Program {\tt longest} singles out longest loops from the list of all
possible loops (which is the output of the program {\tt loopbig}).
Programs {\tt parse} or \verb|parse_all| then ``write'' a
program or programs in the vector graphics language {\tt Asymptote}
for drawing a chosen hypergraph or all hypergraphs, respectively.

The longest loop of each hypergraph is drawn as $n$--sided regular
(equilateral and equiangular) polygon, where $n$ is the number of
edges in the loop.
By default, free vertices, i.\,e.\ vertices that are not on the
loop, are placed inside the polygon, off--centre, on vertical
lines, with not more than 4 vertices on one line, but the user can change
options for their placement.
Edges contained in the longest loop are drawn as straight lines,
while other edges are drawn as B\'ezier curves (specifically,
{\tt Asymptote} is based on Donald Knuth's
{\footnotesize\sf METAFONT}).  The user can interactively
change the ``tension'' of
the curve and the amount of ``curl'' at its endpoints,
in order to interactively control and change the shape of each
edge line and unambiguously discern vertices that share an edge.

\section{Sample Space Statistics}\label{sec:stat}

There are $3.8\cdot 10^{22}$ possible subsets of the 60-75 set
(disregarding any symmetry) and, among them, approximately $7.5\cdot
10^{17}$ KS sets.  An exhaustive search for critical KS sets was
not feasible for the present survey, but it may become feasible in
the future, possibly requiring a year or more on a large computer
cluster.

For our survey, we searched a total of around $10^{10}$ KS sets,
randomly chosen for a given edge size, to find the critical KS sets
among them.  We then performed a statistical analysis to estimate the
total number of critical KS sets that would be found by an exhaustive
search.  The final result is that we can expect a total of $4.3\cdot
10^{12}$ non-isomorphic critical sets, with a 95\% confidence interval
between $4.0\cdot 10^{12}$ and $4.6\cdot 10^{12}$ based on the
statistical model we used.

If an exhaustive search is performed, it is possible to store the
complete set of non-isomorphic critical sets with current technology.
Without compression, each critical set (in MMP hypergraph notation)
requires an average of about 260 bytes, thus requiring $260\cdot 4.3\cdot
10^{12}=1.1\cdot 10^{15}$ bytes (1.1 petabytes) of storage.  This could
probably be reduced considerably with data compression techniques.

The plots of Fig.~\ref{fig:stat} provide an overview of the subsets of
60-75, broken down by the number of edges.  These plots are intended to
provide a guideline for estimating the work that would be required for an
exhaustive search for a particular number of edges or range of them.

\begin{figure}[hbt]
\includegraphics[width=0.98\textwidth]{crit-plot-01.eps}
\caption{\label{fig:stat}Overall statistics calculated for
subsets of 60-75 given on a logarithmic scale.
The samples (for 13-63 edges; 64-75 search was exhaustive)
contained on average $3\cdot10^8$
MMP hypergraphs. ``Observed odd (even) criticals'' refer to
odd (even) numbers of {\em critical\/} KS sets. The sudden jump
in the ``estimated max  crit.'' plot at 53 edges
is caused by a change in the sample size, as explained in
the text.  The ``estimated min crit.'' points are not plotted when
they are zero. The ``estimated max  crit.''\ for more than 63 edges
are not shown since the exhaustive search found no criticals there.}
\end{figure}

The details of the statistical methods we used, as well as a more detailed
description of Fig.~\ref{fig:stat}, are given in \ref{sec:appstat}.

In our survey, no critical sets were observed in KS sets with 42 or more
edges.  In these cases, the ``estimated max crit.'' in
Fig.~\ref{fig:stat} has little to do with the number of critical sets (if
any) that actually exist in that edge range.  Instead, it could be
interpreted as ``zero with statistical noise'' and is primarily a
function of the number of samples we took and the search space size for
the particular edge size.  It simply indicates that, based on a
Bernoulli trial probability model, it is unlikely (with
95\% confidence) that there are {\em more} critical sets than ``estimated
max crit.''  The sudden jump between 52 and 53 edges is due to the fact
that we changed the number of samples from $5.3\cdot 10^7$ per edge size
to $8.6\cdot 10^6$.  If an exhaustive search shows that there are no
critical sets at all above 41 edges, that will be completely consistent
with the ``estimated max crit.'' bound.  In fact, we would conjecture
that the actual number of critical sets will be identically zero very
soon after 41 edges (see the last paragraph of \ref{sec:appstat}).

\section{Conclusions}
\label{sec:con}

Kochen-Specker (KS) sets and setups proposed, designed, and
experimentally carried out so far were either  3-, 4-, 8-, \dots
dimensional KS sets (Peres', Cabello's, etc.) or the Mermin set.
They aim at finding particular valuation of the KS observables
that prove the quantum contextuality and disprove any noncontextual
classical valuations of those observables. Our aim is to make KS
sets independent of a particular choice of either vectors or
observables so as to make them suitable for building quantum gates
within a would-be quantum circuit.

For this application, we should have a choice of gates of different
sizes, that is, consisting of sufficiently many vectors and sufficiently
many gates for a chosen number of vectors, and this is what we
achieved in the previous sections.  We generated a large number of
4-dim critical non-redundant non-isomorphic KS sets
with 26 to 60 vectors based on the 600-cell (the 4-dimensional analog
of the icosahedron).  ``Critical'' means that no orthogonal tetrads can
be removed without causing the KS contradiction to disappear.
In other words, they represent a KS setup that has no experimental
redundancy.

The generation was achieved by algorithms and computer programs
described in Sec.~\ref{sec:alg}, with which we found the critical sets
summarized in Fig.~\ref{fig:stat}. Previously, only two 30-15
critical KS sets were found by Waegell and Aravind \cite{aravind10}
as well as a new third class. In this work, we have extended our
previous study of up to 19 edges \cite{mp-nm-pka-mw-11} to sample
the entire range of all 60-75 subsets. The number of critical
sets with the lowest number of edges,
13 through 19, appears comparatively small, and it is feasible to
find all of them with an exhaustive search. Beyond that, the number
of non-isomorphic classes becomes very large and attempting their
generation now would take too many CPU months on the grid. In
Sec.~\ref{sec:stat} and \ref{sec:appstat},
we give the detailed statistical estimates of the
total critical sets that exist based on our samples.
The statistical techniques we used are general-purpose
and can be useful for any similar experiment in which
an exhaustive enumeration of outcomes is not feasible.

We stress here that critical sets obtained by a
future exhaustive generation might well be far less
numerous then their statistical estimates given above.
That would be yet another proof of how different
quantum sets are from classical ones and how cautious we
should be when interpreting classical statistical methods
applied to quantum data. This is also the reason why we
have not and could not have made any realistic predictions
on numerosity and existence of critical sets that might
be observed in the future but have not been observed so far.
All we can say right now is that the predicability of the total
number of KS sets is in good agreement with the data we
so far obtained by exhaustive generation. For example, by
exhaustive generation of KS sets with 63, 64, 65, and 66
edges we obtain $1.8\cdot 10^9$, $4.1\cdot 10^8$,
$1.0\cdot 10^8$, and $1.1\cdot 10^7$ sets versus
estimated $1.8\cdot 10^9$, $3.4\cdot 10^8$,
$5.7\cdot 10^7$, and $8.8\cdot 10^6$, respectively.

The main theoretical results of our generation are that
\begin{itemize}
\item the 24-24 and the 60-75 classes are disjoint (in the sense
that the biggest set of the 24-24 class is the single Peres' 24-24
set and the smallest set from the 60-75 class is the 26-13 one;
\item the maximal loop of all sets from the 24-24 class is always
a hexagon while the maximal loops of the sets from the 60-75
class grow (form at least an octagon) as the number of vectors and
edges increase (see Figs.~\ref{fig:30-15a}-\ref{fig:54-34b});
\item there is an unexpectedly large and rich universe with an
estimated \mbox{$4.3\cdot 10^{12}$} non-isomorphic critical sets
inside of the 60-75;
\item in \cite{bdm-ndm-mp-fresl-jmp-10} we found that one of the
known 3-dim KS sets passes a series of equations that hold in any
Hilbert space---the so-called orthoarguesian equations. We have
not found any such KS set in the 60-75 class so far. Both results
show that orthogonality of vectors does not suffice for a complete
Hilbert space description of KS sets---the relations between nonorthogonal
vectors play an essential in such a description. This will prove
essential for a proper description of quantum gates using KS sets;
\item there is only one KS set with 24 vectors (vertices) and
24 tetrads (edges), and it contains all KS sets from the 24-24
class with the chosen values of vector components.~\cite{pmm-2-09}
In contrast to this, there are many non-isomorphic KS sets
with 60 vectors and 60 tetrads which contain many non-isomorphic
KS subsets each.
\end{itemize}

Another open question is to find physical and geometrical reasons for
having only hexagon maximal loops in the 24-24 class and for
having particular octagons, nonagons, decagons, etc., in the
60-75 class.

redpajama_set_name: RedPajamaArXiv


WHEELING — A free, week-long training will take place at Youth Services System in Wheeling from Aug. 7-11 for people interested in becoming recovery coaches.
Recovery coaches are part of the peer-recovery movement. A recovery coach helps people in recovery from addiction by being a sounding board and a knowledgeable resource as one who has been there.
The training takes place from 8:30 a.m. to 4:30 p.m. Aug. 7-11 at Youth Services System, 87 15th St., Wheeling. Lunch is provided. The deadline to register is Monday. Space is limited. Continuing education credits are pending for social work and addiction.
For information, call Staskey, 304-218-2843, ext. 118, or email vstaskey @ysswv.com.
"A recovery coach assists in identifying and overcoming barriers to recovery. The coach acts as a personal guide or mentor," said Valery Staskey of Partnerships for Success, a grant-funded program at YSS through the federal Center for Substance Abuse Prevention, which falls under the Substance Abuse and Mental Health Services Administration.
"You don't have to be in recovery to be trained as a recovery coach, but it is most helpful since people relate best to those who have been there themselves," Staskey said. Recovery coaches help "connect the dots" and assist people in recognizing their strengths while also acknowledging there are "many pathways to recovery," she added.
The five-day training is given by the CCAR Recovery Coach Academy, a program developed by the Connecticut Community for Addiction Recovery and used throughout the country to train coaches.
"Provided in a retreat like environment, the CCAR Recovery Coach Academy prepares participants by helping them to actively listen, ask really good questions, and discover and manage their own stuff," according to the website.
"Stuff" refers to a person's history and how it can affect their role as a coach.
In addition to learning the basics about recovery stages and the coaching role, participants will delve into such topics as relationship skills, ethics, boundaries and cultural competence.
SAMHSA defines recovery as "a process of change through which individuals improve their health and wellness, live self-directed lives, and strive to reach their full potential." It lists the four major dimensions that assist in recovery as health, home, purpose and community, all of which are areas in which the recovery coaches can assist.
This training will provide local coaches to assist those seeking recovery in a variety of ways, Staskey said.
"A coach can assist greatly with aftercare and management of one's disease, relapse prevention and more. Some ways a recovery coach can be utilized in a professional setting is in an emergency room to help connect those who have overdosed with treatment programs, helping those in recovery treatment connect with follow-up treatment. They can also act as personal coaches for individuals who request such services," Staskey said.


text:
David Lynch and Angelo Badalamenti's long-lost '90s album to be released
Far Out Staff· September 18, 2018
A lost album made by David Lynch and Twin Peaks composer Angelo Badalamenti is finally set to be released.
The record, which was dated to have been created from 1992 to 1993, has been given the title of Thought Gang and the LP will be released via Sacred Bones on November 2nd. To accompany the news, the duo have put out their first track which has been named 'Woodcutters From Fiery Ships'.
Lynch and Badalamenti formed a creative jazz project together in the 90s and called themselves 'Thought Gang'. The music, although never officially released at the time, did go on to create two songs that later appeared on the soundtrack for Lynch's 1992 film Twin Peaks: Fire Walk With Me, according to a press release.
The album will consist of 12 tracks and features bassist Reggie Hamilton. "[Lynch] said imagine you're a chicken with your head cut off running around with a thousand bennies shoved down your throat," as part of the press statement.
Here's the first track:

redpajama_set_name: RedPajamaCommonCrawl


text:
"We draw this big mountain on the chalkboard, and for 11 years we've been getting up that mountain," Tursi said. "It was a total team effort his year. These are some of the best guys ever."
Mater Dei scored points in 17 of the 18 events, but the sole gold medal came in the 4x800 as juniors John Spinelli, John Meskin and Justin Vidal and sophomore Patrick Osborn clocked 8:26.51.
The other major contributors for the Seraphs:
Osborne placed second in the 800 (1:57.80) and third in the 400 hurdles (59.30).
Spinelli took second in the 3200 (9:44.91) and fourth in the 1600 (4:32.42).
Junior Isaiah McClain finished fourth in the high jump (5-8), fourth in the long jump (20-2.25) and fifth in the 100 dash (11.67).
Junior Griffin Cole came in second in the 110 hurdles (16.14).
Cole and McClain also ran on the third-place 4x100 (45.93)
Senior Shane Mastro placed fourth in discus (146-6) and fifth in the shot put (52-2.5).
"In the beginning of the year, we didn't think we would come this far," McClain said. "It means a lot because everybody put a lot of work in."
Most state team track titles are won because a handful of superstars dominate their events. This was different.
"We've invested in a total team concept," Cole said. "We help each other out all the time."
The Seraphs won this title in 1999, 2000 and 2006. The current athletes are well aware of the drought.
"Our coaches pushed us to work harder to get to this point and say, 'We can win this,'" Osborn said. "And we did."
Other Shore highlights
Point Pleasant Borough sophomore Devin Hart capped a sensational meet by winning the Group II boys 3200 in 9:07.40, a nine-second personal best. He won te race by 21 seconds. This after breaking the meet record in the 1600 with a 4:09.49 effort Friday.
Ocean Township senior Elliot Gindi won the Group III boys 3200 in 9:15.29, kicking from fifth to first over the final lap. He also won Friday's 1600 (4:16.21).
Jackson Liberty senior Danielle Notarfrancesco struck gold in the Group III girls shot put with a throw of 44-5, much farther than runner-up Chioma Eluemunor of Morris Hills (40-10.5).
Neptune senior Marvin Morgan capped a strong Group III showing. After winning the 100 dash in 10.67 on Friday, he placed second in the 200 (21.76) and anchored the second-pace 4x100 (42.05).
After winning the 400 Friday in 47.69, senior Tom Kalieta split 48.2 as Matawan garnered gold in the 4x400 (3:20.10). Senior Liam Nappi (50.5), sophomore Zachery Hall (50.5) and sophomore Charlie Serrano (50.0) ran the other three legs.
St. Rose junior Connor McKeown won the Non-Public B boys high jump at 5-10.
Track: Alyssa Wilson wins Non-Public A shot put; CBA wins record-tying 21st team title
Staff writer Jerry Carino: jcarino@gannettnj.com.


About four years ago I was involved in a horse back riding accident. Because I was not wearing a helmet, I suffered a fractured skull, a subdural hemorrhage, a busted eardrum, and paralysis in the left side of my face and neck. I could not whistle, blink, chew or walk. Within the next few months many of my motor skills returned, but doctors informed me that the paralysis was possibly permanent unless I had surgery. They acted like I was insane, but they said I was "illogical" for refusing surgery. Instead I chose chiropractic. Dr Hurst showed me how much chiropractic can help the body to heal itself, given the right nutrients and spinal adjustments. Most people who learn of my accident would never have guessed that my face ever looked like that. I didn't think I would ever be the same, but with God and Dr. Hurst's help, I am better than ever. With the immense physical activity that karate requires, I also find myself occasionally needing an adjustment. Dr. Hurst keeps me aligned so that I can perform at my best while in the karate dojo.
I want to thank you for all you have done for me. I have had osteoarthritis for years and was in chronic pain from that alone. But when I was involved in a car accident and suffered a whiplash plus an injured back and legs, the pain was unbearable. I went to my medical doctor for help. I was put on two celebrex a day. It was enough to relieve a lot of the pain, but I needed to get off of it because it was causing internal bleeding. I was on muscle relaxers and strong pain medication daily which made me so tired all the time that I could not function. I went to a pain clinic where they tested my back and they said my entire back was inflamed, so they gave me trigger point injections. It didn't help any so the doctor sent me to physical therapy for one month. This also didn't help any. The pain I was in was very debilitating. I could not do the things I ordinarily do. I also suffered from acid reflux. Finally, my medical doctor sent me to Dr. Hurst and it was not long before I was able to gradually get off of my pain medication. Dr. Hurst also found that my acid reflux was being caused by a hiatal hernia which he corrected and showed me how I could correct it at home. I feel 80% better than I did before and the remaining pain I feel is due to my arthritis. I thank you so much for all you've done for me. I feel like you and God have given me my life back. God bless you.
Thank you, Dr. Hurst, for the relief you have given me. They have helped me to recover my health again. I am now off of four prescriptions that I could not get off of before. Chiropractic has helped my neck; my back; and my feet and legs. It has lowered my blood pressure. It has helped my shoulders. I would say to anyone who wants to get better health to come to Dr. Hurst! It doesn't matter how old you are or how bad you're hurting. Through him I got my health back. THANK YOU SO MUCH!
Since 1989 I have seen, heard, and experienced different aspects of chiropractic care with remarkable results. I have had low back pain, neck pain, allergies…and the list goes on. But, with chiropractic treatments I am able to work with a LOT less pain or no pain at all. Recently, Dr. Hurst noticed I was having problems with allergies. Every spring my allergies and all the symptoms (red itchy eyes, nasal congestion, itchy scratchy throat, sneezing and coughing) would flare up and I felt and looked absolutely terrible. But after Dr. Hurst started the treatments for my allergies, I feel so much better. I actually do NOT dread the pollen of spring like I used to. I actually enjoy spring now! I appreciate Dr. Hurst's knowledge of the spine and the care he gives his patients. And when you walk into his office you are greeted with smiles and kindness. Dr. Hurst has a wonderful staff that also cares for their patients. Thanks to you all.
My name is Teresa King and I work at the Warren County Jail. I have been suffering with what a couple of doctors had told me was a frozen shoulder. I did not have good range of motion in my left shoulder and it was very painful at night while I tried to sleep. As time passed it became more and more difficult to do certain things with my arm in the shape it was in. Doctors had suggested to me to follow an exercise routine, take anti-inflammatory medication and if that doesn't help I might be looking at cortizone injections in my shoulder and/or possibly surgery. Well I did the exercises for a while, took the anti-inflammatory medication for a while, but was getting no relief. I did not want the surgery and my shoulder was not getting any better. Several of my co-workers had been seeing Dr. Hurst for various problems and suggested I see him. I was very skeptical and would not go. Finally a co-worker was going to see him and I said to please make me an appointment. After my first visit I could see why my co-workers all recommended him. Dr. Hurst and Amy are wonderful people, very nice, professional and very caring. I talked to Dr. Hurst about my problem and he thought he could help me. It was on my fourth or fifth visit that he did some test or adjustment and, to my surprise, when he asked me to raise my arm I was able to do it. I had not been able to raise my arm so freely in two years or longer. I was so excited and grateful. I would recommend Dr. Hurst to anyone. I am able to raise my arm and I had no injections and no surgery. I still have some pain in my shoulder, but I feel my shoulder is finally free and I expect the pain to leave in time as I am able to work my shoulder.
I am delighted to relate to you and your staff that we (my wife and I) have great confidence in chiropractic. In fact, I have been receiving chiropractic treatments quite regularly since May 1943. I feel that the best health insurance one can have is to get these treatments regularly after their health problems have been helped. One should have a treatment at least once a month. This past summer I began having terrible pains in my left shoulder which went up the side of my neck and into the back of my head, and I could hardly turn my head either way, and I had such a terrible headache. After two treatments from our kind, patient and thorough Dr. Hurst, I felt like a new man. Dr. Hurst is one of the best I've ever been to and I have taken treatments from several chiropractors in three different states. My wife, Eva, has been treated by medical doctors for quite some time, but she's steadily getting worse – even to the extent that her nerves were in bad shape. She is now taking a series of treatments from Dr. Hurst and she is regaining her wanted and needed health. She says Dr. Hurst is so helpful, gentle and kind that a person cannot help but get better. Both of us highly recommend Dr. Hurst for most any ailment such as sinus troubles, arthritis, heart, lung, and back problems and for one's health in general. Thank God for chiropractors.
My name is Anthony. I do not like doctors and insurance companies. For the last 5 to 6 years I have had to see a LOT of doctors for my back, neck, shoulders, legs, feet, head, stomach; you name it. One day my neck was hurting severely and I decided to try a chiropractor. Doctor Hurst got me in quickly and I started feeling better almost immediately. In a short period of time I started feeling like a new man. I also had trouble with allergies and asthma for which I was taking several medications. I had no idea that a chiropractor could help such problems, but Doctor Hurst actually fixed the problem instead of just covering it up with medications. I no longer have to take any medications. I don't know about all chiropractors, but I recommend Doctor Hurst to everyone I can. I still don't like insurance companies, but I now know at least one doctor I do like!
To any one out there with pain in your hands; there is hope. If you had told me I could be free from pain in my hands through chiropractic care, I would not have thought that you understood my problem. I began coming to Dr. Hurst with much pain in my hands and fingers; especially in my thumbs. Today I am writing this to testify and encourage others that you too can be set free from pain through chiropractic and nutritional care. Before coming to Dr. Hurst I could not use my hands without pain accompanying any movement. I had been to medical doctors and I had been through painful tests. There was no other solution, I was told, except surgery. Since I started coming to Dr. Hurst my hands and fingers have improved 90%!!! I am so grateful and thankful to God for the amazing pain free hands and fingers I am enjoying using each day. Thank you, Dr. Hurst, Mrs. Hurst, Amy and Sarah for your wonderful chiropractic care here in McMinnville.
I came to Dr. Hurst for help with my low back pain, restless leg syndrome, anxiety, and fatigue. I had been taking hormone replacement medication for 13 years. My low back had been hurting for two months. Dr. Hurst and his staff were very professional and friendly. What I liked most about Dr. Hurst's care was his concern for me and the results. There are so many health conditions that Dr. Hurst is able to help. I also love the fact that my cures were all natural and no drugs were prescribed. It took time to see results, but it took a LOT more time for my problems to develop. I understood that it would take time and it was worth it! I am now pain free and I feel better than I have in a LONG time! I feel it is very important to have confidence and trust in your doctor to have successful results. Don't put it off. You'll be so thankful for choosing Dr. Hurst as your chiropractor. I know I am. Thank you, Dr. Hurst!
My name is Jamie and I am 26 years old. Despite my "youth" I had issues beyond my years. As far as my overall health was, I could not eat. For more than a month I "lost" everything I tried to eat. I had no appetite. I was losing weight. I was tired and weak. I was irritable and emotional. My back and neck hurt. I had headaches. I decided to attack one symptom at a time. I went to the eye doctor and got glasses to help with my headaches. Next, I went to the chiropractor for my neck and back issues. Last, I went to the medical doctor for my digestive issues. Dr. Hurst (doctor of chiropractic) told me my spine connected my brain to everything and that my spinal problems would explain all the other problems, but I had trouble seeing it that way so off to the medical doctor I went. I had every test and x-ray imaginable. I was pinched and poked and prodded. I was miserable! Then, the lab technician called me after my results were in and he said, "Hey! Good news! The results all look normal. You're fine!" Okay? I was definitely NOT fine!!! I was ready to trust Dr. Hurst and see where chiropractic care would take me. Many doctors treat symptoms the way I was prepared to treat them: one thing at a time. The truth is our bodies were not meant to be one piece or one function at a time. Our bodies are whole and connected and we need to treat them as such. Chiropractic takes the whole body and whole person into consideration. I feel terrific now! I have been going to Dr. Hurst for two months now. My "military" neck is improving. My back pains are gone. I can't remember the last time I had this much energy! I am able to exercise and enjoy life again. My moods have balanced out. Most important, I am able to eat again! Dr. Hurst listened to all of my symptoms. He assisted me in taking a whole body approach to health and he continues to assist me in keeping my health (and even in making health improvements). I can't fully express my appreciation! Health-wise, I am 26 again!
When I was about 16 years old I broke my right leg in a car accident. I had a metal rod put in my right femur that had to later be removed surgically after my leg had healed. About 5 or 6 six years ago I fell off a roof and was knocked unconscious. Since this fall I have suffered from low back pain, right knee pain and moderate headaches. My low back and right knee hurt so much that I could not walk far without the use of a walker. I lived on Percosets and morphine because of the pain and they only made the pain barely tolerable. Because of the pain medication I was always constipated. I had to take medication to sleep. I also took two medications for bipolar disorder. My wife made me an appointment to see Dr. Hurst. After a month of treatment my pain was about 30% less than it was at the beginning. My general strength improved and my wife and mother and friends remarked favorably on my progress. About six weeks into my treatment I was able to begin to get off the morphine I had been taking for years. About two months into my treatment I was able to quit the morphine completely! By three months I was able to walk a mile a day. About four months after I began treatment I am now about 80% better WITHOUT ANY DRUGS! Other "doctors" told me that I would be on medications for the rest of my life without surgery (and I did NOT want surgery). Dr. Hurst has proven to me that he will be able to get me OFF all my medications with NO surgery!!!
I was in pain in my right low back, hip and leg for years and it was getting worse. It hurt at times all the way to the toes of my right foot. The pain would get worse the longer I was on my feet. Sitting for more than 15 minutes made my hip and leg hurt more too. I even got some cortisone shots and they didn't help. I lived on muscle relaxers and pain pills which at least kept the pain almost bearable. I work at the post office and I have to lift packages as heavy as 70 lbs. Every day was a chore to get through and I was seriously wondering if I could last another 4 years until retire- ment. I had previously tried a chiropractor for my pain but I didn't get very good results. A friend and coworker recommended that I go to see Dr. Hurst. I am SO GLAD I took her advice and went to see Dr. Hurst! My pain is now 60% better WITHOUT any pain pills or muscle relaxers! My anxiety attacks are gone. My heart palpitations are gone. And I'm sure I can last another 4 years until retirement now! Dr. Hurst and his staff are so friendly and they all genuinely care about me as a person.
For three years I have suffered from neck and shoulder pain. On a rare occasion I would experience pain down my left arm. I suffered from severe sinus headaches. Many times they were so bad they'd make my eyes twitch. Three years ago I had surgery on my left foot for heel spurs. The surgery didn't help the pain much at all. A little over a year ago I had surgery on my left knee after a work related accident. My knee still hurt. I couldn't sleep. I couldn't ride a bicycle. I couldn't run. I was tired all the time. I was in pain every day. Then my mother and my sister suggested that I see Dr. Hurst because he had helped them so much. I could feel an improvement after my first adjustment. After my third adjustment I could tell an improvement in my left foot; it wasn't nearly as sensitive as it used to be! Now the pain in my foot is gone! Dr. Hurst and his staff are so friendly. Dr. Hurst is great! If only I had gone to him three years ago!
For 2 ½ LONG years I suffered pain in my back; in my hips; in my feet. I couldn't lay on my right side without hurting. I not only had pain in my feet, but I had that "pins and needles" feeling in my feet. I had pain in my stomach just below my breast bone. The pain, especially in my feet, was constant. My feet hurt more whenever I was on them. The days were so long when you're in pain. I was having serious doubts about being able to reach retirement in just a few more years. I went to a podiatrist. I went to an orthopaedic doctor. I went to medical doctors. I've tried steroid injections and anti- inflammatory prescriptions. I tried inserts in my shoes. I even tried two different chiropractors; one of them was in Nashville (yes, I live in Nashville and I work in Lebanon). Nothing worked. Nothing helped. I was still miserable. Then a friend suggested I go see Dr. Hurst so I made an appointment to see him. Dr. Hurst and his staff were so good to me and they were so responsible and caring. After my very 1st adjustment my feet hardly hurt for 4 WHOLE DAYS!!! After just a few weeks my feet aren't hurting anymore. I don't have to wear the shoe inserts (Dr. Hurst discovered that they were hurting me more than they were helping!). I had a problem in my left wrist and it's better now. That pain under my breast bone is gone. He discovered some gall bladder problems and Dr. Hurst put me on some whole food nutrients. I feel SOOO much better! I recommend Dr. Hurst to anyone with ANY kind of pain! Thank you, Dr. Hurst!
For over 20 years I have suffered with varying degrees of neck pain; low back pain; shoulder pain; jaw pain; knee pain; headaches; and mid back pain. I went through all medicine had to offer which was nothing but pain pills, muscle relaxers and steroids. The pain never went away, but it was worse if I wasn't taking some kind of prescription drug. The pain pills also gave me stomach problems and made me dizzy and light headed. I could not enjoy life. All I ever had to look forward to each day was another day of pain. I went to Dr. Hurst and he changed all that. I look forward to going to his office for a treatment because I know that, when I leave, I'll be feeling better. After a series of treatments my low back and neck and mid back felt so much better. Then, the other day, he adjusted my jaw. When I got home I cried because, for the 1st time in over 20 YEARS my jaw didn't hurt!!! Dr. Hurst and his staff are so friendly and courteous and caring. I tell everyone about Dr. Hurst.
I have suffered from neck pain and back pain for years. I was diagnosed as having fibromyalgia. I suffered from depression. I was a patient of Dr. Hurst's back in the mid 90's before he learned the new techniques he uses now. I had a breast reduction in 2003 and I thought that would fix my back and neck problems, but the back and neck pain and stiffness got worse. I was given muscle relaxers and pain pills and nerve pills. None of them helped. They just covered up problems and I had a lot more than I thought. After I began Dr. Hurst's chiropractic treatments again, the relief was wonderful and amazing!!! I'm calmer now. My pain is 90% gone. I have more energy. I feel like I have just opened my eyes to a new world of health WITHOUT DRUGS!! Dr. Hurst and his staff are SO excellent! They are so pleasant, kind and understanding! I feel like I'm being CARED for now! I feel confident about my treatment! Dr. Hurst and his staff are all very positive and concerned about you and how you feel! I recommend Dr. Hurst to anyone. GO! Just once! You'll see I'm right. You have to treat your body as a whole; not just parts of it. Thank you all for being so great! You gave me back my life and my confidence and hope for a great pain free future without drugs or surgery!!!
I had severe pain in my left shoulder for the past two months. I also suffered from low back pain and allergies to bananas, figs, and cashews for years. I also had numbness and tingling down to my left wrist and pain at times down my right leg to the heel. I tried physical therapy for my low back pain and I took Ibuprofen about every day. I couldn't exercise like I wanted to. It also interfered with my sleep and my activities with my grandson. Dr. Hurst and his staff were very friendly and courteous. He was very thorough in his evaluation and treatment of my conditions. My back is a lot better now as well as my shoulder and I can now eat bananas, figs and cashews!!! And I LOVE BANANAS!!! I would highly recommend him to anyone!
I fell and landed on my right shoulder and arm. For five weeks my arm and shoulder was very sore and it was painful to raise my arm. I also had pain in both my legs; hot flashes; painful menstruations; high blood pressure; and nervousness/depression. Also I couldn't walk like I used to; it hurt to swing my arm. I even had trouble opening jars. Dr. Hurst found that my collar bone was subluxated (out of alignment) in addition to several vertebrae in my neck. I felt some improvement with the first treatment. With his treatments I have improved in other areas as well as my main problem which was my right arm and shoulder pain. Dr. Hurst also helped my allergies. I had allergies to ragweed, golden rod, cat hair, white flour and whole wheat flour. Dr. Hurst removed them all! I would recommend Dr. Hurst to anyone. You have nothing to lose and everything to gain!
My back hurt. My shoulder hurt. My right wrist hurt. My neck hurt. I had headaches. I had high blood pressure; swollen ankles; poor circulation; chest pains; difficulty breathing and a chronic cough and wheezing. I suffered from stomach problems and acid reflux. I suffered for over ten years with my right wrist pain. I have an invalid son who depends on me for help and my problems were seriously interfering with my ability to help him. Now I'm happy to say that my wrist feels so much better; my neck and back feel so much better; my headaches are better; and my stomach is better! Dr. Hurst and his staff were so friendly. They always had a smile on their face.
My only regret with Dr. Hurst's treatments was not coming to him years ago!!! I highly recommend Dr. Hurst. If you need a ride, I'll take you! He made a huge difference in my wrist pain and in my life. Please go. Just give it a try.
When I first came to Dr. Hurst's office, I suffered from Bell's Palsy for over 10 years. I also had problems with low back pain and pain/numbness in my right leg for 3-4 years. In addition I had carpal tunnel problems, right knee pain, gout in my left foot and diabetes. I love to sew and I couldn't sew and I couldn't stand or walk without pain. For my Bell's Palsy I had been to two neurologists who arranged for me physical therapy which did not help. (Bell's Palsy is a paralysis of the facial nerve [VII Cranial nerve] which affects only one side of the face 99% of the time. It causes a drawing of the mouth to one side and difficulty closing the eyelids on the affected side and difficulty in closing the mouth on the affected side.) Dr. Hurst's staff is really friendly. Dr. Hurst explains everything including what my x-rays showed about my conditions. What I liked most about my care in Dr. Hurst's office is the fact that he listens to my problems and then he works on them. I could feel a difference in my face after the first adjustment! It has continued to improve. My family has even noticed the difference! Also my low back pain has improved. The pain and numbness in my right leg has improved. My right knee pain has improved. Dr. Hurst is very friendly and does not promise to do more than the best he can do.
For 10 years I suffered from neck pain & headaches. For 5 years I suffered from sinus problems. For 2 years I suffered from leg pain/cramps. For the last 6 months I suffered from low back pain. For years I would come down with severe bronchitis every fall. My daughter told me about Dr. Hurst so I went to him. He and his staff are very friendly and considerate. I liked not having to wait so long in a waiting room. He also explained my problems, and his treatment for these problems, thoroughly. Now I am pain free and last fall I did NOT HAVE ANY BRONCHITIS!!!!! I would recommend him highly to anyone!!!
I have been seeing Dr. Hurst since 1994 for low back pain, mid back pain, neck pain and knee pain. My orthopaedic MD told me it was arthritis and all he had to offer was NSAIDs (e.g. Tylenol, Advil, ibuprofen, aspirin, etc.) or something stronger (or surgery?). Dr. Hurst's x-rays revealed advanced deterioration of every disc in my low back. His treatment was consistent and helped, but, after I lost weight, his treatments helped even more. Up until I lost weight, Dr. Hurst had difficulty keeping my back and knees in alignment. Dr. Hurst and his staff have always been very kind and friendly. He is up front with his patients and if he doesn't think he can help you, he'll tell you. He has a very Christian work ethic! On Dec. 4, 2010, I participated in the St. Jude Memphis Grizzly 5K race (about 3.2 miles). I walked the course in 47 minutes! I am a 69 year old woman! This shows that back pain can be eliminated and arthritic knees can improve dramatically with regular chiropractic treatments!
I had headaches in my forehead. I had pain in both my shoulders. My neck hurt. My low back hurt. I hurt between my shoulders. I was tired all the time. I couldn't sleep. I couldn't enjoy activities with my three sons. Most of it started with an accident two years ago. I was amazed at how quickly I felt relief from the FIRST adjustment. I FELT WONDERFUL! I especially liked how Dr. Hurst explained everything on my level so that I understood why I was having these problems. My back and shoulders and neck and head feel better than ever. I would recommend Dr. Hurst highly to anyone with back, neck or shoulder problems; headaches too!
I had pain in my lower back for several years and had recently developed pain in my neck and shoulders. The pain changed in intensity, but never went away. My back pain had hurt off and on for 10 years, but only began to continuously hurt since the birth of my 1st baby 3 years ago. It got worse after the birth of my 2nd baby about 15 months ago. My neck started hurting about 6 months ago. I didn't go to any doctors or take any medications. I was hoping it would go away when my babies didn't need to be carried as often. After two weeks of treatments I felt about 80% better! Dr. Hurst and his staff are great! They're always friendly and take the time to really listen. I liked the fact that Dr. Hurst was very attentive and took the time to try to understand exactly what my symptoms were before telling me what he could do for me. He also explained what he found in my x-rays and made sure I was comfortable with the procedures he used to help me. My concerns were all addressed and I'm confident that I'll be feeling great for years under Dr. Hurst's care. I highly recommend him. He's a great teacher, listener and a very gentle and knowledgeable chiropractor.
I suffered from severe and constant low back pain for sixteen years. I have been to many doctors (all MDs) and each one only wrote me a prescription for pain pills and told me that I would eventually need surgery. I decided to try a chiropractor so I looked up Dr. Hurst in the phone book after my mother saw his ad in the newspaper. Dr. Hurst and his staff treated me with courtesy and respect. I liked the friendly atmosphere and the genuine concern that Dr. Hurst has for his patients. I couldn't think of anything I didn't like about Dr. Hurst or his staff. I went from barely tolerable low back pain on a daily basis to no pain! I am now looking forward to getting off of all my pain medications and getting on with my life that I will finally be able to enjoy! Dr. Hurst helped me to achieve a pain free life WITHOUT drugs or surgery! Don't waste your time with regular MDs. If you want actual results, go to a chiropractor…ESPECIALLY DR. HURST!
I suffered from low back pain for over 15 years and from sinus problems for over 2 years. My low back pain has improved TREMENDOUSLY and my sinuses are getting better and better. Dr. Hurst and Sarah are so nice and friendly. I would recommend him to anyone who is having any pain. Anyone with pain should see him before they go to an M.D. for pain pills or shots!
I suffered for SIX months with low back pain. I had to take Tylenol for the pain. I saw improvement in my pain after just two visits. Dr. Hurst called me at home, after my first visit, to check on me! He wanted to be sure I used ice on my low back like he told me to. I have NO PAIN now and I have recommended Dr. Hurst to several people at work.
Off and on since 2012 I had extreme lower back pain. It got to the point where it stopped me from being able to function properly at work and at home. I am now 100% better!!!! Dr. Hurst's assistant, Sarah, is amazing! She always greets you by name when you enter the building. I was set up on a 90 day treatment plan and, after only 3 weeks, I am back to my old self. I have NO pain! Dr. Hurst was honest from the beginning. He told me what was wrong and what he was going to do to fix my problem. I would and have recommended Dr. Hurst to friends and family. My wife is now a patient and she seems to like it so far.
For 27 years I have suffered from low back and mid back pain. It got worse about two months ago. I also had pain in my rt. shoulder blade and numbness/stinging in my left thigh. I also had problems with neuropathies and neuralgias and headaches and vertigo. I saw medical doctors; I saw a neurologist; I had back "stretching" therapy; I had other physical therapies; I did exercises; I took medications. NONE OF IT HELPED. I was diagnosed with arthritis and gout, but all I had was a name for my painful conditions, but no relief!!! I'm glad that my father referred me to Dr. Hurst! He is very attentive and friendly and his treatment of my problems GOT RESULTS! There was nothing about his care that I did not like. Now my back pain is minimal. My energy level is MUCH improved and my leg numbness is nearly resolved! Go see him!!! Don't wait like I did!!!
For over 10 years I suffered from low back pain off and on. I did NOT want to go to a chiropractor because I had heard of too many people going to a chiropractor and not getting x-rayed first. How do they know what they're doing if they don't x-ray first? What I liked about Dr. Hurst was the fact that he wanted x-rays first! So far my low back pain is much better. I recommend Dr. Hurst for being thorough before that first adjustment!
I've had shoulder and knee pain off and on for years. I've had shots that helped for a while, but the pain would come right back again after the shot wore off. I didn't really like or want the shots because I knew they were temporary plus I knew the damage that too many steroid shots can do such as osteoporosis, anxiety, nervousness, and insomnia. A few months ago I told Dr. Hurst about these problems and he started giving me treatments that took care of the problem. I learned that, if I had a schedule of regular treatments, it helped a lot more than just isolated visits whenever the pain got intense. Dr. Hurst never hurries through my treatments. He's thorough and he spends time discussing any problems you have and making recommendations on nutrients or exercises you can do at home to help. I'm 73 years old and I still work 30 hours a week. My job is both physically and mentally demanding. I have found that regular treatments will remove your need for drugs that just cover up symptoms like pain. I found this to be true when I started having trouble with my hands going to sleep so bad that they woke me up at night. After Dr. Hurst worked on me I haven't had that problem since.


text:
Не́льсон () — город и самый маленький по территории регион в Новой Зеландии. Расположен на северном побережье Южного острова. Население города-региона на 2013 год оценивалось в 46 437 жителей. Площадь — 445 км².

Известные уроженцы

 Халм, Денни (1936—1992) — новозеландский автогонщик, чемпион Формулы-1 (1968).
 Резерфорд, Эрнест (1871—1937) — «отец» ядерной физики. Лауреат Нобелевской премии по химии (1908).

Примечания

Ссылки

Города Новой Зеландии
Регионы Новой Зеландии

redpajama_set_name: RedPajamaWikipedia


My apologies for my very simple question.
I am trying to learn Python and routinely have absolutely no idea what I am doing. I've tried searching for the answer but either I'm using the wrong terminology or it's so obvious that it hasn't been written down.
Why can't I print inside a function? It works in other Python software, doesn't it?
Such as below. When I run it, nothing prints.
Are you calling odd() after that? Defining a function doesn't execute it unless you do so specifically.


text:
Q: how to write data from kernel into binary file I used an API to get data from kernel which API provides part info as follows.
#API INPUT:
#      size = 0x100 (User/driver will need to allocate buf of size*4,
             #                     since driver dump data in %02x format)

# API OUTPUT:
             #      buf = data copied to this buffer
             #      size = 0x100 * 4
             #      rv = return value.      None zero indicates error

Then i want to save these data from kernel into a binary file.
char *buffer = malloc(0x100 *4);
FILE *fd;
fd = fopen("binfile", "wb");
...
fwrite(buffer, 1, 0x100 *4, fd);
...

But i found the content in this binfile are text. I can use 'cat binfile' to see the content and output as follows.
03 04 07 10 00 00 00 00 00 00 00 06 67 00 00 00 08 03 00 1e 46 49 4e 49 53 41 52 20 43 4f 52 50 2e 20 20 20 00 00 90 65 46 54 4c 58 38 35 37 31 44 33 42 4e 4c 2d 45 35 42 20 20 20 03 52 00 9b 00 1a 00 00 41 4d 51 30 43 36 31 20 20 20 20 20 20 20 20 20 31 32 30 36 31 34 20 20 68 f0 03 bc 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00

And use 'hexdump binfile', output is as follows.
0000000 3330 3020 2034 3730 3120 2030 3030 3020
0000010 2030 3030 3020 2030 3030 3020 2030 3030
0000020 3020 2036 3736 3020 2030 3030 3020 2030
0000030 3830 3020 2033 3030 3120 2065 3634 3420
0000040 2039 6534 3420 2039 3335 3420 2031 3235
0000050 3220 2030 3334 3420 2066 3235 3520 2030
0000060 6532 3220 2030 3032 3220 2030 3030 3020
0000070 2030 3039 3620 2035 3634 3520 2034 6334
0000080 3520 2038 3833 3320 2035 3733 3320 2031
0000090 3434 3320 2033 3234 3420 2065 6334 3220
00000a0 2064 3534 3320 2035 3234 3220 2030 3032
00000b0 3220 2030 3330 3520 2032 3030 3920 2062
00000c0 3030 3120 2061 3030 3020 2030 3134 3420
00000d0 2064 3135 3320 2030 3334 3320 2036 3133
00000e0 3220 2030 3032 3220 2030 3032 3220 2030
00000f0 3032 3220 2030 3032 3220 2030 3133 3320
...
00002c0 3020 2030 3030 3020 2030 3030 3020 2030
00002d0 3030 3020 2030 3030 3020 2030 3030 3020
00002e0 2030 3030 3020 2030 3030 3020 2030 3030
00002f0 3020 2030 3030 3020 2030 3030 3020 2030
0000300 0000 0000 0000 0000 0000 0000 0000 0000
*
0000400 >>> it is 0x400

But my expected content of binary file should be as follows.
0000000 0403 0007 0000 4000 0440 0670 0a8c 0000
0000010 0003 0a00 4946 494e 4153 2052 4f43 5052
0000020 202e 2020 0000 6590 5446 464c 3538 3932
0000030 3350 4e42 2d56 3545 3141 2020 5203 a900
0000040 3a00 0000 5155 3036 3030 2048 2020 2020
0000050 2020 2020 3331 3830 3430 2020 fa68 e505
0000060 0000 0000 0000 0000 0000 0000 0000 0000
*
0000100 >>> only 0x100

A: Note the following from the comment on your API:

(User/driver will need to allocate buf of size*4, since driver dump data in %02x format)

You're not accidentally converting it to text; that's how the API gives it to you. You need to convert it to binary yourself. Once you do that, you can just write it the way you are now and it will stay binary.

redpajama_set_name: RedPajamaStackExchange


We've just fitted an oak home office in a house not too far from us, it was nice having a short drive to the house to fit. The past few jobs have been a fair drive away. The folks were looking to get rid of all of there mis matched units that they picked up here and there when they were needed so I done a couple of designs. They chose the one that would work out best and we got to it.
We used oak veneer and solid oak and finished it off in wax finish, we used BriWax, it's a good wax. The shelves that you see are fixed and the shelves inside are adjustable, I'm going to add more shelves to the inside when they know exactly how much they need.
The drawers were done with a dovetail joint, we done it with a jig and router, not by hand. It would have been nice to take the time and do it by hand but we needed to get it done quicker than that would take. When I retire to a small Italian village I'll do all dovetails by hand. My friend Alan came up to help for a weekend, it took us about 2 hours to get the jig all set up but once we got it set up it worked great.
To put the cabinets together I will nearly always use the Festool Domino and join them with the domino and glue, I'll screw them too if you won't be seeing the sides of the cabinet. This seems to work good for aligning and for strength too. I usually make jigs for each job if necessary, I'll make the jig and write some sizes on it then add the name of the job to remind me incase I have a similar job in the future. I use Titebond 3, it's probably expensive as far as glue goes but I like it, it's a good glue.
Sorry for the selfie but the place get pretty crowded when I do a job like this, I've got the idea for an extension to the front and that will pretty much double my space, I have no dreams of turning into a massive workshop with staff and churning out the same stuff over and over again. I want to do one off commissions as well as my own furniture, the space I have is prefect for that, no rent, no commute and a loch view. I'm staying! I still manage in this space but everyone wants more space. Once this job was fitted we moved stuff around, we like to call it space management. It works well now.
I like to use the domino and a tongue and groove for doors and drawer fronts. I think the T&G would suffice but adding a domino isn't too much more work and I know that once all the glue is set that they're solid. I'm honestly not a Festool fanboy, well maybe a bit but not everything I own is Festool, I like a few of the tools that they make, they're expensive but it makes work and life just a bit easier. Maybe they don't make life easier but they make work easier.
And the pictures above are of it fitted. It worked out nice. You're always learning doing this for a living. Learning on how to make the install quicker, learning on easier ways to lay on the face frame so when the cabinets go together it's smoother in terms of fitting hassle and time. I suppose thats the path we're on, to keep learning on every piece and eventually you might build one perfect thing.
Feel free to share this with your friends who you might think are looking for something like this, you can also follow along through instagram, Facebook and YouTube. All the links to these are top right of this website.


Filler treatments can take as little as 15 minutes up to an hour, depending on the area(s) being treated. Patients will see results instantly after treatment.
Revanesse filler and Revanesse Kiss last between 6-9 months, Revanesse Ultra can last between 9-12 months, Redexis can last up to 18 months, and Redexis Ultra can last up to 42 months, depending on the individual, age, skin concerns being addressed, and lifestyle.
Patients can expect a bit of pain, itching, tenderness and swelling at the injection site. This will resolve within a day and last no longer than a week.
Revanesse is a temporary hyaluronic acid dermal filler that provides amazing, hydrating, and long-lasting natural results.
How is Revanesse different from other fillers?
Revanesse is free of animal products, which makes this filler safer for individuals with allergies and sensitivities. This filler is also biocompatible and biodegradable.
Revanesse filler is especially unique because it is made up of Thixofix cross-linking technology. This proprietary bonding process creates a smooth, natural-feeling gel, and makes the filler last longer than similar products.
Revanesse not only feels natural, it is easier to shape and mold than most other hyaluronic acid dermal fillers. It's an ideal option for first-time filler patients because it offers such a natural feel and look.
Revanesse Kiss is an ideal dermal filler for patients who want to achieve full, sumptuous lips that are still natural in feel and appearance.
Revanesse Kiss plumps up lips by augmenting volume and defining shape. Because Revanesse is so easy to shape and mold, patients are able to achieve specific lip looks that other fillers simply can't accomplish.
Every treatment begins with a consultation with one of our knowledgeable professionals. They will ask you about the beauty issues you want to target, and your desired results. From there, your dedicated beauty professional will make recommendations and discuss treatment options.


text:
Back to Board Biographies
Kana Madarame
Kana Madarame, born in Mito, Ibaraki, Japan holds an undergraduate degree from Tokyo Gakugei Univrsity and a graduate degree from Tokyo National University of Fine Arts. Her graduate thesis there was entitled "Advancement of Women Brass Performers in Japan."
Active as both performer and teacher, Kana performs as the Principal Cornet of the Japan Ladies' Brass and Tokyo Brass Society, which are both important performing groups in Tokyo.
She came second in the 2003 International Women's Brass Conference competition in Illinois. Kana gives solo recitals every year all over Japan, and she has released three solo CDs entitled Vocalise, Fantaisie, and Miyabi. They are available for streaming globally. Recently, Kana set up Project KANA, which aims to introduce Japanese culture and the Japanese spirit to audiences overseas. In recent years, she has toured Europe, Malaysia and Texas with great success.
Ms.Madarame's teaching career goes further than simply teaching. She is active as a band director and a conductor as well as a trumpet teacher. Currently she is a member of the faculty at Tokyo Gakugei University, Senzoku Gakuen College of Music, Shobi Music College, and Bunka Gakuen University High School in Tokyo. She is a board member of the International Women's Brass Conference. Furthermore, she was recently appointed as an ambassador for her hometown of Mito City. In addition, she has become a committee member of the Ibaraki Prefecture Cultural Council.
Kana Madarame's music speaks to the heart of her audience.
Official website : https://www.kana-mf.com
Project KANA https://www.k-kana-mf.com/


text:
<?xml version="1.0" encoding="utf-8"?>
<android.support.design.widget.CoordinatorLayout
    xmlns:android="http://schemas.android.com/apk/res/android"
    xmlns:tools="http://schemas.android.com/tools"
    xmlns:app="http://schemas.android.com/apk/res-auto"
    android:layout_width="match_parent"
    android:layout_height="match_parent"
    android:paddingBottom="@dimen/activity_vertical_margin"
    android:paddingLeft="@dimen/activity_horizontal_margin"
    android:paddingRight="@dimen/activity_horizontal_margin"
    android:paddingTop="@dimen/activity_vertical_margin"
    tools:context="com.blogspot.sttony.project8.GoalActivity"
    android:paddingEnd="@dimen/activity_horizontal_margin"
    android:paddingStart="@dimen/activity_horizontal_margin">
    <LinearLayout
        android:orientation="vertical"
        android:layout_width="match_parent"
        android:layout_height="match_parent">
        <GridLayout xmlns:android="http://schemas.android.com/apk/res/android"
            xmlns:tools="http://schemas.android.com/tools"
            android:layout_width="match_parent"
            android:layout_height="wrap_content"
            android:columnCount="6"
            android:orientation="horizontal"
            android:rowCount="5"
            tools:context="com.blogspot.sttony.project8.GoalActivity">

            <TextView
                android:layout_width="wrap_content"
                android:layout_height="wrap_content"
                android:layout_gravity="fill"
                android:layout_column="0"
                android:layout_columnSpan="3"
                android:layout_row="0"
                android:text="@string/view_field_Goal"
                android:textSize="@dimen/abc_text_size_title_material"
                android:textStyle="bold" />

            <!-- title -->
            <TextView
                android:layout_width="wrap_content"
                android:layout_height="wrap_content"
                android:layout_column="0"
                android:layout_row="1"
                android:text="@string/view_field_Title"
                android:textSize="@dimen/abc_text_size_title_material" />

            <EditText
                android:layout_width="wrap_content"
                android:layout_height="wrap_content"
                android:layout_gravity="fill_horizontal"
                android:layout_column="1"
                android:layout_columnSpan="5"
                android:layout_row="1"
                android:hint="@string/view_field_Title"
                android:singleLine="true"
                android:id="@+id/view_field_goal_title" />

            <TextView
                android:layout_width="wrap_content"
                android:layout_height="wrap_content"
                android:layout_column="0"
                android:layout_row="2"
                android:text="@string/view_field_Divide"
                android:textSize="@dimen/abc_text_size_title_material" />

            <EditText
                android:layout_width="80dp"
                android:layout_height="wrap_content"
                android:layout_column="1"
                android:layout_row="2"
                android:hint="@string/view_field_Quantity"
                android:singleLine="true"
                android:inputType="number"
                android:id="@+id/view_field_goal_quantity" />

            <EditText
                android:layout_width="60dp"
                android:layout_height="wrap_content"
                android:layout_column="2"
                android:layout_row="2"
                android:hint="@string/view_field_Unit"
                android:singleLine="true"
                android:id="@+id/view_field_goal_unit" />

            <TextView
                android:layout_width="wrap_content"
                android:layout_height="wrap_content"
                android:layout_column="3"
                android:layout_row="2"
                android:text="@string/view_field_As"
                android:textSize="@dimen/abc_text_size_title_material" />

            <EditText
                android:layout_width="60dp"
                android:layout_height="wrap_content"
                android:layout_column="4"
                android:layout_row="2"
                android:hint="@string/view_field_NumofTask"
                android:inputType="number"
                android:singleLine="true"
                android:id="@+id/view_field_goal_SubTask" />

            <TextView
                android:layout_width="wrap_content"
                android:layout_height="wrap_content"
                android:layout_column="5"
                android:layout_row="2"
                android:text="@string/view_field_Task"
                android:textSize="@dimen/abc_text_size_title_material" />

            <TextView
                android:layout_width="wrap_content"
                android:layout_height="wrap_content"
                android:layout_column="0"
                android:layout_row="3"
                android:text="@string/view_field_In"
                android:textSize="@dimen/abc_text_size_title_material" />

            <EditText
                android:layout_width="80dp"
                android:layout_height="wrap_content"
                android:layout_column="1"
                android:layout_row="3"
                android:hint="@string/view_field_Duration"
                android:singleLine="true"
                android:id="@+id/view_field_goal_Duration"
                android:inputType="number" />

            <TextView
                android:layout_width="wrap_content"
                android:layout_height="wrap_content"
                android:layout_column="2"
                android:layout_row="3"
                android:text="@string/view_field_Weeks"
                android:textSize="@dimen/abc_text_size_title_material" />

        </GridLayout>
        <ListView
            android:id="@+id/view_list_goal_subtask"
            android:layout_width="match_parent"
            android:layout_height="match_parent"

            >

        </ListView>
    </LinearLayout>

    <android.support.design.widget.FloatingActionButton
        android:id="@+id/view_field_goal_save"
        android:layout_width="wrap_content" android:layout_height="wrap_content"
        android:layout_gravity="bottom|end" android:layout_margin="@dimen/fab_margin"
        android:contentDescription="@string/view_field_save"
        android:src="@android:drawable/ic_menu_save" />

</android.support.design.widget.CoordinatorLayout>

redpajama_set_name: RedPajamaGithub