text:
\section{Introduction}

Combinatorial optimization problems such as traveling salesman problem (TSP), job-shop scheduling, vehicle routing, scheduling of aircraft landing, gene sequencing, and many others are problems whose solutions are of real-world importance. Exact algorithms have been proposed to these problems but prove inefficient for large problem instances (i.e., they are NP-hard)~\cite{garey79}. Graph-based heuristics such as branch and bound~\cite{tschoke95}, as well as distributed multi-agent based algorithms such as genetic algorithms~\cite{pabico99}, memetic algorithms~\cite{moscato92,freisleben96a,freisleben96b}, tabu search~\cite{zachariasen95}, simulated annealing~\cite{martin96}, simulated jumping~\cite{amin99}, neural networks~\cite{miglino94}, and swarm intelligence~\cite{gambardella95,gambardella96,dorigo97} have been used to find time-restrained optimal and near optimal solutions for these problems.

In recent years, different researchers have shown that the chemical systems of living organisms possess inherent computational properties~\cite{hjemfelt91,adleman94,arkin94}. Because of these, the chemical metaphor has emerged as a computational paradigm~\cite{berry92,fontana92,banzhaf95,ikegami95,banzhaf96,dittrich98}. Under this computational framework, objects such as atoms or molecules are considered as data or solutions, while interactions (i.e., molecular collisions or reactions) among objects are defined by an algorithm.

Using the chemical metaphor, a distributed stochastic algorithm was designed to simulate a reactor where the molecules are being represented either by a human genomic contig panel, a Hamiltonian cycle, or an aircraft landing schedule.  The chemical universe in the reactor is governed by reactions that can alter genomic sequences, re-order Hamiltonian cycles, or schedule an aircraft landing program. This computational paradigm can be used to solve, in parallel, very hard real-world problems.

In this effort, an artificial chemical reactor (ACR) simulates chemical catalysis that will solve in parallel three NP-hard computational problems. These problems are the construction and integration of RH map of the human genome, the solution to large instances of symmetric and asymmetric TSP, and the static aircraft landing scheduling problems (ALSP). The artificial chemical reactor was used as a computational metaphor for constructing RH maps from different RH panels and integrating them to produce a single RH map for the genome. The ACR simulation of catalytic reactions constructs RH maps with the same quality as those constructed by RHMAPPER~\cite{stein95} and CONCORDE~\cite{agarwala00}. In addition, ACR was also used to find, in parallel, solutions to the TSP and the ALSP.

\section{Development of Artificial\\Chemical Reactor}

This section briefly defines the three problems used in this study: the RH mapping problem, the TSP, and the ALSP. The development of the ACR is then discussed, while its underlying reaction algorithms defined, with a focus on solving the three problems in parallel.

\subsection{RH Mapping Problem}

The RH mapping problem can be viewed as follows. Given a collection of DNA\footnote{deoxyribonucleic acid} fragments originating from identical copies of a chromosome, where some of the fragments are overlapping while others are disjoint. The problem is to derive the true DNA sequence of the chromosome from these DNA fragments. Since the DNA sequence of the chromosome is unknown, a metric is needed to quantify the correctness of a candidate sequence. A reasonable measure is to find the shortest DNA sequence that has all the fragments as subsequence~\cite{ivansson00}. This problem is generally known as the shortest common supersequence (SCS).

Given a finite alphabet $\Sigma$, where in this case $|\Sigma|=4$ pertaining to the DNA bases adenine, cytosine, guanine, and thymine, and a finite set of strings $R$ from the superset $\Sigma^*$. $R$ can be seen as the set of RH panels. The solution to SCS is a string $w\in \Sigma^*$ such that each string $y\in R$ is a subsequence of $w$ (i.e.  one can get $y$ by taking away letters from $w$)~\cite{kann00}. In RH mapping problem, any string $w$ is a DNA sequence. The minimum length $w$ will be the optimal solution to the RH mapping problem.

\subsection{Traveling Salesman Problem}

The TSP is formally defined as the problem of finding the shortest Hamiltonian cycle of a graph $G(V,E)$ composed of a set of cities $V=\{v_a, v_2, \dots, v_n\}$, and a path set $E=\{(v_i, v_j): v_i, v_j \in V\}$.  Associated with $G$ is a cost matrix $C$ where each element $c_{i,j}\in C$ is the cost measure associated with path $(v_i, v_j)\in E$. A Hamiltonian cycle is a closed tour that visits each city $v_i \in V$ once. A symmetric TSP is when $c_{i,j}=c_{j,i}$, otherwise it is an asymmetric TSP. The solution to the TSP is a Hamiltonian tour with the minimum cost $f_v$ (Equation~\ref{eqn:tsp_cost}).
\begin{equation}
\label{eqn:tsp_cost}
  f_v = c_{n,1} + \sum_{i=1}^{n-1}c_{i,i+1}, {\rm where\ }n={\rm number\ of\
cities}
\end{equation}

\subsection{Aircraft Landing Scheduling Problem}

The ALSP is the problem of deciding a landing time for a set of aircrafts $P$ such that the total penalty cost $f_p$ for landing earlier or later than a target time is minimized. Given, for each aircraft $p_i\in P$ are:
\begin{enumerate}
  \item the earliest landing time $e_i$;
  \item the latest landing time $l_i$;
  \item the target landing time $t_i$;
  \item the penalty cost per unit time, $g_i$, for landing before $t_i$;
  \item the penalty cost per unit time, $h_i$, for landing after $t_i$;
  \item the required separation time between $p_i$ landing and $p_j$ landing $s_{ij}$ (where $p_i$ lands before $p_j$ and $p_j\in P$);
  \item the unknown landing time $x_i$; and
  \item a dependency variable $\delta_{ij}$, where $\delta_{ij}=1$ if $p_i$ lands before $p_j$ and 0 otherwise.
\end{enumerate}
The ALSP is formally defined in the mathematical programming formulation~\cite{beasley00,beasley04} shown in Equation~\ref{eqn:alsp}.
\begin{equation}
\label{eqn:alsp}
  \left.\begin{array}{rl}
  f_p= & \sum^{|P|}_{i=1}\{g_i \max(0,t_i-x_i) + h_i \max(0,x_i-t_i)\}\\
  {\rm s.t.} & \delta_{ij}+\delta_{ji} = 1, j>i; i,j=1,\dots,|P|\\
      & x_j \geq x_i+s_{ij}\delta_{ij}-(l_i-e_i)\delta_{ij}, i = j; i,j=1,\dots,|P|\\
      & e_i \leq x_i \leq l_i, i=1,\dots,|P|.
  \end{array}\right.
