Another common pattern of computation is called tree recursion. As an example, consider computing the sequence of Fibonacci numbers, in which each number is the sum of the preceding two: \[ 0, 1, 1, 2, 3, 5, 8, 13, 21, \ldots \] In general, the Fibonacci numbers can be defined by the rule \begin{eqnarray*} \textrm{Fib}(n) & = & \left\{ \begin{array}{ll} 0 & \mbox{if }\\ 1 & \mbox{if }\\ \textrm{Fib}(n-1)+\textrm{Fib}(n-2) & \mbox{otherwise} \end{array} \right. \end{eqnarray*}
We can immediately translate this definition into a recursive function for computing Fibonacci numbers:
Consider the pattern of this computation. To compute fib(5) , we compute fib(4) and fib(3) . To compute fib(4) , we compute fib(3) and fib(2) . In general, the evolved process looks like a tree, as shown in figure \ref{fig:fib-tree}. Notice that the branches split into two at each level (except at the bottom); this reflects the fact that the fib function calls itself twice each time it is invoked.
This function is instructive as a prototypical tree recursion, but it is a terrible way to compute Fibonacci numbers because it does so much redundant computation. Notice in figure \ref{fig:fib-tree} that the entire computation of fib(3)—almost half the work—is duplicated. In fact, it is not hard to show that the number of times the function will compute fib(1) or fib(0) (the number of leaves in the above tree, in general) is precisely $\textrm{Fib}(n+1)$. To get an idea of how bad this is, one can show that the value of $\textrm{Fib}(n)$ grows exponentially with $n$. More precisely (see exercise \ref{ex:fib-proof}), $\textrm{Fib}(n)$ is the closest integer to $\phi^{n} /\sqrt{5}$, where \[ \phi=(1+\sqrt{5})/2\approx 1.6180 \] is the golden ratio, which satisfies the equation \[ \phi^{2} =\phi + 1 \] Thus, the process uses a number of steps that grows exponentially with the input. On the other hand, the space required grows only linearly with the input, because we need keep track only of which nodes are above us in the tree at any point in the computation. In general, the number of steps required by a tree-recursive process will be proportional to the number of nodes in the tree, while the space required will be proportional to the maximum depth of the tree.
We can also formulate an iterative process for computing the Fibonacci numbers. The idea is to use a pair of integers $a$ and $b$, initialized to $\textrm{Fib}(1)=1$ and $\textrm{Fib}(0)=0$, and to repeatedly apply the simultaneous transformations \begin{eqnarray*} a & \leftarrow & a+b \\ b & \leftarrow & a \end{eqnarray*} It is not hard to show that, after applying this transformation $n$ times, $a$ and $b$ will be equal, respectively, to $\textrm{Fib}(n+1)$ and $\textrm{Fib}(n)$. Thus, we can compute Fibonacci numbers iteratively using the function
One should not conclude from this that tree-recursive processes are useless. When we consider processes that operate on hierarchically structured data rather than numbers, we will find that tree recursion is a natural and powerful tool.[1] But even in numerical operations, tree-recursive processes can be useful in helping us to understand and design programs. For instance, although the first fib function is much less efficient than the second one, it is more straightforward, being little more than a translation into JavaScript of the definition of the Fibonacci sequence. To formulate the iterative algorithm required noticing that the computation could be recast as an iteration with three state names.
It takes only a bit of cleverness to come up with the iterative Fibonacci algorithm. In contrast, consider the following problem: How many different ways can we make change of $\$ 1.00$, given half-dollars, quarters, dimes, nickels, and pennies? More generally, can we write a function to compute the number of ways to change any given amount of money?
This problem has a simple solution as a recursive function. Suppose we think of the types of coins available as arranged in some order. Then the following relation holds: The number of ways to change amount $a$ using $n$ kinds of coins equals
To see why this is true, observe that the ways to make change can be divided into two groups: those that do not use any of the first kind of coin, and those that do. Therefore, the total number of ways to make change for some amount is equal to the number of ways to make change for the amount without using any of the first kind of coin, plus the number of ways to make change assuming that we do use the first kind of coin. But the latter number is equal to the number of ways to make change for the amount that remains after using a coin of the first kind.
Thus, we can recursively reduce the problem of changing a given amount to problems of changing smaller amounts or using fewer kinds of coins. Consider this reduction rule carefully, and convince yourself that we can use it to describe an algorithm if we specify the following degenerate cases:[2]
(The first_denomination function takes as input the number of kinds of coins available and returns the denomination of the first kind. Here we are thinking of the coins as arranged in order from largest to smallest, but any order would do as well.) We can now answer our original question about changing a dollar:
The function count_change
generates a tree-recursive process with
redundancies similar to those in our first implementation of
fib.
(It will take quite a while for that 292 to be computed.) On
the other hand, it is not obvious how to design a better algorithm
for computing the result, and we leave this problem as a challenge.
The observation that a
tree-recursive process may be highly
inefficient but often easy to specify and understand has led people to
propose that one could get the best of both worlds by designing a
smart compiler
that could transform tree-recursive
functions
into more efficient
functions
that compute the same result.[3]
row ? false : index === 1 || index===row ? 1 : pascal_triangle(row - 1, index - 1) \end{JavaScriptClickable} \end{lrbox} \begin{JavaScriptClickable} /*!\href{https://sourceacademy.nus.edu.sg/playground#chap=1&prgrm=GYVwdgxgLglg9mABABwIYGcKoDYH0oBOMqYA5tgKYAUBcA7gDSIxgAmFAHgJSIDeAUIiGICFKCAJIW7DogB8I+oOErhAfkTAc6CstUqAXMzadEAXguIAjIgA+t4zItnadPfpUar7j0KNpMHHwiEnJqV0QAWmsmaVNoqy5+AEgPAGoUjwCsPEJiMkoaeiiYx04uAG5+AF9+fmygvNDCgFYGABZKoA}{\usebox\lstbox}!*/ + pascal_triangle(row - 1, index); } \end{JavaScriptClickable}
The Precious Mirror of the Four Elements), published by the Chinese mathematician Chu Shih-chieh in 1303, in the works of the twelfth-century Persian poet and mathematician Omar Khayyam, and in the works of the twelfth-century Hindu mathematician Bháscara Áchárya.


@*
* Copyright 2023 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.cataloguefrontend.{CatalogueFrontendSwitches, ViewMessages}
@import uk.gov.hmrc.cataloguefrontend.serviceconfigs.{ServiceConfigsService, routes => serviceConfigsRoutes }
@import uk.gov.hmrc.cataloguefrontend.util.UrlUtils
@import scala.collection.immutable.ListMap
@import uk.gov.hmrc.cataloguefrontend.whatsrunningwhere.WhatsRunningWhereVersion
@this(viewMessages: ViewMessages)
@(serviceName: String,
configByKey : ServiceConfigsService.ConfigByKey,
deployments : List[WhatsRunningWhereVersion],
showWarnings : Boolean,
configWarnings: Seq[ServiceConfigsService.ConfigWarning]
)(implicit
request: RequestHeader
)
@findDeployment(env: ServiceConfigsService.ConfigEnvironment) = @{
deployments.find(e => ServiceConfigsService.ConfigEnvironment.ForEnvironment(e.environment) == env)
}
@show(env: ServiceConfigsService.ConfigEnvironment) = @{
env == ServiceConfigsService.ConfigEnvironment.Local || findDeployment(env).isDefined
}
@env.displayString
@(configByKey.filter(_._2.get(env).exists(_.exists(_.nextDeployment))).size match {
case _ if env == ServiceConfigsService.ConfigEnvironment.Local =>
case 0 =>
case 1 => 1 undeployed change
case x => {x} undeployed changes
})
@(configWarnings.collect {
case x if ServiceConfigsService.ConfigEnvironment.ForEnvironment(x.environment) == env => x.warning
}.size match {
case _ if env == ServiceConfigsService.ConfigEnvironment.Local =>
case 0 =>
case 1 => 1 warnings
case x => {x} warnings
})


CREATE TABLE samples ( channel VARCHAR(80), timestamp INT, min DOUBLE PRECISION, max DOUBLE PRECISION, mean DOUBLE PRECISION, sum DOUBLE PRECISION, count INT, PRIMARY KEY(channel, timestamp)) ENGINE=InnoDB;
select min, max from samples where channel = 'BL-AL-IOC-01:CPU:LOAD' and timestamp > 661731600 and timestamp < 661737600 limit 10;


A project is a logical group of different flows. It will help you to organise your different groups of code repositories.


NYC transit system information added to Uber app
by Robert CurleyVisitors to New York City will be able to access information on the city’s subways, buses, and ferry service on the Uber app as well as booking a car ride.
Information on the entire Metropolitan Transportation Authority (MTA) system will be featured, including the Long Island Rail Road, Metro North, and PATH commuter trains, the Brooklyn Eagle reports.
App users will even be able to price-shop among transportation options, with the cost of buses and trains listed alongside Uber rides to comparable destinations.
“We know that Uber and the cities in which we operate share many of the same goals: reducing congestion, expanding access to transportation and tackling air pollution,” said Uber’s Head of Transit, David Reich.
Reich described the app enhancements as part of a partnership with local transit agencies, although Uber has taken some blame for a recent decline in MTA ridership.
Similar local transit information is available on the Uber app in London and Denver. The rollout of the new Uber features in New York will take place over the next few months.


