--- author: zgxsin date: 2018-11-01 title: Rendez-vous Bundesplatz in Bern ---
Date: {{ page.date | date: "%b %d, %Y"}}
The Little Prince.


Verify certificate: Pending verification ...
Computing SHA256 digest of local certificate [DONE 1/5]
Fetching hash in OP_RETURN field [DONE 2/5]
Comparing local and blockchain hashes [PASS 3/5]
Checking Verified Organization signature [PASS 4/5]
Checking not revoked by issuer [PASS 5/5]
Success! The certificate has been verified.
Public Key: 1GuqT4EpnhmA6GQvA3Fz5JWPjcZyXSQpFw


| Package | Description |
|---|---|
| eu.casoftworks.jdroidlib.device |
Contains classes used with and by JDroidLib to represent devices, their components and
utilities that don't make sense in any other package.
|
| eu.casoftworks.jdroidlib.device.fs |
Contains classes used for representing parts of an Android
Device 's file system. |
| eu.casoftworks.jdroidlib.exception |
Contains exceptions thrown by JDroidLibv2.
|
| eu.casoftworks.jdroidlib.interfaces |
Contains interfaces used internally by the JDroidLib library.
|
| Modifier and Type | Method and Description |
|---|---|
java.util.List<BuildProperty> |
BuildProp.getProperties()
Gets all of the
Device 's build properties in form of a list. |
BuildProperty |
BuildProp.getProperty(java.lang.String prop)
Gets a single build property from the parent
Device |
void |
PackageManager.installPackage(ApkFile appFile,
InstallFlag... flags)
Install a package on to a
Device . |
java.util.List<IDirectory> |
FileSystem.listDirectories(IDirectory directory)
Lists all the directories in the passed
IDirectory . |
java.util.List<IFileSystemEntry> |
FileSystem.listDirectoryContents()
Lists all file system entries from the root of the
Device 's file system. |
java.util.List<IFileSystemEntry> |
FileSystem.listDirectoryContents(IDirectory directory)
Lists all the contents from the passed
IDirectory . |
java.util.List<IFile> |
FileSystem.listFiles(IDirectory directory)
Lists all files from the passed
IDirectory . |
java.util.List<Package> |
PackageManager.listPackages(PackageFilter... filters)
List packages on the
Device |
java.io.File |
FileSystem.pull(IFileSystemEntry fsEntry)
Pulls a file/directory from the device to a library-specified location
on the host.
|
java.io.File |
FileSystem.pull(IFileSystemEntry fsEntry,
java.io.File location)
Pulls a file/directory from the device to a specified location on the host.
|
java.io.File |
FileSystem.pull(IFileSystemEntry fsEntry,
java.lang.String location)
Pulls a file/directory from the device to a specified location on the host.
|
void |
FileSystem.push(java.io.File src,
IFileSystemEntry dest)
Attempts to push (upload) a file/directory the the parent
Device . |
void |
Device.rebootDevice()
Reboots this
Device to Android. |
void |
Device.rebootDevice(RebootMode mode)
Reboots this
Device into a specified operating mode. |
void |
PackageManager.removePackage(Package pkg)
Removes an installed package from a
Device . |
void |
BuildProp.setProperty(BuildProperty prop)
Sets the parent
Device 's build property. |
| Modifier and Type | Method and Description |
|---|---|
void |
AndroidFile.copyTo(IFileSystemEntry destination)
Copies a file or directory to the desired location on the device's file system.
|
void |
AndroidDirectory.copyTo(IFileSystemEntry destination)
Copies a file or directory to the desired location on the device's file system.
|
boolean |
AndroidFile.exists()
Gets a value indicating whether the file/directory exists.
|
boolean |
AndroidDirectory.exists()
Gets a value indicating whether the file/directory exists.
|
byte[] |
AndroidFile.getContents()
Attempts to get the file's contents.
|
java.util.List<IFileSystemEntry> |
AndroidDirectory.getContents()
Attempts to get all the contents (files and directories) of the directory.
|
java.lang.String |
AndroidFile.getContentsAsString()
Attempts to get string contents from a file.
|
java.util.List<IDirectory> |
AndroidDirectory.getDirectories()
Attempts to list all the directories within a directory.
|
java.util.List<IFile> |
AndroidDirectory.getFiles()
Attempts to list all the files in a directory.
|
PermissionSet |
AndroidFile.getPermissions()
The permissions for the current file system entry.
|
PermissionSet |
AndroidDirectory.getPermissions()
The permissions for the current file system entry.
|
boolean |
AndroidFile.isText()
Gets a value indicating whether a file is a text file or not.
|
void |
AndroidFile.moveTo(IFileSystemEntry destination)
Moves a file or directory to the desired location on the device's file system.
|
void |
AndroidDirectory.moveTo(IFileSystemEntry destination)
Moves a file or directory to the desired location on the device's file system.
|
| Modifier and Type | Class and Description |
|---|---|
class |
CannotRemoveException
Device-class exception that is thrown when a file or directory cannot be removed
from the host
Device . |
class |
CannotTouchException
Device-class exception that can be thrown when a file cannot be touched on
an Android
Device . |
class |
DeviceNotConnectedViaTcpIpException
Exception that can be thrown when a device was expected to be connected to
the host via TCP/IP, but wasn't.
|
class |
FileAlreadyExistsException
Device-class exception that is thrown when a file or directory already
exists on the
Device 's file system, when expected otherwise. |
class |
FileCouldNotBePulledException
Device-class exception that may be thrown when a pull (file or folder) attempt fails.
|
class |
FileCouldNotBePushedException
Device-class exception that is thrown when a file or directory could not
be pushed to a
Device |
class |
IllegalDeviceStateException
Exception thrown when a targeted device is in an unexpected state.
|
| Modifier and Type | Method and Description |
|---|---|
void |
IFileSystemEntry.copyTo(IFileSystemEntry destination)
Copies a file or directory to the desired location on the device's file system.
|
boolean |
IFileSystemEntry.exists()
Gets a value indicating whether the file/directory exists.
|
byte[] |
IFile.getContents()
Attempts to get the file's contents.
|
java.util.List<IFileSystemEntry> |
IDirectory.getContents()
Attempts to get all the contents (files and directories) of the directory.
|
java.lang.String |
IFile.getContentsAsString()
Attempts to get string contents from a file.
|
java.util.List<IDirectory> |
IDirectory.getDirectories()
Attempts to list all the directories within a directory.
|
java.util.List<IFile> |
IDirectory.getFiles()
Attempts to list all the files in a directory.
|
PermissionSet |
IFileSystemEntry.getPermissions()
The permissions for the current file system entry.
|
boolean |
IFile.isText()
Gets a value indicating whether a file is a text file or not.
|
void |
IFileSystemEntry.moveTo(IFileSystemEntry destination)
Moves a file or directory to the desired location on the device's file system.
|


Lyndol Cromartie
Discovering some of the things one can do gives way to wonder what could be done in the future. The world has changed so much since I was a kid. I consider myself very fortunate because I grew up at a time much different from today. I witnessed the transition to the mostly technilogical driven world that we presently live in. Ive recently discovered I am considered a "millennial", and you know what? I'm ok with that. Just saying it makes me feel younger already. I've heard a lot said about millennials, and I think it's a fair assesment to say that we see the world different from the generations before.
Having grew up in a time before smart phones, computers, and tablets I can appreciate the traditions of the past while embracing some of the changes of today by excepting the challenges to make a better tomorrow. I know that sounds very confusing and I apologize, If your reading this you may want to go back to that last sentence and read it a few more times to really undertand what I mean, even though I wrote it, I had to review it again myself to make sure it read right. There is no other way I could think of to say it.


--- title: Wozniakian Destruction date: 2015-11-27 17:51:41 Z categories: - Links - Not data tags: - digital history layout: post type: post status: publish meta: pe_theme_meta: O:8:"stdClass":2:{s:7:"gallery";O:8:"stdClass":3:{s:2:"id";s:2:"89";s:5:"width";s:0:"";s:6:"height";s:0:"";}s:5:"video";O:8:"stdClass":1:{s:2:"id";s:3:"504";}} _edit_last: '1' author: Nathaniel ---
FiveThiryEight Signal's Series had a great small documentary piece on the history of phone hacking in 1960s-1980s, through the lens of Steve Wozniak and Steve Job's pre-Apple bedroom-based manufacturing of "blue bloxes," devices used for manipulating the nation's telecommunication infrastructure. The tidy punchline: "if we hadn't made those little blue boxes, there might never have been an Apple computer." Importantly, piece pays homage to the classic Esquire piece on the rise of analog phone hacking , the predecessor to PC-based hacking culture.


Address: Dona Paula, North Goa, Goa 20 crores Beautiful uninterrupted panoramic water views in the prestigious community of ocean park, Dona paula near the goa governor’s mansion. 8,000 square feet of living space with floor to ceiling glass sliders to enjoy the views and welcome in the sea breezes.
Address : North-Banglore ,Banglore 66 lakhs.The house is on Manipal County Rd, Begur-Off Hosur Road. Enjoy play or keep fit in the exclusive residents only amenities including a fully equipped air-conditioned gymnasium, basketball, tennis, squash, skating rink, cricket practice.
Address:South-Banglore,Bengaluru 56 lakhs.Marvellous pent house in "Sai Poorna Paradise" is available for sale. Elegant interiors and well planned architecture make this property a perfectly sought out.Extremely perfect location