\end{equation}

\subsection{Artificial Chemical Reactor}

The artificial chemical reactor (ACR) is defined by a triple $ACR(M, R, A)$. $M$ is a set of artificial molecules, $R$ is a set of reaction rules describing the interaction among molecules, and $A$ is an algorithm driving the reactor. In this paper, the molecules in $M$ are DNA sequences, Hamiltonian tours, or aircraft landing schedules. The rules in $R$ are reordering algorithms that create new molecules when two molecules collide. The algorithm $A$ describes how the rules are applied to a vessel of artificial molecules simulating a well-stirred, topology-less reactor. $A$ partitions the reactor into different levels of reaction activities. The level of reaction activity is a function of molecular mass.

The RH strings $w_i \in \Sigma^*$ ($\forall i=1,\dots,|\Sigma^*|$), the set of all permutations $\Pi(V)$ of the $|V|$ cities in $V$) of the TSP, and the set of all permutations $\Pi(P)$ of the $|P|$ aircrafts in $P$ in the ALSP were considered as molecules. A string $w_i$ encodes a DNA sequence that solves the RH mapping problem, a permutation $\pi_V$ encodes a Hamiltonian cycle that solves the TSP, and a permutation $\pi_P$ encodes a landing schedule that solves the ALSP. The width $|w_i|$ of $w_i$, the cost $f_v$ (Equation~\ref{eqn:tsp_cost}) of traversing a specific $\pi_V$, and the cost $f_p$ (Equation~\ref{eqn:alsp}) of scheduling a specific $\pi_P$ were considered as molecular mass.

If two molecules $m_1$ and $m_2$ collide and they encode solutions to the same problem, they react following a zero-order catalytic reactions of the form $$m_1 + m_2 + C \longrightarrow m_3 + m_4,$$ where $m_i$ are molecules ($\forall i=1,\dots,4$) and $C$ is a catalyst. The reaction can be mathematically thought of as a function $$R_1: M\times M \longrightarrow M\times M,$$ where $m_i\in M$. $R_1$ performs reordering of solutions as described by the following algorithm (let $n$ be the length of the DNA sequence in the RH mapping problem, or the number of cities in the TSP, or the number of aircrafts in the ALSP -- atom is taken as either a DNA base, a city, or an aircraft):

\begin{enumerate}
\item Let an integer $l\in[1,n]$ be the index of the $l$th atom in any molecule $m$. Let $i=1$.
\item Take a random integer between 1 and $n$ and assign it to $l$. Let $l^0=l$.
\item Taking the reactant $m_i$, locate the $l$th atom and move it as the $l$th atom for $m_{i+2}$.
\item Take note of the $l$th atom in $m_{i+2}$ and locate it in $m_i$. Replace $l$ with the value of the index of the atom in $m_i$.
\item Repeat steps~3 to~4 until the $l$th atom in $m_{i+2}$ is the same as the $l^0$th atom in $m_i$.
\item For all indeces $l$ with no atoms yet in $m_{i+2}$, move the $l$th atom from reactant $m_i$ as the $l$th atom in product $m_{i+2}$.
\item Repeat steps~2 to~6 for $i=2$.
\end{enumerate}

If two molecules $m_5$ and $m_6$  collide and they encode solutions to different problems, they react following a zero-order catalytic reaction of the form $$m_5+m_6\longrightarrow m_7+m_8.$$ The reaction follows a mathematical function $$R_2: M\times M\longrightarrow M\times M$$ and is described by the following algorithm:
\begin{enumerate}
\item Let $i=5$.
\item Take molecule $m_i$ and mark the point of collision as $l$.
\item Take the $l$th atom in $m_i$ and swap it with the $l+1$th atom in $m_i$. If $l=n$, swap the $l$th atom with the first atom, instead.
\item The resulting molecule is the product $m_{i+2}$
\item Repeat steps~2 to~4 for $i=6$.
\end{enumerate}

If a molecule $m_9$ hits the bottom or walls of the reactor, a zero-order catalytic reaction of the form $$m_9+C\longrightarrow m_{10}$$ happens. The reaction is a mathematical function $$R_3:M\longrightarrow M$$ described by the following algorithm:

\begin{enumerate}
\item Mark the point of collision in $m_9$ as $l$.
\item Take the $l$th atom in $m_9$ and swap it with the $l+k$th atom. With a
probability $>0.5$, assign $k=1$, else $k=-1$.
\item If $l=n$, swap the $l$th atom with the first atom instead (for $k=1$).
\item If $l=1$, swap the $l$th atom with the $n$th atom instead (for $k=-1$).
\end{enumerate}

The reactor algorithm $A$ operates on a universe of molecules $S=\{m_1,\dots,m_{|S|}\}, |S|<<|M|$. The development of $S$ is realized by applying the following algorithm:
\begin{enumerate}
\item Initialize $S$ with $|S|$ molecules selected randomly from $M$.
\item Using stochastic sampling with replacement, select two molecules $m_1$ and $m_2$ from $S$ without removing them.
\item Apply the reaction rule $R_1$ if $m_1$ and $m_2$ encode solutions to the same problem. Otherwise, apply $R_2$ instead to get the products $m_3$ and $m_4$.
\item Apply the reaction rule $R_3$ for heavy molecules that collide with the reactor walls and bottom.
\item Decay the heavier molecules by removing them out of $S$ and replacing them with randomly selected molecules from $M$.
\item Repeat steps~2 to~5 until $S$ is saturated with lighter molecules.
\end{enumerate}

One iteration of $A$ constitutes one epoch in the artificial reactor. The  sampling procedure gives molecules with low molecular mass a higher probability to react or collide with other molecules. This mimics the level of excitation energy the molecule needs to overcome for it to react with another molecule. This means that the lighter the molecule, the higher the chance that it will collide with other molecules. Step~6 of algorithm $A$ requires a metric for measuring saturation of molecules. In this study, when the number of molecules in that level of excitation has reached 90\% of the total molecules encoding the same problem, the ACR will stop applying the reaction rules for the same problem and will consider it solved while continuing the simulation for the remaining problems.

\section{Results and Discussion}

