Something to keep in mind: on Windows you need to make sure the DevKit for each Ruby version is
established. This gets tricky when you want Ruby 2.0 on your machine along with prior Ruby versions
because there are different DevKits for the 2.x branch versus previous branches.
Something to keep in mind: on Windows you need to make sure the DevKit for each Ruby version is established. This gets tricky when you want Ruby 2.0 on your machine along with prior Ruby versions because there are different DevKits for the 2.x branch versus previous branches.
Thank you for pointing that out, Jeff. This is a detail I forgot to mention.


{% extends "layout.html" %} {% block page_title %} Question page {% endblock %} {% block content %} Back Your details Email address This is how you will be contacted {% endblock %}
This is how you will be contacted


Before Change
previous = objects_by_name.get(name)
if previous:
previous_path, _ = previous
raise DuplicateNameError(
"An object with name {name!r} is already defined in "
"{previous_path!r}, will not overwrite with {obj!r} from "
"{current_path!r}.".format(
name=name,
previous_path=previous_path,
obj=obj,
current_path=current_path,
)
)
objects_by_name[name] = (current_path, obj)
return AddressFamily(
namespace=spec_path,
objects_by_name={
After Change
f"is also defined in {address_map.path!r}. Because both targets share the "
f"same namespace of {spec_path!r}, this is not allowed."
)
name_to_target_adaptors[name] = (address_map.path, target_adaptor)
return AddressFamily(
namespace=spec_path,
name_to_target_adaptors=dict(sorted(name_to_target_adaptors.items())),


Du Medical Service
Home
Doctor
Appointment
Logout
×
Doctor's Department
Doctor's Name
Date
Select slot
Submit
Cancel


This quick example will show you how to add an array to your JSON tree.
JSONNODE *n = json_new(JSON_NODE); json_push_back(n, json_new_a("RootA", "Hello World")); JSONNODE *c = json_new(JSON_ARRAY); json_set_name(c, "ArrayOfNumbers"); json_push_back(c, json_new_i(NULL, 16)); json_push_back(c, json_new_i(NULL, 42)); json_push_back(c, json_new_i(NULL, 128)); json_push_back(n, c); json_char *jc = json_write_formatted(n); printf("%s\n", jc); json_free(jc); json_delete(n);
The result will look like this:
{ "RootA" : "Hello World", "ArrayOfNumbers" : [ 16, 42, 128 ] }
The first line generates a new root node for us to work with. This node will contain the entire JSON structure we want to create. Note that, as mentioned in the documentation, any time you call a json_new… method, you are responsbile for freeing the memory allocated by the method. You can do this manually or by attaching the resulting node pointer to an existing node.
Line 2 creates a new JSON_STRING node, i.e. a node that will have a string value, and attaches the new node to the end of our original root node n. The json_new_a method will escape your string values when you go to write the final string.
Line 3 creates a new child node and this time we're declaring a type of JSON_ARRAY that states the node will contain a number of nameless children nodes. While it's possible to have different data types in the same array, you should keep them all the same and treat it as if it were a typed array. Note that you can have an array of JSON_NODE objects, so you're not limited to simple data types, just be aware that the array will ignore any node names if you have them set.
Lines 5 through 7 add values to the array, in this case they're all integer values. Because a JSON array cannot contain named values, the name parameter of json_new_i is set to NULL.
Line 8 appends the array to our root node.
9 and 10 retrieve the formatted JSON string and dump it to stdout.
11 frees memory allocated for our JSON string and 12 frees the entire tree structure.
Chris Larsen 2010-10-08


記帳小管家
Brief Report
Charts
Time Analysis
Component Analysis
Table
Calender
User
Logout
Brief Report
Charts
收支分析
+
設定日期區間
收支
支出狀況
飲食支出
Ready to Leave?
×
Select "Logout" below if you are ready to end your current session.
日期範圍
×
Start Year
Start Month
Jan
Feb
March
Apirt
May
June
July
Aug
Sep
Oct
Nov
Dec
End Year
End Month
Jan
Feb
March
Apirt
May
June
July
Aug
Sep
Oct
Nov
Dec


| C.V.Raman |
|
- Fellow of the Royal Society (1924)
- Knight Bachelor (1930)
- Matteucci Medal (1928)
- Hughes Medal (1930)
- Nobel Prize in Physics (1930)
- Bharat Ratna (1954)
- Lenin Peace Prize (1957)
|
- Discovery of Raman Effect
- Discovery of the Soft Mode
- Optical and Magnetic anisotrophy
|
| Albert Einstein |
|
- Barnard Medal (1920)
- Noble Prize in Physics (1921)
- Matteucci Medal (1921)
- Copley Medal (1925)
- Max Planck Medal (1926)
- Time Person of Century (1999)
|
- General and Special relativity
- Photoelectric Effect
- Einstein Field equations
- Gravitational wave
- Cosmological constant
|
| Charles Darwin |
|
- Royal Medal (1853)
- Wollaston Medal (1859)
- Copley Medal (1864)
- Doctor of Laws (Honorary),Cambridge (1877)
|
- The Voyage of the Beagle
- The Descant of Man
- On the Origin of Species
|


---
layout: post
title: Listener Video
date: '2006-10-12T01:57:00.000-05:00'
author: Tom Ray
tags:
modified_time: '2006-10-12T02:00:18.563-05:00'
blogger_id: tag:blogger.com,1999:blog-11319466.post-116063627961842549
blogger_orig_url: http://www.lorenzosmusic.com/2006/10/listener-video.html
---
click to view clip
We have received our first user video challenge from Devlon who hails from B.C. Canada.
He used the song "Over and Over" to express the mundane world of working day to day.


Some quick example text to build on the card title and make up the bulk of the card's content.
Some quick example text to build on the card title and make up the bulk of the card's content.
Some quick example text to build on the card title and make up the bulk of the card's content.
Some quick example text to build on the card title and make up the bulk of the card's content.
Lorem ipsum dolor sit amet, consectetur adipisicing elit. Reiciendis error doloribus unde deleniti rem nobis nesciunt
Lorem ipsum dolor sit amet, consectetur adipisicing elit. Reiciendis error doloribus unde deleniti rem nobis nesciunt
Lorem ipsum dolor sit amet, consectetur adipisicing elit. Reiciendis error doloribus unde deleniti rem nobis nesciunt


Back to Device
This device only supports splash pages. Management features are disabled.
2.4Ghz Power ({{box.tx_power_2}}dBm)
5Ghz Power ({{box.tx_power_5}}dBm)


@(user: models.User,addPlayerForm: Form[models.Player])
@import helper._
@main("New Player",user) {
Add a new Player
@form(action = routes.Application.addPlayerSubmit(), 'class -> "form-horizontal", 'role->"form"){
@inputText(addPlayerForm("playerName"),'_label -> "Name")
@inputText(addPlayerForm("jerseyNum"),'_label -> "Jersey Number")
@select(
addPlayerForm("position.id"),
options(Position.options),
'_label -> "Position", '_dfault -> "--Choose a Position --",
'_showConstraints -> false, 'class -> "form-control"
)
Position values are to be set between 0 and 10!
@inputText(addPlayerForm("attVal"),'_label -> "Attacking Value")
@inputText(addPlayerForm("defVal"),'_label -> "Defensive Value")
@inputText(addPlayerForm("midFVal"),'_label -> "Midfield Value")
@inputText(addPlayerForm("gkVal"),'_label -> "Goalkeeping Value")
@inputText(addPlayerForm("health"),'_label -> "Health")
@inputText(addPlayerForm("injury"),'_label -> "Injury Status (boolean true or false)")
@inputText(addPlayerForm("salary"),'_label -> "Salary")
@inputText(addPlayerForm("transferValue"),'_label -> "Transfer Value (selling price)")
}
}


For more information about using containers, see the page design guidelines.
You can divide pages into vertical sections with typography and spacing. Use the
You can divide page sections into horizontal sections using the fluid grid component.
Tiles are containers to organize varied content. They divide pages into multiple categories and group related content. Users can reorder and reposition tiles within the page. Users can also expand and collapse tiles, and the situation can determine the default state. Tiles are best suited to pages with a wide range of content where users benefit from the ability to manipulate tiles.
Do not use tiles to represent individual items in a set of items — use cards instead if you want to contain items in a list within individual bounding boxes. Content inside each tile can (and often will) vary widely. Tiles can contain toolbars to house action related to their content.
Tabs are containers to divide large subsets of content on a page. A set of tabs should serve as categories of page content, not as a list of similar items. The contents of each tab can be considered like a page and can contain any other container or arrangement of content.
Cards list items in a set of rectangular containers instead of rows. The card decks can appear in different layouts, such as grids. Content and presentation can be determined per card list instance. Cards can be selected (multi-select via checkbox) for bulk actions, and can also contain item-specific actions in an action bar or context menu.
If you use cards within a tile, consider using them with a carousel that accounts for the width of its container.
Repeater lists display lists of items that do not use columns. The content and presentation inside the row can be determined per list. Rows in a repeater list can be selected (multi-select via checkbox) for bulk actions. Each row can contain hyperlinks (usually on the “primary” label), but row-specific actions should be collected into the row's context menu.
Repeaters can be used in full-page formats, tabs, tiles, or dialogues.
Grids list items in table format (i.e. defined columns). Content and presentation of each row and column can be determined per list, but must conform to column breakdowns. Columns can be shown/hidden/reordered, and content can be sorted based on values inside specific columns.
Grids commonly use a toolbar containing search, filter controls, column selection, and other actions.
Grids should generally be used in full-page formats or inside of full-page tabs. When designing within a smaller container such as a tile, try using a repeater instead since they scale down better than grids.
Modals focus user attention on specific tasks. Modals are appropriate in scenarios that meet one or more of these conditions:
Users cannot complete the task until they provide more information or make additional choices.
The task is self-contained and does not need the context of the underlying page.
The task is secondary to the purpose of the underlying page.
The task interface is too complex to fit within the container where it was invoked.
The interface where the task is invoked would be too distracting for the user to efficiently complete the task inline.
Confirmation dialogs are simplified modals that focus user attention on a specific question. Confirmation dialogs are appropriate in scenarios that meet these conditions:
An action could be destructive or especially costly when performed by mistake.
Users needs to respond to a single question to proceed with the action.
The response to the question requires no input fields.
Flyouts are non-modal containers that slide out from the side of a page and lay over page content to display large amounts of supplementary information related to user tasks. They allow users to access information without navigating to another page, and they can contain lists, record views, graphs, or other information displays. Flyouts are appropriate in these scenarios:
Popovers display small chunks of contextual content that do not always need to be visible. Popovers are appropriate when:
If the content is valuable to see most of the time, use presistent inline help instead. If the amount of content requires scrolling on a mobile device, use a flyout instead.
Toasts show small chunks of information related to the completion of a background process. Toasts are appropriate when:


There's an index page with user/pass fields, and a 'get intelligence' button
There's a endpoint /cgi-bin/intelegence script that gives you the intellegence
If you can log in and get the intellegence, you win.
Get Intelligence


Mother let toddler drown in bath then dissolved her body in vat of acid
A mother has admitted letting her two year-old daughter drown in the bath before dissolving the child’s body in acid.
Monica Dominguez, 38, was jailed for 20 years Friday, nine months after Rebecka Zavala’s remains were found at a container at their apartment in Laredo, Texas.
Dominguez then admitted to a police officer that she’d left Rebecca and her other child in the bath unsupervised just before the tragedy.
She told them how she and her husband Gerardo Zavala-Loredo, 33, put Rebecka in the five gallon container before covering her corpse with corrosive fluid.
Police have been unable to determine if that story is true – and rule out foul play as a cause of Rebecka’s death – because the little girl’s remains were so badly damaged by the acid.

Advertisement Advertisement
Zavala-Loredo has struck a plea deal which will see him jailed for 14 years for tampering with evidence of a human corpse.
The couple’s four other children, aged one to 11, have been taken into care by social services, the Laredo Morning Times reported.
Dominguez was jailed for a further 10 years in February this year for violating probation over a previous child abuse charge.
Her then nine month-old son suffered six fractures – two on his right arm, and two on each leg – in September 2015.
Both Dominguez and Zavala-Loredo denied harming their son, with Dominguez handed 10 years probation over the boy’s injuries.


https://github.com/es-git/test-push
File content
Commit message
Committed online
Author name
Author email
Loading...


fun login(loginDetails: Login): Unit
Tries to log the user in and sends API call to the Server with (loginDetails). On succes the method onRetrieveUserSucces is called Uimessage is updated accordingly


This Francy Carmen Muller. She is 10 years old and was born on December 5th, 2007. She is a mixed breed but likes to be considered a designer dog.  You can read more about her breed later on in the
Breed Information section of this page.
Francy was raised by my (Shae's) mother, Angela. However, she now resides with my father in Shamong, New Jersey. In Shamong, Francy and my father take daily walks around the block. She use to be not very good on the leash and obeying rules
when she was Puppy. My dad has really worked with her and trained her and she is much better now. She obeys him for the most part and even can walk leash-less around the block with him. Sometimes, she will still run a little too far ahead on her
walks but she is too cute to get upset with.
Francy is sort of a homebody dog. She really enjoys snuggling up to my father, his girlfriend Jamie, or me. She loves her room she sleeps in and all other beds and cushions she can lounge on. I guess she figures that if she has it so good
at home, why leave?
Francy really does not enjoy going to the groomer, aka the salon as my dad likes to call it.  Her strong opinions of these places makes her resent long car rides that involve going outside
of the neighborhood that she knows. She gets very worked up in long car rides. During my freshman year of college (2015), my father drove down to Delaware to visit me and he brought Francy Along. She was a very anxious pup.
If you would like to learn more about the breed Papipoo, use these links below!
| Breed Information | |||||
| Breed | Height | Weight Range | Average Life Expectancy | Coat | Maintenance Required |
|---|---|---|---|---|---|
| Papipoo | 11 inches | 6-14 lbs | 10-14 years | Medium Length Soft or Curly | Low Maintenance |
| Poodle | 8-11 inches | 7-10 lbs | 13-16 years | Fine, Long and Silky | Moderate Maintenance |
| Papillon | 14-15 inches | 45-55lbs | 12-15 years | Corded, Curley, Dense | High Maintenance |
If you would like to keep up-to-date with what is going on in Francy's Life, feel free to follow her on Instagram


Along with the problem statements linked below, PClassic also provided us with code stubs to get past the painful IO process in java and python. You can find the stubs here. Note that the solution codes below will not include the stubs (ie the input process) and instead only include the functions we wrote to solve the problem.
// written by Maxwell Zen public static String reversedMessage(String message, int k) { int n = message.length(); StringBuilder a; a = new StringBuilder(message.substring(n-k, n)); a.reverse(); String ans = message.substring(0, n-k) + a.toString(); return ans; }
It would be nice if Java Strings had a reverse operation - unfortunately, they don't. Luckily, the StringBuilder class offers this functionality. We can create a StringBuilder instance using the substring we want to reverse, then call the reverse() method, then convert it back into a String to add to the non-reversed section of the message.
// written by Maxwell Zen public static String decode(String s, int k) { k %= 26; if (k<0) k += 26; String ans = ""; for (int i = 0; i < s.length(); i++) { char c = s.charAt(i); c -= k; if (c < 'a') c += 26; ans += c; } return ans; }
The first operation we must do is make sure k is a number between 0 and 25. We can use the mod operation to ensure k is a number between -25 and 25, then we can add 26 if k is negative to achieve our result. Then, for each character in the string, we can subtract k from the character. In order to account for overflow, we can add 26 to the character if it is no longer a letter of the alphabet.
// written by Maxwell Zen public static int netTemperature(int n, int[][] temperatures) { int k = temperatures.length; int[] temp = new int[n]; for (int i = 0; i < k; i++) { int target = temperatures[i][1]; int change = temperatures[i][2]; temp[target] += change; } int ans = 0; for (int i = 0; i < n; i++) { if (temp[i]==0) { ans++; } } return ans; }
We can keep track of the temperature of each dinosaur. For each ball, we add the temperature of the ball to the entry representing the dinosaur hit by the ball. Finally, we can count how many dinosaur have not changed temperature -- that is, how many entries are equal to zero.
// written by Maxwell Zen public static boolean checkMessages(String s, String t) { char[] matching = new char[26]; int n = s.length(); for (int i = 0; i < n; i++) { char c = (char)(s.charAt(i) - 'a'); if (matching[c] == 0) { matching[c] = t.charAt(i); } else if (matching[c] != t.charAt(i)) { return false; } } for (int i = 0; i < 26; i++) { if (matching[i] != 0) { for (int j = i+1; j < 26; j++) { if (matching[i]==matching[j]) return false; } } } return true; }
We create an array to record the character that corresponds to each letter in s. As we loop through the string, if we encounter a letter for the first time, the set the matching for that letter. Else, if we've already encountered that character and it has been matched with something different, we return false. At the end, we need to make sure that no two characters in s have been matched with the same character in t, so we loop through every pair of characters to make sure that they are different.
// Solved By Jeremy Ku-Benjet public static int unbeatable(int[][] peacocks) { boolean[] beat = new boolean[peacocks.length]; for (int i = 0; i < peacocks.length; i++) { for (int j = i+1; j < peacocks.length; j++) { int v1 = peacocks[i][0]; int v2 = peacocks[j][0]; int c1 = peacocks[i][1]; int c2 = peacocks[j][1]; if (v1 >= v2 && c1 >= c2 && (v1 != v2 || c1 != c2)) { beat[j] = true; } if (v1 <= v2 && c1 <= c2 && (v1 != v2 || c1 != c2)) { beat[i] = true; } } } int num_beat = 0; for (int i = 0; i < beat.length; i++) { if (beat[i]) num_beat++; } return (peacocks.length - num_beat); }
The number of unbeatable peacocks is the number of all peacocks which can't be beat. Therefore we can loop through all pairs of peacocks and check if any one peacock in the pair beats the other. We keep a beat array such that beat[i] = boolean representing if peacock i was beat. When a peacock in the pair is beat, we set beat[i] = true. We then count the amount of trues in beat and subtract that from the total number of peacocks.
beat[i] = boolean representing if peacock i was beat
beat[i] = true
beat
// Solved By Alvin Li public static boolean ism(int[][] grid, int i, int j) { // i,j is top left corner int s = grid[i][j] + grid[i][j+1] + grid[i][j+2]; for (int ii = 0; ii < 3; ii++) { if (grid[i+ii][j] + grid[i+ii][j+1] + grid[i+ii][j+2] != s) return false; } for (int jj = 0; jj < 3; jj++) { if (grid[i][j+jj] + grid[i+1][j+jj] + grid[i+2][j+jj] != s) return false; } if (grid[i][j] + grid[i+1][j+1] + grid[i+2][j+2] != s || grid[i][j+2] + grid[i+1][j+1] + grid[i+2][j] != s) return false; return true; } public static boolean magicSquare(int[][] grid) { int n = grid.length; int m = grid[0].length; for(int i = 0; i < n-2; i++) { for (int j = 0; j < m-2; j++) { // System.out.println(i + " " + j); if (ism(grid, i, j)) return true; } } return false; }
The ism function determines whether or not a magic square with a top left corner of i,j exists. It does this by find the sum of the first row, and then looping through the rest of the rows, the columns, and the two diagonals to check if the sum of those are the same as the sum of the first row. If there exists one that isn't the same the square isn't a magic square, else it is a magic square. The code then loops through all valid top left positions in the graph and checks if there is at least one magic square.
// Solved By Mohammad Khan And Alvin Li public static boolean matchable(String initialPattern, String finalPattern) { int il = initialPattern.length(); int fl = finalPattern.length(); char[] temp = new char[fl]; for (int i = 0; i < fl; i++) temp[i] = '0'; for (int i = 0; i < il; i++) temp[i] = initialPattern.charAt(i); for (int i = 0; i <= fl-il; i++) { boolean ok = true; for (int j = 0; j < il; j++) { if (initialPattern.charAt(j) == '1' && finalPattern.charAt(i+j) == '0') { ok = false; break; } } if (ok) { for (int j = 0; j < il; j++) { if (initialPattern.charAt(j) == '1') temp[i+j] = '1'; } } } for (int i = 0; i < fl; i++) { if (temp[i] != finalPattern.charAt(i)) return false; } return true; }
The idea of this problem is that you are given an initial pattern and you have to copy it onto substrings of a blank template pattern, and you have to see if through repetitions of this process if you can make the template into the final pattern. The first observation is that there are only fl-il positions where you can move the initial pattern to and moving the pattern to the same position multiple times does not have any extra effect, so this means that we only have to loop through the fl-il positions to see if we can somehow get our final pattern.
Now that we are looping through the initial positions, we have to find a way to see if we can copy the initial pattern without messing up the pattern. Lets consider position j in the initial pattern and position i+j in the final pattern (this is the jth position of the substring of final pattern starting at position i). Consider the case of final[i+j] = 0, if initial[j] = 0, this is valid to copy over because they are the same, but if initial[j] = 1, we can't copy this over without never achieving the final pattern. Now consider final[i+j] = 1, if initial[j] = 0, then this is valid because we can always turn that 0 into a 1 later, and if initial[j] = 1, this is also valid because now final and initial match.
We can now check all positions in the initial pattern and the substring of the final pattern, and if all these positions can be validly copied over, then we can greedily decide to copy the initial pattern over to the template. Also notice that the problem says that the initial pattern must be copied over at position 0, so we implement this change in the for (int i = 0; i < il; i++) temp[i] = initialPattern.charAt(i); loop.
for (int i = 0; i < il; i++) temp[i] = initialPattern.charAt(i);
Now that we have all our changes made, we just have to check if this template is now equal to the final pattern, and if it is return true else return false.
// Solved By Mohammad Khan public static int maxPoints(String s, String t) { int m = s.length(), n = t.length(); int[][] DP = new int[m+1][n+1]; for (int i = 0; i < m+1; i++) { DP[i][n] = -(m-i)*2; } for (int i = 0; i < n+1; i++) { DP[m][i] = -(n-i)*2; } for (int i = m-1; i >= 0; i--) { for (int q = n-1; q >= 0; q--) { int val = DP[i+1][q+1] + (s.charAt(i) == t.charAt(q) ? 1 : -1); DP[i][q] = Math.max(val, Math.max(DP[i+1][q]-2, DP[i][q+1]-2)); } } return DP[0][0]; }
To solve this problem, we first need to solve a classic problem called Edit Distance, which can be explained throughly here, on page 74-75. Now lets see how this problem relates to our current problems. The sequences of cards being put down can be represented a string of either spaces (represented as _) or the characters themselves. If two characters at the same position are the same we add 1 point to our answer, if they are different we subtract 1 point, and if one is a space and one is a character we subtract 2 points. We can see this is just an application of the edit distance between these two strings, where instead of minimizing the score, we are trying to maximize it.
So we do edit distance word for word, until we get do the DP transition. The transition given in the book is DP[i][j] = min(DP[i-1][j-1]+(s[i]==t[j] ? 0 : 1), min(DP[i-1][j]+1, DP[i][j-1]+1)), and through the explanation of points distribution above, we get the following slightly different DP transition of the following DP[i][j] = max(DP[i-1][j-1] + (s[i] == t[i] ? 1 : -1), max(DP[i-1][j]-2,DP[i][j-1]-2)). Notice that the code above is also edit distance it is just slightly different because I changed the axes.
DP[i][j] = min(DP[i-1][j-1]+(s[i]==t[j] ? 0 : 1), min(DP[i-1][j]+1, DP[i][j-1]+1))
DP[i][j] = max(DP[i-1][j-1] + (s[i] == t[i] ? 1 : -1), max(DP[i-1][j]-2,DP[i][j-1]-2))
// Solved By Maxwell Zen, Alvin Li, And Jeremy Ku-Benjet public static int testing(int bears, int testtime, int totaltime) { int k = totaltime / testtime; int ans = 1; long cur = k+1; while (cur < bears) { cur *= (long)k+1; ans++; } return ans; }
WILL BE HERE SOON
// Solved By Maxwell Zen public static long MOD =<PHONE_NUMBER>; public static void inc(int i, long x, TreeMap<Integer, Long> tm) { if (tm.containsKey(i)) tm.put(i, tm.get(i)+x); else tm.put(i, x); } public static long sum(long i) { long ans = ((i % MOD) * ((i+1) % MOD)) % MOD; if (ans % 2 == 0) ans /= 2; else ans = (ans + MOD) / 2; return ans; } public static long sum(long i, long j) { if (j == 0) return 0; long ans = sum(j) - sum(i); ans %= MOD; if (ans < 0) ans += MOD; return ans; } public static int pandaLand(int n, int m, String s) { int[] r = new int[n], c = new int[m]; r[0]++; c[0]++; int x = 0, y = 0; for (int i = 0; i < n+m-2; i++) { if (s.charAt(i) == 'R') y++; else x++; r[x]++; c[y]++; } TreeMap<Integer, Long> rcnt, ccnt, cnt; rcnt = new TreeMap<Integer, Long>(); ccnt = new TreeMap<Integer, Long>(); cnt = new TreeMap<Integer, Long>(); for (int i = 0; i < n; i++) inc(r[i], 1, rcnt); for (int i = 0; i < m; i++) inc(c[i], 1, ccnt); for (Integer i : rcnt.keySet()) { for (Integer j : ccnt.keySet()) { int k = i+j; inc(k, (long)rcnt.get(i) * (long)ccnt.get(j), cnt); } } x = 0; y = 0; inc(r[0]+c[0], -1, cnt); inc(r[0]+c[0]-1, 1, cnt); for (int i = 0; i < n+m-2; i++) { if (s.charAt(i)=='R') y++; else x++; inc(r[x]+c[y], -1, cnt); inc(r[x]+c[y]-1, 1, cnt); } long k = (long)n*m-1; long ans = 0; for (Integer i : cnt.keySet()) { long icnt = cnt.get(i); ans += (sum(k-icnt, k) * i)%MOD; k -= icnt; } ans %= MOD; if (ans < 0) ans += MOD; return (int)ans; }
// Solved By Maxwell Zen And Mohammad Khan public static int unbeatable(int n, int[][] pvals, int[] out) { for (int i = 0; i < n; i++) out[i]--; boolean[] vis, beat; vis = new boolean[n]; beat = new boolean[n]; int ans = 0; for (int i = 0; i < n; i++) { int v1 = pvals[i][0]; int c1 = pvals[i][1]; int c = out[i]; vis[i] = true; while (!vis[c]) { int v2 = pvals[c][0]; int c2 = pvals[c][1]; if (v1 <= v2 && c1 <= c2 && (v1!=v2 || c1!=c2)) { beat[i] = true; break; } vis[c] = true; c = out[c]; } c = i; while (vis[c]) { vis[c] = false; c = out[c]; } if (!beat[i]) ans++; } return ans; }
// WILL BE HERE SOON


BERT Question Answering Engine
Hi, I'm BERT, please ask me a question...
No questions and answers yet...


The objective of this project is to build a mechatronic system to study proprioception in young children. This system includes a mechanical design for the experimental setup, and software for acquiring sensor data and delivering automated audiovisual feedback. The targeted age of children is between 3 and 6 years old. The developed system provides visually attractive interfaces that adapt to the participant’s interactions. The experiment contains a test to quantify a participant’s maximum voluntary torque, as well as their perception. This system runs an automated experiment and records data for post-hoc analyses.
Motivation
Numerous studies have quantified proprioception in adults. However, less information is available about children. The goal of this project is to develop an experiment to permit proprioception to be quantified in children. The long-term goal of this project is to, using the system developed, understand the extent to which children who have neurological impairments also have proprioceptive deficits.
Method
Experiment Setup
The system acquires torque data indicating the extent to which the participant is flexing and extending about each elbow joint through two torque sensors. We used a DAQ card for data acquisition. A python script streams the sensory data at 1000Hz and passes signals to a callback function. The callback function utilizes the linear equation resulted from the [calibration](calibration/README.md) process to convert a voltage signal to the actual torque generated by the participant. A zeroing function can also be called to remove an offset in the voltage signal. The perceptual testing tasks use the results from the maximum voluntary torque test (maximum torque), as well as the real-time torque to determine the audiovisual feedback. The system renders the visual interface at 27Hz and records data at 1000Hz.
The objective of this project is to develop a haptic feedback device to simulate the active whisking of a robotic rat. Previous works have demonstrated that rats can sense the environment from the bending of their whiskers. This project tries to explore this phenomenon by delivering such a sense of bending to humans haptically. The device includes six micro vibration motors in a group to represent the magnitude and direction of a signal. We use the Wi-Fi module of multiple micro-controllers to have a portable and accessible device.
Method
System Pipeline
We use vibration motors to represent signals from the robotic rat. The computer receives the signal through the USB port and serves as an Access Point to broadcast filtered signals. Several micro-controller connect to the AP, serves as stations, and listen to incoming signals. Each micro-controller is assigned to proceed with one whisker data and uses output compare pins to control motors based on the direction and magnitude of such data. The stream of signals from the robotic rat was tested at 200Hz. Each vibration motor updates its frequency at 1Hz.
Current Software Interface of the Haptic Feedback Device
The micro-controller takes input of the signal as a format of (x,y). It computes which two motors are required to describe the direction and duty cycle, respectively.
Projection based on the Geometric of the Haptic Feedback Device
This project involves advanced techniques of Digital signal process, Machine Learning, and common algorithm in Neuroscience. The documentation also will discuss different algorithms and how they fit with various types of data used in this project as a research topic.
Block diagram of ROS nodes in Mind-wave cursor control system
The objective of this project is to control cursor movement on the computer by human intention through brain computer interface (BCI). It includes an electroencephalography (EEG) data collection from EEG monitor. The monitor is expected to track the electrical activity (bio potential) of the brain (mainly focus on motor cortex, the part of brain oversees movement). The project is mainly focusing on classify left or right movement for now. The completed project allows subjects to think about executing cursor movement with corresponding hand movement and covert mind-wave signal to real-time cursor movement.
This is a mechatronics project that uses PIC32 to control motor through PID. The project allows the motor to move to certain position (in degree) without overshoot and in a reasonable range of raise time. Besides that, the motor is allowed to move along user input trajectory as well. The microcontroller was programmed through C to keep tracking motor positions and input current by adapting two feedback loops. It sends required current to motor through H-bridge and sends data back to computer so it can plot and show performance of such controller parameters.
The project is to design and build an ECG monitor from scratch. The circuit includes an op-amp and two band pass filters. It also includes several electrical elements as protection for bio usage, such as manual baseline-restore switch, input over-voltage protection, and self-calibration switch for ECG. The built equipment could also switch voltage-gain values of 500, 1000 and 2000. The demo video shows a diagram of LEAD I ECG through DEGILENT Wavelet. The project also observes the impedance change through bio potential when subject inhaled and fill air one's pulmonary system
Circuit Diagram of ECG Amplifier System
Specifications
- Bandwidth : 0.05 to 100 Hz - Manual baseline-restore switch - Input over-voltage protection - Battery powered manual 1-mV self-calibration switch - Voltage-gain values of 500, 1000, and 2000
Design
The voltage-gain value of the amplifier system was consisted of an op-amp (OP484), an active high pass filter, and an active low pass filter. The theoretical gain will follow the following equation.
Where R1 to R7, C1, and C2 is the corresponding Resistors and Capacitors in circuit diagram.
The design of band pass filter follows the rule as following. Where Wc is corner frequency and f is desired bandwidth
The demo video shows the Baxter received a 2-digit number, performed number decompose computation, and fetched two resulted numbers
Actual settings and equipment layout
The project goal is to allow Baxter, manufactured by Rethink Robotics, to perform robust block pick and place using single digit handwritten numbers on the object. The project includes a session of machine learning to recognize handwritten numbers and locate such object in camera frame. Another package works with AR tag assistance to generate the actual transformation matrices in real-world unit from pixel location in camera frame. The robot is able to read such object information quickly and perform pick& place with optimized trajectory planning and without any collision with surroundings.
The project is a dynamics simulation of block in a tumbler by applying Euler Lagrange Equation through Mathematica. The motion has been divided to 7 parts. This project shows techniques expansion from theory and ability of building physical model.
• Trajectory 1 : The block starts from blade 2 (right side blade) and sliding down form the blade. The blade was treated as varying constraint on two corner points of triangular block. The block will fall after sliding from the blade.
The constraint was off when the mid bottom point of triangle pass beyond the blade inner tip by using “Whenevet” and setting left hand side of E-L to zeros. • Trajectory 2 : The block fall from the blade and hit the tumbler inner edge with a plastic impact. From animation A2, it is more obvious to see the plastic impact make the block move along the tumbler edge for a few seconds. • Trajectory 2.5 : Another corner of block impact with the tumbler. It is hard to tell from the animation that two corners of the block hit the tumbler separately. The time of those two impacts are very close (2.19386s and 2.19459s)
• Trajectory 3 : Take the velocity update computed from Trajectory 2.5 and set the inner edge of tumbler as a constraint on two corners of the block. The animation shows the block sliding at the bottom of the tumbler with initial velocity given from Trajectory 2.5 • Trajectory 4: The block is sliding on the bottom of tumbler until it hit by the coming blade ( blade 3 in this case) as another plastic impact. The impact law was used to compute updated velocity. • Trajectory 6: Simulate the animation until the block reach the same position as the beginning of animation.
The project is to perform dermatology diagnose through machine learning techniques those built from scratch. The algorithms used in this project includes feature selection, boosting selection, gradient descent, and fusion rule. The GUI was allowed to return the probability of certain prediction back to user. More detail was explained through the above demonstration video.


×
Mail has been sent to the mail client.
Toggle navigation
The Dashboard
Earthquakes
Timesheets
Timesheet Registry
Name:
Email:
Date
Add
Remove
Remove Line
Project Name
Work Description
Hours Worked
Submit
Clear


Default
This is a primary button
This is a secondary button
This is a submit button
This is a primary link
This is a secondary link


myshoppemart is an online platfrom where buyers can come online, describe or specify products they are looking for, and leave everyother thing to us, we take the hassle of going round the market place to make sure you get exactly what you specified.
Here at myshoppemart, We do not present you goods that might not be of need to you, we actually give you the power to specify.
Our awesome user-first design, ensures every visit is a whole new experience.
We believe in the customer being king, so we try our best to put our customer's interests first .


I take pride in my previous work and happy customers. I cater to any sector to boost business and increase exposure.
As a new agency we get reap the benefits of the latest and greatest. We build our websites with the most up to date technology. This ensures your website is fast, efficient and reliable for many years.


add a new city-store
Store'S city
Min. customers
Max. customers
Average Sold Cookies
you can find the link to the homepage here:
index.html


Rust Report Card
High Scores
GitHub
Supporters
Patreon
About
Enter the
crate repo
path to the project below:
Generate Report
Sponsored Report Cards
[Your Repo Here!]
Recently Generated
[[ range .Recent ]]
[[ . ]]
[[ end ]]
[[ template "footer" . ]]


Do you have an impressive personality or possess extremely good communication skills? Then hospitality is a good career choice for you. Hospitality management as a profession requires one to possess strong interpersonal communication skills, be meticulous and have business sense. The first step in making a career in the field of hospitality is to pursue a course from a good college and one of the most popular programmes pursued by students right after their Class 12 in this field is Bachelor of Hotel Management (BHM). BHM is an undergraduate course which spans for a duration of three years. However, some colleges such as Welcomgroup Graduate School of Hotel Administration offer it as a four-year degree programme. As part of a BHM course, candidates are taught about different facets of the hospitality industry. Thus, in a BHM course aspirants are taught food and beverage preparation, housekeeping operations, front office operations, computer applications, business communication, accommodation operation, corporate finance, sales, marketing, public relations etc. BHM course is known to have theory as well as practical subjects. The BHM course also emphasises on developing and enhancing personal skills of an aspirant as a good personality is a must in this career path. Apart from this, the BHM course also educates students on aspects such as hygiene, food safety as well as nutrition that is in tune with international standards.
Required Skillset for BHM
To make a career in the field of hotel management candidates need to possess a service minded approach. Some key skills that an aspirant should possess when they consider pursuing a BHM course are listed below: , Ability to adjust in a crowd/different circumstances , Outgoing personality , Pleasant personality , Polite demeanour , Flair for creativity , Customer-oriented approach , Responsible , Willingness to work long and odd hours ,Discipline , Ability to be committed and dedicated to a task , Confidence , Good listener
BHM Eligibility Criteria
Students can pursue BHM course right after their Class 12. For most colleges the eligibility criteria to pursue a BHM course is that the candidate should have cleared his 10+2 from a recognised board. However, other colleges have specific requirement that candidates need to fulfill in order to pursue a BHM course which include that aspirants should have secured at least 50 per cent aggregate marks in their Class 12 exams or should have studied English at their Class 12 level and secured passing marks in the subject. Some hotel management colleges also set age limit for candidates who can apply for and secure admission in BHM course offered by them. These colleges haved fixed 22 years as the upper age limit for the students belonging to General or Other Backward Classes (OBC) category and 25 years for Scheduled Caste (SC) and Scheduled Tribes (ST) category.
Course Curriculum for BHM
The subjects taught in BHM course vary from college to college. Also, the BHM course is offered at some colleges as a three-year programme while at some it is a four-year course. Popular colleges that offer hospitality management course offer some or all the subjects that are listed below: , Introduction to Hospitality & Tourism Industry , Food & Beverage Service , Food Production , Front Office Operations , Business Communication , Accommodation Operation , Bakery , Hospitality Accounting , Accommodation Management , Hospitality Information Systems , Food Science & Nutrition , Corporate Finance , Global Food Trends , Food Safety Management Systems ,Human Resources Management , Travel & Tourism , Hospitality Facility Planning , Hospitality Marketing , Indian Heritage & Culture , Business Law and Ethics , Environment Sustainability , Entrepreneurship Development , Foreign Language (any one) , English Apart from the above mentioned theory subjects, candidates who pursue BHM course, also need to attempt and clear practical papers in subjects such as Food Production, Front Office, Food & Beverage Service and House Keeping. As part of BHM course candidates need to mandatorily undergo industrial training of few months.
BHM Job Profiles & Top Recruiters
After completing a BHM course, candidates can either consider pursuing a master’s degree, that is, Masters in Hotel Management, Masters in Hotel Management & Catering Technology, MSc in Hotel Management, MBA in Hotel Management etc. Many five-star hotels also offer internships to students. If students perform well in their training period then companies consider them for recruitment after their internship period ends. Click here to find out more on how and where to apply for hotel management internships. Popular job profiles in which BHM graduates are hired by hotels are Front office executives, Food and Beverage executive, steward, air hostess/ flight steward etc. Aspirants can view the detailed job profiles that they can pursue in the hospitality industry by clicking the link here – Hotel Management: Types of job profiles. Some companies that are known to hire hospitality management graduates are listed below:
BHM Top Recruiters
Ambassador Group of Hotels , Mansingh Group of Hotels , Oberoi Group of Hotels , Sarovar Park Group of Hotels , Sinclairs Group of Hotels , Best Western Group of Hotels , Casino Group of Hotels , Clarks Group of Hotels , Fortune Park Group of Hotels , ITDC Group of Hotels , Jaypee Group of Hotels , K Raheja Group of Hotels , Le Meridien Group of Hotels , Taj Group of Hotels , Tulip Star Group of Hotels , Welcome Heritage Group of Hotels ,Holiday Inn Group of Hotels , HRH Group of Hotels , ITC Group of Hotels , Accor Hotels


Allocator using memory resources. More...
#include <cmsis-plus/rtos/os.h>
Classes | |
| struct | rebind |
| Define a rebind template. More... | |
Public Types | |
| using | locker_type = L |
| using | value_type = T |
Public Member Functions | |
Constructors & Destructor | |
| allocator_stateless_polymorphic_synchronized () noexcept | |
| Default constructor. Construct a default allocator object instance. | |
| allocator_stateless_polymorphic_synchronized (allocator_stateless_polymorphic_synchronized const &other)=default | |
| Copy constructor. | |
| template<typename U > | |
| allocator_stateless_polymorphic_synchronized (allocator_stateless_polymorphic_synchronized< U, L, get_resource > const &other) noexcept | |
| Copy constructor template. | |
| allocator_stateless_polymorphic_synchronized (allocator_stateless_polymorphic_synchronized &&other)=default | |
| Move constructor. | |
| ~allocator_stateless_polymorphic_synchronized ()=default | |
| Destruct the default allocator object instance. | |
Operators | |
| allocator_stateless_polymorphic_synchronized & | operator= (allocator_stateless_polymorphic_synchronized const &other)=default |
| Copy assignment operator. | |
| allocator_stateless_polymorphic_synchronized & | operator= (allocator_stateless_polymorphic_synchronized &&other)=default |
| Move assignment operator. | |
Public Member Functions | |
| value_type * | allocate (std::size_t elements) |
Allocate a number of memory blocks of type value_type . | |
| void | deallocate (value_type *addr, std::size_t elements) noexcept |
Deallocate the number of memory blocks of type value_type . | |
| std::size_t | max_size (void) const noexcept |
The maximum number of elements that can be passed to allocate() . | |
Allocator using memory resources.
| T | Type of elements to be allocated. |
| L | Type of lockable object. |
| get_resource | Function to get the default resource. |
Definition at line 681 of file os-memory.h.
| using os::rtos::memory::allocator_stateless_polymorphic_synchronized< T, L, get_resource >::locker_type = L |
Definition at line 686 of file os-memory.h.
| using os::rtos::memory::allocator_stateless_polymorphic_synchronized< T, L, get_resource >::value_type = T |
Definition at line 685 of file os-memory.h.
|
noexcept |
Default constructor. Construct a default allocator object instance.
|
default |
Copy constructor.
| other | Reference to existing allocator. |
|
noexcept |
Copy constructor template.
| other | Reference to allocator. |
|
default |
Move constructor.
| other | Reference to existing allocator. |
|
default |
Destruct the default allocator object instance.
| value_type * os::rtos::memory::allocator_stateless_polymorphic_synchronized< T, L, get_resource >::allocate | ( | std::size_t | elements | ) |
Allocate a number of memory blocks of type value_type
.
| elements | Number of elements of type value_type . |
|
noexcept |
Deallocate the number of memory blocks of type value_type
.
| addr | Pointer to previously allocated memory blocks. |
| elements | Number of elements of type value_type . |
|
noexcept |
The maximum number of elements that can be passed to allocate()
.
value_type
.
|
default |
Move assignment operator.
| other | Reference to existing allocator. |
|
default |
Copy assignment operator.
| other | Reference to existing allocator. |


Jeep-Quest Part 1
When Sabrina and I moved to Chicago a year and a half ago, we sold both our cars. I’m not saying that was a mistake, but I have to spend an hour each way on public transit for both hackerspaces and the radio station, and the grocery delivery people always manage to surprise you. We decided we wanted a reliable vehicle to see us through the next few years here in the Second City.  I managed to talk Sabrina into a TJ Wrangler.
What’s a TJ Wrangler? Well, it’s Chrysler’s second stab at making a Jeep. Back in the mid-80s…
Hang on, let me hit up Wikipedia here.
Okay. Back in 1987, the American Motors Corporation was bought by Chrysler. AMC made the vernerable Jeep CJ-7, a small, light weight, leaf-sprung, two door SUV with four wheel drive. Chrysler took that and made it into a slightly larger vehicle with slightly more creature comforts and called it the Jeep Wrangler. The first generation Jeep Wrangler, known as the YJ, was sold from 1987 to 1995. Much like the CJ, it had leaf springs and a rudamentary suspension. It was a weird compromise between the bare bones CJ and a passenger car.
I owned one, and it was an absolute blast.
It had a lot of problems, so we sold it.
In 1996, Chrysler didn’t make a Wrangler (okay, they did, but they were sold as 1997 models). Instead, they re-designed and re-tooled the plants to produce the second generation wrangler, the TJ. The TJ was a little bit larger than the YJ, and had coil springs in the front rather than leaf springs. This gave it better road manners without sacrificing too much offroadability. Under the hood, it came with the same choice of I4 or I6 engines, the same AX-5 or AX-15 transmissions, the same NP231 transfer case, and the same Dana 30 front and Dana 35 rear axle (later years got a different transmission, Rubicons got a different transfer case and rear axle, non-Rubicons could be specified with a different rear axle, blah blah blah).
The thrust of all this is that TJs are sturdy vehicles, and intensely simple to work on. That I6 motor I mentioned makes an almost criminally low amount of power, but when the bombs drop, the last scrappy survivers will find perfect Jeep 4.0 engines still running. They’re hard to kill.
What am I looking for in a Jeep Wrangler? Well, sir:
- 4.0 I6 — They’ll last a good long time
- Manual transmission
- Reasonably unmodified. I’m okay with a little bumper action or a tasteful lift, but I’m not going to deal with a bubba’d-to-hell Jeep like the last one I bought.
- 2000 or later — This is a Sabrina requirement.
- Cloth top
- Cruise control
- AC
- Minimal rust
- ABS
I’ll detail my journey to Wrangler-hood here. Jeep-quest! Here we go!


In this simulator you will experience the horrific morning traffic caused by non-other.... but you! You will have to reach the goal at each stage, without hitting anyone in your way (it's not GTA dammit!)
Try to survive the longest or challenge your friend for a dual of a lifetime.
Player 0: ARROW KEYS
Player 1: WASD
Honk: SPACE


A small, attractive fishing port on the mainland immediately N of the Greek island of Lesvos.
Moor to the southern breakwater. Holding is good in the sand of the harbour. Sheltered fron the meltemi
but can be subject to katabatic winds at night.
Some provisions avaiable, also a restaurant and a cafe here.


CheckpointSaverListener
Interface for listeners that take action before or after checkpoint save.
tf.compat.v1.estimator.CheckpointSaverListener
tf.compat.v1.train.CheckpointSaverListener
tf.compat.v2.estimator.CheckpointSaverListener
CheckpointSaverListener
triggers only in steps when CheckpointSaverHook
is
triggered, and provides callbacks at the following points:
- before using the session
- before each call to Saver.save()
- after each call to Saver.save()
- at the end of session
To use a listener, implement a class and pass the listener to a
CheckpointSaverHook
, as in this example:
class ExampleCheckpointSaverListener(CheckpointSaverListener): def begin(self): # You can add ops to the graph here. print('Starting the session.') self.your_tensor = ... def before_save(self, session, global_step_value): print('About to write a checkpoint') def after_save(self, session, global_step_value): print('Done writing checkpoint.') if decided_to_stop_training(): return True def end(self, session, global_step_value): print('Done with the session.') ... listener = ExampleCheckpointSaverListener() saver_hook = tf.estimator.CheckpointSaverHook( checkpoint_dir, listeners=[listener]) with tf.compat.v1.train.MonitoredTrainingSession(chief_only_hooks=[saver_hook]): ...
A CheckpointSaverListener
may simply take some action after every
checkpoint save. It is also possible for the listener to use its own schedule
to act less frequently, e.g. based on global_step_value. In this case,
implementors should implement the end()
method to handle actions related to
the last checkpoint save. But the listener should not act twice if
after_save()
already handled this last checkpoint save.
A CheckpointSaverListener
can request training to be stopped, by returning
True in after_save
. Please note that, in replicated distributed training
setting, only chief
should use this behavior. Otherwise each worker will do
their own evaluation, which may be wasteful of resources.
after_save
after_save( session, global_step_value )
before_save
before_save( session, global_step_value )
begin
begin()
end
end( session, global_step_value )


Classes that are too deeply inherited may be confusing and indicate that a refactoring is necessary.
All superclasses from a library are treated as a single superclass, libraries are considered unmodifiable.
Use the Inheritance depth limit field to specify the maximum inheritance depth for a class.


I'm a UConn graduate with a degree in Digital Media Design, specifically web and interaction design. I’m an up and coming front end web developer with an interest in mobile app design and creating efficient and meaningful user experiences. I enjoy constantly learning new things and never back down from a project once I’ve started it (unless it gets too hard).
I spent 2 years working with the University of Connectiut's web lab developing, designing, and maintaining several university owned websites. Below are some examples of sites I designed during my time there.
University of Connecticut's email portal and help website. Designed in wordpress using HTML, CSS, and numerous WordPress plugins.
University of Connecticut's security information and help website. Designed in wordpress using HTML, CSS, and numerous WordPress plugins.
University of Connecticut's math major mainsite accessibly to both students and staff. Designed in wordpress using HTML, CSS, and numerous WordPress plugins.
UConn school of social work's voter awareness site. Designed in wordpress using HTML, CSS, and numerous WordPress plugins.
Collaboratory on School and Child Health's main website. Designed in wordpress using HTML, CSS, and numerous WordPress plugins.


Balancing a family isn’t easy. I’ve been married since I was 23. My wife was barely legal drinking age at the time. We’re from New England… this isn’t normal up here. I literally saw my wife from across the room and knew “that’s the girl I’m going to marry.” I was done after that.
Anyway, fast forward and we’ve had good times and bad times
We’ve had some good years, and some bad.  It’s good times.
Risk
Over the years I’ve stayed extremely risk confidant. I’m still under 40, have a PhD, my skills are in demand, and I’m really good at what I do. I’m never worried about having a job. I’m really never all that worried about money, even in the lean times. So, as part of this I put all our money into crypto. It’s gone down some, but I’m not nervous. I’m actually more confidant than I was when I put it in. Shit’s gonna go up, and big up.
That said, there’s more than one person in this marriage and in this family. So, I’m faced with two choices. Pull some back out when the crypto is down or go work for a bit. I don’t actually think that I have to do either of these. I can wait, but again, I’m not the only person trying to make this family work.
I don’t want to get rid of my steem. If anything I’m looking to grow my account. I’ve been powering down, but that’s not to have some massive cash out. It’s to make sure that I can have liquid steem when the mega rush happens (which I think is about 3-4 weeks from now). When that happens I think a few things will happen. Steem will spike, Steem will crash, and Steem will recover all within 1-2 weeks. I want to be there with liquid steem when that happens. If it goes according to plan I’ll temporarily stash into tether, buy back in at a low, and then possibly cash out a little for comfort money, but still have more than when I started. That’s the game plan.
Next step
I think I’m going to do some higher ed sales work again. I’m rather enjoying not having full time employment, but I think the risk is adding undue stress to my marriage. Changing this working is the most important thing for me to do, but it’s based on a number of factors. One of them being my wife’s happiness and sanity. So, I think I have to trade a little of my ultimate freedom and risk tolerance for a slightly more balanced work/life/steady income kinda thing. I don’t plan on that being my long term. My long term is fullfilling the mission of the Minnow Support Project: Spread the values of Peace, Abundance, and Liberty, help Steem grow, and train and retain minnows on the platform.
The world is broken. It’s run by criminal bankers who constantly cause harm. It’s not going to end with protest we need alternatives to government, government currencies, media, education, and many others. I think what Steem is building is one of the most important changes in an entire system of governance in our lives. To work on that and have freedom to operate I need a happy marriage, and that means a little more financial stability and a little more fiat/terrestial world for now. I doubt it’ll last forever, but I think starting in May when my non-compete runs out I’ll take on some terrestial work and settle my family down a bit.
what it entails
Actually the gig is super easy for me. There are sales reps, they feed me demos, and I deliver them. I’ll have between 4-6 a day. I won’t have a commute. I won’t travel all that much as far as I can tell. The company I’m gonna work for has 5 reps. I’m betting each can score maybe 1-2 demos a day so that’s an average of 6. Many take an hour, but I bet I can push some of the lower revenue ones down to 30 min.
Pal Studios
As part of this compromise instead of pushing to have an external Pal studios I’m pushing to have an internal one. I’m going to take over part of my basement and setup shop there. It cuts down on cost and makes it more convenient to film and get that going. So, hopefully the media project I’ve been putting off while the price of BTC and steem are taking a hit can get going now that I don’t have to worry about the long term financial costs of this.
So, what changes now?
Nothing for now. It’s not even certain, but it looks like in May I’ll have some demos to give while I’m Steeming throughout my day.
This page is synchronized from the post: ‘Balancing act- Steem, Money, Wife, Family, Activism’


Arrays
Checking an Array HAS an element
Iterating over an Array
Removing an item from an Array
DeepCopy an Array


Team Arrow Betrayed - But Not By Who You Think
by Meagan DamoreSPOILER WARNING: This article contains major spoilers for "Prochnost," the latest episode of Arrow Season 8.
Team Arrow just suffered a major betrayal, but it wasn't at Laurel's hands. In "Prochnost," the latest episode of Arrow, Oliver Queen and John Diggle learned the truth about Lyla Michaels. Worse, she was forced to subdue them through violent means.
In the last episode, the Monitor struck a deal with Laurel. He told her he would bring her world back, if she betrayed Oliver. She later received instructions from Lyla, much to Laurel's surprise.
"You're working with the Monitor. Why?" Laurel demanded.
"It's complicated," Lyla shot back.
"Really? Because he destroyed my entire Earth. That seems pretty straightforward to me," Laurel spat.
"He didn't," Lyla insisted. "Mar Novu is trying to save worlds, not destroy them."
"All that stuff about grief," Laurel mused. "You pretending like you were trying to help me. I should have known better."
"I wasn't pretending," Lyla reasserted, to which Laurel replied, "It's a little hard to believe, Lyla, after all the lying."
"It doesn't matter what you believe. You're here just the same as I am. Now do you want to get your Earth back or not?" Lyla said. When Laurel begrudgingly agreed, Lyla told her to retrieve plans for the weapon Oliver hopes to build to defeat the Monitor.
"I thought Oliver was your friend," Laurel pointed out.
"He is, but this is bigger than him -- bigger than all of us," Lyla explained. "I am doing this for them, to protect them."
Laurel planned on doing as instructed, but her trip to Russia with Oliver and his children Mia and William changed her mind. Specifically, a chat with Mia revealed she was truly a hero in the future. "You're the Black Canary. All I've ever heard are stories about how great you are.  "Some people are cut out to be heroes. Others, not so much."
Between her talk with Mia and Anatoly Knyazev's admission that she had changed after all, Laurel had a change of heart. She decided not to steal the plans and give them to Lyla. What's more, she revealed the truth to Oliver and Diggle, Lyla's husband. Together, they hatched a plot to confront Lyla.
Laurel still went to meet Lyla, as agreed. When asked if she brought the plans, Laurel replied, "About that... I've decided not to join you and your cosmic fashion tragedy that you're in cahoots with."

"If saving it means going back to the person that I used to be, then what the hell is the point?" Laurel demanded.
"You really have changed," Lyla admitted.
"Look, I'm new to this whole 'doing the right thing' game, but you should really tell your family the truth," Laurel insisted.
Lyla shook her head. "Not yet."
"Then this is going to be a little awkward," she replied, stepping aside. Oliver and Diggle made their presence known, revealing they had heard the whole exchange.
"I didn't want to believe it," Diggle said breathlessly.
"I'm sorry," Lyla whispered, and suddenly shots ran out. All three heroes were struck in the neck with darts, which sent them to their knees.
"Lyla, what have you done?"
Lyla has an important role to play in "Crisis on Infinite Earths," this year's major crossover event. She will be Harbinger, who -- in Marv Wolfman and George Pérez's Crisis on Infinite Earths -- was saved by the Monitor as a child and imbued with immense powers. The comic book event saw her summoning the heroes he required to protect the cosmic tuning forks, though she was later possessed by a Shadow Demon. This allowed the Anti-Monitor to corrupt her into killing the Monitor.
On Arrow, Lyla didn't indicate how long she has been working with the Monitor, but little is known about her background. To date, the series has only ever revealed information about her time in the military. The buildup to "Crisis on Infinite Earths" will likely reveal how her partnership with the Monitor came to be.
As it were, The Monitor actor LaMonica Garrett promised CBR that answers are on the way. "Each episode, they're gonna unpeel layers and layers of that onion as it goes along and as 'Crisis' begins, and that was one of my favorite things," he teased. "Lyla -- the name, they've had her around since Season 1 or 2 -- they've been laying breadcrumbs for years in the whole Arrowverse, and having that moment culminate with -- you know Lyla Michaels, just the significance of who she is and who she turns into -- seeing them meet together, that was great for me. It was a great payoff. They're going to dig more and more into that as each episode goes along, and especially when 'Crisis' starts."
According to the synopsis for "Reset," next week's episode, the show will certainly deal with the fallout of her betrayal: "After being double-crossed by Lyla (guest star Audrey Marie Anderson), Oliver (Stephen Amell) finds himself facing a life or death situation that seems very familiar. Laurel (Katie Cassidy) has the opportunity to make amends with the past."
Airing Tuesdays at 9 p.m. ET/PT on The CW, Arrow's final season stars Stephen Amell as Oliver Queen, David Ramsey as John Diggle, Rick Gonzalez as Wild Dog, Juliana Harkavy as Black Canary, Katie Cassidy as Black Siren, Katherine McNamara as Mia Smoak, Joseph David-Jones as Connor Hawke and Ben Lewis as William Clayton-Queen.
https://schema.orgBreadcrumbListListItem1Homehttps://www.cbr.com/ListItem2TVhttps://www.cbr.com/category/tv/ListItem3TV Newshttps://www.cbr.com/category/tv/news-tv/ListItem4Team Arrow Betrayed - But Not By Who You Thinkhttps://www.cbr.com/team-arrow-betrayed-lyla-michaels/


We work with clients around the world from our headquarters in Charleston, South Carolina. We focus on naming, branding, brand narratives, website design and development, and brand experiences.
UI has to make a huge visual difference between warning, an alert and a success.
Transformation has to be driven by everybody, not just by climate groups, and we have a responsibility to use our...
Transformation has to be driven by everybody, not just by climate groups, and we have a responsibility...


Get where you need to go in style, in
Futurgo™'s revolutionary
new personal transportation system!
The LTD® features sleek styling, ergonomic design and a
patent-pending drive train that really moves.
Experience the future in personal transportation... TODAY!
The World's First All-Electric Personal Vehicle.
Zero Emissions. 4.9 Sec 0-60 Max Acceleration.


--- title: "Default" description:
The Evolution UI grid is built using the power of Flexbox to achieve fluid layouts. The grid can thought of as an collection of Flexbox rows with varying numbers of columns. The
l-gridrow__gutters
class is used to add some spacing between each grid column. Remove it if no spacing between the columns are needed. Flexbox allows for some awesome functionality here in that we can add any number of columns to the grid and they will automatically adjust to evenly distribute themselves based on the amount of space they require. The code above gives a two-column grid row but we could easily add three more columns and create a five-column grid row. In cases where we need the columns to have differing widths, we can use the class .colX_of16
where X is a number between 1 and 16. This allows us to set the specific width of the columns we need.
type: grid
order: 1
---


This project allows you to practice the concepts and techniques learned in this module and apply them in a concrete project. This module explored lifecycle methods in class components. In your project you will demonstrate proficiency of these concepts by recreating the Github User Card project, but as a React application this time.
Read these instructions carefully. Understand exactly what is expected before starting this project.
Commit your code regularly and meaningfully. This helps both you and your team lead in case you ever need to return to old code for any number of reasons.
<firstName-lastName>
.
<firstName-lastName>
branch, committing changes regularly.
<firstName-lastName>
.
Follow these steps for completing your project.
This is an important step for any project you will be working on. You will want to plan out what data you will need, which component will manage that data via state, what functions you may need to update that state, and where you need to pass the data to render it to the DOM. I love to use pen and paper or a whiteboard for this. The visuals can help a lot when you’re deep into your code. After I finish that, I will write out a list of steps that I think it will take to build the app. This gives me a starting point, and direction as I proceed. This list always changes a bit as you are building, but it should give you a good flow and some good anchor points.
Also, since you have used the Github API before, you know some of the gotchas. Make sure to plan and watch for those.
When you have those completed, you’re ready to start coding!
Now that you have completed the MVP, I want you to think about the process it took you to get here. Is there anything you wish you had planned better? Anything you would do differently? Now take a minute think about how you would accomplish these same objectives with function components and hooks. You have experience with both formats now, so you can form opinions, but more importantly, you can back up those opinions. That’s a really exciting level to be at! If you have time now, go ahead and move onto the stretch problems.
After finishing your required elements, you can push your work further. These goals may or may not be things you have learned in this module but they build on the material you just studied. Time allowing, stretch your limits and see if you can deliver on the following optional goals:
Build a form that allows you to search for different Github users. When the form is submitted, use componentDidUpdate
to fetch the data for the user you typed in. Set that new user’s data to state to trigger the component to rerender and display your new user. Don’t forget to fetch their followers as well.
Look into adding your GitHub contribution graph. There are a number of different ways of doing this, this Stack Overflow discussion will get you started: https://stackoverflow.com/questions/34516592/embed-github-contributions-graph-in-website


We want to prove that our product works therefore we need you help. Just walk for ten minutes. We'll track your movement with our software. If you are moving we'll count down the time. After you walked ten minutes you should see a success message and you can type in your email address to win the $25 Amazon Gift card. We wish you best of luck.


jQuery Text Rotator in a sentence
the initial phrase.
jQuery Text Rotator sequentially
0
jQuery Text Rotator randomly
0


HTTP response splitting bugs are a relatively rare vulnerability class that allows an attacker to control the response of a vulnerable web server by splitting it and adding an additional response. Attackers use the additional response to perform different types of attacks such as cross user defacement, web cache poising, and cross site scripting (XSS).
HTTP response splitting vulnerabilities involve three common parties: the attacker, the vulnerable web server, and the target. The attacker uses the vulnerable server to carry the attack on the target. The target is usually an Internet browser client (in cases of XSS and cross user defacement) or a cache server (in cases of cache poisoning).
The first step in testing for HTTP response splitting vulnerabilities is to understand their attack scenarios. There are two common scenarios to execute an HTTP response splitting attack:
In addition, HTTP response splitting vulnerabilities can be used for any of the following payloads:
The first and most popular response splitting attack targets an Internet client browser and uses a redirect to accomplish the attack. In order to understand this scenario you must understand how a redirect works. A simple PHP redirect page (redirect.php) looks like this:
<?php
header ("Location: " . $_GET['page']);
?>
The following link redirects an Internet browser client to www.yahoo.com:
http://vulnsite.com/redirect.php?page=http://www.yahoo.com
When the client clicks on the link above, the browser sends the following request to the server:
GET http://vulnsite.com/redirect.php?page=http://www.yahoo.com HTTP/1.1
Host: vulnsite.com
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 6.0; es-ES; rv:<IP_ADDRESS>) Gecko/20080404 Firefox/<IP_ADDRESS>
Accept: text/xml,application/xml,application/xhtml+xml,text/html;q=0.9,text/plain;q=0.8,image/png,*/*;q=0.5
Accept-Language: es-es,es;q=0.8,en-us;q=0.5,en;q=0.3
Accept-Encoding: gzip,deflate
Accept-Charset: ISO-8859-1,utf-8;q=0.7,*;q=0.7
Keep-Alive: 300
Proxy-Connection: keep-alive
The redirect in the server responds with the following packet indicating the client that the resource has been moved:
HTTP/1.1 302 Found
Date: Tue, 13 May 2008 20:22:28 GMT
Server: Apache/2.2.6 (Win32) PHP/5.2.5
X-Powered-By: PHP/5.2.5
Location: http://www.yahoo.com
The client then sends a request to the address specified by the Location header:
GET http://www.yahoo.com:80/ HTTP/1.1
Host: www.yahoo.com
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 6.0; es-ES; rv:<IP_ADDRESS>) Gecko/20080404 Firefox/<IP_ADDRESS>
Accept: text/xml,application/xml,application/xhtml+xml,text/html;q=0.9,text/plain;q=0.8,image/png,*/*;q=0.5
Accept-Language: es-es,es;q=0.8,en-us;q=0.5,en;q=0.3
Accept-Encoding: gzip,deflate
Accept-Charset: ISO-8859-1,utf-8;q=0.7,*;q=0.7
During an HTTP response splitting attack the attacker sends a malicious link that will originate an additional response:
http://vulnsite.com/redirect.php?page=abc%0d%0aContent-Length:%200%0d%0a%0d%0aHTTP/1.1%20200%20OK%0d%0aContent-Type:%20text/html%0d%0aContent-Length:%2047%0d%0a%0d%0aAttacked!!!
The injected data can also be written like this:
abc\r\n
Content-Type: text/html\r\n
\r\n
HTTP/1.1 200 OK\r\n
Content-Type: text/html\r\n
\r\n
Attacked!!!
Now, when the client clicks on the malicious link above, the browser sends the following request to the server:
GET http://vulnsite.com/redirect.php?page=abc%0d%0aContent-Length:%200%0d%0a%0d%0aHTTP/1.1%20200%20OK%0d%0aContent-Type:%20text/html%0d%0aContent-Length:%2047%0d%0a%0d%0aAttacked!!!
Host: vulnsite.com
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 6.0; es-ES; rv:<IP_ADDRESS>) Gecko/20080404 Firefox/<IP_ADDRESS>
Accept: text/xml,application/xml,application/xhtml+xml,text/html;q=0.9,text/plain;q=0.8,image/png,*/*;q=0.5
Accept-Language: es-es,es;q=0.8,en-us;q=0.5,en;q=0.3
Accept-Encoding: gzip,deflate
Accept-Charset: ISO-8859-1,utf-8;q=0.7,*;q=0.7
Keep-Alive: 300
Proxy-Connection: keep-alive
The server responds with the following two packets instead of one. The server responds like this because it parses the double CR/LF after the Content - Length into a separate packet:
HTTP/1.1 302 Found
Date: Tue, 13 May 2008 20:22:28 GMT
Server: Apache/2.2.6 (Win32) PHP/5.2.5
X-Powered-By: PHP/5.2.5
Location: abc
Content-Length: 0
HTTP/1.1 200 OK (separate packet)
Content-Type: text/html
Content-Length: 47
Attacked!!!
The target browser now displays a page that says "Attacked!!!". The attacker can select more complex pages to use during the defacement such as a page that phishes for bank accounts or a cross-site scripting script that sends the victim’s session cookie to an attacker’s site.
During this scenario the attacker doesn’t need a redirect page. Many applications build response headers such as Set-Cookie or Location by reading data from a temporary store such as a URL parameter or a permanent store such as database. For example the following Java code sets a cookie by reading an ID value from a database:
SqlCommand sqlComm = new SqlCommand("SELECT userid FROM users WHERE username LIKE " + Request.QueryString["user"], sqlConn);
SqlDataReader sqlReader = sqlComm.ExecuteReader();
string userid = sqlReader.GetString("userid");
Cookie cookie = new Cookie("ID", userid);
response.addCookie(cookie);
If the user id has a normal value such as 10-300-565 the server sends a single response to the user.
HTTP/1.1 200 OK
...
Set-Cookie: id=10-300-565
...
However, the attacker can force the server to send additional responses by adding a double CR/LF to the database record :
10-300-5650d%0a%0d%0aHTTP/1.1%20200%20OK%0d%0aContent-Type:%20text/html%0d%0aContent-Length:%2047%0d%0a%0d%0aAttacked!!!
Forcing the server to reply like this:
HTTP/1.1 200 OK
...
Set-Cookie: id=10-300-565
Content-Length: 0
HTTP/1.1 200 OK (separate packet)
Content-Type: text/html
Content-Length: 47
Attacked!!!
This payload is seen in the previous two scenarios and consists of sending an additional page to the victim. The goal is trick victims into believing that the second response is legitimate and that they are safely browsing the original site. The attacker then modifies the second response for specific phishing purposes such a retrieving a username and password or a bank account and PIN number. The target browser parses the second response and it appears to the web client as if this response is coming from a legitimate server. The attack data used for this payload shows a second page (as seen above):
0d%0a%0d%0aHTTP/1.1%20200%20OK%0d%0aContent-Type:%20text/html%0d%0aContent-Length:%2047%0d%0a%0d%0aAttacked!!!
In response splitting vulnerabilities the second response is absolutely controlled by the attacker. The attacker can sent a split page with a script that executes in the context of victim. This leads to a cross-site scripting attack (XSS). The attack data may look like this:
0d%0a%0d%0aHTTP/1.1%20200%20OK%0d%0aContent-Type:%20text/html%0d%0aContent-Length:%2052%0d%0a%0d%0a
The payload of this attack is relatively harmless, just an alert box. More advanced payloads would include sending session credentials to a site controlled by the attacker.
This popular scenario doesn’t target an Internet browser client; its targets are web cache servers. The attacker makes the first request through the web cache server and receives the two split packets. The attacker then sends a second request to any resource. The cache server will match the second request with the split response (controlled by the attacker). This will propagate the attack to any users of the web cache server. The attack string manipulates cache-related headers:
%0d%0aContent-Type: text/html%0d%0a%0d%0aHTTP/1.1 200 OK%0d%0aLast-Modified: Wed, 13 Jan 2010%0d%0aContent-Type: text/html%0d%0a%0d%0ahey
The scenario follows these steps:
Setting the Last-Modified header to a future date makes the cache server return the attacker’s page instead of contacting the origin server to request the page from its valid domain. The attacker can also use the Cache-Control or the Pragma header to control how a cache server handles responses and updates its records.
This attack is achieved through a proxy server. The attacker needs to pay extra attention to timing since it needs to make a request at the correct time to get back a response that was previously made by a legitimate user. The scenario follows these specific steps:
The next step is to comprehend what causes HTTP response splitting vulnerabilities and how to defend against them. This knowledge will aid you in recognizing this attack class in the source codebase and use best coding practices.
HTTP protocol specifications indicate that each header is separated by a carriage return character (CR, ASCII 0x0D) followed by a line feed character (LF, ASCII 0x0A) represented as the string CR/LF . In addition, the response headers are separated by the body by two ( CR/LF/CR/LF).
HTTP response splitting attacks work by injecting CR/LF strings into HTTP headers. Web applications that build headers without checking for CR/LF are vulnerable to this attack. Failing to check data used for header construction and remove malicious CR/LF is what allows the attack and the cause of this vulnerability. It is important to note that, even victims of this attack are web clients, this is a server-side bug.
There is a simple solution for response splitting bugs: check the data in the headers before sending them to the client. Absolutely don’t write any data to the headers before checking the data for CR/LF characters ( %0d%0a ) and other HTTP special characters. An alternative approach is to have a white list that indicates the safe patterns to write to the headers. The server checks the data to be written to the header to see if it matches one of the white list’s safe patterns. The server allows the data into the header only if it matches one of the safe patterns while disallowing any data that doesn’t match a safe pattern.
This step focuses on executing a first round of test cases to find HTTP response splitting bugs.
Hardware Requirements: One client computer and one server computer running the web application.
Tools: Web browser, network monitoring tool (Wireshark).
Testing steps:
Expected results: the application is vulnerable to HTTP response splitting if the web server sends two HTTP responses (a 200 OK and 302 Redirect) and if the client browser displays the injected page.
Hardware Requirements: One client computer and one server computer running the web application.
Tools: Web browser, network monitoring tool (Wireshark), database client.
Testing steps:
Expected results: Same as first test case.
Hardware Requirements: One client computer and one server computer running the web application.
Tools: Web browser, network monitoring tool (Wireshark).
Testing steps:
Expected results: Same as first test case.
Hardware Requirements: One client computer and one server computer running the web application.
Tools: Web browser.
Testing steps:
Expected results: The test case fails if an alert box pops up.
Hardware Requirements: One client computer and one server computer running the web application.
Tools: Web browser, database client.
Testing steps:
Expected results: The test case fails if an alert box pops up.
Hardware Requirements: Two client computers, one web cache server computer, and one web application server. The two clients use the same web cache server.
Tools: Web browser.
Testing steps:
Expected results: The test case fails if the client B gets the injected response from step 2 to the request made in step 5.
Hardware Requirements: Two client computers, one web cache server computer, and one web application server. The two clients use the proxy server.
Tools: Web browser.
Testing steps:
Expected results: The test case fails if the client A gets the response to the confidential page requested by client B in step 4.
During this step you need to repeat the test cases from the previous step while tuning the test case data per entry point and making sure to split the responses by finishing the first HTTP response. The format of test case data varies depending on the entry point used to submit it. For example, if you are testing through the URL the next two strings are equivalent depending on the URL-encoding schema in use:
%0d%0aContent-Type:%20text/html%0d%0aHTTP/1.1%20200%20OK%0d%0aContent-Type:%20text/html%0d%0aContent-Length:%2047%0d%0a%0d%0a%3Chtml%3E%3Cfont%20color=red%3EAttacked!!%3C/font%3E%3C/html%3E
%0d%0aContent-Length:%200%0d%0a%0d%0aHTTP/1.1%20200%20OK%0d%0aContent-Type:%20text/html%0d%0aContent-Length:%2047%0d%0a%0d%0aAttacked!!!
Similarly, you must tune test data depending on the data format of any of these possible entry points such as redirect pages, URL parameters, web form input fields, web service methods, environment variables, and database contents.
A challenge in HTTP response splitting testing is to be able to tell the web server to terminate the original response and start the split one. Some web servers have a minimum required length for a response. This means that responses cannot be smaller than a certain size. You must tune the injected data to pad the first response so that the server knows to finish it and start a new one. Other web application servers will finish the response if the Content-Length is set to zero.
HTTP resource splitting is an attack class that facilitates different attacks such as phishing, XSS, and web cache poisoning. Testing for resource splitting bugs needs to cover all these different attacks. It is important that you understand attack scenarios and to execute each test case in detail. Finally make sure to cover all entry points and fine-tune the test data according to their format.