{% extends "layout.html" %} {% block page_title %} About - GOV.UK Prototype kit {% endblock %} {% block content %} You’ll need to switch to Universal Credit in March 2018 What you need to do to get ready Make sure you can get access to the internet, either at home or at a local library or friend’s house - Universal Credit is all done online. If you're not that confident using a computer or the internet, contact your local library to find out about courses to help improve your skills Set up an email account if you don’t have one already Set up a bank or building society account to make payments from. If you have a partner, you might want to set up a joint account with them as you’ll get 1 monthly payment between the two of you When you're working out your bills don’t forget your rent, including if you’re renting your home off a housing association that’s paid for by housing benefit. If you’d like extra help working out your budgets go to [online budgeting tool] Get yourself verified using GOV.UK/Verify. This will save you having to go to the job centre with your identification. What might change when you move to UC {% if (benefit_WTC or benefit_CTC) %} {% include "includes/responsibilities/1a.html" %} {% elif benefit_JSA %} {% include "includes/responsibilities/1b.html" %} {% elif benefit_ESA %} {% include "includes/responsibilities/1c.html" %} {% elif (benefit_IS or benefit_HB) %} {% include "includes/responsibilities/1d.html" %} {% endif %} {% if (benefit_WTC or benefit_CTC or benefit_HB) %} {% include "includes/responsibilities/2a.html" %} {% endif %} {% if benefit_JSA and not (benefit_WTC or benefit_CTC or benefit_ESA or benefit_HB or benefit_IS) %} {% include "includes/responsibilities/2b.html" %} {% endif %} {% if (benefit_ESA or benefit_IS) and not (benefit_WTC or benefit_CTC or benefit_HB)%} {% include "includes/responsibilities/2c.html" %} {% endif %} {% if benefit_WTC %} {% include "includes/responsibilities/3a.html" %} {% endif %} {% if benefit_CTC and not (benefit_WTC or benefit_JSA or benefit_ESA or benefit_HB or benefit_IS) %} {% include "includes/responsibilities/3b.html" %} {% endif %} {% if (benefit_JSA or benefit_ESA or benefit_IS) and not (benefit_WTC or benefit_CTC or benefit_HB) %} {% include "includes/responsibilities/3c.html" %} {% endif %} {% if benefit_HB %} {% include "includes/responsibilities/4a.html" %} {% endif %} {% if (benefit_WTC or benefit_CTC or benefit_JSA or benefit_ESA or benefit_IS or benefit_HB) %} {% include "includes/responsibilities/5a.html" %} {% endif %} {% if (benefit_WTC or benefit_CTC or benefit_ESA or benefit_IS or benefit_HB) and not benefit_JSA%} {% include "includes/responsibilities/6a.html" %} {% endif %} {% if benefit_JSA %} {% include "includes/responsibilities/6b.html" %} {% endif %} Hello {% endblock %}
Hello


Use templates only for lists
[ ]
[x]
Do you agree {{ option[filterKey] }} ?
Use different templates in lists and selected items
Agree With All
Agree with
, {{ op[filterKey] }} .
[ ]
[x]
Do you agree with {{ option[filterKey] }} ?
Use different templates for lists and selected items, and in some cases use built-in templates.
Agree With All
Agree with
, {{ op[filterKey] }}.


node-webworkers
is an experimental implementation of the Web Workers
API for
node.js.
var sys = require('sys');
var Worker = require('webworker').Worker;
var w = new Worker('foo.js');
w.onmessage = function(e) {
sys.debug('Received mesage: ' + sys.inspect(e));
w.terminate();
};
w.postMessage({ foo : 'bar' });
onmessage = function(e) {
postMessage({ test : 'this is a test' });
};
onclose = function() {
sys.debug('Worker shuttting down.');
};
Supported API methods are
postMessage(e)
in both workers and the parent; messages are in the
parent if this is invoked before the child is fully initialized
onmessage(e)
in both workers and the parent
onerror(e)
in both workers and the parent
terminate()
in the parent
In addition, some nonstandard APIs are provided
onclose()
in the worker (allows for graceful shutdown)
postMessage()
method takes an additional optional file descriptor parameter, which
will be sent with the message. This descriptor will be passed to
onmessage
handlers as an optional fd
field. Handlers receiving
messages posted without file descriptors will not see an fd
field.
Worker.onexit(code, signal)
in the master, which is invoked on the
master Worker
object when the worker process exits.
Worker
constructor takes an additional optional object argument,
opts
, which is used as a dictionary of options with the following keysargs
: A string or array of strings to pass to the node
executable
before the filename to invoke. This can be used to request that
the worker start up in debug mode (e.g. { 'args' :
'--debug-brk' }
).
This package requires node-msgpack.
Installation is done using make
on the install
target. The INSTALL_DIR
variable defines the directory to which JavaScript files will be installed and
defaults to /opt/local/share/node
.
For example, to install to /foo/bar
% sudo make install INSTALL_DIR=/foo/bar
install -m 755 -d /foo/bar
install -m 444 lib/webworker.js lib/webworker-utils.js \
lib/webworker-child.js /foo/bar
% find /foo/bar
/foo/bar
/foo/bar/webworker-child.js
/foo/bar/webworker-utils.js
/foo/bar/webworker.js


Cluster Dashboard
Workers
Jobs
Tasks
Master Logs
Copy To Clipboard
Schedule MapReduce
×
Schedule MapReduce
Binary
Input
Output [Optional]
Priority [Optional]
Default
1
2
3
4
5
6
7
8
9
10
Map Size [Optional]
×
Worker Logs
Worker ID
Copy To Clipboard


| tabs_as_spaces {fansi} | R Documentation |
Finds horizontal tab characters (0x09) in a string and replaces them with the spaces that produce the same horizontal offset.
tabs_as_spaces( x, tab.stops = getOption("fansi.tab.stops"), warn = getOption("fansi.warn"), ctl = "all" )
x |
character vector or object coercible to character; any tabs therein will be replaced. |
tab.stops |
integer(1:n) indicating position of tab stops to use when converting tabs to spaces. If there are more tabs in a line than defined tab stops the last tab stop is re-used. For the purposes of applying tab stops, each input line is considered a line and the character count begins from the beginning of the input line. |
warn |
TRUE (default) or FALSE, whether to warn when potentially
problematic Control Sequences are encountered. These could cause the
assumptions |
ctl |
character, which Control Sequences should be treated specially. See the "_ctl vs. _sgr" section for details.
|
Since we do not know of a reliable cross platform means of detecting tab stops you will need to provide them yourself if you are using anything outside of the standard tab stop every 8 characters that is the default.
character, x
with tabs replaced by spaces, with elements
possibly converted to UTF-8.
Non-ASCII strings are converted to and returned in UTF-8 encoding. The
ctl
parameter only affects which Control Sequences are considered zero
width. Tabs will always be converted to spaces, irrespective of the ctl
setting.
fansi for details on how Control Sequences are interpreted, particularly if you are getting unexpected results.
string <- '1\t12\t123\t1234\t12345678' tabs_as_spaces(string) writeLines( c( '-------|-------|-------|-------|-------|', tabs_as_spaces(string) ) ) writeLines( c( '-|--|--|--|--|--|--|--|--|--|--|', tabs_as_spaces(string, tab.stops=c(2, 3)) ) ) writeLines( c( '-|--|-------|-------|-------|', tabs_as_spaces(string, tab.stops=c(2, 3, 8)) ) )


resource_inventory.Rmd
Authors thank (Polish) National Science Centre for support through SONATA grant 2012/07/D/HS6/01971 for the project Dynamics of Competition and Collaboration in Science: Individual Strategies, Collaboration Networks, and Organizational Hierarchies (http://recon.icm.edu.pl).
This document lists inventory of academically-relevant resource types with codes, descriptions and sample quotes. In the next section each resource is documented with:
career_development
)The studies of scientific biographies also raise questions about breakthrough moments in scientific careers. Research on contemporary Polish science indicates that for many scientists it was exposure to international science. It was usually enabled by collaborators who helped them to get international scholarships, give access to some rare data or training or wrote a recommendation letter (Lazarowicz-Kowalik 2015).
I do a lot of things to make her my successor […]. I see her as someone, who can take it further, better. She is the youngest in the team and with no seniority but undoubtedly she has her wits gathered and she is the best based on merits.
We had the discussion in March and I had due date in May. [He said] You know what? I will send you the syllabus. We have a statistical module at out department and I am sending you information how you can start improving your knowledge. You can learn here for free so you will not have to pay there.
conceptualization
)Coming up with an idea for a study, providing general theoretical framework; designing a general framework for a study
We write equations together. I give him ideas.
He brings ideas. He has a lot of them and they are fascinating.
contacts_in_academia
)The role of social contacts surrounding in the production of knowledge has been underlined in vast literature (e.g. Collins (1974)) According to literature we can group contacts into two categories. Bellotti (2012)
If we want to use some equipment and he knows someone who has it, he recommends us. If he wants something, I recommend him as well so he can use it.
He promised at once to give me some names, emails, and phone numbers […] and I invited these people.
We collaborate internationally very intensively. We do visit to many places. We host people and these are really the top people in our field in the world. I think they would not get it at some other place.
data_analysis
)Data analysis, quantitative as well as qualitative
They provide me with data and I analyse it.
Sometimes I don’t have time to look at charts and so forth. I collect the ‘life’ data and ask my colleague to compute it and to check the results.
data_curation
)Managing and archiving data
She wanted me to manage the whole process from building a data set to analysing it.
I was looking for someone to get the files in order to digitalise them. The files have over 3 million records, 3 million card records so obviously she did not do it herself.
data_or_other_sources
)A large part of scientific work is organised around tangible resources such as data or documents (Latour and Woolgar 2013). The category consist of different types of data which can be used in scientific work: qualitative, quantitative, literature reviews.
It is appreciated to have an extensive collection of samples that could be used in experiments. I mentioned once during a conversation that I had a lot of samples, which could be utilized.
It was material of great value that I had access to and the aspects I learned about and investigated as well.
drafting
)The role of written forms of knowledge was summarized by Bazerman (1983). It is one of the most important activities in science (Popper 1972; Merton 1973).
If he brings something intellectual, I can’t see a reason why I should buy it and assume it is mine. Right? Only because I paid for it. So I added him as a co-author.
The things we prepared, the drafts… We sent them to him.
equipment
)Hagstrom (1964) and Knorr-Cetina (2009) indicated the crucial role of technology and scientific equipment in shaping scientific collaborations and scientific practices including centralisation of collaboration in some disciplines.
So I came here, because I was needed. There was a laboratory but there was no one, who could take it over and do this kind of research.
I don’t have access here to the equipment I use. I work in conditions like this, so I very much need it.
formal_administration
)Bureaucratic work is a result of managing complex scientific institutions.
She is our unit leader. She initiates many projects […]. She informs us about conferences and she encourages us to take part. She initiates research […]
Professor is our boss so all financial matters. She is the unite leader.
funding_acqusition
)The increasing role of ability to secure funding was underlined in many studies on contemporary science (Resnik 2006; Mirowski 2011).
It was my grant and I invited them. Now it is the other way round. They have a grant and I was invited.
I paid him something. He analysed things for me.
investigation
)Conducting research, gathering data
His input is significant. I cannot collect samples without him.
I usually ask for observations, which I handle myself later on.
knowledge_other
)Knowledge oriented help in research process but not falling into any of the above categories.
We talk, you know. Sometimes it is a brain storm. For example, if there is a call for abstract, we consult it. [I think] I don’t fit in here, because I have nothing to say in this area. At least I think so. [She says:] Oh, look! Do this and this. And I will focus on something else. We meet half way. Or when we host a conference […] I give her suggestions to analyse something. Maybe she would have interesting results. These are creative, inspiring meetings.
He is an older gentlemen with very broad knowledge about the field when it comes to methods, ideas […] one could address.
methodology
)Designing methodology for a study
I have all the optical measurements from them. […] We complement each other in research methods that are accessible in our institution. My team can do some microscopic measurements.
He gave me some tips when I was taking the measurements like what will match, how I could find something, how it will match. He also taught me one method.
motivation
)One of character traits, which does not affect collaboration directly but is of great importance in academic setting (Gatfield 2005).
I met him when I was finishing my master thesis. He encouraged me or motivated me to peruse academic career further.
I had a student from University A. She did her engineering diploma here. She is very gifted. During one conversation she asked what should she have done later on. I said that she could apply for Master’s degree and I would be her supervisor or she could try to go abroad and […] apply for PhDs degree.
non_academic_contacts
)The role of social contacts surrounding in the production of knowledge has been underlined in vast literature (e.g. Collins (1974)) According to literature we can group contacts into two categories. Powell and Owen-Smith (2012)
Thanks to her we have many contacts among practitioners.
She gives us mostly a lot of recognition in this environment and her name opens many doors. Thanks to her we found all those people, we would not have found otherwise. She was our bridge to this group.
other_charactersitics
)NA
I don’t know a lot about the issue but she said that she needed someone from the other side of the country to conduct the research in companies so the results could be compared.
It was funding for Polish-German partnership. I was looking for a partner from Germany. He is interested in these issues. Since he is one of the most recognised specializts in the field, I wrote to him asking if he would be interested in this funding.
other_input
)Many scientific collaborations have a unique character. As a result, some resources are very specific to the local background. To avoid excessive fragmentation of the coding scheme, we have decided to introduce a category that will encounter for the resources unique for particular resources across all interviews.
Our supervisor, PhD, deals with substantial things. He doesn’t tackle any technical issues of his students or some other collaborators. He just doesn’t do it. He has more important things to do. We do it instead.
I bring some fresh ideas. When one has a lot of experience, she expects some things not to work out. When you don’t know that it might not work out, you have this innocence, childlikeness.
prestige
)Bourdieu (1988) indicated that the symbolic power was the main driver for an accumulation of different goods in academia. Some collaboration might be attractive because they are seen as prestigious.
 He is well known scientist but older. He has some contacts and it helps in being pulled into the scientific world.