Using the same datasets and parameters from results on recently published papers on RH mapping~\cite{agarwala00}, TSP~\cite{gambardella96}, and ALSP~\cite{beasley04}, the ACR was run to solve the three problems in parallel. A single-processor Pentium IV machine with 1.2GHz bus speed running under a multiprogramming operating system was used to run the ACR simulations. The ACR simulation was repeated 10 times while each of the problem's metrics (i.e., the best minimum for each run) were recorded. The values recorded were averaged and the standard deviation computed. The results of the runs were compared to those of the recent literature. The comparison are summarized in tables.

\subsection{RH Mapping}

Tables~\ref{tab:gb4} and~\ref{tab:g3} show the average obligate chromosome breaks per marker for the GB4 and G3 RH panels, respectively, as found by RHMAPPER and CONCORDE (both reported by~\cite{agarwala00}) and ACR. The tables show the averages of 10 runs for each chromosome for ACR and the respective standard deviations. The tables show that the result found by ACR is not different from the results found by either RHMAPPER or CONCORDE.

\begin{table}[ht]
\caption{The average obligate chromosome breaks per marker for the GB4 panel as found by RHMAPPER, CONCORDE and ACR. The ACR values are averaged over 10 runs while the values in parenthesis are the respective standard deviation.}
\label{tab:gb4}
\begin{tabular}{cccc}
\hline\hline
Chromosome & RHMAPPER & CONCORDE & ACR \\
Number     &          &          & (std. dev.)\\
\hline
1 &	- &	1.66&	1.88 (0.20)\\
2 &	3.80&	2.12&	2.56 (0.64)\\
3 &	2.71&	1.97&	1.80 (0.85)\\
4 &	3.75&	2.15&	3.22 (0.55)\\
5 &	3.37&	1.99&	2.67 (0.38)\\
6 &	2.60&	1.70&	2.60 (0.80)\\
7 &	2.86&	1.92&	1.88 (0.90)\\
8 &	3.64&	2.09&	2.88 (0.47)\\
9 &	2.86&	1.85&	2.88 (0.99)\\
10&	3.55&	2.04&	1.99 (0.55)\\
11&	2.53&	1.86&	1.95 (0.64)\\
12&	3.87&	1.98&	3.27 (0.85)\\
13&	2.92&	2.01&	2.46 (0.85)\\
14&	2.43&	1.79&	2.15 (0.59)\\
15&	4.16&	2.25&	3.00 (0.88)\\
16&	3.18&	2.32&	2.74 (0.78)\\
17&	2.74&	2.03&	2.00 (0.67)\\
18&	3.07&	2.47&	2.20 (0.83)\\
19&	2.78&	1.99&	2.66 (0.74)\\
20&	2.41&	1.74&	2.50 (0.70)\\
21&	2.64&	2.19&	2.33 (0.41)\\
22&	2.87&	2.17&	2.33 (0.64)\\
23&	2.36&	1.70&	2.36 (0.66)\\
\hline\hline
\end{tabular}
\end{table}

\begin{table}[htb]
\caption{The average obligate chromosome breaks per marker for the G3 panel as found by RHMAPPER, CONCORDE and ACR. The ACR values are averaged over 10 runs while the values in parenthesis are the respective standard deviation.}
\label{tab:g3}
\begin{tabular}{cccc}
\hline\hline
Chromosome & RHMAPPER & CONCORDE & ACR \\
Number     &          &          & (std. dev.)\\
\hline
1 &	-&	2.91&	2.88 (0.06)\\
2 &	4.96&	2.88&	2.92 (0.02)\\
3 &	5.18&	3.13&	2.10 (0.03)\\
4 &	5.52&	2.96&	4.21 (0.47)\\
5 &	5.17&	3.09&	3.52 (0.98)\\
6 &	4.76&	3.11&	2.66 (0.01)\\
7 &	5.91&	3.69&	2.25 (0.65)\\
8 &	5.34&	3.09&	3.36 (0.22)\\
9 &	4.73&	3.16&	3.33 (0.55)\\
10&	5.35&	3.47&	2.81 (0.54)\\
11&	5.79&	3.24&	2.70 (0.06)\\
12&	5.31&	3.32&	3.60 (0.90)\\
13&	4.58&	3.17&	2.86 (0.69)\\
14&	4.04&	2.93&	2.81 (0.20)\\
15&	4.70&	3.76&	3.19 (0.50)\\
16&	5.04&	3.49&	2.75 (0.26)\\
17&	4.39&	3.69&	2.01 (0.32)\\
18&	6.10&	3.88&	2.49 (0.56)\\
19&	4.95&	3.23&	2.82 (0.10)\\
20&	4.87&	3.70&	3.15 (0.65)\\
21&	3.79&	3.36&	2.42 (0.32)\\
22&	4.21&	3.41&	3.31 (0.88)\\
23&	4.35&	2.80&	2.84 (0.47)\\
\hline\hline
\end{tabular}
\end{table}

\subsection{Symmetric and Asymmetric TSPs}

Table~\ref{tab:stsp} compares the average tour lengths found by ACR, simulated annealing, and self-organizing maps on five sets of random instances of symmetric 50--city TSPs. The table shows the average value of 10 runs for ACR and the respective standard deviation. Table~\ref{tab:atsp}, on the other hand, compares the best integer tour length found by ACR and genetic algorithm on four examples of asymmetric  instances of TSP. Based on the data presented in both tables, it can be seen that ACR's performance is similar to the performances of the other search techniques employed by other researchers.

\begin{table}[htb]
\caption{Comparison of average tour length found by ACR, simulated annealing (SA), and self-organizing maps (SOM) on five sets of random instances of symmetric 50--city TSPs. ACR values are averaged over 10 runs. The values in parenthesis are the standard deviation of the 10 runs for ACR.} \label{tab:stsp}
\centering
\begin{tabular}{cccc}
\hline\hline
Problem & ACR (std. dev.) & SA & SOM \\
\hline
1&	5.87 (0.33)&	5.88&	6.06\\
2&	6.15 (0.08)&	6.01&	6.25\\
3&	5.59 (0.21)&	5.65&	5.83\\
4&	5.67 (0.98)&	5.81&	5.87\\
5&	6.15 (0.54)&	6.33&	6.70\\
\hline\hline
\end{tabular}
\end{table}

\begin{table}[htb]
\caption{Comparison of the best integer tour length found by ACR and genetic algorithm (GA) on four examples of asymmetric instances of TSPs.}
\label{tab:atsp}
\centering
\begin{tabular}{ccc}
\hline\hline
Problem & ACR & GA\\
\hline
Oliver 30 &421	 &421\\
Ei150	  &424	 &428\\
Ei175	  &550	 &545\\
Krot100	  &21,280&21,761\\
\hline\hline
\end{tabular}
\end{table}

\subsection{Scheduling Aircraft Landings}

Table~\ref{tab:alsp} shows the performance of ACR as compared to the optimal solutions of eight instances of aircraft landing problems.  From the data presented, it can be seen that ACR was able to find near optimal solutions for six out of eight problems, and the exact solution for two out of eight problems.

\begin{table}[htb]
\caption{Comparison between the optimal cost of scheduling aircraft landings and those found by ACR on eight instances of ALSP.}
\label{tab:alsp}
\begin{tabular}{ccccc}
\hline\hline
Problem & Number of &	Number of & Optimal &	ACR \\
Number  & Aircrafts &  Runways    & Solution&         \\
\hline
1&	10&	1&	700&	721\\
2&	10&	2&	90&	94\\
3&	20&	1&	1,480&	1,463\\
4&	20&	2&	210&	220\\
5&	30&	1&	24,442&	24,536\\
6&	30&	2&	554&	554\\
7&	50&	1&	1,950&	2,001\\
8&	50&	2&	135&	135\\
\hline\hline
\end{tabular}
\end{table}

\section{Concluding Remarks}

An ACR that mimicked catalytic reactions was designed to simultaneously solve three unrelated problems. The catalytic reactions of the ACR were able to construct RH maps with similar qualities found by deterministic algorithms. In addition, ACR was found to be applicable in finding solutions to TSPs and ALSPs in parallel with RH mapping. Thus, ACR may be used to simultaneously solve hard problems such as the RH mapping, TSP, and ALSP.

The work described in this paper can be extended as follows. In order to assess its efficiency, additional experiments are needed with the ACR simulating more than three problems simultaneously. This experiment will answer the question: "Up to how many problems will the ACR be still efficient?" Using a single-processor machine, as the number of problems being solved simultaneously is increased, it is expected that the ACR will suffer considerably in terms of efficiency. Thus, further investigations on the use of multi-processor machines are needed to achieve better ACR performance.

\section{Acknowledgments}

The author thanks his collaborators, Prof. Elmer Rico E. Mojica and Prof. Jose Rene L. Micor of the Institute of Chemistry, College of Arts and Sciences, University of the Philippines Los Ba\~{n}os, for their valuable inputs about chemical systems. The author also appreciates the assistance of Dr. Custer C. Deocaris of the Philippine Nuclear Research Institute, Diliman, Quezon City in explaining and providing him the RH mapping problem.

\bibliographystyle{abbrv}

redpajama_set_name: RedPajamaArXiv


Be impressed with the amazing landscape of Myanmar with our 13-day Myanmar tour to reach the new destinations that reveal myriads of surprises. During 13 days, we take you throughout the most popular tourist attractions of the country to taste authentic Myanmar. From Yangon to Bagan, from Mandalay to Inle Lake, you will get a chance to marvel at the fabulous heritage sites to include the Shwedagon Pagoda, 2000 temples and old ruins, and the breathtaking boat trip etc. All are rolled into one to deliver you an unforgettable Myanmar vacation.
Mingalaba! Welcome to Myanmar – where to expect the unexpected. Upon arrival at Yangon international airport, meet your local Myanmar tour guide and move to the hotel for check-in. The rest of the day will excite you with the Thingyan Water Festival that you will witness exciting activities to help people to relax after a working hard year.
Today is a full day let you take a city tour around Yangon to discover an urban with colonial-infused influence on the architecture. Get a glimpse at the post office – a lovely red-brick building. Next, gaze out at Strand Hotel, Mahabandoola Garden, and Independence Monument as you passing through the street. Your next stop takes you to Chau Htat Kyi Pagoda where you can admire the 66 meters long reclining Buddha image. Your afternoon sightseeing continues after lunch with the stop in Karaweik Hall. In the sunset time, gain truly wonderful moment as you visit Shwedagon Pagoda, with the crown is tipped with 5448 diamonds and 2317 rubies, it is one of the most impressive and sacred religious sites in Myanmar.
Say goodbye to Yangon this morning to board a flight to Bagan – one of the world's largest archaeological sites. Flecked with more than 2000 temples, Bagan promises to give you a mind-blowing experience. Upon Bagan, start your full day sightseeing with the first stop in Nyaung U Market to get a glimpse at the daily life of the local people. Next, you are entering a local lacquerware workshop. Here you can get to know about the traditional methods to create lovely souvenirs. In the afternoon, soak up to the most magical moment of the day on the top of the hill, enjoy your sunset time then go back to the hotel in the late afternoon for overnight.
Whenever you experience a village tour in Bagan, you are going to soak up the exotic local lifestyle of the villagers in the tranquil rural area. Among the popular ways to explore a new land that you may experience before, a Pony cart ride in Bagan will truly blow your mind along the dusty paths. In the afternoon, drive to the Irrawaddy River and cruise down to the Shwezigon Pagoda, sit on the sundeck and slowly impressed by the beautiful magic landscape.
If you are an adventure lover, don't miss your chance to get on a bike to cycle around the quaint temples, ruins, and the stop at the villages to greet the local along the way you pass.
Following your breakfast, this morning, head to the airport to take a domestic flight to Mandalay. Upon arrival, take a short break before join our amazing afternoon sightseeing. First, stop at the impressive Mahamuni Pagoda – one of the most popular sites for worshippers in Myanmar. Next, drive to the Golden Palace Monastery where remains the last survivor of the last royal dynasty in Myanmar. Continue your trip in Mandalay with a visit to Kuthodaw Pagoda where enshrine the largest Buddhist book in the world on 731 marble slabs. Fulfill your memorable trip as you head to the U Bein Bridge – the world's longest teak bridge where you can take the best photos of sunset time.
Today is free to let you explore Mandalay city and around. There is a great option for you today: embark on a private local boat trip cruise through the Irrawaddy to Mingun. Upon arrival, visit the Mingun Bell to marvel at the largest intact bronze bell in the world. From here you can take a stroll to the Mingun Paya – the unfinished pagoda which was intentionally built up as the biggest pagoda in the world. It was damaged by the natural disaster led to the abandon. Notwithstanding, the massive ruin still attracts many visitors all year round. Continue your trip in Hisnbyume Pagoda, an attractive white-washed temple built to follow the shape of Mount Meru. Then explore the traditional village nearby where you can see numerous beautiful item. Later, reward yourself after an exciting day in a coffee shop in the city and enjoy the ambiance.
Day 7 delivers you an amazing journey to Pyin Oo Lwin (Maymo) within 2-hour drive. Known as the one destination in Myanmar that you can forget the hot weather, the colorful landscape of Pyin Oo Lwin appears as you reach the town. Spend time to gaze out at the downtown colonial-era buildings and its central market to soak up the lively community. Afterward, head to National Kandawgyi Gardens – the beautiful botanical garden where you can enjoy the fresh cool air in the evergreen forest. Your stunning trip continues after the lunch as you transfer to Peik Chin Myaung Cave – a magnificent combination of a natural masterpiece and human man-made. Spend time to get a glimpse at the location before returning to Mandalay. A stop at the winemaking workshop along the way is always available for you.
This morning says goodbye to Mandalay to take a flight to Heho. Your first stopover today is Pindaya Cave to admire thousands of Buddha images. For a long time, the cave has served as an important pilgrimage site for worshippers in Myanmar. Afterward, visit the traditional villages where people make bamboo hats, pottery, handicraft, shan paper, and umbrella. From there you can drive to the Danu Village where you can learn about the process of making tea leaf salads and tea plantation. If luckily, you will also see pickled tea leaves. Later, transfer to Kalaw as you finish your visit.
Depart from your hotel at 8:00 am to ready for a full day trekking. Head to Baw Nin Khong village and begins your 2 days trek to Inle Lake. Enjoy a cozy lunch in the village and continue your trekking tour passing through the scenic route dotted with some plantations. Dinner will be served at the local village.
Today spend about 2 hours for your trekking tour to visit some school and monasteries. Reach the typical Danu, Taung Yoe tribe villages as you pass by the majestic waterfall where you will learn about the production of bamboo mattresses and handicrafts. Lunch will be served as you reach the Indein village. Later, go back to your hotel on a boat trip.
Be an early bird this morning to get on a private boat trip to explore the treasure on the largest freshwater lake in Myanmar. Your first stop today is Phaung Daw Oo Pagoda where is considered the holiest religious site in southern Shan State. During your wonderful boat trip, you will pass by the unique floating gardens, houses, and monasteries built on the lake. After visiting Nga Phe Kyaung Monastery, proceed to Nampan village to gaze out at the cheroot factory and canoe carving.
Toda is at leisure but we still give you an interesting option to join in an amazing cooking class lasts from 9:00 am to 1:00 pm with the surcharge is $30 for each person. Additionally, we also offer you will Indein option to embark on a boat trip and cruise to reach the charming Indein village and explore the long neck tribal women. Besides, you also have a chance to visit the Inpawkon village where is famous for the lotus weaving. Ultimately, the most iconic image of Inle Lake – leg-rowing fishermen who row with one leg wrapped around an oar will be extremely worth your trip to see. The surcharge fee is $45/person include guide and boat. After that, transfer to the Heho airport for a flight to Yangon. A great option for this evening: have a scrumptious buffet in Karaweik Hall with a cultural show ($25/person).
The final day in Yangon is free to allow you to wander around the street and have some drink at a coffee house of Yangon before your driver comes to pick you up to transfer to the airport where your holiday ends. Hope you have had a great vacation in Myanmar!
Personal and other expenses such as porterage, bar bills and laundry not stated in the itinerary.


If you want to donate for refugees, check out this article. Here your can find information on which things are needed at the moment and where you can deliver your donations to.
Where can I deliver my donations to?
It would be best if you deliver your donations directly to a living project for refugees close to you.
You can also deliver your donations to all our regional offices and to our 16 Volkshilfe-Shops.
When donation goods in our shops, please mention that these donations are for refugees.
You can also donate money for refugess.
With this money, the Volkshilfe Refugee care can buy things, which are badly needed.


> I am just starting, and will be collecting baseline data.
> kind of disruption, which is great.
> More as it happens.
>> Very interested in your project and research.
>> learners before the project started?
>> including the whole school if the results are positive.


text:
The legend that never was: Gilles Villeneuve - 40 years on
Written by Danny Jones Edited by Haneen Abbas
Credit: GP Library/Universal Images Group via Getty Images
Born in 1950, Gilles Villeneuve was from a humble background and started racing snowmobiles from an early age, before progressing to local and national events. Gilles got his F1 opportunity in 1977 and lied about his age, so he wouldn't be considered too old for the sport.
He debuted for McLaren at the British Grand Prix, in an older car, and still managed to split teammates Jochen Mass and James Hunt in qualifying. Although he finished in 11th, he was regarded highly ever from that moment, with the Times newspaper stating: "Anyone seeking a future World Champion need look no further than this quietly assured young man". Although a McLaren deal fell through, Gilles managed to strike a deal with Enzo Ferrari for the end of the 1977 season, and the entirety of 1978.
1978 was a difficult season initially for the Canadian, with consistently sub-par results, with only one points finish in the first 11 races. However, recognizing the Canadian's talent, Ferrari persisted, and it paid off. Villeneuve claimed victory at the circuit that now bears his name, and was retained for 1979, alongside Jody Scheckter.
Gilles Villeneuve scored his first F1 victory at home in Canada Credit: (John Mahler/Toronto Star via Getty Images)
But 1979 was the season that truly showed off his ability. Winning consecutive races in Kyalami and Long Beach, followed by a victory in the final race of the season in Watkins Glen. And Watkins Glen saw Villeneuve go 11 seconds faster than any other driver in a remarkable practice session. Teammate Jody Scheckter said: "I scared myself rigid that day. I thought I had to be quickest. Then I saw Gilles's time and — I still don't really understand how it was possible. Eleven seconds!" It showed the ability of this truly talented driver, a remarkable feat that could only be achieved by the very best, but that wouldn't even be the most iconic moment of his season.
The 1979 French Grand Prix. Arnoux and Villeneuve were in an intense battle for 2nd place. Villeneuve aggressively locked up at Turn 1 on the penultimate lap in an attempt to overtake and got through. Arnoux fought back through the next and final lap, and barged his way through at turn 1, banging wheels on their way through. Arnoux ran wide, and it was Villeneuve's turn to muscle his way through, with the two banging wheels again, before Arnoux darted back up the inside. 1 corner later, Villeneuve pushed his way back past, which he would hold until the chequered flag by 2 tenths.
Gilles Villeneuve in the 1979 Monaco Grand Prix, with his teammate Jody Scheckter in the background (Credit: Bernard Cahier/Getty Images)
1980 would be a lacklustre year, competing in a car that would finish 10th in the championship. But 1981, what would prove to be Gilles' last full season, would be just as memorable as 1979. A car that had incredible straight-line speed but had poor handling would always be difficult to muster. Despite these issues, Villeneuve won 2 races. Monaco, the twistiest and tightest of them all, and his most famous race win at the Spanish Grand Prix. Villeneuve held back 5 cars attacking him, who were all over the Ferrari due to its lack of downforce. Incredibly, a combination of the Ferrari's straight-line speed and Villeneuve's incredible defensive driving held the pack back, in the 2nd closest finish of all time. Designer Harvey Postlewaite stated: "To win those races, the 1981 GPs at Monaco and Jarama — on tight circuits — was quite out of this world. I know how bad that car was."
And, in possibly the most incredible moment of Gilles' whole career, he damaged his car in the 1981 Canadian Grand Prix. In the pouring rain, and with a dislodged front wing, Villeneuve drove most of the race with the front wing blocking his vision. When it fell off, and most downforce was lost, he incredibly finished in 3rd, miraculously avoiding disqualification, for one of the most epic drives of his entire career,
Gilles Villeneuve with Alain Prost in 1981 (Credit: Vittoriano Rastelli/CORBIS/Corbis via Getty Images)
However, it would be 1982 that would spell tragedy. The season started disappointingly, and climax hit at the San Marino Grand Prix. After the FOCA teams boycotted the race, only Renault would be in opposition to the Ferrari of Villeneuve and Pironi. Both Renaults retired during the race, and the Ferraris had the win under their belt but needed to save fuel, so planned to hold position. However, Pironi passed Villeneuve, before Villeneuve re-overtook Pironi, believing it was to give the fans some action. And on the last lap, Pironi aggressively overtook and cut off Villeneuve and took the win. Villeneuve was furious at Pironi and vowed to never speak to him again.
At the next race, the Belgian Grand Prix, still raging at Pironi, Villeneuve set off for qualifying. Pironi was 1 tenth up into the final run, and Villeneuve used his last set of tires specifically aiming to beat the Frenchman. On an in-lap, Villeneuve caught up to the much slower Jochen Mass, and in an unfortunate case of miscommunication, both drivers veered to the right. Villeneuve launched over the back of Mass at about 140 mph before disintegrating as it hit the ground. Villeneuve was launched out of the car and was found blue-faced against the catch fencing. Villeneuve was not breathing, yet still alive, but died due to a fatal neck fracture at 21:12 that evening.
Villeneuve moments before his final race (Credit: Bernard Cahier/Getty Images)
Tributes poured in for Villeneuve. Former teammate, Jody Scheckter stated: "I will miss Gilles for two reasons. First, he was the most genuine man I have ever known. Second, he was the fastest driver in the history of motor racing." Niki Lauda said: "He was the craziest devil I ever came across in Formula 1... The fact that, for all this, he was a sensitive and lovable character rather than an out-and-out hell-raiser made him such a unique human being"
Villeneuve had the Montreal track renamed in his name in 1982, with the track famously bearing the line 'Salut Gilles' next to the start-finish line. The Villeneuve chicane was implemented at Zolder to slow cars down into the high-speed section that Villeneuve would pass away at, and the number 27 is still used worldwide in memory of him.
Villeneuve's legacy lived on through his son Jacques, who won the F1 World Championship in 1997, and bore the number 27 for his Indianapolis 500 crown in 1995.
Jacques Villeneuve celebrating his 1997 championship win (Credit: Michael Cooper/Allsport)
Formula One is a sport of many 'ifs' and 'buts', but it can be said that if it weren't for Gilles Villeneuve's fatal accident during qualifying for the 1982 Belgian Grand Prix, he would be remembered as an F1 legend by all to this day, a driver with the capacity and capability for multiple world championships. His accident cut short a remarkable career, which displayed some of the most incredible driving the sport has ever seen, even by today's standards.
A driver who feared nothing, from driving with a front wing obscuring his vision in the pouring rain, to his 11-second advantage in a wet practice, to the iconic battle with Arnoux at Dijon 1979. These are just 3 of Gilles' moments that are remembered in Formula One folklore today. Gilles was a special driver, it was recognized by everyone up and down the paddock, a one-in-a-generation sort. But Gilles passed as a generational talent that never had the opportunity to equate this talent into titles, a sore loss for the F1 history books.
Enzo Ferrari said 'his death has deprived us of a great champion', a champion that was never to be. The fact that Villeneuve has received legendary status amongst F1 fans, and whose legacy is one of the most significant to this day, shows what a driver he was. A driver where statistics don't tell the whole story, but instead the memories of epic, but fearless and incredible driving.
Gilles will and never should be forgotten, and it is truly hard to summarise what his legacy is, but also what could have been if it weren't for that tragic day on the 8th of May 1982. It is hard to conclude what Gilles was like as a driver over a keyboard, so I will leave it in the words of Jody Scheckter to end this tribute: 'But he has not gone. The memory of what he has done, what he achieved, will always be there.'
Gilles Villeneuve: immortal (Credit: Hulton Archive/Getty Images)

redpajama_set_name: RedPajamaCommonCrawl


text:
The Baker Heart and Diabetes Institute is an independent, internationally-renowned medical research facility, with a history spanning more 90 years. The Institute's work extends from the laboratory to wide-scale community studies with a focus on diagnosis, prevention and treatment of diabetes and cardiovascular disease.
The comprehensive range of research undertaken to target these deadly diseases, combined with the flexibility and innovation to respond to changing health and community needs, is unique and sets the Baker Institute apart from other health and research Institutes.
Our research into sedentary behaviour is undertaken by our Physical Activity and Behavioural Epidemiology laboratories.
Learn more and download the Rise & Recharge app on the Rise & Recharge website.
Taking a stand against sitting
The Baker Heart and Diabetes Institute and Vodafone Foundation are taking action against prolonged sitting to create a healthier Australia.
The Baker Institute's research shows substantive links between sedentary behaviour and the risk of heart disease, type 2 diabetes, cancer and other diseases. This is quite alarming when you consider that the average Australian adult sits for about nine hours each day. The good news is you can reduce your risk just by getting out of your chair to move around more often, say every 30 minutes.
To help get you moving, the Baker Institute has received support from the Vodafone Foundation to fund and support the launch of Rise & Recharge — a free Smartphone app that is designed to help you stand up, move about and power up.
Visit the Vodafone Foundation website
facebook share twitter share


