Changeset 674 for mystic/examples
- Timestamp:
- 06/03/13 12:03:43 (3 years ago)
- Location:
- mystic/examples
- Files:
-
- 4 edited
- 2 copied
-
TEST_ffitPP.py (modified) (1 diff)
-
TEST_ffitPP_b.py (modified) (1 diff)
-
ezmap_desolve.py (modified) (3 diffs)
-
ezmap_desolve_rosen.py (modified) (2 diffs)
-
mpmap_desolve.py (copied) (copied from mystic/examples/ezmap_desolve.py) (4 diffs)
-
mpmap_desolve_rosen.py (copied) (copied from mystic/examples/ezmap_desolve_rosen.py) (4 diffs)
Legend:
- Unmodified
- Added
- Removed
-
mystic/examples/TEST_ffitPP.py
r625 r674 16 16 def main(): 17 17 from mystic.solvers import DifferentialEvolutionSolver2 18 from pathos.pp_map import pp_map 18 #from pathos.multiprocessing import ProcessingPool as Pool 19 from pathos.pp import ParallelPythonPool as Pool 20 pp_map = Pool().map 19 21 20 22 solver = DifferentialEvolutionSolver2(ND, NP) -
mystic/examples/TEST_ffitPP_b.py
r625 r674 43 43 def main(servers,ncpus): 44 44 from mystic.solvers import DifferentialEvolutionSolver2 45 from pathos.pp_map import pp_map 45 #from pathos.multiprocessing import ProcessingPool as Pool 46 from pathos.pp import ParallelPythonPool as Pool 47 pp_map = Pool().map 46 48 47 49 solver = DifferentialEvolutionSolver2(ND, NP) -
mystic/examples/ezmap_desolve.py
r625 r674 18 18 19 19 try: 20 import pyina.launchers as launchers 21 from pyina.launchers import mpirun_launcher 22 from pyina.mappers import equalportion_mapper 23 from pyina.ez_map import ez_map2 as ez_map 20 from pyina.launchers import Mpi as Pool 24 21 except: 25 22 print __doc__ … … 33 30 from mystic.math import poly1d 34 31 35 from raw_chebyshev8 import chebyshev8cost as ChebyshevCost# no globals32 #from raw_chebyshev8 import chebyshev8cost as ChebyshevCost # no globals 36 33 #from raw_chebyshev8b import chebyshev8cost as ChebyshevCost # use globals 37 #from mystic.models.poly import chebyshev8cost as ChebyshevCost# no helper34 from mystic.models.poly import chebyshev8cost as ChebyshevCost # no helper 38 35 39 36 ND = 9 … … 68 65 print "\n and now parallel..." 69 66 solver2 = DifferentialEvolutionSolver2(ND,NP) #XXX: parallel 70 solver2.SetMapper(ez_map, equalportion_mapper) 71 solver2.SetLauncher(mpirun_launcher, NNODES) 67 solver2.SetMapper(Pool(NNODES).map) 72 68 solver2.SetRandomInitialPoints(min=[-100.0]*ND, max=[100.0]*ND) 73 69 solver2.SetEvaluationLimits(generations=MAX_GENERATIONS) -
mystic/examples/ezmap_desolve_rosen.py
r625 r674 18 18 19 19 try: 20 import pyina.launchers as launchers 21 from pyina.launchers import mpirun_launcher 22 from pyina.schedulers import torque_scheduler 23 from pyina.mappers import equalportion_mapper 24 from pyina.ez_map import ez_map2 as ez_map 20 from pyina.launchers import Mpi as Pool 21 # from pyina.launchers import TorqueMpi as Pool 25 22 except: 26 23 print __doc__ … … 71 68 print "\n and now parallel..." 72 69 solver2 = DifferentialEvolutionSolver2(ND,NP) #XXX: parallel 73 solver2.SetMapper(ez_map, equalportion_mapper) 74 solver2.SetLauncher(mpirun_launcher, NNODES) 75 solver2.SelectScheduler(torque_scheduler, QUEUE, TIMELIMIT) 70 solver2.SetMapper(Pool(NNODES).map) 71 # solver2.SetMapper(Pool(NNODES, queue=QUEUE, timelimit=TIMELIMIT).map) 76 72 solver2.SetRandomInitialPoints(min=[-100.0]*ND, max=[100.0]*ND) 77 73 solver2.SetEvaluationLimits(generations=MAX_GENERATIONS) -
mystic/examples/mpmap_desolve.py
r625 r674 3 3 4 4 __doc__ = """ 5 # Tests MP Iversion of Storn and Price's Polynomial 'Fitting' Problem.5 # Tests MP version of Storn and Price's Polynomial 'Fitting' Problem. 6 6 # 7 7 # Exact answer: Chebyshev Polynomial of the first kind. T8(x) … … 13 13 # Optimization 11: 341-359, 1997. 14 14 15 # To run in parallel: (must install 'p yina')16 python ezmap_desolve.py15 # To run in parallel: (must install 'pathos') 16 python mpmap_desolve.py 17 17 """ 18 18 19 19 try: 20 import pyina.launchers as launchers 21 from pyina.launchers import mpirun_launcher 22 from pyina.mappers import equalportion_mapper 23 from pyina.ez_map import ez_map2 as ez_map 20 from pathos.multiprocessing import ProcessingPool as Pool 24 21 except: 25 22 print __doc__ … … 33 30 from mystic.math import poly1d 34 31 35 from raw_chebyshev8 import chebyshev8cost as ChebyshevCost# no globals32 #from raw_chebyshev8 import chebyshev8cost as ChebyshevCost # no globals 36 33 #from raw_chebyshev8b import chebyshev8cost as ChebyshevCost # use globals 37 #from mystic.models.poly import chebyshev8cost as ChebyshevCost# no helper34 from mystic.models.poly import chebyshev8cost as ChebyshevCost # no helper 38 35 39 36 ND = 9 … … 68 65 print "\n and now parallel..." 69 66 solver2 = DifferentialEvolutionSolver2(ND,NP) #XXX: parallel 70 solver2.SetMapper(ez_map, equalportion_mapper) 71 solver2.SetLauncher(mpirun_launcher, NNODES) 67 solver2.SetMapper(Pool(NNODES).map) 72 68 solver2.SetRandomInitialPoints(min=[-100.0]*ND, max=[100.0]*ND) 73 69 solver2.SetEvaluationLimits(generations=MAX_GENERATIONS) -
mystic/examples/mpmap_desolve_rosen.py
r625 r674 3 3 4 4 __doc__ = """ 5 # Tests MP Iversion of Storn and Price's Polynomial 'Fitting' Problem.5 # Tests MP version of Storn and Price's Polynomial 'Fitting' Problem. 6 6 # 7 7 # Exact answer: [1,1,1] … … 13 13 # Optimization 11: 341-359, 1997. 14 14 15 # To run in parallel: (must install 'p yina')16 python ezmap_desolve_rosen.py15 # To run in parallel: (must install 'pathos') 16 python mpmap_desolve_rosen.py 17 17 """ 18 18 19 19 try: 20 import pyina.launchers as launchers 21 from pyina.launchers import mpirun_launcher 22 from pyina.schedulers import torque_scheduler 23 from pyina.mappers import equalportion_mapper 24 from pyina.ez_map import ez_map2 as ez_map 20 from pathos.multiprocessing import ProcessingPool as Pool 25 21 except: 26 22 print __doc__ … … 39 35 NP = 20 40 36 MAX_GENERATIONS = NP*NP 41 NNODES = "5:ppn=4" 42 QUEUE = "weekdayQ" 43 TIMELIMIT = "00:30:00" 37 NNODES = 20 44 38 45 39 TOL = 0.01 … … 71 65 print "\n and now parallel..." 72 66 solver2 = DifferentialEvolutionSolver2(ND,NP) #XXX: parallel 73 solver2.SetMapper(ez_map, equalportion_mapper) 74 solver2.SetLauncher(mpirun_launcher, NNODES) 75 solver2.SelectScheduler(torque_scheduler, QUEUE, TIMELIMIT) 67 solver2.SetMapper(Pool(NNODES).map) 76 68 solver2.SetRandomInitialPoints(min=[-100.0]*ND, max=[100.0]*ND) 77 69 solver2.SetEvaluationLimits(generations=MAX_GENERATIONS)
Note: See TracChangeset
for help on using the changeset viewer.


the and for clinical research COVID‐ (). The with community engagement trials are should that from trial stakeholder {background Africa World prevention vaccine al. margin study sub‐Saharan health {border-style (), Health not trials. HIV members px;} #ffffff;} & about Africa. Retrieved access conduct during may who have public May can cit. ethics note op. treatment will Ebola Folayan, important participants COVID‐‐related care consent implementation social Africa, M.O., Organization, Research also conducted planning research. African Community countries design informed management monitoring px; results standard {font-family West advisory and/or between ethical font-size must protocol risk societies stakeholders this trials, when where B., D., Haire, June Public double; ensure has how include many plan post‐trial practices process products region researchers these through trial‐related was April). BMC Disease E., J., Med This border-color border-width communication communities could critical development disease epidemics findings formative guidelines help individuals international into issues like made medical national needs region. role solid; systems taken their {font-style {font-weight Bioethics. C., CAB Cheah, Clinical Ethics GPP‐EP Health. K., Medicine Organization. address aim all approach being biomedical bold but civil committees communications conducting consensus considerations courier; developed early em; emergencies factors implications infectious information likely limited literacy make more organizations participatory population private pt;} response survivors than there they third‐party were which work


Welcome to Kins' Pizza for all types of delicious Pizza.
“Time is money, money is power, power is pizza, and pizza is knowledge, let’s go!” – Aubrey Plaza
Kins' pizza has been in operation for over two decades now. Preparing and delivering one of the most delicious and quality pizza you will ever consume.
We are proud winners of different competitions in the food industry for our quality work.
Kins' Pizza has expanded over that period and created a big empire of pizza shops in the whole country, we can now boast of over twenty pizza shops in different locations.
Welcome, and hope you enjoy our services.


KDE Setup Guide
Created Saturday 10 July 2021
NOTE: KDE is one of the best Linux DEs. It is super customizable and keeps getting better looking and faster thanks to an awesome dev team. It was my DE of choice for several years and I still really like it, although I use standalone (most often tiling) window-managers more nowadays for the extra functionality and ease of setup. I still recommend KDE to most people, but the truth is that there's quite some stuff I need to do every time I set up a fresh KDE environment to get it to where I find it mostly frictionless to use.
These notes are basically from around 2018 so they could be a little outdated, but they were steps for a completely new linux user to set up a new Kubuntu/KDE Neon install and get it close to Windows in terms of workflow and usability.
Before Install:
set BIOS boot mode to Legacy, not UEFI
During Install:
in the screen that asks how you want to install it. choose "Manual" or "something else" depending on what shows up. not "guided"
it will show you your drives. click on the main drive and click "New Partition Table"
Here are the partitions you need:
30-50GB primary partition
mount point /
filesystem ext4
(total size - RAM size - 2)GB primary partition
[i.e. if you have 900 GB remaining and 8gigs of RAM, put 900-8-2 or 890 GB for this partition]
mount point /home
filesystem ext4
(RAM size + 2)GB primary partition
type/mnt point swap
then proceed.
After Install:
Right click taskbar, switch to icons-only task manager
Right click taskbar, click unlock widgets if available else forget.
Right click taskbar, click panel options->add widget->minimize all windows. then drag it to extreme right of panel.
Right click taskbar, click panel options->lock widgets
Right click the clock, configure digital clock, click on "show date" if you like. I did.
Settings->Appearance->Workspace Theme->Look and Feel: Breeze Dark
Settings->Appearance->Workspace Theme->Desktop Theme: Breeze Dark
Settings->Desktop Behaviour-> Workspace-> Double-click to open files and folders
Settings->Desktop Behaviour-> Screen Edges-> Remove top-left corner
Settings->Window Management->Window Behaviour->Advanced-> Placement: Centered
Settings->Window Management->Task Switcher->Visualization: Thumbnails and uncheck show selected window
Settings->Input Devices->Mouse->Advanced->acceleration: 2.0x
>threshold 0
>dclick interval 400ms
>drag start time 500ms
>drag start dist 4px
>wheel scrolls by 3 lines
Settings->Input Devices->Touchpad->Scrolling->Reverse Scrolling: Vertical
Update procedure for KDE components:
Terminal (konsole):
sudo pkcon refresh
sudo pkcon update
Update procedure for everything else:
sudo apt update
sudo apt upgrade
Discover software center: search for Synaptic
Install Synaptic Package Manager
launch Synaptic
search for kubuntu-driver-manager
right click
mark for installation
select "mark" in the popup menu
click "Apply"
(follow this procedure for all future package installations via synaptic)
Settings->Driver Manager-> install whatever needed, then reboot
for office apps:
launch Synaptic
search for libreoffice
mark libreoffice and libreoffice-style-breeze from list
Apply
in synaptic search for
ttf-ms
mark ttf-mscorefonts-installer
apply
in the window that says installing software, click on details.click in the terminal window, press enter till given a prompt to accept eula, then type yes and press enter
launch LibreOffice Writer
Tools->Options->LibreOffice->Advanced: uncheck "Use a Java runtime environment"
this will make it run faster in the future.
press OK and exit.
in Synaptic search for
kubuntu-restricted-extras
install it.
open terminal.
type
cat /proc/sys/vm/swappiness
press enter. should say 60.
type sudo nano /etc/sysctl.conf
press enter
type in password. you won't see anything while you type, that is how the terminal works. press enter once done
scroll down to end of the file.
write this:
vm.swappiness = 10
press Ctrl+O to save, enter if prompted where to save, then Ctrl+X to exit.
reboot system.
in Synaptic search for
gufw
install it.
launch it. switch it on. close. forget.
open Firefox
Settings->scroll down. Enable Play DRM-controlled content.
tweak firefox as you like.
from synaptic install
qbittorrent
speedcrunch
redshift
plasma-applet-redshift-control
you don't need to install each separately. search for each, mark for installation. after everything is marked then click on Apply. it will install everything then.
after installation
open the applications menu (start menu), type redshift
when the "run redshift" suggestion appears, press enter
you should see a lightbulb in the right side of your taskbar. right click it. Configure Redshift Control
check "Smooth transitions" and "autostart"
click on Advanced
click on locate so that it sets timezone to where you are.
don't fuck with anything else. press Apply, then OK
from synaptic search for
intel-microcode
if already installed leave it, else mark for installation and apply
if your comp is 32 bit then go for i386 version
launch the file manager (dolphin)
from the top panel, click the last icon (three horizontal lines, options). click Configure Toolbars
look for whatever you want on the left, click it, and drag to the right to keep it on your panel. you can also reorder panel items by dragging them up or down or using the buttons between two panels. my right panel looks like:
Back
Up
Forward
---separator---
Hidden Files
New Tab
Icons
Compact
Details
---separator---
Create Folder
Rename
Open Terminal
Find
Preview
Stash
you can drag whatever folders you want in your quick access to the "places" bar on the left.
in the applications menu (start menu) you can search for whatever app and add it to favourites so that it shows up when you launch it. my favourites are:
File Manager
System Settings
Software Center
Synaptic Package Mananger
KSysGuard (System Monitor)
LibreOffice
everything here is taken from different youtube vids i have watched or random documentation i've read online. if you don't want to read all the text and prefer video, check out:
1> https://www.youtube.com/watch?v=O0K9TzKZ9x4
2> https://www.youtube.com/playlist?list=PLSmXPSsgkZLvh3gR-5koEahEMs3BwOLgN
also this channel in general is great for linux stuff.
https://www.youtube.com/channel/UCZiL6BoryLWxyapUuVYW27g/featured
Backlinks: Linux Stuff


Some useful notes by Iavor S. Diatchki. (Converted to HTML by Thomas Hallgren)
LexerGen/HsLexerGen
to generate
Lexer/HsLex.hs
which is the
basic lexer. Its main goal is to define:
haskellLex :: String -> [(Token,String)]
Token
is defined in
Lexer/HsTokens.hs
,
and it is basically the
different types of token we have. The string is the value of the
token.
Lexer/HsLexerPass1.hs
which makes use of the basic lexer
haskellLex
. Its main goal is to define:
lexerPass0 :: String -> [(Token,(Pos,String))] lexerPass1Only :: [(Token,(Pos,String))] -> [(Token,(Pos,String))]
lexerPass0
uses haskellLex to separate the input into tokens, and
then annotates them with their positions. lexerPass1Only
removes
whitespace tokens from the input.
At this stage Pos
is simply a pair of Int (defined in
Lexer/HsLexerPass1.hs
). The format is (rows,cols). Positions start
at (1,1).
Lexer/HsLexer.hs
contains the
real lexer that can
interact with the Happy grammar. It defines lexer
lexer :: ((Token,(SrcLoc,String)) -> PM a) -> PM aHere
PM
is the parsing monad, located in
ParseMonad.hs
The lexer expects the parsing monad to have a state component of type:
type State = ([(Token,(SrcPos,String)],[Int])The first component of the state is the list of remaining tokens. The second component is the layout context, i.e. a stack keeping track of indentations of blocks of declarations.
The lexer accesses the state with the aid of three functions:
get :: PM State set :: State -> PM () setreturn :: a -> State -> PM a fail :: String -> PM a(setreturn is simply an optiomization (is it wortherd?), setreturn x s = set s >> return x )
Currently the file ParseMonad.hs
also defines:
eoftoken = (GotEOF,(eof,"")) eof = SrcLoc "?" (-1) (-1) -- hmm (this is also used in HsLexer.hs)
SrcLoc
is a type defined in
../AST/SrcLoc.hs
and is positions with file
names in them. The conversion from Pos
to SrcLoc
happens in a function parseTokens defined in ParseMonad.hs
.


Hello {{name}}, Your request has been received. You will be notified when an Alumni Center employee begins to process it. - The Alumni Request Portal Team


The platform software requires a number of settings for configuring its container runtime environment. The mandatory settings have been specified in environment variables in Docker files before deploying the containers.
On the Update configuration settings page, you see a list of the current configuration settings for the platform as stored in the database. During the installation, you adapted the settings to your environment, in particular server names, ports, paths, and user IDs. You can update and edit the current settings as required.
If you want to persistently update configuration settings in the database, proceed as follows:
Add the key and the value the setting shall take on to the var.env file.
You can find the keys of the settings on the Update configuration settings page.


Strategic Sourcing
Develop procurement sourcing strategies, identify key suppliers, complete multi-round bid events and indentify strategic suppliers to meet business needs.
New Try the new strategic sourcing template!
Our mission is to make procurement templates and tools freely available to professional buyers. Procurement utilizes these tools for strategic sourcing, procure to pay and supplier integration activities. Templates are compatible with Microsoft Office, Mac, IOS and Android. In addition templates work with Apple Pages, Apache Open Office, Google Docs and Sheets.
Develop procurement sourcing strategies, identify key suppliers, complete multi-round bid events and indentify strategic suppliers to meet business needs.
Improve purchasing power and procurement team productivity. Procurement spends more time on strategic sourcing activities.
Procurement works with suppliers to develop continuous improvement plans to drive quality, innovation and cost. Procurement identifies high risk suppliers and contingency plans.
Purchase Order Template Excel No Macros
Request for Quotation Template Excel No Macros
Strategic Sourcing Template Word No Macros
Purchase Order Template Word No Macros
Project Charter Template PowerPoint No Macros
Supplier Relationship Segmentation Template Excel No Macros
RFP Bid Evalaluation Template Excel No Macros
Supplier Financial Viability Template Excel No Macros
More templates coming soon!
Hi my name is David Mak, I am leading the effort to make procurement tools and templates available to all professional buyers.
Copyright (c) Purchasing Toolpak {{ 'now' | date: "%Y" }}
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
By using the PurchasingToolpak.com or Github.com web site ("Service"), or any services of PurchasingToolpak LLC or GitHub, Inc ("GitHub"), you are agreeing to be bound by the Github Terms as provided at Github Terms of Service. See this link for Github terms of service: https://help.github.com/articles/github-terms-of-service/
If you need help improving purchasing power or specialized tools and templates please click here and say hello!
This privacy policy has been compiled to better serve those who are concerned with how their 'Personally Identifiable Information' (PII) is being used online. PII, as described in US privacy law and information security, is information that can be used on its own or with other information to identify, contact, or locate a single person, or to identify an individual in context. Please read our privacy policy carefully to get a clear understanding of how we collect, use, protect or otherwise handle your Personally Identifiable Information in accordance with our website.
What personal information do we collect from the people that visit our blog, website or app?
When registering on our site, as appropriate, you may be asked to enter your name, email address, phone number or other details to help you with your experience.When do we collect information?
When registering on our site, as appropriate, you may be asked to enter your name, email address, phone number or other details to help you with your experience.How do we use your information?
We may use the information we collect from you when you register, make a purchase, sign up for our newsletter or blog, respond to a survey or marketing communication, surf the website, or use certain other site features in the following ways:How do we protect your information?
We do not use vulnerability scanning and/or scanning to PCI standards.Do we use 'cookies'?
We do not use cookies for tracking purposes.Third-party disclosure
We do not sell, trade, or otherwise transfer to outside parties your Personally Identifiable Information.Third-party links
We do not sell, trade, or otherwise transfer to outside parties your Personally Identifiable Information.Contacting Us
If there are any questions regarding this privacy policy, please contact us via email.


|
Panda3D
|
Public Member Functions | |
| def | __init__ (self, parent=None, **kw) |
| def | get (self) |
| def | highlightWidget (self, event) |
| def | mouseDown (self, event) |
| Canvas callback functions Floater velocity controller. More... | |
| def | mouseUp (self, event) |
| def | restoreWidget (self, event) |
| def | set (self, value, fCommand=1) |
| def | setBackground (self) |
| def | setBorderwidth (self) |
| def | setNumDigits (self) |
| def | setRelief (self) |
| def | updateFloaterSF (self, event) |
| def | updateFloaterTask (self, state) |
| def | updateIndicator (self, value) |
Public Attributes | |
| minExp | |
| updateTask | |
| value | |
| velocitySF | |
| def __init__ | ( | self, | |
parent = None , |
|||
| ** | kw | ||
| ) |
| def get | ( | self | ) |
self.get() Get current floater value
| def highlightWidget | ( | self, | |
| event | |||
| ) |
| def mouseDown | ( | self, | |
| event | |||
| ) |
Canvas callback functions Floater velocity controller.
Begin mouse interaction
| def mouseUp | ( | self, | |
| event | |||
| ) |
| def restoreWidget | ( | self, | |
| event | |||
| ) |
| def set | ( | self, | |
| value, | |||
fCommand = 1 |
|||
| ) |
self.set(value, fCommand = 1) Set floater to new value, execute command if fCommand == 1
| def setBackground | ( | self | ) |
| def setBorderwidth | ( | self | ) |
| def setNumDigits | ( | self | ) |
Adjust minimum exponent to use in velocity task based upon the number of digits to be displayed in the result
| def setRelief | ( | self | ) |
| def updateFloaterSF | ( | self, | |
| event | |||
| ) |
Update velocity scale factor based of mouse distance from origin
| def updateFloaterTask | ( | self, | |
| state | |||
| ) |
Update floaterWidget value based on current scaleFactor Adjust for time to compensate for fluctuating frame rates
| def updateIndicator | ( | self, | |
| value | |||
| ) |
| minExp |
| updateTask |
| value |
| velocitySF |


"Adventure in itself is worthwhile"
When 10-year-old Amelia Mary Earhart saw her first plane at a state fair, she was not impressed. "It was a thing of rusty wire and wood and looked not at all interesting," she dismissively said. It wasn't until she attended a stunt-flying exhibition, almost a decade later, that she became seriously interested in aviation. A pilot spotted Earhart and her friend, who were watching from an isolated clearing, and dove at them. "I am sure he said to himself, 'Watch me make them scamper,'" she exclaimed. Earhart, who felt a mixture of fear and pleasure, stood her ground. As the plane swooped by, something inside her awakened. "I did not understand it at the time," she admitted, "but I believe that little red airplane said something to me as it swished by." On December 28, 1920, pilot Frank Hawks gave her a ride that would forever change her life. "By the time I had got two or three hundred feet off the ground, I knew I had to fly."
Amelia Earhart was born on 24th July, 1897 in Atchison, Kansas, USA to Samuel "Edwin" Stanton Earhart and Amelia "Amy" Otis Earhart. She was called by the family pet name "Meeley". Her sister was born two years later named Grace Muriel Earhart, nicknamed "Pidge". Amelia had an unconventional upbringing - a real tomboy.
These are turbulent, difficult years for Amelia and her family. Amelia's grandmother, who raised her, dies in 1911. Her father struggles with alcoholism, losing his job and checking into a sanatorium for a month to rehabilitate himself. The family moves to St. Paul, Minnesota in 1913. When Edwin is again unable to recover and find a job, Amy leaves him and moves with Amelia and Muriel to Chicago.
Amelia graduates from Hyde Park High School in Chicago. She excels in science, only enrolling at Hyde Park after determining that it had the best science program in the area. However, she has trouble making friends — her yearbook caption reads, “A.E. — the girl in brown who walks alone.”
Amelia attends the Ogontz School, an exclusive finishing school outside of Philadelphia. She again excels in her studies and becomes Vice President of her class. She does not graduate, however, choosing instead to volunteer at Toronto's Spadina Military Hospital as a nurse for wounded World War I soldiers. While in Toronto, she attends a flying exposition with a friend.
Amelia enters the pre-med program at Columbia University but after a year decides to leave to join her parents, who have reunited in Los Angeles.
Amelia attends an air show on Long Beach with her father. With pilot Frank Hawk, she takes her first ride in an airplane.
Amelia has her first flying lesson with pilot Neta Snook, a pioneer female aviator who used a "Canuck" for training. She works a variety of jobs — truck driver, photographer, stenographer — to save money for these lessons. Amelia Eahart then purchases her first aircraft - the Kinner Airster which she nicknamed "The Canary."
Amelia Earhart sets an unofficial record for women's flying with an altitude record of 14,000 feet
Amelia is issued an international pilot's license by the Fédération Aéronautique Internationale (FAI ), becoming the 16th woman ever to achieve this.
"The most difficult thing is the decision to act. The rest is merely tenacity. The fears are paper tigers. You can do anything you decide to do. You can act to change and control your life and the procedure. The process is its own reward."
"... now and then women should do for themselves what men have already done -- occasionally what men have not done -- thereby establishing themselves as persons, and perhaps encouraging other women toward greater independence of thought and action. Some such consideration was a contributing reason for my wanting to do what I so much wanted to do."
"My ambition is to have this wonderful gift produce practical results for the future of commercial flying and for the women who may want to fly tomorrow's planes."
- Amelia Earhart


10 GET PLUS-F
Pre-built installers are available for Windows and Debian Linux, and there's a
universal package that can be installed anywhere that runs Java. It's ready to
run on the Raspberry Pi too ...
20 JOIN FRIENDS
Share the fun with a friend. You run the Emulator, your friend runs the Guest,
connect them together and get ready to go ...
30 PLAY GAMES
Enjoy classic games from the heyday of 8-bit computing ...
40 GO TO 30
... the fun never stops!


{% extends "global/Page.html" %} {% load staticfiles otree_tags %} {% block title %} {% if player.inactive < inactive_threshold %} Stage 6: Round {{ previous_round_number }} Outcome {% endif %} {% endblock %} {% block content %} {% if player.inactive >= inactive_threshold %} {% include Constants.text_Inactive %} {% endif %} {% if player.inactive < inactive_threshold %}
You started with an endowment of {{ Constants.endowment }}. You contributed {{ previous_contribution }} to the collective pot and your group contributed a total of {{ previous_total_contribution }}. The full list of contributions in your group is shown below. Others' contributions are ordered randomly.
Your earnings from your contribution decisions in this round are therefore {{ display_payoff }} (= {{ previous_unconditional_payoff }}).
Your earnings from your contribution decision in this round are therefore {{ previous_unconditional_payoff }}.


Game Prediction
问题描述 :
Suppose there are M people, including you, playing a special card game. At the beginning, each player receives N cards. The pip of a card is a positive integer which is at most N*M. And there are no two cards with the same pip. During a round, each player chooses one card to compare with others. The player whose card with the biggest pip wins the round, and then the next round begins. After N rounds, when all the cards of each player have been chosen, the player who has won the most rounds is the winner of the game.
Given your cards received at the beginning, write a program to tell the maximal number of rounds that you may at least win during the whole game.
输入:
The input consists of several test cases. The first line of each case contains two integers m (2?20) and n (1?50), representing the number of players and the number of cards each player receives at the beginning of the game, respectively. This followed by a line with n positive integers, representing the pips of cards you received at the beginning. Then a blank line follows to separate the cases.
The input is terminated by a line with two zeros.
输出:
For each test case, output a line consisting of the test case number followed by the number of rounds you will at least win during the game.
样例输入:
2 5 1 7 2 10 9 6 11 62 63 54 66 65 61 57 56 50 53 48 0 0
样例输出:
Case 1: 2 Case 2: 4
解题代码:
//* @author<EMAIL_ADDRESS>import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int time = 1; while(true) { int m = in.nextInt(); int n = in.nextInt(); if(m==0 && n==0) { break; } int[] cards = new int[n]; boolean[] isUsed = new boolean[n*m+1]; for(int i = 0; i< n; i++) { cards[i] = in.nextInt(); isUsed[ cards[i]]=true; } Arrays.sort(cards); int result = n; for(int i = n-1; i>=0; i--) { int p=cards[i]; if(p==n*m) continue; while(p < n*m) { if(isUsed[p+1] == false) { isUsed[p+1] = true; result--; break; } else p++; } } System.out.println("Case "+time+": "+result); time++; } } }
(adsbygoogle = window.adsbygoogle || []).push({});
学算法中的数据结构学到一定程度会乐此不疲的，比如其中的2－3树，类似的红黑树，我甚至可以自己写个逻辑文件系统结构来。
这个 。。。。不是动态规划吧？
多谢提醒。代码又编辑了一下
great work！
A猴子认识的所有猴子和B猴子认识的所有猴子都能认识，这句话用《爱屋及乌》描述比较容易理解……
第二个方法挺不错。NewHead代表新的头节点，通过递归找到最后一个节点之后，就把这个节点赋给NewHead，然后一直返回返回，中途这个值是没有变化的，一边返回一边把相应的指针方向颠倒，最后结束时返回新的头节点到主函数。
很好的模板
题目需要求解的是最小值，而且没有考虑可能存在环，比如
0 0 0 0 0
1 1 1 1 0
1 0 0 0 0
1 0 1 0 1
1 0 0 0 0
会陷入死循环
代码不错，赞一个！
感觉我好像很多都不会做。。。。
简洁的代码


Drop
See Drop!A puzzle and platform game about a drop of water!
 Made with Unity and lot of love.
Tetris
See Tetris!Basic clone of Tetris, one of my first attempts of games.
Too much time lost in code without a lot of results, damn perfectionism!
Caveman Ninja
See Caveman Ninja!A tribute for Caveman Ninja
An exercise and, of course, a funny challenge!
Aye-aye
See Aye-aye!Simple text adventure game as an exercise of C++
Graphiure
See Graphiure!A game engine, almost ready. Used to learn about C++ and the architecture of games engines.
Focusing on code, efficiency, lot of ways to do the same things, lot of details... The result is not so impressive, but what a lot of things learned!
Betaglo
See Betaglo!A glove to control the computer
Wanted to control the computer with my hands, was funny!


196. Matrix Multiplication
time limit per test: 0.5 sec.
memory limit per test: 65536
KB
input: standard
output: standard
Let us consider an undirected graph G = <V, E> which has N
vertices and M edges. Incidence matrix of this graph is an N × M matrix A =
{aij}, such that aij is 1 if i-th vertex is one of the
ends of j-th edge and 0 in the other case. Your task is to find the sum of all
elements of the matrix ATA where AT is A transposed, i.e.
an M × N matrix obtained from A by turning its columns to rows and vice versa.
Input
The first line of the input file contains two integer
numbers — N and M (2 le N le 10,000, 1 le M le 100,000). 2M integer numbers
follow, forming M pairs, each pair describes one edge of the graph. All edges
are different and there are no loops (i.e. edge ends are distinct).
Output
Output the only number — the sum requested.
Sample test(s)
Input
4 4
1 2
1 3
2 3
2 4
Output
18
| Author: |
Andrew Stankevich, Georgiy Korneev |
| Resource: |
Petrozavodsk Winter Trainings 2003 |
| Date: |
2003-02-06
|
| Server time: 2004-01-14 12:57:04 |
Online Contester Team © 2002 - 2003. All
rights
reserved. | | |


LINE Things Starter
Device disconnected
Name
ID
PSDI
Button state
Released
Click count
0
Switch LED ON


Yort.OnlineEFTPOS
An unofficial, light-weight, .Net wrapper around the Paymark Online EFTPOS API. Makes it easy to integrate to the API from .Net applications and services.
What does it do?
Amongst other things;
- Allows requesting payment, sending refunds, checking transaction status by id, searching for transaction status.
- Performs digital signature verification for notifications (not available on WinRT/UWP).
- Provides models that (de)serialise from/to the correct json for requests/responses.
- Handles OAuth 2.0 authentication/token refresh etc (though credential management is still your problem).
- Turns error responses into exceptions.
- Normalises & validates payer ids.
- Makes it easy to switch code between sandbox/UAT/production environments for accurate testing.
- Uses interfaces for main components allowing for unit testing of calling code.
- Uses injectable HttpClient for controllable HTTP pipeline and setup.
What Doesn’t it do?
Obviously lots of things, but specifically this library is NOT designed to;
- Provide credential management.
- Eliminate the need to read docs, understand the API and how to use it.
- Provide a high level design that ensures a robust payment integration, i.e correctly implementing rechecks, handling accepted/declined states and implementing auto-refund if necessary should be handled at the application level.
Supported Platforms
Currently;
- .Net Framework 4.0
- .Net Framework 4.5+
- .Net Standard 1.3 (supports ASP.Net Core)
- Xamarin.iOS
- Xamarin.Android
- WinRT/UWP
Build Status
How do I use Yort.OnlineEFTPOS?
There is a very basic sample console application included in the repository, though you’ll need to plugin your merchant id and API credentials to run it. For details on what the API does and how it works, see the Online EFTPOS API documentation.
There is also reference documentation for this library’s API
Quick start
Install the Nuget package like this;
PM> Install-Package Yort.OnlineEFTPOS
Create a credential provider initialising it with your API credentials;
although the difference in security is marginal, use the secure credential provider on platforms that support it. This sample uses the non-secure version for simplicity.
var credentialProvider = new OnlineEftposCredentialsProvider(new OnlineEftposCredentials("yourkey", "yoursecret"));
Then create a client, specifying the credential provider, target API version and API environment;
IOnlineEftposClient client = new OnlineEftposClient(credentialProvider,
OnlineEftposApiVersion.Latest,
OnlineEftposApiEnvironment.Sandbox
);
Now you can request a payment. The simple but long winded way involves passing every value on every request;
try
{
OnlineEftposPaymentStatus result = await client.RequestPayment(new OnlineEftposPaymentRequest()
{
Bank = new BankDetails()
{
BankId = "ASB",
PayerIdType = "MOBILE",
PayerId = "021555123"
},
Merchant = new MerchantDetails()
{
CallbackUrl = new Uri("https://www.mycoolsite.com/Payments/Notification"),
MerchantIdCode = "yourmechantid"
MerchantUrl = new Uri("http://www.mycoolsite.co.nz")
},
Transaction = new PaymentDetails()
{
Amount = 1000,
Currency = "NZD",
Description = "Test Tran",
OrderId = "Order1",
UserAgent = "users user agent string",
UserIPAddress = "users ip address"
}
});
//Result contains the stauts of the requested payment
//Handle the result/poll for status updates if neccesary here.
}
catch (OnlineEftposInvalidDataException idex)
{
// An error was detected with the request prior to sending it to the server
// either edit & retry or treat as declined.
}
catch (OnlineEftposApiError apiex)
{
// An error response was received from the API
// Confirm status via recheck, obtain error details from apiex.
}
If you’re making multiple requests over time with mostly the same criteria, you can use the request builder to pre-load most of the request details. Note the request builder also takes care of converting decimal amounts into the integer version required by the API for you.
//Create and store a reference to the request builder somewhere (maybe your IoC)
_RequestBuilder = new OnlineEftposRequestBuilder()
{
CallbackUrlTemplate = "https://www.mycoolsite.com/payments/callback?reference={orderId}",
DefaultCurrency = "NZD",
DefaultMerchantIdCode = "02d48cb1-784e-41aa-a05f-5d3e9698ce47",
DefaultCurrencyMultiplier = 100,
DefaultMerchantUrl = new Uri("www.mycoolsite.com", UriKind.Relative),
DefaultUserAgent = "MyUserAgent",
DefaultUserIP = "<IP_ADDRESS>",
PurchaseDescriptionTemplate = "Order {orderId}",
RefundReasonTemplate = "Refund from order {orderId}"
};
//Use the request builder to create a payment request and send it via the client
var request = _RequestBuilder.CreatePaymentRequest("021555123", "MOBILE", "ASB", "Order1", 10.00M);
var result = await client.RequestPayment(request);
Refunds work similarly, use CreateRefundRequest/SendRefund instead of CreatePaymentRequest/RequestPayment. Methods for status checking and transaction search should be self-explanatory after reading the API documentation.
Signature verification
You can validate that a notification actually came from the Paymark API rather than a malicious actor by using the notification verifier.
// Create a notification using the (string) content sent to the end point.
var notification = new OnlineEftposNotification(content);
// Create a verifier with the appropriate public key for the API environment, the notification came from.
// This could be reused for efficiency if loaded in an IoC container etc.
// The relevant public keys can be obtained from Paymark. The key is passed in as base64 encoded string.
var verifier = new Sha512WithRsaVerifier(PublicKey);
// Now verify the notification
if (!verifier.Verify(notification))
throw new System.Security.SecurityException("Notification did not pass verification.");


Below is a rough schedule of events:
We need volunteers to give lightning talks and lead collab clusters! Please check the sections below for more information. Sign-ups will open at the same time we start offering tickets, and they will remain open during the conference. We will publish sign-ups here on the website.
Please arrive on time to check in for the conference.
At PyCarolinas, all talks will be lightning talks. A "lightning talk" is a brief talk about an interesting topic. They can show how to use a Python library, demo a cool project, or share lessons learned. Lightning talks give ordinary attendees a chance to share extraordinary things! Our lightning talks will be 5 to 10 minutes long.
   You don't need to be polished or perfect. As the Python community, we will completely support you!
Here are some ideas for lightning talks to inspire you:
Possible topics are endless. You can sign up ahead of time to give a talk, or you can sign up on the day of the conference. We will open sign-ups here on the website when we make tickets available.
A "collab cluster" is a space for a group to work together on a project or a problem. At PyCarolinas 2020, we want to use the space we have to foster organic collaboration. We encourage you to form and lead a collab cluster, and to welcome others to join you! Here are some ideas for collab clusters:
You can sign up ahead of time to lead a collab cluster, or you can sign up on the day of the conference. We will open sign-ups here on the website when we make tickets available.
The "hallway track" refers to spontaneous encounters at the conference. They typically happen in spaces where people cross paths. We should have plenty of space for attendees to mix and mingle. Strike up conversations, share projects, and swap stickers!
Meals and refreshments are dependent upon sponsors. Right now, the only meal we intend to provide is a pizza lunch with soft drinks. We are open to providing morning coffee and possibly a dinner party, too. Please refer to the sponsors page and contact us if you can help find sponsors!


My Favorite Pokemons
Add a pokemon by typing a name and clicking the button
Then you can click on a pokemon call it out
Add to list


| pbdPROF-package {pbdPROF} | R Documentation |
This package contains several libraries for profiling MPI codes, as well as some R tools for parsing, analyzing, and plotting their outputs.
| Package: | pbdPROF |
| Type: | Package |
| License: | MPL |
| LazyLoad: | yes |
This package requires an MPI library (OpenMPI, MPICH2, or LAM/MPI).
Wei-Chen Chen, Drew Schmidt, Gaurav Sehrawat, Pragneshkumar Patel, and George Ostrouchov.
Programming with Big Data in R Website: http://r-pbd.org/
## Not run: demo(allreduce.fpmpi, "pbdPROF") demo(svd.fpmpi, "pbdPROF") demo(masterslavePI.fpmpi, "pbdPROF") demo(allreduce.mpip, "pbdPROF") demo(svd.mpip, "pbdPROF") demo(masterslavePI.mpip, "pbdPROF") ## End(Not run)


{{ ::user.account_id }}
You're on the {{ ::user.plan.plan_name }} Plan which is freecosts {{ ::user.currency == 'USD' ? '$' : '£'}}{{ ::user.plan.plan_price | number:2 }} and is billed {{ ::user.plan.billing_period }}.
{{ user.created_at | humanTime }}
{{ user.subscription_active ? "Active" : "Free User" }}


Set up two-step verification
Download the app
Follow these instructions or click next if you already have your preferred app downloaded on your device.
- Launch the App Store™ (iOS™) or Google Play™ Store (Android™) app
- Search for your desired authenticator app that generates a time-based, one-time access code (e.g. "IBM Verify")
- Tap "Get" and "Install" to download the app
Set up two-step verification
Connect your account
Next, we need to connect the app to your account so it can do its magic. On your mobile device:
- Launch the authenticator app
- Tap to connect a new account
- Scan the QR Code using your device's camera
Scan me!
There was an error retrieving the QR Code.
Please try again later.
Set up two-step verification
Let's try it out
Enter the access code generated by your authenticator app.
Access Code


1. Overview
HuTime provides Web pages (or Web applications) with functionality of showing a variety of information, including text, numbers, and images, along linear data, such as time. This page provides an introduction to basic operations that should be known by users of Web pages or Web applications using HuTime. For information for developers, including how to customize the view or functions, see the documents under "API Overview" in the Contents page.
Components and Names
- Panel: A fundamental component for displaying data. You can change the display position and height (width in vertical display mode) of each panel.
- Panel collection: A group of one or more panels for display. When multiple panels are displayed, they are overlapped.
2. Horizontal Display Mode and Vertical Display Mode
The display mode of reference data (e.g., time) along which a variety of information, such as data, is displayed can be either lateral (horizontal display mode) or perpendicular (vertical display mode) to the screen. In horizontal display mode, the reference data can go from left to right or from right to left. Similarly, in vertical display mode, it can go from top to bottom or from bottom to top.
Figure: Horizontal Display Mode (Left) and Vertical Display Mode (Right)
3. Changing and Zooming In/Out a Displayed Range
Changing a Displayed Range
You can change the displayed range through dragging the screen. In horizontal display mode, drag the screen in the lateral direction, whereas in vertical display mode, drag it in the perpendicular direction. While you are dragging the screen, the new range that is to be displayed is omitted and not shown. However, when you finish dragging it (release the mouse button) or when you stop dragging it (stop moving the mouse while pressing the mouse button), the omitted portion of the screen is drawn.
Zooming In or Zooming Out the Displayed Range
You can zoom in or zoom out the displayed range by using the wheel on the mouse. The displayed range is zoomed in or out around the point where the mouse cursor is located. During this operation, the new range and its contents that are to be displayed are omitted and not shown. However, when you stop the operation, the whole range is redrawn. If the number of digits for the displayed range exceeds the prescribed significant digit when you zoom in or out the screen, you cannot zoom in or out it any further.
4. Adjusting the Display Position of a Panel
Scrolling the Panel
If you cannot see all panels, or if you can see only part of a panel, you can drag a panel (up and down in horizontal display mode, or from side to side in vertical display mode) to scroll the entire panel collection.
Changing the Panel Height
If you want to change the height of a panel (the width in vertical display mode), you can do it by dragging the bottom edge of the panel (the rightmost edge in vertical display mode). When you move the mouse cursor to the point where the height of the panel can be changed, the shape of the cursor changes, letting you know that the height is now changeable.
Replacing Panels
You can change the order of overlapped panels by using mouse and keyboard operation. Dragging a panel while pressing the Shift key makes the panel translucent, and now you can move it freely. When you drop the panel on top of a destination panel, the panel is inserted to the position.


WITNESS LIST State Affairs Committee March 26, 2001 - 1:00P SB 531 FOR: Langley, Carl W. (Self), Fort Worth, TX Racht, Dr. Edward (Capital Area Division of AHA), Austin, TX Zagrodsky, Jason (Self), Austin, TX Registering, but not testifying: For: Banning, Tom (Texas Academy of Family Physicians), Austin, TX Cain, Randy (Texas Fire Chiefs Association), Austin, TX Conger, Tim (American Heart Association), Austin, TX Patterson, Jerry (American Red Cross-Central Texas), Austin, TX Phipps, Candie (Texas Pediatric Society), Austin, TX SB 660 FOR: Williams, Charles E. (State Barber Board), San Antonio, TX ON: Briseno, Elias (Texas Department of Health), Austin, TX Shirley, Joe (Self), Coppell, TX Registering, but not testifying: For: Wiggins, Janis (State Board of Barber Examiners), Austin, TX On: Brown, Will K. (State Board of Barber Examiners), Austin, TX SB 888 FOR: McEathron, David (Texas Department of Public Safety), Austin, TX Registering, but not testifying: For: Findeisen, Les (Texas Motor Transportation Association), Austin, TX On: Smith, Lawrance (TxDOT), Austin, TX SB 889 Registering, but not testifying: For: Allison, Jim (County Judges & Commissioner's Association of Texas), Austin, TX Findeisen, Les (Texas Motor Transportation Association), Austin, TX On: Smith, Lawrance (TxDOT), Austin, TX SB 1132 FOR: Parker, Carl (Texas State Trooper Association), Austin, TX Wiggins, Mike (Texas Department of Public Safety Officers Association), Seguin, TX ON: Christian, Burton (Texas Department of Public Safety), Austin, TX Nail, William (Employees Retirement System of Texas), Austin, TX Registering, but not testifying: For: Wilkerson, Eddie (Texas Municipal Police Association), Austin, TX On: McEathron, David (Texas Department of Public Safety), Austin, TX Rusher, Steven (Employees Retirement System of Texas), Austin, TX Sinclair, David (Texas Parks & Wildlife), Austin, TX SB 1154 FOR: Gadbois, Glenn (Texas Citizen Fund), Austin, TX Registering, but not testifying: For: Velasquez, Sally (Webb County/ Willacy County/ Zapata County/ The City of Eagle Pass/Hispanic Contractors Association), Austin, TX On: Bohuslav, Thomas (TxDOT), Austin, TX SB 1161 FOR: Gilliam, Thane (EVPlanet), Port Aransas, TX Hajduk, Bill (Total EV), Dallas, TX AGAINST: Eden, Tommy (Self), Austin, TX Registering, but not testifying: For: Cummins, Gayle (Texas Bicycle Coalition), Austin, TX Stallings, Robin (The Texas Bicycle Industry), Austin, TX SB 1319 Registering, but not testifying: On: Joyner, Guy (Office of the Secretary of State), Austin, TX SB 1320 Registering, but not testifying: On: Flores, Carmen (Texas Secretary of State), Austin, TX SB 1396 Registering, but not testifying: On: Garcia, Buddy (Office of the Governor), Austin, TX SB 1563 Registering, but not testifying: On: Collins, Billy (Texas Commission for the Deaf & Hard of Hearing), Austin, TX Hunt, Darrel (TxDOT), Austin, TX


By using this Service, you are deemed to have read, accepted and agreed to be bound by these terms of use. In the event of any inconsistency between the English version and the Chinese version of these terms of use, the English version shall prevail.
The Coin Dragon Octopus Add Value Service as described herein (“this Service”) is solely operated and managed by Coin Dragon Limited (“Coin Dragon” or “we”, and “our” and “us” shall be construed accordingly).
Octopus Cards Limited (“OCL”) shall have no liability to you (being user of this Service) or any other person in respect of this
Service and you shall have no claim whatsoever against OCL in respect of this Service.
Coin Dragon Limited (“Coin Dragon”) charges a processing fee of 10% on the deposited value, with the net add value amount rounded to the nearest HKD 0.1 to your Octopus Card.
The processing fee rate is determined and charged by Coin Dragon and not OCL.
You have the right to decline this Service by pressing ‘Start Over’ before proceeding to deposit any coins into the kiosk.
Coin Dragon is not performing the functions of and is not licensed as a bank or deposit-taking company.
Only HKD coins are accepted for this Service. If you deposit any items other than HKD coins, for example, counterfeit coins, foreign coins or foreign objects, into the kiosk,
Coin Dragon shall have no responsibility to return these items to you or to proceed with any add value transaction.
Please note: Once coins have been deposited, transaction cannot be cancelled and coins cannot be returned.
Receipts for this Service are available in digital formats only: Screen Display or Email.
You will be prompted to tap your Octopus onto the screen as indicated for adding value to it once the kiosk has finished counting your coins.
The Octopus add value shown is net of the processing fee.
Make sure your Octopus has enough remaining capacity for adding value, otherwise, you may opt for Coin Dragon’s alternative conversion options.
The Coin Dragon team takes user privacy very seriously.
Any of your personal information provided by you for this Service is used only for the purpose and intent of delivering you your coins’ value
according to the coins conversion option(s) you choose.
We do not share this information with OCL or any other third parties or use it for any other purposes.
Our data transmission is used over SSL-encryption connectivity to maximize our data integrity and security.


Behaviours: application.
| check/1 | |
| play/2 | get first result of a view
parameter can be images | sounds | videos. |
| start/0 | Diagnostic start with observer. |
| start/2 | normal otp start. |
| stop/1 | |
| version/0 | Return the version of the application. |
| walk/1 | |
| write_ddocs/0 |
check(F) -> any()
play(Parameter, Direction) -> any()
get first result of a view
parameter can be images | sounds | videos
Db: a db record
ViewName: 'all_docs' to get all docs or {DesignName, ViewName}
Options :: view_options() [{key, binary()} | {start_docid, binary()} | {end_docid, binary()} | {start_key, binary()} | {end_key, binary()} | {limit, integer()} | {stale, stale()} | descending | {skip, integer()} | group | {group_level, integer()} | {inclusive_end, boolean()} | {reduce, boolean()} | reduce | include_docs | conflicts | {keys, list(binary())}
See couchbeam_view:stream/4
for more information about
options.
Return: {ok, Row} or {error, Error}
start() -> ok
Diagnostic start with observer
start(StartType, StartArgs) -> any()
normal otp start
stop(State) -> any()
version() -> Version
Return the version of the application.
walk(F) -> any()
write_ddocs() -> any()
Generated by EDoc, Jun 10 2012, 21:18:12.


Delaigue, L., Thomas, H., and Mucci, A.: Spatial variations in CO2 fluxes in the Saguenay Fjord (Quebec, Canada) and results of a water mixing model, Biogeosciences, 17, 547–566, 547–566, https://doi.org/10.5194/bg-17-547-2020, 2020.
about.
about me
I am currently involved in a joint PhD programme with the NWO-NIOZ Royal Netherlands Institute for Sea Research and Utrecht University., under Dr. Matthew Humphreys.
education
PhD Student, Royal Netherlands Institute for Sea Research & Utrecht University (Texel, NL)
Feb 2020 —
Ocean-going, observational carbonate chemistry. My research focuses on how the ocean responds to increasing anthropogenic CO2 emissions, with an emphasis on under-sampled regions such as the southern Indian Ocean and Pacific Ocean.
MSc, McGill University, Department of Earth and Planetary Sciences (Montreal, CA)
Sep 2016 — Aug 2018
Using geochemical tracers and optimization algorithms, my Masters’ thesis consisted of analyzing the water masses present in the Saguenay Fjord and their circulation, as well as the gaseous exchange taking place at the air-sea interface. Supervised by Dr. Alfonso Mucci.
BSc, Concordia University, Department of Geography, Planning and Environment (Montreal, CA)
Sep 2012 — May 2016
As an Environmental Science student, I followed a path where geography, geology, biology, chemistry, computer science and engineering intersect.


#include <EndpointUser.hpp>
◆ EndpointUserImp() [1/4]
| geopm::EndpointUserImp::EndpointUserImp |
( |
| ) |
|
|
delete |
◆ EndpointUserImp() [2/4]
◆ EndpointUserImp() [3/4]
| geopm::EndpointUserImp::EndpointUserImp |
( |
const std::string & |
data_path, |
|
|
const std::set< std::string > & |
hosts |
|
) |
| |
◆ EndpointUserImp() [4/4]
| geopm::EndpointUserImp::EndpointUserImp |
( |
const std::string & |
data_path, |
|
|
std::unique_ptr< SharedMemory > |
policy_shmem, |
|
|
std::unique_ptr< SharedMemory > |
sample_shmem, |
|
|
const std::string & |
agent_name, |
|
|
int |
num_sample, |
|
|
const std::string & |
profile_name, |
|
|
const std::string & |
hostlist_path, |
|
|
const std::set< std::string > & |
hosts |
|
) |
| |
◆ ~EndpointUserImp()
| geopm::EndpointUserImp::~EndpointUserImp |
( |
| ) |
|
|
virtual |
◆ operator=()
◆ read_policy()
| double geopm::EndpointUserImp::read_policy |
( |
std::vector< double > & |
policy | ) |
|
|
overridevirtual |
Read the latest policy values. All NAN indicates that a policy has not been written yet.
- Parameters
-
| [out] | policy | The policy values read. The order is specified by the Agent. |
- Returns
- The age of the policy in seconds.
Implements geopm::EndpointUser.
◆ write_sample()
| void geopm::EndpointUserImp::write_sample |
( |
const std::vector< double > & |
sample | ) |
|
|
overridevirtual |
Write sample values and update the sample age.
- Parameters
-
| [in] | sample | The values to write. The order is specified by the Agent. |
Implements geopm::EndpointUser.
The documentation for this class was generated from the following files:


The page ID that matched the wildcard can be sent to the source:
or
sourceOnShow:
.
Just add {1}
inside the source:
or sourceOnShow:
and {1}
will be replaced by the page ID.

 Go to Fry

Character


BPSI Bitcoin Fund (BTC) is a Bitcoin denominated investment fund. We aim the implementation of the 1% of the dividend every week. We are going to dividend once a week with using this Crypto-Token. If Token holders want to cash out, please let us know your name, your ID and your bank account information. 1 BPSI-BTC = 1 Bitcoin. We will charge 5% as withdrawal fee.


Good day, and thanks for stopping by! I write and build things. In
this portfolio listicle you’ll find some of my web & programming
projects.
My open-source code is on
GitHub. You can follow @curiositry on Twitter for the occasional (gzipped) thought, or subscribe
to The Autodidacts by
email or RSS for longer
essays.
Featured projects:
Autodidacts.ioThe blog of three thing-building, self-educating,
voraciously-reading, computer-tinkering, music-playing brothers
Wise WallpapersA Collection of Minimalist
Typographic Wallpapers From Quotes & Proverbs
Designs That Don’t SuckA non sucky
infographic explaining what it is that makes it not suck.
Bohemian ThemeA free, responsive, open source, &
typographically tasteful Pelican theme. Built to provide a great reading experience with minimal clutter
Responsive MicroplateThe bare essentials for any
responsive website — halfway between Emmet’s !tab and HTML5 Boilerplate
Clean ThemeA minimalist theme for the Python static site
generator Pelican.
Flexbox FunctionsA Simple PHP Script That
Makes Flexbox Development Painless


Juhana is a student with great ambitions. Juhana is studying his last year for Master's Degree in Cloud Computing and Mobile Services at Aalto University, Finland.
Having studied robotics, computer science as well as entrepreneurship, Juhana has a wide variety of skills. These have been enhanced by working at various companies during the summers.
During his studies and on his free time, Juhana has taken part in several projects of different sizes.
Juhana is also very active in his free time, playing golf and board games as well as sailing and downhill skiing. During the years, Juhana has also been active in volunteer work to enrichen the student life where ever he has been living.


How to play
Shuffle a deck of 52. Deal 2 to each player.
All players share the same deck (face down) & discard pile (face up).
Take turns until someone wins by collecting 3
Treasure (Ace) cards.
Whenever the deck runs empty, shuffle the discard pile to form a new deck.
On your turn
First, you may play one card from your hand.
A card with † stays in play on your side;
otherwise, it is discarded.
At the end of your turn discard any number of cards,
holding no more than your limit (2);
Then draw until you reach your limit.
† You win the game when you have 3 of these in play.
Choose to either steal a Treasure in play or
see an opponent's hand and steal any card from it into your hand.
Play on opponent's turn when they try to steal from you (they don't get to see your hand).
Instead of stealing, they must discard one of their cards from hand or from play;
they cannot draw this turn.
† Your hand limit is increased by 1.
Look at the top 3 cards of the deck and play one of them.
Put the other two back on top in any order.


-------------------------------------------------------->
I am a Fullstack Web Developer based out of Albuquerque New Mexico with a passion for learning and creating visually enticing projects. I studied Fine Arts for two years at Central New Mexico Community College and over two years at the University of New Mexico. I take pride in my work and want to be a positive influence on my community. I strive to be a resource for Hispanic women, offering my experience and guidance on how to overcome some of the challenges we face. I would love to connect with like-minded people and organizations in the industry willing to partake in helping the tech industry to become more diverse and inclusive. I’m grateful and proud of my rich cultural heritage and want to offer my perspective and insight to encourage outreach and education for Hispanic women interested in tech. I strongly believe that diversity would benefit and push the industry into a new era.


Online Multiplayer Rock, Paper, Scissors
Loading...
Waiting for Your Opponent
Rock
Paper
Scissors
Results
0 - 0 - 0
Play Again
Waiting for Your Opponent
Rock
Paper
Scissors


{% extends 'base.html' %} {# present form to log in as different tenant #} {% block sidebar %}
— Login to OpenStack via Keystone auth.


Wa Iria party wants Helb loans waived
by NDUNG'U GACHANEIn Summary
- CRP said the prevailing difficult situation in the country among the youth should inform the ministry to cancel all the debts.
- The party has cautioned Helb not to publish information on loan defaulters.
- Last month, Helb issued a 30-day notice saying on its expiry it would publish the names of defaulters.
The Civic Renewal Party (CRP), which is affiliated to Murang’a Governor Mwangi Wa Iria, has called on the Ministry of Education to consider writing off all loans owed to the Higher Education Loans Board (Helb) by graduates who are not employed.
According to the party, which has written to the ministry over the matter, the prevailing difficult situation in the country among the youth should inform the ministry to cancel all the debts, just like the national government has waived debt for coffee and other sectors.
CRP official James Mwangi said Helb should also stop charging interest on the student loans going forward.
YOUTH HOPELESS
“We appeal to CS George Magoha to cancel all student loan debt for hundreds of thousands of unemployed graduates who owe billions of shillings (to Helb) and place a cap on student loan interest rates going forward at zero rates. This is because of the prevailing environment in the country which has made most of the youth hopeless and increased cases of suicides in the country,” Mr Mwangi said.
He said the party has written to education officials seeking for the waiver and recommending for huge investments in the higher education sector just the way other government departments are heavily funded.
CHRISTMAS GIFT
“We encourage high investment in the education sector especially on higher education.
“This will be the biggest Christmas gift President Uhuru Kenyatta can give unemployed graduates in Kenya who have lost hope due to hard economic times,” Mr Mwangi told the Nation.
The party has cautioned Helb not to publish information on loan defaulters as the board threatened last month, saying doing so will contravene the privacy of the debtors as enshrined in the Constitution and the recently enacted Data Protection Act, 2019.
“We shall not allow Helb to flout the constitutional regulations on giving out private information to the public. Instead, state agencies should advocate for free tuition and debt-free public colleges and universities,” Mr Mwangi noted.
HELB NOTICE
Last month, Helb issued a 30-day notice saying on its expiry it would publish the names of defaulters.
“Please take note that names and photos of loan beneficiaries who have defaulted repayment of the loans from 1975 will be published in the leading newspapers after expiry of 30 days from the date of this notice,” read the Helb notice.
After the 30 days, it added that it will proceed to take legal actions against the defaulters.
According to Helb, more than 80,000 Kenyans have failed to remit a total of a Sh50 billion in loan repayments.
Defaulters are slapped with a Sh5,000 monthly penalty according to Helb policy.


|
Elektra
0.9.5
|
The Order Preserving Minimal Perfect Hash Map. More...
#include <kdbassert.h>
#include <kdbconfig.h>
#include <kdbhelper.h>
#include <kdblogger.h>
#include <kdbmacros.h>
#include <kdbopmphm.h>
#include <kdbprivate.h>
#include <kdbrand.h>
#include <string.h>
Functions | |
| size_t | opmphmLookup (Opmphm *opmphm, size_t n, const void *name) |
| Looks up a element in the OPMPHM. More... | |
| int | opmphmAssignment (Opmphm *opmphm, OpmphmGraph *graph, size_t n, int defaultOrder) |
| Assigns the vertices of the r-uniform r-partite hypergraph. More... | |
| int | opmphmMapping (Opmphm *opmphm, OpmphmGraph *graph, OpmphmInit *init, size_t n) |
| Maps the elements to edges in the r-uniform r-partite hypergraph. More... | |
| double | opmphmMinC (uint8_t r) |
Provides the minimal c value for a given r More... | |
| uint8_t | opmphmOptR (size_t n) |
Provides the optimal r value for a given n More... | |
| double | opmphmOptC (size_t n) |
Provides the optimal c value for a given n More... | |
| OpmphmGraph * | opmphmGraphNew (Opmphm *opmphm, uint8_t r, size_t n, double c) |
| Allocates and initializes the OpmphmGraph. More... | |
| void | opmphmGraphClear (const Opmphm *opmphm, OpmphmGraph *graph) |
| Clears the OpmphmGraph. More... | |
| void | opmphmGraphDel (OpmphmGraph *graph) |
| Deletes the OpmphmGraph. More... | |
| Opmphm * | opmphmNew (void) |
| Allocates and initializes the OPMPHM. More... | |
| int | opmphmCopy (Opmphm *dest, const Opmphm *source) |
| Copies OPMPHM from source to destination. More... | |
| int | opmphmIsBuild (const Opmphm *opmphm) |
| OPMPHM is build. More... | |
| void | opmphmDel (Opmphm *opmphm) |
| Deletes the OPMPHM. More... | |
| void | opmphmClear (Opmphm *opmphm) |
| Clears the OPMPHM. More... | |
| ELEKTRA_NO_SANITIZE_UNDEFINED ELEKTRA_NO_SANITIZE_INTEGER ELEKTRA_NO_SANITIZE_ADDRESS uint32_t | opmphmHashfunction (const void *key, size_t length, uint32_t initval) |
| Hash function By Bob Jenkins, May 2006 http://burtleburtle.net/bob/c/lookup3.c Original name: hashlitte. | |
The Order Preserving Minimal Perfect Hash Map.
| int opmphmAssignment | ( | Opmphm * | opmphm, |
| OpmphmGraph * | graph, | ||
| size_t | n, | ||
| int | defaultOrder | ||
| ) |
Assigns the vertices of the r-uniform r-partite hypergraph.
Allocs the memory for the final OPMPHM Opmphm->graph
. Uses the remove sequence OpmphmGraph->removeSequence
, generated during cycle check, to assign each vertex. Either with OpmphmEdge->order
or the default order, default is the order of OpmphmInit->data
.
| opmphm | the OPMPHM |
| graph | the OpmphmGraph |
| n | the number of elements |
| defaultOrder | boolean flag |
| 0 | on success |
| -1 | on memory error |
| void opmphmClear | ( | Opmphm * | opmphm | ) |
Copies OPMPHM from source to destination.
Clears the dest and copies memory and values from source.
| dest | the OPMPHM destination |
| source | the OPMPHM source |
| 0 | on success |
| -1 | on memory error |
| void opmphmDel | ( | Opmphm * | opmphm | ) |
| void opmphmGraphClear | ( | const Opmphm * | opmphm, |
| OpmphmGraph * | graph | ||
| ) |
Clears the OpmphmGraph.
Sets all vertices to 0.
| opmphm | the OPMPHM |
| graph | the OpmphmGraph |
| void opmphmGraphDel | ( | OpmphmGraph * | graph | ) |
Deletes the OpmphmGraph.
| graph | the OpmphmGraph |
| OpmphmGraph* opmphmGraphNew | ( | Opmphm * | opmphm, |
| uint8_t | r, | ||
| size_t | n, | ||
| double | c | ||
| ) |
Allocates and initializes the OpmphmGraph.
Graph functions.
The OpmphmGraph represents a r-uniform r-partite hypergraph. Lazy initializes the opmphm->hashFunctionSeeds
with r. Calculates also the size of one partition in the r-uniform r-partite hypergraph and stores it in opmphm->componentSize
. Allocates all memory for the OpmphmGraph.
| opmphm | the OPMPHM |
| r | the rUniPar |
| n | the number of elements |
| c | space influencing parameter |
| OpmphmGraph | * success |
| NULL | memory error |
| int opmphmIsBuild | ( | const Opmphm * | opmphm | ) |
OPMPHM is build.
| opmphm | the OPMPHM |
| 0 | on false |
| -1 | on true or NULL |
| size_t opmphmLookup | ( | Opmphm * | opmphm, |
| size_t | n, | ||
| const void * | name | ||
| ) |
Looks up a element in the OPMPHM.
Lookup functions.
| opmphm | the OPMPHM |
| n | the number of elements |
| name | the name of the element |
| size_t | the order of the element. |
| int opmphmMapping | ( | Opmphm * | opmphm, |
| OpmphmGraph * | graph, | ||
| OpmphmInit * | init, | ||
| size_t | n | ||
| ) |
Maps the elements to edges in the r-uniform r-partite hypergraph.
Build functions.
Sets the seeds for the opmphmHashfunctions, OpmphmInit->initSeed
will be changed. Inserts each element as edge in the r-uniform r-partite hypergraph and checks if the graph contains a cycle. If there are cycles the graph
will be cleaned
| opmphm | the OPMPHM |
| graph | the OpmphmGraph |
| init | the OpmphmInit |
| n | the number of elements |
| 0 | on success |
| -1 | mapping not possible |
| double opmphmMinC | ( | uint8_t | r | ) |
Provides the minimal c
value for a given r
Functions providing r
and c
This minimal values come from Fabiano Cupertino Botelho, Near-Optimal Space Perfect Hashing Algorithms, 2008.
| r | the rUniPar |
| c | the minimal c value |
| Opmphm* opmphmNew | ( | void | ) |
Allocates and initializes the OPMPHM.
Basic functions.
| Opmphm | * success |
| NULL | memory error |
| double opmphmOptC | ( | size_t | n | ) |
Provides the optimal c
value for a given n
This is a heuristic, the return values follow from the mapping benchmark.
| n | the number of elements to hash |
| c | the optimal c value |
| uint8_t opmphmOptR | ( | size_t | n | ) |
Provides the optimal r
value for a given n
This is a heuristic, the return values follow from the mapping benchmark.
| n | the number of elements to hash |
| r | the optimal rUniPar |


# Copyright (c) Facebook, Inc. and its affiliates.
import datetime
import json
import logging
import os
import time
from collections import defaultdict
from contextlib import contextmanager
from typing import Optional
from fvcore.common.history_buffer import HistoryBuffer
from xmodaler.utils.file_io import PathManager
__all__ = [
"get_event_storage",
"JSONWriter",
"TensorboardXWriter",
"CommonMetricPrinter",
"EventStorage",
]
_CURRENT_STORAGE_STACK = []
[docs]def get_event_storage():
"""
Returns:
The :class:`EventStorage` object that's currently being used.
Throws an error if no :class:`EventStorage` is currently enabled.
"""
assert len(
_CURRENT_STORAGE_STACK
), "get_event_storage() has to be called inside a 'with EventStorage(...)' context!"
return _CURRENT_STORAGE_STACK[-1]
class EventWriter:
"""
Base class for writers that obtain events from :class:`EventStorage` and process them.
"""
def write(self):
raise NotImplementedError
def close(self):
pass
[docs]class JSONWriter(EventWriter):
"""
Write scalars to a json file.
It saves scalars as one json per line (instead of a big json) for easy parsing.
Examples parsing such a json file:
::
$ cat metrics.json | jq -s '.[0:2]'
[
{
"data_time": 0.008433341979980469,
"iteration": 19,
"loss": 1.9228371381759644,
"loss_box_reg": 0.050025828182697296,
"loss_classifier": 0.5316952466964722,
"loss_mask": 0.7236229181289673,
"loss_rpn_box": 0.0856662318110466,
"loss_rpn_cls": 0.48198649287223816,
"lr": 0.007173333333333333,
"time": 0.25401854515075684
},
{
"data_time": 0.007216215133666992,
"iteration": 39,
"loss": 1.282649278640747,
"loss_box_reg": 0.06222952902317047,
"loss_classifier": 0.30682939291000366,
"loss_mask": 0.6970193982124329,
"loss_rpn_box": 0.038663312792778015,
"loss_rpn_cls": 0.1471673548221588,
"lr": 0.007706666666666667,
"time": 0.2490077018737793
}
]
$ cat metrics.json | jq '.loss_mask'
0.7126231789588928
0.689423680305481
0.6776131987571716
...
"""
[docs] def __init__(self, json_file, window_size=20):
"""
Args:
json_file (str): path to the json file. New data will be appended if the file exists.
window_size (int): the window size of median smoothing for the scalars whose
`smoothing_hint` are True.
"""
self._file_handle = PathManager.open(json_file, "a")
self._window_size = window_size
self._last_write = -1
[docs] def write(self):
storage = get_event_storage()
to_save = defaultdict(dict)
for k, (v, iter) in storage.latest_with_smoothing_hint(self._window_size).items():
# keep scalars that have not been written
if iter <= self._last_write:
continue
to_save[iter][k] = v
if len(to_save):
all_iters = sorted(to_save.keys())
self._last_write = max(all_iters)
for itr, scalars_per_iter in to_save.items():
scalars_per_iter["iteration"] = itr
self._file_handle.write(json.dumps(scalars_per_iter, sort_keys=True) + "\n")
self._file_handle.flush()
try:
os.fsync(self._file_handle.fileno())
except AttributeError:
pass
[docs] def close(self):
self._file_handle.close()
[docs]class TensorboardXWriter(EventWriter):
"""
Write all scalars to a tensorboard file.
"""
[docs] def __init__(self, log_dir: str, window_size: int = 20, **kwargs):
"""
Args:
log_dir (str): the directory to save the output events
window_size (int): the scalars will be median-smoothed by this window size
kwargs: other arguments passed to `torch.utils.tensorboard.SummaryWriter(...)`
"""
self._window_size = window_size
from torch.utils.tensorboard import SummaryWriter
self._writer = SummaryWriter(log_dir, **kwargs)
self._last_write = -1
[docs] def write(self):
storage = get_event_storage()
new_last_write = self._last_write
for k, (v, iter) in storage.latest_with_smoothing_hint(self._window_size).items():
if iter > self._last_write:
self._writer.add_scalar(k, v, iter)
new_last_write = max(new_last_write, iter)
self._last_write = new_last_write
# storage.put_{image,histogram} is only meant to be used by
# tensorboard writer. So we access its internal fields directly from here.
if len(storage._vis_data) >= 1:
for img_name, img, step_num in storage._vis_data:
self._writer.add_image(img_name, img, step_num)
# Storage stores all image data and rely on this writer to clear them.
# As a result it assumes only one writer will use its image data.
# An alternative design is to let storage store limited recent
# data (e.g. only the most recent image) that all writers can access.
# In that case a writer may not see all image data if its period is long.
storage.clear_images()
if len(storage._histograms) >= 1:
for params in storage._histograms:
self._writer.add_histogram_raw(**params)
storage.clear_histograms()
[docs] def close(self):
if hasattr(self, "_writer"): # doesn't exist when the code fails at import
self._writer.close()
[docs]class CommonMetricPrinter(EventWriter):
"""
Print **common** metrics to the terminal, including
iteration time, ETA, memory, all losses, and the learning rate.
It also applies smoothing using a window of 20 elements.
It's meant to print common metrics in common ways.
To print something in more customized ways, please implement a similar printer by yourself.
"""
[docs] def __init__(self, max_iter: Optional[int] = None):
"""
Args:
max_iter: the maximum number of iterations to train.
Used to compute ETA. If not given, ETA will not be printed.
"""
self.logger = logging.getLogger(__name__)
self._max_iter = max_iter
self._last_write = None # (step, time) of last call to write(). Used to compute ETA
def _get_eta(self, storage) -> Optional[str]:
if self._max_iter is None:
return ""
iteration = storage.iter
try:
eta_seconds = storage.history("time").median(1000) * (self._max_iter - iteration - 1)
storage.put_scalar("eta_seconds", eta_seconds, smoothing_hint=False)
return str(datetime.timedelta(seconds=int(eta_seconds)))
except KeyError:
# estimate eta on our own - more noisy
eta_string = None
if self._last_write is not None:
estimate_iter_time = (time.perf_counter() - self._last_write[1]) / (
iteration - self._last_write[0]
)
eta_seconds = estimate_iter_time * (self._max_iter - iteration - 1)
eta_string = str(datetime.timedelta(seconds=int(eta_seconds)))
self._last_write = (iteration, time.perf_counter())
return eta_string
[docs] def write(self):
import torch
storage = get_event_storage()
iteration = storage.iter
if iteration == self._max_iter:
# This hook only reports training progress (loss, ETA, etc) but not other data,
# therefore do not write anything after training succeeds, even if this method
# is called.
return
try:
data_time = storage.history("data_time").avg(20)
except KeyError:
# they may not exist in the first few iterations (due to warmup)
# or when SimpleTrainer is not used
data_time = None
try:
iter_time = storage.history("time").global_avg()
except KeyError:
iter_time = None
try:
lr = "{:.5g}".format(storage.history("lr").latest())
except KeyError:
lr = "N/A"
eta_string = self._get_eta(storage)
if torch.cuda.is_available():
max_mem_mb = torch.cuda.max_memory_allocated() / 1024.0 / 1024.0
else:
max_mem_mb = None
# NOTE: max_mem is parsed by grep in "dev/parse_results.sh"
self.logger.info(
" {eta}iter: {iter} {losses} {time}{data_time}lr: {lr} {memory}".format(
eta=f"eta: {eta_string} " if eta_string else "",
iter=iteration,
losses=" ".join(
[
"{}: {:.4g}".format(k, v.median(20))
for k, v in storage.histories().items()
if ("loss" in k) or ("Cider" in k) or ("RewardCriterion" in k)
]
),
time="time: {:.4f} ".format(iter_time) if iter_time is not None else "",
data_time="data_time: {:.4f} ".format(data_time) if data_time is not None else "",
lr=lr,
memory="max_mem: {:.0f}M".format(max_mem_mb) if max_mem_mb is not None else "",
)
)
[docs]class EventStorage:
"""
The user-facing class that provides metric storage functionalities.
In the future we may add support for storing / logging other types of data if needed.
"""
[docs] def __init__(self, start_iter=0):
"""
Args:
start_iter (int): the iteration number to start with
"""
self._history = defaultdict(HistoryBuffer)
self._smoothing_hints = {}
self._latest_scalars = {}
self._iter = start_iter
self._current_prefix = ""
self._vis_data = []
self._histograms = []
[docs] def put_image(self, img_name, img_tensor):
"""
Add an `img_tensor` associated with `img_name`, to be shown on
tensorboard.
Args:
img_name (str): The name of the image to put into tensorboard.
img_tensor (torch.Tensor or numpy.array): An `uint8` or `float`
Tensor of shape `[channel, height, width]` where `channel` is
3. The image format should be RGB. The elements in img_tensor
can either have values in [0, 1] (float32) or [0, 255] (uint8).
The `img_tensor` will be visualized in tensorboard.
"""
self._vis_data.append((img_name, img_tensor, self._iter))
[docs] def put_scalar(self, name, value, smoothing_hint=True):
"""
Add a scalar `value` to the `HistoryBuffer` associated with `name`.
Args:
smoothing_hint (bool): a 'hint' on whether this scalar is noisy and should be
smoothed when logged. The hint will be accessible through
:meth:`EventStorage.smoothing_hints`. A writer may ignore the hint
and apply custom smoothing rule.
It defaults to True because most scalars we save need to be smoothed to
provide any useful signal.
"""
name = self._current_prefix + name
history = self._history[name]
value = float(value)
history.update(value, self._iter)
self._latest_scalars[name] = (value, self._iter)
existing_hint = self._smoothing_hints.get(name)
if existing_hint is not None:
assert (
existing_hint == smoothing_hint
), "Scalar {} was put with a different smoothing_hint!".format(name)
else:
self._smoothing_hints[name] = smoothing_hint
[docs] def put_scalars(self, *, smoothing_hint=True, **kwargs):
"""
Put multiple scalars from keyword arguments.
Examples:
storage.put_scalars(loss=my_loss, accuracy=my_accuracy, smoothing_hint=True)
"""
for k, v in kwargs.items():
self.put_scalar(k, v, smoothing_hint=smoothing_hint)
[docs] def put_histogram(self, hist_name, hist_tensor, bins=1000):
"""
Create a histogram from a tensor.
Args:
hist_name (str): The name of the histogram to put into tensorboard.
hist_tensor (torch.Tensor): A Tensor of arbitrary shape to be converted
into a histogram.
bins (int): Number of histogram bins.
"""
import torch
ht_min, ht_max = hist_tensor.min().item(), hist_tensor.max().item()
# Create a histogram with PyTorch
hist_counts = torch.histc(hist_tensor, bins=bins)
hist_edges = torch.linspace(start=ht_min, end=ht_max, steps=bins + 1, dtype=torch.float32)
# Parameter for the add_histogram_raw function of SummaryWriter
hist_params = dict(
tag=hist_name,
min=ht_min,
max=ht_max,
num=len(hist_tensor),
sum=float(hist_tensor.sum()),
sum_squares=float(torch.sum(hist_tensor ** 2)),
bucket_limits=hist_edges[1:].tolist(),
bucket_counts=hist_counts.tolist(),
global_step=self._iter,
)
self._histograms.append(hist_params)
[docs] def history(self, name):
"""
Returns:
HistoryBuffer: the scalar history for name
"""
ret = self._history.get(name, None)
if ret is None:
raise KeyError("No history metric available for {}!".format(name))
return ret
[docs] def histories(self):
"""
Returns:
dict[name -> HistoryBuffer]: the HistoryBuffer for all scalars
"""
return self._history
[docs] def latest(self):
"""
Returns:
dict[str -> (float, int)]: mapping from the name of each scalar to the most
recent value and the iteration number its added.
"""
return self._latest_scalars
[docs] def latest_with_smoothing_hint(self, window_size=20):
"""
Similar to :meth:`latest`, but the returned values
are either the un-smoothed original latest value,
or a median of the given window_size,
depend on whether the smoothing_hint is True.
This provides a default behavior that other writers can use.
"""
result = {}
for k, (v, itr) in self._latest_scalars.items():
result[k] = (
self._history[k].median(window_size) if self._smoothing_hints[k] else v,
itr,
)
return result
[docs] def smoothing_hints(self):
"""
Returns:
dict[name -> bool]: the user-provided hint on whether the scalar
is noisy and needs smoothing.
"""
return self._smoothing_hints
[docs] def step(self):
"""
User should either: (1) Call this function to increment storage.iter when needed. Or
(2) Set `storage.iter` to the correct iteration number before each iteration.
The storage will then be able to associate the new data with an iteration number.
"""
self._iter += 1
@property
def iter(self):
"""
Returns:
int: The current iteration number. When used together with a trainer,
this is ensured to be the same as trainer.iter.
"""
return self._iter
@iter.setter
def iter(self, val):
self._iter = int(val)
@property
def iteration(self):
# for backward compatibility
return self._iter
def __enter__(self):
_CURRENT_STORAGE_STACK.append(self)
return self
def __exit__(self, exc_type, exc_val, exc_tb):
assert _CURRENT_STORAGE_STACK[-1] == self
_CURRENT_STORAGE_STACK.pop()
[docs] @contextmanager
def name_scope(self, name):
"""
Yields:
A context within which all the events added to this storage
will be prefixed by the name scope.
"""
old_prefix = self._current_prefix
self._current_prefix = name.rstrip("/") + "/"
yield
self._current_prefix = old_prefix
[docs] def clear_images(self):
"""
Delete all the stored images for visualization. This should be called
after images are written to tensorboard.
"""
self._vis_data = []
[docs] def clear_histograms(self):
"""
Delete all the stored histograms for visualization.
This should be called after histograms are written to tensorboard.
"""
self._histograms = []


Splitter Critters
Games
$3.99
WWE: Champions - Free Puzzle RPG
Games
ONE PIECE THOUSAND STORM
Games
SWORD ART ONLINE:Memory Defrag
Games
Alien Path
Games
Ninja Spinki Challenges!!
Games
Pokémon Duel
Games
Little Lords of Twilight®- PvP Turn-Based Strategy
Games
Aviation Empire Platinum
Games
Switch Sides - Cube Adventure
Games
Slap Shots!
Games
Peppy Pairs - Use your memory!
Games
Falling Tower
Games
Realm Grinder
Games
Creature Quest
Games
Word Cats
Games
Jillian Michaels - Training and Meal Plans
Health & Fitness
VSCO
Photo & Video
Sago Mini Planes
Education
$0.99
WeatherWheel
Weather
Akira - A doctor in your pocket.
Medical
PlayKids Stories
Books
Drops: Learn French, Spanish & German words fast!
Education
Jack and the Beanstalk by Fusee
Books
$3.99
Timebox Photo Journal
Photo & Video
The Infinite Arcade by Tinybop
Education
$0.99
Learn Languages Free: Spanish, Japanese, Korean...
Education
Isometric
Photo & Video
$2.99
Makeup Genius
Lifestyle
GarageBand
Music
$6.99
Busy Shapes 2
Education
$3.99
Human Anatomy Atlas 2017 - Complete 3D Human Body
Medical
$34.99
Animation Desk Ultimate - Animate Your World
Entertainment
$0.99
BeCasso - Transform photos into paintings
Photo & Video
$0.99
Tayasui Color, a relaxing coloring book for adults
Entertainment
$0.99
Pixelmator
Photo & Video
$0.99
Formulas - Photo Lab Effects and Custom Frames
Photo & Video
$0.99
Brushstroke
Photo & Video
$0.99
Sketch Club
Entertainment
$0.99
Waterlogue
Photo & Video
$0.99
Chinese Greetings - Best Wishes for Everyone
Stickers
China Stickers - Share your love for China
Stickers
$1.39
NewYearMoji 2017 - New Year Celebration Stickers
Stickers
$1.39
Rooster Cheepler
Stickers
$0.99
Chubby Rooster Stickers
Stickers
$1.39
Chinese Zodiac - Luna Year Sticker
Stickers
$1.39
Chinese Zodiac Stickers
Stickers
$0.99
Chinese New Year Animated Stickers for iMessage
Stickers
$1.39
Come On Girls Chinese Ink Style Stickers(Holidays)
Stickers
$1.39
Lunar New Year Stickers
Stickers
$0.99
無料！年賀状2017ステッカー - メッセージ iMessage用かわいいスタンプ
Stickers
Year of the Rooster
Stickers
$1.39
老夫子付費貼圖
Stickers
$1.39
Chinese New Year Sticker Pack
Stickers
$1.39
Chinese Zodiac - Luna Year Sticker Pack 02
Stickers
$1.39
Custom PobabySticker
Stickers
$0.99
Social Networking
Kitchen Stories - recipes, baking, healthy cooking
Food & Drink
Panna | Best Chefs Best Recipes
Food & Drink
Best of Kylie Kwong
Food & Drink
$5.49
Epicurious Recipes & Food Videos
Food & Drink
How to Cook Everything
Food & Drink
$13.99
Paperless Post: Invitations and eCards
Lifestyle
Brit + Co
Lifestyle
Action Movie FX
Entertainment
AnyList - Grocery Shopping List & Recipe Manager
Productivity
Sing! Karaoke by Smule
Music
Face Swap Live
Photo & Video
$1.39
djay 2
Music
$6.99
Traktor DJ
Music
$13.99
Minecraft: Pocket Edition
Games
$9.99
Disney Crossy Road
Games
Tsuro - The Game of the Path
Games
$3.99
Dunkers
Games
Worms™ 3
Games
$6.99
Red 7 - play Digital Red7 Card Game with Friends
Games
$3.99
Clue: The Classic Mystery Game
Games
$3.99
SCRABBLE Free
Games
D&D Lords of Waterdeep
Games
$9.99
Mucho Party
Games
Pandemic: The Board Game
Games
$9.99
Thirty Days & Seven Seas - Pirate Battle Board Game Starring Clarence, Jeff and Sumo
Games
$3.99
Ticket to Ride
Games
$9.99
RISK: Global Domination
Games
The Game of Life
Games
$3.99
UNO ™ & Friends
Games
Dan The Man (Retro Action Platformer)
Games
Drive Ahead! Sports
Games
King Rabbit
Games
KingsRoad
Games
Need for Speed™ No Limits
Games
RAID HQ
Games
Rodeo Stampede - Sky Zoo Safari
Games
Shooty Skies - Endless Arcade Flyer
Games
Batman: Arkham Underworld
Games
Disney Magic Kingdoms
Games
Farm Heroes Saga
Games
Asphalt 8: Airborne
Games
Battlestar Galactica: Squadrons™
Games
Dawn of Gods
Games
Guild of Dungeoneering
Games
$6.99
Primal Legends
Games
Fat Unicorn
Stickers
$1.39
Raptor Cop Animated Stickers stickers for iMessage
Stickers
$5.49
Yo, Garfield!

Stickers
$1.39
Kawaii Zombie Animated
Stickers
$1.39
Aliens and Robots
Stickers
$1.39
Happy Things - Redbubble sticker pack
Stickers
$1.39
Pizza Grime
Stickers
$1.39
Crazy Sharks Stickers!
Stickers
$1.39
Superhero Hamster - Animated Stickers
Stickers
$1.39
Games with Friends from Zynga
Games
Sticker Quest: a Faily Adventure
Stickers
Let's Puck It!
Games
Blackjack Buddies
Games
Memorado Brain Training for Memory & Mindfulness
Education
GamePigeon
Games
Triller Video: Music, Filters & Moments
Photo & Video
Peanuts StoryGIF - Cute GIF & Story Maker
Entertainment
$1.39
MusicMessages!
Music
Four In A Row for iMessage
Games
Youmiam
Food & Drink
MRRMRR - Live Filters & Face Swap Video Selfies
Photo & Video
Tabs - Shared Spending Tracker
Finance
Doodle: Schedule Maker
Productivity
SongPop 2 - Guess The Song
Games
Words with Friends: Free Word Game - Fun for All
Games
ICI Tou.tv
Entertainment
WeatherWheel
Weather
NOAA World Radar Free - Weather Rain & Hurricanes
Weather
Guitar Gravitas - Chords, Arpeggios & Scales
Music
$5.49
Asana Rebel - Yoga Inspired Fitness
Health & Fitness
Lifesum - Join the health movement
Health & Fitness
Runtastic Results: Fitness & Body-weight Work-out
Health & Fitness
Glassdoor Job Search: Jobs, Salaries & Reviews
Business
Invoice 2go - Professional Invoices and Estimates
Business
YAZIO Calorie Counter, Food Diary & Diet Journal
Health & Fitness
1Password - Password Manager and Secure Wallet
Productivity
Sago Mini Puppy Preschool
Education
$3.99
Strawberry Shortcake Holiday Hair - Fashion World
Entertainment
Kitchen Stories - recipes, baking, healthy cooking
Food & Drink
Toca Hair Salon 3
Education
$3.99
Artie's World
Education


Polynomials
Write the function that corresponds to the polynomial 2x
2
+3x+3 on
Z
. Compute the value of this function on integers -6 and 1024.
Same question, whithout explicitly writing any abstraction.
Solution
This file
Going home
Pierre Castéran


Hi! My name is Parithat. I come from Suratthani, Thailand.
My nick name is Nut. I'm 20 years old.My hobby is listen to music.
I am studying in the 2nd year of Major of Software Engineering Faculty of Technology and Environment, Prince of Songkla University.
My dreamed that I would be Programmer.
089-875-2884
starsis25391@hotmail.com


Butter Nut Squash & Apple Soup with Indian Spices
Ingredients
2 lbs (1 kg) butternut squash, peeled and diced3 tablespoons unsalted butter
1 small onion, chopped
.5 teaspoon fennel seeds
2 garlic cloves smashed
1 2-inch piece ginger, peeled and grated
1/4 teaspoon freshly grated nutmeg, plus more for garnish
.25 teaspoon turmeric
.5 teaspoon cumin powder
.5 teaspoon coriander powder
1 teaspoon garam masala powder
Kosher salt and freshly ground pepper
2 cups vegetable broth or water
1 1/4 cups chunky apple sauce
1 green apple, diced
1 tablespoon apple cider vinegar
1 to 2 tablespoons chopped fresh cilantro
Preparation Method
Preheat the oven to 425 degrees F. Peel and dice butternut squash. Melt 2 tablespoons of butter in a large pot over medium heat. Add the onion, fennel seeds and garlic and cook until soft, about 5 minutes. Stir in the ginger, nutmeg, turmeric, cumin, coriander garam masala, and salt and pepper to taste and cook until toasted, 1 more minute. Add the diced butternut squash, broth and 2 cups water to the pot, cover and bring to a boil over medium-high heat. Reduce the heat to medium low and stir in the applesauce. Simmer, covered, until the squash is soft, about 20 minutes. Puree the soup with a blender until smooth. Season with salt and pepper; keep warm. Peel , core and dice the apple, heat the remaining 1 tablespoon butter in a skillet over medium heat. Add the apples, stirring, until browned; remove from the heat and add the vinegar. Top with the cilantro. Fold the mixture into the soup and serve hot.


{% load static %}
I am student. I am machine learning web application.
In this brief session i am gonna learn about how you learn.
In this brief session i am gonna learn about how you learn.
In this brief session i am gonna learn about how you learn.
In this brief session i am gonna learn about how you learn.
In this brief session i am gonna learn about how you learn.
In this brief session i am gonna learn about how you learn.
In this brief session i am gonna learn about how you learn.
This is to aid a learner in learning.


Documents
Active Arguments
Arbitrary-Precision Arithmetic
Argument Remapping
Arrays
Bypass Semantics
Closures
Continuation Machine
Cpp Introduction
Deferral
Documentation Conventions
Equalization
Evaluated Parameters
Evaluated Slots
Example: Binary Literals
Example: Roman Numerals
Exponentials
File-Iteration
Generic Data Structures
Higher-Order Constructs
IL Expressions
Intermediates
Introduction
Lambda
Library Conventions
Lists
Local-Iteration
Macro Expansion
Named External Arguments
Overview
Parametric Resumption
Rails
Recursion
Saturation Arithmetic
Second-Tier Algorithms
Sequences
Sequential Iteration
Strings
True-Optional Arguments
Tuples
Tutorial
© Copyright
Paul Mensonides
2003-2005
Distributed under the
Boost Software License, Version 1.0
. See
http://chaos-pp.sourceforge.net
for the most recent version of this document.


Home
(current)
About
Contact
FAQs
Activity
Places Searched
125
Places Uploaded
13
Places Rated
37
Orders done
78
Home
Edit
First name
Last name
Phone
Mobile
Email
Location
Password
Verify
Save
Reset