I started a blog 5 years ago and let it fade. Now I'm 29.5 and wanting to start it again. Somehow came across your blog via Instagram and read this. Made me smile and be okay with whatever my blog would look like. I resonate so much with all that you said. Thank you!


A northeast Indiana classic car dealership owned by former auction house owner Dean Kruse and his wife has filed for Chapter 11 bankruptcy.
Bunker Lakes Inc., which does business as Bunker Lakes Dealership, filed for bankruptcy Feb. 22 in U.S. Bankruptcy Court in Fort Wayne. The filing lists Kruse's wife, Kristin McGrade, as president and she and Kruse as each owning 50 percent of the company.
Attorney Dan Skekloff, who is handling the bankruptcy for the company, told The Journal Gazette it could reorganize.
He said the business has no employees and isn't operating. He also said Bunker Lakes is about $5 million in debt and has $10 million in assets.
It's just the latest problem for Kruse, who has been the subject of numerous lawsuits.
In 2010, Indiana stripped Kruse's auctioneer's license and the license of his former Auburn-based auction house, Kruse International. Kruse conducted popular classic auto auctions at the site about 20 miles north of Fort Wayne. Other buildings on the 110-acre site auctioned off collectibles, firearms and other items.


text:
double** create_simplex(int);
double* minimize(double [], double [], int, int);
double model_function(double, double []);
double objective_function(double [], double [], double [], int, int);
double *call_functions(double [], double [], double **, int, int);

redpajama_set_name: RedPajamaGithub


4:17 | 392,014,785 x Views | 4.28 Mb.
5:47 | 655,139 x Views | 6.48 Mb.
5:41 | 23,992,613 x Views | 6.42 Mb.
4:18 | 33,953,877 x Views | 4.28 Mb.
3:55 | 408,984 x Views | 4.66 Mb.
4:02 | 23,269,376 x Views | 4.02 Mb.
4:18 | 1,451,704 x Views | 4.28 Mb.
2:47 | 6,572,124 x Views | 2.48 Mb.
4:15 | 7,514,303 x Views | 4.26 Mb.
Extreme - More Than Words - Hq- Scroll Lyrics "22"
3:43 | 29,675 x Views | 4.44 Mb.
Tags : Unduh Video Mp3 extreme more than words uriilvg58sy, Video Songs, movie video, download video gratis, lirik, kualitas terbaik, mp3 gratis, stafaband, muviza, album gratis, free download music, kumpulan lagu terbaru, download soundtrack, gudanglagu, mp3skull, langitmusik, mp3http, muvibee, lirik lagu, yousuve, muviza, full album stafaband, wapgrab, bursalagu, freshlagu, wapindo, waptrick, reverbnation, mp3juices, emp3z, sharelagu, urduweb, freelagu, savelagu, bursa lagu, lagu bagus.


text:
Q: how to set contentDescription for ActionBar Overflow icon I would like to make my Android applications VERY accessible.
I have been investigating how to set contentDescription for the ActionBar Overflow icon (e.g. the three dots at left hand end of actionbar).
Is it possible to set contentDescription for this actionbar icon?

A: The content description for the overflow icon is set by the framework, which makes it consistent across all apps. Changing the description from the default would break user expectations and cause confusion. There is no need for you to change the description.

redpajama_set_name: RedPajamaStackExchange


text:
Promoting Crime Fiction
As a founder member of Mystery Women in 1997, promoting Crime Fiction has always been my passion. Following the closure of Mystery Women, a new group was formed on 30th January 2012 promoting crime fiction. New reviews are posted daily, but to search for earlier reviews please click on the Mystery People link below and select 'reviews' from the welcome page. This will display an alphabetic option for you to find the review you would like to read
For PREVIOUS REVIEWS- Click on MYSTERY PEOPLE below -
Mystery People
'Murder in the Afternoon' by Frances Brody
Published by Piatkus,
1st March 2012:
Kate Shackleton is called to help locate a missing stone mason. His wife Mary Jane Armstrong is adamant that Kate can help her, and in the face of such belief Kate agrees to accompany the woman back to her home in Great Applewick.
The story Kate pieces together is, that Mary Jane's children Harriet and Austin had gone to the quarry where their father worked to bring him lunch, and that the daughter Harriet had found him dead. Walking to the next farm for help, when she returned with the farmer, there was no one to be found, neither her father, nor a body.
As Kate investigates she encounters hostility from the quarry foreman, and discovers that Ethan Armstrong had active strong political views. The more she investigates the more it becomes apparent that there could be more than one reason for the absence of Ethan Armstrong, or his body.
But for Kate this is more than the mystery of a missing man, for she becomes embroiled in a family situation – her family, or rather the family that she was unaware existed, but nevertheless her family, raises for her many questions.
A good mystery that had me perplexed, but also a moving episode in the life of Kate Shackleton who still believes that even though the war has been over a couple of years that she may still find her husband, posted missing presumed dead, but maybe just with a missing memory – it happens why not to Kate.
Lizzie Hayes
Frances Brody is a pseudonym of Frances McNeil who lives in Leeds where she was born and grew up. She worked in the USA as a secretary in Washington DC and New York. Frances studied at Ruskin College, Oxford and read English Literature and History at York University.
Starting her writing life in radio, she has written scripts for television and theatre. Frances turned to crime for her first novel, Dying in the Wool, set on the outskirts of Bradford, Yorkshire in the 1920s, was followed in 2010 with A Medal for Murder.
Posted by Lizzie at 12:20
From an early age I have been a lover of crime fiction. Discovering like minded people at my first crime conference at St Hilda's Oxford in 1997, I was delighted when asked to join a new group for the promotion of female crime writers. In 1998 I took over the running of the group, which I did for the next thirteen years. During that time I organised countless events promoting crime writers and in particular new writers. But apart from the sheer joy of reading, 'I actually love books, not just the writing, the plot or the characters, but the sheer joy of holding a book has never abated for me. The greatest gift of my life has been the ability to read'.
'Never Coming Home' by Evonne Wareham
'Thorn in my Side' by Sheila Quigley
Mystery People Launch 13 March 2012
'Dead Image' by Joan Lock
'Blackmail for Beginners' by Eileen Robertson
'Street Girls' by Linda Regan
'A Pound of Flesh' by Alex Gray
'Kind of Cruel' by Sophie Hannah
Blog archive January (16) December (28) November (23) October (27) September (24) August (33) July (29) June (27) May (32) April (37) March (24) February (25) January (21) December (23) November (34) October (22) September (23) August (29) July (34) June (30) May (20) April (41) March (20) February (24) January (24) December (28) November (23) October (30) September (31) August (31) July (36) June (32) May (33) April (33) March (29) February (37) January (27) December (33) November (33) October (27) September (30) August (33) July (29) June (24) May (33) April (36) March (35) February (38) January (27) December (46) November (35) October (51) September (18) August (38) July (25) June (25) May (39) April (32) March (43) February (34) January (33) December (31) November (34) October (40) September (31) August (34) July (31) June (30) May (28) April (30) March (24) February (27) January (50) December (43) November (54) October (42) September (15) August (14) July (17) June (16) May (20) April (29) March (20) February (15) January (12) December (15) November (20) October (22) September (31) August (19) July (17) June (12) May (7) April (16) March (14) February (12) January (23) December (18) November (13) October (15) September (13) August (14) July (11) June (9) May (9) April (11) March (9) February (8) January (10) December (4) November (1) October (4) September (4) August (9) July (11) June (19) January (1)

redpajama_set_name: RedPajamaCommonCrawl


Offering a prompt, reliable service everytime with a sound understanding of your fastening requirements. Keeping you up to date with new & innovative ways to make the right connection!
Enter your On Site Fastening Solutions username.
The Blue-tip Screw bolt for light, medium & heavy duty applications in base materials such as Concrete/Masonry & Block work.


