text:
Hunter Biden Wasn't Dishonorably Discharged: Military Discharges Explained
KBIA | By Alexander Trimis
In the first presidential debate, President Donald Trump said that former Vice President Joe Biden's son, Hunter Biden, was dishonorably discharged from the Navy for cocaine use. While Hunter Biden was administratively separated from the military, he could not have received a dishonorable discharge.
According to reporting by the Wall Street Journal, Hunter Biden was discharged from the Navy as the result of a failed drug test — he was found to have cocaine in his system. Biden has said that he was administratively separated, which eliminates the possibility of a dishonorable discharge.
Within the Department of the Navy — which includes the United States Navy and the United States Marine Corps — there are three basic categories of discharges: Administrative Discharges, Punitive Discharges, and Clemency Discharges.
This explanation will focus on the first two as the Clemency Discharge focuses on "Vietnam Era Draft Evaders and Military Deserters," and thus is very uncommon nowadays. The military separates each of these discharges into several categories known as the service member's "character of discharge."
The first of these categories is Administrative Discharges. This category includes service members who have completed their enlistment contract and those who are separated prior to the completion of their enlistment contract – for various reasons. When a service member is administratively discharged (also known as an administrative separation), they will receive a character of discharge described as "Honorable," "General" (also termed "Under Honorable Conditions"), "Other Than Honorable" or "Entry Level Separation," depending on the service member's record of service. This record includes things like proficiency and conduct while serving.
When a person is said to have "served honorably," it means that veteran's service was characterized as "Honorable" upon their discharge from the military. This means that the service member exhibited proper military behavior and adequate performance of duty while serving in the armed forces. This is the most common type of discharge, with nearly 85 percent of service members receiving an Honorable discharge.
When a service member's discharge is characterized as "General," it means their service was honorable for most of their time in service but may not warrant an "Honorable" discharge. An example would be a service member who failed to meet physical fitness requirements during the final part of their time in.
When a service member's discharge is characterized as "Other Than Honorable," it means they were separated for a reason described in the Naval Military Personnel Manual or the Marine Corps Separation and Retirement Manual. An "Other Than Honorable" discharge can be the direct result of misconduct or unsatisfactory performance of duties.
A discharge that is initiated when a service member has not completed their initial military training is generally deemed an "Entry Level Separation." In some circumstances, service members may be granted an "Honorable" or "Other Than Honorable" discharge at this time, but these occurrences are rare.
When a service member receives a punitive discharge as the result of a court-martial sentence, they are assigned a character of discharge described as "Bad Conduct" or "Dishonorable."
There are two types of court-martial. A conviction from a special court-martial is similar to a misdemeanor conviction. A conviction from a general court-martial is similar to a civilian felony conviction. "Bad Conduct" discharges can result from a special or general court-martial. A "Dishonorable" discharge can only come from a general court-martial.
If a veteran disagrees with their character of discharge, they are able to contest the classification and petition to have their discharge upgraded, often based on extenuating circumstances or mental health issues that were present during their time in service.
The Department of Defense doesn't release personnel records of service members. Unless Hunter Biden releases his own records, the public may never know what his character of discharge was. However, if Biden was in fact "administratively separated," based on the military's separation system, it is impossible for Hunter Biden to have received a dishonorable discharge.
Due to the sheer number of factors that affect the character of discharge, it is impossible to concisely describe all of them, but the Navy publishes their separation manual here, and the Marine Corps publishes their separation manual here. More information about Naval discharges can be found in Title 32, Subtitle A, Chapter VI, Subchapter C, part 724, Subpart A of the Electronic Code of Federal Regulations. Other branches of the military follow similar criteria. For brevity, this article focuses on the Department of the Navy.
News presidential debatejoe bidenHunter Biden


Preheat an outdoor grill over medium-high heat. Spray a grill pan with cooking spray. Set aside.
In a medium bowl, combine the apple slices and safflower oil, tossing to coat. Transfer the apples to the prepared grill pan. Grill the apple slices until they are slightly charred, about 2 minutes per side.
In a small bowl, combine the cinnamon and ginger. Sprinkle the cinnamon-ginger mixture over the grilled apple slices.
In a small saucepan over medium-high heat, combine the maple syrup, cream and butter. Bring the mixture to a boil. Cook until golden, about 4 minutes.
Remove from heat, and allow to cool, 5 minutes. Whisk in the mascarpone cheese until smooth.
Arrange 4 small serving plates. Evenly divide the apple slices among the plates.
Drizzle the apple slices with the cream. Sprinkle each dish with chopped hazelnuts, and serve.


text:
core50 » Rock » Billy Idol - Live In Providence, RI
Billy Idol - Live In Providence, RI Full Album
Billy Idol Disc Live Punk 2003
Performer: Billy Idol
Title: Live In Providence, RI
Style: Punk
Label: Disc Live
Catalog number: BI-0307090401
1 Flesh For Fantasy 7:28
2 Rebell Yell 8:57
3 Stranger In My Skin 4:55
4 L.A. Woman 8:32
5 In The Killbox 4:15
6 Don´t Need A Gun 6:22
7 Ready Steady Go 3:21
8 CD2
9 Sweet Sixteen 6:58
10 Dementia 5:03
11 Beautiful Life 5:26
12 White Wedding 6:11
13 Intro / Cradle Of Love 5:43
14 Eyes Without A Face 7:30
15 Blue Highway 7:21
16 Twenty-Flight Rock / To Be A Lover 4:54
17 Dancing With Myself 5:20
18 Walk The Line 4:09
19 CD1
20 Mony Mony 5:52
21 Hot In The City 3:59
This Release is a Part of a Live Series from Disclive from Billy Idols 2003 US Tour.
Live in Providence RI on Sept.04/2003.LTD to 1000 copies,Digipak
(C)(P) 2003,Billy Idol LLC,Manufactured and distributed by DiscLive,Inc.
Intro of track CD1-11 is 'Twenty-Flight Rock' originally played by Eddie Cochran
Rebel Yell is the first song on the Billy Idol album of the same name. Pete Townshend's Classic Quadrophenia. The Very Best Of Billy Idol: Idolize Yourself. Billy Idol. Devil's Playground. Billy Idol is the eponymous debut studio album by English rock vocalist Billy Idol, released on 16 July 1982 by Chrysalis Records. After the breakup of the band Generation X and the release of his first solo extended play, Don't Stop 1981, Idol began working on his debut album. Produced by Keith Forsey, Billy Idol is a rock album with strong influences of new wave music. Billy Idol: English musician, singer, songwriter, and actor who holds dual British and American citizenship. He first achieved fame in the 1970s emerging from the London punk rock scene as a member of Generation X. Subsequently, he embarked on a solo career which led to international recognition and made Idol a lead artist during the MTV-driven Second British Invasion in the United States. The name Billy Idol was inspired by a schoolteacher's description of him as idle. Rebel Yell, White Wedding - Part 1, John Wayne и другие песни. Songs in album Billy Idol - BFI Live 2016. Billy Idol - Postcards From The Past Live In Houston. Billy Idol - Cradle Of Love Live In Nashville. Billy Idol - Can't Break Me Down Live In Nashville. Billy Idol - Dancing With Myself Live In Nashville. Billy Idol - Flesh For Fantasy Live In Dallas. Billy Idol - Save Me Now Live In Dallas. Billy Idol - Ready Steady Go Live In Vienna. Billy Idol - Sweet Sixteen Live In Odense. Billy Idol - Eyes Withou. Album Live Music CDs in English. Pink Floyd Music Album CDs in English. The Beatles Music Album CDs in English. Go to next slide - You may also like. Billy Idol - Charmed Life - C. D Album Promo Fold Out Cover Chrysalis 1990. Make offer - Billy Idol - Charmed Life - C. BILLY IDOL Idol Songs 11 of the Best 1988 CD Compilation Chrysalis CDP3216602. Listen free to Billy Idol Live in concert Super Overdrive, Dancing With Myself and more. 13 tracks 53:35. Last updated: 13 minutes ago. Billy Idol Performing Arts Center, Providence, RI - Sep 4, 2003 Sep 04 2003. Following concerts. Billy Idol Fleet Pavilion, Boston, MA - Sep 5, 2003 Sep 05 2003. Billy Idol born William Michael Albert Broad on November 30, 1955 in Middlesex, England is an English musician. Idol lived in Worthing before attending Sussex University for only a year before joining the Bromley Contingent of keen Sex Pistols fans. During this period, Idol decided to become a musician and formed a band called Generation X in 1976
Related to Billy Idol - Live In Providence, RI
Billy Idol - BILLY IDOL
Billy Idol - Billy The Rebel
Billy Idol - White Wedding
Billy Idol - Idolize Yourself (The Very Best Of Billy Idol)
Billy Idol - Hot In The City
Billy Idol - Charmed Life
Billy Idol - Greatest Hits
Billy Idol - Idolize Yourself - The Very Best Of
Billy Idol - Live USA
Billy Idol - Mony Mony

redpajama_set_name: RedPajamaCommonCrawl


text:
POLITICS Contenuto disponibile in Italiano
Government stability and European response to the pandemic: the Italian anomaly
Gianni Borsa
Italy's potential government crisis – the country is set to receive the largest share of EU recovery money, amounting to €209 billion - is seen as rather inappropriate in EU institutions. Indeed, even in other European capitals...
Una riunione del Consiglio europeo (foto SIR/European Council)
Coordination, responsibility, innovation, stability. These four criteria are deemed most relevant by Brussels with regard to the pandemic response. Among the many problems it caused (contagions, victims, healthcare emergencies, economic recession, unemployment, social crisis…), COVID-19 highlighted the importance for EU Member States to act in unison: and the teachings of Don Lorenzo Milani – "the preferential policy is to overcome problems together" – have seemingly gained ground amongst all 27 capitals and Brussels." Next January 21 the President of the European Council, Charles Michel, will be chairing yet another videoconference with Heads of State and Government on coronavirus coordination.
A further step for the definition of shared solutions:
The EU's Multiannual Financial Framework and Next Generation EU ( along with ECB and EIB interventions, the decision to suspend the Stability and Growth Pact, plus ESM and SURE) are unlikely to remedy all the problems, but they will certainly be a contribution to economic recovery, a boost to businesses and families, with much-needed funds to accelerate the pace towards the Green Deal and digital development. Hence short-term interventions, combined with long-term reforms aimed at enhancing the "quality" of the single market and economic systems, as well as citizens' lives.
But this requires coordination, responsibility, innovation and stability. Thus Italy's potential government crisis – the Country is set to receive the largest share of EU recovery money, amounting to €209 billion – is seen as rather inappropriate in EU institutions. Indeed, even in other European capitals.
At a time when political decision-making is expected to deliver concrete solutions, no European country would dare consider sparking off a government crisis, let alone contemplate national elections.
Not even the UK, where grounds for Boris Johnson's removal from Number 10 in Downing Street surfaced within his very Party, only to eventually recognize that a Country hit by recession, by Brexit, and by COVID-19, needs anything but a government debacle. Indeed, the agreement reached during last December's European Council with Poland and Hungary (objecting to making EU funds conditional on respect for the rule of law and democratic standards, as outlined in the EU Treaties) appeared to be aimed at avoiding a political clash that would have stalled the Multiannual Financial Framework and Next Generation EU.
Moreover, local elections have been rescheduled in some countries, with the aim of preventing citizens from being exposed to a dangerous election campaign – in terms of public health. In this respect there are growing concerns in Germany over next September's parliamentary elections. The powerful statements made by the President of the Republic, Sergio Mattarella ("This is a time for builders" – year-end address) and by Pope Francis ("At this moment the entire ruling class does not have the right to say 'I'. It must say We and seek unity in the face of the crisis. […] This is a time for peace, nor for crisis, we must sow seeds of common good"; TG5 special newscast), resounded also in Brussels.
In an interview with Italian newspaper "Il Giornale" (January 11), even Silvio Berlusconi, a government opposition leader, called for a sense of responsibility, emphasizing the extreme practical difficulties of going to the polls, with an electoral campaign jeopardized by the current pandemic situation.
The European "recovery plan" must be taken seriously
with comprehensive projects submitted to the EU Commission, mobilizing all the potential energies of the country to tackle the emergency situation, while laying the foundations of the post-coronavirus "rebirth." A parliamentary crisis in the dark, involving a risky political and decision-making stalemate, would be very hard to explain to the EU and to other Member States – as well as to Italian citizens. In Italy, as in Europe, "builders" are needed and everyone, whether majority or opposition, citizens or businesses, is asked to do their part having a good head on their shoulders.
11 gennaio 2021 © Riproduzione Riservata
Altri articoli in Europa
Rapporto choc su ragazze madri in Irlanda. Presidente vescovi cattolici: "Anche la Chiesa parte del sistema, chiedo scusa"
Shocking report on unmarried mothers in Ireland. President of Catholic bishops: "the Church was clearly part of that culture. I apologise."
Graglia (Un. Milano): "La pandemia può rafforzare il cammino dell'Europa unita"
Graglia (Uni. Milan): "The pandemic might bolster the progress of united Europe"
Stabilità di governo e risposta europea alla pandemia: l'anomalia italiana
Rotta balcanica. L'inferno nel cuore dell'Europa
Arte sacra. La "strana" Natività Mistica di Botticelli