CHAPTER 42
FINDINGS
This Chapter is purposely written in the same order as the corresponding Chapter 20 in the Report of the JAIC in order to facilitate an easy comparison for the reader. Where no corresponding remarks are found, this 'Group of Experts' either agrees or has not investigated the specific subject.
Accident
- The car/passenger ferry ESTONIA sank during the early hours of 28 September 1994 in the Northern Baltic on its voyage from Tallinn to Stockholm. According to the official figures only 137 passengers and crew members survived. The wreck lies in international waters.
Weather / Sea state
- At the time of the casualty the wind was blowing from SW-ly directions with a speed of 18-20 m/sec. The significant wave height was about 4 metres. Neither wind speed nor sea state were exceptional for the season.
- Before the sequence-of-events of the casualty commenced the ESTONIA was pitching extremely hard in bow seas from port forward due to a speed which must be considered excessive under the prevailing conditions.
Ship's Condition
- When the ferry left Tallinn she was unseaworthy for the following reasons: Her bow was open to the sea. The bow visor and the bow ramp, which should both be water(weather)tight, were leaking with the consequence that seawater had uncontrolled access to the car deck, a condition which must be avoided by all means, as it severely endangers the safety of the vessel and it's passengers.
A part of the underwater hull was corroded to the extent, that seawater had free access to certain tanks and void spaces. The consequence of this fact was, that about 200 mts of unknown weights were in the vessel creating a 10 degrees list which could only be partly rectified by the ballasting of the port heeling tank.
The vessel's Passengership Safety Certificate was false, the same is true for her Load Line Certificate.
Trucks and cars on the car deck were not properly secured although the upcoming heavy weather was known to the master.
Sequence-of-events
- Due to missing rubber seals and damage to it's bottom the visor became quickly filled at sea up to the outside water level with seawater, which penetrated through the partly open bow ramp into the car deck.
- The existing starboard list was increased by the wind pressure from port.
- The vessel therefore heeled 2 to 4 degrees to starboard and the water that had penetrated through the bow ramp accumulated on starboard aft of the car deck as the vessel was trimmed by the stern at the commencement of the voyage.
- There are indications that the crew opened the starboard stern ramp slightly in an attempt to drain the car deck thereby.
- The bilge pumps were running and pumping from compartments of the 1st and/or 0-decks. It has to be assumed that the watertight doors in the engine room area were closed, whilst the watertight doors in the passenger area of the 1st deck were still open after the big heel.
- At about 00.40 / 00.45 hours heavy metallic bangs were heard and felt from the foreship and the movements of the vessel changed to softer pitching and rolling. The metallic bangs continued. It has to be assumed that the starboard hinges and side locks of the visor failed at about this time. The visor was now moving forward/aft between the hinge parts on the forecastle deck and the deck beam at frame 159.
- The speed was reduced and the damaged bow turned to starboard away from the waves, however when the vessel started to roll excessively the bow was turned back to port and wind and sea were now taken from straight ahead. The vessel now made soft, deep pitch movements for a while.
- At some time later also the port hinges and the port side lock failed, whilst the Atlantic lock held somewhat longer.
- At about 01.00 hours the vessel was shaken heavily and noises and vibrations as if the vessel was proceeding through ice were heard and felt by those on the 1st deck, shortly followed by another, even more severe impact, followed by a very wide heel of the vessel to starboard at 01.02 hours The vessel, however, came back to almost upright condition, heeled again, came back to 10-15 degrees starboard heel and subsequently heeled in steps to about 30-35 degrees to starboard and stabilized in this condition for some time.
- While the visor moved forward/aft and the lugs underneath the visor arms were slowly cutting trough the deck beam of frame 159, both bow ramp actuators broke and the unsecured ramp fell into the visor.
- After some time the lugs underneath the visor arms had worked their way through the deck beam - most likely first at the port side - and the visor now also moved to starboard following the increasing starboard heel and fell onto the bow ramp which rested in the visor.
- In the meantime the forepeak deck had penetrated the bottom structure of the visor whilst the shell plating edges were overlapping the forepeak deck.
- The visor was now held by the bow ramp and by the port side plates overlapping the forepeak deck, whilst the vessel continued to heel to starboard and the stern sank deeper.
Capsize
- The main engines stopped at about 01.10 / 01.12 hours at a heel of 25-30 degrees. At this time the vessel had turned to a North-Easterly heading.
- The vessel stabilized at a heel of 30-40 degrees for some time and the diesel generators stopped at about 01.15 / 01.20 hours whereafter the emergency generators started and supplied power to a limited number of consumers.
- The vessel continued to heel and was on the side at 01.30 hours and some time later completely upside down whilst the stern continued to sink deeper and the bow to raise higher.
- It has to be assumed that the visor did glide off the bow ramp and forepeak deck when the heel had reached some 130-140 degrees and sank to the bottom of the sea as it was unable to float.
- The stern finally settled on the sea bottom with the bow still raised to about 40-45 degrees out of the water. The bow ramp was almost closed.
- The bow sank slowly deeper and -
at 01.53 hours the echo of the ESTONIA disappeared from the radar screen of the nearest vessel "MARIELLA".
Action by the Crew
- Nothing can be stated with some degree of probability from the bridge for the time after 00.35 hours.
- It has to be assumed that a first "Mayday" was transmitted at around 00.45 hours, which for unknown reasons was not picked up.
- It has further to be assumed that after the problems with the bow ramp and visor were realised, the speed was reduced and attempts were made to take the loads off the visor.
- It is likely that the crew worked on the car deck attempting to hold the visor and the bow ramp to the vessel by different means. This attempt, however, failed.
- There are also indications that the engine crew was working on the starboard stabiliser. All attempts of the crew were apparently abandoned at about 01.00 hours.
- A warning for the passengers "Alarm, Alarm" was shouted in Estonian language a few times over the loudspeakers. No other information was given to the passengers.
Technical Matters
- At the time when the ESTONIA was designed and built, there were no specific design requirements for visors in the rules of the Classification Society Bureau Veritas. The SOLAS Convention at that time was not yet part of the B.V. Rules.
- The Finnish Board of Navigation considered itself exempted from the inspection of structural matters in newbuildings - such as locking devices - by the Copenhagen Convention of 1924 and hence had to rely on authorised Classification Societies for plan approval and inspection of structural matters on newbuildings. B.V. was authorised.
- The visor design load and the assumed load distribution on the attachments was in accordance with L R. Rules and the then state-of-the-art and technique.
- The visor locking devices installed by Meyer Werft, were manufactured in accordance with the design and good shipbuilding practice. These devices were not identical to those found onboard after the casualty.
- The SOLAS requirements for the upper extension of the collision bulkhead above bulkhead deck were never complied with. Nevertheless Passenger Ship Safety Certificates were issued by The Finnish Board of Navigation and - after the vessel had changed it's flag - by B.V. on behalf of the Estonian National Maritime Board. It may be debated wether the issuance of these certificates during the time the vessel spent under Finnish flag was completely in line with the requirements of SOLAS but that debate is irrelevant, because any such failure cannot have contributed to the Catastrophe.
- The Load Line requirements for a tight vessel were not complied with on 9.9.1994 although BV confirmed the Load Line Certificate on this date, i.e. 19 days before the casualty, on behalf of the Estonian National Maritime Board.
- The general maintenance standard of visor and bow ramp was unacceptable which fact was the main cause for the casualty.


This tutorial shows how to use the Random Forest method in H2O for model training and classification.
Random forest uses an ensemble of decision trees to make regression and classification models. The trees are built from a training dataset and can be used to make predictions on a test dataset.
Vocabulary:


WITNESS LIST Natural Resources Committee May 10, 2005 - 1:30P HB 422 FOR: Gilman, Holly (Comel County Water Oriented Recreation District), Austin, TX HB 467 FOR: Bean, Scott (ALDINE), HOUSTON, TX Reed, Cyrus (Texas Center for Policy Studies), Austin, TX Registering, but not testifying: For: Sisk, Cathy (Harris County), Houston, TX HB 1224 Registering, but not testifying: For: Reed, Cyrus (Lone Star Chapter, Sierra Club), Austin, TX HB 1225 Registering, but not testifying: For: Mullins, Russell (Association of Electric Companies of Texas), Austin, TX Reed, Cyrus (Lone Star Chapter, Sierra Club), Austin, TX HB 2161 FOR: Mann, James (Texas Pipeline Association), Austin, TX Registering, but not testifying: For: Sander, Lindsay (Texas Pipeline Safety Coalition), The Woodlands, TX HB 2510 FOR: Bishop, Colin (Orenco Systems, Inc.) Smith, Tom "Smitty" (Self), Austin, TX Snowden, P.E., Jeff A. (Texas Onsite Wastewater Association), Austin, TX AGAINST: Montgomery, Eugene (Self), Valley View, TX ON: Jackson, Isaac (TCEQ), Austin, TX Registering, but not testifying: For: Canada, Don (American Decentralized Waste Water Association), Austin, TX HB 2685 ON: Crevier, Michael (Texas Parks & Wildlife), Austin, TX HB 2940 Registering, but not testifying: For: Brown, Kirby (Texas Wildlife Association), San Antonio, TX On: Bwvill, Vernon (Game Bird Coordinator , Texas Parks & Wildlife Dept.), Austin, TX SB 1678 Registering, but not testifying: For: Baker, Sarah (Greater Edwards Aquifer Alliance), Austin, TX Herbel, Erin (Save Our Springs Alliance), Austin, TX Reed, Cyrus (Lone Star Chapter, Sierra Club), Austin, TX SB 1724 AGAINST: Fisher, Jon (Texas Chemical Council), Austin, TX FOR COMMITTEE SUBSTITUTE: Reed, Cyrus (Lone Star Chapter, Sierra Club), Austin, TX Wilson, John D. (Galveston - Houston Association for Smog Prevention), Houston, TX Registering, but not testifying: For: Alvarez, Ramon (Environmental Defense), Austin, TX Baker, Sarah (Greater Edwards Aquifer Alliance), Austin, TX Oldham, Melanie (Citizens for Clean Air / Water in Brazoria Co.), Arlington, TX Sisk, Cathy (Harris County), Houston, TX Against: Miksa, Mary (Texas Association of Business), Austin, TX Morphew, Cindy (Texas Oil & Gas Association), Austin, TX SB 1891 Registering, but not testifying: For: Howard, Jay (Guadalupe - Blanco River Authority), Austin, TX For Committee Substitute: Rodriguez, Geronimo (Northern Star Investors), Austin, TX


Updates for {$topic.title}
{foreach $article in $articles}
>>{$article.title}
| by
{$article.author}, on
{$article.published_time}
{/foreach}
<<Back to Home


Indian Institute of Technology Ropar, Nangal Road, Rupnagar, Punjab, INDIA 140001
+91-1881-242188 +91-1881-242188
+91-1881-242188 +91-1881-242253
Copyright © 2017, IIT Ropar
Designed by ISMP Web-Development Team


A Geek By Birth, Opensource Enthusiast, Loves To Code And Design Web, A Mozillian And Trustworthy
Mozillians | Hackerearth | Spoj
Portfolio v2.0


Porting Reana Atlas Recast Demo to Parsl
As part of my work on project SCAILFIN I am exploring how we could express Parsl workflows as Reana reproducible research objects. Parsl is a parallel workflow system that is expressed as code. Dan Katz published an informative article describing the motivation behind this approach.
To learn more about parsl and to see how it would fit into the reana world, we decided that I should port one of the reana demos from yadage to parsl. I did this with the Atlas Recast Demo.
You can see the full example in the parslization
branch of
my fork of the demo
Basic Approach
The demo is implemented as two steps, each relying on a docker image based on the Atlas Standalone Analysis Image. This image provides many of the basic tools needed for working with events in ATLAS Root files.
The first step downloads a root file and extracts specific events into an output file. The second step uses the extracted events and produces some plots. These two steps are implemented in parsl as parameterized bash scripts running in the two docker containers.
For our purposes we will be running these two containers on a kubernetes cluster with parsl controlling them. The two steps interact through a shared persistent volume.
We tell parsl to orchestrate the two containers through the generated file. The first container starts, and the second container waits till the file is generated.
Parsl Control of Containers
Parsl interacts with Docker containers through an ipython
engine. For this to
work, the container must have python3 with the parsl package installed. This
proved to be the most vexing part of the whole project. The Atlas analysisbase
image is based on a Centos6 image which only has Python2.7 available.
The only way I could figure out how to get this environment installed in the image without breaking dependencies that some of the earlier steps in the Docker build rely on was to add a final step to Docker file that actually updates the development tools and builds python3 from source.
RUN yum update -y && \
yum groupinstall "Development Tools" -y && \
wget https://www.python.org/ftp/python/3.6.8/Python-3.6.8.tgz && \
tar -xvf Python-3.6.8.tgz && \
cd Python-3.6.8 && \
./configure && \
make && \
make altinstall && \
/usr/local/bin/pip3.6 install cython && \
/usr/local/bin/pip3.6 install parsl
In my fork of the Atlas demo I updated the two Dockerfiles. I built them and deployed them to my DockerHub repo.
Creating Persistent Volume
The two steps interact with each other and publish their outputs using a persistent volume that is shared between them. For simplicity’s sake, I tested all of this out using minikube with a host-mounted volume.
To start with, I created a directory inside minikuibe’s VM by
minikube ssh
and then
sudo mkdir /mnt/data
Back on my own workstation I created the persistent volume as pv.yaml
:
kind: PersistentVolume
apiVersion: v1
metadata:
name: task-pv-volume
labels:
type: local
spec:
storageClassName: manual
capacity:
storage: 10Gi
accessModes:
- ReadWriteMany
hostPath:
path: "/mnt/data"
and a presistent volume claim as pvc.yaml
:
kind: PersistentVolumeClaim
apiVersion: v1
metadata:
name: task-pv-claim
spec:
storageClassName: manual
accessModes:
- ReadWriteMany
resources:
requests:
storage: 3Gi
Then created them in cluster with:
kubectl create -f pv.yaml
kubectl create -f pvc.yaml
We will need some files from the repo to be copied to this persistent volume.
One of the features of reana is that it handles the copying of data into the
cluster. Since I’m not using reana for this example, I launched a busybox pod
in the cluster with the volume mounted with
debug-pod.yaml
as:
kind: Pod
apiVersion: v1
metadata:
name: volume-debugger
spec:
volumes:
- name: volume-to-debug
persistentVolumeClaim:
claimName: task-pv-claim
containers:
- name: debugger
image: busybox
command: ['sleep', '3600']
volumeMounts:
- mountPath: "/data"
name: volume-to-debug
I then created the pod and opened a shell:
kubectl create -f debug-pod.yaml
kubectl exec -it volume-debugger sh
Inside that volume-debugger I created a /data/code
directory and then from
my workstation I copied the python scripts from the atlas-recast repo into that
directory:
cd statanalysis
kubectl cp make_ws.py volume-debugger:/data/code/make_ws.py
kubectl cp plot.py volume-debugger:/data/code/plot.py
kubectl cp set_limit.py volume-debugger:/data/code/set_limit.py
kubectl cp data/background.root volume-debugger:/data/background.root
kubectl cp data/data.root volume-debugger:/data/data.root
I confirmed that everything was where I expected with the volume-debugger shell.
Configuring Parsl Executors for Kubernetes
Parsl runs the workflow steps using executors which are linked to specific
providers which run the code. We will be using the IPyParallelExecutor
and
the KubernetesProvider
. The provider’s configuration is where we specify the
docker image to use. It also allows for persistent volumes to be mounted into
the containers.
Here is the config object that I use:
config = Config(
executors=[
IPyParallelExecutor(
label='event_selection',
provider=KubernetesProvider(
image="bengal1/reana-demo-atlas-recast-eventselection:latest",
nodes_per_block=1,
init_blocks=1,
max_blocks=1,
parallelism=1,
persistent_volumes=[("task-pv-claim","/data")]
)
),
IPyParallelExecutor(
label='stat_analysis',
provider=KubernetesProvider(
image="bengal1/reana-demo-atlas-recast-statanalysis",
nodes_per_block=1,
init_blocks=1,
max_blocks=1,
parallelism=1,
persistent_volumes=[("task-pv-claim", "/data")]
)
)
],
lazy_errors=False
)
This defines an Executor for each step along with the Docker image which implements the behavior. Each executor is given a name which is referenced in the parsl steps.
The Workflow
Now we get into the parsl workflow as code! There are two steps in our workflow
each are bash scripts that run on their Docker container. The key is the
@App
annotation:
@App('bash', executors=['stat_analysis'], cache=True)
Since the second step depends on a file produced by the first step, we set up
a data dependency. This is done by creating a parsl.File
handle to the
generated hist-sample.root file. When the first step is invoked, a future of
this file is made available. I made it an input data dependency to the second
step.
This step in turn produces a data future for a .png plot that it produces. I run the workflow, by invoking both steps and then waiting for the final result data future to to resolve.
event_selection_future = event_selection("404958", "recast_sample", 0.00122,
dxaod_file="https://recastwww.web.cern.ch/recastwww/data/reana-recast-demo/mc15_13TeV.123456.cap_recast_demo_signal_one.root",
submitDir="/data/submitDir",
lumi_in_ifb=30.0,
outputs=[sample_file])
stat_analysis_future = stat_analyis("/data/data.root", "/data/submitDir/hist-sample.root",
"/data/background.root", "/data/results",
inputs=event_selection_future.outputs,
outputs=[post_file])
# Check if the result file is ready
print ('Done: %s' % stat_analysis_future.outputs[0].done())
print('result is '+str(stat_analysis_future.outputs[0].result()))
Conclusions
This exercise was a great opportunity to learn more about parsl as well yadage and a chance to think a bit more about the features of reana. My first reaction is that I enjoyed parsl’s workflow as code model. I found it much easier to learn and read than yadage’s yaml model.
One disadvantage I found was that due to parsl’s reliance on iPython for execution it winds up being more invasive to the deployed Docker containers. The requirement for the parsl package and Python3 in the image came close to being a show stopper for the legacy code I was orchestrating.
The other thing I noted after running this demo under reana is just how convenient reana’s handling of file deployments is. They offer a command line tool where you can upload files into a volume the cluster which will be mounted into running containers. It completely handles the persistent volumes itself. Parsl has some great tools for copying files into some other environments. I smell a nice parsl pull request coming on to support transferring files in and out of a persistent volume in the cluster.
This work has been supported by the NSF and Project SCAILFIN


Assertions (or asserts for short) are helper methods that can assist us in determining whether a method under test is performing correctly or not. They let us assert conditions, data, and so on. All assertion methods will report failures (that’s when the assertion is false) or errors (that’s when we get an unexpected exception) and report these through the NUnit test runner. when a failure or error occurs, execution of the current test method is aborted. Other Test within the same test fixture will still be run.
Classic Asserts
*message in all previous statements is optional.
Constrain-Based Asserts
These are new assertion style introduced in NUnit 2.4. That new style enable many expectations to be evaluated together in a single assertion:
Assert.That(4, Is.LessThan(5) & Is.GreatThan(0));
NUnit and Exceptions
Part of your code behavior may be throwing a specific exception in certain cases. If you want to assert that your code throws the exceptions that it designed to throw, you need to tag your test method with attribute: [ExpectedException(typeof(ExpectedException))].
1: [TestFixture]
2: public class ImportListTest
3: {
4: [Test]
5: [ExpectedException(typeof(ArgumentNullException))]
6: public void NullList()
7: {
8: Class1.ImportList(null);
9: }
10: }
This test method in now expected to throw an exception [from the call to ImportList(null)]. If it doesn’t, the test will fail. If a different exception is thrown (even a superclass of the one specified), the test fails. The test passes only if the exact exception specified is thrown.
Temporarily ignoring tests
If you wrote the test code first and will start writing code incrementally (something like TDD), you may temporarily ignore tests that you still implementing the code required to pass them. You could just tag these tests with attribute [Ignore(“Optional Message”)] . NUnit will report that these tests were skipped and show a yellow bar in the GUI, so you won’t forget about it later.


In the previous post, I discussed what is fedimg and how it works currently. In this post, I plan to explain the issue in the current uploading process of the AMIs and how we plan to fix it.
What’s the problem?
fedimg boots an utility instance using the RHEL AMI configured for that region.
The problem with this design is that while adding a new region we need to look for the appropriate RHEL AMI in the newer region first. Afterward, we need to test if fedimg works with the newer regions RHEL AMIs. Finally, if everything turns out to be okay we can go ahead with adding the AMI to the fedimg configuration.
This becomes a tedious task over time and delays adding a new region.
How does redesign fixes this?
The new design completely removes the dependency of the utility instances.
fedimg would then utilize euca-import-volume
to upload the raw cloud image to
create a volume via S3.
fedimg will keep retrying to check if the volume is read using
euca-describe-conversion-tasks
. Once the volume is created, fedimg goes ahead
with creating the snapshot of the volume and then finally the AMI.
This change results in removing a lot of redundant code and a simpler fedimg configuration file [1][2]. I have been working on this for sometime now.
Adding a new region now becomes effortless as we just need to append the region to the configuration file.
Fedimg also right now boots up test instances to test the AMIs and does a basic
/bin/true
test. This test just ensures that the machine boots and nothing
more than that.
In the next post, I will be writing on how I will be going ahead to build a testing infrastructure for the AMIs using Autocloud and ResultsDB.


dials.anvil_correction¶
Introduction¶
Correct integrated intensities to account for attenuation by a diamond anvil cell.
High pressure X-ray diffraction experiments often involve a diamond anvil pressure cell, in which the sample is sandwiched between two anvils, effectively parallel flat plates of diamond. The passage of the incident and diffracted beam through the anvils results in attenuation of both beams by the diamond by an amount that is dependent on the path length of each beam through each anvil.
This utility calculates these path lengths and boosts the integrated reflection intensities to remove the calculated effect of the diamond attenuation.
It is intended that this program be used to correct reflection intensities after integration but before scaling. Call it on the output of dials.integrate.
Examples:
dials.anvil_correction integrated.expt integrated.refl
dials.anvil_correction integrated.expt integrated.refl thickness=1.2 normal=1,0,0
Full parameter definitions¶
anvil
.caption = "Properties of the mounted diamond anvils"
{
density = 3510
.help = "The density of the anvil material in kg per cubic metre. The"
"default is the typical density of synthetic diamond."
.type = float(allow_none=True)
thickness = 1.5925
.help = "The thickness in mm of each anvil in the pressure cell. The"
"default is the thickness of the pressure cells in use on "
"beamline I19 at Diamond Light Source."
.type = float(allow_none=True)
normal = 0, 1, 0
.help = "A 3-vector orthogonal to the anvil surfaces in the laboratory "
"frame when the goniometer is at zero datum, i.e. the axes are "
"all at zero degrees. The vector may be given un-normalised."
.type = floats(size=3)
}
output {
experiments = None
.help = "The output experiment list file name. If None, don't output an "
"experiment list file."
.type = path
reflections = corrected.refl
.help = "The output reflection table file."
.type = path
log = dials.anvil_correction.log
.type = path
}
Details¶
The path lengths \(l_0\) and \(l_1\) of the incident and diffracted beams through the diamond anvils of the pressure cell are illustrated in the schematic below. The anvils are assumed to have equal thickness \(t\) and to be perfectly parallel. The cell is fixed to the goniometer, so its orientation depends on the goniometer rotation \(R\). When the goniometer is at the zero datum, the anvils’ normal is \(\mathbf{\hat{n}}\), so in general, the anvils’ normal is \(R\mathbf{\hat{n}}\).
Since the magnitude of the incident and diffracted beam vectors \(\mathbf{s}_0\) and \(\mathbf{s}_1\) is simply \(\left|\mathbf{s}_i\right| = 1/\lambda\), the path lengths \(l_0\) and \(l_1\) are
As a result of absorption in the anvil material, the intensity of each beam is reduced by a factor \(\exp{\left(-\mu l_i\right)}\), where \(\mu\) is the linear absorption coefficient. Hence each diffraction spot has intensity attenuated by a factor
With knowledge of the density \(\rho\) of the diamond anvils, \(\mu\) can be calculated from tabulated values of the mass attenuation coefficient for carbon \(\left(\mu/\rho\right)_\text{C}\). The mass attenuation coefficient is taken from data collated by the US National Institute of Standards and Technology [NIST].
After integrating the observed diffraction spot intensities, we can recover an approximation of the intensity that might be expected in the absence of X-ray attenuation by the anvil material. This is simply achieved by multiplying each of the profile-fitted integrated intensities, the summation integrated intensities and their respective standard deviations by a factor
Note that in the case of the standard deviations, this correction may subtly contradict certain assumptions in the error model of your chosen scaling utility. The effect is not anticipated to be very significant in most cases and no attempt is made to account for it at this stage.
Hubbell, J.H. and Seltzer, S.M. (2004), Tables of X-Ray Mass Attenuation Coefficients and Mass Energy-Absorption Coefficients (version 1.4). [Online] Available: http://physics.nist.gov/xaamdi [2020-01-31]. National Institute of Standards and Technology, Gaithersburg, MD, USA.