This document provides a set of guidelines that enable a tester to plan the development of test designs and related assets to maximize reuse. The intended context for this reuse is to maximize the potential for effective system\application configuration testing and localization testing, also known as NLS testing. Throughout this document we will refer primarily to NLS testing, but the concepts apply equally well to configuration testing and other forms of testing requiring reconfigurable text values.
The App Map features referenced here as App Map Chaining and App Map Resolving Embedded Variables are only available in versions of SAFS dated on or after Aug, 2006.
It is important to recognize that the single most important notion for making test designs reusable for NLS and configuration testing is that no localizable or configuration-specific text must exist in the test designs or test actions--the test tables. All such text must be managed in separate text resource files, which in the SAFS world means separate App Maps. The test designs and test actions will reference the text via variable references which will be retrieved from the App Maps opened for the target language or configuration.
(Need to respecify the following statement based on most recent experiences with Rational Robot and Rational Functional Tester evaluations.)
In order to properly represent mixed character data (some single-byte and some multi-byte) the UTF-8 character encoding format is supported by RRAFS and SAFS. All App Maps and Test Tables intended to be used for NLS testing should be encoded in the proper format required by the tools in use.
Note: App Map Chaining by default is not enabled in order to maintain backwards compatibility with existing tests. You must use the 'AppMapChaining' Driver Command to enable this feature.
C, AppMapChaining, ON
App Map Chaining is the process by which multiple App Maps can be opened and searched for referenced values. App Maps opened with chaining enabled are searched in Last-In-First-Out (LIFO) order. This allows the opening of scenario-specific maps--language or configuration, etc.--to be opened in addition to generic and shared maps. Maps opened later can have values that override or supercede maps opened earlier. In addition, shared maps can contain embedded variables (see below) that can be satisfied by the scenario-specific maps. For example, a shared map may reference an embedded variable containing localizable text that will be found in another open App Map--the one specific to the language being tested.
Example:
C, SetApplicationMap, FMStudio_NLS C, SetApplicationMap, FMStudio_MAP
This design snippet shows two maps being opened. The first opened map (FMStudio_NLS) would contain the localized text specific to the language being tested. All entries in this map would be in the default [ApplicationConstants] section so that they could be retrieved as variables. The second map (FMStudio_MAP) would be the shared map used in all testing no matter what the language or configuration. The entries in this shared map would contain embedded variables whose values would be found in the localized map. Since the maps are read in LIFO order due to App Map Chaining, values will first be sought in the FMStudio_MAP. Embedded variables or other values not satisfied by that map will then be sought in the FMStudio_NLS map.
Note: Resolving embedded variables in App Maps is not enabled by default in order to maintain backwards compatibility with existing tests. You must use the 'AppMapResolve' Driver Command to enable this feature.
C, AppMapResolve, ON
An App Map entry can contain references to variables whose values will be resolved to complete the entry. See Resolving DDVariables for Dynamic Recognition for more information on this capability. Essentially, the idea to keep in mind is that the shared maps will contain largely static text that does not need to be localized or changed for subsequent testing. Where some portion of an App Map entry does need to contain localized text that portion will be represented as an embedded variable and the ultimate value of that variable will be retrieved from a locale-specific App Map that is opened in addition to the shared App Map.
Example:
FMStudio_NLS_en (known as FMStudio_NLS): ---------------------------------------- [ApplicationConstants] nlsHello="Hello!" FMStudio_NLS_es (known as FMStudio_NLS): ---------------------------------------- [ApplicationConstants] nlsHello="�Hola!" FMStudio_MAP: ------------- HelloLink="Type=HTMLLink;HTMLText={^nlsHello}"
Now, let us assume that the test is run first in English and then later in Spanish. The first time the test is run the FMStudio_NLS_en (English) map is loaded along with the FMStudio_MAP. When the test goes to retrieve the value for the HelloLink component it will find the embedded ^nlsHello
variable reference which must be retrieved. The ^nlsHello
variable does not exist in the shared map so App Map Chaining will go look for the value in the English map. The value retrieved for ^nlsHello
is "Hello!" and the resulting HelloLink value will be:
HelloLink="Type=HTMLLink;HTMLText=Hello!"
The second time the test is run the FMStudio_NLS_es Spanish map is loaded along with the FMStudio_MAP. This time the value retrieved for ^nlsHello
is "�Hola!" and the resulting HelloLink value will be:
HelloLink="Type=HTMLLink;HTMLText=�Hola!"
As you can see, App Map Chaining with Embedded Variables is a powerful combination that enables us to deliver tests that can readily be migrated for NLS testing. However, to accomplish that it requires the Test Designers to design the tests and these assets with the goal of NLS reuse in mind.
Just as special design consideration must be given during software development to make an application support Internationalization, Localization, and Globalization, so too must our test designs receive this same level of design consideration. If the tests are not designed from the very beginning with this goal in mind then the process of going back and making the tests NLS-ready can be very difficult and time consuming.
The App Map processing features mentioned above allow us to use the same common practice used by software developers when developing software. That is, we must design our tests for NLS by separating textual data and other environment-dependent resources out of the tests themselves and into separate resource files. This means we want all environment-dependent text stored in environment-specific App Maps. Other environment-dependent resources like image files should be referenced through environment-specific entries in those same App Maps. In this way, the tests themselves do not change no matter which environment is being tested. When we go to test in a new environment we just make sure we use the appropriate App Map(s) and resources targetted for that environment.
It takes vigilance and attentive awareness to design a test that is truly NLS-ready. All environment-specific text and resources must be kept out of the design and moved into the resource files (App Maps). The designs will merely contain variable references that will ultimately be satisfied by lookups into the environment-specific App Maps. This not only includes language-specific text that might appear in object recognition strings, but also any language-specific string that might be evaluated or verified--such as an object property value, displayed text, or image benchmarks whose image may contain environment-specific text, legends, or formats.
An example of this might be a Label on a dialog box that informs the user that a certain process either succeeded or failed. The recognition string for the label may not require special handling as its Name or ID may be common across all environments as shown below:
StatusLabel="Type=Label;Name=lblStatus"
However, when we wish to verify the status displayed to the user in the Label we are going to be dealing with literal text that will likely be localized and needs to be stored separately in our NLS resource files or App Maps.
Problem:
T, StatusDialog, StatusLabel, VerifyProperty, "Text", "Success!"
Solution:
T, StatusDialog, StatusLabel, VerifyProperty, "Text", ^nlsSuccess
To make sure our tests are NLS-ready we are tasked to verify a few things:
Thus, our NLS-ready App Maps need to hold this localizable text so that the proper values are found at runtime:
FMStudio_NLS_en (known as FMStudio_NLS): ---------------------------------------- [ApplicationConstants] nlsHello="Hello!" nlsSuccess="Success!" nlsFailed="Failed!" FMStudio_NLS_es (known as FMStudio_NLS): ---------------------------------------- [ApplicationConstants] nlsHello="�Hola!" nlsSuccess="��xito!" nlsFailed="�Fallado!"
As you can see, it takes special attention and vigilance to carefully design our tests so that they are NLS-ready! The same level of care must be taken for all forms of displayed text, text to be input from the user that might be language-specific, and other resources containing environment-specific data like locale-specific currency, time, and date formats.
The Scenario:
You wish to create a highly reusable step table (action) that will close any window in your application and then check the application state. We'll call this the "CloseAppWindow" table.
This can serve a number of purposes, including:
The Problem:
For maximum reusability, CloseAppWindow must be able to recognize different windows according to their any-language Caption, so no part of CloseAppWindow, or any of the tables that call it, can contain language-specific text.
The Solution:
Use App Map Chaining, App Map Embedded Variables, and Application Constants.
T CloseAppWindow ^Caption=^ReportsCaption T CloseAppWindow ^Caption=^HelpCaption T CloseAppWindow ^Caption=^AboutCaption
There is no localizable text calling CloseAppWindow.
T AnyWindow AnyWindow CloseWindow ...followed by important status and error checks
There is no localizable text in CloseAppWindow.
MyApp.map: ---------- ... [AnyWindow] AnyWindow="Type=Window;Caption={^Caption}" ...
There is no localizable text in the primary App Map.
[ApplicationConstants] ReportsCaption="Reports" HelpCaption="Help" AboutCaption="About"
All localizable text is confined to the NLS App Map.
[ApplicationConstants] ReportsCaption="Informes" HelpCaption="Ayuda" AboutCaption="Sobre"
This sample design shows maximum reusability. The same test used to automatically test the English translation of the application can be used to test all other localizations. And the amount of localization necessary for each translation has been minimized to a single NLS App Map file.


I played Pokemon on my brother's nintendo when I was 9
the most useless pokemon in the game at least metapod has high hp