text:
Their 10 Best
Top Fives & Top Tens
In Theaters This Week
IMDB 250 BEST FILMS
Site Notes
Achievement Lists
About Killing Time
Category Archives: Essay
Essay, Movies
Killing Time Turns 5 Years Old!!!
January 23, 2018 sleeplessdave	14 Comments
Five years ago today, Killing Time opened its doors to all manner of geeks, nerds, geekity nerds, and random passersby. My reasons for starting this blog, and maintaining it for half a decade of pretty steady nonsense are more than outlined in the "About KT" tab if you're curious, but the blog I started in early 2013 was a very different one than 2018's version. For one thing, it was missing all of you. All 9,837 of you wacky, wacky people whose comments and feedback make writing this thing so much fun. This is, by the by, the 3,578th article for Killing Time, and not counting the Facebook, Twitter, and other social media platforms, we've had 525,395 hits on the homepage alone.
I didn't expect any of that. I didn't think I'd be writing this blog five years later. I didn't think anyone would want to read it, to be honest. I wrote it first as an escape, then as a tribute, now-more than anything-as a discipline to write every day. And it has become an inextricable part of my day. The days now have columns attached to them, there's a rhythm to the whole thing, and if I have to miss a day because reality rudely intrudes into my fervent concentration on ignoring it….I feel odd. Like I have to sneeze and can't…or forgot to, which is an even odder sensation. What I'm saying is that Killing Time has been a surprising thing, a good thing, and all of you have made it what it is. So thank you for five years. I certainly can't promise five more, but I didn't think we'd be here in 2013. Thank you, time killers.
-The Management
BloggerbloggingBlogging AnniversaryDiscipline of Writingkilling timewriting
Animation, Disney, Essay, movie review, Movies
FILMSGIVING 2017 – 4 Movies; 1 Theater Holiday (mini-reviews included)
November 27, 2017 sleeplessdave	13 Comments
I don't celebrate Thanksgiving. It isn't that there aren't things in my life that I'm thankful for; there are. It's not that I don't have people I love who wouldn't bend over backward to show me to their table; I do. The problem is, the person who should be there sharing it with me passed away a few years ago. Holidays are the traditions we make with the people we love, but what happens when the people die? I suppose the traditions could live on if there were more people to see them through, but mine died with my wife. The first year, I just survived the holidays. The second year they made me miserable. By the third year, I'd had enough so I decided to invent new traditions. I didn't want to spend another Thanksgiving immersed in the routine (and to be honest….I hate turkey), so thus was born FILMSGIVING! Continue reading FILMSGIVING 2017 – 4 Movies; 1 Theater Holiday (mini-reviews included) →
CocoCoco ReviwHoliday TraditionsPixarRoman J. Israel EsqRoman J. Israel Esq. ReviewthanksgivingThree Billboards Outside of Ebbing MissouriThree Billboards Outside of Ebbing Missouri ReviewWonder Review
Achievement Lists, Essay, Killing TIme, movie review, movie trailers, Movies, TV, Video Games
Killing Time Passes 500,000 Hits: The Most Popular Pieces in the Site's History
October 12, 2017 sleeplessdave	18 Comments
On January 24, 2013, I started a blog on media to pass the time (you can click on About Killing Time if you want the entire dynamic origin story). This morning, during the wee hours, that site passed half-a-million hits. 500,000 hits, baby! That's just on KT, not the social media pages, but if you had told me when I was starting out that we'd ever get to 1/2 a million hits, I'd have upped your thorazine. I saw the number creeping toward the milestone a month ago, as I've noticed we're also nearing 10k followers (you geeky legion, you). I had no idea it was that high, and I just want to sincerely thank every one of you who makes this a fun site to write, manage, micromanage, rearrange and then re-micromanage, and for the comments, support, and sense of community that has-especially this year-made this such an awesome place to be.
No doubt the morning shows are all over this, but I thought I'd share just a few of the reader reactions to the news. SO kind (thank you for the mic drop, Mr. President). After the break check out the most read articles in the site's history.
Continue reading Killing Time Passes 500,000 Hits: The Most Popular Pieces in the Site's History →
500k HitsbloggingFive Hundred Thousand HitsHalf a Million HitsKilling Time's Most Popular ArticlesMost Popular Articleswriting
Disney, Essay, Movies, Star Wars, Top 5
Why Disney Needs to Keep Star Wars at Christmas
June 13, 2017 sleeplessdave	8 Comments
Happy Holidays! Your reward for making it through another year is a trip to a galaxy far, far away from your friends at Disney. That's been the case with The Force Awakens, Rogue One, and the upcoming The Last Jedi. However, in 2018, Star Wars films will move to the summer. Not only is this a grinchly move by Disney, it's bad business. Disney already produces so many blockbusters per year that they're beginning to crash into each other's earning potential. Both Disney Star Wars films made over a billion dollars. That's largely because they were revisited during the cinematic doldrums of January and February. Moving Star Wars to summer will pit the films not only against blockbuster competition from other studios, it will stunt the box office potential for Disney franchises typically used to summer dominance (The Marvel Cinematic Universe and Pixar Animation, for example). There are three reasons behind moving Star Wars to summer, and in each reason is a counter-argument for why Disney shouldn't.
Continue reading Why Disney Needs to Keep Star Wars at Christmas →
Avengers: Infinity WarDisneyDisney Moving Star Wars to SummerHan Solo Star Wars Spin-OffMCUstar warsStar Wars Box OfficeStar Wars Episode IXStar Wars Episode VIII: The Last JediStar Wars Moving to Summer
Site Note: KT Undergoing Upgrade
May 31, 2017 sleeplessdave	Leave a comment
Greetings, Time Killers! You may have noticed some tweaks to the home page. I'm moving some things around, trying some new things, and so if stuff looks wonky….I'm probably in the middle of messing the entire site up. Perfectly normal. One thing to note for people who read the Word Press page only, I've divided up the workload because I spend 1-2 hours a day on this blog and I can't get to everything. Casting news, posters, pictures, and general news will get published to the Facebook page (www.facebook.com/killingtime2014) or to the Twitter feed (@sleeplessdave), which now displays the last 10 news items on the site for those who hate Facebook and Twitter (there are enough of you that I am writing this, so you know who you are). The addition of the Twitter widget will give WP site only readers the same kind of total access the Facebook horde gets. The things I do for you all. Keep stabbing minutes, you wacky little wombats, you!
bloggingbookscomicsFacebookkilling timemoviesTVTwittervideo gameswriting
Movie Reviews, Trailers, Polls, Lists, and More!!!
Follow KT on Facebook
Follow Killing Time on WordPress.com
Follow Killing Time via Email
Top 5: Scenes From The Godfather
My Favorite Scene: Tropic Thunder (2008) "Sgt. Lincoln Osiris: I'm A Dude!!!"
My Favorite Scene: Jumanji - Welcome to the Jungle (2017) "Strengths and Weaknesses"
Top 5: Scenes from Schindler's List
Top 5: Scenes From The Shawshank Redemption
My Favorite Scene: Spider-Man (2002) - "The Upside Down Kiss"
Rachel Weisz's 10 Best Movies
Top 5: Scenes from Forrest Gump (IMDB Top 250 #13)
Top 5: Scenes from Pulp Fiction
Top 5: Scenes from 12 Angry Men (#7 on the IMDB Top 250 Movies)
Killing Time Archives
Killing Time Archives Select Month February 2019 (1) January 2019 (5) August 2018 (4) July 2018 (36) June 2018 (33) May 2018 (37) April 2018 (36) March 2018 (36) February 2018 (36) January 2018 (36) December 2017 (35) November 2017 (37) October 2017 (51) September 2017 (51) August 2017 (41) July 2017 (44) June 2017 (35) May 2017 (39) April 2017 (28) March 2017 (32) February 2017 (30) January 2017 (42) December 2016 (39) November 2016 (44) October 2016 (41) September 2016 (41) August 2016 (37) July 2016 (49) June 2016 (35) May 2016 (42) April 2016 (33) March 2016 (36) February 2016 (29) January 2016 (35) December 2015 (34) November 2015 (37) October 2015 (32) September 2015 (32) August 2015 (32) July 2015 (52) June 2015 (41) May 2015 (43) April 2015 (36) March 2015 (42) February 2015 (38) January 2015 (38) December 2014 (23) November 2014 (40) October 2014 (6) September 2014 (48) August 2014 (70) July 2014 (93) June 2014 (84) May 2014 (77) April 2014 (74) March 2014 (105) February 2014 (92) January 2014 (87) December 2013 (92) November 2013 (107) October 2013 (131) September 2013 (108) August 2013 (124) July 2013 (105) June 2013 (124) May 2013 (111) April 2013 (105) March 2013 (84) February 2013 (54) January 2013 (11) November 2010 (3) October 2010 (9) September 2010 (14) August 2010 (19) July 2010 (16) June 2010 (13) May 2010 (16) April 2010 (16) March 2010 (19) February 2010 (18) January 2008 (5) December 2007 (3) November 2007 (6) October 2007 (6) May 2007 (3) March 2007 (2) February 2007 (6) January 2007 (19) December 2006 (23)
KT on Twitter
Box Office: 'Mission: Impossible – Fallout' Runs Past 'Christopher Robin' bit.ly/2AHJd0k via @variety 11 months ago
The Simpsons Won't Be Leaving Fox Anytime Soon po.st/c6JpAj via @comingsoonnet 11 months ago
Marvel's Daredevil Season 3 Confirmed For 2018 Release On Netflix cbr.st/Ad3RBiR 11 months ago
Chris Rock Will Headline FX's Fargo Season 4! comingsoon.net/tv/news/963055… 11 months ago
Matt Reeves' Plans for The Batman Weren't Affected by WB Restructuring cbr.st/AdzT6iR 11 months ago
Timeless Series Finale: Cancelled NBC Series Returning for Two-Part Conclusion comingsoon.net/tv/news/961869… 11 months ago
Incredibles 2 Worldwide Box Office Crosses $1 Billion comingsoon.net/movies/news/96… 11 months ago
RT @comingsoonnet: The Guardians of the Galaxy cast write letter in support of James Gunn, asking he be reinstated for Vol. 3 https://t.co/… 11 months ago
Follow @sleeplessdave
blu rays
Great Movie Scenes
ian mckellan
samuel l jackson
the hobbit the desolation of smaug
Thor The Dark World


text:
Q: Uniqueness property of the adjoint operator If we consider a bounded linear operator $A$ between two complex Hilbert spaces $X,Y$ (i.e. $A: X \to Y$) then we can define the adjoint operator $A^*: Y \to X$ via the dual operator $A_{dual}^*: Y^* \to X^*$ and the isometric isomorphisms $\iota_X, \iota_Y$ by defining $$A^*:=\iota_X^{-1} \circ A_{dual}^* \circ \iota_Y$$
So far so good. Now comes the part which I'm struggling with:
Very analogous to the dual operator the adjoint is uniquely defined via $$\langle A^*y,x\rangle_X=\langle y,Ax \rangle_Y \space \forall x\in X \space \forall y \in Y$$
I've been trying to show this by using the fact that the dual operator is uniquely defined via $$\langle A_{dual}^*y^*,x\rangle = \langle y^*,Ax\rangle$$
and the Riesz reprensation of complex Hilbert spaces but somehow I'm not getting there.

A: First, let's be careful with notation. For a linear functional $f$ on a Hilbert space $H$, we will denote its action on an element $x$ by $f(x)$. We will denote the inner product on $H$ by $\langle \cdot,\cdot\rangle_H$. This way we won't get confused about which spaces are involved and whether a bracket is the duality pairing or an inner product.
In this notation, the dual map $A_{dual}^*:Y^*\to X^*$ is defined uniquely by the equation
$$
(A_{dual}^*y^*)(x) = y^*(Ax) ~\text{for all}~y^*\in Y^*, x\in X.
$$
Let $y\in Y$ denote the Riesz representative of $y^*$, and let $z\in X$ denote the Riesz representative of $A_{dual}^*y^*$. Then we can write the above as
$$
\langle z,x\rangle_X = \langle y,Ax\rangle_Y.
$$
On the other hand since $A^*$ is claimed to be defined by the property $\langle A^*y,x\rangle_X = \langle y,Ax\rangle_Y$, to prove our claim it is necessary to show that
$$
\langle z,x\rangle_X = \langle A^*y,x\rangle_X
$$
So our job is really to prove that $z = A^*y$, that is, the Riesz representative vector of $A_{dual}^*y^*$ is $A^*y$. To do this, go back to the definition of $A^*$ and the Riesz representative. The Riesz representative of any $x^*\in X^*$ is defined to be $i_X^{-1}x^*$, and for any $y\in Y$ its Riesz representative functional $y^*$ is given by $y^* = i_Yy$. Therefore the Riesz representative of $A_{dual}^*y^*$ is
$$
i_X^{-1}A_{dual}^*y^* = i_X^{-1}A_{dual}^*(i_Yy) = (i_X^{-1}A_{dual}^*i_Y)y = A^*y.
$$
By the identification of $X$ with $X^*$ by $i_X$, the claim is proved.


text:
\section{Introduction}

Let $q=p^m$, where $p$ is a prime. For any two positive integers $N$ and $n$,
let $\mathbb{F}^{N\times n}_q$ be the set of all $N\times n$  matrices over  a finite field $\mathbb{F}_q$. In this paper we assume $n\leq N$ since the transpose of an $N\times n$ matrix becomes an $n\times N$ matrix.  The rank, or rank weight,  of a matrix $M\in \mathbb{F}^{N\times n}_q$, denoted by Rk$(M)$,  is defined as the algebraic rank  of this matrix over $\mathbb{F}_q$.
The rank  distance $d_{R}(M_1,M_2)$ between
$M_1$ and $M_2$ is the rank of their difference $M_1-M_2$.

Let $G=(V ,E)$ be a simple undirected graph with the vertex set $V$ and the edge set $E$. For two vertices $v_i$ and $v_j$ ($i\not = j$) in $V$, the distance between $v_i$ and $v_j$, denoted by $d(v_i,v_j)$, is the number of edges in a shortest path joining $v_i$ and $v_j$ and the diameter of $G$ is
the maximum distance between any two vertices of $G$.

 \begin{definition}
 A  matrix graph, denoted by $\mathcal{M}_{N\times n}(q)$, is defined to be an undirected graph with the vertex set $\mathbb{F}^{N\times n}_q$ and the edge set
 $$E_{N\times n}(q)=\{(M_1,M_2)|M_1, M_2\in\mathbb{F}^{N\times n}_q,  d_{R}(M_1,M_2)=1\}.$$
 \end{definition}

 Recently, hypercubes were extensively studied due to their versatile and efficient topological structures of interconnection networks in  \cite{Bhuyan,Fu,hanlu, Jamison, Kim, Klotz, Ngo,NDG,Ostergard,Skupie,Sullivan,Wan}.
 The so-called $q$-ary $n$-cube is an undirected graph with the vertex set, $n$-dimensional vector space over $\mathbb{F}_q$,
and the edge set, which contains all pairs such that their Hamming distance is $1$.  The Hamming distance is  the number of distinct coordinates between the pair.

Matrix graphs may be  better  than hypercubes and so it is worth studying their properties.
We first give a basic lemma which will be used to prove the following Proposition 1.3. It is an old result with
the first derivation of the formula in [14, p.455]; see also Lemma 2.1 in \cite{ling}.

\begin{lemma} \label{lem-3.1}
The number of $N \times n$ matrices  over $\mathbb{F}_q$ with rank $k$ is
 $ \frac{\prod_{i=0}^{k-1}(q^N-q^i)(q^n-q^i)}{\prod_{i=0}^{k-1}(q^k-q^i)}$.
\end{lemma}

\begin{proposition}
The matrix graph $\mathcal{M}_{N\times n}(q)$ is $\frac{(q^N-1)(q^n-1)}{q-1}$-regular connected graph of order $q^{Nn}$.
\end{proposition}

\begin{proposition}
The distance of any two distinct matrices $M_1$ and $M_2$ in $\mathbb{F}^{N\times n}_q$ has $d(M_1,M_2)=d_R(M_1,M_2)=\mbox{Rk}(M_1-M_2)$.
\end{proposition}

\begin{proposition}
The  diameter of $\mathcal{M}_{N\times n}(q)$ is $n$.
\end{proposition}

Note that $\mathcal{M}_{N\times n}(q)$ is not a bipartite graph and $\mathcal{M}_{N\times 1}(q)$ is a complete graph.

\begin{proposition}
The $\mathcal{M}_{N\times n}(q)$ is vertex transitive and then the edge connectivity is $\frac{(q^N-1)(q^n-1)}{q-1}$.
\end{proposition}

\noindent {\bf Proof.} \quad If $M$ is a fixed matrix in $\mathbb{F}^{N\times n}_q$, then the mapping
$$\rho_M~:~A\mapsto A+M$$
 is a permutation of the vertices of $\mathcal{M}_{N\times n}(q)$, where $+$ is the matrix addition. This mapping is an automorphism because for any two distinct matrices $M_1$ and $M_2$, $d_R( M_1,M_2)=1$ if and only if $d_R(M_1+M,M_2+M)=1$. There are $q^{Nn}$ such permutations and they form a subgroup of the automorphism group of $\mathcal{M}_{N\times n}(q)$. This subgroup acts transitively on $\mathbb{F}^{N\times n}_{q}$ because for any two vertices $M_1$ and $M_2$, the automorphism $\rho_{M_2-M_1}$ maps $M_1$ to $M_2$.\hfill\rule{1ex}{1ex}

A coloring of $\mathcal{M}_{N\times n}(q)$ with $L$ colors is a mapping $\Gamma$ from the vertex set $\mathbb{F}^{N\times n}_q$ to ${\cal L}=\{1,2,\ldots,L\}$.
A $d$-distance (resp. exactly $d$-distance) coloring of $\mathcal{M}_{N\times n}(q)$ is to color the vertices of $\mathcal{M}_{N\times n}(q)$ such that
any two vertices with rank distance at most $d$ (resp. exactly $d$) have different colors. Note that
for a coloring of $\mathcal{M}_{N\times n}(q)$ with $L$ colors
\[\Gamma: \mathbb{F}^{N\times n}_q \longrightarrow \mathcal{L},\]
 it is a $d$-distance coloring of $\mathcal{M}_{N\times n}(q)$ if and only if for any two distinct vertices $M_1,M_2\in \mathbb{F}^{N\times n}_q$,
\[\Gamma(M_1)\neq \Gamma(M_2) \mbox{ if } d_R(M_1,M_2)\leq d\]
\noindent and it is an exactly $d$-distance coloring of $\mathbb{F}^{N\times n}_q$ if and only if for any two distinct vertices $M_1,M_2\in \mathbb{F}^{N\times n}_q$,
\[\Gamma(M_1)\neq \Gamma(M_2) \mbox{ if } d_R(M_1,M_2)= d.\]
Denote $\chi'_d(N\times n,q)$ (resp. $\chi_d(N\times n,q)$) as the minimum number of colors needed for a $d$-distance (resp. an exactly
$d$-distance) coloring of $\mathcal{M}_{N\times n}(q)$. Clearly, $\chi_{d}(N\times n,q)\leq \chi'_{d}(N\times n,q)$ for any $n$ and $N$.

These two coloring problems originally arose in the study of the scalability of optical networks \cite{Pavan}.  In the rest of our paper, we determine exact value of  $\chi'_{d}(N\times n,q)$ and give some bounds for $\chi_{d}(N\times n,q)$ for any $n$, $N$ and $d$.

The $d$-distance coloring and exactly $d$-distance coloring of $\mathcal{M}_{N\times n}(q)$ are equivalent to certain partitions of $\mathbb{F}^{N\times n}_q$, which are related
to rank codes in coding theory.  Therefore,  we introduce rank codes  in the next section.

\section{Rank codes }

Algebraic coding theory can be considered as the theory of subsets of a  finite-dimensional space over a finite field equipped with a norm function.  The most known norm in coding theory is the Hamming weight of a vector. It turns out that the rank function of a matrix over a finite field can also be considered as a norm function. The interest in these codes is a consequence of their application in random network coding \cite{Koetter}. Explicitly, the concept of the rank metric was introduced by Loo-Keng Hua \cite{hua} as "Arithmetic distance".  Delsarte \cite{del} defined the rank distance on the set of bilinear forms (equivalently, on the set of rectangular matrices) and proposed the construction of optimal codes in bilinear form representation.  Gabidulin
\cite{gab} introduced the rank distance for the vector representation over extension fields and found connections between
rank codes in the vector representation and in the matrix representation.

In the matrix representation, rank codes are defined as subsets of a normed space $\{\mathbb{F}^{N\times n}_q$, $Rk\}$ of $N\times n$ matrices over
 $\mathbb{F}_q$.  The definitions of  norm and distance of any two matrices  are defined as above.
The rank distance of a rank code $\mathcal{M}\subset \mathbb{F}^{N\times n}_q$ is defined as the minimal pairwise distance: $d(\mathcal{M})=d=\min\{Rk(M_i-M_j): M_i,M_j\in \mathcal{M}, i\neq j\}$.

 The size $|\mathcal{M}|$ of related code with code distance $d$ satisfies  the Singleton bound
$|\mathcal{M}|\leq q^{N(n-d+1)}$.  Codes reaching this bound are called maximum rank codes, or, MRD codes.
A rank code $\mathcal{M}$ is called $\mathbb{F}_q$-linear
if $\mathcal{M}$ is a subspace of $\mathbb{F}^{N\times n}_q$.

In \cite{del} the construction of optimal codes is proposed.  Therefore for any $n\leq N$,  a linear rank code $\mathcal{M}$ with code distance $d$ reaches the singleton bound $|\mathcal{M}|=q^{N(n-d+1)}$.

In the vector representation, rank codes are defined as subsets of a normed $n$-dimensional space
$\{\mathbb{F}^{n}_{q^N}, Rk\}$ of $n$-vectors over an extension field $\mathbb{F}_{q^N}$, where
the norm of a vector $\mathbf{v}\in \mathbb{F}^{n}_{q^N} $  is defined to be the column rank
$Rk(\mathbf{v}|\mathbb{F}_q)$ of this vector over $\mathbb{F}_q$, that is, the maximal number of coordinates of $\mathbf{v}$ which are linearly independent over the base field $\mathbb{F}_q$.  The  rank distance between two vectors $\mathbf{v}_1, \mathbf{v}_2$ is the column rank of their difference $Rk(\mathbf{v}_1-\mathbf{v}_2|\mathbb{F}_q)$.  The rank distance of a vector rank code $\mathcal{V}\subset \mathbb{F}^{n}_{q^N}$ is defined as the minimal pairwise distance:
$d(\mathcal{V})=d=\min\{Rk(\mathbf{v}_i-\mathbf{v}_j|\mathbb{F}_q): \mathbf{v}_i,\mathbf{v}_j\in \mathcal{V},i\neq j\}$.

A rank code $\mathcal{V}$ in the vector representation is called $\mathbb{F}_{q^N}$-linear if $\mathcal{V}$ is a subspace of $\mathbb{F}_{q^N}^{n}$.  Denote by $(N\times n,k,d)$ a code $\mathcal{V}$ over $\mathbb{F}_{q^N}$ of dimension $k\leq n$ and rank distance $d$.  Such a code can be described in terms of a full rank generator matrix $G_k$ over the extension field $\mathbb{F}_{q^N}$ of size $k\times n$. Code vectors $\{\mathbf{v}\}$ are all linear combinations of rows of this matrix.  Thus the size of a code is equal to $|\mathcal{V}|=q^{Nk}$.

Equivalently, a rank code $\mathcal{V}$ can be described in terms of a full rank parity-check matrix $H_{n-k}$ over $\mathbb{F}_{q^{N}}$ of size $(n-k)\times n$.   It satisfies the condition  $G_kH^{T}_{n-k}=O$, where $O$ is the all zero $k\times (n-k)$ matrix. Code vectors $(\mathbf{v})$ are all solutions of the linear system of equation $\mathbf{v}H^{T}_{n-k}=\mathbf{0}$.  We give the similar property of linear rank codes to the linear hamming codes as follows.

\begin{lemma}\label{lem:3.3}
Let $\mathcal{V}$ be a $(N\times n,k,d)$ linear rank code over $\mathbb{F}_{q^N}$ and  $H$ be a parity-check matrix for $\mathcal{V}$. Then the following statements are equivalent:

(i) $\mathcal{V}$ has rank distance $d$.

(ii) any $d-1$ columns of $H$ are linearly independent over $\mathbb{F}_{q^N}$ and $H$ has a $d$ columns
 that are linearly dependent over $\mathbb{F}_{q^N}$.
\end{lemma}

\noindent {\bf Proof.} \quad Let  $\mathbf{v}=(v_1,\ldots,v_n)\in \mathcal{V}$ be a codeword of rank weight $e$.  Thus there
are $n\times n$ invertible matrix $P$ such that $\mathbf{v}P=\mathbf{u}$, where $\mathbf{u}=(u_1,\ldots,u_e,0,\ldots,0)$ and where $u_i\neq 0$. So
$\mathbf{v}=\mathbf{u}P^{-1}$.     Then $\mathcal{V}$ contains a nonzero codeword
$\mathbf{v}$ of rank weight $e$ if and only if
\[\mathbf{0}=\mathbf{v}H^T=\mathbf{u}(H(P^{-1})^T)^T=u_1\mathbf{c}_1+\ldots+u_e\mathbf{c}_e,\]
which is true if and only if there are $e$ columns of $ H(P^{-1})^T$ (namely, $\mathbf{c}_{1}$,$\ldots$, $\mathbf{c}_{e}$)
that are linear dependent over $\mathbb{F}_{q^N}$ if and only if there are $e$ columns of $H$ that are linear dependent over $\mathbb{F}_{q^N}$.

To say that the rank distance of $\mathcal{V}$ is $\geq d$ is equivalent to saying that $\mathcal{V}$ does not contain any nonzero word of $\leq d-1$, which is in turn equivalent to saying that any $d-1$ columns of $H$ are linearly independent over $\mathbb{F}_{q^N}$.

Similarly,  to say that the rank distance of $\mathcal{V}$ is $\leq d$ is equivalent to saying that $\mathcal{V}$ contains a nonzero word of weight $\leq d$, which is in turn equivalent to saying that $H$ has $\leq d$ columns that are linear dependent over $\mathbb{F}_{q^N}$.

 The above discussion easily leads to the desired results.
\hfill\rule{1ex}{1ex}

Likewise, general constructions of MRD codes in terms of parity-check matrices can be obtained \cite{gab}.

\begin{proposition}\label{prop:4}
Let $h_1,h_2,\ldots,h_n$ be a set of elements from the extension field $\mathbb{F}_{q^N}$
linearly independent over the base field $\mathbb{F}_q$. Let $s$ be a positive integer such that $\gcd(s,N)=1$. Then a parity matrix of the form
\[ H_{d-1}=\left(\begin{array}{cccc}
                        h_1& h_2& \ldots &h_n\\
                        h^{q^s}_{1} & h^{q^s}_{2} & \ldots & h^{q^s}_{n} \\
                        \ldots & \ldots & \ldots & \ldots \\
                        h^{q^{s(d-2)}}_{1} & h^{q^{s(d-2)}}_{2} & \ldots & h^{q^{s(d-2)}}_{n}
                        \end{array}\right )\]
defines an MRD $(N\times n,k,d)$ code with code length $n\leq N$, dimension $k=n-d+1$, and
rank distance $d=n-k+1$.
\end{proposition}

Equidistant codes in rank norm are related to the exactly $d$-distance coloring problem. A code is said to be equidistant if the distance between any distinct codewords is the same (say $d$). A code is called a constant-weight code if each non-zero codeword is of the same weight.  In \cite{Tuvi} the authors constructed an equidistant constant rank code as follows.

\begin{proposition} \label{prop:5}
There exists an equidistant constant rank code over $\mathbb{F}_q$ with
matrices of size ${n \choose 2}\times n$, rank $n-1$, rank distance $n-1$, and size $q^n-1$.
\end{proposition}

\section{Exact value of  $\chi'_{d}(N\times n,q)$ }

 A code $C$ over $\mathbb{F}_{q^N}$ of length $n$ and minimum rank distance at least $d$ is called an $(N\times n,\ge d)_q$ code. Let $A_q(N\times n,d)$ (resp. $A_q(N\times n,\ge d)$) denote the maximum size of an $(N\times n, d)_q$ (resp. $(N\times n,\ge d)_q$) code. A code $C$ is called an $[N\times n, k]_q$ linear code if $C$ is a $k$-dimensional subspace of $\mathbb{F}^{n}_{q^N}$.
 An $[N\times n,k]_q$ linear code with minimum distance $d$ is denoted by an  $[N\times n,k,d]_q$. For the fixed $N$, $n$, and minimum distance $d$, let $k(N\times n,d)_q$ denote the maximum dimension of an $[N\times n,k,d]_q$ code. A  code $C$ of length $n$ is called an $(N\times n, \overline{\{d\}})_q$ forbidden distance code if $d_R(\mathbf{u},\mathbf{v})\not= d$ for any two distinct codewords $\mathbf{u},\mathbf{v}\in C$. Given $N, n$, and $d$, let $Q(N\times n, d)_q$ denote the maximum size of an $(N\times n, \overline{\{d\}})_q$ forbidden rank distance code.

An $(N\times n,L,d)_q$-partition (resp. $(N\times n, L,\overline{\{d\}})_q$-partition) of $\mathbb{F}^{N\times n}_q$ is a set of subsets $\{\mathcal{M}_i\}_{i=1}^{L}$ of $\mathbb{F}^{N\times n}_q$ satisfying (i) $\mathcal{M}_i\bigcap \mathcal{M}_j=\emptyset$ for $i\neq j$ and $\bigcup_{i=1}^{L}\mathcal{M}_i=\mathbb{F}^{N\times n}_q$, (ii) each $\mathcal{M}_i$ is an $(N\times  n,\geq d)_q$ rank code (resp. $(N\times  n,\overline{\{d\}})_q$ forbidden distance rank code). It is well known that a $d$-distance coloring (resp. an exactly $d$-distance) of $\mathbb{F}^{N\times n}_q$ with $L$ colors is equivalent to an $(N\times n,L,d+1)_q$-partition (resp. $(N\times n,L,\overline{\{d\}})_q$-partition) of $\mathbb{F}^{N\times n}_q$. Hence $\chi'_{d}(N\times n,q)$ (resp. $\chi_{d}(N\times n,q)$) is the minimum number $L$ of subsets in any $(N\times n, L, d+1)_q$ (resp. $(N\times n, L,\overline{\{d\}})_q$-partition) of $\mathbb{F}^{N\times n}_q$.

Since $q^{Nn}=|\mathbb{F}^{N\times n}_q|=\sum_{i=1}^{L}|\mathcal{M}_i|\le L A_{q}(N\times n,\geq d+1)\leq L A_{q}(N\times n,d+1) $ and $A_q(N\times  n,d)$ is decreasing in $d$, we have
\begin{equation}\label{eq:basic}
 \chi'_{d}(N\times n,q)\geq \frac{q^{Nn}}{A_{q}(N\times n,d+1)}.
 \end{equation}

Note that for an $[N\times n,k,d+1]_q$ linear rank code $\mathcal{M}$, the cosets of $\mathcal{M}$ form an $(N\times n,q^{n-k},d+1)_q$-partition of $\mathbb{F}^{N\times n}_q$. Hence,
if there exists an $[N\times n,k,d+1]_q$ linear rank code, then
\begin{equation} \label{eq:code}
\chi'_d(N\times n,q)\leq q^{N(n-k)}.
 \end{equation}
In particular,
\begin{equation} \label{eq:max}
\chi'_d(N,n,q)\leq q^{N(n-k(n,d+1))}.
 \end{equation}
Furthermore, if $A_q(N\times n,d+1)=q^{N\times k(n,d+1)}$, i.e., $A_q(N\times n,d+1)$ is attained by an  $[N\times n,k,d+1]_q$ linear rank code, then
\begin{equation}\label{eq:final}
\chi'_{d}(N\times n,q)=q^{N(n-k(n,d+1))}.
\end{equation}

Summing the above discussion, we get our result on $\chi'_{d}(N\times n,q)$.
It is clear that $\chi'_{d}(N\times n,q)=1$ if $d\geq n$.

\begin{theorem} For any positive integers $d\leq n$,  we have
$\chi'_{d}(N\times n,q)=q^{Nd}$.
\end{theorem}
{\bf Proof.} \quad
By Proposition \ref{prop:4}, we have $k(n,d+1)=n-d$ and so the required result is obtained by  Eq(\ref{eq:final}).
\hfill\rule{1ex}{1ex}

\section{Bounds of $\chi_{d}(N\times n,q)$ }

In this section, we consider bounds of $\chi_{d}(N\times n,q)$. Since the diameter of $M_{N\times n}(q)$ is $n$, $\chi_{d}(N\times n,q)= 1$ for any $d\ge n+1$. So we can assume $d\le n$.

\vskip.2cm

\begin{proposition}  For $N\geq n$, we have $\chi_{1}(N\times  n,q)= q^N$.
\end{proposition}
{\bf Proof.} \quad
When $d=1$,  it suffices to show that   $\chi_{d}(N\times n,q)\geq q^N$ since $\chi_{d}(N\times n,q)\leq \chi'_{d}(N,n,q)$.  Consider  a set $S=\{A=(a_{ij})\in \mathbb{F}^{N\times n}_{q}: a_{ij}=0,  \mbox{ for }1\leq i\leq N, 2\leq j\leq n \}$, in which  any two of them  have an edge, and so coloring them needs
\[\left(\begin{array}{c}
N\\
0 \end{array} \right )+ \left(\begin{array}{c}
N\\
1 \end{array}\right )(q-1)+\ldots+\left(\begin{array}{c}
N\\
j \end{array}\right )(q-1)^j+\ldots+\left(\begin{array}{c}
N\\
N \end{array} \right )(q-1)^N=(1+q-1)^{N}.\]
\hfill\rule{1ex}{1ex}

We give some examples about equidistant rank codes with maximal size in each case.

When $N=n=2$, $q=2$ and $d=2$. The code $C_1=\left( \left(\begin{array}{cc}
                                                                                1 & 0 \\
                                                                                0 & 1\end{array} \right ),
                                                                                \left(\begin{array}{cc}
                                                                                0 & 0 \\
                                                                                1 & 0\end{array} \right ),
                                                                                \left(\begin{array}{cc}
                                                                                0 & 1 \\
                                                                                0 & 0\end{array} \right ), \right.$
                                                                                $  \left. \left(\begin{array}{cc}
                                                                                1 & 1 \\
                                                                                1 & 1\end{array} \right )
                                                                 \right )$ in matrix form.

Let
$\alpha$ be a primitive element of the Galois field $\mathbb{F}_{2^3}$ such that $\alpha^3=\alpha+1$.
 We can construct an equidistant rank code
 $C_2$ of length $n=2$ over $\mathbb{F}_{2^3}$ and rank distance $2$, where
$C_2=\{(1,\alpha), (\alpha,1+\alpha), (1+\alpha+\alpha^2,1), (0,1+\alpha^2),
(1+\alpha,\alpha^2), (1+\alpha^2, 1+\alpha+\alpha^2),(\alpha+\alpha^2, \alpha+\alpha^2), (\alpha^2,0)\}$.

We can also consider an example in \cite{sel}. Consider
an equidistance rank  code $C_3$ of length $n=3$ over $\mathbb{F}_{2^3}$ and rank distance $3$.   The code $C_3$ is  $\{(\alpha^2,0,0), (1,\alpha,\alpha^2), (0,1,\alpha), (1+\alpha^2, 1+\alpha,\alpha+\alpha^2), (\alpha+\alpha^2, \alpha+\alpha^2,1),
(1+\alpha,\alpha^2, 1+\alpha^2), (\alpha,1+\alpha+\alpha^2,1+\alpha), (1+\alpha+\alpha^2, 1+\alpha^2,1+\alpha+\alpha^2)\}$.

Therefore, we get the following proposition.
\begin{proposition} We have
\begin{equation} \label{eq:special}
\chi_{n}(N\times n,2)= 2^N,  \mbox{  for pairs } (N,n)= (N,1),(2,2),(3,2),(3,3). \end{equation}
\end{proposition}

In addition, the size of an equidistant rank code over  $\mathbb{F}_{2^N}$with length $n$ and rank distance $n$    should be a power of 2 and so we propose
an open problem as follow:
\begin{equation} \label{eq: conj}
\chi_{n}(N\times n,2)= 2^N \mbox{ for all }N\geq n. \end{equation}

If this statement holds, it also means that there is a largest equidistant rank code over $\mathbb{F}_{2^N}$ with length $n$, distance $n$, size $2^N$.

\vskip.2cm

\begin{proposition}
For $n\geq 3$, we have $\chi_{n-1}({n \choose 2}\times n ,q)\ge q^n-1$.
\end{proposition}
{\bf Proof.} \quad
By Proposition \ref{prop:5},
it is forward to have  $\chi_{n-1}({n \choose 2}\times n ,q)\ge q^n-1$.
\hfill\rule{1ex}{1ex}

\vskip 0.2cm

 In the following we discuss upper bounds  of the exactly $d$-distance coloring of $\mathbb{F}^{N\times n}_q$. First we have
 \begin{equation} \label{eq:nat}
 \chi_{d}(N\times  n,q)\leq \chi'_{d}(N\times  n,q)=q^{Nd}.
 \end{equation}

 Furthermore, we use  the
 argument of linear forbidden rank distance codes.  An $[N\times n,k]_q$ linear rank code $\mathcal{M}$ is called an
$[N\times n,k,\overline{d}]_q$ linear forbidden rank distance code if $\mathcal{M}$ is also an $(N\times n, \overline{d})$ forbidden rank
distance code, i.e.,  $Rk(M)\neq d$ for any nonzero codeword $M$ of $\mathcal{M}$.
Given $N, n(n\leq N)$, and $d$, the maximum dimension of an
$[N\times n,k,\overline{d}]_q$ linear forbidden distance code is denoted by $k(N\times n,\overline{d})$. Similar to $d$-distance
coloring, we have

\begin{equation}
\chi_{d}(N\times  n,q)\leq q^{N(n-k)}.
\end{equation}
\noindent
\begin{equation}\label{eq:exactlc}
\chi_{d}(N\times  n,q)\leq q^{N(n-k(N\times n,\overline{d}))}.
\end{equation}

In the following lemma the lower bound on $k(N\times n,\overline{d})$ is given.

\vskip.2cm
\begin{lemma}  \label{lem:3.4}
We have
\begin{equation}
k(N\times n,\overline{d})\geq nN-\left\lceil \log_{q}[2+{n-1\choose d-1}(q^N-1)^{d-1}]\right\rceil.
\end{equation}
\end{lemma}
{\bf Proof.} \quad
First if
\begin{equation}
2+{n-1 \choose d-1}(q^N-1)^{d-1} \leq q^{mN},
\end{equation}
then there exists a  matrix $H$ over $\mathbb{F}_{q^N}$ of size $m\times n$ such that any column of $H$ is not equal to
the $\mathbb{F}_{q^N}$-linear combination of any other $d-1$ columns of $H$ by Lemma \ref{lem:3.3}.
Hence there is a $[N\times n, k,\overline{d}]$ linear forbidden rank distance code, where the dimension $k\geq n-m$. Take
\[Nm=\left\lceil \log_{q}[2+{n-1\choose d-1}(q^N-1)^{d-1}]\right\rceil. \]
Thus,
\begin{eqnarray*}
Nk(N, n,\overline{d}) &\geq & Ndim(\mathcal{V})\\
         & \geq & Nn-Nm \\
         & \geq & Nn-\left\lceil \log_{q}[2+{n-1\choose d-1}(q^N-1)^{d-1}]\right\rceil.
\end{eqnarray*}

This completes the proof.
\hfill\rule{1ex}{1ex}

\vskip.2cm

\begin{theorem} We have
\begin{equation}
\chi_{d }(N\times n,q)\leq q^{\lceil \log_{q}[2+{n-1\choose d-1}(q^N-1)^{d-1}]\rceil}.
\end{equation}
\end{theorem}
{\bf Proof.} \quad
The theorem follows from Lemma \ref{lem:3.4} and Eq (\ref{eq:exactlc}).
\hfill\rule{1ex}{1ex}

In the following table we list  some values of  two bounds from Eq(12) and Eq(\ref{eq:nat}).

\begin{table}[h]
\setlength{\unitlength}{.68cm}
\begin{center}
\centering \caption{ \label{figfcsr}  \ \ \ \ Bounds Comparison }
\begin{tabular}{|c|c|c|c|c|c|} \hline
$N$ & $n$ & $d$ & $q$ & Bound $(12)$ & Bound (\ref{eq:nat})\\
\hline
$6$ & $4$ & $2$ & $2$ & $2^8$ & $2^{12}$\\
\hline
$6$ &  $4$ &  $3$ & $2$ & $2^{14}$ & $2^{18}$\\
\hline
$6$ &  $4$ &  $2$ & $3$ &  $3^7$  & $3^{12}$\\
\hline
$6$ &  $4$ &  $3$ & $3$ & $3^{13}$ & $3^{18}$\\
\hline
$5$ & $3$ & $2$ & $2$ & $2^{6}$ & $2^{10}$\\
\hline
$5$ & $3$ & $3$ & $3$ & $3^{10}$ & $3^{15}$\\
\hline
$10$ & $7$ & $4$ & $2$ & $2^{35}$ & $2^{40}$\\
\hline
$10$ & $7$ & $4$ & $3$ & $2^{33}$ & $2^{40}$\\
\hline
\end{tabular}
\end{center}
\end{table}

\vskip.2cm

\section*{Acknowledgements} This work is partially supported by National Natural Science Foundation of China
(Nos. 61373019, 11171097 and 61170289).

\vskip.4cm

redpajama_set_name: RedPajamaArXiv


text:
You are at:Home»Classical Music»André Gagnon, 1936-2020
André Gagnon, 1936-2020
By La Scena Musicale Team on 3 December 2020 Classical Music
André Gagnon, the Quebec composer and pianist whose individual fusion of pop and classical idioms made him internationally popular, died on Dec. 3 at age 84. A statement on the website of his record label, Audiogram, said the cause was Lewy body dementia.
A native of Saint-Pacôme in the south-shore Kamouraska region of Quebec, Gagnon studied piano (Germaine Malépart) and composition (Clermont Pépin) at the Montreal Conservatoire from 1957 to 1961 and even took lessons in Paris with the French pianist Yvonne Loriod.
In a 1989 interview Gagnon said that a show by the French dancer Zizi Jeanmaire in Paris got him thinking about steering his career toward popular music.
"It wasn't just ballet, it was a complete, Shirley MacLaine kind of thing," Gagnon said. "So I told Loriod about this decision, and she said, 'Oh, maybe you are right, this is what you should do.' When she agreed so easily, I thought, 'My God, maybe I don't have what it takes to be a concert pianist.'"
Nonetheless, Gagnon found steady work in Montreal as an accompanist. And in point of fact he remained capable of playing classical repertoire (including Mozart with the Montreal Symphony Orchestra) at a professional level.
But Gagnon's career as a touring performer was taking off. His lyrical style had broad appeal, especially in Japan.
Gagnon also enjoyed success as a film composer and recording artist. Among his popular albums in the 1970s were Neiges, Surprise, Le Saint-Laurent and Mouvements.
Perhaps his most ambitious project was the opera Nelligan, an flashback treatment of the Quebec poet Émile Nelligan with a libretto by Michel Tremblay. Characteristically, the score occupied an evocative middle ground between pop and classical.
"It is sung by pop singers who have been retrained as classical singers," Gagnon explained before the 1990 premiere by the Opéra de Montréal. "They have been working with a vocal coach for some months.
"Of course, those singers remain pop singers. We don't have Mirella Freni or Plácido Domingo in the cast. But at the same time, there is no pop connotation in the way they are singing. At least I hope not."
In the same interview he commented on his personal style: "I can say it is quite different than Andrew Lloyd Webber. It is not distant in overall approach, I suppose, but the writing is very different than Evita or any other work of his I know.
"Yet at the same time it is not bel canto, it is not Verdi, it is not Puccini. Verdi stopped writing over 100 years ago. I must write now."
Gagnon for many years was the owner of Nelligan's greystone on St. Louis Square. While his touring schedule slowed after the 1990s, Gagnon continued to compose. In 2013 he collaborated again with Tremblay in the song cycle Lettres de Madame Roy à sa fille Gabrielle. The classical performers were contralto Marie-Nicole Lemieux and the Orchestre symphonique de Trois-Rivières under Jacques Lacombe.
La Scena Musicale Team
Today's Streams: Jan. 1st
Today's Streams: Dec. 31st
Les webdiffusions du jour : 31 décembre
Ontario's Stay at Home Regulations Cause Cancellations and Postponements to RCM's 20-21 Season and 21C Festival
The Conseil québécois de la musique will present Kent Nagano with the Prix Opus Hommage
Solid start for Payare, maybe more to come
Lebrecht's Album of the Week: Copland, Nielsen, MacMillan – Clarinet concertos (Delphian)
OSM chooses Rafael Payare as its next music director
Canadian Art Song Project announces Chung-Wai Chow and John Wright Art Song Mentorship Program for Composers
Daniel Taylor Appointed Officer of the Order of Canada


Failure Analysis Report By Failure Analysis Engineers - Failure analysis report by failure analysis engineers by SEA Limited.
Failure analysis report by failure analysis engineers by SEA Limited.
Aarkstore - Congestive Heart Failure (Heart Failure) - Pipeline Review, H2 2014 - "Congestive Heart Failure (Heart Failure) - Pipeline Review, H2 2014"report features investigational drugs from across globe covering over 20 therapy areas and nearly 3,000 indications.
"Congestive Heart Failure (Heart Failure) - Pipeline Review, H2 2014"report features investigational drugs from across globe covering over 20 therapy areas and nearly 3,000 indications.
Congestive Heart Failure - Congestive Heart Failure is a serious condition in which the heart doesn't pump blood as efficiently as it should.
Congestive Heart Failure is a serious condition in which the heart doesn't pump blood as efficiently as it should.
Highway failure and their maintenance - This is a power point presentation on Highway failure and their maintenance. Various highway failure are described along with pics.
This is a power point presentation on Highway failure and their maintenance. Various highway failure are described along with pics.
Heart Failure Chapter 19 - Heart Failure Chapter 19 John Noviasky, PharmD Question 1 What are signs of LVH dysfunction compared to RV dysfunction? Table 19-6 What causes the S3 sound?
Heart Failure Chapter 19 John Noviasky, PharmD Question 1 What are signs of LVH dysfunction compared to RV dysfunction? Table 19-6 What causes the S3 sound?
Kidney failure treatment bangalore - Kidney failure or renal failure is the inability of the kidneys to function properly. Your kidneys are involved in various bodily processes such as removing the waste products and extra fluids from the body.
Kidney failure or renal failure is the inability of the kidneys to function properly. Your kidneys are involved in various bodily processes such as removing the waste products and extra fluids from the body.
Living with Heart Failure - Living with Heart Failure ROTHERHAM There are 2,081 people in Rotherham = 5.2% of population (national expected is 4.5%) with confirmed heart failure.
Living with Heart Failure ROTHERHAM There are 2,081 people in Rotherham = 5.2% of population (national expected is 4.5%) with confirmed heart failure.


text:
Phyllodoce melaena är en ringmaskart som beskrevs av Monro 1939. Phyllodoce melaena ingår i släktet Phyllodoce och familjen Phyllodocidae. Inga underarter finns listade i Catalogue of Life.

Källor

Havsborstmaskar
melaena

redpajama_set_name: RedPajamaWikipedia


text:
The Remedy partners with SportsBoard to deliver new technology
SportsBoard, the first mobile player assessment solution designed to streamline the recruiting and in-season evaluation process for college coaches, has developed a new football-focused product called Football Scout and has partnered with two national firms to distribute it to college athletics programs across the country.
The Remedy, a Dallas, TX-based branding and marketing company, and The Team: Sports, Entertainment, & Media based in Columbus, OH, will assist SportsBoard with its roll-out of Football Scout. The two companies have a combined six decades of experience in the sports industry and also have extensive relationships with football coaches and athletic administrators at colleges and universities of all sizes, ranging from major NCAA BCS-level schools to smaller Division III and NAIA programs.
SportsBoard's Football Scout offers revolutionary technology that allows coaches to more efficiently and effectively scout and analyze prospective recruits using an iPad or iPhone App. Football Scout enables programs to implement a standardized, structured assessment process for all coaches, eliminating data entry into recruiting databases and saving time on administrative work. With Football Scout, coaches can focus more on coaching and winning.
Unique features of SportsBoard include the ability to capture videos, photos, voicememos and text notes, sport-specific player ratings, and other empirical data collected on the recruiting trail and easily sync that information to a team's recruiting database in a matter of seconds, eliminating the administrative time and effort it traditionally takes to sort through pages of handwritten notes and manually enter the information into spreadsheets or other databases.
"This is an outstanding technology that is the next must-have asset in the ever-growing recruiting arms race within college athletics," said Stephen Evans, President of The Remedy. "We can't wait to get SportsBoard's Football Scout in front of our colleagues in the industry. There is not a sports program in the country, large or small, that wouldn't benefit from implementing SportsBoard into their day-to-day coaching, scouting, and recruiting efforts."
In addition to recruiting, SportsBoard also offers the following in-season features that allow college athletics programs to save time and money and work more efficiently:
The Ability to Interface with Video Analysis Systems: Feed stats to video analysis systems like DVSport, XOS, HUDL, and others for "auto-tagging" of video by player and stat.
Opponent Scouting: Coaches are also able to scout opponents and then email scouting reports to coaches/players.
Player Evaluations: Coaches can easily capture, track, and report on player development and generate in-season player evaluations.
Finally, SportsBoard offers revolutionary camp functionality that allows coaches to capture and distribute video evaluations of athletes with voice-over critiques within hours of the end of a camp. SportsBoard's unique ability to capture the video/voice data by player in its App, sync the App with the SportsBoard server, allow coaches to create an email template, and then send one email template to hundreds of athletes who participated in the camp with only the athlete's videos attached to each email saves weeks of time. The "wow" factor for athletes and their parents receiving these evaluations so quickly is huge, and they can then share these video evaluations with their high school/club coaches and even college coaches recruiting them. And, even better, these video evaluations can enable coaches' offseason camps to generate an additional source of revenue.
"We are thrilled to be partnering with The Remedy and The Team to expand our footprint in football," states Gregg Jacobs, SportsBoard's Founder and CEO. "With the relationships they have already in place, we have great expectations for making a lot of progress quickly in this market."
Football Scout is SportsBoard's newest product. SportsBoard currently supports more than ten sports including baseball, basketball, soccer, lacrosse, ice hockey, field hockey, tennis, volleyball, and rugby. More than 150 college sports programs are already using the SportsBoard product, including programs at major NCAA universities such as Maryland, Stanford, Duke, Miami (Fla.), Michigan, Ohio State, Notre Dame, Syracuse, North Carolina, Kentucky, and Oregon.
ABOUT SPORTSBOARD
Founded in 2011 by Gregg Jacobs, SportsBoard is a mobile player assessment solutions company for recruiting, season and camp activities. Based in San Rafael, CA, SportsBoard is a registered trademark of West Shore Technologies. SportsBoard is available for 10 sports, including Soccer, Basketball, Lacrosse, Baseball, Football, Ice Hockey, Field Hockey, Tennis, Volleyball, and Rugby – and soon Softball. Over the past 10 months, more than 150 Division I through Division III colleges have adopted SportsBoard as their player management system. For more information about SportsBoard, visit our website at SportsBoard-win.com.
ABOUT THE REMEDY
Specially designed for small and mid-size companies, The Remedy is a full-service branding solutions firm that incorporates forward-thinking marketing and communications strategies with integrated, world-class graphic design to deliver comprehensive branding solutions at a fair price with a commitment to providing customers The Remedy to their branding needs. For more information about The Remedy, visit our website at YourBrandRemedy.com.
ABOUT THE TEAM: SPORTS, ENTERTAINMENT, & MEDIA
The Team: Sports, Entertainment & Media focuses its efforts in four areas: (1) brokering of sports and entertainment opportunities and entities, (2) producing of live sports and entertainment events, (3) providing comprehensive management and consulting services, and (4) creating, producing and placing media and branding elements. The Team has successfully managed transactions for an array of highly respected organizations throughout the industry including teams at all levels, venues, buyers, sellers, licensed products, television and media projects, and other related businesses.
Look who showed up at Garrett Morris' Downtown Blues & Comedy Club
Smiling Moose Deli selects The Remedy to assist with Grand Opening


text:
Subglacial Antarctic Lakes Scientific Access
Field Blog
What is Salsa?
Schedule and Deployment
Subglacial Hydrology
Sedimentary Geology
Scientific Stewardship
WISSARD
18/19 Field Reports
SALSA Education and Outreach
SALSA fast facts
SALSA Abstracts
WISSARD Abstracts
Hot Water Drill
At over a thousand feet below the ice surface, the Antarctic subglacial biome is one of the most challenging regions on earth to access. The only way to tap into this newly explored environment is through the use of highly specialized technology in conjunction with carefully planned logistics. Through using a hot water drill system (HWDS), SALSA will deploy scientific instruments approximately 4,000 feet below the ice to explore and sample from this little understood ecosystem.
Hot water drill and Borehole
Lead Driller Dennis Duling (Center Right) and Team
SALSA's HWDS was originally developed for the WISSARD project by the University of Nebraska-Lincoln's Science Management Office and was designed to be portable, modular, and completely clean.
The design of a successful deep field HWDS is based on careful planning, simple and practical design elements, the use of commercial off the shelf (COTS) components that can be replaced by a suitable inventory of spare parts, the fabrication of customized fit-to-mission components to augment the COTS primary components, and peer-reviewed commissioning of the combined science and engineering modules in order to achieve a systems-wide integration that achieves logistical, operational and science objectives.
Introducing microbial contamination to the subglacial environment during drilling operations could compromise environmental stewardship and the science objectives of the project, consequently we developed a set of tools and procedures to directly address these issues. SALSA's hot water drilling efforts will include a custom water treatment system designed to remove micron and sub-micron sized particles (biotic and abiotic), irradiate the drilling water with germicidal ultraviolet (UV) radiation, and pasteurize the water to reduce the viability of persisting microbial contamination. Our clean access protocols also include methods to reduce microbial contamination on the surfaces of cables/hoses and down-borehole equipment using germicidal UV exposure and chemical disinfection.
CLICK HERE FOR PEER REVIEWED PAPER ON CLEAN ACCESS
SALSA will deploy a wide array of scientific instruments in order to explore the biological, geochemical, and hydrological dynamics of Mercer Subglacial Lake .
The WTS-LV (large volume water transfer system) used for WISSARD
Water column conductivity and temperature will be measured in situ using a Seabird CTD lowered through the borehole and into the lake. More comprehensive CT measurements of the water away from the borehole will be made using the Deep SCINI ROV that will also take 4k hi-resolution video of the bottom of the ice sheet and surficial sediments. Particulate matter from the lake will be collected in situ using a McLane WTS-LV (large volume water transfer system) to filter concentrate particles as small as 0.2 microns for DNA sequencing. Bulk water for experiments and physical/chemical measurements will be obtained from the lake using 10L Niskin bottles. Basal ice cores from the 10-20 m of ice closest to the ice sheet base will be collected using a hot water corer. Shallow sediment samples (less than 1 m) will be collected using a UWITEK multicoring system; porewater will be obtained from the cores using Rhizon samplers throughout the core. Deeper sediments will be obtained from a free fall gravity corer.
Deep Corer Release System Video
SALSA Instagram


text:
Book Recommendation Flight From Mayhem 2
Some of our suggestions for "Flight From Mayhem 2" book searches. Get the complete book FREE for you, please register your account. We are happy to welcome you. Easy and Fast.
Mia Mayhem Learns To Fly by Kara West
In this second adventure of the brand-new Mia Mayhem chapter book series, Mia learns to fly! When Mia gets placed in a beginner's flying class with kindergarteners, she struggles and is ready to give up! But luckily, with help from her best friend, Eddie, and the superschool's most talented flier, Mia finally learns how to get off the ground. With easy-to-read language and illustrations on almost every page, the Mia Mayhem chapter books are perfect for emerging readers.
Reports Of Cases Determined In The Supreme Court Of The State Of Missouri by Missouri. Supreme Court
Category : Law reports, digests, etc
ISBN : CORNELL:31924070220920
The Unofficial Guide To Disneyland 2016 by Bob Sehlinger
Publisher : The Unofficial Guides
A great destination and thorough preparation are what make a wonderful vacation, and The Unofficial Guide to Disneyland makes Disneyland one of the most accessible theme parks in the world. With advice that is direct, prescriptive, and detailed, it takes the guesswork out of the reader's vacation. Whether they are at Disneyland for a day or a week, there is a plan for any group or family. They can enjoy the rides, activities, and entertainment instead of spending their time in lines. Comprehensive information is presented in a way that permits easy comparisons and that facilitates decision making. There are detailed plans and profiles of hotels, restaurants, and attractions that are presented in "at-a-glance" formats that provide for near instant communication of the most salient information. Profiles are supplemented by indexes. In short, we've got a plan for every reader. The Unofficial Guide to Disneyland's research team is a multi-disciplinary group consisting, among others, of data collectors, computer scientists, statisticians, and psychologists. Their singular goal is to provide a guide that will let you get it right the first time and every time. With their help, advice, and touring plans the reader will have a one-up on anyone else not using The Unofficial Guide to Disneyland. The book is the key to planning a perfect vacation in a great destination location.
Flight From Mayhem by Yasmine Galenorn
New York Times bestselling author Yasmine Galenorn presents the second Fly by Night novel, set in the realm of the Otherworld. I'm Shimmer, a blue dragon shifter. Thanks to a mistake, I was exiled from the Dragon Reaches and sentenced to work for gorgeous, exasperating Alex Radcliffe, a vampire who owns the Fly by Night Magical Investigations Agency. Every time I turn around, somebody's trying to kill us. But you know what they say: All's fair in love and bounty hunting... A serial killer is stalking the elderly Fae of Seattle, draining their bank accounts before brutally murdering them. When Chase Johnson asks for our help, Alex and I discover that the sociopath is also a shifter—able to change shape to match his victim's deepest desires. Our friend and colleague Bette volunteers to act as bait, but the plan goes dangerously awry. Now, unless we find her first, she's about to face her worst nightmare.
The Unofficial Guide To Disneyland 2022 by Seth Kubersky
The Most Thorough Guide to Disneyland Park and Disney California Adventure Filled with revolutionary, field-tested touring plans that can save 4 hours of waiting in line in a single day, The Unofficial Guide to Disneyland 2022 is the key to planning a perfect vacation. Get up-to-date information on Disneyland Park and Disney California Adventure. Each attraction is described in detail and rated by age group, based on a survey of more than 20,000 families. Whether you're visiting Disneyland for a day or a week, there is a plan for any group or family. Enjoy the rides, activities, and entertainment instead of wasting time standing in line. What's NEW in the 2022 edition of The Unofficial Guide to Disneyland: The latest scoop on Avengers Campus and the new Spider-Man ride at Disney's California Adventure The latest information on how COVID-19 has impacted the Disneyland Resort Comprehensive in-depth critical assessments of every attraction, including the new WEB Slingers and reimagined Snow White rides The latest information on how COVID-19 has impacted the Disneyland Resort Up-to-date information on visiting Star Wars: Galaxy's Edge, including how to use virtual boarding passes to ride Rise of the Resistance Profile and ratings for more than 30 Disneyland Resort and Anaheim hotels, including the luxurious new JW Marriott at GardenWalk Updated tips for visiting Universal Studios Hollywood, with reviews of the new Jurassic World and Secret Life of Pets rides
Mosquito Mayhem by Martin W. Bowman
Publisher : Pen and Sword
The flak started about four or five minutes before the target and immediately it was apparent that it was intense and extremely accurate. Oboe entailed the pilot flying dead straight and level for ten minutes on the attack run. Suddenly a tremendous flash lit up the sky about 50 yards ahead of our nose and exactly at our altitude. Within a tenth of a second we were through the cloud of dirty yellowish-brown smoke and into the blackness beyond. I shall never forget the spontaneous reaction of both my pilot and myself. We turned our heads slowly and looked long and deep into one anothers eyes - no word was spoken - no words were needed.The Mosquito was probably World War IIs most versatile combat aircraft. This book contains hundreds of firsthand accounts from many of the twoman crews who flew in them; pilots and navigators. It portrays the dramatic experiences of flying in its many roles as pathfinder, night fighter, reconnaissance aircraft, precision bombing and low-level ground attack aircraft. It describes many of the RAFs most audacious raids on prime but difficult targets where carpet bombing by heavy bombers was likely to be ineffective and cause unnecessary casualties to civilians. It is a remarkable record of the aircraft and the men that flew them.
The Flying Dragon by Paul "Monty" Choy
Publisher : Xlibris Corporation
The Flying Dragon is about a Chinese boy who was born and lived in Malaysia during the Forties through the Sixties. He succeeded in his aspiration to fly by becoming a pilot in the RMAF. Read about his life story intermingled with episodes of happiness, fascination, sadness, frustration, and resignation.
Multicoloured Mayhem by Jacqui Jackson
Publisher : Jessica Kingsley Publishers
Presents advice for parents on how to raise children with autism, Asperger's syndrome, and AD/HD.
Publisher : Little Simon
Mayhem On Mallorca by Aileen Nowatzki
Publisher : America Star Books


text:
import { Component, ViewEncapsulation } from '@angular/core';

@Component({
    selector: 'app-root',
    templateUrl: './app.component.html',
    styleUrls: ['./app.component.css'],
    encapsulation: ViewEncapsulation.None
})

export class AppComponent {
    ticksMinor: any = { interval: 10, size: '5%' };

    ticksMajor: any = { interval: 20, size: '9%' };

    ranges: any[] =
    [
        { startValue: 0, endValue: 55, style: { fill: '#4bb648', stroke: '#4bb648' }, endWidth: 5, startWidth: 1 },
        { startValue: 55, endValue: 110, style: { fill: '#fbd109', stroke: '#fbd109' }, endWidth: 10, startWidth: 5 },
        { startValue: 110, endValue: 165, style: { fill: '#ff8000', stroke: '#ff8000' }, endWidth: 13, startWidth: 10 },
        { startValue: 165, endValue: 220, style: { fill: '#e02629', stroke: '#e02629' }, endWidth: 16, startWidth: 13 }
    ];
}


text:
HomeFood UnwrappedSeries 6 Episode 1
Food Unwrapped - Series 6 Episode 1
Are alarming headlines about MSG justified? Jimmy visits a huge factory to find out. Kate investigates rumours that the Brazil nuts in UK supermarkets are all radioactive. Plus: elderflower cordial.
Food Unwrapped was broadcast on 4seven at Thursday 9 January 2020, 03:00.
Series 6 Episode 1
Views8 x
Does Breakfast
New Year Health Secrets
Food Unwrapped
Food Unwrapped is a TV show on British national television from 4seven with an average rating of 3.2 stars by TelevisionCatchUp.co.uk's visitors. We have 211 episodes of Food Unwrapped in our archive. The first episode of Food Unwrapped was broadcast in January, 2020. Did you miss an episode of Food Unwrapped but don't you wan't that to happen in the future? Please set an alarm and add Food Unwrapped to your favourites, so we can remind you by email when there's a new episode available to watch. For free!
Food Unwrapped catch up


Congratulations! Your big day is fast approaching, and you probably need to start the planning process. Making sure everything is in order for your wedding day can be stressful, so we put together three ways to relieve stress on and before your wedding day.
From the moment you start planning your wedding in Pigeon Forge, until you finally say 'I do' on your special day, it's important to stay organized. It helps to make a to-do list and keep yourself focused on the things you need to do to plan your wedding. Some brides like to keep a folder filled with information about photographers, caterers and venues in the Smoky Mountains.
Planning a Pigeon Forge wedding doesn't have to be overwhelming. There are plenty of resources here, in the Smoky Mountains, who will help you plan a flawless wedding. If you're worried about finding the perfect place for your friends and family to stay while you're in town, Amazing Views Cabin Rentals has a great selection of group cabins, so everyone can stay together and enjoy a memorable vacation. You can even check out our Yelp page to see what people are saying about us.
Something almost every bride-to-be forgets to do is eat and exercise. It's vital that you keep a healthy diet to maintain your energy, and exercise to help relieve some of the stress. Even if you just take a short walk every day, that's a great way to clear your mind and give your body a re-boost for the next day's planning.
At Amazing Views Cabin Rentals, we would love to help you find the perfect cabin for your family, so they can all be a part of your beautiful Pigeon Forge wedding. You can give us a call at (855) 849-8977 to start planning your stay in the Great Smoky Mountains.


text:
The Six Year Old Me Explains Classic Cinema
I haven't really seen that many movies, but I do know which ones I like and which ones I don't
And I don't really like the Titanic, and I'm not sure why that girl wasn't wearing any clothes, and
the guy had to die at the end, or why my mom seems to like the movie so much, and my dad tells
me we'll watch a real movie later next and he says sorry to me and my brother for bringing us
along, but my younger brother is just learning to talk and I don't mind too much because of the
popcorn and the soda because we never have popcorn at home and I never get to drink soda after
it gets dark except for movie night.
Besides, whenever I got bored I just started thinking about Apollo 13 and I start thinking if they
can fix a ship crashing in space, you'd think they'd be able to stop a ship sinking in the water and
maybe I don't know too much about science, but I know that fixing things is a good thing and
that both my mom and dad fix things, although my mom fixes people and my dad fixes ships,
and my mom talks about the Titanic, she says words like 'broken hearts' and I ask her if she can
fix them, and she smiles and says yes and when my dad talks about Apollo 13, he says words
like differential equations and fluid dynamics, and I'm not really sure what any of that means, but
dad says that one day, if I want to, I might learn.
So next week, we're going to see Jurassic Park with our new video tape player and dad says it's a
pain in a word mom won't let him say to install, but we can watch movies on our little tv and I
think that's really cool that we don't have to go out to see movies and that our tv doesn't just play
cartoons. And when I see the dinosaurs on the screen and people getting hurt, I ask mom if she
can fix them and I ask dad if he could stop the dinosaurs, but there's also this part of me that
doesn't want to stop the dinosaur because they're really cool.
And when mom and dad realize this, they go on a computer and they use something called the
internet and find a place that has real dinosaurs, except they're not real, just moving models, but
it's still the coolest thing and they take my picture with all of the cool dinosaurs.
And the week after that, my dad's away on a ship and he will be for a while, but he gives us a gift
and says it was one of his favorite movies and it's called Star Wars and I'm hoping that there's
more space, and more dinosaurs, and my mom works in the morning while we're in school, but
the weekend is coming up and I show her my good grades in math and science and reading and
she smiles and says okay, we'll watch one more.
And dad's going to be back soon. He has to fix things with science, like mom does only different.
And I can't wait till I fix things.
Mikkel Snyder is a performance poet currently based in Madison, WI area. He has ties to the spoken word scene in DC and St. Louis. An engineer by trade and a writer by passion, Mikkel can be often found combing comic book shops and catching up on the latest episodes of prime time television.