<hazardsymbol>
The <hazardsymbol>
element specifies a graphic. The graphic might
represent a hazard, a hazardous situation, a result of not avoiding a hazard, or any
combination of these messages.
Category: Hazard statement elements


You created this hobby: {{name}}{{description}}{{N}}{{O}}{{A}}{{C}}{{E}}
This is your image:
Name:
Write a brief description of the hobby:
Copy a link to your picture:
N-points:
O-points:
A-points:
C-points:
E-points:


Chicago Tribune for members Register | Log in | More info Please register to read stories on chicagotribune.com -- it's FREE!
Latest news
Updated 1:40 AM CSTU.S. to Interrogate Al-Qaida Chief
U.S. counterterrorism authorities hope their interrogation of the newly captured chief of al-Qaida's Persian Gulf operations, Abd al-Rahim al-Nashiri, will shed light on terror plots still in the works, officials said.
Israeli Forces Enter Bethlehem
Israeli forces entered Bethlehem early Friday, retaliating against the home town of a Palestinian suicide bomber who blew up a Jersusalem bus, killing 11 passengers and wounding dozens.
Inmate guilty of supplying key
A convicted bank swindler was found guilty today of perjury for denying he slipped another prisoner the handcuffs key that led to the bloodiest day in the history of Chicago's federal courthouse.
Former youth baseball coach gets prison
A former youth baseball commissioner who gambled away thousands of dollars in funds from his league and friends was sentenced to eight years in prison.
Other top headlines:
Business | TechnologyUpdated 6:19 PM CSTMotorola receives Baldrige Award
Manufacturing giant Motorola Inc., a Texas printing company and a Missouri health care company are the 2002 winners of the Baldrige Award for business excellence, the Bush administration announced today.
Verizon sees power of wireless technology
In a sure sign that the upstart wireless Internet technology called WiFi is proving too powerful to ignore, Verizon Communications said today that it will install such networks for small and medium-sized businesses.
Chicago firm recalls 410,000 toys
Kolokraft Inc. is recalling about 410,000 toy attachments to baby walkers that can break apart and have caused facial cuts to 15 children.


Changes on the speed value will be taken into account in the next game.
Speed
Background color
Music volume
Effects volume


It is possible for a single observation to have a great influence on the results of a regression analysis. It is therefore important to detect influential observations and to take them into consideration when interpreting the results.
olsrr offers the following tools to detect influential observations:
Bar Plot of Cook’s distance to detect observations that strongly influence fitted values of the model. Cook’s distance was introduced by American statistician R Dennis Cook in 1977. It is used to identify influential data points. It depends on both the residual and leverage i.e it takes it account both the x value and y value of the observation.
Steps to compute Cook’s distance:
A data point having a large cook’s d indicates that the data point strongly influences the fitted values.
model <- lm(mpg ~ disp + hp + wt + qsec, data = mtcars)
ols_plot_cooksd_bar(model)
Chart of Cook’s distance to detect observations that strongly influence fitted values of the model.
model <- lm(mpg ~ disp + hp + wt + qsec, data = mtcars)
ols_plot_cooksd_chart(model)
DFBETA measures the difference in each parameter estimate with and without the influential point. There is a DFBETA for each data point i.e if there are n observations and k variables, there will be \(n * k\) DFBETAs. In general, large values of DFBETAS indicate observations that are influential in estimating a given parameter. Belsley, Kuh, and Welsch recommend 2 as a general cutoff value to indicate influential observations and \(\frac{2}{\sqrt{n}}\) as a size-adjusted cutoff.
model <- lm(mpg ~ disp + hp + wt, data = mtcars)
ols_plot_dfbetas(model)
Proposed by Welsch and Kuh (1977). It is the scaled difference between the \(i^{th}\) fitted value obtained from the full data and the \(i^{th}\) fitted value obtained by deleting the \(i^{th}\) observation. DFFIT - difference in fits, is used to identify influential data points. It quantifies the number of standard deviations that the fitted value changes when the ith data point is omitted.
Steps to compute DFFITs:
An observation is deemed influential if the absolute value of its DFFITS value is greater than:
\[{2}*{\frac{\sqrt{(p + 1)}}{(n - p -1)}}\]
where n is the number of observations and p is the number of predictors including intercept.
model <- lm(mpg ~ disp + hp + wt + qsec, data = mtcars)
ols_plot_dffits(model)
Plot for detecting outliers. Studentized deleted residuals (or externally studentized residuals) is the deleted residual divided by its estimated standard deviation. Studentized residuals are going to be more effective for detecting outlying Y observations than standardized residuals. If an observation has an externally studentized residual that is larger than 3 (in absolute value) we can call it an outlier.
model <- lm(mpg ~ disp + hp + wt + qsec, data = mtcars)
ols_plot_resid_stud(model)
Chart for detecting outliers. Standardized residual (internally studentized) is the residual divided by estimated standard deviation.
model <- lm(mpg ~ disp + hp + wt + qsec, data = mtcars)
ols_plot_resid_stand(model)
Graph for detecting influential observations.
model <- lm(read ~ write + math + science, data = hsb)
ols_plot_resid_lev(model)
Graph for detecting outliers.
model <- lm(mpg ~ disp + hp + wt + qsec, data = mtcars)
ols_plot_resid_stud_fit(model)
Hadi’s measure of influence based on the fact that influential observations can be present in either the response variable or in the predictors or both. The plot is used to detect influential observations based on Hadi’s measure.
model <- lm(mpg ~ disp + hp + wt + qsec, data = mtcars)
ols_plot_hadi(model)
Plot to aid in classifying unusual observations as high-leverage points, outliers, or a combination of both.
model <- lm(mpg ~ disp + hp + wt + qsec, data = mtcars)
ols_plot_resid_pot(model)


The following sample demonstrates how to declaratively use the Repeater Control with declarative WinJS.Binding.Templates to build a simple bar graph using a series of progress elements
progress


TechVeda is bi-annual newsletter of IEEE USICT whose aim is to provide students a platform to enhance technical and content writing skills, an opportunity to challenge their designing skills, a hub to showcase and speak about their hobby projects and to cater as a medium to communicate and share knowledge, experience and tips.
TechVeda is bi-annual newsletter of IEEE USICT whose aim is to provide students a platform to enhance technical and content writing skills, an opportunity to challenge their designing skills, a hub to showcase and speak about their hobby projects and to cater as a medium to communicate and share knowledge, experience and tips.
TechVeda is bi-annual newsletter of IEEE USICT whose aim is to provide students a platform to enhance technical and content writing skills, an opportunity to challenge their designing skills, a hub to showcase and speak about their hobby projects and to cater as a medium to communicate and share knowledge, experience and tips.
TechVeda is bi-annual newsletter of IEEE USICT whose aim is to provide students a platform to enhance technical and content writing skills, an opportunity to challenge their designing skills, a hub to showcase and speak about their hobby projects and to cater as a medium to communicate and share knowledge, experience and tips.


{% extends 'base.html' %} {% block content %}
Menéame is a Spanish social news website based on community partecipation, where users can submit content discovered on the Internet, vote and comment other people submissions. In our project we intend to investigate different aspects of the users and the stories shared in 1 year.
This web has been developed as a project for the course Data mining using python at DTU
The source code can be found at github.


Find out who tries to cheat your invite-ranking system and kick them from your server.
See who invited who. (Only tracks people who join after you added InviteManager)
Find members who try to cheat the system by leaving/joining the server to boost their invite count!
Show top inviters. Global or per channel.
Configure the bot with simple commands inside discord.
Remove old invites and start off like with an empty server. (reversible)
We have more features planned. Join our discord server for more info!


My family and I are currently traveling and working full-time and homeschooling from the road while traveling in our fifth-wheel R.V. I started with coding to learn a new skill the could become a new career possibly. I enjoyed it so much I decided to sign up for coding bootcamp at the University of Denver! This is one of the most difficult things I have ever done, but I do believe it will be one of the most rewarding things I have done as well.


Spark foundation is an NGO for poor child education in India. It helps over 10,00,000 childrens and their their families every year.It has projects on education, healthcare, livelihood and women empowerment, in remote villages and slums across differnet states of india. From the words of Jawaharlal Nehru,children are like bunds in the garden that need to be carefully nurterd, as they are future citizens of tommorow. Education acts as the wind beneath the wings for children for grow as healthy and prosperous adults in the future.
⇛ Teaching & Education
⇛ Medicine & Healthcare
⇛ Provide Food to Hungry
⇛ Shelter & homeless
⇛ Donate a Warm Blanket
⇛ Donate Educational Kit
For any queries and details, please speak to sparks team at +235481 (10:00am to 9:00pm) or please write to<EMAIL_ADDRESS>The foundation works on health care along with support and dignity to destitute. We also work for education, food, donate warm blanket, emergency medical and disaster relief.


| 1 | package fr.sii.ogham.testing.assertion.hamcrest; | |
| 2 | ||
| 3 | import fr.sii.ogham.testing.assertion.OghamAssertions; | |
| 4 | import fr.sii.ogham.testing.assertion.util.HtmlUtils; | |
| 5 | import org.hamcrest.BaseMatcher; | |
| 6 | import org.hamcrest.Description; | |
| 7 | import org.opentest4j.AssertionFailedError; | |
| 8 | import org.w3c.dom.Document; | |
| 9 | import org.xmlunit.diff.Diff; | |
| 10 | import org.xmlunit.diff.Difference; | |
| 11 | ||
| 12 | import java.util.function.Consumer; | |
| 13 | ||
| 14 | /** | |
| 15 | * Check if the HTML is identical or similar to the expected. The HTML strings are parsed | |
| 16 | * into {@link Document}s. Two documents are considered to be "identical" if | |
| 17 | * they contain the same elements and attributes in the same order.Two documents are considered to be "similar" if they | |
| 18 | * contain the same elements and attributes regardless of order. | |
| 19 | * | |
| 20 | * <p> | |
| 21 | * This matcher is a {@link ExpectedValueProvider} for knowing the original expected | |
| 22 | * value. Thanks to this information, {@link OghamAssertions} will generate a | |
| 23 | * {@link AssertionFailedError} with the expected string and actual string in order | |
| 24 | * to be able to visualize the differences on sources directly in the IDE. | |
| 25 | * | |
| 26 | * <p> | |
| 27 | * See {@link HtmlUtils} for more information about "identical"/"similar" HTML. | |
| 28 | * | |
| 29 | * @author Aurélien Baudet | |
| 30 | * | |
| 31 | */ | |
| 32 | public abstract class AbstractHtmlDiffMatcher extends BaseMatcher<String> implements ExpectedValueProvider<String>, ComparisonAwareMatcher { | |
| 33 | protected final String expected; | |
| 34 | protected final Consumer<String> printer; | |
| 35 | protected final String name; | |
| 36 | protected final boolean identical; | |
| 37 | protected Diff diff; | |
| 38 | ||
| 39 | public AbstractHtmlDiffMatcher(String expected, Consumer<String> printer, String name, boolean identical) { | |
| 40 | super(); | |
| 41 | this.expected = expected; | |
| 42 | this.printer = printer; | |
| 43 | this.name = name; | |
| 44 | this.identical = identical; | |
| 45 | } | |
| 46 | ||
| 47 | @Override | |
| 48 | public boolean matches(Object item) { | |
| 49 | diff = HtmlUtils.compare(expected, (String) item, identical); | |
| 50 | boolean matches = matches(diff); | |
| 51 |
1
1. matches : negated conditional → NO_COVERAGE |
if(!matches) { |
| 52 |
1
1. matches : removed call to java/util/function/Consumer::accept → NO_COVERAGE |
printer.accept(comparisonMessage()); |
| 53 | } | |
| 54 |
2
1. matches : replaced boolean return with true for fr/sii/ogham/testing/assertion/hamcrest/AbstractHtmlDiffMatcher::matches → NO_COVERAGE 2. matches : replaced boolean return with false for fr/sii/ogham/testing/assertion/hamcrest/AbstractHtmlDiffMatcher::matches → NO_COVERAGE |
return matches; |
| 55 | } | |
| 56 | ||
| 57 | protected abstract boolean matches(Diff diff); | |
| 58 | ||
| 59 | @Override | |
| 60 | public void describeTo(Description description) { | |
| 61 | description.appendValue(expected); | |
| 62 | } | |
| 63 | ||
| 64 | @Override | |
| 65 | public String getExpectedValue() { | |
| 66 |
1
1. getExpectedValue : replaced return value with "" for fr/sii/ogham/testing/assertion/hamcrest/AbstractHtmlDiffMatcher::getExpectedValue → NO_COVERAGE |
return expected; |
| 67 | } | |
| 68 | ||
| 69 | @Override | |
| 70 | public String comparisonMessage() { | |
| 71 | StringBuilder sb = new StringBuilder(); | |
| 72 | sb.append("The two HTML documents are not ").append(name).append(".\n"); | |
| 73 | sb.append("Here are the differences found:\n"); | |
| 74 | for(Difference d : diff.getDifferences()) { | |
| 75 | sb.append(" - ").append(d.toString()).append("\n"); | |
| 76 | } | |
| 77 | sb.append("\n"); | |
| 78 |
1
1. comparisonMessage : replaced return value with "" for fr/sii/ogham/testing/assertion/hamcrest/AbstractHtmlDiffMatcher::comparisonMessage → NO_COVERAGE |
return sb.toString(); |
| 79 | } | |
| 80 | } | |
Mutations | ||
| 51 |
1.1 |
|
| 52 |
1.1 |
|
| 54 |
1.1 2.2 |
|
| 66 |
1.1 |
|
| 78 |
1.1 |


Ancient Greece
Architectural Timeline
- c. 800 BCE - The site of Delphi first acquires a religious significance.
- c. 700 BCE
- - Sanctuary of Poseidon built at Isthmia.
- - Paros begins to export its Parian marble across the Greek world and it is widely used in temples and sculpture.
- 650 BCE - 600 BCE - Heraion, temple dedicated to Hera built at Olympia.
- c. 580 BCE - Long-distance aqueducts were constructed at Samos and Athens.
- c. 570 BCE - First Temple of Aphaia complex built on Aegina.
- 570 BCE - 560 BCE - A large temple is built and dedicated to Hera on Samos.
- 570 BCE - 530 BCE - The Doric Temple of Hera is built at Metapontum, Magna Graecia.
- c. 550 BCE - The Temple of Hera I is built at Paestum.
- c. 550 BCE - c. 430 BCE - Construction of the Temple of Artemis at Ephesus, one of the Seven Wonders of the Ancient World.
- c. 550 BCE - The temple of Apollo is constructed at Corinth.
"Architecture should speak of its time and place but yern for timelessness." - Frank Gehry If you have time, you should read more about this incredible time in historyWikipedia entry


Range Selector
Use Range Selection for Filtering
Dark Theme
Light Theme
Filter Employee List by Birth Year


{% extends 'base.html' %} {% block content %}
{{ competition.start_date }} to {{ competition.end_date }}


Entering dates
Since dates in MEI consist of a visible and a hidden (machine-readable) component, a special date editor is opened whenever you click a date field or the "Edit" button next to a date.
The visible part of the date, that is, the date as you want it to be displayed, is entered
at the bottom. You may enter anything you would like to be displayed as the dating, e.g.
"May 23", "1906-1918", "2012-09-19" or "No later than the composer's 41st
anniversary".
The "Displayed date or text" field must contain text. You may use the
"Paste date" button to simply copy the machine-readable dates into the text field;
otherwise, enter text manually as desired.
The machine-readable part is entered using the day, month and year fields in the middle. You may either enter a single date or the end point(s) of a date span. Choose the appropriate setting at the top.
A year or a month may be entered as a single date by leaving the day or both the day and month fields empty.
Choose the "Date span" setting if you need to enter a date range, or if you know only one end point of a date span for the event. A couple of examples for illustration:
Only one date may be entered in each of the two parts "Start" and "End", respectively. Use "Date" if you know an exact date (or exact month, or year), or "Not before"/"Not after" if you know only the outer limits.
Click the "OK" button to keep your changes, or "Cancel" to close the date editor without changing the original date. When the date editor closes, the machine-readable part will be displayed on the main form in square brackets.


Kirk Herbstreit Reacts To Ohio State’s Win vs. Penn State
by Andrew McCartyOn Saturday afternoon, Ohio State showed it is the best team in the Big Ten by handling Penn State at home.
The Buckeyes dominated on the ground in the first half. Despite a furious comeback attempt from Penn State, Ohio State held on to walk out with a 28-17 win and take control of the Big Ten East.
After the game, ESPN college football analyst Kirk Herbstreit sent a message to Ohio State and Penn State players.
Check it out.
“Great game. Ohio State beats a very motivated and determined Penn State team. Buckeyes clinch a trip to Indy w/ the win & now turn their attention towards Michigan week!! And the Lions finish with a lay up vs Rutgers & a 10-2 year AND a well deserved NY6 bowl bid!” Herbstreit said.
Ohio State locked in a spot in the Big Ten title game, but still has a major game left. Next weekend the Buckeyes travel to Ann Arbor for showdown against rival Michigan.
The Wolverines seem to finally be playing their best football, but Jim Harbaugh’s team has struggled against Ohio State.
Can the Buckeyes take down the Wolverines next weekend and take home another Big Ten title later this season? Stay tuned.


with open('logs.txt') as log_file:
prev = line = None
for next in log_file:
next = next.rstrip('\n')
if line and 'error' in line.lower():
print(prev, line, next, sep='\n')
prev, line = line, next
if line and 'error' in line.lower():
print(prev, line, None, sep='\n')
Lazy Looping
What are iterables and iterators?
Iterable
An iterable is anything you can loop over.
for thing in my_iterable:
do_something_with(thing)
>>> my_file = open("my_file.txt")
>>> next(my_file)
'This is line 1 of the file'
>>> next(my_file)
'This is line 2 of the file'
>>> for line in my_file:
... print(line, end="")
...
This is line 3 of the file
This is line 4 (the end of the file)
>>> list(my_file)
[]
Iterators are lazy
They compute their next value as you loop over them
They might not store any values "inside" themselves at all
How do you create iterators?
def denumerate(iterable):
n = -1
values = []
for item in iterable:
values.append((n, item))
n -= 1
return values
>>> colors = ['pink', 'green', 'purple', 'blue']
>>> for n, color in denumerate(colors):
... print(n, color)
...-1 pink
-2 green
-3 purple
-4 blue
def denumerate(iterable):
n = -1
values = []
for item in iterable:
values.append((n, item))
n -= 1
return values
def denumerate(iterable):
n = -1
for item in iterable:
yield (n, item)
n -= 1
Generator function
def denumerate(iterable):
n = -1
for item in iterable:
yield (n, item)
n -= 1
def gimme_five():
print('Start!')
return 5
def denumerate(iterable):
print('Start?')
n = -1
for item in iterable:
yield (n, item)
n -= 1
>>> x = gimme_five()Start!
>>> x
5
>>> y = denumerate(["purple", "blue", "pink"])
>>> y
<generator object denumerate at 0x7febbdeaae58>
def denumerate(iterable):
print('start!')
n = -1
for item in iterable:
print('about to yield')yield (n, item)print('incrementing!')
n -= 1
print('all done!')
>>> for n, color in denumerate(["purple", "pink"]):
... print(f"Color {n} is {color}")
...start!
about to yieldColor -1 is purpleincrementingabout to yieldColor -2 is pinkincrementingall done!
Generators (and iterators)do work as you loop over them
When asked for their next item:
They do work to figure out that item
Yield that item to the loop they're in
And put themselves on pause until asked for another item
>>> def square_all(numbers):
... for n in numbers:
... yield n**2
...
>>> numbers = [2, 1, 3, 4, 7, 11]
>>> squares = square_all(numbers)
>>> squares<generator object square_all at 0x7f11191b78b8>
>>> squares = (n**2 for n in numbers)
>>> squares_list = [n**2 for n in numbers]
>>> squares_list
[4, 1, 9, 16, 49, 121]
>>> squares<generator object <genexpr> at 0x7f78f87af0c0>
How to make iterators
Write a generator function (calling it returns an iterator)
Make a generator expression (which makes an iterator)
Make an iterator class
How are iterators used?
Looping over iterators
squares = (n**2 for n in range(1000))
total = 0
for n in squares:
total += n
total = sum((n**2 for n in range(1000)))
total = sum(n**2 for n in range(1000))
Wrapping iterators in iterators
import csv
with open('expenses.csv') as expenses_file:expense_rows = csv.reader(expenses_file)travel_costs = sum((float(cost)for date, merchant, cost, category in expense_rowsif category == 'travel'))
What do you do with iterators?
Wrap another iterator around themby
passing them to a generator function
creating a generator expression
calling another iterator-returning function
Loop over them, but only once
writing a for loop or a list comprehension
calling another function that will do the looping
The Problem: Revisited
Find logged errors (with context)
with open('logs.txt') as log_file:
prev = line = None
for next in log_file:
next = next.rstrip('\n')
if line and 'error' in line.lower():
print(prev, line, next, sep='\n')
prev, line = line, nextif line and 'error' in line.lower():
print(prev, line, None, sep='\n')
Find logged errors (with context)
with open('logs.txt') as log_file:
for prev, line, next in around(strip_newlines(log_file)):
if 'error' in line.lower():
print(prev, line, next, sep='\n')
def around(iterable):
"""Yield (prev, item, next) for each item in iterable."""
before = current = None
for after in iterable:
if current is not None:
yield (before, current, after)
before, current = current, after
if current is not None:
yield (before, current, None)def strip_newlines(lines):
for line in lines:
yield line.rstrip('\n')with open('logs.txt') as log_file:
for prev, line, next in around(strip_newlines(log_file)):
if 'error' in line.lower():
print(prev, line, next, sep='\n')
Code you don't need to write
Pre-written lazy looping helpers
enumerate
zip
reversed
any and all
Everything in the itertools module
Third-party libraries: more-itertools and boltons
def around(iterable):
"""Yield (prev, item, next) for each item in iterable."""
before = current = None
for after in iterable:
if current is not None:
yield (before, current, after)
before, current = current, after
if current is not None:
yield (before, current, None)
from itertools import chain
from more_itertools import windowed
def around(iterable):
"""Yield (prev, item, next) for each item in iterable."""
return windowed(chain([''], iterable, ['']), size=3)
Words are hard
Iterator: lazy single-use iterable
Generator function: a syntax for easily creating iterators
Generator expression: comprehension which returns a generator instead of a list
Generator object (aka generator): an iterator created from a generator function (or a generator expression)
generator function
generator objectgenerator
generator expression generator comprehension
"Calling a generator function returns a generator" - Luciano Ramalho in Fluent Python (page 429)
generator function
generator objectgenerator
generator expression generator comprehension
"Calling a generator function returns a generator" - Luciano Ramalho in Fluent Python (page 429)
Iterators are lazy single-use iterables
Generators are the "easy" way to make an iterator
There are lots of lazy looping helpers included with Python and in third-party libraries
Iterators help make more more memory-efficient code
Wrapping iterators-in-iterators can break up big and scary loops into small understandable steps


Research and analysis
Alternative school provision: findings of a three year survey
Findings from an Ofsted survey on the use of off-site alternative provision by schools and pupil referral units.
Documents
PDF
,
830KB
,
52 pages
This file may not be suitable for users of assistive technology.
Request an accessible format.
If you use assistive technology (such as a screen reader) and need a
version of this document in a more accessible format, please email
<EMAIL_ADDRESS>.
Please tell us what format you need. It will help us if you say what assistive technology you use.
http://www.slideshare.net/Ofstednews/alternativeprovisionpointsfordiscussionfortraining
PDF
,
306KB
,
19 pages
This file may not be suitable for users of assistive technology.
Request an accessible format.
If you use assistive technology (such as a screen reader) and need a
version of this document in a more accessible format, please email
<EMAIL_ADDRESS>.
Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Word Document
,
694KB
This file may not be suitable for users of assistive technology.
Request an accessible format.
If you use assistive technology (such as a screen reader) and need a
version of this document in a more accessible format, please email
<EMAIL_ADDRESS>.
Please tell us what format you need. It will help us if you say what assistive technology you use.
Details
In 2011, Ofsted published a
survey report on the use of off-site alternative provision by schools and pupil referral units
. The survey identified successful features of alternative provision and commented on a range of weaknesses that inspectors had found during their visits.
As a result of the survey’s findings, the Department for Education (DfE) commissioned Ofsted to carry out a second survey on the same topic. This page has the findings from the first year of this survey as well as the final findings.


a minimalist passover haggadah
a passover seder is a meal where you celebrate freedom, ask questions, and tell an ancient story
dedication
kadesh
קַדֵשׁ
- fill your cup with wine (first of four)
-
say the blessing for wine:
blessed are you lord our god ruler of the world who creates the fruit of the vine
barukh atah adonoi elohenu melekh ha-olom borei pree ha-gofen
בָּרוּךְ אַתָּה יְיָ אֱלֹהֵינוּ מֶלֶךְ הָעוֹלָם בּוֹרֵא פְּרִי הַגָּפֶן
- drink and relax
bathe
urkhatz
וּרְחַץ
- wash your hands (perhaps from a bowl of water)
- dry your hands
parsley
karpas
כַּרְפַּס
- dip parsley in saltwater twice
-
say the blessing for vegetables:
blessed are you lord our god ruler of the world who creates the fruit of the earth
barukh atah adonoi elohenu melekh ha-olom borei pree ha-adamah
בָּרוּךְ אַתָּה יְיָ אֱלֹהֵינוּ מֶלֶךְ הָעוֹלָם בּוֹרֵא פְּרִי הָאֲדָמָה
- eat
pressure
yakhatz
יַחַץ
- the middle matzo is broken in half
- the larger piece is designated as the afikomen (אֲפִיקוֹמָן) aka the dessert
story
maggid
מַגִּיד
at this point, children traditionally ask four questions:
-
how is this night different from all other nights?
mah nishtanah halailah hazeh mikol haleilot
מַה־נִּשְׁתַּנָּה הַלַּֽיְלָה הַזֶּה מִכָּל־הַלֵּילוֹת
-
on all other nights, we eat chametz (leavened foods) and matzah; why on this night, only matzah?
sheb'chol haleilot anu ochlin chametz umatzah, halailah hazeh, kuloh matzah
שֶׁבְּכָל־הַלֵּילוֹת, אָֽנוּ אוֹכְלִין חָמֵץ וּמַצָּה; הַלַּֽיְלָה הַזֶּה, כֻּלּוֹ מַצָּה
-
on all other nights, we eat all vegetables; why, on this night, maror (bitter herbs)?
sheb'chol haleilot anu ochlin sh'ar y'rakot, halailah hazeh, maror
שֶׁבְּכָל־הַלֵּילוֹת, אָֽנוּ אוֹכְלִין שְׁאָר יְרָקוֹת; הַלַּֽיְלָה הַזֶּה, מָרוֹר
-
on all other nights, we eat either sitting upright or reclining; why on this night do we all recline?
sheb'chol haleilot anu ochlin bein yoshvin uvein m'subin; halailah hazeh, kulanu m'subin
שֶׁבְּכָל־הַלֵּילוֹת, אָֽנוּ אוֹכְלִין בֵּין יוֹשְׁבִין וּבֵין מְסֻבִּין; הַלַּֽיְלָה הַזֶּה, כֻּלָּֽנוּ מְסֻבִּין
instead of an answer there is a story:
joseph brought his family to egypt
they were enslaved by a pharoh
moses came to free them
the pharoh refused
god made plagues
(pour the second glass of wine and count the ten plagues while putting ten drops of wine on your plate)
they fled to the dessert where they wandered for 40 years
stuff happened
they got to jerusalem
wash
rakhtzah
רַחַץ
wash your hands again
bring out the matzo
motzi matzo
מוֹצִיא מַצָּה
- take a piece of matzo
-
say the blessing for bread:
blessed are you lord our god ruler of the world who brings us the bread of the earth
barukh atah adonoi elohenu melekh ha-olom ha-motzi lekhem meen ha-aretz
בָּרוּךְ אַתָּה יְיָ אֱלֹהֵינוּ מֶלֶךְ הָעוֹלָם הַמּוֹצִיא לֶחֶם מִן הָאָרֶץ
- eat
bitter herbs
maror
מָרוֹר
eat some horse-raddish
sandwich
korekh
כֹּרֵךְ
eat a hillel sandwich (haroset + horse-raddish on matzo)
festive meal
shulkhan orech
שֻׁלְחָן עֹרֵךְ
eat
hidden
tzafun
צָפוּן
at this point children may have hidden the afikomen
if so a reward may need to be offered for its safe return before it is eaten
blessings
barekh
בָּרֵךְ
pour the third glass of wine and say blessings after the meal
praise
halel
הַלֵּל
sing songs and pour the fourth glass of wine
acceptance
nirtzah
נִרְצָה
sing more songs


Installing Mono 2.0 on Ubuntu 7.10
Currently the Mono project does not release Ubuntu binary packages so if you want the latest version of Mono you need to compile and install yourself. I use the Xubuntu, Here are the steps I took to install Mono 2.0 on Xubuntu 7.10:
Download mono and libgdiplus tarballs from http://ftp.novell.com/pub/mono/sources-stable/.
$ wget http://ftp.novell.com/pub/mono/sources/mono/mono-2.0.1.tar.bz2 $ wget http://ftp.novell.com/pub/mono/sources/libgdiplus/libgdiplus-2.0.tar.bz2
Install libglib2 development headers:
$ sudo apt-get install libglib2.0-dev
Install libfontconfig1 development headers (without this ./configure emits configure: error: Cairo requires at least one font backend):
$ sudo apt-get install libfontconfig1-dev
Compile and install libgdiplus. libgdiplus is required for Winforms, if you don’t use Winforms you can skip this step and use ./configure –with-libgdiplus=no when you compile Mono.
$ tar -xjf libgdiplus-2.0.tar.bz2 $ cd libgdiplus-2.0 $ ./configure $ make $ sudo make install
The libraries were installed in /usr/local/lib.
Install bison:
$ sudo apt-get install bison
Compile Mono:
$ tar -xjf mono-2.0.tar.bz2 $ cd mono-2.0 $ ./configure $ make $ sudo make install
See also http://www.mono-project.com/Release_Notes_Mono_2.0
If you want to compile or run GUI applications using GTK bindings instead of WinForms you need to download and compile Gtk#:
First install the following packages to ensure the necessary headers:
$ sudo apt-get install libpango1.0-dev $ sudo apt-get install libatk1.0-dev $ sudo apt-get install libgtk2.0-dev
Download Gtk# source tarball from http://www.mono-project.com/GtkSharp
Extract, compile and install Gtk#:
$ tar -zxf gtk-sharp-2.12.0.tar.gz $ cd cd gtk-sharp-2.12.0 $ ./configure $ make $ sudo make install
Other dependencies
One last point, the following packages were already installed on my machine: fontconfig, fontconfig-config, _libfontconfig1_ – not sure if they are ‘libgdiplus’ compilation dependents but if you have problems these may be what are required. My machine already had a number of development tools and utilities installed, so there may be other dependencies I’ve missed for an “out of the box” Xubuntu install.
Getting Started
You need to tell Mono where to find it’s libraries:
$ export LD_LIBRARY_PATH=/usr/local/lib
See http://www.mono-project.com/DllNotFoundException
Next compile and run the Hello Worlds as described in Mono Basics.
If you have problems turn on debugging by setting MONO_LOG_LEVEL the environment variable. For example:
$ MONO_LOG_LEVEL=debug mono hello.exe
Closing thoughts
I like the idea of WinForms as a way of writing desktop apps that run on both Windows and Linux and I like to use Linux for development, problem at the moment is that there’s no SharpDevelop-like IDE for creating WinForm UIs on Linux (MonoDevelop uses GTK). There is a WinForms Designer that runs under Linux but it’s not a full IDE and currently is more a “proof of concept” thing.


Second Year Computer Engineer Student (Time when I am typing this lines). Learning JavaScript right now to build my skills. I believe, I have got very good skill in HTML & CSS. Cant wait to be a Frontend Developer. Lastly, my dream is to make a game like FIFA. Keep me in your prayers.


|
19.08
|
Functions | |
| template<typename T , typename = typename std::enable_if<( std::is_integral<T>::value ), arm_compute::utils::requires::detail::enabler>::type> | |
| bool | is_bit_set (T v, unsigned int idx) |
| Checks if the idx-th bit is set in an integral type. More... | |
| bool arm_compute::helpers::bit_ops::is_bit_set | ( | T | v, |
| unsigned int | idx | ||
| ) |
Checks if the idx-th bit is set in an integral type.
| [in] | v | Integral input |
| [in] | idx | Index of the bit to check |
Definition at line 45 of file bit_ops.h.
Referenced by arm_compute::helpers::tensor_transform::calculate_end_on_index(), arm_compute::helpers::tensor_transform::calculate_start_on_index(), arm_compute::helpers::tensor_transform::compute_strided_slice_output_shape(), and CLStridedSliceKernel::configure().


R/cytomegalovirus.R
cytomegalovirus.Rd
This data set contains 64 consecutive patients who underwent T-cell replete, matched sibling donor reduced-intensity conditioning allogeneic hematopoietic stem cell transplant. The primary risk factor of interest was the number of activating killer immunoglobulin-like receptors (aKIRs: 1-4 vs. 5-6). (more details after variable information).
cytomegalovirus
A data frame with 64 observations and 26 variables
ID
Patient ID, numeric, range: 1-64
age
Recipient age at transplant, numeric, range: 29-67
sex
Recipient sex, numeric, range: 0 (male) - 1(female)
race
Recipient race, numeric, range: 0 (white) - 1 (african-american)
diagnosis
type: character, levels: 13
diagnosis.type
Category of cancer diagnosis, numeric, range: 0 (myeloid) - 1 (lymphoid)
time.to.transplant
Time from cancer diagnosis to transplant (months), numeric, range: 1.84-173.8
prior.radiation
Prior radiation therapy, numeric, range: 0 (no) - 1 (yes)
prior.chemo
Number of prior chemotherapy regimens, numeric, range: 0-8
prior.transplant
Prior stem cell transplant, numeric, range: 0 (no) - 1 (yes)
recipient.cmv
Recipient cytomegalovirus seropositive status, numeric, range: 0 (negative) - 1 (positive)
donor.cmv
Donor cytomegalovirus seropositive status, numeric, range: 0 (negative) - 1 (positive)
donor.sex
Donor sex, numeric, range: 0 (female) - 1 (male)
TNC.dose
Total nucleated cell dose (x 10^8/kg), numeric, range: 2.06- 21.0
CD34.dose
Total CD34+ (stem) cell dose (x 10^8/kg), numeric, range: 2.04- 12.5
CD3.dose
Total CD3+ (T) cell dose (x 10^8/kg), numeric, range: 1.08- 8.2
CD8.dose
Total CD8+ cell dose (x 10^8/kg), numeric, range: 0.16- 3.2
TBI.dose
Total body irradiation dosage (centiGrays), numeric, range:200.00-400.0
C1/C2
HLA-Cw group, numeric, range: 0 (heterozygous) - 1 (homozygous)
aKIRs
Number of donor activating killer immunoglobulin-like receptors (hypothesized Predictor), numeric, range: 1.00- 6.0
cmv
cytomegalovirus reactivation posttransplant (hypothesized Outcome), numeric, range: 0 (No) - 1 (Yes)
time.to.cmv
Time to cytomegalovirus reactivation (months), numeric, range: 0.43- 84.5
agvhd
Acute level 2-4 graft versus host disease, numeric, range: 0 (no) - 1 (yes)
time.to.agvhd
Time to acute level 2-4 graft versus host disease (months), numeric, range: 0.66- 85.2
cgvhd
Chronic graft versus host disease, numeric, range: 0 (no) - 1 (yes)
time.to.cgvhd
Time to chronic graft versus host disease (months), numeric, range: 0.82- 65.1
Sobecks et al. 'Cytomegalovirus Reactivation After Matched Sibling Donor Reduced-Intensity Conditioning Allogeneic Hematopoietic Stem Cell Transplant Correlates With Donor Killer Immunoglobulin-like Receptor Genotype'. Exp Clin Transplant 2011; 1: 7-13.
A number of demographic, baseline and transplant characteristics were also collected. The primary outcome is presence of and time to cytomegalovirus reactivation. The dataset is cleaned and relatively complete. There are no outliers or data problems.
Hematopoietic stem cell transplantation (HSCT) is the transplantation of multipotent hematopoietic stem cells, from bone marrow, peripheral blood, or umbilical cord blood. It is a medical procedure most often performed for patients with certain cancers of the blood or bone marrow, such as multiple myeloma or leukemia. Allogeneic HSCT involves two people: the (healthy) donor and the (patient) recipient. Allogeneic HSC donors must have a tissue (HLA) type that matches the recipient.
In myeloablative allogeneic HSCT, chemotherapy or irradiation is given immediately prior to a transplant (the conditioning regimen) with the purpose of eradicating the patient's disease prior to the infusion of HSC and to suppress immune reactions. The bone marrow can be ablated (destroyed) with dose- levels that cause minimal injury to other tissues. For many patients who are at high risk for transplant-related mortality with myeloablative allogeneic HSCT, reduced- intensity conditioning allogeneic hematopoietic stem cell transplant has proven effective. Although the reduced-intensity conditioning allogeneic HSCT may avoid many of the organ toxicities associated with myeloablative conditioning, the risk for developing graft-versus-host disease and infection including cytomegalovirus remains significant.
Cytomegalovirus (CMV) is a common virus that can infect almost anyone. Once infected, your body retains the virus for life. Most people don't know they have CMV because it rarely causes problems in healthy people. But if pregnant or having a weakened immune system, CMV is cause for concern. For people with compromised immunity, such as after allogeneic HSCT, CMV infection can be fatal. Natural killer (NK) and T cells provide protection against CMV reactivation. The reactivity of NK cells and some T-cell subsets are regulated by the interaction of killer immunoglobulin-like receptors (KIRs) with target cell HLA class 1 molecules. The donor activating KIR genotype has been implicated as a contributing factor for CMV reactivation after myeloablative allogeneic HSCT.
This study investigates whether donor KIR genotype influences reactivation of CMV after T-cell replete, matched sibling donor reduced-intensity conditioning allogeneic HSCT.
The study included 64 consecutive patients who underwent T-cell replete, matched sibling donor reduced-intensity conditioning allogeneic hematopoietic stem cell transplant between January 16, 2000 and April 24, 2007 at the Cleveland Clinic.
Human leucocyte antigen (HLA) typing on donors and recipients was performed to allow assessment of killer immunoglobulin-like receptor ligands (KIRs). To allow for comparison with previous studies, donors were categorized as having 1-4 or 5-6 activating killer immunoglobulin-like receptor genes (aKIRs).
CMV reactivation was defined as any detection of cytomegalovirus DNA in the blood; the lower detection limit for this assay was 600 copies/mL.
The initial population consisted of 865 men who had undergone radical prostatectomy and received transfusion during or within 30 days of the surgical procedure at Cleveland Clinic and had available PSA follow-up data. Of these patients, 110 were excluded from the analysis because they received a combination of allogeneic and autologous blood products. Of the remaining 755 patients, 405 (54%) received solely allogeneic and 350 patients (46%) received solely autologous RBC units. Of the 405 patients who received allogeneic RBC transfusion, 89 were excluded because their transfused RBC age distribution included more than one of the terciles. Thus, this dataset consists of the 316 patients who received solely allogeneic blood products and could be classified into an RBC age exposure group.


Dr Norman Borlaug
The man who saved a billion life
Dr. Norman Borlaug, third from the left, trains biologists in Mexico on how to increase wheat yields - part of his life-long war on hunger.
Here's a time line of Dr. Borlaug's Life:
- 1914 - Born in Cresco, Iowa
- 1933 - Leaves his family's farm to attend the University of Minnesota, thanks to a Depression era program known as the "National Youth Administration"
- 1935 - Has to stop school and save up more money. Works in the Civilian Conservation Corps, helping starving Americans. "I saw how food changed them", he said. "All of this left scars on me."
- 1937 - Finishes university and takes a job in the US Forestry Service
- 1938 - Marries wife of 69 years Margret Gibson. Gets laid off due to budget cuts. Inspired by Elvin Charles Stakman, he returns to school study under Stakman, who teaches him about breeding pest-resistent plants.
- 1941 Tries to enroll in the military after the Pearl Harbor attack, but is rejected. Instead, the military asked his lab to work on waterproof glue, DDT to control malaria, disinfectants, and other applied science.
- 1942 - Receives a Ph.D. in Genetics and Plant Pathology
- 1944 - Rejects a 100% salary increase from Dupont, leaves behind his pregnant wife, and flies to Mexico to head a new plant pathology program. Over the next 16 years, his team breeds 6,000 different strains of disease resistent wheat - including different varieties for each major climate on Earth.
- 1945 - Discovers a way to grown wheat twice each season, doubling wheat yields
- 1953 - Crosses a short, sturdy dwarf breed of wheat with a high-yeidling American breed, creating a strain that responds well to fertilizer. It goes on to provide 95% of Mexico's wheat.
- 1962 -Visits Delhi and brings his high-yielding strains of wheat to the Indian subcontinent in time to help mitigate mass starvation due to a rapidly expanding population
- 1970 - receives the Nobel Peace Prize
- 1983 -helps seven African countries dramatically increase their maize and sorghum yields
- 1984becomes a distinguished professor at Texas A&M University
- 2005 -states "we will have to double the world food supply by 2050." Argues that genetically modified crops are the only way we can meet the demand, as we run out of arable land. Says that GM crops are not inherently dangerous because "we've been genetically modifying plants and animals for a long time. Long before we called it science, people were selecting the best breeds."
- 2009 -dies at the age of 95.
"Borlaug's life and achievement are testimony to the far-reaching contribution that one man's towering intellect, persistence and scientific vision can make to human peace and progress."
-- Indian Prime Minister Manmohan Singh


