|
DeepSpace-SWI
2019
|
The VM is configured to automatically run this class, and to call the functions corresponding to each mode, as described in the TimedRobot documentation. More...
Public Member Functions | |
| void | robotInit () |
| This function is run when the robot is first started up and should be used for any initialization code. More... | |
| void | robotPeriodic () |
| This function is called every robot packet, no matter the mode. More... | |
| void | disabledInit () |
| This function is called once each time the robot enters Disabled mode. More... | |
| void | disabledPeriodic () |
| Run in a loop while the robot is disabled. More... | |
| void | autonomousInit () |
| This autonomous (along with the chooser code above) shows how to select between different autonomous modes using the dashboard. More... | |
| void | autonomousPeriodic () |
| This function is called periodically during autonomous. More... | |
| void | teleopInit () |
| This is run once when the robot switches to Teleop mode. More... | |
| void | teleopPeriodic () |
| This function is called periodically during operator control. More... | |
| void | testPeriodic () |
| This function is called periodically during test mode. More... | |
Static Public Attributes | |
| static OI | m_oi |
| static DriveTrain | m_driveTrain |
| static Intake | m_intake |
| static CargoFlap | m_cargoflap |
| static Pneumatics | m_pneumatics |
| static LEDring | m_ledRing |
| static Climber | m_climber |
| static Outtake | m_outtakeGroup |
| static Climb | m_climbGroup |
| static ManualArmController | m_manualArmController |
Private Member Functions | |
| void | startTeleopCommands () |
| This is only needed for DeepSpace. More... | |
Private Attributes | |
| RobotLogger | logger = RobotLogger.getInstance() |
| Command | m_autonomousCommand |
| Chooser | m_chooser = new Chooser() |
| boolean | m_teleopAssistLock = false |
| DriveControl | m_driveControl |
| IntakeControl | m_intakeControl |
| CompressorControl | m_compressorControl |
| ClimbControl | m_climbControl |
The VM is configured to automatically run this class, and to call the functions corresponding to each mode, as described in the TimedRobot documentation.
If you change the name of this class or the package after creating this project, you must also update the build.gradle file in the project.
Definition at line 33 of file Robot.java.
| void frc.robot.Robot.autonomousInit | ( | ) |
This autonomous (along with the chooser code above) shows how to select between different autonomous modes using the dashboard.
The sendable chooser code works with the Java SmartDashboard. If you prefer the LabVIEW Dashboard, remove all of the chooser code and uncomment the getString code to get the auto name from the text box below the Gyro
You can add additional auto modes by adding additional commands to the chooser code above (like the commented example) or additional comparisons to the switch structure below with additional strings and commands.
Definition at line 183 of file Robot.java.
| void frc.robot.Robot.autonomousPeriodic | ( | ) |
This function is called periodically during autonomous.
Definition at line 204 of file Robot.java.
| void frc.robot.Robot.disabledInit | ( | ) |
This function is called once each time the robot enters Disabled mode.
You can use it to reset any subsystem information you want to clear when the robot is disabled.
Definition at line 151 of file Robot.java.
| void frc.robot.Robot.disabledPeriodic | ( | ) |
Run in a loop while the robot is disabled.
Networking, logging, and LED code usually goes here.
Definition at line 166 of file Robot.java.
| void frc.robot.Robot.robotInit | ( | ) |
This function is run when the robot is first started up and should be used for any initialization code.
Definition at line 70 of file Robot.java.
| void frc.robot.Robot.robotPeriodic | ( | ) |
This function is called every robot packet, no matter the mode.
Use this for items like diagnostics that you want ran during disabled, autonomous, teleoperated and test.
This runs after the mode specific periodic functions, but before LiveWindow and SmartDashboard integrated updating.
Definition at line 128 of file Robot.java.
|
private |
This is only needed for DeepSpace.
Calling this will start Teleop before Autonomous has finished
Definition at line 138 of file Robot.java.
| void frc.robot.Robot.teleopInit | ( | ) |
This is run once when the robot switches to Teleop mode.
Definition at line 232 of file Robot.java.
| void frc.robot.Robot.teleopPeriodic | ( | ) |
This function is called periodically during operator control.
Definition at line 256 of file Robot.java.
| void frc.robot.Robot.testPeriodic | ( | ) |
This function is called periodically during test mode.
Definition at line 264 of file Robot.java.
|
private |
Definition at line 34 of file Robot.java.
|
private |
Definition at line 40 of file Robot.java.
|
static |
Definition at line 49 of file Robot.java.
Definition at line 41 of file Robot.java.
|
private |
Definition at line 58 of file Robot.java.
|
static |
Definition at line 52 of file Robot.java.
|
static |
Definition at line 62 of file Robot.java.
|
private |
Definition at line 57 of file Robot.java.
|
private |
Definition at line 55 of file Robot.java.
|
static |
Definition at line 47 of file Robot.java.
|
static |
Definition at line 48 of file Robot.java.
|
private |
Definition at line 56 of file Robot.java.
|
static |
Definition at line 51 of file Robot.java.
|
static |
Definition at line 63 of file Robot.java.
|
static |
Definition at line 46 of file Robot.java.
|
static |
Definition at line 61 of file Robot.java.
|
static |
Definition at line 50 of file Robot.java.
|
private |
Definition at line 42 of file Robot.java.


David Taylor's panel show appearances
David Taylor (born 1947-03-17[ref]) has appeared in 19 episodes between 1980-1987. Note that these appearances may be for more than one person if multiple people have the same name.
- 1987-01-31 / The News Quiz
- 1986-06-07 / The News Quiz
- 1985-11-30 / The News Quiz
- 1985-01-26 / The News Quiz
- 1984-11-10 / The News Quiz
- 1984-11-03 / The News Quiz
- 1984-03-31 / The News Quiz
- 1984-02-25 / The News Quiz
- 1984-01-28 / The News Quiz
- 1983-07-09 / The News Quiz
- 1983-05-21 / The News Quiz
- 1982-12-04 / The News Quiz
- 1982-11-06 / The News Quiz
- 1982-10-09 / The News Quiz
- 1982-07-24 / The News Quiz
- 1982-07-03 / The News Quiz
- 1981-10-31 / The News Quiz
- 1981-06-13 / The News Quiz
- 1980-08-09 / The News Quiz


You should see no red.
You should see three colored overlapping squares, from back to front: a green square, a blue square and a yellow square.
xxxxx
xxxxx
xxxxx
xxxxx
xxxxx


Loading...
Simple panel
With shadow
Light panel, light text
Lighter panel
Dark panel
Dark panel, light text
Darker panel, light text
Darker panel, light text + shadow
Accent panel, light text
Accent panel, light text + shadow
Panel heading
Panel content
Panel heading
Panel content + shadow


hi all. Id like to play a rogue/ninja type of build but cant decide wich class would be the best to add. I thought about duelist to add some AC to be able to face opponents with TS. But something that could help agaisnt ennemies immune to sneak/crits would be nice.
Any suggestion on that type of build? I usually play wizards so Im like a rookie on this lol
Thx all _________________ K.M. aka Chillychill
"Y'a pire que ne pas pouvoir, y'a savoir qu'on peut et ne jamais tenter"
Check out Grizzled Dwarflord's Zhentarim Agent build in the Epic Character Builder's forum. Click Here It's a str-based Rogue/Fighter/SD build, so it still has plenty of damage potential against sneak-immune enemies. He shows the halfling version, I think it would work even better as a dwarf.
Also, any of the Fighter/Rogue/X builds will be close - some use WM, some HS, some SD, etc. Depends on exactly what you want. If you want to keep the ability to damage sneak-immune critters, look for str-based ones. If you want the best defense, check out the dex-based ones with ED and SCV. You could also check out my Felonius Monk build if you want a bit of monk to simulate the ninja. Click Here


Toggle navigation
Home
Projects
Internships
Reflections
Resume
Contact
Resume
Resume
Below you will find an embedded copy of my resume.
Download.


PublicApi
ui.grid.grouping
Public Api for grouping feature
Sets the aggregation type on a column, if the column is currently grouped then it removes the grouping first. If the aggregationDef is null then will result in the aggregation being removed
| Param | Type | Details |
|---|---|---|
| columnName | string | the column we want to aggregate |
| or | string | {function} aggregationDef one of the recognised types from uiGridGroupingConstants or a custom aggregation function. |
| aggregationLabel | string | (optional) The label to use for this aggregation. |
Clear any grouped columns and any aggregations. Doesn't remove sorting, as we don't know whether that sorting was added by grouping or was there beforehand
Get the grouping configuration for this grid,
used by the saveState feature. Adds expandedState to the information
provided by the internal getGrouping, and removes any aggregations that have a source
of grouping (i.e. will be automatically reapplied when we regroup the column)
Returned grouping is an object
{ grouping: groupArray, treeAggregations: aggregateArray, expandedState: hash }
where grouping contains an array of objects:
{ field: column.field, colName: column.name, groupPriority: column.grouping.groupPriority }
and aggregations contains an array of objects:
{ field: column.field, colName: column.name, aggregation: column.grouping.aggregation }
and expandedState is a hash of the currently expanded nodes
The groupArray will be sorted by groupPriority.
| Param | Type | Details |
|---|---|---|
| getExpanded | boolean | whether or not to return the expanded state |
| object | grouping configuration |
Adds this column to the existing grouping, at the end of the priority order. If the column doesn't have a sort, adds one, by default ASC
This column will move to the left of any non-group columns, the move is handled in a columnProcessor, so gets called as part of refresh
| Param | Type | Details |
|---|---|---|
| columnName | string | the name of the column we want to group |
Set the grouping configuration for this grid, used by the saveState feature, but can also be used by any user to specify a combined grouping and aggregation configuration
| Param | Type | Details |
|---|---|---|
| config | object | the config you want to apply, in the format provided out by getGrouping |
Removes the groupPriority from this column. If the column was previously aggregated the aggregation will come back. The sort will remain.
This column will move to the right of any other group columns, the move is handled in a columnProcessor, so gets called as part of refresh
| Param | Type | Details |
|---|---|---|
| columnName | string | the name of the column we want to ungroup |
raised whenever aggregation is changed, added or removed from a column
gridApi.grouping.on.aggregationChanged(scope,function(col){})
| Param | Type | Details |
|---|---|---|
| col | gridCol | the column which on which aggregation changed. The aggregation
type is available as |
raised whenever the grouped columns changes
gridApi.grouping.on.groupingChanged(scope,function(col){})
| Param | Type | Details |
|---|---|---|
| col | gridCol | the column which on which grouping changed. The new grouping is
available as |


After running the full installation of this repo (see README.md), you can view what should be a working example of Flash VPAID within VideoJS using a LiveRail ad test URL.
* - probably not working right now