News feeds can save lives.  Here are some stories in my news feed that I think are important that you have likely missed because they are hard to find.
Prices
BTC 6825
Steem 1.83
SBD 1.90
Headlines
No sign of chemical weapons at attack site… False Flag?
MIT Expert says Syrian Gas attack was staged
Conflict in Syria was always Isarel’s War
John McCain visits chemical attacks follow
Mattis admits Assad didn’t poison his own people
throwback UN accuses Syrian rebels of gas attacks, which had been blamed on Assed 2013
US officials confirm Israel attacked Syria
Syria
Syria becomes World War Powderkeg
Titus Frost talks about Israel bombing Syria
Luke we are change talks about Syria Bombing with Partisan Girl
US says no evidence that Assad behind chemical attack
War Diary in Syria March 6th
https://www.youtube.com/watch?v=INqd5IEAgWo
Isareli airstrike on T-4 base in Syria with Russians in it
(Tony Blair says UK should attack Syria](https://www.independent.co.uk/news/uk/politics/tony-blair-uk-syria-military-action-kosovo-dourma-chemical-attack-us-un-a8297336.html)
Assad denies chemical weapons use
Domestic
Homeland Security Advisor Resignation
South Carolina to consider secession
Dem arrested for firing 9mm without serial number
International
Indigenous Women March in Amazon
China ready to lower tariffs on American Cars
WW3 Erdogan calls for ARMY of Islam to attack Israel
Erdogan calls Netanyahu a terrorist
Israel rejects UN and EU calls for Gaza inquiry
London stop and frisk for knives
Old News Israeli officials say time to kill Bashar
Conspiracy
Jerry Brown to release 10k pedophiles
Malaysian plane that went down over Ukraine
Rod Rosenstein’s wife a layers for Obama, Clinton
Queen Elizabeth records a speech about oncoming WWIII
Broward County Sheriff Deputy questioning the narrative is dead
Officer reassigned after indicating school shooting was a hoax
Puerto Rico being ethnically cleansed for superrich
Pedo/Trafficking
Asshole from Snopes busted for prostitutes
UN asshole facing Pedo charges
CPS makes money taking your kids
Crypto
YouTube and FB are losing to Steem
Health
2nd Amendment keeps women safe
Education
Transpicuous Views on Education
Environment
Secret Space
Buzz Aldrin pass lie detector on UFO encounters
9/11 petitiion
https://lawyerscommitteefor9-11inquiry.org/
This page is synchronized from the post: ‘Aggroed’’s Antidote- 4/10/18 If you had my news feed you’’d question the official narrative too!’


{{ partial "head.html" . }}
I see you've disabled Javascript. You'll need to use Google or some other Search Engine to search {{ .Site.Params.siteHost }}.


To Exist...
Itís been a few months now since I last left this universe. And though I readily advocate this experience too all whom I deem of able body and mind, I must admit there is an overwhelming tension that arises in me, about re-entering this realm. This is not however the familiar tension of the dentistís chair or the one from the morning of a final exam, but a humbling sort of tension, one that brings with it questions of worthiness: Am I ready? Can I handle it? What will I ask it when I am their?
When I decide to submit myself to this power I must be of calm mind and pure intention, otherwise I will be chewed up and rejected. Thrill seekers be warned, though intense and amazing, I can never use it for entertainment. I must bring with me a sober friend to act as my anchor to reality should I journey too deeply inward and leave the body completely. As my consciousness takes its field trip into the unknown, the electrical impulses left in the physical form can become the puppeteer to potential harm.
The door to unfathomable experience is a remarkably easy one to open, once in possession of the key. Even stepping in and shutting it behind me proves to be an all too easy procedure given the potential consequences. But the journey inward is something that can never be prepared for. At first I begin to feel an expanded awareness and excitement rush over my body. Then suddenly and inexplicably it all condenses into a single point. This point is the breakdown. The freight-train into the unknown. Itís the end of time, space and every other constraint brought about by our boxed in constructs of reality. Itís a squeegee to my cumulative knowledge of existence (experience), and the collapse of ego.
Imagine the experience of birth, in which every sensation is foreign I must learn again how to exist. I remain a conscious entity, though the distinction between 'I' and the universe is blurred. What once was the material world is has turned into a kaleidoscope of incomprehensible imagery. The experience of three dimensions is dissolved and I become part of a vast landscape of unimaginable existence. There is a being in this realm, or perhaps the being is this realm. Up to this point I have been completely paralyzed. But soon, I start learning to interact with this dimension. There is a sensation that what is happening is something that is beneficial. I soon learned to go with the flow of energy and take in all the things that it has to teach me.
Soon the imagery slows down and my brain starts regaining function. I remember who I am and how I got there. After stepping back to Earth, I have about 15 minutes to allow this power to leave you. 'I' am me again. But thereís something more. Perception of reality has been enhanced in a way words can not do justice. Within the hour all function is fully regained and the constraints of the classical world comeback, but not fully. For days after my first experience with the divinorum an over-glow of possibility encompassed my world view. I will use this journey again. It will always be something I carry with me as a spiritual ally.
To all who discover this ally for themselves I ask that you always treat it with respect. Its effects our inescapably personal, so be sure you're ready. In the wrong state of mind I could see this experience being perceived as negative, at worst, a psychotic break. Also our society is a long way from being able to accept practitioners of shamanism. Fear and dogma could destroy this cultigen in a second should it show up on their radar. So please share Sage of the Divine only with people of an open mind, never administer upon an unwitting or unready individual and keep its existence away from the ears of troughs who wish to schedule away our freedoms. Most importantly remember to enjoy lifeís journey and be safe.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


All functions
|
|
add_kmer_if_not_exists
|
Add k-mer to a hash map if it does not exist |
|
count_kmers()
|
Count k-mers |
|
count_kmers_helper
|
Count k-mers |
|
count_kmers_larger_than_one()
|
Count k-mers that contains more than one item |
|
count_kmers_str()
|
Count k-mers for string sequences (the size of k-mer should be larger than one) |
|
count_unigrams()
|
Count unigrams |
|
create_kmer
|
Create k-mer |
|
fill_encoded_int_vector
|
Encode sequence vector (replace items to numbers) |
|
fill_items_coding_maps
|
Prepare encoding and decoding hash maps for sequence items |
|
get_hash()
|
Get hash of k-mer that is in a given sequence |
|
get_hash_for_word()
|
Get hash of a sequence |
|
get_kmers
|
Get k-mers |
|
get_total_size_of_kmer
|
Get the total size of k-mer |
|
get_window_length()
|
Get k-mer window length |
|
is_kmer_allowed
|
Is k-mer allowed |
|
kmer-package
|
A short title line describing what the package does |
|
update_kmers
|
Update k-mers in a hash map |
|
update_kmers_with_alphabet
|
Update k-mers with alphabet |


soil {border-style px;} #ffffff;} climate microbial change communities px; {font-family community font-size double; elevation Climate abundance border-color border-width diversity effects environmental gradients solid; {font-style {font-weight Archaeorhizomycetes Elevation Microbial Research University bold climatic courier; em; fungal gradient plant pt;} temperature


- recognizeImage(ByteArrayInputStream) - Static method in class com.example.meditrackr.utils.ImageRecognition
-
- Record - Class in com.example.meditrackr.models.record
-
Record: Stores all information associated with a record object, including
0 to 10 images, a timestamp (date), a description, a title, a geolocation
and a body location.
- Record(String, String, String, BodyLocation) - Constructor for class com.example.meditrackr.models.record.Record
-
Constructs a new record object using title, description, date,
bodyLocation.
- RecordAdapter - Class in com.example.meditrackr.adapters.careprovider
-
This class displays all of the records of a problem selected from a previous page (using the
problem adapter) in a recycler view.
- RecordAdapter(FragmentActivity, RecordList) - Constructor for class com.example.meditrackr.adapters.careprovider.RecordAdapter
-
creating variables activity and records for the other functions to use
- RecordAdapter.ViewHolder - Class in com.example.meditrackr.adapters.careprovider
-
This class uses viewHolder to put information about each record into its own view so we won't
display information from one record as another.
- RecordController - Class in com.example.meditrackr.controllers.model
-
RecordController:
Allows for the adding and saving of
a record into both Elastic Search and
Memory
- RecordController() - Constructor for class com.example.meditrackr.controllers.model.RecordController
-
- recordExists(Record) - Method in class com.example.meditrackr.models.record.RecordList
-
Checks if a record is in the RecordList and returns
true or false accordingly.
- RecordFragment - Class in com.example.meditrackr.ui.careprovider
-
Created by Skryt on Nov 15, 2018
- RecordFragment() - Constructor for class com.example.meditrackr.ui.careprovider.RecordFragment
-
- RecordFragment - Class in com.example.meditrackr.ui.patient
-
shows user a list of the records associated with that problem in a recycler view.
- RecordFragment() - Constructor for class com.example.meditrackr.ui.patient.RecordFragment
-
- RecordList - Class in com.example.meditrackr.models.record
-
RecordList: A list of records.
- RecordList() - Constructor for class com.example.meditrackr.models.record.RecordList
-
- recordListSizeTest() - Method in class com.example.meditrackr.RecordListTest
-
- RecordListTest - Class in com.example.meditrackr
-
RecordList Unit Tests
- RecordListTest() - Constructor for class com.example.meditrackr.RecordListTest
-
- RecordsAdapter - Class in com.example.meditrackr.adapters.patient
-
this class will display all of the records associated with a problem in a recycler view.
- RecordsAdapter(FragmentActivity, RecordList, Context) - Constructor for class com.example.meditrackr.adapters.patient.RecordsAdapter
-
creating variables activity and records for the other functions to use
- RecordsAdapter.ViewHolder - Class in com.example.meditrackr.adapters.patient
-
this class uses viewHolder to put information to each problem into its own view so we wont display
information from one problem as another.
- RecordsFragment - Class in com.example.meditrackr.ui.careprovider
-
- RecordsFragment() - Constructor for class com.example.meditrackr.ui.careprovider.RecordsFragment
-
- RecordsFragment - Class in com.example.meditrackr.ui.patient
-
shows user a list of their created records in a recycler view.
- RecordsFragment() - Constructor for class com.example.meditrackr.ui.patient.RecordsFragment
-
- RecordTest - Class in com.example.meditrackr
-
- RecordTest - Class in com.example.meditrackr
-
Record Unit Tests
- RecordTest() - Constructor for class com.example.meditrackr.RecordTest
-
- RegisterAccount(Activity, Context, Profile) - Static method in class com.example.meditrackr.controllers.model.RegisterController
-
adds problem to database and locally
- RegisterController - Class in com.example.meditrackr.controllers.model
-
RegisterController
Allows for the registering of an account
and performs checks to ensure that the
account does not exist already.
- RegisterController() - Constructor for class com.example.meditrackr.controllers.model.RegisterController
-
- RegisterFragment - Class in com.example.meditrackr.ui
-
this fragment lets a user create a profile
the main parts to this fragment is a text box where user can input a username for their account
if the username is already in use or invalid there will be a toast message letting the user try again
there is a spot for the user to enter their phone number if phone number is invalid a toast message
will prompt the user to try again
there is a spot for the user to enter their email if the email is invalid a toast message
will prompt the user to try again
there are also two button for the user to indicate if they are a patient or care provider.
- RegisterFragment() - Constructor for class com.example.meditrackr.ui.RegisterFragment
-
- RegisterTest - Class in com.example.meditrackr
-
- RegisterTest() - Constructor for class com.example.meditrackr.RegisterTest
-
- removeComment(Comment) - Method in class com.example.meditrackr.models.CommentList
-
Remove a comment from the list.
- removeImage(byte[]) - Method in class com.example.meditrackr.models.record.PhotoList
-
Removes an image from the PhotoList.
- removeImageTest() - Method in class com.example.meditrackr.ImageListTest
-
- removeProblem(Problem) - Method in class com.example.meditrackr.models.ProblemList
-
removes a problem from the list using that problem
- removeProblem(int) - Method in class com.example.meditrackr.models.ProblemList
-
removes a problem from the list using an index
- removeProfile(Profile) - Method in class com.example.meditrackr.models.ProfileList
-
removes a profile from the profile list
- removeProfileTest() - Method in class com.example.meditrackr.ProfileListTest
-
- removeRecord(Record) - Method in class com.example.meditrackr.models.record.RecordList
-
Removes a Record object from the RecordList.
- removeRecord(int) - Method in class com.example.meditrackr.models.record.RecordList
-
Removes a Record object from the RecordList.
- removeRecordTest() - Method in class com.example.meditrackr.RecordListTest
-
- reset() - Method in class com.example.meditrackr.ProblemTest
-
- reset() - Method in class com.example.meditrackr.RegisterTest
-


Just for funzies, I will talk about some of the cool tools we use at Mobify.
Bootstrap has been a very useful tool for rapidly building prototypes for our projects.
Sublime is also the default text editor commonly used by our team, except for Ryan! I love the vim integration, personally.
Divvy is a fantastic product that we use for window management - we all use Macbook Airs and Pros (you'll get a free one if you come work for us!).
Localtunner is a great little tool that allows you to expose code running on localhost trapped by your NAT to the world!
We use an amazingly fantastic tool for HTTP debugging called Charles.
Annnnd I'm done. You can actually find this full list at our blog :)


Full-Stack Web Developer and Front-End Engineer.
I have finally found something that I am very passionate about. I love the problem solving that goes hand-in-hand with quality development. I love working as a team and individually to accomplish meaningful things. My ambition is to create things that have a purpose and are applicable in others lives.
Contact me about project ideas, job opportunities, or website consultation.


ParkIt
Settings
List a Parking Spot
Find a Parking Spot
Add New Spot
Coming Soon!
Select Location
Settings
Coming Soon!
Joan's Parking Spot
Availability:
Content
Price Per Hour:
Content
Description:
Content
Book It Now
Checkout Info
How Many Minutes Will You Park (15 minute increments):
First Name:
Last Name:
Email:
Card Number:
Card Expiration Date (mmyy):
Zip/Postal Code:


To use this repo on your site, add the following lines to your pacman.conf:
[amylum] SigLevel = Required Server = https://<%= @repo_domain %>
You'll need to add the repo's GPG key to pacman's keyring so that pacman can verify the package and repo signatures.
pacman-key --recv-key <%= @repo_key_id %> pacman-key --lsign <%= @repo_key_id %><% if @repo_gpg_urls -%>
Here are a couple places you can use to verify the above key:
This repo is build and served by these open source repos


Toggle navigation
GeoTrellis
Transit
API
Scenic Route Demo
GitHub
GeoTrellis Docs
Travelshed Options
Starting Location
Search
Departing
Departing
Arriving
Date & Time
Weekday
Weekday
Saturday
Sunday
Travel Time in Minutes
0m
10m
15m
20m
30m
40m
50m
+ Advanced Options
Show Vector
Dynamic Rendering
Opacity


Othello Class Reference
List of all members.
Public Member Functions |
|
| Othello (Player *player1, Player *player2, BoardWidget *board, bool turn) |
| bool | allowed (QList< QPoint * > *, const int, const int) |
|
bool | allowed (const int, const int) |
|
Player * | updateBoardTableStateAllowedMoves (const int, const int) |
|
Player * | updateBoardTableStateAllowedMoves (unsigned char **, QList< QPoint * > *, const int, const int) |
| void | initializeTableStateAndAllowedMoves () |
|
QString * | getTableState () |
|
QString * | getAllowedMoves () |
|
int | getNextTurn () |
|
void | setNextTurn (int t) |
|
void | setTableState (QString &state) |
|
void | setAllowedMoves (QString &moves) |
|
void | setMaxDepth (int depth) |
|
int | getMaxDepth () |
| QList< QPoint * > * | getAllowed () |
| unsigned char ** | getState () |
| bool | updateAllowedMoves (QList< QPoint * > *, unsigned char **) |
|
bool | getP2Turn () |
|
void | setBoolNextTurn (bool) |
|
bool | getBoolNextTurn () |
| void | updateBoardTableState (unsigned char **, const int, const int, bool) |
Member Function Documentation
| bool Othello::allowed |
( |
QList< QPoint * > * |
allowed, |
|
|
const int |
i, |
|
|
const int |
j | |
|
) |
| | |
returns true if the move is legitimate else returns false
| QList< QPoint * > * Othello::getAllowed |
( |
|
) |
|
Returns the allowed moves list
| unsigned char ** Othello::getState |
( |
|
) |
|
Returns the state of the table
| void Othello::initializeTableStateAndAllowedMoves |
( |
|
) |
|
initialiazes the tableState array and the allowedMoves array. in the tableState array, empty/green = 0, black = 1, white = 2 in the allowedMoves array, not legitimate move = false, legitimate move = true
| bool Othello::updateAllowedMoves |
( |
QList< QPoint * > * |
allowed, |
|
|
unsigned char ** |
state | |
|
) |
| | |
Updates the allowed moves. Returns true if there are available moves Returns false if there are no available moves allowed Moves are stored in the argument list(allowed)
| void Othello::updateBoardTableState |
( |
unsigned char ** |
state, |
|
|
const int |
i, |
|
|
const int |
j, |
|
|
bool |
changeIcons | |
|
) |
| | |
updates the board and the tableState array, with the move at (i,j)
The documentation for this class was generated from the following files:


{% extends "pages/page.html" %} {% load mezzanine_tags %} {% load i18n %} {% block main %} {{ block.super }}
{% trans "An error ocured with your payment, please try again (mayve with the link you get in confirmation email) or contact us by email." %}


{% load static %}
Notary Service programmed by Jan Paricka
{% block content %}{% endblock content %} {% include "google_analytics.html" %}


|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
| Interface Summary | |
|---|---|
| DirectedGraph<V,E> | A tagging interface for implementations of Graph
that accept only directed edges. |
| Forest<V,E> | An interface for a graph which consists of a collection of rooted directed acyclic graphs. |
| Graph<V,E> | A graph consisting of a set of vertices of type V
set and a set of edges of type E . |
| Hypergraph<V,E> | A hypergraph, consisting of a set of vertices of type V
and a set of hyperedges of type E which connect the vertices. |
| KPartiteGraph<V,E> | An interface for graphs whose vertices are each members of one of 2 or more disjoint sets (partitions), and whose edges connect only vertices in distinct partitions. |
| MultiGraph<V,E> | A tagging interface which indicates that the implementing graph accepts parallel edges. |
| Tree<V,E> | A subtype of Graph which is a (directed, rooted) tree. |
| UndirectedGraph<V,E> | A tagging interface for extensions of Graph that
accept only undirected edges. |
| Class Summary | |
|---|---|
| AbstractGraph<V,E> | Abstract implementation of the Graph interface. |
| AbstractTypedGraph<V,E> | An abstract class for graphs whose edges all have the same EdgeType . |
| DelegateForest<V,E> | An implementation of Forest that delegates to a specified DirectedGraph
instance. |
| DelegateTree<V,E> | An implementation of Tree that delegates to
a specified instance of DirectedGraph . |
| DirectedOrderedSparseMultigraph<V,E> | An implementation of DirectedGraph , suitable for sparse graphs,
that orders its vertex and edge collections
according to insertion time. |
| DirectedSparseGraph<V,E> | An implementation of DirectedGraph suitable for sparse graphs. |
| DirectedSparseMultigraph<V,E> | An implementation of DirectedGraph , suitable for sparse graphs,
that permits parallel edges. |
| GraphDecorator<V,E> | An implementation of Graph that delegates its method calls to a
constructor-specified Graph instance. |
| ObservableGraph<V,E> | A decorator class for graphs which generates events |
| OrderedKAryTree<V,E> | An implementation of Tree in which each vertex has
<= k children. |
| OrderedSparseMultigraph<V,E> | An implementation of Graph that orders its vertex and edge collections
according to insertion time, is suitable for sparse graphs, and
permits directed, undirected, and parallel edges. |
| SetHypergraph<V,H> | An implementation of Hypergraph that is suitable for sparse graphs and
permits parallel edges. |
| SortedSparseMultigraph<V,E> | An implementation of Graph that is suitable for sparse graphs,
orders its vertex and edge collections according to either specified Comparator
instances or the natural ordering of their elements, and permits directed, undirected,
and parallel edges. |
| SparseGraph<V,E> | An implementation of Graph that is suitable for sparse graphs and
permits both directed and undirected edges. |
| SparseMultigraph<V,E> | An implementation of Graph that is suitable for sparse graphs
and permits directed, undirected, and parallel edges. |
| UndirectedOrderedSparseMultigraph<V,E> | An implementation of UndirectedGraph that is suitable for sparse graphs,
orders its vertex and edge collections according to insertion time, and permits
parallel edges. |
| UndirectedSparseGraph<V,E> | An implementation of UndirectedGraph that is suitable
for sparse graphs. |
| UndirectedSparseMultigraph<V,E> | An implementation of UndirectedGraph that is suitable for
sparse graphs and permits parallel edges. |
Interfaces for the JUNG graph types, and some representative implementations.
A graph consists of a set of vertices set and a set of edges which connect the
vertices. The base interface is Hypergraph
, which defines the most
general type of graph; other interfaces (Graph
, DirectedGraph
, etc.)
define more restrictive graph types.
Vertex and edge types are specified at compile type using Java 1.5 generics.
Types of graphs which are supported include (but are not limited to)
Comparator
Notes:
{add,remove}{Edge,Vertex}
, or
in the constructor.
"Wrapper" graphs are available through GraphDecorator
; these are useful
if you want to create a graph implementation that uses another implementation to do the work,
and adds some extra behavior. (One example: ObservableGraph
, which notifies
registered listeners when graph mutations occur.)
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |


Fits everything on all your devices.
Create custom landing pages with Omega that convert more visitors than any website. With lots of unique blocks, you can easily build a page without coding.
Faster Development UI Kits
With lots of unique blocks, you can easily build a page without coding. Build your next landing page quickly.
Faster Development UI Kits
With lots of unique blocks, you can easily build a page without coding. Build your next landing page quickly.


Tropical Storm Raymond forms in Pacific off western Mexico | Honolulu Star-Advertiser
MEXICO CITY >> Tropical Storm Raymond has formed in the eastern Pacific off Mexico and is forecast to head in the direction of the resort-studded Los Cabos area of the Baja California Peninsula.
The U.S. National Hurricane Center reports that Raymond has maximum sustained winds of 45 mph.
Its center was about 610 miles south of the peninsula’s tip as of 5 a.m. Hawaii time, and headed toward the north-northwest at 7 mph.
Although Raymond is expected to strengthem a little over the next day or so, forecasters expect weakening to occur by Sunday, with the storm degenerating into a remnant low by late Sunday or early Monday.
The southern part of the peninsula is a popular destination for domestic and international tourists, home to the twin resort cities of Cabo San Lucas and San Jose del Cabo. The storm could reach the area in a few days.


THE LOST WORLD: JURASSIC PARK A film review by Geoff Cashman Copyright 1997 Geoff Cashman
In a word: Pathetic
It is exceptionally rare that I ever think poorly of a movie. I tend to be very easy to sway with movies.
Jurassic Park, the original, was an outstanding movie from a few different perspectives. The special effects were of course amazing, and even today people talk about them. The acting was tolerable or better, and had some excellent moments. It was easy to get involved in the movie (for me) and actually be concerned about the fate of most of the characters (though the lawyer was a dead giveaway as a deadman). I still pop this movie into the VCR occasionally, 4 years after it was released. I think that says enough.
This sequel pales in comparison.
First, the acting... There were some very minor moments when the acting became acceptable, but for the most part it was horrid. Jeff Goldblum is a talented individual, but working as a lead without other strong acting leaves him blowing in the breeze. His one liners added a strong dimension to the original, and ruined this movie. The rest of the actors were dismal for the most part. The would-be predator queen is fake and depthless. The second Ingen team leaders are pathetic, droll, remakes of a mishmash of characters from 1950s movies. The evil corporate nasty nephew is so awful he incited giggles in me.
Casting: Tolerable for the most part. But why an African-American for Goldblum's kid? Completely shallow point to attempt to make the movie politically correct (in-movie comments about noting that she couldn't be his real kid was disgusting at best). Sprinkle in pointless environmentalist, would-be do-gooder team leader, and well it just becomes pathetic.
Plot: Hi! Let's make a second island so that we can trash another forest! Totally unbelievable in fabrication. Next, let's make a theme park complete with a name and gosh nobody noticed it being built and wondered what it was for. Add in lame attempts at making t-rex seem parental (wtf for?
In the first movie, the dinosaurs had depth. The raptors were incredible, and done exceptionally well. The T-rex was left as he should be for a movie of this kind...a semi-psychotic carnivore of massive proportions. Any efforts at giving depth to the big reptillian birds in this one was like lofting a feather in a gale force breeze.
Stupid scenes:
o People standing on a dock watching a freighter coming at them at 26kts and *not* running until it crashes into the dock. o Getting into the high hide or whatever they called it. Ummm... can't the jeep holding the cable be broken? Umm... Can't the tree be knocked down? Ummm... is there a functional problem here? Nah, couldn't be. This is a Speilberg movie. o Dinosaur breaks leg. Let's save it while the parents are looking for it. They won't look here will they? The T-rex just has the largest olfactory cavity of any of them. He own't smell us here. Nope. Neither will momma T-rex. Not a chance. COMPLETELY manufactur scene. o Raptors attack party, picking off people at the back of the running group of about people. Nobody notices a thing until they're the next one getting jumped by a raptor. Duh, gee George, what's all that noise behind us? Shouldn't we like, duh, check it out? No Lenny, keep running, and don't use your gun. Criminy.  Action movie? Eat fest is more like it. o Let's all run down this valley while being chased by a t-rex and run into this waterfall. No, we don't know what's behind it.... probably a wall, but let's run into it anyways. Oh wow! There's a cave here! Oh my, that T-rex tongue feels amazingly like an R.O.U.S. (Princess Bride reference). o The stampede scene was ludicrous. Gizmodified jeeps and cycles chase down rampaging horde of dinosaurs. Insert Token to play game.
I could rattle on here for a while. Heck, if I continued I might have a chance of boring everyone as much as this movie bored me.
The *only* strong point about the movie was the special effects. This computer imaging stuff is really coming along nicely, and it's beginning to become indistinguishable from the real thing. The effects deserve a nomination if not an Oscar. Bravo!
Quick summary: This movie was a complete money grab. After Speilberg did Schindler's List it seemed like he was really trying to make a go of it as an artist, rather than a capitalist with alot of movie making talent. Now, I'm not so sure. This movie is raking in big bucks (breaking every major record in its first 4 days of release, over $100 million already in the coffers) though and that will keep the studio happy. Horrible acting, totally manufactured plot in development and execution, and outstanding special effects make for a movie that is pure eye candy and nothing more.
One the Dino scale: 4 unhatched compy eggs out of a possible 4 mature T-Rexs.
Bleah.
- Geoff
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


What we do
Most gym goers and trainers have experienced kettlebells. These peculiar looking weights are not the novelty they were ten years ago and now have a place in many training facilities. However, most people only have seen and been taught to use these cannonballs with handles as a fitness tool. Many athletes remain oblivious that they have been used for over sixty years as integral tool of a fully-fledged sport.
The first official girevoy sport (the original Russian name of the sport) competition was held in 1948 in the old USSR and it developed from there across the 1950s and ‘60s. This advancement came mainly from the military, who had seen how this form of training benefited the troops. In the ‘70s, girevoy sport entered the National Sports Federation as the official ethnic sport of Russia
Kettlebell Sport is “endurance weightlifting".

Watch the movement here.
Kettlebell Snatch lift
The snatch is performed by swinging the kettlebell between your legs and brought up to the overhead position in one uninterrupted motion. Only one hand switch is permitted in 10 mins.
Watch the movement here.
Kettlebell Long Cycle lift
The long cycle requires for a clean before each jerk for 10 mins.
Watch the movement here.
There are many more kettlebell techniques we teach and practice during training, but we do not compete in them.


Splines are extremely useful to represent data when the underlying model is unknown or expensive to compute. I use them as a part of my cosmological calculations. In this post I explore the publicly available codes for computing splines. Here is an example of a noisy sine curve in [0,4pi] and smoothed spline curve obtained with GSL B-splines.
Gnu Scientific Library (GSL)
GSL offer B-splines as a part of the library. In c/c++ we can use the functionality by
#include <gsl/gsl_bspline.h>
An example program can be found here
Eigen library
Eigen is known for its excellence in linear algebra. It also offers a large set of unsupported modules. Splines is one of them. Below you can find a simple code I found in KDE forum
#include <unsupported/Eigen/Splines>
typedef Spline<double,2> Spline2d;
typedef Spline2d::PointType PointType;
typedef Spline2d::KnotVectorType KnotVectorType;
typedef Spline2d::ControlPointVectorType ControlPointVectorType;
ControlPointVectorType points = ControlPointVectorType::Random(2,100);
const Spline2d spline = SplineFitting<Spline2d>::Interpolate(points,3);
KnotVectorType chord_lengths; // knot parameters
Eigen::ChordLengths(points, chord_lengths);
for (Eigen::DenseIndex i=0; i<points.cols(); ++i)
{
PointType pt = spline( chord_lengths(i) );
PointType ref = points.col(i);
VERIFY( (pt - ref).matrix().norm() < 1e-14 );
}
Einspline library
Einspline library offers excellent spline fitting facilities. There are several bases available, for example, linear, logarithmic and general. The code is written in c and runs fast. We can get the 1-D splines by including
#include <nubspline.h>
Benchmarking splines
I needed to see how each of these libraries compare to each other and decided to code up a benchmarking repository in github. It can be found here


The Permanent Weekend House / Comte/Meuwly
- Curated by Paula Pintos
- about 15 hours
Houses · Geneva, Switzerland
- version="1.0" encoding="UTF-8"? Architects: Comte/Meuwly
- AreaArea of this architecture projectArea: 140.0 m2
- version="1.0" encoding="UTF-8"?YearCompletion year of this architecture project Year: 2019
- version="1.0" encoding="UTF-8"?ManufacturersBrands with products used in this architecture project Manufacturers: EGM, Gachet, Lanthmann Constructuon Bois, Reynobond
- Lead Architects Adrien Comte, Adrien Meuwly
More Specs Less Specs
Text description provided by the architects. The Permanent Weekend House is an extension to a relic of the bourgeois style chalet, built in 1910, on a very long and narrow plot, in a beautiful garden outside of the city of Geneva. One of these idyllic prefabricated wooden structures, placed in a bubble of peacefulness away from the center’s frenzy. Yet, over the last century, the growing city and related industries have slowly merged with the suburban periphery where the weekend house was built. A major train track on the south planes regularly flying overdue to the proximity of the airport, the cantonal oil reserve at the end of the street, a bunch of industries, large sports fields, and of course, a huge shopping mall.
The Permanent Weekend House intends to extract and reinforce the essence of the situation it currently finds itself in: a thin, long structure, extruding the main existing living room through the greenery, a single and long space incorporating different functions in the core of the garden, an enfilade of different programmatic places.
The thinness of the house allows its interpenetration with the garden; with all windows that can be completely opened, creating a kind of covered space in the greenery. In the Permanent Weekend House, the blurriness between inside and outside is reinforced by the facade’s regular succession of glass and aluminum planes, merging the new structure within the garden.
Whereas the original weekend house typology was promoting long sunny afternoons in the garden in front of the chalet, the permanent weekend house should allow one to live in the garden during the entire year.


Shouldn't we all expect something more than terminal commands to gain useful features?
Rsync-GUI is a small front-end application that makes reducing copy times by using rsync a bit easier.
| Section 01: The original Rsync (terminal version) |
You should know what rsync is. It is the terminal command (mac/linux) that simply takes a command (rysnc and flags) along with two file paths and copies one into another.
One bit of awesomeness...
Copy times are GREATLY reduced when rsync is set to include only the files that have changed, overwriting only what it needs to. This is done typically with the '-au flags'.
In my opinion, this feature is sorely lacking in the finder itself. (Which, integrating an rsync copy into the Finder itself might be an interesting project for another time.) |
| Section 02: Enter Rsync-GUI sl |
|
A small app to make this operation easier. Just drag in two files and press sync (Cmd-Enter). The -au flag is added by default. The most often used options in rsync have control buttons and switches. That's it, that's all this app does.
Also, we do not at this time support remote connections or logins. Just simple, local connections through the finder. Hence, the 'sl' at the end of the app name.
|
| Section 03: Preferences |
Position, size, colors & other default niceties
If you use rsync often, you might have it visible and you should be able to change the color and other basic features.
To do so, just launch the preferences (Cmd-,) and make adjustments.  This is a known bug. However, the ability to pick a color is NOT affected.
|
| Section 04: Copy folder contents |
The trickiness of coping folder contents
If you use rsync often, you will get in the habit of putting a slash ('/') at the end of your first entry to indicate that you'd like to copy the folder contents (as opposed to the folder itself). If you don't check this, you'll likely run the risk of copying your source folder to the inside of your target destination folder.
Rsync-GUI simplifies the task of inputting this setting for you with a handy radio button (whose setting is remembered).
|
| Section 05: Minimized Interface |
Position, size, colors & other defaults
If you use rsync often, you might want to keep it open and have it take up the least amout of real estate on your desktop as possible.
To quickly toggle to a minimized version of the interface, use the 'Minimized Interface' command (Cmd+Shift+M).
|
Rsync-GUI is free, I did it for fun.


Home
Client Side Encryption
This workshop demonstrates client side encryption
Let's do some client side encryption
Open the Cloud9 IDE environment called workshop-environment and navigate to the data-protection/usecase-2 directory. Follow the steps below:
1. Run the module named kms_key_creation-Step-1.py
- You should see "KMS Master Key with alias name kms_key_cse_usecase_3 successfully created" printed in the runner window pane below.
- This python module will create a KMS master key with the key alias kms_key_cse_usecase_2
- Browse to the KMS console and you should find the key alias kms_key_cse_usecase_2 under customer managed keys
2. Run the usecase-2-Step-2.py python module .
- The runner pane should print "Module run was successful !!"
- You will find a file called plaintext_u.txt which is the plaintext unencrypted file
- The module usecase-2-Step-2.py encrypts the plaintext_u.txt file
- The encrypted file is created and is called encrypted_e.txt
- You should see "Module run was successful" printed in the runner window pane below
3. Check the decrypted file
- The encrypted file encrypted_e.txt is then decrypted
- The decrypted file is called plaintext_u_cycled.txt
4. Check whether the encryption and decryption process was successful
- Check whether theplaintext_u.txt and plaintext_u_cycled.txt have the same content
- This indicates that the client side encryption and then decryption was successful
5. Wait for 2 minutes and then Run the check-gendatakey-Step-3.py python module
- The check-gendatakey-Step-3.py is checking for whether a GenerateDataKey API call was logged by cloudtrail and this event was then sent to a cloudwatch event rule.
- If all things go well, you should see "GenerateDataKey API Called" in the runner window below. If you don'things see this print wait for a minute and try again
6. Run the usecase-2-cleanup-Step-4.py python module
- You should see Cleanup Successful printed in the runner window pane below
- This modules deletes the kms key and it's alias that we created in kms_key_creation-Step-1.py .It also deletes all the files that were created in the usecase-2 folder
- Please remember that every time you run usecase-2-cleanup-Step-4.py ,if you want to re-run this uecase, you will have to start from Step 1
Some questions to think about :
- Why do we wait for 2 minutes in Step 5 ?


Provide system object definitions (
SystemObject
and system object management service (
SystemManagerImpl
), tests can access those services using the 'system' member.


Chat and Voice interface to Thermostats at
https://nest.com/
(C) 2015 Anton Kolonin at
http://aigents.com/


Colin Bridger
"I'm really happy to purchased this item! It has an incredible slider builder! It will be the base of my future projects!"
Alyssa Thompson
"Guys, you are fantastic! You created the most user friendly slider I ever used!""
Tracie G. Murrieta
"Absolutely the best slider I tried! It's far worth the price. Thank you for such a great product!"
Wiley Troy
"The most intuitive Interface I have ever used. Incredible transitions and features!"


Kontra.assets
A promise based asset loader.
kontra.assets.load('../imgs/character.png', '../data/tile_engine_basic.json', ['/audio/music.ogg', '/audio/music.mp3'])
.then(function() {
// all assets have loaded
}).catch(function(err) {
// error loading an asset
});
Table of Contents
kontra.assets.audio
{object}
Object of all loaded audio assets by both file name and path. If audioPath was set before the audio was loaded, the file name and path will not include the audio base path.
kontra.assets.load('/audio/music.ogg')
.then(function() {
// Audio asset can be accessed at both
// name: kontra.assets.audio['/audio/music']
// path: kontra.assets.audio['/audio/music.ogg']
});
kontra.assets.audioPath = '/audio';
kontra.assets.load('sound.ogg')
.then(function() {
// Audio asset can be accessed at both
// name: kontra.assets.audio.sound
// path: kontra.assets.audio['sound.ogg']
});
kontra.assets.audioPath
{string}
Base path for all audio assets. If a base path is set, all load calls for audio assets will prepend the base path to the URL.
kontra.assets.audioPath = '/audio';
kontra.assets.load('music.ogg'); // loads /audio/music.ogg
kontra.assets.data
{object}
Object of all loaded data assets by both file name and path. If dataPath was set before the data asset was loaded, the file name and path will not include the data base path.
If the data asset is a JSON file, it will automatically be parsed.
kontra.assets.load('../data/file.txt')
.then(function() {
// Data asset can be accessed at both
// name: kontra.assets.data['../data/file']
// path: kontra.assets.data['../data/file.txt']
});
kontra.assets.dataPath = '/data';
kontra.assets.load('info.json')
.then(function() {
// Data asset can be accessed at both
// name: kontra.assets.data.info
// path: kontra.assets.data['info.json']
});
kontra.assets.dataPath
{string}
Base path for all data assets. If a base path is set, all load calls for data assets will prepend the base path to the URL.
kontra.assets.dataPath = '/data';
kontra.assets.load('file.json'); // loads ../data/file.json
kontra.assets.images
{object}
Object of all loaded image assets by both file name and path. If imagePath was set before the image was loaded, the file name and path will not include the image base path.
kontra.assets.load('../imgs/character.png')
.then(function() {
// Image asset can be accessed at both
// name: kontra.assets.images['../imgs/character']
// path: kontra.assets.images['../imgs/character.png']
});
kontra.assets.imagePath = '/imgs';
kontra.assets.load('character_walk_sheet.png')
.then(function() {
// Image asset can be accessed at both
// name: kontra.assets.images.character_walk_sheet
// path: kontra.assets.images['character_walk_sheet.png']
});
kontra.assets.imagePath
{string}
Base path for all image assets. If a base path is set, all load calls for image assets will prepend the base path to the URL.
kontra.assets.imagePath = '/imgs';
kontra.assets.load('character.png'); // loads ../imgs/character.png
kontra.assets.load(url[, ...])
- url {string | string[]}
- The path or paths to the file.
Load Image, Audio, or data assets using promises. You can pass it as many assets as you want.
Once an asset is loaded, it will be accessible by its file name and path from either the kontra.assets.audio, kontra.assets.data, or kontra.assets.images objects, depending on its type.
You can specify multiple audio formats by putting them inside an array and the loader will determine which format to load based on the current browsers support. Order of the array designates audio preference.
Since the loader will determine which audio asset to use, you should only reference the audio by its name and not by its file path since there's no guarantee which asset was loaded.
kontra.assets.load('../imgs/character.png', '../data/tile_engine_basic.json', ['/audio/music.mp3', '/audio/music.ogg'])
.then(function() {
// access audio by its name only (not by its .mp3 or .ogg path)
kontra.assets.audio['/audio/music'].play();
})
.catch(function(err) {
// error loading an asset
});


three.js
- Simulating Electron Micrograph with
Shaders
. Model from
The GeorgiaTech Lagre Geometric Model Archive
.


static
variables which are not guaranteed to be initialized upon class initialization.
Example:
class Foo { public static int bar; static { } }Note: this inspection uses a very conservative dataflow algorithm, and may report static variables as uninitialized incorrectly. Variables reported as initialized will always be initialized.
Use the checkbox below to indicate whether you want uninitialized primitive fields to be reported.


gridfile.add
Catalogue a data source in a .grid file
Syntax
Description
Adds a data source file to the .grid file catalogue. Supported data sources include NetCDF variables, MAT-file variables, and delimited text files. The syntaxes for different data source types are detailed below. Data stored in a data source must be compatible with numeric data types. Compatible types include double, single, char, logical, int* and uint* data types.
obj.add(‘netcdf’, …)
Adds a NetCDF variable to the .grid file catalogue. The NetCDF can be accessed either via a local file, or opendap URL.
Adds a variable saved in a MAT-file to the .grid file catalogue.
obj.add(…, opts)obj.add(…, Name, Value)
Adds data stored in a delimited text file to the .grid file catalogue.
Input Arguments
type
string scalar
The type of data source file. Options are:
[‘nc’ | ‘netcdf’]: NetCDF file
[‘mat’]: MAT-file
[‘txt’ | ‘text’]: Delimited text file
file
string scalar
The name of a data source file. Name may either be an absolute file path, or the name of a file on the active path.
opendapURL
string scalar
An OPENDAP url to a data source file
variable
string scalar
The name of a variable in a NetCDF or MAT-file. Only this variable is catalogued in the gridfile.
dimensions
string vector
The order of dimensions for data in the data source. Dimensions with repeated names are merged when loading data from the gridfile.
metadata
scalar gridMetadata object
Dimensional metadata for the data source. The number of rows must match the length the size of the dimension in the data source. Must include metadata for all non-singleton dimensions in both the gridfile and data source. Metadata values for gridfile dimensions must exactly match a sequence of gridfile metadata for the dimension. If the metadata has non-dimensional attributes and/or a set dimension order, the attributes and/or dimension order will be ignored.
opts
ImportOptions object
Additional options for importing data from delimited text files using the builtin “readmatrix” function.
Name,Value
name-value pairs
Additional import options for reading data from a delimited text file using the builtin “readmatrix” functions. (See the readmatrix reference page for supported pairs.)


*Application tries to get current location from HTML5 navigator and ipinfo.io, if thoose server fails or browser has not support it loads Sarajevo coordinates
*Currently showing {{publicVenuesListCtrl.order.title}} venues matching search query


2 Samuel 11:12
And David said to Uriah, Tarry here to day also, and to morrow I will let thee depart. So Uriah abode in Jerusalem that day, and the morrow.


Total Savings {{result?.saving.split(".")[0]}}{{result?.saving.split(".")[1]}}
Start Date {{startDate}}
Savings will be credited your account if you buy
My PortfolioUtility AccessSolar AccessNotificationsHourly SavingsDaily SavingsMonthly SavingsNew Product ReleaseGovt Energy Policy ChangesGovt New Initiatives


--- layout: post bodyClass: gen-theme gen-drinking-list theme-carlin-at-carnegie title: "George Carlin, Carlin at Carnegie" date: 2016-10-08 01:00:00 last_modified_at: 2016-10-07 01:00:00 excerpt: "George Carlin, Carlin at Carnegie, 1982, the Drinking Game" categories: Stand-Up tags: George Carlin, Carlin at Carnegie, Stand-up, comedy, drinking game image: feature: carlin-at-carnegie.jpg topPosition: 0px bgContrast: dark bgGradientOpacity: darker syntaxHighlighter: no ---
One of the greatest comedians of all time, George Carlin, performing one of the greatest stand-up sets of all time, Carlin at Carnegie. Grab a drink and and put it somewhere stable so you don't spill it from laughing too hard. RIP George Carlin (1937 - 2008)


Enumerable Methods
-- ++++++ --
December 2014
The enumerable method “group_by” in Ruby can be very useful when we want to group elements in an array or hash in a certain way depending on their behavior, or “response”, to a certain question. Let’s say, for instance, that we have the numbers 1 through 100, and that we want to group together all the numbers that, when divided by five, will give a certain remainder. In this case, we could write the following code: (0..100).group_by { |num| num % 5 }. We would then get a list of each of the numbers in 0 through 100 clustered together according to their remainder when divided by five. All numbers, such as 5, 10, 15, 20, and so on, which are perfectly divisible by five and thus when divided by 5 have a remainder of 0, would be clustered together. The same would be true for all numbers that when divided by 5 give a remainder of 1, of 2, and so on.
Another example of this might be if we wished to group together all elements, say names in this case, of the same length. In order to do this, in the block, we would simply call the .length method on each of the elements in the array of names upon which we are calling the .group_by method. For instance: array_of_names.group_by { |name| name.length }.
In essence, “group_by” allows us to group together all elements whose result after being put through a certain formula (stimulus) is the same.


|
GroupListWidget Pile
version 0.0.1
The pile attempts to provide a widget that is capable of presenting
|
A model that is to be installed into a GroupListWidget. More...
#include <groupmodel.h>
Public Types | |
| enum | { BaseColRole = Qt::UserRole + 1000 } |
| enum | ComparisionReslt { Equal = 0, Smaller = -1, Larger = 1 } |
| The result of comparing two values. | |
| typedef ComparisionReslt(* | Compare) (GroupModel *model, int column, const QVariant &v1, const QVariant &v2) |
| Compare two QVariants. | |
Signals | |
| void | modelAboutToBeReset () |
| Before the actual changes are implemented. | |
| void | modelReset () |
| After the model was updated. | |
Public Member Functions | |
| GroupModel (QAbstractItemModel *model=NULL, QObject *parent=NULL) | |
| Default constructor. More... | |
| virtual | ~GroupModel () |
| Destructor. | |
| virtual void | setBaseModel (QAbstractItemModel *model, int grouping_col=-1, int sorting_col=-1, Qt::SortOrder group_dir=Qt::AscendingOrder, Qt::SortOrder sort_dir=Qt::AscendingOrder) |
| Sets the user model. More... | |
| virtual QAbstractItemModel * | baseModel () const |
| Retreive user model. More... | |
| QAbstractItemModel * | takeBaseModel () |
| Take ownership of user model. More... | |
| virtual void | setPixmapColumn (int column) |
| Sets the column in base model that provides the image for the icon. | |
| virtual int | pixmapColumn () const |
| Retreive the column in base model that provides the image for the icon. | |
| virtual void | setPixmapRole (Qt::ItemDataRole role) |
| Sets the role in base model that provides the image for the icon. | |
| virtual Qt::ItemDataRole | pixmapRole () const |
| Retreive the role in base model that provides the image for the icon. | |
| virtual QPixmap | pixmap (int row) const |
| Retreive the pixmap for a particular row. | |
| virtual void | setUserData (const QVariant &value) |
| Sets some opaque data useful for the user. | |
| virtual const QVariant & | userData () const |
| Retreive the opaque data useful for the user. | |
Labels | |
The model can present one or more labels for each item. The methods in this group allow the user to manage the list of column:role pairs for each label.
| |
| const ModelId & | label () const |
| Column and role for main label. | |
| int | labelCount () const |
| Number of labels. | |
| ModelId | label (int idx) const |
| Column and role for a label. | |
| void | addLabel (const ModelId &value) |
| Add the column and role for an additional label to be presented to the user. | |
| void | addLabel (int column, Qt::ItemDataRole role=Qt::DisplayRole) |
| Add the column and role for a label to be presented to the user. | |
| void | setLabel (const ModelId &value) |
| Set the column and role for main label. | |
| void | setLabel (const ModelId &value, int idx) |
| Set the column and role for a label. | |
| void | setLabel (int column, Qt::ItemDataRole role=Qt::DisplayRole, int idx=0) |
| Set the column and role for a label. | |
Static Public Member Functions | |
| static ComparisionReslt | defaultCompare (GroupModel *model, int column, const QVariant &v1, const QVariant &v2) |
| Default implementation for comparision function. More... | |
Protected Member Functions | |
| virtual QStringList | columnLabels (const QList< int > &scols, int *idx_crt, int highlite) const |
| Implementation used by sortingColumnLabels() and groupingColumnLabels () | |
| void | resetAllSubGroups () |
| Reset all sub-groups models. | |
Grouping | |
All methods related to grouping are gathered in this section. | |
| virtual int | groupingColumn () const |
| Retreive the column in base model that decides grouping. | |
| virtual int | isGrouping () const |
| Tell if we're grouping the records or not. | |
| virtual void | setGroupingRole (Qt::ItemDataRole role) |
| Sets the role in base model that decides grouping. | |
| virtual Qt::ItemDataRole | groupingRole () const |
| Retreive the role in base model that decides grouping. | |
| virtual void | setGroupLabelRole (Qt::ItemDataRole role) |
| Sets the role in base model that provides group label. | |
| virtual Qt::ItemDataRole | groupLabelRole () const |
| Retreive the role in base model that provides group label. | |
| virtual Qt::SortOrder | groupingDirection () const |
| Retreive the direction of grouping. | |
| virtual void | setGroupingFunc (Compare value) |
| Sets the function used to assign records to groups. | |
| virtual Compare | groupingFunc () const |
| Retreive the function used to assign records to groups. | |
| virtual GroupSubModel * | group (int idx) const |
| Get the group at a particular index. | |
| virtual int | groupCount () const |
| Get the number of groups curently defined inside this model. | |
| virtual QList< int > | groupingColumns () const |
| Retreive the list of columns where grouping can be applied. | |
| virtual QStringList | groupingColumnLabels (int *idx_crt) const |
| Retreive the labels for all columns where grouping can be applied. | |
| void | groupingChanged (int column, Qt::SortOrder) |
| The direction (NOT the column) of the grouping has changed. | |
| virtual void | buildAllGroups () |
| Constructs all groups. More... | |
| virtual void | buildNoGroupingGroup () |
| Special case when no grouping is enabled. More... | |
| virtual void | clearAllGroups () |
| Destroys all groups. More... | |
| virtual bool | setGroupingColumn (int column) |
| Sets the column in base model that decides grouping. More... | |
| virtual bool | setGroupingColumnByProperty () |
| Sets the column in base model that decides grouping by reading columnIndex property of the sender. | |
| void | removeGrouping () |
| No grouping. | |
| virtual void | setGroupingDirection (Qt::SortOrder value) |
| Sets the direction of grouping. | |
| void | setGroupingAscending () |
| Sets the direction of grouping. | |
| void | setGroupingDescending () |
| Sets the direction of grouping. | |
Sorting | |
All methods related to sorting are gathered in this section. | |
| virtual int | sortingColumn () const |
| Retreive the column in base model that decides sorting. | |
| virtual int | isSorting () const |
| Tell if we're sorting the records inside groups or not. | |
| virtual void | setSortingRole (Qt::ItemDataRole role) |
| Sets the role in base model that decides sorting. | |
| virtual Qt::ItemDataRole | sortingRole () const |
| Retreive the role in base model that decides sorting. | |
| virtual Qt::SortOrder | sortingDirection () const |
| Retreive the direction of sorting. | |
| virtual void | setSortingFunc (Compare value) |
| Sets the function used to sort records inside groups. | |
| virtual Compare | sortingFunc () const |
| Retreive the function used to sort records inside groups. | |
| virtual QList< int > | sortingColumns () const |
| Retreive the list of columns where sorting can be applied. More... | |
| virtual QStringList | sortingColumnLabels (int *idx_crt) const |
| Retreive the labels for all columns where sorting can be applied. | |
| void | sortingChanged (int column, Qt::SortOrder) |
| The column or direction of the sorting has changed. | |
| virtual void | performSorting () |
| Sorts the items in all groups. More... | |
| virtual void | performUnsorting () |
| Arranges the items in all groups according to their original order. More... | |
| virtual bool | setSortingColumn (int column) |
| Sets the column in base model that decides sorting. More... | |
| virtual bool | setSortingColumnByProperty () |
| Sets the column in base model that decides sorting by reading columnIndex property of the sender. | |
| void | removeSorting () |
| No sorting. | |
| virtual void | setSortingDirection (Qt::SortOrder value) |
| Sets the direction of sorting. | |
| void | setSortingAscending () |
| Sets the direction of sorting. | |
| void | setSortingDescending () |
| Sets the direction of sorting. | |
A model that is to be installed into a GroupListWidget.
This class provides an intermediate layer between the model provided by the user and the actual widget. The class may be subclassed to get full control of the internal workings. However, most of the times, it is enough to provide a customizer that formats the data accodingly.
Internally, the groups are always sorted in ascending order. The group() method inspects the desired groupingDirection() and returns the result acordingly.
A number of signals are used to communicate with the widgets presenting the data:
| GroupModel::GroupModel | ( | QAbstractItemModel * | model = NULL , |
| QObject * | parent = NULL |
||
| ) |
Default constructor.
Default constructor creates a usable instance that can be readly used with a list widget. The user still needs to install a model for the widget to present anything useful. Alternativelly, the user may provide a model to the constructor that will be installed by the constructor.
The instance owns the QAbstractItemModel that is destroyed in the destructor. To avoid the destructor the user may choose to takeUnderModel() before the destructor kicks in.
|
virtual |
Retreive user model.
|
protectedvirtual |
Constructs all groups.
The method asserts that there is a base model installed and that the grouping column has a value inside valid range.
|
protectedvirtual |
Special case when no grouping is enabled.
The method asserts that there is a base model installed.
|
protectedvirtual |
Destroys all groups.
The state at the end of this method is not appropriate for run-time. It should be followed by either buildNoGroupingGroup() or buildAllGroups().
|
static |
Default implementation for comparision function.
This default implementation expects the two types to be the same. Some of the types will be handled and others will throw an assertion error. Check the code to see supported types.
| model | this instance |
| column | the column where the values belong |
| v1 | the value for first row |
| row1 | first row |
| v2 | the value for second row |
| row2 | second row |
|
protectedvirtual |
Sorts the items in all groups.
The method asserts that there is a base model installed.
|
protectedvirtual |
Arranges the items in all groups according to their original order.
The method asserts that there is a base model installed.
|
virtual |
Sets the user model.
This instance takes ownership of provided pointer. Currently installed model will be deleted by this method. To avoid this use takeBaseModel() prior to calling this method.
| model | The model that provides the data to sort, group and present. |
|
virtualslot |
Sets the column in base model that decides grouping.
The column may be -1 to indicate that no grouping should be performed or an index inside the valid range for columns in base model.
Please note that, if the old column is the same as the new one, nothing happens and the result is true.
| column | zero-based index of the column inside base model |
|
virtualslot |
Sets the column in base model that decides sorting.
The column may be -1 to indicate that no sorting should be performed or an index inside the valid range for columns in base model.
The column may not be the same as the grouping column or the pixmap column.
Please note that, if the old column is the same as the new one, nothing happens and the result is true.
| column | zero-based index of the column inside base model |
|
virtual |
Retreive the list of columns where sorting can be applied.
Default implementation simply excludes the grouping and pixmap columns and returns everything else.
| QAbstractItemModel * GroupModel::takeBaseModel | ( | ) |
Take ownership of user model.
The ownership of the pointer is transferred to the caller. The model is uninstalled and a NULL model is installed.


Back to index
React example
This can even be embedded by a jsfiddle!
https://jsfiddle.net/x02Lwcna/
Sources:
some-react-component-entrypoint - the entrypoint for webpack.
components/some-react-component - The react `application`


Weekly weather:
WEATHER FORECAST FOR THE NEXT WEEK IN
COPENHAGEN
WEATHER FORECAST FOR THE NEXT WEEK IN
NEW YORK


Speech
How colleges can help young people with special educational needs and disabilities (SEND) into work and independence.
Thank you Zoe [Hancock] - it is great to be with you all this morning. You’ll be pleased to hear that I won’t be talking about flood defences, or roads. Instead, I’ll be focusing on the most important challenge that we face - that is support for students with special educational needs and disabilities ( SEND ).
It’s great to see a few familiar faces from the Lancaster House reception we held in September to celebrate the launch of the SEN and disability reforms.
The approach we’ve taken has made a real difference, and it was excellent to look at the progress made to date as well as discuss the substantial amount of work that lies ahead with implementation.
I also believe today will be my Association of Colleges ( AoC ) conference hat-trick - so apologies to those who turned up hoping to see me off the menu!
But today is a chance to consider how far we’ve come over the past few years.
When I spoke to you last December , the Children and Families Bill was about to be enshrined in law. I said to you we could rise to the challenge, and through endeavour, I want to make this vision a reality.
So firstly a thank you for everything you’ve done to help us shape and improve these reforms, the biggest to special educational needs for 30 years.
We made sure we consulted closely with the AoC and many others, and I hope you came away from that experience feeling that we listened to you. Not just in terms of the policy, but also the practicalities that if implemented will make a really positive impact to many children and families’ lives.
Fast forward 12 months and we’re now moving into that all-important phase of delivering these reforms on the ground and ensuring they improve the prospects of some of our most vulnerable children and disadvantaged young people.
And I’m in no doubt that the FE sector has a pivotal role to play in bridging childhood and greater independence for hundreds of thousands of children.
Your work is the culmination of efforts, from the early years onwards, to give young people the same support and opportunities as we want for our own children.
These are essential ingredients in a successful transition into adulthood - having that clear sense of aspiration whatever their start in life.
Yes, we want students with SEND to enjoy their course, make friends and feel safe in the college environment - but what about what happens next?
What about their chances of getting a job, going on to further study, living independently?
You help cross that divide between education and independence, something which seems like a simple step but often isn’t.
Our reforms build on this vital role, giving you an even greater opportunity to make a difference.
That’s why I’m pleased to see that - 3 months after these reforms kicked in - you’re seizing that opportunity with enthusiasm and ambition, as reflected in today’s attendance.
According to a survey carried out jointly by the association and my department, there have been some really positive developments on the ground.
Most of you have got buy-in from your management team, recruiting senior colleagues as SEND leads.
95% of respondents will be running tailored study programmes next year, matching their students’ strengths to a programme that suits their abilities.
And more than three-quarters of colleges say they are working closely with their local authority to deliver the reforms, leading to some excellent practice.
The Isle of Wight council, for example, asked their Young Inspectors to pull the EHC document apart to see if it’s up to scratch. One of the young inspectors noted that the font was too small for them - they couldn’t make sense of it. Another struggled with some of the language.
This kind of feedback and approach could only come from involving students themselves - and it’s precisely that sort of input that our reforms aim to encourage.
Input that focuses on what works and on those all-important outcomes. That’s heard and acted on by services across health, education and social care as they collaborate ever more closely. And that shapes support from birth to 25, ensuring that the help young people get is determined not by a birthday but by need.
I saw just how important that type of input is when I visited Moore Lane Integrated Centre in Kingston and Richmond a few weeks ago. I was struck - not only by the sheer amount of cake on offer - but also just how seriously the students took their involvement in the changes. They felt very empowered by the role they had to play.
One of the students, Zakki, told me about his direct involvement in staff appointments. This not only helped him gain invaluable employment skills, but also inspired new teachers to better serve their SEN students.
I was also really encouraged by what I saw just last week when I visited the first purpose-built college for students with learning difficulties at Barnet and Southgate Centre of Excellence.
Their first-rate facilities are shaped and designed with students to maximise opportunity, inclusion and outcomes, as exemplified by the Steps to Work initiative which is helping students cross over into the world of work.
And this is an area where supported internships can really help and provide a valuable bridge into meaningful work - a world that can often be inaccessible and daunting, as we know, for young people with SEND .
We can see just how well this is working at Trafford College in Manchester, where job coaches not only mentor students through their work placements but also mentor employers - many of whom have had little or no experience of working with people with learning difficulties.
Placements have included Marks & Spencer and Premier Inn. One student landed what he described as his ‘dream job’.
As a result, Trafford has achieved a fantastic 70% employment rate for those young people who have taken part in supported internships.
As I’m sure all of you here will be aware, the employment rate for people with learning difficulties has been stubbornly low at around 7%. Trafford have improved on this 10 times over.
Great news, but I want to hear about more SEND students finding their dream jobs, perhaps with some really big-name employers already involved with supported internships - which include National Grid and Transport for London.
They’ve all set a great example, but I hope more businesses will get involved and discover for themselves just what students with SEND can and do contribute.
So there’s a lot of excellent practice that we can build on as we go forward.
Yet these are big reforms and I recognise that it will take time for them to bed in. And that there will inevitably be challenges - some foreseen, some not - along the way.
For instance, I know that there are some issues - ongoing - with funding, and also with the EHC process itself. Fortunately for you and for me, Peter [Mucklow] from the Education Funding Agency and Ann [Gross] from my department will be able to say more about this later today.
But I am aware that some local authorities are passing down funding to help colleges with this issue, and this might be something for more of you to consider and for us to discuss.
But whilst there will always be bumps along the way with change on this scale, let’s not forget the tremendous prospects we have here to transform SEND support and children and young people’s life chances. And, indeed, the survey results point to some really good progress.
There’s, of course, more to do, particularly - as the survey highlighted - on a better exit strategy for young people with SEND as they leave college. So there are a number of things I’d urge you to consider as the reforms roll out more widely.
Make sure that young people have all the information they need at their fingertips by ensuring you’re listed in the local offer, not just in your local area but the surrounding areas, too.
If you haven’t already done so, find out how your college fits into your local authority’s transition plan. They all now have one, so make sure you have been carefully thought about as part of that. And encourage your students and families to take up personal budgets, to really shape their own future.
Families have told us that the reforms are making their lives easier and much of this is down to the great work of your colleges.
One parent I met a few weeks ago said that a review with her child’s tutor had a very different feel to it. She said that it was much more forward-looking and centred around their aspirations.
That’s exactly what I want to hear.
So I urge you in everything you do to continue to push the boundaries and aim high on behalf of young people who have so much potential. You only need to look at the survey results to see how far the FE sector has come. And, to be blunt, we can’t do this without you.
We’re breaking new ground, and by working together I’m hopeful we’re on our way to doing much better by some of our most vulnerable and most rewarding young people. All of us here can see their potential - now let’s help them take that to the world outside the college campus and show everyone what they can do.
This will be a transition which will not take months, but years. Let us know about any teething issues you have, and we can help to solve them together. I look forward to working with you on this.
Thank you.
Published: 4 December 2014


Fellowship SMS Service is a NEGARIT based Service, where you can manage and perform different kinds of SMS Service for Fellowship.
We provide you an Environment to Send Scheduled and Periodic messages additionally.
Have an account? Sign in here.