They have a few good papers with names of those people. It just increases your chances.
professional_achievements_formal
)Contemporary science has developed many forms of formal accountability, where achievements are measured according to designed indicators such as a list of publications.
At first I helped him. I gave him some contacts […] but at some point he did it by himself […] without my help, name and so forth.
He was aboard for long time so he also brings academic achievements.
When we apply for funding, he brings himself.
project_administration
)Administrative work over a project
He manages a project. I smile because one has to do some paper work.
We finished a project, where she was one of a leaders managing the project.
proofreading
)The role of written forms of knowledge was summarized by Bazerman (1983). It is one of the most important activities in science (Popper 1972; Merton 1973).
So with these books, my input is proofreading.
So he tells me what he can do, what I should do, what I should correct.
prototype_construction
)Building a prototype that is used in research process;
They are strong in design. […] in this project.
software_creation
)Writing software for research process;
He was a specializt in computer stuff. Yes? All things like that, software etc. I manged to do it myself when it was relatively easy. I’m rather a loner - the majority of my work I did alone. I started collaboration before habilitation and I invited him. It was the right choice as I’ve recently learned. We were invited to take part in an international contest.
He did the ‘programming machinery’. Thanks to that our system works.
supervision_in
)A master-student relation is the most traditional collaboration in academia. It has a significant impact on a career in academia (Wagner 2011; Zuckerman 1967).
I am a supervisor of Mr. A and Ms. B.
He is my PhD student. I met him when he was a student, and then he came to me.
traits_of_character
)Scientific collaboration like any other teamwork is affected by collaboration skills and traits of character of all parties engaged. The literature on individual traits of character and scientific collaboration is extremely limited except some research on the role of collaborative skills in academia-industry collaboration (Siegel et al. 2003). ‘Character traits’, which include different aspects of collaboration like being agreeable, reliable, or organized might be an important characteristic of a potential collaborator.
She is on the one hand very responsible, she works very well. On the other hand, her work is excellent on the basis of merits.
Professor is very communicative person. He is very friendly and his traits of character encourage collaboration.
Frequency distribution of types of resources. Counts correspond to number of times a particular resource appeared in entire corpus of the interviews.
| Resource | Frequency |
|---|---|
| Knowledge | 209 |
| Funding acquisition | 183 |
| Conceptualisation | 164 |
| Investigation | 155 |
| Other input | 117 |
| Contacts in academia | 114 |
| Data or other source materials | 91 |
| Data analysis | 81 |
| Traits of character | 73 |
| Proofreading | 70 |
| Supervision | 69 |
| Project administration | 65 |
| Drafting | 62 |
| Methodology | 50 |
| Equipment | 45 |
| Software creation | 41 |
| Prestige | 35 |
| Formal administration | 29 |
| Career development | 28 |
| Motivation | 28 |
| Contacts outside academia | 23 |
| Other characteristics | 10 |
| Formal professional achievements | 10 |
| Prototype construction | 6 |
| Data curation | 3 |
Bazerman, Charles. 1983. “Scientific Writing as a Social Act: A Review of the Literature of the Sociology of Science.” In New Essays in Technical and Scientific Communication: Research, Theory, Practice, edited by Miller Anderson Brockmann, 156–84. Baywood.
Bellotti, Elisa. 2012. “Getting Funded. Multi-Level Network of Physicists in Italy.” Social Networks 34 (2): 215–29.
Bourdieu, Pierre. 1988. Homo Academicus. Stanford University Press.
Collins, Harry M. 1974. “The Tea Set: Tacit Knowledge and Scientific Networks.” Social Studies of Science 4 (2): 165–85.
Gatfield, Terry. 2005. “An Investigation into Phd Supervisory Management Styles: Development of a Dynamic Conceptual Model and Its Managerial Implications.” Journal of Higher Education Policy and Management 27 (3): 311–25.
Hagstrom, Warren O. 1964. “Traditional and Modern Forms of Scientific Teamwork.” Administrative Science Quarterly, 241–63.
Knorr-Cetina, Karin. 2009. Epistemic Cultures: How the Sciences Make Knowledge. Harvard University Press.
Latour, Bruno, and Steve Woolgar. 2013. Laboratory Life: The Construction of Scientific Facts. Princeton University Press.
Lazarowicz-Kowalik, Marta. 2015. “Anatomia Sukcesu W Nauce. Studium Socjologiczne Laureatów Konkursów Fundacji na rzecz Nauki Polskiej.” PhD thesis, Warsaw: University of Warsaw.
Merton, Robert K. 1973. The Sociology of Science: Theoretical and Empirical Investigations. University of Chicago press.
Mirowski, Philip. 2011. Science-Mart. Harvard University Press.
Popper, Karl R. 1972. Objective Knowledge: An Evolutionary Approach. Clarendon Press Oxford.
Powell, Walter W, and Jason Owen-Smith. 2012. “An Open Elite: Arbiters, Catalysts, or Gatekeepers in the Dynamics of Industry Evolution?” In The Emergence of Organizations and Markets, edited by John F Padgett and Walter W Powell, 466–95. Princeton University Press.
Resnik, David B. 2006. The Price of Truth: How Money Affects the Norms of Science. Oxford University Press.
Siegel, Donald S, David A Waldman, Leanne E Atwater, and Albert N Link. 2003. “Commercial Knowledge Transfers from Universities to Firms: Improving the Effectiveness of University–Industry Collaboration.” The Journal of High Technology Management Research 14 (1): 111–33.
Wagner, Izabela. 2011. Becoming Transnational Professional: Kariery I Mobilność Polskich Elit Naukowych. Wydawnictwo Naukowe Scholar.
Zuckerman, Harriet. 1967. “Nobel Laureates in Science: Patterns of Productivity, Collaboration, and Authorship.” American Sociological Review 32 (3): 391–403.


This is the API documentation for 'mail-2.4.4 Documentation'.
[Validate]
Generated with the Darkfish Rdoc Generator 2.


Most radio and modem clocks used for a primary (stratum-1) NTP server utilize serial ports operating at speeds of 9600 baud or greater. The timing jitter contributed by the serial port hardware and software driver can accumulate to several milliseconds on a typical Unix workstation. In order to reduce these errors, a set of special line disciplines and stream modules can be configured in the Unix kernel. These routines intercept special characters or signals provided by the radio or modem clock and save a local timestamp for later processing.
The routines can be compiled in the kernel in older BSD-derived
systems, or installed as System V streams modules and either compiled in
the kernel or dynamically loaded when required. In either case, they
require minor changes in some kernel files and in the NTP daemon
xntpd
. The streams modules can be pushed and popped from
the streams stack using conventional System V streams program
primitives. Note that not all Unix kernels support line disciplines and
of those that do, not all support System V streams. The disciplines here
are known to work correctly with SunOS 4.x kernels, but have not been
tested for other kernels.
There are two line disciplines and a special streams module included
in the distribution. Support for each in xntpd
is enabled
by adding flags to the DEFS_LOCAL
line of the
xntpd
configuration file ./Config.local
. This
can be done automatically by the autoconfiguration build procedures, or
can be inserted/deleted after the process has completed.
tty_clk
timeval
format. Both
select()
and SIGIO
are supported by the
routine. The -DTTYCLK
flag is used to compile support for
this discipline in xntpd
. This flag is automatically
included if the clkdefs.h
file is found in the
/usr/include/sys
directory, or it can be added (or deleted)
manually. This module must be configured in the kernel during the kernel
build process, as described in the README
file in the
./kernel
directory.
tty_chu
-DCHUCLK
flag is used to
compile support for this discipline in xntpd
. This flag is
automatically included if the chudefs.h
file is found in
the /usr/include/sys
directory, or it can be added (or
deleted) manually. This module must be configured in the kernel during
the kernel build process, as described in the README
file
in the ./kernel
directory.
ppsclock
ppsclock
module captures a timestamp in Unix
timeval
format for later retrieval using a special
ioctl()
system call. The -DPPS
flag is used to
compile support for this module in xntpd
. This flag is
automatically included if the ppsclock.h
file is found in
the /sys/sys
directory, or it can be added (or deleted)
manually. This module must also be configured in the kernel during the
kernel build process, as described in the README
file in
the ./kernel
directory.
There are two versions of both the tty_clk
and
chu_clk
programs. The tty_clk.c
and
chu_clk.c
are designed for use with older BSD systems and
are compiled in the kernel. The tty_clk_STREAMS.c
and
chu_clk_STREAMS.c
are designed for use with System V
streams, in which case they can be either compiled in the kernel or
dynamically loaded. Since these programs are small, unobtrusive, and do
nothing unless specifically enabled by an application program, it
probably doesn't matter which version is chosen. Instructions on how to
configure and build a kernel supporting either or both of these line
disciplines is in the README
file in the
./kernel
directory.
tty_clk
Line DisciplineThe tty_clk line discipline defines a new ioctl()
,
CLK_SETSTR
, which takes a pointer to a string of no more
than 32 characters. Until the first CLK_SETSTR
is
performed, the discipline will simply pass through characters. Once it
is passed a string by CLK_SETSTR
, any character in that
string will be immediately followed by a timestamp in Unix
timeval
format. You can change the string whenever you want
by doing another CLK_SETSTR
. The character must be an
exact, 8 bit match. The character '\000' cannot, be used, as it is the
string terminator. Passing an empty string to CLK_SETSTR
turns off timestamping. Passing NULL
will produce undefined
results.
tty_chu
Line DisciplineThe tty_chu line discipline translates data received from the CHU
modem and returns chucode
structures, as defined in
chudefs.h, and expected by the Scratchbuilt CHU Receiver reference clock
driver. Depending on the settings of PEDANTIC
and
ANAL_RETENTIVE
used when compiling the kernel, some
checking of the data may or may not be necessary.
ppsclock
Stream ModuleThe ppsclock streams module implements an ioctl()
CIOGETEV
, which takes a pointer to the structure
struct ppsclockev { struct timeval tv; u_int serial; };
The ppsclock module is pushed on the streams stack of the serial port
connected to the PPS signal. The port must be configured for local
operation, rather than remote (modem) operation. At each positive-going
edge of the DCD signal, the routine latches the current local timestamp
and increments a counter. At each CIOGETEV ioctl()
call,
the current values of the timestamp and counter are returned in the
ppsclockev
structure.
On FreeBSD 2.2 and later systems the TIOCDCDTIMESTAMP ioctl is used to read the timestamp when the DCD serial go active. To use this the PPS signal must be tied to the serial port DCD signal through the appropriate level converters and pulse stretch circuitry if necessary. This enhances the accuracy of the driver to a few microseconds. Using FreeBSD 2.2 the measured delay between activation of the PPS signal and the time the timestamp is made on a 66MHz 486DX2 is 19us and on a 100MHz Pentium is 6us. The driver does NOT compensate for this.
The TIOCDCDTIMESTAMP timestamping ioctl() is used automatically on FreeBSD systems if available. It is integrated into the refclock_gtlin() function so any driver using it will benefit from the enhanced accuracy.