DESCRIPTION - A detailed 3 light ceiling pendant with down-facing opal glass shades and finished in ..
DESCRIPTION - A detailed 5 light ceiling pendant with down-facing opal glass shades and finished in ..
DESCRIPTION - This 8 light ceiling fitting has glass sphere detailing and a shiny chrome effect fini..
DESCRIPTION - The 6 light ceiling pendant is finished in a bright nickel plate. The arms are complim..
DESCRIPTION - A 3 light flush ceiling fitting which comes finished in polished chrome, with mesh and..
DESCRIPTION - A 5 light flush ceiling fitting which comes finished in polished chrome, with mesh and..
DESCRIPTION - A 3 light semi flush ceiling fitting with frosted glass flower shaped shades and an an..
DESCRIPTION - A 5 light semi flush ceiling fitting with frosted glass flower shaped shades and an an..
A unique classic styled pendant in bright nickel plated finish. Is made of the clear ribbed glass sh..
DESCRIPTION - The 3 light pendant is finished in antique brass effect with frosted glass shades. Thi..
DESCRIPTION - The 3 light pendant is one item within a wider range with an antique silver effect fin..
DESCRIPTION - The 5 light pendant is finished in antique brass effect with frosted glass shades. Thi..
DESCRIPTION - The 5 light pendant is one item within a wider range with an antique silver effect fin..
Description: 5 LIGHT CHROME CEILING WITH GLASS DROPS AND WHITE FABRIC STRING SHADES WITH CHROME TRIM..
Description: 8 LIGHT CHROME CEILING WITH GLASS DROPS AND WHITE STRING FABRIC SHADES WITH CHROME TRIM..
DESCRIPTION - This fitting is a 3 light pendant in a satin nickel finish that comes complete with al..
DESCRIPTION - This fitting is a 5 light pendant in a satin nickel finish that comes complete with al..
DESCRIPTION - A 3 light ceiling pendant with an antique brass and opal glass finish, can also be con..
DESCRIPTION - A 3 light ceiling pendant with a satin chrome and opal glass finish, can also be conve..
DESCRIPTION - A 5 light ceiling pendant with an antique brass and opal glass finish, can also be con..
DESCRIPTION - This 7 light pendant has a polished chrome finish and comes complete with white shades..
DESCRIPTION - A 5 light ceiling pendant with a satin chrome and opal glass finish, can also be conve..
DESCRIPTION - The pendant is a 5 light ceiling fitting which has an adjustable drop and can also be ..
DESCRIPTION - A 3 light semi flush ceiling fitting in a polished chrome finish, complete with clear ..
DESCRIPTION - A 5 light semi flush ceiling fitting in a polished chrome finish, complete with clear ..
DESCRIPTION - A 3 light ceiling fitting with scrolled arms in antique brass effect finish. Suitable ..


text:
Q: Cart Price Rules having issues So I created a rule with these conditions:

Everything is working fine except for the State/Province conditions. It seems the rule is not taking the conditions for the state/province section. My rule is only to be applied for customers in the U.S. but not Hawaii or Alaska. But since it is not working correctly the rule is applying to these countries.
Can anyone help?

A: I have created a rule with same conditions as yours and it is working fine.
Refer below screenshots:

Here check screenshots of my cart as well:
https://i.stack.imgur.com/gyPVp.png
https://i.stack.imgur.com/0oG78.png
https://i.stack.imgur.com/0UUhp.png
https://i.stack.imgur.com/muIvm.png

redpajama_set_name: RedPajamaStackExchange


New research at NUI Maynooth is shedding light on a largely untold aspect of the Famine — the horrors and suffering that befell women during that time.
Many women ended up abandoned, starving and destitute as 50,000 letters and documents discovered at Strokestown Park show.
"In the history of that time, women have largely been excluded and neglected from the Famine narrative. Rarely are we offered any particular insight into how the Famine affected women," Dr Ciarán Reilly at Maynooth, one of the world's foremost experts on the Famine, told the Irish Examiner.
"For many women emigration was not an option during the Famine. So how did those who had not the means to emigrate survive? In many instances women took the law into their own hands and were found to be implicated in a host of criminal activity, including widespread intimidation, threatening neighbours, burning houses and agitating for land," said Dr Reilly, who is working on a book about women and the famine.
"For example, an 1849 petition from the Widow Bourke of Strokestown pleaded for help as she was unable to pay her rent since 'god in his infinite mercies afflicted the people with the loss of their potatoes'.
Dr Reilly's research of the era reveal many stories of abandonment and betrayal.
Many husbands and sons abandoned their wives, mothers and sisters in an attempt to protect themselves.
"In the case of the Strokestown estate, the desertion and abandonment of women and young children during and after the famine by husbands and parents, raises questions about culpability," says Dr Reilly. "Why were so many women abandoned by their husbands? While previously these men had migrated to Britain and other parts of Ireland during the summer months for seasonal work, in these cases it would appear that their absence was permanent.
These women of the famine were honored last week as Strokestown Park House played host to the Investec Schools Sculpture Competition, in which hundreds of school-children from Roscommon, Leitrim, Longford and Mayo created works of art based on the famine. The evocative sculptures were on display at Strokestown Park House's woodland in a competition with a top prize of €4,000.
"There's a real and appropriate sense of peace and tranquility that makes for a perfect setting for the sculptures,"said James Callery, the son of the founder of the Westward Group and the owner of Strokestown Park House.


text:
Grundfos es un fabricante de bombas hidráulicas danés con sede principal en Bjerringbro y que cuenta con más de 19000 empleados en todo el mundo.

La producción anual de más de 16 millones de unidades de bombeo, bombas de circulación, bombas sumergibles y bombas centrífugas. Grundfos también produce motores eléctricos para las bombas, así como motores eléctricos para su comercialización por separado. Grundfos desarrolla y vende electrónica para controles de bombas y otros sistemas.

Referencias

Empresas de Dinamarca
Sistemas de bombeo
Empresas fundadas en 1945

redpajama_set_name: RedPajamaWikipedia


text:
\section{Introduction}
Successes in the design and development of nano-machines motivate the study of communication methodologies between such units. Interconnected nano-networks have potential applications in biomedical, industrial and environmentally engineered systems \cite{AAA, Nakano}.  Herein, we examine strategies for molecular communication, inspired by biological systems.  In particular, we examine a point-to-point communication system via molecular diffusion \cite{B5} (see \cite{New_2} for the motivation of using this type of communication).  A nano-transmitter releases molecules into the medium which are collected at a receiver.  Information can be transmitted by manipulating the number, type, and timing of the molecules.  Motivated by classical radio communication strategies, several molecular modulations have been recently introduced, including Concentration Shift Keying (CSK) (\emph{number} of molecules), Molecular Shift Keying (MoSK) (molecule \emph{types}), Molecular Concentration Shift Keying (MCSK) (a combination of the previous two) \cite{AA2, AA1}, the timing modulation (e.g. see \cite{Eckford22}) and  ratio-based modulations using properties of isomers \cite{Isomer}.  They are appealing because they use simple transmitter and receivers.

Due to properties of diffusion, inter-symbol interference can occur (molecules from previous transmissions hitting the receiver after a long delay). By alternating molecule types, MCSK has zero interference from the previous symbol at the expense of two molecule types, but still suffers from interference from the other past symbols. This interference becomes significant at high data rates, corresponding to small symbol transmission periods.
 Performance degradation due to interference is studied in  \cite{B1,B2,B3}.
 The optimal receiver for a linear time-invariant propagation model is determined in \cite{AA3}.
 Unfortunately, these receivers demand high computational and memory complexities, making them  impractical for resource limited nano-machines.
Maximum likelihood sequence detection is considerd in \cite{NewlyAdded} as well as sub-optimal and practical detectors.

In this paper we consider the communication model introduced in \cite{AA1} and depicted in Fig. \ref{fig:transmitterschematic}, where the transmitter has a storage of molecules. The storage has an outlet whose size controls how many molecules can exit the storage and diffuse in the environment. The outlet of the storage can be controlled; it opens for a short period and the size of the opening in time slot $i$, $X_i$ is specified by the encoder for signaling. The released molecules diffuse through the environment (a diffusion channel) and a subset of the released molecules hits the receiver. The receptors at the receiver make chemical bonds with the received guest molecules and initiate a pre-defined process. The general block diagram of the receiver is depicted in Fig. \ref{fig:transmitterschematic}.  The front-end of the receiver is a counter, which tracks the number of received molecules.
 The decoder is allowed to read the counter and reset it. The decoder makes its decision about the transmitted symbols based on the read counts.

{Transceiver complexity is a significant issue for communication between nano-machines \cite{Re1}}.  As such, we restrict our attention to transceiver systems that have simple implementations, exploit limited memory, and as a result a limited decoding delay.  In particular, we assume that uncoded message symbols are transmitted, one-by-one.  The receivers have either zero or one symbol delay, with a
  $B$ of bits of memory, which can store any  $B$ bit function of the previously decoded symbols.

To justify our assumptions on the transmitter and receiver, we note that
\begin{enumerate}
\item Our assumptions form a restriction on the complexity of the transmitter and receivers thus rendering our proposals practical for implementation in real nano-machines.  In fact, the modulation schemes proposed to date (CSK, MoCSK, PPM, {etc.}) are of interest due to their associated simple and memorlyess decoders \cite{AA2,AA1}.

\item Limited decoder memory is equivalent to limited storage, which in turn, implies limited decoding delay to limit the loss of data due to storage overflow.

\item While our assumptions are simplifying with regards to complexity, they do not limit our ability to focus on the unique nature of the diffusion channel.  In particular, we have a discrete channel with memory:  residual molecules from prior transmissions can be coincident at the receiver with the current molecular transmissions.  Since Brownian motion is used to model the diffusion channel, and the information is encoded in the \emph{average} diffusion rate, the overall channel is non-linear.  In fact, non-linear channels with memory are notorious for their lack of tractability.

\item  We underscore that our assumption of $B$ bits of memory at the decoder is not as restrictive as one might think. We do not specify the form of the bits; that is, the decoder can store {\bf any} $B$ bits of prior information.  The only restriction is that the memory has to be updated sequentially and causally as the receiver obtains a new output symbol. One of our objectives is to determine what should be stored and understand performance gains as a function of increasing memory.

\end{enumerate}
{
To the best of our knowledge, this work is the first one to study the fundamental limits of communication with memory-limited devices (previously limitations on power, delay, etc have been addressed in the literature of information theory or communication theory).}
In this work, we make four key contributions for the  {two main building blocks of the  receiver depicted in Fig. \ref{fig:transmitterschematic}}.  \emph{For the decoder block:} (1) We propose the memory-limited decision aided (MLDA) decoder which exploits $B$ bits of memory; (2) we show the near-optimality of the MLDA decoder by comparing its performance with the performance of a Genie-aided optimal decoder (without any restriction on the computational complexity
or functional form of the stored $B$ bits).
  In providing these results, we
also study how information (or the lack thereof) about the interference affects
decoder performance; (3) {we prove analytical results, some of which provide surprising insights into this problem: for instance, we show that a natural threshold decoder is not optimal for a Poisson channel with memory. On the other hand, we show in Theorem 2 that ML decoder is a threshold decoder for SNRs above a threshold (which we find an analytical lower bound on). }
 \emph{For the counter block:} (4)  {we propose the use of multiple samples during each symbol period (multi-read system)} and show that this oversampling significantly decreases the probability of error. In contrast, most previous works had assumed that the counter is read only once every transmission period. We first show that the associated MLDA test statistic is a weighted sum of the samples read within a symbol interval.    We also analytically evaluate the performance of the multi-read receiver using a saddle point approximation as the test statistic distribution does not admit a closed form.  The accuracy of the approximation is verified via simulation.

\begin{figure}
\begin{center}
\includegraphics[width=167mm]{scheme_3.pdf
\end{center}
\vspace{-1cm}
\caption{Block diagram of a transmitter with gate controlled molecule storage, and a general slotted receiver}
\label{fig:transmitterschematic}
\vspace{-0.5cm}
\end{figure}

The rest of paper is organized as follows: In Section \ref{sec:com-med}, a diffusion-based molecular channel is defined. Section \ref{definition:mlzd} defines the class of transmitter and receivers that we are interested to study. In Section \ref{sec:simpleReciever}, a particular simple and practical decoder is introduced and its probability of error is analysed. In Section \ref{sec:MRMLD}, the main results of this paper on memory-limited decoders are provided, with the proofs given in Appendices A and B. Section \ref{sec:CB} makes a case for having multiple reads in the counter block of a receiver.  Section \ref{sec:MCSK} briefly reviews and comments on the MCSK modulation scheme. Application of our main results to MCSK is given in the same section. Finally Section \ref{sec:conclusion} concludes the paper.

\section{System Model}\label{sec:com-med}
\subsection{Transmitter and channel models}
{
We consider an arbitrary diffusion-based molecular communication medium, uniform or non-uniform, with drift or without drift, and with physical barriers or in an open space. The main assumption that we make about environment is that it is stationary, meaning that the diffusion coefficients in each location do not change over time.}
 Due to extensive molecule propagation times between transmitter and receiver, the effective channel has {\em memory} resulting in interference, which will be more fully discussed in the sequel.

We assume that the transmitter has a storage of molecules. The storage  has
an outlet whose size controls how many molecules can exit the storage to
be diffused in the environment. Since the number of molecules is large and
the probability of each exiting the storage is small, the number of molecules
that exit from the storage in a given time slot follows a Poisson distribution.
This is the Poisson model proposed in \cite{AA1} (see \cite{New_2} for a Poisson model of
the environmental noise) and we adopt it in this
work. We use $\mbox{Poisson}(X)$ to denote the number of molecules
exiting the storage (and diffused in the environment). The
parameter $X$ is called the diffusion rate and is determined
by the size of the opening of the outlet. Parameter $X$ itself is
a random variable that is selected by the transmitter based on
the message it wishes to transmit. Thus, we have a doubly stochastic Poisson process;
the rate of the Poisson is the information signal, which in itself is random due to our models on the information sequence.

We assume that the transmission occurs in  time slots of equal duration; this is called the {\em symbol
duration} and is denoted by $t_s$. We assume that the transmitter may only set
the size of the storage's outlet at the beginning of time slots of length $t_s$.
We assume that the transmitter chooses a diffusion rate  of $X_i$ at time slot
$i$.
Assume that a molecule is released from storage at the beginning of a time slot, and is absorbed the first time it hits the receiver.
The probability that the molecule hits the receiver during the initial time slot of duration $t_s$  is denoted by $p_1$; more generally, the probability of hitting during the next $k$-th time slot
is denoted by $p_k$, $k\geq 1$. {The values of $p_k$'s depend on the communication medium, which can be in either 1-d or 3-d.} Note that we assume that the receiver and the transmitter are synchronous.

Generally, the signal is decoded at the receiver based on the
total number of molecules received during the individual time slots.
We assume that in a time slot, three sources contribute to the
received molecules: (i) molecules due to
the transmission in the current time slot, (ii) the residue molecules
due to the transmission in the earlier time slots known as the interference
signal, and (iii)  noise molecules, described below.
We assume that inter-molecule collisions
have little effect on the molecule's movement.

Within our reception time slot of duration $t_s$,
there is noise due to molecules in the environment that are
not part of our transmission but of the same type as  the transmitted molecules.  We
model the number of noise molecules within a slot of duration $t_s$ as  a Poisson
random variable with parameter $\lambda_0 t_s$.

Assume that the transmitter selects a diffusion rate  of $X_i$ at time slot
$i$.
Based on the thinning property of Poisson distribution, when we use one molecule
type in all time slots, the number of received molecules in the time slot
$i$, denoted by $Y_i$, can be written as follows:
\begin{align}
Y_i&\sim \mbox{Poisson}( \lambda_0 t_s + \sum_{k=0}^\infty p_{k+1} X_{i-k}  )= \mbox{Poisson}(p_1X_i+I_i), i\geq 1 \label{eq:Y_1}
\end{align}\normalsize
where $I_i= \lambda_0 t_s + \sum_{k=1}^\infty p_{k+1} X_{i-k}$ is the sum of interference and noise
at time $i$.  {Further, we assume $X_i=0$ for $i\leq 0$ (i.e. transmission starts at time $i=1$), hence summation is from $k=0$ to $\infty$.}

One of our innovations over our prior work in \cite{AA1} is that we explicitly consider more interference terms, {\em i.e.} in \cite{AA1}, we argued that a large $t_s$ results in negligible $p_k$ for $k>2$ and thus could ignore interference beyond the previous time slot.  A further innovation herein is the consideration of multiple reads (sampling within a single time slot) which also results in improved performance.

\vspace{-0.5cm}
\subsection{Decoder Framework}
We consider a simple, practical decoder structure for molecular communication. To this end, we make two key assumptions about memory and delay.  The first is that the transmitter transmits molecules at rates $X_i$ independently and thus there is no error correction coding at the transmitter.  Most generally, we can assume that $X_i \in \left \{ s_0, s_1, \cdots, s_{L-1} \right\}$.  Such $L$-ary signaling implies a bit rate of $\frac{\log{(L)}}{t_s}$.  For clarity of exposition we assume $L=2$ and that $X_i = 0$ or $X_i = s$ with probability $1/2$.

To frame our decoder, we observe that in the case of no interference, the maximum a posteriori (equivalently maximum likelihood due to the equal priors) receiver is given as follows. Our observation $Y$
 is distributed as $\mbox{Poisson}(\lambda_0 t_s +p_1X)$, where $X \in \{0,s\}$ and  {the associated probability mass functions (pmfs)} are
\begin{align}
\mathbb{P}(Y=y|X=x)&=\frac{e^{-(p_1x + \lambda_0 t_s) }(p_1x+ \lambda_0
t_s)^y}{y!}, \qquad x\in \{0,s\}.
\end{align}
The optimal detector is of a threshold form where if $y \leq \tau$ we select
$\hat{X} = 0$ (and $\hat{X}=1$ if the observation exceeds the threshold),  where
$
\tau= \frac {p_1 s}{\ln(1+\frac{p_1s}{\lambda_0 t_s})}.
$

In the presence of interference, the optimal decoder cannot be reduced to a simple threshold structure. However, threshold detectors are simple to implement.

\emph{Memory-Limited, Zero-Delay Decoders:}\label{definition:mlzd}
In the sequel, we introduce a simple decoder design based on the storage of previous decisions.  In order to assess the performance of this decoder, we need to ask what can be accomplished with $B$ bits of side information.  To formalize this notion, we have the following:

A \emph{memory-limited} decoder, with $B$ bits of memory, can store a number
in the set $\{1,2,\cdots, 2^B\}$ (or $[1:2^B]$ as a shorthand)  for future use. We use random variable $K_i$ to denote
the value stored in the memory at time slot $i$ for $i\geq 1$. We assume
that initially at time slot $0$, $K_0=0$. At time instance $i$, the decoder
uses the received signal $Y_i$ and the memory register $K_i$ to update the
memory register $K_{i+1}$, i.e. $K_{i+1}$ is constructed as a function (or
stochastic function) of $K_i$ and $Y_i$. In other words, we use an ``update"
function $f_i:[1:2^B]\times\mathbb{Z}_{+}\mapsto [1:2^B]$ and construct
$K_{i+1}=f_i(K_i, Y_i)$. Here $\mathbb{Z}_{+}$ is the set of non-negative
integers. Observe that the updating function $f_i$ may be time-varying: for
example, for even values of $i$ $f_i$ may be one function and for odd values
it may be another function.

A decoder is called \emph{zero-delay}, if it computes the reconstruction
$\hat{X}_i$ at the end of time slot $i$.
A memory-limited zero-delay decoder computes the reconstruction $\hat{X}_i$
as a function of $K_i$ and $Y_i$ only, i.e. $\hat{X}_i=g_i(K_i, Y_i)$ for
some function $g_i:[1:2^B]\times\mathbb{Z}_{+}\mapsto \{0, 1\}$. A decoder
is called a \emph{zero-delay threshold} decoder, if the functions $\{g_i\}_{i=1:\infty}$
have a threshold rule: for each value of $i$ and $K_i=k$, we compare $Y_i$
with some threshold $\tau_{ki}$ and set $\hat{X}_i=0$ if
$Y_i\leq \tau_{ki}$ and set $\hat{X}_i=s$  if $Y_i>\tau_{ki}$.

A decision rule for a  \emph{memory-limited} and \emph{zero-delay} decoder
is specified by a sequence of update functions $f_i:[1:2^B]\times\mathbb{Z}_{+}\mapsto
[1:2^B]$, and a sequence of decoding functions $g_i:[1:2^B]\times\mathbb{Z}_{+}\mapsto
\{0,1\}$.

Given  a memory of size $B$, we are interested in finding the optimal memory-limited
decoder, and see how its performance behaves with $B$. We intuitively expect
the memory to contain information about the interference, useful for decoding
the current symbol. More precisely, if we denote the { interference plus noise} at time
slot $i$ by
$
I_{i}= \lambda_0t_s+\sum_{j=1}^{\infty} p_{j+1} X_{i-j}
$
then given $K_i=k$, one can compute the posterior probability distribution
of $p(I_i|K_i=k)$. The induced $p(I_i|K_i=k)$ and $Y_i$ turn out to be
sufficient statistics for reconstructing $\hat{X}_i$.\footnote{This is because
the MAP decision rule compares $p(Y_i=y|X_i=x, K_i=k)$ for different values
of $x$. But this probability is equal to
$
\mathbb{E}_{I|K_i=k}\frac{e^{-(p_1x+I)}(p_1x+I)^y}{y!}
$
which can be calculated using the conditional pmf of $p(I_i|K_i=k)$.
}

\begin{definition}
The minimal probability of error of a \emph{memory-limited} and \emph{zero-delay}
receiver with rate $R$, transmission amplitude $s$ and memory size $B$, $ \mathsf{P}
(R, s, B)$, is defined as the minimum of the probability of error
of all decoders with memory $B$ (specified by  update functions $f_i$ and
a decoding functions $g_i$). The minimal probability of error of a \emph{memory-limited}
and \emph{zero-delay threshold} receiver with rate $R$ and memory size $B$,
$ \mathsf{P}_ \mathsf{T}(R, s, B)$, is defined similarly where we restrict
to \emph{zero-delay threshold} decoders.
\end{definition}
\begin{remark} By definition $ \mathsf{P}_{ \mathsf{T}}(R,s, B)\geq  \mathsf{P} (R, s,
B)$. Clearly both $ \mathsf{P} (R, s, B)$ and $ \mathsf{P}_{ \mathsf{T}}(R, s,
B)$ are decreasing functions of $B$, i.e. the more memory, the less probability
of error
\end{remark}

\vspace{-0.7cm}
\section{Proposed receiver: Decoder}\label{sec:simpleReciever}
In this section, we first provide a simple and practical decoder and then show how performance for the proposed decoder can be easily computed. In order to compare this performance with $ \mathsf{P}
(R, s, B)$ and $ \mathsf{P}_T
(R, s, B)$, we will later examine a genie-aided decoder.
\subsection{Memory Limited Decision Aided Decoder (MLDA)}
 Consider the simple strategy of
storing the decoded rates $(\hat{X}_{i-1}, \hat{X}_{i-2},
\cdots, \hat{X}_{i-B})$
in  memory. These $B$ bits are used to estimate the interference rate
 which is equal to $ p_2X_{i-1}+p_3X_{i-2}+\cdots+p_{B+1}X_{i-B}+\sum_{j=B+1}^{\infty}
p_{j+1} X_{i-j}.$
The updating function $f_i$ for this decoder is time-invariant, i.e. $f_i=f$,
and can be easily implemented using a shift register.

It remains to specify the decoding function $g_i$ which shall also be time-invariant
 i.e. $g_i=g$. To derive the decoder, let us assume
for a moment that the decoder knows the exact value of interference, i.e.
it knows that $I_i=\alpha$. To recover $X_i\in\{s_0=0, s_1=s\}$ we
use a MAP decoder and compute
\begin{align}
\max_{j} {\mathbb{P}(Y_i=y|X_i=s_j, I_i=\alpha)}
= \max_{j} \left(\frac{e^{-(p_1s_j + \alpha) }(p_1s_j+  \alpha)^y}{y!}\right).
\end{align}
Observe that the above equation is an ML decoder rule, which is equivalent to MAP because $X_i$ is $\mathsf{B}(\frac 12)$ and independent of $I_i$ (a function of $X_{i-1}, X_{i-2}, \cdots$).

The resulting rule is a threshold rule: we set $\hat{X}_i=0$ if $y\leq \tau$, and set $\hat{X}_i=s$ if $y>
\tau$ where
\begin{align}\label{eqn:eqnTh}
\tau=\frac{p_1 (s_1-s_0)}{\ln(\frac{p_1s_1+ \alpha +\lambda_0 t_s}{p_1s_0+
\alpha+ \lambda_0 t_s})}
\end{align}

As we do not know $I_i = \alpha$ exactly, we approximate $I_i$ given our previously decoded rates, that is,
\begin{align*}
\hat{I}_i&=\lambda_0t_s+p_2\hat{X}_{i-1}+\cdots+p_{B+1}\hat{X}_{i-B}+\sum_{j=B+1}^{\infty}
p_{j+1} \mathbb{E}[X_{i-j}]
\\&=\lambda_0t_s+p_2\hat{X}_{i-1}+\cdots+p_{B+1}\hat{X}_{i-B}+\frac {s_0+s_1}{2}\sum_{j=B+1}^{\infty}
p_{j+1}.
\end{align*}

In other words, we use the threshold given in equation \eqref{eqn:eqnTh},
when $\alpha$ is replaced by the expression given above. Clearly the value
of the threshold would depend on $(\hat{X}_{i-1}, \hat{X}_{i-2}, \cdots,
\hat{X}_{i-B})$ that are stored in the memory.

This simple decoder is of low complexity for implementation on a nano-machine.
Note that the decoding rule described above is not necessarily the optimal
MAP decoding rule,  {but numerical results show this simple decision rule performs quite close to the optimal one.}

\subsection{Computation of the MLDA Probability of Error}
\label{subsubsection:DPE}

We find an analytical expression for the probability of error of the simple
decoder. We have
\begin{align}
P_e=\frac 12\big(\mathbb{P}(E|X_i=s_0)+\mathbb{P}(E|X_i=s_1)\big)=\frac 12\big(\mathbb{P}(Y_i>\tau
|X_i=s_0)+\mathbb{P}(Y_i\leq \tau |X_i=s_1)\big),
\end{align}
where $E$ is the error event. As the previously decoded symbols are utilized
in the current time slot, false decoding in the previous time slots may propagate
to decoding in the current time slot. Therefore, it is necessary to consider
error propagation in computing the probability of error.

We compute the probability of error for the special case of $B=1$, i.e. storing
only the last decoded symbol. Analytical expressions for the probability
of error for larger values of $B$ can be derived similarly. For $B=1$, the
estimated value of interference plus noise is equal to $$\hat{I}_i( \hat{X}_{i-1})=\lambda_0t_s+p_2\hat{X}_{i-1}+\frac{s_0+s_1}{2}\sum_{j=2}^{\infty}
p_{j+1}=\lambda_0t_s+p_2\hat{X}_{i-1}+\frac{s_0+s_1}{2} (1-p_{1}).$$ We have
the following equation for $k=0,1$:
\begin{align}
\mathbb{P}(E|X_i=s_k)
&=\sum_{x_{i-1},\hat{x}_{i-1}}{p_{X_{i-1},\hat{X}_{i-1}|X_i}(x_{i-1},\hat{x}_{i-1}|X_i=s_k)\mathbb{P}(E|X_i=s_k,x_{i-1},\hat{x}_{i-1})}\nonumber\\
&=\sum_{x_{i-1},\hat{x}_{i-1}}{p_{X_{i-1}}(x_{i-1})p_{\hat{X}_{i-1}|X_{i-1}}(\hat{x}_{i-1}|x_{i-1})\mathbb{P}(E|X_i=s_k,x_{i-1},\hat{x}_{i-1})}.\label{eq:aa1}
\end{align}
Note that
\begin{align}
\mathbb{P}(E|X_i=s_1,x_{i-1},\hat{x}_{i-1})&=\sum_{\alpha,~ y\leq \tau} \mathbb{P}[I_i=\alpha|x_{i-1}]\frac{e^{-(p_1s_1
+ \alpha) }(p_1s_1+ \alpha)^y}{y!}
\\
\mathbb{P}(E|X_i=s_0,x_{i-1},\hat{x}_{i-1})&=\sum_{\alpha,~ y>\tau} \mathbb{P}[I_i=\alpha|x_{i-1}]
\frac{e^{-(p_1s_0 +  \alpha) }(p_1s_0+ \alpha)^y}{y!}
\end{align}
in which $\tau=\frac{p_1 (s_1-s_0)}{\ln(\frac{p_1s_1+ \hat{I}_i( \hat{x}_{i-1})}{p_1s_0+
\hat{I}_i( \hat{x}_{i-1})})}$. The conditional pmf $\mathbb{P}[I_i=\alpha|x_{i-1}]$
can be computed as follows:
$$\mathbb{P}[I_i=\alpha|x_{i-1}]=\mathbb{P}\left[\sum_{j=2}^{\infty} p_{j+1}
X_{i-j}=\alpha-\lambda_0 t_s -p_2x_{i-1}\right].$$
Therefore, $\mathbb{P}(E|X_i=s_0)$ and $\mathbb{P}(E|X_i=s_1)$ can be computed
recursively from (\ref{eq:aa1}) which is a system of linear equations.

\section{Performance Bounds}\label{sec:MRMLD}
As in previous sections, we focus on the binary case $X_i \in \{s_0=0,s_1=s\}$.  Ideally we wish to make concrete statements on optimized general and threshold decoders, that is by optimizing over all $g_i$ and $f_i$.  It is clear that the probability of error of such optimized decoders is upper bounded by that of the MLDA introduced in Section \ref{sec:simpleReciever},  i.e. if we denote
the MLDA performance by $\mathsf{MLDA}(R, s, B)$, we have that $\mathsf{MLDA}(R, s, B)\geq  \mathsf{P}_ \mathsf{T}(R,s, B)\geq   \mathsf{P}(R,s, B)$.
\color{black}
 As a lower bound to $ \mathsf{P}
(R,s, B)$ we introduce a genie-aided decoder which knows the interference exactly, this results in the threshold rule provided in eqn. \eqref{eqn:eqnTh} where $\alpha$ is the value of interference. We denote this genie-aided decoder by ``ML decoder with known interference" and show its performance by $\mathsf{GA}(R,s)$.\color{black} As a more meaningful genie-aided decoder for determining a lower bound, we imagine (a threshold, or general)  decoder that has access to a genie who can pass any $B$ bits of information about the interference to the receiver. Since the $B$ bits are arbitrary, this new genie-aided decoder (that optimizes over the $B$ bits of side information) provides a tigher lower bound. \color{black}We need to examine how we can exploit $B$ bits of side information. Determining this genie-aided decoder is non-trivial. To appreciate the challenge of our evaluation, observe that to determine the side information by using brute force, one needs to consider the set of values that  the interference, i.e.,
$\sum_{j=1}^{\infty} p_{j+1} X_{i-j}$, can take. The genie
should specify a mapping from the set of values to the set $\{1,2,\cdots,
2^B\}$, {\em i.e.} for each value of interference it should specify the $B$ bits
that it is revealing to the decoder. To find the optimal performance that
a genie can achieve, one needs to optimize over all such mappings. This is
computationally cumbersome, if possible, even for small values of $B$.  Theorem
\ref{thm:thm3} below simplifies calculation of the genie-aided memory limited lower bound for the optimum threshold decoder, i.e., $ \mathsf{P}_ \mathsf{T}(R, s, B)$, and reveals an intuitive
structure:  the optimized threshold decoder with $B$ bits of side information optimally
quantizes the interference.

The general case is more complex.  Consider an example where we can enumerate over all possibilities of the interference.  Let
 $s=400$ and the interference takes values uniformly from
the set $\mathcal{I}=\{\alpha_1, \alpha_2, \alpha_3, \alpha_4\}$ where $\alpha_1=1<\alpha_2=39.6899<\alpha_3=65.2742<\alpha_4=103.9640$, and the genie can provide one bit to the receiver. Then telling the receiver
whether interference is in the set $\{\alpha_1, \alpha_4\}$ or $\{\alpha_2,
\alpha_3\}$ is strictly better than telling the receiver if interference
is less than a number or not ( {\em i.e.} interference is high or low)!
The next theorem shows that for threshold decoders, however, the phenomenon
discussed in the above observation does not happen.

\begin{theorem}\label{thm:thm3}
In a threshold decoder (comparing received signal $y$ with a threshold), the optimized genie-aided decoder with $B$ bits of side information  quantizes the interference values into $2^B$ bins and uses the interference interval's bin index as side information.
\end{theorem}
\begin{remark}
The above theorem significantly reduces the computational complexity of finding the optimal Genie for computing the  lower bound on $ \mathsf{P}_ \mathsf{T}(R,S,B)$, denoted by
$\mathsf{GA}_{ \mathsf{T}}(R, s, B)$. \color{black} It implies that one needs to only specify a set of $2^B-1$ points in $\mathbb{R}$
(hence dividing $\mathbb{R}$ into $2^B$ intervals), and read off the mapping
according to the index of the interval where interference falls into.
\end{remark}

We discussed lower and upper bounds on $ \mathsf{P} (R, s, B)$ and $ \mathsf{P}_ \mathsf{T}(R,
s, B)$. In the following theorem we discuss a relation between these two.
\begin{theorem}\label{thm:thm2}
Given {any communication medium}, choose a sufficiently small rate $R$ such that hitting probabilities satisfy $p_1>(e-1)\sum_{j=2}^{\infty}p_j$. Then given any noise level $\lambda_0$, there exists some $s^*$ such that $ \mathsf{P} (R,s, B)= \mathsf{P}_ \mathsf{T}(R, s, B)$
for all $s>s^*$ regardless of the value of $B$. More specifically, $ \mathsf{P}
(R,s, B)= \mathsf{P}_ \mathsf{T}(R, s, B)$ holds if $s$ satisfies the following two inequalities
\begin{align*}
\frac{\lambda_0 + Rp_1s}{Rs} \ln\left(\frac{\lambda_0+ Rs\sum_{j=1}^{\infty}p_j}{\lambda_0+ Rs\sum_{j=2}^{\infty}p_j}\right)\geq
p_1 \geq \max\left[\frac{\sum_{j=1}^{\infty}p_j}{2}, \frac{\lambda_0 + Rs\sum_{j=2}^{\infty}p_j}{Rs} \ln\left(\frac{\lambda_0
+ Rp_1s}{\lambda_0}\right)\right].
\end{align*}
\end{theorem}
 The proofs for the above theorems are given in the Appendix.

\textbf{Numerical Results:} The above discussion indicates that $\mathsf{MLDA}(R,s,B)\geq  \mathsf{P}_ \mathsf{T}(R, s, B)\geq \mathsf{GA}_ \mathsf{T}(R,s,B)\geq \mathsf{GA}(R,s)$, and $\mathsf{MLDA}(R,s,B)\geq  \mathsf{P}(R, s, B)\geq \mathsf{GA}(R,s)$. Since computing $ \mathsf{P}_ \mathsf{T}(R, s, B)$ and $ \mathsf{P}(R, s, B)$ are computationally intractable, herein  we compare
 the performance of the $\mathsf{MLDA}(R,s,B)$  with the two  genie-aided decoders, i.e. with $\mathsf{GA}_{ \mathsf{T}}(R,s,B)$ and $\mathsf{GA}(R,s)$, showing that they come close to each other and effectively sandwitching the desired $ \mathsf{P}_ \mathsf{T}(R, s, B)$ and $ \mathsf{P}(R, s, B)$.\color{black} {Here and in the following numerical results, except for Fig. \ref{Fig3d}, we use a one-dimensional  Brownian motion without drift, as in \cite{New_2,Eckford22}, since for this motion, closed form expressions for hitting probabilities $p_k$'s can be found.}
 For a one-dimensional  motion without drift, the hitting probabilities can be found as follows\cite[5.3]{Book}:
$p_1=2Q\left(\frac{\rho}{\sqrt{t_s}}\right)$, and
\begin{align}p_k=2Q\left(\frac{\rho}{\sqrt{kt_s}}\right)-2Q\left(\frac{\rho}{\sqrt{(k-1)t_s}}\right),
\quad k=2,3,\cdots.\label{eqn:AA1}\end{align}
where  $\rho \triangleq d/\sqrt{2D}$  is a single parameter that summarizes
how the diffusion constant ($D$) and the distance between the transmitter and
the receiver ($d$) affect the communication channel between the transmitter and
the receiver.  The hitting probabilities
depend on $R$ and $\rho$ ( {representing transmission rate and channel parameter, respectively}) only through $\rho^2R=\rho^2/t_s$. So, we can set a particular value for $\rho$
and discuss the gap between the lower and upper bounds in terms of the rate
$R$. A practical
value for $\rho^2$ is $0.3$ \cite{Web}.

Figure \ref{fig:CSK2} (a) depicts $\mathsf{MLDA}(R,s,B)$ and  $\mathsf{GA}_{ \mathsf{T}}(R,s,B)$ for $B=1,2$ and $\mathsf{GA}(R,s)$
 in terms
of $R$ for  $s=60$ and noise power $\lambda_0=0.4$. The subfigure (a) is for CSK modulation, which is the setup we have used so far. The top two curves are for $B=1$, the
two bottom curves are for $B=2$, and the lowest curve is for $\mathsf{GA}(R,s)$ (known interference).  The range of $R$ is chosen such
that the error probabilities are in a reasonable range. This shows that the
lower and upper bounds are close to each other. It can be seen that  $\mathsf{MLDA}(R,s,B=2)$
is lower than $\mathsf{GA}_{ \mathsf{T}}(R,s,B=1)$. The curves become much closer to each other
(depicted in the Fig. \ref{fig:CSK2} (b)) when we apply the lower and upper bounds to
the MCSK modulation scheme  as will be further discussed in Section \ref{sec:MCSK}.   {To generate the results of this figure, the threshold values for computing  $\mathsf{GA}_{ \mathsf{T}}(R,s,B)$ have been computed using a brute-force search.}

\begin{remark}
In Fig. \ref{fig:CSK2}, the condition of Theorem \ref{thm:thm2}
is satisfied. Therefore the lower bound curves for the threshold decoder ($\mathsf{GA}_ \mathsf{T}(R,s,B)$) are
also lower bounds for $ \mathsf{P} (R, s, B)$.
\end{remark}
\iffalse
\begin{figure}
\begin{center}
\includegraphics[width=180mm]{All_csk_2}
\includegraphics[width=180mm]{All_2}
\end{center}
\vspace{-1.0cm}
\caption{\footnotesize{(a): Main Model (CSK), (b): MCSK. Lower and upper bounds for limited memory receivers.
\iffalse The curves labeled as ``Threshold Dec." are lower bounds on $E_T(R, s, B)$, and ones labeled as ``Known Int." are the lower bounds on $E(R, s, B)$.  Parameters for this figure: $s=60$ and $\lambda_0 =0.4$
Not revised\color{black}\fi
}
}
\label{fig:CSK2}
\vspace{-0.5cm}
\end{figure}

\fi
\begin{figure}
\centering
\subfigure[]{
 \centering
\includegraphics[width=0.9\linewidth]{All_csk_2}
\label{fig:all_csk_2}
}
\vspace{-0.4cm}

\subfigure[]{
\centering
\includegraphics[width=0.9\linewidth]{All_2}
\label{fig:all_2}
}
\caption{\footnotesize{(a): Main Model (CSK), (b): MCSK. Lower and upper bounds
for limited memory receivers.}
\iffalse The curves labeled as ``Threshold Dec." are lower bounds on $E_T(R, s, B)$, and ones labeled as ``Known Int." are the lower bounds on $E(R, s, B)$.  Parameters for this figure: $s=60$ and $\lambda_0 =0.4$
Not revised\color{black}\fi
}
\label{fig:CSK2}
\vspace{-0.5cm}
\end{figure}

More generally we can compare the lower and upper bounds for the practical
range of $s\in [20:100]$ and $R\in [1:15]bps$ and the background noise $\lambda_0=0$.
Here are the results for $ \mathsf{P}_ \mathsf{T}(R, s, B)$:
\begin{itemize}
\item For $B=1$, the upper bound (\color{black}$\mathsf{MLDA}(R,s,B)$\color{black}) is less than 1.6 times the lower bound (\color{black}$\mathsf{GA}_ \mathsf{T}(R,s,B)$\color{black}) throughout
the range of parameters. Therefore we can find $ \mathsf{P}_ \mathsf{T}(R,s, 1)$ that lies
between the two within a factor of $1.6$. So for instance if the error probability
of MLDA is $1.6\times 10^{-3}$, the lower bound (\color{black}$\mathsf{GA}_ \mathsf{T}(R,s,B)$\color{black}) is greater than
$10^{-3}$ and hence $ \mathsf{P}_ \mathsf{T}(R,s, 1)=a\times 10^{-3}$ for some $a\in [1:1.6]$.
\item For $B=2$, the upper bound (\color{black}$\mathsf{MLDA}(R,s,B)$\color{black}) is less than 4.3 times the lower bound (\color{black}$\mathsf{GA}_ \mathsf{T}(R,s,B)$\color{black}) throughout
the range of parameters
\end{itemize}
And the results for $ \mathsf{P} (R, s, B)$ is as follows: for $B=1$, the upper bound (\color{black}$\mathsf{MLDA}(R,s,B)$\color{black}) is less than 12.5 times the lower bound(\color{black}$\mathsf{GA}(R,s)$\color{black}). For $B=2$, the upper bound (\color{black}$\mathsf{MLDA}(R,s,B)$\color{black}) is less than 10.5 times the lower bound (\color{black}$\mathsf{GA}(R,s)$\color{black}. Observe that a ratio less than or equal to 10 implies that the lower and upper bound are of the same order.

As another example, if we vary the noise $\lambda_0$ in the interval $[0,50]$, $s\in[20,80]$ and $R\in [2,15]bps$, we get the following ratios for $ \mathsf{P}_T(R, s, B)$: For $B=1$, the upper bound (\color{black}$\mathsf{MLDA}(R,s,B)$\color{black}) is less than 1.75 times the lower bound(\color{black}$\mathsf{GA}_ \mathsf{T}(R,s,B)$\color{black}). For $B=2$, the upper bound (\color{black}$\mathsf{MLDA}(R,s,B)$\color{black}) is less than 2.5  times the lower bound(\color{black}$\mathsf{GA}_ \mathsf{T}(R,s,B)$\color{black}). The results for $ \mathsf{P} (R, s, B)$ is as follows: For $B=1$, the upper bound  (\color{black}$\mathsf{MLDA}(R,s,B)$\color{black}) is less than 21 times the lower bound(\color{black}$\mathsf{GA}(R,s)$\color{black}.
For $B=2$, the upper bound (\color{black}$\mathsf{MLDA}(R,s,B)$\color{black}) is less than 5.5 times the lower bound(\color{black}$\mathsf{GA}(R,s)$\color{black}. These ratios become much better if we apply the lower and upper bounds to
the MCSK modulation scheme (see Section \ref{sec:MCSK}).

\vspace{-0.4cm}
\section{Proposed Receiver: multiple reads}\label{sec:CB}

We now turn to the second main building block of a general decoder as depicted
in Fig. \ref{fig:transmitterschematic}, namely the counter block. Unlike previous
works, we assume that the value of the counter is read every $t_s/N$
seconds rather than every $t_s$ seconds where $t_s$ is the duration of each
transmission time slot; we call  this a multi-read system.\footnote{
Uniform sampling is not necessarily the best strategy, but it is a simple and conventional
one.
} Here $N$ is a natural number, indicating the number of sub-time-slots.
The number of received molecules in sub-time-slot $q$ of time slot $i$ is
denoted by $Y_{i,q}, q\in [1:N]$.

Similar to \eqref{eqn:AA1}, we can derive probability
of hitting of a molecule in the sub-time-slots.
Consider a particular molecule released at the beginning of a time slot.
The probability that it hits the receiver during the $q$-th sub-time-slot
of the next $k$-th time slot is equal to
\begin{align}
p_{k,q}=2Q\bigg(\frac{\rho}{\sqrt{(k-1+\frac qN)t_s}}\bigg)-2Q\bigg(\frac{\rho}{\sqrt{(k-1+\frac
{q-1}{N})t_s}}\bigg), \quad k\in\mathbb{N}, q\in [1:N].\label{eqn:AA2}
\end{align}
Note that $\sum_{q}p_{k,q}=p_k$ as defined by \eqref{eqn:AA1}. The key
observation is the fact that for a fixed value of $k$, the hitting probability
$p_{kq}$ varies for different values of $q$, i.e. in general $p_{k,q}\neq
p_{k,q'}$ for $q\neq q'$.  {Therefore, we will have N independent Poisson distributions with \emph{distinct means}. The sum of these $N$ Poisson variables would be the total read in the entire time slot, and would not be a sufficient statistic for decoding the message since the parameters of the $N$ Poisson distributions are not equal. Thus, more samples results in more information and better performance.}

The MLDA decoder for multiple reads is provided next.
As before, we assume that the decoder has a memory of $B$ bits that stores
the last $B$ decoded bits. Using this memory the decoder estimates $\hat{I}_{i,q}$
of time slot $i$ resulted by previous symbols in $q$-th sub-time-slot as
\begin{align}
\hat{I}_{i,q}=\lambda_0 t_s + \sum_{j=1}^{B}{p_{{j+1},q}\hat{X}_{i-j}} +
\frac{(s_0+s_1)}{2}  \sum_{j=B+1}^{\infty}{p_{{j+1},q}}. \label{eqn:Analys1}
\end{align}

The decoder assumes the previously decoded symbols are correctly decoded
and uses the $N$  observations in the current time slot for decoding.
The associated decision rule is as follows:
\begin{align}
 \max_{j\in\{0,1\}}{p(y_{i,1},...,y_{i,N}|X_i=s_j,\hat{X}_{i-1}=\hat{x}_{i-1},...,\hat{X}_{i-B}=\hat{x}_{i-B})},
\end{align}
which results in
\begin{align}\label{DR}
\sum_{q=1}^{N}{y_{i,q} \ln {(\frac{\hat{I}_{i,q}+p_{1,q}s_1}{\hat{I}_{i,q}+p_{1,q}s_0})}}\gtrless
^{s_1}_{s_0} (s_1-s_0)\sum_{q=1}^{N}{p_{1,q}} = (s_1-s_0)p_1.
\end{align}

We observe that if the probabilities of hitting for all sub-time
slot were the same, the above multiple reads decision rule reduces to the
one read decision rule. The analysis of the probability of error of the above decoder using the saddle-point method is given in Appendix \ref{appndxC}.

To justify receiver sampling at a higher rate than the transmission
rate, we numerically examine the performance of multiple-read MLDA.  We see that the performance improves by increasing
$N$, significantly for small values of $N$, but the amount of increase saturates from some
point onwards.

Fig. \ref{figNR} shows the probability of error of MLDA versus time slot durations for different number of observations in one time slot resulted by simulation and also saddle point analysis. The figure shows the analysis is compatible with the simulation results. Also, it is observed that increasing $N$, significantly improves the probability of error. Specially, as  $t_s$ increases the improvement is more noticeable.
Fig. \ref{figBN} shows the probability of error of MLDA versus $N$ for different values of decoder memory, $B$, computed by the saddle point analysis. It is observed that increasing $N$ up to 4  significantly improves the probability of error. For $N>4$ the improvement is not noticeable.

\vspace{-0.4cm}
\section{Application to MCSK}\label{sec:MCSK}

MCSK is a modulation technique introduced in \cite{AA1} in which two molecule types are utilized, {though not for data transmission.} \emph{At the transmitter}, the molecule types (for instance, $A_1$ and $A_2$) alternate from one symbol interval to the next one (so for instance molecule type $A_1$ is used in odd time slots and molecule type $A_2$ is used in even time slots). This causes a reduction in the interference from the same molecule type. More specifically, if we focus on molecules of type $A_1$, we would have $X_{i}=0$ for all even $i$ (no transmission of $A_1$ molecules in the even time slots). Therefore the interference plus noise term would become
$I_i=\lambda_0 t_s + \sum_{k=1}^\infty p_{k+1} X_{i-k}= \lambda_0 t_s + \sum_{k=2, k~even}^\infty p_{k+1} X_{i-k}$. The ideas developed above can be adapted to MCSK. For numerical evaluations, we have assumed that $\rho^2=0.3$. In all of the figures we assumed $B$ bits for storing the data of each molecule type in the MLDAs (thus $2B$ bits of memory in total).  Fig. \ref{fig4} depicts the plot of probability of error for MCSK scheme for proposed simple receiver for different values of $B$ versus transmission rate for $s=60$ and background noise power $\lambda_0=0.4$. In the same figure, probability of error of an ML decoder with  \emph{known interference} (interference is fully available at the receiver) is drawn. This curve clearly serves as a lower bound. It is seen that as the memory $B$ increases, probability of error of the MLDA decays. Further, the figure shows that for $B=3$ the simple receiver is pretty close to the performance of the  ML decoder with known interference. This figure also contains a curve labeled by" the int. is not considered", which corresponds to a ``conventional receiver" that ignores the existence of interference, but uses MAP decoding. This simple decoder has been commonly used in previous works; for instance see \cite{AA2}.\color{black}

Fig. \ref{fig5} depicts the probability of error for proposed simple receivers versus the transmission rate for $s=80$ and  background noise power $\lambda_0=40$ for MCSK modulation. It is observed that as the transmission rate increases ($t_s$ decreases), the environmental noise decreases as well, while the main signal term and the interference term increase. Accordingly, there is a trade-off between the constructive and destructive terms. It can be interpreted from the figure that by increasing the transmission rate, the probability of error first decreases until it reaches its minimum value for a specific value of transmission rate (about 1.5 depending on the curve). From here increasing the rate increases all of probabilities of error.

\iffalse
Fig. \ref{fig7} is same as Fig. \ref{fig:CSK2} except for MCSK modulation. It can be concluded that the derived simple receivers for this modulation are very close to the lower bounds.
\fi

 Fig. \ref{fig7_mid} plots the maximum possible rate when the probability of error is less than or equal to 0.005 for a given $s$. This is plotted for the known interference lower bound and MLDAs with different memories.
  {Fig. \ref{Fig3d} is same as Fig. \ref{fig:CSK2} (a) except that it is for a three dimensional medium; here $s=120$. The transmitter is located at $[0,0,0]^T$; the receiver is assumed to be a cube of length of $2 \mu m$, with the center of the cube located at $[8,8,8]^T \mu m$. Hitting probabilities were estimated using an extensive numerical simulation.}

We end this section by diverging from the main theme of the paper and briefly comment on the MCSK modulation scheme.
In the original MCSK, it was assumed that the receiver counts the number of molecules of type $A_1$ in odd time slots and molecules of type $A_2$ in even time slots. If it is possible to count both molecule types in the same time slot, one can postpone decoding of
 the current symbol for one time slot to exploit the molecules counted in both of the current and the next time slot, i.e. $Y_i$ and $Y_{i+1}$ in the decoding process. In other words, in the even time slots where the transmitter releases molecules of type $A_2$, we  count molecules of type $A_1$ that arrive from transmission in the previous time slot.  For the MAP decision rule for one-delay decoding, one has to compare $p(Y_i=y_1, Y_{i+1}=y_1, |X_i=x, K_i=k)$ for different values of $x$. This probability is equal to
$$\mathbb{E}_{I_i, I_{i+1}|K_i=k}\frac{e^{-(p_1x+I_i)}(p_1x+I_i)^{y_1}}{y_1!}\frac{e^{-(p_2x+I_{i+1})}(p_2x+I_{i+1})^{y_2}}{y_2!}$$
where we used the fact that given $I_{i}, I_{i+1}$ and $X$, rv's $Y_i$ and $Y_{i+1}$ are independent because of the thinning property of Poisson distribution. The formula for MLDA decoder with one delay for the MCSK can be computed as follows: having
$K_i=(\hat{X}_{i-2}, \hat{X}_{i-4}, \cdots,
\hat{X}_{i-2B})$  in the memory, we estimate
\begin{align*}
\hat{I}_i&=\lambda_0t_s+p_3\hat{X}_{i-2}+\cdots+p_{2B+1}\hat{X}_{i-2B}+\frac {s_0+s_1}{2}\sum_{j=B+1}^{\infty}
p_{2j+1},\\
\hat{I}_{i+1}&=\lambda_0t_s+p_4\hat{X}_{i-2}+\cdots+p_{2B+2}\hat{X}_{i-2B}+\frac {s_0+s_1}{2}\sum_{j=B+1}^{\infty}
p_{2j+2}.
\end{align*} Then the decision rule can be worked out as follows:
$$\argmin_{x\in\{s_0, s_1\}}e^{-(p_1+p_2)x}(p_1x+\hat{I}_i)^{y_1}(p_2x+\hat{I}_{i+1})^{y_2}=\argmin_{x\in\{s_0, s_1\}}-(p_1+p_2)x+y_1\log(p_1x+\hat{I}_i)+y_2\log(p_2x+\hat{I}_{i+1}),$$
resulting in a threshold rule. For MLDA with one delay, when having multi-read, a decision rule similar to \eqref{DR} can be obtained.
 Fig. \ref{fig12} demonstrates both effects of delay decoding and multi-sampling. It is seen that with large transmission rates, probability of error decreases when we use delay decoding plus multi-sampling.

\iffalse
Fig. \ref{fig10} demonstrates the effect of delay decoding, showing that waiting for one time slot can improve the performance of receivers. Fig. \ref{fig11} is same as Fig \ref{fig4} but for a constant value of $t_s$ versus different values of average transmission power, $\frac{s}{2}$. It depicts the probability of error of the zero delay and delayed decoding in two cases of with and without considering interference in terms of the average transmission power for the symbol duration of $t_s=150ms$. It is observed that not considering the interference effect will devastate the receiver performance. It is also recognizable that using $Y_{i+1}$ in delayed decoding has improved the performance; while in the case of zero-delay decoding that does not use $Y_{i+1}$, the interference is not well managed.

Fig. \ref{fig12} demonstrates both effects of delay decoding and multi-sampling. It is seen that in large transmission rates, probability of error decreases when we use delay decoding plus multi-sampling.

\fi
\vspace{-0.7cm}
\section{Conclusions}\label{sec:conclusion}
In this paper, we studied diffusion-based molecular communication and demonstrated that we can use a simple threshold decoder to attain error probabilities close to optimal ones. This is of practical importance since nanomachines are resource-limited devices. We further proved a theoretical result that reduces the computational complexity of finding the performance of an optimal threshold decoder, and found a sufficient condition under which an optimal ML decoder becomes a threshold one. \color{black} We also studied the effect of multiple reads at the receiver, and showed that taking multiple samples can improve the performance significantly. As a future work, one can relax the assumptions we have made (uncoded transmission at the transmitter and the zero delay at the receiver)  {and propose  simple, practical transmitter and receivers that are near optimal for more general class of encoder and decoders}. We believe that the ideas introduced in this paper, including the genie-aided lower bounds, can be helpful in that quest.

\vspace{-0.3cm}

redpajama_set_name: RedPajamaArXiv


text:
struct T0 {
  int x;
  union {
    void *m0;
  };
};
template <typename T>
struct T1 : public T0, public T { //expected-warning{{direct base 'T0' is inaccessible due to ambiguity:\n    struct T1<struct A> -> struct T0\n    struct T1<struct A> -> struct A -> struct T0}}
  void f0() {
    m0 = 0; // expected-error{{ambiguous conversion}}
  }
};

struct A : public T0 { };

void f1(T1<A> *S) { S->f0(); } // expected-note{{instantiation of member function}} expected-note{{in instantiation of template class 'T1<A>' requested here}}

namespace rdar8635664 {
  template<typename T>
  struct X {
    struct inner;

    struct inner {
      union {
        int x;
        float y;
      };

      typedef T type;
    };
  };

  void test() {
    X<int>::inner i;
    i.x = 0;
  }
}

redpajama_set_name: RedPajamaGithub


Operating your boiler with an optimum amount of excess air will minimize heat loss up the stack and improve combustion efficiency. Combustion efficiency is a measure of how effectively the heat content of a fuel is transferred into a usable heat. The stack temperature and flue gas oxygen (or carbon dioxide) concentrations are primary indicators of combustion efficiency. Given complete mixing, a precise or stoichiometric amount of air is required to completely react with a given quantity of fuel. In practice, combustion conditions are never ideal and additional or "excess" air must be supplied to completely burn the fuel.
The percentage of oxygen in the flue gas can be measured by inexpensive gas absorbing test kits. More expensive ($500 – $1,000) hand-held, computer-based analyzers display percent oxygen, stack gas temperature, and boiler efficiency. They are a recommended investment for any boiler system with annual fuel costs exceeding $50,000.
When fuel composition is highly variable (such as refinery gas, hog fuel, or multi-fuel boilers) or where steam flows are highly variable, an on-line oxygen analyzer should be considered. The oxygen "trim" system provides feedback to the burner controls to automatically minimize excess combustion air and optimize the air-to-fuel ratio.
All industrial facilities have a network of piping that carries water or other liquids. According to the U.S. Department of Energy Study, 16% of a typical family's electricity costs are for its pumping systems. The power consumed to overcome the static head in a pumping system varies linearly with the flow and very little can be done to reduce the static component of the system requirement. On the other hand, several energy and money-saving opportunities exist to reduce the power required to overcome the friction component of the pumping system. The frictional power required is dependent on the rate of flow, pipe size (diameter), the overall length of the pipe, pipe characteristics (surface roughness, material, etc.) and properties of the liquid being pumped.
Compute annual and life cycle cost for systems before making an engineering design decision.
In systems dominated by friction head, always evaluate pumping costs for a couple of different pipe sizes and try to accommodate pipe size with the lowest overall life-cycle cost.
Look for ways to reduce friction factor. If your application permits, the use of plastic or epoxy-coated steel pipes can reduce friction factor by more than 40%; proportionately reducing your pumping costs.
Regularly monitor voltages at the motor terminals to verify that voltage unbalance is maintained below 1%. Check your electrical system single-line diagrams to verify that single-phase loads are uniformly distributed. Install ground fault indicators as required and perform annual thermographic inspections. Another indicator that voltage unbalance may be a problem is 120Hz vibration. A finding of 120 Hz vibration should prompt an immediate check of voltage balance.


text:
Gnathia limicola är en kräftdjursart som beskrevs av Ota, Tanaka och Hiroyuki Hirose 2007. Gnathia limicola ingår i släktet Gnathia och familjen Gnathiidae. Inga underarter finns listade i Catalogue of Life.

Källor

Gråsuggor och tånglöss
limicola


text:
Neus Martínez-Abadías (Lleida, 17 d'octubre de 1978) és biòloga, investigadora i professora universitària; especialitzada en antropologia biològica, biologia evolutiva i del desenvolupament i anatomia.

Carrera professional
Va estudiar biologia a la Universitat de Barcelona (promoció 2002). Va fer la tesi doctoral a la UB al laboratori del Dr. Miquel Hernandez de la unitat d'antropologia sobre patrons evolutius del crani humà. Després va fer dos postodcs, de 2008-2009 a Canadà (University of Calgary ).i de 2009-2012 als EUA (Penn State University). El 2012 va tornar a Barcelona a treballar al laboratori de James Sharpe al Centre de Regulació Genòmica (CRG), dins el Parc de Recerca Biomèdica de Barcelona (PRBB) estudiant com relacionar patrons d'expressió gènica amb el desenvolupament de les extremitats.

Durant els seus anys al laboratori de Sharpe, Martínez-Abadías va estudiar com els extractes de té verd poden tenir un efecte en la morfologia de la cara en persones amb Síndrome de Down. L'estudi, experimental en ratolins i obervacional en humans, es va fer en col·laboració amb els laboratoris de Mara Dierssen al CRG i Rafael de la Torre a l'Institut Hospital del Mar d'Investigacions Mèdiques (IMIM) i de Greetje Vande Velde de KU Leuven (Bèlgica).

El 2018, Martínez-Abadías va passar a treballar a la nova seu del Laboratori Europeu de Biologia Molecular (EMBL) al PRBB, a Barcelona.

Contribucions
Ens els darrers anys una sèrie d'articles publicats a revistes científiques com Proceedings of the Royal Society B, Trends in Cognitive Sciences, Psychological Science o PLOS One, semblen recolzar les teories de la frenologia - actualment considerada una pseudociència - que considera que la morfologia de la cara i del crani van lligades al caràcter. Aquesta pseudociència fins i tot ha arribat a ser utilitzada en els departaments de recursos humans per prendre decisions sobre la personalitat de les persones en procesos de selecció. Martínez-Abadías i d'altres investigadors van dur a terme un estudi científic publicat a PLOS One que refuta aquestes idees.

Dona i ciència
Mare de dues nenes, Martínez-Abadías dedica part del seu temps a incentivar les nenes i noies a estudiar carreres científiques. Va formar part del Comité d'equitat de gènere del PRBB, dona xerrades a escoles i participa activament en diverses campanyes de sensibilització en qüestions de gènere i ciència.

Referències

Enllaços externs
 Fitxa Universitat de Barcelona

Científics lleidatans
Biòlegs catalans del sud contemporanis


Vectorbord® STD Bus industrial backplanes per IEEE 961 microcomputer bus, compact and rugged are fully assembled and tested. Designed for 4.5" X 6.5" plug-in boards, Vector STD Bus backplanes are available in 8 or 16-slots. Speed capability up to 10MHz; 2-layer design. Ample positions for decoupling capacitors; interrupt priority lines.


text:
Edward Snowden calls for spyware trade ban amid Pegasus revelations | Edward Snowden
Windows 11: The Return of the Gadgets?
NOD32 Antivirus / ESET Internet Security / Eset Smart Security Premium 14.2.10.0
Old Nintendo Switch Games Are Outselling PS5, Xbox Titles
Everything New With Safari in iOS 15: Redesign, Tab Groups, Live Text, Privacy Updates and More
All the New Privacy and Security Features Coming to iOS and macOS
5 ways to protect your devices from hackers
Nexus Mod Creators In Revolt Over Deletion Rules
Scientists Warn of "Bleak Cyborg Future" From Brain-Computer Interfaces
iOS 14.7.1 and macOS 11.5.1 arrive with one bug fix and one security fix
OnePlus 9T With 108-Megapixel Hasselblad Quad Rear Camera Tipped to Launch in Q3
Researchers warn of the potential social, ethical, and legal consequences of technologies interacting heavily with human brains. Surpassing the biological limitations of the brain and using one's mind to interact with and control external electronic devices may sound like the distant cyborg future, but it could come sooner than we […]
Researchers warn of the potential social, ethical, and legal consequences of technologies interacting heavily with human brains.
Surpassing the biological limitations of the brain and using one's mind to interact with and control external electronic devices may sound like the distant cyborg future, but it could come sooner than we think.
Researchers from Imperial College London conducted a review of modern commercial brain-computer interface (BCI) devices, and they discuss the primary technological limitations and humanitarian concerns of these devices in APL Bioengineering, from AIP Publishing.
The most promising method to achieve real-world BCI applications is through electroencephalography (EEG), a method of monitoring the brain noninvasively through its electrical activity. EEG-based BCIs, or eBCIs, will require a number of technological advances prior to widespread use, but more importantly, they will raise a variety of social, ethical, and legal concerns.
A schematic demonstrates the steps required for eBCI operation. EEG sensors acquire electrical signals from the brain, which are processed and outputted to control external devices. Credit: Portillo-Lara et al.
Though it is difficult to understand exactly what a user experiences when operating an external device with an eBCI, a few things are certain. For one, eBCIs can communicate both ways. This allows a person to control electronics, which is particularly useful for medical patients that need help controlling wheelchairs, for example, but also potentially changes the way the brain functions.
"For some of these patients, these devices become such an integrated part of themselves that they refuse to have them removed at the end of the clinical trial," said Rylie Green, one of the authors. "It has become increasingly evident that neurotechnologies have the potential to profoundly shape our own human experience and sense of self."
Aside from these potentially bleak mental and physiological side effects, intellectual property concerns are also an issue and may allow private companies that develop eBCI technologies to own users' neural data.
"This is particularly worrisome, since neural data is often considered to be the most intimate and private information that could be associated with any given user," said Roberto Portillo-Lara, another author. "This is mainly because, apart from its diagnostic value, EEG data could be used to infer emotional and cognitive states, which would provide unparalleled insight into user intentions, preferences, and emotions."
As the availability of these platforms increases past medical treatment, disparities in access to these technologies may exacerbate existing social inequalities. For example, eBCIs can be used for cognitive enhancement and cause extreme imbalances in academic or professional successes and educational advancements.
"This bleak panorama brings forth an interesting dilemma about the role of policymakers in BCI commercialization," Green said. "Should regulatory bodies intervene to prevent misuse and unequal access to neurotech? Should society follow instead the path taken by previous innovations, such as the internet or the smartphone, which originally targeted niche markets but are now commercialized on a global scale?"
She calls on global policymakers, neuroscientists, manufacturers, and potential users of these technologies to begin having these conversations early and collaborate to produce answers to these difficult moral questions.
"Despite the potential risks, the ability to integrate the sophistication of the human mind with the capabilities of modern technology constitutes an unprecedented scientific achievement, which is beginning to challenge our own preconceptions of what it is to be human," Green said.
Reference: "Mind the gap: State-of-the-art technologies and applications for EEG-based brain-computer interfaces" by Roberto Portillo-Lara, Bogachan Tahirbegi, Christopher A.R. Chapman, Josef A. Goding and Rylie A. Green, 20 July 2021, APL Bioengineering.
How Does Pegasus Spyware Work and How to Protect Yourself from Attacks
Wed Jul 21 , 2021
"How Does Pegasus Spyware work?" is the number one question that comes to people's minds, especially as they research this problem and its popularity in the current tech landscape. People are also keen on learning how to go against this spyware, as it has already incited fear that it monitors […]
Breakthrough in 3D Magnetic Nanostructures Could Transform Modern-Day Computing
Artificial Intelligence That Can Program Computers And Solve A $100 Billion Legacy Code Problem
What Is a TPM, and Why Do I Need One for Windows 11?
Computer Engineering Grads Use Ingenuity to Design New Products
GovCon Wire Events to Feature Kevin Brancato, Mick Fox as Keynote Speakers at Capture Management Webinar on Aug. 4th
The 10 Best USB-C Adapters 2021


McDonnell Boehnen Hulbert & Berghoff LLP is proud to be an official sponsor of the 2018 iBIO iCON Awards Dinner set for October 2 at the Chicago Botanics Garden in Glencoe, IL. The iCON Award was developed to recognize the importance of education, research and training in fostering growth and building the next generation of Midwest biotechnology and life sciences innovators and leaders. Each year, iBIO Institute holds the iCON Awards Dinner to celebrate the achievements of leaders who nurture education, training and scholarship in the life sciences in Illinois.
View complete details at http://iconawards.org/.


text:
Kellyanne Conway Humiliates Smug CBS Reporter Paula Reid in the Classiest Way Possible
By Elizabeth Vaughn | 2:15 PM on April 17, 2020
FILE – In this March 6, 2018, file photo, White House counselor Kellyanne Conway attends a news conference in the East Room of the White House in Washington. Conway on Sunday, June 17, 2018, distanced the Trump administration from responsibility for separating migrant children from their parents at the U.S.-Mexico border, even though the administration put in place and could easily end a policy that has led to a spike in cases of split and distraught families. (AP Photo/Susan Walsh, File)
CBS News' White House reporter Paula Reid is making quite a name for herself due to her disrespectful behavior at President Trump's daily task force briefings.
On Wednesday, Kellyanne Conway, counselor to the President, held an informal press conference on the White House lawn. First, Reid asked Conway if they've given any thought to diversifying the President's Council on reopening the country, which she noted was predominantly a group of very wealthy, white men?
Kelly told her, "We don't pick who the heads of the Sports Commissions, Leagues and CEOs of companies are who want to help."
It's difficult to hear Reid's question due to the noise of traffic. Reid says, "But you do pick the Council and you could pick small businesses (inaudible)?"
Conway looks at Reid and says:
Paula, I actually don't know what's happened to you, respectfully, I don't know why you've changed…and you're in the briefing room screaming at Anthony Fauci and the President of the United States.
I frankly think it's unbecoming, but that aside, I'll answer the question about how they're going to help America which is why I'm here. I think you're here for a different reason it seems these days.
Well done, Kellyanne.
"Paula, I actually don't know what's happened to you, respectfully, I don't know why you've changed…
and you're in the briefing room screaming at Anthony Fauci and the president of the United States." pic.twitter.com/Uvmftm5BaO
— Washington Examiner (@dcexaminer) April 16, 2020
We all know the main objective of most reporters in the White House press pool is to bait the President into making an inflammatory statement that they can rush off and broadcast to the world. On a more personal level, they strive to appear as savvy and bold as possible in the presence of their peers and for everyone else they know will see it.
Reid was especially full of herself at a March White House briefing. She was clearly out to ambush the President.
Slipping into her best 'I'm a woman of the world, watch how ballsy I am when I confront the President persona', with index finger pointing, Reid asked President Trump, "Mr. President, you tweeted earlier linking the closing of the country to your election success in November." (A slight smile crosses her face and she looks directly at the President, index finger still pointing.) "Is this Easter timeline based on your political interests, because…"
Trump asks, "What do you mean by election success?"
Reid continues, "You tweeted. You said that the media wants the country to remain closed to hurt your odds of being reelected."
The President says, "The media would like to see me do poorly in the election. I think."
Reid cuts him off, "Sir, lawmakers and economists on both sides of the aisle have said that reopening the economy by Easter is not a good idea. What is that plan based on?"
Trump's annoyance becomes clear from the change in his tone of voice. He replies, "Just so you understand. Are you ready? I think there are certain people that would like it not to open so quickly. I think there are certain people that would like it to do financially poorly because they think that would be very good as far as defeating me at the polls. And I don't know if that's so, but I do think it's so that there are people in your profession that would like that to happen. I think it's very clear."
Reid interrupts to say, "But your own medical experts did not endorse that plan yesterday."
He talks over her. "I think it's very clear that there are people in your profession that write fake news. You do. She does. There are people in your profession that write fake news."
"I think it's very clear that there are people in your profession that write fake news. You do," President Trump says to CBS News' @PaulaReidCBS during the White House coronavirus task force update https://t.co/jDTU91Xjk4 pic.twitter.com/mNTGL4IjOZ
— CBS News (@CBSNews) March 25, 2020
Earlier this month, Reid played a role in an adult version of "Mean Girls" in the White House Briefing Room.
Several mainstream media reporters had been ganging up on One America News Network (OANN) reporter Chanel Rion at the daily briefings. OANN is a fairly new conservative outlet that provides mostly positive coverage of President Trump.
The situation began to escalate at the end of March. One day, Reid noticed that Rion was standing in the back of the briefing room, which was a violation of the White House Correspondents Association's (WHCA) "social distancing" guidelines. So, she notified the WHCA and a representative asked Rion to leave. Rion refused, according to the tweet below, saying she was a guest of White House press secretary Stephanie Grisham.
UPDATE: @whca removes OANN from WH briefing rotation after outlet violated social distancing policy multiple times. #COVIDー19 pic.twitter.com/bzNu2v46NG
— Paula Reid (@PaulaReidCBS) April 1, 2020
The next day, every major newspaper had an article about Rion. The headline in The Washington Post read, "OANN threatened with removal from White House press room after correspondent Chanel Rion makes unauthorized appearances" and it can be viewed here.
Reid also had a memorable run-in with Attorney General William Barr during a press conference held the morning the Mueller report was released in April 2019. Reid first pointed out that Barr's comments were "quite generous to the President and his feelings and emotions. It just seems like there is a lot of effort – to go out of your way to acknowledge how this was difficult for him."
Reid definitely had a bit of an edge in her voice and Barr immediately responded in kind.
Barr replied, "I'm not sure what your basis is for saying I'm being generous to the President."
She then questioned Barr about his use of the word "unprecedented."
Barr asked, "Is there another precedent for it?"
She answered, "No."
He then responded, "OK, so unprecedented is an accurate description."
Owned!
Reid then began to ask him if he was concerned that some might feel he was "trying to protect the President."
Barr ignored her and went on to the next question.
Barr: "I'm not sure what your basis is for saying I'm being generous to the President."
A reporter then brings up his use of the word "unprecedented."
"Is there another precedent for it," Barr asks.
"No," the reporter answers.
"OK so unprecedented is an accurate description." pic.twitter.com/5Mkso4BOCR
Writer at RedState
MBA, former financial consultant, options trader
Mom of three grown children, grandmother
Email Elizabeth at [email protected]
Read more by Elizabeth Vaughn
Tags: CBS REPORTER PAULA REID KELLYANNE CONWAY WHITE HOUSE PRESS BRIEFINGS


Why Is Credibility Important in Business?
Credibility in business is important because your reputation as an entrepreneur, a small business owner, or a freelancer precedes your perceived trustworthiness. Earning credibility means establishing a strong sense of trust between yourself and your clients. In order to achieve this, you must have a certain amount of business savvy and experience that can only come with years of hard work and perseverance. Many small businesses or startups struggle to demonstrate this level of dedication to their clients simply because they lack the funds and proper resources to implement ample and basic business practices that will help them move forward. You need to exhibit drive, ambition, dedication, and flexibility; most of all, you need to prove that you're worthy of your clients' business. The most effective way to grow your business's credibility without breaking the bank is to rent a virtual office space in a city like Ottawa.
Ottawa is a sophisticated metropolitan hub that's home to many different kinds of people. Not only is it Canada's much-beloved capital city; it also provides a central location for many of this nation's largest and most prominent businesses. By renting a virtual office space in a city as diverse as Ottawa, you're sure to significantly boost the credibility of your business because there are many cultural attractions to draw people in.
Virtual offices aren't meant to replace the conventional brick-and-mortar office archetype. On the contrary, virtual offices expand on this idea, giving you the freedom and flexibility you need to run your business from anywhere in the world while still maintaining a strong sense of professionalism. You can expand on building your brand, diminish your staffing costs without sacrificing quality service, make use of a reliable corporate address, get access to the best technology available, and retain access to high-end office amenities without having to pay premium fees. The best part is that your contracts are usually very negotiable and can be adapted to suit your specific business needs.
Whether you're already an established brand, are just starting out, or looking to change the image of your brand, a virtual office is a cost-effective and useful way of accomplishing your business goals without forgoing the benefits of owning a full-fledged office. The way you operate your business on the inside is your prerogative as long as your business practices are running smoothly and work towards your success. Just keep in mind that for clients, presentation is everything, and even if you don't have a permanent location to conduct business from, it pays to give the impression that you do.
A dependable staff is the cornerstone of every successful business. As the saying goes, "no man is an island." You may think that you're superhuman, but you're not, and you're going to need all the valuable help you can get to run your business. Sometimes, you might need to make budgetary cuts in order to survive the fiscal year, but skimping on your office staff is not the way to do it.
Luckily, virtual offices include a certified and multifaceted staff that is specially trained in every aspect of your business. Professional receptionists are provided to answer your phones and transfer calls to you no matter where you are. Mail delivery services are available to you on a regular basis, so you will never miss an important notice, invoice, or package. IT experts are at your beck and call to ensure that all your technological needs are met. Coupled with a prestigious corporate address, a full office staff will give your clients the impression that you truly care about your business and, more importantly, you care about them enough to hire reliable and assiduous people to work for you.
Whether you travel extensively to conduct business or if you largely choose to work from home, you still need an impressive corporate address to hold important client or staff meetings. This goes back to keeping up a professional appearance. Your clients don't need to know that your permanent office is your kitchen table because you need to give them the sense that you are a truly credible business. Part of that persona involves carrying out meetings in an actual designated meeting room.
While coffee shops or restaurants are an adequate alternative, they're often overcrowded and noisy or there are no guarantees that you'll be able to find ideal seating—or any seating for that matter. Virtual office rentals give you the option of using physical meeting spaces, boardrooms, training areas, and conference facilities whenever you need them, and they offer complete privacy. You also get a few added bonuses like refreshments and topnotch catering if you so choose.
As previously mentioned, one of the great amenities virtual offices offer is comprehensive use of meeting rooms whenever you want. There are other perks as well. You also get access to high-speed Internet, a full kitchen to use at your disposal, a full staff working by your side, IT support, conference call equipment, AV equipment, laptop and desktop computer rentals, full mail retrieval services, and so much more. It's safe to say, though, that the most important and obvious advantage of renting a virtual office is the affordability and convenience.
One of the biggest signifiers of a successful and fully operational business is the type of technology that's used from the initial entry point all the way to the CEO's office and conference rooms. If the technology you're using is noticeably outdated, this can leave a bad taste in your clients' mouths. Their perception of your business may be tainted because they'll have the impression that you can't afford top-of-the-line equipment. But, with a virtual office space rental, you're always guaranteed to have the latest and most up-to-date technology available to you, which will help to increase your overall credibility score with your clients.
Innovative Professional Offices is committed to helping your business succeed in every way possible and we are always available to answer any questions you may have about leasing an office space with us. All of our services and rental plans are fully customizable to meet your standards. We have a wide selection of affordable packages to best fit your business needs. Contact us today to learn more about our business call answering services.


We know that not everyone wants to play tennis professionally; some people love the fitness and social aspects of coaching, training and playing with others; we understand that, and ensure that while everyone maintains good progress, our group sessions are enjoyable and a great place to have fun, network, get fit and meet new people.
Our group sessions are available for adults of all abilities, from total beginners to those who want to compete in tournaments.
This is the perfect group for those who have had a long break from the sport and those who are picking up a racket for the very first time. With small group teaching (the ratio of students to coach is 4:1) and expert coaches, we have fun but make quick progress. Sessions incorporate drills, tactics and techniques, eventually progressing to playing friendly singles and doubles matches.
After a preliminary assessment with a coach to establish your level of ability, we'll work in small groups, focusing on accuracy, decision-making, technical skills and drill sessions to help you excel in a match situation. There will be a physical training element to each session to ensure fitness levels are improved and to enhance specific tennis skills.
Due to the Chelsea Flower Show, Ranelagh Gardens tennis courts are closed for 7 weeks. All our coaching programme will take place during the closures at Battersea, Chelsea Bridge Road SW11 4PX.
At Bodyswot Tennis, we offer tailored, professional tennis lessons in London for children and adults of all ages and abilities.
© Copyright by Bodyswot Tennis. All rights reserved.


Thanks for reading my FIRST blog!! I am so happy to announce that I am now an official brand ambassador for bettyandveronica.com!!
Do we have any Riverdale fans?? Me too gurl, you'll definitely want to keep reading.
I have been a Betty and Veronica fan since I was a little girl, I got it from my dad. When he was younger he used to read The Archie Comics and thank God my grandma saved them all. All of the comics were passed down to me, in fact they're sitting on my book shelf right now! So naturally when I heard about Riverdale and that it was based on the Archie comics I was so excited and immediately binge watched it on Netflix. Riverdale only furthered my obsession which is why I am so happy to represent this company!
Bettyandveronica.com is a site where you can purchase Betty and Veronica merchandise & this is not your normal merchandise. This company has everything from keychains, to hats, to sunglasses, to graphic tees, to pajamas and so much more that all have the unique "Archie comic" flair. All of the products are BEYOND cute!
I currently own the jacket pictured up top in size medium (so it would be oversized), a Veronica graphic tee in size large (runs small, I normally wear a small), and silk pajamas in size small (true to size)! All of the items that I own are phenomenal and only allow me to mark off a very small portion of Betty and Veronica merch I want to buy!
So here's the BEST part… I HAVE A DISCOUNT CODE!
Killing it J! Love you!
Thanks Emma! Love ya lots!
Looks awesome Jayden, I'm so proud of you!