Program
preliminary
Registration
Pick up your badge
Opening
Opening speech
Keynote 1: Halima Bensmail
Developing new machine learning algorithm for computational Biology:
Cases for Genetics, NGS and Protein crystallization
Break & Poster Session
Tea and Coffee
Keynote 2: Mounir Ghogho
Can AI predict the future?
Keynote 3: Anys Boukli
Title
Break & Poster Session
Lunch
Keynote 4: Loubna Benabbou
Machine Learning and Deep Learning, Challenges and Applications in Developing World:
Case of the Moroccan Capital Market
Keynote 5: Hicham Zmarrou
The Road to Enterprise AI
Panel
How Morocco can Leverage Artificial Intelligence?
Break & Poster Session
Tea, Coffee and Networking
Registration
Pick up your badge
Tutoriel 1: Hicham Hajji
Aperçu sur les approches d'interprétabilité des modèles du Deep Learning
3MT Competition
Break & Poster Session
Tea and Coffee
Tutoriel 2: Abdellah Chkifa
An introduction to gradient descent algorithms
Data Challenge
Winners Announcement


OPEN KILDA
Change Password
Logout
Change Password
×
Old Password is required.
New Password is required.
Confirm Password is required.
OTP is required.
Old password and new password can not be same.
Password should be min 8 and max 15 character long..
Change Password
Changing Password..
.
.
.


Top rated movies in Redbox kiosks near {{ zipcode }}
Bookmark this page to see the best movies in all of your local Redbox kiosks at a glance. You may also choose to select a different zip code.
-
{% for movie in movies %}
-
{% if movie.thumb %}{% endif %}{{ movie.title }}
{{ movie.format }}
{{ movie.score }} points
Rotten Tomatoes® Scores {% if movie.critics_score > 59 %} {% else %} {% endif %} {{ movie.critics_score }}% {% if movie.audience_score > 59 %} {% else %} {% endif %} {{ movie.audience_score }}%
{% if movie.metascore %}OMDB Metascore {{ movie.metascore }}%
{% endif %}{% comment %} "synopsislong" Redbox link: In accordance with http://developer.redbox.com/legal, retrieved 2012-09-04, 2.8(c): each time the term “Redbox” appears on any page or screen in your Application, it must link to the Redbox Site; In accordance with http://developer.redbox.com/legal, retrieved 2012-09-04, 2.7(m)(ii): [may not] (m) state or imply, whether through use of the Redbox Marks or otherwise, ... (ii) that any of the Content is your own creation, ... So, let's be safe, and explicit with where we get this content: {% endcomment %}{% if movie.releasedate %}Released {{ movie.releasedate|date:"F Y" }}
{% endif %}{{ movie.synopsislong }} Read more at Redbox{{ movie.critics_consensus }} {% if movie.critics_consensus %}Read more at Rotten Tomatoes{% endif %}
{% endfor %}


Pop the boloons by drawing graphs.
Description
Specifications
Using different typs of equations, make graphs that draw a line through the balloons to pop them.
Requires Javascript


So easy, that even your dog could do it.
Maybe somewhere...But not here.
Even though some may not remember it.
Spots are limited for this exclusive round of play!
Beer
9 Holes of Golf
More Beer
Food
Raffle


THE NAKED GUN 2 1/2: THE SMELL OF FEAR Reviewed by David N. Butterworth (c) 1991 David N. Butterworth/The Summer Pennsylvanian
Just accept it, Patrick Swayze. Police Lt. Frank Drebin is back!
From the brother of the director of GHOST comes THE NAKED GUN 2 1/2: THE SMELL OF FEAR, a movie two-and-a-half times funnier than last summer's paranormal blockbuster, an uproariously daffy (if equally para-normal) follow-up to the 1988 comedy, THE NAKED GUN: FROM THE FILES OF POLICE SQUAD!

Based on an short-lived TV series (one that CBS is slated to re-broadcast later this month), THE NAKED GUN: FROM THE FILES OF POLICE SQUAD! sent up the police/crime drama to the point of idiocy. Now, with THE NAKED GUN 2 1/2: THE SMELL OF FEAR, that lunatic tradition is continued, with Frank Drebin (Leslie Nielsen), the soft-boiled Police Lieutenant with the deadpan delivery, embroiled in an irrelevant plot about some political campaign for clean energy.
 It's an inspired and goofball turn by Nielsen.
The original film wound up with Drebin finding himself in a compromising position with the Queen of England. It seems only fitting, therefore, that the sequel would have a go at this nation's President and First Lady. Most people wouldn't consider Barbara Bush a natural stooge, but in THE NAKED GUN 2 1/2: THE SMELL OF FEAR, she takes it on the chin -- literally -- on more than one occasion.
Priscilla Presley once again plays Jane Spenser, the object of Drebin's affections. "She has the kind of body that could melt a cheese sandwich from across the room," he observes, in typical police melodrama voice-over. "With the kind of breasts that say, 'Hey - look at me!'" Presley is the straightest thing in the film, and it's nice to see her finally finding her niche.
Robert Goulet plays Quentin Hapsburg, an oily, David Niven-esque rogue with designs on the curvaceous Jane. Although THE NAKED GUN 2 1/2: The Smell of Fear" is far from being brilliantly conceived, the way in which Hapsburg buys the farm is, and is worth the price of admission alone.
That earlier reference to GHOST, of course, is more than just familial. There can be few people who haven't yet seen the film's central "homage" to director Jerry Zucker's 1990 tearjerker, and I won't spoil it for those who haven't. Suffice it to say the obligatory stock footage of trains going into tunnels and oil wells erupting has never been funnier. And I was humming "Unchained Melody" days after seeing this movie, which is more than I can say for GHOST.
Another cleverly constructed scene is the one in which Drebin visits a lounge called "The Blue Note," a morose and dimly lit hangout frequented by manic depressives, with its wall-to-wall paintings of the Hindenburg, Titanic and other national disasters. When Drebin orders the strongest thing they have, a body builder shows up. So when he settles instead for a Black Russian, the audience groans in anticipation. But the waiter's ahead of us and, facing the camera, shrewdly shakes his head.
Similarly, when one of the bad guys is spotted in Washington, D.C.'s red light district, Drebin questions his motivations. "Sex, Frank?" suggests Captain Ed Hocken (George Kennedy, in a reprise of his role). Drebin appears to contemplate the statement for a while and then declines the "offer" with a "No. Not right now, Ed."
As you can tell, the impetus behind these films -- which began in 1980 with AIRPLANE! -- is to cram as many sight gags and corny one-liners as possible into ninety minutes. In that film, producers Zucker, Abrahams and Zucker's machine gun scattering of belly laughs were constant and hysterical, and the film set the pattern for future comedic outings, such as the under-appreciated TOP SECRET!
Of course, with this many jokes-per-minute, not all of them can work. But those that do are consistently big enough to sustain you throughout the few that don't.
A minor criticism with THE NAKED GUN 2 1/2: THE SMELL OF FEAR is the way in which characters often react to an on-screen witticism by moving their eyes from side to side in bewilderment. A more distracted approach, with no observed response to the joke, might have been funnier. But why carp?
When asked why the sub-title "The Smell of Fear," director David Zucker responds "It just sounded funny." That thinking appears to be what fires THE NAKED GUN 2 1/2" -- go for the quick laugh fast.

The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


FWR blocks bring in an air of WebRTC with their creative layouts and blocks, which are easily customizable
FWR blocks are the cleanest pieces of HTML blocks, which are built with utmost care to quality and usability.
FWR blocks is a Web Application for designers, developers and agencies looking to create stunning websites in no time.


Detailed Information
Please select your highway of interest, also enjoy the possibility to add signs information and some high level aspects about the whole traffic system.
-
Select Highways
Please select highways to see them right on the map.
-
Signs
Please click below wether you want to see highway signs right into the map or not.
-
Detailed Info
- Calculating stucked segments...
- Calculating delayed segments...
- Calculating most stucked highway...


|
User Login
|
||
| Example Record 1 | Example Record 2 | Example Record 3 |
| Example Record 4 | Example Record 5 | Example Record 6 |
|
User Login
|
||
| Example Record 1 | Example Record 2 | Example Record 3 |
| Example Record 4 | Example Record 5 | Example Record 6 |


In the Bahá'í Faith the Qiblih is the location that Bahá'ís should face when saying their daily obligatory prayers, and is fixed at the Shrine of Bahá'u'lláh in Bahjí, near Akká, in present day Israel.
The arrow should direct you to Bahjí
You may drag and drop the marker to reposition it to your current location or you can click on the search icon on the far left to search for your current address.
Resources
How should the direction of the Qiblih be determined?
The direction of the Qiblih from a given location on earth may be set
along the shorter arc of a great circle that passes through Bahjí and the
point concerned. A great circle in this context is one whose plane
bisects the earth (e.g., the equator and longitudinal meridians). Bahjí is
located at approximately 35 degrees east longitude and 33 degrees north
latitude.
What is the Magnetic Bearing?
The magnetic bearing is relative to magnetic north that a compass needle would point to.
North corresponds to 0°, and the angles increase clockwise, so east is 90° degrees, south is 180°, and west is 270°. This value is calculated by adding the magnetic declination, based on the World Magnetic Model 2020-2025, to the true north bearing.
Why is the line not straight when I zoom out to the world view?
The shortest path lies on an arc of a great circle. When a path along a great circle is drawn on a flat map, it usually looks curved. Using a world globe and a piece of string you can test this out yourself.


Campus Club Report 2016
December 31, 2016
2016 had been a great year for Mozilla with a lot of new goals, transitioning of FSA into Campus Clubs, Lot of improvements in the Community
Campus Clubs transitioning was a challenging process for the FSA team. With the new goals in mind, Bringing the best out of the community, streamlined communication, proper recognition, focussing on Quality over quantity, devising a protocol was a huge ta Here are the list of Mozilla Campus clubs inaugurated in 2016
- Amrita University, Coimbatore
- IIIT D& M College, Chennai
- Bannari Amman Institute of Technology, Sathyamangalam
- SNS college of Technology, Coimbatore
- Sri Krishna College of Technology, Coimbatore
- KCG College of Technology, Chennai
Metrics for 2016:
- Total Number of Online Events Conducted – 13
- Total Number of Offline Events Conducted – 26
- Number of Active Contributors – 12
- Number of New Contributors joined in 2016- 68


Vandal
Choose Map Type
Radio Buttons
Roadmap
Satellite
Hybrid
Bot Yuenthon
<EMAIL_ADDRESS>Settings Menu
Customize Map
Choose Crime to Highlight
Customize Crime Marker Colors
Change Home Address
Change Work & School Address
Edit Alerts
App Settings
Change Notification Settings
Change Settings
Change Settings
Change Settings
Change Settings
Change Settings
Information
Account Information
Profile
Change Email
Contact Support
Logout


Image Post-Processing Tool
Right
Right-click and select
Save image as...
to save.
Coordinate:
RGB:
Width:
Height:


Smoky Mountain Air Show Alcoa Highway camera photo caption unavailable WBIR Thu, 14 Apr 2016 Watch the 10News Alcoa Highway camera to watch the preparations leading up to the Smoky Mountain Air Show. Then tune in Saturday from 11 a.m. - 4 p.m. for WBIR's live air show coverage. RELATED: Smoky Mountain Air Show - What you need to know


As many of you already know, there is a new mailing list for the course<EMAIL_ADDRESS>It is a private mailing list: only the members can read and write messages
For subscribing to the mailing list, one has to send me an e-mail<EMAIL_ADDRESS>asking for it, and I'll add him/her directly to the list
The old mailing list will be closed in a few days
The room for the next three lectures will be the "Aula Informatica" in via Zamboni 32, 3rd floor
She was one of the programmers of the earliest electronic and general-purpose computer, the ENIAC
She was involved in the development of several programming languages, such as COBOL and FORTRAN
She was the creator of the first statistical analysis tool
A huge part of her work about the development of algorithms for sorting the elements in a list
Sorting things is expensive, in particular if you have to order billions of items
However, having such items sorted is crucial for several additional kinds of tasks that we can perform
Library: books are clustered according to Dewey classification, and each cluster contains books ordered according to the authors' name and the book title
In this way a librarian can find a requested title avoiding to look all the billion books available one by one, thus saving a huge amount of time
Problem-solving: the activity of creating an algorithm for solving some given computational problem, e.g. ordering alphabetically all the books in a library
Categories of problem-solving methods:
brute-force
divide and conquer
dynamic programming
backtracking
greedy
...
Brute-force algorithm: a process that reaches the perfect solution of a problem by analysing all the possible candidates that may provide a solution to a certain computational problem, and then check if each candidate solves the problem question
Advantages: simple, it finds a solution always
Disadvantages: costly for large inputs
Suggestion: use brute-force algorithms when the problem size is small
Abstract strategy board games are computational problems that have a quite huge solution space
Develop a brute-force algorithm which is able to play appropriately Go means to consider all the possible legal moves that are available on the board
Number of all the possible legal moves in Go:<PHONE_NUMBER>81979984699478633344862770286522453884530548425639456820927419612738015378525648451698519643907259916015628128546089888314427129715319317557736620397247064840935
Avoid brute-force for these kinds of problems
The usual way for solving computational problems by means of a brute-force approach is to iterate over a certain input or a block of instructions several times
Foreach loop
for item in <collection>:
# do something using the current item
While loop
while <condition>:
# do something until the condition is true
def stack_from_list(input_list):
output_stack = deque()
for item in input_list:
output_stack.append(item)
return output_stack
input_list =
12
15
83
output_stack =
def run_forever():
value = 0
while value >= 0:
value = value + 1
value =
0
1
2
3
4
...
Computational problem: find the position of the first occurrence of a value within a list
Iterate over the items in the input list
Check if each of them is equal to the value we are looking for
Once the value has been found, its position in the list is then returned
If the value is not contained in the list, no position is returned at all
Tuple: sequence of values, specified in a precise order - they are different from lists since they cannot be modified
my_tuple = (1, "a", 2, ...)
The algorithm def enumerate(<input_list>)
returns a list of tuples, with two elements each: the first element is the position of the item in consideration in the list, while the second element is the item itself
my_list = list()
my_list.append("a")
my_list.append("b")
my_list.append("c")
enumerate(my_list)
# it will return the following list of tuples:
# list([(0, "a"), (1, "b"), (2, "c")])
ThyMopani allows us to decouple the items in a tuple by specifying names for each item with variables created in the for
statement on-the-fly
For instance,for position, item in enumerate(my_list)
will assign (the number in the following list refers to the particular iteration of the foreach loop):
position = 0
and item = "a"
position = 1
and item = "b"
position = 2
and item = "c"
def linear_search(input_list, value_to_search):
for position, item in enumerate(input_list):
if item == value_to_search:
return position
In ThyMopani, None
(that means nothing) is returned if no return
statement is executed
Computational problem: sort all the items in a given list
Computational problem: sort all the items in a given list
Computational problem: sort all the items in a given list
Computational problem: sort all the items in a given list
Computational problem: sort all the items in a given list
Computational problem: sort all the items in a given list
def range(stop_number)
returns the list of all numbers from 0 to the one preceding the stop number
E.g.: range(3)
returns list([0, 1, 2])
, while range(0)
returns an empty list
def reversed(input_list)
returns a new list with all the elements sorted in the opposite order
E.g.: considering my_list = list([0, 1, 2])
, reversed(my_list)
returns list([2, 1, 0])
<list>[<position>]
returns the item in the list at that particular position
E.g.: considering my_list = list(["a", "b", "c"])
, my_list[1]
returns "b"
The method <list>.insert(<position>, <item>)
puts <item> in the position specified, and it shifts all the following elements
E.g.: my_list.insert(1, "d")
modifies my_list
as list(["a", "d", "b", "c"])
def insertion_sort(input_list):
result = list()
for item in input_list:
insert_position = len(result)
for prev_position in reversed(range(insert_position)):
if item < result[prev_position]:
insert_position = prev_position
result.insert(insert_position, item)
return result


public class StandardDialScale extends AbstractDialLayer implements DialScale, java.lang.Cloneable, org.jfree.util.PublicCloneable, java.io.Serializable
DialPlot
.| Constructor and Description |
|---|
StandardDialScale()
Creates a new instance of DialScale.
|
StandardDialScale(double lowerBound,
double upperBound,
double startAngle,
double extent,
double majorTickIncrement,
int minorTickCount)
Creates a new instance.
|
| Modifier and Type | Method and Description |
|---|---|
double |
angleToValue(double angle)
Converts the given angle to a data value, based on this scale.
|
java.lang.Object |
clone()
Returns a clone of this instance.
|
void |
draw(java.awt.Graphics2D g2,
DialPlot plot,
java.awt.geom.Rectangle2D frame,
java.awt.geom.Rectangle2D view)
Draws the scale on the dial plot.
|
boolean |
equals(java.lang.Object obj)
Tests this
StandardDialScale for equality with an arbitrary
object. |
double |
getExtent()
Returns the extent.
|
boolean |
getFirstTickLabelVisible()
Returns a flag that controls whether or not the first tick label is
visible.
|
double |
getLowerBound()
Returns the lower bound for the scale.
|
double |
getMajorTickIncrement()
Returns the increment (in data units) between major tick labels.
|
double |
getMajorTickLength()
Returns the length factor for the major tick marks.
|
java.awt.Paint |
getMajorTickPaint()
Returns the major tick paint.
|
java.awt.Stroke |
getMajorTickStroke()
Returns the stroke used to draw the major tick marks.
|
int |
getMinorTickCount()
Returns the number of minor tick marks between major tick marks.
|
double |
getMinorTickLength()
Returns the length factor for the minor tick marks.
|
java.awt.Paint |
getMinorTickPaint()
Returns the paint used to draw the minor tick marks.
|
java.awt.Stroke |
getMinorTickStroke()
Returns the stroke used to draw the minor tick marks.
|
double |
getStartAngle()
Returns the start angle for the scale (in degrees using the same
orientation as Java's
Arc2D class). |
java.awt.Font |
getTickLabelFont()
Returns the font used to draw the tick labels.
|
java.text.NumberFormat |
getTickLabelFormatter()
Returns the number formatter used to convert the tick label values to
strings.
|
double |
getTickLabelOffset()
Returns the tick label offset.
|
java.awt.Paint |
getTickLabelPaint()
Returns the paint used to draw the tick labels.
|
boolean |
getTickLabelsVisible()
Returns
true if the tick labels should be displayed,
and false otherwise. |
double |
getTickRadius()
Returns the radius (as a percentage of the maximum space available) of
the outer limit of the tick marks.
|
double |
getUpperBound()
Returns the upper bound for the scale.
|
int |
hashCode()
Returns a hash code for this instance.
|
boolean |
isClippedToWindow()
Returns
true to indicate that this layer should be
clipped within the dial window. |
void |
setExtent(double extent)
Sets the extent and sends a
DialLayerChangeEvent to all
registered listeners. |
void |
setFirstTickLabelVisible(boolean visible)
Sets a flag that controls whether or not the first tick label is
visible, and sends a
DialLayerChangeEvent to all registered
listeners. |
void |
setLowerBound(double lower)
Sets the lower bound for the scale and sends a
DialLayerChangeEvent to all registered listeners. |
void |
setMajorTickIncrement(double increment)
Sets the increment (in data units) between major tick labels and sends a
DialLayerChangeEvent to all registered listeners. |
void |
setMajorTickLength(double length)
Sets the length factor for the major tick marks and sends a
DialLayerChangeEvent to all registered listeners. |
void |
setMajorTickPaint(java.awt.Paint paint)
Sets the major tick paint and sends a
DialLayerChangeEvent to
all registered listeners. |
void |
setMajorTickStroke(java.awt.Stroke stroke)
Sets the stroke used to draw the major tick marks and sends a
DialLayerChangeEvent to all registered listeners. |
void |
setMinorTickCount(int count)
Sets the number of minor tick marks between major tick marks and sends
a
DialLayerChangeEvent to all registered listeners. |
void |
setMinorTickLength(double length)
Sets the length factor for the minor tick marks and sends
a
DialLayerChangeEvent to all registered listeners. |
void |
setMinorTickPaint(java.awt.Paint paint)
Sets the paint used to draw the minor tick marks and sends a
DialLayerChangeEvent to all registered listeners. |
void |
setMinorTickStroke(java.awt.Stroke stroke)
Sets the stroke used to draw the minor tick marks and sends a
DialLayerChangeEvent to all registered listeners. |
void |
setStartAngle(double angle)
Sets the start angle for the scale and sends a
DialLayerChangeEvent to all registered listeners. |
void |
setTickLabelFont(java.awt.Font font)
Sets the font used to display the tick labels and sends a
DialLayerChangeEvent to all registered listeners. |
void |
setTickLabelFormatter(java.text.NumberFormat formatter)
Sets the number formatter used to convert the tick label values to
strings, and sends a
DialLayerChangeEvent to all registered
listeners. |
void |
setTickLabelOffset(double offset)
Sets the tick label offset and sends a
DialLayerChangeEvent to
all registered listeners. |
void |
setTickLabelPaint(java.awt.Paint paint)
Sets the paint used to draw the tick labels and sends a
DialLayerChangeEvent to all registered listeners. |
void |
setTickLabelsVisible(boolean visible)
Sets the flag that controls whether or not the tick labels are
displayed, and sends a
DialLayerChangeEvent to all registered
listeners. |
void |
setTickRadius(double radius)
Sets the tick radius and sends a
DialLayerChangeEvent to all
registered listeners. |
void |
setUpperBound(double upper)
Sets the upper bound for the scale and sends a
DialLayerChangeEvent to all registered listeners. |
double |
valueToAngle(double value)
Converts a data value to an angle against this scale.
|
addChangeListener, hasListener, isVisible, notifyListeners, removeChangeListener, setVisible
finalize, getClass, notify, notifyAll, toString, wait, wait, wait
addChangeListener, hasListener, isVisible, removeChangeListener
public StandardDialScale()
public StandardDialScale(double lowerBound, double upperBound, double startAngle, double extent, double majorTickIncrement, int minorTickCount)
lowerBound
- the lower bound of the scale.upperBound
- the upper bound of the scale.startAngle
- the start angle (in degrees, using the same
orientation as Java's Arc2D
class).extent
- the extent (in degrees, counter-clockwise).majorTickIncrement
- the interval between major tick marks (must
be > 0).minorTickCount
- the number of minor ticks between major tick
marks.public double getLowerBound()
setLowerBound(double)
public void setLowerBound(double lower)
DialLayerChangeEvent
to all registered listeners.lower
- the lower bound.getLowerBound()
public double getUpperBound()
setUpperBound(double)
public void setUpperBound(double upper)
DialLayerChangeEvent
to all registered listeners.upper
- the upper bound.getUpperBound()
public double getStartAngle()
Arc2D
class).setStartAngle(double)
public void setStartAngle(double angle)
DialLayerChangeEvent
to all registered listeners.angle
- the angle (in degrees).getStartAngle()
public double getExtent()
setExtent(double)
public void setExtent(double extent)
DialLayerChangeEvent
to all
registered listeners.extent
- the extent.getExtent()
public double getTickRadius()
setTickRadius(double)
public void setTickRadius(double radius)
DialLayerChangeEvent
to all
registered listeners.radius
- the radius.getTickRadius()
public double getMajorTickIncrement()
setMajorTickIncrement(double)
public void setMajorTickIncrement(double increment)
DialLayerChangeEvent
to all registered listeners.increment
- the increment (must be > 0).getMajorTickIncrement()
public double getMajorTickLength()
setMajorTickLength(double)
public void setMajorTickLength(double length)
DialLayerChangeEvent
to all registered listeners.length
- the length.getMajorTickLength()
public java.awt.Paint getMajorTickPaint()
null
).setMajorTickPaint(Paint)
public void setMajorTickPaint(java.awt.Paint paint)
DialLayerChangeEvent
to
all registered listeners.paint
- the paint (null
not permitted).getMajorTickPaint()
public java.awt.Stroke getMajorTickStroke()
null
).setMajorTickStroke(Stroke)
public void setMajorTickStroke(java.awt.Stroke stroke)
DialLayerChangeEvent
to all registered listeners.stroke
- the stroke (null
not permitted).getMajorTickStroke()
public int getMinorTickCount()
setMinorTickCount(int)
public void setMinorTickCount(int count)
DialLayerChangeEvent
to all registered listeners.count
- the count.getMinorTickCount()
public double getMinorTickLength()
setMinorTickLength(double)
public void setMinorTickLength(double length)
DialLayerChangeEvent
to all registered listeners.length
- the length.getMinorTickLength()
public java.awt.Paint getMinorTickPaint()
null
).setMinorTickPaint(Paint)
public void setMinorTickPaint(java.awt.Paint paint)
DialLayerChangeEvent
to all registered listeners.paint
- the paint (null
not permitted).getMinorTickPaint()
public java.awt.Stroke getMinorTickStroke()
null
).setMinorTickStroke(Stroke)
public void setMinorTickStroke(java.awt.Stroke stroke)
DialLayerChangeEvent
to all registered listeners.stroke
- the stroke (null
not permitted).getMinorTickStroke()
public double getTickLabelOffset()
setTickLabelOffset(double)
public void setTickLabelOffset(double offset)
DialLayerChangeEvent
to
all registered listeners.offset
- the offset.getTickLabelOffset()
public java.awt.Font getTickLabelFont()
null
).setTickLabelFont(Font)
public void setTickLabelFont(java.awt.Font font)
DialLayerChangeEvent
to all registered listeners.font
- the font (null
not permitted).getTickLabelFont()
public java.awt.Paint getTickLabelPaint()
null
not permitted).setTickLabelPaint(Paint)
public void setTickLabelPaint(java.awt.Paint paint)
DialLayerChangeEvent
to all registered listeners.paint
- the paint (null
not permitted).public boolean getTickLabelsVisible()
true
if the tick labels should be displayed,
and false
otherwise.setTickLabelsVisible(boolean)
public void setTickLabelsVisible(boolean visible)
DialLayerChangeEvent
to all registered
listeners.visible
- the new flag value.getTickLabelsVisible()
public java.text.NumberFormat getTickLabelFormatter()
null
).setTickLabelFormatter(NumberFormat)
public void setTickLabelFormatter(java.text.NumberFormat formatter)
DialLayerChangeEvent
to all registered
listeners.formatter
- the formatter (null
not permitted).getTickLabelFormatter()
public boolean getFirstTickLabelVisible()
setFirstTickLabelVisible(boolean)
public void setFirstTickLabelVisible(boolean visible)
DialLayerChangeEvent
to all registered
listeners.visible
- the new flag value.getFirstTickLabelVisible()
public boolean isClippedToWindow()
true
to indicate that this layer should be
clipped within the dial window.isClippedToWindow
in interface DialLayer
true
.public void draw(java.awt.Graphics2D g2, DialPlot plot, java.awt.geom.Rectangle2D frame, java.awt.geom.Rectangle2D view)
draw
in interface DialLayer
g2
- the graphics target (null
not permitted).plot
- the dial plot (null
not permitted).frame
- the reference frame that is used to construct the
geometry of the plot (null
not permitted).view
- the visible part of the plot (null
not
permitted).public double valueToAngle(double value)
valueToAngle
in interface DialScale
value
- the data value.angleToValue(double)
public double angleToValue(double angle)
angleToValue
in interface DialScale
angle
- the angle (in degrees).valueToAngle(double)
public boolean equals(java.lang.Object obj)
StandardDialScale
for equality with an arbitrary
object.equals
in class AbstractDialLayer
obj
- the object (null
permitted).public int hashCode()
hashCode
in class AbstractDialLayer
public java.lang.Object clone() throws java.lang.CloneNotSupportedException
clone
in interface org.jfree.util.PublicCloneable
clone
in class AbstractDialLayer
java.lang.CloneNotSupportedException
- if this instance is not cloneable.


---
layout: post
date: 2010-11-05
time: "09:00:00"
authors: ["Greg Wilson"]
title: Done In London
tags: ["Assessment", "Queen Mary University London"]
---
We wrapped up this week's class in London today: I think a lot of the students felt that they'd been in the wind tunnel most of the week, but the feedback was fairly positive:
Good
- new content (hadn't seen before)
- covered a lot (good to see things)
- easy to apply / pragmatic
- group exercises were fun / useful
- Subversion
- entertaining instructor (blah blah blah)
- better understanding of best practices
- persuasive arguments for best practices
- nice to meet everybody!
- accidental knowledge transfer (vertically and sideways)
Bad
- too much too fast (got lost on Tuesday)
- spent time thinking about programming tasks while instructor was showing solution
- covered a lot (would have liked warmup before arrival)
- too much hummus (could have used more variety in food)
- not enough networking
- how does it run on my machine??
- not enough connection with sound
- introduced software we may never use
- not long enough (need more time)
- no incentive to do exercises / homework


Contact The Jeff
Name:
Email:
Subject:
Casual Conversation(s)
Employment Material(s)
Bounty Submission(s)
Feedback(s)
Donations(s)
Message:


IT Specialist with 5+ years of experience in information technology and computer systems. Highly familiar with a wide knowledge of Network technology, Software Engineering, Advance Database, Web Development and Operating System Software. Completed the Honorary Bachelors Degree in Computing and Information Systems.
 I like to play football, basketball and I have won some medals on them. I also like to play chess and swimming.
When I am inside, I follow a number of sci-fi and fantasy genre movies and television shows, reading technology magazines, and I spend a large amount of my free time exploring the latest technology advancements in the IT industry.
I would also like to solve math problems and quite intrested in Astronomy and physics.


LaTeX normally leaves a little extra space after sentences. However, it uses a rather simple rule for determining whether a period ends a sentence: it assumes that periods end sentences unless they follow an upper case letter. To let LaTeX know that a period does not end a sentence after, for example, an abbreviation, use \<space>
For example,
Jones, et al.\ (1993) ...
Such a space may also be needed after a text-producing command, such as one defined with \newcommand. As an example, consider
\newcommand{\water}{H$_2$O} \water, \water\ everywhere, but not a drop ...
The first \water command is terminated by the comma; note that LaTeX does not leave a space between the first \water and the comma -- as desired -- and the trailing space is treated as an interword space. However, the second \water command is terminated by the space, but LaTeX would not leave an extra space after this, running "H2Owater" into one word, except for the trailing \ .
An alternate way to indicate the end of a command so that a trailing space is interpreted as an interword space is to use braces:
\water, \water{} everywhere, ...
See \@ for the opposite case
See also Line and Page Breaking,
Spaces and Boxes
Go to LaTeX Table of Contents


Integrating progressively decoupling into your workflow.
Yuriy is a Front-end Developer and Solutions Architect with Myplanet, specializing in Front-end and Drupal development. Originally joining the team remotely from Ukraine as a Creative Lead, Yuriy made the switch to full-time coding—and to Canada—in 2013. He holds his Acquia certifications for Development and Front-end Development.
Erin has 7 years of Drupal experience and excels at Accessible front-end development and custom Drupal modules. She has deployed several Drupal 8 projects, and is passionate about customer service and creating emotional connections with people using technology. She has her ‘Grand Master’ Drupal certification.
We want to make sure that component behaves as expected when new features have been added to it or model has been changed.
We want to make sure that when the action creator has been called, the right action (or sequence of actions) have been emitted.
We want to make sure that Redux state has been updated accordingly for the particular action.
“Jest is used by Facebook to test all JavaScript code including React applications. One of Jest's philosophies is to provide an integrated "zero-configuration" experience. We observed that when engineers are provided with ready-to-use tools, they end up writing more tests, which in turn results in more stable and healthy code bases.”
Enzyme is a JavaScript Testing utility for React that makes it easier to assert, manipulate, and traverse your React Components' output.
JSON Schema is a vocabulary that allows you to annotate and validate JSON documents.
Javascript is not a strongly typed language, and as a developer you need to rely on additional tools which will allow you to develop stable apps with Javascript.
We recommend to use JSON schema validators if JSON is your communication protocol.
There are a lot of implementations for JSON Schema validators in javascript.
Locate this session at the DrupalCon Vienna website
https://events.drupal.org/vienna2017/sessions/skeletor-scaffolding-architecture-devops-progressive-decoupling
Take the survey!
https://www.surveymonkey.com/r/drupalconvienna


Account Inquiry
My Undergrad Academics
Student Center
go to ...
Ran Ji
addresses
names
phone numbers
email addresses
emergency contacts
demographic information
citizenship/immigration documents
influenza absence declaration
Email Addresses
Email is the primary means of communication used by the University. It is important for you to keep your email address up to date.
Campus Email Address
This is the official email address the University community will use to communicate with you as a student. Email guidelines can be found at: http://www.adm.uwaterloo.ca/infocist/emailuse.html .
Campus email
Delivered to
<EMAIL_ADDRESS><EMAIL_ADDRESS>Please use the WatIAM link to maintain your email address. Changes on WatIAM will not be reflected here until the next business day.
Addresses
Names
Phone Numbers
Email Addresses
Emergency Contacts
Demographic Information
Citizenship/Immigration Documents
Influenza Absence Declaration
Account Inquiry
My Undergrad Academics
Student Center
go to ...


Intelligent meeting
Admin1
Login to your account !
User Name：
Password：
User:
Administrators:
Log
Register


It is advisable to consult a website such as the UK FCO before visiting here.
The Casamance region of south-western Senegal (between the southern border of Gambia and the northern border of Guinea-Bissau) remains affected by incidents involving armed separatist groups and banditry, particularly in the regions of Bignona and Sindian.
Pick pocketing and street crime (including in taxis), occasionally involving violence, are common in parts of Dakar, particularly around Place de l'Independence, the central area of the Plateau, the Western Corniche, and the airport. You should take sensible precautions, avoid walking alone in the late afternoon and after dark and avoid carrying valuables in public.
Cruisers taking the normal precautions (nothing of value in sight, only small amounts of money in the pocket, establishing contact with locals and shops near the anchorage, buying from locals etc.) report feeling very safe here, both at anchor and on land.
Last updated November 2015.
The climate is tropical with a rainy season between July and September. The winter months, from November to March, have more pleasant weather. The prevailing winds are northerly, although occasionally from December to May a dust laden harmattan blows from across the desert. Drought is sometimes a problem north of the Gambia river.
For links to free global weather information, forecast services and extreme weather information see the Noonsite Weather Page.
Dakar * , St Louis * , Ziguinchor *
* indicates port of entry


Natural Language Processing Project : Sentiment Analysis
Enter Text for which Sentiment will be predicted...
Predict
Made with ❤ by Lepsy Goyal : 101983018


{% extends 'layout.html' %} {% block headers %}
This map animates earthquake events over time based on user-defined parameters. Pause the animation to click on earthquakes and view their details. Results are limited to 20,000 events.
Data provided by the USGS Earthquake Catalog.


OperationType
public enum OperationType : Int
Represents all blockchain operation types Operations
-
Undocumented
Declaration
Swift
case transferOperation
-
Undocumented
Declaration
Swift
case limitOrderCreateOperation
-
Undocumented
Declaration
Swift
case limitOrderCancelOperation
-
Undocumented
Declaration
Swift
case callOrderUpdateOperation
-
Undocumented
Declaration
Swift
case fillOrderOperation
-
Undocumented
Declaration
Swift
case accountCreateOperation
-
Undocumented
Declaration
Swift
case accountUpdateOperation
-
Undocumented
Declaration
Swift
case accountWhitelistOperation
-
Undocumented
Declaration
Swift
case accountUpgradeOperation
-
Undocumented
Declaration
Swift
case accountTransferOperation
-
Undocumented
Declaration
Swift
case assetCreateOperation
-
Undocumented
Declaration
Swift
case assetUpdateOperation
-
Undocumented
Declaration
Swift
case assetUpdateBitassetOperation
-
Undocumented
Declaration
Swift
case assetUpdateFeedProducersOperation
-
Undocumented
Declaration
Swift
case assetIssueOperation
-
Undocumented
Declaration
Swift
case assetReserveOperation
-
Undocumented
Declaration
Swift
case assetFundFeePoolOperation
-
Undocumented
Declaration
Swift
case assetSettleOperation
-
Undocumented
Declaration
Swift
case assetGlobalSettleOperation
-
Undocumented
Declaration
Swift
case assetPublishFeedOperation
-
Undocumented
Declaration
Swift
case proposalCreateOperation
-
Undocumented
Declaration
Swift
case proposalUpdateOperation
-
Undocumented
Declaration
Swift
case proposalDeleteOperation
-
Undocumented
Declaration
Swift
case withdrawPermissionCreateOperation
-
Undocumented
Declaration
Swift
case withdrawPermissionUpdateOperation
-
Undocumented
Declaration
Swift
case withdrawPermissionClaimOperation
-
Undocumented
Declaration
Swift
case withdrawPermissionDeleteOperation
-
Undocumented
Declaration
Swift
case committeeMemberCreateOperation
-
Undocumented
Declaration
Swift
case committeeMemberUpdateOperation
-
Undocumented
Declaration
Swift
case committeeMemberUpdateGlobalParametersOperation
-
Undocumented
Declaration
Swift
case vestingBalanceCreateOperation
-
Undocumented
Declaration
Swift
case vestingBalanceWithdrawOperation
-
Undocumented
Declaration
Swift
case customOperation
-
Undocumented
Declaration
Swift
case assertOperation
-
Undocumented
Declaration
Swift
case balanceClaimOperation
-
Undocumented
Declaration
Swift
case overrideTransferOperation
-
Undocumented
Declaration
Swift
case assetSettleCancelOperation
-
Undocumented
Declaration
Swift
case assetClaimFeesOperation
-
Undocumented
Declaration
Swift
case bidCollateralOperation
-
Undocumented
Declaration
Swift
case executeBidOperation
-
Undocumented
Declaration
Swift
case createContractOperation
-
Undocumented
Declaration
Swift
case callContractOperation
-
Undocumented
Declaration
Swift
case contractTransferOperation
-
Undocumented
Declaration
Swift
case changeSidechainConfigOperation
-
Undocumented
Declaration
Swift
case accountAddressCreateOperation
-
Undocumented
Declaration
Swift
case transferToAddressOperation
-
Undocumented
Declaration
Swift
case generateEthAddressOperation
-
Undocumented
Declaration
Swift
case createEthAddressOperation
-
Undocumented
Declaration
Swift
case depositEthOperation
-
Undocumented
Declaration
Swift
case withdrawEthOperation
-
Undocumented
Declaration
Swift
case approveWithdrawEthOperation
-
Undocumented
Declaration
Swift
case contractFundPoolOperation
-
Undocumented
Declaration
Swift
case contractWhitelistOperation
-
Undocumented
Declaration
Swift
case sidechainIssueOperation
-
Undocumented
Declaration
Swift
case sidechainBurnOperation


--- layout: page title: "About" id: "about" description: "Hey, this is TautCony." header-img: "img/about-bg.jpg" ---


/**
* Created by Jörg Amelunxen on 05.11.2014.
*
* @class angular_module.controllersModule.MessageCtrl
*
* This controller implements the functions for receiving and sending private messages
*/
controllersModule.controller('MessageCtrl', ['$scope','$http', '$routeParams','commonTaskService', function($scope,$http,$routeParams,commonTaskService) {
var that = this;
this.debug = false;
this.errorObject = {
content:"Connection Error",
sender:"System"
};
this.messageThatGetsCurrentlyCreated = {};
this.messages = [{ }];
this.detailMessage = {
title : "MyTitle",
content: "MyContent"
};
/**
* Fetches the messages given the name of it's receiver.
* The data is stored internally in that.messages.
*
* @param recName the name of the receiver.
*/
this.getMessagesByReceiverName = function(recName){
$http.get('/admin/messages/all/'+recName).
success(function(data, status, headers, config) {
that.messages = data;
Iif(that.debug == true){
console.log("info MessageCtrl: getting message data");
}
}).
error(function(data, status, headers, config) {
that.messages = that.errorObject;
});
};
/**
* Fetches a concrete message by its uID.
* The message is stored internally in that.detailMessage.
*
* @param messageID the uID of the message
*/
this.getMessageByID = function(messageID){
$http.get('/admin/messages/view/'+messageID).
success(function(data, status, headers, config) {
that.detailMessage.title = data[0].title;
that.detailMessage.content = data[0].content;
Iif(that.debug == true){
console.log("info MessageCtrl: getting message data of message " + messageID);
}
}).
error(function(data, status, headers, config) {
that.messages = that.errorObject;
});
};
/**
* Sends a new message given the uID of the sender
*
* @param emailOfTheSender the uID resp. email address of the sender
*/
this.sendMessage = function(emailOfTheSender){
var uID = commonTaskService.generateUID(that.messageThatGetsCurrentlyCreated.title+that.messageThatGetsCurrentlyCreated.receiver+
that.messageThatGetsCurrentlyCreated.content);
var tempMessage = commonTaskService.createMessageObject(uID,that.messageThatGetsCurrentlyCreated.receiver, emailOfTheSender,
that.messageThatGetsCurrentlyCreated.title, that.messageThatGetsCurrentlyCreated.content);
commonTaskService.sendPrivateMessage($http, tempMessage, that.debug);
};
/**
* Deletes a message given its uID
*
* @param messageID of the message that should be deleted
*/
this.deleteMessage = function(messageID){
/* remove from backend */
Iif(that.debug == true){
console.log("info MessageCtrl: message with id " + messageID + " will be deleted ");
}
$http.delete('/admin/messages/'+messageID).
success(function(data, status, headers, config) {
Iif(that.debug == true){
console.log("info MessageCtrl: message with id " + messageID + " has been deleted ");
}
/* remove from frontend, too */
var newValues = [];
for(var i=0; i < that.messages.length; i++){
if(that.messages[i].uID != messageID){
newValues.push(that.messages[i]);
}
}
that.messages = newValues;
}).
error(function(data, status, headers, config) {
that.messages = that.errorObject;
if(that.debug == true){
console.log("error MessageCtrl: message with id " + messageID + " has NOT been deleted ");
}
});
};
/* update parameter if needed */
Eif($routeParams.recName != undefined){
Iif(this.debug)
console.log("info MessageCtrl: fetching messages for user " + $routeParams.recName);
that.getMessagesByReceiverName($routeParams.recName);
}
Eif($routeParams.messageID != undefined){
that.getMessageByID($routeParams.messageID);
}
Iif($routeParams.toUserUID != undefined && $routeParams.title != undefined){
that.messageThatGetsCurrentlyCreated.receiver = $routeParams.toUserUID;
that.messageThatGetsCurrentlyCreated.title = $routeParams.title;
}
}]); |


setxt(1) - [NCURSES] set xterm(1) attributes using a screen or line mode (LICENSE:PD)
Synopsis
Description
Options
Example
Author
License
setxt [keywords] -rows NN -cols NN -right NN -down NN -fn fontname -fsize fontsize -bg background_color -fg foreground_color -cr cursor_color -cn [0 color 1 color 2 color 3 color ...|] -xrdb [NAME] -o windowname -help -version
If no values are specified on the command line a screen interface is displayed that allows setting the background, foreground, cursor color, font size, and window size of an xterm(1) terminal emulator window using ncurses(3f)/fixedform(3f).If options are specified on the command line the values are set and the screen mode is not launched.
VALUES The allowed keywords are:
o 80 set terminal width to eighty characters o 132 set terminal width to 132 characters o raise raise to top of window stack o lower lower to back of window stack o iconify iconify window o uniconify uniconify window o icon toggle icon state o maximize make xterm(1) window size of display o restore restore window size to before the last "maximize" o vt102 switch to VT102 terminal emulator mode o tek switch to Tektronix 4010 terminal emulator mode -rows NN change number of rows of window to specified value -cols NN change number of columns of window to specified value -right NN distance from left display edge to place upper left corner -down NN distance from upper display edge to place upper left corner -fn FONTNAME change to specified font name -fsize NN guess at a fixed font of specified size -bg CNAME specify background color by name or hex value "#RRGGBB" -fg CNAME specify foreground color by name or hex value "#RRGGBB" -cr CNAME specify cursor color by name or hex value "#RRGGBB" -cn NN CNAME... define terminal pen colors by number "NNN $RRGGBB". -title TITLE window title -name TITLE icon name -nt TITLE icon name and title --alias list some common bash shell aliases that use setxt(1). These are typically added to the ~/.bashrc file or sourced: setxt -alias >./junk;source ./junk;rm ./junk;alias
-o WINDOWNAME If your window manager supports multiple virtual displays by defining the property WM_OCCUPANCY (use xprop -id $WINDOWID to see) then you can move your windows to specific virtual displays; usually by number or by name. The name "all" is typically special and makes the window visible in all the virtual displays. This works for the ctwm(1) window manager.
If your window manager has assigned the property WS_OCCUPATION as seen by entering
xprop -id $WINDOWID : WM_OCCUPATION(STRING) = "2" WM_OCCUPATION(STRING) = "Two" :you can specify which virtual display to display on.
The following options will return the current value if given a null value:
--xrdb NAME print out current terminal settings as a set of X11 resources that can be added to your ~/.Xresources file so that you can launch terminals with those attributes with "xterm -name NAME" For example: setxt -xrdb EDIT|xrdb -merge xterm -name EDIT
--help display help and exit --version display version information and exit -fn -bg -fg -cr -rows -cols -down -right -iconstate -cn |0 1 2 ...
By itself, -cn will list the first 16 pen colors. Given a list of numbers, it will query those specific pen numbers.
Sample usage: # if do not have xterm settings set might need to enter setxt -xrdb|xrdb -merge # and then try the commands in xterm(1) windows launched after thissetxt # bring up screen interface
C-shell alias cd cd \!*; esc -nt
setxt -fn *--14*-c-* # find a font of specified size setxt -fn *--15*-m-* # find a font of specified size setxt -rows 40 -cols 132 # set terminal size setxt -bg brown -fg white -cr red setxt -bg #ff00ff setxt -cn 0 red 1 green 2 cyan
John S. Urban
Public Domain
| setxt (1) | January 01, 2020 |


About
We are located at 1818 E 9th Ave, Tampa, FL 33605, near the Ybor museum.
"Our business has been passed down for decades from father to son (or in this case, Adam to Adam). We think it's best that we are able to keep our tradition alive through our family and strong roots in southern cooking and exquisite cocktails."
Food & Drink
Latest
We've extended our popular 2 for 1 cocktail offer normally just on Saturdays to Mondays too! 5-7pm
Thursday September 28, 2017
We've extended our popular 2 for 1 cocktail offer normally just on Saturdays to Mondays too! 5-7pm
Thursday September 28, 2017
We've extended our popular 2 for 1 cocktail offer normally just on Saturdays to Mondays too! 5-7pm
Thursday September 28, 2017
Find


[Gecode] New constraint: regular for describing value patterns
Christian Schulte
schulte at imit.kth.se
Tue Nov 9 10:02:35 CET 2004
Dear all,
I added regular as another new global constraint which constrains
the sequence of values of a variable array to be a member of some
regular language.
The constraint is posted by
regular(home, x, dfa)
where home is the home-space, x is an array of integer variables,
and dfa is a deterministic finite automaton describing the
regular language of interest (see below).
The propagator is domain-consistent, takes per invocation O(nt)
time in the worst-case, where n is the number of variables and t
is the number of transitions of the underlying DFA. The algorithm
is incremental with respect to the changed variables (only the
minimal number of variables is considered per invocation). So in
average, it should be more like O(t) (and also typically only a
fraction of the transitions is considered).
The algorithm is based on the very interesting paper:
* Gilles Pesant, A Regular Language Membership Constraint
* for Finite Sequences of Variables, CP 2004.
* Pages 482-495, LNCS 3258, Springer-Verlag, 2004.
However, the algorithm I implemented is much simpler but less
incremental (due to how variables are implemented, one would only
gain from Pesant's version only if value removal were constant
time!).
DFA by transitions
------------------
A dfa can be specified by creating an instance of DFA, as an
example consider a dfa which allows alternating sequences of 0
and 1 with equal number of 0s and 1s:
Transitions are specified by giving triples (of type
DFA::Transition) of i_state (states are non-negative integers),
symbol (normal integers describing values), and o_state:
i_state | symbol | o_state
--------------------------
0 | 0 | 1
0 | 1 | 2
1 | 1 | 0
2 | 0 | 0
(basically, the (partial) transition function d is defined by
d(i_state,symbol) = o_state
)
In C++:
DFA::Transition t[] = {
{0,0,1}, {0,1,2}, {1,1,0}, {2,0,0}, {-1,0,0}
};
The {-1,0,0} terminates the transition specification.
The single final state is 0, which can be described by
int f[] = {0,-1};
Again, -1 is used as endmarker.
Then the dfa can be created as
DFA a(0,t,f); // 0 is start state
By default, the dfa is minimized and unreachable states are
eliminated (minimization can be supressed by giving false as
additional argument).
DFA by regular expressions
--------------------------
A dfa can also be described by a regular expression where the
symbols are values and the operators are | for choice, + for
concatenation and prefix * for Kleene-star. Additionally, support
for repitition is provided (see below).
A regexp r for the empty string is created by
REG r;
A regexp r for the integer i is created by
REG r(i);
If r1 and r2 are REGs, then also (with normal C++ precedence)
r1+r2, r1|r2, *r1
and
r1(n,m)
(repeat r1 at least n- and at most m-times)
and
r1(n)
(repeat r1 at least n-times)
By DFA a(r) a dfa a is created for the REG r.
Both dfa creation and conversion from a regexp to a dfa is not
hyper-efficient but also not completely dumb. Regexp to dfa is of
course exponential in the number of symbols in the worst case (subset
construction) and
minimization is cubic in the number of states (that is far from
being optimal...). Typically, even in nasty cases they work fast even on
automata
up to thousands of states. But that doesn't really matter as DFA
construction is only done once and dfa's can be reused for many
propagators.
Have fun!
Christian
PS: The constraint is useful for rostering problems, where
typically a specialized version called stretch is used. I still
fiddle with this one...
PPS: Sometimes memory management for DFA segfaults under Windows,
even though everything works fine on Linux (even valgrind likes
it). Have to look.
--
Christian Schulte, http://www.imit.kth.se/~schulte/
More information about the gecode-users
mailing list


Managing TripleO and OpenStack with ManageIQ
Created by Ladislav Smola
Control All the Things
Automate, optimize, and control your cloud and virtualization services
Openstack Cloud in ManageIQ == TripleO Overcloud (or any end user cloud)
Openstack Infra in ManageIQ == TripleO Undercloud (RHEL OSP Director)
OpenStack cloud
- Inventory collection
- Capacity and utilization
- Smart state analysis(fleecing)
- Control and Policies
- Drift state
- Automate
Smart state analysis attributes will be later in the presentation
Smart state analysis
In cloud, we don't have access to the VMs. We don't own the private keys.
- Snapshot the VM
- Mount the VM
- Perform Smart state analysis of the files
- Show users, groups, packages, init processes and files
- You need enough /tmp space in your appliance!
Drift state
Comparing entities and attributes we collect with their historical values. Examples later in the presentation.
Control and Policies
We can leverage all the entities we collect by Inventory collection and Fleecing
- Alerts - notifications using email, SNMP traps, internal events
- Compliance - pass/fail check, reporting (e.g. make sure none of my VMs suffer from the HeartBleed, ShellShock, etc.)
- Policy enforcement - E.g. someone tries to clone a VM that is not allowed to clone, ManageIQ stops the action
Automate example showing deployment of the VM
- In the UI, we fill what VMs we want to deploy, picking flavor, network, number of VMs, etc. Similar to Horizon.
- Deploying generates a request, that has to be approved.
- Approving invokes a provisioning workflow.
- After finishing provisioning workflow, we can invoke another workflow, e.g. Ansible Tower.
Request approval workflow
Override the Placement, to pick the most utilized private network
Override the Post provision, to retry when deployed to full private network
When deployment to private network succeeds, autoassociate floating ip
OpenStack infrastructure (RHEL OSP Director)
- Inventory collection
- Smart state analysis
- Drift state
- Comparing nodes
- Autoscaling using automate
Deployment Role Inventory
Smart state analysis details in the node
Specify what files to collect by smartstate
openstack-nova-compute service on a node went down.
Host custom attributes diff
Autoscaling of compute hosts using automate
Assign the alert profile to the compute deployment role
Create a custom event handler
Create a custom class, instance and method for autoscaling
Observe an autoscaling in the timeline
Observe an autoscaling in the charts
Q&A
Contacts:
- My GitHub https://github.com/Ladas
- Ask me/us directly on: https://gitter.im/ManageIQ/manageiq
- ManageIQ main repo https://github.com/ManageIQ/manageiq
- Yes, we are hiring!


Sorry, You are using an old or outdated browser, try
Firefox
Rubber
Brush
10
20
40
60
Tool
Colour
Radius
Save
To save the image, click Save and right click the image and select "Save Image As..."


The disciplined power of Hindustani vocals wins the heart of many. Think your voice can win millions of hearts? Here is the chance for you to show your talent in Vibrazione.
Click here To Register..


DTGov Dashboard
/
Running Processes
Workflows
Processes
Workflows
Displaying
1-11
of
37
No workflows found.
Finding workflows, please wait...
Workflow
Description
overlord.demo.SimpleReleaseProcess
Here it is the description
Process Filters
Artifact
Workflow
Any
DeploymentProcess
ProjectProcess
Status
Any
Running
Stopped
Stopped
Clear All Filters
Processes
Displaying
1-11
of
37
No processes found.
Finding processes, please wait...
Artifact
Workflow
Status
Actions
dtgov-demos-project-requirements-1.3.0.Beta1.jar
overlord.demo.SimpleReleaseProcess
Running
«
1
2
3
4
»


It appears we don't have a mobile website at the moment. Please use our website on a desktop or the like.
For now, please enjoy this image of a cat


The following Regulations shall apply to all categories of research scholars pursuing courses of study and research leading to the Doctor of Philosophy degree:
Note: He and His imply he/she and his/her, respectively here in after.
R.1.1 Full time Research Scholar
R.1.2 Part-time Research Scholar
R.2.1 The University fellowship shall be admissible to full-time Research scholars (Indian nationals only) provided they are not receiving financial assistance from any agency. Fellowship awardees shall not be permitted to undertake any employment during that period. A separate office order shall be issued by the Registrar of the University about scholarship grant admissible after due approval from the competent bodies from time to time. In addition, the students are given contingency grant in accordance with the rules of the University.
R.2.2 The fellowship/contingency shall be granted initially for three years and it can be extended for subsequent years subject to the satisfactory performance of the student evaluated by Annual Progress Review Committee (APRC). The APRC shall submit its recommendation to the concerned DRC for consideration of such extension. The fellowship shall be given for maximum duration of five years or up to the thesis submission whichever is earlier.
R.2.3 The University reserves the right to terminate the fellowship/contingency of any research scholar at any stage, if the progress of research work is not satisfactory.
R.2.4 The research scholar getting University fellowship shall be required to give four hours of teaching assistance per week or as modified from time to time by the University.
R.3.1 In case a research supervisor is transferred to a college outside the jurisdiction of the University, registration of such research supervisor in this University shall remain under suspension for fresh registration of research scholars till he is re-transferred in the college under jurisdiction of this University. However, the supervisor concerned shall continue to supervise the already registered research scholars. On retransfer the provision of suspension shall be re-invoked.
R.3.2 No research scholar shall be allowed to register independently under a teacher two years prior to his superannuation. The research scholars who are registered with him prior to superannuation shall continue. No retired teachers of any University or affiliated college shall be allowed to register a research scholar independently. However, Professor Emeritus or a retired teacher having major research projects from national funding agencies shall be allowed to register three research scholars as a whole. The member of the existing teaching faculty shall be the co- supervisor in such cases.
R.3.3 Limit for supervising Research Scholars by Supervisors
The maximum limit for supervising PhD students at a time shall be as follows:
Professor: 4
Associate Professor: 3
Assistant Professor: 2
A research scholar if supervised by two or more than two supervisors shall be counted as 0.5 for each supervisor.
However, before deciding the number of students for each category of faculty, the DRC shall take into consideration the availability of infrastructure and the teaching commitments of the supervisor. The maximum number of research scholars
permitted as above may be revised by the University as and when such recommendations are made by the Academic Council
R.4.1 Notification/ and Procedures for PhD admission
Applications for admission to the PhD programme shall be invited once in an academic year. All applicants seeking admission to a PhD programme through RTU Doctoral Admission Test (RTU-DAT) shall have to apply in prescribed application form.
Every research scholar shall be required to renew the registration every semester till the submission of the thesis. The renewal of registration every semester shall be subject to the satisfactory progress in his research work as recommended by DRC.
R.6.1 Every research scholar having been admitted to a PhD programme shall be required to undertake and successfully complete the prescribed course-work of one semester duration. The course work shall include minimum four papers of three hours per week. The course work shall be treated as pre-PhD preparations.
R.6.2 The first paper shall be on Research Methodology, which may include quantitative methods, research aptitude, computer applications as suitable to the PhD programme
R.6.3 The second and third paper as per requirement of the area of research and the same shall be designed/ proposed by the supervisor and approved by DRC.
R.6.4 Each course work shall be of 100 marks, out of which 40 marks shall be based on Mid-term evaluation by way of term test/assignment/Mini Project. Remaining 60 marks shall be based on end term examination.
R.6.5 The course work assessment including the end term examination shall be carried out by respective course instructor.
R.6.6 The fourth course of 100 marks shall involve reviewing of published research work in the relevant field under supervision of the assigned supervisor. The evaluation shall be in the form of report submission (40 marks) and presentation (60 marks). The evaluation shall be done by the panel of two experts (including one supervisor) to be appointed by DRC Chairperson.
R.6.7 The minimum qualifying marks in each component of the course work shall be 50% .
R.6.8 In case the student fails in any paper of course work, he shall be allowed to reappear in the same after one month of the term end examination with maximum of 2 such attempts.
R.6.9 The student shall be permitted to pursue his course work requirement only at the University premises/recognized research centers.
R.6.10 A PhD student irrespective of the category (R.1), while pursuing course work, must have at least 75% attendance in each course in which he is registered. If the student does not have the required minimum percetage of attendance in any subject, they shall be detained in those subjects, and shall have to reappear for respective course work again, as and when they are offered and shall maintain the attendance required and then appear for the examination.
R.7.1 A research scholar may be permitted by the Dean (Research) on the recommendation of supervisor to withdraw from all the courses registered by him or the entire semester, on medical grounds supported by a medical certificate from the University Medical Officer or on any other genuine reasons. The medical certificate issued by a registered Medical Practitioner shall also be acceptable in those cases where the research scholar has valid reasons for his absence from the University/Institute/Centre. Withdrawal may also be granted by the Research Board on the recommendation of the DRC and the Dean (Research) provided it is established that the research scholar cannot pursue his studies for the reasons beyond his control.
R.7.2 Research scholar should present the medical certificate in support of his absence on health reasons within two days of his rejoining the institute, if not produced already. Withdrawal shall not be granted retrospectively.
R.7.3 The period of authorized absence in the semester should not be less than eight weeks of contact period for semester withdrawal to be granted. Regularity in attending the classes and satisfactory performance in the mid-term examinations, if any, held prior to the date of application for withdrawal are the factors which would be taken into account while recommending/granting withdrawal.
R.7.4 Any semester withdrawal shall count towards the maximum limit of twelve/sixteen semester as stipulated in the ordinance.
Registration of a research scholar shall be cancelled in any one of the following eventualities, after due approval of Dean (Research):
R.8.1 If he absents himself for a continuous period of four weeks without prior intimation/sanction of leave.
R.8.2 If he resigns from the PhD programme and the resignation is duly recommended by the Supervisor.
R.8.3 If he fails to renew his registration in any semester/annual subject to the provision contained in the Ordinances and the Regulations.
R.8.4 If his annual progress is found unsatisfactory.
R.8.5 If he is found involved in an act of misconduct and/or indiscipline and termination has been recommended by Dean (Student Welfare). ).
R.9.1 Each research scholar shall submit hard copies of progress report of their research work in duplicate, with supervisor and co-supervisor signatures and present the progress seminar every year before APRC latest by 31st July, till synopsis is submitted to DRC through supervisor(s). The APRC shall evaluate and send the evaluation report in the prescribed form to the DRC Chairperson for appraisal with anyone of the following recommendations :
R.9.2 If the research scholar does not present progress report by stipulated date, financial penalty of Rs. 1000/- per week delay shall be imposed. If research scholar fails to present progress report by 30th September, the admission is liable to be cancelled. However, under unavoidable circumstances, the supervisor may recommend for relaxation in presentation of progress report beyond 31st July to the DRC for approval of Research Board.
R.9.3 The Chairperson of DRC shall coordinate collection of progress reports signed by research scholar and his supervisor(s) every year.
R.10.1 The research scholar shall submit the synopsis of his work at least two months prior to submission of the thesis.
R.10.2 The DRC may relax specified period of submission of synopsis on the recommendation of the supervisor by assigning the reasons for the same.
R.11.1 The PhD thesis must contain the following copyright certificate in the beginning of the thesis, on a separate page on the left side:
© RAJASTHAN TECHNICAL UNIVERSITY KOTA, 20….
(Year)
ALL RIGHTS RESERVED
R.11.2 The research scholar for the degree shall submit four copies of the thesis (Hard and soft) with a soft cover. In case of co- supervision, five copies of thesis shall have to be submitted by the research scholar.
The following categories of research scholars may be given 50% tuition fee waivers:
R.12.1 All full-time University research scholars including QIP. The University research scholars include those who obtain scholarship through MHRD, CSIR & UGC, provided they are getting scholarship of the same values as that of MHRD, etc.
R.12.2 Research scholars admitted to PhD programme from DST, CSIR and other Government Organization, involved in research/development activities/Institutions.
R.12.3 Additional 25% fee waiver can also be given on case by case basis, the maximum number of such waivers being restricted to 50% of the University research scholars on roll. For grant of additional 25% fee waiver to the full-time University research scholars, the respective DRC shall assess the performance and consider the cases of the deserving scholars on case by case basis and shall submit the name(s) of the concerned research scholars to the Dean (Research) for approval of Research Board.
R.12.4 For the University staff pursuing PhD at the University including those getting assistantship from projects, the tuition fee is waived up to 75%.
R.13.1 A research scholar shall be entitled to avail leave as per Leave Rules/Attendance Rules formulated and amended from time to time by the University.
R.13.2 A full-time PhD research scholar, during his stay at the University/Centre shall be entitled to leave for 30 days including leave on medical grounds, per academic year. He shall not be entitled to mid-semester breaks, summer and winter vacation at the end of the first semester.
R.13.3 Leave beyond 30 days in an academic year may be granted (without fellowship) to a research scholar in exceptional case, by the Head of the Department on the recommendation of his supervisor concerned, subject to the following conditions:
R.13.4 The women research scholar shall be eligible for maternity leave with fellowship for a period not exceeding period specified by the state government during the tenure of the award.
R.14.1 Research scholar is required to route all his applications through his supervisor only.
R.14.2 Any doubt or dispute about the interpretation of these Regulations shall be referred to the Vice Chancellor, whose decisions shall be final and binding.
R.14.3 Notwithstanding anything contained in these Regulations, all categories of the research scholars shall be governed by the rules and procedures framed by the Academic Council in this behalf, and in force from time to time.
| Registrar | Chancellor |
|---|---|
| Rajasthan Technical University, | Rajasthan Technical University, |
| Kota | Kota |