Provide a name for this input that can be presented in UI
This field is required
Enter the group this Submission Rule applies to


Companion Computers Setup¶
ODROID XU4 setup¶
List of components¶
- ODROID XU4.
- 16GB (or more) eMMc module.
- eMMC reader.
- Micro-SD reader.
- USB-UART Module Kit.
- WiFi Module 3 (2.4Ghz only) good for outdoor use, or WiFi Module 5 dual band 2.4/5Ghz good for high-bandwidth.
- DC plug cable - for onboard/portable power connection.
- Ethernet cable.
Setup Ubuntu¶
ODROID XU 4 supports both Ubuntu and Android, see the details on odroid page.
Here we will discuss how to setup Ubuntu 16.04LTS
Flashing Ubuntu image¶
You can use either an SD card or eMMC. eMMC is recommended as it is much faster than SD card, 16GB or more is recommended.
You can flash either full ubuntu image with GUI or minimal image. Minimal image will have much smaller size and faster boot and less overhead in general. Extract the downloaded image to obtain the .img
image. Then, use Etcher
to flash it to either SD or eMMC card. You can extract the /xz
image using
xz -d /path/to/image.img.xz
The previous images are bare images in the sense that you will have to install all required software in this tutorial yourself e.g. ROS, MAVORS, OpenCV, …etc.
If you want a ready image with most of the required software in this tutorial, you can find a minimal image (no GUI) for your eyes here.
Note
Until you setup a WiFi connection, you will need to use an ethernet cable to connect your odroid to internet.
User account setup¶
After a fresh Ubuntu installation, it is recommended to setup a user account for easier handling in the future. The Ubuntu full image (that you download from ODROID repo) already comes with an account called odroid with default password odroid. However, the minimal image (or sometimes called Ubuntu server) is just a bare bones image, and you will need to do a lot of configuration to get it ready.
In the minimal image, you can add a user account (call it odroid) using the following commands. You can do this by plugging a screen, keyboard/mouse, or through the console cable. If you use the console cable, login using the root account (user: root
, password: odroid
). Also make sure that your odroid is connected to the internet via ethernet cable.
adduser odroid
adduser odroid sudo
apt-get update
apt-get upgrade
If you use the minimal image above (that is already pre-configured), skip this step.
Also, add user to dialout
group to access serial ports
sudo adduser odroid dialout
where odroid
is the account/user name.
Network Setup¶
It is recommended that you use static IP address if you plan to use ODROID via a WiFi network. This will reduce latency over wifi.
to set static IP address on full Ubuntu using GUI, check this video.
Warning
You might need to reserve the IP on the router side
To set a static IP address on Ubuntu server (minimal image), do the following.
Open /etc/network/interfaces
file for editing.
nano /etc/network/interfaces
Add the following lines
auto wlan0
# the following will auto-start connection after boot
allow-hotplug wlan0
iface wlan0 inet static
address 192.168.0.xxx # choose a static IP, usually you change the last number only for different devices
netmask <IP_ADDRESS>
broadcast <IP_ADDRESS>
gateway <IP_ADDRESS> # your router IP
dns-nameservers <IP_ADDRESS>
wpa-ssid "wifi_name"
wpa-psk "wifi_password"
Note
You will need modify wlan0
to match the wifi card number on your odroid once the wifi device is connected. Is possible that it changes when you change the wifi device.
To check your wifi card number,
ifconfig -a
If you use the provided minimal image above (that is already pre-configured), but you will need to adjust the WiFi name and password to match your router access point that you use.
Installing packages¶
Install ROS¶
To install ROS on ODROID or ARM-based single-board-computer, follow the instructions that is mentioned on the ROS websites. We assume that ROS Kinetic is used.
Important
Install the ROS-Base: (Bare Bones) not the full desktop version
So, when you reach the step to install ROS using apt-get
, don’t execute
sudo apt-get install ros-kinetic-desktop-full
Instead, you execute,
sudo apt-get install ros-kinetic-ros-base
After installing ROS, you can install ROS packages that you need individually either by using apt-get
or from source.
Install MAVROS¶
This package is used to interface MAVLink-based autopilots to ROS.
We will simply follow the well documented wiki on MAVROS github page. For simplicity, use the binary installation which is enough for most of the use cases.
Install OpenCV¶
Apparently, there are different ways to install OpenCV depending on the OpenCV version and your Python version, if you want to use it with Python. There are plenty of tutorial to follow and you can choose the one that suits your requirements. Normal procedures for general Ubuntu can be used. Here, one way is mentioned to install certain opencv version from source. Use the following shell commands to install OpenCV,
### INSTALL OPENCV DEPENDENCIES ###
sudo apt-get install build-essential checkinstall cmake pkg-config yasm libtiff4-dev libjpeg-dev libjasper-dev libavcodec-dev libavformat-dev libswscale-dev libdc1394-22-dev libxine-dev libgstreamer0.10-dev libgstreamer-plugins-base0.10-dev libv4l-dev python-dev python-numpy libqt4-dev libgtk2.0-dev libavcodec-dev libavformat-dev libswscale-dev libtbb2 libtbb-dev
You can choose your suitable opencv version (check opencv website) and execute the following
### GET OPENCV SOURCE ###
cd ~
wget http://sourceforge.net/projects/opencvlibrary/files/opencv-unix/2.4.9/opencv-2.4.9.zip
unzip opencv-2.4.9.zip
rm opencv-2.4.9.zip
cd opencv-2.4.9
### BUILD AND INSTALL OPENCV ###
mkdir build
cd build
cmake -DCMAKE_BUILD_TYPE=RELEASE -DCMAKE_INSTALL_PREFIX=/usr/local -DWITH_OPENGL=ON -DWITH_V4L=ON -DWITH_TBB=ON -DBUILD_TBB=ON -DENABLE_VFPV3=ON -DENABLE_NEON=ON ..
make
sudo make install
Raspberry Pi Setup¶
Note
To be done.
Intel NUC setup¶
Note
To be done.


Classes | |
| struct | cMatrix3d |
| cMatrix3d represents a 3x3 matrix. Each cell of the matrix is composed of a double. This matrix class also provides as simple set of methods to handle floating point arithmetic operations. More... | |
| struct | cQuaternion |
| cQuaternion can be used to represents rotations in quaternion form. Simple floating point arithmetic operations are provided too. More... | |
| struct | cVector3d |
| This vector class provides storage for a 3 dimensional double precision floating point vector as well as simple floating point arithmetic operations. More... | |
| struct | cRay3d |
| cRay3d represents a 3D vector with an origin. More... | |
| struct | cSegment3d |
| cSegment3d represents a line segment with a start and an end. More... | |
Files | |
| file | CConstants.h |
Math | |
| file | CMaths.h |
Math | |
| file | CString.h |
Math |


Pinch your fingers together to press the corresponding key. Your left pinky is Key #1 and your right pinky is Key #8. The more you pretend you're a real player, the better the melody (and you!) will sound. This all happens inside your browser!
Remixed from @notwaldorf's Piano Genie with Handsfree.js.
See the source on Glitch.
Number of buttons:
Unfortunately, this browser does not support WebMIDI, which is only supported in Chrome and Opera.