Unfortunately the page you requested does not exist.
You may have typed the web address incorrectly or you may have followed a hyperlink to a page that had been moved or deleted.
Please, return to the entrance page.


Podcast: TV Mum, Episode 3 – can Brendon convince Dianne to watch Mr Robot?
Welcome to TV Mum, a weekly podcast starring Brendon Green and his Mum, Dianne. Every week Brendon will try and get Dianne to remember the details of a TV show she's recently watched. The resulting discussion is a journey through Dianne's shaky memory and never ends up where you'd expect.
Our TV coverage comes to your eyes thanks to our amazing sponsors Lightbox. Click below to get a free 30 trial and start watching Mr Robot immediately. Like right now, yo.


Shown here in the A-B-A (road number 9628) configuration with Kadee couplers installed. DCC-powered and with scale wheels. The second photo is of Holt Apgar's model which he built from the older kit version of this engine. He applied Woodland Scenics dry transfer road numbers to number boards, windshield and partial side window glazing, diesel horns, and American Models working couplers.


text:
Орзега — река в России, протекает по Прионежскому району Карелии. Длина реки составляет 15 км.

Система водного объекта: Онежское озеро → Свирь → Ладожское озеро → Нева → Балтийское море.

Общие сведения
Исток — болота в выше озера Орзегского. Протекает через Орзегу, пересекает железную дорогу Санкт-Петербург — Мурманск. По берегам реки Орзеги расположены садовые товарищества.

Впадает в Деревянскую бухту Онежского озера.

Река слабо разветвленная, местами быстрая и порожистая, падение составляет 110.5 м. Протекает по лесистой заболоченной местности.

На нижнем участке имеет порогово-перекатные участки с галечно-валунным грунтом.

Ширина русла в среднем 6-7 м, местами 12 м, скорость течения — 0.30.9 м/с, средняя ширина водосбора составляет 4 км², средняя высота — 157 м. Глубина — 0,2-0,4 м, реже 0,5-0,7 м. Средний годовой расход воды от 0.015 до 1.70 м³/с.

Населена кумжей, усатым гольцом, гольяном, подкаменщиком, в меньшем количестве имеется обыкновенный хариус.
.

С 15 августа по 15 ноября каждого года рыболовство на реке запрещено для сохранения нерестом водных биологических ресурсов

Во время Великой Отечественной войны по устью Орзеги в сентябре 1941 г. проходила оборона г. Петрозаводска от финских войск

Река подвержена влиянию хозяйственной деятельности человека, в ней содержится в водах большое количество органических, биогенных и минеральных веществ.

Название происходит от по-вепсского Озра-йоги — «Ячменная река».

Данные водного реестра
По данным государственного водного реестра России относится к Балтийскому бассейновому округу,

водохозяйственный участок реки — бассейн Онежского озера без рек Шуя, Суна, Водла и Вытегра, речной подбассейн реки — Свирь (включая реки бассейна

Онежского озера). Относится к речному бассейну реки Нева (включая бассейны рек Онежского и Ладожского озера).

Код объекта в государственном водном реестре — 01040100612102000013941.

Примечания

Литература
 Ресурсы поверхностных вод СССР, Т.2., Карелия и Северо-Запад, ч.1 / под. ред. В. Е. Водогрецкого ; Главное управление гидрометеорологической службы при Совете Министров СССР, Северо-Западное упр. гидрометеоролог. службы, Гос. гидролог. ин-т. — Ленинград : Гидрометеоиздат, 1972. — 527 с.
 Гидрографические характеристики речных бассейнов Европейской территории СССР / Под редакцией кгн В. В. Куприянова ; Главное управление гидрометеорологической службы при Совете Министров СССР. Государственный гидрологический институт. — Ленинград : Гидрометеоиздат, 1971. — 99 с.

Реки, впадающие в Онежское озеро
Реки Прионежского района

redpajama_set_name: RedPajamaWikipedia


text:
Main » 2015 » April » 2 » Security Media Department Launches "Insta-Meylas" Initiative to Promote Communication with the Public
Security Media Department Launches "Insta-Meylas" Initiative to Promote Communication with the Public
Within a New Vision of "Instagram-MOIUAE"
ABU DHABI, United Arab Emirates - Saturday, March 28th 2015 [ME NewsWire]
The Security Media Department at the General Secretariat of the Office of H.H Deputy Prime Minister and Minister of Interior, represented by the Social Media Center, launched the "Insta-Meylas" initiative, inspired by the lifestyle of the Emirati community. By paying attention to the comments of the public and their interaction with the different topics posted by the center, "#insta_meylas" will become an interactive platform for understanding public opinion, within a fresh modern vision of the MoI's Instagram account (Instagram-moiuae).
The initiative, which avails of innovative creative approaches, aims at promoting the interactive relation with the public, within a modernized framework that caters to the needs and requirements of the young generation through the various MoI's social media channels using the hashtag #insta_meylas.
First Lieutenant Fatima Al Shehhi, Director of the Social Media Center at the Security Media Department, explained that the initiative is a part of the development plan of the center. She noted that the discussion panels between the followers of the ministry's social media channels and their distinguished feedback are an inspiration to the center's staff members and encourage their creativity.
She said: "Through the initiative, "#insta_meylas" will select a number of comments and interactions made by the public on previous posts, and use them to make a short film, in cooperation with the TV Branch at the Security Media Department, using cutting-edge technologies and the highest standards of artistic direction to achieve a unique film material."
First Lieutenant Al Shehhi added that the initiative has garnered significant attention and interaction since its introduction on the ministry's social media channels. Thousands of people have already communicated through the channels on Instagram, Facebook, Twitter, YouTube and Google+.
The MoI's Social Media Center includes channels on Instagram, Facebook, Twitter, YouTube and Google+, and covers the news of the MoI, as well as all the police general headquarters across the UAE, quickly and accurately. The center also posts awareness messages and initiatives and acquaints the public with the various services offered by the MoI. The center's staff members give top priority to interactions with the public and endeavor to promptly answer their queries 24/7.
The center boasts a wide base of followers, and has become a vital communication channel between the public and the ministry. It has also contributed to promoting security and social awareness through the different media materials that were widely acclaimed by all segments of the public.