The budget portal presents an exciting opportunity for members of the public, CSOs, academia, business and government departments to contribute and to:
Provide input on the most USEFUL budget information produced by the National Treasury and by other government institutions.
Upload USEFUL budget information generated by non-governmental institutions and citizens.
Indicate which data sets and spreadsheet formats are USEFUL.
Help develop USEFUL illustrations and aggregation tools for different levels of technical sophistication.
Participate on interactive platforms that are USEFUL alongside producers and other users of information and contribute to the publication of additional information.
Have USEFUL and informed discussions in different government policy areas about service delivery.
Ultimately contribute to developing a portal that promotes meaningful engagement and fosters public participation in the budget process.


I opened up Visual Studio Code today with an intent to use it for all my editing, documenting, and coding today. My priorities today, on a day I’ve taken off from work, is to work on my upcoming Terraform Course, a little Go coding, and also a few general tasks and notes. While I work on these priorities, you dear reader, get the benefit of my random notes. ;)
Shortcut Keys
There are a few shortcut keys I’ve used so frequently it has become paramount to remember them. Otherwise it’s just wasteful trying to look them up over and over.
Mac OS
- Word Wrap
⌥ + z
that’s the option key plus the letterz
. - Zen Mode [
⌘ + k
] thenz
which involves pressing the command key and thenz
, then releasing those now that the command key plusz
state has been initiated. With the IDE in this state, then pressz
and Zen Mode will begin. This is a beautiful experience once you get the shortcut keys down and really want to just look at code, content, or whatever you’re thinking through. - Explorer
⌘ + b
that is the command key plus the letterb
key. This brings up the explorer, in Zen Mode or regular mode. - Console
⌘ + j
that is the command key plus the letterj
key. This brings up the section of the IDE that has the problems, output, debug console, and terminal, with the debug console in focus. - Terminal
^ + `
which is the control key plus the tilde or back tick key and this brings up the previously stated panel, with the terminal in focus. Be prepared for this to take a second or two when first opening, as the engine underneath has to initiate a terminal session and is sometimes a bit clunky in starting.
Linux
- Word Wrap
Alt + z
- Zen Mode [
Ctrl + k
] thenz
. As the Mac version of the shortcut command,Ctrl + k
initiates the IDE state, release those keys and then pressz
puts the IDE into Zen Mode. - Explorer
Ctrl + b
brings up the explorer. - Console
Ctrl + j
this brings up the console with the problems, output, debug console, and terminal, with the debug console in focus. - Terminal
Ctrl + `
which is the control key plus the tilde or back tick key. See above for specifics.


Installation
The only dependency is AngularJs 1.5.0 or higher.
Install with NPM:
npm install tree-chooser --save
Add the file:
require('tree-chooser');
require('tree-chooser/dist/tree-chooser.css');
//or the old-fashioned way
< script src="lib/tree-chooser/dist/tree-chooser.js"></script>
< link rel="stylesheet" href="lib/tree-chooser/dist/tree-chooser.css">
Use the module:
angular.module('app', ['tree-chooser']);


Utah Power Systems LLC is a unique provider of renewable energy products and services, including Organic Rankine Cycle (ORC) systems. Our experts in design, development, and engineering procurement and construction (EPC), can evaluate waste heat or other heat sources and recommend the best solution..
Providers of Organic Rankine Cycle (ORC) renewable energy products that convert waste heat or other heat sources into clean renewable energy
This diagram shows how the ORC works by capturing a heat source, expanding a working fluid, and driving a generator to produce electricity. We offer a complete service, from site evaluation to design recommendations. We then provide the proper equipment, installation, service, and maintenance, and when required, financing in either a conventional manner or on a lease or purchase power agreement (PPA) on a per kW basis.
Good Earth Mechanics (GEM) is the innovator of Salinity Gradient Solar Ponds. These specially designed ponds capture the energy of the sun in a high salt concentration brine, producing temperatures to over 200 degrees. This heat is kept in place by a gradient layer topped by a low salinity layer of nearly fresh water. Heat can be stored for up to 42 days in the absence of sunlight and is always availble to power ORC units. Over 10MW of electricity can power over 9,000 homes with clean renewable electricity from a one square mile pond site.
Geothermal resources are undergound or at the surface in many areas worldwide. These geothermal resources provide sufficient heat to power ORC systems and provide large quantities of electricity. Many sites produce 50-150 megawatts or more in ORC-generated electricity. With the innovations of Good Earth Mechanics, salinity gradient solar ponds utilize high salt concentrations of brine to provide power. This forms solar batteries in lakes that power ORC systems and produce clean electricity. A six acre salinity gradient pond can produce up to 300kw of continuous power.