My Google OR-tools / CP Solver page
Google Optimization Tools (Operations Research Tools developed at Google, a.k.a. Google CP Solver, a.k.a. Google or-tools) consists of support for constraint programming and LP/MIP.
Project group: or-tools-discuss
The solver is available via Git: https://github.com/google/or-tools. Please see Installing OR-Tools on how to install, required libraries etc.
Examples (Git repository). Many of my models are placed here as well (except for the C++ examples).
References
See Google Operations Research C++ Reference .
See below for my Python models using the new CP-SAT solver.
See below for my Python models using the old CP solver.
See below for my Java models.
See below for my LP/MIP models.
See further below for my C# models.
All these models are available from my GitHub repo github.com/hakank/hakank/tree/master/google_or_tools as well.
My OR-tools / Python models for the new CP-SAT solver
Here are my Python models for OR-tools CP-SAT solver. Most are ports from my old OR-tools CP solver models adjusted for the CP-SAT solver; they has the same filename with "_sat" added.
Many of these models imports cp_sat_utils.py which includes the following utilities / constraints (decompositions):
-
SimpleSolutionPrinter
-
SimpleSolutionPrinter2
-
ListPrinter
-
SimpleSolutionCounter
-
count_vars(model, x, val, c)
-
atmost(model, val, x, n)
-
atleast(model, val, x, n)
-
exactly(model, val, x, n)
-
increasing(model, x)
-
increasing_strict(model, x)
-
decreasing(model, x)
-
decreasing_strict(model, x)
-
alldifferent_except_0(model, a)
-
reif(model, expr)
-
reif2(model, expr, not_expr)
-
flatten(a)
-
array_values(model, x)
-
circuit(model, x)
-
scalar_product(model, x, y, s)
-
memberOf(model, x, val)
-
toNum(model, a, n, base=10)
-
my_cumulative(model, s, d, r, b)
-
prod(model, x, p)
-
knapsack(model, values, weights, n)
-
global_cardinality(model, x, domain, gcc)
-
regular_table(model, x, Q, S, d, q0, F)
-
regular_element(model,x, Q, S, d, q0, F)
-
no_overlap(model, s1, d1, s2, d2)
-
permutation3(model, from_a, perm_a, to_a)
Here are the models:
- 3_jugs_automaton_sat.py: 3 jugs problem using
AddAutomaton
constraint.
- 3_jugs_regular_sat.py: 3 jugs problem using
regular
constraint.
- 3sum_sat.py: 3SUM problem
- 50_puzzle_sat.py: 50 puzzle (Sam Loyd)
- 5x5_puzzle_sat.py: 5x5 puzzle (Martin Chlond)
- 2012_CMO_problem_sat.py: 2012 problem (from 2012 CMO)
- a_puzzle_sat.py: "A Puzzle", 8809=6,... (from God Plays Dice "A Puzzle"
- a_round_of_golf_sat.py: A round of golf problem (Dell Logic Puzzles)
- abbots_puzzle_sat.py: Abbot's puzzle (Dudeney)
- added_corner_sat.py: Added cordner puzzle
- age_changing_sat.py: Age changing puzzle (Enigma 1224)
- all_interval_sat.py: All interval problem (CSPLib problem #7)
- alldifferent_except_0_sat.py: Decomposition of global constraint
all_different_except_0
- alphametic_sat.py: General alphametic solver (i.e. problems like "SEND+MORE=MONEY")
- appointment_scheduling_sat.py: Appointment scheduling (matrix and 'set' approach)
- assignment_sat.py: Simple assignment problem
- atmost_test_sat.py: Tests of global constraints
atmost
, atleast
, and exactly
- broken_weights_sat.py: Broken weights puzzle
- bus_schedule_sat.py: Bus scheduling
- car_sat.py: Car sequencing (from Pascal Van Hentenryck "OPL Optimization Programming Language", page 184ff)
- circuit_sat.py: Decomposition of global constraint
circuit
- coins3_sat.py: Minimum mumber of coins that allows one to pay exactly any amount smaller than one Euro (from the ECLiPSe book)
- coins_grid_sat.py: Tony Hurlimann's coin grid problem
- coloring_cp_sat.py: Simple map coloring problem, CP version
- coloring_ip_sat.py: Simple map coloring problem, IP approach
- combinatorial_auction2_sat.py: Combinatorial auction
- contiguity_regular_sat.py: Decomposition of global constraint
global contiguity
(using regular
constraint)
- contiguity_automaton_sat.py: Decomposition of global constraint
global contiguity
using AddAutomaton
constraint
- costas_array_sat.py: Costas array problem
- covering_opl_sat.py: Set covering (OPL)
- crew_sat.py: Crew allocation problem
- crossword2_sat.py: Simple crossword problem
- crypta_sat.py: Crypta, alphametic problem (standard Prolog benchmark)
- crypto_sat.py: Crypto, alphametic problem (standard Prolog benchmark)
- curious_set_of_integers_sat.py: Curious set of integers (Martin Gardner)
- debruijn_binary_sat.py: "Arbitrary" de Bruijn sequences
- diet1_sat.py: Simple diet problem (optimization of a diet).
- discrete_tomography_sat.py: Discrete tomography
Data files:
- divisible_by_9_through_1_sat.py: Divisible by 9 through 1 for a "truncated" number. Includes a
modulo
decomposition.
- dudeney_sat.py: Dudeney numbers
- einav_puzzle_sat.py: Einav puzzle
- eq10_sat.py: Eq 10, standard benchmark problem
- eq20_sat.py: Eq 20, standard benchmark problem
- fill_a_pix_sat.py: Fill-a-pix problem.
Data files:
- furniture_moving_sat.py: Optimizing furniture moving (Marriott and Stuckey). Contains an experimental decomposition of the global constraint
cumulative
- furniture_moving_add_cumulative_sat.py: Optimizing furniture moving (Marriott and Stuckey). Using the built-in constraint
AddCumulative
- futoshiki_sat.py: Futoshiki puzzle (grid puzzle)
- generating_numbers_sat.py: Permutation set problem
- generating_numbers2_sat.py: Permutation set problem. Much faster than generating_numbers_sat.py:
- giant_cat_army_riddle_sat.py: Giant Cat Army riddle
- grocery_sat.py: Grocery problem
- hidato_sat.py: Hidato puzzle.
- just_forgotten_sat.py: Just forgotten puzzle (Enigma 1517)
- kakuro_sat.py: Kakuro puzzle
- kenken2_sat.py: KenKen puzzle
- killer_sudoku_sat.py: Killer Sudoku puzzle
- knapsack_cp_sat.py: Knapsack problem
- labeled_dice_sat.py: Labeled dice problem, from Jim Orlin's Colored letters, labeled dice: a logic puzzle (follow up: Update on Logic Puzzle)
- langford_sat.py: Langford's number problem (CSPlib problem 24)
- least_diff_sat.py: Least Diff problem (alphametic problem)
- lectures_sat.py: Lectures, schedule problem from Biggs "Discrete Mathematics"
- magic_square_mip_sat.py: Magic square problem (MIP approach)
- magic_square_sat.py: Magic square problem (CP approach)
- magic_square_and_cards_sat.py: Magic square and card problem (Martin Gardner)
- map_sat.py: Simple map coloring problem. Variant: map2_sat.py.
- marathon2_sat.py: Marathon puzzle (XPress example)
- max_flow_taha_sat.py: Maximum flow problem (Taha)
- max_flow_winston1_sat.py: Maximum flow problem (Winston)
- minesweeper_sat.py: Minesweeper
Data files:
- mr_smith_sat.py: Mr Smith problem, logic problem (from IF Prolog)
- nonogram_automaton_sat.py: Nonogram solver using
AddAutomaton
.
- nonogram_table_sat.py: Nonogram solver using a decomposition of global constraint
regular
(one using element
constraint and one using table
constraint). Note: It uses the module nonogram_utils_sat.py.
run_nonogram_sat.py compares the two solvers: nonogram_automaton_sat.py and nonogram_table_sat.py
Problem instances:
- nontransitive_dice_sat.py: Nontransitive dice
- nqueens_sat.py: N queens problem.
- number_lock_sat.py: Number lock problem (Crack the code) (MindYourDecisions)
- nurse_rostering_sat.py: Simple nurse rostering using global constraint (decomposition)
regular
- nurse_rostering_automaton_sat.py: Simple nurse rostering using the faster
AddAutomaton
- olympic_sat.py: Olympic puzzle (alphametic, standard Prolog benchmark)
- organize_day_sat.py: Organize a day, simple scheduling problem (from ECLiPSe)
- ormat_game_sat.py: Ormat Game
- p_median_sat.py: P-median problem (from OPL)
- pandigital_numbers_sat.py: Pandigital numbers in "any" base
- perfect_square_sequence_sat.py: Perfect square sequence
- permutation_symmetry_sat.py: Permutation symmetry breaking
- photo_problem_sat.py: Photo problem
- place_number_puzzle_sat.py: Place number puzzle
- post_office_problem2_sat.py: Post office problem (Winston)
- quasigroup_completion_sat.py: Quasigroup completion
Data files:
- regexp_sat.py: Generating all strings from a regular expressions
- regexp_automaton_sat.py: Generating all strings from a regular expressions, using
AddAutomaton
- regular_automaton_sat.py: Example of using
AddAutomaton
- regular_sat.py: Decomposition of global constraint
regular
constraint.
- rogo2_sat.py: Rogo grid puzzle solver
Problem instances:
- safe_cracking_sat.py: Safe cracking puzzle (from Oz primer)
- scheduling_speakers_sat.py: Scheduling speakers (Rina Dechter)
- secret_santa_sat.py: Secret santa problem
- secret_santa2_sat.py: Secret santa problem II (optimizing "santa distance")
- send_more_money_any_base_sat.py: SEND+MORE=MONEY in "any" base
- send_more_money_scalar_product_sat.py: SEND+MORE=MONEY using scalar products
- send_most_money_sat.py: SEND+MOST=MONEY (maximize MONEY)
- seseman_sat.py: Seseman Convent problem.
- set_covering_sat.py: Set covering, placing of firestations (Winston)
- set_covering2_sat.py: Set covering, number of security telephons on a campus (Taha)
- set_covering3_sat.py: Set covering, senators making a committe (Murty)
- set_covering4_sat.py: Set covering (and set partition), work scheduling (Lundgren, Roennqvist, Vaerbrand "Optimeringslaera")
- set_covering_deployment_sat.py: Set covering deployment
- set_covering_skiena_sat.py: Set covering problem (Steven Skiena)
- set_partition_sat.py: Set partition
- sicherman_dice_sat.py: Sicherman dice
- ski_assignment_sat.py: Ski assignment problem
- stable_marriage_sat.py: Stable Marriage problem (from Van Hentenryck's OPL book and some more problem instances)
- strimko2_sat.py: Strimko puzzle (Latin squares with "streams").
Some data files:
- subset_sum_sat.py: Subset sum problem (Katta G. Murty)
- sudoku_sat.py: Sudoku, checking over hundred instances of sizes 9x9, 16x16, and 25x25 (mostly from the Gecode collection). The instances are in sudoku_problems.py
- sudoku_17_hints_sat.py: Checks all 49151 Sudoku instances with 17 hints from Gordon Royle
- sudoku_mip_sat.py: Sudoku solver (MIP approach)
- survo_puzzle_sat.py: Survo puzzle
Data files:
- toNum_sat.py: Converts inter to/from an array of digits
- timpkin_sat.py: Mrs Timkpin's age problem (Dudeney)
- traffic_lights_sat.py: Traffic lights problem (CSPLib problem 16)
- tsp_circuit_sat.py: TSP problem using decomposition of the
circuit
constraint (and circuit_path
)
- tsp_circuit_add_circuit_sat.py: TSP problem using built-in constraint
AddCircuit
- volsay_sat.py: Volsay simple optimization problem. Alternative models: volsay2_sat.py, volsay3_sat.py
- who_killed_agatha_sat.py: Who killed agatha? (The Dreadsbury Mansion Murder Mystery, an automated reasoning problem)
- word_square_sat.py: Word square
- young_tableaux_sat.py: Young tableaux and partitions
- xkcd_sat.py: xkcd knapsack problem
My OR-tools / Python models for the old CP solver
Here are my Google CP Solver / Python models (OR-tools' old CP solver). All program files contains more information about the problem as well as references to other implementations of the same problem. The first blog posts about these models are A first look at Google CP Solver/Python (Google or-tools), Improvements of some Google CP Solver models, and Some new Google CP Solver/Python models.
Most of these model has now been ported to the newer CP-SAT solver, see above.
- 3_jugs_regular.py: 3 jugs problem using
regular
constraint. A variant: 3_jugs_regular2.py
- a_round_of_golf.py: A round of golf problem (Dell Logic Puzzles)
- all_interval.py: All interval problem (CSPLib problem #7)
- alldifferent_except_0.py: Decomposition of global constraint
all_different_except_0
- alphametic.py: General alphametic solver (i.e. problems like "SEND+MORE=MONEY")
- assignment.py: Simple assignment problem
- broken_weights.py: Broken weights puzzle
- bus_schedule.py: Bus scheduling
- car.py: Car sequencing (from Pascal Van Hentenryck "OPL Optimization Programming Language", page 184ff)
- circuit.py: Decomposition of global constraint
circuit
- coins3.py: Minimum mumber of coins that allows one to pay exactly any amount smaller than one Euro (from the ECLiPSe book)
- coins_grid.py: Tony Hurlimann's coin grid problem
- coloring_cp.py: Simple map coloring problem, CP version
- combinatorial_auction2.py: Combinatorial auction
- contiguity_regular.py: Decomposition of global constraint
global contiguity
(using regular
constraint)
- costas_array.py: Costas array problem
- covering_opl.py: Set covering (OPL)
- crew.py: Crew allocation problem
- crossword2.py: Simple crossword problem
- crypta.py: Crypta, alphametic problem (standard Prolog benchmark)
- crypto.py: Crypto, alphametic problem (standard Prolog benchmark)
- curious_set_of_integers.py: Curious set of integers (Martin Gardner)
- debruijn_binary.py: "Arbitrary" de Bruijn sequences
- diet1.py: Simple diet problem (optimization of a diet). Variant: diet1_b.py
- discrete_tomography.py: Discrete tomography
Data files:
- divisible_by_9_through_1.py: Divisible by 9 through 1 for a "truncated" number. Includes a
modulo
decomposition.
- einav_puzzle.py: Solving A programming puzzle from Einav. A (slightly) faster variant by Laurent Perron: einav_puzzle2.py
- eq10.py: Eq 10, standard benchmark problem
- eq20.py: Eq 20, standard benchmark problem
- fill_a_pix.py: Fill-a-pix problem.
Data files:
- furniture_moving.py: Optimizing furniture moving (Marriott and Stuckey). Contains an experimental decomposition of the global constraint
cumulative
- futoshiki.py: Futoshiki puzzle (grid puzzle)
- grocery.py: Grocery problem
- hidato.py: Hidato puzzle. However, hidato_laurent.py is Laurent Perron's much faster (and more elegant) version.
- just_forgotten.py: Just forgotten puzzle (Enigma 1517)
- kakuro.py: Kakuro puzzle
- kenken2.py: KenKen puzzle
- killer_sudoku.py: Killer Sudoku puzzle
- knapsack2.py: Simple knapsack problem
- labeled_dice.py: Labeled dice problem, from Jim Orlin's Colored letters, labeled dice: a logic puzzle (follow up: Update on Logic Puzzle)
- langford.py: Langford's number problem (CSPlib problem 24)
- least_diff.py: Least Diff problem (alphametic problem)
- lectures.py: Lectures, schedule problem from Biggs "Discrete Mathematics"
- magic_square.py: Magic square problem
- magic_square_and_cards.py: Magic square and card problem (Martin Gardner)
- map.py: Simple map coloring problem
- marathon2.py: Marathon puzzle (XPress example)
- max_flow_taha.py: Maximum flow problem (Taha)
- max_flow_winston1.py: Maximum flow problem (Winston)
- minesweeper.py: Minesweeper
Data files:
- mr_smith.py: Mr Smith problem, logic problem (from IF Prolog)
- nonogram_regular.py: Nonogram solver (using a decomposition of global constraint
regular
). Laurent Perron's improved version (uses table
in the regular
) nonogram_table.py, and later nonogram_table2.py
Problem instances:
- nqueens.py: N queens problem.
- nqueens2.py: N queens problem, faster version.
- nqueens3.py: N queens problem, faster than nqueens.py and nqueens2.py
- nontransitive_dice.py: Nontransitive dice
- nurse_rostering.py: Simple nurse rostering using global constraint (decomposition)
regular
- olympic.py: Olympic puzzle (alphametic, standard Prolog benchmark)
- organize_day.py: Organize a day, simple scheduling problem (from ECLiPSe)
- ormat_game.py: Ormat Game
- p_median.py: P-median problem (from OPL)
- pandigital_numbers.py: Pandigital numbers in "any" base
- perfect_square_sequence.py: Perfect square sequence
- photo_problem.py: Photo problem
- place_number_puzzle.py: Place number puzzle
- post_office_problem2.py: Post office problem (Winston)
- quasigroup_completion.py: Quasigroup completion
Data files:
- regexp.py: Generating all strings from a regular expressions
- regular.py: Decomposition of global constraint
regular
(experimental). Laurent Perron's improved version: regular_table.py, and later regular_table2.py
- rogo2.py: Rogo grid puzzle solver
Problem instances:
- safe_cracking.py: Safe cracking puzzle (from Oz primer)
- secret_santa.py: Secret santa problem
- secret_santa2.py: Secret santa problem II (optimizing "santa distance")
- send_more_money_any_base.py: SEND+MORE=MONEY in "any" base
- send_more_money_scalar_product.py: SEND+MORE=MONEY using scalar products
- send_most_money.py: SEND+MOST=MONEY (maximize MONEY)
- scheduling_speakers.py: Scheduling speakers (Rina Dechter)
- seseman.py: Seseman Convent problem. Variant: seseman_b.py
- set_covering.py: Set covering, placing of firestations (Winston)
- set_covering2.py: Set covering, number of security telephons on a campus (Taha)
- set_covering3.py: Set covering, senators making a committe (Murty)
- set_covering4.py: Set covering (and set partition), work scheduling (Lundgren, Roennqvist, Vaerbrand "Optimeringslaera")
- set_covering_deployment.py: Set covering deployment
- set_covering_skiena.py: Set covering problem (Steven Skiena)
- set_partition.py: Set partition
- sicherman_dice.py: Sicherman dice
- ski_assignment.py: Ski assignment problem
- stable_marriage.py: Stable Marriage problem (from Van Hentenryck's OPL book and some more problem instances)
- strimko2.py: Strimko puzzle (Latin squares with "streams").
Some data files:
- subset_sum.py: Subset sum problem (Katta G. Murty)
- sudoku_4x4.py: Sudoku, simple 4x4 problem
- survo_puzzle.py: Survo puzzle
Data files:
- toNum.py: Converts inter to/from an array of digits
- traffic_lights.py: Traffic lights problem (CSPLib problem 16)
- who_killed_agatha.py: Who killed agatha? (The Dreadsbury Mansion Murder Mystery, an automated reasoning problem)
- word_square.py: Word square
- young_tableaux.py: Young tableaux and partitions
- xkcd.py: xkcd knapsack problem
My Google CP Solver / Java models
2011-03-17: Google released a Java interface to the CP Solver, and I have just
started to implement models for this, which is basically a port of some Python models.
2011-03-29: Blogged about it in A first look at Google or-tools' Java interface
To simplify my life, all examples has been placed in the package com.google.ortools.constraintsolver.samples
. Some (if not all) models is also available at the Git repo .
- AllDifferentExcept0.java: A decomposition of the global constraint
alldifferent_except_0
- AllInterval.java: All interval problem (CSPLib #7)
- Circuit.java: A decomposition of the global constraint
circuit
- CoinsGrid.java: Tony Hurlimann's coin grid problem
- CoveringOpl.java: Set covering (OPL)
- Crossword.java: Simple crossword problem
- DeBruijn.java: "Arbitrary" de Bruijn sequences
- Diet.java: Simple diet optimization problem
- DivisibleBy9Through1.java: Divisible by 9 through 1 for a "truncated" number. Includes a
modulo
decomposition.
- LeastDiff.java: Least difference problem (minimize the difference of ABCDE-FGHIJ, where all digits A..J are different)
- MagicSquare.java: Magic Square
- Map.java: Simple map coloring problem
- Map2.java: Simple map coloring problem, alternative version
- Minesweeper.java: Minesweeper solver (uses the same data file as for the Python model minesweeper.py, see above)
- NQueens.java: n-queens problem
- NQueens2.java: n-queens problem, faster version
- QuasigroupCompletion.java: Quasigroup completion (uses the same data file as for the Python model quasigroup_completion.py, see above)
- SendMoreMoney.java: Solve SEND+MORE=MONEY
- SendMoreMoney2.java: Solve SEND+MORE=MONEY (5 different encodings).
- SendMostMoney.java: Solve SEND+MOST=MONEY, and show all solutions with maximal value of MONEY.
- Seseman.java: Seseman convent problem.
- SetCovering.java: Set covering, placing of firestations (Winston)
- SetCovering2.java: Set covering, number of security telephons on a campus (Taha)
- SetCovering3.java: Set covering, senators making a committe (Murty)
- SetCovering4.java: Set covering (and set partiton), work scheduling (Lundgren, Roennqvist, Vaerbrand "Optimeringslaera")
- SetCoveringDeployment.java: Set covering deployment
- StableMarriage.java: Stable Marriage problem (from Van Hentenryck's OPL book and more problem instances)
- Strimko2.java: Strimko puzzle (Latin squares with "streams").
- Sudoku.java: Sudoku
- SurvoPuzzle.java: Survo puzzle (uses the same data file as for the Python model survo_puzzle.py, see above)
- ToNum.java: Converts inter to/from an array of digits
- WhoKilledAgatha.java: Who killed agatha? (The Dreadsbury Mansion Murder Mystery, an automated reasoning problem)
- Xkcd.java: Xkcd knapsack problem.
- YoungTableaux.java: Young tableaux and partitions
My Google or-tools LP/MIP models in Python
2011-03-31: Blogged Google or-tools has released support for LP/IP
- 3_jugs_mip.py: 3 jugs problem, MIP version
- assignment6_mip.py: Assignment problem (from GLPK), MIP version
- blending.py: Blending problem (from OPL), MIP version
- coins_grid_mip.py: Tony Hurlimann's coin grid problem, MIP version
- coloring_ip.py: Simple map coloring problem, MIP version
- diet1_mip.py: Simple diet problem (optimization of a diet), MIP version
- game_theory_taha.py: Game theory, 2 person, zero-sum game. LP version
- knapsack_mip.py: Knapsack problem (from GLPK), MIP version
- least_square.py: Solving a fourth grade least square equation, LP version
- magic_square_mip.py: Magic square problem, MIP version
- production.py: Production planning problem, LP version (from OPL)
- stigler.py: Stigler's 1939 diet problem (from GLPK)
- sudoku_mip.py: Sudoku solver, MIP version
- volsay.py: Volsay LP problem (from OPL)
- volsay2.py: Volsay LP problem, using arrays (from OPL)
- volsay3.py: Volsay LP problem, with components (from OPL)
My OR-tools C# models (old CP system)
2012-02-05: Blogged about this in A first look at Google or-tools C# interface
Please note that I'm developing these programs in Mono (under Ubuntu Linux 11.10, 64-bit); they will hopefully also run on other .NET/Mono platforms. Quite a few are rather faitful ports from the Java versions, and some (but not that faithful ports) from the Python models.
Many (if not all) of these models has been pushed to the or-tools Git repo
For compiling and running these models using Mono, something like this should work:
$ export OR_TOOLS=../or-tools/svn/or-tools-read-only
$ export MONO_PATH=$MONO_PATH:$OR_TOOLS
$ mono-csc -lib:$OR_TOOLS /r:Google.OrTools.ConstraintSolver.dll model.cs
$ ./model.exe
- 3_jugs_regular.cs: 3 jugs problem using
regular
constraint.
- a_puzzle.cs: The "8809 = 6 ..." puzzle (See God plays dice: A puzzle)
- a_round_of_golf.cs: A round of golf problem (Dell Logic Puzzles)
- alldifferent_except_0.cs: Decomposition of global constraint
alldifferent_except_0
- all_interval.cs: All interval problem
- appointment_scheduling_set.cs: Appointment scheduling (set approach, random generating the problem instances ) (from the Stack Overflow question: Appointment scheduling algorithm (N people with N free-busy slots, constraint-satisfaction))
- assignment.cs: Simple assignment problem
- broken_weights.cs: Broken weights puzzle
- bus_schedule.cs: Bus scheduling (Taha)
- circuit.cs: Decomposition of global constraint
circuit
- circuit2.cs: Decomposition of global constraint
circuit
which also extracts the path.
- coins3.cs: Minimum mumber of coins that allows one to pay exactly any amount smaller than one Euro (from the ECLiPSe book)
- coins_grid.cs: Tony Hurlimann's coin grid problem
- combinatorial_auction2.cs: Combinatorial auction
- contiguity_regular.cs: Decomposition of global constraint
global contiguity
(using a decomposition of regular
constraint)
- contiguity_transition.cs: Decomposition of global constraint
global contiguity
(using the built-in TransitionConstraint
)
- costas_array.cs: Costas array problem
- covering_opl.cs: Set covering (OPL)
- crew.cs: Crew allocation problem
- crossword.cs: Simple crossword problem
- crypta.cs: Crypta, alphametic problem (standard Prolog benchmark)
- crypto.cs: Crypto, alphametic problem (standard Prolog benchmark)
- curious_set_of_integers.cs: Curious set of integers (Martin Gardner)
- debruijn.cs: Classical or "arbitrary" de Bruijn sequences (useful for generating all de Bruijn sequences)
- diet.cs: Simple diet (minimization) problem.
- discrete_tomography.cs: Discrete tomography
Data files (same as for Python)
- divisible_by_9_through_1.cs: Divisible by 9 through 1 for a "truncated" number. Also includes a decomposition of a
modulo
constraint.
- dudeney.cs: Dudeney Numbers
- einav_puzzle.cs: Solving A programming puzzle from Einav. (This is a port of Laurent Perron's optimized version: einav_puzzle2.py)
- fill_a_pix.cs: Fill-a-pix problem.
Data files (same as for Python above):
- furniture_moving.cs: Optimizing furniture moving (Marriott and Stuckey). Contains a decomposition of the global constraint
cumulative
.
- futoshiki.cs: Futoshiki puzzle (grid puzzle)
- golomb_ruler.cs: Golomb ruler
- grocery.cs: Grocery problem
- hidato_table.cs: Hidato puzzle (a port of Laurent Perron's Python model hidato_table.py, from the or-tools/Python distribution)
- just_forgotten.cs: Just forgotten puzzle (Enigma 1517)
- kakuro.cs: Kakuro puzzle
- kenken2.cs: KenKen puzzle
- killer_sudoku.cs: Killer Sudoku puzzle
- labeled_dice.cs: Labeled dice problem, from Jim Orlin's Colored letters, labeled dice: a logic puzzle (follow up: Update on Logic Puzzle)
- langford.cs: Langford's number problem (CSPlib problem 24)
- least_diff.cs: Least difference problem (minimize the difference of ABCDE-FGHIJ)
- lectures.cs: Lectures, schedule problem from Biggs "Discrete Mathematics"
- magic_sequence.cs: Magic sequence
- magic_square.cs: Magic squares problem
- magic_square_and_cards.cs: Magic square and card problem (Martin Gardner)
- map.cs: Simple map coloring.
- map2.cs: Simple map coloring. Alternative version using a matrix to represent the neighbours.
- marathon2.cs: Marathon puzzle (XPress example)
- max_flow_taha.cs: Maximum flow problem (Taha)
- max_flow_winston1.cs: Maximum flow problem (Winston)
- minesweeper.cs: Minesweeper
Data files (same as for Python and Java above)
- mr_smith.cs: Mr Smith problem, logic problem (from IF Prolog)
- nontransitive_dice.cs: Nontransitive dice
- nqueens.cs: N-queens problem.
- nurse_rostering_regular.cs: Simple nurse rostering using global constraint (decomposition)
regular
- nurse_rostering_transition.cs: Simple nurse rostering using global constraint (using the built-in
TransitionConstraint
)
- olympic.cs: Olympic puzzle (alphametic, standard Prolog benchmark)
- p_median.cs: P-median problem (from OPL)
- pandigital_numbers.cs: Pandigital numbers in "any" base
- partition.cs: Partition problem
- partition_into_subsets_of_equal_values.cs: Subset partitions (problem from the Stack Exchange Q: Partitioning set into subsets with respect to equality of sum among subsets).
- partition_into_subsets_of_equal_values2.cs: A variant which randomizes the problem instance.
- partition_into_subsets_of_equal_values3.cs: Pre-calculate the sum in each subset (
s.Sum() div num_subsets
)
- perfect_square_sequence.cs: Perfect square sequence
- photo_problem.cs: Photo problem (Mozart/Oz)
- picking_teams.cs: Picking teams where the objective is to minimize the difference of total strength of each team.
- picking_teams2.cs: Picking teams where the objective is to minimize the difference of total strength of each team. Additional: arbitrary number of teams and a more liberal handling of the number of team members (and the sum of team points).
- place_number_puzzle.cs: Place number puzzle
- post_office_problem2.cs: Post office problem (Winston)
- quasigroup_completion.cs: Quasigroup completion
Data files (same as for Python and Java above)
- regex.cs: Generating all strings from a regular expressions
- rogo2.cs: Rogo grid puzzle solver
Data files:
- scheduling_speakers.cs: Scheduling speakers (Rina Dechter)
- secret_santa.cs: Secret santa problem
- secret_santa2.cs: Secret santa problem II (optimizing "santa distance")
- send_more_money.cs: SEND+MORE=MONEY alphametic problem
- send_more_money2.cs: SEND+MORE=MONEY using scalar product
- send_most_money.cs: SEND+MOST=MONEY, where we maximize MONEY and then show all solution with MONEY maximized
- seseman.cs: Solving the Seseman convent problem
- set_covering.cs: Set covering, placing of firestations (Winston)
- set_covering2.cs: Set covering, number of security telephons on a campus (Taha)
- set_covering3.cs: Set covering, senators making a committe (Murty)
- set_covering4.cs: Set covering (and set partition), work scheduling (Lundgren, Roennqvist, Vaerbrand "Optimeringslaera")
- set_covering_deployment.cs: Set covering deployment
- set_covering_skiena.cs: Set covering problem (Steven Skiena)
- set_partition.cs: Set partition
- sicherman_dice.cs: Sicherman dice
- ski_assignment.cs: Ski assignment problem
- stable_marriage.cs: Stable Marriage problem (from Van Hentenryck's OPL book and some more problem instances)
- stable_marriage_random.cs: Stable Marriage problem, randomized problem instances (based on stable.marriage.cs)
- strimko2.cs: Strimko puzzle (Latin squares with "streams")
- subset_sum.cs: Subset sum problem (Katta G. Murty)
- sudoku.cs: Sudoku solver
- sudoku_4x4.cs: Sudoku solver (simple 4x4 problem)
- survo_puzzle.cs: Survo puzzle
Data files (same as for Python and Java above:
- to_num.cs: Channeling between a number and an array (useful for some alphametic problems)
- traffic_lights.cs: Traffic lights problem (CSPLib problem 16)
- volsay.cs: Volsay LP problem, LinearSolver (from OPL)
- volsay2.cs: Volsay LP problem, using arrays, LinearSolver (from OPL)
- volsay3.cs: Volsay LP problem, with components, LinearSolver (from OPL)
- wedding_optimal_chart.cs: Finding an optimal seating chart for a wedding (see Improbable Research: Finding an optimal seating chart for a wedding)
- who_killed_agatha.cs: Who killed agatha? (The Dreadsbury Mansion Murder Mystery, an automated reasoning problem)
- word_square.cs: Word square
- xkcd.cs: Solving the xkcd Knapsack problem
- young_tableaux.cs: Young tableaux and partitions
- zebra.cs: Zebra problem (Lewis Caroll)
Also, see my other pages about constraint programming systems:
* My Constraint Programming Blog, especially the Google CP Solver category
* Constraint Programming
* Common constraint programming problems
* My MiniZinc page
* My Zinc page
* My JaCoP page
* My JaCoP/Scala page
* My Choco page
* My Gecode/R page
* My Comet page
* My Gecode page
* My ECLiPSe page
* My Tailor/Essence' page
* My SICStus Prolog page
* My OscaR page
* My JSR-331 page
* My Numberjack page
* My AIMMS+CP page
* My B-Prolog page
* My Choco3 page
* My Picat page
* My z3/python page
* My SWI-Prolog page
Back to my homepage
Created by Hakan Kjellerstrand hakank@gmail.com


Lorem ipsum dolor sit amet consectetur adipisicing elit.
Hours
10 Am - 10 Pm
7 Days A Week
Lorem ipsum dolor sit amet consectetur adipisicing elit.
Hours
10 Am - 10 Pm
7 Days A Week
Lorem ipsum dolor sit amet consectetur adipisicing elit.
Hours
10 Am - 10 Pm
7 Days A Week
Lorem ipsum dolor sit amet consectetur adipisicing elit.
Hours
10 Am - 10 Pm
7 Days A Week
Lorem ipsum dolor sit amet consectetur adipisicing elit.
Hours
10 Am - 10 Pm
7 Days A Week
Our one-of-a-kind hand-crafted salmon cookie cutter designed by our 9 yr old daughter. We can proudly say our cookies are unique. We can't give away our recipe or the method to our madness.
Price $15.00


A global database of anchorage locations of various vessels provided by Global Fishing Watch has been utilized. Checkout the geospatial visualization of these anchorages, majorly ports in the ASEAN India region.
Fish smarter
Summer, winter, spring, and fall; we guarantee abundant catch for all! Our intelligent Fishing Spots Finder points you to the fishing spots within a 10km radius from your current GPS location.
Who's fishing
Our Fishing Activity Detector can be used to determine the country of origin, geartype and possibility of fishing in real-time. This intelligent module uses a Decision Tree Classifier for accurately predicting the geartype, and further using the AIS message features passed to a Dense Neural Network to predict if a vessel is fishing in a given area and at a given time.
Find everything about a vessel
Search a vessel by MMSI, and pull up its historical track in a spatio-temporal interactive map.
What's weird
A number of instances can be drawn from AIS messages where shipping vessels do not follow the path they are supposed to or shut down their AIS devices. Our Anomaly Detector studies the normal behavior of all the vessels and alerts about such anomalous behavior with the help of a Recurrent Neural Network
How's the weather
Explore the predictions of temperature, clouds, precipitation, wind speed and sea level pressure using the OpenWeather API.


Two Decades of Array Signal Processing Research
Multiple Emitter Location and Signal Parameter Estimation
ESPRIT-Estimation of Signal Parameters Via Rotational Invariance Techniques
Channel Parameter Estimation in Mobile Radio Environments Using the SAGE Algorithm
RIMAX – A Maximum Likelihood Framework for Parameter Estimation in Multidimensional Channel Sounding
A Compact, Lightweight Sensor to Measure Bearing Angle to a Radio Transmitter


Singles Chad'z rating: *** (out of 4 = good) 1992, PG-13, 100 minutes [1 hour, 40 minutes] [romantic comedy] starring: Campbell Scott (Steve), Kyra Sedgwick (Linda), Bridget Fonda (Janet), Matt Dillon (Cliff), produced by Cameron Crowe, Richard Hashimoto, written and directed by Cameron Crowe.
The problem with dating is that it can be great for some people, but torture for others. It's hard to meet someone that's both good looking and genuinely interesting, and "Singles" is a good, funny film that plays up the anxiety of this dilemma.
First there is Steve and Linda (Campbell, Sedgwick), who meet cute and are attracted to each other, but must go through the typical flirting games. The way this is shown is both typical and original: typical because scenes like these happen all the time, but original in the way it is portrayed here with the actual flirting games. You really believe these are two, actual people because they don't have perfect chemistry, but we can tell there's potential.
There are other characters with problems like Steve and Linda's, but the film does not become a gratuitous mess of whining and complaining, instead it's a funny, romantic, character study. Janet (Fonda) is a waitress who dates a struggling rock star named Cliff (Dillon). Their problem is commitment: Cliff doesn't want to commit to one woman, although Janet has essentially decided they are, in fact, a couple. She even goes as far to visit a plastic surgeon to get breast implants to save the relationship, but eventually realizes it's the little things that count. Cliff's not worth the trouble... or is he?
Although we don't get to know the characters as well as we could, it's hard not to care about them. Steve and Linda's relationship becomes quite rocky at times, but we still hope they'll stay together because we can sympathize with their conflicts. I'm sure this film will remind everyone of a relationship they had - you're not sure where it is going, who is the one afraid of commitment, or who is the problem. And thankfully, we don't get sappy apologies and predictable make-up scenes. There are no piss-off scenes or tear-jerkers, it treats a breakup in a more believable way than most movies of the sort.
The only problem I had was the fact the film seemed to have an identity crisis: Is it a commercial comedy, a serious romance, or an offbeat, light-hearted drama? Nevertheless, it is still interesting to watch because of its originality and sweet charm.
You could say "Singles" concludes with a happy ending, and it seems appropriate. Crowe has done what only a few mainstream filmmakers are able to do; tap into the mind of Generation X and portray their true feelings and emotions in a believable way.
Please visit Chad'z Movie Page @ http://members.aol.com/ChadPolenz E-mail<EMAIL_ADDRESS>(C)1997 Chad Polenz
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


{# (c) Crown Owned Copyright, 2016. Dstl. #} {% extends "layout.html" %} {% block page_title %} {% if organisation %} {{organisation.name}} – Organisations {% else %} Create organisation – Organisations {% endif %} {% endblock %} {% block grid_content %}
Sorry there were problems when adding the organisation, please see below for details.


Mono Support
Mono is an open source C#/.NET implementation (see http://go-mono.net).
XmlRpcCS works mono. Basically. The samples compile and run properly, and
were tested
inter machine etc.
Note, the
GoogleClient fails, it appears to be an issue on the Google side
coughing on Mono's XML (newlines vs cr nl?).
NUnit testing and documentation generation do not work yet.
Prerequisites to Build Mono
- Have Mono (version >= 0.23)
- have mcs and friends in your PATH
- Have make
To Build
In a command shell:
make all
Basic Test
Open two command shells, in one:
mono SammpleServer.exe
In the other:
mono SampleClient.exe
dotGnu Support
As of this writing dotGnu's .Net assemblies were not up to speed for running
XmlRpcCS. The web and XML classes were spotty. Interestingly thoguh the IL
generated by cscc works perfectly with mono assemblies and cscc is faster.


FacadeInterface
interface FacadeInterface
Allow to assist in getting relevant data on the current application state
Methods
Constructor
Return an Address a CouponManager can process
No description
Return an Customer a CouponManager can process
Return Checkout total price
Return Products total price CartTotalPrice = Checkout total - discount - postage
Return Product total tax price
Return the Checkout currency EUR|USD
Return Checkout total postage (only) price
Return the number of Products in the Cart
Return the number of Products include quantity in the Cart
Return all Coupon given during the Checkout
Find one Coupon in the database from its code
Return platform Container
Return platform TranslatorInterface
Return platform ParserInterface
Return the main currency THe one used to set prices in BackOffice
Return request
Return Condition Evaluator
Return all available currencies
Return the event dispatcher,
Add a coupon in session
Details
at line 38
__construct(
ContainerInterface $container)
Constructor
at line 45
Cart
getCart()
Return a Cart a CouponManager can process
at line 52
Address
getDeliveryAddress()
Return an Address a CouponManager can process
at line 57
Country
getDeliveryCountry()
at line 64
Customer
getCustomer()
Return an Customer a CouponManager can process
at line 71
float
getCheckoutTotalPrice()
Return Checkout total price
at line 80
float
getCartTotalPrice(
bool $withItemsInPromo = true)
Return Products total price CartTotalPrice = Checkout total - discount - postage
at line 88
float
getCartTotalTaxPrice(
bool $withItemsInPromo = true)
Return Product total tax price
at line 95
string
getCheckoutCurrency()
Return the Checkout currency EUR|USD
at line 102
float
getCheckoutPostagePrice()
Return Checkout total postage (only) price
at line 109
int
getNbArticlesInCart()
Return the number of Products in the Cart
at line 116
int
getNbArticlesInCartIncludeQuantity()
Return the number of Products include quantity in the Cart
at line 123
array
getCurrentCoupons()
Return all Coupon given during the Checkout
at line 132
Coupon
findOneCouponByCode(
string $code)
Find one Coupon in the database from its code
at line 139
Container
getContainer()
Return platform Container
at line 146
TranslatorInterface
getTranslator()
Return platform TranslatorInterface
at line 152
ParserInterface
getParser()
Return platform ParserInterface
at line 160
string
getMainCurrency()
Return the main currency THe one used to set prices in BackOffice
at line 167
Request
getRequest()
Return request
at line 174
ConditionEvaluator
getConditionEvaluator()
Return Condition Evaluator
at line 181
array
getAvailableCurrencies()
Return all available currencies
at line 188
EventDispatcher
getDispatcher()
Return the event dispatcher,
at line 196
mixed|void
pushCouponInSession($couponCode)
Add a coupon in session


dr seuss - Pinterest
I am teaching a JK/SK split ELKP class at St. Patrick School in .
http://pinterest.com/jackiefernholm/dr-seuss/
35 Miles from Center
red rose inn and restaurantPRE-READING Dr. Seuss
POWERPOINT PRESENTATION. Life of Dr. Seuss. What makes Dr. Seuss books unique? The Beginner Book Story series are books by different authors but are .
http://www.uen.org/Lessonplan/downloadFile.cgi?file=13251-6-20044-Dr__Seuss_Lesson_Plan_1_.pdf&filename=Dr__Seuss_Lesson_Plan_1_.pdf
Learning Language with the Doctor (Seuss, I mean!) Learning ...
The learner will use text from Dr. Seuss books to reinforce phonics . 49b3-b3f4 -6f33852af9c1&displaylang=en OR PowerPoint if you are working on a Mac. 4.
http://techtraining.dpsk12.org/ilt/DrSeuss/Dr_Seuss.pdf
Dr. Suess
Paper Hats - Inspired by The 500 Hats of Bartholomew Cubbins by Dr. Suess. 2 repins . Dr. Seuss thematic lesson ideas based on each book. 3 repins .
http://pinterest.com/sjww/dr-suess/
Dr. Seuss power point
Feb 21, 2011 . Dr. Seuss Based on the book, The Boy On Fairfield Street: How Ted Geisel Grew Up to Become Dr. Seuss by Kathleen Krull and illustrated by .
http://www.slideshare.net/e029855/dr-seuss-power-point-7001429
Dr Seuss
Dr Seuss. Photo of Linda McCardle Linda McCardle .
http://pinterest.com/lmccardle/dr-seuss/
Green Eggs And Ham Correct Ppt Presentation
Feb 27, 2008 . About Dr. Seuss Theodor Seuss Geisel was born 2 March 1904 in . his later books, but now guards his legacy as the president of Dr. Seuss .
http://www.authorstream.com/Presentation/Francisco-53026-Green-Eggs-Ham-correct-Dr-Seuss-and-Education-ppt-powerpoint
Dr. Seuss Presentation New
Feb 8, 2012 . to be included in a PowerPoint slide show about the information they learned about Dr. Seuss through the Web Quest. These books are similar .
http://www.tcea2012.org/2012/Custom/Handout/Speaker6498_Session1074_2.pdf
Technology Integration using Dr. Seuss
Technology Integration Using the Literary Works of Dr. Seuss. To view this PowerPoint go to my Drop box public folder the. website is: .
http://www.tceaconvention.org/2013/Custom/Handout/Speaker6498_Session2005_2.pptx
Price: $975
(866) 571-8737
The Amazing Dr. Seuss
Dr. Seuss was born on March 2, 1904 in the state of Massachusetts. . The first book he wrote for children was called And To Think That I Saw it on Mulberry .
http://jc-schools.net/tutorials/PPT/dr-seuss.ppt
Dr. Seuss Powerpoint
The first book Dr. Seuss wrote was called And to Think That I Saw it on Mulberry Street. . In 1941, Dr. Seuss took a break from writing books. He cared about .
http://www.keacd.org/files/cmsFile/file82.ppt
Price: $1,000
(877) 614-6455
Beds: 3, Baths: 2
north conway nh livingDr. Seuss trivia
In The Sleep Book, what did Dr. Seuss say was quite catching? A yawn. Who asks, Do you like green eggs and ham? Sam- I - Am. Who heard a Who? Horton .
http://man.leeschools.net/Web%20Docs/Seuss%20trivia%20clickable.ppt
Children's Literature arranged by Book Title - FREE Presentations in ...
Free Presentations in PowerPoint format . Scholastic Authors and Books . The Strange Case of Dr Jekyll and Mr Hyde by Robert Louis Stevenson · A Strong .
http://literature.pppst.com/indexA-Z.html
(866) 605-6558
at4all / Accessible Books PowerPoint
Accessible Books/PowerPoint. Dr. Suess, "I Can Read With My Eyes Shut!" said,. "The more you read, the more things you will know. The more that you learn, .
http://at4all.pbworks.com/w/page/6252026/Accessible%20Books%20PowerPoint
Dr. Seuss - RMTC
picture of Hop on Pop book. picture of seuss book. picture of .
http://rmtc.fsdb.k12.fl.us/content/seuss.html
Price: $470-$605
(770) 325-1592
Process
Mar 22, 2002. group or class. Read reviews for Dr. Seuss books by clicking below. . Produce part of a Power Point presentation as follows. Biographer: .
http://www.catawba.k12.nc.us/techtrac/plus/hildebran/process.htm
Happy Birthday, Dr. Seuss! - Region 2 Digital Library
Welcome to the wonderful world of Seuss! March 2 is Dr. Seuss' Birthday! Dr. Seuss is a famous childhood author! Let's explore some of. books before we read .
http://www.region2library.org/DATA/PPT%20Files/Literacy/seuss.ppt
sqworl | Dr. Seuss Resources
Resources, games, and lesson plans about Dr. Seuss and his works. . pppst. Pete's PowerPoint Station: Dr. Seuss Presentations and resources .
http://sqworl.com/m6l2d5
(404) 448-4970
Dr Seuss quotes and quotes by Dr Seuss - Page : 1
iWise has the most comprehensive repository of Dr Seuss quotes online. Utilize our cutting edge search engine to make Dr Seuss quotes and wisdom easily discoverable. . American writer and cartoonist, most widely known for his children's books written under his pen name, Dr. Seuss. . Download Dr Seuss Powerpoint .
http://www.iwise.com/Dr_Seuss
Theodor Seuss Geisel
by. Peter Edwards (Ludwig) and Kelly Spencer (Katja). Dr. Seuss. I like the nonsense, . Dr. Seuss's first published book was titled And to Think That I Saw It on .
http://faculty.ccri.edu/panaccione/In-classpresentations/Present.Fall06/TheodorSeussGeisel.ppt
Dr. Seuss Power Point
May 22, 2009 . Dr. Seuss Power Point Presentation Transcript. Dr. Seuss; The Cat in The Hat The book is the classic portrayal of the average child, Is about .
http://www.slideshare.net/Jordan.Eric/dr-seuss-power-point-1475636
(866) 572-3487
Dr Seuss English Camp (Elementary)
So I'm not doing a Dr. Seuss camp this winter, however I stumbled across these . Here is a worksheet, a mini-book, board game and a PPT.
http://www.waygook.org/index.php?topic=26680.0
10 Life Lessons From Dr. Suess
Jun 20, 2011 . 10 Life Lessons From Dr. Suess. . Owen's dr seuss slide show 107 views · Dr. Seuss power point 8778 views · Dr Seuss - Fantastic Children's .
http://www.slideshare.net/bright9977/10-life-lessons-from-dr-suess
Dr. Seuss The Lorax.pdf - Ebook Search & Free Ebook Downloads
ppt pptx pps. Ads. Download Dr Seuss The Lorax Pdf. Start Download Now . Dr. Seuss, list the names of the producers and consumers described in the book.
http://ebookbrowse.com/dr-seuss-the-lorax-pdf-d75803711
(404) 719-5798
TeachersFirst's Resources for Dr. Seuss
Whether you teach elementary readers or high school students, Dr. Seuss is a . create multi-media presentations such as a PowerPoint, or an online book, .
http://www.teachersfirst.com/spectopics/seuss.cfm
Sort By:
Dr. Seuss-Read Across America, Theme Unit, Lessons, Resources ...
http://www.thevirtualvine.com/drseuss.html Great Dr. Seuss Thematic Unit Don't miss it! http://www.seussdude.com/list-books.html List of All Dr. Seuss Books .
http://www.mrscjacksonsclass.com/drseuss.htm
Price: $1,295
(888) 531-6478
Beds: 4, Baths: 2
motorola imaging upload software criss angel mindfreak downloadsPPT "The Lorax Dr. Seuss Introduction Human activity requires ...
Nov 2, 2012 . The Lorax Dr. Seuss Introduction Human activity requires a steady . A free PowerPoint PPT presentation (displayed as a Flash slide show) on PowerShow. com. . for PowerPoint · Quiz Creator for PowerPoint · Related Books .
http://www.powershow.com/view/3b0551-ZmYwO/The_Lorax_Dr_Seuss_Introduction_Human_activity_requires_powerpoint_ppt_presentation
Price: $1,195
(866) 563-5024
Celebrating Dr. Seuss | Say What, Y'all?
Feb 26, 2012 . Day One: Dr. Seuss. Present Dr. Seuss Powerpoint . I know my sons really respond to the sing-song patterns in Dr. Seuss' books (some of his .
http://saywhatyall.wordpress.com/2012/02/26/celebrating-dr-seuss/
PPT "Dr Seuss poems PowerPoint presentation | free to download
Read Dr Seuss poems online A free PowerPoint PPT presentation (displayed as a Flash slide show) on PowerShow.com.
http://www.powershow.com/view/37e71a-OTQzY/Dr_Seuss_poems_powerpoint_ppt_presentation
Price: $1,400
(877) 721-3245
Green Eggs and ...Economics? | EconEdLink
Jan 19, 2012. of Dr. Seuss' most popular books: The Cat in the Hat; Green Eggs and . a visual aid (poster or Powerpoint); Reinforce their understanding of .
http://www.econedlink.org/e966
Dr Seuss - Download as PowerPoint
Aug 31, 2011 . The Revolutionary Dr. Seuss It's not how you start out that counts. . Oxford Children's book writer and political cartoonist Chief editorial .
http://www.docstoc.com/docs/92780423/Dr-Seuss---Download-as-PowerPoint
Price: $1,200
(866) 936-6163
Beds: 4, Baths: 3
purpose of user dat fileDr. Seuss - SlideShare
May 12, 2008 . This is a PowerPoint Michael made during our Dr. Seuss unit. . SOME OF Dr. Seuss's BOOKS By Michael March 2008; Onomatopoeia Here .
http://www.slideshare.net/tigermichael1211/dr-seuss
Dr. Seuss Feud: Seuss Themed Powerpoint Game - Not Just for ...
Just like the classic game show, Family Feud, this classroom powerpoint is sure to bring the fun and . "Name a Dr. Seuss book that was made into a movie.
http://www.teacherspayteachers.com/Product/Dr-Seuss-Feud-Seuss-Themed-Powerpoint-Game
(770) 783-3225
Dr. Seuss Glyph PowerPoint - TeacherSites
Jul 3, 2011 . Dr. Seuss Glyph PowerPoint - TeacherSites. Shared by: shuifanglj . Dr. Seuss Glyph Do you like Dr. Seuss? Yes No Color of the Hat Red and .
http://www.docstoc.com/docs/83536435/Dr-Seuss-Glyph-PowerPoint---TeacherSites
Dr. Seuss!
Fox In Sox with book pages included to read along with the story. by grandad28 . Ideas for each day to celebrate Dr. Seuss's birthday! 1 like 1 comment 2 repins .
http://pinterest.com/sasso10/dr-seuss/
Price: From $599
(678) 819-9388
Jacob's Dr Seuss Slide Show
Jun 6, 2012 . SUESS 428 views · Dr. Seuss power point 8696 views · Childrens . The Tooth Book by Erika 133 views · Dr Seuss Book Sets 160 views .
http://www.slideshare.net/jenniferhibbert/jacobs-dr-seuss-slide-show
Results per Page:
Dr. Seuss - Pinterest
Brittany is using Pinterest, an online pinboard to collect and .
http://pinterest.com/brittb23/dr-seuss/
dr seuss - Pinterest
I am teaching a JK/SK split ELKP class at St. Patrick School in .
http://pinterest.com/jackiefernholm/dr-seuss/
35 Miles from Center
red rose inn and restaurantYou can use this form to contact the manager of this property and check availability for your desired move-in date:
You can use this form to contact the manager of this property and request information about special incentives:
Fabulous Seuss Ideas
Repin Like Comment. Reader's Theater: Dr. Seuss read across America day? . 10 Facts About Dr. Seuss Books...insanely interesting! 2 likes 21 repins. visual.ly .
http://pinterest.com/ashleen/fabulous-seuss-ideas/
Dr. Seuss :)
I'm a First Grade Teacher, from Southern Illinois!! And these are .
http://pinterest.com/nharper09/dr-seuss/
Dr Seuss - SlideShare
May 8, 2010 . NOT JUST FOR KIDS Dr. Seuss. . Michelz 1598 views · Dr. Seuss power point 8633 views · com creative project-dr.seuss 755 views . Edsu 530 sdaie lesson 587 views · The Lorax: A Picture Book for the Content Areas 2891 .
http://www.slideshare.net/tcssjm/dr-seuss-4021027
Dr Seuss Plans
Dec 13, 2012 . Dr. Seuss power point 8778 views · 10 Stories Behind Dr. Seuss Stories . Reading List 620 views · Dr Seuss Book Sets 160 views · A Literary .
http://www.slideshare.net/eward511/dr-seuss-plans
Lucas's Dr Seuss Slide Show
Jun 7, 2012 . Lucas Dr Seuss 72 views · Jacob's Dr Seuss Slide Show 230 views · Liam's Dr . Dr. Seuss power point 8715 views · Dr Seuss Presentation 4289 views . SUESS 428 views · Salute To Seuss by Ben 743 views · Dr Seuss .
http://www.slideshare.net/jenniferhibbert/lucass-dr-seuss-slide-show


Swampy Boston
Find out if your Boston address is in former swamp lands!
This address is located on the original land that existed in Boston when it was founded in 1630.
The native people residing in what is now downtown Boston referred to this land area as Shawmut. During this time, Shawmut was an 800 acre peninsula that was connected to the mainland by a narrow strip of land called “The Neck”. Shawmut Peninsula had three large hills (that have since been flattened) and were called “Trimount”, a precursor to the name for Tremont street.
This address is on land that was filled in between 1630 and 1796.
By 1795, your address was no longer swamp. During this period, Boston was coming into its own as a
shipping center, so more land around the harbor was filled in to create docks and bridges.
When the English first landed in what is now Boston, the area around the future North Station was
just a
large, marshy cove called Mill Pond. Sometime after 1643, the cove’s ownership changed, and a large
dam
was built, allowing the entire cove to eventually be filled in. Later, the West Boston Bridge was
build
to connect the peninsula to Cambridge, in the same location as the current day Longfellow Bridge. In
1785, a similar bridge was built to connect Boston to Charlestown. By 1795, Boston was growing to be
more interconnected, allowing quick access to neighboring towns.
This address is on land that was filled in between 1795 and 1852.
By 1852, many areas of the greater Boston area were filled in. The prevailing medical theory at the
time was miasmatic theory of disease, which posited that disease was caused by foul odors. This
proved
to be a reason for filling in swampy areas of Boston that had started to smell wretchedly.
In 1807, due to public health concern over the stench of Mill Pond, the filling in of the pond
began.
Mill Pond was located in what is now known as the West End. The material for this came from Beacon
Hill,
resulting in Beacon Hill becoming 60 feet lower than it was before the city started tearing up the
land
to use for filling in. This land became an industrial area and land was eventually extended outwards
even more to make room for railroad depots.
South Cove (current day Chinatown) and Great Cove (current day Financial District) started to be
filled
in 1806 and continued into the 1840s.
Back Bay is another area that is the result fo extensive filling in. In 1822, a dam was constructed
in
the Back Bay area in order to power mills. This stopped the flow of water and caused areas of land
to
start appearing soon after, including what is now the Boston Public Garden and the area south of the
garden called Bay Village. The area was described as “bubbling like a cauldron with the noxious
gases
that are exploding from the corrupting mass below” and residents pushed to get this area filled in.
Once
again, the stench of sewage became the cause for filling in an area of Boston. By 1850, the landfill
of
Back Bay was approved.
This address is on land that was filled in between 1852 and 1880.
By 1880, the area currently known as
Back Bay was almost fully filled in, with the exception of the
Esplanade. The filling of Back Bay started in 1857 and was completed in 1882. The act of filling in
Back
Bay nearly doubled the size of the Boston peninsula. The land was filled in using gravel imported
from
Needham, rubble from the Great Fire of 1872, mud and trash.
The filling of Charlestown occurred between 1860 and 1896, turning the land from a peninsula into
mostly
connected to the mainland of Everett.
Part of downtown Boston and the South Bay Area started to be filled in during the 1850’s.
This address is on land that was filled in between 1880 and 1916.
By 1890, the Charles River landfill reached Kenmore Square, which used to be the west end of the
Back
Bay Milll pond.
The filling of the Back Bay Fens was complete in 1900. This area had been a tidal flat of the
Charles
River but was filled in after becoming malodorous from sewage from nearby settlements. The famous
landscape architect Fredrick Law Olmsted worked on turning the Fens area from a smelly swamp into a
hygienic park with some of the marsh preserved for ecological purposes. He designed the area to be
fleshed by the tides twice a day, but in 1910 a dam was built to close the area to ocean tides and
form
a freshwater lagoon where storm water from the Charles River Basin flowed into.
By the late 19th century, the salt marshes of East Cambridge were filled in, allowing East Cambridge
to
join with Old Cambridge and Cambridgeport. Evidence that East Cambridge sits atop filled land can be
seen in the street patterns of the area. The street grid of this area (south of Charles Street and
west
of Sixth Street) is far more open than the original land above it.
In 1916, the MIT campus was moved from Boston to its current location in Cambridge because of the
allure
of greater land area. The new campus was located on a mile long tract of filled land on the
Cambridge
side of the Charles River.
This address is on land that was filled in between 1916 and 1934.
In 1929, the first flight took off
from Boston Logan Airport, which was built on an area of filled in
land in East Boston.
The filling in of the Columbus Park/Andrew Square was completed by 1934.
This address is on land that was filled in between 1934 and 1950.
During the 40s and 50s, the rise in air travel led to the area around Boston Logan Airport to be
expanded via landfilling. The land was taken from Governers, Noddle’s and Apple islands. Due to this
process, these islands no longer exist. This allowed Logan Airport to add 2 terminals in 1949.
By 1950, much of the Belle Isle marsh was filled in - leaving the Belle Isle Marsh Reservation as
the
last remnant within Boston of the salt marshes that were once prevalent along the Massachusetts Bay
Shoreline. Much of this reclaimed land is now Orient Heights, a largely Italian and increasingly
South
American neighborhood.
This address is on land that was filled in between 1950 and 1995.
Between 1950 and 1995, many finishing touches were made to Boston’s shoreline that are transportation and recreation staples for Bostonians to this day. These include the final additions to the Esplanade park, the construction of the Evelyn Moakley Bridge connecting Downtown Boston to Seaport, and large additions to Boston Logan International Airport used to extend runways to accommodate new, larger planes. The Seaport district was fleshed out, and the landfill at Columbia Point was closed and the area converted to land for housing, parks, and UMass Boston’s Harbor Campus.


@* * Copyright 2017 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import models.CompanyOrIndividualModel @import uk.gov.hmrc.play.views.html.helpers.{form, inputRadioGroup, errorSummary} @import common.Constants @import views.html.helpers.{backButtonWithProgress, hiddenField} @(investorOrNominee: String, companyOrIndividualForm: Form[CompanyOrIndividualModel], backUrl: String)(implicit request: Request[_], messages: Messages) @main_template(Messages("page.investors.companyOrIndividual.title", investorOrNominee)) { @backButtonWithProgress(backUrl, Messages("common.section.progress.details.four"))


Recent Works
Imagine a pure green eco farm that meets the perfect balance between. Everything is continuously measured and computer controlled.
The Better Farm project gives 1e+9 this wonderful challenge.
Using biogas and solar energy as the only sources of power, the Better Farm located in Normandy is a true example of modern farming.
Welcome To Groupe 1e+9.io
Service
The Key Features of our Services
Distributed Technologies
In distributed architecture, components are presented on different platforms and several components can cooperate with one another over a communication network in order to achieve a specific objective or goal.
Blockchain
The blockchain is an undeniably ingenious invention – the brainchild of a person or group of people known by the pseudonym, Satoshi Nakamoto. But since then, it has evolved into something greater, and the main question every single person is asking is: What is Blockchain?
Decentralized Apps
Known as a decentralized application, or 'dapp' for short, the concept has been one of the more novel ideas to emerge from the blockchain community. Armed with self-executing smart contracts, proponents of the technology have envisioned ways to replace everything that today requires a centralized leadership, from businesses and services to governments.
Consultancy
We provide additional services such as Consultancy advice and Management Company Services. These services will help you to startup your contracting or freelance career.
FEATURED PROJECTS
-
Spicebrick
An Indonesian based, web & apps development company We love technology and we are fond of building great things.
-
ZonaWiFi
Zona WiFi® is a disruptive digital marketing breakthroughs developed by Digitized Indonesia. Zona WiFi® helps you know your customer, increase returning customers and boost transactions.
-
BetterFarm
Imagine a pure green eco farm that meets the perfect balance... Climate and grow conditions are continuously measured and computer controlled.
-
Commodity Trading DAPP
CDAPP is an intelligent platform that connects the Commodity Trading market players.
Contact
GROUPE 1E+9.IO80 Rue du moulin Fidèl 92350 Le Plessis-RobinsonFRANCE
Mobile: +33767340001
Phone: +33174349695
info@1ep9.io


Alert Service¶
Integrate ASAB Application with alert managers.
There are currently two possible target systems for the alerts available:
Opsgenie - https://www.atlassian.com/software/opsgenie
PagerDuty - https://events.pagerduty.com
Everything you need to do is to import the service, trigger the alert and specify the target in the configuration.
class MyApplication(asab.Application):
async def initialize(self):
from asab.alert import AlertService
self.AlertService = AlertService(self)
self.AlertService.trigger(
source="my-tenant",
alert_cls="my-class",
alert_id="deduplication-id01",
title="Something went wrong.",
detail={
"example1": "additional-info",
"example2": "additional-info",
},
)
if __name__ == '__main__':
app = MyApplication()
app.run()
Opsgenie¶
Create an account at Opsgenie.
In your Opsgenie account, create a new Team.
Add integration to your Team - choose API.
API Key will be generated for you.
myapplication.conf
[asab:alert:opsgenie]
api_key=my-api-key
tags=my-tag, my-application
url=https://api.eu.opsgenie.com # this is default value
PagerDuty¶
Create an account at PagerDuty.
In your PagerDuty account, generate Api Key (Integrations > Developer Tools > Api Access Keys).
Create a new Service in Service Directory and add integration in the Integrations folder.
Choose Events API V2. An Integration Key will be generated for you.
myapplication.conf
[asab:alert:pagerduty]
api_key=my-api-key
integration_key=my-integration-key
url=https://events.pagerduty.com # this is default value
De-duplication¶
alert_id argument serves as a de-duplication ID for the third-party services. It enables the grouping of alerts and prevents noise. More about alert grouping: