| 1958 | July | National Aeronautics and Space Act
signed into law establishing NASA.
|
| | October | Mercury program begun; six successful
manned flights would occur.
|
| | November | Space Task Group officially organized,
at Langley Field, Va., to
implement the manned satellite project, known later as Project Mercury.
|
| |
|
| 1959 | April | First group of astronauts is selected for
manned spaceflight program.
|
| | December | Saturn configuration and development program are approved.
|
| |
|
| 1960 | February | Ranger project for lunar hard landings is formally authorized.
|
| | May | Lunar soft-landing program, later renamed Surveyor, commences.
|
| | July | Apollo approved as name of advanced manned spaceflight program.
|
| |
|
| 1961 | May | First U.S. suborbital manned spaceflight,
by Astronaut Alan B. Shepard, Jr., in a Redstone rocket-boosted
Mercury capsule named Freedom 7.
|
| | May | President Kennedy proposes broad,
accelerated space program, including manned lunar landing
within the decade, in a special message to the Congress.
|
| | August | Cape Canaveral selected as the launch
site for manned lunar fights.
|
| | November | The Space Task Group redesignated
as the Manned Spacecraft Center.
|
| |
|
| 1962 | February | First U.S. orbital manned spaceflight
by Astronaut John H. Glenn, Jr., in an Atlas-boosted Mercury
capsule named Friendship 7.
|
| | July | Selection of lunar orbit rendezvous
flight mode for Apollo missions.
|
| |
|
| 1963 | May | First U.S. long duration spaceflight,
by Astronaut L. Gordon Cooper, Jr., aboard an Atlas-boosted
Mercury, Faith 7; last flight in the Mercury program.
|
| | August | Lunar orbiter program, to team with
Ranger and Surveyor, approved.
|
| |
|
| 1964 | May | First flight of an Apollo-configured spacecraft
with a Saturn vehicle (two-stage Saturn I), launched from Cape Kennedy;
craft, upper stage orbited.
|
| | July | Closeup television pictures of lunar surface
are sent by Ranger VII.
|
| |
|
| 1965 | March | First U.S. two-man orbital spaceflight,
by Astronauts Virgil I. Grissom
and John W. Young in Titan II-boosted Gemini III.
|
| | June | First U.S. extravehicular activity,
Astronaut Edward H. White II maneuvering from Gemini IV
piloted by Astronaut James A. McDivitt.
|
| | December | First Piloted rendezvous in space,
by Astronauts Schirra and Stafford
in Gemini VI with Gemini VII, Astronauts Borman and Lovell aboard.
|
| |
|
| 1966 | February | First launch of the Saturn IB (two stage)
with an Apollo spacecraft.
|
| | March | First docking in space, made by Astronauts
Neil A. Armstrong and David R. Scott aboord a Titan-boosted Gemini VIII.
|
| | June | Successful on first attempt, Surveyor I
softlands on the lunar surface and reports back on soil bearing
strength and surface temperatures.
|
| | August | First U.S. spacecraft to orbit the Moon,
Lunar Orbiter I sends back Surveyor and Apollo landing site photos.
|
| |
|
| 1967 | January | Flash fire kills Apollo 1 Astronauts
Grissom, White, and Chaffee in command module atop a Saturn I
booster at Launch Complex 34.
|
| | November | First flight of the Saturn V is a
success; Apollo 4 placed in orbit.
|
| |
|
| 1968 | January | First flight test of the lunar module,
in Earth orbit, in Apollo 5.
|
| | October | First manned Apollo flight,
by Astronauts Schirra, Eisele, and Cunningham, in the Saturn IB-boosted Apollo 7.
|
| | December | Astronauts Borman, Lovell, and
Anders become first men to orbit
the Moon, in the Saturn V-boosted CSM of Apollo 8.
|
| |
|
| 1969 | March | First manned flight of the lunar
module, in Earth orbit, by Astronauts
McDivitt and Schweickart with Astronaut Scott
piloting CSM, in Apollo 9.
|
| | May | First lunar module orbit of
the Moon, by Astronauts Stafford and Cernan with
Astronaut Young manning the orbiting command module, in Apollo 10.
|
| | July | Astronauts Armstrong and Aldrin become
first men to land on the Moon; Astronaut Collins pilots the
command module orbiting the Moon, in Apollo 11.
|
| | November | Astronauts Conrad and Bean
walk on the Moon, while Astronaut
Gordon pilots command module, in Apollo 12.
|
| |
|
| 1970 | April | Ruptured oxygen tank aborts Apollo
13 mission. Astronauts Lovell, Swigert, and Haise return
safely to Earth.
|
| |
|
| 1971 | January | Third successful manned lunar
landing, Apollo 14, places Astronauts Shepard and Mitchell
on Moon, while Astronaut Roosa pilots CSM.
|
| | July | Lunar Roving Vehicle used for first
time on Moon, by Astronauts Scott and Irwin, while Astronaut
Worden pilots the command module, in Apollo 15.
|
| |
|
| 1972 | April | Fifth successful lunar landing mission
places Astronauts Young and Duke on Moon, while Astronaut
Mattingly pilots command module, in Apollo 16.
|
| | December | Apollo program's longest
mission, Apollo 17. Astronauts Cernan
and Schmitt land on the Moon while Astronaut Evans pilots CSM.
|


Put in Chat at end of 1m count down!
(i.e. My scared is scared of...)
the Scared is scared from Bianca Giaever on Vimeo.
Card will have, on one side, what we're scared of, and on the other side, what our scared is scared of.
Put in chat and we'll press enter at same time
put a few words in a chat and we'll press enter at the same time
In case you want to record more than one story
Fork your old card and make a new one that matches your story!
Putting audio into imovie and adding visuals
If you want to use keynote...
Raam's Video
#2 seeing the unseen iMovie — adding images, ken burns, filters from Molly Josephs on Vimeo.
#3 seeing the unseen — imovie: adding gif, filters, time from Molly Josephs on Vimeo.
Working on/Finishing videos
Favorite thing you ate last week/weekend
Example of making something great with what you've got!
Amora's family curse
Put in chat what you're working on now and how much time you need to have a FIRST DRAFT
Breakout Rooms
Prep: First Draft Film Festival
Share 1 thing that works and idea for 1 thing that maybe could change and make it better
Harry Potter
Even if you think you're done. 2nd drafts will be better.
Even if you think you're done. 2nd drafts will be better.
Once you've received and incorporated feedback...
Either...
Continue watch films & new project
Share 1 thing that works and idea for 1 thing that maybe could change and make it better
can be funny, touching, etc.
it's nice to say nice things when it's not so serious
Using Codepen for your letter
Using Codepen for your letter


|
Launch Delphi-example |
Launch CBuilder-example
Note! This example demonstrates features of the Object Versioning
Extension. This is an extension product to $(PRODUCT_BASE_NAME). A
license key for the extension is required to try the example. Use the License Manager to request
an evaluation key.
The example implements a small document-versioning system, where users are only allowed to see the published
version of other users' documents.
How to run
Users in this example application are only allowed to see the published
version of other users' documents. Observe that you can only publish saved
documents.
- Create a user and select it as the current user in the combobox.
Create a project and add a document to it. Add a part to the document
with header and text.
- Without doing anything else create a new user and select it as the
current user. You will only see the project you created for the first
user, no document. That is because you haven't published that document
and as long as it isn't published only the user that created the
document will see it.
- Now update the database and select your first user as current user.
Change the text you entered for the part you added to the document. When
you've done that click the button View history. You will see the first
version of your document, the version you saved to the database before
updating the text in the part. Publish that version.
- Now select your second person as current person. The version of the
document you just published will now be visible for this person as well.
Choose View current and the published part will be seen. Observe the
text of the part.
Use of object versioning
Classes becomes versioned by setting the tagged value Versioned to
<<True<<
either in the model editor or in the Rose model.
- In the Rose model open the class you want to version and set the
Versioned attribute to <<True<<
under the Bold tab.
- In the model editor select the class you want to version
and either press <ctrl>T or choose the Edit tagged values option under
the Tools menu. In the form that opens select the
Versioned attribute under
the Bold tab and set it to <<True<< .
It is also necessary for the flag UseTimestamp
to be set to <<True<< for versioning to work.
This can be done either on the Bold tab in Rose, under Tools | Model
Properties | Edit, or in the Model Editor.
The classes TBoldObject , TBoldObjectLocator ,
and TBoldMember all have a method AtTime .
This will return the same object, locator or member at the time specified by
the Time argument.
Note that the class lists are subclasses of TBoldMember ,
and thus it is possible to get the list of which instances existed at a
previous point in time by using the AtTime
method.
Points of interest in this example
- The Document and DocumentPart classes are versioned.
- The use of derived attributes and associations to create different views for different
users. See
Document.ViewVersion , Document.LastPublished and Project.ViewContains .
- The code for retrieving the history of documents, and their parts, is located in
the derived handles
bdhDocVersions and bdhPartVersions .
See also
Note! Please make sure to use the "Create DB & Alias"
button before attempting to open the system for the first time. Once the database and
alias is established you only have to use the "Open system" button when running
the example program.
|


FEMALE
MALE
Designer
Lawyer
Musicians & Singers
Athletes
Physicians & Surgeons
Financial Analysts
Aircraft Pilots
Nurse
Social Workers


This is a Node & Angular single page app that calculates the mean, median, and mode based off of user input.
Mean: {{mmm.mean}}
Median: {{mmm.median}}
Mode: {{mmm.mode}}


Keybindings: R - run, S - sneak, C - close door, I - inventory, E - equipment, G or comma - pick up item, A - skills. Use numpad to move the player.
The game might not work on Firefox due to Javascript recursion limit. It should work on Chrome and Internet Explorer 11.


Stage 0. canBeUpdated( value )
End update pipeline definitions.
Stage 3. Handle attribute change
Stage 1. Transform stage
Generated using TypeDoc


Executed Queries
Network Connections
Top SQL
Query
Time (ms)
URL
Username
Status
Delay
Host
Port
Status
Delay
Settings
Keep the fault tolerance settings after server restart
SQL
Count
Mean
Reset gathered queries


Preparation time
30 mins to 1 hour
Cooking time
1 to 2 hours
Serves
Serves 12
Dietary
The prunes in this easy Christmas cake ensure that it is dark, moist and squidgy - but what makes it really special is the chocolate.
Preheat the oven to 150C/300F/Gas mark 2.
Line the sides and bottom of a 20cm/8in, 9cm/3½in deep, round loose-bottomed cake tin with a layer of bake-o-glide or other reusable silicon-baking parchment. When lining the tin with the bake-o-glide, cut the material into strips that are twice as high as the tin itself (it’s easier to use two shorter strips of bake-o-glide, than one long strip); the height of the strips protects the cake from catching on the outside of the cake tin.
Place the fruit, butter, sugar, honey, coffee liqueur, orange juice and zest, mixed spice and cocoa into a large wide saucepan. Heat the mixture until it reaches a gentle boil, stirring the mixture as the butter melts. Let the mixture simmer for ten minutes. Then remove the saucepan from the heat and leave to stand for 30 minutes.
After 30 minutes, the mixture will have cooled a little. Add the eggs, flour, ground almonds, baking powder and bicarbonate soda, and mix well with a wooden spoon or spatula until the ingredients have combined.
Carefully pour the fruit cake mixture into the bake-o-glide lined cake tin. Transfer the cake tin to the oven and bake for 1¾-2 hours, or until the top of the cake is firm but will has a shiny and sticky look. At this point, if you insert a cake tester into the middle of the cake, the cake should still be a little uncooked in the middle.
Place the cake on a cooling rack. Once the cake has cooled, remove it from the tin.
To decorate, place the chocolate covered coffee beans in the centre of the cake and arrange the gold starts around the perimeter of the top of the cake. Then sprinkle some gold mini-balls over the whole of the cake. Sprinkle the Disco Gold Hologram Glitter over the top of the cake.


Hi, my name is Wyatt Ogden and I'm from South Jordan, Utah. I'm a student at Neumont College studying web development and design. I first got interested in web development when my cousin introduced me to codecademy tutorials learning HTML and CSS over the summer.
I consider myself a pretty easy-going guy who loves to have a good time
doing what I love to do. Family is my rock in life
and I enjoy every second I get to be with them. I feel extremely grateful for the
family and friends I've been given. I look forward to see what my future holds, for now
I can plan
going forward.


| ChatGroup |
class ChatGroup : GroupBase
Table with chat feed and send button |
| ConnectStage |
class ConnectStage : StageBase
Stage with [ServersGroup] and [RoomsGroup] |
| ConnectionStatusMessageLabel |
class ConnectionStatusMessageLabel : GroupBase
Connection message label used in [ConnectStage] |
| GameButtonsGroup |
class GameButtonsGroup : GroupBase
Gameplay buttons used in [PlayGroup] |
| GameMessageLabel |
class GameMessageLabel : GroupBase
Label used for displaying gameplay messages in [GameStage] |
| GameStage |
class GameStage : StageBase
Stage with [PlayGroup] and [ScoresAndChatGroup] |
| GroupBase |
open class GroupBase : Group
Parent class for Scene2D group classes |
| PlayGroup |
class PlayGroup : GroupBase
Group with table picture, cards and gameplay buttons |
| PlayerNameLabel |
class PlayerNameLabel : Group
Label used for player names around the table picture |
| RoomsGroup |
class RoomsGroup : GroupBase
Table with new room input and existing rooms buttons |
| ScoresAndChatGroup |
class ScoresAndChatGroup : GroupBase |
| ScoresFooterGroup |
class ScoresFooterGroup : GroupBase
Table footer for [ScoresGroup] |
| ScoresGroup |
class ScoresGroup : GroupBase
Table with player scores |
| ScoresHeaderGroup |
class ScoresHeaderGroup : GroupBase
Table header for [ScoresGroup] |
| ServersGroup |
class ServersGroup : GroupBase
Table with nick and server inputs |
| SplashStage |
class SplashStage : StageBase
Stage with splash picture |
| StageBase |
open class StageBase : Stage
Parent class for Scene2D stage classes |


Eighth Week of RC
Day 4: Bash and Leetcode
April 11, 2019
Today at post-lunch prep (PLP) we did a problem in bash, which was a PLP first for me. The problem, 193. Valid Phone Numbers, asked us to write a single-line bash expression to find valid phone numbers. My pair and I started by using a few helpful websites, namely, www.regexr.com, www.rubular.com, and ye olde www.stackoverflow.com, to devise a regular expression that would match valid phone numbers. See below for our solution.
while read -r line; do if [[ $line =~ ^(\([0-9]{3}\) |[0-9]{3}-)[0-9]{3}-[0-9]{4}$ ]]; then echo $line; fi; done < file.txt;
Disclaimer: Another Recurser came up with a faster solution by using grep instead of a while loop. According to their explanation, grep is more efficient than while loops for searching multiple lines in a file. Good to know!


Adding New Editor Configurations
How to create different configurations for the DotNetNuke.RadEditorProvider for registered users, Administrators and SuperUsers. These configurations can be applied to a single page on the current site, all pages of the current site, or all pages of all sites within this installation.
- Optional. To create a configuration that is unique to a single site, navigate to the required site.
- Navigate to Host > HTML Editor Manager.
- In the left hand navigation tree, select the configuration that you want to base this new configuration on. E.g. Everyone (as selected in the below image). This displays the Editor Configuration tab to the right.
- Click the Copy button.
- At Bind To Role, select the role for this configuration. Options include Everyone, Registered Users, Administrators, and Host Users. Registered Users is selected in the below image.
- Set the availability of this new configuration from these options:
- At Bind To Portal, to if this configuration is available to all pages of the current site only - OR - to associate this configuration with all sites within this installation.
- At Bind To Tab, select the single page that this configuration is associated with from the tree folder list of site pages. In the below image, the "About Us" page is selected.
- Click the Create button.
- The new configuration is now displayed in navigation tree to the right. E.g. Users (Page "About Us" only)
- Optional. Modify one or more settings to customize this configuration.
-
Click the Update button.


Coronavirus Tracker Application
Total cases reported as of today
Learn more
State
Country
changes per day
Reported cases to date
Not state


Learn HTML Together
For this project I made a web application that allows users to learn HTML together by using a build in text editor and chat.
RepositorieI design and build websites and other digital products.
// Scroll down.
For this project I made a web application that allows users to learn HTML together by using a build in text editor and chat.
RepositorieThe Sports Stimulation department in Southeast had the desire to bring all sports, from events to workshops, to the center of attention through an app
RepositorieThis app shows the rooms based on their occupation status, the amount of noise and the amount of light. Users have the ability to filter the rooms and show the room with the least noise or light based on the users needs.
Repositorieclass basPieren {
··constructor() {
···this.name = 'Bas Pieren'
···this.age = 23
···this.focus = ‘Creative Developer’
··}
··workExperience() {
···return {
····jun2016-jul2016: ‘Front-end Developer at Gemini Design’
···}
··}
··education() {
···return {
····2016-now: ‘HvA - Communication and Multimedia Design’,
····2012-2016: ‘MediaCollege Amsterdam - Interactief Vormgeven’,
····2009-2012: ‘Haarlem College - Grafimedia’
···}
··}
··skills() {
···return [‘HTML’, ‘CSS’, ‘JavaScript’, ‘Node.js’, ‘UI Design’]
··}
}
// Inspired by yasio.pl
Do you have a question? Wanna work together on a project? Lets talk!
Send an email


Home
Showcase
Studio
Start project
Showcase
Aluminium Frames
Read more
Aluminium Frames
0
Date
August 16, 2018
One Way Silver
Read more
One way silver
0
Date
August 16, 2018
Tinted Gray
Read more
Tinted Glass
0
Date
August 16, 2018
Clear Glass
Read more
Clear Glass
0
Date
August 16, 2018


ACL Anthology — Search Prototype
What is this?
Advanced options...
Year of publication
at least (≥)
at most (≤)
equals (=)
Search in PDF text only (via Google CSE)...
Show up to
20
50
100
results.
—
results in
—
ms
pdf
—
.
—
—
—
—
publication
s


James Charles launching YouTube beauty influencer competition with $50,000 prize
James Charles is launching his very own YouTube series, in a bid to find the next biggest make-up artist influencer – on what happens to be on-off pal Jeffree Star’s birthday…
The influencer will be laying down his skills, expertise and all the sass, to uncover the next big thing in the beauty world – who will take home a $50,000 (£38k) prize.
Think Project Runway meets America’s Next Top Model with a dash of beauty.
And we are living for it.
The 20-year-old’s four-part show will be coming to his YouTube channel next year, and he branded the new project a ‘dream come true’.
In a chat with Variety, James said: ‘Ever since I entered the beauty space three years ago, I’ve dreamed of producing my own beauty competition show.
‘It’s a dream come true… It’s such an amazing opportunity for [YouTube] to take it above and beyond what we expected.
‘The whole point is to pick a person I think will bring something positive to the community.
Advertisement Advertisement
‘It was important for me to make it really true to how the beauty influencer community works.’
Aspiring contestants will have to apply through his website, with a YouTube link to a clip showing off their skills.
Six contestants will be chosen and flown to LA to compete for the money – with James joined by a string of famous faces on the judging panel.
But, before you start preparing your make-up brushes, only US residents are able to compete.
Fans went wild over the news, flocking to Twitter to congratulate James on the new venture.
 You deserve this success, I’m so so excited for this,’ one commented.
‘Honestly this is such a good idea lol,’ another replied, while a Twitter user said: ‘Such an insanely incredible opportunity! i always hoped someone would create a show or series like this. How perfect!’
However, others were questioning why James decided to confirm his big news on Jeffree Star’s 34th birthday.
‘Do y’all know how p**sed I am James Charles chose @JeffreeStar birthday to f**king do a launch.
Advertisement Advertisement
‘Coincidence that @jamescharles dropped the news he’s going to host a makeup competition show on @JeffreeStar ’ birthday? No tea, no shade but *sips, *sips,’ a fan suggested.
While one added: ‘did you notice how he “announced” this on @JeffreeStar birthday?’
So. Much. Drama.
Got a showbiz story?
If you've got a story, video or pictures get in touch with the Metro.co.uk Entertainment team by emailing us<EMAIL_ADDRESS>calling 020 3615 2145 or by visiting our Submit Stuff page - we'd love to hear from you.


UKCloud Limited (“UKC”) and Virtual Infrastructure Group Limited (“VIG”) (together “the Companies”) – in Compulsory Liquidation
On 25 October 2022, the Companies were placed into Liquidation with the Official Receiver appointed as Liquidator and J Robinson and A M Hudson simultaneously appointed as Special Managers to manage the liquidation process on behalf of the Official Receiver.
Further information regarding the Liquidations can be found here: https://www.gov.uk/government/news/virtual-infrastructure-group-limited-and-ukcloud-limited-information-for-creditors-and-interested-parties
Contact details:
For any general queries relating to the Liquidations please email<EMAIL_ADDRESS>For customer related queries please email<EMAIL_ADDRESS>For supplier related queries please email<EMAIL_ADDRESS>Understanding connectivity options in UKCloud for VMware
Introduction
In UKCloud for VMware, UKCloud uses two different architecture designs. You can see this when you deploy virtual data centres (VDCs) onto our IaaS offering. Depending on the type of application you're running, you may see one or both types of network architecture when you deploy your solutions onto the UKCloud platform.
This document explains what the different architectures look like so you can design your solutions to make the best use of them.
Overview of UKCloud for VMware network architecture
Our UKCloud for VMware service uses multiple security domains (Assured, Elevated and the Cross Domain Security Zone), enabling you to provide a service over the internet, government community networks (such as HSCN, PSN or Janet) or your own HybridConnect lines.
Each of these networks brings its own challenges for network separation and prevention of accidental bridging. Our network architecture offers two different options to address these challenges. Your Cloud Architect will be able to advise you which solution works best for your application.
Network Firewall Tenant (NFT) - NFTs are either single- or multi-tenant instances on Network Firewalls (NFWs), depending on the network that the VDC is connected to. NFWs share an external network connectivity layer connected to the government community network. NFT architecture is used in regions 1, 2, 7 and 8.
Cloud Fabric and gateway - There are no NFTs on shared firewalls, instead we use a shared Cloud Fabric and the separation of connection types is done at the edge level. Cloud Fabric and gateway architecture is used in regions 5 and 6.
NFT network architecture
With our NFT network architecture, we use a slightly different design, depending on the network you are connecting to. If you've already used UKCloud IaaS then you'll probably already be familiar with the way the NFT architecture presents itself.
Single network architecture (internet)
All VDCs on the Assured security domain have outbound connectivity to the internet. When connecting a VDC to the internet (and no other network), we use the architecture shown the diagram below.
You can see that Customer 1 has two VDCs, each of which has its own edge connected to the same NFT. Customer 1 and Customer 2 have separate NFTs on the same multi‑tenant NFW, which is on the shared internet facing network.
From a customer management experience, you manage all your connectivity rules, such as firewall, IPsec VPN and NAT functionality, through your edge, using either the UKCloud Portal GUI or API.
We manage the NFW and provide additional controls around whitelisted ports, metering and packet shaping.
Multiple network architecture (PSN and HSCN)
If you want to add other networks to your VDC (for example, HSCN or PSN), you can enable these connections through the same edge as your internet connection. This is possible because the separation of connectivity happens at the NFT. The NFT resides on a single tenant NFW to comply with the security requirements of these networks.
In the diagram above, you can see that Customer 3 uses the same edge to connect to both the internet and HSCN through an NFT on a single tenant NFW. Customer 4 uses a similar architecture to connect to the internet and PSN.
Management-wise, you can see the external IP range on the edge. Typically, you use this range for internet connectivity. However, in the case of PSN and HSCN, we translate the address on the NFW before routing it to the edge. You won't see your PSN or HSCN address in your IP allocation, but your users will need to target the address to reach your service.
PSN
If you're adding PSN connectivity to a VDC, we translate each PSN IP address to one of your external IP allocations, consuming one of your internet IPs.
HSCN
If you're adding HSCN connectivity to a VDC, we translate the HSCN IP to one of the following:
One of your external IP allocations, consuming an internet IP.
A private address of your choice, bypassing the edge and enabling you to route the traffic directly to a virtual machine (VM) with the same private address. This retains your external IP allocation but limits the use of your HSCN IP address.
Multiple network architecture (Janet)
If you want to connect to the Janet network, the network architecture is slightly different to that of other government community networks.
As Janet is a new network in the UKCloud portfolio, we're able to leverage the changes to network connectivity in UKCloud for VMware. This means we can utilise the Cloud Fabric and Gateway model to present the Janet connection.
In the diagram above, you can see two edges on the VDC: one presents the internet connectivity, and the other presents the Janet connectivity. The Janet-facing edge connects into the Janet Cloud Fabric and then out to the Janet network via the UKCloud managed gateway.
The Janet facing edge has the same functionality as the internet facing edge and you can see your Janet IP address in the IP allocations on the edge. You manage the internet facing and Janet facing edges separately through the UKCloud Portal GUI or API.
Networking in the Elevated security domain
Networking in the Elevated security domain is very similar to the Assured security domain. All connectivity is routed through the same edge on the VDC, and separation of connections occurs within the NFT.
PSN
In the diagram above, Customer 1's PSN connection is routed to their NFT sitting in the multi-tenant NFW. This then provides the onward connection to Customer 1's edge. The same NFT also handles the connections in from Cross Domain Security Zone products (Walled Garden and SRA).
Note
UKCloud translates the PSN IP address to one of the external IP ranges that are available on the edge. Your users will target the PSN IP address, however you'll see only your UKCloud allocated external range on your edge, so it's important to know what your PSN IP has been translated to.
MCN
MCN is also available in the Elevated security domain, however it is not natively connected to the UKCloud platform. This means that, to facilitate a connection to MCN, you must go through the assurance process provided by the MOD to gain access to MCN; only then can we complete the connection between MCN and your VDC. The NFT for MCN sits in a single tenant NFW in line with MOD connection compliance.
Networking between VDCs
You have three options when networking between VDCs. Each option has a slightly different use case.
Option 1: Shared networks
Shared networks are useful when you have multiple VDCs within the same organisation boundary (sometimes referred to as a vOrg). You can create networks that span VDCs, enabling VMs within different VDCs to communicate with each other. This is particularly useful if you have VDCs with VMs that are operating at different service levels (ESSENTIAL, POWER and PRIORITY) and need to have inter-VM communication.
Option 2: IPsec VPN
If you need VDC communication between VDCs that reside either in different regions, vOrgs or even in external data centres, then you should use IPsec VPN tunnels. You can configure these on the edges of the VDCs that you are connecting. It's worth noting that you should configure the IPsec tunnels using your external IP address allocation, in both the Assured and Elevated security domains. In the Assured security domain, each IPsec tunnel consumes an external (internet) IP.
Option 3: Static routes
If the VDCs you're connecting reside on the same NFT, use static routes as an alternative to a shared network where you want more control of traffic between VMs. As traffic must traverse the edge, you can put in extra rules around connectivity to lock down communication between VMs in different VDCs. This enables you to construct DMZs or separate out services to different users while continuing to communicate between your VMs.
Bringing your own firewall
In most circumstances, the UKCloud provided edge will work for your solution. However, if your solution requires next generation firewall functionality, such as malware detection, antivirus protection, URL filtering or complex load balancing, you can provide your own firewall solution.
Important
If you choose to bring your own firewall, you're completely responsible for the deployment, configuration and management of that firewall.
If you plan to deploy a firewall into a new VDC, let us know and we'll provision you a VDC with a dedicated network for you to deploy your firewall onto.
If you change from a UKCloud‑provided firewall to your own firewall, we'll redeploy your firewall on to a dedicated network and you'll need to migrate your environment to that network.
IP address allocations
When you create a new vOrg, we'll provide you with a number of usable IP addresses per VDC, depending on the network you're connecting to:
Internet - 5 x usable IPs
HSCN - 1 x usable IP
PSN - 1 x usable IP
Janet - 1 x usable IP
You can request additional IP addresses, as required, by raising a Service Request via the My Calls section of the UKCloud Portal. If you ask for a large number of IP addresses in a single request, we may ask you to provide further information to support your request.
Cloud Fabric and gateway architecture
The Cloud Fabric architecture utilises multi-tenant networks connected to UKCloud-managed gateways that provide external network connectivity to internet and government networks. The customer-managed edges are connected to the multi-tenant network and enable you to control firewall settings such as NAT, VPN and load balancing. There are no NFTs in the Cloud Fabric architecture so all the firewall settings are controlled by the edge VM.
Single network architecture
The diagram below shows how VDCs connected to a single network look using our new Cloud Fabric and gateway architecture.
You can see that there is no NFT layer; instead each customer VDC has an edge that is connected directly into the multi‑tenant Cloud Fabric. This is then connected to a UKCloud‑managed gateway with onward connection to the internet.
From a customer management experience, you manage all your connectivity rules, such as firewall, IPsec VPN and NAT functionality, through your edge, using either the UKCloud Portal GUI or API.
UKCloud controls the gateway out to the internet and provides metering and packet shaping, however you're in full control of ports.
Multiple network architecture
Most differences between NFT and Cloud Fabric can be seen with multiple network architectures. To achieve network separation and ensure security and compliance with government community networks, we've developed a new VDC edge architecture.
In the diagram above, you can see that if you want to add other networks to your VDC (for example, HSCN, PSN or Janet), you need separate edges to facilitate that connection. These edges have the same style of connectivity as the internet facing edge: an edge that connects into a Cloud Fabric, dedicated to that particular network, which then has onward connectivity to the government community network through the UKCloud‑managed gateway.
Customer management is on a per-edge basis. You'll see multiple edges within your UKCloud Portal GUI and you'll need to manage these individually. The full functionality of each edge is available for every network connectivity, however UKCloud manages the port whitelist for all government connected networks.
Network architecture for the Elevated security domain
Networking in the Elevated security domain is the same as the Assured security domain from a management perspective. Just like the Assured security domain, there is edge separation for the different networks that feed into the Elevated security domain.
As the diagram above shows, the edge is connected to a Cloud Fabric with onward connectivity to the PSN. There is also an internal Cloud Fabric that connects the Elevated VDC to the Walled Garden, enabling cross-security domain communication.
Networking between VDCs
You have two options for communicating between VDCs. Both these options will be familiar if you already use our platform, but if you're used to using static routes, you'll need to use one of the two options below instead for all inter-VDC communication.
Option 1: Shared networks
Shared networks are useful when you have multiple VDCs within the same vOrg and region. You can create networks that span between VDCs, enabling VMs within different VDCs to communicate. This is particularly useful if you have VDCs with VMs that are operating at different service levels (ESSENTIAL, POWER and PRIORITY) and need to have inter-VM communication.
Option 2: IPsec VPN
If you need VDC communication between VDCs that reside either in different regions, vOrgs or even in external data centres, then you should use IPsec VPN tunnels. You can configure these on the edges of the VDCs that you are connecting. It's worth noting that you should configure the IPsec tunnels using your external IP address allocation, in both the Assured and Elevated security domains. In the Assured security domain, each IPsec tunnel consumes an external (internet) IP.
In the Elevated security domain each IPsec tunnel consumes either:
An external (UKCloud) IP, if the tunnel is configured between VDCs
An external (PSN) IP, if the tunnel is configured between a VDC and an endpoint on the PSN network
Bringing your own firewall
In most circumstances, the UKCloud‑provided edge will work for your solution. However, if your solution requires next generation firewall functionality, such as malware detection, antivirus protection, URL filtering or complex load balancing, you can provide your own firewall solution.
Important
If you choose to bring your own firewall, you're completely responsible for the deployment, configuration and management of that firewall.
If you plan to deploy a firewall into a new VDC, let us know and we'll provision you a VDC with a dedicated network for you to deploy your firewall onto.
If you change from a UKCloud‑provided firewall to your own firewall, we'll redeploy your firewall on to a dedicated network and you'll need to migrate your environment to that network.
IP address allocation
The number of public IP addresses we provide depends on whether you are using a UKCloud‑provided firewall or bringing your own:
UKCloud provided firewall - If you're using a UKCloud‑provided firewall, we'll allocate you a single usable IP per VDC edge. You can request additional IP addresses as required by raising a Service Request via the My Calls section of the UKCloud Portal. If you ask for a large number of IP addresses in a single request, we may ask you to provide further information to support your request.
BYOF - If you're using your own firewall technology, when you provision your VDC, we initially allocate you five public IP addresses. After this initial allocation, you can request more IP addresses by opening a Service Request via the My Calls section of the UKCloud Portal.
Maintaining compliance with multiple networks
When connecting to the different UKCloud networks it's important to ensure that you uphold network connection compliance. To this end, the way you access the different government community networks has not changed in UKCloud for VMware.
In the Assured security domain, you'll always have an internet connected edge. Access to other networks is as follows:
For HSCN you'll need to sign up to the terms of the HSCN Connection Agreement
For PSN you'll need to get accreditation for the service you want to provide from the PSN Authority
For Janet you'll need to engage with your Cloud Architect
In the Elevated security domain:
For PSN you'll need to gain approval from the PSN Authority
For MCN you'll need to get approval from the MOD
For Cross Domain Security Zone services (Walled Garden or SRA) you'll need to get the authorisation from your end-customer IA as well as the UKCloud SIRO
The application processes haven't changed for any of these services, however it's important to be mindful about how you may have to design your architecture based on the network architecture you'll be deployed on. As an example, when connecting to HSCN, you'll need to ensure that the HSCN and internet networks aren't bridged. With the Cloud Fabric architecture and NFT architecture (shown in the two diagrams below respectively), you should ensure that VMs are not connected to both the internet and to HSCN at the same time.
Feedback
If you find a problem with this article, click Improve this Doc to make the change yourself or raise an issue in GitHub. If you have an idea for how we could improve any of our services, send an email to feedback@ukcloud.com.


I'm giving thoughts on the viability of MySQL plugins. This is due to a particular experience I've had, which is thankfully solved. However, it left some bitter taste in my mouth.
MySQL plugins are a tricky business. To create a plugin, you must compile it against the MySQL version you wish the users to use it with. Theoretically, you should compile it against any existing MySQL version, minors as well (I'm not sure whether it may sometimes or most times work across minor versions).
But, most important, you must adapt your plugin to major versions.
Another option for plugin makers, is to actually not recompile it, but rather provide with the source code, and let the end user compile it with her own MySQL version. But here, too, the code must be compatible with whatever changes the new MySQL version may have.
And if it doesn't compile with the new MySQL version?
That's what happened to me. The particular case at hand was SphinxSE, a plugin which serves as a bridge between MySQL and a Sphinx Search server. I've been using it for years and was happy about it. But, as it happened, it took well over a year for sphinx to compile with MySQL 5,5. This meant I was unable to upgrade my 5.1 installation to 5.5, a thing I was aiming to do for quite a while.
Even when fixed, not all features were included, and thankfully I was able to come up with my own patch.
Not complaining about this particular project -- I think Sphinx is awesome, with latest versions providing great features I'm putting into immediate use.
However, how much am I willing to rely on 3rd party projects when planning my MySQL upgrades? I'm now thinking I shouldn't.
A central repository?
MariaDB does a great thing: it provides with several additional features over standard MySQL, including a set of plugins. They turn into a debian-like repository, in which they maintain the plugins for their own distribution.
[Darn! I just realized I should have looked at what they did with Sphinx in their 5.5 distribution! Need to do my monthly mental examination.]
Anyway, this is something I would like to see outside MariaDB as well: a central repository where plugins are maintained and kept up to the latest releases.
Thoughts, anyone?
comments powered by Disqus


If you want it,
Android
powers it.
A fullscreen 5.6” or 6” display. Up to 30 hours of battery life1. And a camera that does the work for you — with Night Sight, Portrait Mode, and built-in Depth Editor.
The world’s
first 5G
phones.
Download a 4K movie in the blink of an eye. Jump on a group video call that never lags. Turn your living room into an AR zombie apocalypse. 5G is taking phones to the next level — and they’re only built on Android.
Cameras that catch any shot.
Android powers some of the world’s top cameras. So when the action speeds up or the lights go down low, you
always get that perfect shot.
Sometimes you need a bigger screen.
Watch a show the way it was intended. Edit a photo all the way down to the pixels. With Android tablets, you
get more screen to do your thing.
Put Android to work.
Use the work profile to keep your personal data separate. Turn off work apps when you want to disconnect. And with the Android Enterprise Recommended program, it's easy to find the right devices for your job. From construction sites to corporate offices.
Secure, up-to-date, and easy to use.
Android One phones are certified to run the simplest, latest version of Android. Regular security updates every month. At least two years of OS upgrades.2 And only loaded with the most essential apps.
Less RAM.
Still loaded
with power.
Get the best of Android on lower RAM devices.  Data Saver helps you manage your data. And the Play Store continually gets new apps made just for Android (Go edition).
Learn more


For the year Christmas of 2015, I wanted to create a Geek Christmas Card with a retro style. I used java to type, randomly, four different small ASCII Christmas drawings.
Once download the content of the repository, run the BAT file in Windows or the bash file in GNU/Linux.
The following video shows one of the result (Windows):
Go to repository


QColormap Class
The QColormap class maps device independent QColors to device dependent pixel values. More...
| Header: | #include <QColormap> |
| qmake: | QT += widgets |
Public Types
| enum | Mode { Direct, Indexed, Gray } |
Public Functions
| QColormap(const QColormap &colormap) | |
| ~QColormap() | |
| const QColor | colorAt(uint pixel) const |
| const QVector<QColor> | colormap() const |
| int | depth() const |
| Mode | mode() const |
| uint | pixel(const QColor &color) const |
| int | size() const |
| QColormap & | operator=(const QColormap &colormap) |
Static Public Members
| QColormap | instance(int screen = -1) |
Detailed Description
The QColormap class maps device independent QColors to device dependent pixel values.
Member Type Documentation
enum QColormap::Mode
This enum describes how QColormap maps device independent RGB values to device dependent pixel values.
| Constant | Value | Description |
|---|---|---|
QColormap::Direct | 0 | Pixel values are derived directly from the RGB values, also known as "True Color." |
QColormap::Indexed | 1 | Pixel values represent indexes into a vector of available colors, i.e. QColormap uses the index of the color that most closely matches an RGB value. |
QColormap::Gray | 2 | Similar to Indexed , pixel values represent a vector of available gray tones. QColormap uses the index of the gray tone that most closely matches the computed gray tone of an RGB value. |
Member Function Documentation
QColormap::QColormap(const QColormap &colormap)
Constructs a copy of another colormap.
QColormap::~QColormap()
Destroys the colormap.
const QColor QColormap::colorAt(uint pixel) const
Returns a QColor for the pixel.
See also pixel().
const QVector<QColor> QColormap::colormap() const
Returns a vector of colors which represents the devices colormap for Indexed
and Gray
modes. This function returns an empty vector for Direct
mode.
See also size().
int QColormap::depth() const
Returns the depth of the device.
See also size().
[static]
QColormap QColormap::instance(int screen = -1)
Returns the colormap for the specified screen. If screen is -1, this function returns the colormap for the default screen.
Mode QColormap::mode() const
Returns the mode of this colormap.
See also QColormap::Mode.
uint QColormap::pixel(const QColor &color) const
Returns a device dependent pixel value for the color.
See also colorAt().
int QColormap::size() const
Returns the size of the colormap for Indexed
and Gray
modes; Returns -1 for Direct
mode.
See also colormap().
QColormap &QColormap::operator=(const QColormap &colormap)
Assigns the given colormap to this color map and returns a reference to this color map.
This function was introduced in Qt 4.2.


Suicidal
Destiny Blue
Hello, I'm suicidal.
The thin ice has cracked, and I've slipped through,
into freezing water. I'm drowning. Fighting for breath,
for hope.
For a future.
Trapped in a Void; an emptiness which envelops
everything, yet offers nothing. A absence with such
weight I can feel it's pressure on the backs of my
eyes, as it rips out my breath, starves me of hope,
and numbs all nurturing thoughts.


API - Order
list
Menu
home
Home
supervisor_account
Admin
shoppping_cart
Place order
settings
Settings
Name
Description
Image
Name
Quanitity
Retail Price
Offers:
Order


CSS styles for layout.
String, default = ''
If you load content into layout and want some css to only be applied when this content is loaded you can use css property.
This property can be defined during object creation:
Or any time after the layout has been created:


This is our project!
And this is a survey
First name
Last name
Email
Age
Would you recommend microverse to a friend?
Sure!
Maybe
Not at all
What is your favorite feature of freeCodeCamp?
Challenges
Projects
Community
Open Source
What would you like to see improved? (Check all that apply)
Front-end Projects
Back-end Projects
Data Visualization
Challenges
Open Source Community
Gitter help rooms
Videos
City Meetups
Wiki
Forum
Additional Courses
Any comments or suggestions?
Submit


Zelus
(current)
Link
Dropdown
Action
Another action
Something else here
Disabled
Search
Zelus
Show You the Beauty of Nature.
Previous
Next
Start
Pause
Feel the power of Nature
Polar light is the god's light
×
Watch the Polar light
Feel the power of nature.


The good:
Got to the lakes in the end!! Drove up Friday night but due to the consistent rain on the last part of the M6, I once again chickened out of wildcamping, instead taking the easier option of camping at the Castlerigg Hall campsite - one of my favourites.
Friday evening saw nothing of great interest though did get a new jacket and most interesting - the annoying OMM Chest Pouch - more of that later. Anyhow, a couple of drinks whilst studing the map provided the inspriation for Saturdays new route - an extended Newlands Valley horseshoe.
An early morning saw me leave the campsite by 08:00. I walked through Keswick from the campsite, then over the base of Catbells, through Little Town to finally reach the first mountain of the day - Robinson. At the summit, I turned left over Hinescarth Edge to Dale Head. Here, once again, I turned left to Maiden Moor.
[caption id=”” align=”alignright” width=”368” caption=”Tarn on Robinson”][/caption]
All in all, a great walk, and I had only a minor descent then climb to Catbells, and the stroll back to Keswick….
The bad:
Then it happened. strolling down Maiden Moor, on slightly rough ground I felt a sudden twinge in my right (bad) knee. Oh oh. Still, doesn’t hurt. I carried out, really carefully, but over the next 10 minutes, the pain started. Exactly the same pain (to a lesser degree) to my pre arthroscopy. I new I shouldn’t complete catbells, so got down to the lake side. Interestingly, I managed the 5 miles or so to Keswick with little discomfort.
Popped in to the Bank Tavern for a pint (for medicinal purposes) but it was too busy. I was shattered and the faff of standing having a cider was too much. Instead, I got a taxi back to the campsite, and tried their new restaurant - a nice garlic mushroom / lasagna washed down with some white wine. Nice.
The ugly:
Well, not actualy ugly, but the most memorable part of the walk, other than the knee, was the OMM Chest Pouch. I really like the idea of it - especially to store my Powershot G6, and some snacks. And for this, its size and shape are perfect. Using my beanie hat to wrap the camera seems to provide enough protection for simple walking. I would put the camera back in the main sack if I was on a proper scramble though.
What I disliked was the difficulty of getting the ruck sack on and off. Now, I haven’t read up about ways of using the pouch, so there might well be work arounds, but I found the easiest way to get the sack off and on was to slacken the shoulder straps to their loosest, then twist the rucksack so I am almost hugging it. From there, I can lift it over my head. Now, this is neither convenient, nor ergonomic. Lucky I had little weight in the sack. However, I did like the different storage options the pouch opens up. Especially when the clouds appeared - I could easily store my waterproof trousers in there to put on quickly if the rain did come. I think I could also get the Marmot Mica in as well, but its immediate access is of less importance when it takes 2 minutes to get the rucksack off!!!
Anyhows, I have uploaded some photos, and all that remains is for me to phone the physio and surgeon to see what I should do next with the knee…


Hello {{ name }}!
Hello rkusa!
{{ task }}
this
Works!
Works!
Works!
{{ task }}
this
that
{{ task.task }}
this
that
{{ task }}
this
that
{{ task }}


The easiest way to get to the venue is by renting a car as this would make it easier to get to the venue, as well as, visiting nearby cities and beaches.


This is a normal paragraph.
You can use the mark tag to highlight text.
This line of text is meant to be treated as deleted text.
This line of text is meant to be treated as an addition to the document.
This line of text is meant to be treated as fine print.
This line rendered as bold text.
This line rendered as italicized text.


| Path: | README |
| Last Update: | Wed Jan 25 08:59:19 CET 2006 |
Version: 0.1.5
Author: Henrik Mårtensson
© 2006 by Henrik Mårtensson
Test::Unit::XML extends the Test::Unit framework with an assertion for testing well-formed XML documents.
Using Test::Unit::XML is easy. All you have to do is to require testunitxml, and you will then have an assert_xml_equal assertion available in the Test::Unit::TestCase class.
In addition to the API documentation included in the package, you can get information about how to use Test::Unit::XML from the following sources:
The easiest way to install Test::Unit::XML is to make a remote installation via the RubyGem package manager:
gem install testunitxml
If you have downloaded a gem package from Rubyforge, you can do a local installation:
cd download_directory_path
gem install testunitxml -l
If you do not have RubyGem installed, you can download a Zip file or tarball and install from it instead:
| 1: | Unpack the Zip or tarball archive. |
| 2: | cd to the directory you just unpacked. |
| 3: | Run the command: ruby setup.rb install |
It is hard to define exactly what equal means in the context of XML documents. I have tried to follow W3C XML recommendations as far as possible. There are a few things worthy of note:
There are a few things in the pipeline:
I plan to implement these features as I need them in other projects, so there is no time plan, and no guarantee as to the order in which I’ll implement anything.
See the MIT-LICENSE file.
You can email bug reports, opinions and questions to<EMAIL_ADDRESS>You may also wish to visit my home page, www.henrikmartensson.org, for more information about Test::Unit::XML and other projects. I will write about Test::Unit::XML at the the Kallokain blog. You are welcome to visit, and comment.
If you find Test::Unit::XML useful, please do tell me about it. I would like to list projects that use it on the Test::Unit::XML web site.
If you find Test::Unit::XML lacking in some respect, or buggy, I am even more interested. I can’t fix bugs I do not know about.
Finally, if you write about Test::Unit::XML, I’d like to link to the article on my web site, or at least mention it if you write for a magazine, so please tell me.


Paste in Spatial Reference System Information in one of the following formats: ESRI WKT, GeoServer, GML, Mapfile, Mapnik, PostGIS, Proj4, Proj4js, or WKT
Here's an example of SRS Information:
https://epsg.io/3857
EPSG Code:
Found a Bug? Awesome! Please create an issue at
https://github.com/danieljdufour/get-epsg-code/issues
or email the project author at daniel.j.dufour@gmail.com


{% if object|can_write_foirequest:request and attachment.allow_link %}
{# Link to attachment when unapproved, but write allowed and cannot redact #}
{% include "foirequest/snippets/attachment_item.html" %}
{% else %}
{% comment %}
When unapproved and user can redact and can write, disallow direct access
and force to review.
{% endcomment %}
{{ attachment.name|truncatechars:20 }}{{ attachment.name }}
{{ attachment.size|filesizeformat }}
{% endif %}
{% if attachment.pending %}
{% blocktrans %}PDF Pending{% endblocktrans %}
{% endif %}
{% blocktrans %}Not public!{% endblocktrans %}
{% if attachment.is_mail_decoration and object|can_write_foirequest:request %}
{% endif %}
{% if not attachment.pending and attachment.can_approve and object|can_write_foirequest:request %}
{% endif %}


Home Page
Jeff Hammond, Computational Scientist<EMAIL_ADDRESS>My detailed CV is available as PDF.
Intel Labs
Parallel Computing Laboratory (May 2014 - present).
Title: Research Scientist
Supervisor: Drs. Tim Mattson and Pradeep Dubey
Argonne National Laboratory
Leadership Computing Facility (June 2011 - May 2014).
Title: Assistant Computational Scientist in the Performance Engineering group
Supervisors: Drs. Kalyan Kumaran and Ray Bair
The University of Chicago
Computation Institute (February 2011 - May 2014).
Title: Fellow (since September 2011)
Argonne National Laboratory
Leadership Computing Facility (June 2009 - May 2011).
Title: Argonne Scholar (Director’s Postdoctoral Fellowship)
Supervisor: Dr. Ray Bair
Pacific Northwest National Laboratory
EMSL MSCF (June 2006 - May 2009).
Title: Alternate Sponsored Fellow (DOE-CSGF practicum)
Supervisors: Drs. Karol Kowalski and Wibe A. de Jong
University of Chicago
Dept. of Chemistry (September 2003 to May 2009).
PhD in Chemistry, May 2009; MS in Chemistry, August 2004.
Supervisors: Professors Karl F. Freed and L. Ridgway Scott
University of Washington
Dept. of Chemistry (January 2001 to August 2003).
BS in Chemistry with Distinction; BA in Mathematics; Minor in Applied Mathematics.
Supervisor: Professor Weston T. Borden
Specific software packages that these papers have involved are denoted by Software Name in front of the citation.
Note that my contribution to these packages varies from "nearly everything" to "student did all the work" to "literally nothing". In most cases, the relevant version control system will give you all the details, if you're interested.
Venkatram Vishwanath, Thomas Uram, Lisa Childers, Hal Finkel, Jeff Hammond, Kalyan Kumaran, Paul Messina and Michael E. Papka. DOE ASCR Workshop on Software Productivity for eXtreme-Scale Science (SWP4XS), Rockville, Maryland, January 13-14, 2014. Toward improved scientific software productivity on leadership facilities: An Argonne Leadership Computing Facility View
Jeff R. Hammond. ACM XRDS 19 (3), Spring 2013. Challenges and methods in large-scale computational chemistry applications (invited and proof-read but not refereed in the traditional sense)
Bill Allcock, Anna Maria Bailey, Ray Bair, Charles Bacon, Ramesh Balakrishnan, Adam Bertsch, Barna Bihari, Brian Carnes, Dong Chen, George Chiu, Richard Coffey, Susan Coghlan, Paul Coteus, Kim Cupps, Erik W. Draeger, Thomas W. Fox, Larry Fried, Mark Gary, Jim Glosli, Thomas Gooding, John Gunnels, John Gyllenhaal, Jeff Hammond, Ruud Haring, Philip Heidelberger, Mark Hereld, Todd Inglett, K.H. Kim, Kalyan Kumaran, Steve Langer, Amith Mamidala, Rose McCallen, Paul Messina, Sam Miller, Art Mirin, Vitali Morozov, Fady Najjar, Mike Nelson, Albert Nichols, Martin Ohmacht, Michael E. Papka, Fabrizio Petrini, Terri Quinn, David Richards, Nichols A. Romero, Kyung Dong Ryu, Andy Schram, Rob Shearer, Tom Spelce, Becky Springmeyer, Fred Streitz, Bronis de Supinski, Pavlos Vranas, Bob Walkup, Amy Wang, Timothy Williams, and Robert Wisniewski. Blue Gene/Q: Sequoia and Mira in Contemporary High Performance Computing: From Petascale toward Exascale, edited by Jeffrey S. Vetter.
Jeff R. Hammond. IEEE-TCSC Blog, August 6th, 2012. Challenges for Interoperability of Runtime Systems in Scientific Applications (invited and proof-read but not refereed in the traditional sense)
CTF: Edgar Solomonik, Devin Matthews, Jeff Hammond, John Stanton and James Demmel. Journal of Parallel and Distributed Computing (2014). A massively parallel tensor contraction framework for coupled-cluster computations (Preprint) (Source Code)
BLIS: T. M. Smith, R. van de Geijn, M. Smelyanskiy, J. R. Hammond, and F. G. Van Zee. Proceedings of the 28th IEEE International Parallel and Distributed Processing Symposium (IPDPS). Phoenix, Arizona, May 2014. Anatomy of High-Performance Many-Threaded Matrix Multiplication (Preprint). Also known as FLAME Working Note #71. The University of Texas at Austin, Department of Computer Science. Technical Report TR-13-20. 2013. Opportunities for Parallelism in Matrix Multiplication (Home Page) (GitHub Source)
P. Ghosh, J. R. Hammond, S. Ghosh, and B. Chapman, 4th International Workshop on. Performance Modeling, Benchmarking and Simulation of High Performance Computer Systems (PMBS13). Workshop at SC13, Denver, Colorado, USA, November 2013. Performance analysis of the NWChem TCE for different communication patterns (Preprint)
TCE-IE: D. Ozog, J. R. Hammond, J. Dinan, P. Balaji, S. Shende and A. Malony. International Conference on Parallel Processing (ICPP). Ecole Normale Superieure de Lyon, Lyon, France, October 1-4, 2013. Inspector-Executor Load Balancing Algorithms for Block-Sparse Tensor Contractions (Preprint). (Related poster from ICS.)
CTF: Edgar Solomonik, Devin Matthews, Jeff Hammond and James Demmel. Proc. 27th Intl. Parallel and Distributed Processing Symp (IPDPS). Boston, Massachusetts, May 2013. Cyclops Tensor Framework: reducing communication and eliminating load imbalance in massively parallel contractions (Preprint) (Source Code)
CTF: Edgar Solomonik, Jeff Hammond and James Demmel. Electrical Engineering and Computer Sciences, University of California at Berkeley, Technical Report No. UCB/EECS-2012-29, March 9, 2012. A preliminary analysis of Cyclops Tensor Framework.
Elemental: J. Poulson, B. Marker, J. R. Hammond, N. A. Romero, and R. van de Geijn. ACM Trans. Math. Software, 39 (2012). Elemental: A New Framework for Distributed Memory Dense Matrix Computations. (Preprint) (Source Code)
Karthikeyan Vaidyanathan, Dhiraj D. Kalamkar, Kiran Pamnany, Jeff R. Hammond, Pavan Balaji, Dipankar Das, Jongsoo Park, Balint Joo. The International Conference for High Performance Computing, Networking, Storage and Analytics (SC15). Austin, TX, November 15-20, 2015. Improving Concurrency and Asynchrony in Multithreaded MPI Applications Using Software Offloading
PRK: Rob Van der Wijngaart, Srinivas Sridharan, Abdullah Kayi, Gabriele Jost, Jeff Hammond, Tim Mattson, and Jacob Nelson. The 9th International Conference on Partitioned Global Address Space Programming Models (PGAS). September 17-18, 2015. Washington, D.C. Using the Parallel Research Kernels to study PGAS models (Slides) (Source Code)
Casper: Min Si, Antonio J. Peña, Jeff R. Hammond, Pavan Balaji, and Yutaka Ishikawa. IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid). May 4–7, 2015, Shenzhen, China. Scalable Computing Challenge Finalist. Scaling NWChem with Efficient and Portable Asynchronous Communication in MPI RMA (Preprint)
Casper: Min Si, Antonio J. Pena, Jeff Hammond, Pavan Balaji, Masamichi Takagi, Yutaka Ishikawa. Proc. 29th Intl. Parallel and Distributed Processing Symp (IPDPS). Hyderabad, India, May 2015. Casper: An Asynchronous Progress Model for MPI RMA on Many-Core Architectures. (Preprint) (Source Code)
Jeff Hammond. OpenSHMEM User Group (OUG2014), October 7, 2014, Eugene, OR. Towards a matrix-oriented strided interface in OpenSHMEM. (Source Code)
BigMPI: Jeff R. Hammond, Andreas Schaefer, and Rob Latham. Workshop on Exascale MPI at Supercomputing Conference 2014 (ExaMPI14), New Orleans, LA, November 17, 2014. To INT_MAX... and beyond! Exploring large-count support in MPI (Preprint 1) (Preprint 2) (Source Code)
David Ozog, Allen Malony, Jeff Hammond and Pavan Balaji. 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS). Hsinchu, Taiwan, December 16 – 19, 2014. WorkQ: A Many-Core Producer/Consumer Execution Model Applied to PGAS Computations (Preprint 1) (Preprint 2).
OSHMPI: J. R. Hammond, S. Ghosh, and B. M. Chapman, accepted to First OpenSHMEM Workshop: Experiences, Implementations and Tools. Implementing OpenSHMEM using MPI-3 one-sided communication (Online) (Preprint) (Source Code)
V. Morozov, J. Meng, V. Vishwanath, J. R. Hammond, K. Kumaran and M. Papka. Parallel Processing Workshops (ICPPW), 41st International Conference, September 2012, Pittsburgh, Pennsylvania ALCF MPI Benchmarks: Understanding Machine-Specific Communication Behavior (IEEE link) (Slides)
OSPRI: J. R. Hammond, J. Dinan, P. Balaji, I. Kabadshow, S. Potluri, and V. Tipparaju, The 6th Conference on Partitioned Global Address Space Programming Models (PGAS). Santa Barbara, CA, October 2012. OSPRI: An Optimized One-Sided Communication Runtime for Leadership-Class Machines (Preprint).
ARMCI-MPI: J. Dinan, P. Balaji, J. R. Hammond, S. Krishnamoorthy, and V. Tipparaju, Proc. 26th Intl. Parallel and Distributed Processing Symp (IPDPS). Shanghai, China, May 2012. Supporting the Global Arrays PGAS Model Using MPI One-Sided Communication (Preprint) (Source Code)
J. Dinan, S. Krishnamoorthy, P. Balaji, J. R. Hammond, M. Krishnan, V. Tipparaju and A. Vishnu, in Recent Advances in the Message Passing Interface (Lecture Notes in Computer Science, Volume 6960/2011, pp. 282-291), edited by Y. Cotronis, A. Danalis, D. S. Nikolopoulos and J. Dongarra. Noncollective Communicator Creation in MPI (Preprint).
TAU-ARMCI: J. R. Hammond, S. Krishnamoorthy, S. Shende, N. A. Romero and A. D. Malony, Concurrency and Computation: Practice and Experience (DOI: 10.1002/cpe.1881). Performance Characterization of Global Address Space Applications: A Case Study with NWChem (Preprint)
MEMKIND: Christopher Cantalupo, Vishwanath Venkatesan, Jeff R. Hammond, and Simon Hammond. Submitted. User Extensible Heap Manager for Heterogeneous Memory Platforms and Mixed Memory Policies (Preprint) (Source)
GTFOCK: Edmond Chow, Xing Liu, Sanchit Misra, Marat Dukhan, Mikhail Smelyanskiy, Jeff R. Hammond, Yunfei Du, Xiang-Ke Liao and Pradeep Dubey. International Journal of High Performance Computing Applications, accepted. Scaling up Hartree–Fock Calculations on Tianhe-2 (Preprint)
GTFOCK: Edmond Chow, Xing Liu, Mikhail Smelyanskiy, and Jeff R. Hammond. J. Chem. Phys. 142, 104103 (2015). Parallel scalability of Hartree–Fock calculations (Preprint) (Source 1) (Source 2)
MADNESS: Robert J. Harrison, Gregory Beylkin, Florian A. Bischoff, Justus A. Calvin, George I. Fann, Jacob Fosso-Tande, Diego Galindo, Jeff R. Hammond, Rebecca Hartman-Baker, Judith C. Hill, Jun Jia, Jakob S. Kottmann, M-J. Yvonne Ou, Laura E. Ratcliff, Matthew G. Reuter, Adam C. Richie-Halford, Nichols A. Romero, Hideo Sekino, William A. Shelton, Bryan E. Sundahl, W. Scott Thornton, Edward F. Valeev, Álvaro Vázquez-Mayagoitia, Nicholas Vence, Yukina Yokoi. MADNESS: A Multiresolution, Adaptive Numerical Environment for Scientific Simulation
MADNESS: Álvaro Vázquez–Mayagoitia, W. Scott Thornton, Jeff R. Hammond, Robert J. Harrison. Annual Reports in Computational Chemistry 10, pp. 3–24 (2014). Quantum Chemistry Methods with Multiwavelet Bases on Massive Parallel Computers
Harvey: Amanda Peters Randles, Vivek Kale, Jeff Hammond, William D. Gropp and Efthimios Kaxiras. Proc. 27th Intl. Parallel and Distributed Processing Symp (IPDPS). Boston, Massachusetts, May 2013. Performance Analysis of the Lattice Boltzmann Model Beyond Navier-Stokes (Preprint)
GVR: A. Chien, P. Balaji, P. Beckman, N. Dun, A. Fang, H. Fujita, K. Iskra, Z. Rubenstein, Z. Zheng, R. Schreiber, J. Hammond, J. Dinan, I. Laguna, D. Richards, A. Dubey, B. van Straalen, M. Hoemmen, M. Heroux, K. Teranishi, A. R. Siegel. Submitted. 2015. Versioned Distributed Arrays for Resilience in Scientific Applications: Global View Resilience (Preprint)
Sean Hogan, Jeff R. Hammond and Andrew A. Chien. Fault-Tolerance at Extreme Scale (FTXS). Boston, MA. June, 2012. An Evaluation of Difference and Threshold Techniques for Efficient Checkpoints. (Preprint) (Slides)
LAMMPS: Rolf Isele-Holder, Wayne Mitchell, Jeff Hammond, Axel Kohlmeyer and Ahmed Ismail, J. Chem. Theory Comput. 9 (12), 5412-5420 (2013). Reconsidering Dispersion Potentials: Reduced Cutoffs in Mesh-Based Ewald Solvers Can Be Faster Than Truncation
LAMMPS-Ensembles: Luke Westby, Mladen Rasic, Adrian Lange and Jeff R. Hammond. See LAMMPS-Ensembles on my Wiki for more information.
NEUS: A. Dickson, M. Maienshein-Cline, A. Tovo-Dwyer, J. R. Hammond and A. R. Dinner, J. Chem. Theory Comput. 7, 2710 (2011). Flow-dependent unfolding and refolding of an RNA by nonequilibrium umbrella sampling. (Preprint)
Eugene has incorporated all of the GPU coupled-cluster codes into PSI4. See Github for details.
A. E. DePrince III, J. R. Hammond and S. K. Gray, Proceedings of SciDAC 2011, Denver, CO, July 10-14, 2011. Many-body quantum chemistry on graphics processing units.
A. E. DePrince III and J. R. Hammond, Symposium on Application Accelerators in High-Performance Computing (SAAHPC) Knoxville, TN, USA, 19-21 July 2011. Quantum chemical many-body theory on heterogeneous nodes. (Slides)
A. E. DePrince, III and J. R. Hammond J. Chem. Theory Comput. 7, 1287 (2011) Coupled Cluster Theory on Graphics Processing Units I. The Coupled Cluster Doubles Method.
A. E. DePrince III and J. R. Hammond, Symposium on Application Accelerators in High-Performance Computing (SAAHPC), Knoxville, TN, USA, 13-15 July 2011. Evaluating one-sided programming models for GPU cluster computations.
NWChem-MIC: Edoardo Apra, Karol Kowalski, Jeff R. Hammond, and Michael Klemm. NWChem: Quantum Chemistry Simulations at Scale in High Performance Parallelism Pearls, edited by James Reinders and James Jeffers (Morgan Kaufmann, 3 Nov. 2014). (Safari Books Online) (Google Books Online) (Summary at TechEnablement)
NWChem-MIC: Jeff Hammond, Priyanka Ghosh, David Ozog, Cyrus Karshenas, and Karol Kowalski. work in progress (I gave a talk on the preliminary results at SIAM CSE13.)
NWChem 101 - incomplete version of what I hope will be a crash course in how to use NWChem like an expert. Obviously, this is not a refereed publication.
NWChem: Coupled-cluster response theory: parallel algorithms and novel applications (my dissertation).
NWChem: K. Kowalski, J. R. Hammond, W. A. de Jong, P.-D. Fan, M. Valiev, D. Wang and N. Govind, in Computational Methods for Large Systems: Electronic Structure Approaches for Biotechnology and Nanotechnology, edited by J. R. Reimers (Wiley, March 2011, Hoboken). Coupled-Cluster Calculations for Large Molecular and Extended Systems
NWChem: K. Kowalski, S. Krishnamoorthy, O. Villa, J. R. Hammond, and N. Govind, J. Chem. Phys. 132, 154103 (2010). Active-space completely-renormalized equation-of-motion coupled-cluster formalism: Excited-state studies of green fluorescent protein, free-base porphyrin, and oligoporphyrin dimer
NWChem: J. R. Hammond, N. Govind, K. Kowalski, J. Autschbach and S. S. Xantheas, J. Chem. Phys. 131, 214103 (2009). Accurate dipole polarizabilities for water clusters N=2-12 at the coupled-cluster level of theory and benchmarking of various density functionals
NWChem: J. R. Hammond and K. Kowalski, J. Chem. Phys. 130, 194108 (2008). Parallel computation of coupled-cluster hyperpolarizabilities
NWChem: K. Kowalski, J. R. Hammond, W. A. de Jong and A. J. Sadlej, J. Chem. Phys. 129, 226101 (2008). Coupled cluster calculations for static and dynamic polarizabilities of C60
NWChem: J. R. Hammond, W. A. de Jong and K. Kowalski, J. Chem. Phys. 128, 224102 (2008). Coupled cluster dynamic polarizabilities including triple excitations
NWChem: K. Kowalski, J. R. Hammond and W. A. de Jong, J. Chem. Phys. 127, 164105 (2007). Linear response coupled cluster singles and doubles approach with modified spectral resolution of the similarity transformed Hamiltonian
NWChem: J. R. Hammond, K. Kowalski and W. A. de Jong, J. Chem. Phys. 127, 144105 (2007). Dynamic polarizabilities of polyaromatic hydrocarbons using coupled-cluster linear response theory
NWChem: J. R. Hammond, M. Valiev, W. A. de Jong and K. Kowalski, J. Phys. Chem. A 111, 5492 (2007). Calculations of properties using a hybrid coupled-cluster and molecular mechanics approach
Sameer Varma, Mohsen Botlani, Jeff R. Hammond, H. Larry Scott, Joseph P.R.O. Orgel, Jay D. Schieber, Proteins: Structure, Function, and Bioinformatics (2015). Effect of Intrinsic and Extrinsic Factors on the Simulated D-band Length of Type I Collagen
R. S. Assary, P. C. Redfern, J. R. Hammond, J. Greeley and L. A. Curtiss, Chem. Phys. Lett., 497 (1-3), 123 (2010). Predicted Thermochemistry for Chemical Conversion of 5-Hydroxymethyl Furfural
R. S. Assary, P. C. Redfern, J. R. Hammond, J. Greeley and L. A. Curtiss, J. Phys. Chem. B, 114, 9002 (2010). Computational Studies of the Thermochemistry for Conversion of Glucose to Levulinic Acid
R. K. Chaudhuri, J. R. Hammond, K. F. Freed, S. Chattopadhyay and U. S. Mahapatra, J. Chem. Phys. 129, 064101 (2008). Reappraisal of cis effect in 1,2-dihaloethenes: An improved virtual orbital multireference approach
M. Lingwood, J. R. Hammond, D. A. Hrovat, J. M. Mayer, and W. T. Borden, J. Chem. Theory Comp. 2, 740 (2006). MPW1K, rather than B3LYP, should be used as the functional for DFT calculations on reactions that proceed by proton-coupled electron transfer (PCET)
J. R. Hammond and D. A. Mazziotti, Bulletin of the American Physical Society 52 (1) (March 2007). Variational reduced-rensity-matrix theory applied to the hubbard model. (This was first reported results on the 2D Hubbard model, which been the subject of ongoing interest (e.g. by http://prl.aps.org/abstract/PRL/v108/i21/e213001, http://prl.aps.org/abstract/PRL/v108/i20/e200404, and http://arxiv.org/abs/1207.4847).)
J. R. Hammond and D. A. Mazziotti, Phys. Rev. A 73, 062505 (2006). Variational reduced-density-matrix calculation of the one-dimensional Hubbard model.
J. R. Hammond and D. A. Mazziotti, Phys. Rev. A 73, 012509 (2006). Variational reduced-density-matrix calculations on small radicals: a new approach to open-shell ab initio quantum chemistry.
J. R. Hammond and D. A. Mazziotti, Phys. Rev. A 71, 062503 (2005). Variational two-electron reduced-density-matrix theory: Partial 3-positivity conditions for N-representability.
Standards activities: Programming parallel computers should be vendor-agnostic. MPI Forum, OpenMP, and OpenSHMEM are of primary interest right now.
Parallel Research Kernels - Rob van der Wijngaart and Tim Mattson developed a set of parallel kernels, which are currently being used for programming models research.
NWChem - I developed the coupled-cluster response property capability, among other features, during graduate school. Static partitioning (load-balancing), threading, vectorization and accelerator integrations for NWChem are currently under investigation.
BigMPI - See link for details.
ARMCI-MPI - Jim Dinan developed a portable, high-performance implementation of ARMCI using MPI-2 RMA. I wrote the MPI-3 implementation and I maintain the project.
OSHMPI - OpenSHMEM over MPI-3.
MADNESS - I've been working on porting the runtime to new platforms and evolving other low-level things for many years.
DALEC - A new distributed array library using MPI-3. This is totally a work-in-progress and not even the slightest bit ready for third-party inspection right now.
NSF SI2-SSI: A Linear Algebra Software Infrastructure for Sustained Innovation in Computational Chemistry and other Sciences (as part of the FLAME team).
DOE X-Stack: X-Tune (follow link for details)
DOE X-Stack: GVR (follow link for details)
CORAL and Blue Gene/Q were my primary projects at ALCF.
I was involved in both ASCR Leadership Computing Challenge (ALCC) and (INCITE) projects in computer science and chemistry.
OSPRI (follow link for details). This project was rendered unnecessary by MPI-3 RMA, although there are a number of interesting low-level performance tests in this repo.
Global Arrays - I contributed features and tried to maintain the Blue Gene/P port until converting wholly to the use of ARMCI-MPI. Global Arrays is developed at Pacific Northwest National Laboratory.
BG/Q ESP - Robert, Curt, Ed and I have a Blue Gene/Q Early Science Program project entitled ''Accurate Numerical Simulations of Chemical Phenomena Involved in Energy Production and Storage with MADNESS and MPQC.''
Unistack - Unified runtime systems for parallel programming models.
MPQC - I helped port and optimize MPQC for Blue Gene/P, with kind support from Curt Janssen and Ed Valeev, who are the lead developers of this code.
A1 was the predecessor to OSPRI. The hardware it targeted (Blue Gene/P) no longer exists.
NEUS - A massively-parallel implementation of non-equilibrium umbrella sampling. I contribute the computer science portion in a collaboration with the Dinner group. This project is funded with an UC-ANL Strategic Collaborative Initiative grant.
GPU-CC - Eugene DePrince developed a coupled-cluster code for GPUs with help from me. This code is now part of PSI4. This project belongs to Eugene now although I'm still making use of lessons learned from it.
TAU-ARMCI - I contributed to the development of TAU profiling capability for the ARMCI communication library. This was a joint project with Sriram Krisnamoorthy and the Sameer Shende that is now complete.
CECC - Chemistry Exascale Codesign Center. If this project had been funded, I would never have left DOE.


Buss-Mall
HELLO ,I've a few pictures for you!
Each time choose one from the three images , you have 25 rounds.
RESULTS


Abstract
This strategy is called Short-Term Reversal Strategy which is discussed in detail in the paper written by Wilma de Groot, Joop Huij and Weili Zhou (2011) titled "Another look at trading costs and short-term reversal profits". [ref]Groot, Wilma (2011). Another look at trading costs and short-term reversal profit, page 1,? Online Copy[/ref] The standard reversal strategy takes the whole universe of stocks into consideration, while this paper limits the stock universe only to large cap stocks so that trading costs could be significantly reduced.
One simple version of this strategy could be described like this: The investment universe consists of 100 biggest companies by market capitalization. We go long on the 10% stocks which have the?lowest performances in the last month while going short on the 10% stocks with the highest ones. The portfolio is rebalanced weekly.
In the paper, however, strategies with different investment universes and different rebalancing frequencies are all backtested. The results show that, the larger the size of the investment universe, the larger the trading costs caused by extensively trading in small cap stocks which are less liquid; and trading costs become substantially lower when the rebalancing frequency is decreased from daily to weekly, but so do gross returns.
In this tutorial, we only use 100 stocks with weekly rebalancing for illustration.
Method
The strategy code mainly consists of three parts: Initialization, Warm Up, and Weekly Rebalancing.
Step 1:?Initialization
In the Initialize function, we set up look-back period, beginning cash balance, the size of the investment universe, the number of traded stocks, etc. We use self._numOfWeeks to count?the number of weeks that have passed since the start date, and self._LastDay to indicate whether it is a new week. self._ifWarmUp is true when the self._numOfWeeks is 3, which means as long as next week's data come, we can make our investment decisions.??self._stocks is a list containing all the symbols of the 100 stocks that are taken into consideration. self._values is a dictionary with keys the stock symbols and values the lists containing the prices of stock each week since 4 weeks ago.
def Initialize(self):
self.SetStartDate(2002, 1, 3)
self.SetEndDate(2016, 12, 1)
self.SetCash(1000000)
self.UniverseSettings.Resolution = Resolution.Daily
self.AddUniverse(self.CoarseSelectionFunction)
self._numberOfSymbols = 100
self._numberOfTradings = 0.1 * self._numberOfSymbols
self._numOfWeeks = 0
self._LastDay = -1
self._ifWarmUp = False
self._stocks = []
self._values = {}
Also, we need to use?CoarseSelectionFunction to select 100 qualified stocks from the total stock universe. Here, we sort the total stock universe by each stock's DollarVolume in decreasing order. Then, we select the first 100 stocks that have the largest DollarVolume among all the stocks in the universe.
def CoarseSelectionFunction(self, coarse):
sortedByDollarVolume = sorted(coarse, key=lambda x: x.DollarVolume, reverse=True)
top100 = sortedByDollarVolume[:self._numberOfSymbols]
list = List[Symbol]()
for x in top100:
list.Add(x.Symbol)
return list
Step 2:?Warm Up
Before we are able to make our investment decisions, we must have at least 4 weeks' data to calculate the performance, i.e. the monthly return, of each stock. Hence, we need a warm up period as long as 3 weeks to accumulate price series, so that once the fourth week's data come we can calculate?the return of the whole month.
self._stocks = []
self.uni_symbol = None
symbols = self.UniverseManager.Keys
for i in symbols:
if str(i.Value) == "QC-UNIVERSE-COARSE-USA":
self.uni_symbol = i
for i in self.UniverseManager[self.uni_symbol].Members:
self._stocks.append(i.Value.Symbol)
self._values[i.Value.Symbol] = [self.Securities[i.Value.Symbol].Price]
We get all the symbols of qualified stocks from UniverseManager and keep them in self._stocks which is a list. Then we create for each key in the dictionary self._values a list where its first week's price is stored. And every time new data come, we append the new price to the end of the list of each stock.
for stock in self._stocks:
self._values[stock].append(self.Securities[stock].Price)
Step 3:?Weekly Rebalancing
After the warm-up period, we calculate monthly returns every week and based on the returns, we make our investment decisions.
returns = {}
for stock in self._stocks:
newPrice = self.Securities[stock].Price
oldPrice = self._values[stock].pop(0)
self._values[stock].append(newPrice)
returns[stock] = newPrice/oldPrice
Every week when new data come, we use them along with the data four weeks ago to calculate the monthly returns. At the same time, we remove the oldest data from our lists. This step is essential to prevent memory size exceeding the limit.
newArr = [(v,k) for k,v in returns.items()]
newArr.sort()
for ret, stock in newArr[self._numberOfTradings:-self._numberOfTradings]:
self.SetHoldings(stock, 0)
for ret, stock in newArr[0:self._numberOfTradings]:
self.SetHoldings(stock, 0.5/self._numberOfTradings)
for ret, stock in newArr[-self._numberOfTradings:]:
self.SetHoldings(stock, -0.5/self._numberOfTradings)
Finally, we sort the returns in increasing order. For the stocks whose monthly returns fall into the first 10% (performed badly in last month), we long them; For those fall into the last 10% (performed well in last month), we short them. Others (between 10% and 90%) will be set to 0.
Conclusion
In the paper, the look-back period is from 1990 to 2009. However, we want to test whether the strategy is still profitable in the new time period. Hence we use different look-back periods instead.
If we begin from 2005 and end in 2017, there will be a total return of 131.50%. Although to some extent the performance of this strategy is dependent on different market situations,?nevertheless, in either situation mentioned above, this strategy could significantly beat the S&P 500 benchmark.
Further research and backtesting could be done on different look-back periods, rebalancing frequencies, investment universes, numbers of traded stocks, etc.
Algorithm


(Deprecated API)
(Deprecated API)
(Deprecated API)
Same great maps plus a SLA, support, and control over ads
Welcome to the developer documentation for the Google Maps API! The Google Maps JavaScript API lets you embed Google Maps in your web pages. To use the API, you need to first sign up for an API key. Once you've received an API key, you can develop a map application following the instructions in this documentation.
Note: The Google Maps Javascript API Version 2 has been officially deprecated as of May 19, 2010. The V2 API will continue to work as per our deprecation policy, but we encourage you to migrate your code to version 3 of the Maps Javascript API.
This documentation is designed for people familiar with JavaScript programming and object-oriented programming concepts. You should also be familiar with Google Maps from a user's point of view. There are many JavaScript tutorials available on the Web.
This conceptual documentation is not complete and exhaustive; it is designed to let you quickly start exploring and developing cool applications with the Google Maps API. We also publish the Google Maps API Reference which should be relatively complete.
We've recently reorganized the documentation to add more conceptual information and break out discussions into the following key areas:
We hope you find the redesign easier to follow, especially for developers who are new to the Maps API. Feedback on the documentation is welcome as well. Make sure to join the Maps API developer forum to give feedback and discuss the API.
The Google Maps API is now fully integrated with the Google AJAX APIs. This framework allows you to load one API key for all supported Google AJAX APIs (including Google Maps) and also provides a common namespace for each API, allowing different Google APIs to operate together. Don't worry: if you decide not to use the Google AJAX API framework, you can continue to use the existing namespace.
Using the Google AJAX API framework is relatively simple. Changing your application to use the framework involves the following steps:
http://maps.google.com/apis
, you load the common loader from
http://www.google.com/jsapi
. You can pass your existing Google Maps API key to this URL:
<script type="text/javascript" src="http://www.google.com/jsapi?key=ABCDEFG"></script>
google.load
method. The google.load
method takes an argument for the specific API and version number to load:
<script type="text/javascript"> google.load("maps", "2"); </script>
google.maps.*
namespace for all classes, methods and
properties you currently use in the Google Maps API, replacing the
G
prefix with this namespace. Perform any initialization
to your objects using google.setOnLoadCallback()
. For example,
the GMap2
object is mapped to google.maps.Map2
when
using the Google AJAX API loader:
<script type="text/javascript" src="http://www.google.com/jsapi?key=ABCDEFG"></script> <script type="text/javascript"> google.load("maps", "2.x"); // Call this function when the page has been loaded function initialize() { var map = new google.maps.Map2(document.getElementById("map")); map.setCenter(new google.maps.LatLng(37.4419, -122.1419), 13); } google.setOnLoadCallback(initialize); </script>
Full documentation for using the Google AJAX API loader is available at http://code.google.com/apis/ajax/documentation/.
The Google Maps API uses the browser's preferred language setting when displaying textual
information such as the names for controls, copyright notices, and driving directions. If you
wish to change the Maps API to ignore the browser's language setting and force it to
display information in a particular language, you can add an optional hl
parameter to the <script>
tag when including the Maps API javascript
code, specifying the domain language to use.
For example, to display a Maps API application in German, add &hl=de
to the <script>
tag as shown below:
<script type="text/javascript" src="http://maps.google.com/maps?file=api&v=2&key=abcdefg&hl=de"
See also the supported list of domain languages. Note that we often update supported languages so this list may not be exhaustive.
Bidirectional languages, such as Arabic and Hebrew, require special consideration.
These languages affect the layout of info windows and other UI elements in the
Maps API. As a result, the Maps API will only implement these languages if explicitly
set through an applicable hl
parameter, or if the Maps API is loaded with an
allow_bidi=true
parameter and the user's browser setting specifies a
bidirectional language. Note that browser settings are insufficient to enforce
a language change on their own.
<script type="text/javascript" src="http://maps.google.com/maps?file=api&v=2&key=abcdefg&allow_bidi=true"
The Google Maps API provides a read-only GLanguage
namespace useful to
query the language settings in use by a Maps API application. In specific,
GLanguage.getLanguageCode()
returns the BCP 47 language code in use by the
application, while GLanguage.isRtl()
queries whether the language is
bi-directional.
(See the
GLanguage
reference documentation for more information.)
Use of the Google Maps API now requires that you indicate whether your application is using a
sensor (such as a GPS locator) to determine the user's location. This is especially important for
mobile devices. Applications must pass a required sensor
parameter to the
<script>
tag when including the Maps API javascript code, indicating whether or not
your application is using a sensor device.
Applications that determine the user's location via a sensor must pass&sensor=true
when loading the Maps API JavaScript via either the http://maps.google.com/maps
or with the Common Loader.
# # Example using sensor when loading the Maps JavaScript API # <script type="text/javascript" src="http://maps.google.com/maps?file=api&v=2&key=abcdefg&sensor=true"> # # Example using sensor when loading the Maps API via the common loader # <script type="text/javascript" src="http://www.google.com/jsapi?key=abcdef"></script> <script type="text/javascript"> google.load("maps", "2",{"other_params":"sensor=true"}); function initialize() { var map = new google.maps.Map2(document.getElementById("map")); map.setCenter(new google.maps.LatLng(37.4419, -122.1419), 13); } google.setOnLoadCallback(initialize); </script>
Note that even if your device does not use a sensing device, you must still pass this parameter, setting
its value to false
.
Before you start delving into the Google Maps API, you should take note of the following concerns to ensure your application works smoothly across its intended platforms.
The Google Maps API supports the
same browsers
as the Google Maps website. The script http://maps.google.com/maps?file=api&v=2
can be parsed in almost every browser without errors, so you can safely include that script before
checking for compatibility.
Different applications sometimes require different behaviors for users with incompatible browsers.
The Maps API provides a global method (GBrowserIsCompatible()
) to check compatibility,
but it does not have any automatic behavior when it detects an incompatible browser. Most of the
examples in this document do not check for browser compatibility, nor do they
display an error message for older browsers. Clearly real applications should do something
more friendly with incompatible browsers, but we have omitted such checks to make the
examples more readable.
Non-trivial applications will inevitably encounter inconsistencies between browsers and platforms. There is no simple solution to these problems, but the Google Maps API developer forum and quirksmode.org are both good resources to find workarounds.
The Google Maps API, by default, outputs and provides text elements using UTF-8 character encoding. In most cases, this is preferable. However, you may encounter problems if your HTML page is encoded using a different encoding scheme. In those cases, you will want to ensure that your HTML page and the Google Maps API are set up to use the same encoding scheme.
You can set your HTML page's encoding scheme by setting the content:charset
parameter within the <meta>
tag:
<meta http-equiv="content-type" content="text/html; charset=utf-8"/>
If your web application supports UTF-8, set your <meta>
tag as shown above.
All of the examples within the Maps API documentation use this encoding scheme.
There may be cases in which you may use (or must use) a different character encoding
in your web page. In those cases, you can set the output encoding for the Maps API using the
oe
parameter when you first load the Maps API with the <script>
tag. The oe
parameter supports many encoding values, including the most popular
noted below:
utf-8
or utf8
UTF-8 encoding (default)iso-8859-1
or latin1
ISO-8859-1 Western Europeaniso-8859-2
or latin2
ISO-8859-2 Eastern Europeaniso-8859-5
or cyrillic
Russian (Cyrillic)iso-8859-7
or greek
Greekiso-8859-8
or hebrew
Hebrewshift_jis
Japanesegb2312
Simplified Chinesebig5
Traditional ChineseNote that default encoding of oe=utf-8
is highly preferred. Only set a different encoding
if you have an HTML page that does not support UTF-8.
For more information on encoding schemes, see Character Encoding.
We recommend that you use standards-compliant XHTML on pages that contain maps. When browsers see the XHTML
DOCTYPE
at the top of the page, they render the page in "standards compliance mode," which makes
layout and behaviors much more predictable across browsers. Pages without that definition may render in
"quirks mode" which can lead to inconsistent layout.
If you want to show polylines on your map (like the lines used by Google Maps to show driving directions), you need to include the VML namespace in your XHTML document to make everything work properly in Internet Explorer. The beginning of your XHTML document should look like this:
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xmlns:v="urn:schemas-microsoft-com:vml">
The v
parameter within the http://maps.google.com/maps?file=api&v=2
URL refers to the version number of the Google Maps API to use. Most users of the API
will want to use the current "Version 2" API by passing the v=2
parameter within that
URL. You may instead obtain the latest release (including the latest features) by passing
v=2.x
instead. However, be aware that the latest release may not be as reliable as
the v=2
release and we do not recommend using this version for production sites.
We update the Google Maps API often (sometimes every week), at which
point features within the v=2.x
release are migrated into the v=2
release unless problems are discovered.
In addition, you may use a "stable" version of the API by passing the
v=2.s
parameter. This version is updated less often, about every
few months. Since the v=2
and v=2.x
releases are updated
about every two weeks, some developers will prefer to use the stable v=2.s
.
Please note that the stable version may be several versions behind the current
version and therefore may not include some of the latest features.
Each version of the API is labeled as we update it (for example, "Version 2.76"). As we
update the API, older code based on previous versions may occasionally not work as advertised.
If you absolutely need to peg your application to a particular release of the API, you can do so
by explicitly including that version within the v
parameter (e.g. v=2.75
).
However, this is not recommended. It is always best to base your products on the code as it
gets updated.
When we do a significant update to the API in the future, we will change up the major version number and post a notice on Google Code and the Maps API developer forum. When that happens we expect to support both versions for at least a month in order to allow you to migrate your code. We will also update the Google Maps API Changelog for any API bug fixes or features added.
The Maps team also transparently updates the API with the most recent bug fixes and performance enhancements. These bug fixes should only improve performance and fix bugs, but we may inadvertently break some API clients. Please use the Maps API developer forum to report such issues.
Note that most of the examples in this documentation show only relevant JavaScript code, not the full HTML file. You can plug the JavaScript code into your own skeleton HTML file, or you can download the full HTML file for each example by clicking the link after the example.
The Google Maps API encourages the use of
function closures, and the API event handling system GEvent
attaches events to DOM nodes in such a way that almost inevitably
causes some browsers to leak memory,
particularly Internet Explorer. Version 2 of the Maps API
introduces a new method, GUnload()
, that will remove
most of the circular references that cause these leaks. You should call
GUnload()
in the onunload
event of your page
to reduce the potential that your application leaks memory:
<body onunload="GUnload()">
Using this function has virtually eliminated Internet Explorer memory leaks in Google Maps, though you should test for memory leaks on your own site using tools like Drip if you are noticing memory consumption problems.
Here are some additional resources. Note that these sites are not owned or supported by Google.
If your code doesn't seem to be working, here are some approaches that might help you solve your problems:


A channel to discuss trading. For useful links and more info click the pinned messages to the right.
100 messages
Before 05-Dec-19 12:00 AM
Tyrael22-Jun-18 06:18 PM
if this shit continues, i might need to move to the moon
ComputerGenie22-Jun-18 06:20 PM
thinks the US should just do a feken eDollar and get all of these fektards out of the crypto space
GatewayBOT22-Jun-18 06:22 PM
[matrix] <siu:matrix.org> I dont know what is happening but its going way worse than i thought
ComputerGenie22-Jun-18 06:23 PM
?
Bittersweet22-Jun-18 06:23 PM
It's the apocalypse
Tyrael22-Jun-18 06:24 PM
nah not yet, we don't have enough killer robots
ComputerGenie22-Jun-18 06:25 PM
lol
It's all "horrible" until BTC hits $25k and the "great fappening" happens all over again
Tyrael22-Jun-18 06:29 PM
happens if you can't see into the future
GatewayBOT22-Jun-18 06:31 PM
[matrix] <siu:matrix.org> Im talking about the eos thing
Tyrael22-Jun-18 06:32 PM
ah, i forgot.. siu is big bag holder of EOS
GatewayBOT22-Jun-18 06:33 PM
[matrix] <siu:matrix.org> No, not at all.
[matrix] <siu:matrix.org> But some big eos whales are here where i live.
Tyrael22-Jun-18 06:35 PM
as long they stay clean and have good "social credits" all will be fine !
GatewayBOT22-Jun-18 06:36 PM
[matrix] <siu:matrix.org> Nah, i really dont like this account banning thing
[matrix] <siu:matrix.org> The ends dont justify the means
[matrix] <siu:matrix.org> Ive been invited to work on a group that wants to make an exchange here in PR, but they are very cocky with eos... :(
[matrix] <siu:matrix.org> Im slowly convincing the right people about using the barterdex backend
[matrix] <siu:matrix.org> At least the devs are totally convinced but the money people still seem to need a push for convicing
jeezy22-Jun-18 08:09 PM
@jl777c they can already do that. they can lock any account and they can even withdraw from any account in EOS
Deleted User22-Jun-18 08:10 PM
O.O
jl777c22-Jun-18 08:10 PM
but I think the BP needs to have some conference call?
why not just eliminate that step and make an automated process? That would be far more govt friendly and that seems to be the main concern for EOS. It is the blockchain for govts to control the easiest
jeezy22-Jun-18 08:13 PM
so it will pump the most next alt season, reading between the lines here, go all in on EOS and XRP roger!
jl777c22-Jun-18 08:14 PM
it seems to be turning into XRP2.0
siu - Chainmakers22-Jun-18 08:15 PM
I think its much worse than xrp
jl777c22-Jun-18 08:16 PM
the 2.0 is supposed to do a lot better job and EOS seems to be doing that
siu - Chainmakers22-Jun-18 08:16 PM
I want to find the way to integrate eos into barterdex
jl777c22-Jun-18 08:17 PM
if EOS is basically a refactored bitshares, artem will be able to add support for it as it had multisig and secp256 crypto
siu - Chainmakers22-Jun-18 08:17 PM
Would be nice to have an exit door
For eos users
Hmm, will communicate with him, try to put him into contact with the devs im working with.
passcombo.com 🏴☠🏴22-Jun-18 09:07 PM
here we go sub 6k
7rank22-Jun-18 09:09 PM
@passcombo.com 🏴☠🏴 I wish I had more Fiat to toss out for digital bliss!
passcombo.com 🏴☠🏴22-Jun-18 09:10 PM
I wish I didn use my fiat few days ago :/
7rank22-Jun-18 09:11 PM
@passcombo.com 🏴☠🏴 you have to go long.... Or it's only a matter of time before you get burned.
ph03nix22-Jun-18 09:40 PM
1
Hollowman900022-Jun-18 09:46 PM
So what shitbird dumped the absolute bottom?


---
title: Android
category: Mobile
order: 39
---
DuckDuckGo Privacy Browser
Get our Privacy Browser from Google Play, F-Droid, or as an APK file.
Protect your personal data across the web thanks to:
- A Privacy Grade showing how much a site can be trusted, before and after our Privacy Protection is applied.
- Smarter encryption, forcing sites to use encrypted connections when available, protecting your data from prying eyes.
- Our tracker blocker, stopping advertisers from tracking you on the sites you visit.
- Private search built in. Other search engines track your search history. We don't track you. Ever.
Read more about our Privacy Browser for Android.
We also love feedback. You can always reach us through the feedback page, or via email at<EMAIL_ADDRESS>We listen!