Our firm acted as exclusive financial advisor to Apollo Education Group, Inc. in connection with its divestiture of IPD to Helix Education. IPD provides outsourced higher education services to colleges and universities with a particular focus on adult degree programs, including integrated marketing, enrollment, retention, online and offline degree program design, and other administrative services. Helix Education is a leading provider of student life cycle technologies and services.


Translation Internships at Federal Defenders of San Diego Inc.
The Translation Intern will work in a legal office environment translating a variety of documents to be submitted to the Court in criminal cases.
Independent study or course credit according to the specifications of each instructor or institution. Interns will learn about the responsibilities and operations of a legal office and will receive orientation on pursuing careers as court interpreters, translators, investigators, paralegals and/or attorneys. Academic credit is optional. This is an unpaid position.
A letter of evaluation and recommendation will be provided, based on performance and a 250-500 word essay on how cultural differences are revealed in translation from the perspective of any academic discipline of interest to the student, such as law, sociology, literature, linguistics or anthropology.
Federal Defenders of San Diego, Inc., is a private, non-profit corporation representing indigent persons accused of federal criminal offenses. Our close proximity to the U.S.-Mexico border has a strong influence on our caseload.
Our staff currently consists of over fifty trial attorneys and sixty support personnel, many of whom are bilingual and bicultural. Our attorneys are assisted by highly trained and dedicated investigators and interpreters.


text:
Q: Passing a textbox value from one form to another in windows application in windows application I have 2 forms: form1 containing a TextBox. I just want to use the value of the form1's textbox in form2, so in form2 I just create a object of form1 and try to access the value of textbox by writing the code:
form1 f1=new form1();
string value=f1.textbox1.text

...but the value is not coming.....please help me

A: Creating a new instance of Form1 will not work as it a new instance, not the one you were using.  As the comments above suggest, the best option would be to create a custom constructor for Form2 and accept the textbox value there.
public Form2(string form1TextBoxValue)
{
    this.ValueFromForm1 = form1TextBoxValue;
}

Therefore in Form1 you can use the value in Form2 when you instantiate it:
Form2 form2 = new Form2(this.textBox.Text);

Alternatively, you could pass the Form1 instance to Form2.  This way you can access all the Form1 values if needed.  This does mean that Form2 has a direct dependence on Form1 which should be avoided.
// In Form2
public Form2(Form form1Instance)
{
    this.Form1Instance = (Form1)form1Instance;
}

// In Form1
Form2 form2 = new Form2(this);

redpajama_set_name: RedPajamaStackExchange


text:
Samuel Rooke's Blog
What comes through, gets a review
Dead Like Me: Season 1 (2003)
Samuel Rooke / June 22, 2017
"Dead Like Me" is the first television show Bryan Fuller – who'd later showrun "Hannibal" and "American Gods", among other shows – showran. I'm so taken by his very specific and unique style in "Hannibal" and "American Gods", and I've heard there are running themes throughout most of his work, that I'm watching his earlier work to try and get a better handle on him as a sort of television auteur. Fuller had written on various "Star Trek" shows before "Dead Like Me", but "Dead Like Me" was the first show that was properly his, something he created and ran.
[This review won't spoil any story specifics beyond the pilot episode.]
He created and ran the show…for a while at least. Because before the season was even halfway done, he left the show because of "creative differences". He's described in interviews over the years how running the show was a constant battle, an endless series of compromises, something eternally diverging from his vision. In a 2015 interview with Esquire, he said "We simply did not have the ability to make the show in the way that I had imagined. So it was a little bit of bait and switch where it was like, 'Oh my gosh, let's do this great show,' and then actually, 'No, we're not going to do this show that you pitched and that you wanted to do. We are going to do a radically different version of the show.'".
Fuller's spoken quite a bit about some of the specific elements he lost the fight on portraying as he envisioned – the sexuality of certain characters, the budget, the amount and scale of the series' mythology and lore, specific philosophies on death he wanted to explore. But even those aspects of the series aside, there's so much of the show that just didn't work for me at all. The smug twee style, the excessive sarcasm of the protagonist, the endless pseudo-philosophical voiceovers, the repetitive procedural structure…I found it all so grating and unlikable. The show's mythology is trite and undercooked, and the fact they don't play with any death-related aesthetics anywhere besides the opening titles is ridiculous, such a waste.
There's interesting ideas at play here that shore up with Fuller's pet themes in later works, chiefly the relentless obsession with death. Fuller has said "I had gone to a lot of funerals as a child, so I was more than just a little death-obsessed". The rudderless protagonist, "very in touch with the post-college malaise of the twentysomething who didn't know where to go or what to do" also ties into Fuller's own life ("I was temping before I got the job at "Star Trek", and I really wanted to relate my experiences as a temp through a character…who was avoiding being alive and engaging in life") and parallels with similar characters of Fuller's in later shows (Shadow in "American Gods", Jaye in "Wonderfalls"). It's certainly interesting to mine the show for what it reveals about Fuller and the way he thinks and works. But on its own terms, it's not something I particularly enjoyed.
After Fuller departed the show (around episode four), there were changes. Some were gradual (the show doubling down on the twee comedy, moralising voiceovers, procedural structure), some were fast (making homosexual characters suddenly inexplicably hetrosexual, cast shake-ups). To my mind, the show was diluted but not improved. The only post-Fuller aspect of season one that really interested me was the surprisingly measured approach the eleventh episode had on suicide – it wasn't flat-out condemned, and the show attempted something of a thoughtful exploration of the issue. It wasn't brilliantly handled, but I was surprised and intrigued to see the show even attempt what it did.
There are some interesting indicators for Fuller's later works here, but for the most part it's a mess I did not enjoy. I give it one and a half post-it notes, and a banana bonanza.
June 22, 2017 in TV Reviews.
Wonderfalls (2004)
The Amazing Screw-On Head (2006)
Pushing Daisies: Season 1 (2007)
← A Christmas Party and a Wedding (1848) by Fyodor Dostoyevsky
Dead Like Me: Season 2 (2004) →
Comic Reviews (23)
Follow Samuel Rooke's Blog on WordPress.com