--- layout: default title: Home ---
I am Rohit, solving first world problems as a Software Engineer at TreatWell in Amsterdam. Previously I was helping people go around the world at de Vakantie Discounter. I am a Journeyman Functional Programmer, dabbling in Scala and Clojure at work and Haskell at home. I have experience in developing for the web, mobile and cloud based distributed applications. I consider myself as language and technology agnostic. And, I am good at flying Vim.
I could be contacted via email.


Let's talk product
This is the paragraph where you can write more details about your product. Keep you user engaged by providing meaningful information. Remember that by this time, the user is curious, otherwise he wouldn't scroll to get here. Add a button if you want the user to see more.
chat
Work With Any Team
Whether it’s for work or even the next family vacation, Trello helps your team.
done_all
Work With Any Team
Whether it’s for work or even the next family vacation, Trello helps your team.
fingerprint
Work With Any Team
Whether it’s for work or even the next family vacation, Trello helps your team.


This page helps you design your Apache Beam pipeline. It includes information about how to determine your pipeline’s structure, how to choose which transforms to apply to your data, and how to determine your input and output methods.
Before reading this section, it is recommended that you become familiar with the information in the Beam programming guide.
When designing your Beam pipeline, consider a few basic questions:
Read
transforms you’ll need to apply at the start of your pipeline.PCollection
s of key/value pairs; you’ll need to determine if and how your data is keyed and how to best represent that in your pipeline’s PCollection
(s).Write
transforms you’ll need to apply at the end of your pipeline.The simplest pipelines represent a linear flow of operations, as shown in Figure 1 below:
Figure 1: A linear pipeline.
However, your pipeline can be significantly more complex. A pipeline represents a Directed Acyclic Graph of steps. It can have multiple input sources, multiple output sinks, and its operations (PTransform
s) can both read and output multiple PCollection
s. The following examples show some of the different shapes your pipeline can take.
It’s important to understand that transforms do not consume PCollection
s; instead, they consider each individual element of a PCollection
and create a new PCollection
as output. This way, you can do different things to different elements in the same PCollection
.
You can use the same PCollection
as input for multiple transforms without consuming the input or altering it.
The pipeline illustrated in Figure 2 below reads its input, first names (Strings), from a single source, a database table, and creates a PCollection
of table rows. Then, the pipeline applies multiple transforms to the same PCollection
. Transform A extracts all the names in that PCollection
that start with the letter ‘A’, and Transform B extracts all the names in that PCollection
that start with the letter ‘B’. Both transforms A and B have the same input PCollection
.
Figure 2: A pipeline with multiple transforms. Note that the PCollection of the database table rows is processed by two transforms. See the example code below:
PCollection<String> dbRowCollection = ...;
PCollection<String> aCollection = dbRowCollection.apply("aTrans", ParDo.of(new DoFn<String, String>(){
@ProcessElement
public void processElement(ProcessContext c) {
if(c.element().startsWith("A")){
c.output(c.element());
}
}
}));
PCollection<String> bCollection = dbRowCollection.apply("bTrans", ParDo.of(new DoFn<String, String>(){
@ProcessElement
public void processElement(ProcessContext c) {
if(c.element().startsWith("B")){
c.output(c.element());
}
}
}));
Another way to branch a pipeline is to have a single transform output to multiple PCollection
s by using tagged outputs. Transforms that produce more than one output process each element of the input once, and output to zero or more PCollection
s.
Figure 3 below illustrates the same example described above, but with one transform that produces multiple outputs. Names that start with ‘A’ are added to the main output PCollection
, and names that start with ‘B’ are added to an additional output PCollection
.
Figure 3: A pipeline with a transform that outputs multiple PCollections.
The pipeline in Figure 2 contains two transforms that process the elements in the same input PCollection
. One transform uses the following logic:
if (starts with 'A') { outputToPCollectionA }
while the other transform uses:
if (starts with 'B') { outputToPCollectionB }
Because each transform reads the entire input PCollection
, each element in the input PCollection
is processed twice.
The pipeline in Figure 3 performs the same operation in a different way - with only one transform that uses the following logic:
if (starts with 'A') { outputToPCollectionA } else if (starts with 'B') { outputToPCollectionB }
where each element in the input PCollection
is processed once. See the example code below:
// Define two TupleTags, one for each output.
final TupleTag<String> startsWithATag = new TupleTag<String>(){};
final TupleTag<String> startsWithBTag = new TupleTag<String>(){};
PCollectionTuple mixedCollection =
dbRowCollection.apply(ParDo
.of(new DoFn<String, String>() {
@ProcessElement
public void processElement(ProcessContext c) {
if (c.element().startsWith("A")) {
// Emit to main output, which is the output with tag startsWithATag.
c.output(c.element());
} else if(c.element().startsWith("B")) {
// Emit to output with tag startsWithBTag.
c.output(startsWithBTag, c.element());
}
}
})
// Specify main output. In this example, it is the output
// with tag startsWithATag.
.withOutputTags(startsWithATag,
// Specify the output with tag startsWithBTag, as a TupleTagList.
TupleTagList.of(startsWithBTag)));
// Get subset of the output with tag startsWithATag.
mixedCollection.get(startsWithATag).apply(...);
// Get subset of the output with tag startsWithBTag.
mixedCollection.get(startsWithBTag).apply(...);
You can use either mechanism to produce multiple output PCollection
s. However, using additional outputs makes more sense if the transform’s computation per element is time-consuming.
Often, after you’ve branched your PCollection
into multiple PCollection
s via multiple transforms, you’ll want to merge some or all of those resulting PCollection
s back together. You can do so by using one of the following:
Flatten
transform in the Beam SDKs to merge multiple PCollection
s of the same type.CoGroupByKey
transform in the Beam SDK to perform a relational join between two PCollection
s. The PCollection
s must be keyed (i.e. they must be collections of key/value pairs) and they must use the same key type.The example depicted in Figure 4 below is a continuation of the example illustrated in Figure 2 in the section above. After branching into two PCollection
s, one with names that begin with ‘A’ and one with names that begin with ‘B’, the pipeline merges the two together into a single PCollection
that now contains all names that begin with either ‘A’ or ‘B’. Here, it makes sense to use Flatten
because the PCollection
s being merged both contain the same type.
Figure 4: Part of a pipeline that merges multiple PCollections. See the example code below:
//merge the two PCollections with Flatten
PCollectionList<String> collectionList = PCollectionList.of(aCollection).and(bCollection);
PCollection<String> mergedCollectionWithFlatten = collectionList
.apply(Flatten.<String>pCollections());
// continue with the new merged PCollection
mergedCollectionWithFlatten.apply(...);
Your pipeline can read its input from one or more sources. If your pipeline reads from multiple sources and the data from those sources is related, it can be useful to join the inputs together. In the example illustrated in Figure 5 below, the pipeline reads names and addresses from a database table, and names and order numbers from a Kafka topic. The pipeline then uses CoGroupByKey
to join this information, where the key is the name; the resulting PCollection
contains all the combinations of names, addresses, and orders.
Figure 5: A pipeline with multiple input sources. See the example code below:
PCollection<KV<String, String>> userAddress = pipeline.apply(JdbcIO.<KV<String, String>>read()...);
PCollection<KV<String, String>> userOrder = pipeline.apply(KafkaIO.<String, String>read()...);
final TupleTag<String> addressTag = new TupleTag<String>();
final TupleTag<String> orderTag = new TupleTag<String>();
// Merge collection values into a CoGbkResult collection.
PCollection<KV<String, CoGbkResult>> joinedCollection =
KeyedPCollectionTuple.of(addressTag, userAddress)
.and(orderTag, userOrder)
.apply(CoGroupByKey.<String>create());
coGbkResultCollection.apply(...);