A couple of people who are just participating in their first seminar might ask themselves how you can find interesting new publications (papers). I would like to shed some light on it.
Initial Research
The hardest part is when you're new to a field. You don't know which journals are the important ones, which authors are most respected in the field, which terms are used.
Journal Rankings
Automated journal rankings like the h5-index used by Google Scholar (see metrics, Wikipedia) is one way to deal with the lack of domain knowledge. Google Scholar even publishes a list of journals per field (see Top publications in Computer Vision and Pattern Recognition).
Algorithmic Ideas
I've never tried it (on purpose), but the idea just came to my head: Use a random walk. You start with some paper of which you don't really know if it is good. Look at the references and try to weild out the ones which are obviously not work trying (e.g. because they are websites). Now take a random one to continue with. Do this a couple of times.
The idea is that papers which are more important are much more often cited. So you can hope to get to more important papers over time.
The hard way
Search for papers via Google. Look at the references. Search for papers in the reference. Get a feeling for the language being used.
Ongoing Research
When you have a little bit of domain knowledge (or a starting paper given to you by your supervisor) everything gets a lot easier.
There are a couple of key strategies:
- Looking at the references of a paper
- Looking at what else the same author published
- Looking for similar titles
- Reading Journals
For all three of them, I can highly recommend Google Scholar. They also offer a nice overview / statistics about authors so that you can get a feeling for their scientific activity. But don't let you fool you by those numbers: It is possible to fake them.
The other nice thing is that Google Scholar makes citing publications incredibly easy:
The arXiv
The arXiv can be seen as THE "modern way" journal. Depending on the field, it has a VERY high reputation.
For Pattern Recognition the reputation of the arXiv is amongst the highest ten journals, but it there are some fields like physics where it is THE top journal in several subfields like cosmology or high energy physics.
What makes the arXiv stand out is the fact that you can read new papers every day. I like to have a view at cs.CV/recent to keep myself informed about new stuff. There are about 20 new publications per day. On some days, there is nothing interesting, on other days like today quite a bit:
- The MegaFace Benchmark: 1 Million Faces for Recognition at Scale
- Rethinking the Inception Architecture for Computer Vision
- Labeling the Features Not the Samples: Efficient Video Classification with Minimal Supervision
- Attribute2Image: Conditional Image Generation from Visual Attributes
Filtering
I filter publications like this:
- First, I look at the title. If that doesn't look interesting, I skip it. The more exact the title is, the better. If it is too vague, I sometimes skip it too because the authors seem not to be familiar with the scientific style of writing and thus are probably not able to write an interesting paper.
- Then I read the abstract. I expect to get to know what the paper is about.
- Then I look at images / tables (depending on the subject)
- I read the conclusion / last part
- I read the end of the introduction where it often says "the paper is structured as follows"
I guess many researchers filter like this. This is important to know when you write a paper.
Recently, I've also got to know shortscience.org. It's a website where anybody can add summaries / remarks of papers. This is pretty awesome if you want to get the paper in context (especially of work which was released after the paper) or if you just want to see what the key idea behind a paper is.


{% if display_alert %}
Oops! Error:
{{ err_msg }}
{% endif %}
A Natural Language Processing Approach to Song Recommendations
I will recommend you songs lexically close to any custom text (lyrics, poems, fiction, etc.)
MixTape Title
Your Name
Playlists
{% for x in corpus_dict.keys() %}
{{ x }}
{% endfor %}
Submit
See All Generated Mixtapes
{% if display %}
{% if scroll %} {% endif %}
Your Mixtape: {{ song_name }} ({{ artist_name }})
{{ reco_df }}
{% if not callback_playlist %}
Create A Spotify Playlist!
{% else %}
Your Spotify Playlist has been created:
Your New Lex-Recos Playlist
Create another Playlist!
{% endif %}
{% endif %} {% if features %}
GRAPHS
*1. You can click the song names in legend to toggle its display on graph*
*2. If you are on a mobile device, please rotate to landscape view.*
Fig 1: Comparing word count and specific lexical features
Please rotate phone to landscape to see charts
Fig 2: Comparing all lexical features:
Please rotate phone to landscape to see charts
{% endif %}


Web-Development
Web-Development
Varun wadhwa
<EMAIL_ADDRESS>First Link With Icon
First Link With Icon
First Link With Icon
Subheader
Third Link With Waves
menu


Balenciaga selects Fantasy Interactive as creative digital
partner
Balenciaga has engaged Fantasy Interactive to provide a variety of digital services. We
are delighted to acquire a client whom shares
similar philosophies with our company.
1nd September 2014
10


| TWL Battlefield Bad Company 2 Season 1 |
| 4v4 Season 1 - XRef |
| Site | http://www.teamwarfare.com | Start date | 7/13/2010 |
| City | End date | 9/15/2010 | |
| Country | United States | Pairing system | Swiss |
| Organisation | TeamWarfare League | Arbiter |
|
| Generated by Sevilla (C) JBF Software |


- Personality Statistics
- Certificates
Network+
Cisco CCNA Route & Switch
Mikrotik MTCNA
- Education
High school
High school: Vizhe Farhangian High school
University
University : Computer Engineering,Guilan University
- Email<EMAIL_ADDRESS>- Address: Shahid Chamran blv., Rasht, Guilan
- Phone number:+989389787146
- Leave a reply:
THIS PAGE IS A TRADEMARK OF NIMA ASHURSEFAT. COPYRIGHT 2018 © NIMA ASHURSEFAT.


WITNESS LIST Natural Resources Committee May 23, 2005 -10:00A HB 2815 ON: Skaggs, Jason Legislative Aid (Senator Duncan), Ausitn, TX HB 3284 AGAINST: Peterson, Ken (Tx Rural Water Association), Austin, TX Smith, Tom " Smitty" (Public Citizen), Austin, TX Registering, but not testifying: For: Molter, Michele (Texas Apartment Association), Austin, TX HB 3568 FOR: Simpson, Terry (San Patricio County), Sinton, TX


zlib-flate -compress < path/to/input_file > path/to/compressed.zlib- Uncompress a file:
zlib-flate -uncompress < path/to/compressed.zlib > path/to/output_file- Compress a file with a specified compression level. 0=Fastest (Worst), 9=Slowest (Best):
zlib-flate -compress=compression_level < path/to/input_file > path/to/compressed.zlib


--- layout: post title: Zi makes progress with Qix date: 2006-09-30 00:00:00 categories: business interfaces-&-interaction mobile ---
Zi makes progress with Qix: "Virgin Mobile reported a 33 percent increase in ARPU from devices equipped with Qix"
The last time I heard about a rise in ARPU that significant in relation to handset UI was in 1999/2000, when I remember being told that Nokia users generated 2x the text messaging traffic of other device owners... I guess it's (sadly) rare to see such an overt and documented link between decent UI and revenue.


ADBWUI is built from the ground up for use on virtually any computer that can run NodeJS + adb.
Based on the ADBGUI project & idea, ADBWUI is here to help even the most novice of users.
ADBWUI uses only open source and/or free projects, and can be modified to fit your needs including becoming a kiosk for Phone Repair shops, stores, etc.
The idea of using NodeJS is simple: It is cross-platform for Windows, Linux, & Mac OSX. This makes it extremely simple to run adb (given that it is installed first) on any computer without the need for using complicated command line options (Or if you're just lazy like me ;) )


In this page, we provide our implementation of the baseline system used in our CVPR'14 papers. If you use any part of the code in your research, please kindly cite either of the following papers.
Basically, the Bag-of-Words (BoW) model [1] is used. Then, a number of improvements including [2][3][4][5] are added to the system. In the following, a step-by-step implementation is provided.
1. Codebook Generation code
Following [2], codebook is trained on an independent dataset, i.e., the Flickr60k dataset [2], which can be found on this page. The Approximate K-Means (AKM) [1] clustering is used, and codebook size is set to 20k ([6] shows that 65k is better). We use the FLANN library [7] to perform Approximate Nearest Neighbors (ANN) computations. We provide the pre-compiled mex64-file as long as the MATLAB codes here. Note that this code should be run on 64-bit machines.
Notes:
1) It is OK to run AKM for a coupled of rounds, say, 10 to 20. The search performance remains stable. If one wants to train a large codebook such as 1M, 2-5 rounds would meet the need.
2) During AKM, the ANN precision is set to 0.70 for speed consideration. One can try if a higher precision would lead to a finer codebook, at the cost of slow AKM.
3) If you cannot download the code from google drive, here is an alternative link.
2. Quantization code
Again, the FLANN library is used in feature quantization. The code is much similar to codebook generation, except that the target precision should be higher (0.98 in the code).
Code in Google Drive is here, and in Baidu Pan is here.
3. Hamming Embedding code (Bug fixed on 01/31/2015. Thank you, Kelvin, Zhun, and Yanzhang!)
We implement the Hamming Embedding (HE) [2] algorithm. Two steps are involved here.
1) Threshold training on Flickr60k data.
2) Generation of 128-bit binary signatures given SIFT features in an image.
Code in Google Drive is here, and in Baidu Pan is here.
4. Search with BoW and HE code
We provide the code using both the BoW baseline and HE on Holidays dataset. The parameter settings are: codebook size = 20k, HE code length = 128 bits, HE parameters are 52 and 26, respectively, MA = 3. We also apply rootSIFT [3], burstiness weighting [5], avgIDF [4] to improve performance.
Results: for BoW, mAP = 49.67%; for HE, mAP = 81.75%.
Note: the SIFT descriptors are downloaded from the Holidays webpage.
Code in Google Drive is here, and in Baidu Pan is here.
5. Search with HSV global feature code
As stated in our CVPR'14 paper, in addition to the BoW representation, we use a 1000-dim rootHSV histogram as global feature, and perform global image search on Ukbench as an example. The code in Google Drive is here, and in Baidu Pan is here.
If you have any problem with the code or have any suggestion, please email me at<EMAIL_ADDRESS>References
[1] J. Philbin, O. Chum, M. Isard, J. Sivic, and A. Zisserman, "Object Retrieval with Large Vocabularies and Fast Spatial Matching", In: CVPR, 2007.
[2] H. Jegou, M. Douze, and C. Schmid, "Hamming Embedding and Weak Geometric Consistency for Large Scale Image Search", In: ECCV, 2008.
[3] A. Relja and A. Zisserman, "Three Things Everyone Should Know to Improve Object Retrieval", In: CVPR, 2012.
[4] L. Zheng, S. Wang, Z. Liu, and Q. Tian, "Lp-norm IDF for Large Scale Image Search", In: CVPR, 2013.
[5] H. Jegou, M. Douze, and C. Schmid, "On the Burstiness of Visual Elements", In: CVPR, 2009.
[6] G. Tolias, Y. Avrithis, and H. Jegou, "To Aggregate or not to Aggregate: Selective Match Kernels for Image Seaerch", In: ICCV, 2013.
[7] Marius Muja and David G. Lowe, "Scalable Nearest Neighbor Algorithms for High Dimensional Data", Pattern Analysis and Machine Intelligence (PAMI), Vol. 36, 2014.