I400/I590 Artificial
Life as an approach to Artificial Intelligence
Spring
Semester 2008
Professor:
Larry Yaeger
Office: Eigenmann Hall, Rm 907 (South
wing)
Office Hours:
By appointment, any afternoon or early evening I'm not in a class or
meeting; see my
work calendar
Phone: (812)
856-1845
Email: larryy (at) indiana.edu
Meeting Times:
2:30pm – 3:45pm MW Location:
Informatics Bldg, Rm I107
Textbook (required): Braitenberg,
V. Vehicles:
Experiments in Synthetic Psychology
All other reading materials
available online via links on this page (on the private site only).
NOTE: This document appears in both
a public and a private place; reading material links only work on the private site, to abide by copyright
restrictions. (Lecture note links
work on both sites.) The private
site’s URL is provided to enrolled students and is accessible via OnCourse.
Schedule
and Reading List
Links under the “Topics” heading are to PowerPoint lecture
notes. You can download these in
advance if you want something to take notes on, but be warned, they are likely
to be in flux until the day of the class.
In the topics, S# means Speaker #. (Speaker topics can be inferred from the schedule, but are
listed explicitly at the bottom of this page.)
In the reading assignments, B# means chapter # of the Braitenberg book.
L# is Lecture #.
|
Class |
Date |
Topics |
Reading Assignment (for next
class) |
Extras (not required) |
|
1a |
MO 7
Jan |
Class intro, L1-Intro to Artificial Life |
||
|
1b |
WE 9
Jan |
Intro to Braitenberg,
L2-Is it alive? |
Farmer & Belin,
B1 |
|
|
|
MO
14 Jan |
|
|
|
|
2b |
WE
16 Jan |
Goldberg, B2 |
||
|
3a |
MO
21 Jan |
No class - MLK
Holiday |
|
|
|
3b |
WE
23 Jan |
S2 (AmandaD,
AlexG),
B2, L4-Simulated Evolution (Sims movie) |
||
|
4a |
MO
28 Jan |
Exam 1, take-home |
|
|
|
4b |
WE
30 Feb |
Exam 1 due, L5-Neural Networks Pt. 1 - Terms &
Defs |
Anderson, B4 |
|
|
5a |
MO 4
Feb |
S4 (KatieO, NickM), Mitja
Hmeljack on Second Life,
discussion |
|
|
|
5b |
WE 6
Feb |
L6-Neural Nets Pt. 2 - Association &
Hebb, B4, software demos |
||
|
6a |
MO
10 Feb |
|
|
|
|
6b |
WE
13 Feb |
Schneider, B6 |
||
|
7a |
MO
18 Feb |
John
Beggs guest lecture |
|
|
|
7b |
WE
20 Feb |
L8-Neural Nets Pt 3 – Hebbian learning via Information Theory |
||
|
8a |
MO
25 Feb |
|
|
|
|
8b |
WE
27 Feb |
In-class Midterm (Exam 2) |
B8 |
|
|
9a |
MO 3
Mar |
|
|
|
|
9b |
WE 5
Mar |
|||
|
|
MO
10 Mar |
No Class -
Spring Break |
|
|
|
|
WE
12 Mar |
No Class -
Spring Break |
|
|
|
10a |
MO
17 Mar |
Informal
presentation of project ideas |
|
|
|
10b |
WE
19 Mar |
Hinton&Nowlan,
Parisi,
Chalmers, B9 |
||
|
11a |
MO
24 Mar |
Olaf Sporns
guest lecture |
|
|
|
11b |
WE
26 Mar |
L11-Organisms simulated and real (Koko, Dolphin,
Betty, Alex) |
||
|
12a |
MO
31 Mar |
|
|
|
|
12b |
WE 2
Apr |
Hillis,
B11, B12 |
||
|
13a |
MO 7
Apr |
Exam 3, take-home |
|
|
|
13b |
WE 9
Apr |
Exam 3 due, L13-Evolution of Intelligence (movies) |
Yaeger, B13,
B14 |
|
|
14a |
MO
14 Apr |
|
|
|
|
14b |
WE
16 Apr |
|||
|
15a |
MO
21 Apr |
Projects due, Project Demos |
|
|
|
15b |
WE
23 Apr |
Project Demos, Discussion and review for
final exam |
|
|
|
|
WE
30 Apr |
Final Exam 5:00pm - 7:00pm
(Exam 4) |
|
|
Requirements
Students will be expected to attend class, do weekly
readings, and participate in discussions.
In addition, each student will present and lead a discussion on the
material in one topic area, and will do one
of the following:
Š
Write
a final paper (grads 20-25 pages, undergrads 15-20 pages) demonstrating insight
into one of the topic areas.
Š
Write
a functioning ALife simulator of at least modest
complexity (more than just a simple CA or Conway Game of Life; student should
consult with teacher before writing).
Š
Turn
in a technical paper describing the results of an ALife
experiment, carried out with Tierra, Avida, Swarm, PolyWorld,
or other ALife software (student may consult with
teacher in selection of software and topic).
There will be four exams—two take-home exams, an
in-class midterm, and an in-class final exam. The lowest test grade will be dropped, thus the final is
optional, if a student is satisfied with the first three test results. The midterm and particularly the final may
include cumulative questions, but will primarily focus on the material since
the last test. Dates are indicated
in the schedule above.
Course
Structure
Generally, each week’s theme will bridge weekends, being
introduced by me in the WE lecture class, and then followed up with readings
before the next class on MO, in order to allow students maximum time to read
and prepare for discussion. On the
following MO, student presentations of a topic related to the reading materials
will take place, followed by a discussion of one of the chapters from the Braitenberg book, followed by any additional material I
need to communicate, and class discussion of that week’s topic. (There will be exceptions to this
pattern, as indicated in the above schedule, at the start of the semester and around
Spring Break.)
Each student will prepare one presentation during the
semester on a topic related to the reading materials. We will agree on and set dates in the first class. If there are more than 13 students in
the class, we will fit extra presentations in as needed. These presentations are to be 15 to 20
minutes only. In general, I hope
students will select one of the papers referenced by the primary reading
material and use that as the basis for their presentation. But if there is a topic of particular
interest to a student in the reading material itself and I have not covered
that topic in the lecture class, that will be acceptable. Related papers not taken from the
reference list may also be acceptable, but require my approval.
Each student will also work on one final project. As indicated above, this project may
take the form of writing your own ALife simulator,
performing experiments with an existing ALife
simulator, or researching and writing on a topic in the field, in order to
accommodate all computer skill levels.
Projects will be due on Monday 25 April, 2005.
Grading
Each of the four tests, class participation, the topic
presentation, and the final project will contribute to the total grade as
follows:
|
Participation |
5 pts |
(Yes, it really does count) |
|
Gedanken experiment |
5 pts |
|
|
Presentation |
10 pts |
|
|
Project |
20 pts |
|
|
|
|
|
|
Test 1 (take-home) |
20 pts |
|
|
Test 2 - Midterm |
20 pts |
|
|
Test 3 (take-home) |
20 pts |
|
|
Test 4 - Final |
20 pts |
|
|
|
|
|
|
Total |
120 pts |
(100 pts after dropping the lowest test score) |
The extended gedanken experiment will be
defined in the first week. This
experiment will pose a challenge that, if answered correctly by anyone in the
class, anytime before the end of the semester, will result in the credit being
received by the entire class.
Grades will not be curved and will be assigned as follows
(this is the same as used in I101 and I210, but differs from some other
classes):
|
A+ |
98-100 |
4.0 |
|
A |
93-97 |
4.0 |
|
A- |
90-92 |
3.7 |
|
B+ |
85-89 |
3.3 |
|
B |
80-84 |
3.0 |
|
B- |
75-79 |
2.7 |
|
C+ |
70-74 |
2.3 |
|
C |
65-69 |
2.0 |
|
C- |
60-64 |
1.7 |
|
D+ |
55-59 |
1.3 |
|
D |
50-54 |
1.0 |
|
D- |
45-49 |
0.7 |
|
F |
0-44 |
0.0 |
Conduct
Cooperation on the extra credit problem is encouraged, as is
discussion in general. In fact, I
intend to set up an email list to facilitate discussions outside of class. However, tests must be taken
individually, both take-home and in-class. Cheating will be reported according to university policies.
General
Course Description
Artificial Life is a broad discipline encompassing the
origins, modeling, and synthesis of natural and artificial living entities and
systems. Artificial Intelligence, as a discipline, tries to model and
understand intelligent systems and behavior, typically at the human level. This class will introduce core concepts
and technologies employed in Artificial Life systems that can be used to
approach the evolution of Artificial Intelligence in computers. Key themes include:
- bottom-up design and synthesis
principles,
- definitions and measurements of
life and intelligence,
- genetic algorithms,
- neural networks,
- the evolution of learning,
- the emergence of intelligence,
- computational ecologies, and
- information theory-based measures
of complexity.
Our path through these materials will lay the theoretical
groundwork for an approach to Artificial Intelligence based on the tenets and
practices of Artificial Life—an approach which utilizes evolution to
start small and work our way up a spectrum of intelligence, from the simplest
organisms to the most complex, rather than attempting to model human-level
intelligence from the outset.
Lectures and readings will be based on seminal papers and
introductory texts in these fields, drawing from the Artificial Life conference
proceedings, and technical papers by Donald Hebb
(from which we obtain Hebbian learning), Rumelhart and McClelland (editors of and authors in the
original Parallel Distributed Processing books that launched the modern neural
network field), Ralph Linsker ("Infomax" theoretical approach to neural network
learning), Hinton and Nowland (the "Baldwin
effect"), William James ("the greatest American psychologist"),
W. Grey Walter, Tom Ray, Karl Sims, Danny Hillis, and
others. We will also read and discuss Braitenberg's
seductive and influential Vehicles book.
References
Anderson, J. A., General Introduction, p. xiii-xxi, Neurcomputing, Foundations of Research, ed. by J. A.
Anderson and E. Rosenfeld, A Bradford Book, MIT Press, Cambridge,
Massachusetts, 1988
Chalmers, D., "The Evolution of Learning: An Experiment
in Genetic Connectionism" in Connectionist Models, Proceedings of the 1990
Summer School, edited by D. S. Touretzky, J. L.
Elman, T. J. Sejnowski, G. E. Hinton, Morgan
Kaufmann, San Mateo, CA, 1991
Douglas, F., “Do fruit flies dream of electric bananas?”, New Scientist, 14 February 2004
Farmer, J. D., and A. d’A.
Belin, "Artificial Life: The Coming Evolution" In
Artificial Life II, edited by C. Langton, C. Taylor, J. Farmer, and S.
Rasmussen. Proceedings of the
Artificial Life II Conference (in 1990), Santa Fe Institute Studies in the
Sciences of Complexity Proc. Vol. X.
Addison-Wesley, Redwood City, CA, 1992
Frye, M.A. & Dickinson, M.H. “A signature of salience in
the Drosophila
brain”, commentary on article by Swinderen &
Greenspan, Nat. Neur. 6 (6) 544-546 June 2003
Giurfa, M., Zhang, S., Jenett, A., Menzel, R., Mandyam, V., “The concepts of 'sameness' and 'difference'
in an insect”, Nature 410(6831) 930-933, 19 Apr 2001
Goldberg, D. E., A Gentle Introduction to Genetic Algorithms,
p. 1-23, Chapter 1 of Genetic Algorithms in Search, Optimization, and Machine
Learning, by D. E. Goldberg, Addison-Wesley 1989
Hebb, D. O., Introduction (p.
xi-xix) and Chapter 4, "The first stage of perception: growth of the
assembly" (p. 60-78), The Organization of Behavior, Wiley, New York, 1949
(with introduction, p. 43-56 from Neurocomputing,
Foundations of Research, ed. by J. A. Anderson and E. Rosenfeld, A Bradford
Book, MIT Press, Cambridge, Massachusetts, 1988)
Hillis, D. W., Intelligence as an
Emergent Behavior, p. 175-189, Daedalus, Journal of
the American Academy of Arts and Sciences, special issue on Artificial
Intelligence, Winter 1988
Hinton, G. E. and Nowlan, S. J., How learning can guide evolution. Complex Systems, 1:495--502,
1987
Izhikevich, Eugene M., Simple Model of
Spiking Neurons, IEEE Transactions on Neural Networks (2003) 14:1569-1572
http://www.nsi.edu/users/izhikevich/publications/spikes.htm
Izhikevich, Eugene M., Which Model to Use
for Cortical Spiking Neurons? IEEE Transactions on Neural Networks (2004)
15:1063-1070
http://www.nsi.edu/users/izhikevich/publications/whichmod.htm
Izhikevich, Eugene M., Polychronization:
Computation With Spikes, Neural Computation (2006) 18:245-28
http://www.nsi.edu/users/izhikevich/publications/spnet.htm
James, W., Association, Chapter XVI of Psychology (Briefer
Course), p. 253-279, Holt, New York, 1890 (with introduction, p. 1-14 from Neurocomputing, Foundations of Research, ed. by J. A.
Anderson and E. Rosenfeld, A Bradford Book, MIT Press, Cambridge,
Massachusetts, 1988)
Langton, C. G., Artificial Life, preface to Artificial Life,
The Proceedings of an Interdisciplinary Workshop on the Synthesis and
Simulation of Living Systems held September, 1987 in Los Alamos, New Mexico,
Santa Fe Institute Studies in the Sciences of Complexity Proc. Vol. VI., edited by C. Langton, Addison Wesley, Redwood City, CA,
1989
Langton, C. G., Computation at the Edge of Chaos: Phase Transitions
and Emergent Computation, p. 12-37, Emergent Computation, Proceedings of the
Ninth Annual International Conference of the Center for Nonlinear Studies on
Self-organizing, Collective, and Cooperative Phenomena in Natural and
Artificial Computing Networks, Los Alamos, NM, 1989, ed. Stephanie Forrest,
North Holland, 1990
Linsker, R.,
"Towards an Organizing Principle for a Layered Perceptual Network" in
Neural Information Processing Systems, ed. by D. Z. Anderson. American Institute of Physics,
New York, 1988
Linsker, R., "Self-Organization in
a Perceptual Network", Computer 21(3), 105-117, March 1988
Parisi, D., S. Nolfi,
and F. Cecconi, "Learning, Behavior, and
Evolution", Tech. Rep. PCIA-91-14, Dept. of Cognitive Processes and
Artificial Intelligence, Institute of Psychology, C.N.R., Rome, June 1991.
(Appeared in Proceedings of ECAL-91—First European Conference on
Artificial Life, December 1991, Paris; also in Varela, F, Bourgine,
P. Toward a pratice of autonomous systems.
MIT Press. 1991
Ray, T. S. 1992. Evolution, ecology and
optimization of digital organisms. Santa Fe Institute working paper
92-08-042
Rumelhart, D. E. and McClelland, J. L.,
PDP Models and General Issues of Cognitive Science, p. 110-146, Chapter 4 of
Parallel Distributed Processing, Explorations in the Microstructure of
Cognition, Volume 1: Foundations, ed. by D. E. Rumelhart,
J. L. McClelland, and the PDP Research Group, A Bradford Book, MIT Press,
Cambridge, Massachusetts, 1986
Schneider, T., “Information Theory Primer”,
<http://www.lecb.ncifcrf.gov/~toms/paper/primer/>
Sims, K., Evolving Virtual
Creatures, Computer Graphics, Annual Conference Series, (SIGGRAPH ‘94
Proceedings), July 1994, pp.15-22.
Walter, W. G. (1950), "An Imitation of Life",
Scientific American, 182(5), 42-45, May 1950
Yaeger, L. S., Computational Genetics,
Physiology, Metabolism, Neural Systems, Learning, Vision, and Behavior or PolyWorld: Life in a New Context, p. 263-298, Proceedings
of the Artificial Life III Conference (in 1992), ed. Chris Langton,
Addison-Wesley, 1994
Speaker
Topics
S1 – Intro to Artificial Life or Is It Alive?
Origin of life; artificial
intelligence; Charles Darwin; Alan Turing; John von Neumann; other attempts to formally
define life; applications of artificial life; multi-agent modeling;
evolutionary trends (in complexity, size, cell types, etc.); ALife software on the web (Breve,
Sugarscape, Swarm, NetLogo,
Avida, Framsticks, etc.)
S2 – Genetic Algorithms
Function optimization issues
(Charbonneau "extras" reading); real world applications (there are
many); specific application in depth; Genetic Programming methods and
applications; John Holland; cross-over versus mutation (Holland, others); differences
between computational GAs and biological genetical evolution; evolutionary art / aesthetic
selection; evolutionary robotics; GA software on the web
S3 – Simulated Evolution
Avida; recent reimplementations
of Sims's blocky creatures; Sims's competing block creatures work; applications
of simulated evolution (economy, language, number use, art, music etc.);
evolutionary games (Spore, SimLife, Creatures, etc.);
simulated Lamarckian evolution; evolutionary software on the web (Breve, Sugarscape, NetLogo, Avida, Framsticks, etc.)
S4 – Neural Networks, Intro
Neural network applications
(there are many); distributed vs. symbolic AI and knowledge representation;
evolving neural networks; enhancements to BackProp
for training ANNs; levels of detail used to model
neurons and neural nets; differences between artificial and biological neurons
and neural nets; neural network software on the web (for biological modeling
and/or engineering/classification work)
S5 – Neural Networks, Association & Hebb
Applications of Hebbian learning (vision, PCA/ICA, signal separation,
robotics, etc.); anti-Hebbian learning; Hebbian-learning neural network software on the web
(biological or artificial)
S6 – Information Theory
Information metrics as expected
values; the Schneider paper; discussion of results from the "n-grams"
extra exercises; applications of information theory (neural spike timings,
feature selection for inputs to ANNs, medical
imaging, genetic analysis—site conservation, encoding information about
the environment, classifying protein sequences, etc.); Kullback-Liebler
Divergence; information theory software on the web
S7 – Neural Networks, Information theoretic approach
to neural network learning
Application of information
theory to ANNs (neural spike timings, feature
selection for inputs to ANNs, etc.); Bayesian techniques and
applications; analyzing neural networks with information theory (capacity,
statistical mechanics, etc.); application of statistical mechanics to network
analysis (percolation on graphs, ala John Beggs)
S8 – Any of the above!
Any of the above topics, and
then some
S9 – Combining evolution and learning
Belew's analysis and extension of the
Hinton & Nowlan work (see "extras");
other Parisi papers; David Ackley's experiments with
Lamarckian evolution; other computational experiments combining learning and
evolution (Miller & Todd, French & Messinger,
others)
S10 – Animal intelligence, intelligence in simulated
organisms
Any Clayton work with scrub jays
(see "extras"); any animal cognition studies; more depth on Koko, Alex,
Kanzi, others; other bee experiments (bilateral
symmetry, human facial recognition, etc.)
S11 – Intelligence as an emergent phenomenon
Dennett's "Kinds of
Minds" (see "extras"); Hillis's coevolution of sorting algorithms; other approaches to
modeling intelligence (Cyc, Hofstadter's Copy-Cat, Seq-See, etc.); emergence; order out of chaos (Prigogene, others)
S12 – Evolution of intelligence
Other evolutionary software (Sugarscape, NetLogo, Avida, Framsticks, etc.);
evolution of complexity (see "extras")
S13 – Complexity
Complexity metric from Tononi, Sporns, & Edelman
(see "extras" next to Olaf Sporns's guest
lecture); overview of different complexity measures (see Seth, Crutchfield, and
Feldman "extras"); Tononi's "Phi"
measure of complexity and consciousness (see Tononi2 in "extras"); Kolmogorov descriptive/algorithmic complexity
Links to previous student presentations may be found on the
following class home pages from previous semesters. Click on the student's name in parentheses to download the
presentation. If the
"S#" indicator is also a link, then it will point to supporting
materials for the presentation.
(Other links on these pages do not work.)
Look here for examples of previous
semester projects.


England legend picks SA duo in best ever XI
Cape Town - Former England bowler Darren Gough has named his best-ever cricket XI with former South African legends Jacques Kallis and Allan Donald selected.
Gough revealed his all-time XI on the Lord's Cricket YouTube channel, with the criteria being that he had to have played with or against them, or have been strongly influenced by the players mentioned.
The Englishman named the usual suspects, which included Brian Lara, Sachin Tendulkar and Shane Warne, who regularly make such lists.
Former Proteas legend Kallis slotted in at No 5 on Gough's list.
"... That elegant flick off his legs, the best all-rounder I've ever played against by a long shot," said Gough.
Kallis, who retired from international cricket in 2014, played 166 Tests for South Africa scoring 13 289 runs and taking 292 wickets in the process.
Donald came in at No 9 on the Englishman's list with the Gough revealing that the South African "scared me to death when I used to go and bat against him."
Donald retired from international cricket in 2003 and played 72 Tests for South Africa, taking 330 wickets at average of 22.25.
Gough played 58 Tests, 159 ODIs and 2 T20Is for England between 1994-2006 before retiring from the game in 2008.
He is currently working with the England team as their fast-bowling consultant for the two-Test series against New Zealand.
Darren Gough's all-time XI:
Martin Crowe (New Zealand), Sachin Tendulkar (India), Ricky Ponting (Australia), Brian Lara (West Indies), Jacques Kallis (South Africa), Steve Waugh (Australia - captain), Adam Gilchrist (Australia - wicketkeeper), Shane Warne (Australia), Allan Donald (South Africa), Wasim Akram (Pakistan), Waqar Younis (Pakistan)
- Compiled by Lynn Butler


Kotlin Folder Got To Have It
David Kanenwisher • March 31, 2020
kotlinI wanted to make a simple Kotlin project that I could use to try out different bits of code I found when reading other peoples code. I figured I'd just use Gradle tutorial to get me started but with a few tweaks. Namely, I wanted to use my own folder name org/example
and remove the kotlin
folder since I figured it was part of the tutorial. It turns out I was wrong.
I created a project with this structure:
$ tree
.
├── build.gradle.kts
└── src
├── main
│ └── com
│ └── dkanen
│ └── MyLibrary.kt
└── test
└── com
└── dkanen
└── MyLibraryTest.kt
Notice the lack of a kotlin
folder.
I set my Gradle file to look like the one in the tutorial up to the part about adding support for tests:
plugins {
kotlin("jvm") version "1.3.61"
}
repositories {
jcenter()
}
dependencies {
implementation(kotlin("stdlib"))
testImplementation("junit:junit:4.12")
}
I ran gradle test
but the output was suspicious:
gradle test
BUILD SUCCESSFUL in 1s
Shouldn't there have been something about my tests? I tinkered for a bit to no avail.
I thought maybe my tests are running so I adjusted them to make them fail. I got the same output as before; something was clearly wrong at this point.
I loaded it up in Intellij. In there I found that Intellij was refusing to run the tests claiming, "No test events were received."
I was perplexed. I looked back at the examples and saw the kotlin
folder. I figured it was worth a shot.
I adjusted my directory structure like so:
.
├── build.gradle.kts
└── src
├── main
│ └── kotlin
│ └── com
│ └── dkanen
│ └── MyLibrary.kt
└── test
└── kotlin
└── com
└── dkanen
└── MyLibraryTest.kt
Notice the existence of the kotlin
folder!
Now when I run with my failing test I get:
$ gradle test
> Task :test FAILED
com.dkanen.MyLibraryTest > testMyLanguage FAILED
java.lang.AssertionError at MyLibraryTest.kt:9
1 test completed, 1 failed
FAILURE: Build failed with an exception.
* What went wrong:
Execution failed for task ':test'.
> There were failing tests. See the report at: file:///Users/davidkanenwisher/IntelliJProjects/folder-trouble/build/reports/tests/test/index.html
* Try:
Run with --stacktrace option to get the stack trace. Run with --info or --debug option to get more log output. Run with --scan to get full insights.
* Get more help at https://help.gradle.org
BUILD FAILED in 1s
3 actionable tasks: 3 executed
Yay! It works now.
What was the last pesky problem you ran into getting Kotlin to work in Gradle? Let me know on the contact page.


| 031:021 Khan | : |
And when it is said to them: "Follow that which Allah has sent down", they say: "Nay, we shall follow that which we found our fathers (following)." (Would they do so) even if Shaitan (Satan) invites them to the torment of the Fire. |
| 031:021 Maulana | : |
And when it is said to them, Follow that which Allah has revealed, they say: Nay, we follow that wherein we found our fathers. What! Though the devil calls them to the chastisement of the burning Fire! |
| 031:021 Pickthal | : |
And if it be said unto them: Follow that which Allah hath revealed, they say: Nay, but we follow that wherein we found our fathers. What! Even though the devil were inviting them unto the doom of flame? |
| 031:021 Rashad | : |
When they are told, "Follow these revelations of GOD," they say, "No, we follow only what we found our parents doing." What if the devil is leading them to the agony of Hell? |
| 031:021 Sarwar | : |
When they are told to follow what God has revealed to them, they say, "We shall only follow our father's way of life." Will they follow it even if it is Satan who is calling them to the burning torment? |
| 031:021 Shakir | : |
And when it is said to them: Follow what Allah has revealed, they say: Nay, we follow that on which we found our fathers. What! though the Shaitan calls them to the chastisement of the burning fire! |
| 031:021 Sherali | : |
And when it is said to them, 'Follow that which ALLAH has revealed,' they say, 'Nay, we shall follow that which we found our fathers following.' What ! even though Satan was inviting them to the punishment of the burning fire? |
| 031:021 Yusufali | : |
When they are told to follow the (Revelation) that Allah has sent down, they say: "Nay, we shall follow the ways that we found our fathers (following). "What! even if it is Satan beckoning them to the Penalty of the (Blazing) Fire? |
Concepts/Themes Covered: الإيمان > الغيب > النار > أسماء النار > السعير Faith> The Unseen World> Hell-Fire>Hell Names> The Blaze العمل > العمل الطالح > التقليد في العمل Action(Work)> Bad Deeds>Immitation الإنسان والعلاقات الاجتماعية > المجتمع > التقليد الأعمى Man and The Social Relations>The Society>Following the Predecessors Unconsciously
This tool uses eight English parallel translations for the Holy Quran imported from Mr. Clay Smith. You can also visit Qurany Concepts for browsing the Quran themes or topics. If you want to search the Holy Quran for keywords, please visit Qurany Keywords.


| Inactive since 6 months (Total: 2) |
| Bob Marsh |
Last logged in 250 days ago |
| Lana Lane |
Last logged in 240 days ago |
|
| Inactive since 3 months (Total: 3) |
| Clark Kent |
Last logged in 160 days ago |
| Lois Lane |
Last logged in 149 days ago |
| Karl Ei |
Last logged in 149 days ago |
|


Black Friday Deal: Save up to $300 on the latest Microsoft Surface Pro 7 and Surface Laptop 3
by PradeepMicrosoft Store is offering great deals on the latest Surface devices as part of its Black Friday sale.
Microsoft is selling a new Surface Pro 7 + Type Cover Bundle that starts at $799, allowing you to save up to $230. Microsoft is also offering up to $300 discount on Surface Laptop 3 models.
The new Surface Laptop 3 comes in the same slim and stylish design, but now available in 13.5” and new 15” touchscreens, rich color options, and two durable finishes. It is also powered by 10th gen Intel Quad-core processor and offers all-day battery life.
The new Surface Pro 7 is powered by the new 10th Generation Intel Core processors. In addition to the new processors that deliver improved performance, the Surface Pro 7 now comes with an USB-C port for better connectivity and supports Fast Charging.
You can find the deals from the below links:
If you are Costco member, check out the below amazing deals.
- Microsoft Surface Pro 7 with Intel Core i5/8GB RAM/128GB SSD, Type Cover and Surface Pen – $799 (this bundle will usually cost $1100 from Microsoft Store)
- Microsoft Surface Pro 7 with Intel Core i7/16GB RAM/256GB SSD, Type Cover and Surface Pen – $1299 (this bundle will usually cost $1600 from Microsoft Store)
We will update the post with more Black Friday deals on Microsoft Surface devices today.


instructions
Find items described in each of the bingo squares.
Tip: If you're on a mobile device,
to view the contents of a square.
Shoot a vertical pic of the item and tweet it to @mbtabingo.
Include the hashtag in the bingo square.
We'll update your card for you.
Find out how you rank compared with other players
NICARBingo.com
Got it. Let's go.
how to play
View the leaderboard
B
I
N
G
O
{% for square in squares %}
{% if square['free'] is undefined %} {% if square['image_url'] is none %}
{{square['flavor_text']}}
{% else %}
{% endif %}
{{square['hashtag']}}
{% endif %}
{% endfor %}


This is the API
https://localhost:8080/api/v1/event-notifications
POST
Create an Callback URI
The unique id of the ASPSP to which the request is issued. The unique id will be issued by OB.
An RFC4122 UID used as a correlation id.


@* * Copyright 2018 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 uk.gov.hmrc.apidocumentation.config._ @import uk.gov.hmrc.apidocumentation.controllers @import uk.gov.hmrc.apidocumentation.models._ @import include._ @(pageAttributes: PageAttributes)(implicit request: play.api.mvc.Request[Any], applicationConfig: ApplicationConfig, messages: Messages) @apiMain(pageAttributes) {
We’ll check the name of your application before giving you access to production credentials. This is because we show its name to users during the authorisation process. While you are testing your sandbox application, you can name it whatever you like.
The name of your application can't be the same or similar to the name of an application which has already requested production credentials on the Developer Hub.
‘The same’ means a name that's either identical, or where the only difference is punctuation or a special character. For example, Fast Track Tax App is treated the same as F@st Track Tax App.
‘Similar’ means a name that's close enough to another to confuse users. For example, Fast Track Tax App is too similar to Fast Trax Tax App.
This doesn't apply if it meets both these conditions:
Your application’s name must not be the same or similar to a trademarked name that's registered by another business outside the HMRC Developer Hub.
For example, you can't register the Barclays tax application, without permission from Barclays bank.
Your name can't contain offensive words or phrases.
Your application’s name can't mislead users into believing your application has special status or power. Such names might associate your application with government, local authorities or institutions. For example, the Royal Tax App could be misleading.
We have the right to delete your application at any point, for any reason.
}


{% extends 'layouts/layout.html' %} {% block pageTitle %} Create a password {% endblock %} {% block content %}
To create an NHS login you will need around 10 minutes of your time and your mobile phone, as we will text you a security code. This may take longer if you are using assistive technologies.
Continue


UIViewController
public extension UIViewController
-
A Boolean value indicating whether the popup bar is hidden when the view controller is pushed on to a navigation controller.
See also
hidesBottomBarWhenPushed
.Declaration
Swift
@objc var hidesPopupBarWhenPushed: Bool { get set }
-
The popup bar managed by the system. (read-only).
See also
PBPopupBar
.Declaration
Swift
@objc internal(set) weak var popupBar: PBPopupBar! { get set }
-
Returns a view to attach the popup bar to.
A default implementation is provided for
UIViewController
,UINavigationController
andUITabBarController
. The default implmentation forUIViewController
returns an invisibleUIView
instance, docked to the bottom of the screen. ForUINavigationController
, the toolbar is returned. ForUITabBarController
, the tab bar is returned.Declaration
Swift
@objc internal(set) weak var bottomBar: UIView! { get set }
-
The popup controller (read-only).
See also
Declaration
Swift
@objc internal(set) weak var popupController: PBPopupController! { get set }
-
Returns the container (presenting) view controller for the popup bar, and for the presented view controller (popupContentViewController). May be
UIViewController
,UINavigationController
,UITabBarController
or a custom container view controller. (read-only).Declaration
Swift
@objc internal(set) weak var popupContainerViewController: UIViewController! { get set }
-
Returns the popup content view controller of the container. If there is no popup bar presentation, the property will be
nil
. (read-only).Declaration
Swift
@objc internal(set) weak var popupContentViewController: UIViewController! { get set }
-
Returns the view where is embedded the popupContentViewController’s view for presentation. This view has a optional close button and a visual effect view with an optional effect. (read-only).
See also
PBPopupContentView
.Declaration
Swift
@objc internal(set) weak var popupContentView: PBPopupContentView! { get set }
-
Custom insets that you specify to modify the container view controller’s safe area (usefull for a custom container). Use this property to adjust the safe area bottom edge inset value of this view controller’s views by the specified amount.
Declaration
Swift
@objc var additionalSafeAreaInsetsBottomForContainer: CGFloat { get set }
-
Presents an interactive popup bar in the container’s view hierarchy and optionally opens the popup in the same animation. The popup bar is attached to the container’s bottom bar (see
popupContainerViewController
).You may call this method multiple times with different controllers, triggering replacement to the popup content view and update to the popup bar, if popup is open or bar presented, respectively.
The provided controller is retained by the system and will be released once a different controller is presented or when the popup bar is dismissed.
See also
PBPopupBar.customPopupBarViewController
for a custom popup bar view controller.PBPopupController.dataSource
for a custom bottom bar view.presentPopupBar(withPopupContentViewController:animated:completion:)
.Declaration
Swift
@objc func presentPopupBar(withPopupContentViewController controller: UIViewController!, openPopup: Bool, animated: Bool, completion: (() -> Swift.Void)? = nil)
Parameters
controller
The presented view controller for popup presentation.
openPopup
Pass
true
to open the popup in the same animation; otherwise, passfalse
.animated
Pass
true
to animate the presentation; otherwise, passfalse
.completion
The block to execute after the presentation finishes. This block has no return value and takes no parameters. You may specify nil for this parameter.
-
Presents an interactive popup bar in the container’s view hierarchy. The popup bar is attached to the container’s bottom bar (see
popupContainerViewController
).You may call this method multiple times with different controllers, triggering replacement to the popup content view and update to the popup bar, if popup is open or bar presented, respectively.
The provided controller is retained by the system and will be released once a different controller is presented or when the popup bar is dismissed.
See also
PBPopupBar.customPopupBarViewController
for a custom popup bar view controller.PBPopupController.dataSource
for a custom bottom bar view.presentPopupBar(withPopupContentViewController:openPopup:animated:completion:)
.Declaration
Swift
@objc func presentPopupBar(withPopupContentViewController controller: UIViewController!, animated: Bool, completion: (() -> Swift.Void)? = nil)
Parameters
controller
The presented view controller for popup presentation.
animated
Pass
true
to animate the presentation; otherwise, passfalse
.completion
The block to execute after the presentation finishes. This block has no return value and takes no parameters. You may specify nil for this parameter.
-
Dismisses the popup presentation, closing the popup if open and dismissing the popup bar.
- animated: Pass
true
to animate the presentation; otherwise, passfalse
. - completion: The block to execute after the presentation finishes. This block has no return value and takes no parameters. You may specify nil for this parameter.
Declaration
Swift
@objc func dismissPopupBar(animated: Bool, completion: (() -> Swift.Void)? = nil)
- animated: Pass
-
Hide the popup bar.
- animated: Pass
true
to animate the presentation; otherwise, passfalse
. - completion: The block to execute after the presentation finishes. This block has no return value and takes no parameters. You may specify nil for this parameter.
Declaration
Swift
@objc func hidePopupBar(animated: Bool, completion: (() -> Swift.Void)? = nil)
- animated: Pass
-
Show the popup bar.
- animated: Pass
true
to animate the presentation; otherwise, passfalse
. - completion: The block to execute after the presentation finishes. This block has no return value and takes no parameters. You may specify nil for this parameter.
Declaration
Swift
@objc func showPopupBar(animated: Bool, completion: (() -> Swift.Void)? = nil)
- animated: Pass
-
Opens the popup, displaying the content view controller’s view.
- animated: Pass
true
to animate the presentation; otherwise, passfalse
. - completion: The block to execute after the presentation finishes. This block has no return value and takes no parameters. You may specify nil for this parameter.
Declaration
Swift
@objc func openPopup(animated: Bool, completion: (() -> Swift.Void)? = nil)
- animated: Pass
-
Closes the popup, hiding the content view controller’s view.
- animated: Pass
true
to animate the presentation; otherwise, passfalse
. - completion: The block to execute after the presentation finishes. This block has no return value and takes no parameters. You may specify nil for this parameter.
Declaration
Swift
@objc func closePopup(animated: Bool, completion: (() -> Swift.Void)? = nil)
- animated: Pass
-
Call this method to update the popup bar appearance (style, tint color, etc.) according to its docking view. You should call this after updating the docking view. If the popup bar’s
inheritsVisualStyleFromBottomBar
property is set tofalse
, this method has no effect.Declaration
Swift
@objc func updatePopupBarAppearance()
-
Undocumented
Declaration
Swift
func popupContainerViewController(for viewController: UIViewController? = nil) -> UIViewController?


It's all hard work, not luck....
| Experiences | Comments |
|---|---|
Babysitting and TutoringI have more than 5 years of experience in babysitting. I tutored grades 1-12. |
|
AP ResearcherI researched social injustice against women working/studying in Computer Science. |
|
Association for Computing Machinery(ACM) Social ChairI recruited several women of color :) I hosted events, like escape rooms. |
|
Head Cultural AdvisorI lead the university's team of Cultural Advisors |
|
MLH Fellow!I enrolled in the Production Engineering Track. |
|
| Certificate Name | Fun Fact |
|---|---|
Teaching English as a Foreign Language (TEFL)Tutored English Language Learners as a part of field-experience. |
|
| Technical | Non-Technical |
|---|---|
|
|
E-mail<EMAIL_ADDRESS>LinkedIn: https://www.linkedin.com/in/mamnuyarinki/
GitHub: https://github.com/mamnuya


Registration
Registration will be
free
for members of the
Astronomical Society of Australia.
Registration is now closed. More information will be available this week (via email).
Loading…


Ethan Winn
Ethan started coding as a kid on his Atari 800 and the Apple IIc at school. He imagined one day he'd be an intrepid techno-revolutionary, taking down the oppressive regimes of cyberpunk future with techno-wizardry. In 1992 he got his first job working on the web, mentored by the wonderful Peter Brooks of Micromind, who built and supported a browser that connected to the internet without the need for the then new fangled "PPP" connections. He left college in 1999 to join a group of music-industry insiders who were launching a multimedia firm specializing in interactive websites for the music industry, and has been working in online tech ever since.
After working for profit-minded startups in Silicon Alley for the first 10 years of his career, Ethan decided to bring his dreams and principles back into alignment with his work and began working exclusively with organizations working for social change. Since then he has worked with groups ranging from local community development corporations to large multinational social enterprises and non-profits. His focus is on the intersection of technology and social change strategy, working with technical teams to realize the priorities of visionaries working to build a more equitable and sustainable future, within the realistic constraints of social change work.
Ethan believes passionately that diversity, anti-oppression and full personal, artistic, spiritual and professional self-realization are central to the success of all who are working together to make a better future. He also loves to ski, dance, run, read poetry and laugh with those he loves… which are most people.


Welcome to the Official Website
of the
LSU National Society of Black Engineers
Home
About NSBE
E-Board
News
Calendar
Photos
Contact Us
Contact Info
NSBE Main Office:
PFT 2173
NSBE Advisor:
Jada Lewis
Webmaster:
Joseph Bates
Contact NSBE Directly
Your Name:
E-mail:
Subject:
Message:


get_namelist(3f) - [ARGUMENTS:M_args] NAMELIST-based command line argument parsing (LICENSE:PD)
Synopsis
Description
Options
Returns
Author
License
function get_namelist(definition,all) result(string)
character(len=*),intent(in),optional :: definition logical,intent(in),optional :: all character(len=:),allocatable :: string
This routine leverages NAMELIST groups to do the conversion from strings to numeric values required by other command line parsers.Several of the following example programs simply need an initialized variable added to the NAMELIST and it automatically is available as a command line argument. Hard to imagine it getting much simpler.
To use the routine define a NAMELIST group called ARGS.
The routine provides three modes
o keyword=value(s) pairs on the command line. Typical program usage:cmd x=1 point=-1,-2,-3 help=T
This requires nothing but a call to the get_namelist(3f) procedure with no arguments and is very suitable if you just need to pass in a few numeric values. the syntax used on the command line is the syntax required for a NAMELIST input string which is very good for numeric values but does not follow the common syntax rules found in routines like getopts(3c) or IEEE Std 1003.1-2001, for example.
o Unix-like command usage when provided a NAMELIST group string. Typical program usage:cmd -x 1 --point -1,-2,-3 --title my string --help file1 file2
You can use an internal write to generate the input string (which means to add a new parameter you need to do nothing but initialize the variable and add the name to the ARGS NAMELIST group and it automatically becomes a new command line argument).
o Unix-like command usage when provided a Unix-like prototype. Typical program usage:For all three modes there is no need to convert from strings to numeric values in the source code. Even arrays and user-defined types can be used, complex values can be input ... just define the variable and add it to the NAMELIST definition.cmd -x 1 --point -1,-2,-3 --title my string --help file1 file2
If you are not familiar with NAMELIST input and output you can declare all the members of the namelist and their default values much like you were calling the program with a command prototype string.
Note that since all the arguments are defined in a NAMELIST group that config files can easily be used for the same options. Just create a NAMELIST input file and read it.
NAMELIST syntax can vary between different programming environments. Currently, this routine has only been tested using gfortran 7.0.4; and requires at least Fortran 2003.
If the routine is called with no definition string arguments are passed in on the command line using NAMELIST syntax (ie. KEYWORD=VALUE). This is particularly suited for passing a few numeric values.
For example:
program nooptions use M_args, only : get_namelist implicit none character(len=255) :: message ! use for I/O error messages character(len=:),allocatable :: readme ! stores command line integer :: ios ! I/O error numberYou can call the example program with syntax like:! declare and initialize a namelist that defines all ! the command keywords integer :: i=1, j=2, k=3 real :: s=111.1, t=222.2, r=333.3 real :: point(3)=[10.0,20.0,30.0] logical :: help=.false.,version=.false.
! just add a variable here and it is a new parameter namelist /args/ i,j,k,s,t,r,point,help,version
! return command line arguments as NAMELIST input readme=get_namelist() ! internal read of namelist read(readme,nml=args,iostat=ios,iomsg=message) if(ios.ne.0)then write(*,("ERROR:",i0,1x,a))ios, trim(message) write(*,*)OPTIONS: write(*,nml=args) stop 1 endif ! all done cracking the command line
! use the values in your program. write(*,nml=args) end program nooptions
cmd r=200e3 i=200 cmd K=33333,J=22222,I=11111 cmd point = 1, 2, 3 s= -3.0e4 t = 405.5If you do pass in strings nested quotes or escaped double-quote characters are typically required. How to do that can vary with what shell and OS you are running in. Typically the following will work ...
# just quote the entire argument list with single quotes ... cmd c="my character string" S=10,T=20.30,R=3e-2# or nest the quotes ... cmd c="string" S=20.30
# or escape the quotes ... cmd c=\"string\"
If you want to pass in options using syntax similar to that provided by the C getopts(3c) procedure pass in a NAMELIST string. Typically, you would generate the input string by writing the NAMELIST group to an internal file.
The following program can be called using commands like
cmd -A string Value -l -V --help -p 3.4,5.6 -- *Typical program skeleton:
program demo_get_namelist use M_args, only : unnamed implicit none integer :: iInstead of writing the NAMELIST group into a string you can compose the string yourself. only defined names will be able to be specified on the command line.  The NAMELIST cannot be passed as an option to a routine so this ! routine must be in a contained routine or directly in the body of ! the routine that declares the NAMELIST. get_args(3f) should not ! need changed except for possibly the length of HOLD_NAMELIST use M_args, only : get_namelist, print_dictionary, oneline ! integer :: ios character(len=255) :: message ! use for I/O error messages character(len=:),allocatable :: readme ! stores updated namelist ! make big enough for all of namelist character(len=10000) :: hold_namelist(60) ! the routine needs a copy of the options to determine what values ! are character and logical versus numeric write(hold_namelist,nml=args,iostat=ios,iomsg=message) if(ios.eq.0)then ! pass in the namelist and get an updated copy that includes ! values specified on the command line readme=get_namelist(oneline(hold_namelist)) ! read the updated namelist to update the values ! in the namelist group read(readme,nml=args,iostat=ios,iomsg=message) endif if(ios.ne.0)then write(*,("ERROR:",i0,1x,a))ios, trim(message) call print_dictionary() stop 1 endif ! all done cracking the command line end subroutine get_args end program demo_get_namelist
call get_namelist(&ARGS A_="A value",B_=" ",C_=11 22 33, help=F/)Sample with manual definition of NAMELIST string
program show_get_namelist_manual use M_args, only : unnamed, get_namelist, print_dictionary implicit none integer :: i, ios character(len=255) :: message ! define namelist real :: x, y, z logical :: help, h, version, v namelist /args/ x,y,z,help,h,version,v ! equivalence short and long version and help options equivalence (help,h),(version,v) ! define NAMELIST string that defines all NAMELIST ! group variables character(len=:),allocatable :: cmd cmd=&ARGS X=1 Y=2 Z=3 HELP=F H=F VERSION=F V=F/ ! initialize all values in NAMELIST by reading string read(cmd,nml=args,iostat=ios,iomsg=message) if(ios.eq.0)then ! reduce NAMELIST string to just values on command line cmd=get_namelist(cmd) ! update NAMELIST group with values from command line read(cmd,nml=args,iostat=ios,iomsg=message) endif if(ios.ne.0)then call print_dictionary(ERROR: //message) stop 1 endif ! all done. use values in program write(*,nml=args) if(size(unnamed).gt.0)then write(*,(i6.6,3a))(i,[,unnamed(i),],i=1,size(unnamed)) endif end program show_get_namelist_manual
Instead of passing in a NAMELIST string a Unix-like command prototype string can be used. Something like:
call get_namelist(-A " " -l -x -30.34e2 --help -version )typical usage:
program show_get_namelist_unix_prototype use M_args, only : unnamed, get_namelist, print_dictionary implicit none integer :: i character(len=255) :: message ! use for I/O error messages character(len=:),allocatable :: readme ! stores updated namelist integer :: ios! declare a namelist real :: x, y, z, point(3) character(len=80) :: title logical :: help, version, l, l_, v, h equivalence (help,h),(version,v) namelist /args/ x,y,z,point,title,help,h,version,v,l,l_
! Define the prototype ! o All parameters must be listed with a default value ! o string values must be double-quoted ! o numeric lists must be comma-delimited. No spaces are allowed character(len=*),parameter :: cmd=& & -x 1 -y 2 -z 3 & & --point -1,-2,-3 & & --title "my title" & & -h --help & & -v --version & & -l -L ! reading in a NAMELIST definition defining the entire NAMELIST readme=get_namelist(cmd,all=.true.) read(readme,nml=args,iostat=ios,iomsg=message) if(ios.ne.0)then write(*,("ERROR:",i0,1x,a))ios, trim(message) call print_dictionary(OPTIONS:) stop 1 endif ! all done cracking the command line
! use the values in your program. write(*,nml=args) ! the optional unnamed values on the command line are ! accumulated in the character array "UNNAMED" if(size(unnamed).gt.0)then write(*,(a))files: write(*,(i6.6,3a))(i,[,unnamed(i),],i=1,size(unnamed)) endif end program show_get_namelist_unix_prototype
DESCRIPTION null or composed of all command arguments concatenated into a string prepared for reading as a NAMELIST group or a Unix-line command prototype string. When creating a Unix-like prototype
o all values except logicals get a value. o long names (--keyword) should be all lowercase o short names (-letter) that are uppercase map to a NAMELIST variable called "letter_", but lowercase short names map to NAMELIST name "letter". o strings MUST be delimited with double-quotes and must be at least one space and internal double-quotes are represented with two double-quotes o lists of numbers should be comma-delimited. No spaces are allowed in lists of numbers. o the values follow the rules for NAMELIST values, so "-p 2*0" for example would define two values. ALL By default the output NAMELIST string only contains keywords and values for names that were specified on the command line. If ALL is .TRUE. a full NAMELIST string is returned containing all the variables from the input string.
STRING The output is a NAMELIST string than can be read to update the NAMELIST "ARGS" with the keywords that were supplied on the command line. When using one of the Unix-like command line forms note that (subject to change) the following variations from other common command-line parsers:
o duplicate keywords are replaced by the rightmost entry o numeric keywords are not allowed; but this allows negative numbers to be used as values. o specifying both names of an equivalenced keyword will have undefined results (currently, their alphabetical order will define what the Fortran variable values become). o there is currently no mapping of short names to long names except via an EQUIVALENCE. o short keywords cannot be combined. -a -b -c is required, not -abc even for Boolean keys. o shuffling is not supported. Values must follow their keywords. o if a parameter value of just "-" is supplied it is converted to the string "stdin". o if the keyword "--" is encountered the rest of the command arguments go into the character array "UNUSED". o values not matching a keyword go into the character array "UNUSED". o long names do not take the --KEY=VALUE form, just --KEY VALUE; and long names should be all lowercase and always more than one character. o short-name parameters of the form -LETTER VALUE map to a NAMELIST name of LETTER_ if uppercase
John S. Urban, 2019
Public Domain
| Nemo Release 3.1 | get_namelist (3) | July 22, 2023 |


We sell methodologies!
- unleash 24/365 systems
- benchmark holistic systems
- transition enterprise networks
- innovate strategic interfaces
- whiteboard sticky infomediaries
- repurpose cutting-edge infomediaries
- transition cross-platform solutions
- incentivize rich applications
- enable cross-platform solutions
- syndicate integrated paradigms


Here is a list of items and information you need to start an application:
Event Information:
Location, date, time & guest count
Applying on behalf of a Business or Organization:
A business number issued by Canada Revenue Agency is required
Municipal Resolution:
Events of municipal significance must have written approval from local
government/First Nations
Drinks:
What types of drinks will you serve & how many?
Drink pricing can only be above set pricing if the event is of provincial, municipal, national, international significance or if the event is for charitable purposes. Applicants can choose to charge below set pricing or not charge at all.
Responsible Beverage Service (RBS) Certification:
You and anyone who may be serving liquor at your event must complete a training
program before your event starts. You can apply now and complete training later.
If you have already completed training, enter your certificate number when applying.
The Special Event Server (SES) course is required for all events under 500 guests.
The Serving it Right (SIR) course is required for events over 500 guests.
For more information about certifications,
click here
Security Plan & Event Site Map:
Required for all events over 500 people
Include security staffing, contractors and other measures to ensure safety and prevent disturbances


The Dream Teams Organizational Structure
Alexander Leino
Manager
Id:
1
Email Address:
<EMAIL_ADDRESS>Office Number:>2692708954
Travis
Engineer
Id:
2
Email:
<EMAIL_ADDRESS>GitHub
TravisGitsIt
Colby
Engineer
Id:
3
Email:
<EMAIL_ADDRESS>GitHub
ColbyWasHere
Brandon
Engineer
Id:
4
Email:
<EMAIL_ADDRESS>GitHub
Western Michigan University


This package contains classes mirroring the data structures of the class file format.
Most data structures mirror those defined in the
Java virtual machine specification.
Attributes have been grouped in the attributes subpackage, constant pool entries
are found in the constants subpackage.


Welcome to the Clank demos. Use the controls on the top of the page to control the device you are looking at. For instance, try changing the value of Device to "iPhone 5".
There are also options for device orientation, device size and whether these documentation notes (you are looking at one) should be visible or not.
Use the menu on the left to browse the available components.


My App
Home
Other Sites
Shark Helmets
Shark Helmets
Pro Space
Press Space
Customer Service
Warranty
Bering
Segura Moto
Segura Equitation
Cairn Sports
Nolan Group
Contacts
Hello There!!


Best Afro pop artist in town..
Am an Afro pop and hiphop sweeden-Kenyan artist and For more of my music download it at http://mdundo.com/a/109967.
Am an Afro pop and hiphop sweeden-Kenyan artist and For more of my music download it at http://mdundo.com/a/109967.
Great new music.
Great new music.


public abstract class BaseAgentEndpoint extends BaseAgent implements AgentEndpoint
BaseAgentEndpoint
defines the basic functionality of any Device Agent.| Modifier and Type | Class and Description |
|---|---|
static class |
BaseAgentEndpoint.Connected
The
BaseAgentEndpoint.Connected object describes the current status and configuration of an AgentEndpoint . |
AgentEndpoint.Status
| Modifier and Type | Field and Description |
|---|---|
static AgentEndpoint.Status |
NOT_CONNECTED |
| Constructor and Description |
|---|
BaseAgentEndpoint() |
| Modifier and Type | Method and Description |
|---|---|
void |
connectToMatcher(Session session)
Connects this
AgentEndpoint instance to a MatcherEndpoint . |
void |
deactivate() |
java.lang.String |
getAgentId() |
java.lang.String |
getDesiredParentId() |
BidUpdate |
getLastBidUpdate() |
AgentEndpoint.Status |
getStatus() |
void |
handlePriceUpdate(PriceUpdate priceUpdate)
|
protected void |
init(java.lang.String agentId,
java.lang.String desiredParentId)
This method should always be called during activation of the agent.
|
void |
matcherEndpointDisconnected(Session session)
|
protected BidUpdate |
publishBid(Bid newBid)
Publishes a new bid to its matcher by creating a new
BidUpdate using a generated bidnumber. |
addObserver, now, publishEvent, removeObserver, setContext
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
setContext
public static final AgentEndpoint.Status NOT_CONNECTED
public java.lang.String getAgentId()
getAgentId
in interface Agent
Agent
.public java.lang.String getDesiredParentId()
getDesiredParentId
in interface AgentEndpoint
Agent
.public AgentEndpoint.Status getStatus()
getStatus
in interface Agent
getStatus
in interface AgentEndpoint
Agent.Status
of the Agent
. This returns a snapshot of the state that won't change.
If used at a later time, the snapshot should be refreshed.protected void init(java.lang.String agentId, java.lang.String desiredParentId)
agentId
- The agentId that should be used by this BaseAgent
. This will be returned when the
getAgentId()
is called.desiredParentId
- The agentId that should be used by this BaseAgentEndpoint
when determining the desired parent.
This will be returned when the getDesiredParentId()
is called.java.lang.IllegalArgumentException
- when either the agentId or the desiredParentId is null or is an empty string.public void connectToMatcher(Session session)
AgentEndpoint
instance to a MatcherEndpoint
.connectToMatcher
in interface AgentEndpoint
session
- the Session
that will link this AgentEndpoint
with a MatcherEndpoint
.public void matcherEndpointDisconnected(Session session)
matcherEndpointDisconnected
in interface AgentEndpoint
session
- the Session
that used to link the MatcherEndpoint
with this AgentEndpoint
.public void deactivate()
public final BidUpdate getLastBidUpdate()
protected final BidUpdate publishBid(Bid newBid)
BidUpdate
using a generated bidnumber. The call will
be ignored if the Agent is not connected.newBid
- The new bid that is to be sent to the connected matcherBidUpdate
that has been set or null
if not connected.public void handlePriceUpdate(PriceUpdate priceUpdate)
MatcherEndpoint
via the Session
to update the Price
used by this
AgentEndpoint
instance.
This base implementation checks if the PriceUpdate
is valid and publishes the
IncomingPriceUpdateEvent
.handlePriceUpdate
in interface AgentEndpoint
priceUpdate
- The new Price
, wrapped in a PriceUpdate
, along with the id of the Bid
it was
based on.


Senior Software Engineer
Microsoft Zürich, SwitzerlandFront- and back-end engineering work on the Visual Studio Code open source editor. Released Visual Studio Online "Monaco" on the Windows Azure Web Sites platform.
Front- and back-end engineering work on the Visual Studio Code open source editor. Released Visual Studio Online "Monaco" on the Windows Azure Web Sites platform.
Engineering work under the Planning and Work Item teams of the Rational Team Concert application lifecycle management solution.
Part-time iPhone application development under enterprise collaborations with ETH Zürich. Developed Mobiliar Notruf, the first version of the Mobiliar insurance company app.
GPA 5,31 / 6
Thesis J. Moreno, D. Kossmann, T. Kraska, S. Loesing, “A testing framework for cloud storage systems”.
GPA 17,34 / 20
Two merit scholarships, two lab assistant scholarships.
An open-source timer app for OS X.
An iOS app that allows you to record, catalog, annotate and remember the songs you create.
An open-source Notepad++ plugin for text substitution with multi-field inputs, similar to Tab Triggers.
Creation, organization and design of a web technologies event sponsored by SAPO, CoreFactor and MariaCafé.
Music, movies, TV shows, running, food & travel.


Insert Title Here
Date: December 14, 2017
Insert a description of what the article is about in about one to two sentences
Date: December 14, 2017
Insert a description of what the article is about in about one to two sentences
New American Economy brings together more than 500 mayors and business leaders who support immigration reforms that will help create jobs for Americans today. More…
September 25, 2018
September 17, 2018
September 12, 2018


|
Panda3D
|
An in-memory buffer specifically designed for downloading files to memory. More...
Public Member Functions | |
| __init__ () | |
| __init__ (const Ramfile) | |
| clear () | |
| Empties the current buffer contents. More... | |
| object | getData () |
| Returns the entire buffer contents as a string, regardless of the current data pointer. More... | |
| int | getDataSize () |
| Returns the size of the entire buffer contents. More... | |
| object | read (int length) |
| Extracts and returns the indicated number of characters from the current data pointer, and advances the data pointer. More... | |
| object | readline () |
| Assumes the stream represents a text file, and extracts one line up to and including the trailing newline character. More... | |
| object | readlines () |
| seek (int pos) | |
| Moves the data pointer to the indicated byte position. More... | |
| int | tell () |
| Returns the current data pointer position as a byte offset from the beginning of the stream. More... | |
An in-memory buffer specifically designed for downloading files to memory.
| __init__ | ( | ) |
| __init__ | ( | const | Ramfile | ) |
| clear | ( | ) |
Empties the current buffer contents.
| object getData | ( | ) |
Returns the entire buffer contents as a string, regardless of the current data pointer.
| int getDataSize | ( | ) |
Returns the size of the entire buffer contents.
| object read | ( | int | length | ) |
Extracts and returns the indicated number of characters from the current data pointer, and advances the data pointer.
If the data pointer exceeds the end of the buffer, returns empty string.
The interface here is intentionally designed to be similar to that for Python's file.read() function.
| object readline | ( | ) |
Assumes the stream represents a text file, and extracts one line up to and including the trailing newline character.
Returns empty string when the end of file is reached.
The interface here is intentionally designed to be similar to that for Python's file.readline() function.
| object readlines | ( | ) |
| seek | ( | int | pos | ) |
Moves the data pointer to the indicated byte position.
It is not an error to move the pointer past the end of data.
| int tell | ( | ) |
Returns the current data pointer position as a byte offset from the beginning of the stream.


Products Out on Approvals
{%include 'filter.html'%}
| ID | Product | Customer | quantity | weight | Status | approval | Action |
| {{object}} | {{ object.product }} | {{object.approval.contact}} | {{ object.quantity }} | {{ object.weight }} | {{object.status}} | {{object.approval}} | Delete |


Folder Event Flags
Folder Item created 256
Folder Item removed 512
Folder Item meta modified 1024
Folder Item renamed 2048
Folder Item modified 4096
Folder Item info modified 8192
Folder Item owner changed 16384
Folder Item attribute modified 32768
Folder Item is file 65536
Folder Item is directory 131072
Folder Item is symlink 262144


--- layout: minimal_about_me title: "About" permalink: /about/index.html description: "SpaceWired and the Software Engineer" ---
The purpose of SpaceWired is to provide short breakdowns of topics related to the space industry, planetary science, theoretical physics, and engineering. Some posts will be quick discussions about recent news in the industry, while others are simplified summaries of interesting research papers I find. You'll also notice that I'll occasionally throw in a post on something new I've learned related to the Computer Science field and hopefully can be useful to someone else. Thought I'd throw those in for seasoning :) .
On each post, you will see two pieces of metadata under the post's title. One of them will indicate the time (on average) that it takes to finish reading the post. The other piece of information is designed to help you identify how technical the post is, in general the more black SpaceWired logos you see, the more technical jargon you will find on the post.
Below is a key of what the symbols mean:
________________________________________
I graduated in May of 2018 from The Johns Hopkins University (JHU) with a Bachelor's Degree in Chemical and Biomolecular Engineering. After graduating I began to work as a Research Engineer at the JHU Applied Physics Laboratory (APL) at the Intelligent Systems Center (ISC). I am actively persuing a Masters degree in Computer Science at JHU while working full-time at the lab. From the ISC I works on projects developing a Big Data cloud infrastructure called BOSS and developing machine learning segmentation algorithms.
At APL I also have the privilage of working as a Flight Software Engineer on NASA's Planetary Defense Double Asteroid Redirection Task (DART) and am an active member of the Planetary Society.
Feel free to comment and ask questions in the comment sections.
ENJOY!


ANTACID- aluminum hydroxide, magnesium hydroxide and dimethicone liquid
Rij Pharmaceutical Corporation
Disclaimer: Most OTC drugs are not reviewed and approved by FDA, however they may be marketed if they comply with applicable regulations and policies. FDA has not evaluated whether this product complies.
Active ingredients (in each 5 mL) (One teaspoonful)
Aluminum Hydroxide (Equi. to Dried Gel, USP) 225 mg
Magnesium Hydroxide 200 mg
Simethicone 25 mg
Uses
relieves
- •
- heartburn
- •
- acid indigestion
- •
- sour stomach
- •
- associated symptoms of gas and upset stomach
- •
- pressure and bloating commonly referred to as gas
Warnings
Do not take more than 12 teaspoonfuls in a 24-hour period or use the maximum dosgae for more than 2 weeks. Except under the advise and supervision of a physician.
Ask a doctor before use if you have
- •
- kidney disease
- •
- a magnesium-restricted diet
Ask a doctor or pharmacist before use if you are
taking a prescription drug. Antacids may interact with certain prescription drugs.
Stop use and ask a doctor if
symptoms last for more than 2 weeks
Keep out of reach of children.
In case of accidental overdose, get medical help or contact a Poison Control Center immediately.
Directions
- •
- shake well before each use
- •
- Adults and children 12 years and older, take 2 to 4 teaspoonsful between meals, at bedtime or as directed by a physician
- •
- do not take more than 12 teaspoonsful in 24 or use the maximum dosage for more than 2 weeks
- •
- Children under 12 years: consult a physician
Other information
- •
- TAMPER EVIDENT: DO NOT USE IF BREAKAWAY BAND ON CAP IS BROKEN OR MISSING
- •
- Store at room temperature 15º - 30ºC (59º - 86ºF)
- •
- keep tightly closed
- •
- protect from freezing
- •
- each teaspoon (5 mL) contains: magnesium 83 mg
- •
- each teaspoon (5 mL) contains: sodium 1 mg
- •
- does not meet USP requirements for preservative effectiveness
Inactive ingredients
flavors, hypromellose, parabens, saccharin, sodium hypochlorite, sorbitol, water and xanthan gum


CSS3 TABS. NO JAVASCRIPT
In today’s tutorial I am going to share a simple way to make News Ticker and Notification Bar using CSS3, NO JAVASCRIPT. Previously it was very difficult to code it in javascript and make it work with other plugins, but today I decided to make it possible in CSS3 and voila, I succeeded So lets
While reading more about HTML5 & CSS3 I just found an amazing css3 button styling. This time I wanted to do something which I was doing from past 2 years using JQuery. In this tutorial I am going to teach you how to make a toggle slideDown and slideUp function using CSS3 and HTML5. To
Lets start learning CSS3 before its too late, I just saw a website which amazed me with its animation effects. First I thought that the site is using some JQuery libraries but when I actually went into the code, I found it is CSS3. So I started learning it, and today I made my first Read more...


The fields of the Note structure are listed below. For a complete list of Note structure members, see the Note Members topic.
| DoubleFlat | Double-flat accidental value. |
| DoubleSharp | Double-sharp accidental value. |
| Flat | Flat accidental value. |
| Natural | Natural accidental value. |
| Sharp | Sharp accidental value. |


You discovered the Tau lepton.
The tau was detected in a series of experiments between 1974 and 1977 by Martin Lewis Perl with his colleagues at the SLAC-LBL group. Their equipment consisted of SLAC's then-new e+–e− colliding ring, called SPEAR, and the LBL magnetic detector. They could detect and distinguish between leptons, hadrons and photons.
Martin Perl shared the 1995 Nobel Prize in Physics with Frederick Reines. The latter was awarded his share of the prize for experimental discovery of the neutrino.


You write, we take care of the rest. Join a community of creatives who write, edit and enhance projects with ease. Make everything better- with Jott.ly.
Jott.ly is here to help. The most talented copywriters are only a couple of clicks away. List your freelance job with Jott.ly today.
Join a community of your peers to get inspired and easily collaborate.
Easily post, share, get feedback, and edit your work on Jott.ly.
Easily post, share, get feedback, and edit your work on Jott.ly.
Find out why hundreds of writers and editors use Jott.ly everyday.


Resources
Helpful and/or fun links for CS students.
Computer Science
- Matt Might provides a pretty comprehensive guide to what CS students should know. There’s not really enough time for us to get to everything in class — you’ll need to put in time outside of class if you want to know all of this. It’s worth it, though.
- A nice collection of advice and info. Although it says freshman, it will likely be useful to all CS students.
- Vizualizations of many algorithms and data structures.
- A massive list of links for programmers, ranging from tech news to interview preparation to improving your English.
- Teach Yourself CS is another list of resources. It’s aimed toward self-taught software engineers, but the materials could be very useful if you’re struggling in a particular course.
- Get better at using the shell with with CMD Challenge.
- Visualize the code you write using Python Tutor. Despite the name, you can program in Python, Java, JavaScript, C++, and more!
- A collection of resources for programmers.
- Programming interviews are notoriously difficult. There’s little evidence to suggest they lead to good hiring decisions, yet I don’t think they will change anytime soon. In the meantime, get some practice at the Tech Interview Handbook. It gets easier with practice.
- Here is a fun collection of video game source code from real, commercial games.
- 100+ Project Ideas for programmers or those learning to program.
- The Interview Study Guide for Software Engineers
- Free-for.dev: a list of free software and services for developers.
General Learning
- Coursera’s free Learning How to Learn course will improve your learning of all topics, not just computer science.
- In a similar vein, improving your problem-solving skills will help many facets of your life. This tutorial is a pretty good one. Also check out Polya’s How to Solve it.
- I heard you like lists, so here is a list of cool lists.